src/versionbits.cpp

   1 // Copyright (c) 2016 The Bitcoin Core developers
   2 // Distributed under the MIT software license, see the accompanying
   3 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
   4
   5 #include "versionbits.h"
   6 #include "consensus/params.h"
   7
   8 const struct VBDeploymentInfo VersionBitsDeploymentInfo[Consensus::MAX_VERSION_BITS_DEPLOYMENTS] = {
   9     {
  10         /*.name =*/ "testdummy",
  11         /*.gbt_force =*/ true,
  12     },
  13     {
  14         /*.name =*/ "csv",
  15         /*.gbt_force =*/ true,
  16     },
  17     {
  18         /*.name =*/ "segwit",
  19         /*.gbt_force =*/ true,
  20     }
  21 };
  22
  23 ThresholdState AbstractThresholdConditionChecker::GetStateFor(const CBlockIndex* pindexPrev, const Consensus::Params& params, ThresholdConditionCache& cache) const
  24 {
  25     int nPeriod = Period(params);
  26     int nThreshold = Threshold(params);
  27     int64_t nTimeStart = BeginTime(params);
  28     int64_t nTimeTimeout = EndTime(params);
  29
  30     // A block's state is always the same as that of the first of its period, so it is computed based on a pindexPrev whose height equals a multiple of nPeriod - 1.
  31     if (pindexPrev != NULL) {
  32         pindexPrev = pindexPrev->GetAncestor(pindexPrev->nHeight - ((pindexPrev->nHeight + 1) % nPeriod));
  33     }
  34
  35     // Walk backwards in steps of nPeriod to find a pindexPrev whose information is known
  36     std::vector<const CBlockIndex*> vToCompute;
  37     while (cache.count(pindexPrev) == 0) {
  38         if (pindexPrev == NULL) {
  39             // The genesis block is by definition defined.
  40             cache[pindexPrev] = THRESHOLD_DEFINED;
  41             break;
  42         }
  43         if (pindexPrev->GetMedianTimePast() < nTimeStart) {
  44             // Optimization: don't recompute down further, as we know every earlier block will be before the start time
  45             cache[pindexPrev] = THRESHOLD_DEFINED;
  46             break;
  47         }
  48         vToCompute.push_back(pindexPrev);
  49         pindexPrev = pindexPrev->GetAncestor(pindexPrev->nHeight - nPeriod);
  50     }
  51
  52     // At this point, cache[pindexPrev] is known
  53     assert(cache.count(pindexPrev));
  54     ThresholdState state = cache[pindexPrev];
  55
  56     // Now walk forward and compute the state of descendants of pindexPrev
  57     while (!vToCompute.empty()) {
  58         ThresholdState stateNext = state;
  59         pindexPrev = vToCompute.back();
  60         vToCompute.pop_back();
  61
  62         switch (state) {
  63             case THRESHOLD_DEFINED: {
  64                 if (pindexPrev->GetMedianTimePast() >= nTimeTimeout) {
  65                     stateNext = THRESHOLD_FAILED;
  66                 } else if (pindexPrev->GetMedianTimePast() >= nTimeStart) {
  67                     stateNext = THRESHOLD_STARTED;
  68                 }
  69                 break;
  70             }
  71             case THRESHOLD_STARTED: {
  72                 if (pindexPrev->GetMedianTimePast() >= nTimeTimeout) {
  73                     stateNext = THRESHOLD_FAILED;
  74                     break;
  75                 }
  76                 // We need to count
  77                 const CBlockIndex* pindexCount = pindexPrev;
  78                 int count = 0;
  79                 for (int i = 0; i < nPeriod; i++) {
  80                     if (Condition(pindexCount, params)) {
  81                         count++;
  82                     }
  83                     pindexCount = pindexCount->pprev;
  84                 }
  85                 if (count >= nThreshold) {
  86                     stateNext = THRESHOLD_LOCKED_IN;
  87                 }
  88                 break;
  89             }
  90             case THRESHOLD_LOCKED_IN: {
  91                 // Always progresses into ACTIVE.
  92                 stateNext = THRESHOLD_ACTIVE;
  93                 break;
  94             }
  95             case THRESHOLD_FAILED:
  96             case THRESHOLD_ACTIVE: {
  97                 // Nothing happens, these are terminal states.
  98                 break;
  99             }
 100         }
 101         cache[pindexPrev] = state = stateNext;
 102     }
 103
 104     return state;
 105 }
 106
 107 // return the numerical statistics of blocks signalling the specified BIP9 condition in this current period
 108 BIP9Stats AbstractThresholdConditionChecker::GetStateStatisticsFor(const CBlockIndex* pindex, const Consensus::Params& params) const
 109 {
 110     BIP9Stats stats;
 111
 112     stats.period = Period(params);
 113     stats.threshold = Threshold(params);
 114
 115     if (pindex == NULL)
 116         return stats;
 117
 118     // Find beginning of period
 119     const CBlockIndex* pindexEndOfPrevPeriod = pindex->GetAncestor(pindex->nHeight - ((pindex->nHeight + 1) % stats.period));
 120     stats.elapsed = pindex->nHeight - pindexEndOfPrevPeriod->nHeight;
 121
 122     // Count from current block to beginning of period
 123     int count = 0;
 124     const CBlockIndex* currentIndex = pindex;
 125     while (pindexEndOfPrevPeriod->nHeight != currentIndex->nHeight){
 126         if (Condition(currentIndex, params))
 127             count++;
 128         currentIndex = currentIndex->pprev;
 129     }
 130
 131     stats.count = count;
 132     stats.possible = (stats.period - stats.threshold ) >= (stats.elapsed - count);
 133
 134     return stats;
 135 }
 136
 137 int AbstractThresholdConditionChecker::GetStateSinceHeightFor(const CBlockIndex* pindexPrev, const Consensus::Params& params, ThresholdConditionCache& cache) const
 138 {
 139     const ThresholdState initialState = GetStateFor(pindexPrev, params, cache);
 140
 141     // BIP 9 about state DEFINED: "The genesis block is by definition in this state for each deployment."
 142     if (initialState == THRESHOLD_DEFINED) {
 143         return 0;
 144     }
 145
 146     const int nPeriod = Period(params);
 147
 148     // A block's state is always the same as that of the first of its period, so it is computed based on a pindexPrev whose height equals a multiple of nPeriod - 1.
 149     // To ease understanding of the following height calculation, it helps to remember that
 150     // right now pindexPrev points to the block prior to the block that we are computing for, thus:
 151     // if we are computing for the last block of a period, then pindexPrev points to the second to last block of the period, and
 152     // if we are computing for the first block of a period, then pindexPrev points to the last block of the previous period.
 153     // The parent of the genesis block is represented by NULL.
 154     pindexPrev = pindexPrev->GetAncestor(pindexPrev->nHeight - ((pindexPrev->nHeight + 1) % nPeriod));
 155
 156     const CBlockIndex* previousPeriodParent = pindexPrev->GetAncestor(pindexPrev->nHeight - nPeriod);
 157
 158     while (previousPeriodParent != NULL && GetStateFor(previousPeriodParent, params, cache) == initialState) {
 159         pindexPrev = previousPeriodParent;
 160         previousPeriodParent = pindexPrev->GetAncestor(pindexPrev->nHeight - nPeriod);
 161     }
 162
 163     // Adjust the result because right now we point to the parent block.
 164     return pindexPrev->nHeight + 1;
 165 }
 166
 167 namespace
 168 {
 169 /**
 170  * Class to implement versionbits logic.
 171  */
 172 class VersionBitsConditionChecker : public AbstractThresholdConditionChecker {
 173 private:
 174     const Consensus::DeploymentPos id;
 175
 176 protected:
 177     int64_t BeginTime(const Consensus::Params& params) const { return params.vDeployments[id].nStartTime; }
 178     int64_t EndTime(const Consensus::Params& params) const { return params.vDeployments[id].nTimeout; }
 179     int Period(const Consensus::Params& params) const { return params.nMinerConfirmationWindow; }
 180     int Threshold(const Consensus::Params& params) const { return params.nRuleChangeActivationThreshold; }
 181
 182     bool Condition(const CBlockIndex* pindex, const Consensus::Params& params) const
 183     {
 184         return (((pindex->nVersion & VERSIONBITS_TOP_MASK) == VERSIONBITS_TOP_BITS) && (pindex->nVersion & Mask(params)) != 0);
 185     }
 186
 187 public:
 188     VersionBitsConditionChecker(Consensus::DeploymentPos id_) : id(id_) {}
 189     uint32_t Mask(const Consensus::Params& params) const { return ((uint32_t)1) << params.vDeployments[id].bit; }
 190 };
 191
 192 }
 193
 194 ThresholdState VersionBitsState(const CBlockIndex* pindexPrev, const Consensus::Params& params, Consensus::DeploymentPos pos, VersionBitsCache& cache)
 195 {
 196     return VersionBitsConditionChecker(pos).GetStateFor(pindexPrev, params, cache.caches[pos]);
 197 }
 198
 199 BIP9Stats VersionBitsStatistics(const CBlockIndex* pindexPrev, const Consensus::Params& params, Consensus::DeploymentPos pos)
 200 {
 201     return VersionBitsConditionChecker(pos).GetStateStatisticsFor(pindexPrev, params);
 202 }
 203
 204 int VersionBitsStateSinceHeight(const CBlockIndex* pindexPrev, const Consensus::Params& params, Consensus::DeploymentPos pos, VersionBitsCache& cache)
 205 {
 206     return VersionBitsConditionChecker(pos).GetStateSinceHeightFor(pindexPrev, params, cache.caches[pos]);
 207 }
 208
 209 uint32_t VersionBitsMask(const Consensus::Params& params, Consensus::DeploymentPos pos)
 210 {
 211     return VersionBitsConditionChecker(pos).Mask(params);
 212 }
 213
 214 void VersionBitsCache::Clear()
 215 {
 216     for (unsigned int d = 0; d < Consensus::MAX_VERSION_BITS_DEPLOYMENTS; d++) {
 217         caches[d].clear();
 218     }
 219 }