diff --git a/CHANGELOG.md b/CHANGELOG.md
index 9188fcf..562a80d 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -133,7 +133,7 @@ and this library adheres to Rust's notion of
 ### Changed
 - MSRV is now 1.44.0.
 - `ff::Field::random<R: RngCore + ?Sized>(rng: &mut R) -> Self` has been changed
-  to `Field::random(rng: impl RngCore) -> Self`, to aligh with
+  to `Field::random(rng: impl RngCore) -> Self`, to align with
   `group::Group::random`.
 
 ### Removed
diff --git a/ff_derive/src/lib.rs b/ff_derive/src/lib.rs
index fbd7cae..30443ac 100644
--- a/ff_derive/src/lib.rs
+++ b/ff_derive/src/lib.rs
@@ -471,7 +471,7 @@ fn prime_field_constants_and_sqrt(
     let bytes = limbs * 8;
     let modulus_num_bits = biguint_num_bits(modulus.clone());
 
-    // The number of bits we should "shave" from a randomly sampled reputation, i.e.,
+    // The number of bits we should "shave" from a randomly sampled representation, i.e.,
     // if our modulus is 381 bits and our representation is 384 bits, we should shave
     // 3 bits from the beginning of a randomly sampled 384 bit representation to
     // reduce the cost of rejection sampling.
@@ -1381,7 +1381,7 @@ fn prime_field_impl(
             }
 
             /// Subtracts the modulus from this element if this element is not in the
-            /// field. Only used interally.
+            /// field. Only used internally.
             #[inline(always)]
             fn reduce(&mut self) {
                 if !self.is_valid() {
diff --git a/src/lib.rs b/src/lib.rs
index b2093b4..f9eee3c 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -358,7 +358,7 @@ pub trait PrimeField: Field + From<u64> {
 pub trait WithSmallOrderMulGroup<const N: u8>: PrimeField {
     /// A field element of small multiplicative order $N$.
     ///
-    /// The presense of this element allows you to perform (certain types of)
+    /// The presence of this element allows you to perform (certain types of)
     /// endomorphisms on some elliptic curves.
     ///
     /// It can be calculated using [SageMath] as