mrklt 0.1.0

# // This is a dummy hash function. Don't use this!
# fn hash(c: &[&[u8]]) -> [u8; 32] {
#     let a = c.iter().map(|a| *a).flatten().cloned().fold(0, u8::wrapping_add);
#     [a; 32]
# }
use mrklt::{compute_root, create_proof, Merge, verify_proof};

struct MyHash;

impl Merge for MyHash {
    type Hash = [u8; 32];

    fn leaf(leaf: &[u8; 32]) -> [u8; 32] {
        hash(&[leaf])
    }

    fn merge(left: &[u8; 32], right: &[u8; 32]) -> [u8; 32] {
        hash(&[left, right])
    }
}

let leaves = [[1u8; 32], [2u8; 32], [1u8; 32], [3u8; 32]];
let root = compute_root::<MyHash>(&leaves);
let proof = create_proof::<MyHash>(1, &leaves);
assert_eq!(root, verify_proof::<MyHash>(&leaves[1], &proof));