1 unstable release
0.1.0 | Sep 11, 2024 |
---|
#576 in Algorithms
255 downloads per month
45KB
844 lines
sn-merkle-trie
Minimal implelementation of a StarkNet MPT.
Heavily rely on pathfinder's merkle tree implementation, but target to make it easy port as external dependency + sync primitives with type-rs.
Usage
- tx trie
fn main() {
// transaction tree either pedersen or poseidon
let mut tree = TransactionMerkleTree::Pedersen(MerkleTree::default());
let key1 = from_felt_to_bits(&Felt::from_hex_unchecked("0x0")); // 0b01
let value_1 = Felt::from_hex_unchecked("0x2");
// insert key and value
tree.set(key1.clone(), value_1).unwrap();
// commit tree to get root
let (root, root_idx) = tree.commit().unwrap();
// get proof of inclusion/non-inclusion
let proof = tree.get_proof(root_idx, key1.clone()).unwrap().unwrap();
// verify return membership proof
let mem = tree.verify_proof(root, &key1, value_1, &proof);
}
Dependencies
~4.5MB
~84K SLoC