diff --git a/docs/content/en/_index.md b/docs/content/en/_index.md
index 115a0277..4274732a 100644
--- a/docs/content/en/_index.md
+++ b/docs/content/en/_index.md
@@ -30,5 +30,5 @@ It is named after the bridge outside the Google Cambridge office.
 
 ## Ongoing Security Reviews
 
-This project is currently undergoing two independent security reviews by panels of academic and industry experts in the field. Their reports will be made public on this repo when completed, targetted for Aug 1.
+This project is currently undergoing two independent security reviews by panels of academic and industry experts in the field. Their reports will be made public on this repo when completed, targeted for Aug 1.
 
diff --git a/lib/arrays/eqs.h b/lib/arrays/eqs.h
index 94b526ff..0b7b358e 100644
--- a/lib/arrays/eqs.h
+++ b/lib/arrays/eqs.h
@@ -61,7 +61,7 @@ class Eqs : public Dense<Field> {
   //
   // Several ways exist to compute ceil(a/b) given a primitive that
   // computes floor(a/b), such as the C++ unsigned division operator.
-  // The simplest one is floor((a+(b-1))/b), which potentally overflows.
+  // The simplest one is floor((a+(b-1))/b), which potentially overflows.
   // Another way is 1+floor((a-1)/b), which underflows for a==0 but
   // otherwise does not overflow.  More complicated ways exist that neither
   // overflow nor underflow.  Since the rest of the code assumes
diff --git a/lib/circuits/compiler/compiler.h b/lib/circuits/compiler/compiler.h
index 80db44dc..51e95f55 100644
--- a/lib/circuits/compiler/compiler.h
+++ b/lib/circuits/compiler/compiler.h
@@ -404,7 +404,7 @@ class QuadCircuit {
       if (n.info.is_output) {
         r = std::max<size_t>(r, 1 + n.info.depth);
       } else if (n.info.is_assert0) {
-        // Assertions of the form 0*(1*OP) contibute n.info.depth and
+        // Assertions of the form 0*(1*OP) contribute n.info.depth and
         // not 1 + n.info.depth.  If the assertion is in the last
         // layer, it will be transformed in an output of OP at
         // n.info.depth.  If the assertion is not in the last layer,
diff --git a/lib/circuits/mdoc/mdoc_revocation.h b/lib/circuits/mdoc/mdoc_revocation.h
index 12db3cee..d6f54574 100644
--- a/lib/circuits/mdoc/mdoc_revocation.h
+++ b/lib/circuits/mdoc/mdoc_revocation.h
@@ -48,7 +48,7 @@ class MdocRevocationList {
   const LogicCircuit& lc_;
 };
 
-// The second revocation approachs works for larger lists. In this case, the
+// The second revocation approach works for larger lists. In this case, the
 // prover retrieves a witness that their credential is *not* on the revoked
 // list by presenting a signature of the span (l,r) and proving that their
 // revocation identifier rev_id satisfied l < rev_id < r.
diff --git a/lib/circuits/mdoc/zk_spec.cc b/lib/circuits/mdoc/zk_spec.cc
index 1e348ec7..b27a3293 100644
--- a/lib/circuits/mdoc/zk_spec.cc
+++ b/lib/circuits/mdoc/zk_spec.cc
@@ -31,7 +31,7 @@ extern "C" {
 //   library).
 //   - circuit_hash - SHA265 hash of the output of generate_circuit() function,
 //   the circuit in compressed format. It's converted to a hex string. Every
-//   time the circuit changes, the hash must be manaully calculated and a new
+//   time the circuit changes, the hash must be manually calculated and a new
 //   ZKSpec added to this list.
 //   - num_attributes. number of attributes the circuit supports,
 //   - version. version of the ZK specification
diff --git a/lib/zk/zk_common.h b/lib/zk/zk_common.h
index b6d88d75..da139f39 100644
--- a/lib/zk/zk_common.h
+++ b/lib/zk/zk_common.h
@@ -305,7 +305,7 @@ class ZkCommon {
     //
     // The ZK verifier needs to compute linear combinations (and one
     // quadratic combination) of the X's, but it only has access to
-    // the Xhat's and to a committment to the dX's.  We also want to
+    // the Xhat's and to a commitment to the dX's.  We also want to
     // discuss the verifier algorithm as if the verifier were
     // operating on X, in order to keep the discussion simple.
     //