Set of functions for creating Merkle Tree, proofs and verifying proofs using binary data
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Merkle tree implemented as a persistent datastructure
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
You want Ethereum's [merkle-patricia tree](https://github.com/wanderer/merkle-patricia-tree), but you don't care about the stateRoot. Fake it! And reap the optimization benefits.
Utilities to work with merkle trees
**@fuel-ts/merkle** is a sub-module for interacting with **Fuel**.
A performance conscious library for merkle root and tree calculations.
Lean Incremental Merkle tree implementation in TypeScript.
A circuit to calculate the root of a binary Merkle tree using a provided proof-of-membership.
The primary functions of the world state package are to maintain the collection of Merkle Trees comprising the global state of the system and to offer an interface with which the trees can be queried.
Lean Incremental Merkle tree implementation in TypeScript.
SPL Account Compression Program JS API
An Ethereum statemanager implementation
The Merkle Trees package contains typescript implementations of the various Merkle Trees required by the system.
Binary Search Trees
Incremental Merkle tree implementation in TypeScript.
Tree or binary tree printer, print any tree to terminal or debug window
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
Incremental Merkle tree implementation in TypeScript.
Different binary search tree implementations, including a self-balancing one (AVL)
Incremental Merkle tree implementations in Solidity.
A stream that generates a merkle tree based on the incoming data.