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
use std::collections::BTreeMap;
use std::marker::PhantomData;
use bellperson::{
bls::{Bls12, Fr},
util_cs::test_cs::TestConstraintSystem,
Circuit,
};
use ff::Field;
use filecoin_hashers::{poseidon::PoseidonHasher, Domain, HashFunction, Hasher};
use rand::{Rng, SeedableRng};
use rand_xorshift::XorShiftRng;
use storage_proofs_core::{
compound_proof::CompoundProof,
merkle::{generate_tree, get_base_tree_count, BinaryMerkleTree, MerkleTreeTrait},
proof::ProofScheme,
sector::OrderedSectorSet,
util::NODE_SIZE,
TEST_SEED,
};
use storage_proofs_post::rational::{
self, derive_challenges, RationalPoSt, RationalPoStCircuit, RationalPoStCompound,
};
use tempfile::tempdir;
#[test]
fn test_rational_post_circuit_poseidon() {
test_rational_post_circuit::<BinaryMerkleTree<PoseidonHasher>>(3_770);
}
fn test_rational_post_circuit<Tree: 'static + MerkleTreeTrait>(expected_constraints: usize) {
let rng = &mut XorShiftRng::from_seed(TEST_SEED);
let leaves = 32 * get_base_tree_count::<Tree>();
let sector_size = (leaves * NODE_SIZE) as u64;
let challenges_count = 2;
let pub_params = rational::PublicParams {
sector_size,
challenges_count,
};
let temp_dir = tempdir().unwrap();
let temp_path = temp_dir.path();
let (_data1, tree1) = generate_tree::<Tree, _>(rng, leaves, Some(temp_path.to_path_buf()));
let (_data2, tree2) = generate_tree::<Tree, _>(rng, leaves, Some(temp_path.to_path_buf()));
let faults = OrderedSectorSet::new();
let mut sectors = OrderedSectorSet::new();
sectors.insert(0.into());
sectors.insert(1.into());
let seed = (0..leaves).map(|_| rng.gen()).collect::<Vec<u8>>();
let challenges =
derive_challenges(challenges_count, sector_size, §ors, &seed, &faults).unwrap();
let comm_r_lasts_raw = vec![tree1.root(), tree2.root()];
let comm_r_lasts: Vec<_> = challenges
.iter()
.map(|c| comm_r_lasts_raw[u64::from(c.sector) as usize])
.collect();
let comm_cs: Vec<<Tree::Hasher as Hasher>::Domain> = challenges
.iter()
.map(|_c| <Tree::Hasher as Hasher>::Domain::random(rng))
.collect();
let comm_rs: Vec<_> = comm_cs
.iter()
.zip(comm_r_lasts.iter())
.map(|(comm_c, comm_r_last)| <Tree::Hasher as Hasher>::Function::hash2(comm_c, comm_r_last))
.collect();
let pub_inputs = rational::PublicInputs {
challenges,
faults,
comm_rs: comm_rs.clone(),
};
let mut trees = BTreeMap::new();
trees.insert(0.into(), &tree1);
trees.insert(1.into(), &tree2);
let priv_inputs = rational::PrivateInputs::<Tree> {
trees: &trees,
comm_cs: &comm_cs,
comm_r_lasts: &comm_r_lasts,
};
let proof = RationalPoSt::<Tree>::prove(&pub_params, &pub_inputs, &priv_inputs)
.expect("proving failed");
let is_valid = RationalPoSt::<Tree>::verify(&pub_params, &pub_inputs, &proof)
.expect("verification failed");
assert!(is_valid);
// actual circuit test
let paths: Vec<_> = proof
.paths()
.iter()
.map(|p| {
p.iter()
.map(|v| {
(
v.0.iter().copied().map(Into::into).map(Some).collect(),
Some(v.1),
)
})
.collect::<Vec<_>>()
})
.collect();
let leafs: Vec<_> = proof.leafs().iter().map(|l| Some((*l).into())).collect();
let mut cs = TestConstraintSystem::<Bls12>::new();
let instance = RationalPoStCircuit::<Tree> {
leafs,
paths,
comm_rs: comm_rs.iter().copied().map(|c| Some(c.into())).collect(),
comm_cs: comm_cs.into_iter().map(|c| Some(c.into())).collect(),
comm_r_lasts: comm_r_lasts.into_iter().map(|c| Some(c.into())).collect(),
_t: PhantomData,
};
instance
.synthesize(&mut cs)
.expect("failed to synthesize circuit");
assert!(cs.is_satisfied(), "constraints not satisfied");
assert_eq!(cs.num_inputs(), 5, "wrong number of inputs");
assert_eq!(
cs.num_constraints(),
expected_constraints,
"wrong number of constraints"
);
assert_eq!(cs.get_input(0, "ONE"), Fr::one());
let generated_inputs =
RationalPoStCompound::<Tree>::generate_public_inputs(&pub_inputs, &pub_params, None)
.unwrap();
let expected_inputs = cs.get_inputs();
for ((input, label), generated_input) in
expected_inputs.iter().skip(1).zip(generated_inputs.iter())
{
assert_eq!(input, generated_input, "{}", label);
}
assert_eq!(
generated_inputs.len(),
expected_inputs.len() - 1,
"inputs are not the same length"
);
}