Archivecryptography
Verkle Trees Shrink Witnesses
Vector commitments replace per-level hashes, so proofs stay small as the tree widens.
- Published
- Reading time
- 1 min read
A merkle tree proof includes a sibling hash at every level, so depth grows with the log of the key space and proofs grow with depth. A verkle tree replaces hashes with vector commitments (often KZG or IPA), so a proof can cover many children at once.
The gain
- Wider trees: branching factors in the hundreds, so depth drops to a handful of levels.
- Smaller witnesses: a proof is a few commitments plus openings, not dozens of hashes.
- Same interface: membership proofs still verify against a root.
The costs
- Commitment schemes require trusted setup (KZG) or heavier math (IPA).
- Proving and verification are more expensive per operation than hashing.
- Implementations and tooling are younger than merkle trees.
Why it matters
State witnesses are the bottleneck for stateless clients and light verification. Smaller witnesses make it feasible to validate blocks without holding the full state.
Takeaway: verkle trees are a witness-size optimization for large state. If your proofs are already small, merkle trees remain simpler and cheaper.