rustreexo 0.5.0

A Rust implementation of Utreexo
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

use std::hint::black_box;

use criterion::criterion_group;
use criterion::criterion_main;
use criterion::BenchmarkId;
use criterion::Criterion;
use criterion::Throughput;
use rand::rngs::StdRng;
use rand::Rng;
use rand::SeedableRng;
use rustreexo::node_hash::BitcoinNodeHash;
use rustreexo::proof::Proof;
use rustreexo::stump::Stump;

fn generate_test_hashes(count: usize, seed: u64) -> Vec<BitcoinNodeHash> {
    let mut rng = StdRng::seed_from_u64(seed);
    (0..count)
        .map(|_| {
            let mut bytes = [0u8; 32];
            rng.fill(&mut bytes);
            BitcoinNodeHash::new(bytes)
        })
        .collect()
}

#[allow(clippy::unnecessary_cast)]
fn proof_creation(c: &mut Criterion) {
    let mut group = c.benchmark_group("proof_creation");

    for target_count in [1, 10].iter() {
        let targets: Vec<u64> = (0..*target_count).collect();
        let proof_hashes = generate_test_hashes((*target_count * 3) as usize, 42); // Approximate proof size

        group.throughput(Throughput::Elements(*target_count as u64));
        group.bench_with_input(
            BenchmarkId::new("new_proof", target_count),
            target_count,
            |b, _| {
                b.iter(|| {
                    let proof =
                        Proof::new(black_box(targets.clone()), black_box(proof_hashes.clone()));
                    black_box(proof)
                });
            },
        );
    }
    group.finish();
}

#[allow(clippy::unnecessary_cast)]
fn proof_verification(c: &mut Criterion) {
    let mut group = c.benchmark_group("proof_verification");

    // Setup a realistic scenario with an accumulator
    let accumulator_size = 100;
    let hashes = generate_test_hashes(accumulator_size, 42);
    let stump = Stump::new();
    let (stump, _) = stump.modify(&hashes, &[], &Proof::default()).unwrap();

    for target_count in [1, 10].iter() {
        let del_hashes = hashes[..*target_count].to_vec();
        let targets: Vec<u64> = (0..*target_count as u64).collect();

        // Create a realistic proof structure (simplified for benchmarking)
        let proof_hash_count = (*target_count as f64 * 3.5) as usize; // Realistic proof size
        let proof_hashes = generate_test_hashes(proof_hash_count, 123);
        let proof = Proof::new(targets, proof_hashes);

        group.throughput(Throughput::Elements(*target_count as u64));
        group.bench_with_input(
            BenchmarkId::new("verify", target_count),
            target_count,
            |b, _| {
                b.iter(|| {
                    let result = proof.verify(
                        black_box(&del_hashes),
                        black_box(&stump.roots),
                        black_box(stump.leaves),
                    );
                    black_box(result)
                });
            },
        );
    }
    group.finish();
}

criterion_group!(benches, proof_creation, proof_verification,);
criterion_main!(benches);