DeFi Intel

Zero-Knowledge Proofs (ZK) Explained: A Complete 2026 Guide

TL;DR

  • Zero-knowledge proofs (ZKPs) let one party (the prover) convince another (the verifier) that a statement is true without revealing why — formalised by Goldwasser, Micali and Rackoff in 1985 and now the cryptographic backbone of Ethereum scaling, on-chain privacy, decentralized identity and verifiable AI.
  • The two dominant proof families are zk-SNARKs (Groth16 2016, PLONK 2019, Halo2) — small proofs, often a trusted setup, pairing-based — and zk-STARKs (Eli Ben-Sasson, StarkWare) — transparent, post-quantum, hash-based, larger proofs.
  • ZK rollups scale Ethereum: ZKsync Era, Starknet, Scroll, Linea, Polygon zkEVM, Taiko. zkVMs generalise proving: Risc Zero, Succinct SP1, Polygon Miden, Cairo. ZK coprocessors (Axiom, Brevis, Lagrange) prove off-chain compute. zkML (EZKL, Modulus Labs) attests AI inference. Privacy layers (Aztec, Aleo, Mina, Zcash, Penumbra) plus identity (World ID, Polygon ID, Anima, Holonym).
  • Hardware acceleration (Cysic, Ulvetanna, Ingonyama) and recursion/folding (Nova, Plonky2/3) drive the cost of proving down by orders of magnitude every year.

Table of contents

What is a zero-knowledge proof?

A zero-knowledge proof (ZKP) is a cryptographic protocol that lets a prover convince a verifier that a statement is true while revealing nothing else — not why it is true, not what data was used to prove it, only the fact of its truth. The classical analogy: imagine proving you know the password to a safe without saying what the password is. Or proving you are over 18 without revealing your date of birth. Or proving a rollup correctly executed a million transactions without making the verifier re-execute any of them.

Concretely, a ZKP system involves a prover who holds a witness (the secret data — e.g. the password, the transaction list, the model weights), a public statement (the claim — e.g. "I know the password to this hash", "this state root is the result of these transactions"), and a verifier who runs a short verification algorithm on the prover's output and accepts or rejects.

A valid ZKP system has three properties:

In modern blockchain ZKPs we add two further desiderata: succinctness (the proof is much smaller than the witness — bytes or a few KB versus megabytes of computation) and non-interactivity (a single proof message, no back-and-forth — making proofs publishable on-chain).

Common terms: prover, verifier, witness, soundness, completeness

History of ZK: from 1985 to 2026

zk-SNARKs vs zk-STARKs vs Bulletproofs

Property zk-SNARK (Groth16/PLONK) zk-STARK Bulletproofs
Proof size ~200 bytes tens to hundreds of KB ~1-2 KB
Verifier time constant, very fast logarithmic in computation linear
Trusted setup yes (per-circuit Groth16; universal PLONK) none none
Post-quantum no (pairing-based) yes (hash-based) no (discrete log)
Best for rollups, on-chain verifier huge computations, post-quantum range proofs, Monero
Examples ZKsync Era, Linea, Polygon zkEVM, Aztec, Tornado Cash Starknet, Polygon Miden, Risc Zero, Succinct SP1 Monero, Findora

zk-SNARKs (Succinct Non-interactive ARguments of Knowledge) have tiny proofs and constant-time verification but rely on elliptic-curve pairings — making them vulnerable to a future quantum computer. Groth16 (2016) needs a per-circuit trusted setup; PLONK (2019) needs a universal trusted setup; Halo2 (2020) eliminates trusted setup via recursion at the cost of larger proofs.

zk-STARKs (Scalable Transparent ARguments of Knowledge), pioneered by Eli Ben-Sasson at StarkWare, use only collision-resistant hash functions (e.g. Rescue, Poseidon, Keccak) and FRI (Fast Reed-Solomon Interactive Oracle Proofs of Proximity) — making them transparent (no trusted setup) and post-quantum secure. Proofs are larger but proving scales better for huge computations.

Bulletproofs, designed by Stanford and UCL researchers in 2017, are non-interactive proofs without trusted setup, optimal for short range proofs (used by Monero) but not succinct enough for general computation.

Proving systems: Groth16, PLONK, Halo2, Plonky2/3, FRI

Why ZK matters: privacy and scalability

ZK gives blockchains two superpowers nothing else does:

  1. Scalability without honesty assumptions — the L1 verifier checks one short proof to gain certainty over millions of off-chain transactions. ZK rollups scale Ethereum effective throughput 50-1000x at fractional gas cost relative to L1.
  2. Privacy with verifiability — a user can keep transaction amounts, balances and identities private while still proving they followed the rules (no double-spend, no insolvent withdrawal). This is the missing piece that public ledgers like Ethereum lack natively.

ZK also unlocks trust-minimised cross-chain communication (light clients), verifiable AI (zkML), on-chain credit and reputation (with private inputs), verifiable randomness (without VRFs), and regulator-friendly compliance (proving sanctioned-address absence without revealing graph data).

ZK rollups: ZKsync, Starknet, Scroll, Linea, Polygon zkEVM, Taiko

zkVMs: Risc Zero, Succinct SP1, Lagrange, Polyhedra, Boundless, Nexus

A zero-knowledge virtual machine generalises proving: instead of writing a circuit per application, developers compile any program (often Rust) to a target ISA (typically RISC-V) and the prover generates a ZK proof of correct execution.

ZK coprocessors: Axiom, Brevis, Lagrange

A ZK coprocessor proves off-chain computation about on-chain data, returning a verifiable result that smart contracts can consume cheaply.

Use cases include governance vote-weighting based on long historical balances, MEV-aware DEX routing, on-chain credit scoring, and trust-minimised cross-chain messaging.

zkML: verifiable AI inference

zkML proves that a specific ML model produced a specific output for a specific input — without revealing the model weights, the input, or both.

The biggest 2025-2026 advance is order-of-magnitude prover speedups making transformer inference verifiable, opening up regulator-grade AI provenance attestation.

Privacy: Aztec, Penumbra, Aleo, Mina, Zcash, Tornado Cash

Identity and proof-of-personhood: World ID, Polygon ID, Anima, Holonym

ZK research labs and standards bodies

Hardware acceleration: Cysic, Ulvetanna, Ingonyama

Recursion and folding: Nova, Plonky2/3

Recursion (proving the validity of one proof inside another) and folding (incrementally accumulating computation into a running instance) are the two techniques that drive proving cost per transaction down. Halo2 and Plonky2 popularised recursion in production. Nova (CMU + Microsoft, 2022) introduced folding via incremental verifiable computation; HyperNova and ProtoStar are the 2024-2025 successors. Folding is particularly important for zkVMs because it lets you accumulate a long execution trace at near-linear prover cost.

Cairo, Sumcheck, Halo2 and emerging proving stacks

Real-world use cases

  1. ZK rollup execution (the dominant ZK use case by gas burned) — every L2 transaction on ZKsync Era, Starknet, Scroll, Linea or Polygon zkEVM relies on ZK.
  2. Worldcoin proof-of-personhood for human-vs-bot gating.
  3. USDC proof-of-reserves via DECO (Circle + Chainlink) — proves USDC reserves match issuance using TLSNotary/DECO.
  4. On-chain MEV-resistant execution — encrypted mempools (Shutter), fair-ordering rollups, ZK threshold encryption.
  5. Private DeFi — Aztec's private DEX and lending; Penumbra's shielded Cosmos DEX.
  6. Cross-chain light clients — Polyhedra, zkBridge, Succinct's bridge applications.
  7. zkML-attested AI inference for regulator-friendly model provenance.
  8. Email & web2 attestations via zk-Email (proof of "I own this email", "I received this OTP").

Risks: trusted setup, prover centralization, audit complexity

The future: ZK everywhere

The 2026-2030 trajectory points to ZK being woven into nearly every layer of crypto and regulator-facing fintech:

FAQ

What is a zero-knowledge proof?

A cryptographic protocol that lets a prover convince a verifier of a statement's truth without revealing why. It satisfies completeness, soundness and zero-knowledge — formalised by Goldwasser, Micali and Rackoff in 1985.

What is the difference between zk-SNARKs and zk-STARKs?

SNARKs produce tiny pairing-based proofs but often need a trusted setup. STARKs are transparent, hash-based and post-quantum, with larger proofs.

What is a ZK rollup?

A Layer 2 chain that batches transactions and posts a ZK proof of correct execution to L1. Examples: ZKsync Era, Starknet, Scroll, Linea, Polygon zkEVM, Taiko.

What is zkML?

Zero-knowledge proofs of ML inference. Leading projects: EZKL, Modulus Labs, plus zkVM-based stacks on Risc Zero and SP1.

What are ZK coprocessors?

Services that prove arbitrary off-chain computation about on-chain data. Major projects: Axiom, Brevis, Lagrange.

What is Worldcoin and how does it use ZK?

Proof-of-personhood project using iris scans and a ZK-backed World ID. Rebranded to "World" in October 2024.

Was Tornado Cash a ZK protocol?

Yes — a Groth16-powered Ethereum mixer; OFAC sanctioned August 2022 (sanctions partly overturned November 2024).

What is Risc Zero zkVM?

A general-purpose RISC-V zkVM that proves correct execution of arbitrary programs.

What is the post-quantum risk for ZK?

Pairing-based SNARKs are vulnerable; STARKs and lattice-based ZK are believed safe. The industry is migrating to hash-based proving systems.

What hardware accelerates ZK proving?

GPUs (Ingonyama ICICLE), FPGAs (Cysic, Ulvetanna), and emerging ZK ASICs.

Glossary

Sources and further reading

About the author

DeFi Intel Research is the in-house research team at DeFi Intel, focused on on-chain capital markets, MEV, ZK infrastructure, and verifiable AI. We track the entire ZK proving stack — proof systems, zkVMs, zkML, ZK coprocessors and hardware acceleration — across mainnet deployments.

Last updated: 2026-04-26

Stay current on this topic

Get the weekly DeFi Intel brief — entity-graph intelligence on zero-knowledge proofs, zk proofs explained, zk snark, free to your inbox.