rustreexo 0.6.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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123

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::mem_forest::MemForest;
use rustreexo::node_hash::BitcoinNodeHash;
use rustreexo::pollard::Pollard;

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()
}

fn memforest_proof_generation(c: &mut Criterion) {
    let mut group = c.benchmark_group("memforest_proof_generation");

    let accumulator_size = 100;
    let hashes = generate_test_hashes(accumulator_size, 42);
    let mut forest = MemForest::new();
    forest.modify(&hashes, &[]).unwrap();

    for target_count in [1, 10].iter() {
        let targets = &hashes[..*target_count];

        group.throughput(Throughput::Elements(*target_count as u64));
        group.bench_with_input(
            BenchmarkId::new("generate_proof", target_count),
            target_count,
            |b, _| {
                b.iter(|| {
                    let result = forest.prove(black_box(targets));
                    black_box(result.unwrap())
                });
            },
        );
    }
    group.finish();
}

fn memforest_verification(c: &mut Criterion) {
    let mut group = c.benchmark_group("memforest_verification");

    let accumulator_size = 100;
    let hashes = generate_test_hashes(accumulator_size, 42);
    let mut forest = MemForest::new();
    forest.modify(&hashes, &[]).unwrap();

    for target_count in [1, 10].iter() {
        let targets = &hashes[..*target_count];
        let proof = forest.prove(targets).unwrap();

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

fn pollard_operations(c: &mut Criterion) {
    let mut group = c.benchmark_group("pollard_operations");

    let base_size = 100;
    let hashes = generate_test_hashes(base_size, 42);
    let roots = vec![hashes[0]]; // Simplified root structure
    let pollard = Pollard::from_roots(roots, base_size as u64);

    {
        let batch_size = &10;
        let _del_hashes = &hashes[..*batch_size / 2];

        group.throughput(Throughput::Elements(*batch_size as u64));
        group.bench_with_input(
            BenchmarkId::new("pollard_roots", batch_size),
            batch_size,
            |b, _| {
                b.iter(|| {
                    let roots = pollard.roots();
                    black_box(roots.len())
                });
            },
        );

        group.bench_with_input(
            BenchmarkId::new("pollard_leaves", batch_size),
            batch_size,
            |b, _| {
                b.iter(|| {
                    let leaves = pollard.leaves();
                    black_box(leaves)
                });
            },
        );
    }
    group.finish();
}

criterion_group!(
    benches,
    memforest_proof_generation,
    memforest_verification,
    pollard_operations,
);
criterion_main!(benches);