zk-SHARKs: Combining Succinct Verification and Public Coin Setup
summary
Defines zk-SHARKs that give short, fast verification with a public-coin prudent mode and an optimistic/prudent verification fallback: optimistic (SRS-based) verification is milliseconds, prudent (no-trust) verification is slower but detects compromised setups and creates a fraud proof to revoke the SRS. Construction uses linear PCPs, inner‑product arguments, Bulletproof-style commitments and a special snark for encoded polynomial delegation; prover overhead avoids a λ^2 blowup (≈λ slowdown instead). Final proofs use about five pairings and ~61 group elements; SRS can be refreshed without witnesses.
AI-written summary · about
chapters (14)
- 0:00Intro
- 0:55Which zk-SNARK?
- 2:29Avoiding a Structured Reference String
- 4:33Proof transmission & verification speed
- 6:51What if prudent verification fails?
- 8:05A generic SHARK construction
- 9:54Challenge: efficient SHARK construction
- 10:57Technical contribution: efficient SHARK construction
- 12:24Linear PCP paradigm
- 15:42Answer consistency via inner product arguments
- 19:15Outsourcing vector commitment computation
- 21:03Encoded polynomial delegation
- 22:35Comparison with generic instantiation
- 23:01Swimming with SHARKS
related talks
25mHigh-Speed zkSNARKs without Trusted Setup
34mSNARKs and their Practical Applications
51mWhy you shouldn't trust me
20mSNARKs from the sum-check protocol
17mSNARK Flipper. FLIP & Prove multiple instances efficiently
01h 05mAn Algebraic Framework for Universal and Updatable zkSNARKs
32mSoK: Private Programmability on Blockchain Systems
57mPractical Groth16 Aggregation