-
Notifications
You must be signed in to change notification settings - Fork 65
/
mod.rs
218 lines (190 loc) · 6.71 KB
/
mod.rs
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
#[cfg(feature = "r1cs")]
mod constraints;
mod test_utils;
mod bytes_mt_tests {
use crate::{
crh::{pedersen, *},
merkle_tree::*,
};
use ark_ed_on_bls12_381::EdwardsProjective as JubJub;
use ark_ff::BigInteger256;
use ark_std::{test_rng, UniformRand};
#[derive(Clone)]
pub(super) struct Window4x256;
impl pedersen::Window for Window4x256 {
const WINDOW_SIZE: usize = 4;
const NUM_WINDOWS: usize = 256;
}
type LeafH = pedersen::CRH<JubJub, Window4x256>;
type CompressH = pedersen::TwoToOneCRH<JubJub, Window4x256>;
struct JubJubMerkleTreeParams;
impl Config for JubJubMerkleTreeParams {
type Leaf = [u8];
type LeafDigest = <LeafH as CRHScheme>::Output;
type LeafInnerDigestConverter = ByteDigestConverter<Self::LeafDigest>;
type InnerDigest = <CompressH as TwoToOneCRHScheme>::Output;
type LeafHash = LeafH;
type TwoToOneHash = CompressH;
}
type JubJubMerkleTree = MerkleTree<JubJubMerkleTreeParams>;
/// Pedersen only takes bytes as leaf, so we use `ToBytes` trait.
fn merkle_tree_test<L: CanonicalSerialize>(leaves: &[L], update_query: &[(usize, L)]) -> () {
let mut rng = ark_std::test_rng();
let mut leaves: Vec<_> = leaves
.iter()
.map(|leaf| crate::to_uncompressed_bytes!(leaf).unwrap())
.collect();
let leaf_crh_params = <LeafH as CRHScheme>::setup(&mut rng).unwrap();
let two_to_one_params = <CompressH as TwoToOneCRHScheme>::setup(&mut rng)
.unwrap()
.clone();
let mut tree = JubJubMerkleTree::new(
&leaf_crh_params.clone(),
&two_to_one_params.clone(),
leaves.iter().map(|x| x.as_slice()),
)
.unwrap();
let mut root = tree.root();
// test merkle tree functionality without update
for (i, leaf) in leaves.iter().enumerate() {
let proof = tree.generate_proof(i).unwrap();
assert!(proof
.verify(&leaf_crh_params, &two_to_one_params, &root, leaf.as_slice())
.unwrap());
}
// test merkle tree update functionality
for (i, v) in update_query {
let v = crate::to_uncompressed_bytes!(v).unwrap();
tree.update(*i, &v).unwrap();
leaves[*i] = v.clone();
}
// update the root
root = tree.root();
// verify again
for (i, leaf) in leaves.iter().enumerate() {
let proof = tree.generate_proof(i).unwrap();
assert!(proof
.verify(&leaf_crh_params, &two_to_one_params, &root, leaf.as_slice())
.unwrap());
}
}
#[test]
fn good_root_test() {
let mut rng = test_rng();
let mut leaves = Vec::new();
for _ in 0..2u8 {
leaves.push(BigInteger256::rand(&mut rng));
}
merkle_tree_test(
&leaves,
&vec![
(0, BigInteger256::rand(&mut rng)),
(1, BigInteger256::rand(&mut rng)),
],
);
let mut leaves = Vec::new();
for _ in 0..4u8 {
leaves.push(BigInteger256::rand(&mut rng));
}
merkle_tree_test(&leaves, &vec![(3, BigInteger256::rand(&mut rng))]);
let mut leaves = Vec::new();
for _ in 0..128u8 {
leaves.push(BigInteger256::rand(&mut rng));
}
merkle_tree_test(
&leaves,
&vec![
(2, BigInteger256::rand(&mut rng)),
(3, BigInteger256::rand(&mut rng)),
(5, BigInteger256::rand(&mut rng)),
(111, BigInteger256::rand(&mut rng)),
(127, BigInteger256::rand(&mut rng)),
],
);
}
}
mod field_mt_tests {
use crate::crh::poseidon;
use crate::merkle_tree::tests::test_utils::poseidon_parameters;
use crate::merkle_tree::{Config, IdentityDigestConverter};
use crate::MerkleTree;
use ark_std::{test_rng, vec::Vec, One, UniformRand};
type F = ark_ed_on_bls12_381::Fr;
type H = poseidon::CRH<F>;
type TwoToOneH = poseidon::TwoToOneCRH<F>;
struct FieldMTConfig;
impl Config for FieldMTConfig {
type Leaf = [F];
type LeafDigest = F;
type LeafInnerDigestConverter = IdentityDigestConverter<F>;
type InnerDigest = F;
type LeafHash = H;
type TwoToOneHash = TwoToOneH;
}
type FieldMT = MerkleTree<FieldMTConfig>;
fn merkle_tree_test(leaves: &[Vec<F>], update_query: &[(usize, Vec<F>)]) -> () {
let mut leaves = leaves.to_vec();
let leaf_crh_params = poseidon_parameters();
let two_to_one_params = leaf_crh_params.clone();
let mut tree = FieldMT::new(
&leaf_crh_params,
&two_to_one_params,
leaves.iter().map(|x| x.as_slice()),
)
.unwrap();
let mut root = tree.root();
// test merkle tree functionality without update
for (i, leaf) in leaves.iter().enumerate() {
let proof = tree.generate_proof(i).unwrap();
assert!(proof
.verify(&leaf_crh_params, &two_to_one_params, &root, leaf.as_slice())
.unwrap());
}
{
// wrong root should lead to error but do not panic
let wrong_root = root + F::one();
let proof = tree.generate_proof(0).unwrap();
assert!(!proof
.verify(
&leaf_crh_params,
&two_to_one_params,
&wrong_root,
leaves[0].as_slice()
)
.unwrap())
}
// test merkle tree update functionality
for (i, v) in update_query {
tree.update(*i, v).unwrap();
leaves[*i] = v.to_vec();
}
// update the root
root = tree.root();
// verify again
for (i, leaf) in leaves.iter().enumerate() {
let proof = tree.generate_proof(i).unwrap();
assert!(proof
.verify(&leaf_crh_params, &two_to_one_params, &root, leaf.as_slice())
.unwrap());
}
}
#[test]
fn good_root_test() {
let mut rng = test_rng();
let mut rand_leaves = || (0..3).map(|_| F::rand(&mut rng)).collect();
let mut leaves: Vec<Vec<_>> = Vec::new();
for _ in 0..128u8 {
leaves.push(rand_leaves())
}
merkle_tree_test(
&leaves,
&vec![
(2, rand_leaves()),
(3, rand_leaves()),
(5, rand_leaves()),
(111, rand_leaves()),
(127, rand_leaves()),
],
)
}
}