Pratyush Mishra on Tiny Proofs, Folding, Low-Memory SNARKs and More

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

• • 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