| Implementation of Binary Trees as specified in EIP-7864 |
|---|
Binary Trees are a novel cryptographic data structure proposed for use in Ethereum to optimize state storage and proof verification. Unlike Merkle Patricia Tries, Binary Trees use a strict binary branching structure, allowing smaller proof sizes. By reducing storage overhead and improving proof efficiency, Binary Trees aim to enhance Ethereum’s scalability while maintaining robust security guarantees.
Note: This library is in an experimental stage and should not be used in production!
To obtain the latest version, simply install the project using npm:
npm install @ethereumjs/binarytreeSee our organizational documentation for an introduction to EthereumJS as well as information on current standards and best practices. If you want to join for work or carry out improvements on the libraries, please review our contribution guidelines first.