Why you shouldn't trust me
summary
Explains why zero knowledge proofs (ZKPs) let a prover convince a verifier of a true/false statement without revealing secrets, with concrete protocols: Alibaba cave and the commitment-based Sudoku and 3‑color examples that use repeated challenges (confidence = 1 − 1/2^n gives 50%, 75%, 87.5% after 1–3 runs). Covers tools and builds: non‑interactive ZK Snorks/ZKPs for rollups, Zedcash using a multi‑party trusted setup (six participants, “toxic waste” risk, laptops destroyed) and STARKs without trust; notes current limits: heavy CPU, minutes on mobile, scaling tradeoffs.
AI-written summary · about
chapters (8)
- 0:00Introduction to speakers
- 1:30Security and authentication
- 7:00Computational theory
- 13:48Zero-knowledge proof basics
- 21:53Advanced examples
- 33:11Real-world applications
- 41:36Blockchain and trust
- 48:22Limitations and conclusion
related talks
44mZero-Knowledge Proofs: Simultaneously ensuring integrity and privacy
01h 26mPanel Discussion: The Challenges and Best Practices of Deploying Zero-Knowledge Proofs
26mApplications of Zero Knowledge Proofs in the Banking Industry
44mBilinear Pairings-based Zero-Knowledge Proofs
41mGKR based Zero-Knowledge Proofs
52mDiscrete Log based Zero-Knowledge Proofs
51mPanel: Zero Knowledge in the Enterprise
37mWhat ZK Can—and Can’t—Do for You