ae807a47ae
* feat(smt): impl constructing leaves that don't yet exist This commit implements 'prospective leaf construction' -- computing sparse Merkle tree leaves for a key-value insertion without actually performing that insertion. For SimpleSmt, this is trivial, since the leaf type is simply the value being inserted. For the full Smt, the new leaf payload depends on the existing payload in that leaf. Since almost all leaves are very small, we can just clone the leaf and modify a copy. This will allow us to perform more general prospective changes on Merkle trees. * feat(smt): export get_value() in the trait * feat(smt): implement generic prospective insertions This commit adds two methods to SparseMerkleTree: compute_mutations() and apply_mutations(), which respectively create and consume a new MutationSet type. This type represents as set of changes to a SparseMerkleTree that haven't happened yet, and can be queried on to ensure a set of insertions result in the correct tree root before finalizing and committing the mutation. This is a direct step towards issue 222, and will directly enable removing Merkle tree clones in miden-node InnerState::apply_block(). As part of this change, SparseMerkleTree now requires its Key to be Ord and its Leaf to be Clone (both bounds which were already met by existing implementations). The Ord bound could instead be changed to Eq + Hash, if MutationSet were changed to use a HashMap instead of a BTreeMap. * chore(smt): refactor empty node construction to helper function
60 lines
1.4 KiB
Rust
60 lines
1.4 KiB
Rust
//! Data structures related to Merkle trees based on RPO256 hash function.
|
|
|
|
use super::{
|
|
hash::rpo::{Rpo256, RpoDigest},
|
|
Felt, Word, EMPTY_WORD, ZERO,
|
|
};
|
|
|
|
// REEXPORTS
|
|
// ================================================================================================
|
|
|
|
mod empty_roots;
|
|
pub use empty_roots::EmptySubtreeRoots;
|
|
|
|
mod index;
|
|
pub use index::NodeIndex;
|
|
|
|
mod merkle_tree;
|
|
pub use merkle_tree::{path_to_text, tree_to_text, MerkleTree};
|
|
|
|
mod path;
|
|
pub use path::{MerklePath, RootPath, ValuePath};
|
|
|
|
mod smt;
|
|
pub use smt::{
|
|
LeafIndex, MutationSet, SimpleSmt, Smt, SmtLeaf, SmtLeafError, SmtProof, SmtProofError,
|
|
SMT_DEPTH, SMT_MAX_DEPTH, SMT_MIN_DEPTH,
|
|
};
|
|
|
|
mod mmr;
|
|
pub use mmr::{InOrderIndex, Mmr, MmrDelta, MmrError, MmrPeaks, MmrProof, PartialMmr};
|
|
|
|
mod store;
|
|
pub use store::{DefaultMerkleStore, MerkleStore, RecordingMerkleStore, StoreNode};
|
|
|
|
mod node;
|
|
pub use node::InnerNodeInfo;
|
|
|
|
mod partial_mt;
|
|
pub use partial_mt::PartialMerkleTree;
|
|
|
|
mod error;
|
|
pub use error::MerkleError;
|
|
|
|
// HELPER FUNCTIONS
|
|
// ================================================================================================
|
|
|
|
#[cfg(test)]
|
|
const fn int_to_node(value: u64) -> RpoDigest {
|
|
RpoDigest::new([Felt::new(value), ZERO, ZERO, ZERO])
|
|
}
|
|
|
|
#[cfg(test)]
|
|
const fn int_to_leaf(value: u64) -> Word {
|
|
[Felt::new(value), ZERO, ZERO, ZERO]
|
|
}
|
|
|
|
#[cfg(test)]
|
|
fn digests_to_words(digests: &[RpoDigest]) -> alloc::vec::Vec<Word> {
|
|
digests.iter().map(|d| d.into()).collect()
|
|
}
|