~/notes / reading on-chain data
Zero Knowledge Proofs Without Mathematics
Proving a statement is true without revealing why. What the property buys, where it is used, and what it costs.
A zero knowledge proof convinces a verifier that a statement is true, without revealing anything beyond its truth.
The three properties
Completeness. A true statement can be proven.
Soundness. A false statement cannot be proven, except with negligible probability.
Zero knowledge. The proof reveals nothing except that the statement is true.
The third is the unusual one. Ordinarily, convincing someone means showing them the evidence.
The intuition
Imagine proving you know a password without saying it. You could demonstrate repeatedly that you can do something only the password-holder could do, in a way that never exposes the password itself.
After enough demonstrations, the probability that you are guessing becomes negligible. That is the shape of the argument, and the cryptographic versions make it rigorous and non-interactive.
Where it is actually used
Scaling. This is the dominant use and it has nothing to do with privacy.
A rollup executes thousands of transactions and produces a proof that it executed them correctly. The base layer verifies the proof rather than re-executing the transactions. Verification is much cheaper than execution, which is the entire scaling gain.
The zero knowledge property is incidental here. What matters is succinctness: a small proof standing in for a large computation.
Privacy. Proving a transaction is valid without revealing amounts or parties. Used by privacy-focused protocols.
Identity. Proving an attribute, such as being over an age threshold, without revealing the underlying document.
Bridges. Proving the state of one chain to another without transmitting it.
The costs
Proving is expensive. Generating a proof takes substantially more computation than performing the operation, which is why proving is done by specialised infrastructure.
Setup requirements. Some schemes require a trusted setup ceremony, where parameters are generated and the process must be run honestly. Modern ceremonies involve many participants, and the system is secure if any single one was honest.
Complexity. The implementations are difficult and the flaws are subtle.
What it does not do
It does not make anything anonymous by default. Most chains using this technology for scaling remain fully transparent.
It does not remove the need to trust the code. A bug in the proving system is a bug in the security model.
The practical relevance
For a user of a zero knowledge rollup, the property means faster withdrawals, because validity is proven rather than assumed. No challenge period is needed, which removes the seven-day wait that optimistic designs carry.
That is the entire user-facing difference, and it is why withdrawal timelines differ between rollup families. Which networks a venue supports for deposits and withdrawals, published by platforms such as a venue that supports immediate withdrawal, determines whether you can route around the wait entirely.
# Corrections and technical nitpicks are welcome. Send them over. They get published with the fix.