chore: fix some minor issues in the comments

Signed-off-by: spuradage <spuradage@outlook.com>

Author: spuradage

book/src/specs/kimchi.md

@@ -2156,7 +2156,7 @@ The prover then follows the following steps to create the proof:
    Note: unlike the original PLONK protocol,
    the prover also provides evaluations of the public polynomial to help the verifier circuit.
    This is why we need to absorb the commitment to the public polynomial at this point.
-1. Commit to the witness columns by creating `COLUMNS` hidding commitments.
+1. Commit to the witness columns by creating `COLUMNS` hiding commitments.
 
    Note: since the witness is in evaluation form,
    we can use the `commit_evaluation` optimization.
@@ -2193,7 +2193,7 @@ The prover then follows the following steps to create the proof:
 	* Commit to the aggregation polynomial.
 	* Absorb the commitment to the aggregation polynomial with the Fq-Sponge.
 1. Compute the permutation aggregation polynomial $z$.
-1. Commit (hidding) to the permutation aggregation polynomial $z$.
+1. Commit (hiding) to the permutation aggregation polynomial $z$.
 1. Absorb the permutation aggregation polynomial $z$ with the Fq-Sponge.
 1. Sample $\alpha'$ with the Fq-Sponge.
 1. Derive $\alpha$ from $\alpha'$ using the endomorphism (TODO: details)

kimchi/src/bench.rs

@@ -128,7 +128,7 @@ impl BenchmarkCtx {
     }
 }
 
-/// This function can be called before any call to a kimchi verfier,
+/// This function can be called before any call to a kimchi verifier,
 /// in which case it will serialise kimchi inputs so that they can be
 /// reused later for re-testing this particular prover. Used for
 /// serialising real mina circuits from ocaml and bindings side.

kimchi/src/prover.rs

@@ -292,7 +292,7 @@ where
         //~    This is why we need to absorb the commitment to the public polynomial at this point.
         absorb_commitment(&mut fq_sponge, &public_comm);
 
-        //~ 1. Commit to the witness columns by creating `COLUMNS` hidding commitments.
+        //~ 1. Commit to the witness columns by creating `COLUMNS` hiding commitments.
         //~
         //~    Note: since the witness is in evaluation form,
         //~    we can use the `commit_evaluation` optimization.
@@ -642,7 +642,7 @@ where
         internal_tracing::checkpoint!(internal_traces; z_permutation_aggregation_polynomial);
         let z_poly = index.perm_aggreg(&witness, &beta, &gamma, rng)?;
 
-        //~ 1. Commit (hidding) to the permutation aggregation polynomial $z$.
+        //~ 1. Commit (hiding) to the permutation aggregation polynomial $z$.
         let z_comm = index.srs.commit(&z_poly, num_chunks, rng);
 
         //~ 1. Absorb the permutation aggregation polynomial $z$ with the Fq-Sponge.

o1vm/src/pickles/lookup_prover.rs

@@ -4,7 +4,7 @@ use kimchi::{circuits::domains::EvaluationDomains, curve::KimchiCurve, plonk_spo
 use mina_poseidon::FqSponge;
 use o1_utils::ExtendedDensePolynomial;
 use poly_commitment::{commitment::absorb_commitment, ipa::SRS, OpenProof, SRS as _};
-//TODO Parralelize
+//TODO Parallelize
 //use rayon::prelude::*;
 use super::lookup_columns::{ELookup, LookupChallenges, LookupEvalEnvironment};
 use crate::pickles::lookup_columns::*;
@@ -54,7 +54,7 @@ where
     };
 
     // Compute the 1/beta+sum_i gamma^i value_i for each lookup term
-    // The inversions is commputed in batch in the end
+    // The inversions is computed in batch in the end
     let mut inverses: Vec<Vec<G::ScalarField>> = wires
         .iter()
         .zip(arity)
@@ -101,7 +101,7 @@ where
         .interpolate()
     };
     let columns_poly = columns.my_map(interpolate_col);
-    // Commiting
+    // Committing
     // TODO avoid cloning
     let columns_com = columns_poly
         .clone()
@@ -113,7 +113,7 @@ where
     let columns_eval_d8 = columns_poly
         .clone()
         .my_map(|poly| poly.evaluate_over_domain_by_ref(domain.d8));
-    // abosrbing commit
+    // absorbing commit
     // TODO don't absorb the wires which already have been
     // TODO avoid cloning
     columns_com

o1vm/src/pickles/lookup_verifier.rs

@@ -22,7 +22,7 @@ pub fn lookup_verify<
     EFqSponge: Clone + FqSponge<G::BaseField, G, G::ScalarField>,
     EFrSponge: FrSponge<G::ScalarField>,
 >(
-    // input dependant of main proto
+    // input dependent of main proto
     beta_challenge: G::ScalarField,
     gamma_challenge: G::ScalarField,
     constraint: ELookup<G::ScalarField>,

poly-commitment/src/ipa.rs

@@ -388,7 +388,7 @@ where
         self.h
     }
 
-    /// Turns a non-hiding polynomial commitment into a hidding polynomial
+    /// Turns a non-hiding polynomial commitment into a hiding polynomial
     /// commitment. Transforms each given `<a, G>` into `(<a, G> + wH, w)` with
     /// a random `w` per commitment.
     fn mask(

poly-commitment/src/lib.rs

@@ -45,7 +45,7 @@ pub trait SRS<G: CommitmentCurve>: Clone + Sized + Sync + Send {
         blinders: &PolyComm<G::ScalarField>,
     ) -> Result<BlindedCommitment<G>, CommitmentError>;
 
-    /// Turns a non-hiding polynomial commitment into a hidding polynomial
+    /// Turns a non-hiding polynomial commitment into a hiding polynomial
     /// commitment. Transforms each given `<a, G>` into `(<a, G> + wH, w)` with
     /// a random `w` per commitment.
     /// A [BlindedCommitment] object is returned instead of a PolyComm object to