arnaucube/miden-crypto
1
0
Fork 0
mirror of https://github.com/arnaucube/miden-crypto.git synced 2026-01-09 15:41:30 +01:00
Code Issues Projects Releases Wiki Activity

feat: added From convertions for the MerkleStore

Browse Source
This commit is contained in:
Augusto F. Hack
2023-04-21 14:45:50 +02:00
parent eb316f51bc
commit 59595a2e04
3 changed files with 52 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
benches/store.rs
View File

@@ -34,7 +34,7 @@ fn get_empty_leaf_simplesmt(c: &mut Criterion) {
// both SMT and the store are pre-populated with empty hashes, accessing these values is what is
// being benchmarked here, so no values are inserted into the backends
let smt = SimpleSmt::new(depth).unwrap();
let store = MerkleStore::new();
let store: MerkleStore = smt.clone().into();
let root = smt.root();
group.bench_function(BenchmarkId::new("SimpleSmt", depth), |b| {
@@ -66,8 +66,7 @@ fn get_leaf_merkletree(c: &mut Criterion) {
let mtree_leaves: Vec<Word> = leaves.iter().map(|v| v.into()).collect();
let mtree = MerkleTree::new(mtree_leaves.clone()).unwrap();
let mut store = MerkleStore::new();
store.extend(mtree.inner_nodes());
let store: MerkleStore = mtree.clone().into();
let depth = mtree.depth();
let root = mtree.root();
let size_u64 = size as u64;
@@ -109,8 +108,7 @@ fn get_leaf_simplesmt(c: &mut Criterion) {
.unwrap()
.with_leaves(smt_leaves.clone())
.unwrap();
let mut store = MerkleStore::new();
store.extend(smt.inner_nodes());
let store: MerkleStore = smt.clone().into();
let depth = smt.depth();
let root = smt.root();
let size_u64 = size as u64;
@@ -143,7 +141,7 @@ fn get_node_of_empty_simplesmt(c: &mut Criterion) {
// of these values is what is being benchmarked here, so no values are inserted into the
// backends.
let smt = SimpleSmt::new(depth).unwrap();
let store = MerkleStore::new();
let store: MerkleStore = smt.clone().into();
let root = smt.root();
let half_depth = depth / 2;
let half_size = 2_u64.pow(half_depth as u32);
@@ -178,8 +176,7 @@ fn get_node_merkletree(c: &mut Criterion) {
let mtree_leaves: Vec<Word> = leaves.iter().map(|v| v.into()).collect();
let mtree = MerkleTree::new(mtree_leaves.clone()).unwrap();
let mut store = MerkleStore::new();
store.extend(mtree.inner_nodes());
let store: MerkleStore = mtree.clone().into();
let root = mtree.root();
let half_depth = mtree.depth() / 2;
let half_size = 2_u64.pow(half_depth as u32);
@@ -222,8 +219,7 @@ fn get_node_simplesmt(c: &mut Criterion) {
.unwrap()
.with_leaves(smt_leaves.clone())
.unwrap();
let mut store = MerkleStore::new();
store.extend(smt.inner_nodes());
let store: MerkleStore = smt.clone().into();
let root = smt.root();
let half_depth = smt.depth() / 2;
let half_size = 2_u64.pow(half_depth as u32);
@@ -258,8 +254,7 @@ fn get_leaf_path_merkletree(c: &mut Criterion) {
let mtree_leaves: Vec<Word> = leaves.iter().map(|v| v.into()).collect();
let mtree = MerkleTree::new(mtree_leaves.clone()).unwrap();
let mut store = MerkleStore::new();
store.extend(mtree.inner_nodes());
let store: MerkleStore = mtree.clone().into();
let depth = mtree.depth();
let root = mtree.root();
let size_u64 = size as u64;
@@ -301,8 +296,7 @@ fn get_leaf_path_simplesmt(c: &mut Criterion) {
.unwrap()
.with_leaves(smt_leaves.clone())
.unwrap();
let mut store = MerkleStore::new();
store.extend(smt.inner_nodes());
let store: MerkleStore = smt.clone().into();
let depth = smt.depth();
let root = smt.root();
let size_u64 = size as u64;
@@ -352,7 +346,7 @@ fn new(c: &mut Criterion) {
|| leaves.iter().map(|v| v.into()).collect::<Vec<Word>>(),
|l| {
let mtree = MerkleTree::new(l).unwrap();
black_box(MerkleStore::new().extend(mtree.inner_nodes()));
black_box(MerkleStore::from(mtree));
},
BatchSize::SmallInput,
)
@@ -383,7 +377,7 @@ fn new(c: &mut Criterion) {
},
|l| {
let smt = SimpleSmt::new(SimpleSmt::MAX_DEPTH).unwrap().with_leaves(l).unwrap();
black_box(MerkleStore::new().extend(smt.inner_nodes()));
black_box(MerkleStore::from(smt));
},
BatchSize::SmallInput,
)
@@ -403,8 +397,7 @@ fn update_leaf_merkletree(c: &mut Criterion) {
let mtree_leaves: Vec<Word> = leaves.iter().map(|v| v.into()).collect();
let mut mtree = MerkleTree::new(mtree_leaves.clone()).unwrap();
let mut store = MerkleStore::new();
store.extend(mtree.inner_nodes());
let mut store: MerkleStore = mtree.clone().into();
let depth = mtree.depth();
let root = mtree.root();
let size_u64 = size as u64;
@@ -453,8 +446,7 @@ fn update_leaf_simplesmt(c: &mut Criterion) {
.unwrap()
.with_leaves(smt_leaves.clone())
.unwrap();
let mut store = MerkleStore::new();
store.extend(smt.inner_nodes());
let mut store: MerkleStore = smt.clone().into();
let depth = smt.depth();
let root = smt.root();
let size_u64 = size as u64;