Listen in the Podli app 🎧
Follow your favourite podcasts, listen offline and in the car with CarPlay and Android Auto, and always pick up where you left off. Free to try.
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
**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
<a class="transcript-btn" href="https://github.co
