An Algebraic Framework for Universal and Updatable zkSNARKs

on YouTube ↗01h 05m

" summary

Claims an algebraic decomposition that builds updatable, universal zkSNARKs by splitting circuit satisfiability into three concrete pieces: Hadamard product (the multiplicative/hadamard witness relation), an inner product linear check for the linear constraints, and a new verifiable space sampling primitive that replaces per-circuit ceremonies. Shows how Groth16’s multiplicative compression can be reused, generalizes the subgroup requirement on R to arbitrary sets for soundness, and gives two sampling constructions (one Luna-inspired) that shrink CRS size and keep online verifier work linear.

AI-written summary · about

" chapters (4)

1. 0:00Start
2. 4:51Holographic Proof
3. 24:36Verifiable Space Sampling
4. 27:52What's the Difference between Ahp and Polynomial Iop

" related talks

• 25mSonic: zkSNARKs from Linear Size Universal and Updatable SRSSean Bowe · 2nd ZKProof Workshop 2019
• 26mzk-SHARKs: Combining Succinct Verification and Public Coin SetupMadars Virza · 2nd ZKProof Workshop 2019
• 25mLegoSNARK: Modular Design and Composition of Succinct Zero Knowledge ProofsDario Fiore · 2nd ZKProof Workshop 2019
• 44mBilinear Pairings-based Zero-Knowledge ProofsJens Groth · 2nd ZKProof Workshop 2019
• 48mzkSNARKs — Cryptographic Proofs for Scaling and Security ChallengesSergey Prilutskiy · HighLoad++ 2023
• 52mDiscrete Log based Zero-Knowledge ProofsDan Boneh · 2nd ZKProof Workshop 2019
• 23mAurora: Transparent Sucinct Arguments for R1CSNick Spooner, Dev Ojha · 2nd ZKProof Workshop 2019
• 34mSNARKs and their Practical ApplicationsEran Tromer · Securing Computation (Simons Institute, June 2015)