✳flâneur — a map of the web's best reading

Verkle trees | ethereum.org

ethereum.org · 1,386 words · saved by 1 readers

There’s a new version of this page but it’s only in English right now. Help us translate the latest version. This page is not being translated. We've intentionally left this page in English for now. Page last updated: January 26, 2024 Verkle trees (a portmanteau of "Vector commitment" and "Merkle Trees") are a data structure that can be used to upgrade Ethereum nodes so that they can stop storing large amounts of state data without losing the ability to validate blocks. Verkle trees are a critical step on the path to stateless Ethereum clients. Stateless clients are ones that do not have to store the entire state database in order to validate incoming blocks. Instead of using their own local copy of Ethereum's state to verify blocks, stateless clients use a "witness" to the state data that arrives with the block. A witness is a collection of individual pieces of the state data that are required to execute a particular set of transactions, and a cryptographic proof that the witness is r

Page last update: June 24, 2026 c (opens in a new tab) b (opens in a new tab) e (opens in a new tab) + 10 See contributors Copy .md Copy .md Edit page (opens in a new tab) Verkle trees (a portmanteau of "Vector commitment" and "Merkle Trees") are a data structure that can be used to upgrade Ethereum nodes so that they can stop storing large amounts of state data without losing the ability to validate blocks. Statelessness Verkle trees are a critical step on the path to stateless Ethereum clients. Stateless clients are ones that do not have to store the entire state database in order to validat

Explore this link on the map →

related reading