Qyriad
b151773b0d
* merkle: add parent() helper function on NodeIndex * smt: add pairs_to_leaf() to trait * smt: add sorted_pairs_to_leaves() and test for it * smt: implement single subtree-8 hashing, w/ benchmarks & tests This will be composed into depth-8-subtree-based computation of entire sparse Merkle trees. * merkle: add a benchmark for constructing 256-balanced trees This is intended for comparison with the benchmarks from the previous commit. This benchmark represents the theoretical perfect-efficiency performance we could possibly (but impractically) get for computing depth-8 sparse Merkle subtrees. * smt: test that SparseMerkleTree::build_subtree() is composable * smt: test that subtree logic can correctly construct an entire tree This commit ensures that `SparseMerkleTree::build_subtree()` can correctly compose into building an entire sparse Merkle tree, without yet getting into potential complications concurrency introduces. * smt: implement test for basic parallelized subtree computation w/ rayon Building on the previous commit, this commit implements a test proving that `SparseMerkleTree::build_subtree()` can be composed into itself not just concurrently, but in parallel, without issue. * smt: add from_raw_parts() to trait interface This commit adds a new required method to the SparseMerkleTree trait, to allow generic construction from pre-computed parts. This will be used to add a generic version of `with_entries()` in a later commit. * smt: add parallel constructors to Smt and SimpleSmt What the previous few commits have been leading up to: SparseMerkleTree now has a function to construct the tree from existing data in parallel. This is significantly faster than the singlethreaded equivalent. Benchmarks incoming! --------- Co-authored-by: krushimir <krushimir@reilabs.co> Co-authored-by: krushimir <kresimir.grofelnik@reilabs.io>
71 lines
2.4 KiB
Rust
71 lines
2.4 KiB
Rust
use std::{fmt::Debug, hint, mem, time::Duration};
|
|
|
|
use criterion::{criterion_group, criterion_main, BatchSize, BenchmarkId, Criterion};
|
|
use miden_crypto::{hash::rpo::RpoDigest, merkle::Smt, Felt, Word, ONE};
|
|
use rand_utils::prng_array;
|
|
use winter_utils::Randomizable;
|
|
|
|
// 2^0, 2^4, 2^8, 2^12, 2^16
|
|
const PAIR_COUNTS: [u64; 6] = [1, 16, 256, 4096, 65536, 1_048_576];
|
|
|
|
fn smt_with_entries(c: &mut Criterion) {
|
|
let mut seed = [0u8; 32];
|
|
|
|
let mut group = c.benchmark_group("smt-with-entries");
|
|
|
|
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(
|
|
|| {
|
|
// Setup.
|
|
prepare_entries(pair_count, &mut seed)
|
|
},
|
|
|entries| {
|
|
// Benchmarked function.
|
|
Smt::with_entries(hint::black_box(entries)).unwrap();
|
|
},
|
|
BatchSize::SmallInput,
|
|
);
|
|
});
|
|
}
|
|
}
|
|
|
|
criterion_group! {
|
|
name = smt_with_entries_group;
|
|
config = Criterion::default()
|
|
//.measurement_time(Duration::from_secs(960))
|
|
.measurement_time(Duration::from_secs(60))
|
|
.sample_size(10)
|
|
.configure_from_args();
|
|
targets = smt_with_entries
|
|
}
|
|
criterion_main!(smt_with_entries_group);
|
|
|
|
// HELPER FUNCTIONS
|
|
// --------------------------------------------------------------------------------------------
|
|
|
|
fn prepare_entries(pair_count: u64, seed: &mut [u8; 32]) -> Vec<(RpoDigest, [Felt; 4])> {
|
|
let entries: Vec<(RpoDigest, Word)> = (0..pair_count)
|
|
.map(|i| {
|
|
let count = pair_count as f64;
|
|
let idx = ((i as f64 / count) * (count)) as u64;
|
|
let key = RpoDigest::new([generate_value(seed), ONE, Felt::new(i), Felt::new(idx)]);
|
|
let value = generate_word(seed);
|
|
(key, value)
|
|
})
|
|
.collect();
|
|
entries
|
|
}
|
|
|
|
fn generate_value<T: Copy + Debug + Randomizable>(seed: &mut [u8; 32]) -> T {
|
|
mem::swap(seed, &mut prng_array(*seed));
|
|
let value: [T; 1] = rand_utils::prng_array(*seed);
|
|
value[0]
|
|
}
|
|
|
|
fn generate_word(seed: &mut [u8; 32]) -> Word {
|
|
mem::swap(seed, &mut prng_array(*seed));
|
|
let nums: [u64; 4] = prng_array(*seed);
|
|
[Felt::new(nums[0]), Felt::new(nums[1]), Felt::new(nums[2]), Felt::new(nums[3])]
|
|
}
|