use commonware_cryptography::{sha256, Hasher, Sha256}; use commonware_math::algebra::Random as _; use commonware_storage::bmt::Builder; use criterion::{criterion_group, Criterion}; use rand::{rngs::StdRng, seq::SliceRandom, SeedableRng}; const SAMPLE_SIZE: usize = 100; fn bench_prove_multi(c: &mut Criterion) { for n in [250, 1_000, 5_000, 10_000, 25_000, 50_000, 100_000] { // Populate Binary Merkle Tree let mut builder = Builder::::new(n); let mut queries = Vec::with_capacity(n); let mut sampler = StdRng::seed_from_u64(0); for pos in 0..n { let element = sha256::Digest::random(&mut sampler); builder.add(&element); queries.push((pos as u32, element)); } let tree = builder.build(); let root = tree.root(); // Select SAMPLE_SIZE random elements without replacement and create/verify multi-proof c.bench_function( &format!("{}/n={} items={}", module_path!(), n, SAMPLE_SIZE), |b| { b.iter_batched( || { let samples: Vec<_> = queries .choose_multiple(&mut sampler, SAMPLE_SIZE) .cloned() .collect(); let positions: Vec = samples.iter().map(|(pos, _)| *pos).collect(); let proof = tree.multi_proof(&positions).unwrap(); (samples, proof) }, |(samples, proof)| { let mut hasher = Sha256::new(); let elements: Vec<_> = samples.iter().map(|(pos, elem)| (*elem, *pos)).collect(); assert!(proof .verify_multi_inclusion(&mut hasher, &elements, &root) .is_ok()); }, criterion::BatchSize::SmallInput, ) }, ); } } criterion_group! { name = benches; config = Criterion::default().sample_size(10); targets = bench_prove_multi }