rcmerkle

Merkle Tree to calculate Root.

Suppert Two Way:

• One is traditional use MerkleTree, it need send all hashed list.
• Two is efficient, but need to save state, like state machine. it need send new value, it will return the lastest root.

Example:

```rust use rcmerkle::{BetterMerkleTreeSHA256, Hash, MerkleTreeSHA256, SHA256};

let list = [ "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", ]; let hashedlist: Vec = list.iter().map(|v| SHA256::hash(v.asbytes())).collect();

let mut better_merkle = BetterMerkleTreeSHA256::new();

for i in 0..hashedlist.len() { let root1 = MerkleTreeSHA256::root(hashedlist[0..i + 1].tovec()); let root2 = bettermerkle.root(hashedlist[i].clone()); asserteq!(root1, root2); } ```

License

This project is licensed under either of

• Apache License, Version 2.0, (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
• MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)

at your option.