cargo fmt

plonky2-bench/benches/poseidon.rs

@@ -4,17 +4,13 @@ use plonky2::field::goldilocks_field::GoldilocksField;
 use plonky2::{
     field::types::PrimeField64,
     iop::witness::{PartialWitness, WitnessWrite},
-    plonk::{
-        config::PoseidonGoldilocksConfig, proof::ProofWithPublicInputs,
-    },
+    plonk::{config::PoseidonGoldilocksConfig, proof::ProofWithPublicInputs},
     recursion::{
         cyclic_recursion::check_cyclic_proof_verifier_data, dummy_circuit::cyclic_base_proof,
     },
 };
 use plonky2_bench::recursion::check_hash_value;
-use plonky2_bench::{
-    recursion::{init, iterate_poseidon, C, D, F},
-};
+use plonky2_bench::recursion::{init, iterate_poseidon, C, D, F};
 use plonky2_field::types::Field;
 
 criterion_group! {
@@ -92,7 +88,7 @@ fn bench_recursive_snark_proove(c: &mut Criterion) {
         println!("Number of constraints: {}", num_constr);
 
         check_hash_value(&proof).unwrap();
-        
+
         group.finish();
     }
 }

plonky2-bench/src/recursion.rs

@@ -8,9 +8,7 @@ use plonky2::hash::poseidon::{PoseidonHash, PoseidonPermutation};
 use plonky2::iop::target::BoolTarget;
 use plonky2::iop::witness::{PartialWitness, WitnessWrite};
 use plonky2::plonk::circuit_builder::CircuitBuilder;
-use plonky2::plonk::circuit_data::{
-    CircuitConfig, CommonCircuitData, VerifierCircuitTarget,
-};
+use plonky2::plonk::circuit_data::{CircuitConfig, CommonCircuitData, VerifierCircuitTarget};
 use plonky2::plonk::config::{GenericConfig, PoseidonGoldilocksConfig};
 use plonky2::plonk::proof::{ProofWithPublicInputs, ProofWithPublicInputsTarget};
 use plonky2::recursion::cyclic_recursion::check_cyclic_proof_verifier_data;
@@ -42,7 +40,7 @@ pub fn recursion(d: usize) -> Result<()> {
     let d = d - 1;
 
     let (builder, common_data, condition, inner_cyclic_proof_with_pis, verifier_data_target) =
-            init(d)?;
+        init(d)?;
 
     let cyclic_circuit_data = builder.build::<C>();
 
@@ -173,7 +171,9 @@ pub fn iterate_poseidon<F: RichField>(initial_state: [F; 4], n: usize) -> [F; 4]
     current
 }
 
-pub fn check_hash_value(proof: &ProofWithPublicInputs<GoldilocksField, PoseidonGoldilocksConfig, D>) -> Result<()> {
+pub fn check_hash_value(
+    proof: &ProofWithPublicInputs<GoldilocksField, PoseidonGoldilocksConfig, D>,
+) -> Result<()> {
     let initial_hash = &proof.public_inputs[..4];
     let hash = &proof.public_inputs[4..8];
     let counter = proof.public_inputs[8];
@@ -184,8 +184,8 @@ pub fn check_hash_value(proof: &ProofWithPublicInputs<GoldilocksField, PoseidonG
 
     // make sure the end result makes sense
     if hash != expected_hash {
-        return Err(anyhow::Error::msg("hash was not calculated right"))
+        return Err(anyhow::Error::msg("hash was not calculated right"));
     }
 
     Ok(())
-}
+}