[−][src]Crate irkle

A blake3-based merkle (hash) tree implementation for superfast trees ⚡

Example

use irkle::Tree;

fn main() {
    println!("{:#?}", Tree::new(vec!["hello", "there"]));
}

Simply add the following to your Cargo.toml file:

[depedencies]
irkle = "0.1"

Data	The final datablock, containing the data needed
Node	A middle-layer node, containing two nodes underneith that is of some NodeType variation
Tree	A merkle tree

Types of node that may be children

Trait for running methods on any abstract kind of node, such as hash verification or just getting the hash