-
Notifications
You must be signed in to change notification settings - Fork 7
/
prover.rs
178 lines (154 loc) · 5.97 KB
/
prover.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
use std::{borrow::Cow, str::FromStr};
use kimchi::{
poly_commitment::PolyComm,
proof::{
PointEvaluations, ProofEvaluations, ProverCommitments, ProverProof, RecursionChallenge,
},
};
use mina_curves::pasta::Pallas;
use mina_hasher::Fp;
use once_cell::sync::Lazy;
use poly_commitment::{commitment::CommitmentCurve, evaluation_proof::OpeningProof};
use super::util::extract_bulletproof;
use mina_curves::pasta::Fq;
use mina_p2p_messages::{bigint::BigInt, v2::PicklesProofProofsVerified2ReprStableV2};
fn get_challenge_polynomial_commitments_padding() -> (BigInt, BigInt) {
static PADDING: Lazy<(BigInt, BigInt)> = Lazy::new(|| {
let first = Fp::from_str(
"8063668238751197448664615329057427953229339439010717262869116690340613895496",
)
.unwrap();
let second = Fp::from_str(
"2694491010813221541025626495812026140144933943906714931997499229912601205355",
)
.unwrap();
(first.into(), second.into())
});
PADDING.clone()
}
pub fn make_padded_proof_from_p2p(
PicklesProofProofsVerified2ReprStableV2 {
statement,
prev_evals: _, // unused
proof,
}: &PicklesProofProofsVerified2ReprStableV2,
) -> ProverProof<Pallas> {
let of_coord = |(a, b): &(BigInt, BigInt)| Pallas::of_coordinates(a.to_field(), b.to_field());
let make_poly = |poly: &(BigInt, BigInt)| PolyComm {
unshifted: vec![of_coord(poly)],
shifted: None,
};
let w_comm: [PolyComm<Pallas>; 15] = proof.commitments.w_comm.each_ref().map(make_poly);
let z_comm: PolyComm<Pallas> = make_poly(&proof.commitments.z_comm);
let t_comm: PolyComm<Pallas> = {
let unshifted = proof.commitments.t_comm.iter().map(of_coord).collect();
PolyComm {
unshifted,
shifted: None,
}
};
let bulletproof = &proof.bulletproof;
let lr = &bulletproof.lr;
let lr: Vec<(Pallas, Pallas)> = lr.iter().map(|(a, b)| (of_coord(a), of_coord(b))).collect();
let delta: Pallas = of_coord(&bulletproof.delta);
let z1: Fq = bulletproof.z_1.to_field();
let z2: Fq = bulletproof.z_2.to_field();
let sg: Pallas = of_coord(&bulletproof.challenge_polynomial_commitment);
let evals = &proof.evaluations;
// let to_fields = |x: &Vec<BigInt>| x.iter().map(BigInt::to_field).collect();
// let to_pt_eval = |(first, second): &(Vec<BigInt>, Vec<BigInt>)| PointEvaluations {
// zeta: to_fields(first),
// zeta_omega: to_fields(second),
// };
// let to_fields = |x: &Vec<BigInt>| x.iter().map(BigInt::to_field).collect();
let to_pt_eval = |(first, second): &(BigInt, BigInt)| PointEvaluations {
zeta: vec![first.to_field::<Fq>()],
zeta_omega: vec![second.to_field::<Fq>()],
};
let evals: ProofEvaluations<PointEvaluations<Vec<Fq>>> = ProofEvaluations {
w: evals.w.each_ref().map(to_pt_eval),
z: to_pt_eval(&evals.z),
s: evals.s.each_ref().map(to_pt_eval),
generic_selector: to_pt_eval(&evals.generic_selector),
poseidon_selector: to_pt_eval(&evals.poseidon_selector),
coefficients: evals.coefficients.each_ref().map(to_pt_eval),
complete_add_selector: to_pt_eval(&evals.complete_add_selector),
mul_selector: to_pt_eval(&evals.mul_selector),
emul_selector: to_pt_eval(&evals.emul_selector),
endomul_scalar_selector: to_pt_eval(&evals.endomul_scalar_selector),
range_check0_selector: None,
range_check1_selector: None,
foreign_field_add_selector: None,
foreign_field_mul_selector: None,
xor_selector: None,
rot_selector: None,
lookup_aggregation: None,
lookup_table: None,
lookup_sorted: [None, None, None, None, None],
runtime_lookup_table: None,
runtime_lookup_table_selector: None,
xor_lookup_selector: None,
lookup_gate_lookup_selector: None,
range_check_lookup_selector: None,
foreign_field_mul_lookup_selector: None,
};
let ft_eval1: Fq = proof.ft_eval1.to_field();
let old_bulletproof_challenges = &statement
.proof_state
.messages_for_next_wrap_proof
.old_bulletproof_challenges;
let old_bulletproof_challenges: Vec<[Fq; 15]> = extract_bulletproof(&[
old_bulletproof_challenges.0[0].0.clone(),
old_bulletproof_challenges.0[1].0.clone(),
]);
let make_poly = |poly: &(BigInt, BigInt)| {
let point = of_coord(poly);
PolyComm {
unshifted: vec![point],
shifted: None,
}
};
let mut challenge_polynomial_commitments = Cow::Borrowed(
&statement
.messages_for_next_step_proof
.challenge_polynomial_commitments,
);
// Prepend padding:
// https://github.com/MinaProtocol/mina/blob/bfd1009abdbee78979ff0343cc73a3480e862f58/src/lib/pickles/verify.ml#L361C1-L364C51
while challenge_polynomial_commitments.len() < 2 {
let padding = get_challenge_polynomial_commitments_padding();
challenge_polynomial_commitments
.to_mut()
.push_front(padding);
}
let challenge_polynomial_commitments: Vec<PolyComm<Pallas>> = challenge_polynomial_commitments
.iter()
.map(make_poly)
.collect();
// Or pad with `Wrap_hack.pad_accumulator`
assert_eq!(old_bulletproof_challenges.len(), 2);
assert_eq!(challenge_polynomial_commitments.len(), 2);
let prev_challenges: Vec<RecursionChallenge<Pallas>> = old_bulletproof_challenges
.iter()
.zip(challenge_polynomial_commitments)
.map(|(chals, comm)| RecursionChallenge::new(chals.to_vec(), comm))
.collect();
ProverProof {
commitments: ProverCommitments {
w_comm,
z_comm,
t_comm,
lookup: None,
},
proof: OpeningProof {
lr,
delta,
z1,
z2,
sg,
},
evals,
ft_eval1,
prev_challenges,
}
}