Computational cryptography › Not live yet › Hash-based
COMMITMENTPlanned, not live yetPlanned: I*

Binary state tree (EIP-7864)

In plain words

Planned: a simpler, more proof-friendly way to store Ethereum's state.

Why it matters: Smaller proofs for light clients and zero-knowledge provers.

The details

On the map: replaces the Keccak Merkle- Patricia trie, hash TBD: BLAKE3, Keccak or Poseidon2

Map note, rests on: collision resistance of the chosen hash

EIP-7864 would replace the Merkle-Patricia tries with a single binary tree[1], targeted at strawmap fork I*[2]. Binary trees give much smaller proofs, which matters for stateless clients and for proving execution in ZK.

The hash function is not decided: the draft uses BLAKE3 for experimentation, with Keccak and Poseidon2 as candidates. Security rests on that hash's collision resistance.

Rests on

If any of these breaks, this breaks too.

If it falls

If this breaks, these break with it.

Nothing on the map depends on it: it is an end point of the roadmap.

References

  1. Vitalik Buterin, Guillaume Ballet, Dankrad Feist et al. EIP-7864: Ethereum state using a unified binary tree. Ethereum Improvement Proposals (Draft), 2025. eips.ethereum.org/EIPS/eip-7864
  2. Justin Drake, Julian Ma, Toni Wahrstätter and Vitalik Buterin. L1 Strawmap: Ethereum Draft Roadmap. Ethereum Foundation Protocol, 2026. strawmap.org