Inclusive Accountability at Scale via Proofs
summary
Cryptographic integrity is achieved by batching off‑chain computation into succinct proofs that verify on‑chain in tiny time; the system uses zk-STARKs to generate proofs in near‑linear time and a verifier that accepts a new Merkle root and proof. A demo settles 32,000 trades / 2,000 TPS with the proof fitting in one Ethereum block, yielding an amortized gas ~200 per trade. The product StarkEx powers non‑custodial exchanges: proofs prevent unauthorized state updates though data‑availability and ramping (deposit/withdraw) remain operational details.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 3:33Computational Integrity
- 13:05Proofs
- 20:40Crypto Proofs
- 28:18Zero Knowledge
- 33:02Scalability
- 37:13Blockchain scalability
- 41:37Starck
- 41:52Lock vs Free Exchange
- 45:27Liquidity fragmentation
- 46:00How it works
- 46:38System Architecture
- 50:57Fair Matching
- 58:45Etherium Network








