Pratyush Mishra on Tiny Proofs, Folding, Low-Memory SNARKs and More
Zero Knowledge
00:00
Query-optimal IOPPs and limits
They cover recent query-optimal IOPP work achieving lambda·log n proof sizes and theoretical optimality.
Play episode from 38:33
Transcript
Transcript
Episode notes
In this episode, Anna Rose and Nico Mohnblatt catch up with Pratyush Mishra, Assistant Professor of Computer and Information Science at the University of Pennsylvania. They discuss the various themes in his ZK research and some of the works he has been a part of in the last few years. They explore how Garuda and Pari achieve extremely small SNARK proofs, how Arc facilitates hash-based folding, proximity proofs with FICS and FACS, his work on low-memory SNARKs, and ZK applications outside the blockchain space.
Pratyush shares how these ideas intersect with one another, from faster proving to smallest proof sizes to real-world uses. He also touches on his collaborations with other leading cryptographers like Benedikt Bünz and Alessandro Chiesa, and how ZK is finding its place in broader computer science.
Related Links
Aztec is a privacy-first Layer 2 on Ethereum supporting smart contracts with both private and public state and execution. Details about Aztec’s technology, research, and community programmes are available at aztec.network.
ZK Whiteboard Sessions is an educational video series produced by ZK Hack in collaboration with Bain Capital Crypto. It is focused on the building blocks of zero knowledge technology. Find season 3 of the Whiteboard Sessions as well as previous seasons here. Check out the latest jobs in ZK at the ZK Podcast Jobs Board.
**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
- Garuda and Pari: Faster and Smaller SNARKs via Equifficient Polynomial Commitments
- Arc: Accumulation for Reed--Solomon Codes
- FICS and FACS: Fast IOPPs and Accumulation via Code-Switching
- Scribe: Low-memory SNARKs via Read-Write Streaming
- Coral: Fast Succinct Non-Interactive Zero-Knowledge CFG Proofs
- Hekaton: Horizontally-Scalable zkSNARKs via Proof Aggregation
- Query-Optimal IOPPs for Linear-Time Encodable Codes
- Time-Space Trade-Offs for Sumcheck
- Blendy: A Time-Space Tradeoff for the Sumcheck Prover
- Accumulation without Homomorphism
- vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases
- Succinct Arguments in the Quantum Random Oracle Model
- Lattices, Folding, & Symphony with Binyi Chen
Aztec is a privacy-first Layer 2 on Ethereum supporting smart contracts with both private and public state and execution. Details about Aztec’s technology, research, and community programmes are available at aztec.network.
ZK Whiteboard Sessions is an educational video series produced by ZK Hack in collaboration with Bain Capital Crypto. It is focused on the building blocks of zero knowledge technology. Find season 3 of the Whiteboard Sessions as well as previous seasons here. Check out the latest jobs in ZK at the ZK Podcast Jobs Board.
**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
The AI-powered Podcast Player
Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
