Almanac Academy · Frontier Phase

The Whisper Protocol Zero-Knowledge Cryptography

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.

Intermediate level Track 9 of 14 13,000 XP Available
Where this fits: part of the Frontier Phase (Tracks 8–11), where learners demystify the technologies shaping the future. The Whisper Protocol follows The Golem's Mind (Agentic AI) and precedes The Bio-Hacker's Forge (Synthetic Biology).
13
Units
40
Lessons
116
Practice Questions
4
Chapters
13,000
XP Available

What is this course?

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.

🕵️

Prove without revealing

The blindfolded detective: how to convince someone you know a secret without ever showing it.

🕰️

Clockwork math

Modular arithmetic and polynomials: the friendly mathematics that powers modern cryptography.

📦

The locked box

Commitment schemes and shadow mazes: locking an answer so no one can cheat — and proving you know it.

✉️

The sealed envelope

SNARKs and Merkle trees: tiny proofs that verify enormous computations in a blink.

🪆

The infinite Russian doll

Recursive proofs: a seed containing a forest, where each proof verifies the last.

🗳️

The whisperer in the world

Perfect votes, a world without passwords, and truth when seeing is no longer believing.

The curriculum, unit by unit

13 units · 40 lessons. Click any unit to expand its full description and the lessons it contains. Use the search box above to filter units, or jump straight to a chapter.

Chapter 1

The Core Idea: Proving Without Revealing

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.

3 units · 12 lessons · 24 practice questions
What your child will be able to do
  • Explain the core concept: proving you know something without revealing what it is
  • Understand modular arithmetic as clockwork math — friendly, finite and everywhere
  • See polynomials as fingerprints: unique patterns that stand in for hidden information
  • Distinguish zero-knowledge proofs from ordinary encryption
Unit 1 The Blindfolded Detective (The Core Concept) Core8 questions

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.

The Paradox of Trust
When humans trade, vote, or talk, we rely on trust. Historically, trust required handing over our secrets—our names, our passwords, our identities. But every time you hand a secret to a computer, you are leaving a vulnerable copy of yourself behind. We invented Zero-Knowledge cryptography to solve this ancient human paradox: how to prove you are allowed to enter the digital city without showing the guards your face.
The Cave of Alibaba
Imagine a circular cave with a locked magic door at the back. You want to prove to a friend you know the secret password to the door, but you refuse to say the password out loud. You walk into the cave, choose a path, and your friend stands at the entrance, yelling for you to come out either the left or the right side. Because you know the password to open the back door, you can always walk out the correct side. If you do this twenty times in a row, your friend knows you have the password, even though they never heard you say it.
The Prover and the Verifier
We can apply this cave trick to digital data. Think of a blindfolded detective trying to verify the shape of a key. They do not need to look at the key itself; they only need to feel if it turns the lock perfectly. In digital terms, we call this the Prover and the Verifier. The Prover holds the secret, and the Verifier runs tiny mathematical tests. If the tests pass every single time, the Verifier knows the secret is real without ever looking at it.
The Biological Cost of Secrets
Your brain burns physical energy when it is stressed, and worrying about stolen passwords is a modern biological burden. Zero-Knowledge is not just a software upgrade; it is a way to relieve that stress. By shifting from 'sharing secrets' to 'proving truths mathematically', we are building a safer, calmer digital world where your private data never actually leaves your own hands.
Unit 2 Clockwork Math (Modular Arithmetic) Core8 questions

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.

The Circle of Time
In normal math, numbers stretch on forever in a straight line: 10, 11, 12, 13, 14, to infinity. But humans invented a different kind of math to track time. On a standard clock, after 12:00, we do not say it is 13:00; we loop back to 1:00. The numbers wrap around in a circle. This simple act of looping is the foundation of modular arithmetic.
Keeping the Leftovers
How do we actually calculate this? We use an operation called 'modulo'. It is much simpler than it sounds. Modulo simply means 'divide, and only keep the leftovers'. If you have 14 hours and a 12-hour clock, you divide 14 by 12. It goes in once, with 2 left over. Therefore, 14 modulo 12 is 2. We only care about the remainder.
The Hiding Spot
Why does cryptography use clock math instead of normal math? Because normal math is predictable. If I keep adding 2 on a straight line, you can easily track where I am going. But if we use a massive clock with a prime number of hours, the numbers bounce around the circle chaotically. It becomes a perfect mathematical hiding spot.
The One-Way Street
The true magic of modular arithmetic is that it acts like a one-way street. If I tell you it is 2:00 now, and I ask what time it will be in 50 hours, you can easily calculate it. But if I only tell you that the final time is 2:00, it is almost impossible for you to guess how many times I spun the clock to get there. It is easy to calculate forward, but incredibly hard to calculate backward. This asymmetry is the lock on the digital door.
Unit 3 The Fingerprint (Polynomials) Core8 questions

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.

The Landscape of Math
Do not imagine a polynomial as a rigid line of numbers. Imagine it as a sweeping landscape or a rollercoaster track drawn by a math formula. It goes up, it swoops down, it curves. Just like a physical landscape, this mathematical curve has a specific, unique shape. A polynomial is simply a way to draw a complex, beautiful line through a sky full of data points.
The Perfect Compression
Imagine a million chaotic facts scattered like stars. To a computer, reading all those facts takes massive time and energy. But what if we draw one smooth, continuous polynomial curve that touches every single star? Suddenly, we do not need to memorize the million facts. We just memorize the single equation of the curve. The shape of the line perfectly compresses the data.
The Random Intersection
Here is the true magic, known to cryptographers as the Schwartz-Zippel Lemma. Imagine you and I both claim to have drawn the exact same rollercoaster track. How do we prove it? We do not need to trace the entire mile-long track. We just pick one completely random spot. Because these curves are so complex, if our lines are different, they will almost never touch in the exact same spot. If they cross at that one random point, we know the entire tracks are identical.
The Mathematical Fingerprint
This is how we verify massive secrets without revealing them. By using polynomials, we compress a giant file of data into a single mathematical shape. We do not share the file itself; we just share the fingerprint. The verifier checks one single, random point on the curve. In a fraction of a second, the math proves the truth, saving both the human brain and the machine from the exhaustion of checking every single detail.
Chapter 2

The Machinery: Commitments, Mazes & Setups

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.

3 units · 12 lessons · 24 practice questions
What your child will be able to do
  • Explain commitment schemes: locking an answer so no one can change it
  • Describe arithmetic circuits as shadow mazes: turning statements into math
  • Understand trusted setups and the ritual: who forges the first master lock?
  • Connect each piece into a working proof system
Unit 1 The Shadow Maze (Arithmetic Circuits) Core8 questions

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.

The Translation Problem
Suppose you want to prove to a digital guard, 'I know the two secret numbers that multiply to make 15.' You cannot just whisper it. The guard is a machine. You must turn that English sentence into a strict mathematical shape. Engineers call this process 'flattening'. We must take a human thought and hammer it perfectly flat until it becomes pure math.
The Logic Gates
How do we hammer a thought flat? We break it down into the smallest possible pieces. We use tiny mathematical gates: addition and multiplication. Imagine building a physical maze out of wooden pipes. At every junction, the pipes either add two numbers together or multiply them. This invisible structure of pipes is what we call an Arithmetic Circuit.
Casting a Shadow
When you drop your secret numbers into the top of this maze, they flow through the addition and multiplication gates, interacting with each other. By the time they reach the bottom, they cast a specific mathematical 'shadow'. We do not show the verifier our secret numbers at the top. We only show them the maze and the shadow at the bottom.
The Blind Verification
If your secret numbers were wrong, they would bump into the wrong gates and cast a completely different shadow. Because the verifier knows exactly how the maze is built, they can look at the final shadow and instantly know if you poured the correct secret into the top. You have successfully proven your knowledge, while keeping the secret perfectly hidden in the dark.
Unit 2 The Locked Box (Commitment Schemes) 8 questions

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.

The Digital Promise
Imagine writing a secret prediction on a piece of paper. If you just hold it in your hand, people might think you erased it and changed your mind at the last second. But if you put it in a heavy steel box, lock it, and put the box on the table, your prediction is committed. You cannot change it, but no one can read it yet. This is the biological feeling of a commitment scheme: trust that is visible to everyone.
The Lock (Hashing)
In the digital world, we do not use steel. We use a one-way mathematical function called a 'hash'. When you run your secret word through this function, it scrambles it into a random, chaotic string of letters and numbers. This scrambled string is your locked box. You can safely show it to the world, and they will never be able to unscramble it to see your secret.
The Reveal
When it is time to prove your prediction, you finally announce your secret word to the group. The verifier simply takes your word, runs it through the exact same scrambling function, and checks if it matches the locked box that has been sitting on the table the whole time. If it matches perfectly, you have proved you knew the answer all along, and you never changed it.
The Foundation of Fairness
Why go through this trouble? Because human trust over vast distances is fragile and stressful. By using locked boxes, we can hold blind digital auctions, vote securely, or flip a digital coin fairly with someone on the other side of the planet. We replace the anxiety of trusting a stranger with the calm certainty of mathematics.
Unit 3 The Ritual (Trusted Setups) Core8 questions

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.

The Master Lock
Before an arithmetic circuit can be used by millions of people, it needs a set of starting parameters—a master lock. But the mathematics required to generate this lock also produce a dangerous byproduct. Engineers call this byproduct 'toxic waste'. If anyone gets their hands on this toxic waste, they can forge fake mathematical proofs and break the entire system.
The Ceremony
Because we cannot trust any single human or corporation with the toxic waste, we turn to a ritual. We invite hundreds of people from all over the world to participate in a 'Ceremony'. One by one, each person adds a tiny piece of mathematical randomness to the lock. They stir the pot, adding their own secret ingredient to the mixture.
Destroying the Mold
Here is the most important part of the ritual: after a person adds their randomness, they must permanently destroy their own toxic waste—the memory of what they added. They burn the hard drive, smash the computer, or delete the code. They destroy the mold so the key can never be copied.
The Chain of Trust
The mathematical beauty of this ceremony is profound. For the entire system to be compromised, every single participant in the world would have to secretly work together and save their toxic waste. But if even one person out of hundreds honestly destroys their piece, the entire digital system is perfectly secure. It is a monument to human coordination.
Chapter 3

The Proof: SNARKs, Merkle Trees & Recursion

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.

3 units · 8 lessons · 28 practice questions
What your child will be able to do
  • Explain SNARKs as the sealed envelope: tiny proofs for enormous computations
  • Describe Merkle trees as family trees: proving membership without the whole list
  • Understand recursive proofs as infinite Russian dolls: a seed containing a forest
  • Explain why compression makes zero-knowledge proofs practical at scale
Unit 1 The Sealed Envelope (SNARKs) Core8 questions

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.

The Weight of Truth
Imagine writing a one-million-page book to prove a scientific theory. Even if your proof is flawless, it is useless if no one has the time or energy to read it. In early cryptography, verifying a proof took almost as much computing power as creating it. We needed a way to make the truth lighter, so it could travel across the internet without exhausting our machines.
The Magic Shrink Ray (Succinctness)
This is where the 'S' in SNARK comes in. It stands for 'Succinct'. Using the polynomial fingerprints we learned about earlier, a SNARK acts like a mathematical shrink ray. It takes a massive proof that would normally fill gigabytes of hard drive space and compresses it into a tiny digital envelope. The proof becomes so small it feels practically weightless.
The Silent Nod (Non-Interactive)
In the old days of the Alibaba Cave, you had to shout back and forth with your friend twenty times to prove you knew the secret. A SNARK is 'Non-Interactive' (the 'N'). You do not need a live conversation. You simply run the math, seal the tiny proof in an envelope, and drop it on the verifier's desk. You can then walk away. The proof speaks for itself.
The Power of the Post Office
Because the envelope is tiny and self-contained, something revolutionary happens: the verification process takes only a few milliseconds. This means a cheap, low-power cell phone in your pocket can instantly verify that a giant supercomputer on the other side of the planet followed the rules perfectly. It completely democratizes trust.
Unit 2 The Family Tree (Merkle Trees) Core10 questions

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].

The Power of the Root
Think of the 'Root' as the ultimate summary of a library. Instead of checking every page of every book to see if something has been tampered with, we just check the root. If even a single letter in one book changes, the entire root changes. This makes Merkle Trees the perfect 'integrity monitors' for our digital world. We use them to ensure that the data we receive—whether it's a financial transaction or a piece of the human genome—is exactly what it's supposed to be, fast and with perfect certainty.
Privacy in the Branches
The most beautiful part of this tree structure is what it hides. Because you only need to show the specific 'path' to the root to prove your information is valid, the rest of the tree remains invisible to the observer[cite: 698, 699]. It’s like proving you live in a specific house by showing the street map, without having to show the inside of your neighbors' homes. This allows us to trace a single 'leaf' all the way down to the root while keeping the other branches private, balancing total transparency with personal dignity.
Unit 3 The Infinite Russian Doll (Recursive Proofs) Core10 questions

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 Mirror of Truth
Think of recursion like a mirror reflecting a mirror. If you try to hold a million individual receipts in your hand, your biological hard drive—your memory—would crash from the weight. Computers feel the exact same way. So, we taught our machines a beautiful trick. We take one tiny, perfect proof (which cryptographers call a SNARK) and use it to verify the next one. We prove that we checked the proof. It is like packing a suitcase inside another suitcase. By doing this, a massive, heavy database shrinks down to a single mathematical whisper.
Weightless History
Why did we build this? Because humans are social creatures, and to live together in a vast world, we need a way to trust each other. But truth should not belong only to giant supercomputers or kings. By nesting these proofs together, we achieve what engineers call 'Scaling.' It means that you, using just a simple phone, can verify a million actions in a fraction of a second. The truth becomes weightless for everyone. Remember, failure to understand this instantly is just data; if it feels like a magic trick right now, it is just logic wrapped in a beautiful pattern. You are simply learning how we teach rocks to remember infinity.
Chapter 4

The Whisperer in the World: Voting, Passwords & Truth

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.

4 units · 8 lessons · 40 practice questions
What your child will be able to do
  • Describe the perfect vote: democracy that counts hands without revealing them
  • Imagine a world without passwords: proving identity without secrets to remember
  • Explain how proofs can anchor truth when deepfakes make seeing unreliable
  • Connect the protocol to a personal vision of trustworthy technology
Unit 1 The Sudoku Whisperer 10 questions

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.

The Scissors and the Shuffle
Let us step away from computers for a second. If we wanted to prove a Sudoku solution physically, we could use a clever trick. Imagine handing your solved board to a blindfolded referee. The referee randomly chooses to check the rows. They take a pair of scissors, cut out every row, put each row's numbers into a little bag, and shuffle them. Then, they open the bags and see that each bag contains the numbers 1 through 9. Because the numbers were shuffled, no one knows exactly where they were on the board, but the referee knows the row was correct. We hide the position to verify truth.
The Arithmetic Circuit
In the digital world, we do not use scissors or physical bags. Instead, we use arithmetic circuits. We flatten the rules into a digital maze. The computer drops your secret numbers into the maze. The maze checks that every row, column, and 3x3 grid adds up perfectly and contains unique numbers without ever recording the layout. If everything is correct, the circuit lights up and prints a mathematical receipt. You get to prove you perfectly solved the board, and the computer never records a single number.
Unit 2 The Perfect Vote Core10 questions

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.

The Paradox of the Ballot
For centuries, we solved the voting problem using paper slips and dark curtains. It worked beautifully, but it was slow and required us to blindly trust the humans counting the paper. We are now upgrading that ancient technology. Using cryptography, we can mathematically prove that your vote was counted without ever attaching your name to the ballot. Think of it like adding a single drop of blue water to a clear glass; we can measure that the water is bluer, but it is impossible to trace the exact drop back to your hand.
Math as the Referee
When we use Zero-Knowledge proofs for voting, we remove the need for blind trust. You do not have to hope the system is fair; the math guarantees it. This isn't just a technical upgrade for computers; it is a profound shift in how humans coordinate with one another. By making voting un-hackable and entirely private, we protect the most vulnerable voices in the room. We are using invisible mathematical circuits to build an unbreakable shield around the human right to choose.
Unit 3 A World Without Passwords Core10 questions

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.

The Fragility of Secrets
Every time you type a password into a website, you are handing them a secret. If their digital vault breaks, your secret is stolen. It is a fragile, broken system. Zero-Knowledge cryptography flips this entirely. Instead of giving the website your secret, you use math to prove you hold the key, without ever showing the key itself. It is like proving you know the combination to a safe by opening it in front of someone, rather than writing the numbers down on a piece of paper and handing it to a stranger.
The Biological Relief
Your brain was built to remember the faces of your tribe and the paths to the river, not a random string of exclamation points and capital letters. By shifting to a world without passwords, we are actually aligning our digital tools with our biology. When you simply prove your identity mathematically, your mind is freed from the burden of artificial memory. Forgetting a password is not a flaw in your intelligence; it is a flaw in the system. And finally, we are fixing the system.
Unit 4 Truth in an Age of Deepfakes Core10 questions

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.

The Crisis of the Eye
For a century, a photograph was the ultimate proof. But as generative AI masters the art of illusion, a perfect fake can spread across the world in seconds. We can no longer rely on looking closely at pixels to spot a lie. We need a new foundation for truth, one built not on human perception, but on unbreakable math. We must shift our strategy entirely: instead of constantly trying to detect what is fake, we must mathematically prove what is real.
The Cryptographic Lens
Imagine a camera that doesn't just capture light, but instantly wraps that light in a Zero-Knowledge proof. It creates a mathematical receipt that says, 'This exact image was captured by a real physical sensor at this exact time'. Because of the ZK math we learned earlier, a journalist can share this verified image with the world, proving it is absolute reality, without ever revealing their name or location. It is the ultimate shield for truth: perfect verification with perfect safety.

How mastery is tested

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:

Multiple ChoiceThe Blindfolded Detective (The Core Concept) · Chapter 1

Historically, what was the paradox of establishing trust?

Fill in the BlankThe Shadow Maze (Arithmetic Circuits) · Chapter 2

Engineers call the process of turning a thought into pure math '____'.

Order the WordsThe Sealed Envelope (SNARKs) · Chapter 3

Put these words in the correct order:

envelopeItintodigitalcompressestinyita
Multiple ChoiceThe Perfect Vote · Chapter 4

What paradox does democratic voting rely on?

Download as PDF

Print-ready study guide for parents & teachers — the full curriculum unit by unit, chapter outcomes, sample questions and key vocabulary.

Direct Line

Message the founders

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

The Whisper Protocol (Zero-Knowledge Cryptography) | Almanac Academy