Topic Tag

Tag: FRI

4 published articles in this collection.

Modern Cryptography & Zero-Knowledge Proofs (Part 16): Post-Quantum Cryptography: Shor’s Threat & Lattice Hardness (SVP, CVP, LWE)

Shor's quantum period-finding algorithm, geometry of numbers, Shortest Vector Problem (SVP), and Learning With Errors (LWE).

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 15): Recursive Proofs & Folding Schemes: Halo2, Nova & HyperNova

Incrementally Verifiable Computation (IVC), cycle of elliptic curves (Pasta), recursive SNARK verifiers, and Nova non-interactive folding schemes.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 14): Transparent Proofs: zk-STARKs, The FRI Protocol & Hash Soundness

Eliminating trusted setups, algebraic intermediate representations (AIR), Reed-Solomon proximity testing, and the Fast Reed-Solomon IOP of Proximity (FRI).

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 13): Universal zk-SNARKs: Plonk, Permutation Arguments & Plookup

Universal and updatable trusted setups, gate identity polynomials, grand product permutation arguments, and lookup arguments (Plookup).

Nov 9, 2026 • 3 min read

Modern Cryptography & Zero-Knowledge Proofs (Part 16): Post-Quantum Cryptography: Shor’s Threat & Lattice Hardness (SVP, CVP, LWE)

Modern Cryptography & Zero-Knowledge Proofs (Part 15): Recursive Proofs & Folding Schemes: Halo2, Nova & HyperNova

Modern Cryptography & Zero-Knowledge Proofs (Part 14): Transparent Proofs: zk-STARKs, The FRI Protocol & Hash Soundness

Modern Cryptography & Zero-Knowledge Proofs (Part 13): Universal zk-SNARKs: Plonk, Permutation Arguments & Plookup

Learner Portal & Sync

Enrolled Academic Curricula (43 Disciplines)

My Earned Credentials

The Great Equations (MATH-101)

Loading question...