# Test vectors for binary trees ## Tree only ### Single entry Input: |key|value| |-|-| |`0x0000000000000000000000000000000000000000000000000000000000000000`|`0x0101010101010101010101010101010101010101010101010101010101010101`| Root hash: `0x694545468677064fd833cddc8455762fe6b21c6cabe2fc172529e0f573181cd5` ### Two entries, different first bit Input: |key|value| |-|-| |`0x0000000000000000000000000000000000000000000000000000000000000000`|`0x0101010101010101010101010101010101010101010101010101010101010101`| |`0x8000000000000000000000000000000000000000000000000000000000000000`|`0x0202020202020202020202020202020202020202020202020202020202020202`| Root hash: `0x85fc622076752a6fcda2c886c18058d639066a83473d9684704b5a29455ed2ed` ### One stem, colocated values Input: |key|value| |-|-| |`0x0000000000000000000000000000000000000000000000000000000000000003`|`0x0101010101010101010101010101010101010101010101010101010101010101`| |`0x0000000000000000000000000000000000000000000000000000000000000004`|`0x0202020202020202020202020202020202020202020202020202020202020202`| |`0x0000000000000000000000000000000000000000000000000000000000000009`|`0x0303030303030303030303030303030303030303030303030303030303030303`| |`0x00000000000000000000000000000000000000000000000000000000000000FF`|`0x0404040404040404040404040404040404040404040404040404040404040404`| Root hash: `0xaa12acb5689a2dc03e9d7ab0350449c70cdad286750dc8ba1dd092f5e100191a` ```graphviz digraph D { stem [label="stem=00000000000000000000000000000000000000000000000000000000000000 c=aa12acb5689a2dc03e9d7ab0350449c70cdad286750dc8ba1dd092f5e100191a"] stem3 [label="0101010101010101010101010101010101010101010101010101010101010101"] stem -> stem3 stem4 [label="0202020202020202020202020202020202020202020202020202020202020202"] stem -> stem4 stem9 [label="0303030303030303030303030303030303030303030303030303030303030303"] stem -> stem9 stemff [label="0404040404040404040404040404040404040404040404040404040404040404"] stem -> stemff } ``` ### Two stems, colocated values Input: |key|value| |-|-| |`0x0000000000000000000000000000000000000000000000000000000000000003`|`0x0101010101010101010101010101010101010101010101010101010101010101`| |`0x0000000000000000000000000000000000000000000000000000000000000004`|`0x0202020202020202020202020202020202020202020202020202020202020202`| `0x8000000000000000000000000000000000000000000000000000000000000003`|`0x0101010101010101010101010101010101010101010101010101010101010101`| |`0x8000000000000000000000000000000000000000000000000000000000000004`|`0x0202020202020202020202020202020202020202020202020202020202020202`| Root hash: `0x6387c711dfeaa802e67f83bedb504d42e1bc89f64c4e44aa69d207351b2a03e5` ```graphviz digraph D { internal [label="I: 6387c711dfeaa802e67f83bedb504d42e1bc89f64c4e44aa69d207351b2a03e5"] stem00 [label="stem=00000000000000000000000000000000000000000000000000000000000000 c=e77de4e7005043405021c0aca9beb1a09c3574f097fbe0beb470332b4f7645c7"] internal -> stem00 stem003 [label="0101010101010101010101010101010101010101010101010101010101010101"] stem00 -> stem003 stem004 [label="0202020202020202020202020202020202020202020202020202020202020202"] stem00 -> stem004 stem01 [label="stem=80000000000000000000000000000000000000000000000000000000000000 c=79d3b6ed207de8eac7e03b588de7f1088c3a756ca4770769c6ea57d7e6de1ce1"] internal -> stem01 stem013 [label="0101010101010101010101010101010101010101010101010101010101010101"] stem01 -> stem013 stem014 [label="0202020202020202020202020202020202020202020202020202020202020202"] stem01 -> stem014 } ``` ## Account + storage
Last changed by  
 
Guillaume Ballet
41

Read more

State storage transition using an overlay tree

Describes the use of an overlay tree to use the verkle tree structure, while leaving the historical state untouched.

2/2/2024
Syncing the execution layer of the beverlyhills testnet

Create two subdirectories: execution and consensus in a dedicated directory of your choice. Clone the beverly hills branch of gballet/go-ethereum $ git clone https://github.com/gballet/go-ethereum $ cd go-ethereum $ git checkout beverly-hills-head Build geth and come back to the root directory $ go build ./cmd/geth/

1/3/2023
The latest state of Verkle trees

Verkle trees Why verkle trees Condrieu spec Latest testnet update Condrieu testnet updates April 5th March 7th

4/5/2022
Condrieu testnet April 5th, 2022 update

Condrieu has been relaunched twice and enhanced. The update contains mostly bug fixes and cosmetic changes. Achieved goals On top of the goals achieved in the previous round, this testnet: underwent stress-testing by creating many addresses and sending transactions between them now uses ethstats to capture sync issues has a complete landing page Issues found

4/5/2022
Read more from Guillaume Ballet
Published on HackMD