# Lattices, Folding, & Symphony with Binyi Chen

Page: https://stenobird.com/podcast/zero-knowledge-1048106/lattices-folding-symphony-with-binyi-chen
Text version: https://stenobird.com/podcast/zero-knowledge-1048106/lattices-folding-symphony-with-binyi-chen.md
Podcast: [Zero Knowledge](https://stenobird.com/podcast/zero-knowledge-1048106)
Published: 2025-11-19T13:00:00+00:00
Episode link: https://zeroknowledge.fm/podcast/385
Audio file: https://episodes.captivate.fm/episode/00d14c9f-2f8a-4c6b-a922-7703937a6ac3.mp3
Processing state: not_requested
JSON: https://stenobird.com/v1/public/podcasts/zero-knowledge-1048106/episodes/lattices-folding-symphony-with-binyi-chen
Duration seconds: 3932

## Resource

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 on Fiat-Shamir BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes Blaze: Fast SNARKs from Interleaved RAA Codes Neo: Lattice-based fo…

## Actions

- request_transcript: `POST https://stenobird.com/v1/public/podcasts/zero-knowledge-1048106/episodes/lattices-folding-symphony-with-binyi-chen/transcription-requests` — Idempotently request low-priority transcript generation for this episode.
- read_markdown: `GET https://stenobird.com/podcast/zero-knowledge-1048106/lattices-folding-symphony-with-binyi-chen.md` — Read the agent-friendly Markdown representation of this episode resource.

A page view does not enqueue transcription. Agents should invoke `request_transcript` explicitly when they need this episode processed.

## Transcript

Full transcripts are not published on public pages unless there is a clear rights basis.