Zero Knowledge Podcast Por Zero Knowledge Podcast arte de portada

Zero Knowledge

Zero Knowledge

De: Zero Knowledge Podcast
Escúchala gratis

Zero Knowledge is a podcast which goes deep into the tech that will power the emerging decentralised web and the community building this. Covering the latest in zero knowledge research and applications, the open web as well as future technologies and paradigms that promise to change the way we interact — and transact — with one another online. Zero Knowledge is hosted by Anna Rose Follow the show at @ZeroKnowledgefm (https://twitter.com/zeroknowledgefm) or @AnnaRRose (https://twitter.com/AnnaRRose) If you like the Zero Knowledge Podcast: Join us on Telegram (https://t.me/joinchat/TORo7aknkYNLHmCM) Support our Gitcoin Grant (https://gitcoin.co/grants/38/zero-knowledge-podcast) Support us on Patreon (https://www.patreon.com/zeroknowledge) Or directly here: ETH: 0x4BF66E52f3009Cd138e48f142D47661037160001 BTC: 1cafekGa3podM4fBxPSQc6RCEXQNTK8Zz ZEC: t1R2bujRF3Hzte9ALHpMJvY8t5kb9ut9SpQ DOT: 14zPzb7ihiBeaUn9jdPW9cHKGBd9qtTuJE75hhW2CvzLh6rT© 2025 Zeroknowledge Ciencia Matemáticas
Episodios
  • lean Ethereum Part 4: leanVM, a Custom VM for Signature Aggregation
    Mar 11 2026
    https://youtu.be/YWkyvTrwtQU

    In this episode of the lean Ethereum miniseries, Nico Mohnblatt speaks with Thomas Coratger and Emile from the Ethereum Foundation about the design and implementation of LeanVM, a minimal zkVM created to support post-quantum signature aggregation on Ethereum’s consensus layer. They explain why the team chose a VM architecture over fixed circuits and how LeanVM takes inspiration from Cairo with just 4 opcodes and 2 precompiles to keep the instruction set extremely small and make formal verification easier.

    The conversation also covers LeanVM implementation choices like using Plonky3 and WHIR for efficient proving on CPUs, benchmarks for aggregation speed, and the role of Python specs in testing client interop. They share ongoing efforts to optimize low-level primitives and invite community input on the project.

    Related Links
    • lean Ethereum Part 1: Introduction with Justin Drake
    • lean Ethereum Part 2: PQ Signatures and Poseidon with Dmitry and Benedikt
    • lean Ethereum Part 3: Security of PQ SNARKs and an update about the Proximity Prize
    • lean Ethereum
    • Lean Consensus R&D Progress
    • Cairo zkVM
    • WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification
    • Minimal zkVM for Lean Ethereum by Emile

    Repos
    • leanEthereum github organization
    • leanSig repo (optimized Rust implementation of XMSS for Ethereum usage)
    • leanSpec repo (the Python spec of the lean consensus)
    • WHIR repo
    • Plonky3 repo
    • leanVM

    Applications to speak at zkSummit14 close this Sunday March 15! 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
    Más Menos
    33 m
  • lean Ethereum Part 3: Security of PQ SNARKs and an update about the Proximity Prize
    Mar 4 2026
    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 CodesOn Reed–Solomon Proximity Gaps ConjecturesOptimal Proximity Gaps for Subspace-Design Codes and (Random) Reed-Solomon CodesAll Polynomial Generators Preserve Distance with Mutual Correlated Agreement Additional Resources Soundcalc GitHubProximity prizeOn the Distribution of the Distances of Random WordsSmall-field hash-based SNARGs are less sound than conjectured by Fenzi and SansoWHIR: Reed–Solomon Proximity Testing with Super-Fast VerificationSTIR: Reed–Solomon Proximity Testing with Fewer QueriesLinear-Time Accumulation SchemesTensorSwitch 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
    Más Menos
    37 m
  • lean Ethereum Part 2: PQ Signatures and Poseidon with Dmitry and Benedikt
    Feb 25 2026
    https://www.youtube.com/watch?v=xh8hbz1nqxQ In this episode, Nico Mohnblatt speaks with Benedikt Wagner and Dmitry Khovratovich, cryptography researchers at the Ethereum Foundation, for the second instalment of the lean Ethereum miniseries. They explore leanSig, a hash-based multi-signature scheme designed as a post-quantum replacement for BLS in Ethereum consensus. The conversation walks through how one-time signatures and Merkle trees can be combined to support long-lived validators, and why SNARK-based aggregation is needed in a post-quantum setting. The talk touches on key tradeoffs like signature size versus verification speed, encoding challenges behind their At the Top of the Hypercube work, and the role of Poseidon as the core hash function. Related Links
    • lean Ethereum Part 1: Introduction with Justin Drake
    • lean Ethereum
    • Lean Consensus R&D Progress
    • leanSig Implementation
    • Poseidon2: A Faster Version of the Poseidon Hash Function
    • At the Top of the Hypercube – Better Size-Time Tradeoffs for Hash-Based Signatures
    • Hash-Based Multi-Signatures for Post-Quantum Ethereum
    • Technical Note: LeanSig for Post-Quantum Ethereum
    • Aborting Random Oracles: How to Build them, How to Use them
    • The Billion Dollar Merkle Tree
    • Poseidon: A New Hash Function for Zero-Knowledge Proof Systems
    • Poseidon Cryptanalysis Initiative

    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....
    Más Menos
    35 m
Todavía no hay opiniones