aboutsummaryrefslogtreecommitdiffstats
path: root/src/federation/properties.rs
blob: 2b824f0d7001b401050dae25b160271783a89df9 (plain)
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
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
//! The federation's properties over generated histories (`docs/federation-tests.md`,
//! Properties): three to five parties write, change their key sets and node lists, propose
//! versions and checkpoints, vote, and write the versions that pass, each on what it last
//! caught up with, and their nodes merge; an adversary signs with its keys or stolen ones whatever it likes. The
//! store is checked against the model, which reads every history anew, against itself in
//! other orders, and read from a document against itself given the events alone. A
//! failing history is cut down, events taken out with what builds on them for as long as
//! it still fails, and printed.

use std::collections::{BTreeMap, BTreeSet};

use ed25519_dalek::SigningKey;

use super::event::{Checkpoint, Does, Event};
use super::fold::Federation;
use super::harness::{self, Party, Spec};
use super::held::Holding;
use super::jcs::Json;
use super::model::{Model, Verdict};
use super::revision::{Feature, Revision};
use super::store::memory::{Offered, Refusal, Store};
use super::store::{Fold, Id};
use super::version::Version;
use crate::access::sshsig::PublicKey;
use crate::document::events;
use crate::testrand::{Rng, for_seeds};

/// The most events a history has.
const MOST: usize = 30;

/// A root, and events in the order written.
#[derive(Clone)]
pub(super) struct History {
    pub(super) root: Vec<u8>,
    pub(super) events: Vec<Vec<u8>>,
}

impl History {
    fn root_id(&self) -> Id {
        Id::of(&self.root)
    }

    fn store(&self, order: &[usize]) -> (Store<Federation>, Vec<Offered>) {
        let mut store = Store::new(self.root.clone(), Vec::new()).expect("a root");
        let offered = order
            .iter()
            .map(|&i| store.offer(self.events[i].clone()))
            .collect();
        (store, offered)
    }

    fn written(&self) -> Vec<usize> {
        (0..self.events.len()).collect()
    }

    /// The history without the event at `i`, and what builds on it.
    fn without(&self, i: usize) -> History {
        let mut gone = BTreeSet::from([Id::of(&self.events[i])]);
        let mut events = Vec::new();
        for event in &self.events {
            let id = Id::of(event);
            let deps = Federation::dependencies(event).unwrap_or_default();
            if gone.contains(&id) || deps.iter().any(|dep| gone.contains(dep)) {
                gone.insert(id);
            } else {
                events.push(event.clone());
            }
        }
        History {
            root: self.root.clone(),
            events,
        }
    }

    fn show(&self) -> String {
        std::iter::once(format!("root {}", String::from_utf8_lossy(&self.root)))
            .chain(
                self.events
                    .iter()
                    .map(|event| format!("{} {}", Id::of(event), String::from_utf8_lossy(event))),
            )
            .collect::<Vec<_>>()
            .join("\n")
    }
}

/// How a history is written: whether an adversary takes part, whether versions name
/// checkpoints, and whether parties propose versions this continuum doesn't read, at
/// which a store stops, which events then take in the order they come.
#[derive(Clone, Copy, Debug)]
pub(super) struct Kind {
    pub(super) adversary: bool,
    pub(super) checkpoints: bool,
    pub(super) unread: bool,
}

/// One of `ids`, of the latest five more often than not.
fn pick(rng: &mut Rng, ids: &[Id]) -> Id {
    if rng.chance(0.6) {
        *rng.pick(&ids[ids.len().saturating_sub(5)..])
    } else {
        *rng.pick(ids)
    }
}

fn generate(rng: &mut Rng, kind: Kind) -> History {
    generate_at(rng, kind, None)
}

/// A history of `kind`, its first version following `revision`, or, where none is given,
/// the base revision or one with merge events alike.
pub(super) fn generate_at(rng: &mut Rng, kind: Kind, revision: Option<Revision>) -> History {
    let count = rng.between(3, 5);
    let parties: Vec<Party> = (0..count)
        .map(|i| Party::new(&format!("p{i}"), i as u8 + 1))
        .collect();
    let adversary = count - 1;
    let refs: Vec<&Party> = parties.iter().collect();
    let mut first = Spec::first(&refs, &[("names/{party}", harness::str("{party}"))]);
    // Half the federations begin at a revision with merge events, which nodes then sign.
    let merging = rng.chance(0.5);
    first.revision = revision.unwrap_or(if merging {
        Feature::MergeEvents.revision()
    } else {
        Revision::default()
    });
    let root = first.root();
    let root_id = Id::of(&root);
    let mut world: Store<Federation> = Store::new(root.clone(), Vec::new()).expect("a root");
    let mut specs: BTreeMap<Id, Spec> = BTreeMap::from([(first.hash(), first)]);
    // The key each party signs its writes with: its version's, or its set's.
    let mut signing: Vec<SigningKey> = parties.iter().map(|party| party.key.clone()).collect();
    let mut known: Vec<Vec<Id>> = vec![vec![root_id]; count];
    // Each proposal: its event, the version it proposes, the version it is on, and
    // whether it names a checkpoint.
    let mut proposals: Vec<(Id, Id, Id, bool)> = Vec::new();
    let mut votes: Vec<(Id, Id)> = Vec::new();
    let mut backed: Vec<BTreeSet<Id>> = vec![BTreeSet::new(); count];
    let mut events: Vec<Vec<u8>> = Vec::new();
    for step in 0..rng.between(1, MOST) {
        let w = rng.below(count);
        let party = &parties[w];
        if rng.chance(0.25) {
            known[w] = std::iter::once(root_id)
                .chain(events.iter().map(|event| Id::of(event)))
                .collect();
        }
        let mut deps = vec![pick(rng, &known[w])];
        let other = pick(rng, &known[w]);
        if rng.chance(0.3) && !deps.contains(&other) {
            deps.push(other);
        }
        let current = world.state_at(&deps).current().clone();
        let writer = Party {
            name: party.name.clone(),
            key: signing[w].clone(),
        };
        let mine: Vec<&(Id, Id, Id, bool)> = proposals
            .iter()
            .filter(|(id, ..)| known[w].contains(id))
            .collect();
        // Of the proposals it knows, more often than not the earliest on the version current
        // where it writes, else any: so that parties vote alike and versions pass, of those
        // this continuum doesn't read too.
        let earliest = mine.iter().position(|(_, _, on, _)| *on == current.hash);
        let chosen = |rng: &mut Rng| -> (Id, Id, Id, bool) {
            match earliest {
                Some(at) if rng.chance(0.6) => *mine[at],
                _ => **rng.pick(&mine),
            }
        };
        let roll = rng.below(100);
        let event = if roll < 4 {
            // A node merges: one its party lists there, more often than not, else any.
            let listed = world.state_at(&deps).nodes_of(&party.name, &current);
            let ours: Vec<u8> = (0..10)
                .filter(|seed| listed.contains(&harness::node_id(*seed)))
                .collect();
            let seed = if !ours.is_empty() && rng.chance(0.75) {
                *rng.pick(&ours)
            } else {
                rng.below(10) as u8
            };
            harness::merge(&party.name, seed, &deps)
        } else if roll < 35 || (roll >= 60 && mine.is_empty()) {
            let path = format!("home/{}/k{}", party.name, rng.below(3));
            writer.write(&deps, &path, harness::str(&step.to_string()))
        } else if roll < 43 {
            let new = SigningKey::from_bytes(&[(100 + step as u8).wrapping_add(w as u8 * 31); 32]);
            let line = PublicKey(new.verifying_key().to_bytes()).line();
            signing[w] = new;
            party.keys(&deps, &[line])
        } else if roll < 48 {
            party.nodes(&deps, &[harness::node_id(rng.below(10) as u8)])
        } else if roll < 60 {
            match specs.get(&current.hash) {
                None => writer.write(&deps, &format!("home/{}/x", party.name), harness::str("x")),
                Some(base) => {
                    let mut next = base.after(current.hash);
                    let named = kind.checkpoints
                        && rng.chance(0.5)
                        && deps.iter().any(|dep| *dep != root_id);
                    if named {
                        let head = *deps.iter().find(|dep| **dep != root_id).expect("one");
                        next.checkpoint = Some(vec![head]);
                        deps = vec![head];
                    } else {
                        next.rules
                            .push((format!("names/x{step}"), harness::str(&party.name)));
                    }
                    if kind.unread && rng.chance(0.5) {
                        // A field this continuum doesn't know: none here.
                        let Json::Object(mut members) = next.json() else {
                            unreachable!("a version is an object")
                        };
                        members.push(("later".to_owned(), Json::Bool(true)));
                        let later = Json::object(members).expect("names once each");
                        let bytes = party.propose(&deps, &later);
                        proposals.push((
                            Id::of(&bytes),
                            Id::of(&later.bytes()),
                            current.hash,
                            named,
                        ));
                        bytes
                    } else {
                        let bytes = party.propose(&deps, &next.json());
                        proposals.push((Id::of(&bytes), next.hash(), current.hash, named));
                        specs.insert(next.hash(), next);
                        bytes
                    }
                }
            }
        } else if roll < 85 {
            let (proposal, hash, on, named) = chosen(rng);
            let yes = if kind.adversary && w == adversary {
                rng.chance(0.7)
            } else {
                backed[w].insert(on)
            };
            if !named && rng.chance(0.3) {
                deps.push(proposal);
            } else {
                deps = vec![proposal];
            }
            let bytes = party.vote(&deps, on, hash, yes);
            votes.push((Id::of(&bytes), proposal));
            bytes
        } else if roll < 96 || !kind.adversary {
            let (proposal, hash, ..) = chosen(rng);
            let on_it: Vec<Id> = votes
                .iter()
                .filter(|(vote, voted)| *voted == proposal && known[w].contains(vote))
                .map(|(vote, _)| *vote)
                .collect();
            let deps = if on_it.is_empty() {
                vec![proposal]
            } else {
                on_it
            };
            harness::version_event(&deps, hash)
        } else {
            // The adversary signs as another party with its own key, or writes elsewhere.
            let victim = &parties[rng.below(count)];
            let thief = Party {
                name: victim.name.clone(),
                key: parties[adversary].key.clone(),
            };
            if rng.chance(0.5) {
                thief.write(
                    &deps,
                    &format!("home/{}/k0", victim.name),
                    harness::str("stolen"),
                )
            } else {
                parties[adversary].write(
                    &deps,
                    &format!("names/{}", victim.name),
                    harness::str("x"),
                )
            }
        };
        let id = Id::of(&event);
        world.offer(event.clone());
        known[w].push(id);
        events.push(event);
    }
    History { root, events }
}

fn check(cases: u64, kind: Kind, property: impl Fn(&History) -> Result<(), String>) {
    for_seeds(cases, |rng| {
        let history = generate(rng, kind);
        if let Err(why) = property(&history) {
            let (history, why) = cut_down(history, why, &property);
            panic!("{why}, in the history\n{}", history.show());
        }
    });
}

fn cut_down(
    mut history: History,
    mut why: String,
    property: &impl Fn(&History) -> Result<(), String>,
) -> (History, String) {
    'shorter: loop {
        for i in (0..history.events.len()).rev() {
            let shorter = history.without(i);
            if let Err(still) = property(&shorter) {
                (history, why) = (shorter, still);
                continue 'shorter;
            }
        }
        return (history, why);
    }
}

/// The current version's hash, the values at places, and the members.
type Reads = (
    Id,
    BTreeMap<String, super::jcs::Json>,
    BTreeSet<(String, String)>,
);

/// What a store reads, to compare with the model or another store.
fn reads(store: &Store<Federation>) -> Reads {
    let state = store.state();
    (
        state.current().hash,
        state.values(),
        state.members().into_iter().collect(),
    )
}

fn model_reads(model: &Model) -> Reads {
    (model.version().hash, model.values(), model.members())
}

/// What a store holds, to compare with another store: its checkpoint, the events it took
/// after it, and what it reads.
fn holds(store: &Store<Federation>) -> (Vec<u8>, BTreeSet<Id>, Reads) {
    (
        store.checkpoint().to_vec(),
        store.taken().iter().copied().collect(),
        reads(store),
    )
}

/// The verdict a store's answer stands for.
fn verdict(offered: &Offered) -> Verdict {
    match offered {
        Offered::Taken(_) => Verdict::Taken,
        Offered::Held => Verdict::Held,
        Offered::Waiting => Verdict::Waiting,
        Offered::Refused(_) => Verdict::Refused,
        Offered::Stopped => Verdict::Stopped,
    }
}

/// Whether the store judges and reads `history` as the model does, its events offered in
/// the order written; and whether it stopped.
fn judged_as_the_model(history: &History) -> Result<bool, String> {
    let mut model = Model::new(&history.root);
    let mut store: Store<Federation> =
        Store::new(history.root.clone(), Vec::new()).expect("a root");
    for event in &history.events {
        let id = Id::of(event);
        let stored = verdict(&store.offer(event.clone()));
        let modelled = model.offer(event);
        if stored != modelled {
            return Err(format!(
                "{id}: the store says {stored:?}, the model {modelled:?}"
            ));
        }
    }
    if reads(&store) != model_reads(&model) {
        return Err(format!(
            "the store reads {:?}, the model {:?}",
            reads(&store),
            model_reads(&model)
        ));
    }
    Ok(store.stopped().is_some())
}

/// Seeds of the kinds with versions this continuum doesn't read scanned beyond the cases
/// where none of those stopped a store, till one does.
const SCANNED_FOR_A_STOP: u64 = 1000;

/// Where parties propose versions this continuum doesn't read too, the store stops where
/// the model does: written in order, events come after what they build on, and both stop
/// at the same event, taking the same before it. Where none of the cases stops a store,
/// later seeds are scanned for one that does, which is checked too: a stop is checked
/// whatever the generator's luck.
#[test]
fn the_store_judges_and_reads_as_the_model() {
    let stopped = std::cell::Cell::new(0);
    let kinds = [
        (false, false, 48),
        (true, false, 48),
        (false, true, 32),
        (true, true, 32),
    ];
    let kind = |adversary, unread| Kind {
        adversary,
        checkpoints: false,
        unread,
    };
    for (adversary, unread, cases) in kinds {
        check(cases, kind(adversary, unread), |history| {
            if judged_as_the_model(history)? {
                stopped.set(stopped.get() + 1);
            }
            Ok(())
        });
    }
    // Past the seeds of the cases of the kinds with versions this continuum doesn't read.
    let mut seed = kinds
        .iter()
        .filter(|(_, unread, _)| *unread)
        .map(|(_, _, cases)| *cases)
        .max()
        .unwrap_or(0);
    while stopped.get() == 0 && seed < SCANNED_FOR_A_STOP {
        for adversary in [false, true] {
            let history = generate(&mut Rng::new(seed), kind(adversary, true));
            match judged_as_the_model(&history) {
                Ok(true) => stopped.set(stopped.get() + 1),
                Ok(false) => {}
                Err(why) => {
                    let (history, why) = cut_down(history, why, &|history: &History| {
                        judged_as_the_model(history).map(|_| ())
                    });
                    panic!("{why}, for seed {seed}, in the history\n{}", history.show());
                }
            }
        }
        seed += 1;
    }
    assert!(
        stopped.get() > 0,
        "no history of the first {SCANNED_FOR_A_STOP} seeds stopped a store"
    );
}

#[test]
fn what_builds_on_a_refused_event_is_refused() {
    check(
        48,
        Kind {
            adversary: true,
            checkpoints: true,
            unread: false,
        },
        |history| {
            let (store, _) = history.store(&history.written());
            for event in &history.events {
                let id = Id::of(event);
                let deps = Federation::dependencies(event).unwrap_or_default();
                if let Some(dep) = deps.iter().find(|dep| store.refusal(dep).is_some())
                    && store.refusal(&id).is_none()
                {
                    return Err(format!("{id} is taken, built on {dep}, which is refused"));
                }
            }
            Ok(())
        },
    );
}

#[test]
fn honest_parties_read_the_same_whatever_order_events_come_in() {
    check(
        32,
        Kind {
            adversary: false,
            checkpoints: true,
            unread: false,
        },
        |history| {
            let held = holds(&history.store(&history.written()).0);
            let mut rng = Rng::new(history.events.len() as u64);
            let mut orders = vec![history.written().into_iter().rev().collect::<Vec<usize>>()];
            for _ in 0..3 {
                let mut order = history.written();
                rng.shuffle(&mut order);
                orders.push(order);
            }
            for order in orders {
                if holds(&history.store(&order).0) != held {
                    return Err(format!(
                        "offered in the order {order:?}, a store holds otherwise"
                    ));
                }
            }
            Ok(())
        },
    );
}

/// The events of a history put into a document by two writers, in batches of a shuffled
/// order, some by both at once, the writers merging now and then; a node reads its store
/// from each writer's document as it grows, and once more after both merged.
#[test]
fn a_store_read_from_its_document_holds_what_one_given_the_events_alone_holds() {
    check(
        24,
        Kind {
            adversary: false,
            checkpoints: true,
            unread: false,
        },
        |history| {
            let alone = holds(&history.store(&history.written()).0);
            let mut rng = Rng::new(history.events.len() as u64);
            let started = events::started(Federation::NAME, &history.root, &[]).expect("a root");
            let mut docs = [started.fork(), started.fork()];
            let holdings = [Holding::default(), Holding::default()];
            let read = |holdings: &[Holding; 2], docs: &[_; 2]| {
                for (holding, doc) in holdings.iter().zip(docs) {
                    holding.read(holding.unread(doc, 0).expect("a store"));
                }
            };
            let mut order = history.written();
            rng.shuffle(&mut order);
            let mut rest = order.as_slice();
            while !rest.is_empty() {
                let (batch, after) = rest.split_at(rng.between(1, 4).min(rest.len()));
                rest = after;
                let batch: Vec<&[u8]> = batch.iter().map(|&i| &history.events[i][..]).collect();
                let at = usize::from(rng.chance(0.5));
                events::put(&mut docs[at], &batch);
                if rng.chance(0.2) {
                    events::put(&mut docs[1 - at], &batch);
                }
                if rng.chance(0.3) {
                    let [one, other] = &mut docs;
                    one.merge(other).expect("merged");
                    other.merge(one).expect("merged");
                }
                read(&holdings, &docs);
            }
            let [one, other] = &mut docs;
            one.merge(other).expect("merged");
            other.merge(one).expect("merged");
            read(&holdings, &docs);
            for (n, holding) in holdings.iter().enumerate() {
                if holding.with(holds).as_ref() != Some(&alone) {
                    return Err(format!(
                        "the store read from writer {n}'s document holds otherwise than one \
                         given the events alone"
                    ));
                }
            }
            Ok(())
        },
    );
}

#[test]
fn after_a_checkpoint_the_store_judges_and_reads_as_the_whole_history() {
    check(
        48,
        Kind {
            adversary: false,
            checkpoints: true,
            unread: false,
        },
        |history| {
            let (store, _) = history.store(&history.written());
            // What the store refused as not above a checkpoint, and what builds on it, the
            // model is never given: it reads every history from the root, never moving.
            let mut beside = BTreeSet::new();
            let mut model = Model::new(&history.root);
            for event in &history.events {
                let id = Id::of(event);
                let deps = Federation::dependencies(event).unwrap_or_default();
                if store.refusal(&id) == Some(&Refusal::NotAbove)
                    || deps.iter().any(|dep| beside.contains(dep))
                {
                    beside.insert(id);
                    continue;
                }
                model.offer(event);
            }
            let taken = model.taken();
            for id in store.taken() {
                if !taken.contains(id) {
                    return Err(format!(
                        "{id} is taken after the checkpoint, not by the model"
                    ));
                }
            }
            if reads(&store) != model_reads(&model) {
                return Err(format!(
                    "the store reads {:?}, the whole history {:?}",
                    reads(&store),
                    model_reads(&model)
                ));
            }
            // Moving refused nothing that decided it: the version naming the checkpoint is
            // written there, its proposal held.
            let (at, _) = Federation::parts(store.checkpoint()).expect("a checkpoint");
            if !at.is_empty() {
                let held: Vec<Event> = store
                    .taken()
                    .iter()
                    .filter_map(|id| store.get(id).and_then(Event::read_taken))
                    .collect();
                let written: BTreeSet<Id> = held
                    .iter()
                    .filter_map(|event| match event {
                        Event::Version { version, .. } => Some(*version),
                        Event::Signed(_) => None,
                    })
                    .collect();
                let named = held.iter().any(|event| match event {
                    Event::Signed(signed) => match &signed.does {
                        Does::Proposal { hash, version } => {
                            written.contains(hash)
                                && Version::read(version).is_ok_and(|version| {
                                    version.checkpoint.as_deref() == Some(&at[..])
                                })
                        }
                        _ => false,
                    },
                    Event::Version { .. } => false,
                });
                if !named {
                    return Err("the version naming the checkpoint isn't taken".to_owned());
                }
            }
            Ok(())
        },
    );
}

#[test]
fn every_version_a_store_takes_was_passed_by_two_thirds_in_its_history() {
    check(
        48,
        Kind {
            adversary: true,
            checkpoints: false,
            unread: false,
        },
        |history| {
            let (store, _) = history.store(&history.written());
            let first = Checkpoint::read(&history.root).expect("a root").version;
            for id in store.taken() {
                let Some(Event::Version { deps, version }) =
                    store.get(id).and_then(Event::read_taken)
                else {
                    continue;
                };
                // Its history, read from what the store holds.
                let mut seen = BTreeSet::new();
                let mut todo = deps.clone();
                let mut events = Vec::new();
                while let Some(dep) = todo.pop() {
                    if let Some(bytes) = store.get(&dep)
                        && seen.insert(dep)
                    {
                        let event = Event::read_taken(bytes).expect("an event");
                        todo.extend_from_slice(event.deps());
                        events.push(event);
                    }
                }
                let proposed = |hash: &Id| {
                    events.iter().find_map(|event| match event {
                        Event::Signed(signed) => match &signed.does {
                            Does::Proposal {
                                hash: proposed,
                                version,
                            } if proposed == hash => Version::read(version).ok(),
                            _ => None,
                        },
                        Event::Version { .. } => None,
                    })
                };
                let next = proposed(&version).ok_or(format!("{id}: no proposal in its history"))?;
                let changed = match next.changes {
                    Some(hash) if hash == first.hash => first.clone(),
                    Some(hash) => proposed(&hash).ok_or(format!("{id}: no version it changes"))?,
                    None => return Err(format!("{id}: a first version written")),
                };
                let yes: BTreeSet<&str> = events
                    .iter()
                    .filter_map(|event| match event {
                        Event::Signed(signed) => match signed.does {
                            Does::Vote {
                                on,
                                proposal,
                                yes: true,
                            } if on == changed.hash && proposal == version => {
                                Some(signed.party.as_str())
                            }
                            _ => None,
                        },
                        Event::Version { .. } => None,
                    })
                    .collect();
                if 3 * yes.len() < 2 * changed.parties.len() {
                    return Err(format!(
                        "{id}: written with {} of {} parties",
                        yes.len(),
                        changed.parties.len()
                    ));
                }
            }
            Ok(())
        },
    );
}

#[test]
fn without_a_party_voting_twice_no_two_versions_change_one() {
    check(
        48,
        Kind {
            adversary: false,
            checkpoints: true,
            unread: false,
        },
        |history| {
            let (store, _) = history.store(&history.written());
            if let Some((id, _)) = store.refused().find(|(_, why)| **why == Refusal::Own) {
                return Err(format!("{id}: a version changing one another changes"));
            }
            Ok(())
        },
    );
}

/// A fork at the heads of a history's first half, by the version current there, numbered
/// one past it and changing it: its root keeps what counts at those heads, with its
/// version current; it takes nothing else of the history; and the store it came from
/// takes nothing built on the fork's root.
#[test]
fn a_fork_keeps_what_counts_at_its_heads_and_takes_nothing_of_the_other() {
    check(
        32,
        Kind {
            adversary: false,
            checkpoints: false,
            unread: false,
        },
        |history| {
            let (mut whole, _) = history.store(&history.written());
            let half: Vec<usize> = (0..history.events.len() / 2).collect();
            let (at, _) = history.store(&half);
            let heads = at.heads();
            let current = at.state().current();
            let super::jcs::Json::Object(mut members) = current
                .json
                .without("number")
                .without("changes")
                .without("checkpoint")
            else {
                return Err("a version that is no object".to_owned());
            };
            members.push((
                "number".to_owned(),
                super::jcs::Json::Int(current.number as i64 + 1),
            ));
            members.push((
                "changes".to_owned(),
                super::jcs::Json::Str(current.hash.to_string()),
            ));
            let spec = super::jcs::Json::object(members).expect("names once each");
            let (root, kept) = whole
                .fork(&heads, &spec.bytes())
                .map_err(|why| format!("no fork at {heads:?}: {}", why.0))?;
            let mut fork: Store<Federation> =
                Store::new(root.clone(), kept).map_err(|why| format!("no root: {}", why.0))?;
            if fork.state().current().hash != Id::of(&spec.bytes()) {
                return Err("the fork's version isn't current at its root".to_owned());
            }
            if fork.state().values() != at.state().values()
                || fork.state().members() != at.state().members()
            {
                return Err("the fork's root doesn't keep what counts at its heads".to_owned());
            }
            for event in &history.events {
                if let Offered::Taken(ids) = fork.offer(event.clone()) {
                    return Err(format!("the fork takes {ids:?} of the history"));
                }
            }
            let on_the_fork = harness::version_event(&[Id::of(&root)], Id::of(b"a version"));
            if matches!(whole.offer(on_the_fork), Offered::Taken(_)) {
                return Err("the store it came from takes what builds on the fork".to_owned());
            }
            Ok(())
        },
    );
}