Zero Knowledge Proof

The concept traces back to a 1985 academic paper by cryptographers Shafi Goldwasser, Silvio Micali, and Charles Rackoff, who first formalized the idea that a proof could convince a verifier without transferring any knowledge beyond the truth of the claim. In practice, a valid zero-knowledge proof satisfies three properties: completeness (a true statement can always be proven), soundness (a false statement cannot be falsely proven, except with negligible probability), and zero-knowledge (the verifier learns nothing else about the underlying data).

Two families of implementation dominate blockchain use today. zk-SNARKs produce very small, cheap-to-verify proofs but typically depend on a one-time trusted setup ceremony and elliptic-curve cryptography that is not quantum-resistant. zk-STARKs avoid any trusted setup, rely only on hash functions, and are considered quantum-resistant, at the cost of larger proof sizes. Both let a network confirm that a computation, such as a transfer, followed the rules, inputs equal outputs, no double-spend occurred, without exposing the sender, recipient, or amount.

• Privacy: shielded transactions on networks like Zcash hide wallet addresses and transaction values while remaining verifiable.
• Scaling: zk-Rollups bundle thousands of transactions off-chain and post a single succinct proof to a base layer such as Ethereum, cutting fees and confirmation times.
• Identity: a user can prove eligibility, such as being over a certain age or holding sufficient funds, without revealing the underlying document or balance.

The main trade-offs are computational cost for the prover, added protocol complexity, and, for SNARK-based systems, reliance on the integrity of the original trusted setup.