Aurora: Transparent Sucinct Arguments for R1CS
summary
Aurora produces transparent zk-SNARKs for R1CS with transparent setup and only symmetric-key primitives (hashes), achieving proof size about 50–150 KB for circuits with a few million gates, prover time in minutes and verifier time in seconds, and proof length scaling roughly like log^2(n). Construction builds an IOP for R1CS, uses a univariate encoding plus a novel universe sumcheck to reduce queries to O(log |H|), compiles via the BCS transform, and is implemented and practical.
AI-written summary · about
chapters (7)
- 0:00Start
- 1:46How to build a zero knowledge proof
- 2:49Rank-1 Constraint System (R1CS)
- 18:35Structure of the Aurora IOP
- 18:55Univariate sumcheck
- 19:34Open questions
- 22:18Comparison: Aurora vs Ligero vs Stark
related talks
25mHigh-Speed zkSNARKs without Trusted Setup
01h 05mAn Algebraic Framework for Universal and Updatable zkSNARKs
19mZK Tutorial: An Introduction to SNARK Development with arkworks
34mSNARKs and their Practical Applications
48mzkSNARKs — Cryptographic Proofs for Scaling and Security Challenges
44mZero-Knowledge Proofs: Simultaneously ensuring integrity and privacy
57mPractical Groth16 Aggregation
20mSNARKs from the sum-check protocol