diff --git a/src/linear_proof.rs b/src/linear_proof.rs
index 0f604f2d..5d47f171 100644
--- a/src/linear_proof.rs
+++ b/src/linear_proof.rs
@@ -15,7 +15,7 @@ use crate::errors::ProofError;
 use crate::inner_product_proof::inner_product;
 use crate::transcript::TranscriptProtocol;
 
-/// A linear proof, which is an "lightweight" version of a Bulletproofs inner-product proof
+/// A linear proof, which is a "lightweight" version of a Bulletproofs inner-product proof
 /// Protocol: Section E.3 of [GHL'21](https://eprint.iacr.org/2021/1397.pdf)
 ///
 /// Prove that <a, b> = c where a is secret and b is public.
diff --git a/src/r1cs/constraint_system.rs b/src/r1cs/constraint_system.rs
index cf327f26..af491d55 100644
--- a/src/r1cs/constraint_system.rs
+++ b/src/r1cs/constraint_system.rs
@@ -46,7 +46,7 @@ pub trait ConstraintSystem {
     ///
     /// This either allocates a new multiplier and returns its `left` variable,
     /// or returns a `right` variable of a multiplier previously allocated by this method.
-    /// The output of a multiplier is assigned on a even call, when `right` is assigned.
+    /// The output of a multiplier is assigned on an even call, when `right` is assigned.
     ///
     /// When CS is committed at the end of the first or second phase, the half-assigned multiplier
     /// has the `right` assigned to zero and all its variables committed.