Listen "Ligero for Memory-Efficient ZK with Muthu"
Episode Synopsis
In this episode, Anna Rose and Guillermo Angeris catch up with Muthu Venkitasubramaniam, Professor of Computer Science at Georgetown University and cofounder of Ligero. They discuss how Ligero’s small memory footprint makes it a good choice for client-side proving, as well as the importance of programmable compliance in blockchain. The conversation explores the differences between ‘MPC in the head’ and error-correcting code perspectives, and how well-established primitives influence the design of modern ZK systems. They also debate the challenge of adding ‘ZK’ privacy back into systems without it, why proving EVM traces may be absurd, and what kinds of guarantees might exist around the results of vibe coding.
Related Links
Episode 363: Bringing ZK to Google Wallet with Abhi and MatteoEpisode 326: MPC & ZK in Ligero and LigetronZK13: Ligerito: A Small and Concretely Fast Polynomial Commitment Scheme - Kobi GurkanZK13: Vibe coding ZK Apps with Ligetron ZK Platform - Muthu Venkitasubramaniam ZK10: Analysis of zkVM Designs - Wei Dai & Terry Chung Ligerito: A Small and Concretely Fast Polynomial Commitment SchemeLigero++ - Reducing proof length of LigeroAdding Zero-Knowledge to STARKs - Talk by Ulrich HaböckAurora - comparing prover times of STARKs vs LigeroWYSTERIA: A Programming Language for Generic, Mixed-Mode Multiparty ComputationsSamaritan: Linear-time Prover SNARK from New Multilinear Polynomial CommitmentsBrakedown: Linear-time and field-agnostic SNARKs for R1CSIntro to...
Related Links
Episode 363: Bringing ZK to Google Wallet with Abhi and MatteoEpisode 326: MPC & ZK in Ligero and LigetronZK13: Ligerito: A Small and Concretely Fast Polynomial Commitment Scheme - Kobi GurkanZK13: Vibe coding ZK Apps with Ligetron ZK Platform - Muthu Venkitasubramaniam ZK10: Analysis of zkVM Designs - Wei Dai & Terry Chung Ligerito: A Small and Concretely Fast Polynomial Commitment SchemeLigero++ - Reducing proof length of LigeroAdding Zero-Knowledge to STARKs - Talk by Ulrich HaböckAurora - comparing prover times of STARKs vs LigeroWYSTERIA: A Programming Language for Generic, Mixed-Mode Multiparty ComputationsSamaritan: Linear-time Prover SNARK from New Multilinear Polynomial CommitmentsBrakedown: Linear-time and field-agnostic SNARKs for R1CSIntro to...
More episodes of the podcast Zero Knowledge
Year in Review: ZK Podcast in 2025 & Beyond
03/12/2025
The Quest for Practical iO with Machina iO
12/11/2025
Countdown to Q-Day with Project 11
05/11/2025
Bonus: ZK Mesh and ZK Whiteboard this week!
29/10/2025
ZARZA We are Zarza, the prestigious firm behind major projects in information technology.