We are a tiny, independent team and we read every single message. Whether you have a feature idea, found a bug, or just want to talk about the future of learning, we're here. No support bots.
You must accept the Terms and Conditions
How do you prove you found Waldo without pointing at him? This is the beautiful math of secrets — the Whisper Protocol. From modular arithmetic and commitment schemes to SNARKs and recursive proofs, children learn how cryptography is becoming humanity's anchor to truth in an age of deepfakes.
Free to play. Earn Potential as you master units, then mint your collectible certificate.
The Whisper Protocol is a complete intermediate curriculum in zero-knowledge cryptography for young learners. It treats a proof as a whisper: something that convinces without revealing. Children travel from the blindfolded detective to modular arithmetic, from locked boxes and shadow mazes to SNARKs and the infinite Russian doll of recursive proofs — and finally to voting, passwords and truth in an age of deepfakes. Every unit pairs a memorable story with the real mathematics behind it.
The blindfolded detective: how to convince someone you know a secret without ever showing it.
Modular arithmetic and polynomials: the friendly mathematics that powers modern cryptography.
Commitment schemes and shadow mazes: locking an answer so no one can cheat — and proving you know it.
SNARKs and Merkle trees: tiny proofs that verify enormous computations in a blink.
Recursive proofs: a seed containing a forest, where each proof verifies the last.
Perfect votes, a world without passwords, and truth when seeing is no longer believing.
13 units · 40 lessons. Click any unit to expand its full description and the lessons it contains, or jump straight to a chapter.
The course opens with the blindfolded detective: how do you prove you found Waldo without pointing at him? Children discover the core idea of zero-knowledge proofs and the clockwork math — modular arithmetic — that makes it possible.
Welcome to the Whisper Protocol. Imagine you have found Waldo in a giant, chaotic picture book. How do you prove to your friend that you know exactly where he is, without ever pointing at him or showing them the page? For a long time, humanity believed that to prove a truth, you had to reveal the secret. In this unit, we look at a beautiful, quiet breakthrough in mathematics that changes everything. We call it Zero-Knowledge. It lets us share the truth without sharing the facts. It feels like magic, but it is just logic.
If the word 'mathematics' makes your brain feel tired, do not worry. Your biological machine is built to conserve energy, and staring at infinite numbers is exhausting. In this unit, we are not going to look at infinity; we are just going to look at a clock. We explore how numbers can wrap around in circles instead of stretching forever. This 'clock math' is the secret, spinning engine that powers Zero-Knowledge cryptography and hides our digital data.
When you hear the word 'polynomial', your bio-machine might brace for a difficult equation, burning energy just thinking about it. Breathe, and let that fear go. We are not going to memorize formulas. If you want to know if two giant mountains are exactly the same, you do not need to measure every single rock. You just need to check one random spot. In this unit, we look at how humans use sweeping mathematical shapes—polynomials—to perfectly compress a universe of information into a single, undeniable fingerprint.
How do you play rock-paper-scissors over the internet without cheating? Children build the machinery of proofs: the locked box (commitment schemes), the shadow maze (arithmetic circuits), and the ritual (trusted setups) — and the dangerous human problem each one solves.
Imagine trying to explain the feeling of a poem to a calculator. It is impossible because computers do not understand human feelings or human words; they only understand numbers. If we want to prove a complex human secret to a machine without revealing it, we have to translate that secret into the language of the machine. In this unit, we learn how to flatten our logic into a 'Shadow Maze'—a tiny, invisible circuit of addition and multiplication. This is how we teach a computer to verify a truth without ever looking at the truth itself.
How do you play rock-paper-scissors over the internet without someone cheating? If you say 'rock' first, the other person can just wait a millisecond and say 'paper'. You need a way to lock your answer before the other person shows theirs. In this workshop, we explore the 'Locked Box'—a mathematical promise that you cannot change, but no one can read until you hand them the key. Engineers call this a Commitment Scheme, and it is the foundation of digital fairness.
To build a perfectly secure cryptographic maze, someone has to forge the first master lock. But here we find a dangerous human problem: whoever builds the lock automatically knows the shape of the key, meaning they could easily build a backdoor. How do we create a perfect lock without trusting the locksmith? In this unit, we explore 'Trusted Setups'. We look at the strange, beautiful ceremonies humans use to birth secure systems, proving that at the heart of our most advanced digital technology lies a physical, human ritual.
A million-step maze would exhaust the verifier — so children build the sealed envelope: SNARKs, which compress proofs to a blink. They meet the family tree (Merkle trees) and the infinite Russian doll (recursive proofs), where each proof verifies the last.
We have built our shadow maze, and we know how to prove a secret. But there is a biological limit to our system: if the maze is a million steps long, it will exhaust the verifier to check every single step. In this unit, we learn how to shrink that massive proof down to the size of a digital postage stamp. We call this a SNARK. It is a mathematical magic trick that allows a simple cell phone to instantly verify that a supercomputer did its math correctly.
Imagine you are part of a massive global club with millions of members. If someone asks if you truly belong, you shouldn't have to carry a physical book containing every member's name just to prove your own. In the world of data, we solve this using a 'Family Tree'—or what scientists call a Merkle Tree[cite: 697, 699]. It’s a way of organizing information where pairs of data points are combined to form a 'branch,' and those branches combine again and again until they reach a single 'root'. This single digital fingerprint represents the entire group. To prove you are a member, you only need to show the path from your 'leaf' to that root, without ever revealing who else is in the club[cite: 698, 699].
Imagine you are holding a tiny seed. Inside that seed is the blueprint for a leaf, a branch, and eventually, an entire forest. Your brain is working hard just thinking about how much information fits in that tiny space, and that is completely okay. In the mathematics of secrets, we call this the 'Infinite Russian Doll'—a recursive proof. Once we have a mathematical proof, what if we prove that we checked the proof? We zoom out to see how stacking these mathematical secrets inside each other allows us humans to compress the history of a million transactions into a single, tiny receipt. We invented this tool not to make things complicated, but to make the heavy history of the world light enough for anyone to carry.
The course ends by whispering in the real world. Children apply zero-knowledge proofs to the perfect vote, a world without passwords, and the hardest problem of all: truth in an age of deepfakes, where seeing is no longer believing.
We have talked a lot about the theory of hiding secrets, but now it is time for a workshop. Imagine you just spent three hours solving the hardest Sudoku puzzle in the world. You want to prove to a computer that you are a genius who solved it, but you refuse to reveal a single number on the grid. How do you prove you know the answer without showing the answer? We are going to build a tiny mathematical circuit to do exactly that.
Democracy is one of the most beautiful tools humans ever invented. Instead of fighting to solve our differences, we simply count hands. But it relies on a fascinating paradox: we must know exactly how many votes were cast, but we must never know who voted for whom. If the world knows exactly who you voted for, you are not truly free from pressure. In this unit, we apply our new mathematical tools—Zero-Knowledge circuits—to solve this ultimate human coordination problem. We can now build a system where you cast a vote anonymously, but verifiably. It is a harmonious balance of perfect trust and perfect secrets.
Humans have always used physical keys or secret words to protect what matters. But memory is a biological process, and forcing your brain to remember a hundred different passwords with numbers and symbols is exhausting. If your brain feels tired just thinking about it, that is okay; it was not designed for this. Soon, typing a string of letters to access your bank will feel like using a stone hammer. In this unit, we look at a near future where you simply prove who you are to a system mathematically, without ever handing over a secret that can be stolen. We are moving from a world of hiding our secrets to a world of simply proving our truth.
We are entering an era where artificial intelligence can instantly create a perfect video of an event that never happened[cite: 711, 712]. For the first time in human history, 'seeing is believing' is no longer a safe rule. If we cannot trust our eyes, how will we know what is real? In this final unit, we explore how Zero-Knowledge cryptography is becoming humanity's anchor to reality. We are building systems that allow cameras and journalists to mathematically prove a photograph is authentic from the exact moment the light hits the lens, ensuring that truth survives the age of deepfakes.
Every unit ends with practice questions in three formats (53 multiple choice · 32 fill in the blank · 31 order the words). Wrong answers are automatically recycled in later sessions until the learner proves mastery. Try one from each chapter — click an answer to test yourself:
Historically, what was the paradox of establishing trust?
Engineers call the process of turning a thought into pure math '____'.
flattening
Put these words in the correct order:
It compresses it into a tiny digital envelope
What paradox does democratic voting rely on?
Print-ready study guide for parents & teachers — the full curriculum unit by unit, chapter outcomes, sample questions and key vocabulary.