Framework for Snarky Ceremonies
summary
A concrete framework defines ceremony structure, models the two‑phase MPC that produces an SRS, and proves Groth16+BGW/BGM17 security in the algebraic group + random‑oracle setting under a qd‑lock assumption; it argues one honest update per phase suffices and removes necessity of random beacons (relying on Mary Müller’s analysis). Real deployments cited: Sapling (~90 participants), Aztec ignition (176), Tornado Cash/semaphore (>1,000) and perpetual Powers of Tau practice the sequential, updatable protocol; the work ships an independent verification tool to automate transcript checks.
AI-written summary · about
chapters (18)
- 0:00Introduction
- 1:00Welcome
- 2:10The problem
- 4:20subversion
- 5:48protocol
- 9:43gm17 protocol
- 10:53Random Beacon
- 14:00Real World Experience
- 16:47Random Beacons
- 19:20Snarky Ceremonies
- 21:48What can we improve
- 23:53Repository
- 24:26Discussion
- 31:06We understand the ceremonies fairly
- 34:08Its sequential
- 47:48One Phase
- 48:23Two Phase
- 53:39Ethical Ceremonies
related talks
25mPractical Accountability of Secret Processes
28mNotes from the SNARKonomicon: Techniques for Writing SNARK Programs
25mSonic: zkSNARKs from Linear Size Universal and Updatable SRS
33mInteraction Preserving Compilers for Secure Computation
01h 00mFrom 10,000-Party Protocols to Vibe Coding ZK: Engineering Cryptography Through Black-Box Design
32mSoK: Private Programmability on Blockchain Systems
19mSecuring DNSSEC with Ritual and Ceremony
34mSNARKs and their Practical Applications