chore(all):fix typos (#268)

* Update mod.rs

* Update mod.rs

* Update fixed_base.rs

* Update mod.rs

* Update bytes.rs

halo2-base/src/poseidon/hasher/mod.rs

@@ -243,7 +243,7 @@ impl<F: ScalarField, const T: usize, const RATE: usize> PoseidonHasher<F, T, RAT
             let is_full = gate.is_equal(ctx, input.len, Constant(F::from(RATE as u64)));
             // Case 1: if len != RATE.
             state.permutation(ctx, gate, &input.inputs, Some(input.len), &self.spec);
-            // Case 2: if len == RATE, an extra permuation is needed for squeeze.
+            // Case 2: if len == RATE, an extra permutation is needed for squeeze.
             let mut state_2 = state.clone();
             state_2.permutation(ctx, gate, &[], None, &self.spec);
             // Select the result of case 1/2 depending on if len == RATE.

halo2-base/src/safe_types/tests/bytes.rs

@@ -16,7 +16,7 @@ use rand::rngs::OsRng;
 use std::vec;
 use test_case::test_case;
 
-// =========== Utilies ===============
+// =========== Utilities ===============
 fn mock_circuit_test<FM: FnMut(&mut Context<Fr>, SafeTypeChip<'_, Fr>)>(mut f: FM) {
     base_test().k(10).lookup_bits(8).run(|ctx, range| {
         let safe = SafeTypeChip::new(range);

halo2-base/src/utils/mod.rs

@@ -62,7 +62,7 @@ pub trait ScalarField: PrimeField + FromUniformBytes<64> + From<bool> + Hash + O
     /// Creates a field element from a little endian byte representation.
     ///
     /// The default implementation assumes that `PrimeField::from_repr` is implemented for little-endian.
-    /// It should be overriden if this is not the case.
+    /// It should be overridden if this is not the case.
     fn from_bytes_le(bytes: &[u8]) -> Self {
         let mut repr = Self::Repr::default();
         repr.as_mut()[..bytes.len()].copy_from_slice(bytes);

halo2-ecc/src/ecc/fixed_base.rs

@@ -208,7 +208,7 @@ where
         },
     );
     let ctx = builder.main();
-    // sum `scalar_mults` but take into account possiblity of identity points
+    // sum `scalar_mults` but take into account possibility of identity points
     let any_point2 = chip.load_random_point::<C>(ctx);
     let mut acc = any_point2.clone();
     for point in scalar_mults {

halo2-ecc/src/ecc/mod.rs

@@ -1090,7 +1090,7 @@ where
             if radix == 0 {
                 radix = 1;
             }*/
-            // guessing that is is always better to use parallelism for >25 points
+            // guessing that is always better to use parallelism for >25 points
             pippenger::multi_exp_par::<F, FC, C>(
                 self.field_chip,
                 builder,