missing typos

folding-schemes-solidity/templates/kzg10_verifier.askama.sol

@@ -231,7 +231,7 @@ contract KZG10Verifier {
             require(eval_z == 0, "checkAndCommitAuxPolys: wrong zero poly");
             require(eval_l == y_vals[i], "checkAndCommitAuxPolys: wrong lagrange poly");
         }
-        // z(x) has len(x_vals) + 1 coeffs, we add to the commmitment the last coeff of z(x)
+        // z(x) has len(x_vals) + 1 coeffs, we add to the commitment the last coeff of z(x)
         z_commit = add(z_commit, mulScalar(G1_CRS[z_coeffs.length - 1], z_coeffs[z_coeffs.length - 1]));
 
         return (z_commit, l_commit);

folding-schemes/src/folding/hypernova/cccs.rs

@@ -111,7 +111,7 @@ impl<C: CurveGroup> CCCS<C> {
         w: &Witness<C::ScalarField>,
     ) -> Result<(), Error> {
         // check that C is the commitment of w. Notice that this is not verifying a Pedersen
-        // opening, but checking that the Commmitment comes from committing to the witness.
+        // opening, but checking that the Commitment comes from committing to the witness.
         if self.C != Pedersen::commit(pedersen_params, &w.w, &w.r_w)? {
             return Err(Error::NotSatisfied);
         }

folding-schemes/src/folding/hypernova/lcccs.rs

@@ -96,7 +96,7 @@ impl<C: CurveGroup> LCCCS<C> {
         w: &Witness<C::ScalarField>,
     ) -> Result<(), Error> {
         // check that C is the commitment of w. Notice that this is not verifying a Pedersen
-        // opening, but checking that the Commmitment comes from committing to the witness.
+        // opening, but checking that the Commitment comes from committing to the witness.
         if self.C != Pedersen::commit(pedersen_params, &w.w, &w.r_w)? {
             return Err(Error::NotSatisfied);
         }

folding-schemes/src/folding/nova/circuits.rs

@@ -572,7 +572,7 @@ pub mod tests {
         assert_eq!(hVar.value().unwrap(), h);
     }
 
-    // checks that the gadget and native implementations of the challenge computation matcbh
+    // checks that the gadget and native implementations of the challenge computation match
     #[test]
     fn test_challenge_gadget() {
         let mut rng = ark_std::test_rng();

folding-schemes/src/folding/nova/nifs.rs

@@ -143,7 +143,7 @@ where
         // use r_T=1 since we don't need hiding property for cm(T)
         let w3 = NIFS::<C, CP>::fold_witness(r, w1, w2, T, C::ScalarField::one())?;
 
-        // fold committed instancs
+        // fold committed instances
         let ci3 = NIFS::<C, CP>::fold_committed_instance(r, ci1, ci2, &cmT);
 
         Ok((w3, ci3))

folding-schemes/src/folding/protogalaxy/folding.rs

@@ -522,7 +522,7 @@ mod tests {
         )
         .unwrap();
 
-        // veriier
+        // verifier
         let folded_instance_v = Folding::<Projective>::verify(
             &mut transcript_v,
             &r1cs,
@@ -572,7 +572,7 @@ mod tests {
                 )
                 .unwrap();
 
-            // veriier
+            // verifier
             let folded_instance_v = Folding::<Projective>::verify(
                 &mut transcript_v,
                 &r1cs,

folding-schemes/src/transcript/poseidon.rs

@@ -57,7 +57,7 @@ where
     }
 }
 
-// Returns the point coordinates in Fr, so it can be absrobed by the transcript. It does not work
+// Returns the point coordinates in Fr, so it can be absorbed by the transcript. It does not work
 // over bytes in order to have a logic that can be reproduced in-circuit.
 fn prepare_point<C: CurveGroup>(p: &C) -> Result<Vec<C::ScalarField>, Error> {
     let affine = p.into_affine();