-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathsync_step_circuit.rs
More file actions
635 lines (553 loc) · 22.4 KB
/
sync_step_circuit.rs
File metadata and controls
635 lines (553 loc) · 22.4 KB
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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
// The Licensed Work is (c) 2023 ChainSafe
// Code: https://github.com/ChainSafe/Spectre
// SPDX-License-Identifier: LGPL-3.0-only
use crate::{
gadget::{
crypto::{
G1Chip, G1Point, G2Chip, HashInstructions, Sha256Chip, ShaCircuitBuilder,
ShaFlexGateManager,
},
to_bytes_le,
},
poseidon::{fq_array_poseidon, poseidon_hash_fq_array},
ssz_merkle::{verify_merkle_multiproof, verify_merkle_proof},
util::{AppCircuit, Eth2ConfigPinning, IntoWitness},
witness::{self, HashInput, HashInputChunk, SyncStepArgs},
Eth2CircuitBuilder,
};
use eth_types::{Field, Spec, LIMB_BITS, NUM_LIMBS};
use halo2_base::{
gates::{
circuit::CircuitBuilderStage, flex_gate::threads::CommonCircuitBuilder, GateInstructions,
RangeInstructions,
},
halo2_proofs::{
halo2curves::bn256::{self, Bn256},
plonk::Error,
poly::{commitment::Params, kzg::commitment::ParamsKZG},
},
utils::CurveAffineExt,
AssignedValue, Context, QuantumCell,
};
use halo2_ecc::{
bls12_381::{bls_signature::BlsSignatureChip, pairing::PairingChip, Fp2Chip, Fp2Point, FpChip},
ecc::{
hash_to_curve::{ExpandMsgXmd, HashToCurveChip},
EcPoint, EccChip,
},
fields::FieldChip,
};
use halo2curves::bls12_381::{G1Affine, G2Affine};
use itertools::Itertools;
use num_bigint::BigUint;
use ssz_rs::Merkleized;
use std::{env::var, marker::PhantomData, vec};
/// `StepCircuit` verifies that Beacon chain block header is attested by a lightclient sync committee via aggregated signature,
/// and the execution (Eth1) payload via Merkle proof against the finalized block header.
///
/// Assumes that signature is a BLS12-381 point on G2, and public keys are BLS12-381 points on G1; `finality_branch` is exactly `S::FINALIZED_HEADER_DEPTH` hashes in lenght;
/// and `execution_payload_branch` is `S::EXECUTION_PAYLOAD_DEPTH` hashes in lenght.
///
/// The circuit exposes two public inputs:
/// - `pub_inputs_commit` is SHA256(attested_slot || inalized_slot || participation_sum || finalized_header_root || execution_payload_root) truncated to 253 bits. All committed valeus are in little endian.
/// - `poseidon_commit` is a Poseidon "onion" commitment to the X coordinates of sync committee public keys. Coordinates are expressed as big-integer with two limbs of LIMB_BITS * 2 bits.
#[derive(Clone, Debug, Default)]
pub struct StepCircuit<S: Spec + ?Sized, F: Field> {
_f: PhantomData<F>,
_spec: PhantomData<S>,
}
impl<S: Spec, F: Field> StepCircuit<S, F> {
pub fn synthesize(
builder: &mut ShaCircuitBuilder<F, ShaFlexGateManager<F>>,
fp_chip: &FpChip<F>,
args: &witness::SyncStepArgs<S>,
) -> Result<Vec<AssignedValue<F>>, Error> {
assert!(!args.signature_compressed.is_empty(), "signature expected");
let range = fp_chip.range();
let gate = range.gate();
let sha256_chip = Sha256Chip::new(range);
let fp2_chip = Fp2Chip::<F>::new(fp_chip);
let g2_chip = EccChip::new(&fp2_chip);
let pairing_chip = PairingChip::new(fp_chip);
let bls_chip = BlsSignatureChip::new(fp_chip, &pairing_chip);
let h2c_chip = HashToCurveChip::new(&sha256_chip, &fp2_chip);
let execution_payload_root: HashInputChunk<QuantumCell<F>> =
args.execution_payload_root.clone().into_witness();
let pubkey_affines = args
.pubkeys_uncompressed
.as_slice()
.iter()
.map(|bytes| {
G1Affine::from_uncompressed_unchecked_be(&bytes.as_slice().try_into().unwrap())
.unwrap()
})
.collect_vec();
let mut assigned_affines = vec![];
let (agg_pubkey, participation_sum) = Self::aggregate_pubkeys(
builder.main(),
fp_chip,
&pubkey_affines,
&args.pariticipation_bits,
&mut assigned_affines,
);
// Commit to the pubkeys using Poseidon hash. This constraints prover to use the pubkeys of the current sync committee,
// because the same commitment is computed in `CommitteeUpdateCircuit` and stored in the contract at the begining of the period.
let poseidon_commit = fq_array_poseidon(
builder.main(),
fp_chip,
assigned_affines.iter().map(|p| &p.x),
)?;
let attested_slot_bytes: HashInputChunk<_> = args.attested_header.slot.into_witness();
let attested_header_state_root = args
.attested_header
.state_root
.as_ref()
.iter()
.map(|v| builder.main().load_witness(F::from(*v as u64)))
.collect_vec();
let attested_header_root = args
.attested_header
.clone()
.hash_tree_root()
.map_err(|_| Error::Synthesis)?
.as_ref()
.iter()
.map(|v| builder.main().load_witness(F::from(*v as u64)))
.collect_vec();
verify_merkle_multiproof(
builder,
&sha256_chip,
args.attested_header_multiproof
.iter()
.map(|w| w.clone().into_witness()),
[
attested_slot_bytes.clone(),
attested_header_state_root.clone().into(),
],
&attested_header_root,
[S::HEADER_SLOT_INDEX, S::HEADER_STATE_ROOT_INDEX],
args.attested_header_helper_indices.clone(),
)?;
let finalized_block_body_root = args
.finalized_header
.body_root
.as_ref()
.iter()
.map(|&b| builder.main().load_witness(F::from(b as u64)))
.collect_vec();
let finalized_slot_bytes: HashInputChunk<_> = args.finalized_header.slot.into_witness();
let finalized_header_root = args
.finalized_header
.clone()
.hash_tree_root()
.map_err(|_| Error::Synthesis)?
.as_ref()
.iter()
.map(|v| builder.main().load_witness(F::from(*v as u64)))
.collect_vec();
verify_merkle_multiproof(
builder,
&sha256_chip,
args.finalized_header_multiproof
.iter()
.map(|w| w.clone().into_witness()),
[
finalized_slot_bytes.clone(),
finalized_block_body_root.clone().into(),
],
&finalized_header_root,
[S::HEADER_SLOT_INDEX, S::HEADER_BODY_ROOT_INDEX],
args.finalized_header_helper_indices.clone(),
)?;
let signing_root = sha256_chip.digest(
builder,
HashInput::TwoToOne(
attested_header_root.into(),
args.domain.to_vec().into_witness(), // `domain` can't be a constant because will change in next fork.
),
)?;
let signature =
Self::assign_signature(builder.main(), &g2_chip, &args.signature_compressed);
let msghash = h2c_chip.hash_to_curve::<ExpandMsgXmd>(
builder,
signing_root.into_iter().map(|av| QuantumCell::Existing(av)),
S::DST,
)?;
bls_chip.assert_valid_signature(builder.main(), signature, msghash, agg_pubkey);
// Verify finalized block header against current state root via the Merkle "finality" proof
verify_merkle_proof(
builder,
&sha256_chip,
args.finality_branch
.iter()
.map(|w| w.clone().into_witness()),
finalized_header_root.clone().into(),
&attested_header_state_root,
S::FINALIZED_HEADER_INDEX,
)?;
// Verify execution payload root against finalized block body via the Merkle "execution" proof
verify_merkle_proof(
builder,
&sha256_chip,
args.execution_payload_branch
.iter()
.map(|w| w.clone().into_witness()),
execution_payload_root.clone(),
&finalized_block_body_root,
S::EXECUTION_STATE_ROOT_INDEX,
)?;
// Public Input Commitment
// See "Onion hashing vs. Input concatenation" in https://github.com/ChainSafe/Spectre/issues/17#issuecomment-1740965182
let pub_inputs_commit = {
let participation_sum_le =
to_bytes_le::<_, 8>(&participation_sum, gate, builder.main());
let pub_inputs_concat = itertools::chain![
attested_slot_bytes.into_iter().take(8),
finalized_slot_bytes.into_iter().take(8),
participation_sum_le
.into_iter()
.map(|b| QuantumCell::Existing(b)),
finalized_header_root
.into_iter()
.map(|b| QuantumCell::Existing(b)),
execution_payload_root.into_iter(),
]
.collect_vec();
let pub_inputs_bytes = sha256_chip
.digest(builder, pub_inputs_concat)?
.try_into()
.unwrap();
truncate_sha256_into_single_elem(builder.main(), range, pub_inputs_bytes)
};
Ok(vec![pub_inputs_commit, poseidon_commit])
}
// Computes public inputs to `StepCircuit` matching the in-circuit logic from `synthesise` method.
// Note, this function outputes only instances of the `StepCircuit` proof, not the aggregated proof which will also include 12 accumulator limbs.
pub fn get_instances(args: &SyncStepArgs<S>, limb_bits: usize) -> Vec<Vec<bn256::Fr>> {
use sha2::Digest;
const INPUT_SIZE: usize = 8 * 3 + 32 * 2;
let mut input = [0; INPUT_SIZE];
let mut attested_slot_le = args.attested_header.slot.to_le_bytes().to_vec();
attested_slot_le.resize(8, 0);
input[..8].copy_from_slice(&attested_slot_le);
let mut finalized_slot_le = args.finalized_header.slot.to_le_bytes().to_vec();
finalized_slot_le.resize(8, 0);
input[8..16].copy_from_slice(&finalized_slot_le);
let mut participation_le = args
.pariticipation_bits
.iter()
.map(|v| *v as u64)
.sum::<u64>()
.to_le_bytes()
.to_vec();
participation_le.resize(8, 0);
input[16..24].copy_from_slice(&participation_le);
let finalized_header_root: [u8; 32] = args
.finalized_header
.clone()
.hash_tree_root()
.unwrap()
.as_ref()
.try_into()
.unwrap();
input[24..56].copy_from_slice(&finalized_header_root);
let execution_payload_root = &args.execution_payload_root;
input[56..88].copy_from_slice(execution_payload_root);
let pubkey_affines = args
.pubkeys_uncompressed
.as_slice()
.iter()
.map(|bytes| {
G1Affine::from_uncompressed_unchecked_be(&bytes.as_slice().try_into().unwrap())
.unwrap()
})
.collect_vec();
let poseidon_commitment =
poseidon_hash_fq_array::<bn256::Fr>(pubkey_affines.iter().map(|p| p.x), limb_bits);
let mut public_input_commitment = sha2::Sha256::digest(&input).to_vec();
// Truncate to 253 bits
public_input_commitment[31] &= 0b00011111;
vec![vec![
bn256::Fr::from_bytes_le(&public_input_commitment),
poseidon_commitment,
]]
}
}
// Truncate the SHA256 digest to 253 bits and convert to one field element.
pub fn truncate_sha256_into_single_elem<F: Field>(
ctx: &mut Context<F>,
range: &impl RangeInstructions<F>,
hash_bytes: [AssignedValue<F>; 32],
) -> AssignedValue<F> {
let public_input_commitment_bytes = {
let mut truncated_hash = hash_bytes;
let cleared_byte = clear_3_bits(ctx, range, &truncated_hash[31]);
truncated_hash[31] = cleared_byte;
truncated_hash
};
let byte_bases = (0..32)
.map(|i| QuantumCell::Constant(range.gate().pow_of_two()[i * 8]))
.collect_vec();
range
.gate()
.inner_product(ctx, public_input_commitment_bytes, byte_bases)
}
/// Clears the 3 first least significat bits.
/// This function emulates bitwise and on 00011111 (0x1F): `b & 0b00011111` = c
pub fn clear_3_bits<F: Field>(
ctx: &mut Context<F>,
range: &impl RangeInstructions<F>,
b: &AssignedValue<F>,
) -> AssignedValue<F> {
let gate = range.gate();
// Shift `a` three bits to the left (equivalent to a << 3 mod 256)
let b_shifted = gate.mul(ctx, *b, QuantumCell::Constant(F::from(8)));
// since b_shifted can at max be 255*8=2^4 we use 16 bits for modulo division.
let b_shifted = range.div_mod(ctx, b_shifted, BigUint::from(256u64), 16).1;
// Shift `s` three bits to the right (equivalent to s >> 3) to zeroing the first three bits (MSB) of `a`.
range.div_mod(ctx, b_shifted, BigUint::from(8u64), 8).0
}
impl<S: Spec, F: Field> StepCircuit<S, F> {
/// Decompresses siganure from bytes and assigns it to the circuit.
fn assign_signature(
ctx: &mut Context<F>,
g2_chip: &G2Chip<F>,
bytes_compressed: &[u8],
) -> EcPoint<F, Fp2Point<F>> {
let sig_affine = G2Affine::from_compressed_be(&bytes_compressed.try_into().unwrap())
.expect("correct signature");
g2_chip.load_private_unchecked(ctx, sig_affine.into_coordinates())
}
/// Takes a list of pubkeys and aggregates them.
/// The outputs are the aggregated pubkey, the sum of participation bits, and a list of assigned pubkeys.
fn aggregate_pubkeys(
ctx: &mut Context<F>,
fp_chip: &FpChip<'_, F>,
pubkey_affines: &[G1Affine],
pariticipation_bits: &[bool],
assigned_affines: &mut Vec<G1Point<F>>,
) -> (G1Point<F>, AssignedValue<F>) {
let gate = fp_chip.gate();
let g1_chip = G1Chip::<F>::new(fp_chip);
let mut participation_bits = vec![];
assert_eq!(pubkey_affines.len(), S::SYNC_COMMITTEE_SIZE);
for (&pk, is_attested) in
itertools::multizip((pubkey_affines.iter(), pariticipation_bits.iter().copied()))
{
let participation_bit = ctx.load_witness(F::from(is_attested as u64));
gate.assert_bit(ctx, participation_bit);
let assigned_pk = g1_chip.assign_point_unchecked(ctx, pk);
// *Note:* normally, we would need to take into account the sign of the y coordinate, but
// because we are concerned only with signature forgery, if this is the wrong
// sign, the signature will be invalid anyway and thus verification fails.
/*
// Square y coordinate
let ysq = fp_chip.mul(ctx, assigned_pk.y.clone(), assigned_pk.y.clone());
// Calculate y^2 using the elliptic curve equation
let ysq_calc = calculate_ysquared::<F>(ctx, fp_chip, assigned_pk.x.clone());
// Constrain witness y^2 to be equal to calculated y^2
fp_chip.assert_equal(ctx, ysq, ysq_calc);
*/
assigned_affines.push(assigned_pk);
participation_bits.push(participation_bit);
}
let rand_point = g1_chip.load_random_point::<G1Affine>(ctx);
let mut acc = rand_point.clone();
for (bit, point) in participation_bits
.iter()
.copied()
.zip(assigned_affines.iter_mut())
{
let sum = g1_chip.add_unequal(ctx, acc.clone(), point.clone(), true);
acc = g1_chip.select(ctx, sum, acc, bit);
}
let agg_pubkey = g1_chip.sub_unequal(ctx, acc, rand_point, false);
let participation_sum = gate.sum(ctx, participation_bits);
(agg_pubkey, participation_sum)
}
}
impl<S: Spec> AppCircuit for StepCircuit<S, bn256::Fr> {
type Pinning = Eth2ConfigPinning;
type Witness = witness::SyncStepArgs<S>;
fn create_circuit(
stage: CircuitBuilderStage,
pinning: Option<Self::Pinning>,
args: &Self::Witness,
params: &ParamsKZG<Bn256>,
) -> Result<impl crate::util::PinnableCircuit<bn256::Fr>, Error> {
let k = params.k() as usize;
let lookup_bits = pinning
.as_ref()
.map_or(k - 1, |p| p.params.lookup_bits.unwrap_or(k - 1));
let mut builder = Eth2CircuitBuilder::<ShaFlexGateManager<bn256::Fr>>::from_stage(stage)
.use_k(k)
.use_instance_columns(1);
let range = builder.range_chip(lookup_bits);
let fp_chip = FpChip::new(&range, LIMB_BITS, NUM_LIMBS);
let assigned_instances = Self::synthesize(&mut builder, &fp_chip, args)?;
builder.set_instances(0, assigned_instances);
match stage {
CircuitBuilderStage::Prover => {
if let Some(pinning) = pinning {
builder.set_params(pinning.params);
builder.set_break_points(pinning.break_points);
}
}
_ => {
builder.calculate_params(Some(
var("MINIMUM_ROWS")
.unwrap_or_else(|_| "0".to_string())
.parse()
.unwrap(),
));
}
}
Ok(builder)
}
}
#[cfg(test)]
mod tests {
use std::fs;
use crate::{
aggregation_circuit::AggregationConfigPinning, util::Halo2ConfigPinning,
witness::SyncStepArgs,
};
use super::*;
use ark_std::{end_timer, start_timer};
use eth_types::Testnet;
use halo2_base::{
halo2_proofs::dev::MockProver, halo2_proofs::halo2curves::bn256::Fr, utils::fs::gen_srs,
};
use snark_verifier_sdk::{
evm::{evm_verify, gen_evm_proof_shplonk},
halo2::aggregation::AggregationCircuit,
CircuitExt,
};
fn load_circuit_args() -> SyncStepArgs<Testnet> {
serde_json::from_slice(&fs::read("../test_data/sync_step_512.json").unwrap()).unwrap()
}
#[test]
fn test_step_circuit() {
const K: u32 = 20;
let witness = load_circuit_args();
let params: ParamsKZG<Bn256> = gen_srs(K);
let circuit = StepCircuit::<Testnet, Fr>::create_circuit(
CircuitBuilderStage::Mock,
None,
&witness,
¶ms,
)
.unwrap();
let instance = StepCircuit::<Testnet, Fr>::get_instances(&witness, LIMB_BITS);
let timer = start_timer!(|| "sync_step mock prover");
let prover = MockProver::<Fr>::run(K, &circuit, instance).unwrap();
prover.assert_satisfied_par();
end_timer!(timer);
}
#[test]
fn test_step_proofgen() {
const K: u32 = 20;
let params = gen_srs(K);
let pk = StepCircuit::<Testnet, Fr>::create_pk(
¶ms,
"../build/sync_step_20.pkey",
"./config/sync_step_20.json",
&SyncStepArgs::<Testnet>::default(),
None,
);
let witness = load_circuit_args();
let _ = StepCircuit::<Testnet, Fr>::gen_proof_shplonk(
¶ms,
&pk,
"./config/sync_step_20.json",
&witness,
)
.expect("proof generation & verification should not fail");
}
#[test]
fn test_step_evm_verify() {
const K: u32 = 20;
let params = gen_srs(K);
let pk = StepCircuit::<Testnet, Fr>::create_pk(
¶ms,
"../build/sync_step_20.pkey",
"./config/sync_step_20.json",
&SyncStepArgs::<Testnet>::default(),
None,
);
let witness = load_circuit_args();
let pinning = Eth2ConfigPinning::from_path("./config/sync_step_20.json");
let circuit = StepCircuit::<Testnet, Fr>::create_circuit(
CircuitBuilderStage::Prover,
Some(pinning),
&witness,
¶ms,
)
.unwrap();
let instances = circuit.instances();
let proof = gen_evm_proof_shplonk(¶ms, &pk, circuit, instances.clone());
println!("proof size: {}", proof.len());
let deployment_code = StepCircuit::<Testnet, Fr>::gen_evm_verifier_shplonk(
¶ms,
&pk,
None::<String>,
&witness,
)
.unwrap();
println!("deployment_code size: {}", deployment_code.len());
evm_verify(deployment_code, instances, proof);
}
#[test]
fn test_step_aggregation_evm() {
const APP_K: u32 = 20;
const APP_PK_PATH: &str = "../build/sync_step_20.pkey";
const APP_PINNING_PATH: &str = "./config/sync_step_20.json";
const AGG_K: u32 = 23;
const AGG_PK_PATH: &str = "../build/sync_step_verifier_23.pkey";
const AGG_CONFIG_PATH: &str = "./config/sync_step_verifier_23.json";
let params_app = gen_srs(APP_K);
let pk_app = StepCircuit::<Testnet, Fr>::create_pk(
¶ms_app,
APP_PK_PATH,
APP_PINNING_PATH,
&SyncStepArgs::<Testnet>::default(),
None,
);
let witness = load_circuit_args();
let snark = vec![StepCircuit::<Testnet, Fr>::gen_snark_shplonk(
¶ms_app,
&pk_app,
APP_PINNING_PATH,
None::<String>,
&witness,
)
.unwrap()];
let agg_params = gen_srs(AGG_K);
let pk = AggregationCircuit::create_pk(
&agg_params,
AGG_PK_PATH,
AGG_CONFIG_PATH,
&snark.clone(),
Some(AggregationConfigPinning::new(AGG_K, 19)),
);
let agg_config = AggregationConfigPinning::from_path(AGG_CONFIG_PATH);
let agg_circuit = AggregationCircuit::create_circuit(
CircuitBuilderStage::Prover,
Some(agg_config),
&snark,
&agg_params,
)
.unwrap();
let instances = agg_circuit.instances();
let num_instances = agg_circuit.num_instance();
println!("num_instances: {:?}", num_instances);
println!("instances: {:?}", instances);
let proof = gen_evm_proof_shplonk(&agg_params, &pk, agg_circuit, instances.clone());
println!("proof size: {}", proof.len());
let deployment_code =
AggregationCircuit::gen_evm_verifier_shplonk(&agg_params, &pk, None::<String>, &snark)
.unwrap();
println!("deployment_code size: {}", deployment_code.len());
evm_verify(deployment_code, instances, proof);
}
}