Introduction

This is a preliminary report on Finite Field Assembly (FF-ASM), a programming language designed to emulate GPUs on regular CPUs using Number Theory and Finite Field Theory.

Finite Field Assembly (FF-ASM) empowers programmers to utilize Number Theory to invent their own math and solve their most immediate tasks.

Use Cases

Matrix multiplications for Artificial Intelligence.
Emulate GPU-level parallelization on regular CPUs in specific cases.
Error-correction coding for Communications.

Finite Field Assembly Language Features

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.
- Recursive computing - performing one outer calculation lets you perform several inner calculations at the same time.
Extension of C89 - runs everywhere gcc is available.
Low-level systems language - no garbage collector so user handles memory allocation.
Syntax for Finite Field Assembly

Is AI Compute a Hardware or a Software Problem

Sam Altman, the CEO of OpenAI, believes that access to computational resources will become the world's most valuable commodity. His views align with the growing demand for AI and machine learning capabilities among consumers and businesses. A multitude of companies offer hardware-first solutions to satisfy this demand for compute.

The market is saturated with hardware startups focused on delivering compute power for the next generation of AI inference. Custom hardware like Nvidia's GPUs, Groq's TPUs, and Etched's Transformer ASICs aim to address this growing demand for computational resources.

But what if hardware isn't the real bottleneck? Perhaps all our calculations are correct, and the issue lies in the possibility that we're computing in the wrong number system?

**Meme highlighting the absurd nature of modern-day compute**

Finite Field Assembly: A Language for Inventing Your Own Mathematics

Finite Field Assembly is built on the thesis that mathematics is largely invented rather than discovered. For example, while binary digits (0 and 1) are discovered concepts, binary floating-point arithmetic—the mathematical framework for storing fractions on computers—is entirely invented.

Finite Field Assembly is a programming language desi...

Posts

Wikitag Contributions

Comments