mirror of https://github.com/vacp2p/pmtree.git
100 lines
2.6 KiB
Rust
100 lines
2.6 KiB
Rust
use hex_literal::hex;
|
|
use pmtree::*;
|
|
use std::collections::HashMap;
|
|
use tiny_keccak::{Hasher as _, Keccak};
|
|
|
|
struct MemoryDB(HashMap<DBKey, Value>);
|
|
struct MyKeccak(Keccak);
|
|
|
|
impl Database for MemoryDB {
|
|
fn new(_dbpath: &str) -> Result<Self> {
|
|
Ok(MemoryDB(HashMap::new()))
|
|
}
|
|
|
|
fn load(_dbpath: &str) -> Result<Self> {
|
|
Err(Error("Cannot load in-memory DB".to_string()))
|
|
}
|
|
|
|
fn get(&self, key: DBKey) -> Result<Option<Value>> {
|
|
Ok(self.0.get(&key).cloned())
|
|
}
|
|
|
|
fn put(&mut self, key: DBKey, value: Value) -> Result<()> {
|
|
self.0.insert(key, value);
|
|
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
impl Hasher for MyKeccak {
|
|
type Fr = [u8; 32];
|
|
|
|
fn default_leaf() -> Self::Fr {
|
|
[0; 32]
|
|
}
|
|
|
|
fn serialize(value: Self::Fr) -> Value {
|
|
value.to_vec()
|
|
}
|
|
|
|
fn deserialize(value: Value) -> Self::Fr {
|
|
value.try_into().unwrap()
|
|
}
|
|
|
|
fn hash(input: &[Self::Fr]) -> Self::Fr {
|
|
let mut output = [0; 32];
|
|
let mut hasher = Keccak::v256();
|
|
for element in input {
|
|
hasher.update(element);
|
|
}
|
|
hasher.finalize(&mut output);
|
|
output
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn insert_delete() -> Result<()> {
|
|
let mut mt = MerkleTree::<MemoryDB, MyKeccak>::new(2, "abacaba")?;
|
|
|
|
assert_eq!(mt.capacity(), 4);
|
|
assert_eq!(mt.depth(), 2);
|
|
|
|
let leaves = [
|
|
hex!("0000000000000000000000000000000000000000000000000000000000000001"),
|
|
hex!("0000000000000000000000000000000000000000000000000000000000000002"),
|
|
hex!("0000000000000000000000000000000000000000000000000000000000000003"),
|
|
hex!("0000000000000000000000000000000000000000000000000000000000000004"),
|
|
];
|
|
|
|
let default_tree_root =
|
|
hex!("b4c11951957c6f8f642c4af61cd6b24640fec6dc7fc607ee8206a99e92410d30");
|
|
|
|
assert_eq!(mt.root(), default_tree_root);
|
|
|
|
let roots = [
|
|
hex!("c1ba1812ff680ce84c1d5b4f1087eeb08147a4d510f3496b2849df3a73f5af95"),
|
|
hex!("893760ec5b5bee236f29e85aef64f17139c3c1b7ff24ce64eb6315fca0f2485b"),
|
|
hex!("222ff5e0b5877792c2bc1670e2ccd0c2c97cd7bb1672a57d598db05092d3d72c"),
|
|
hex!("a9bb8c3f1f12e9aa903a50c47f314b57610a3ab32f2d463293f58836def38d36"),
|
|
];
|
|
|
|
for i in 0..leaves.len() {
|
|
mt.update_next(leaves[i])?;
|
|
assert_eq!(mt.root(), roots[i]);
|
|
}
|
|
|
|
for (i, &leaf) in leaves.iter().enumerate() {
|
|
assert!(mt.verify(&leaf, &mt.proof(i)?));
|
|
}
|
|
|
|
for i in (0..leaves.len()).rev() {
|
|
mt.delete(i)?;
|
|
}
|
|
|
|
assert_eq!(mt.root(), default_tree_root);
|
|
|
|
assert!(mt.update_next(leaves[0]).is_err());
|
|
|
|
Ok(())
|
|
}
|