2014-03-10 16:46:53 +01:00
|
|
|
// Copyright (c) 2009-2010 Satoshi Nakamoto
|
2015-12-13 14:51:43 +01:00
|
|
|
// Copyright (c) 2009-2015 The Bitcoin Core developers
|
2014-12-13 05:09:33 +01:00
|
|
|
// Distributed under the MIT software license, see the accompanying
|
2014-03-10 16:46:53 +01:00
|
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
|
|
|
|
#include "pow.h"
|
|
|
|
|
2014-12-16 15:43:03 +01:00
|
|
|
#include "arith_uint256.h"
|
2014-10-22 01:31:01 +02:00
|
|
|
#include "chain.h"
|
2014-03-10 16:46:53 +01:00
|
|
|
#include "chainparams.h"
|
2014-11-18 22:03:02 +01:00
|
|
|
#include "primitives/block.h"
|
2014-03-10 16:46:53 +01:00
|
|
|
#include "uint256.h"
|
Split up util.cpp/h
Split up util.cpp/h into:
- string utilities (hex, base32, base64): no internal dependencies, no dependency on boost (apart from foreach)
- money utilities (parsesmoney, formatmoney)
- time utilities (gettime*, sleep, format date):
- and the rest (logging, argument parsing, config file parsing)
The latter is basically the environment and OS handling,
and is stripped of all utility functions, so we may want to
rename it to something else than util.cpp/h for clarity (Matt suggested
osinterface).
Breaks dependency of sha256.cpp on all the things pulled in by util.
2014-08-21 16:11:09 +02:00
|
|
|
#include "util.h"
|
2014-03-10 16:46:53 +01:00
|
|
|
|
2015-04-03 00:51:08 +02:00
|
|
|
#include <math.h>
|
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
unsigned int static KimotoGravityWell(const CBlockIndex* pindexLast, const Consensus::Params& params) {
|
2015-04-03 00:51:08 +02:00
|
|
|
const CBlockIndex *BlockLastSolved = pindexLast;
|
|
|
|
const CBlockIndex *BlockReading = pindexLast;
|
|
|
|
uint64_t PastBlocksMass = 0;
|
|
|
|
int64_t PastRateActualSeconds = 0;
|
|
|
|
int64_t PastRateTargetSeconds = 0;
|
|
|
|
double PastRateAdjustmentRatio = double(1);
|
2016-02-02 16:28:56 +01:00
|
|
|
arith_uint256 PastDifficultyAverage;
|
|
|
|
arith_uint256 PastDifficultyAveragePrev;
|
2015-04-03 00:51:08 +02:00
|
|
|
double EventHorizonDeviation;
|
|
|
|
double EventHorizonDeviationFast;
|
|
|
|
double EventHorizonDeviationSlow;
|
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
uint64_t pastSecondsMin = params.nPowTargetTimespan * 0.025;
|
|
|
|
uint64_t pastSecondsMax = params.nPowTargetTimespan * 7;
|
|
|
|
uint64_t PastBlocksMin = pastSecondsMin / params.nPowTargetSpacing;
|
|
|
|
uint64_t PastBlocksMax = pastSecondsMax / params.nPowTargetSpacing;
|
2015-04-03 00:51:08 +02:00
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
if (BlockLastSolved == NULL || BlockLastSolved->nHeight == 0 || (uint64_t)BlockLastSolved->nHeight < PastBlocksMin) { return UintToArith256(params.powLimit).GetCompact(); }
|
2015-04-03 00:51:08 +02:00
|
|
|
|
2015-05-01 19:17:14 +02:00
|
|
|
for (unsigned int i = 1; BlockReading && BlockReading->nHeight > 0; i++) {
|
|
|
|
if (PastBlocksMax > 0 && i > PastBlocksMax) { break; }
|
|
|
|
PastBlocksMass++;
|
|
|
|
|
|
|
|
PastDifficultyAverage.SetCompact(BlockReading->nBits);
|
|
|
|
if (i > 1) {
|
2016-02-02 16:28:56 +01:00
|
|
|
// handle negative arith_uint256
|
2015-05-01 19:17:14 +02:00
|
|
|
if(PastDifficultyAverage >= PastDifficultyAveragePrev)
|
|
|
|
PastDifficultyAverage = ((PastDifficultyAverage - PastDifficultyAveragePrev) / i) + PastDifficultyAveragePrev;
|
|
|
|
else
|
|
|
|
PastDifficultyAverage = PastDifficultyAveragePrev - ((PastDifficultyAveragePrev - PastDifficultyAverage) / i);
|
2015-04-03 00:51:08 +02:00
|
|
|
}
|
2015-05-01 19:17:14 +02:00
|
|
|
PastDifficultyAveragePrev = PastDifficultyAverage;
|
2015-04-03 00:51:08 +02:00
|
|
|
|
2015-05-01 19:17:14 +02:00
|
|
|
PastRateActualSeconds = BlockLastSolved->GetBlockTime() - BlockReading->GetBlockTime();
|
2016-02-02 16:28:56 +01:00
|
|
|
PastRateTargetSeconds = params.nPowTargetSpacing * PastBlocksMass;
|
2015-05-01 19:17:14 +02:00
|
|
|
PastRateAdjustmentRatio = double(1);
|
|
|
|
if (PastRateActualSeconds < 0) { PastRateActualSeconds = 0; }
|
2015-04-03 00:51:08 +02:00
|
|
|
if (PastRateActualSeconds != 0 && PastRateTargetSeconds != 0) {
|
2015-05-01 19:17:14 +02:00
|
|
|
PastRateAdjustmentRatio = double(PastRateTargetSeconds) / double(PastRateActualSeconds);
|
2015-04-03 00:51:08 +02:00
|
|
|
}
|
2015-05-01 19:17:14 +02:00
|
|
|
EventHorizonDeviation = 1 + (0.7084 * pow((double(PastBlocksMass)/double(28.2)), -1.228));
|
|
|
|
EventHorizonDeviationFast = EventHorizonDeviation;
|
|
|
|
EventHorizonDeviationSlow = 1 / EventHorizonDeviation;
|
|
|
|
|
|
|
|
if (PastBlocksMass >= PastBlocksMin) {
|
|
|
|
if ((PastRateAdjustmentRatio <= EventHorizonDeviationSlow) || (PastRateAdjustmentRatio >= EventHorizonDeviationFast))
|
|
|
|
{ assert(BlockReading); break; }
|
|
|
|
}
|
|
|
|
if (BlockReading->pprev == NULL) { assert(BlockReading); break; }
|
|
|
|
BlockReading = BlockReading->pprev;
|
|
|
|
}
|
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
arith_uint256 bnNew(PastDifficultyAverage);
|
2015-05-01 19:17:14 +02:00
|
|
|
if (PastRateActualSeconds != 0 && PastRateTargetSeconds != 0) {
|
|
|
|
bnNew *= PastRateActualSeconds;
|
|
|
|
bnNew /= PastRateTargetSeconds;
|
|
|
|
}
|
2015-04-03 00:51:08 +02:00
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
if (bnNew > UintToArith256(params.powLimit)) {
|
|
|
|
bnNew = UintToArith256(params.powLimit);
|
2015-04-03 00:51:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return bnNew.GetCompact();
|
|
|
|
}
|
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
unsigned int static DarkGravityWave(const CBlockIndex* pindexLast, const Consensus::Params& params) {
|
2016-01-31 14:11:16 +01:00
|
|
|
/* current difficulty formula, dash - DarkGravity v3, written by Evan Duffield - evan@dash.org */
|
2015-04-03 00:51:08 +02:00
|
|
|
const CBlockIndex *BlockLastSolved = pindexLast;
|
|
|
|
const CBlockIndex *BlockReading = pindexLast;
|
|
|
|
int64_t nActualTimespan = 0;
|
|
|
|
int64_t LastBlockTime = 0;
|
|
|
|
int64_t PastBlocksMin = 24;
|
|
|
|
int64_t PastBlocksMax = 24;
|
|
|
|
int64_t CountBlocks = 0;
|
2016-02-02 16:28:56 +01:00
|
|
|
arith_uint256 PastDifficultyAverage;
|
|
|
|
arith_uint256 PastDifficultyAveragePrev;
|
2015-04-03 00:51:08 +02:00
|
|
|
|
|
|
|
if (BlockLastSolved == NULL || BlockLastSolved->nHeight == 0 || BlockLastSolved->nHeight < PastBlocksMin) {
|
2016-02-02 16:28:56 +01:00
|
|
|
return UintToArith256(params.powLimit).GetCompact();
|
2015-04-03 00:51:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
for (unsigned int i = 1; BlockReading && BlockReading->nHeight > 0; i++) {
|
|
|
|
if (PastBlocksMax > 0 && i > PastBlocksMax) { break; }
|
|
|
|
CountBlocks++;
|
|
|
|
|
|
|
|
if(CountBlocks <= PastBlocksMin) {
|
|
|
|
if (CountBlocks == 1) { PastDifficultyAverage.SetCompact(BlockReading->nBits); }
|
2016-02-02 16:28:56 +01:00
|
|
|
else { PastDifficultyAverage = ((PastDifficultyAveragePrev * CountBlocks) + (arith_uint256().SetCompact(BlockReading->nBits))) / (CountBlocks + 1); }
|
2015-04-03 00:51:08 +02:00
|
|
|
PastDifficultyAveragePrev = PastDifficultyAverage;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(LastBlockTime > 0){
|
|
|
|
int64_t Diff = (LastBlockTime - BlockReading->GetBlockTime());
|
|
|
|
nActualTimespan += Diff;
|
|
|
|
}
|
|
|
|
LastBlockTime = BlockReading->GetBlockTime();
|
|
|
|
|
|
|
|
if (BlockReading->pprev == NULL) { assert(BlockReading); break; }
|
|
|
|
BlockReading = BlockReading->pprev;
|
|
|
|
}
|
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
arith_uint256 bnNew(PastDifficultyAverage);
|
2015-04-03 00:51:08 +02:00
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
int64_t _nTargetTimespan = CountBlocks * params.nPowTargetSpacing;
|
2015-04-03 00:51:08 +02:00
|
|
|
|
|
|
|
if (nActualTimespan < _nTargetTimespan/3)
|
|
|
|
nActualTimespan = _nTargetTimespan/3;
|
|
|
|
if (nActualTimespan > _nTargetTimespan*3)
|
|
|
|
nActualTimespan = _nTargetTimespan*3;
|
|
|
|
|
|
|
|
// Retarget
|
|
|
|
bnNew *= nActualTimespan;
|
|
|
|
bnNew /= _nTargetTimespan;
|
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
if (bnNew > UintToArith256(params.powLimit)){
|
|
|
|
bnNew = UintToArith256(params.powLimit);
|
2015-04-03 00:51:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return bnNew.GetCompact();
|
|
|
|
}
|
|
|
|
|
2015-02-15 02:21:42 +01:00
|
|
|
unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader *pblock, const Consensus::Params& params)
|
2014-03-10 16:46:53 +01:00
|
|
|
{
|
2015-04-03 00:51:08 +02:00
|
|
|
unsigned int retarget = DIFF_DGW;
|
2014-03-10 16:46:53 +01:00
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
if (Params().NetworkIDString() != CBaseChainParams::TESTNET) {
|
2015-04-03 00:51:08 +02:00
|
|
|
if (pindexLast->nHeight + 1 >= 34140) retarget = DIFF_DGW;
|
|
|
|
else if (pindexLast->nHeight + 1 >= 15200) retarget = DIFF_KGW;
|
|
|
|
else retarget = DIFF_BTC;
|
|
|
|
} else {
|
|
|
|
if (pindexLast->nHeight + 1 >= 2000) retarget = DIFF_DGW;
|
|
|
|
else retarget = DIFF_BTC;
|
|
|
|
}
|
2014-03-10 16:46:53 +01:00
|
|
|
|
2015-04-03 00:51:08 +02:00
|
|
|
// Default Bitcoin style retargeting
|
|
|
|
if (retarget == DIFF_BTC)
|
2014-03-10 16:46:53 +01:00
|
|
|
{
|
2016-02-02 16:28:56 +01:00
|
|
|
unsigned int nProofOfWorkLimit = UintToArith256(params.powLimit).GetCompact();
|
2015-04-03 00:51:08 +02:00
|
|
|
|
|
|
|
// Genesis block
|
|
|
|
if (pindexLast == NULL)
|
|
|
|
return nProofOfWorkLimit;
|
|
|
|
|
|
|
|
// Only change once per interval
|
2016-02-02 16:28:56 +01:00
|
|
|
if ((pindexLast->nHeight+1) % params.DifficultyAdjustmentInterval() != 0 != 0)
|
2014-03-10 16:46:53 +01:00
|
|
|
{
|
2016-02-02 16:28:56 +01:00
|
|
|
if (params.fPowAllowMinDifficultyBlocks)
|
2014-03-10 16:46:53 +01:00
|
|
|
{
|
2015-04-03 00:51:08 +02:00
|
|
|
// Special difficulty rule for testnet:
|
2015-05-01 19:17:14 +02:00
|
|
|
// If the new block's timestamp is more than 2* 2.5 minutes
|
2015-04-03 00:51:08 +02:00
|
|
|
// then allow mining of a min-difficulty block.
|
2016-02-02 16:28:56 +01:00
|
|
|
if (pblock->GetBlockTime() > pindexLast->GetBlockTime() + params.nPowTargetSpacing*2)
|
2015-04-03 00:51:08 +02:00
|
|
|
return nProofOfWorkLimit;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Return the last non-special-min-difficulty-rules-block
|
|
|
|
const CBlockIndex* pindex = pindexLast;
|
2016-02-02 16:28:56 +01:00
|
|
|
while (pindex->pprev && pindex->nHeight % params.DifficultyAdjustmentInterval() != 0 && pindex->nBits == nProofOfWorkLimit)
|
2015-04-03 00:51:08 +02:00
|
|
|
pindex = pindex->pprev;
|
|
|
|
return pindex->nBits;
|
|
|
|
}
|
2014-03-10 16:46:53 +01:00
|
|
|
}
|
2015-04-03 00:51:08 +02:00
|
|
|
return pindexLast->nBits;
|
2014-03-10 16:46:53 +01:00
|
|
|
}
|
|
|
|
|
2015-05-01 19:17:14 +02:00
|
|
|
// Go back by what we want to be 1 day worth of blocks
|
2016-02-02 16:28:56 +01:00
|
|
|
int nHeightFirst = pindexLast->nHeight - (params.DifficultyAdjustmentInterval()-1);
|
|
|
|
assert(nHeightFirst >= 0);
|
|
|
|
const CBlockIndex* pindexFirst = pindexLast->GetAncestor(nHeightFirst);
|
2015-04-03 00:51:08 +02:00
|
|
|
assert(pindexFirst);
|
2014-03-10 16:46:53 +01:00
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
return CalculateNextWorkRequired(pindexLast, pindexFirst->GetBlockTime(), params);
|
2015-04-03 00:51:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Retarget using Kimoto Gravity Wave
|
|
|
|
else if (retarget == DIFF_KGW)
|
|
|
|
{
|
2016-02-02 16:28:56 +01:00
|
|
|
return KimotoGravityWell(pindexLast, params);
|
2015-04-03 00:51:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Retarget using Dark Gravity Wave 3
|
|
|
|
else if (retarget == DIFF_DGW)
|
|
|
|
{
|
2016-02-02 16:28:56 +01:00
|
|
|
return DarkGravityWave(pindexLast, params);
|
2015-04-03 00:51:08 +02:00
|
|
|
}
|
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
return DarkGravityWave(pindexLast, params);
|
2014-03-10 16:46:53 +01:00
|
|
|
}
|
|
|
|
|
2016-02-02 16:28:56 +01:00
|
|
|
// for DIFF_BTC only!
|
2015-02-15 02:21:42 +01:00
|
|
|
unsigned int CalculateNextWorkRequired(const CBlockIndex* pindexLast, int64_t nFirstBlockTime, const Consensus::Params& params)
|
2015-02-21 13:57:44 +01:00
|
|
|
{
|
2015-10-19 14:25:29 +02:00
|
|
|
if (params.fPowNoRetargeting)
|
|
|
|
return pindexLast->nBits;
|
|
|
|
|
2014-03-10 16:46:53 +01:00
|
|
|
// Limit adjustment step
|
2015-02-21 13:57:44 +01:00
|
|
|
int64_t nActualTimespan = pindexLast->GetBlockTime() - nFirstBlockTime;
|
2014-03-10 16:46:53 +01:00
|
|
|
LogPrintf(" nActualTimespan = %d before bounds\n", nActualTimespan);
|
2015-02-15 02:21:42 +01:00
|
|
|
if (nActualTimespan < params.nPowTargetTimespan/4)
|
|
|
|
nActualTimespan = params.nPowTargetTimespan/4;
|
|
|
|
if (nActualTimespan > params.nPowTargetTimespan*4)
|
|
|
|
nActualTimespan = params.nPowTargetTimespan*4;
|
2014-03-10 16:46:53 +01:00
|
|
|
|
|
|
|
// Retarget
|
2015-03-25 20:00:32 +01:00
|
|
|
const arith_uint256 bnPowLimit = UintToArith256(params.powLimit);
|
2014-12-16 15:43:03 +01:00
|
|
|
arith_uint256 bnNew;
|
|
|
|
arith_uint256 bnOld;
|
2014-03-10 16:46:53 +01:00
|
|
|
bnNew.SetCompact(pindexLast->nBits);
|
|
|
|
bnOld = bnNew;
|
|
|
|
bnNew *= nActualTimespan;
|
2015-02-15 02:21:42 +01:00
|
|
|
bnNew /= params.nPowTargetTimespan;
|
2014-03-10 16:46:53 +01:00
|
|
|
|
2015-03-25 20:00:32 +01:00
|
|
|
if (bnNew > bnPowLimit)
|
|
|
|
bnNew = bnPowLimit;
|
2014-03-10 16:46:53 +01:00
|
|
|
|
|
|
|
/// debug print
|
|
|
|
LogPrintf("GetNextWorkRequired RETARGET\n");
|
2015-02-15 02:21:42 +01:00
|
|
|
LogPrintf("params.nPowTargetTimespan = %d nActualTimespan = %d\n", params.nPowTargetTimespan, nActualTimespan);
|
2014-03-10 16:46:53 +01:00
|
|
|
LogPrintf("Before: %08x %s\n", pindexLast->nBits, bnOld.ToString());
|
|
|
|
LogPrintf("After: %08x %s\n", bnNew.GetCompact(), bnNew.ToString());
|
|
|
|
|
|
|
|
return bnNew.GetCompact();
|
|
|
|
}
|
|
|
|
|
2015-02-15 02:21:42 +01:00
|
|
|
bool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params& params)
|
2014-03-10 16:46:53 +01:00
|
|
|
{
|
|
|
|
bool fNegative;
|
|
|
|
bool fOverflow;
|
2014-12-16 15:43:03 +01:00
|
|
|
arith_uint256 bnTarget;
|
2014-09-04 21:23:42 +02:00
|
|
|
|
2014-03-10 16:46:53 +01:00
|
|
|
bnTarget.SetCompact(nBits, &fNegative, &fOverflow);
|
|
|
|
|
|
|
|
// Check range
|
2015-03-25 20:00:32 +01:00
|
|
|
if (fNegative || bnTarget == 0 || fOverflow || bnTarget > UintToArith256(params.powLimit))
|
2015-01-08 11:44:25 +01:00
|
|
|
return error("CheckProofOfWork(): nBits below minimum work");
|
2014-03-10 16:46:53 +01:00
|
|
|
|
|
|
|
// Check proof of work matches claimed amount
|
2014-12-16 15:43:03 +01:00
|
|
|
if (UintToArith256(hash) > bnTarget)
|
2015-01-08 11:44:25 +01:00
|
|
|
return error("CheckProofOfWork(): hash doesn't match nBits");
|
2014-03-10 16:46:53 +01:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2014-12-16 15:43:03 +01:00
|
|
|
arith_uint256 GetBlockProof(const CBlockIndex& block)
|
2014-07-05 12:05:33 +02:00
|
|
|
{
|
2014-12-16 15:43:03 +01:00
|
|
|
arith_uint256 bnTarget;
|
2014-07-05 12:05:33 +02:00
|
|
|
bool fNegative;
|
|
|
|
bool fOverflow;
|
2014-10-29 17:00:02 +01:00
|
|
|
bnTarget.SetCompact(block.nBits, &fNegative, &fOverflow);
|
2014-07-05 12:05:33 +02:00
|
|
|
if (fNegative || fOverflow || bnTarget == 0)
|
|
|
|
return 0;
|
|
|
|
// We need to compute 2**256 / (bnTarget+1), but we can't represent 2**256
|
2014-12-16 15:43:03 +01:00
|
|
|
// as it's too large for a arith_uint256. However, as 2**256 is at least as large
|
2014-07-05 12:05:33 +02:00
|
|
|
// as bnTarget+1, it is equal to ((2**256 - bnTarget - 1) / (bnTarget+1)) + 1,
|
|
|
|
// or ~bnTarget / (nTarget+1) + 1.
|
|
|
|
return (~bnTarget / (bnTarget + 1)) + 1;
|
2014-03-10 16:46:53 +01:00
|
|
|
}
|
2015-03-17 14:35:59 +01:00
|
|
|
|
|
|
|
int64_t GetBlockProofEquivalentTime(const CBlockIndex& to, const CBlockIndex& from, const CBlockIndex& tip, const Consensus::Params& params)
|
|
|
|
{
|
|
|
|
arith_uint256 r;
|
|
|
|
int sign = 1;
|
|
|
|
if (to.nChainWork > from.nChainWork) {
|
|
|
|
r = to.nChainWork - from.nChainWork;
|
|
|
|
} else {
|
|
|
|
r = from.nChainWork - to.nChainWork;
|
|
|
|
sign = -1;
|
|
|
|
}
|
|
|
|
r = r * arith_uint256(params.nPowTargetSpacing) / GetBlockProof(tip);
|
|
|
|
if (r.bits() > 63) {
|
|
|
|
return sign * std::numeric_limits<int64_t>::max();
|
|
|
|
}
|
|
|
|
return sign * r.GetLow64();
|
|
|
|
}
|