#merkle #merkle-tree

merkle_light

Light merkle tree implementation with SPV support and dependency agnostic

4 releases (2 breaking)

0.3.1 Dec 13, 2017
0.3.0 Nov 30, 2017
0.2.0 Nov 25, 2017
0.1.0 Nov 22, 2017

#284 in Cryptography

Download history 9/week @ 2019-08-07 38/week @ 2019-08-14 56/week @ 2019-08-21 39/week @ 2019-08-28 64/week @ 2019-09-04 91/week @ 2019-09-11 120/week @ 2019-09-18 14/week @ 2019-09-25 27/week @ 2019-10-02 54/week @ 2019-10-09 66/week @ 2019-10-16 59/week @ 2019-10-23 53/week @ 2019-10-30

178 downloads per month
Used in 1 crate

BSD-3-Clause

40KB
800 lines

merkle

Build Status Issues License Crates.io

merkle is a lightweight Rust implementation of a Merkle tree.

Features

  • external dependency agnostic
  • std::hash::Hasher compatibility
  • standard types hasher implementations
  • #[derive(Hashable)] support for simple struct
  • customizable merkle leaf/node hashing algorithm
  • support for custom hash types (e.g. [u8; 16], [u64; 4], [u128; 2], struct)
  • customizable hashing algorithm
  • linear memory layout, no nodes on heap
  • buildable from iterator, objects or hashes
  • certificate transparency style merkle hashing support
  • SPV included

Documentation

Documentation is available.

Examples

  • test_sip.rs: algorithm implementation example for std sip hasher, u64 hash items
  • test_xor128.rs: custom hash example xor128
  • test_cmh.rs: custom merkle hasher implementation example
  • crypto_bitcoin_mt.rs: bitcoin merkle tree using crypto lib
  • crypto_chaincore_mt.rs: chain core merkle tree using crypto lib
  • ring_bitcoin_mt.rs: bitcoin merkle tree using ring lib

Quick start

extern crate crypto;
extern crate merkle_light;

use std::fmt;
use std::hash::Hasher;
use std::iter::FromIterator;
use crypto::sha3::{Sha3, Sha3Mode};
use crypto::digest::Digest;
use merkle_light::hash::{Algorithm, Hashable};
use merkle_light::merkle::MerkleTree;

pub struct ExampleAlgorithm(Sha3);

impl ExampleAlgorithm {
    pub fn new() -> ExampleAlgorithm {
        ExampleAlgorithm(Sha3::new(Sha3Mode::Sha3_256))
    }
}

impl Default for ExampleAlgorithm {
    fn default() -> ExampleAlgorithm {
        ExampleAlgorithm::new()
    }
}

impl Hasher for ExampleAlgorithm {
    #[inline]
    fn write(&mut self, msg: &[u8]) {
        self.0.input(msg)
    }

    #[inline]
    fn finish(&self) -> u64 {
        unimplemented!()
    }
}

impl Algorithm<[u8; 32]> for ExampleAlgorithm {
    #[inline]
    fn hash(&mut self) -> [u8; 32] {
        let mut h = [0u8; 32];
        self.0.result(&mut h);
        h
    }

    #[inline]
    fn reset(&mut self) {
        self.0.reset();
    }
}

fn main() {
    let mut h1 = [0u8; 32];
    let mut h2 = [0u8; 32];
    let mut h3 = [0u8; 32];
    h1[0] = 0x11;
    h2[0] = 0x22;
    h3[0] = 0x33;

    let t: MerkleTree<[u8; 32], ExampleAlgorithm> = MerkleTree::from_iter(vec![h1, h2, h3]);
    println!("{:?}", t.root());
}

Bug Reporting

Please report bugs either as pull requests or as issues in the issue tracker. merkle has a full disclosure vulnerability policy. Please do NOT attempt to report any security vulnerability in this code privately to anybody.

License

See LICENSE.

Dependencies

~0–2.3MB
~58K SLoC