Episodes

  • Generative Cryptography, AI & Scaling Trust with Nicola Greco
    Nov 18 2026
    This week, Anna and Nico are joined by Nicola Greco, Technical Advisor at the UK's Advanced Research and Invention Agency (ARIA), to explore the intersection of AI and cryptography. They discuss how AI could threaten cryptography across the entire stack, from implementations and protocols to underlying security assumptions, and why cryptographic resilience is becoming increasingly important. The conversation then turns to the opportunities AI creates for cryptography, including secure agent coordination, generative cryptography and formal AI security. Nicola shares his vision for agents that can design their own cryptographic protocols, the challenges of verifying AI-generated constructions, and how ARIA's Scaling Trust programme is supporting research into these emerging fields. Related Links
    • Nicola Greco Writing Archive
    • Generative Cryptography — Nicola's July blog post outlining how AI could improve and invent cryptographic protocols
    • QuantumPunks Website
    • Scaling Trust Website
    • ARIA Scaling Trust programme
    • Can AI Oversight Be Proven in Zero Knowledge?
    • Yukon.org
    • ECDSA.fail
    • ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor’s Algorithm
    • ZK Podcast Episode 32: Zero Knowledge at Zcon0!
    • ZK Podcast Episode 360: Quantum Punks with Alex and Nicola
    • ZK Podcast Episode 411: Auto Research on Yukon with Soubhik Deb
    • ZK Podcast Episode 414: zkGolf: AI, Clean and Optimising ZK Circuits with zkSecurity
    • ZK Podcast Episode 416: When Math Meets Auto Research with Bartosz Naskręcki

    Sovright builds the critical infrastructure that preserves your right to choose. Discover more at sovright.com. **If you like what we do:** * Consider becoming a zkMesh+ Subscriber * Subscribe to our podcast newsletter * Follow us on Twitter @zeroknowledgefm * Join us on Telegram * Catch us on YouTube Read transcript
    Show More Show Less
    1 hr and 12 mins
  • When Math Meets Auto Research with Bartosz Naskręcki
    Nov 11 2026
    This week, Anna and Tarun are joined by Bartosz Naskręcki, mathematician and professor at Adam Mickiewicz University and researcher at the Centre for Credible AI, to explore how AI agents are transforming mathematical research. Bartosz shares his background in algebraic geometry and cryptography, and how he became involved in the ECDSA.fail competition. They discuss auto-research, the kinds of problems best suited to agent-driven exploration, and how collaborative competitions can accelerate discovery. The conversation then turns to recent AI breakthroughs in mathematics, the challenges of verifying AI-generated proofs using tools like Lean, and the risk of AI research slop. Bartosz reflects on the changing role of mathematical intuition, the importance of keeping humans in the loop, and what these advances mean for the future of mathematics and the next generation of researchers. Related Links
    • Yukon.org
    • ECDSA.fail
    • ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor’s Algorithm
    • Proving at Scale for Universal Algebra
    • Mathematical discovery in the age of artificial intelligence
    • AI Grinding for Fun and Cryptanalysis
    • Bartosz Naskręcki – Full Publication List
    • FrontierMath: Benchmarking AI against advanced mathematical research
    • Leiden Declaration on Artificial Intelligence and Mathematics
    • ZK Podcast Episode 411: Auto Research on Yukon with Soubhik Deb

    New from the Zero Knowledge Podcast and Succinct: the 2026 ZK Industry Report, a snapshot of ZK’s tech, research and real-world adoption. Free at zeroknowledge.fm/zk-industry-report-2026 **If you like what we do:** * Consider becoming a zkMesh+ Subscriber * Subscribe to our podcast newsletter * Follow us on Twitter @zeroknowledgefm * Join us on Telegram * Catch us on YouTube Read transcript
    Show More Show Less
    1 hr and 16 mins
  • From Nova to Magnetar: Three Years of Research with Srinath Setty
    Oct 28 2026
    This week, Anna and Nico catch up with Srinath Setty, researcher at Microsoft. They look back at his research since his work on Nova, spanning lattice-based folding, zero-knowledge identity proofs, and lookups and memory checking, much of which traces back to his 2019 work, Spartan. The bulk of the conversation is on Magnetar, his newly released zkVM. Built only on standard hash functions, it aims to be among the most secure general-purpose zkVMs, and it also turned out to be dramatically faster than many existing systems. Srinath explains how it’s put together, where the speed comes from, and what’s still left to build. Related links:
    • Magnetar: High-speed post-quantum RV64 zkVM from standard hashes
    • Proof-based general-purpose computing with Magnetar(Microsoft Research blog)
    • BinarySpartan: Spartan over binary fields
    • Spartan: Efficient and general-purpose zkSNARKs without trusted setup
    • Neo and SuperNeo: Post-quantum folding with pay-per-bit costs over small fields
    • LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems
    • Vega: Low-Latency Zero-Knowledge Proofs over Existing Credentials
    • Unlocking the lookup singularity with Lasso
    • Jolt: SNARKs for Virtual Machines via Lookups
    • Twist and Shout: Faster memory checking arguments via one-hot addressing and increments
    • Ligerito: A Small and Concretely Fast Polynomial Commitment Scheme
    • Arc: Accumulation for Reed-Solomon Codes
    • WARP: Linear-Time Accumulation Schemes
    • Flock: Fast Proving for Batch Boolean Computations
    • ZK Podcast: Nova and Beyond with Srinath Setty
    • ZK Podcast: Lattices, Folding, & Symphony with Binyi Chen
    • ZK Podcast: Episode 404 with Benedikt Bünz
    • ZK Podcast: Episode 410 with Ron Rothblum

    New from the Zero Knowledge Podcast and Succinct: the 2026 ZK Industry Report, a snapshot of ZK’s tech, research and real-world adoption. Free at zeroknowledge.fm/zk-industry-report-2026 **If you like what we do:** * Consider becoming a zkMesh+ Subscriber * Subscribe to our podcast newsletter * Follow us on Twitter @zeroknowledgefm * Join us on Telegram * Catch us on YouTube Read transcript
    Show More Show Less
    50 mins
  • zkGolf: AI, Clean and Optimising ZK Circuits with zkSecurity
    Oct 21 2026
    This week, Anna is joined by Nico and Kobi to speak with Mathias Hall-Andersen and Giorgio Dell'Immagine from zkSecurity about zkGolf, a competition challenging humans and AI agents to build the most efficient, formally verified ZK circuits. They look back at ZK Hack puzzles and CTFs, exploring how AI is changing the nature of technical competitions. They then dive into Clean, zkSecurity's framework for writing and formally verifying circuits in Lean, and how an experiment using AI to optimize a SHA-256 circuit inspired zkGolf. They discuss how the zkGolf competition works, the breakthroughs and exploits participants have uncovered, how it compares to other AI-driven optimisation challenges, and what AI-assisted circuit development could mean for the future of ZK engineering and security audits. Related Links
    • zkGolf Website
    • Clean GitHub Repo
    • Clean Website
    • Lean Programming Website
    • ZK Hack
    • Yukon Website
    • ZK Podcast: Auto Research on Yukon with Soubhik Deb
    • ZK Podcast: Alex Ozdemir on where Theorem Provers and ZK meet
    • ECDSA.fail
    • SNARK.fast Flock Challenge
    • The Proximity Prize

    Sovright builds the critical infrastructure that preserves your right to choose. Discover more at sovright.com. **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 Read transcript
    Show More Show Less
    1 hr and 12 mins
  • Exploring the Lasers that Power Quantum Computers
    Oct 7 2026
    This week, Anna and Guillermo chat with Josh Yang, CEO and co-founder of Brightlight Photonics, about the lasers that power quantum computers. Josh explains how lasers are used in neutral atom and other atom-based quantum systems to cool and move atoms, manipulate qubit states and read out results. They explore why these systems require so many different lasers and how today’s bulky, expensive optical setups can become a bottleneck as quantum computers scale. They also cover Brightlight’s work miniaturising the Ti:sapphire laser, a longstanding workhorse of quantum optics. Josh explains how integrated waveguides and semiconductor manufacturing techniques make this possible, the challenges of packaging and powering these tiny lasers, and how a more compact, versatile laser platform could better support quantum computing. This one is a departure from the usual topics covered on the show, but we hope you find it as fascinating as we did. Related Links
    • Brightlight Photonics
    • Josh Yang Google Scholar Profile
    • Episode 357: Quantum Engineering with Jelena Vučković
    • Stanford Report: Chip-scale titanium-sapphire laser puts powerful technology in reach
    • Titanium:Sapphire-on-insulator for broadband tunable lasers and high-power amplifiers on chip
    • Titanium:sapphire-on-insulator integrated lasers and amplifiers
    • Multi-dimensional data transmission using inverse-designed silicon photonics and microcombs
    • Brightlight Photonics Images shared by Josh Yang
    • Episode 400: Quantum Advances, Hybrid Signatures and SNARKs to the Rescue with Dan Boneh
    • Episode 402: The Quantum Question Panel – Live from zkSummit14

    **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 Read transcript
    Show More Show Less
    1 hr and 15 mins
  • JP Aumasson on Quantum Risk, AI Attacks and Too Much Crypto
    Sep 30 2026
    This week, Anna, Tarun and Nico are joined by JP Aumasson, co-designer of BLAKE3, author of Serious Cryptography and cryptography engineer at Cloudflare. They revisit the quantum threat to cryptography, looking at recent advances in quantum attacks on RSA and elliptic-curve cryptography, and discuss why JP remains cautious about predictions of an imminent “Q-day.” They then explore how AI is changing cryptanalysis, from recent RSA factoring records to the growing divide between symmetric and asymmetric cryptography. The conversation then turns to Poseidon and recent attacks that have challenged confidence in ZK-friendly hash functions, as well as China’s new NGCC competition, where AI is already being used to find weaknesses in candidate designs. JP shares his experiments using AI for cryptanalysis, why it could accelerate both the building and breaking of cryptographic systems, and a introduces a project exploring AI-driven attacks on hash functions. Related Links
    • Too Much Crypto by Jean-Philippe Aumasson
    • Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
    • Flock: Fast Proving for Batch Boolean Computations
    • Flock Challenge
    • POSEIDON: A New Hash Function for Zero-Knowledge Proof Systems (Updated Version)
    • Ngcc.dev
    • Chinese NGCC Algorithms: The First Week of AI Cryptanalysis
    • JP Aumasson Papers
    • Yukon.org
    • ZK Podcast Episode: The Quantum Question Panel – Live from zkSummit14!
    • ZK Podcast Episode: Quantum Advances, Hybrid Signatures and SNARKs to the Rescue with Dan Boneh

    Sovright builds the critical infrastructure that preserves your right to choose. Discover more at sovright.com. **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 Read transcript
    Show More Show Less
    57 mins
  • Auto Research on Yukon with Soubhik Deb
    Sep 23 2026
    This week, Anna is joined by Soubhik Deb, Head of Research at EigenLabs, to explore Yukon, a platform for collaborative AI-powered research. Soubhik traces the project’s origins to ECDSA.fail, a competition launched in response to Google’s work on more resource-efficient quantum circuits for breaking secp256k1. They discuss how researchers and their AI agents build on one another’s submissions, turning traditional research into a multiplayer process that can iterate at machine speed. The conversation then explores Yukon’s expansion into ZK proving, inference optimisation, coding theory and mathematics through challenges like SNARK.fast, better.codes, mlx.fast and lighter.fast. Soubhik explains the importance of well-defined problems and verifiers for AI-driven research, and shares Yukon’s vision for an “AI-native scientific institution” where humans and agents collaborate to accelerate discovery. Related Links
    • Yukon.org
    • ECDSA.fail
    • Flock Challenge
    • The Proximity Prize (better.codes)
    • Mlx.fast
    • Darkbloom
    • Lighter Prover Challenge
    • ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor’s Algorithm
    • Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms
    • Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
    • ZK Podcast Episode: The Quantum Question Panel – Live from zkSummit14!
    • ZK Podcast Episode: Quantum Advances, Hybrid Signatures and SNARKs to the Rescue with Dan Boneh

    Sovright builds the critical infrastructure that preserves your right to choose. Discover more at sovright.com. **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 Read transcript
    Show More Show Less
    1 hr and 7 mins
  • Ron Rothblum on Fiat-Shamir Attacks, Flock and SNARK.fast
    Sep 16 2026
    This week, Anna and Kobi are joined by Ron Rothblum, Professor of Computer Science at Technion and researcher at Succinct. They catch up on Ron’s move from theory into practice, including his work on the SP1 zkVM, Jagged Polynomial Commitments, and a recent Fiat-Shamir attack that exposed vulnerabilities in practical uses of GKR. Ron explains what the attack revealed about Fiat-Shamir’s security assumptions and why it prompted changes to deployed systems. The conversation then explores Ron’s recent work on faster and more efficient proof systems, from Blaze, TensorSwitch, BOLT and Veil to Flock, a proof system for batch proving Boolean computations. They discuss how new approaches to polynomial commitments and error-correcting codes can improve prover performance, before turning to snark.fast and zkGolf, experiments using AI agents to optimise provers and circuits. Ron shares what these efforts reveal about AI-assisted research and engineering, and how pushing proving closer to the speed of ordinary computation could unlock entirely new applications for verifiable computation. Related Links
    • Jagged Polynomial Commitments (or: How to Stack Multilinears)
    • The Random Oracle Methodology, Revisited
    • Blaze: Fast SNARKs from Interleaved RAA Codes
    • TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes
    • Flock: Fast Proving for Batch Boolean Computations
    • VEIL: Lightweight Zero-Knowledge for Hash-Based Multilinear Proof Systems
    • Bolt: Faster SNARKs from Sketched Codes
    • zkGolf Website
    • Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead
    • SNARK.fast Website
    • ZK Podcast Episode: Error Correcting Codes & Information Theory with Ron Rothblum
    • Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge)
    • Delegating Computation: Interactive Proofs for Muggles
    • How to Prove False Statements: Practical Attacks on Fiat-Shamir

    **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 Read transcript
    Show More Show Less
    1 hr and 2 mins