This is tree implementation for Rust language. Key features:
hash(Hash0,Hash1) = hash(Hash1,Hash0) = Hash01
{
let values = vec!["one", "two", "three", "four"];
let tree = MerkleTree::new(&values, ALGO);
let proof = tree.build_proof(&"one");
let vec = proof.unwrap();
tree.validate(&vec);
}
Creation and proof build functions are about 7 times faster than in object graph tree.