-
Notifications
You must be signed in to change notification settings - Fork 8
/
merge.rs
257 lines (222 loc) · 7.62 KB
/
merge.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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
use std::rc::Rc;
use crate::proofs::{
constants::{make_step_transaction_data, StepMergeProof},
step::{step, StepParams},
util::sha256_sum,
wrap::{wrap, WrapParams},
};
use mina_curves::pasta::Fq;
use mina_hasher::Fp;
use mina_p2p_messages::v2;
use crate::{
proofs::{transaction::transaction_snark::assert_equal_local_state, util::u64_to_field},
scan_state::{
fee_excess::FeeExcess,
pending_coinbase,
scan_state::transaction_snark::{
validate_ledgers_at_merge_checked, SokDigest, SokMessage, Statement, StatementLedgers,
},
},
};
use super::{
constants::WrapMergeProof,
field::{Boolean, CircuitVar, FieldWitness},
public_input::plonk_checks::PlonkMinimal,
step::{
extract_recursion_challenges, InductiveRule, OptFlag, PreviousProofStatement, StepProof,
},
transaction::{PlonkVerificationKeyEvals, ProofError, Prover},
witness::Witness,
wrap::WrapProof,
};
fn merge_main(
statement: &Statement<SokDigest>,
proofs: &[v2::LedgerProofProdStableV2; 2],
w: &mut Witness<Fp>,
) -> (Statement<SokDigest>, Statement<SokDigest>) {
let (s1, s2) = w.exists({
let [p1, p2] = proofs;
let (s1, s2) = (&p1.0.statement, &p2.0.statement);
let s1: Statement<SokDigest> = s1.into();
let s2: Statement<SokDigest> = s2.into();
(s1, s2)
});
let _fee_excess = FeeExcess::combine_checked(&s1.fee_excess, &s2.fee_excess, w);
pending_coinbase::Stack::check_merge(
(
&s1.source.pending_coinbase_stack,
&s1.target.pending_coinbase_stack,
),
(
&s2.source.pending_coinbase_stack,
&s2.target.pending_coinbase_stack,
),
w,
);
let _supply_increase = {
let s1 = s1.supply_increase.to_checked::<Fp>();
let s2 = s2.supply_increase.to_checked::<Fp>();
s1.add(&s2, w)
};
assert_equal_local_state(&statement.source.local_state, &s1.source.local_state, w);
assert_equal_local_state(&statement.target.local_state, &s2.target.local_state, w);
let _valid_ledger = validate_ledgers_at_merge_checked(
&StatementLedgers::of_statement(&s1),
&StatementLedgers::of_statement(&s2),
w,
);
{
// Only `Statement.fee_excess`, not `fee_excess`
let FeeExcess {
fee_excess_l,
fee_excess_r,
..
} = statement.fee_excess;
fee_excess_l.to_checked::<Fp>().value(w);
fee_excess_r.to_checked::<Fp>().value(w);
// Only `Statement.supply_increase`, not `supply_increase`
let supply_increase = statement.supply_increase;
supply_increase.to_checked::<Fp>().value(w);
}
(s1, s2)
}
pub fn dlog_plonk_index(wrap_prover: &Prover<Fq>) -> PlonkVerificationKeyEvals<Fp> {
PlonkVerificationKeyEvals::from(wrap_prover.index.verifier_index.as_ref().unwrap())
}
impl<F: FieldWitness>
From<&v2::PicklesProofProofsVerified2ReprStableV2StatementProofStateDeferredValuesPlonk>
for PlonkMinimal<F>
{
fn from(
value: &v2::PicklesProofProofsVerified2ReprStableV2StatementProofStateDeferredValuesPlonk,
) -> Self {
let v2::PicklesProofProofsVerified2ReprStableV2StatementProofStateDeferredValuesPlonk {
alpha,
beta,
gamma,
zeta,
joint_combiner,
feature_flags: _, // TODO: Handle features flags
} = value;
let to_bytes = |v: &v2::LimbVectorConstantHex64StableV1| v.as_u64();
let alpha_bytes = alpha.inner.each_ref().map(to_bytes);
let beta_bytes = beta.each_ref().map(to_bytes);
let gamma_bytes = gamma.each_ref().map(to_bytes);
let zeta_bytes = zeta.inner.each_ref().map(to_bytes);
assert!(joint_combiner.is_none());
PlonkMinimal::<F, 2> {
alpha: u64_to_field(&alpha_bytes),
beta: u64_to_field(&beta_bytes),
gamma: u64_to_field(&gamma_bytes),
zeta: u64_to_field(&zeta_bytes),
joint_combiner: None,
alpha_bytes,
beta_bytes,
gamma_bytes,
zeta_bytes,
}
}
}
pub struct MergeParams<'a> {
pub statement: Statement<()>,
pub proofs: &'a [v2::LedgerProofProdStableV2; 2],
pub message: &'a SokMessage,
pub step_prover: &'a Prover<Fp>,
pub wrap_prover: &'a Prover<Fq>,
/// When set to `true`, `generate_block_proof` will not create a proof, but only
/// verify constraints in the step witnesses
pub only_verify_constraints: bool,
/// For debugging only
pub expected_step_proof: Option<&'static str>,
/// For debugging only
pub ocaml_wrap_witness: Option<Vec<Fq>>,
}
const MERGE_N_PREVIOUS_PROOFS: usize = 2;
pub(super) fn generate_merge_proof(
params: MergeParams,
w: &mut Witness<Fp>,
) -> Result<WrapProof, ProofError> {
let MergeParams {
statement,
proofs,
message,
step_prover,
wrap_prover,
only_verify_constraints,
expected_step_proof,
ocaml_wrap_witness,
} = params;
let sok_digest = message.digest();
let statement_with_sok = Rc::new(statement.with_digest(sok_digest));
w.exists(&*statement_with_sok);
let (s1, s2) = merge_main(&statement_with_sok, proofs, w);
let proofs: [&v2::PicklesProofProofsVerified2ReprStableV2; 2] = {
let [p1, p2] = proofs;
[&p1.0.proof, &p2.0.proof]
};
let [p1, p2] = proofs;
let prev_challenge_polynomial_commitments = extract_recursion_challenges(&[p1, p2]);
let rule = InductiveRule {
previous_proof_statements: [
PreviousProofStatement {
public_input: Rc::new(s1),
proof: p1,
proof_must_verify: CircuitVar::Constant(Boolean::True),
},
PreviousProofStatement {
public_input: Rc::new(s2),
proof: p2,
proof_must_verify: CircuitVar::Constant(Boolean::True),
},
],
public_output: (),
auxiliary_output: (),
};
let dlog_plonk_index = dlog_plonk_index(wrap_prover);
let dlog_plonk_index_cvar = dlog_plonk_index.to_cvar(CircuitVar::Var);
let verifier_index = wrap_prover.index.verifier_index.as_ref().unwrap();
let tx_data = make_step_transaction_data(&dlog_plonk_index_cvar);
let for_step_datas = [&tx_data, &tx_data];
let indexes = [
(verifier_index, &dlog_plonk_index_cvar),
(verifier_index, &dlog_plonk_index_cvar),
];
let StepProof {
statement,
prev_evals,
proof,
} = step::<StepMergeProof, MERGE_N_PREVIOUS_PROOFS>(
StepParams {
app_state: Rc::clone(&statement_with_sok) as _,
rule,
for_step_datas,
indexes,
wrap_prover,
prev_challenge_polynomial_commitments,
step_prover,
hack_feature_flags: OptFlag::No,
only_verify_constraints,
},
w,
)?;
if let Some(expected) = expected_step_proof {
let proof_json = serde_json::to_vec(&proof).unwrap();
assert_eq!(sha256_sum(&proof_json), expected);
};
let mut w = Witness::new::<WrapMergeProof>();
if let Some(ocaml_aux) = ocaml_wrap_witness {
w.ocaml_aux = ocaml_aux;
};
wrap::<WrapMergeProof>(
WrapParams {
app_state: statement_with_sok,
proof: &proof,
step_statement: statement,
prev_evals: &prev_evals,
dlog_plonk_index: &dlog_plonk_index,
step_prover_index: &step_prover.index,
wrap_prover,
},
&mut w,
)
}