Proving computation without revealing inputs
A zero-knowledge proof demonstrates that a statement is true without revealing the information that makes it true. A prover knows a secret (input) and uses it to generate a proof of a specific property (output) without disclosing the secret itself. The verifier checks the proof mathematically and concludes the property is true. For example, a prover can prove they know a password without sending it, or that a computation produced a valid result without showing the intermediate steps.
Cryptographic efficiency and blockchain scaling
ZK proofs are small and cheap to verify, making them ideal for blockchain scaling. A rollup can execute thousands of transactions off-chain, generate a proof that all executions were valid, and post only the proof to the main chain. Verification requires microseconds of computation, far faster than re-executing all transactions. The proof is cryptographically sound: a false computation cannot produce a valid proof. This efficiency unlocks Layer 2 scaling without trusting a central sequencer.