STARK – Zero-Knowledge Proof Protocol
summary
Starks implement a transparent, post‑quantum zero‑knowledge proof system that requires no trusted setup and turns a T‑step computation into a proof with quasi‑linear proving time and verifier time ~log(T). Implementation converts programs to AIR, commits execution with Merkle trees and opens a few paths; Peterson hashes are used in benchmarks (8,000 hashes: prover ≈4 minutes, verifier ≈23 ms; Merkle path proofs up to 250 take <7 s to prove, 10–20 ms to verify). New hash candidates (Jarvis/Friday) cut proving cost ~25×; single‑tx proofs ≈10–45 KB, 10k‑tx batches ≈135 KB; browser/phone demo generates proofs in ~16 s.
AI-written summary · about
chapters (14)
- 0:00Introduction to Starks
- 1:13Computational integrity
- 6:21Defining Starks
- 10:10Starks vs Snarks vs Bulletproofs
- 15:52Performance benchmarks
- 20:23The importance of transparency
- 24:40Building Starks with AIR
- 28:25Internal milestones and hashes
- 36:06Fibonacci proof demo
- 39:06Practical proof demonstrations
- 43:33Mobile browser demonstration
- 47:22Q&A session
- 1:01:44Potential use cases
- 1:15:21Concluding remarks
related talks
33mAn Introduction to Zero Knowledge Proofs
43mPushing the Limits of Zero Knowledge Applications
24mA Framework for Post-Quantum Succinct Arguments
36mPanel Discussion
28mThe State of the STARK
31mSecure Distributed Storage
19mDIZK: A Distributed Zero Knowledge Proof System
18mzkSaaS: Zero-Knowledge SNARKs as a Service