aven-protocol 0.1.0

Storage-independent encrypted sync protocol for Aven
Documentation
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
use super::*;

fn rotate_fixed(
    device: Device<'_>,
    m: &Membership,
    keys: &VerifiedKeys,
    id: u8,
    cutoff: u64,
) -> (Vec<u8>, Membership, VerifiedKeys) {
    let raw = device
        .rotation_with(
            m,
            keys,
            [id; 32],
            &LocalSharedStatePackageKey::new([id + 1; 32]),
            cutoff,
            &mut ChaCha20Rng::from_seed([id + 2; 32]),
        )
        .unwrap();
    let keys = device.receive_rotation(m, &raw, keys).unwrap();
    let next = m.append(&[], &[], &raw).unwrap();
    keys.validate(&next).unwrap();
    (raw, next, keys)
}
fn add_fixed(
    device: Device<'_>,
    m: &Membership,
    keys: &VerifiedKeys,
    seed: u8,
) -> (Declaration, Joiner, Vec<u8>, Membership) {
    let (inv, d) = device
        .invitation_with_psk(m, 100, Secret::new([seed; 32]))
        .unwrap();
    let peer = joiner(&inv, seed + 1);
    let plain =
        admission::grant_plaintext(m, &d, peer.request(), &peer.0.recipient().unwrap(), keys);
    let raw = reseal(m, &d, &peer, device.signing, &plain, seed + 5);
    let next = m.append(d.record(), peer.request(), &raw).unwrap();
    (d, peer, raw, next)
}
fn resign(
    seed: &Secret,
    raw: &[u8],
    change: impl FnOnce(&mut Vec<u8>, &mut Vec<u8>, &mut Vec<u8>),
) -> Vec<u8> {
    let (core, state, packages, _) = encoding::components(raw).unwrap();
    let (mut core, mut state, mut packages) = (core.to_vec(), state.to_vec(), packages.to_vec());
    change(&mut core, &mut state, &mut packages);
    let end = core.len();
    core[end - 32..].copy_from_slice(&hash(&cce("aven-e2ee/v1/membership/state", &[&state])));
    admission::signed(seed, &core, &state, &packages)
}

#[test]
fn exact_removal_rotation_empty_interval_and_fresh_join_vectors() {
    let f = fixture();
    let (_, _, peer, _, m) = first(&f);
    let keys = m.verify_initial_key(&f.key).unwrap();
    let revoke = peer
        .authority()
        .prepare_revoke(&m, &[f.seed.genesis().device_id()])
        .unwrap();
    let pending = m.append(&[], &[], &revoke).unwrap();
    assert!(pending.rotation_pending());
    assert!(Device::seed(&f.seed).prepare_revoke(&pending, &[]).is_err());
    assert!(
        peer.authority()
            .prepare_revoke(&pending, &[peer.device()])
            .is_err()
    );
    assert!(
        pending
            .unique(
                &Recipient {
                    device: f.seed.genesis().device_id(),
                    sign: [70; 32],
                    hpke: [71; 32],
                    verifier: [72; 32],
                    pop: [0; 64]
                },
                &[73; 32]
            )
            .is_err()
    );
    for which in 0..3 {
        let mut r = peer.0.recipient().unwrap();
        r.device = [210; 32];
        r.sign = [211; 32];
        r.hpke = [212; 32];
        match which {
            0 => r.device = f.seed.genesis().device_id(),
            1 => r.sign = f.seed.genesis().signing_public(),
            _ => r.hpke = f.seed.genesis().hpke_public(),
        }
        assert!(pending.unique(&r, &[73; 32]).is_err());
    }
    let (rotation, rotated, keys2) = rotate_fixed(peer.authority(), &pending, &keys, 100, 10);
    assert!(!rotated.rotation_pending());
    assert!(rotated.generation_allows(f.seed.genesis().context().generation_id, 10));
    assert!(!rotated.generation_allows(f.seed.genesis().context().generation_id, 11));
    assert!(!rotated.generation_allows([100; 32], 10));
    assert!(rotated.generation_allows([100; 32], 11));
    assert!(!rotated.generation_allows([99; 32], 11));
    assert!(rotated.verify_initial_key(&f.key).is_err());
    let freeze2 = peer.authority().prepare_revoke(&rotated, &[]).unwrap();
    let pending2 = rotated.append(&[], &[], &freeze2).unwrap();
    let (rotation2, twice, keys3) = rotate_fixed(peer.authority(), &pending2, &keys2, 110, 10);
    assert!(!twice.generation_allows([100; 32], 10));
    assert!(!twice.generation_allows([100; 32], 11));
    assert!(twice.generation_allows([110; 32], 11));
    assert_eq!(
        keys3
            .key(f.seed.genesis().context().generation_id)
            .unwrap()
            .protected_storage_bytes(),
        f.key.protected_storage_bytes()
    );
    let (d, joiner, admission, joined) = add_fixed(peer.authority(), &twice, &keys3, 60);
    let verified = joiner
        .verify_enrollment(&twice, d.record(), &admission)
        .unwrap();
    verified.keys().validate(&joined).unwrap();
    assert_eq!(
        verified.key().protected_storage_bytes(),
        f.key.protected_storage_bytes()
    );
    assert_eq!(joined.publication().record(), m.publication().record());
    let vector = serde_json::json!({
        "revoke": hex::encode(&revoke), "revoke_sha256": hex::encode(hash(&revoke)),
        "rotation": hex::encode(&rotation), "rotation_sha256": hex::encode(hash(&rotation)),
        "freeze_again": hex::encode(&freeze2), "empty_rotation": hex::encode(&rotation2),
        "empty_rotation_sha256": hex::encode(hash(&rotation2)),
        "fresh_declaration": hex::encode(d.record()), "fresh_request": hex::encode(joiner.request()),
        "fresh_admission": hex::encode(&admission), "fresh_sha256": hex::encode(hash(&admission))
    });
    let expected: serde_json::Value =
        serde_json::from_str(include_str!("../../fixtures/rotation.json")).unwrap();
    assert_eq!(vector, expected);
}

#[test]
fn every_survivor_opens_own_package_and_pending_admission_preserves_freeze() {
    let f = fixture();
    let (_, _, peer, _, m) = first(&f);
    let keys = m.verify_initial_key(&f.key).unwrap();
    let freeze = peer.authority().prepare_revoke(&m, &[]).unwrap();
    let pending = m.append(&[], &[], &freeze).unwrap();
    let (d, third, admission, pending) = add_fixed(peer.authority(), &pending, &keys, 65);
    assert!(pending.pending);
    let verified = third
        .verify_enrollment(
            &m.append(&[], &[], &freeze).unwrap(),
            d.record(),
            &admission,
        )
        .unwrap();
    let raw = Device::seed(&f.seed)
        .prepare_rotation(&pending, &keys, 0)
        .unwrap();
    let other = Device::seed(&f.seed)
        .prepare_rotation(&pending, &keys, 0)
        .unwrap();
    let branch = pending.append(&[], &[], &raw).unwrap();
    let other_branch = pending.append(&[], &[], &other).unwrap();
    assert_ne!(
        branch.current_generation().id,
        other_branch.current_generation().id
    );
    assert_ne!(
        branch.current_generation().commitment,
        other_branch.current_generation().commitment
    );
    assert!(!branch.extends(&other_branch));
    for device in [Device::seed(&f.seed), peer.authority(), third.authority()] {
        let k = device
            .receive_rotation(&pending, &raw, verified.keys())
            .unwrap();
        k.validate(&pending.append(&[], &[], &raw).unwrap())
            .unwrap();
    }
    assert!(
        Device::seed(&f.seed)
            .prepare_rotation(&m, &keys, 0)
            .is_err()
    );
    let self_leave = peer
        .authority()
        .prepare_revoke(&m, &[peer.device()])
        .unwrap();
    let left = m.append(&[], &[], &self_leave).unwrap();
    assert_eq!(left.device_count(), 1);
    assert!(peer.authority().prepare_rotation(&left, &keys, 0).is_err());
    Device::seed(&f.seed)
        .prepare_rotation(&left, &keys, 0)
        .unwrap();
}

#[test]
fn rotation_missing_extra_reordered_or_invalid_own_packages_never_yield_keys() {
    let f = fixture();
    let (_, _, peer, _, m) = first(&f);
    let keys = m.verify_initial_key(&f.key).unwrap();
    let freeze = Device::seed(&f.seed).prepare_revoke(&m, &[]).unwrap();
    let pending = m.append(&[], &[], &freeze).unwrap();
    let (raw, _, _) = rotate_fixed(Device::seed(&f.seed), &pending, &keys, 100, 0);
    for kind in 0..7 {
        let bad = resign(
            f.seed.protected_signing_seed(),
            &raw,
            |_, _, p| match kind {
                0 => {
                    p[7] = 1;
                    p.truncate(8 + 306);
                }
                1 => {
                    p[7] = 3;
                    p.extend_from_within(8..314);
                }
                2 => {
                    let first = p[8..314].to_vec();
                    let second = p[314..620].to_vec();
                    p[8..314].copy_from_slice(&second);
                    p[314..620].copy_from_slice(&first);
                }
                3 => {
                    let first = p[8..314].to_vec();
                    p[314..620].copy_from_slice(&first);
                }
                4 => p[9] = 1,
                5 => p[14] ^= 1,
                _ => p[50] ^= 1,
            },
        );
        assert!(pending.append(&[], &[], &bad).is_err(), "shape {kind}");
        assert!(
            peer.authority()
                .receive_rotation(&pending, &bad, &keys)
                .is_err()
        );
    }
    // A valid signature cannot make malformed encrypted plaintext usable.
    for device in [Device::seed(&f.seed), peer.authority()] {
        let (core, state, packages, _) = encoding::components(&raw).unwrap();
        let rows = encoding::read_packages(packages, 0, 2, 176).unwrap();
        let mut changed = encoding::packages(2);
        for p in rows {
            let mut cipher = p.cipher.to_vec();
            if p.device == device.device {
                cipher[0] ^= 1;
            }
            encoding::package(&mut changed, 0, &p.device, &p.public, p.enc, &cipher);
        }
        let bad = admission::signed(f.seed.protected_signing_seed(), core, state, &changed);
        assert!(pending.append(&[], &[], &bad).is_ok());
        assert!(device.receive_rotation(&pending, &bad, &keys).is_err());
    }
}

#[test]
fn rotation_semantics_cutoff_context_and_predecessor_signature_are_strict() {
    let f = fixture();
    let (_, _, peer, _, m) = first(&f);
    let keys = m.verify_initial_key(&f.key).unwrap();
    let freeze = Device::seed(&f.seed).prepare_revoke(&m, &[]).unwrap();
    let pending = m.append(&[], &[], &freeze).unwrap();
    let (raw, next, keys2) = rotate_fixed(Device::seed(&f.seed), &pending, &keys, 100, 10);
    for i in 0..raw.len() {
        let mut bad = raw.clone();
        bad[i] ^= 1;
        assert!(pending.append(&[], &[], &bad).is_err(), "mutation {i}");
        assert!(
            pending.append(&[], &[], &raw[..i]).is_err(),
            "truncation {i}"
        );
    }
    let (core, state, p, _) = encoding::components(&raw).unwrap();
    for i in 0..core.len() {
        let mut changed = core.to_vec();
        changed[i] ^= 1;
        let bad = admission::signed(f.seed.protected_signing_seed(), &changed, state, p);
        assert!(pending.append(&[], &[], &bad).is_err(), "core {i}");
    }
    for i in 0..state.len() {
        let bad = resign(f.seed.protected_signing_seed(), &raw, |_, s, _| s[i] ^= 1);
        assert!(pending.append(&[], &[], &bad).is_err(), "state {i}");
    }
    assert!(
        pending
            .append(
                &[],
                &[],
                &admission::signed(&peer.0.signing, core, state, p)
            )
            .is_err()
    );
    assert!(pending.append(&[0], &[], &raw).is_err());
    assert!(next.append(&[], &[], &raw).is_err());
    let freeze = Device::seed(&f.seed).prepare_revoke(&next, &[]).unwrap();
    let pending2 = next.append(&[], &[], &freeze).unwrap();
    assert!(
        Device::seed(&f.seed)
            .prepare_rotation(&pending2, &keys2, 9)
            .is_err()
    );
    assert!(
        Device::seed(&f.seed)
            .rotation_with(
                &pending2,
                &keys2,
                [100; 32],
                &f.key,
                10,
                &mut ChaCha20Rng::from_seed([0; 32])
            )
            .is_err()
    );
    assert!(
        Device::seed(&f.seed)
            .receive_rotation(&pending2, &raw, &keys)
            .is_err()
    );
    // A nonzero bootstrap prefix is an independent lower bound on cutoff.
    let mut prefix = pending.clone();
    prefix.publication.binding.prefix_count = 20;
    assert!(
        Device::seed(&f.seed)
            .prepare_rotation(&prefix, &keys, 19)
            .is_err()
    );
}

#[test]
fn complete_ordered_join_history_is_required_before_verified_keys() {
    let f = fixture();
    let (_, _, peer, _, m) = first(&f);
    let keys = m.verify_initial_key(&f.key).unwrap();
    let freeze = Device::seed(&f.seed).prepare_revoke(&m, &[]).unwrap();
    let pending = m.append(&[], &[], &freeze).unwrap();
    let (_, m, keys) = rotate_fixed(Device::seed(&f.seed), &pending, &keys, 100, 0);
    let (inv, d) = peer
        .authority()
        .invitation_with_psk(&m, 100, Secret::new([70; 32]))
        .unwrap();
    let joiner = joiner(&inv, 71);
    let plain = admission::grant_plaintext(
        &m,
        &d,
        joiner.request(),
        &joiner.0.recipient().unwrap(),
        &keys,
    );
    for kind in 0..6 {
        let mut bad = plain.clone();
        let start = GRANT_PREFIX_BYTES + 2;
        match kind {
            0 => bad[GRANT_PREFIX_BYTES + 1] = 1,
            1 => bad[GRANT_PREFIX_BYTES + 1] = 3,
            2 => {
                let a = bad[start..start + 72].to_vec();
                let b = bad[start + 72..start + 144].to_vec();
                bad[start..start + 72].copy_from_slice(&b);
                bad[start + 72..].copy_from_slice(&a);
            }
            3 => bad[start + 32] ^= 1,
            4 => bad[start + 64] ^= 1,
            _ => {
                let a = bad[start..start + 72].to_vec();
                bad[start + 72..].copy_from_slice(&a);
            }
        }
        let raw = reseal(&m, &d, &joiner, &peer.0.signing, &bad, 80);
        assert!(m.append(d.record(), joiner.request(), &raw).is_ok());
        assert!(
            joiner.verify_enrollment(&m, d.record(), &raw).is_err(),
            "coverage {kind}"
        );
    }
    assert!(
        peer.authority()
            .prepare_admission(
                &m,
                &d,
                &inv,
                joiner.request(),
                &f.membership.verify_initial_key(&f.key).unwrap()
            )
            .is_err()
    );
}

#[test]
fn maximum_signed_chain_fits_every_bound() {
    let f = fixture();
    let seed = || Device::seed(&f.seed);
    let mut m = f.membership.clone();
    let mut keys = m.verify_initial_key(&f.key).unwrap();
    let mut transitions = Vec::new();
    let record = |record: Vec<u8>| EvidenceRecord {
        declaration: vec![],
        request: vec![],
        record,
    };
    for i in 0..MAX_DEVICES as u8 - 1 {
        let (d, peer, raw, next) = add_fixed(seed(), &m, &keys, i * 6);
        transitions.push(EvidenceRecord {
            declaration: d.record().to_vec(),
            request: peer.request().to_vec(),
            record: raw,
        });
        m = next;
    }
    assert_eq!(m.device_count(), MAX_DEVICES);
    for i in 0..MAX_GENERATIONS as u8 - 2 {
        let freeze = seed().prepare_revoke(&m, &[]).unwrap();
        m = m.append(&[], &[], &freeze).unwrap();
        transitions.push(record(freeze));
        let (raw, next, next_keys) = rotate_fixed(seed(), &m, &keys, 100 + i, 0);
        m = next;
        keys = next_keys;
        transitions.push(record(raw));
    }
    // Freezes retaining every member fill the history up to the final removal,
    // rotation and admission.
    while transitions.len() + 3 < MAX_TRANSITIONS {
        let freeze = seed().prepare_revoke(&m, &[]).unwrap();
        assert_eq!(freeze.len(), MAX_REVOKE_BYTES - GENERATION_BYTES);
        m = m.append(&[], &[], &freeze).unwrap();
        transitions.push(record(freeze));
    }

    // The largest rotation packages a key for every member into the last generation.
    let (largest, full, full_keys) = rotate_fixed(seed(), &m, &keys, 200, 0);
    assert_eq!(largest.len(), MAX_ROTATION_BYTES);
    assert_eq!(full.generations().len(), MAX_GENERATIONS);
    assert_eq!(
        full_keys.protected_storage_bytes().len(),
        MAX_COVERAGE_BYTES
    );
    VerifiedKeys::from_protected_storage(&full, &full_keys.protected_storage_bytes()).unwrap();
    let error = seed().prepare_revoke(&full, &[]).err().unwrap();
    assert_eq!(error.to_string(), "error membership-change-limit");

    // The largest admission grants every generation key to the last free slot,
    // through an invitation made while a withdrawal still fit.
    let removal = seed().prepare_revoke(&m, &[[1; 32]]).unwrap();
    m = m.append(&[], &[], &removal).unwrap();
    transitions.push(record(removal));
    let (inv, d) = seed()
        .invitation_with_psk(&m, 100, Secret::new([186; 32]))
        .unwrap();
    let (raw, next, next_keys) = rotate_fixed(seed(), &m, &keys, 201, 0);
    m = next;
    keys = next_keys;
    transitions.push(record(raw));
    let error = seed().prepare_invitation(&m, 100).err().unwrap();
    assert_eq!(error.to_string(), "error membership-change-limit");
    let peer = joiner(&inv, 187);
    let plain =
        admission::grant_plaintext(&m, &d, peer.request(), &peer.0.recipient().unwrap(), &keys);
    assert_eq!(plain.len(), MAX_KEY_PLAINTEXT_BYTES);
    let raw = reseal(&m, &d, &peer, seed().signing, &plain, 191);
    let next = m.append(d.record(), peer.request(), &raw).unwrap();
    assert_eq!(raw.len(), MAX_ADMISSION_BYTES);
    peer.verify_enrollment(&m, d.record(), &raw).unwrap();
    transitions.push(EvidenceRecord {
        declaration: d.record().to_vec(),
        request: peer.request().to_vec(),
        record: raw,
    });
    m = next;

    // The complete signed history verifies within the evidence and response bounds.
    let evidence = Evidence {
        genesis: f.seed.genesis().record().to_vec(),
        publication: f.membership.publication.record().to_vec(),
        descriptor: publication::tests::descriptor(f.seed.genesis()),
        transitions,
    };
    assert_eq!(evidence.transitions.len(), MAX_TRANSITIONS);
    assert_eq!(evidence.verify().unwrap().head(), m.head());
    let json = serde_json::to_vec(&evidence).unwrap();
    assert_eq!(Evidence::decode(&json).unwrap().1.head(), m.head());
    assert!(seed().prepare_revoke(&m, &[]).is_err());
    assert!(seed().prepare_invitation(&m, 100).is_err());

    // Every stored byte at its encoded maximum still fits the JSON and HTTP bounds.
    let filled = |n: usize| vec![255; n];
    let mut worst = Evidence {
        genesis: filled(GENESIS_BYTES),
        publication: filled(PUBLICATION_BYTES),
        descriptor: filled(crate::artifact::codec::MAX_DESCRIPTOR_BYTES),
        transitions: vec![],
    };
    for index in 0..MAX_TRANSITIONS {
        worst.transitions.push(if index < MAX_GENERATIONS - 1 {
            record(filled(MAX_ROTATION_BYTES))
        } else {
            EvidenceRecord {
                declaration: filled(DECLARATION_BYTES),
                request: filled(REQUEST_BYTES),
                record: filled(MAX_ADMISSION_BYTES),
            }
        });
    }
    let bytes = worst.genesis.len()
        + worst.publication.len()
        + worst.descriptor.len()
        + worst
            .transitions
            .iter()
            .map(|t| t.declaration.len() + t.request.len() + t.record.len())
            .sum::<usize>();
    assert_eq!(bytes, MAX_CHAIN_BYTES);
    assert!(serde_json::to_vec(&worst).unwrap().len() <= MAX_EVIDENCE_JSON_BYTES);
    let preparation = ManagementPreparation {
        evidence: worst,
        high_water: u64::MAX,
    };
    assert!(serde_json::to_vec(&preparation).unwrap().len() <= MAX_EVIDENCE_JSON_BYTES + 128);
}

#[test]
fn freeze_is_refused_without_room_for_its_rotation() {
    let f = fixture();
    let mut near = f.membership.clone();
    near.heads = vec![near.head(); MAX_TRANSITIONS];
    assert!(Device::seed(&f.seed).prepare_revoke(&near, &[]).is_err());
}

#[test]
fn protected_rotation_material_replays_exact_candidate_binds_cutoff_and_rejects_other_generation() {
    let f = fixture();
    let (_, _, peer, _, m) = first(&f);
    let keys = m.verify_initial_key(&f.key).unwrap();
    let revoke = peer.authority().prepare_revoke(&m, &[]).unwrap();
    let pending = m.append(&[], &[], &revoke).unwrap();
    let material = RotationMaterial::generate().unwrap();
    let bytes = material.protected_storage_bytes();
    assert_eq!(bytes.len(), 102);
    let reopened = RotationMaterial::from_protected_storage(&bytes).unwrap();
    let raw = peer
        .authority()
        .prepare_rotation_with(&pending, &keys, 100, &material)
        .unwrap();
    assert_eq!(
        raw,
        peer.authority()
            .prepare_rotation_with(&pending, &keys, 100, &reopened)
            .unwrap()
    );
    let changed_cutoff = peer
        .authority()
        .prepare_rotation_with(&pending, &keys, 101, &reopened)
        .unwrap();
    let (_, _, packages, _) = encoding::components(&raw).unwrap();
    let original = encoding::read_packages(packages, 0, pending.device_count(), 176).unwrap();
    let (_, _, packages, _) = encoding::components(&changed_cutoff).unwrap();
    let changed = encoding::read_packages(packages, 0, pending.device_count(), 176).unwrap();
    for (original, changed) in original.iter().zip(&changed) {
        assert_eq!(original.device, changed.device);
        assert_ne!(original.enc, changed.enc, "device {:?}", original.device);
    }
    let after = pending.append(&[], &[], &raw).unwrap();
    reopened.validate_generation(&after).unwrap();
    let other = RotationMaterial::generate().unwrap();
    assert!(other.validate_generation(&after).is_err());
    assert_ne!(
        raw,
        peer.authority()
            .prepare_rotation_with(&pending, &keys, 100, &other)
            .unwrap()
    );
    for length in [0, 6, 101] {
        assert!(RotationMaterial::from_protected_storage(&bytes[..length]).is_err());
    }
    let mut malformed = bytes.to_vec();
    malformed.push(0);
    assert!(RotationMaterial::from_protected_storage(&malformed).is_err());
    malformed.truncate(102);
    malformed[5] = 2;
    assert!(RotationMaterial::from_protected_storage(&malformed).is_err());
}

#[test]
fn rotation_cutoff_leaves_a_representable_successor_tail_rank() {
    let f = fixture();
    let keys = f.membership.verify_initial_key(&f.key).unwrap();
    let freeze = Device::seed(&f.seed)
        .prepare_revoke(&f.membership, &[])
        .unwrap();
    let pending = f.membership.append(&[], &[], &freeze).unwrap();
    assert!(
        Device::seed(&f.seed)
            .prepare_rotation(&pending, &keys, MAX_CUTOFF + 1)
            .is_err()
    );
    let (raw, next, _) = rotate_fixed(Device::seed(&f.seed), &pending, &keys, 100, MAX_CUTOFF);
    assert!(next.generation_allows(next.generations()[0].id, MAX_CUTOFF));
    assert!(next.generation_allows(next.current_generation().id, i64::MAX as u64));
    assert!(!next.generation_allows(next.current_generation().id, MAX_CUTOFF));
    assert!(
        pending
            .append(
                &[],
                &[],
                &resign(f.seed.protected_signing_seed(), &raw, |_, _, _| ())
            )
            .is_ok()
    );
    // Peers reject a correctly signed transition whose cutoff exceeds the limit.
    let replace = |bytes: &mut Vec<u8>| {
        let (old, new) = (MAX_CUTOFF.to_be_bytes(), (MAX_CUTOFF + 1).to_be_bytes());
        let at = bytes.windows(8).position(|w| w == old).unwrap();
        bytes[at..at + 8].copy_from_slice(&new);
    };
    let bad = resign(f.seed.protected_signing_seed(), &raw, |c, s, _| {
        replace(c);
        replace(s);
    });
    assert!(pending.append(&[], &[], &bad).is_err());
}