Zero Knowledge Pratyush Mishra on Tiny Proofs, Folding, Low-Memory SNARKs and More
Nov 26, 2025
Pratyush Mishra, Assistant Professor at the University of Pennsylvania, dives into his groundbreaking work on zero-knowledge proofs. He discusses how Garuda and Pari achieve ultra-small SNARK proofs, and explains the innovative use of hash-based folding techniques. Pratyush also highlights the significance of low-memory SNARKs for devices with limited resources and explores real-world applications beyond blockchain, such as verifying SQL queries and document formats. His collaborative research aims to push the boundaries of cryptographic efficiency and practicality.
AI Snips
Chapters
Transcript
Episode notes
From PhD To Penn And Back To Research
- Pratyush explained his path from PhD to industry and then to an assistant professorship at the University of Pennsylvania.
- He described joining Penn in 2023 and running a research group with students continuing Arcworks work.
Broadening Beyond Curve-Based SNARKs
- Pratyush noted SNARK research broadened beyond elliptic-curve schemes into hash- and code-based constructions.
- He also studies proving under constrained environments like low-memory or distributed provers.
Performance Alone Doesn't Guarantee Adoption
- Practical uptake of SNARKs depends on both improved performance and clear non-blockchain use-cases.
- Business contexts often tolerate contractual enforcement, reducing the unique appeal of SNARK guarantees.