About this episode
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.
Related Links
lean Ethereum Part 1: Introduction with Justin Drakelean Ethereum Part 2: PQ Signatures and Poseidon with Dmitry and Benediktlean EthereumLean Consensus R&D ProgressleanSig ImplementationPoseidon2: A Faster Version of the Poseidon Hash FunctionOn Proximity Gaps for Reed–Solomon CodesProximity Gaps in Interleaved Codes
