fmtr

Author: darth-cy

spartan_parallel/src/dense_mlpoly.rs

@@ -321,8 +321,8 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
 
   pub fn prove(
     poly: &DensePolynomial<S>,
-    r: &[S],                  // point at which the polynomial is evaluated
-    _Zr: &S,                   // evaluation of \widetilde{Z}(r)
+    r: &[S], // point at which the polynomial is evaluated
+    _Zr: &S, // evaluation of \widetilde{Z}(r)
     transcript: &mut Transcript,
     _random_tape: &mut RandomTape<S>,
   ) -> PolyEvalProof<S> {
@@ -383,8 +383,8 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
   // Evaluation of multiple points on the same instance
   pub fn prove_batched_points(
     poly: &DensePolynomial<S>,
-    r_list: Vec<Vec<S>>,      // point at which the polynomial is evaluated
-    Zr_list: Vec<S>,          // evaluation of \widetilde{Z}(r) on each point
+    r_list: Vec<Vec<S>>, // point at which the polynomial is evaluated
+    Zr_list: Vec<S>,     // evaluation of \widetilde{Z}(r) on each point
     transcript: &mut Transcript,
     _random_tape: &mut RandomTape<S>,
   ) -> Vec<PolyEvalProof<S>> {
@@ -440,7 +440,7 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
       // compute vector-matrix product between L and Z viewed as a matrix
       let LZ = poly.bound(L);
 
-      proof_list.push(PolyEvalProof{ v: LZ });
+      proof_list.push(PolyEvalProof { v: LZ });
     }
 
     proof_list
@@ -497,8 +497,8 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
   // Size of each instance might be different, but all are larger than the evaluation point
   pub fn prove_batched_instances(
     poly_list: &Vec<DensePolynomial<S>>, // list of instances
-    r_list: Vec<&Vec<S>>,     // point at which the polynomial is evaluated
-    Zr_list: &Vec<S>,         // evaluation of \widetilde{Z}(r) on each instance
+    r_list: Vec<&Vec<S>>,                // point at which the polynomial is evaluated
+    Zr_list: &Vec<S>,                    // evaluation of \widetilde{Z}(r) on each instance
     transcript: &mut Transcript,
     _random_tape: &mut RandomTape<S>,
   ) -> Vec<PolyEvalProof<S>> {
@@ -563,7 +563,7 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
     for v in LZ_list.into_iter() {
       proof_list.push(PolyEvalProof { v });
     }
-    
+
     proof_list
   }
 
@@ -698,7 +698,7 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
 
     let mut proof_list = Vec::new();
     for v in LZ_list.into_iter() {
-      proof_list.push(PolyEvalProof{ v });
+      proof_list.push(PolyEvalProof { v });
     }
 
     proof_list

spartan_parallel/src/r1csproof.rs

@@ -88,23 +88,22 @@ impl<S: SpartanExtensionField> R1CSProof<S> {
     let comb_func = |poly_A_comp: &S, poly_B_comp: &S, poly_C_comp: &S| -> S {
       *poly_A_comp * *poly_B_comp * *poly_C_comp
     };
-    let (sc_proof_phase_two, r, claims) =
-      SumcheckInstanceProof::<S>::prove_cubic_disjoint_rounds(
-        claim,
-        num_rounds,
-        num_rounds_y_max,
-        num_rounds_w,
-        num_rounds_p,
-        single_inst,
-        num_witness_secs,
-        num_inputs,
-        evals_eq,
-        evals_ABC,
-        evals_z,
-        comb_func,
-        transcript,
-        random_tape,
-      );
+    let (sc_proof_phase_two, r, claims) = SumcheckInstanceProof::<S>::prove_cubic_disjoint_rounds(
+      claim,
+      num_rounds,
+      num_rounds_y_max,
+      num_rounds_w,
+      num_rounds_p,
+      single_inst,
+      num_witness_secs,
+      num_inputs,
+      evals_eq,
+      evals_ABC,
+      evals_z,
+      comb_func,
+      transcript,
+      random_tape,
+    );
 
     (sc_proof_phase_two, r, claims)
   }
@@ -620,10 +619,12 @@ impl<S: SpartanExtensionField> R1CSProof<S> {
     let tau_q = transcript.challenge_vector(b"challenge_tau_q", num_rounds_q);
     let tau_x = transcript.challenge_vector(b"challenge_tau_x", num_rounds_x);
 
-    let (_, rx) =
-      self
-        .sc_proof_phase1
-        .verify(S::field_zero(), num_rounds_x + num_rounds_q + num_rounds_p, 3, transcript)?;
+    let (_, rx) = self.sc_proof_phase1.verify(
+      S::field_zero(),
+      num_rounds_x + num_rounds_q + num_rounds_p,
+      3,
+      transcript,
+    )?;
 
     // debug_zk
     // perform the intermediate sum-check test with claimed Az, Bz, and Cz
@@ -668,10 +669,12 @@ impl<S: SpartanExtensionField> R1CSProof<S> {
     let claim_phase2 = r_A * Az_claim + r_B * Bz_claim + r_C * Cz_claim;
 
     // verify the joint claim with a sum-check protocol
-    let (_, ry) =
-      self
-        .sc_proof_phase2
-        .verify(claim_phase2, num_rounds_y + num_rounds_w + num_rounds_p, 3, transcript)?;
+    let (_, ry) = self.sc_proof_phase2.verify(
+      claim_phase2,
+      num_rounds_y + num_rounds_w + num_rounds_p,
+      3,
+      transcript,
+    )?;
 
     // Separate ry into rp, rw, and ry
     let (ry_rev, rw) = ry.split_at(num_rounds_y);

spartan_parallel/src/sparse_mlpoly.rs

@@ -104,13 +104,8 @@ impl<S: SpartanExtensionField> DerefsEvalProof<S> {
     // decommit the joint polynomial at r_joint
     S::append_field_to_transcript(b"joint_claim_eval", transcript, eval_joint);
 
-    let proof_derefs = PolyEvalProof::prove(
-      joint_poly,
-      &r_joint,
-      &eval_joint,
-      transcript,
-      random_tape,
-    );
+    let proof_derefs =
+      PolyEvalProof::prove(joint_poly, &r_joint, &eval_joint, transcript, random_tape);
 
     proof_derefs
   }