install
npm install merkle-radix-tree
SYNOPSIS
This implements a binary merkle radix tree. The point of using a binary radix tree is that it generates smaller proof size then trees with larger radixes. This tree is well suited for storing large dictonaries of fairly random keys. And is optimized for storing keys of the same length. If the keys are not random better performance can be achived by hashing them first.It builds on top of ipld-graph-builder and the resulting state and proofs are generated using it.
INSTALL
npm install merkle-radix-tree
USAGE
const IPFS = const RadixTree = // start ipfsconst node = start: false repo: './ipfs-repo' node
API
SPEC
BENCHMARKS
The result of the benchmarks show that the binary radix tree produces proofs on average %67 small then the Ethereum Trie with 100000 keys stored.
TESTS
npm run tests