pmtree/tests/sled_keccak.rs

121 lines
3.1 KiB
Rust

use hex_literal::hex;
use pmtree::*;
use std::fs;
use tiny_keccak::{Hasher as _, Keccak};
struct MyKeccak(Keccak);
struct MySled(sled::Db);
#[derive(Clone, Copy, Debug, Default, PartialEq, Eq)]
struct MyFr([u8; 32]);
impl Database for MySled {
fn new(dbpath: &str) -> Result<Self> {
let db = sled::open(dbpath).unwrap();
if db.was_recovered() {
return Err(Error("Database exists, try load()!".to_string()));
}
Ok(MySled(db))
}
fn load(dbpath: &str) -> Result<Self> {
let db = sled::open(dbpath).unwrap();
if !db.was_recovered() {
println!("Hello world");
fs::remove_dir_all(dbpath).expect("Error removing db");
return Err(Error("Trying to load non-existing database!".to_string()));
}
Ok(MySled(db))
}
fn get(&self, key: DBKey) -> Result<Option<Value>> {
Ok(self.0.get(key).unwrap().map(|val| val.to_vec()))
}
fn put(&mut self, key: DBKey, value: Value) -> Result<()> {
self.0.insert(key, value).unwrap();
self.0.flush().unwrap();
Ok(())
}
}
impl From<Vec<u8>> for MyFr {
fn from(v: Vec<u8>) -> Self {
let v = v.try_into().unwrap();
MyFr(v)
}
}
impl From<MyFr> for Vec<u8> {
fn from(v: MyFr) -> Self {
v.0.to_vec()
}
}
impl Hasher for MyKeccak {
type Fr = MyFr;
fn default_leaf() -> Self::Fr {
MyFr([0; 32])
}
fn hash(input: &[Self::Fr]) -> Self::Fr {
let mut output = [0; 32];
let mut hasher = Keccak::v256();
for element in input {
hasher.update(&element.0);
}
hasher.finalize(&mut output);
MyFr(output)
}
}
#[test]
fn insert_delete() -> Result<()> {
let mut mt = MerkleTree::<MySled, 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()?, MyFr(default_tree_root));
let roots = [
hex!("c1ba1812ff680ce84c1d5b4f1087eeb08147a4d510f3496b2849df3a73f5af95"),
hex!("893760ec5b5bee236f29e85aef64f17139c3c1b7ff24ce64eb6315fca0f2485b"),
hex!("222ff5e0b5877792c2bc1670e2ccd0c2c97cd7bb1672a57d598db05092d3d72c"),
hex!("a9bb8c3f1f12e9aa903a50c47f314b57610a3ab32f2d463293f58836def38d36"),
];
for i in 0..leaves.len() {
mt.update_next(MyFr(leaves[i]))?;
assert_eq!(mt.root()?, MyFr(roots[i]));
}
for i in (0..leaves.len()).rev() {
mt.delete(i)?;
}
assert_eq!(mt.root()?, MyFr(default_tree_root));
assert!(mt.update_next(MyFr(leaves[0])).is_err());
fs::remove_dir_all("abacaba").expect("Error removing db");
Ok(())
}