Hash-based SNARKs are becoming central to Ethereum’s post-quantum roadmap, but how secure are they, really? In this episode (part 3 of the @leanEthereum miniseries), @nico_mnbl chats with @GiacomoFenzi and @asanso to examine the theory and security of post-quantum SNARKs. They cover: – The SNARK stack behind LeanVM (multilinear arithmetization + sum-check) – The $1M Proximity Gap Prize and the wave of new research it triggered – How recent results affect security margins for hash-based proof systems – Why Ethereum is moving toward provable security regimes for long-term protocol safety They also explore open problems in coding theory, list decoding, and hash-based proof systems. Listen to the full episode —----- TIMECODES 02:24 – Why Ethereum needs post-quantum SNARKs 03:30 – The LeanVM SNARK stack (multilinear + sum-check) 04:53 – The $1M Proximity Gap Prize 12:04 – The wave of new research papers 12:52 – Johnson bound vs capacity bound 21:24 – New attack analysis on deployed STARKs 27:07 – Why the 128-bit security threshold matters 30:26 – Open research questions in post-quantum SNARKs