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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
use crate::{peer::Peer, Prefix, XorName};
use bls::{PublicKey, PublicKeyShare};
use itertools::Itertools;
use serde::{Deserialize, Serialize};
use sn_data_types::ReplicaPublicKeySet;
use std::{
borrow::Borrow,
collections::{BTreeMap, BTreeSet},
fmt::{self, Debug, Display, Formatter},
net::SocketAddr,
};
#[derive(Debug, Default, PartialEq, Eq, PartialOrd, Ord, Hash, Clone, Serialize, Deserialize)]
pub struct ElderCandidates {
pub elders: BTreeMap<XorName, SocketAddr>,
pub prefix: Prefix,
}
impl ElderCandidates {
pub(crate) fn new<I>(elders: I, prefix: Prefix) -> Self
where
I: IntoIterator<Item = Peer>,
{
Self {
elders: elders
.into_iter()
.map(|peer| (*peer.name(), *peer.addr()))
.collect(),
prefix,
}
}
pub(crate) fn peers(
&'_ self,
) -> impl Iterator<Item = Peer> + DoubleEndedIterator + ExactSizeIterator + Clone + '_ {
self.elders.iter().map(|(name, addr)| {
let mut peer = Peer::new(*name, *addr);
peer.set_reachable(true);
peer
})
}
pub(crate) fn position(&self, name: &XorName) -> Option<usize> {
self.elders.keys().position(|other_name| other_name == name)
}
}
#[derive(PartialEq, Eq, PartialOrd, Ord, Hash, Clone, Serialize, Deserialize)]
pub struct SectionAuthorityProvider {
pub prefix: Prefix,
section_key: PublicKey,
elders: BTreeMap<XorName, (PublicKeyShare, SocketAddr)>,
}
impl SectionAuthorityProvider {
pub fn new<I>(elders: I, prefix: Prefix, pk_set: ReplicaPublicKeySet) -> Self
where
I: IntoIterator<Item = Peer>,
{
let elders = elders
.into_iter()
.enumerate()
.map(|(index, peer)| (*peer.name(), (pk_set.public_key_share(index), *peer.addr())))
.collect();
Self {
prefix,
section_key: pk_set.public_key(),
elders,
}
}
pub fn from_elder_candidates(
elder_candidates: ElderCandidates,
pk_set: ReplicaPublicKeySet,
) -> Self {
let elders = elder_candidates
.elders
.iter()
.enumerate()
.map(|(index, (name, addr))| (*name, (pk_set.public_key_share(index), *addr)))
.collect();
Self {
prefix: elder_candidates.prefix,
section_key: pk_set.public_key(),
elders,
}
}
pub fn elder_candidates(&self) -> ElderCandidates {
ElderCandidates {
elders: self.elders(),
prefix: self.prefix,
}
}
pub(crate) fn peers(
&'_ self,
) -> impl Iterator<Item = Peer> + DoubleEndedIterator + ExactSizeIterator + Clone + '_ {
self.elders.iter().map(|(name, (_, addr))| {
let mut peer = Peer::new(*name, *addr);
peer.set_reachable(true);
peer
})
}
pub fn elder_count(&self) -> usize {
self.elders.len()
}
pub(crate) fn contains_elder(&self, name: &XorName) -> bool {
self.elders.contains_key(name)
}
pub(crate) fn get_addr(&self, name: &XorName) -> Option<SocketAddr> {
self.elders.get(name).map(|(_, addr)| *addr)
}
pub fn names(&self) -> BTreeSet<XorName> {
self.elders.keys().copied().collect()
}
pub fn elders(&self) -> BTreeMap<XorName, SocketAddr> {
self.elders
.iter()
.map(|(name, (_, addr))| (*name, *addr))
.collect()
}
pub(crate) fn addresses(&self) -> Vec<SocketAddr> {
self.elders.values().map(|(_, addr)| *addr).collect()
}
pub(crate) fn prefix(&self) -> Prefix {
self.prefix
}
pub fn section_key(&self) -> PublicKey {
self.section_key
}
}
impl Borrow<Prefix> for SectionAuthorityProvider {
fn borrow(&self) -> &Prefix {
&self.prefix
}
}
impl Debug for SectionAuthorityProvider {
fn fmt(&self, formatter: &mut Formatter) -> fmt::Result {
write!(
formatter,
"SectionAuthorityProvider {{ prefix: ({:b}), section_key: {:?}, elders: {{{:?}}} }}",
self.prefix,
self.section_key,
self.elders.iter().format(", "),
)
}
}
impl Display for SectionAuthorityProvider {
fn fmt(&self, f: &mut Formatter) -> fmt::Result {
write!(
f,
"{{{}}}/({:b})",
self.elders.keys().format(", "),
self.prefix,
)
}
}
#[cfg(test)]
pub(crate) mod test_utils {
use super::*;
use crate::{crypto, node::Node, supermajority, MIN_ADULT_AGE, MIN_AGE};
use itertools::Itertools;
use std::{cell::Cell, net::SocketAddr};
use xor_name::Prefix;
pub(crate) fn gen_addr() -> SocketAddr {
thread_local! {
static NEXT_PORT: Cell<u16> = Cell::new(1000);
}
let port = NEXT_PORT.with(|cell| cell.replace(cell.get().wrapping_add(1)));
([192, 0, 2, 0], port).into()
}
pub(crate) fn gen_sorted_nodes(prefix: &Prefix, count: usize, age_diff: bool) -> Vec<Node> {
(0..count)
.map(|index| {
let age = if age_diff && index < count - 1 {
MIN_AGE + 2
} else {
MIN_ADULT_AGE
};
Node::new(
crypto::gen_keypair(&prefix.range_inclusive(), age),
gen_addr(),
)
})
.sorted_by_key(|node| node.name())
.collect()
}
pub(crate) fn gen_section_authority_provider(
prefix: Prefix,
count: usize,
) -> (SectionAuthorityProvider, Vec<Node>) {
let nodes = gen_sorted_nodes(&prefix, count, false);
let elders = nodes
.iter()
.map(Node::peer)
.map(|mut peer| {
peer.set_reachable(true);
(*peer.name(), *peer.addr())
})
.collect();
let threshold = supermajority(count) - 1;
let secret_key_set = bls::SecretKeySet::random(threshold, &mut rand::thread_rng());
let section_auth = SectionAuthorityProvider::from_elder_candidates(
ElderCandidates { elders, prefix },
secret_key_set.public_keys(),
);
(section_auth, nodes)
}
}