Zero-knowledge proofs, with a cave and a door
A zero-knowledge proof convinces you something is true without showing you why. It sounds impossible. A story from 1989 makes it obvious.
Why it matters to you
Proofs like this let a computer show it ran a program correctly without anyone running it again, and without revealing private data. That’s what lets Kaspa check big apps cheaply.
How it works: the cave
A cave forks into two paths, A and B, that meet at a locked door at the back. Peggy says she knows the word that opens it. Victor waits outside. Peggy walks in down a path he can’t see. Victor shouts which path she should come back by. If she knows the word, she can always do it. If she doesn’t, she has to be lucky.
0 rounds
Each round, a bluffer has a one-in-two chance. Twenty rounds in a row is about one in a million. Victor ends up sure, but he never hears the word.
From the cave to Kaspa
Real proofs replace Victor’s shouting with math, so one short proof does the work of millions of rounds, and anyone can check it later. Since the upgrade, a Kaspa can check such a proof (KIP-16). That’s the base for .
What isn’t settled
Making proofs is still slow and expensive for big programs. That cost is falling, but it’s the main limit on what can be proved today.
Sources
- Quisquater, Guillou et al., How to Explain Zero-Knowledge Protocols to Your Children (CRYPTO ’89).
- KIP-16: github.com/kaspanet/kips.