The Setup: Peggy (prover) claims she knows the secret word to open the door connecting paths A and B inside the cave. Victor (verifier) wants proof without learning the word. Click "Start Round" to begin.
Rounds Played
0
Successful Proofs
0
Cheat Probability
100%
Chance of fooling verifier: 100%
The Scenario: You have two balls that look identical to a color-blind friend. You claim they're different colors. To prove it without saying which is which, your friend holds one in each hand, randomly swaps (or not) behind their back, then shows you. You say "swapped" or "not swapped." If you're right every time, you must be able to tell them apart.
?
vs
?
Click "Shuffle" to have your friend swap (or not) behind their back.
Rounds
0
Correct
0
Confidence
0%
Prove You Know a Number
Enter a secret number. The system publishes its hash. Then prove you know it by entering it again without "revealing" it to the verifier (the hash is checked, not the number shown).
How it works in crypto: ZK-SNARKs and ZK-STARKs generalize this concept. A prover can demonstrate they know a valid transaction (e.g., sufficient balance) without revealing amounts, addresses, or other private data. Used in Zcash, zkSync, StarkNet, and Tornado Cash.