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
use crate::proof::{
definition::MAX_ACCUMULATOR_PROOF_DEPTH, AccumulatorConsistencyProof, AccumulatorProof,
AccumulatorRangeProof, SparseMerkleLeafNode, SparseMerkleProof, SparseMerkleRangeProof,
TransactionAccumulatorSummary,
};
use diem_crypto::{
hash::{
CryptoHash, CryptoHasher, ACCUMULATOR_PLACEHOLDER_HASH, SPARSE_MERKLE_PLACEHOLDER_HASH,
},
HashValue,
};
use proptest::{collection::vec, prelude::*};
fn arb_non_placeholder_accumulator_sibling() -> impl Strategy<Value = HashValue> {
any::<HashValue>().prop_filter("Filter out placeholder sibling.", |x| {
*x != *ACCUMULATOR_PLACEHOLDER_HASH
})
}
fn arb_accumulator_sibling() -> impl Strategy<Value = HashValue> {
prop_oneof![
arb_non_placeholder_accumulator_sibling(),
Just(*ACCUMULATOR_PLACEHOLDER_HASH),
]
}
fn arb_non_placeholder_sparse_merkle_sibling() -> impl Strategy<Value = HashValue> {
any::<HashValue>().prop_filter("Filter out placeholder sibling.", |x| {
*x != *SPARSE_MERKLE_PLACEHOLDER_HASH
})
}
fn arb_sparse_merkle_sibling() -> impl Strategy<Value = HashValue> {
prop_oneof![
arb_non_placeholder_sparse_merkle_sibling(),
Just(*SPARSE_MERKLE_PLACEHOLDER_HASH),
]
}
impl<H> Arbitrary for AccumulatorProof<H>
where
H: CryptoHasher + 'static,
{
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {
(0..=MAX_ACCUMULATOR_PROOF_DEPTH)
.prop_flat_map(|len| {
if len == 0 {
Just(vec![]).boxed()
} else {
(
vec(arb_accumulator_sibling(), len - 1),
arb_non_placeholder_accumulator_sibling(),
)
.prop_map(|(mut siblings, last_sibling)| {
siblings.push(last_sibling);
siblings
})
.boxed()
}
})
.prop_map(AccumulatorProof::<H>::new)
.boxed()
}
}
impl<V> Arbitrary for SparseMerkleProof<V>
where
V: std::fmt::Debug + CryptoHash,
{
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {
(
any::<Option<SparseMerkleLeafNode>>(),
(0..=256usize).prop_flat_map(|len| {
if len == 0 {
Just(vec![]).boxed()
} else {
(
arb_non_placeholder_sparse_merkle_sibling(),
vec(arb_sparse_merkle_sibling(), len),
)
.prop_map(|(first_sibling, mut siblings)| {
siblings[0] = first_sibling;
siblings
})
.boxed()
}
}),
)
.prop_map(|(leaf, siblings)| SparseMerkleProof::new(leaf, siblings))
.boxed()
}
}
impl Arbitrary for AccumulatorConsistencyProof {
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {
vec(
arb_non_placeholder_accumulator_sibling(),
0..=MAX_ACCUMULATOR_PROOF_DEPTH,
)
.prop_map(AccumulatorConsistencyProof::new)
.boxed()
}
}
impl<H> Arbitrary for AccumulatorRangeProof<H>
where
H: CryptoHasher,
{
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {
(
vec(
arb_non_placeholder_accumulator_sibling(),
0..MAX_ACCUMULATOR_PROOF_DEPTH,
),
vec(arb_accumulator_sibling(), 0..MAX_ACCUMULATOR_PROOF_DEPTH),
)
.prop_map(|(left_siblings, right_siblings)| {
AccumulatorRangeProof::new(left_siblings, right_siblings)
})
.boxed()
}
}
impl Arbitrary for SparseMerkleRangeProof {
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {
vec(arb_sparse_merkle_sibling(), 0..=256)
.prop_map(Self::new)
.boxed()
}
}
impl Arbitrary for TransactionAccumulatorSummary {
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {
let arb_version = 0u64..=256;
arb_version
.prop_map(|version| {
let num_leaves = version + 1;
let num_subtrees = num_leaves.count_ones() as u64;
let mock_subtrees = (0..num_subtrees)
.map(HashValue::from_u64)
.collect::<Vec<_>>();
let consistency_proof = AccumulatorConsistencyProof::new(mock_subtrees);
Self::try_from_genesis_proof(consistency_proof, version).unwrap()
})
.boxed()
}
}