computer-science
Zero-Knowledge: Turning Computation into Polynomials (Part 1/3)
From a program to a few polynomial equations: how SNARKs encode computation through flattening, R1CS, and the QAP transformation
Verkle Trees: Polynomial Commitments (Part 2/2)
How a single curve point can commit to 256 children, and why proofs shrink from kilobytes to bytes
Ethereum's Merkle Patricia Trie (Part 1/2)
How Ethereum stores its state, commits it to a single hash, and why that design is hitting its limits
What It Means to Be Turing Complete (Part 2/3)
Why brains and AI are 'approximate Turing machines'
What is a Turing Machine? (Part 1/3)
The elegant abstraction that defines what it means to compute