15 assert(pindexLast !=
nullptr);
27 return nProofOfWorkLimit;
33 pindex = pindex->
pprev;
37 return pindexLast->
nBits;
52 return pindexLast->
nBits;
55 int64_t nActualTimespan = pindexLast->
GetBlockTime() - nFirstBlockTime;
65 bnNew *= nActualTimespan;
68 if (bnNew > bnPowLimit)
80 bnTarget.
SetCompact(nBits, &fNegative, &fOverflow);
int64_t GetBlockTime() const
int64_t nPowTargetTimespan
CBlockIndex * pprev
pointer to the index of the predecessor of this block
bool fPowAllowMinDifficultyBlocks
unsigned int CalculateNextWorkRequired(const CBlockIndex *pindexLast, int64_t nFirstBlockTime, const Consensus::Params ¶ms)
uint32_t GetCompact(bool fNegative=false) const
arith_uint256 UintToArith256(const uint256 &a)
uint256 powLimit
Proof of work parameters.
unsigned int GetNextWorkRequired(const CBlockIndex *pindexLast, const CBlockHeader *pblock, const Consensus::Params ¶ms)
int64_t nPowTargetSpacing
Parameters that influence chain consensus.
bool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params ¶ms)
Check whether a block hash satisfies the proof-of-work requirement specified by nBits.
256-bit unsigned big integer.
int64_t DifficultyAdjustmentInterval() const
The block chain is a tree shaped structure starting with the genesis block at the root...
arith_uint256 & SetCompact(uint32_t nCompact, bool *pfNegative=nullptr, bool *pfOverflow=nullptr)
The "compact" format is a representation of a whole number N using an unsigned 32bit number similar t...
int nHeight
height of the entry in the chain. The genesis block has height 0
CBlockIndex * GetAncestor(int height)
Efficiently find an ancestor of this block.