irkle

A merkle tree lib using blake3 and binary tree arrays for superfast trees ⚡

MIT License

Downloads
723
Stars
2

Irkle

NOTE: This branch is outdated and is not being worked on, in favour of the array-redo branch which brings many preformance improvements. This branch represents the status of the 0.1.0-pre.1 verson of irkle

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

Example

use irkle::Tree;

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

Installation

Simply add the following to your Cargo.toml file:

[depedencies]
irkle = "0.1"

Current status

Creation and verification of merkle trees have been implemented and are fast, but could be greatly improved with the help of parallelization as currently this library is single-threaded.

This is the tracking issue for the multi-threading of irkle: https://github.com/Owez/irkle/issues/1

Package Rankings
Top 46.96% on Crates.io
Badges
Extracted from project README
Tests Docs