69 lines
2.3 KiB
Rust
Raw Normal View History

2024-12-30 11:40:13 +03:00
use criterion::{Criterion, criterion_group, criterion_main};
use plonky2::plonk::circuit_data::VerifierCircuitData;
use plonky2::plonk::config::GenericConfig;
use plonky2::plonk::proof::ProofWithPublicInputs;
2025-01-14 23:03:00 +01:00
use codex_plonky2_circuits::recursion::simple::simple_tree_recursion::aggregate_sampling_proofs_tree;
use proof_input::params::{C, D, F, HF, Params};
2024-12-30 11:40:13 +03:00
use proof_input::gen_input::{build_circuit, prove_circuit};
/// Benchmark for building, proving, and verifying the Plonky2 recursion circuit.
2025-01-15 21:58:56 +01:00
fn bench_tree_recursion<const N_INNER:usize>(c: &mut Criterion) -> anyhow::Result<()>{
2025-01-14 23:03:00 +01:00
2025-01-15 21:58:56 +01:00
let mut group = c.benchmark_group(format!("Simple Tree Recursion Benchmark for N={}",N_INNER));
2025-01-14 23:03:00 +01:00
2024-12-30 11:40:13 +03:00
// number of samples in each proof
2025-01-15 21:58:56 +01:00
let n_samples = 10;
2025-01-14 23:03:00 +01:00
// params
let mut circ_params = Params::default().circuit_params;
circ_params.n_samples = n_samples;
2024-12-30 11:40:13 +03:00
2025-01-14 23:03:00 +01:00
let (data, pw) = build_circuit(n_samples, 3)?;
let proof = prove_circuit(&data, &pw)?;
2024-12-30 11:40:13 +03:00
// get proofs
2025-01-14 23:03:00 +01:00
let proofs_with_pi = (0..N_INNER).map(|i| proof.clone()).collect::<Vec<_>>();
println!("inner circuit size = {:?}", data.common.degree_bits());
2024-12-30 11:40:13 +03:00
let mut agg_proof_with_pis: Option<ProofWithPublicInputs<F, C, D>> = None;
let mut agg_vd: Option<VerifierCircuitData<F, C, D>> = None;
// Benchmark the Circuit Building Phase
group.bench_function("build & prove Circuit", |b| {
b.iter(|| {
2025-01-14 23:03:00 +01:00
let (proof, vd_agg) = aggregate_sampling_proofs_tree::<F,D,C,HF>(&proofs_with_pi, data.verifier_data()).unwrap();
agg_proof_with_pis = Some(proof);
agg_vd = Some(vd_agg);
2024-12-30 11:40:13 +03:00
})
});
let proof = agg_proof_with_pis.unwrap();
println!("Proof size: {} bytes", proof.to_bytes().len());
// Benchmark the Verifying Phase
let loc_vd = agg_vd.unwrap();
group.bench_function("Verify Proof", |b| {
b.iter(|| {
loc_vd.clone().verify(proof.clone()).expect("Failed to verify proof");
})
});
group.finish();
2025-01-14 23:03:00 +01:00
Ok(())
2024-12-30 11:40:13 +03:00
}
2025-01-15 21:58:56 +01:00
fn bench_multiple_n(c: &mut Criterion){
bench_tree_recursion::<4>(c);
bench_tree_recursion::<8>(c);
bench_tree_recursion::<16>(c);
}
2024-12-30 11:40:13 +03:00
/// Criterion benchmark group
criterion_group!{
name = recursion;
config = Criterion::default().sample_size(10);
2025-01-15 21:58:56 +01:00
targets = bench_multiple_n
2024-12-30 11:40:13 +03:00
}
criterion_main!(recursion);