What Is a Zero-Knowledge Proof?
A zero-knowledge proof is a cryptographic method that lets one party prove a statement is true without revealing the secret information behind it. In crypto, it powers both privacy coins and ZK rollups.
On this page 6
A zero-knowledge proof (ZKP) is a cryptographic method that lets one party prove a statement is true without revealing the secret information behind it. The verifier walks away convinced the claim holds, yet learns nothing else. In crypto, the technique does two very different jobs: it hides transaction details in privacy systems, and it compresses huge amounts of computation into a short proof for scaling networks such as ZK rollups.
How does a zero-knowledge proof work?
Every ZK system has a prover and a verifier. The prover generates a short proof that it knows a secret or ran a computation correctly. The verifier checks that proof and gets a simple yes or no.
A sound ZK system has three properties. Completeness: if the statement is true, an honest prover can convince the verifier. Soundness: if it is false, a cheating prover cannot realistically fool the verifier. Zero knowledge: the verifier learns nothing beyond the fact that the statement is true. The idea was introduced in a 1985 paper by Shafi Goldwasser, Silvio Micali and Charles Rackoff.
A real-world example is age verification. With a ZK-based credential, you could prove you are over 18 without handing over your date of birth. That only works if a trusted issuer verified your identity in the first place; the proof cannot fix bad input data.
zk-SNARKs vs. zk-STARKs
The two most common proof families are zk-SNARKs and zk-STARKs. SNARK proofs are tiny and quick to verify, but many SNARK schemes need a “trusted setup” ceremony at the start. If the secret parameters created in that ceremony are not destroyed, someone could forge proofs.
STARKs need no trusted setup and rely on assumptions considered more resistant to quantum computers. The trade-off is larger proofs. Which family a network picks shapes its costs and its trust assumptions.
Where are ZK proofs used in crypto?
- Scaling (ZK rollups): Thousands of transactions run off-chain, and Ethereum only verifies a short proof that they were processed correctly. ZKsync, Starknet, Scroll and Linea all take this approach. Our Layer 2 guide covers the wider landscape.
- Privacy:Zcash, launched in 2016, uses zk-SNARKs to offer shielded transactions that hide the sender, recipient and amount.
- Identity and compliance: Proving that a user meets a condition without exposing their personal data.
Does “ZK” always mean anonymous?
No. ZK rollups use proofs to show that transactions are valid, while addresses and transfers usually remain fully public. Privacy and validity are separate use cases of the same tool, so when a project markets itself as “ZK”, check what exactly is hidden and what is being proven.
A proof only covers the statement it was built for. It says nothing about bugs elsewhere in the code, who holds the upgrade keys, or whether the input data was accurate.
Frequently asked questions
What is the difference between a ZK rollup and an optimistic rollup?
A ZK rollup posts a validity proof for each batch, while an optimistic rollup assumes batches are valid and leaves time for challenges. That is why exits to Ethereum are usually faster on ZK rollups.
Can a zero-knowledge proof be faked?
Not if the underlying math holds. In practice, the weak points are bugs in the circuit code or a poorly run trusted setup.