←back to thread

40 points muragekibicho | 3 comments | | HN request time: 0s | source
Show context
muragekibicho ◴[] No.42695415[source]
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.

replies(2): >>42744591 #>>42744891 #
zeroq ◴[] No.42744591[source]
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.

replies(2): >>42744748 #>>42744814 #
1. pizza ◴[] No.42744814[source]
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?
replies(1): >>42744892 #
2. Conscat ◴[] No.42744892[source]
It seems that pretty much everybody here is confused by this article. One user even accused it of LLM plagiarism, which is pretty telling in my opinion.

I for one have no clue what anything I read in there is supposed to mean. Emulating a GPU's semantics on a CPU is a topic which I thought I had a decent grasp on, but everything from the stated goals at the top of this article to the example code makes no sense to me.

replies(1): >>42744998 #
3. pizza ◴[] No.42744998[source]
It just seems like residue numbering systems computation, which I'm already working with.