Live data from Hacker News

Finite Field Assembly: A Language for Emulating GPUs on CPU

leetarxiv.substack.com

1–10 of 35 posts

Re: Finite Field Assembly: A Language for Emulating GPUs on CPU

#2
Introduction : Finite Field Assembly is a programming language that lets you emulate GPUs on CPUs

It's a CUDA alternative that uses finite field theory to convert GPU kernels to prime number fields.

Finite Field is the primary data structure : FF-asm is a CUDA alternative designed for computations over finite fields.

Recursive computing support : not cache-aware vectorization, not parallelization, but performing a calculation inside a calculation inside another calculation.

Extension of C89 - runs everywhere gcc is available. Context : I'm getting my math PhD and I built this language around my area of expertise, Number Theory and Finite Fields.

Re: Finite Field Assembly: A Language for Emulating GPUs on CPU

#3

Introduction : Finite Field Assembly is a programming language that lets you emulate GPUs on CPUs It's a CUDA alternative that uses finite field theory to convert GPU kernels to prime number fields. Finite Field is the primary data structure : FF-asm is a CUDA alternative designed for computations over finite fields. Recursive computing support : not cache-aware vectorization, not parallelization, but performing a ca…

I've read this and I've seen the site, and I still have no idea what it is, what's the application and why should I be interested.

Additionally I've tried earlier chapters and they are behind a paywall.

You need a better introduction.

Re: Finite Field Assembly: A Language for Emulating GPUs on CPU

#7
If matrix multiplication does get added to this, I imagine that there is some utility for game development. At that point, I'd be curious what the comparison would be from CPU to GPU. Like, given a clock speed of x, what would a comparable GPU (or set of GPU features) look like?

I know that's pretty abstract, but without that kind of "apples to apples" comparison, I have trouble contextualizing what kind of output is bring targeted with this kind of work.

Re: Finite Field Assembly: A Language for Emulating GPUs on CPU

#8
post #3

Introduction : Finite Field Assembly is a programming language that lets you emulate GPUs on CPUs It's a CUDA alternative that uses finite field theory to convert GPU kernels to prime number fields. Finite Field is the primary data structure : FF-asm is a CUDA alternative designed for computations over finite fields. Recursive computing support : not cache-aware vectorization, not parallelization, but performing a ca…

I've read this and I've seen the site, and I still have no idea what it is, what's the application and why should I be interested. Additionally I've tried earlier chapters and they are behind a paywall. You need a better introduction.

[deleted]

Re: Finite Field Assembly: A Language for Emulating GPUs on CPU

#9
post #3

Introduction : Finite Field Assembly is a programming language that lets you emulate GPUs on CPUs It's a CUDA alternative that uses finite field theory to convert GPU kernels to prime number fields. Finite Field is the primary data structure : FF-asm is a CUDA alternative designed for computations over finite fields. Recursive computing support : not cache-aware vectorization, not parallelization, but performing a ca…

I've read this and I've seen the site, and I still have no idea what it is, what's the application and why should I be interested. Additionally I've tried earlier chapters and they are behind a paywall. You need a better introduction.

This is phrased in a kind of demanding way to an author who has been kind enough to share their novel work with us. Are you sure you spent enough time trying to understand?

Re: Finite Field Assembly: A Language for Emulating GPUs on CPU

#10
It's a bit hard for me to tell the intention here. Is the idea that finite fields can take better advantage of CPU architecture than something like SIMD for parallel computation? Or is this just for experimentation?

Edit: this tickles my brain about some similar seeming sort of programming language experiment, where they were also trying to express concurrency (not inherently the same as parallelism) using some fancy math. I can't remember what it was though?

Post reply on HN