forked from scroll-tech/snark-verifier
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Documentations; subcircuit for aggregation (scroll-tech#13)
* wip * [refactor] refactoring sdk * [refactor] halo2 api * [chore] update cargo.toml * [feat] impl sub-circuit for proof aggregation circuit * [feat] impl sub circuit for multi aggregation * [chore] clean up * [chore] update cargo branch
- Loading branch information
1 parent
ae6a9ef
commit a8b277a
Showing
56 changed files
with
3,181 additions
and
1,303 deletions.
There are no files selected for viewing
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,2 +1,2 @@ | ||
| max_width = 100 | ||
| use_small_heuristics = "Max" | ||
| use_small_heuristics = "Max" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,131 @@ | ||
| #![allow(clippy::clone_on_copy)] | ||
| use crate::{ | ||
| types::{BaseFieldEccChip, Halo2Loader, Plonk, PoseidonTranscript, POSEIDON_SPEC}, | ||
| SnarkWitness, | ||
| }; | ||
| #[cfg(feature = "display")] | ||
| use ark_std::end_timer; | ||
| #[cfg(feature = "display")] | ||
| use ark_std::start_timer; | ||
| use halo2_base::{ | ||
| halo2_proofs::{ | ||
| circuit::Value, | ||
| halo2curves::bn256::{Fr, G1Affine}, | ||
| }, | ||
| AssignedValue, | ||
| }; | ||
| use itertools::Itertools; | ||
| use snark_verifier::{ | ||
| loader::halo2::EccInstructions, | ||
| pcs::{ | ||
| kzg::{KzgAccumulator, KzgAs}, | ||
| AccumulationScheme, MultiOpenScheme, PolynomialCommitmentScheme, | ||
| }, | ||
| verifier::PlonkVerifier, | ||
| }; | ||
| use std::{fs::File, rc::Rc}; | ||
|
|
||
| use config::AggregationConfigParams; | ||
|
|
||
| pub mod aggregation_circuit; | ||
| pub mod config; | ||
| pub mod multi_aggregation_circuit; | ||
|
|
||
| pub fn load_verify_circuit_degree() -> u32 { | ||
| let path = std::env::var("VERIFY_CONFIG") | ||
| .unwrap_or_else(|_| "./configs/verify_circuit.config".to_string()); | ||
| let params: AggregationConfigParams = serde_json::from_reader( | ||
| File::open(path.as_str()).unwrap_or_else(|_| panic!("{path} does not exist")), | ||
| ) | ||
| .unwrap(); | ||
| params.degree | ||
| } | ||
|
|
||
| pub fn flatten_accumulator<'a>( | ||
| accumulator: KzgAccumulator<G1Affine, Rc<Halo2Loader<'a>>>, | ||
| ) -> Vec<AssignedValue<Fr>> { | ||
| let KzgAccumulator { lhs, rhs } = accumulator; | ||
| let lhs = lhs.into_assigned(); | ||
| let rhs = rhs.into_assigned(); | ||
|
|
||
| lhs.x | ||
| .truncation | ||
| .limbs | ||
| .into_iter() | ||
| .chain(lhs.y.truncation.limbs.into_iter()) | ||
| .chain(rhs.x.truncation.limbs.into_iter()) | ||
| .chain(rhs.y.truncation.limbs.into_iter()) | ||
| .collect() | ||
| } | ||
|
|
||
| #[allow(clippy::type_complexity)] | ||
| /// Core function used in `synthesize` to aggregate multiple `snarks`. | ||
| /// | ||
| /// Returns the assigned instances of previous snarks and the new final pair that needs to be verified in a pairing check. | ||
| /// For each previous snark, we concatenate all instances into a single vector. We return a vector of vectors, | ||
| /// one vector per snark, for convenience. | ||
| pub fn aggregate<'a, PCS>( | ||
| svk: &PCS::SuccinctVerifyingKey, | ||
| loader: &Rc<Halo2Loader<'a>>, | ||
| snarks: &[SnarkWitness], | ||
| as_proof: Value<&'_ [u8]>, | ||
| ) -> ( | ||
| Vec<Vec<<BaseFieldEccChip as EccInstructions<'a, G1Affine>>::AssignedScalar>>, | ||
| KzgAccumulator<G1Affine, Rc<Halo2Loader<'a>>>, | ||
| ) | ||
| where | ||
| PCS: PolynomialCommitmentScheme< | ||
| G1Affine, | ||
| Rc<Halo2Loader<'a>>, | ||
| Accumulator = KzgAccumulator<G1Affine, Rc<Halo2Loader<'a>>>, | ||
| > + MultiOpenScheme<G1Affine, Rc<Halo2Loader<'a>>>, | ||
| { | ||
| let assign_instances = |instances: &[Vec<Value<Fr>>]| { | ||
| instances | ||
| .iter() | ||
| .map(|instances| { | ||
| instances.iter().map(|instance| loader.assign_scalar(*instance)).collect_vec() | ||
| }) | ||
| .collect_vec() | ||
| }; | ||
|
|
||
| // TODO pre-allocate capacity better | ||
| let mut previous_instances = Vec::with_capacity(snarks.len()); | ||
| let mut transcript = PoseidonTranscript::<Rc<Halo2Loader<'a>>, _>::from_spec( | ||
| loader, | ||
| Value::unknown(), | ||
| POSEIDON_SPEC.clone(), | ||
| ); | ||
|
|
||
| let mut accumulators = snarks | ||
| .iter() | ||
| .flat_map(|snark| { | ||
| let protocol = snark.protocol.loaded(loader); | ||
| // TODO use 1d vector | ||
| let instances = assign_instances(&snark.instances); | ||
|
|
||
| // read the transcript and perform Fiat-Shamir | ||
| // run through verification computation and produce the final pair `succinct` | ||
| transcript.new_stream(snark.proof()); | ||
| let proof = Plonk::<PCS>::read_proof(svk, &protocol, &instances, &mut transcript); | ||
| let accumulator = Plonk::<PCS>::succinct_verify(svk, &protocol, &instances, &proof); | ||
|
|
||
| previous_instances.push( | ||
| instances.into_iter().flatten().map(|scalar| scalar.into_assigned()).collect(), | ||
| ); | ||
|
|
||
| accumulator | ||
| }) | ||
| .collect_vec(); | ||
|
|
||
| let accumulator = if accumulators.len() > 1 { | ||
| transcript.new_stream(as_proof); | ||
| let proof = | ||
| KzgAs::<PCS>::read_proof(&Default::default(), &accumulators, &mut transcript).unwrap(); | ||
| KzgAs::<PCS>::verify(&Default::default(), &accumulators, &proof).unwrap() | ||
| } else { | ||
| accumulators.pop().unwrap() | ||
| }; | ||
|
|
||
| (previous_instances, accumulator) | ||
| } |
Oops, something went wrong.