Commit b988ed5b6bfb0b979a7f0b3255dc3f10a55a4f7e
Update README.md
wanderer authored on 8/5/2017, 3:41:22 AMGitHub committed on 8/5/2017, 3:41:22 AM
Parent: 75e5483567d57db48d64c6dc1c6d3fe26ece9c69
Files changed
| README.md | changed |
| README.md | |||
|---|---|---|---|
| @@ -9,11 +9,12 @@ | |||
| 9 | 9 … | ||
| 10 | 10 … | # SYNOPSIS | |
| 11 | 11 … | This implements a binary merkle radix tree. The point of using a binary radix | |
| 12 | 12 … | tree is that it generates smaller proof size then trees with larger radixes. | |
| 13 | -This tree is well suited for storing large dictonaries of fairly random keys. If | ||
| 14 | -the keys are not random better performance can be achived by hashing them first. | ||
| 15 | -It builds on top of [ipld-graph-builder](https://github.com/ipld/js-ipld-graph-builder) | ||
| 13 … | +This tree is well suited for storing large dictonaries of fairly random keys. | ||
| 14 … | +And is optimized for storing keys of the same length. If the keys are not | ||
| 15 … | +random better performance can be achived by hashing them first.It builds on | ||
| 16 … | +top of [ipld-graph-builder](https://github.com/ipld/js-ipld-graph-builder) | ||
| 16 | 17 … | and the resulting state and proofs are generated using it. | |
| 17 | 18 … | ||
| 18 | 19 … | # INSTALL | |
| 19 | 20 … | `npm install merkle-radix-tree` | |
Built with git-ssb-web