Chapter 3

Core Properties of ZK Proofs

Every zero-knowledge proof system aims for three properties. Understanding them helps you spot broken or oversold implementations.

Completeness, soundness, and zero-knowledge define what a proof system must preserve — and what breaks when it does not.

The three guarantees

Property	What it means	If it fails
Completeness	Honest proofs always verify	Legitimate users get rejected
Soundness	False statements cannot be proven	Attackers forge tokens or drain pools
Zero-knowledge	Verifier learns only the claim	Private inputs leak through public metadata

Soundness failures are catastrophic; completeness failures annoy users; zero-knowledge failures leak data the protocol promised to hide.

A cheating prover cannot convince the verifier of a false statement except with negligible probability. Bridge and rollup hacks often trace to broken verification assumptions — not broken cryptography in isolation, but broken soundness in the full system.

Larger proofs cost more gas to verify on chain. Stronger assumptions can reduce proof size but increase trust requirements. Proving time affects user experience — proofs may be generated asynchronously while users wait for confirmation.