Learn
What is the Periodic Stack?
From Landauer's principle to 258 primitives. Ten minutes, interactive, no math required.
For the full course with videos, see /course.
A bit is simple.
It's a 0 or a 1. Your computer has billions of them. Every computation moves, copies, combines, and sometimes erases bits.
TAP TO FLIP
Erasing a bit costs energy.
In 1961, Rolf Landauer proved it. When you overwrite a bit — destroy its previous value — physics demands a minimum energy cost of kT ln 2 joules.
That's about 3 × 10⁻²¹ joules. Tiny. But non-negotiable. It's the thermodynamic floor.
A thousand times above the floor. That gap is where all the waste lives.
But not every operation erases.
Some operations just rearrange information. They're bijective — one input maps to one output, with no loss. For those, the physical floor is zero.
FFT, scatter/gather, bitwise logic, permutation, NTT — all bijective. All theoretically free.
Every operation has six coordinates.
Mendeleev used two axes for the chemical elements: atomic number and family. Computation is richer. Every operation in the stack has six independent properties.
258 primitives. 33 families. 36 free.
Every computation decomposes into 258 irreducible operations — positioned in that 6-dimensional coordinate space. After eight survey waves spanning every major branch of mathematics, this is the complete enumeration as of April 2026.
- 36 are L₀ (free) — bijective operations with zero thermodynamic floor
- 29 already have dedicated silicon — the corridor every modern chip lives in
- 229 are hardware gaps — known math, no chip yet
- 30 of those gaps are L₀ free ops — thermodynamically free, zero shipping silicon
Two-thirds of the stack has no hardware.
When you map every modern chip against the stack, they all cover the same ~30 primitives. Apple, Google, Groq, AMD, Intel, Tenstorrent — six different architectures, converging on the same corridor.
The other 229 primitives — entire mathematical families like noncommutative geometry, lattice gauge theory, persistent homology, post-quantum cryptography, computational topology — have no dedicated silicon anywhere. 25 of 33 families have zero hardware. Uncharted territory.
The stack is executable.
Give it a goal. It returns the ordered list of hardware you need to build, from leaves up, with each primitive's thermodynamic cost and dependency status.
It's called the recursive inversion function: f(goal) → gaps. This is the thing no other field has — chemistry gave us a table, but the Periodic Stack gives us a function.
Next
Go deeper.
Take the full course with videos, explore all 258 primitives in the interactive instrument, or run the recursive inversion on your own goal.