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
use commonware_cryptography::{
bls12381::{
dkg::deal,
primitives::{self, sharing::Mode, variant::MinSig},
},
ed25519::PrivateKey,
Signer as _,
};
use commonware_parallel::{Rayon, Sequential};
use commonware_utils::{Faults, N3f1, NZUsize, TryCollect};
use criterion::{criterion_group, BatchSize, Criterion};
use rand::{rngs::StdRng, seq::SliceRandom, SeedableRng};
use std::hint::black_box;
fn bench_threshold_batch_verify_same_message_precomputed(c: &mut Criterion) {
let namespace = b"benchmark";
let msg = b"hello";
for mode in [Mode::NonZeroCounter, Mode::RootsOfUnity] {
for &n in &[5, 10, 20, 50, 100, 250, 500] {
let t = N3f1::quorum(n);
let f = n - t;
for invalid in [0, f] {
for concurrency in [1, 8] {
let strategy = Rayon::new(NZUsize!(concurrency)).unwrap();
c.bench_function(
&format!(
"{}/mode={:?} n={} t={} invalid={} conc={}",
module_path!(),
mode,
n,
t,
invalid,
concurrency
),
|b| {
b.iter_batched(
|| {
let mut rng = StdRng::seed_from_u64(0);
let players = (0..n)
.map(|i| PrivateKey::from_seed(i as u64).public_key())
.try_collect()
.unwrap();
let (output, shares) =
deal::<MinSig, _, N3f1>(&mut rng, mode, players)
.expect("deal should succeed");
let polynomial = output.public().clone();
polynomial.precompute_partial_publics();
let signatures = shares
.values()
.iter()
.enumerate()
.map(|(idx, s)| {
if idx < invalid as usize {
primitives::ops::threshold::sign_message::<MinSig>(
s, b"wrong", msg,
)
} else {
primitives::ops::threshold::sign_message::<MinSig>(
s, namespace, msg,
)
}
})
.collect::<Vec<_>>();
(rng, polynomial, signatures)
},
|(mut rng, polynomial, mut signatures): (_, _, Vec<_>)| {
if invalid > 0 {
signatures.shuffle(&mut rng);
}
let result = if concurrency > 1 {
black_box(
primitives::ops::threshold::batch_verify_same_message::<
_,
MinSig,
_,
>(
&mut rng,
&polynomial,
namespace,
msg,
&signatures,
&strategy,
),
)
} else {
black_box(
primitives::ops::threshold::batch_verify_same_message::<
_,
MinSig,
_,
>(
&mut rng,
&polynomial,
namespace,
msg,
&signatures,
&Sequential,
),
)
};
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 = bench_threshold_batch_verify_same_message_precomputed
}