Zero Knowledge Lattices, Folding, & Symphony with Binyi Chen
Nov 19, 2025
Binyi Chen, a Stanford postdoctoral researcher, specializes in lattice-based folding schemes and SNARK research. He discusses the evolution of LatticeFold and LatticeFold+, and how replacing traditional hashes with Ajtai commitments enables post-quantum security. Binyi introduces his innovative work, Symphony, which simplifies recursive verification circuits and enhances efficiency. He explores the advantages of lattices over hash-based methods, the challenges of adapting folding to lattice structures, and potential future advancements in lattice SNARK technologies.
AI Snips
Chapters
Books
Transcript
Episode notes
Why Post‑Quantum Folding Needed New Commitments
- Early folding schemes used Pedersen (elliptic-curve) commitments which rely on discrete-log assumptions broken by quantum attacks.
- That motivated seeking post-quantum alternatives like lattice-based commitments (Ajtai/SIS).
Hash vs Lattice: Prover vs Verifier Tradeoffs
- Hash-based folding is mature and robust versus quantum attacks and gives efficient provers via Merkle commitments.
- Lattice folding offers algebraic structure and much smaller verifier circuits, making it promising for recursion.
Lattice Commitments Require Norm Control
- Lattice (Ajtai) commitments are more restricted: openings must be low‑norm vectors to be secure.
- Folding must control norm blowup and prove low norms, adding protocol complexity.
