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

smt: change SimpleSmt::open() to return a sparse path

Browse source
This commit is contained in:
Qyriad 2025-04-04 15:14:27 +02:00
parent 5253655e11
commit 6ea938af9e
1 changed files with 10 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
miden-crypto/src/merkle/smt/simple/mod.rs
View file

@ -5,6 +5,7 @@ use super::{
LeafIndex, MerkleError, MerklePath, MutationSet, NodeIndex, RpoDigest, SMT_MAX_DEPTH, LeafIndex, MerkleError, MerklePath, MutationSet, NodeIndex, RpoDigest, SMT_MAX_DEPTH,
SMT_MIN_DEPTH, SparseMerkleTree, Word, SMT_MIN_DEPTH, SparseMerkleTree, Word,
}; };
use crate::merkle::{SparseMerklePath, SparseValuePath};
#[cfg(test)] #[cfg(test)]
mod tests; mod tests;
@ -169,8 +170,15 @@ impl<const DEPTH: u8> SimpleSmt<DEPTH> {
/// Returns an opening of the leaf associated with `key`. Conceptually, an opening is a Merkle /// Returns an opening of the leaf associated with `key`. Conceptually, an opening is a Merkle
/// path to the leaf, as well as the leaf itself. /// path to the leaf, as well as the leaf itself.
pub fn open(&self, key: &LeafIndex<DEPTH>) -> ValuePath { pub fn open(&self, key: &LeafIndex<DEPTH>) -> SparseValuePath {
<Self as SparseMerkleTree<DEPTH>>::open(self, key) let value = RpoDigest::new(self.get_value(key));
let nodes = key.index.proof_indices().map(|index| self.get_node_hash(index));
// `from_sized_iter()` returns an error if there are more nodes than `SMT_MAX_DEPTH`, but
// this could only happen if we have more levels than `SMT_MAX_DEPTH` ourselves, which is
// guarded against in `SimpleSmt::new()`.
let path = SparseMerklePath::from_sized_iter(nodes).unwrap();
SparseValuePath { value, path }
} }
/// Returns a boolean value indicating whether the SMT is empty. /// Returns a boolean value indicating whether the SMT is empty.