use std::marker::PhantomData; use plonky2::hash::hash_types::RichField; use plonky2::iop::witness::{PartialWitness, WitnessWrite}; use plonky2::plonk::circuit_builder::CircuitBuilder; use plonky2::plonk::circuit_data::{CircuitConfig, CircuitData, CommonCircuitData, VerifierCircuitTarget, VerifierOnlyCircuitData}; use plonky2::plonk::config::{AlgebraicHasher, GenericConfig}; use plonky2::plonk::proof::{ProofWithPublicInputs, ProofWithPublicInputsTarget}; use plonky2_field::extension::Extendable; use plonky2_poseidon2::poseidon2_hash::poseidon2::Poseidon2; use crate::recursion::circuits::inner_circuit::InnerCircuit; use crate::{error::CircuitError,Result}; /// recursion leaf circuit - verifies N inner proof #[derive(Clone, Debug)] pub struct LeafCircuit< F: RichField + Extendable + Poseidon2, const D: usize, C: GenericConfig, H: AlgebraicHasher, const N: usize, > where >::Hasher: AlgebraicHasher { inner_common_data: CommonCircuitData, phantom_data: PhantomData<(C,H)> } #[derive(Clone, Debug)] pub struct LeafTargets < const D: usize, >{ pub inner_proof: Vec>, pub verifier_data: VerifierCircuitTarget, } impl< F: RichField + Extendable + Poseidon2, const D: usize, C: GenericConfig, H: AlgebraicHasher, const N: usize, > LeafCircuit where >::Hasher: AlgebraicHasher { pub fn new(inner_common_data: CommonCircuitData) -> Self { Self{ inner_common_data, phantom_data:PhantomData::default(), } } /// build the leaf circuit pub fn build(&self, builder: &mut CircuitBuilder) -> Result> { let inner_common = self.inner_common_data.clone(); // the proof virtual targets let mut pub_input = vec![]; let mut vir_proofs = vec![]; for _i in 0..N { let vir_proof = builder.add_virtual_proof_with_pis(&inner_common); let inner_pub_input = vir_proof.public_inputs.clone(); vir_proofs.push(vir_proof); pub_input.extend_from_slice(&inner_pub_input); } // hash the public input & make it public let hash_inner_pub_input = builder.hash_n_to_hash_no_pad::(pub_input); builder.register_public_inputs(&hash_inner_pub_input.elements); // virtual target for the verifier data let inner_verifier_data = builder.add_virtual_verifier_data(inner_common.config.fri_config.cap_height); // register verifier data hash as public input. let mut vd_pub_input = vec![]; vd_pub_input.extend_from_slice(&inner_verifier_data.circuit_digest.elements); for i in 0..builder.config.fri_config.num_cap_elements() { vd_pub_input.extend_from_slice(&inner_verifier_data.constants_sigmas_cap.0[i].elements); } let hash_inner_vd_pub_input = builder.hash_n_to_hash_no_pad::(vd_pub_input); builder.register_public_inputs(&hash_inner_vd_pub_input.elements); // verify the proofs in-circuit for i in 0..N { builder.verify_proof::(&vir_proofs[i], &inner_verifier_data, &inner_common); } // return targets let t = LeafTargets { inner_proof: vir_proofs, verifier_data: inner_verifier_data, }; Ok(t) } /// assign the leaf targets with given input pub fn assign_targets( &self, pw: &mut PartialWitness, targets: &LeafTargets, inner_proof: &[ProofWithPublicInputs], verifier_only_data: &VerifierOnlyCircuitData, ) -> Result<()> { assert_eq!(inner_proof.len(), N); // assign the proofs for i in 0..N { pw.set_proof_with_pis_target(&targets.inner_proof[i], &inner_proof[i]) .map_err(|e| { CircuitError::ProofTargetAssignmentError("inner-proof".to_string(), e.to_string()) })?; } // assign the verifier data pw.set_verifier_data_target(&targets.verifier_data, verifier_only_data) .map_err(|e| { CircuitError::VerifierDataTargetAssignmentError(e.to_string()) })?; Ok(()) } /// returns the leaf circuit data pub fn get_circuit_data (&self) -> Result> where >::Hasher: AlgebraicHasher { let config = CircuitConfig::standard_recursion_config(); let mut builder = CircuitBuilder::::new(config.clone()); self.build(&mut builder)?; let circ_data = builder.build::(); Ok(circ_data) } }