diff --git a/src/test/app/CrossingLimits_test.cpp b/src/test/app/CrossingLimits_test.cpp
index 9e9b1a3d45..8c11dd6737 100644
--- a/src/test/app/CrossingLimits_test.cpp
+++ b/src/test/app/CrossingLimits_test.cpp
@@ -303,7 +303,7 @@ public:
             //     offers unfunded.
             //     b. Carol's remaining 800 offers are consumed as unfunded.
             //     c. 199 of alice's XRP(1) to USD(3) offers are consumed.
-            //        A book step is allowed to consume a maxium of 1000 offers
+            //        A book step is allowed to consume a maximum of 1000 offers
             //        at a given quality, and that limit is now reached.
             //     d. Now the strand is dry, even though there are still funded
             //     XRP(1) to USD(3) offers available.
@@ -384,7 +384,7 @@ public:
             //     offers unfunded.
             //     b. Carol's remaining 800 offers are consumed as unfunded.
             //     c. 199 of alice's XRP(1) to USD(3) offers are consumed.
-            //        A book step is allowed to consume a maxium of 1000 offers
+            //        A book step is allowed to consume a maximum of 1000 offers
             //        at a given quality, and that limit is now reached.
             //     d. Now the strand is dry, even though there are still funded
             //     XRP(1) to USD(3) offers available. Bob has spent 400 EUR and
diff --git a/src/test/app/Offer_test.cpp b/src/test/app/Offer_test.cpp
index 1117510a45..46a2cabec1 100644
--- a/src/test/app/Offer_test.cpp
+++ b/src/test/app/Offer_test.cpp
@@ -1298,7 +1298,7 @@ public:
     testNegativeBalance(FeatureBitset features)
     {
         // This test creates an offer test for negative balance
-        // with transfer fees and miniscule funds.
+        // with transfer fees and minuscule funds.
         testcase("Negative Balance");
 
         using namespace jtx;
diff --git a/src/test/app/RCLValidations_test.cpp b/src/test/app/RCLValidations_test.cpp
index a4f0d6a7cb..729f373738 100644
--- a/src/test/app/RCLValidations_test.cpp
+++ b/src/test/app/RCLValidations_test.cpp
@@ -254,7 +254,7 @@ class RCLValidations_test : public beast::unit_test::suite
         BEAST_EXPECT(trie.branchSupport(ledg_258) == 4);
 
         // Move three of the s258 ledgers to s259, which splits the trie
-        // due to the 256 ancestory limit
+        // due to the 256 ancestry limit
         BEAST_EXPECT(trie.remove(ledg_258, 3));
         trie.insert(ledg_259, 3);
         trie.getPreferred(1);
@@ -275,7 +275,7 @@ class RCLValidations_test : public beast::unit_test::suite
         // then verify the remove call works
         // past bug: remove had assumed the first child of a node in the trie
         //      which matches is the *only* child in the trie which matches.
-        //      This is **NOT** true with the limited 256 ledger ancestory
+        //      This is **NOT** true with the limited 256 ledger ancestry
         //      quirk of RCLValidation and prevents deleting the old support
         //      for ledger 257
 
diff --git a/src/test/app/TxQ_test.cpp b/src/test/app/TxQ_test.cpp
index 3e19fc2842..f6ab13e04f 100644
--- a/src/test/app/TxQ_test.cpp
+++ b/src/test/app/TxQ_test.cpp
@@ -3821,7 +3821,7 @@ public:
             return result;
         };
 
-        testcase("straightfoward positive case");
+        testcase("straightforward positive case");
         {
             // Queue up some transactions at a too-low fee.
             auto aliceSeq = env.seq(alice);
diff --git a/src/test/csf/Histogram.h b/src/test/csf/Histogram.h
index b55af34846..e32fded2f2 100644
--- a/src/test/csf/Histogram.h
+++ b/src/test/csf/Histogram.h
@@ -18,14 +18,14 @@ namespace csf {
       - Comparison : T a, b;  bool res = a < b
       - Addition: T a, b; T c = a + b;
       - Multiplication : T a, std::size_t b; T c = a * b;
-      - Divison: T a; std::size_t b;  T c = a/b;
+      - Division: T a; std::size_t b;  T c = a/b;
 
 
 */
 template <class T, class Compare = std::less<T>>
 class Histogram
 {
-    // TODO: Consider logarithimic bins around expected median if this becomes
+    // TODO: Consider logarithmic bins around expected median if this becomes
     // unscaleable
     std::map<T, std::size_t, Compare> counts_;
     std::size_t samples = 0;
diff --git a/src/test/csf/submitters.h b/src/test/csf/submitters.h
index 8a3632eb97..0c5d46e075 100644
--- a/src/test/csf/submitters.h
+++ b/src/test/csf/submitters.h
@@ -31,7 +31,7 @@ struct Rate
 /** Submits transactions to a specified peer
 
     Submits successive transactions beginning at start, then spaced according
-    to succesive calls of distribution(), until stop.
+    to successive calls of distribution(), until stop.
 
     @tparam Distribution is a `UniformRandomBitGenerator` from the STL that
             is used by random distributions to generate random samples
diff --git a/src/xrpld/rpc/detail/TransactionSign.cpp b/src/xrpld/rpc/detail/TransactionSign.cpp
index 252e5fc91e..a4ac32ee17 100644
--- a/src/xrpld/rpc/detail/TransactionSign.cpp
+++ b/src/xrpld/rpc/detail/TransactionSign.cpp
@@ -277,7 +277,7 @@ checkPayment(
                     app);
                 if (pf.findPaths(app.config().PATH_SEARCH_OLD))
                 {
-                    // 4 is the maxium paths
+                    // 4 is the maximum paths
                     pf.computePathRanks(4);
                     STPath fullLiquidityPath;
                     STPathSet paths;