Lattices, Folding, & Symphony with Binyi Chen

In this episode Anna Rose and Nico Mohnblatt chat with Binyi Chen, researcher at Stanford University. They discuss his work on lattice-based folding schemes, revisit LatticeFold and LatticeFold+, and cover how lattices enable low-cost, post-quantum-secure folding by replacing Pedersen hashes with Ajtai commitments. They discuss the early folding work from 2023 and how it has evolved and explore the advantages of lattices over other approaches in the folding context while also highlighting their tradeoffs. Binyi goes on to introduce Symphony, his new work that eliminates the need to implement Fiat-Shamir in the recursive verification circuit, and describes how that improves efficiency and removes the chances for a KRS-style attack. Related Links

• Binyi Chen’s Website
• LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems
• LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
• Symphony: Scalable SNARKs in the Random Oracle Model from Lattice-Based High-Arity Folding
• Protostar: Generic Efficient Accumulation/Folding for Special-sound Protocols
• ZK Whiteboard Sessions:SEASON 3 MODULE 3: Lattice-based SNARKs, w/ Vadim Lyubashevsky
• ZK Whiteboard Sessions:SEASON 3 MODULE 4: LatticeFold, w/ Binyi Chen
• Implementing LatticeFold with Matthew and Albert from Nethermind
• Lattice-based ZK Systems with Vadim Lyubashevsky

Further Reading

• Generating Hard Instances of Lattice Problems by M. Ajtai
• SWIFFT: A Modest Proposal for FFT Hashing
• Delegating Computation: Interactive Proofs for Muggles
• How to Prove False Statements: Practical Attacks...