qyriad/miden-crypto
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

refactor: modify MerkleStore::non_empty_leaves to support TSMT

Browse source
This commit is contained in:
frisitano 2023-09-19 16:01:52 +08:00
parent 90dd3acb12
commit 1fa2895724
1 changed files with 10 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
src/merkle/store/mod.rs
View file

@ -346,10 +346,13 @@ impl<T: KvMap<RpoDigest, StoreNode>> MerkleStore<T> {
core::iter::from_fn(move || { core::iter::from_fn(move || {
while let Some((index, node_hash)) = stack.pop() { while let Some((index, node_hash)) = stack.pop() {
// if we are at the max depth then we have reached a leaf
if index.depth() == max_depth { if index.depth() == max_depth {
return Some((index, node_hash)); return Some((index, node_hash));
} }
// fetch the nodes children and push them onto the stack if they are not the roots
// of empty subtrees
if let Some(node) = self.nodes.get(&node_hash) { if let Some(node) = self.nodes.get(&node_hash) {
if !empty_roots.contains(&node.left) { if !empty_roots.contains(&node.left) {
stack.push((index.left_child(), node.left)); stack.push((index.left_child(), node.left));
@ -357,6 +360,13 @@ impl<T: KvMap<RpoDigest, StoreNode>> MerkleStore<T> {
if !empty_roots.contains(&node.right) { if !empty_roots.contains(&node.right) {
stack.push((index.right_child(), node.right)); stack.push((index.right_child(), node.right));
} }
// if the node is not in the store assume it is a leaf
} else {
// assert that if we have a leaf that is not at the max depth then it must be
// at the depth of one of the tiers of an TSMT.
debug_assert!(TieredSmt::TIER_DEPTHS[..3].contains(&index.depth()));
return Some((index, node_hash));
} }
} }