←back to thread

Finite Field Assembly: A Language for Emulating GPUs on CPU

(leetarxiv.substack.com)
40 points muragekibicho | 1 comments | 14 Jan 25 09:35 UTC | HN request time: 0.001s | source
Show context
muragekibicho ◴[14 Jan 25 09:35 UTC] 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 #
almostgotcaught ◴[18 Jan 25 01:15 UTC] No.42744891[source]▶
> I'm getting my math PhD and I built this language around my area of expertise, Number Theory and Finite Fields.

Your LinkedIn says you're an undergrad that took a gap year 10 months ago (before completing your senior year) to do sales for a real estate company.

replies(3): >>42744913 #>>42744997 #>>42745020 #
1. saghm ◴[18 Jan 25 01:37 UTC] No.42744997[source]▶
Depending on what properties they sold, they certainly could have gotten valuable real-world expertise with finite fields. It's certainly easier to sell them than infinite ones!