Hash-based Folding Schemes
summary
Introduces interactive oracle reductions and a hash-based recipe using Merkle commitments plus Fiat–Shamir to compile IORs into succinct folding reductions; builds WARP, an accumulation scheme instantiable with any linear code, that achieves a linear-time prover and a verifier that makes O(lambda) queries (security-parameter-dependent, essentially independent of statement length). Key techniques: proximity batching via random linear combinations, prover recommitment to combinations, and a new straight-line extraction without an error-corrector using mutual correlated agreement and erasure decoding.
AI-written summary · about
chapters (15)
- 0:00Hash-based folding schemes intro
- 1:07Three talk goals
- 3:16Folding schemes defined
- 4:41Hash-based succinct arguments recipe
- 6:27Interactive oracle reductions
- 11:28Examples of reductions
- 16:25Trivial folding scheme
- 18:34Nontrivial folding goals
- 21:11Batch protocol details
- 29:40Accumulator relation and codes
- 32:53WARP accumulation scheme
- 35:25WARP soundness
- 38:58Straight-line extraction
- 45:25Open questions
- 48:16Q&A
related talks
01h 08mTutorial on Proof Systems
01h 15mTo interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic
01h 09mProofs - Practice 1
01h 15mProofs - Theory
59mDelegating Computation I
01h 06mOblivious RAM II
28mEvolution of Optimistic Rollup proofs
29mCorrelation-Intractable Hash Functions via Shift-Hiding
