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
use commonware_cryptography::bls12381::{
dkg::{self, ops::evaluate_all},
primitives::{self, variant::MinSig},
};
use commonware_utils::quorum;
use criterion::{criterion_group, BatchSize, Criterion};
use rand::{rngs::StdRng, seq::SliceRandom, SeedableRng};
use std::hint::black_box;
fn benchmark_partial_verify_multiple_public_keys_precomputed(c: &mut Criterion) {
let namespace = b"benchmark";
let msg = b"hello";
for &n in &[5, 10, 20, 50, 100, 250, 500] {
let t = quorum(n);
let f = n - t;
for invalid in [0, f] {
c.bench_function(
&format!("{}/n={} t={} invalid={}", module_path!(), n, t, invalid),
|b| {
b.iter_batched(
|| {
let mut rng = StdRng::seed_from_u64(0);
let (polynomial, shares) =
dkg::ops::generate_shares::<_, MinSig>(&mut rng, None, n, t);
let polynomial = evaluate_all::<MinSig>(&polynomial, n);
let signatures = shares
.iter()
.enumerate()
.map(|(idx, s)| {
if idx < invalid as usize {
primitives::ops::partial_sign_message::<MinSig>(
s, None, msg,
)
} else {
primitives::ops::partial_sign_message::<MinSig>(
s,
Some(namespace),
msg,
)
}
})
.collect::<Vec<_>>();
(rng, polynomial, signatures)
},
|(mut rng, polynomial, mut signatures)| {
// Shuffle faults
if invalid > 0 {
signatures.shuffle(&mut rng);
}
// Verify
let result = black_box(
primitives::ops::partial_verify_multiple_public_keys_precomputed::<
MinSig,
_,
>(
&polynomial, Some(namespace), msg, &signatures
),
);
if invalid == 0 {
assert!(result.is_ok());
} else {
assert!(result.is_err());
}
},
BatchSize::SmallInput,
);
},
);
}
}
}
criterion_group! {
name = benches;
config = Criterion::default().sample_size(10);
targets = benchmark_partial_verify_multiple_public_keys_precomputed
}