-
Notifications
You must be signed in to change notification settings - Fork 4
/
generative_tests.rs
513 lines (470 loc) · 17.6 KB
/
generative_tests.rs
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
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
#![cfg(feature = "integration_test")]
#[macro_use]
extern crate proptest;
extern crate casper;
extern crate rand;
use std::collections::{BTreeSet, HashMap, HashSet};
use std::iter;
use std::iter::FromIterator;
use proptest::prelude::*;
use proptest::strategy::ValueTree;
use proptest::test_runner::Config;
use proptest::test_runner::TestRunner;
use rand::seq::SliceRandom;
use rand::thread_rng;
use casper::justification::{Justification, LatestMsgs, LatestMsgsHonest, SenderState};
use casper::message::*;
use casper::senders_weight::SendersWeight;
use casper::traits::Estimate;
use casper::example::binary::BoolWrapper;
use casper::example::blockchain::{Block, BlockMsg, ProtoBlock};
use casper::example::integer::IntegerWrapper;
use casper::example::vote_count::VoteCount;
use std::fs::OpenOptions;
use std::io::Write;
use std::time::Instant;
fn add_message<'z, M>(
state: &'z mut HashMap<M::Sender, SenderState<M>>,
sender: M::Sender,
recipients: HashSet<M::Sender>,
) -> &'z HashMap<M::Sender, SenderState<M>>
where
M: CasperMsg,
{
let latest: HashSet<M> = state[&sender]
.latests_msgs()
.iter()
.fold(HashSet::new(), |acc, (_, lms)| {
acc.union(&lms).cloned().collect()
});
let latest_delta = match state[&sender].latests_msgs().get(&sender) {
Some(msgs) => match msgs.len() {
1 => {
let m = msgs.iter().next().unwrap();
latest
.iter()
.filter(|lm| !m.justification().contains(lm))
.cloned()
.collect()
}
_ => unimplemented!(),
},
None => latest,
};
let (m, sender_state) = M::from_msgs(
sender.clone(),
latest_delta.iter().collect(),
&state[&sender],
)
.unwrap();
state.insert(sender.clone(), sender_state);
state
.get_mut(&sender)
.unwrap()
.latests_msgs_as_mut()
.update(&m);
recipients.iter().for_each(|recipient| {
let sender_state_reconstructed = SenderState::new(
state[&recipient].senders_weights().clone(),
0.0,
Some(m.clone()),
LatestMsgs::from(m.justification()),
0.0,
HashSet::new(),
);
assert_eq!(
m.estimate(),
M::from_msgs(
sender.clone(),
m.justification().iter().collect(),
&sender_state_reconstructed,
)
.unwrap()
.0
.estimate(),
"Recipient must be able to reproduce the estimate from its justification and the justification only.\nSender: {:?}\nRecipient: {:?}\nNumber of Nodes: {:?}\n",
sender, recipient, state.len(),
);
let state_to_update = state.get_mut(&recipient).unwrap().latests_msgs_as_mut();
state_to_update.update(&m);
m.justification().iter().for_each(|m| {
state_to_update.update(m);
});
});
state
}
fn round_robin(val: &mut Vec<u32>) -> BoxedStrategy<u32> {
let v = val.pop().unwrap();
val.insert(0, v);
Just(v).boxed()
}
fn arbitrary_in_set(val: &mut Vec<u32>) -> BoxedStrategy<u32> {
prop::sample::select(val.clone()).boxed()
}
fn all_receivers(val: &Vec<u32>) -> BoxedStrategy<HashSet<u32>> {
let v = HashSet::from_iter(val.iter().cloned());
Just(v).boxed()
}
fn some_receivers(val: &Vec<u32>) -> BoxedStrategy<HashSet<u32>> {
prop::collection::hash_set(prop::sample::select(val.clone()), 0..(val.len() + 1)).boxed()
}
fn message_event<M>(
state: HashMap<M::Sender, SenderState<M>>,
sender_strategy: BoxedStrategy<M::Sender>,
receiver_strategy: BoxedStrategy<HashSet<M::Sender>>,
) -> BoxedStrategy<HashMap<M::Sender, SenderState<M>>>
where
M: 'static + CasperMsg,
{
(sender_strategy, receiver_strategy, Just(state))
.prop_map(|(sender, mut receivers, mut state)| {
receivers.remove(&sender);
add_message(&mut state, sender.clone(), receivers).clone()
})
.boxed()
}
fn full_consensus<M>(state: &HashMap<M::Sender, SenderState<M>>) -> bool
where
M: CasperMsg,
{
let m: HashSet<_> = state
.iter()
.map(|(_sender, sender_state)| {
let latest_honest_msgs =
LatestMsgsHonest::from_latest_msgs(sender_state.latests_msgs(), &HashSet::new());
latest_honest_msgs.mk_estimate(sender_state.senders_weights())
})
.collect();
println!("{:?}", m);
m.len() == 1
}
fn safety_oracle(state: &HashMap<u32, SenderState<BlockMsg<u32>>>) -> bool {
let safety_oracle_detected: HashSet<bool> = state
.iter()
.map(|(_, sender_state)| {
let latest_honest_msgs =
LatestMsgsHonest::from_latest_msgs(sender_state.latests_msgs(), &HashSet::new());
let genesis_block = Block::from(ProtoBlock::new(None));
let safety_threshold = (sender_state.senders_weights().sum_all_weights()) / 2.0;
Block::safety_oracles(
genesis_block,
&latest_honest_msgs,
&HashSet::new(),
safety_threshold,
sender_state.senders_weights(),
) != HashSet::new()
})
.collect();
safety_oracle_detected.contains(&true)
}
fn clique_collection(state: HashMap<u32, SenderState<BlockMsg<u32>>>) -> Vec<Vec<Vec<u32>>> {
state
.iter()
.map(|(_, sender_state)| {
let genesis_block = Block::from(ProtoBlock::new(None));
let latest_honest_msgs =
LatestMsgsHonest::from_latest_msgs(sender_state.latests_msgs(), &HashSet::new());
let safety_oracles = Block::safety_oracles(
genesis_block,
&latest_honest_msgs,
&HashSet::new(),
// cliques, not safety oracles, because our threshold is 0
0.0,
sender_state.senders_weights(),
);
let safety_oracles_vec_of_btrees: Vec<BTreeSet<u32>> =
Vec::from_iter(safety_oracles.iter().cloned());
let safety_oracles_vec_of_vecs: Vec<Vec<u32>> = safety_oracles_vec_of_btrees
.iter()
.map(|btree| Vec::from_iter(btree.iter().cloned()))
.collect();
safety_oracles_vec_of_vecs
})
.collect()
}
fn chain<E: 'static, F: 'static, G: 'static, H: 'static>(
consensus_value_strategy: BoxedStrategy<E>,
validator_max_count: usize,
message_producer_strategy: F,
message_receiver_strategy: G,
consensus_satisfied: H,
) -> BoxedStrategy<Vec<HashMap<u32, SenderState<Message<E, u32>>>>>
where
E: Estimate<M = Message<E, u32>>,
F: Fn(&mut Vec<u32>) -> BoxedStrategy<u32>,
G: Fn(&Vec<u32>) -> BoxedStrategy<HashSet<u32>>,
H: Fn(&HashMap<u32, SenderState<Message<E, u32>>>) -> bool,
{
(prop::sample::select((1..validator_max_count).collect::<Vec<usize>>()))
.prop_flat_map(move |validators| {
(prop::collection::vec(consensus_value_strategy.clone(), validators))
})
.prop_map(move |votes| {
let mut state = HashMap::new();
let validators: Vec<u32> = (0..votes.len() as u32).collect();
let weights: Vec<f64> = iter::repeat(1.0).take(votes.len() as usize).collect();
let senders_weights = SendersWeight::new(
validators
.iter()
.cloned()
.zip(weights.iter().cloned())
.collect(),
);
validators.iter().for_each(|validator| {
let mut j = Justification::new();
let m = Message::new(
*validator,
j.clone(),
votes[*validator as usize].clone(),
None,
);
j.insert(m.clone());
state.insert(
*validator,
SenderState::new(
senders_weights.clone(),
0.0,
Some(m),
LatestMsgs::from(&j),
0.0,
HashSet::new(),
),
);
});
let mut runner = TestRunner::default();
let mut senders = validators.clone();
let chain = iter::repeat_with(|| {
let sender_strategy = message_producer_strategy(&mut senders);
let receiver_strategy = message_receiver_strategy(&senders);
state = message_event(state.clone(), sender_strategy, receiver_strategy)
.new_value(&mut runner)
.unwrap()
.current();
state.clone()
});
let mut have_consensus = false;
let mut start = Instant::now();
let mut timestamp_file = OpenOptions::new()
.create(true)
.truncate(true)
.write(true)
.open("timestamp.log")
.unwrap();
writeln!(timestamp_file, "start");
Vec::from_iter(chain.take_while(|state| {
writeln!(timestamp_file, "{:?}", start.elapsed().subsec_micros());
start = Instant::now();
if have_consensus {
false
} else {
if consensus_satisfied(state) {
have_consensus = true
}
true
}
}))
})
.boxed()
}
fn arbitrary_blockchain() -> BoxedStrategy<Block<u32>> {
let genesis_block = Block::from(ProtoBlock::new(None));
Just(genesis_block).boxed()
}
#[test]
fn blockchain() {
// total messages until unilateral consensus
let mut output_file = OpenOptions::new()
.create(true)
.truncate(true)
.write(true)
.open("blockchain_test.log")
.unwrap();
let mut runner = TestRunner::default();
for _ in 0..100 {
writeln!(output_file, "new chain");
chain(
arbitrary_blockchain(),
6,
arbitrary_in_set,
some_receivers,
safety_oracle,
)
.new_value(&mut runner)
.unwrap()
.current()
.iter()
.for_each(|state| {
writeln!(
output_file,
"{{lms: {:?},",
state
.iter()
.map(|(_, sender_state)| sender_state.latests_msgs())
.collect::<Vec<_>>()
)
.unwrap();
writeln!(output_file, "sendercount: {:?},", state.keys().len()).unwrap();
writeln!(output_file, "clqs: ").unwrap();
writeln!(output_file, "{:?}}},", clique_collection(state.clone())).unwrap();
});
}
}
proptest! {
#![proptest_config(Config::with_cases(30))]
#[test]
fn round_robin_vote_count(ref chain in chain(VoteCount::arbitrary(), 15, round_robin, all_receivers, full_consensus)) {
assert_eq!(chain.last().unwrap_or(&HashMap::new()).keys().len(),
if chain.len() > 0 {chain.len()} else {0},
"round robin with n validators should converge in n messages")
}
}
prop_compose! {
fn boolwrapper_gen()
(boolean in prop::bool::ANY) -> BoolWrapper {
BoolWrapper::new(boolean)
}
}
prop_compose! {
fn integerwrapper_gen()
(int in prop::num::u32::ANY) -> IntegerWrapper {
IntegerWrapper::new(int)
}
}
proptest! {
#![proptest_config(Config::with_cases(30))]
#[test]
fn round_robin_binary(ref chain in chain(boolwrapper_gen(), 15, round_robin, all_receivers, full_consensus)) {
assert!(chain.last().unwrap_or(&HashMap::new()).keys().len() >=
chain.len(),
"round robin with n validators should converge in at most n messages")
}
}
proptest! {
#![proptest_config(Config::with_cases(10))]
#[test]
fn round_robin_integer(ref chain in chain(integerwrapper_gen(), 2000, round_robin, all_receivers, full_consensus)) {
// total messages until unilateral consensus
println!("{} validators -> {:?} message(s)",
match chain.last().unwrap_or(&HashMap::new()).keys().len().to_string().as_ref()
{"0" => "Unknown",
x => x},
chain.len());
assert!(chain.last().unwrap_or(&HashMap::new()).keys().len() >=
chain.len(),
"round robin with n validators should converge in at most n messages")
}
}
proptest! {
#![proptest_config(Config::with_cases(1))]
#[test]
fn arbitrary_messenger_vote_count(ref chain in chain(VoteCount::arbitrary(), 8, arbitrary_in_set, some_receivers, full_consensus)) {
// total messages until unilateral consensus
println!("{} validators -> {:?} message(s)",
match chain.last().unwrap_or(&HashMap::new()).keys().len().to_string().as_ref()
{"0" => "Unknown",
x => x},
chain.len());
}
}
proptest! {
#![proptest_config(Config::with_cases(1))]
#[test]
fn arbitrary_messenger_binary(ref chain in chain(boolwrapper_gen(), 100, arbitrary_in_set, some_receivers, full_consensus)) {
// total messages until unilateral consensus
println!("{} validators -> {:?} message(s)",
match chain.last().unwrap_or(&HashMap::new()).keys().len().to_string().as_ref()
{"0" => "Unknown",
x => x},
chain.len());
}
}
proptest! {
#![proptest_config(Config::with_cases(1))]
#[test]
fn arbitrary_messenger_integer(ref chain in chain(integerwrapper_gen(), 50, arbitrary_in_set, some_receivers, full_consensus)) {
// total messages until unilateral consensus
println!("{} validators -> {:?} message(s)",
match chain.last().unwrap_or(&HashMap::new()).keys().len().to_string().as_ref()
{"0" => "Unknown",
x => x},
chain.len());
}
}
prop_compose! {
fn votes(senders: usize, equivocations: usize)
(votes in prop::collection::vec(prop::bool::weighted(0.3), senders as usize),
equivocations in Just(equivocations),
senders in Just(senders))
-> (Vec<Message<VoteCount, u32>>, HashSet<u32>, usize)
{
let mut validators: Vec<u32> = (0..senders as u32).collect();
validators.shuffle(&mut thread_rng());
let equivocators: HashSet<u32> = HashSet::from_iter(validators[0..equivocations].iter().cloned());
let mut messages = vec![];
votes
.iter()
.enumerate()
.for_each(|(sender, vote)|
{messages.push(VoteCount::create_vote_msg(sender as u32, vote.clone()))});
equivocators
.iter()
.for_each(|equivocator|
{let vote = !votes[*equivocator as usize];
messages.push(VoteCount::create_vote_msg(*equivocator as u32, vote))});
(messages, equivocators, senders)
}
}
proptest! {
#![proptest_config(Config::with_cases(1000))]
#[test]
fn detect_equivocation(ref vote_tuple in votes(5, 5)) {
let (messages, equivocators, nodes) = vote_tuple;
let nodes = nodes.clone();
let senders: Vec<u32> = (0..nodes as u32).collect();
let weights: Vec<f64> =
iter::repeat(1.0).take(nodes as usize).collect();
let senders_weights = SendersWeight::new(
senders
.iter()
.cloned()
.zip(weights.iter().cloned())
.collect(),
);
let sender_state = SenderState::new(
senders_weights.clone(),
0.0,
None,
LatestMsgs::new(),
0.0,
HashSet::new(),
);
// here, only take one equivocation
let single_equivocation: Vec<_> = messages[..nodes+1].iter().map(|message| message).collect();
let equivocator = messages[nodes].sender();
let (m0, _) =
&Message::from_msgs(0, single_equivocation.clone(), &sender_state)
.unwrap();
let equivocations: Vec<_> = single_equivocation.iter().filter(|message| message.equivocates(&m0)).collect();
assert!(if *equivocator == 0 {equivocations.len() == 1} else {equivocations.len() == 0}, "should detect sender 0 equivocating if sender 0 equivocates");
// the following commented test should fail
// assert_eq!(equivocations.len(), 1, "should detect sender 0 equivocating if sender 0 equivocates");
let (m0, _) =
&Message::from_msgs(0, messages.iter().map(|message| message).collect(), &sender_state)
.unwrap();
let equivocations: Vec<_> = messages.iter().filter(|message| message.equivocates(&m0)).collect();
assert_eq!(equivocations.len(), 1, "should detect sender 0 equivocating if sender 0 equivocates");
let sender_state = SenderState::new(
senders_weights,
0.0,
None,
LatestMsgs::new(),
equivocators.len() as f64,
HashSet::new(),
);
let (m0, _) =
&Message::from_msgs(0, messages.iter().map(|message| message).collect(), &sender_state)
.unwrap();
let equivocations: Vec<_> = messages.iter().filter(|message| message.equivocates(&m0)).collect();
assert_eq!(equivocations.len(), 0, "equivocation absorbed in threshold");
}
}