Fix typos

halo2_gadgets/src/utilities.rs

@@ -71,7 +71,7 @@ pub(crate) fn transpose_option_array<T: Copy + std::fmt::Debug, const LEN: usize
     ret
 }
 
-/// Checks that an expresssion is either 1 or 0.
+/// Checks that an expression is either 1 or 0.
 pub fn bool_check<F: FieldExt>(value: Expression<F>) -> Expression<F> {
     range_check(value, 2)
 }

halo2_proofs/src/circuit/floor_planner/v1.rs

@@ -22,7 +22,7 @@ mod strategy;
 ///   circuit designer.
 /// - A dual-pass layouter is used to measures regions prior to assignment.
 /// - Regions are measured as rectangles, bounded on the cells they assign.
-/// - Regions are layed out using a greedy first-fit strategy, after sorting regions by
+/// - Regions are laid out using a greedy first-fit strategy, after sorting regions by
 ///   their "advice area" (number of advice columns * rows).
 #[derive(Debug)]
 pub struct V1;

halo2_proofs/src/plonk/lookup/prover.rs

@@ -601,7 +601,7 @@ fn permute_expression_pair<C: CurveAffine, R: RngCore>(
         .zip(permuted_table_coeffs.iter_mut())
         .enumerate()
         .filter_map(|(row, (input_value, table_value))| {
-            // If this is the first occurence of `input_value` in the input expression
+            // If this is the first occurrence of `input_value` in the input expression
             if row == 0 || *input_value != permuted_input_expression[row - 1] {
                 *table_value = *input_value;
                 // Remove one instance of input_value from leftover_table_map

halo2_proofs/src/poly/evaluator.rs

@@ -287,7 +287,7 @@ pub(crate) enum Ast<E, F: Field, B: Basis> {
     Scale(Arc<Ast<E, F, B>>, F),
     /// The degree-1 term of a polynomial.
     ///
-    /// The field element is the coeffient of the term in the standard basis, not the
+    /// The field element is the coefficient of the term in the standard basis, not the
     /// coefficient basis.
     LinearTerm(F),
     /// The degree-0 term of a polynomial.