12 releases (breaking)

0.22.0 Jul 6, 2020
0.20.1 Apr 14, 2020
0.20.0 Feb 7, 2020
0.18.0 Dec 19, 2019
0.12.2 Mar 29, 2019
Download history 42/week @ 2020-05-28 57/week @ 2020-06-04 16/week @ 2020-06-11 19/week @ 2020-06-18 17/week @ 2020-06-25 39/week @ 2020-07-02 3/week @ 2020-07-09 31/week @ 2020-07-16 16/week @ 2020-07-23 3/week @ 2020-07-30 21/week @ 2020-08-06 38/week @ 2020-08-13 23/week @ 2020-08-20 49/week @ 2020-08-27 59/week @ 2020-09-03 12/week @ 2020-09-10

111 downloads per month
Used in trie-db

Apache-2.0

340KB
9K SLoC

Build Status

Trie

A generic implementation of the Base-16 Modified Merkle Tree ("Trie") data structure, provided under the Apache2 license.

The implementation comes in two formats:

  • Trie DB (trie-db crate) which can be combined with a backend database to provide a persistent trie structure whose contents can be modified and whose root hash is recalculated efficiently.
  • Trie Root (trie-root crate) which provides a closed-form function that accepts a enumeration of keys and values and provides a root calculated entirely in-memory and closed form.

Trie Hash alone is able to be used in no_std builds by disabling its (default) std feature.

In addition to these, several support crates are provided:

  • hash-db crate, used to provide Hasher (trait for all things that can make cryptographic hashes) and HashDB (trait for databases that can have byte slices pushed into them and allow for them to be retrieved based on their hash). Suitable for no_std, though in this case will only provide Hasher.
  • memory-db crate, contains MemoryDB, an implementation of a HashDB using only in in-memory map.
  • hash256-std-hasher crate, an implementation of a std::hash::Hasher for 32-byte keys that have already been hashed. Useful to build the backing HashMap for MemoryDB.

There are also three crates used only for testing:

  • keccak-hasher crate, an implementation of Hasher based on the Keccak-256 algorithm.
  • reference-trie crate, an implementation of a simple trie format; this provides both a NodeCodec and TrieStream implementation making it suitable for both Trie DB and Trie Root.
  • trie-standardmap crate, a key/value generation tool for creating large test datasets to specific qualities.
  • trie-bench crate, a comprehensive standard benchmarking tool for trie format implementations. Works using the criterion project so benchmarking can be done with the stable rustc branch.

In the spirit of all things Rust, this aims to be reliable, secure, and high performance.

Used in the Substrate project. If you use this crate and would your project listed here, please contact us.

Buidling &c.

Building is done through cargo, as you'd expect.

Building

cargo build --all

Testing

cargo test --all

Benchmarking

cargo bench --all

Building in no_std

cargo build --no-default-features

Dependencies

~1.7–2.3MB
~51K SLoC