https://youtu.be/v8SGKS3T-3A In this episode, Nico Mohnblatt speaks with Giacomo Fenzi from EPFL and Antonio Sanso from the Ethereum Foundation. For this 3rd instalment of the lean Ethereum miniseries, they talk about the theory and security behind post-quantum SNARKs. They dive into the hash-based proof systems underpinning LeanVM, multilinear approaches like sumcheck, and how these fit into Ethereum's post-quantum upgrades. They cover the $1M Proximity Prize and the recent wave of papers on proximity gaps, correlated agreement, and list decoding. From negative results near the Elias bound to breakthroughs beyond the Johnson bound for certain codes, the discussion explores how new results slightly degrade conjectural security, why the 128-bit threshold still matters, and what it means to move from conjectural to provable security in large-scale systems like Ethereum.

Additional Resources

Applications to speak at zkSummit14 are now open! This edition will be more intimate with limited spots — we recommend applying early. Apply at www.zksummit.com zkMesh+ live! Subscribe for zkMesh+ and catch the latest State of ZK 2025 report.

**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

Related Links

Additional Resources