724 lines
25 KiB
C++
724 lines
25 KiB
C++
// Copyright (c) 2009-2010 Satoshi Nakamoto
|
|
// Copyright (c) 2009-2015 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include "miner.h"
|
|
|
|
#include "amount.h"
|
|
#include "chain.h"
|
|
#include "chainparams.h"
|
|
#include "coins.h"
|
|
#include "consensus/consensus.h"
|
|
#include "consensus/merkle.h"
|
|
#include "consensus/validation.h"
|
|
#include "crypto/scrypt.h"
|
|
#include "hash.h"
|
|
#include "main.h"
|
|
#include "net.h"
|
|
#include "policy/policy.h"
|
|
#include "pos.h"
|
|
#include "pow.h"
|
|
#include "primitives/transaction.h"
|
|
#include "script/standard.h"
|
|
#include "timedata.h"
|
|
#include "txmempool.h"
|
|
#include "util.h"
|
|
#include "utilmoneystr.h"
|
|
#include "validationinterface.h"
|
|
#include "wallet/wallet.h"
|
|
|
|
#include <boost/thread.hpp>
|
|
#include <boost/tuple/tuple.hpp>
|
|
#include <queue>
|
|
|
|
using namespace std;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// BitcoinMiner
|
|
//
|
|
|
|
//
|
|
// Unconfirmed transactions in the memory pool often depend on other
|
|
// transactions in the memory pool. When we select transactions from the
|
|
// pool, we select by highest priority or fee rate, so we might consider
|
|
// transactions that depend on transactions that aren't yet in the block.
|
|
|
|
uint64_t nLastBlockTx = 0;
|
|
uint64_t nLastBlockSize = 0;
|
|
int64_t nLastCoinStakeSearchInterval = 0;
|
|
unsigned int nMinerSleep = 500;
|
|
|
|
class ScoreCompare
|
|
{
|
|
public:
|
|
ScoreCompare() {}
|
|
|
|
bool operator()(const CTxMemPool::txiter a, const CTxMemPool::txiter b)
|
|
{
|
|
return CompareTxMemPoolEntryByScore()(*b,*a); // Convert to less than
|
|
}
|
|
};
|
|
|
|
int64_t UpdateTime(CBlock* pblock, const Consensus::Params& consensusParams, const CBlockIndex* pindexPrev)
|
|
{
|
|
int64_t nOldTime = pblock->nTime;
|
|
int64_t nNewTime = std::max(pindexPrev->GetPastTimeLimit()+1, GetAdjustedTime());
|
|
|
|
if (nOldTime < nNewTime)
|
|
pblock->nTime = nNewTime;
|
|
|
|
// Updating time can change work required on testnet:
|
|
if (consensusParams.fPowAllowMinDifficultyBlocks)
|
|
pblock->nBits = GetNextTargetRequired(pindexPrev, pblock, pblock->IsProofOfStake(),consensusParams);
|
|
|
|
|
|
return nNewTime - nOldTime;
|
|
}
|
|
|
|
// miner's coin base reward (POW)
|
|
CAmount GetProofOfWorkReward()
|
|
{
|
|
CAmount nSubsidy = 10000 * COIN;
|
|
|
|
return nSubsidy;
|
|
}
|
|
|
|
int64_t GetMaxTransactionTime(CBlock* pblock)
|
|
{
|
|
int64_t maxTransactionTime = 0;
|
|
for (std::vector<CTransaction>::const_iterator it(pblock->vtx.begin()); it != pblock->vtx.end(); ++it)
|
|
maxTransactionTime = std::max(maxTransactionTime, (int64_t)it->nTime);
|
|
return maxTransactionTime;
|
|
}
|
|
|
|
CBlockTemplate* CreateNewBlock(const CChainParams& chainparams, const CScript& scriptPubKeyIn, int64_t* pFees, bool fProofOfStake)
|
|
{
|
|
// Create new block
|
|
std::unique_ptr<CBlockTemplate> pblocktemplate(new CBlockTemplate());
|
|
if(!pblocktemplate.get())
|
|
return NULL;
|
|
CBlock *pblock = &pblocktemplate->block; // pointer for convenience
|
|
|
|
// Create coinbase tx
|
|
CMutableTransaction txNew;
|
|
txNew.vin.resize(1);
|
|
txNew.vin[0].prevout.SetNull();
|
|
txNew.vout.resize(1);
|
|
int nHeight = chainActive.Tip()->nHeight + 1;
|
|
if (!fProofOfStake)
|
|
{
|
|
txNew.vout[0].scriptPubKey = scriptPubKeyIn;
|
|
}
|
|
else
|
|
{
|
|
txNew.vin[0].scriptSig = (CScript() << nHeight) + COINBASE_FLAGS;
|
|
txNew.vout[0].SetEmpty();
|
|
}
|
|
|
|
// Add dummy coinbase tx as first transaction
|
|
pblock->vtx.push_back(CTransaction());
|
|
pblocktemplate->vTxFees.push_back(-1); // updated at end
|
|
pblocktemplate->vTxSigOps.push_back(-1); // updated at end
|
|
|
|
// Largest block you're willing to create:
|
|
unsigned int nBlockMaxSize = GetArg("-blockmaxsize", DEFAULT_BLOCK_MAX_SIZE);
|
|
// Limit to between 1K and MAX_BLOCK_SIZE-1K for sanity:
|
|
nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
|
|
|
|
// How much of the block should be dedicated to high-priority transactions,
|
|
// included regardless of the fees they pay
|
|
unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", DEFAULT_BLOCK_PRIORITY_SIZE);
|
|
nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
|
|
|
|
// Minimum block size you want to create; block will be filled with free transactions
|
|
// until there are no more or the block reaches this size:
|
|
unsigned int nBlockMinSize = GetArg("-blockminsize", DEFAULT_BLOCK_MIN_SIZE);
|
|
nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
|
|
|
|
// Collect memory pool transactions into the block
|
|
CTxMemPool::setEntries inBlock;
|
|
CTxMemPool::setEntries waitSet;
|
|
|
|
// This vector will be sorted into a priority queue:
|
|
vector<TxCoinAgePriority> vecPriority;
|
|
TxCoinAgePriorityCompare pricomparer;
|
|
std::map<CTxMemPool::txiter, double, CTxMemPool::CompareIteratorByHash> waitPriMap;
|
|
typedef std::map<CTxMemPool::txiter, double, CTxMemPool::CompareIteratorByHash>::iterator waitPriIter;
|
|
double actualPriority = -1;
|
|
|
|
std::priority_queue<CTxMemPool::txiter, std::vector<CTxMemPool::txiter>, ScoreCompare> clearedTxs;
|
|
bool fPrintPriority = GetBoolArg("-printpriority", DEFAULT_PRINTPRIORITY);
|
|
uint64_t nBlockSize = 1000;
|
|
uint64_t nBlockTx = 0;
|
|
unsigned int nBlockSigOps = 100;
|
|
int lastFewTxs = 0;
|
|
CAmount nFees = 0;
|
|
|
|
{
|
|
LOCK2(cs_main, mempool.cs);
|
|
CBlockIndex* pindexPrev = chainActive.Tip();
|
|
const int nHeight = pindexPrev->nHeight + 1;
|
|
pblock->nTime = GetAdjustedTime();
|
|
|
|
pblock->nVersion = ComputeBlockVersion(pindexPrev, chainparams.GetConsensus());
|
|
// -regtest only: allow overriding block.nVersion with
|
|
// -blockversion=N to test forking scenarios
|
|
if (chainparams.MineBlocksOnDemand())
|
|
pblock->nVersion = GetArg("-blockversion", pblock->nVersion);
|
|
|
|
int64_t nLockTimeCutoff = pblock->GetBlockTime();
|
|
|
|
bool fPriorityBlock = nBlockPrioritySize > 0;
|
|
if (fPriorityBlock) {
|
|
vecPriority.reserve(mempool.mapTx.size());
|
|
for (CTxMemPool::indexed_transaction_set::iterator mi = mempool.mapTx.begin();
|
|
mi != mempool.mapTx.end(); ++mi)
|
|
{
|
|
double dPriority = mi->GetPriority(nHeight);
|
|
CAmount dummy;
|
|
mempool.ApplyDeltas(mi->GetTx().GetHash(), dPriority, dummy);
|
|
vecPriority.push_back(TxCoinAgePriority(dPriority, mi));
|
|
}
|
|
std::make_heap(vecPriority.begin(), vecPriority.end(), pricomparer);
|
|
}
|
|
|
|
CTxMemPool::indexed_transaction_set::nth_index<3>::type::iterator mi = mempool.mapTx.get<3>().begin();
|
|
CTxMemPool::txiter iter;
|
|
|
|
while (mi != mempool.mapTx.get<3>().end() || !clearedTxs.empty())
|
|
{
|
|
bool priorityTx = false;
|
|
if (fPriorityBlock && !vecPriority.empty()) { // add a tx from priority queue to fill the blockprioritysize
|
|
priorityTx = true;
|
|
iter = vecPriority.front().second;
|
|
actualPriority = vecPriority.front().first;
|
|
std::pop_heap(vecPriority.begin(), vecPriority.end(), pricomparer);
|
|
vecPriority.pop_back();
|
|
}
|
|
else if (clearedTxs.empty()) { // add tx with next highest score
|
|
iter = mempool.mapTx.project<0>(mi);
|
|
mi++;
|
|
}
|
|
else { // try to add a previously postponed child tx
|
|
iter = clearedTxs.top();
|
|
clearedTxs.pop();
|
|
}
|
|
|
|
if (inBlock.count(iter))
|
|
continue; // could have been added to the priorityBlock
|
|
|
|
const CTransaction& tx = iter->GetTx();
|
|
|
|
bool fOrphan = false;
|
|
BOOST_FOREACH(CTxMemPool::txiter parent, mempool.GetMemPoolParents(iter))
|
|
{
|
|
if (!inBlock.count(parent)) {
|
|
fOrphan = true;
|
|
break;
|
|
}
|
|
}
|
|
if (fOrphan) {
|
|
if (priorityTx)
|
|
waitPriMap.insert(std::make_pair(iter,actualPriority));
|
|
else
|
|
waitSet.insert(iter);
|
|
continue;
|
|
}
|
|
|
|
unsigned int nTxSize = iter->GetTxSize();
|
|
if (fPriorityBlock &&
|
|
(nBlockSize + nTxSize >= nBlockPrioritySize || !AllowFree(actualPriority))) {
|
|
fPriorityBlock = false;
|
|
waitPriMap.clear();
|
|
}
|
|
if (!priorityTx &&
|
|
(iter->GetModifiedFee() < ::minRelayTxFee.GetFee(nTxSize) && nBlockSize >= nBlockMinSize)) {
|
|
break;
|
|
}
|
|
if (nBlockSize + nTxSize >= nBlockMaxSize) {
|
|
if (nBlockSize > nBlockMaxSize - 100 || lastFewTxs > 50) {
|
|
break;
|
|
}
|
|
// Once we're within 1000 bytes of a full block, only look at 50 more txs
|
|
// to try to fill the remaining space.
|
|
if (nBlockSize > nBlockMaxSize - 1000) {
|
|
lastFewTxs++;
|
|
}
|
|
continue;
|
|
}
|
|
|
|
if (tx.IsCoinStake() || !IsFinalTx(tx, nHeight, nLockTimeCutoff)|| pblock->GetBlockTime() < (int64_t)tx.nTime)
|
|
continue;
|
|
|
|
unsigned int nTxSigOps = iter->GetSigOpCount();
|
|
if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS) {
|
|
if (nBlockSigOps > MAX_BLOCK_SIGOPS - 2) {
|
|
break;
|
|
}
|
|
continue;
|
|
}
|
|
|
|
CAmount nTxFees = iter->GetFee();
|
|
// Added
|
|
pblock->vtx.push_back(tx);
|
|
pblocktemplate->vTxFees.push_back(nTxFees);
|
|
pblocktemplate->vTxSigOps.push_back(nTxSigOps);
|
|
nBlockSize += nTxSize;
|
|
++nBlockTx;
|
|
nBlockSigOps += nTxSigOps;
|
|
nFees += nTxFees;
|
|
|
|
if (fPrintPriority)
|
|
{
|
|
double dPriority = iter->GetPriority(nHeight);
|
|
CAmount dummy;
|
|
mempool.ApplyDeltas(tx.GetHash(), dPriority, dummy);
|
|
LogPrintf("priority %.1f fee %s txid %s\n",
|
|
dPriority , CFeeRate(iter->GetModifiedFee(), nTxSize).ToString(), tx.GetHash().ToString());
|
|
}
|
|
|
|
inBlock.insert(iter);
|
|
|
|
// Add transactions that depend on this one to the priority queue
|
|
BOOST_FOREACH(CTxMemPool::txiter child, mempool.GetMemPoolChildren(iter))
|
|
{
|
|
if (fPriorityBlock) {
|
|
waitPriIter wpiter = waitPriMap.find(child);
|
|
if (wpiter != waitPriMap.end()) {
|
|
vecPriority.push_back(TxCoinAgePriority(wpiter->second,child));
|
|
std::push_heap(vecPriority.begin(), vecPriority.end(), pricomparer);
|
|
waitPriMap.erase(wpiter);
|
|
}
|
|
}
|
|
else {
|
|
if (waitSet.count(child)) {
|
|
clearedTxs.push(child);
|
|
waitSet.erase(child);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
nLastBlockTx = nBlockTx;
|
|
nLastBlockSize = nBlockSize;
|
|
// LogPrintf("CreateNewBlock(): total size %u txs: %u fees: %ld sigops %d\n", nBlockSize, nBlockTx, nFees, nBlockSigOps);
|
|
|
|
// Compute final coinbase transaction.
|
|
if (!fProofOfStake) {
|
|
txNew.vout[0].nValue = nFees + GetProofOfWorkSubsidy();
|
|
txNew.vin[0].scriptSig = CScript() << nHeight << OP_0;
|
|
pblocktemplate->vTxFees[0] = -nFees;
|
|
}
|
|
txNew.nTime = pblock->nTime;
|
|
pblock->vtx[0] = txNew;
|
|
|
|
if (pFees)
|
|
*pFees = nFees;
|
|
|
|
// Fill in header
|
|
pblock->hashPrevBlock = pindexPrev->GetBlockHash();
|
|
pblock->nTime = max(pindexPrev->GetPastTimeLimit()+1, GetMaxTransactionTime(pblock));
|
|
if (!fProofOfStake)
|
|
UpdateTime(pblock, Params().GetConsensus(), pindexPrev);
|
|
pblock->nBits = GetNextTargetRequired(pindexPrev, pblock, fProofOfStake, Params().GetConsensus());
|
|
pblock->nNonce = 0;
|
|
pblocktemplate->vTxSigOps[0] = GetLegacySigOpCount(pblock->vtx[0]);
|
|
|
|
CValidationState state;
|
|
if (!fProofOfStake && !TestBlockValidity(state, chainparams, *pblock, pindexPrev, false, false, false)) {
|
|
throw std::runtime_error(strprintf("%s: TestBlockValidity failed: %s", __func__, FormatStateMessage(state)));
|
|
}
|
|
}
|
|
|
|
return pblocktemplate.release();
|
|
}
|
|
|
|
void IncrementExtraNonce(CBlock* pblock, const CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
|
|
{
|
|
// Update nExtraNonce
|
|
static uint256 hashPrevBlock;
|
|
if (hashPrevBlock != pblock->hashPrevBlock)
|
|
{
|
|
nExtraNonce = 0;
|
|
hashPrevBlock = pblock->hashPrevBlock;
|
|
}
|
|
++nExtraNonce;
|
|
unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
|
|
CMutableTransaction txCoinbase(pblock->vtx[0]);
|
|
txCoinbase.vin[0].scriptSig = (CScript() << nHeight << CScriptNum(nExtraNonce)) + COINBASE_FLAGS;
|
|
assert(txCoinbase.vin[0].scriptSig.size() <= 100);
|
|
|
|
pblock->vtx[0] = txCoinbase;
|
|
pblock->hashMerkleRoot = BlockMerkleRoot(*pblock);
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Internal miner
|
|
//
|
|
|
|
|
|
static bool ProcessBlockFound(const CBlock* pblock, const CChainParams& chainparams, const uint256& hash)
|
|
{
|
|
LogPrintf("%s\n", pblock->ToString());
|
|
LogPrintf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue));
|
|
|
|
// Found a solution
|
|
{
|
|
LOCK(cs_main);
|
|
if (pblock->hashPrevBlock != chainActive.Tip()->GetBlockHash())
|
|
return error("BitcoinMiner: generated block is stale");
|
|
}
|
|
|
|
// Inform about the new block
|
|
GetMainSignals().BlockFound(pblock->GetHash());
|
|
|
|
// Process this block the same as if we had received it from another node
|
|
CValidationState state;
|
|
if (!ProcessNewBlock(state, chainparams, NULL, pblock, true, NULL, hash))
|
|
return error("BitcoinMiner: ProcessNewBlock, block not accepted");
|
|
|
|
return true;
|
|
}
|
|
|
|
void static BitcoinMiner(const CChainParams& chainparams)
|
|
{
|
|
LogPrintf("BitcoinMiner started\n");
|
|
SetThreadPriority(THREAD_PRIORITY_LOWEST);
|
|
RenameThread("bitcoin-miner");
|
|
|
|
unsigned int nExtraNonce = 0;
|
|
|
|
boost::shared_ptr<CReserveScript> coinbaseScript;
|
|
GetMainSignals().ScriptForMining(coinbaseScript);
|
|
|
|
try {
|
|
// Throw an error if no script was provided. This can happen
|
|
// due to some internal error but also if the keypool is empty.
|
|
// In the latter case, already the pointer is NULL.
|
|
if (!coinbaseScript || coinbaseScript->reserveScript.empty())
|
|
throw std::runtime_error("No coinbase script available (mining requires a wallet)");
|
|
|
|
while (true) {
|
|
if (chainparams.MiningRequiresPeers()) {
|
|
// Busy-wait for the network to come online so we don't waste time mining
|
|
// on an obsolete chain. In regtest mode we expect to fly solo.
|
|
do {
|
|
bool fvNodesEmpty;
|
|
{
|
|
LOCK(cs_vNodes);
|
|
fvNodesEmpty = vNodes.empty();
|
|
}
|
|
if (!fvNodesEmpty && !IsInitialBlockDownload())
|
|
break;
|
|
MilliSleep(1000);
|
|
} while (true);
|
|
}
|
|
|
|
//check the block height
|
|
if (chainActive.Tip()->nHeight > Params().LastPOWBlock() + Params().GetConsensus().nStakeMinConfirmations)
|
|
{
|
|
// The stake is confirmed, stop the PoW miner
|
|
throw boost::thread_interrupted();
|
|
}
|
|
//check the next block height
|
|
else if (chainActive.Tip()->nHeight + 1 > Params().LastPOWBlock())
|
|
{
|
|
// Wait for the stake to be confirmed
|
|
MilliSleep(60000);
|
|
continue;
|
|
}
|
|
|
|
//
|
|
// Create new block
|
|
//
|
|
unsigned int nTransactionsUpdatedLast = mempool.GetTransactionsUpdated();
|
|
CBlockIndex* pindexPrev = chainActive.Tip();
|
|
int64_t *nFees;
|
|
std::unique_ptr<CBlockTemplate> pblocktemplate(CreateNewBlock(chainparams, coinbaseScript->reserveScript, nFees, false));
|
|
if (!pblocktemplate.get())
|
|
{
|
|
LogPrintf("Error in BitcoinMiner: Keypool ran out, please call keypoolrefill before restarting the mining thread\n");
|
|
return;
|
|
}
|
|
CBlock *pblock = &pblocktemplate->block;
|
|
IncrementExtraNonce(pblock, pindexPrev, nExtraNonce);
|
|
|
|
LogPrintf("Running BitcoinMiner with %u transactions in block (%u bytes)\n", pblock->vtx.size(),
|
|
::GetSerializeSize(*pblock, SER_NETWORK, PROTOCOL_VERSION));
|
|
|
|
//
|
|
// Search
|
|
//
|
|
int64_t nStart = GetTime();
|
|
arith_uint256 hashTarget = arith_uint256().SetCompact(pblock->nBits);
|
|
uint256 thash;
|
|
|
|
while (true) {
|
|
// Check if something found
|
|
unsigned int nHashesDone = 0;
|
|
char scratchpad[SCRYPT_SCRATCHPAD_SIZE];
|
|
while(true)
|
|
{
|
|
scrypt_1024_1_1_256_sp(BEGIN(pblock->nVersion), BEGIN(thash), scratchpad);
|
|
if (UintToArith256(thash) <= hashTarget)
|
|
{
|
|
|
|
SetThreadPriority(THREAD_PRIORITY_NORMAL);
|
|
LogPrintf("BitcoinMiner:\n");
|
|
LogPrintf("proof-of-work found \n powhash: %s \ntarget: %s\n", thash.GetHex(), hashTarget.GetHex());
|
|
ProcessBlockFound(pblock, chainparams, thash);
|
|
SetThreadPriority(THREAD_PRIORITY_LOWEST);
|
|
coinbaseScript->KeepScript();
|
|
|
|
// In regression test mode, stop mining after a block is found.
|
|
if (chainparams.MineBlocksOnDemand())
|
|
throw boost::thread_interrupted();
|
|
|
|
break;
|
|
}
|
|
pblock->nNonce += 1;
|
|
nHashesDone += 1;
|
|
if ((pblock->nNonce & 0xFF) == 0)
|
|
break;
|
|
}
|
|
|
|
// Check for stop or if block needs to be rebuilt
|
|
boost::this_thread::interruption_point();
|
|
// Regtest mode doesn't require peers
|
|
if (vNodes.empty() && chainparams.MiningRequiresPeers())
|
|
break;
|
|
if (pblock->nNonce >= 0xffff0000)
|
|
break;
|
|
if (mempool.GetTransactionsUpdated() != nTransactionsUpdatedLast && GetTime() - nStart > 60)
|
|
break;
|
|
if (pindexPrev != chainActive.Tip())
|
|
break;
|
|
|
|
// Update nTime every few seconds
|
|
if (UpdateTime(pblock, Params().GetConsensus(), pindexPrev) < 0)
|
|
break; // Recreate the block if the clock has run backwards,
|
|
// so that we can use the correct time.
|
|
if (chainparams.GetConsensus().fPowAllowMinDifficultyBlocks)
|
|
{
|
|
// Changing pblock->nTime can change work required on testnet:
|
|
hashTarget.SetCompact(pblock->nBits);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
catch (const boost::thread_interrupted&)
|
|
{
|
|
LogPrintf("BitcoinMiner terminated\n");
|
|
throw;
|
|
}
|
|
catch (const std::runtime_error &e)
|
|
{
|
|
LogPrintf("BitcoinMiner runtime error: %s\n", e.what());
|
|
return;
|
|
}
|
|
}
|
|
|
|
void GenerateBitcoins(bool fGenerate, int nThreads, const CChainParams& chainparams)
|
|
{
|
|
static boost::thread_group* minerThreads = NULL;
|
|
|
|
if (nThreads < 0)
|
|
nThreads = GetNumCores();
|
|
|
|
if (minerThreads != NULL)
|
|
{
|
|
minerThreads->interrupt_all();
|
|
delete minerThreads;
|
|
minerThreads = NULL;
|
|
}
|
|
|
|
if (nThreads == 0 || !fGenerate)
|
|
return;
|
|
|
|
minerThreads = new boost::thread_group();
|
|
for (int i = 0; i < nThreads; i++)
|
|
minerThreads->create_thread(boost::bind(&BitcoinMiner, boost::cref(chainparams)));
|
|
}
|
|
|
|
#ifdef ENABLE_WALLET
|
|
// novacoin: attempt to generate suitable proof-of-stake
|
|
bool SignBlock(CBlock& block, CWallet& wallet, int64_t& nFees)
|
|
{
|
|
// if we are trying to sign
|
|
// something except proof-of-stake block template
|
|
if (!block.vtx[0].vout[0].IsEmpty()){
|
|
LogPrintf("something except proof-of-stake block\n");
|
|
return false;
|
|
}
|
|
|
|
|
|
// if we are trying to sign
|
|
// a complete proof-of-stake block
|
|
if (block.IsProofOfStake()){
|
|
LogPrintf("trying to sign a complete proof-of-stake block\n");
|
|
return true;
|
|
}
|
|
|
|
|
|
static int64_t nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
|
|
|
|
CKey key;
|
|
CMutableTransaction txCoinBase(block.vtx[0]);
|
|
CMutableTransaction txCoinStake;
|
|
txCoinStake.nTime = GetAdjustedTime();
|
|
txCoinStake.nTime &= ~Params().GetConsensus().nStakeTimestampMask;
|
|
|
|
int64_t nSearchTime = txCoinStake.nTime; // search to current time
|
|
|
|
|
|
if (nSearchTime > nLastCoinStakeSearchTime)
|
|
{
|
|
if (wallet.CreateCoinStake(wallet, block.nBits, 1, nFees, txCoinStake, key))
|
|
{
|
|
if (txCoinStake.nTime >= pindexBestHeader->GetPastTimeLimit()+1)
|
|
{
|
|
// make sure coinstake would meet timestamp protocol
|
|
// as it would be the same as the block timestamp
|
|
txCoinBase.nTime = block.nTime = txCoinStake.nTime;
|
|
block.vtx[0] = txCoinBase;
|
|
|
|
// we have to make sure that we have no future timestamps in
|
|
// our transactions set
|
|
for (vector<CTransaction>::iterator it = block.vtx.begin(); it != block.vtx.end();)
|
|
if (it->nTime > block.nTime) { it = block.vtx.erase(it); } else { ++it; }
|
|
|
|
block.vtx.insert(block.vtx.begin() + 1, txCoinStake);
|
|
|
|
block.hashMerkleRoot = BlockMerkleRoot(block);
|
|
|
|
// append a signature to our block
|
|
return key.Sign(block.GetHash(), block.vchBlockSig);
|
|
}
|
|
}
|
|
nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
|
|
nLastCoinStakeSearchTime = nSearchTime;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
#endif
|
|
|
|
void ThreadStakeMiner(CWallet *pwallet, const CChainParams& chainparams)
|
|
{
|
|
|
|
SetThreadPriority(THREAD_PRIORITY_LOWEST);
|
|
|
|
// Make this thread recognisable as the mining thread
|
|
RenameThread("blackcoin-miner");
|
|
|
|
CReserveKey reservekey(pwallet);
|
|
|
|
bool fTryToSync = true;
|
|
|
|
while (true)
|
|
{
|
|
while (pwallet->IsLocked())
|
|
{
|
|
nLastCoinStakeSearchInterval = 0;
|
|
MilliSleep(1000);
|
|
}
|
|
|
|
while (vNodes.empty() || IsInitialBlockDownload())
|
|
{
|
|
nLastCoinStakeSearchInterval = 0;
|
|
fTryToSync = true;
|
|
MilliSleep(1000);
|
|
}
|
|
|
|
if (fTryToSync)
|
|
{
|
|
fTryToSync = false;
|
|
if (vNodes.size() < 3 || pindexBestHeader->GetBlockTime() < GetTime() - 10 * 60)
|
|
{
|
|
MilliSleep(60000);
|
|
continue;
|
|
}
|
|
}
|
|
|
|
//
|
|
// Create new block
|
|
//
|
|
int64_t nFees;
|
|
std::unique_ptr<CBlockTemplate> pblocktemplate(CreateNewBlock(chainparams, reservekey.reserveScript, &nFees, true));
|
|
if (!pblocktemplate.get())
|
|
return;
|
|
|
|
CBlock *pblock = &pblocktemplate->block;
|
|
// Trying to sign a block
|
|
if (SignBlock(*pblock, *pwallet, nFees))
|
|
{
|
|
SetThreadPriority(THREAD_PRIORITY_NORMAL);
|
|
CheckStake(pblock, *pwallet, chainparams);
|
|
SetThreadPriority(THREAD_PRIORITY_LOWEST);
|
|
MilliSleep(500);
|
|
}
|
|
else
|
|
MilliSleep(nMinerSleep);
|
|
}
|
|
}
|
|
|
|
bool CheckStake(CBlock* pblock, CWallet& wallet, const CChainParams& chainparams)
|
|
{
|
|
uint256 hashBlock = pblock->GetHash();
|
|
|
|
if(!pblock->IsProofOfStake())
|
|
return error("CheckStake() : %s is not a proof-of-stake block", hashBlock.GetHex());
|
|
|
|
CValidationState state;
|
|
// verify hash target and signature of coinstake tx
|
|
if (!CheckProofOfStake(mapBlockIndex[pblock->hashPrevBlock], pblock->vtx[1], pblock->nBits, state))
|
|
return error("CheckStake() : proof-of-stake checking failed");
|
|
|
|
//// debug print
|
|
LogPrintf("%s\n", pblock->ToString());
|
|
LogPrintf("out %s\n", FormatMoney(pblock->vtx[1].GetValueOut()));
|
|
|
|
// Found a solution
|
|
{
|
|
LOCK(cs_main);
|
|
if (pblock->hashPrevBlock != chainActive.Tip()->GetBlockHash())
|
|
return error("CheckStake() : generated block is stale");
|
|
|
|
// Track how many getdata requests this block gets
|
|
{
|
|
LOCK(wallet.cs_wallet);
|
|
wallet.mapRequestCount[hashBlock] = 0;
|
|
}
|
|
|
|
// Process this block the same as if we had received it from another node
|
|
if (!ProcessBlockFound(pblock, chainparams, pblock->GetHash()))
|
|
return error("CheckStake() : ProcessBlock, block not accepted");
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
//void GenerateBitcoins(bool fGenerate, int nThreads, const CChainParams& chainparams)
|
|
//{
|
|
// static boost::thread_group* minerThreads = NULL;
|
|
//
|
|
// if (nThreads < 0)
|
|
// nThreads = GetNumCores();
|
|
//
|
|
// if (minerThreads != NULL)
|
|
// {
|
|
// minerThreads->interrupt_all();
|
|
// delete minerThreads;
|
|
// minerThreads = NULL;
|
|
// }
|
|
//
|
|
// if (nThreads == 0 || !fGenerate)
|
|
// return;
|
|
//
|
|
// minerThreads = new boost::thread_group();
|
|
// for (int i = 0; i < nThreads; i++)
|
|
// minerThreads->create_thread(boost::bind(&BitcoinMiner, boost::cref(chainparams)));
|
|
//}
|