Finite Field Assembly (FF-asm) is a programming language founded on the thesis: Math is mostly invented, rarely discovered. For instance, binary

Emulating a GPU on a CPU using Finite Field Assembly

submited by

Style Pass

2025-01-13 04:00:04

Finite Field Assembly (FF-asm) is a programming language founded on the thesis: Math is mostly invented, rarely discovered.

For instance, binary digits (0 and 1) fall into the category of discovered math, while concepts like 2’s complement, fixed-point arithmetic, and floating-point arithmetic are examples of invented math.

Finite Field Assembly’s main feature is recursive computing : it’s not vectorization, not parallelization, but performing a calculation inside a calculation inside another calculation.

This tutorial guides us through constructing a custom finite field that supports addition and multiplication using unsigned 8-bit integers in FF-asm.

658 : This is a unique integer that represents your specific the set of finite field elements. It is the solution to a linear congruence.

Recursive computing is a first-class feature in Finite Field Assembly (FF-asm) . We use the mathematical theory of congruences and primes to perform lots of different calculations at the same time.