Lattices, Folding, & Symphony with Binyi Chen episode artwork

EPISODE · Nov 19, 2025 · 1H 5M

Lattices, Folding, & Symphony with Binyi Chen

from Zero Knowledge

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 WebsiteLatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof SystemsLatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof SystemsSymphony: Scalable SNARKs in the Random Oracle Model from Lattice-Based High-Arity FoldingProtostar: Generic Efficient Accumulation/Folding for Special-sound ProtocolsZK Whiteboard Sessions:SEASON 3 MODULE 3: Lattice-based SNARKs, w/ Vadim LyubashevskyZK Whiteboard Sessions:SEASON 3 MODULE 4: LatticeFold, w/ Binyi ChenImplementing LatticeFold with Matthew and Albert from NethermindLattice-based ZK Systems with Vadim Lyubashevsky   Further Reading Generating Hard Instances of Lattice Problems by M. Ajtai SWIFFT: A Modest Proposal for FFT HashingDelegating Computation: Interactive Proofs for MugglesHow to Prove False Statements: Practical Attacks on Fiat-ShamirBaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable CodesBlaze: Fast SNARKs from Interleaved RAA CodesNeo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitmentsLaBRADOR: Compact Proofs for R1CS from Module-SIS?     Aztec is a privacy-first Layer 2 on Ethereum supporting smart contracts with both private and public state and execution.    Details about Aztec’s technology, research, and community programmes are available at aztec.network.     Check out the latest jobs in ZK at the ZK Podcast Jobs Board.      **If you like what we do:** * Find all our links here! @ZeroKnowledge | Linktree * Subscribe to our podcast newsletter * Follow us on Twitter @zeroknowledgefm * Join us on Telegram * Catch us on YouTube **Support the show:** * Patreon * ETH - Donation address * BTC - Donation address * SOL - Donation address * ZEC - Donation address Read transcript

Episode metadata supplied by the publisher feed · Published Nov 19, 2025

Embed this episode

NOW PLAYING

Lattices, Folding, & Symphony with Binyi Chen

0:00 1:05:32

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Zero Knowledge?

This episode is 1 hour and 5 minutes long.

When was this Zero Knowledge episode published?

This episode was published on November 19, 2025.

Can I download this Zero Knowledge episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!