# Verkle tree structure

DevFeed: [Verkle tree structure](<https://devfeed.tech/articles/verkle-tree-structure-16993.md>)

Original publisher: [Read original article](<https://blog.ethereum.org/en/2021/12/02/verkle-tree-structure>)

Author: Guillaume Ballet; Dankrad Feist

Published: 2021-12-02T00:00:00Z

Content type: tutorial

Language: en

Sources: [Ethereum Foundation Blog](<https://devfeed.tech/sources/ethereum-foundation-blog.md>)

Topics: [Code](<https://devfeed.tech/topics/code.md>), [client](<https://devfeed.tech/topics/client.md>)

Tags: [developers](<https://devfeed.tech/tags/developers.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [implement](<https://devfeed.tech/tags/implement.md>), [introduction](<https://devfeed.tech/tags/introduction.md>), [layout](<https://devfeed.tech/tags/layout.md>), [merge](<https://devfeed.tech/tags/merge.md>), [post](<https://devfeed.tech/tags/post.md>), [research-development](<https://devfeed.tech/tags/research-development.md>), [scheme](<https://devfeed.tech/tags/scheme.md>), [stem](<https://devfeed.tech/tags/stem.md>), [storage](<https://devfeed.tech/tags/storage.md>), [structure](<https://devfeed.tech/tags/structure.md>), [vector](<https://devfeed.tech/tags/vector.md>)

## AI overview

This developer article explains the structure of draft Verkle tree EIP designs. It describes replacing Merkle tree hashes with vector commitments, merging account and storage tries, using 32-byte keys, and organizing keys into 31-byte stems with one-byte suffixes.

## Source excerpt

A Verkle tree is a commitment scheme that works similar to a Merkle tree, but has much smaller witnesses. It works by replacing the hashes in a Merkle tree with a vector commitment, which makes wider branching factors more efficient. Thanks to Kevaundray Wedderburn for feedback on the post....