EIP-8364
SSZ Compact Multiproofs
A request-friendly Merkle multiproof format using a proof descriptor bitlist
Status history
- Draft4 Aug 2026
Abstract
This EIP introduces a compact encoding for Merkle multiproofs. A multiproof of N tree nodes is encoded as a proof descriptor, a bitlist of 2 * N - 1 bits describing the shape of the proof as a traversal of the Merkle tree, followed by the N nodes in traversal order. The descriptor encodes requested nodes and helper nodes uniformly. The descriptor doubles as a request format: a client can describe…
- Created
- 4 Aug 2026
- Authors
- Zsolt Felföldi, Cayman, Lodekeeper
- Upgrades
- Not listed in any upgrade
- Requires
- —
- Required by
- —