Part 1 of a Zinc+ walkthrough — building UCS and the three-step PIOR that arithmetizes XOR, rotation, and modular arithmetic natively via ideal-membership over polynomial rings

Part 2 of a Zinc+ walkthrough — building Zip+ on top of Integer Pseudo Reed–Solomon codes, living in the list-decoding regime via MCA, and compiling to a hash-only SNARK

A walkthrough of PlasmaBlind, a private UTXO Layer-2 where the client never runs a zkSNARK — they fold a witness with random noise in ~32ms and ship it.

Part 2 of the Zinc walkthrough. We build Zip — a Brakedown-style PCS over ℚ — from an IOP of Proximity to the Integers and a JEA linear code that survives the move from 𝔽_q.

Part 1 of a walkthrough of Zinc, a hash-based SNARK that proves integer arithmetic statements with almost no arithmetization overhead. This part builds the Zinc-PIOP framework — a PIOP over the rationals built from a collection of PIOPs over finite fields.

A walkthrough of WHIR — an IOP of proximity for constrained Reed-Solomon codes that drops hash-based SNARK verification from milliseconds to a few hundred microseconds

Part 2 of the TensorSwitch walkthrough — how the linear-query protocol from Part 1 gets compiled into a real PCS via recursion, what right-extensions are, and the full efficiency numbers

Part 1 of a walkthrough of TensorSwitch, a hash-based PCS that cracks two long-standing bottlenecks in hash-based SNARGs. This part builds the core protocol in an idealized linear query model.

How SPARK makes Spartan practical — a sparse polynomial commitment scheme that scales with non-zero entries, not matrix dimensions.

A deep dive into how Spartan achieves transparent, general-purpose zkSNARKs using sum-check and polynomial commitments — no trusted setup required.

A step-by-step interactive walkthrough of the Schnorr identification protocol.

ZK-based fork-choice enforced inclusion lists for Ethereum — implementation details and performance benchmarks.