Sonic: zkSNARKs from Linear Size Universal and Updatable SRS
summary
Sonic presents a zkSNARK construction that keeps the common reference string to linear-size SRS by using a univariate Kate-style polynomial commitment (with negative exponents and no constant term) so the setup is universal and updatable. Specializing to a circuit is a linear multi-exponentiation, not a quadratic collapse, and verifier time is constant using batch aggregation and a polynomial permutation argument. Parameters can still be gigabytes; prior ceremonies scaled to ~100 participants.
AI-written summary · about
chapters (11)
- 0:00Intro
- 0:35Why do we need trusted setups?
- 1:18What's in a trustless setup?
- 2:31What's in a trusted setup?
- 3:33Multi-party Computation
- 9:59Updatable / Universal Setup
- 11:28Introducing Sonic!
- 12:59Kate et al. Polynomial Commitments
- 14:43Zero-Knowledge Argument
- 16:34Achieving Succinctness
- 18:26The work ahead
related talks
01h 05mAn Algebraic Framework for Universal and Updatable zkSNARKs
25mHigh-Speed zkSNARKs without Trusted Setup
20mSNARKs from the sum-check protocol
34mSNARKs and their Practical Applications
48mzkSNARKs — Cryptographic Proofs for Scaling and Security Challenges
01h 00mRinocchio: SNARKs for Ring Arithmetic
19mZK Tutorial: An Introduction to SNARK Development with arkworks
25mThe Next 700 ZKP Programming Languages