scraper, project, superblock: Implement automated greylisting

src/Makefile.am

@@ -117,6 +117,7 @@ GRIDCOIN_CORE_H = \
     gridcoin/contract/registry.h \
     gridcoin/contract/registry_db.h \
     gridcoin/cpid.h \
+    gridcoin/fwd.h \
     gridcoin/gridcoin.h \
     gridcoin/magnitude.h \
     gridcoin/mrc.h \

src/chainparams.cpp

@@ -1,5 +1,6 @@
 // Copyright (c) 2010 Satoshi Nakamoto
 // Copyright (c) 2009-2020 The Bitcoin Core developers
+// Copyright (c) 2014-2025 The Gridcoin developers
 // Distributed under the MIT software license, see the accompanying
 // file COPYING or https://opensource.org/licenses/mit-license.php.
 
@@ -70,6 +71,8 @@ class CMainParams : public CChainParams {
         consensus.BlockV13Height = std::numeric_limits<int>::max();
         consensus.PollV3Height = 2671700;
         consensus.ProjectV2Height = 2671700;
+        consensus.ProjectV4Height = std::numeric_limits<int>::max();
+        consensus.SuperblockV3Height = std::numeric_limits<int>::max();
         // Immediately post zero payment interval fees 40% for mainnet
         consensus.InitialMRCFeeFractionPostZeroInterval = Fraction(2, 5);
         // Zero day interval is 14 days on mainnet
@@ -187,6 +190,8 @@ class CTestNetParams : public CChainParams {
         consensus.BlockV13Height = std::numeric_limits<int>::max();
         consensus.PollV3Height = 1944820;
         consensus.ProjectV2Height = 1944820;
+        consensus.ProjectV4Height = std::numeric_limits<int>::max();
+        consensus.SuperblockV3Height = std::numeric_limits<int>::max();
         // Immediately post zero payment interval fees 40% for testnet, the same as mainnet
         consensus.InitialMRCFeeFractionPostZeroInterval = Fraction(2, 5);
         // Zero day interval is 10 minutes on testnet. The very short interval facilitates testing.

src/chainparams.h

@@ -1,5 +1,6 @@
 // Copyright (c) 2009-2010 Satoshi Nakamoto
 // Copyright (c) 2009-2020 The Bitcoin Core developers
+// Copyright (c) 2014-2025 The Gridcoin developers
 // Distributed under the MIT software license, see the accompanying
 // file COPYING or https://opensource.org/licenses/mit-license.php.
 
@@ -170,6 +171,20 @@ inline bool IsProjectV2Enabled(int nHeight)
     return nHeight >= Params().GetConsensus().ProjectV2Height;
 }
 
+inline bool IsSuperblockV3Enabled(int nHeight)
+{
+    // The argument driven override temporarily here to facilitate testing.
+
+    return nHeight >= gArgs.GetArg("-superblockv3height", Params().GetConsensus().SuperblockV3Height);
+}
+
+inline bool IsProjectV4Enabled(int nHeight)
+{
+    // The argument driven override temporarily here to facilitate testing.
+
+    return nHeight >= gArgs.GetArg("-projectv4height", Params().GetConsensus().ProjectV4Height);
+}
+
 inline int GetSuperblockAgeSpacing(int nHeight)
 {
     return (fTestNet ? 86400 : (nHeight > 364500) ? 86400 : 43200);

src/consensus/params.h

@@ -1,5 +1,6 @@
 // Copyright (c) 2009-2010 Satoshi Nakamoto
 // Copyright (c) 2009-2019 The Bitcoin Core developers
+// Copyright (c) 2014-2025 The Gridcoin developers
 // Distributed under the MIT software license, see the accompanying
 // file COPYING or https://opensource.org/licenses/mit-license.php.
 
@@ -39,6 +40,12 @@ struct Params {
     int PollV3Height;
     /** Block height at which project v2 contracts are allowed */
     int ProjectV2Height;
+    /** Block height at which project v4 contracts are allowed */
+    int ProjectV4Height;
+    /**
+     * @brief Block height at which superblock v3 contracts are allowed/required
+     */
+    int SuperblockV3Height;
     /** The fraction of rewards taken as fees in an MRC after the zero payment interval. Only consesnus critical
       * at BlockV12Height or above.
       */

src/gridcoin/beacon.cpp

@@ -1,4 +1,4 @@
-// Copyright (c) 2014-2024 The Gridcoin developers
+// Copyright (c) 2014-2025 The Gridcoin developers
 // Distributed under the MIT/X11 software license, see the accompanying
 // file COPYING or https://opensource.org/licenses/mit-license.php.
 
@@ -1239,14 +1239,16 @@ void BeaconRegistry::Deactivate(const uint256 superblock_hash)
 //! \param recnum
 //! \param key_type
 //!
-template<> void BeaconRegistry::BeaconDB::HandleCurrentHistoricalEntries(GRC::BeaconRegistry::BeaconMap& entries,
-                                               GRC::BeaconRegistry::PendingBeaconMap& pending_entries,
+ template<> void BeaconRegistry::BeaconDB::HandleCurrentHistoricalEntries(GRC::BeaconRegistry::BeaconMap& entries,
+                                                               GRC::BeaconRegistry::PendingBeaconMap& pending_entries,
                                                                std::set<Beacon_ptr>& expired_entries,
-                                               const Beacon& entry,
-                                               entry_ptr& historical_entry_ptr,
-                                               const uint64_t& recnum,
-                                               const std::string& key_type)
-{
+                                                               GRC::BeaconRegistry::BeaconMap& first_entries,
+                                                               const Beacon& entry,
+                                                               entry_ptr& historical_entry_ptr,
+                                                               const uint64_t& recnum,
+                                                               const std::string& key_type,
+                                                               const bool& populate_first_entries)
+ {
     // Note that in this specialization, entry.m_cpid and entry.GetId() are used for the map keys. In the general template,
     // entry.Key() is used (which here is the same as entry.m_cpid). No generalized method to implement entry.PendingKey()
     // has been implemented up to this point, because the pending map is actually only used here in the beacon
@@ -1366,7 +1368,7 @@ template<> void BeaconRegistry::BeaconDB::HandleCurrentHistoricalEntries(GRC::Be
 
 int BeaconRegistry::Initialize()
 {
-    int height = m_beacon_db.Initialize(m_beacons, m_pending, m_expired_pending);
+    int height = m_beacon_db.Initialize(m_beacons, m_pending, m_expired_pending, m_beacon_first_entries, false);
 
     LogPrint(LogFlags::BEACON, "INFO: %s: m_beacon_db size after load: %u", __func__, m_beacon_db.size());
     LogPrint(LogFlags::BEACON, "INFO: %s: m_beacons size after load: %u", __func__, m_beacons.size());

src/gridcoin/beacon.h

@@ -1,4 +1,4 @@
-// Copyright (c) 2014-2024 The Gridcoin developers
+// Copyright (c) 2014-2025 The Gridcoin developers
 // Distributed under the MIT/X11 software license, see the accompanying
 // file COPYING or https://opensource.org/licenses/mit-license.php.
 
@@ -830,6 +830,8 @@ class BeaconRegistry : public IContractHandler
     //!
     std::set<Beacon_ptr> m_expired_pending;
 
+    BeaconMap m_beacon_first_entries {}; //!< Not used here. Only to satisfy the template.
+
     //!
     //! \brief The member variable that is the instance of the beacon database. This is private to the
     //! beacon registry and is only accessible by beacon registry functions.

src/gridcoin/contract/registry_db.h

@@ -1,4 +1,4 @@
-// Copyright (c) 2014-2024 The Gridcoin developers
+// Copyright (c) 2014-2025 The Gridcoin developers
 // Distributed under the MIT/X11 software license, see the accompanying
 // file COPYING or https://opensource.org/licenses/mit-license.php.
 
@@ -66,10 +66,14 @@ class RegistryDB
     //! specialization.
     //! \param expired_entries. The map of expired pending entries. This is not used in the general template, only in the
     //! beacons specialization.
+    //! \param first_entries: The map of the first entry for the given key. This is only currently used for the whitelist
+    //! (projects).
+    //!
+    //! \param populate_first_entries. This is a boolean that controls whether the first entries map is populated.
     //!
     //! \return block height up to and including which the entry records were stored.
     //!
-    int Initialize(M& entries, P& pending_entries, X& expired_entries)
+    int Initialize(M& entries, P& pending_entries, X& expired_entries, M& first_entries, const bool& populate_first_entries)
     {
         bool status = true;
         int height = 0;
@@ -173,8 +177,8 @@ class RegistryDB
             m_historical[iter.second.m_hash] = std::make_shared<E>(entry);
             entry_ptr& historical_entry_ptr = m_historical[iter.second.m_hash];
 
-            HandleCurrentHistoricalEntries(entries, pending_entries, expired_entries, entry,
-                                                historical_entry_ptr, recnum, key_type);
+            HandleCurrentHistoricalEntries(entries, pending_entries, expired_entries, first_entries, entry,
+                                                historical_entry_ptr, recnum, key_type, populate_first_entries);
 
             number_passivated += (uint64_t) HandlePreviousHistoricalEntries(historical_entry_ptr);
         } // storage_by_record_num iteration
@@ -198,14 +202,16 @@ class RegistryDB
     //!
     //! \param entries
     //! \param pending_entries
+    //! \param expired_entries
+    //! \param first_entries
     //! \param entry
     //! \param historical_entry_ptr
     //! \param recnum
     //! \param key_type
     //!
-    void HandleCurrentHistoricalEntries(M& entries, P& pending_entries, X& expired_entries, const E& entry,
+    void HandleCurrentHistoricalEntries(M& entries, P& pending_entries, X& expired_entries, M& first_entries, const E& entry,
                                         entry_ptr& historical_entry_ptr, const uint64_t& recnum,
-                                        const std::string& key_type)
+                                        const std::string& key_type, const bool& populate_first_entries)
     {
         // The unknown or out of bound status conditions should have never made it into leveldb to begin with, since
         // the entry contract will fail validation, but to be thorough, include the filter condition anyway.
@@ -226,6 +232,10 @@ class RegistryDB
 
             // Insert or replace the existing map entry with the latest.
             entries[entry.Key()] = historical_entry_ptr;
+
+            if (populate_first_entries && historical_entry_ptr->m_previous_hash.IsNull()) {
+                first_entries[entry.Key()] = historical_entry_ptr;
+            }
         }
     }
 

src/gridcoin/fwd.h

@@ -0,0 +1,38 @@
+// Copyright (c) 2014-2025 The Gridcoin developers
+// Distributed under the MIT/X11 software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+#ifndef GRIDCOIN_FWD_H
+#define GRIDCOIN_FWD_H
+
+namespace GRC
+{
+//!
+//! \brief Enumeration of project entry status. Unlike beacons this is for both storage
+//! and memory.
+//!
+//! UNKNOWN status is only encountered in trivially constructed empty
+//! project entries and should never be seen on the blockchain.
+//!
+//! DELETED status corresponds to a removed entry.
+//!
+//! ACTIVE corresponds to an active entry.
+//!
+//! GREYLISTED means that the project temporarily does not meet the whitelist qualification criteria.
+//!
+//! OUT_OF_BOUND must go at the end and be retained for the EnumBytes wrapper.
+//!
+enum class ProjectEntryStatus
+{
+    UNKNOWN,
+    DELETED,
+    ACTIVE,
+    MAN_GREYLISTED,
+    AUTO_GREYLISTED,
+    AUTO_GREYLIST_OVERRIDE,
+    OUT_OF_BOUND
+};
+} // namespace GRC
+
+#endif // GRIDCOIN_FWD_H
+