chore: fix typos (#316)

src/gadgets/nonnative/bignat.rs

@@ -494,7 +494,7 @@ impl<Scalar: PrimeField> BigNat<Scalar> {
  })
  }
 
- /// Compute a `BigNat` contrained to be equal to `self * other % modulus`.
+ /// Compute a `BigNat` constrained to be equal to `self * other % modulus`.
  pub fn mult_mod<CS: ConstraintSystem<Scalar>>(
  &self,
  mut cs: CS,
@@ -565,7 +565,7 @@ impl<Scalar: PrimeField> BigNat<Scalar> {
  Ok((quotient, remainder))
  }
 
- /// Compute a `BigNat` contrained to be equal to `self * other % modulus`.
+ /// Compute a `BigNat` constrained to be equal to `self * other % modulus`.
  pub fn red_mod<CS: ConstraintSystem<Scalar>>(
  &self,
  mut cs: CS,

src/lib.rs

@@ -650,14 +650,14 @@ where
  let is_inputs_not_match = self.z0_primary != z0_primary || self.z0_secondary != z0_secondary;
 
  // check if the (relaxed) R1CS instances have two public outputs
- let is_instance_has_two_outpus = self.l_u_secondary.X.len() != 2
+ let is_instance_has_two_outputs = self.l_u_secondary.X.len() != 2
  || self.r_U_primary.X.len() != 2
  || self.r_U_secondary.X.len() != 2;
 
  if is_num_steps_zero
  || is_num_steps_not_match
  || is_inputs_not_match
- || is_instance_has_two_outpus
+ || is_instance_has_two_outputs
  {
  return Err(NovaError::ProofVerifyError);
  }

src/provider/non_hiding_kzg.rs

@@ -267,7 +267,7 @@ where
  }
 
  /// Generate a commitment for a polynomial
- /// Note that the scheme is not hidding
+ /// Note that the scheme is not hiding
  pub fn commit(
  prover_param: impl Borrow<KZGProverKey<E>>,
  poly: &UVKZGPoly<E::Fr>,

src/provider/non_hiding_zeromorph.rs

@@ -147,7 +147,7 @@ where
  }
 
  /// Generate a commitment for a polynomial
- /// Note that the scheme is not hidding
+ /// Note that the scheme is not hiding
  fn commit(
  pp: impl Borrow<ZMProverKey<E>>,
  poly: &MultilinearPolynomial<E::Fr>,