Merge pull request #2196 from stanlagermin/fix_typos

fix typos

Author: howardwu

algorithms/src/fft/polynomial/dense.rs

@@ -700,7 +700,7 @@ mod tests {
         multiplier.add_polynomial(a.clone(), "a");
         assert_eq!(multiplier.multiply().unwrap(), a);
 
-        // Note PolyMultiplier doesn't support a evluations with no polynomials
+        // Note PolyMultiplier doesn't support a evaluations with no polynomials
     }
 
     #[test]

algorithms/src/polycommit/error.rs

@@ -69,7 +69,7 @@ pub enum PCError {
     #[error("The degree provided to `trim` was too large.")]
     TrimmingDegreeTooLarge,
 
-    #[error("the eqaution \"{0}\" contained degree-bounded polynomials")]
+    #[error("the equation \"{0}\" contained degree-bounded polynomials")]
     EquationHasDegreeBounds(String),
 
     #[error("the degree bound ({0}) is not supported by the parameters")]

algorithms/src/polycommit/sonic_pc/polynomial.rs

@@ -223,7 +223,7 @@ impl<'a, F: PrimeField> LabeledPolynomialWithBasis<'a, F> {
             let mut lagrange_polys = HashMap::<usize, Vec<_>>::new();
             let mut dense_polys = HashMap::<_, DensePolynomial<F>>::new();
             let mut sparse_poly = SparsePolynomial::zero();
-            // We have sets of polynomials divided along three critera:
+            // We have sets of polynomials divided along three criteria:
             // 1. All `Lagrange` polynomials are in the set corresponding to their domain.
             // 2. All `Dense` polynomials are in the set corresponding to their degree bound.
             // 3. All `Sparse` polynomials are in the set corresponding to their degree bound.

curves/src/templates/bls12/bls12.rs

@@ -193,7 +193,7 @@ where
                 // r = f^((p^6 - 1)(p^2 + 1))
                 r *= &f2;
 
-                // Hard part of the final exponentation is below:
+                // Hard part of the final exponentiation is below:
                 // From https://eprint.iacr.org/2016/130.pdf, Table 1
                 let mut y0 = r.cyclotomic_square();
                 y0.conjugate();

synthesizer/process/src/stack/register_types/initialize.rs

@@ -34,7 +34,7 @@ impl<N: Network> RegisterTypes<N> {
 
         // Step 2. Check the instructions are well-formed.
         for instruction in closure.instructions() {
-            // Ensure the closure contains no aysnc instructions.
+            // Ensure the closure contains no async instructions.
             ensure!(instruction.opcode() != Opcode::Async, "An 'async' instruction is not allowed in closures");
             // Ensure the closure contains no call instructions.
             ensure!(instruction.opcode() != Opcode::Call, "A 'call' instruction is not allowed in closures");

synthesizer/process/src/tests/test_execute.rs

@@ -880,7 +880,7 @@ fn test_process_output_operand() {
     )
     .unwrap();
 
-    // Initalize the RNG.
+    // Initialize the RNG.
     let rng = &mut TestRng::default();
 
     // Initialize a new caller account.