Definition

Zero-knowledge proof (ZK proof)

A cryptographic proof that lets one party prove they know a value without revealing the value itself.

ZK proofs originated in 1980s cryptography but only became practical for blockchains in the 2010s. The breakthrough: a prover can convince a verifier that a complex computation was performed correctly, with the verification taking far less work than the computation. This makes them ideal for compressing thousands of transactions into a single succinct proof.

Two common variants in crypto: zk-SNARKs (small proofs, fast verification, but require a trusted setup ceremony) and zk-STARKs (no trusted setup, larger proofs, post-quantum-secure). Most ZK rollups use SNARKs for proof size; some use STARKs for trustlessness.

Beyond rollups, ZK proofs power privacy systems (Zcash hides sender/receiver/amount), identity (proving "I'm over 18" without revealing birthday), and verifiable randomness. They're increasingly central to crypto's scaling and privacy roadmap as zk-native applications mature.

Why it matters

ZK proofs are the cryptographic primitive enabling Ethereum to scale via rollups. They're also the foundation of privacy-preserving on-chain systems.

How CryptoRadar24 tracks it

CryptoRadar24 references ZK technology when reporting on rollup growth, privacy protocols, or major Ethereum scaling milestones.

Related terms

Rollup
A Layer-2 scaling solution that batches many transactions off-chain and posts a compressed summary back to Ethereum (or another L1).
Layer 2 (L2)
A network built on top of a base blockchain (Layer 1) to provide faster, cheaper transactions while inheriting L1 security.
Smart contract
Self-executing code deployed on a blockchain that runs deterministically when called, without requiring an intermediary.

FAQ

Why is it called "zero knowledge"?

Because the proof reveals nothing about the secret value being proven — only that the prover knows it. The verifier learns the statement is true, nothing more.

Are ZK proofs new?

The mathematical concept dates to 1985. What's new is making them efficient enough for blockchains: succinct (small), fast to verify, and feasible for non-trivial computations.

What's the difference between SNARK and STARK?

SNARKs are smaller and faster but require a trusted setup ceremony. STARKs need no trusted setup and are post-quantum-secure but produce larger proofs. Different trade-offs for different applications.

Can ZK proofs be wrong?

In theory no, if the underlying math is sound. In practice, bugs in ZK circuit implementations have caused issues (e.g., zkSync's 2022 prover bug). Soundness depends on both math and code being correct.