chore: typo fix (arkworks-rs#753)

* mod and dense

* maptocurve

* qua_ext

Author: sqltrigger

ec/src/hashing/map_to_curve_hasher.rs

@@ -10,7 +10,7 @@ pub trait MapToCurve<T: CurveGroup>: Sized {
     /// Checks whether supplied parameters represent a valid map.
     fn check_parameters() -> Result<(), HashToCurveError>;
 
-    /// Map an arbitary field element to a corresponding curve point.
+    /// Map an arbitrary field element to a corresponding curve point.
     fn map_to_curve(point: T::BaseField) -> Result<T::Affine, HashToCurveError>;
 }
 

ec/src/models/bls12/mod.rs

@@ -88,7 +88,7 @@ pub trait Bls12Config: 'static + Sized {
     fn final_exponentiation(
         f: MillerLoopOutput<Bls12<Self>>,
     ) -> Option<PairingOutput<Bls12<Self>>> {
-        // Computing the final exponentation following
+        // Computing the final exponentiation following
         // https://eprint.iacr.org/2020/875
         // Adapted from the implementation in https://github.com/ConsenSys/gurvy/pull/29
 
@@ -111,7 +111,7 @@ pub trait Bls12Config: 'static + Sized {
             // r = f^((p^6 - 1)(p^2 + 1))
             r *= &f2;
 
-            // Hard part of the final exponentation:
+            // Hard part of the final exponentiation:
             // t[0].CyclotomicSquare(&result)
             let mut y0 = r.cyclotomic_square();
             // t[1].Expt(&result)

ff/src/fields/models/quadratic_extension.rs

@@ -35,7 +35,7 @@ pub trait QuadExtConfig: 'static + Send + Sync + Sized {
     /// we might see `BaseField == BasePrimeField`, it won't always hold true.
     /// E.g. for an extension tower: `BasePrimeField == Fp`, but `BaseField == Fp3`.
     type BaseField: Field<BasePrimeField = Self::BasePrimeField>;
-    /// The type of the coefficients for an efficient implemntation of the
+    /// The type of the coefficients for an efficient implementation of the
     /// Frobenius endomorphism.
     type FrobCoeff: Field;
 

poly/src/polynomial/univariate/dense.rs

@@ -77,7 +77,7 @@ impl<F: Field> DensePolynomial<F> {
 
         // run Horners method on each thread as follows:
         // 1) Split up the coefficients across each thread evenly.
-        // 2) Do polynomial evaluation via horner's method for the thread's coefficeints
+        // 2) Do polynomial evaluation via horner's method for the thread's coefficients
         // 3) Scale the result point^{thread coefficient start index}
         // Then obtain the final polynomial evaluation by summing each threads result.
         let result = self