Pratyush Mishra on Tiny Proofs, Folding, Low-Memory SNARKs and More
Failed to add items
Sorry, we are unable to add the item because your shopping cart is already at capacity.
Add to basket failed.
Please try again later
Add to Wish List failed.
Please try again later
Remove from Wish List failed.
Please try again later
Follow podcast failed
Unfollow podcast failed
-
Narrated by:
-
By:
About this listen
- 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
No reviews yet
In the spirit of reconciliation, Audible acknowledges the Traditional Custodians of country throughout Australia and their connections to land, sea and community. We pay our respect to their elders past and present and extend that respect to all Aboriginal and Torres Strait Islander peoples today.