Linter spellcheck corrections

src/gridcoin/beacon.cpp

@@ -1313,7 +1313,7 @@ template<> void BeaconRegistry::BeaconDB::HandleCurrentHistoricalEntries(GRC::Be
     }
 
     if (entry.m_status == BeaconStatusForStorage::ACTIVE) {
-        // Note that in the orginal activation, all the activations happen for a superblock, and then the expired_entry set is
+        // Note that in the original activation, all the activations happen for a superblock, and then the expired_entry set is
         // cleared and then new expired entries recorded from the just committed SB. This method operates at the record level, but
         // clearing the expired_entries for each ACTIVE record posting will achieve the same effect, because the entries are ordered
         // the proper way. It is a little bit of undesired work, but it is not worth the complexity of feeding the boundaries

src/gridcoin/contract/registry_db.h

@@ -64,7 +64,7 @@ class RegistryDB
     //! \param entries The map of current entries.
     //! \param pending_entries. The map of pending entries. This is not used in the general template, only in the beacons
     //! specialization.
-    //! \param expired_entries. The map of expired pending entries. This is not used in the geenral template, only in the
+    //! \param expired_entries. The map of expired pending entries. This is not used in the general template, only in the
     //! beacons specialization.
     //!
     //! \return block height up to and including which the entry records were stored.
@@ -230,7 +230,7 @@ class RegistryDB
     }
 
     //!
-    //! \brief Handles the passivation of previous historical entries that have been superceded by current entries.
+    //! \brief Handles the passivation of previous historical entries that have been superseded by current entries.
     //!
     //! \param historical_entry_ptr. Shared smart pointer to current historical entry already inserted into historical map.
     //!

src/gridcoin/md5.c

@@ -6,7 +6,7 @@
  * The implementation was written so as to conform with Netscapes SSL.
  *
  * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
+ * the following conditions are adhered to.  The following conditions
  * apply to all code found in this distribution, be it the RC4, RSA,
  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
  * included with this distribution is covered by the same copyright terms
@@ -31,7 +31,7 @@
  *    must display the following acknowledgement:
  *    "This product includes cryptographic software written by
  *     Eric Young ([email protected])"
- *    The word 'cryptographic' can be left out if the rouines from the library
+ *    The word 'cryptographic' can be left out if the routines from the library
  *    being used are not cryptographic related :-).
  * 4. If you include any Windows specific code (or a derivative thereof) from
  *    the apps directory (application code) you must include an acknowledgement:
@@ -49,7 +49,7 @@
  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  * SUCH DAMAGE.
  *
- * The licence and distribution terms for any publically available version or
+ * The licence and distribution terms for any publicly available version or
  * derivative of this code cannot be changed.  i.e. this code cannot simply be
  * copied and put under another distribution licence
  * [including the GNU Public Licence.] */
@@ -244,7 +244,7 @@ uint8_t *GRC__MD5(const uint8_t *data, size_t len, uint8_t out[MD5_DIGEST_LENGTH
 
 // As pointed out by Wei Dai <[email protected]>, the above can be
 // simplified to the code below.  Wei attributes these optimizations
-// to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
+// to Peter Gutmann's SSH code, and he attributes it to Rich Schroeppel.
 #define F(b, c, d) ((((c) ^ (d)) & (b)) ^ (d))
 #define G(b, c, d) ((((b) ^ (c)) & (d)) ^ (c))
 #define H(b, c, d) ((b) ^ (c) ^ (d))

src/gridcoin/quorum.cpp

@@ -721,7 +721,7 @@ class SuperblockValidator
         std::vector<ResolvedPart> m_resolved_parts;
 
         //!
-        //! \brief Divisor set by the \c ProjectCombiner for iteraton over each
+        //! \brief Divisor set by the \c ProjectCombiner for iteration over each
         //! convergence combination.
         //!
         size_t m_combiner_mask;

src/gridcoin/scraper/scraper.cpp

@@ -208,7 +208,7 @@ std::map<uint256, std::shared_ptr<CScraperManifest>> CScraperManifest::mapManife
 ConvergedScraperStats ConvergedScraperStatsCache GUARDED_BY(cs_ConvergedScraperStatsCache) = {};
 
 /**
- * @brief Scraper loggger function
+ * @brief Scraper logger function
  * @param eType
  * @param sCall
  * @param sMessage

src/gridcoin/sidestake.h

@@ -45,7 +45,7 @@ class Allocation : public Fraction
 
     //!
     //! \brief Allocations extend the Fraction class and can also represent the result of the allocation constructed fraction
-    //! and the result of the muliplication of that fraction times the reward, which is in CAmount (i.e. int64_t).
+    //! and the result of the multiplication of that fraction times the reward, which is in CAmount (i.e. int64_t).
     //!
     //! \return CAmount of the Fraction representation of the actual allocation.
     //!

src/miner.cpp

@@ -939,7 +939,7 @@ void SplitCoinStakeOutput(CBlock &blocknew, int64_t &nReward, bool &fEnableStake
     CScript SideStakeScriptPubKey;
     GRC::Allocation SumAllocation;
 
-    // Lambda for sidestake allocation. This iterates throught the provided sidestake vector until either all elements processed,
+    // Lambda for sidestake allocation. This iterates through the provided sidestake vector until either all elements processed,
     // the maximum number of sidestake outputs is reached via the provided output_limit, or accumulated allocation will exceed 100%.
     const auto allocate_sidestakes = [&](SideStakeAlloc sidestakes, unsigned int output_limit) {
         for (auto iterSideStake = sidestakes.begin();

src/qt/transactiontablemodel.cpp

@@ -216,7 +216,7 @@ class TransactionTablePriv
             //
             // If a status update is needed (blocks came in since last check),
             //  update the status of this transaction from the wallet. Otherwise,
-            // simply re-use the cached status.
+            // simply reuse the cached status.
             TRY_LOCK(cs_main, lockMain);
             if(lockMain)
             {

src/random.h

@@ -100,7 +100,7 @@ constexpr auto GetRandMillis = GetRandomDuration<std::chrono::milliseconds>;
  * is memoryless and should be used for repeated network events (e.g. sending a
  * certain type of message) to minimize leaking information to observers.
  *
- * The probability of an event occuring before time x is 1 - e^-(x/a) where a
+ * The probability of an event occurring before time x is 1 - e^-(x/a) where a
  * is the average interval between events.
  * */
 std::chrono::microseconds GetExponentialRand(std::chrono::microseconds now, std::chrono::seconds average_interval);

src/script.cpp

@@ -1102,7 +1102,7 @@ class CSignatureCache
         {
             // Evict a random entry. Random because that helps
             // foil would-be DoS attackers who might try to pre-generate
-            // and re-use a set of valid signatures just-slightly-greater
+            // and reuse a set of valid signatures just-slightly-greater
             // than our cache size.
             uint256 randomHash = GetRandHash();
             std::vector<unsigned char> unused;

src/test/dos_tests.cpp

@@ -185,7 +185,7 @@ BOOST_AUTO_TEST_CASE(DoS_mapOrphans)
             tx.vin[j].prevout.hash = txPrev.GetHash();
         }
         BOOST_CHECK(SignSignature(keystore, txPrev, tx, 0));
-        // Re-use same signature for other inputs
+        // Reuse same signature for other inputs
         // (they don't have to be valid for this test)
         for (unsigned int j = 1; j < tx.vin.size(); j++)
             tx.vin[j].scriptSig = tx.vin[0].scriptSig;

src/test/script_tests.cpp

@@ -282,7 +282,7 @@ BOOST_AUTO_TEST_CASE(script_CHECKMULTISIG23)
     BOOST_CHECK(VerifyScript(goodsig3, scriptPubKey23, txTo23, 0, 0));
 
     keys.clear();
-    keys.push_back(key2); keys.push_back(key2); // Can't re-use sig
+    keys.push_back(key2); keys.push_back(key2); // Can't reuse sig
     CScript badsig1 = sign_multisig(scriptPubKey23, keys, txTo23);
     BOOST_CHECK(!VerifyScript(badsig1, scriptPubKey23, txTo23, 0, 0));
 

src/test/xxd/xxd.c

@@ -36,7 +36,7 @@
  *  7.06.96 -i printed 'int' instead of 'char'. *blush*
  *	    added Bram's OS2 ifdefs...
  * 18.07.96 gcc -Wall @ SunOS4 is now silent.
- *	    Added osver for MSDOS/DJGPP/WIN32.
+ *	    Added osver for MS-DOS/DJGPP/WIN32.
  * 29.08.96 Added size_t to strncmp() for Amiga.
  * 24.03.97 Windows NT support (Phil Hanna). Clean exit for Amiga WB (Bram)
  * 02.04.97 Added -E option, to have EBCDIC translation instead of ASCII

src/util.h

@@ -168,7 +168,7 @@ inline int64_t abs64(int64_t n)
 //! implementations.
 //!
 //! In particular this class is used for sidestake allocations, both the allocation "percentage", and the CAmount allocations
-//! resulting from muliplying the allocation (fraction) times the CAmount rewards.
+//! resulting from multiplying the allocation (fraction) times the CAmount rewards.
 //!
 class Fraction {
 public:

test/lint/lint-spelling.ignore-words.txt

@@ -27,3 +27,4 @@ smoe
 sur
 clen
 siz
+anull