The previous chapter (see Chapter 8, Cryptography Basics) established the primitives on which all of Web3 rests: hash functions that fingerprint data, and public-key pairs that let strangers sign and verify messages without ever sharing a secret. Those tools are powerful, but they are also, in a sense, conservative — they secure data and authenticate identity much as a wax seal or a signature always has. This chapter turns to a stranger and more recent body of work, sometimes called "exotic" or "advanced" cryptography, that does something the wax seal cannot: it lets one party prove a statement is true while revealing nothing beyond the fact of its truth, lets mutually distrustful parties compute a joint answer over data none of them will disclose, and lets a server process information it is never permitted to read. This chapter argues that these techniques are not a footnote to Web3 but close to its conceptual core — and that, properly understood, Web3 is better described as a cryptographic re-architecture of the web than as "blockchains."
Invite one friend to subscribe and this chapter opens here.
Your invite link
In plain terms
A normal blockchain works because everybody can see everything. That is great for catching cheaters, but terrible for privacy — it is like a town where the only way to prove you paid your debts is to let every neighbor read your diary. The question advanced cryptography asks is: can we keep the checking without keeping the exposure?
A zero-knowledge proof is like proving you have the key to a locked room by repeatedly walking out of whichever door someone names — over and over until coincidence is no explanation — without ever showing the key or even letting anyone see it. The watcher ends up certain you have it, and learns absolutely nothing else.
Both are ways to write down a proof that is far smaller than the thing it proves, so anyone can check it in an instant. SNARKs make the smallest, cheapest proofs but require a delicate one-time setup ritual that must be trusted. STARKs need no such ritual and are more future-proof against quantum computers, but their proofs are chunkier. Neither is strictly better; engineers choose based on what they are willing to trade.
Imagine a room of people who want to know their average salary but refuse to tell anyone their own. MPC is a mathematical procedure that, run among them, spits out the correct average while guaranteeing that no one — not even the person running the calculation — ever learns what any single person earns. It is collaborative arithmetic with the inputs kept under lock and key.
Fully homomorphic encryption lets you hand your most sensitive data to an untrusted computer — a cloud server, say — have it do real work on that data, and get back a correct answer, all while the computer never once sees what your data actually is. It is like mailing a locked safe to an accountant who tallies the cash inside without ever opening it, then mails the locked total back to you.
A threshold signature is a key cut into pieces and handed to different guardians, so that signing requires several of them to act together and no single thief — or single careless mistake — can move the money. BLS signatures add a second trick: thousands of separate approvals can be folded into one tiny stamp that proves they all agreed, which is what lets large networks keep up.
It is tempting to think Web3 is blockchains, with cryptography as a supporting detail. This chapter argues it is closer to the opposite: advanced cryptography is the heart of the project, and the blockchain is one organ among several. Several of Web3's biggest promises — prove who you are without exposing yourself, compute on data you never reveal, keep records private yet checkable — can be kept with little or no blockchain at all.
What the chapter covers
- Why radical transparency is the problem to be solved
- Zero-knowledge proofs: proving you know without showing what you know
- zk-SNARKs and zk-STARKs: making proofs small and self-contained
- Zcash: the first major deployment
- Secure multi-party computation: a joint answer from private inputs
- Fully homomorphic encryption: computing on data you cannot read
- Threshold and BLS signatures: a key no single party holds
- Commitment schemes: the sealed envelope
- The thesis: Web3 as a cryptographic re-architecture of the web
- Honest limits: cost, complexity, and "moon math"
- Synthesis
Terms explained in this chapter
The full chapter is in the book.
Buy the full bookGet Chapter 8 free
Subscribe and Chapter 8, on cryptography, opens for you on this site. Invite friends and the rest of Part III opens too.
One email to confirm, then Web3 in plain terms, a free seven-day email course, and an occasional note about the book. Unsubscribe any time.