Verkle Tree

A Verkle tree is an authenticated data structure whose name fuses Vector commitment and Merkle tree. It replaces the hash-based branching of a Merkle tree with a vector commitment at each node, dramatically shrinking the proofs, called witnesses, needed to demonstrate that a piece of data belongs in the tree. It was proposed as a path toward stateless block validation, where nodes verify blocks without storing the full state.

Why witnesses shrink

In a Merkle tree, proving one leaf requires revealing every sibling hash along the path to the root, so wide trees produce large proofs. A Verkle tree can use much wider nodes because the vector commitment lets a single short proof cover all children at once. The practical effect is striking: a witness covering a thousand leaves that would run to several megabytes in a Merkle trie collapses to roughly a hundred kilobytes in a Verkle tree.

Tradeoffs

The smaller witnesses come at the price of heavier cryptography. The polynomial vector commitments typically use KZG-style pairing arithmetic, making proof generation more computationally intensive than simple hashing. The payoff is that small witnesses can travel alongside a block, letting a lightweight verifier validate it without a local copy of the entire state.

Verkle trees are an applied form of the vector commitment, and their proofs commonly rest on the KZG polynomial commitment.