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

bench(smt-subtree): add a benchmark for single-leaf subtrees

Browse source
This commit is contained in:
Qyriad 2024-10-25 12:45:40 -06:00
parent fcf2df0cc9
commit fc1f69fa8f
1 changed files with 4 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
benches/smt-subtree.rs
View file

@ -9,12 +9,14 @@ use miden_crypto::{
use rand_utils::prng_array;
use winter_utils::Randomizable;
const PAIR_COUNTS: [u64; 5] = [1, 64, 128, 192, 256];
fn smt_subtree_even(c: &mut Criterion) {
let mut seed = [0u8; 32];
let mut group = c.benchmark_group("subtree8-even");
for pair_count in (64..=256).step_by(64) {
for pair_count in PAIR_COUNTS {
let bench_id = BenchmarkId::from_parameter(pair_count);
group.bench_with_input(bench_id, &pair_count, |b, &pair_count| {
b.iter_batched(
@ -64,7 +66,7 @@ fn smt_subtree_random(c: &mut Criterion) {
let mut group = c.benchmark_group("subtree8-rand");
for pair_count in (64..=256).step_by(64) {
for pair_count in PAIR_COUNTS {
let bench_id = BenchmarkId::from_parameter(pair_count);
group.bench_with_input(bench_id, &pair_count, |b, &pair_count| {
b.iter_batched(
@ -94,10 +96,6 @@ fn smt_subtree_random(c: &mut Criterion) {
})
.collect();
leaves.sort();
let before = leaves.len();
leaves.dedup();
let after = leaves.len();
assert_eq!(before, after);
leaves
},
|leaves| {