Crypto Gloss

Zero-Knowledge Proof

A zero-knowledge proof (ZKP) is a cryptographic method that lets a prover convince a verifier that a defined statement is true without revealing the private information, called a witness, used to support it. The verifier still learns the public statement and any information implied by it. “Zero knowledge” is a formal property of a proof system, not a promise that an entire application or blockchain transaction reveals nothing.

How a Zero-Knowledge Proof Works

A proof system is designed around a statement and rules describing what would make that statement true. The prover uses private input to construct a proof; the verifier checks the proof against the public statement and the system’s verification rules. A well-designed system aims for three properties:

  • Completeness: An honest prover with a valid witness can convince an honest verifier that the statement is true.
  • Soundness: A dishonest prover should not be able to make a verifier accept a false statement, except with a negligible probability under the system’s assumptions.
  • Zero knowledge: The proof should not reveal the private witness beyond what can be inferred from the public statement and the fact that the proof verifies.

The familiar “secret cave” story is only an analogy. Real systems use precise mathematical relations, cryptographic assumptions, and software implementations. A proof establishes the claim encoded by its circuit or program; it does not independently establish that the encoded claim is useful, complete, or correctly implemented.

SNARKs and STARKs

SNARK and STARK name families of proof systems, not a single universal product. A SNARK is designed to produce a succinct, noninteractive argument of knowledge. Some SNARK designs need a trusted setup, while others use different setup models or avoid one. If a system has a setup ceremony, its security depends on the construction and on the ceremony’s assumptions; there is no single “toxic waste” risk shared in the same way by every SNARK.

STARKs are designed to be transparent, meaning their security does not rely on a secret setup contribution from a trusted party. Common STARK constructions use hash-based assumptions and can support security arguments intended to withstand known quantum algorithms. Those properties still depend on the specific protocol, parameters, implementation, and assumptions. STARK proofs are often larger than proofs from some SNARK systems, while proving and verification costs vary by application. It is misleading to give one proof size, speed, or security guarantee for every system in either family.

Uses in Blockchains

Validity proofs and rollups: A rollup can execute transactions outside Ethereum’s base layer and submit a validity proof so a contract can check that a proposed state change follows the rollup’s rules. The proof reduces what the base layer needs to recompute. Data availability is a separate design choice: a rollup may publish transaction data on Ethereum, while a validium keeps data elsewhere. “ZK-rollup” is the common name, but the proof’s zero-knowledge property does not automatically make the rollup’s transaction data private.

Shielded transactions: Some privacy protocols use a ZK proof to show that a transaction follows spending rules without publishing selected details such as its sender, receiver, or amount. For example, Zcash’s shielded transaction design uses zk-SNARKs. The privacy result depends on using the shielded features correctly and on the surrounding protocol; transparent transactions, public inputs, timing, addresses, or other metadata can still expose information.

What a ZK Proof Does Not Guarantee

  • It does not automatically hide everything. Public inputs, outputs, transaction timing, network activity, or data posted for availability may reveal information outside the proof’s privacy guarantee.
  • It does not fix a flawed statement. A circuit or verifier bug can make a proof valid for the wrong claim. Code review, testing, upgrade controls, and protocol assumptions still matter.
  • It does not make computation free. Generating proofs may require significant computation. Verification can be cheaper, but its cost and proof size depend on the system and application.
  • It does not guarantee a particular privacy or security level. Those depend on cryptographic assumptions, setup, implementation, parameters, and how users interact with the application.

Zero-knowledge proofs are useful when an application needs to verify a statement while limiting disclosure. To assess a real implementation, identify exactly what it proves, which data remain public, what setup or cryptographic assumptions it relies on, and how the circuit and verifier are maintained.

Social Media Sentiment

A June 2026 r/ethereum discussion asks for a practical explanation of ZK proofs, with comments connecting the idea to both rollup scaling and privacy. Comments connect ZK proofs to scaling and privacy, while some ask how proof generation and verification actually work and distinguish rollups from proof systems. This is a useful snapshot of both interest and confusion, not a measure of broader opinion.

Last updated: 2026-10

Related Terms

See Also

Sources