|
|
@ -68,7 +68,7 @@ public: |
|
|
|
set<uint256> setDependsOn; |
|
|
|
CFeeRate feeRate; |
|
|
|
double dPriority; |
|
|
|
|
|
|
|
|
|
|
|
COrphan(const CTransaction* ptxIn) : ptx(ptxIn), feeRate(0), dPriority(0) |
|
|
|
{ |
|
|
|
} |
|
|
@ -82,10 +82,10 @@ typedef boost::tuple<double, CFeeRate, const CTransaction*> TxPriority; |
|
|
|
class TxPriorityCompare |
|
|
|
{ |
|
|
|
bool byFee; |
|
|
|
|
|
|
|
|
|
|
|
public: |
|
|
|
TxPriorityCompare(bool _byFee) : byFee(_byFee) { } |
|
|
|
|
|
|
|
|
|
|
|
bool operator()(const TxPriority& a, const TxPriority& b) |
|
|
|
{ |
|
|
|
if (byFee) |
|
|
@ -170,27 +170,27 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
// -blockversion=N to test forking scenarios
|
|
|
|
if (Params().MineBlocksOnDemand()) |
|
|
|
pblock->nVersion = GetArg("-blockversion", pblock->nVersion); |
|
|
|
|
|
|
|
|
|
|
|
// 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", MAX_BLOCK_SIZE(chainActive.LastTip()->GetHeight()+1)); |
|
|
|
// Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
|
|
|
|
nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE(chainActive.LastTip()->GetHeight()+1)-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
|
|
|
|
CAmount nFees = 0; |
|
|
|
|
|
|
@ -225,7 +225,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
|
|
|
|
CCoinsViewCache view(pcoinsTip); |
|
|
|
uint32_t expired; uint64_t commission; |
|
|
|
|
|
|
|
|
|
|
|
SaplingMerkleTree sapling_tree; |
|
|
|
assert(view.GetSaplingAnchorAt(view.GetBestAnchor(SAPLING), sapling_tree)); |
|
|
|
|
|
|
@ -233,7 +233,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
list<COrphan> vOrphan; // list memory doesn't move
|
|
|
|
map<uint256, vector<COrphan*> > mapDependers; |
|
|
|
bool fPrintPriority = GetBoolArg("-printpriority", false); |
|
|
|
|
|
|
|
|
|
|
|
// This vector will be sorted into a priority queue:
|
|
|
|
vector<TxPriority> vecPriority; |
|
|
|
vecPriority.reserve(mempool.mapTx.size() + 1); |
|
|
@ -243,7 +243,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
mi != mempool.mapTx.end(); ++mi) |
|
|
|
{ |
|
|
|
const CTransaction& tx = mi->GetTx(); |
|
|
|
|
|
|
|
|
|
|
|
int64_t nLockTimeCutoff = (STANDARD_LOCKTIME_VERIFY_FLAGS & LOCKTIME_MEDIAN_TIME_PAST) |
|
|
|
? nMedianTimePast |
|
|
|
: pblock->GetBlockTime(); |
|
|
@ -314,16 +314,16 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
} |
|
|
|
|
|
|
|
if (fMissingInputs) continue; |
|
|
|
|
|
|
|
|
|
|
|
// Priority is sum(valuein * age) / modified_txsize
|
|
|
|
unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION); |
|
|
|
dPriority = tx.ComputePriority(dPriority, nTxSize); |
|
|
|
|
|
|
|
|
|
|
|
uint256 hash = tx.GetHash(); |
|
|
|
mempool.ApplyDeltas(hash, dPriority, nTotalIn); |
|
|
|
|
|
|
|
|
|
|
|
CFeeRate feeRate(nTotalIn-tx.GetValueOut(), nTxSize); |
|
|
|
|
|
|
|
|
|
|
|
if (porphan) |
|
|
|
{ |
|
|
|
porphan->dPriority = dPriority; |
|
|
@ -339,20 +339,20 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
int64_t interest; |
|
|
|
int nBlockSigOps = 100; |
|
|
|
bool fSortedByFee = (nBlockPrioritySize <= 0); |
|
|
|
|
|
|
|
|
|
|
|
TxPriorityCompare comparer(fSortedByFee); |
|
|
|
std::make_heap(vecPriority.begin(), vecPriority.end(), comparer); |
|
|
|
|
|
|
|
|
|
|
|
while (!vecPriority.empty()) |
|
|
|
{ |
|
|
|
// Take highest priority transaction off the priority queue:
|
|
|
|
double dPriority = vecPriority.front().get<0>(); |
|
|
|
CFeeRate feeRate = vecPriority.front().get<1>(); |
|
|
|
const CTransaction& tx = *(vecPriority.front().get<2>()); |
|
|
|
|
|
|
|
|
|
|
|
std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer); |
|
|
|
vecPriority.pop_back(); |
|
|
|
|
|
|
|
|
|
|
|
// Size limits
|
|
|
|
unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION); |
|
|
|
if (nBlockSize + nTxSize >= nBlockMaxSize-512) // room for extra autotx
|
|
|
@ -360,7 +360,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
//fprintf(stderr,"nBlockSize %d + %d nTxSize >= %d nBlockMaxSize\n",(int32_t)nBlockSize,(int32_t)nTxSize,(int32_t)nBlockMaxSize);
|
|
|
|
continue; |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// Legacy limits on sigOps:
|
|
|
|
unsigned int nTxSigOps = GetLegacySigOpCount(tx); |
|
|
|
if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS-1) |
|
|
@ -387,14 +387,14 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
comparer = TxPriorityCompare(fSortedByFee); |
|
|
|
std::make_heap(vecPriority.begin(), vecPriority.end(), comparer); |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
if (!view.HaveInputs(tx)) |
|
|
|
{ |
|
|
|
//fprintf(stderr,"dont have inputs\n");
|
|
|
|
continue; |
|
|
|
} |
|
|
|
CAmount nTxFees = view.GetValueIn(chainActive.LastTip()->GetHeight(),&interest,tx,chainActive.LastTip()->nTime)-tx.GetValueOut(); |
|
|
|
|
|
|
|
|
|
|
|
nTxSigOps += GetP2SHSigOpCount(tx, view); |
|
|
|
if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS-1) |
|
|
|
{ |
|
|
@ -425,12 +425,12 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
++nBlockTx; |
|
|
|
nBlockSigOps += nTxSigOps; |
|
|
|
nFees += nTxFees; |
|
|
|
|
|
|
|
|
|
|
|
if (fPrintPriority) |
|
|
|
{ |
|
|
|
LogPrintf("priority %.1f fee %s txid %s\n",dPriority, feeRate.ToString(), tx.GetHash().ToString()); |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// Add transactions that depend on this one to the priority queue
|
|
|
|
if (mapDependers.count(hash)) |
|
|
|
{ |
|
|
@ -448,7 +448,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
nLastBlockTx = nBlockTx; |
|
|
|
nLastBlockSize = nBlockSize; |
|
|
|
blocktime = 1 + std::max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime()); |
|
|
@ -497,7 +497,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
//printf("staking PoS ht.%d t%u lag.%u\n",(int32_t)chainActive.LastTip()->GetHeight()+1,blocktime,(uint32_t)(GetAdjustedTime() - (blocktime-13)));
|
|
|
|
} else return(0); //fprintf(stderr,"no utxos eligible for staking\n");
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// Create coinbase tx
|
|
|
|
CMutableTransaction txNew = CreateNewContextualCMutableTransaction(consensusParams, nHeight); |
|
|
|
txNew.vin.resize(1); |
|
|
@ -531,7 +531,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
fprintf(stderr,"CreateNewBlock: attempt to add timelock to pay2sh or pay2cc\n"); |
|
|
|
return 0; |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
opretScript += scriptPubKeyIn; |
|
|
|
|
|
|
|
txNew.vout[0].scriptPubKey = CScriptExt().PayToScriptHash(CScriptID(opretScript)); |
|
|
@ -578,7 +578,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
nonce >>= 16; |
|
|
|
pblock->nNonce = ArithToUint256(nonce); |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// Fill in header
|
|
|
|
pblock->hashPrevBlock = pindexPrev->GetBlockHash(); |
|
|
|
pblock->hashFinalSaplingRoot = sapling_tree.root(); |
|
|
@ -638,7 +638,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
//fprintf(stderr,"done new block\n");
|
|
|
|
return pblocktemplate.release(); |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
#ifdef ENABLE_WALLET |
|
|
|
boost::optional<CScript> GetMinerScriptPubKey(CReserveKey& reservekey) |
|
|
@ -661,11 +661,11 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
return boost::optional<CScript>(); |
|
|
|
#endif |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
CScript scriptPubKey = CScript() << OP_DUP << OP_HASH160 << ToByteVector(keyID) << OP_EQUALVERIFY << OP_CHECKSIG; |
|
|
|
return scriptPubKey; |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
#ifdef ENABLE_WALLET |
|
|
|
CBlockTemplate* CreateNewBlockWithKey(CReserveKey& reservekey) |
|
|
|
{ |
|
|
@ -675,7 +675,7 @@ CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, |
|
|
|
{ |
|
|
|
boost::optional<CScript> scriptPubKey = GetMinerScriptPubKey(); |
|
|
|
#endif |
|
|
|
|
|
|
|
|
|
|
|
if (!scriptPubKey) { |
|
|
|
return NULL; |
|
|
|
} |
|
|
@ -703,7 +703,7 @@ void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& |
|
|
|
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 = pblock->BuildMerkleTree(); |
|
|
|
} |
|
|
@ -783,7 +783,7 @@ static bool ProcessBlockFound(CBlock* pblock) |
|
|
|
{ |
|
|
|
LogPrintf("%s\n", pblock->ToString()); |
|
|
|
LogPrintf("generated %s height.%d\n", FormatMoney(pblock->vtx[0].vout[0].nValue),chainActive.LastTip()->GetHeight()+1); |
|
|
|
|
|
|
|
|
|
|
|
// Found a solution
|
|
|
|
{ |
|
|
|
if (pblock->hashPrevBlock != chainActive.LastTip()->GetBlockHash()) |
|
|
@ -797,11 +797,11 @@ static bool ProcessBlockFound(CBlock* pblock) |
|
|
|
for (i=31; i>=0; i--) |
|
|
|
fprintf(stderr,"%02x",((uint8_t *)&hash)[i]); |
|
|
|
fprintf(stderr," <- chainTip (stale)\n"); |
|
|
|
|
|
|
|
|
|
|
|
return error("KomodoMiner: generated block is stale"); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
#ifdef ENABLE_WALLET |
|
|
|
// Remove key from key pool
|
|
|
|
if ( IS_KOMODO_NOTARY == 0 ) |
|
|
@ -825,7 +825,7 @@ static bool ProcessBlockFound(CBlock* pblock) |
|
|
|
CValidationState state; |
|
|
|
if (!ProcessNewBlock(1,chainActive.LastTip()->GetHeight()+1,state, NULL, pblock, true, NULL)) |
|
|
|
return error("KomodoMiner: ProcessNewBlock, block not accepted"); |
|
|
|
|
|
|
|
|
|
|
|
TrackMinedBlock(pblock->GetHash()); |
|
|
|
komodo_broadcast(pblock,16); |
|
|
|
return true; |
|
|
@ -853,7 +853,7 @@ int32_t waitForPeers(const CChainParams &chainparams) |
|
|
|
if (fvNodesEmpty || IsNotInSync()) |
|
|
|
{ |
|
|
|
int loops = 0, blockDiff = 0, newDiff = 0; |
|
|
|
|
|
|
|
|
|
|
|
do { |
|
|
|
if (fvNodesEmpty) |
|
|
|
{ |
|
|
@ -1036,7 +1036,7 @@ void static VerusStaker(CWallet *pwallet) |
|
|
|
post.SetCompact(pblock->GetVerusPOSTarget()); |
|
|
|
pindexPrev = get_chainactive(Mining_height - 100); |
|
|
|
CTransaction &sTx = pblock->vtx[pblock->vtx.size()-1]; |
|
|
|
printf("POS hash: %s \ntarget: %s\n", |
|
|
|
printf("POS hash: %s \ntarget: %s\n", |
|
|
|
CTransaction::_GetVerusPOSHash(&(pblock->nNonce), sTx.vin[0].prevout.hash, sTx.vin[0].prevout.n, Mining_height, pindexPrev->GetBlockHeader().GetVerusEntropyHash(Mining_height - 100), sTx.vout[0].nValue).GetHex().c_str(), ArithToUint256(post).GetHex().c_str()); |
|
|
|
if (unlockTime > Mining_height && subsidy >= ASSETCHAINS_TIMELOCKGTE) |
|
|
|
printf("- timelocked until block %i\n", unlockTime); |
|
|
@ -1356,15 +1356,15 @@ void static BitcoinMiner() |
|
|
|
SetThreadPriority(THREAD_PRIORITY_LOWEST); |
|
|
|
RenameThread("komodo-miner"); |
|
|
|
const CChainParams& chainparams = Params(); |
|
|
|
|
|
|
|
|
|
|
|
#ifdef ENABLE_WALLET |
|
|
|
// Each thread has its own key
|
|
|
|
CReserveKey reservekey(pwallet); |
|
|
|
#endif |
|
|
|
|
|
|
|
|
|
|
|
// Each thread has its own counter
|
|
|
|
unsigned int nExtraNonce = 0; |
|
|
|
|
|
|
|
|
|
|
|
unsigned int n = chainparams.EquihashN(); |
|
|
|
unsigned int k = chainparams.EquihashK(); |
|
|
|
uint8_t *script; uint64_t total; int32_t i,j,gpucount=KOMODO_MAXGPUCOUNT,notaryid = -1; |
|
|
@ -1395,7 +1395,7 @@ void static BitcoinMiner() |
|
|
|
} |
|
|
|
); |
|
|
|
miningTimer.start(); |
|
|
|
|
|
|
|
|
|
|
|
try { |
|
|
|
if ( ASSETCHAINS_SYMBOL[0] != 0 ) |
|
|
|
fprintf(stderr,"try %s Mining with %s\n",ASSETCHAINS_SYMBOL,solver.c_str()); |
|
|
@ -1418,7 +1418,7 @@ void static BitcoinMiner() |
|
|
|
break; |
|
|
|
MilliSleep(15000); |
|
|
|
//fprintf(stderr,"fvNodesEmpty %d IsInitialBlockDownload(%s) %d\n",(int32_t)fvNodesEmpty,ASSETCHAINS_SYMBOL,(int32_t)IsInitialBlockDownload());
|
|
|
|
|
|
|
|
|
|
|
|
} while (true); |
|
|
|
//fprintf(stderr,"%s Found peers\n",ASSETCHAINS_SYMBOL);
|
|
|
|
miningTimer.start(); |
|
|
@ -1567,7 +1567,7 @@ void static BitcoinMiner() |
|
|
|
komodo_longestchain(); |
|
|
|
// Hash state
|
|
|
|
KOMODO_CHOSEN_ONE = 0; |
|
|
|
|
|
|
|
|
|
|
|
crypto_generichash_blake2b_state state; |
|
|
|
EhInitialiseState(n, k, state); |
|
|
|
// I = the block header minus nonce and solution.
|
|
|
@ -1687,13 +1687,13 @@ void static BitcoinMiner() |
|
|
|
std::lock_guard<std::mutex> lock{m_cs}; |
|
|
|
return cancelSolver; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
|
// TODO: factor this out into a function with the same API for each solver.
|
|
|
|
if (solver == "tromp" ) { //&& notaryid >= 0 ) {
|
|
|
|
// Create solver and initialize it.
|
|
|
|
equi eq(1); |
|
|
|
eq.setstate(&curr_state); |
|
|
|
|
|
|
|
|
|
|
|
// Initialization done, start algo driver.
|
|
|
|
eq.digit0(0); |
|
|
|
eq.xfull = eq.bfull = eq.hfull = 0; |
|
|
@ -1705,7 +1705,7 @@ void static BitcoinMiner() |
|
|
|
} |
|
|
|
eq.digitK(0); |
|
|
|
ehSolverRuns.increment(); |
|
|
|
|
|
|
|
|
|
|
|
// Convert solution indices to byte array (decompress) and pass it to validBlock method.
|
|
|
|
for (size_t s = 0; s < eq.nsols; s++) { |
|
|
|
LogPrint("pow", "Checking solution %d\n", s+1); |
|
|
@ -1714,7 +1714,7 @@ void static BitcoinMiner() |
|
|
|
index_vector[i] = eq.sols[s][i]; |
|
|
|
} |
|
|
|
std::vector<unsigned char> sol_char = GetMinimalFromIndices(index_vector, DIGITBITS); |
|
|
|
|
|
|
|
|
|
|
|
if (validBlock(sol_char)) { |
|
|
|
// If we find a POW solution, do not try other solutions
|
|
|
|
// because they become invalid as we created a new block in blockchain.
|
|
|
@ -1741,7 +1741,7 @@ void static BitcoinMiner() |
|
|
|
cancelSolver = false; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// Check for stop or if block needs to be rebuilt
|
|
|
|
boost::this_thread::interruption_point(); |
|
|
|
// Regtest mode doesn't require peers
|
|
|
@ -1811,7 +1811,7 @@ void static BitcoinMiner() |
|
|
|
miningTimer.stop(); |
|
|
|
c.disconnect(); |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
#ifdef ENABLE_WALLET |
|
|
|
void GenerateBitcoins(bool fGenerate, CWallet* pwallet, int nThreads) |
|
|
|
#else |
|
|
@ -1819,10 +1819,10 @@ void static BitcoinMiner() |
|
|
|
#endif |
|
|
|
{ |
|
|
|
static boost::thread_group* minerThreads = NULL; |
|
|
|
|
|
|
|
|
|
|
|
if (nThreads < 0) |
|
|
|
nThreads = GetNumCores(); |
|
|
|
|
|
|
|
|
|
|
|
if (minerThreads != NULL) |
|
|
|
{ |
|
|
|
minerThreads->interrupt_all(); |
|
|
@ -1831,8 +1831,13 @@ void static BitcoinMiner() |
|
|
|
} |
|
|
|
|
|
|
|
//fprintf(stderr,"nThreads.%d fGenerate.%d\n",(int32_t)nThreads,fGenerate);
|
|
|
|
if ( nThreads == 0 && ASSETCHAINS_STAKED ) |
|
|
|
nThreads = 1; |
|
|
|
if ( ASSETCHAINS_STAKED > 0 && nThreads == 0 ) |
|
|
|
{ |
|
|
|
if ( pwallet != NULL ) |
|
|
|
nThreads = 1; |
|
|
|
else |
|
|
|
return; |
|
|
|
} |
|
|
|
|
|
|
|
if ((nThreads == 0 || !fGenerate) && (VERUS_MINTBLOCKS == 0 || pwallet == NULL)) |
|
|
|
return; |
|
|
@ -1861,5 +1866,5 @@ void static BitcoinMiner() |
|
|
|
#endif |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
#endif // ENABLE_MINING
|
|
|
|