Merge pull request #4377
654871dreplace ComputeMinWork with CheckMinWork (jtimon)b343c1aMove CBlockIndex::GetBlockWork() to pow::GetProofIncrement(nBits) (jtimon)c2c02f3Move UpdateTime to pow (jtimon)
This commit is contained in:
15
src/main.h
15
src/main.h
@@ -14,6 +14,7 @@
|
||||
#include "coins.h"
|
||||
#include "core.h"
|
||||
#include "net.h"
|
||||
#include "pow.h"
|
||||
#include "script.h"
|
||||
#include "sync.h"
|
||||
#include "txmempool.h"
|
||||
@@ -163,8 +164,6 @@ bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock, b
|
||||
bool ActivateBestChain(CValidationState &state, CBlock *pblock = NULL);
|
||||
int64_t GetBlockValue(int nHeight, int64_t nFees);
|
||||
|
||||
void UpdateTime(CBlockHeader& block, const CBlockIndex* pindexPrev);
|
||||
|
||||
/** Create a new block index entry for a given block hash */
|
||||
CBlockIndex * InsertBlockIndex(uint256 hash);
|
||||
/** Verify a signature */
|
||||
@@ -736,17 +735,7 @@ public:
|
||||
|
||||
uint256 GetBlockWork() const
|
||||
{
|
||||
uint256 bnTarget;
|
||||
bool fNegative;
|
||||
bool fOverflow;
|
||||
bnTarget.SetCompact(nBits, &fNegative, &fOverflow);
|
||||
if (fNegative || fOverflow || bnTarget == 0)
|
||||
return 0;
|
||||
// We need to compute 2**256 / (bnTarget+1), but we can't represent 2**256
|
||||
// as it's too large for a uint256. However, as 2**256 is at least as large
|
||||
// as bnTarget+1, it is equal to ((2**256 - bnTarget - 1) / (bnTarget+1)) + 1,
|
||||
// or ~bnTarget / (nTarget+1) + 1.
|
||||
return (~bnTarget / (bnTarget + 1)) + 1;
|
||||
return GetProofIncrement(nBits);
|
||||
}
|
||||
|
||||
enum { nMedianTimeSpan=11 };
|
||||
|
||||
Reference in New Issue
Block a user