Show the crate…
5 releases
0.1.4 | Sep 24, 2020 |
---|---|
0.1.3 | Aug 15, 2020 |
0.1.2 | Aug 13, 2020 |
0.1.1 | Aug 9, 2020 |
0.1.0 | Aug 9, 2020 |
#2 in #asked
59KB
622 lines
Sparse Merkle tree
A sparse Merkle tree implementation that only recomputes its branches’ hashes when asked.
Example
use sp4r53::{blake3, Proof, Tree};
let foo = blake3::hash(b"foo");
let bar = blake3::hash(b"bar");
let baz = blake3::hash(b"baz");
let mut tree = Tree::new();
tree.insert(foo);
tree.insert(bar);
tree.insert(baz);
assert_eq!(tree.is_valid(), false);
let root = tree.flush();
assert_eq!(tree.is_valid(), true);
assert_eq!(tree.root(), Some(root));
let proof = tree.proove(&[foo, baz]).unwrap();
assert_eq!(proof.verify(root), true);
let encoded = proof.as_bytes();
let decoded = Proof::from_bytes(&encoded).unwrap();
assert_eq!(decoded, proof);
tree.remove(bar);
let root = tree.flush();
assert_eq!(proof.verify(root), false);
License
This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
Dependencies
~3MB
~73K SLoC