quorum-set 0.1.0

Hierarchical quorum trees with deterministic canonical IDs
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

use std::collections::BTreeSet;
use std::sync::Arc;

use maplit::btreeset;

use crate::Node;
use crate::QuorumTree;
use crate::quorum::QuorumSet;

fn id(i: u64) -> Node<u64> {
    Node::Id(i)
}

#[test]
fn test_simple_quorum_set_impl() -> anyhow::Result<()> {
    // BTreeSet as majority quorum set
    {
        let m12345 = btreeset! {1,2,3,4,5};

        assert!(!m12345.is_quorum([0].iter()));
        assert!(!m12345.is_quorum([0, 1, 2].iter()));
        assert!(!m12345.is_quorum([6, 7, 8].iter()));
        assert!(m12345.is_quorum([1, 2, 3].iter()));
        assert!(m12345.is_quorum([3, 4, 5].iter()));
        assert!(m12345.is_quorum([1, 3, 4, 5].iter()));
    }

    Ok(())
}

#[test]
fn test_simple_quorum_set_dedupes_candidate_ids() -> anyhow::Result<()> {
    let m12345 = btreeset! {1,2,3,4,5};

    assert!(!m12345.is_quorum([1, 1, 1].iter()));
    assert!(!m12345.is_quorum([1, 2, 2].iter()));
    assert!(m12345.is_quorum([1, 2, 3, 3].iter()));

    Ok(())
}

#[test]
fn test_joint_quorum_set_impl() -> anyhow::Result<()> {
    // Vec<BTreeSet> as majority quorum set
    {
        let qs = vec![btreeset! {1,2,3,4,5}];

        assert!(!qs.is_quorum([0].iter()));
        assert!(!qs.is_quorum([0, 1, 2].iter()));
        assert!(!qs.is_quorum([6, 7, 8].iter()));
        assert!(qs.is_quorum([1, 2, 3].iter()));
        assert!(qs.is_quorum([3, 4, 5].iter()));
        assert!(qs.is_quorum([1, 3, 4, 5].iter()));
    }

    // Vec<BTreeSet, BTreeSet> as joint-of-majority quorum set
    {
        let qs = vec![btreeset! {1,2,3,4,5}, btreeset! {6,7,8}];

        assert!(!qs.is_quorum([0].iter()));
        assert!(!qs.is_quorum([0, 1, 2].iter()));
        assert!(!qs.is_quorum([6, 7, 8].iter()));
        assert!(!qs.is_quorum([1, 2, 3].iter()));
        assert!(qs.is_quorum([1, 2, 3, 6, 7].iter()));
        assert!(qs.is_quorum([1, 2, 3, 4, 7, 8].iter()));
    }

    Ok(())
}

#[test]
fn test_joint_quorum_set_dedupes_candidate_ids() -> anyhow::Result<()> {
    let qs = vec![btreeset! {1,2,3,4,5}, btreeset! {6,7,8}];

    assert!(!qs.is_quorum([1, 2, 3, 6, 6].iter()));
    assert!(qs.is_quorum([1, 2, 3, 6, 7, 7].iter()));

    Ok(())
}

#[test]
fn test_empty_joint_quorum_set() -> anyhow::Result<()> {
    let qs: Vec<BTreeSet<u64>> = vec![];

    assert!(qs.is_quorum([1].iter()));
    assert_eq!(btreeset! {}, qs.ids().collect());

    Ok(())
}

#[test]
fn test_ids() -> anyhow::Result<()> {
    {
        let m12345 = btreeset! {1,2,3,4,5};
        assert_eq!(btreeset! {1,2,3,4,5}, m12345.ids().collect());
    }

    {
        let qs = vec![btreeset! {1,2,3,4,5}, btreeset! {4,5,6,7,8}];
        assert_eq!(btreeset! {1,2,3,4,5,6,7,8}, qs.ids().collect());
    }

    Ok(())
}

#[test]
fn test_arc_quorum_set_impl() -> anyhow::Result<()> {
    let qset = Arc::new(btreeset! {1,2,3});

    assert_eq!(btreeset! {1,2,3}, qset.ids().collect());
    assert!(!qset.is_quorum([1].iter()));
    assert!(qset.is_quorum([1, 2].iter()));

    Ok(())
}

#[test]
fn test_tree_impl() -> anyhow::Result<()> {
    let group_a = QuorumTree::new(2, [id(1), id(2), id(3)])?;
    let group_b = QuorumTree::new(2, [id(3), id(4), id(5)])?;
    let qset = QuorumTree::new(2, [Node::Subtree(group_a), Node::Subtree(group_b)])?;

    assert_eq!(btreeset! {1,2,3,4,5}, qset.ids().collect());

    assert!(!qset.is_quorum([1, 2, 3].iter()));
    assert!(!qset.is_quorum([1, 3].iter()));
    assert!(qset.is_quorum([1, 3, 5].iter()));
    assert!(qset.is_quorum([1, 2, 3, 4].iter()));
    assert!(qset.is_quorum([1, 3, 4, 5].iter()));

    Ok(())
}

#[test]
fn test_tree_ids_dedupe_direct_and_nested_ids() -> anyhow::Result<()> {
    let subtree = QuorumTree::new(2, [id(1), id(2), id(3)])?;
    let qset = QuorumTree::new(1, [Node::Id(1), Node::Subtree(subtree)])?;

    assert_eq!(btreeset! {1,2,3}, qset.ids().collect());

    Ok(())
}

#[test]
fn test_tree_dedupes_candidate_ids() -> anyhow::Result<()> {
    let group_a = QuorumTree::new(2, [id(1), id(2), id(3)])?;
    let group_b = QuorumTree::new(2, [id(4), id(5), id(6)])?;
    let qset = QuorumTree::new(2, [Node::Subtree(group_a), Node::Subtree(group_b)])?;

    assert!(!qset.is_quorum([1, 1, 2, 4].iter()));
    assert!(qset.is_quorum([1, 1, 2, 4, 5].iter()));

    Ok(())
}