@@ -382,9 +382,7 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
382382 let eq = EqPolynomial :: new ( r. to_vec ( ) ) ;
383383 let ( L , R ) = eq. compute_factored_evals ( ) ;
384384
385- let _ = self
386- . proof
387- . verify ( R . len ( ) , transcript, & R ) ;
385+ let _ = self . proof . verify ( R . len ( ) , transcript, & R ) ;
388386
389387 // TODO: Alternative PCS Verification
390388 Ok ( ( ) )
@@ -394,7 +392,7 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
394392 & self ,
395393 transcript : & mut Transcript ,
396394 r : & [ S ] , // point at which the polynomial is evaluated
397- _Zr : & S , // evaluation \widetilde{Z}(r)
395+ _Zr : & S , // evaluation \widetilde{Z}(r)
398396 ) -> Result < ( ) , ProofVerifyError > {
399397 self . verify ( transcript, r) ;
400398
@@ -862,7 +860,7 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
862860 // compute a weighted sum of commitments and L
863861 let LZ = S :: field_zero ( ) ;
864862 L_list . push ( L ) ;
865- R_list . push ( R ) ;
863+ R_list . push ( R ) ;
866864 LZ_list . push ( LZ ) ;
867865 }
868866 }
@@ -873,9 +871,7 @@ impl<S: SpartanExtensionField> PolyEvalProof<S> {
873871 for i in 0 ..LZ_list . len ( ) {
874872 let R = & R_list [ i] ;
875873
876- proof_list[ i]
877- . proof
878- . verify ( R . len ( ) , transcript, R ) ?;
874+ proof_list[ i] . proof . verify ( R . len ( ) , transcript, R ) ?;
879875 }
880876
881877 Ok ( ( ) )
0 commit comments