minerva 0.2.0

Causal ordering for distributed systems
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

extern crate alloc;

use alloc::vec::Vec;

use crate::metis::{DotSet, Rhapsody, RhapsodyDecodeError};

use super::super::d;
use super::rank;

#[test]
fn test_rhapsody_rejects_malformed_visible_suffix() {
    let mut bytes = Vec::new();
    bytes.push(0x02u8);
    bytes.extend_from_slice(&1u32.to_be_bytes());
    bytes.extend_from_slice(&1u32.to_be_bytes());
    bytes.extend_from_slice(&1u64.to_be_bytes());
    bytes.push(0x00);
    bytes.extend_from_slice(&rank(1).to_bytes());
    bytes.push(0x02u8);
    bytes.extend_from_slice(&0u32.to_be_bytes());
    assert!(matches!(
        Rhapsody::from_bytes(&bytes),
        Err(RhapsodyDecodeError::Visible(_))
    ));
}

/// The suffix budget is the skeleton's cardinality (S197 gate review): a
/// suffix claiming more dots than the frame's loci vouch for refuses, even
/// where the standalone have-set frame's byte-length budget would also
/// refuse it for its own reason. Here one locus backs a 38-dot suffix, so
/// the budget of one refuses; the legal dense-above-a-hole case (a skeleton
/// as large as its visible set) round-trips, pinned in the snapshot suite
/// (`test_a_deleted_low_dot_survives_the_suffix_budget`, both codecs).
#[test]
fn test_rhapsody_suffix_budget_is_the_skeleton() {
    let mut dense = DotSet::new();
    for index in 2..=39u64 {
        let _ = dense.insert(d(1, index));
    }
    let dense_frame = dense.to_bytes();
    assert!(
        DotSet::from_bytes(&dense_frame).is_err(),
        "the standalone have-set keeps its own byte-length budget (PRD 0016)",
    );

    let mut bytes = Vec::new();
    bytes.push(0x02u8);
    bytes.extend_from_slice(&1u32.to_be_bytes());
    bytes.extend_from_slice(&1u32.to_be_bytes());
    bytes.extend_from_slice(&2u64.to_be_bytes());
    bytes.push(0x00);
    bytes.extend_from_slice(&rank(1).to_bytes());
    bytes.extend_from_slice(&dense_frame);
    assert!(matches!(
        Rhapsody::from_bytes(&bytes),
        Err(RhapsodyDecodeError::Visible(_))
    ));
}

#[test]
fn test_rhapsody_rejects_malformed_rank() {
    let mut bytes = Vec::new();
    bytes.push(0x02u8);
    bytes.extend_from_slice(&1u32.to_be_bytes());
    bytes.extend_from_slice(&1u32.to_be_bytes());
    bytes.extend_from_slice(&1u64.to_be_bytes());
    bytes.push(0x00);
    bytes.push(0x02u8);
    bytes.extend_from_slice(&[0u8; 16]);
    bytes.push(0x01u8);
    bytes.extend_from_slice(&0u32.to_be_bytes());
    assert!(matches!(
        Rhapsody::from_bytes(&bytes),
        Err(RhapsodyDecodeError::Rank(_))
    ));
}