1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2014 The Bitcoin Core developers
3 // Distributed under the MIT software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
8 #include "pow/tromp/equi_miner.h"
12 #include "chainparams.h"
13 #include "cc/StakeGuard.h"
14 #include "importcoin.h"
15 #include "consensus/consensus.h"
16 #include "consensus/upgrades.h"
17 #include "consensus/validation.h"
19 #include "crypto/equihash.h"
20 #include "crypto/verus_hash.h"
28 #include "primitives/transaction.h"
31 #include "ui_interface.h"
33 #include "utilmoneystr.h"
35 #include "wallet/wallet.h"
38 #include "zcash/Address.hpp"
39 #include "transaction_builder.h"
43 #include <boost/thread.hpp>
44 #include <boost/tuple/tuple.hpp>
52 //////////////////////////////////////////////////////////////////////////////
58 // Unconfirmed transactions in the memory pool often depend on other
59 // transactions in the memory pool. When we select transactions from the
60 // pool, we select by highest priority or fee rate, so we might consider
61 // transactions that depend on transactions that aren't yet in the block.
62 // The COrphan class keeps track of these 'temporary orphans' while
63 // CreateBlock is figuring out which transactions to include.
68 const CTransaction* ptx;
69 set<uint256> setDependsOn;
73 COrphan(const CTransaction* ptxIn) : ptx(ptxIn), feeRate(0), dPriority(0)
78 uint64_t nLastBlockTx = 0;
79 uint64_t nLastBlockSize = 0;
81 // We want to sort transactions by priority and fee rate, so:
82 typedef boost::tuple<double, CFeeRate, const CTransaction*> TxPriority;
83 class TxPriorityCompare
88 TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
90 bool operator()(const TxPriority& a, const TxPriority& b)
94 if (a.get<1>() == b.get<1>())
95 return a.get<0>() < b.get<0>();
96 return a.get<1>() < b.get<1>();
100 if (a.get<0>() == b.get<0>())
101 return a.get<1>() < b.get<1>();
102 return a.get<0>() < b.get<0>();
107 void UpdateTime(CBlockHeader* pblock, const Consensus::Params& consensusParams, const CBlockIndex* pindexPrev)
109 pblock->nTime = std::max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
111 // Updating time can change work required on testnet:
112 if (consensusParams.nPowAllowMinDifficultyBlocksAfterHeight != boost::none) {
113 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, consensusParams);
117 #include "komodo_defs.h"
119 extern CCriticalSection cs_metrics;
120 extern int32_t KOMODO_MININGTHREADS,KOMODO_LONGESTCHAIN,ASSETCHAINS_SEED,IS_KOMODO_NOTARY,USE_EXTERNAL_PUBKEY,KOMODO_CHOSEN_ONE,ASSETCHAIN_INIT,KOMODO_INITDONE,KOMODO_ON_DEMAND,KOMODO_INITDONE,KOMODO_PASSPORT_INITDONE;
121 extern uint64_t ASSETCHAINS_COMMISSION, ASSETCHAINS_STAKED;
122 extern bool VERUS_MINTBLOCKS;
123 extern uint64_t ASSETCHAINS_REWARD[ASSETCHAINS_MAX_ERAS], ASSETCHAINS_TIMELOCKGTE, ASSETCHAINS_NONCEMASK[];
124 extern const char *ASSETCHAINS_ALGORITHMS[];
125 extern int32_t VERUS_MIN_STAKEAGE, ASSETCHAINS_ALGO, ASSETCHAINS_EQUIHASH, ASSETCHAINS_VERUSHASH, ASSETCHAINS_LASTERA, ASSETCHAINS_LWMAPOS, ASSETCHAINS_NONCESHIFT[], ASSETCHAINS_HASHESPERROUND[];
126 extern char ASSETCHAINS_SYMBOL[KOMODO_ASSETCHAIN_MAXLEN];
127 extern std::string NOTARY_PUBKEY,ASSETCHAINS_OVERRIDE_PUBKEY;
128 void vcalc_sha256(char deprecated[(256 >> 3) * 2 + 1],uint8_t hash[256 >> 3],uint8_t *src,int32_t len);
130 extern uint8_t NOTARY_PUBKEY33[33],ASSETCHAINS_OVERRIDE_PUBKEY33[33];
131 uint32_t Mining_start,Mining_height;
132 int32_t My_notaryid = -1;
133 int32_t komodo_chosennotary(int32_t *notaryidp,int32_t height,uint8_t *pubkey33,uint32_t timestamp);
134 int32_t komodo_pax_opreturn(int32_t height,uint8_t *opret,int32_t maxsize);
135 int32_t komodo_baseid(char *origbase);
136 int32_t komodo_validate_interest(const CTransaction &tx,int32_t txheight,uint32_t nTime,int32_t dispflag);
137 int64_t komodo_block_unlocktime(uint32_t nHeight);
138 uint64_t komodo_commission(const CBlock *block);
139 int32_t komodo_staked(CMutableTransaction &txNew,uint32_t nBits,uint32_t *blocktimep,uint32_t *txtimep,uint256 *utxotxidp,int32_t *utxovoutp,uint64_t *utxovaluep,uint8_t *utxosig);
140 int32_t verus_staked(CBlock *pBlock, CMutableTransaction &txNew, uint32_t &nBits, arith_uint256 &hashResult, uint8_t *utxosig, CPubKey &pk);
141 int32_t komodo_notaryvin(CMutableTransaction &txNew,uint8_t *notarypub33);
143 CBlockTemplate* CreateNewBlock(const CScript& _scriptPubKeyIn, int32_t gpucount, bool isStake)
145 CScript scriptPubKeyIn(_scriptPubKeyIn);
147 CPubKey pk = CPubKey();
148 std::vector<std::vector<unsigned char>> vAddrs;
150 if (Solver(scriptPubKeyIn, txT, vAddrs))
152 if (txT == TX_PUBKEY)
153 pk = CPubKey(vAddrs[0]);
156 uint64_t deposits; int32_t isrealtime,kmdheight; uint32_t blocktime; const CChainParams& chainparams = Params();
157 //fprintf(stderr,"create new block\n");
160 gpucount = KOMODO_MAXGPUCOUNT;
161 std::unique_ptr<CBlockTemplate> pblocktemplate(new CBlockTemplate());
162 if(!pblocktemplate.get())
164 fprintf(stderr,"pblocktemplate.get() failure\n");
167 CBlock *pblock = &pblocktemplate->block; // pointer for convenience
168 // -regtest only: allow overriding block.nVersion with
169 // -blockversion=N to test forking scenarios
170 if (Params().MineBlocksOnDemand())
171 pblock->nVersion = GetArg("-blockversion", pblock->nVersion);
173 // Add dummy coinbase tx as first transaction
174 pblock->vtx.push_back(CTransaction());
175 pblocktemplate->vTxFees.push_back(-1); // updated at end
176 pblocktemplate->vTxSigOps.push_back(-1); // updated at end
178 // Largest block you're willing to create:
179 unsigned int nBlockMaxSize = GetArg("-blockmaxsize", DEFAULT_BLOCK_MAX_SIZE);
180 // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
181 nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
183 // How much of the block should be dedicated to high-priority transactions,
184 // included regardless of the fees they pay
185 unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", DEFAULT_BLOCK_PRIORITY_SIZE);
186 nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
188 // Minimum block size you want to create; block will be filled with free transactions
189 // until there are no more or the block reaches this size:
190 unsigned int nBlockMinSize = GetArg("-blockminsize", DEFAULT_BLOCK_MIN_SIZE);
191 nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
193 // Collect memory pool transactions into the block
196 // we will attempt to spend any cheats we see
197 CTransaction cheatTx;
198 boost::optional<CTransaction> cheatSpend;
201 CBlockIndex* pindexPrev = 0;
203 LOCK2(cs_main, mempool.cs);
204 pindexPrev = chainActive.LastTip();
205 const int nHeight = pindexPrev->GetHeight() + 1;
206 const Consensus::Params &consensusParams = chainparams.GetConsensus();
207 uint32_t consensusBranchId = CurrentEpochBranchId(nHeight, consensusParams);
208 bool sapling = NetworkUpgradeActive(nHeight, consensusParams, Consensus::UPGRADE_SAPLING);
210 const int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
211 uint32_t proposedTime = GetAdjustedTime();
212 if (proposedTime == nMedianTimePast)
214 // too fast or stuck, this addresses the too fast issue, while moving
215 // forward as quickly as possible
216 for (int i; i < 100; i++)
218 proposedTime = GetAdjustedTime();
219 if (proposedTime == nMedianTimePast)
223 pblock->nTime = GetAdjustedTime();
225 CCoinsViewCache view(pcoinsTip);
226 uint32_t expired; uint64_t commission;
228 SaplingMerkleTree sapling_tree;
229 assert(view.GetSaplingAnchorAt(view.GetBestAnchor(SAPLING), sapling_tree));
231 // Priority order to process transactions
232 list<COrphan> vOrphan; // list memory doesn't move
233 map<uint256, vector<COrphan*> > mapDependers;
234 bool fPrintPriority = GetBoolArg("-printpriority", false);
236 // This vector will be sorted into a priority queue:
237 vector<TxPriority> vecPriority;
238 vecPriority.reserve(mempool.mapTx.size() + 1);
240 // check if we should add cheat transaction
243 int cheatHeight = nHeight - COINBASE_MATURITY < 1 ? 1 : nHeight - COINBASE_MATURITY;
245 sapling && chainActive.Height() > 100 &&
246 (ppast = chainActive[cheatHeight]) &&
247 ppast->IsVerusPOSBlock() &&
248 cheatList.IsHeightOrGreaterInList(cheatHeight))
250 // get the block and see if there is a cheat candidate for the stake tx
252 if (!(fHavePruned && !(ppast->nStatus & BLOCK_HAVE_DATA) && ppast->nTx > 0) && ReadBlockFromDisk(b, ppast, 1))
254 CTransaction &stakeTx = b.vtx[b.vtx.size() - 1];
256 if (cheatList.IsCheatInList(stakeTx, &cheatTx))
258 // make and sign the cheat transaction to spend the coinbase to our address
259 CMutableTransaction mtx = CreateNewContextualCMutableTransaction(consensusParams, nHeight);
261 // send to the same pub key as the destination of this block reward
262 if (MakeCheatEvidence(mtx, b.vtx[0], stakeTx.vin[0].prevout.n, cheatTx))
264 extern CWallet *pwalletMain;
265 LOCK(pwalletMain->cs_wallet);
266 TransactionBuilder tb = TransactionBuilder(consensusParams, nHeight);
268 cbHash = cb.GetHash();
270 bool hasInput = false;
271 for (uint32_t i = 0; i < cb.vout.size(); i++)
273 // add the spends with the cheat
274 if (cb.vout[0].nValue > 0)
276 tb.AddTransparentInput(COutPoint(cbHash,i), cb.vout[0].scriptPubKey, cb.vout[0].nValue);
283 // this is a send from a t-address to a sapling address, which we don't have an ovk for.
284 // Instead, generate a common one from the HD seed. This ensures the data is
285 // recoverable, at least for us, while keeping it logically separate from the ZIP 32
286 // Sapling key hierarchy, which the user might not be using.
289 if (pwalletMain->GetHDSeed(seed)) {
290 ovk = ovkForShieldingFromTaddr(seed);
292 // send everything to Sapling address
293 tb.SendChangeTo(cheatCatcher.value(), ovk);
295 tb.AddOpRet(mtx.vout[mtx.vout.size() - 1].scriptPubKey);
297 cheatSpend = tb.Build();
300 cheatTx = boost::get<CTransaction>(cheatSpend);
301 unsigned int nTxSize = ::GetSerializeSize(cheatTx, SER_NETWORK, PROTOCOL_VERSION);
302 double dPriority = cheatTx.ComputePriority(dPriority, nTxSize);
303 CFeeRate feeRate(DEFAULT_TRANSACTION_MAXFEE, nTxSize);
304 vecPriority.push_back(TxPriority(dPriority, feeRate, &cheatTx));
315 std::list<CTransaction> removed;
316 mempool.removeConflicts(cheatSpend.value(), removed);
317 printf("Found cheating stake! Adding cheat spend for %.8f at block #%d, coinbase tx\n%s\n",
318 (double)cb.GetValueOut() / (double)COIN, nHeight, cheatSpend.value().vin[0].prevout.hash.GetHex().c_str());
321 // now add transactions from the mem pool
322 for (CTxMemPool::indexed_transaction_set::iterator mi = mempool.mapTx.begin();
323 mi != mempool.mapTx.end(); ++mi)
325 const CTransaction& tx = mi->GetTx();
327 int64_t nLockTimeCutoff = (STANDARD_LOCKTIME_VERIFY_FLAGS & LOCKTIME_MEDIAN_TIME_PAST)
329 : pblock->GetBlockTime();
331 if (tx.IsCoinBase() || !IsFinalTx(tx, nHeight, nLockTimeCutoff) || IsExpiredTx(tx, nHeight))
333 //fprintf(stderr,"coinbase.%d finaltx.%d expired.%d\n",tx.IsCoinBase(),IsFinalTx(tx, nHeight, nLockTimeCutoff),IsExpiredTx(tx, nHeight));
337 if ( ASSETCHAINS_SYMBOL[0] == 0 && komodo_validate_interest(tx,nHeight,(uint32_t)pblock->nTime,0) < 0 )
339 //fprintf(stderr,"CreateNewBlock: komodo_validate_interest failure nHeight.%d nTime.%u vs locktime.%u\n",nHeight,(uint32_t)pblock->nTime,(uint32_t)tx.nLockTime);
343 COrphan* porphan = NULL;
344 double dPriority = 0;
345 CAmount nTotalIn = 0;
346 bool fMissingInputs = false;
347 if (tx.IsCoinImport())
349 CAmount nValueIn = GetCoinImportValue(tx);
350 nTotalIn += nValueIn;
351 dPriority += (double)nValueIn * 1000; // flat multiplier
353 BOOST_FOREACH(const CTxIn& txin, tx.vin)
355 // Read prev transaction
356 if (!view.HaveCoins(txin.prevout.hash))
358 // This should never happen; all transactions in the memory
359 // pool should connect to either transactions in the chain
360 // or other transactions in the memory pool.
361 if (!mempool.mapTx.count(txin.prevout.hash))
363 LogPrintf("ERROR: mempool transaction missing input\n");
364 if (fDebug) assert("mempool transaction missing input" == 0);
365 fMissingInputs = true;
371 // Has to wait for dependencies
374 // Use list for automatic deletion
375 vOrphan.push_back(COrphan(&tx));
376 porphan = &vOrphan.back();
378 mapDependers[txin.prevout.hash].push_back(porphan);
379 porphan->setDependsOn.insert(txin.prevout.hash);
380 nTotalIn += mempool.mapTx.find(txin.prevout.hash)->GetTx().vout[txin.prevout.n].nValue;
383 const CCoins* coins = view.AccessCoins(txin.prevout.hash);
386 CAmount nValueIn = coins->vout[txin.prevout.n].nValue;
387 nTotalIn += nValueIn;
389 int nConf = nHeight - coins->nHeight;
391 dPriority += (double)nValueIn * nConf;
393 nTotalIn += tx.GetShieldedValueIn();
396 if (fMissingInputs) continue;
398 // Priority is sum(valuein * age) / modified_txsize
399 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
400 dPriority = tx.ComputePriority(dPriority, nTxSize);
402 uint256 hash = tx.GetHash();
403 mempool.ApplyDeltas(hash, dPriority, nTotalIn);
405 CFeeRate feeRate(nTotalIn-tx.GetValueOut(), nTxSize);
409 porphan->dPriority = dPriority;
410 porphan->feeRate = feeRate;
413 vecPriority.push_back(TxPriority(dPriority, feeRate, &(mi->GetTx())));
416 // Collect transactions into block
417 uint64_t nBlockSize = 1000;
418 uint64_t nBlockTx = 0;
420 int nBlockSigOps = 100;
421 bool fSortedByFee = (nBlockPrioritySize <= 0);
423 TxPriorityCompare comparer(fSortedByFee);
424 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
426 while (!vecPriority.empty())
428 // Take highest priority transaction off the priority queue:
429 double dPriority = vecPriority.front().get<0>();
430 CFeeRate feeRate = vecPriority.front().get<1>();
431 const CTransaction& tx = *(vecPriority.front().get<2>());
433 std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
434 vecPriority.pop_back();
437 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
438 if (nBlockSize + nTxSize >= nBlockMaxSize-512) // room for extra autotx
440 //fprintf(stderr,"nBlockSize %d + %d nTxSize >= %d nBlockMaxSize\n",(int32_t)nBlockSize,(int32_t)nTxSize,(int32_t)nBlockMaxSize);
444 // Legacy limits on sigOps:
445 unsigned int nTxSigOps = GetLegacySigOpCount(tx);
446 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS-1)
448 //fprintf(stderr,"A nBlockSigOps %d + %d nTxSigOps >= %d MAX_BLOCK_SIGOPS-1\n",(int32_t)nBlockSigOps,(int32_t)nTxSigOps,(int32_t)MAX_BLOCK_SIGOPS);
451 // Skip free transactions if we're past the minimum block size:
452 const uint256& hash = tx.GetHash();
453 double dPriorityDelta = 0;
454 CAmount nFeeDelta = 0;
455 mempool.ApplyDeltas(hash, dPriorityDelta, nFeeDelta);
456 if (fSortedByFee && (dPriorityDelta <= 0) && (nFeeDelta <= 0) && (feeRate < ::minRelayTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
458 //fprintf(stderr,"fee rate skip\n");
461 // Prioritise by fee once past the priority size or we run out of high-priority
464 ((nBlockSize + nTxSize >= nBlockPrioritySize) || !AllowFree(dPriority)))
467 comparer = TxPriorityCompare(fSortedByFee);
468 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
471 if (!view.HaveInputs(tx))
473 //fprintf(stderr,"dont have inputs\n");
476 CAmount nTxFees = view.GetValueIn(chainActive.LastTip()->GetHeight(),&interest,tx,chainActive.LastTip()->nTime)-tx.GetValueOut();
478 nTxSigOps += GetP2SHSigOpCount(tx, view);
479 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS-1)
481 //fprintf(stderr,"B nBlockSigOps %d + %d nTxSigOps >= %d MAX_BLOCK_SIGOPS-1\n",(int32_t)nBlockSigOps,(int32_t)nTxSigOps,(int32_t)MAX_BLOCK_SIGOPS);
484 // Note that flags: we don't want to set mempool/IsStandard()
485 // policy here, but we still have to ensure that the block we
486 // create only contains transactions that are valid in new blocks.
487 CValidationState state;
488 PrecomputedTransactionData txdata(tx);
489 if (!ContextualCheckInputs(tx, state, view, true, MANDATORY_SCRIPT_VERIFY_FLAGS, true, txdata, Params().GetConsensus(), consensusBranchId))
491 //fprintf(stderr,"context failure\n");
494 UpdateCoins(tx, view, nHeight);
496 BOOST_FOREACH(const OutputDescription &outDescription, tx.vShieldedOutput) {
497 sapling_tree.append(outDescription.cm);
501 pblock->vtx.push_back(tx);
502 pblocktemplate->vTxFees.push_back(nTxFees);
503 pblocktemplate->vTxSigOps.push_back(nTxSigOps);
504 nBlockSize += nTxSize;
506 nBlockSigOps += nTxSigOps;
511 LogPrintf("priority %.1f fee %s txid %s\n",dPriority, feeRate.ToString(), tx.GetHash().ToString());
514 // Add transactions that depend on this one to the priority queue
515 if (mapDependers.count(hash))
517 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
519 if (!porphan->setDependsOn.empty())
521 porphan->setDependsOn.erase(hash);
522 if (porphan->setDependsOn.empty())
524 vecPriority.push_back(TxPriority(porphan->dPriority, porphan->feeRate, porphan->ptx));
525 std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
532 nLastBlockTx = nBlockTx;
533 nLastBlockSize = nBlockSize;
534 blocktime = 1 + std::max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
535 //pblock->nTime = blocktime + 1;
536 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, Params().GetConsensus());
538 int32_t stakeHeight = chainActive.Height() + 1;
540 //LogPrintf("CreateNewBlock(): total size %u blocktime.%u nBits.%08x\n", nBlockSize,blocktime,pblock->nBits);
541 if ( ASSETCHAINS_SYMBOL[0] != 0 && isStake )
543 uint64_t txfees,utxovalue; uint32_t txtime; uint256 utxotxid; int32_t i,siglen,numsigs,utxovout; uint8_t utxosig[128],*ptr;
544 CMutableTransaction txStaked = CreateNewContextualCMutableTransaction(Params().GetConsensus(), stakeHeight);
546 //if ( blocktime > pindexPrev->GetMedianTimePast()+60 )
547 // blocktime = pindexPrev->GetMedianTimePast() + 60;
548 if (ASSETCHAINS_LWMAPOS != 0)
551 arith_uint256 posHash;
553 siglen = verus_staked(pblock, txStaked, nBitsPOS, posHash, utxosig, pk);
554 blocktime = GetAdjustedTime();
556 // change the scriptPubKeyIn to the same output script exactly as the staking transaction
558 scriptPubKeyIn = CScript(txStaked.vout[0].scriptPubKey);
562 siglen = komodo_staked(txStaked, pblock->nBits, &blocktime, &txtime, &utxotxid, &utxovout, &utxovalue, utxosig);
569 // after Sapling, stake transactions have a fee, but it is recovered in the reward
570 // this ensures that a rebroadcast goes through quickly to begin staking again
571 txfees = sapling ? DEFAULT_STAKE_TXFEE : 0;
573 pblock->vtx.push_back(txStaked);
574 pblocktemplate->vTxFees.push_back(txfees);
575 pblocktemplate->vTxSigOps.push_back(GetLegacySigOpCount(txStaked));
577 pblock->nTime = blocktime;
578 //printf("staking PoS ht.%d t%u lag.%u\n",(int32_t)chainActive.LastTip()->GetHeight()+1,blocktime,(uint32_t)(GetAdjustedTime() - (blocktime-13)));
579 } else return(0); //fprintf(stderr,"no utxos eligible for staking\n");
582 // Create coinbase tx
583 CMutableTransaction txNew = CreateNewContextualCMutableTransaction(consensusParams, nHeight);
585 txNew.vin[0].prevout.SetNull();
586 txNew.vin[0].scriptSig = CScript() << nHeight << OP_0;
588 txNew.vout.resize(1);
589 txNew.vout[0].scriptPubKey = scriptPubKeyIn;
590 txNew.vout[0].nValue = GetBlockSubsidy(nHeight,consensusParams) + nFees;
592 // once we get to Sapling, enable CC StakeGuard for stake transactions
593 if (isStake && sapling)
595 // if there is a specific destination, use it
596 CTransaction stakeTx = pblock->vtx[pblock->vtx.size() - 1];
598 if (ValidateStakeTransaction(stakeTx, p, false))
600 if (!p.pk.IsValid() || !MakeGuardedOutput(txNew.vout[0].nValue, p.pk, stakeTx, txNew.vout[0]))
602 fprintf(stderr,"CreateNewBlock: failed to make GuardedOutput on staking coinbase\n");
608 fprintf(stderr,"CreateNewBlock: invalid stake transaction\n");
613 txNew.nExpiryHeight = 0;
614 txNew.nLockTime = std::max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
616 if ( ASSETCHAINS_SYMBOL[0] == 0 && IS_KOMODO_NOTARY != 0 && My_notaryid >= 0 )
617 txNew.vout[0].nValue += 5000;
619 // check if coinbase transactions must be time locked at current subsidy and prepend the time lock
620 // to transaction if so, cast for GTE operator
621 if ((uint64_t)(txNew.vout[0].nValue) >= ASSETCHAINS_TIMELOCKGTE)
623 int32_t opretlen, p2shlen, scriptlen;
624 CScriptExt opretScript = CScriptExt();
626 txNew.vout.resize(2);
628 // prepend time lock to original script unless original script is P2SH, in which case, we will leave the coins
629 // protected only by the time lock rather than 100% inaccessible
630 opretScript.AddCheckLockTimeVerify(komodo_block_unlocktime(nHeight));
631 if (scriptPubKeyIn.IsPayToScriptHash() || scriptPubKeyIn.IsPayToCryptoCondition())
633 fprintf(stderr,"CreateNewBlock: attempt to add timelock to pay2sh or pay2cc\n");
637 opretScript += scriptPubKeyIn;
639 txNew.vout[0].scriptPubKey = CScriptExt().PayToScriptHash(CScriptID(opretScript));
640 txNew.vout[1].scriptPubKey = CScriptExt().OpReturnScript(opretScript, OPRETTYPE_TIMELOCK);
641 txNew.vout[1].nValue = 0;
642 } // timelocks and commissions are currently incompatible due to validation complexity of the combination
643 else if ( nHeight > 1 && ASSETCHAINS_SYMBOL[0] != 0 && ASSETCHAINS_OVERRIDE_PUBKEY33[0] != 0 && ASSETCHAINS_COMMISSION != 0 && (commission= komodo_commission((CBlock*)&pblocktemplate->block)) != 0 )
645 int32_t i; uint8_t *ptr;
646 txNew.vout.resize(2);
647 txNew.vout[1].nValue = commission;
648 txNew.vout[1].scriptPubKey.resize(35);
649 ptr = (uint8_t *)&txNew.vout[1].scriptPubKey[0];
652 ptr[i+1] = ASSETCHAINS_OVERRIDE_PUBKEY33[i];
653 ptr[34] = OP_CHECKSIG;
654 //printf("autocreate commision vout\n");
657 pblock->vtx[0] = txNew;
658 pblocktemplate->vTxFees[0] = -nFees;
660 // if not Verus stake, setup nonce, otherwise, leave it alone
661 if (!isStake || ASSETCHAINS_LWMAPOS == 0)
664 arith_uint256 nonce = UintToArith256(GetRandHash());
666 // Clear the top 16 and bottom 16 or 24 bits (for local use as thread flags and counters)
667 nonce <<= ASSETCHAINS_NONCESHIFT[ASSETCHAINS_ALGO];
669 pblock->nNonce = ArithToUint256(nonce);
673 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
674 pblock->hashFinalSaplingRoot = sapling_tree.root();
676 // all Verus PoS chains need this data in the block at all times
677 if ( ASSETCHAINS_LWMAPOS || ASSETCHAINS_SYMBOL[0] == 0 || ASSETCHAINS_STAKED == 0 || KOMODO_MININGTHREADS > 0 )
679 UpdateTime(pblock, Params().GetConsensus(), pindexPrev);
680 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, Params().GetConsensus());
682 pblock->nSolution.clear();
683 pblocktemplate->vTxSigOps[0] = GetLegacySigOpCount(pblock->vtx[0]);
684 if ( ASSETCHAINS_SYMBOL[0] == 0 && IS_KOMODO_NOTARY != 0 && My_notaryid >= 0 )
687 CMutableTransaction txNotary = CreateNewContextualCMutableTransaction(Params().GetConsensus(), chainActive.Height() + 1);
688 if ( pblock->nTime < pindexPrev->nTime+60 )
689 pblock->nTime = pindexPrev->nTime + 60;
692 uint8_t tmpbuffer[40]; uint32_t r; int32_t n=0; uint256 randvals;
693 memcpy(&tmpbuffer[n],&My_notaryid,sizeof(My_notaryid)), n += sizeof(My_notaryid);
694 memcpy(&tmpbuffer[n],&Mining_height,sizeof(Mining_height)), n += sizeof(Mining_height);
695 memcpy(&tmpbuffer[n],&pblock->hashPrevBlock,sizeof(pblock->hashPrevBlock)), n += sizeof(pblock->hashPrevBlock);
696 vcalc_sha256(0,(uint8_t *)&randvals,tmpbuffer,n);
697 memcpy(&r,&randvals,sizeof(r));
698 pblock->nTime += (r % (33 - gpucount)*(33 - gpucount));
700 if ( komodo_notaryvin(txNotary,NOTARY_PUBKEY33) > 0 )
702 CAmount txfees = 5000;
703 pblock->vtx.push_back(txNotary);
704 pblocktemplate->vTxFees.push_back(txfees);
705 pblocktemplate->vTxSigOps.push_back(GetLegacySigOpCount(txNotary));
707 pblocktemplate->vTxFees[0] = -nFees;
708 //*(uint64_t *)(&pblock->vtx[0].vout[0].nValue) += txfees;
709 //fprintf(stderr,"added notaryvin\n");
713 fprintf(stderr,"error adding notaryvin, need to create 0.0001 utxos\n");
717 else if ( ASSETCHAINS_CC == 0 && pindexPrev != 0 && ASSETCHAINS_STAKED == 0 && (ASSETCHAINS_SYMBOL[0] != 0 || IS_KOMODO_NOTARY == 0 || My_notaryid < 0) )
719 CValidationState state;
720 //fprintf(stderr,"check validity\n");
721 if ( !TestBlockValidity(state, *pblock, pindexPrev, false, false)) // invokes CC checks
723 throw std::runtime_error("CreateNewBlock(): TestBlockValidity failed");
725 //fprintf(stderr,"valid\n");
728 //fprintf(stderr,"done new block\n");
729 return pblocktemplate.release();
734 boost::optional<CScript> GetMinerScriptPubKey(CReserveKey& reservekey)
736 boost::optional<CScript> GetMinerScriptPubKey()
740 CBitcoinAddress addr;
741 if (addr.SetString(GetArg("-mineraddress", ""))) {
742 addr.GetKeyID(keyID);
746 if (!reservekey.GetReservedKey(pubkey)) {
747 return boost::optional<CScript>();
749 keyID = pubkey.GetID();
751 return boost::optional<CScript>();
755 CScript scriptPubKey = CScript() << OP_DUP << OP_HASH160 << ToByteVector(keyID) << OP_EQUALVERIFY << OP_CHECKSIG;
760 CBlockTemplate* CreateNewBlockWithKey(CReserveKey& reservekey)
762 boost::optional<CScript> scriptPubKey = GetMinerScriptPubKey(reservekey);
764 CBlockTemplate* CreateNewBlockWithKey()
766 boost::optional<CScript> scriptPubKey = GetMinerScriptPubKey();
772 return CreateNewBlock(*scriptPubKey);
775 //////////////////////////////////////////////////////////////////////////////
782 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
784 // Update nExtraNonce
785 static uint256 hashPrevBlock;
786 if (hashPrevBlock != pblock->hashPrevBlock)
789 hashPrevBlock = pblock->hashPrevBlock;
792 unsigned int nHeight = pindexPrev->GetHeight()+1; // Height first in coinbase required for block.version=2
793 CMutableTransaction txCoinbase(pblock->vtx[0]);
794 txCoinbase.vin[0].scriptSig = (CScript() << nHeight << CScriptNum(nExtraNonce)) + COINBASE_FLAGS;
795 assert(txCoinbase.vin[0].scriptSig.size() <= 100);
797 pblock->vtx[0] = txCoinbase;
798 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
802 //////////////////////////////////////////////////////////////////////////////
807 CBlockTemplate* CreateNewBlockWithKey(CReserveKey& reservekey, int32_t nHeight, int32_t gpucount, bool isStake)
809 CPubKey pubkey; CScript scriptPubKey; uint8_t *ptr; int32_t i;
810 if ( nHeight == 1 && ASSETCHAINS_OVERRIDE_PUBKEY33[0] != 0 )
812 scriptPubKey = CScript() << ParseHex(ASSETCHAINS_OVERRIDE_PUBKEY) << OP_CHECKSIG;
814 else if ( USE_EXTERNAL_PUBKEY != 0 )
816 //fprintf(stderr,"use notary pubkey\n");
817 scriptPubKey = CScript() << ParseHex(NOTARY_PUBKEY) << OP_CHECKSIG;
821 if (!reservekey.GetReservedKey(pubkey))
825 scriptPubKey.resize(35);
826 ptr = (uint8_t *)pubkey.begin();
827 scriptPubKey[0] = 33;
829 scriptPubKey[i+1] = ptr[i];
830 scriptPubKey[34] = OP_CHECKSIG;
831 //scriptPubKey = CScript() << ToByteVector(pubkey) << OP_CHECKSIG;
833 return CreateNewBlock(scriptPubKey, gpucount, isStake);
836 void komodo_broadcast(CBlock *pblock,int32_t limit)
839 //fprintf(stderr,"broadcast new block t.%u\n",(uint32_t)time(NULL));
842 BOOST_FOREACH(CNode* pnode, vNodes)
844 if ( pnode->hSocket == INVALID_SOCKET )
846 if ( (rand() % n) == 0 )
848 pnode->PushMessage("block", *pblock);
854 //fprintf(stderr,"finished broadcast new block t.%u\n",(uint32_t)time(NULL));
857 static bool ProcessBlockFound(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
859 static bool ProcessBlockFound(CBlock* pblock)
860 #endif // ENABLE_WALLET
862 LogPrintf("%s\n", pblock->ToString());
863 LogPrintf("generated %s height.%d\n", FormatMoney(pblock->vtx[0].vout[0].nValue),chainActive.LastTip()->GetHeight()+1);
867 if (pblock->hashPrevBlock != chainActive.LastTip()->GetBlockHash())
869 uint256 hash; int32_t i;
870 hash = pblock->hashPrevBlock;
871 for (i=31; i>=0; i--)
872 fprintf(stderr,"%02x",((uint8_t *)&hash)[i]);
873 fprintf(stderr," <- prev (stale)\n");
874 hash = chainActive.LastTip()->GetBlockHash();
875 for (i=31; i>=0; i--)
876 fprintf(stderr,"%02x",((uint8_t *)&hash)[i]);
877 fprintf(stderr," <- chainTip (stale)\n");
879 return error("KomodoMiner: generated block is stale");
884 // Remove key from key pool
885 if ( IS_KOMODO_NOTARY == 0 )
887 if (GetArg("-mineraddress", "").empty()) {
888 // Remove key from key pool
889 reservekey.KeepKey();
892 // Track how many getdata requests this block gets
895 //fprintf(stderr,"lock cs_wallet\n");
896 LOCK(wallet.cs_wallet);
897 wallet.mapRequestCount[pblock->GetHash()] = 0;
900 //fprintf(stderr,"process new block\n");
902 // Process this block the same as if we had received it from another node
903 CValidationState state;
904 if (!ProcessNewBlock(1,chainActive.LastTip()->GetHeight()+1,state, NULL, pblock, true, NULL))
905 return error("KomodoMiner: ProcessNewBlock, block not accepted");
907 TrackMinedBlock(pblock->GetHash());
908 komodo_broadcast(pblock,16);
912 int32_t komodo_baseid(char *origbase);
913 int32_t komodo_eligiblenotary(uint8_t pubkeys[66][33],int32_t *mids,uint32_t *blocktimes,int32_t *nonzpkeysp,int32_t height);
914 arith_uint256 komodo_PoWtarget(int32_t *percPoSp,arith_uint256 target,int32_t height,int32_t goalperc);
915 int32_t FOUND_BLOCK,KOMODO_MAYBEMINED;
916 extern int32_t KOMODO_LASTMINED,KOMODO_INSYNC;
917 int32_t roundrobin_delay;
918 arith_uint256 HASHTarget,HASHTarget_POW;
920 // wait for peers to connect
921 int32_t waitForPeers(const CChainParams &chainparams)
923 if (chainparams.MiningRequiresPeers())
927 boost::this_thread::interruption_point();
929 fvNodesEmpty = vNodes.empty();
931 if (fvNodesEmpty || IsNotInSync())
933 int loops = 0, blockDiff = 0, newDiff = 0;
938 MilliSleep(1000 + rand() % 4000);
939 boost::this_thread::interruption_point();
941 fvNodesEmpty = vNodes.empty();
945 if ((newDiff = IsNotInSync()) > 1)
947 if (blockDiff != newDiff)
960 } while (fvNodesEmpty || IsNotInSync());
961 MilliSleep(100 + rand() % 400);
967 CBlockIndex *get_chainactive(int32_t height)
969 if ( chainActive.LastTip() != 0 )
971 if ( height <= chainActive.LastTip()->GetHeight() )
974 return(chainActive[height]);
976 // else fprintf(stderr,"get_chainactive height %d > active.%d\n",height,chainActive.Tip()->GetHeight());
978 //fprintf(stderr,"get_chainactive null chainActive.Tip() height %d\n",height);
983 * A separate thread to stake, while the miner threads mine.
985 void static VerusStaker(CWallet *pwallet)
987 LogPrintf("Verus staker thread started\n");
988 RenameThread("verus-staker");
990 const CChainParams& chainparams = Params();
991 auto consensusParams = chainparams.GetConsensus();
993 // Each thread has its own key
994 CReserveKey reservekey(pwallet);
996 // Each thread has its own counter
997 unsigned int nExtraNonce = 0;
998 std::vector<unsigned char> solnPlaceholder = std::vector<unsigned char>();
999 solnPlaceholder.resize(Eh200_9.SolutionWidth);
1000 uint8_t *script; uint64_t total,checktoshis; int32_t i,j;
1002 while ( (ASSETCHAIN_INIT == 0 || KOMODO_INITDONE == 0) ) //chainActive.Tip()->GetHeight() != 235300 &&
1005 if ( komodo_baseid(ASSETCHAINS_SYMBOL) < 0 )
1009 // try a nice clean peer connection to start
1010 CBlockIndex *pindexPrev, *pindexCur;
1012 pindexPrev = chainActive.LastTip();
1013 MilliSleep(5000 + rand() % 5000);
1014 waitForPeers(chainparams);
1015 pindexCur = chainActive.LastTip();
1016 } while (pindexPrev != pindexCur);
1021 waitForPeers(chainparams);
1022 CBlockIndex* pindexPrev = chainActive.LastTip();
1023 printf("Staking height %d for %s\n", pindexPrev->GetHeight() + 1, ASSETCHAINS_SYMBOL);
1026 unsigned int nTransactionsUpdatedLast = mempool.GetTransactionsUpdated();
1027 if ( Mining_height != pindexPrev->GetHeight()+1 )
1029 Mining_height = pindexPrev->GetHeight()+1;
1030 Mining_start = (uint32_t)time(NULL);
1033 // Check for stop or if block needs to be rebuilt
1034 boost::this_thread::interruption_point();
1036 // try to stake a block
1037 CBlockTemplate *ptr = NULL;
1038 if (Mining_height > VERUS_MIN_STAKEAGE)
1039 ptr = CreateNewBlockWithKey(reservekey, Mining_height, 0, true);
1043 // wait to try another staking block until after the tip moves again
1044 while ( chainActive.LastTip() == pindexPrev )
1049 unique_ptr<CBlockTemplate> pblocktemplate(ptr);
1050 if (!pblocktemplate.get())
1052 if (GetArg("-mineraddress", "").empty()) {
1053 LogPrintf("Error in %s staker: Keypool ran out, please call keypoolrefill before restarting the mining thread\n",
1054 ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO]);
1056 // Should never reach here, because -mineraddress validity is checked in init.cpp
1057 LogPrintf("Error in %s staker: Invalid %s -mineraddress\n", ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO], ASSETCHAINS_SYMBOL);
1062 CBlock *pblock = &pblocktemplate->block;
1063 LogPrintf("Staking with %u transactions in block (%u bytes)\n", pblock->vtx.size(),::GetSerializeSize(*pblock,SER_NETWORK,PROTOCOL_VERSION));
1067 int64_t nStart = GetTime();
1069 // take up the necessary space for alignment
1070 pblock->nSolution = solnPlaceholder;
1072 // we don't use this, but IncrementExtraNonce is the function that builds the merkle tree
1073 unsigned int nExtraNonce = 0;
1074 IncrementExtraNonce(pblock, pindexPrev, nExtraNonce);
1076 if (vNodes.empty() && chainparams.MiningRequiresPeers())
1078 if ( Mining_height > ASSETCHAINS_MINHEIGHT )
1080 fprintf(stderr,"no nodes, attempting reconnect\n");
1085 if (mempool.GetTransactionsUpdated() != nTransactionsUpdatedLast && GetTime() - nStart > 60)
1087 fprintf(stderr,"timeout, retrying\n");
1091 if ( pindexPrev != chainActive.LastTip() )
1093 printf("Block %d added to chain\n", chainActive.LastTip()->GetHeight());
1098 int32_t unlockTime = komodo_block_unlocktime(Mining_height);
1099 int64_t subsidy = (int64_t)(pblock->vtx[0].vout[0].nValue);
1101 uint256 hashTarget = ArithToUint256(arith_uint256().SetCompact(pblock->nBits));
1103 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, consensusParams);
1105 UpdateTime(pblock, consensusParams, pindexPrev);
1107 ProcessBlockFound(pblock, *pwallet, reservekey);
1109 LogPrintf("Using %s algorithm:\n", ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO]);
1110 LogPrintf("Staked block found \n hash: %s \ntarget: %s\n", pblock->GetHash().GetHex(), hashTarget.GetHex());
1111 printf("Found block %d \n", Mining_height );
1112 printf("staking reward %.8f %s!\n", (double)subsidy / (double)COIN, ASSETCHAINS_SYMBOL);
1114 post.SetCompact(pblock->GetVerusPOSTarget());
1115 pindexPrev = get_chainactive(Mining_height - 100);
1116 CTransaction &sTx = pblock->vtx[pblock->vtx.size()-1];
1117 printf("POS hash: %s \ntarget: %s\n",
1118 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());
1119 if (unlockTime > Mining_height && subsidy >= ASSETCHAINS_TIMELOCKGTE)
1120 printf("- timelocked until block %i\n", unlockTime);
1124 // Check for stop or if block needs to be rebuilt
1125 boost::this_thread::interruption_point();
1129 // In regression test mode, stop mining after a block is found.
1130 if (chainparams.MineBlocksOnDemand()) {
1131 throw boost::thread_interrupted();
1135 catch (const boost::thread_interrupted&)
1137 LogPrintf("VerusStaker terminated\n");
1140 catch (const std::runtime_error &e)
1142 LogPrintf("VerusStaker runtime error: %s\n", e.what());
1147 void static BitcoinMiner_noeq(CWallet *pwallet)
1149 void static BitcoinMiner_noeq()
1152 LogPrintf("%s miner started\n", ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO]);
1153 RenameThread("verushash-miner");
1155 #ifdef ENABLE_WALLET
1156 // Each thread has its own key
1157 CReserveKey reservekey(pwallet);
1160 const CChainParams& chainparams = Params();
1161 // Each thread has its own counter
1162 unsigned int nExtraNonce = 0;
1163 std::vector<unsigned char> solnPlaceholder = std::vector<unsigned char>();
1164 solnPlaceholder.resize(Eh200_9.SolutionWidth);
1165 uint8_t *script; uint64_t total,checktoshis; int32_t i,j;
1167 while ( (ASSETCHAIN_INIT == 0 || KOMODO_INITDONE == 0) ) //chainActive.Tip()->GetHeight() != 235300 &&
1170 if ( komodo_baseid(ASSETCHAINS_SYMBOL) < 0 )
1174 SetThreadPriority(THREAD_PRIORITY_LOWEST);
1176 // try a nice clean peer connection to start
1177 CBlockIndex *pindexPrev, *pindexCur;
1179 pindexPrev = chainActive.LastTip();
1180 MilliSleep(5000 + rand() % 5000);
1181 waitForPeers(chainparams);
1182 pindexCur = chainActive.LastTip();
1183 } while (pindexPrev != pindexCur);
1185 // this will not stop printing more than once in all cases, but it will allow us to print in all cases
1186 // and print duplicates rarely without having to synchronize
1187 static CBlockIndex *lastChainTipPrinted;
1189 miningTimer.start();
1192 printf("Mining %s with %s\n", ASSETCHAINS_SYMBOL, ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO]);
1196 waitForPeers(chainparams);
1198 pindexPrev = chainActive.LastTip();
1201 // prevent forking on startup before the diff algorithm kicks in
1202 if (pindexPrev->GetHeight() < 50 || pindexPrev != chainActive.LastTip())
1205 pindexPrev = chainActive.LastTip();
1206 MilliSleep(5000 + rand() % 5000);
1207 } while (pindexPrev != chainActive.LastTip());
1211 unsigned int nTransactionsUpdatedLast = mempool.GetTransactionsUpdated();
1212 if ( Mining_height != pindexPrev->GetHeight()+1 )
1214 Mining_height = pindexPrev->GetHeight()+1;
1215 Mining_start = (uint32_t)time(NULL);
1218 if (lastChainTipPrinted != pindexPrev)
1220 printf("Mining height %d\n", Mining_height);
1221 lastChainTipPrinted = pindexPrev;
1224 miningTimer.start();
1226 #ifdef ENABLE_WALLET
1227 CBlockTemplate *ptr = CreateNewBlockWithKey(reservekey, Mining_height, 0);
1229 CBlockTemplate *ptr = CreateNewBlockWithKey();
1233 static uint32_t counter;
1234 if ( counter++ < 100 )
1235 fprintf(stderr,"created illegal block, retry\n");
1239 unique_ptr<CBlockTemplate> pblocktemplate(ptr);
1240 if (!pblocktemplate.get())
1242 if (GetArg("-mineraddress", "").empty()) {
1243 LogPrintf("Error in %s miner: Keypool ran out, please call keypoolrefill before restarting the mining thread\n",
1244 ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO]);
1246 // Should never reach here, because -mineraddress validity is checked in init.cpp
1247 LogPrintf("Error in %s miner: Invalid %s -mineraddress\n", ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO], ASSETCHAINS_SYMBOL);
1251 CBlock *pblock = &pblocktemplate->block;
1252 if ( ASSETCHAINS_SYMBOL[0] != 0 )
1254 if ( ASSETCHAINS_REWARD[0] == 0 && !ASSETCHAINS_LASTERA )
1256 if ( pblock->vtx.size() == 1 && pblock->vtx[0].vout.size() == 1 && Mining_height > ASSETCHAINS_MINHEIGHT )
1258 static uint32_t counter;
1259 if ( counter++ < 10 )
1260 fprintf(stderr,"skip generating %s on-demand block, no tx avail\n",ASSETCHAINS_SYMBOL);
1263 } else fprintf(stderr,"%s vouts.%d mining.%d vs %d\n",ASSETCHAINS_SYMBOL,(int32_t)pblock->vtx[0].vout.size(),Mining_height,ASSETCHAINS_MINHEIGHT);
1266 IncrementExtraNonce(pblock, pindexPrev, nExtraNonce);
1267 LogPrintf("Running %s miner with %u transactions in block (%u bytes)\n",ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO],
1268 pblock->vtx.size(),::GetSerializeSize(*pblock,SER_NETWORK,PROTOCOL_VERSION));
1272 uint32_t savebits; int64_t nStart = GetTime();
1274 pblock->nSolution = solnPlaceholder;
1275 savebits = pblock->nBits;
1276 arith_uint256 hashTarget = arith_uint256().SetCompact(pblock->nBits);
1277 arith_uint256 mask(ASSETCHAINS_NONCEMASK[ASSETCHAINS_ALGO]);
1281 if ( pindexPrev != chainActive.LastTip() )
1283 if (lastChainTipPrinted != chainActive.LastTip())
1285 lastChainTipPrinted = chainActive.LastTip();
1286 printf("Block %d added to chain\n", lastChainTipPrinted->GetHeight());
1292 if ( ASSETCHAINS_STAKED != 0 )
1295 hashTarget = komodo_PoWtarget(&percPoS,hashTarget,Mining_height,ASSETCHAINS_STAKED);
1296 for (z=31; z>=0; z--)
1297 fprintf(stderr,"%02x",((uint8_t *)&hashTarget)[z]);
1298 fprintf(stderr," PoW for staked coin PoS %d%% vs target %d%%\n",percPoS,(int32_t)ASSETCHAINS_STAKED);
1303 arith_uint256 arNonce = UintToArith256(pblock->nNonce);
1305 CVerusHashWriter ss = CVerusHashWriter(SER_GETHASH, PROTOCOL_VERSION);
1306 ss << *((CBlockHeader *)pblock);
1307 int64_t *extraPtr = ss.xI64p();
1308 CVerusHash &vh = ss.GetState();
1309 uint256 hashResult = uint256();
1311 int64_t i, count = ASSETCHAINS_NONCEMASK[ASSETCHAINS_ALGO] + 1;
1312 int64_t hashesToGo = ASSETCHAINS_HASHESPERROUND[ASSETCHAINS_ALGO];
1314 // for speed check NONCEMASK at a time
1315 for (i = 0; i < count; i++)
1318 vh.ExtraHash((unsigned char *)&hashResult);
1320 if ( UintToArith256(hashResult) <= hashTarget )
1322 if (pblock->nSolution.size() != 1344)
1324 LogPrintf("ERROR: Block solution is not 1344 bytes as it should be");
1329 SetThreadPriority(THREAD_PRIORITY_NORMAL);
1331 *((int64_t *)&(pblock->nSolution.data()[pblock->nSolution.size() - 15])) = i;
1333 int32_t unlockTime = komodo_block_unlocktime(Mining_height);
1334 int64_t subsidy = (int64_t)(pblock->vtx[0].vout[0].nValue);
1336 LogPrintf("Using %s algorithm:\n", ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO]);
1337 LogPrintf("proof-of-work found \n hash: %s \ntarget: %s\n", pblock->GetHash().GetHex(), hashTarget.GetHex());
1338 printf("Found block %d \n", Mining_height );
1339 printf("mining reward %.8f %s!\n", (double)subsidy / (double)COIN, ASSETCHAINS_SYMBOL);
1340 printf(" hash: %s \ntarget: %s\n", pblock->GetHash().GetHex().c_str(), hashTarget.GetHex().c_str());
1341 if (unlockTime > Mining_height && subsidy >= ASSETCHAINS_TIMELOCKGTE)
1342 printf("- timelocked until block %i\n", unlockTime);
1345 #ifdef ENABLE_WALLET
1346 ProcessBlockFound(pblock, *pwallet, reservekey);
1348 ProcessBlockFound(pblock));
1350 SetThreadPriority(THREAD_PRIORITY_LOWEST);
1353 // check periodically if we're stale
1356 if ( pindexPrev != chainActive.LastTip() )
1358 if (lastChainTipPrinted != chainActive.LastTip())
1360 lastChainTipPrinted = chainActive.LastTip();
1361 printf("Block %d added to chain\n", lastChainTipPrinted->GetHeight());
1365 hashesToGo = ASSETCHAINS_HASHESPERROUND[ASSETCHAINS_ALGO];
1374 // Check for stop or if block needs to be rebuilt
1375 boost::this_thread::interruption_point();
1377 if (vNodes.empty() && chainparams.MiningRequiresPeers())
1379 if ( Mining_height > ASSETCHAINS_MINHEIGHT )
1381 fprintf(stderr,"no nodes, attempting reconnect\n");
1386 if (mempool.GetTransactionsUpdated() != nTransactionsUpdatedLast && GetTime() - nStart > 60)
1388 fprintf(stderr,"timeout, retrying\n");
1392 if ( pindexPrev != chainActive.LastTip() )
1394 if (lastChainTipPrinted != chainActive.LastTip())
1396 lastChainTipPrinted = chainActive.LastTip();
1397 printf("Block %d added to chain\n", lastChainTipPrinted->GetHeight());
1403 printf("%llu mega hashes complete - working\n", (ASSETCHAINS_NONCEMASK[ASSETCHAINS_ALGO] + 1) / 1048576);
1405 printf("%lu mega hashes complete - working\n", (ASSETCHAINS_NONCEMASK[ASSETCHAINS_ALGO] + 1) / 1048576);
1412 catch (const boost::thread_interrupted&)
1415 LogPrintf("%s miner terminated\n", ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO]);
1418 catch (const std::runtime_error &e)
1421 LogPrintf("%s miner runtime error: %s\n", ASSETCHAINS_ALGORITHMS[ASSETCHAINS_ALGO], e.what());
1427 #ifdef ENABLE_WALLET
1428 void static BitcoinMiner(CWallet *pwallet)
1430 void static BitcoinMiner()
1433 LogPrintf("KomodoMiner started\n");
1434 SetThreadPriority(THREAD_PRIORITY_LOWEST);
1435 RenameThread("komodo-miner");
1436 const CChainParams& chainparams = Params();
1438 #ifdef ENABLE_WALLET
1439 // Each thread has its own key
1440 CReserveKey reservekey(pwallet);
1443 // Each thread has its own counter
1444 unsigned int nExtraNonce = 0;
1446 unsigned int n = chainparams.EquihashN();
1447 unsigned int k = chainparams.EquihashK();
1448 uint8_t *script; uint64_t total,checktoshis; int32_t i,j,gpucount=KOMODO_MAXGPUCOUNT,notaryid = -1;
1449 while ( (ASSETCHAIN_INIT == 0 || KOMODO_INITDONE == 0) )
1452 if ( komodo_baseid(ASSETCHAINS_SYMBOL) < 0 )
1455 if ( ASSETCHAINS_SYMBOL[0] == 0 )
1456 komodo_chosennotary(¬aryid,chainActive.LastTip()->GetHeight(),NOTARY_PUBKEY33,(uint32_t)chainActive.LastTip()->GetBlockTime());
1457 if ( notaryid != My_notaryid )
1458 My_notaryid = notaryid;
1460 //if ( notaryid >= 0 || ASSETCHAINS_SYMBOL[0] != 0 )
1462 //else solver = "default";
1463 assert(solver == "tromp" || solver == "default");
1464 LogPrint("pow", "Using Equihash solver \"%s\" with n = %u, k = %u\n", solver, n, k);
1465 if ( ASSETCHAINS_SYMBOL[0] != 0 )
1466 fprintf(stderr,"notaryid.%d Mining.%s with %s\n",notaryid,ASSETCHAINS_SYMBOL,solver.c_str());
1468 bool cancelSolver = false;
1469 boost::signals2::connection c = uiInterface.NotifyBlockTip.connect(
1470 [&m_cs, &cancelSolver](const uint256& hashNewTip) mutable {
1471 std::lock_guard<std::mutex> lock{m_cs};
1472 cancelSolver = true;
1475 miningTimer.start();
1478 if ( ASSETCHAINS_SYMBOL[0] != 0 )
1479 fprintf(stderr,"try %s Mining with %s\n",ASSETCHAINS_SYMBOL,solver.c_str());
1482 if (chainparams.MiningRequiresPeers()) //chainActive.LastTip()->GetHeight() != 235300 &&
1484 //if ( ASSETCHAINS_SEED != 0 && chainActive.LastTip()->GetHeight() < 100 )
1486 // Busy-wait for the network to come online so we don't waste time mining
1487 // on an obsolete chain. In regtest mode we expect to fly solo.
1493 fvNodesEmpty = vNodes.empty();
1495 if (!fvNodesEmpty )//&& !IsInitialBlockDownload())
1498 //fprintf(stderr,"fvNodesEmpty %d IsInitialBlockDownload(%s) %d\n",(int32_t)fvNodesEmpty,ASSETCHAINS_SYMBOL,(int32_t)IsInitialBlockDownload());
1501 //fprintf(stderr,"%s Found peers\n",ASSETCHAINS_SYMBOL);
1502 miningTimer.start();
1507 unsigned int nTransactionsUpdatedLast = mempool.GetTransactionsUpdated();
1508 CBlockIndex* pindexPrev = chainActive.LastTip();
1509 if ( Mining_height != pindexPrev->GetHeight()+1 )
1511 Mining_height = pindexPrev->GetHeight()+1;
1512 Mining_start = (uint32_t)time(NULL);
1514 if ( ASSETCHAINS_SYMBOL[0] != 0 && ASSETCHAINS_STAKED == 0 )
1516 //fprintf(stderr,"%s create new block ht.%d\n",ASSETCHAINS_SYMBOL,Mining_height);
1520 #ifdef ENABLE_WALLET
1521 // notaries always default to staking
1522 CBlockTemplate *ptr = CreateNewBlockWithKey(reservekey, pindexPrev->GetHeight()+1, gpucount, ASSETCHAINS_STAKED != 0 && GetArg("-genproclimit", 0) == 0);
1524 CBlockTemplate *ptr = CreateNewBlockWithKey();
1528 static uint32_t counter;
1529 if ( counter++ < 100 && ASSETCHAINS_STAKED == 0 )
1530 fprintf(stderr,"created illegal block, retry\n");
1534 //fprintf(stderr,"get template\n");
1535 unique_ptr<CBlockTemplate> pblocktemplate(ptr);
1536 if (!pblocktemplate.get())
1538 if (GetArg("-mineraddress", "").empty()) {
1539 LogPrintf("Error in KomodoMiner: Keypool ran out, please call keypoolrefill before restarting the mining thread\n");
1541 // Should never reach here, because -mineraddress validity is checked in init.cpp
1542 LogPrintf("Error in KomodoMiner: Invalid -mineraddress\n");
1546 CBlock *pblock = &pblocktemplate->block;
1547 if ( ASSETCHAINS_SYMBOL[0] != 0 )
1549 if ( ASSETCHAINS_REWARD[0] == 0 && !ASSETCHAINS_LASTERA )
1551 if ( pblock->vtx.size() == 1 && pblock->vtx[0].vout.size() == 1 && Mining_height > ASSETCHAINS_MINHEIGHT )
1553 static uint32_t counter;
1554 if ( counter++ < 10 )
1555 fprintf(stderr,"skip generating %s on-demand block, no tx avail\n",ASSETCHAINS_SYMBOL);
1558 } else fprintf(stderr,"%s vouts.%d mining.%d vs %d\n",ASSETCHAINS_SYMBOL,(int32_t)pblock->vtx[0].vout.size(),Mining_height,ASSETCHAINS_MINHEIGHT);
1561 IncrementExtraNonce(pblock, pindexPrev, nExtraNonce);
1562 //fprintf(stderr,"Running KomodoMiner.%s with %u transactions in block\n",solver.c_str(),(int32_t)pblock->vtx.size());
1563 LogPrintf("Running KomodoMiner.%s with %u transactions in block (%u bytes)\n",solver.c_str(),pblock->vtx.size(),::GetSerializeSize(*pblock,SER_NETWORK,PROTOCOL_VERSION));
1567 uint8_t pubkeys[66][33]; arith_uint256 bnMaxPoSdiff; uint32_t blocktimes[66]; int mids[256],nonzpkeys,i,j,externalflag; uint32_t savebits; int64_t nStart = GetTime();
1568 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, Params().GetConsensus());
1569 savebits = pblock->nBits;
1570 HASHTarget = arith_uint256().SetCompact(savebits);
1571 roundrobin_delay = ROUNDROBIN_DELAY;
1572 if ( ASSETCHAINS_SYMBOL[0] == 0 && notaryid >= 0 )
1575 if ( (Mining_height >= 235300 && Mining_height < 236000) || (Mining_height % KOMODO_ELECTION_GAP) > 64 || (Mining_height % KOMODO_ELECTION_GAP) == 0 || Mining_height > 1000000 )
1577 int32_t dispflag = 0;
1578 if ( notaryid <= 3 || notaryid == 32 || (notaryid >= 43 && notaryid <= 45) &¬aryid == 51 || notaryid == 52 || notaryid == 56 || notaryid == 57 )
1580 komodo_eligiblenotary(pubkeys,mids,blocktimes,&nonzpkeys,pindexPrev->GetHeight());
1581 if ( nonzpkeys > 0 )
1583 for (i=0; i<33; i++)
1584 if( pubkeys[0][i] != 0 )
1588 else externalflag = 0;
1589 if ( IS_KOMODO_NOTARY != 0 )
1591 for (i=1; i<66; i++)
1592 if ( memcmp(pubkeys[i],pubkeys[0],33) == 0 )
1594 if ( externalflag == 0 && i != 66 && mids[i] >= 0 )
1595 printf("VIOLATION at %d, notaryid.%d\n",i,mids[i]);
1596 for (j=gpucount=0; j<65; j++)
1598 if ( dispflag != 0 )
1601 fprintf(stderr,"%d ",mids[j]);
1602 else fprintf(stderr,"GPU ");
1604 if ( mids[j] == -1 )
1607 if ( dispflag != 0 )
1608 fprintf(stderr," <- prev minerids from ht.%d notary.%d gpucount.%d %.2f%% t.%u\n",pindexPrev->GetHeight(),notaryid,gpucount,100.*(double)gpucount/j,(uint32_t)time(NULL));
1610 for (j=0; j<65; j++)
1611 if ( mids[j] == notaryid )
1614 KOMODO_LASTMINED = 0;
1615 } else fprintf(stderr,"no nonz pubkeys\n");
1616 if ( (Mining_height >= 235300 && Mining_height < 236000) || (j == 65 && Mining_height > KOMODO_MAYBEMINED+1 && Mining_height > KOMODO_LASTMINED+64) )
1618 HASHTarget = arith_uint256().SetCompact(KOMODO_MINDIFF_NBITS);
1619 fprintf(stderr,"I am the chosen one for %s ht.%d\n",ASSETCHAINS_SYMBOL,pindexPrev->GetHeight()+1);
1620 } //else fprintf(stderr,"duplicate at j.%d\n",j);
1621 } else Mining_start = 0;
1622 } else Mining_start = 0;
1623 if ( ASSETCHAINS_STAKED != 0 )
1625 int32_t percPoS,z; bool fNegative,fOverflow;
1626 HASHTarget_POW = komodo_PoWtarget(&percPoS,HASHTarget,Mining_height,ASSETCHAINS_STAKED);
1627 HASHTarget.SetCompact(KOMODO_MINDIFF_NBITS,&fNegative,&fOverflow);
1628 if ( ASSETCHAINS_STAKED < 100 )
1630 for (z=31; z>=0; z--)
1631 fprintf(stderr,"%02x",((uint8_t *)&HASHTarget_POW)[z]);
1632 fprintf(stderr," PoW for staked coin PoS %d%% vs target %d%%\n",percPoS,(int32_t)ASSETCHAINS_STAKED);
1637 if ( KOMODO_INSYNC == 0 )
1639 fprintf(stderr,"Mining when blockchain might not be in sync longest.%d vs %d\n",KOMODO_LONGESTCHAIN,Mining_height);
1640 if ( KOMODO_LONGESTCHAIN != 0 && Mining_height >= KOMODO_LONGESTCHAIN )
1645 KOMODO_CHOSEN_ONE = 0;
1647 crypto_generichash_blake2b_state state;
1648 EhInitialiseState(n, k, state);
1649 // I = the block header minus nonce and solution.
1650 CEquihashInput I{*pblock};
1651 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
1654 crypto_generichash_blake2b_update(&state, (unsigned char*)&ss[0], ss.size());
1656 crypto_generichash_blake2b_state curr_state;
1658 crypto_generichash_blake2b_update(&curr_state,pblock->nNonce.begin(),pblock->nNonce.size());
1659 // (x_1, x_2, ...) = A(I, V, n, k)
1660 LogPrint("pow", "Running Equihash solver \"%s\" with nNonce = %s\n",solver, pblock->nNonce.ToString());
1661 arith_uint256 hashTarget;
1662 if ( KOMODO_MININGTHREADS > 0 && ASSETCHAINS_STAKED > 0 && ASSETCHAINS_STAKED < 100 && Mining_height > 10 )
1663 hashTarget = HASHTarget_POW;
1664 else hashTarget = HASHTarget;
1665 std::function<bool(std::vector<unsigned char>)> validBlock =
1666 #ifdef ENABLE_WALLET
1667 [&pblock, &hashTarget, &pwallet, &reservekey, &m_cs, &cancelSolver, &chainparams]
1669 [&pblock, &hashTarget, &m_cs, &cancelSolver, &chainparams]
1671 (std::vector<unsigned char> soln) {
1672 int32_t z; arith_uint256 h; CBlock B;
1673 // Write the solution to the hash and compute the result.
1674 LogPrint("pow", "- Checking solution against target\n");
1675 pblock->nSolution = soln;
1676 solutionTargetChecks.increment();
1678 h = UintToArith256(B.GetHash());
1679 /*for (z=31; z>=16; z--)
1680 fprintf(stderr,"%02x",((uint8_t *)&h)[z]);
1681 fprintf(stderr," mined ");
1682 for (z=31; z>=16; z--)
1683 fprintf(stderr,"%02x",((uint8_t *)&HASHTarget)[z]);
1684 fprintf(stderr," hashTarget ");
1685 for (z=31; z>=16; z--)
1686 fprintf(stderr,"%02x",((uint8_t *)&HASHTarget_POW)[z]);
1687 fprintf(stderr," POW\n");*/
1688 if ( h > hashTarget )
1690 //if ( ASSETCHAINS_STAKED != 0 && KOMODO_MININGTHREADS == 0 )
1694 if ( IS_KOMODO_NOTARY != 0 && B.nTime > GetAdjustedTime() )
1696 //fprintf(stderr,"need to wait %d seconds to submit block\n",(int32_t)(B.nTime - GetAdjustedTime()));
1697 while ( GetAdjustedTime() < B.nTime-2 )
1700 if ( chainActive.LastTip()->GetHeight() >= Mining_height )
1702 fprintf(stderr,"new block arrived\n");
1707 if ( ASSETCHAINS_STAKED == 0 )
1709 if ( IS_KOMODO_NOTARY != 0 )
1712 if ( (r= ((Mining_height + NOTARY_PUBKEY33[16]) % 64) / 8) > 0 )
1713 MilliSleep((rand() % (r * 1000)) + 1000);
1718 while ( B.nTime-57 > GetAdjustedTime() )
1721 if ( chainActive.LastTip()->GetHeight() >= Mining_height )
1724 uint256 tmp = B.GetHash();
1725 int32_t z; for (z=31; z>=0; z--)
1726 fprintf(stderr,"%02x",((uint8_t *)&tmp)[z]);
1727 fprintf(stderr," mined %s block %d!\n",ASSETCHAINS_SYMBOL,Mining_height);
1729 CValidationState state;
1730 if ( !TestBlockValidity(state,B, chainActive.LastTip(), true, false))
1732 h = UintToArith256(B.GetHash());
1733 for (z=31; z>=0; z--)
1734 fprintf(stderr,"%02x",((uint8_t *)&h)[z]);
1735 fprintf(stderr," Invalid block mined, try again\n");
1738 KOMODO_CHOSEN_ONE = 1;
1740 SetThreadPriority(THREAD_PRIORITY_NORMAL);
1741 LogPrintf("KomodoMiner:\n");
1742 LogPrintf("proof-of-work found \n hash: %s \ntarget: %s\n", B.GetHash().GetHex(), HASHTarget.GetHex());
1743 #ifdef ENABLE_WALLET
1744 if (ProcessBlockFound(&B, *pwallet, reservekey)) {
1746 if (ProcessBlockFound(&B)) {
1748 // Ignore chain updates caused by us
1749 std::lock_guard<std::mutex> lock{m_cs};
1750 cancelSolver = false;
1752 KOMODO_CHOSEN_ONE = 0;
1753 SetThreadPriority(THREAD_PRIORITY_LOWEST);
1754 // In regression test mode, stop mining after a block is found.
1755 if (chainparams.MineBlocksOnDemand()) {
1756 // Increment here because throwing skips the call below
1757 ehSolverRuns.increment();
1758 throw boost::thread_interrupted();
1762 std::function<bool(EhSolverCancelCheck)> cancelled = [&m_cs, &cancelSolver](EhSolverCancelCheck pos) {
1763 std::lock_guard<std::mutex> lock{m_cs};
1764 return cancelSolver;
1767 // TODO: factor this out into a function with the same API for each solver.
1768 if (solver == "tromp" ) { //&& notaryid >= 0 ) {
1769 // Create solver and initialize it.
1771 eq.setstate(&curr_state);
1773 // Initialization done, start algo driver.
1775 eq.xfull = eq.bfull = eq.hfull = 0;
1777 for (u32 r = 1; r < WK; r++) {
1778 (r&1) ? eq.digitodd(r, 0) : eq.digiteven(r, 0);
1779 eq.xfull = eq.bfull = eq.hfull = 0;
1783 ehSolverRuns.increment();
1785 // Convert solution indices to byte array (decompress) and pass it to validBlock method.
1786 for (size_t s = 0; s < eq.nsols; s++) {
1787 LogPrint("pow", "Checking solution %d\n", s+1);
1788 std::vector<eh_index> index_vector(PROOFSIZE);
1789 for (size_t i = 0; i < PROOFSIZE; i++) {
1790 index_vector[i] = eq.sols[s][i];
1792 std::vector<unsigned char> sol_char = GetMinimalFromIndices(index_vector, DIGITBITS);
1794 if (validBlock(sol_char)) {
1795 // If we find a POW solution, do not try other solutions
1796 // because they become invalid as we created a new block in blockchain.
1802 // If we find a valid block, we rebuild
1803 bool found = EhOptimisedSolve(n, k, curr_state, validBlock, cancelled);
1804 ehSolverRuns.increment();
1806 int32_t i; uint256 hash = pblock->GetHash();
1807 for (i=0; i<32; i++)
1808 fprintf(stderr,"%02x",((uint8_t *)&hash)[i]);
1809 fprintf(stderr," <- %s Block found %d\n",ASSETCHAINS_SYMBOL,Mining_height);
1811 KOMODO_MAYBEMINED = Mining_height;
1814 } catch (EhSolverCancelledException&) {
1815 LogPrint("pow", "Equihash solver cancelled\n");
1816 std::lock_guard<std::mutex> lock{m_cs};
1817 cancelSolver = false;
1821 // Check for stop or if block needs to be rebuilt
1822 boost::this_thread::interruption_point();
1823 // Regtest mode doesn't require peers
1824 if ( FOUND_BLOCK != 0 )
1827 fprintf(stderr,"FOUND_BLOCK!\n");
1830 if (vNodes.empty() && chainparams.MiningRequiresPeers())
1832 if ( ASSETCHAINS_SYMBOL[0] == 0 || Mining_height > ASSETCHAINS_MINHEIGHT )
1834 fprintf(stderr,"no nodes, break\n");
1838 if ((UintToArith256(pblock->nNonce) & 0xffff) == 0xffff)
1840 //if ( 0 && ASSETCHAINS_SYMBOL[0] != 0 )
1841 fprintf(stderr,"0xffff, break\n");
1844 if (mempool.GetTransactionsUpdated() != nTransactionsUpdatedLast && GetTime() - nStart > 60)
1846 if ( 0 && ASSETCHAINS_SYMBOL[0] != 0 )
1847 fprintf(stderr,"timeout, break\n");
1850 if ( pindexPrev != chainActive.LastTip() )
1852 if ( 0 && ASSETCHAINS_SYMBOL[0] != 0 )
1853 fprintf(stderr,"Tip advanced, break\n");
1856 // Update nNonce and nTime
1857 pblock->nNonce = ArithToUint256(UintToArith256(pblock->nNonce) + 1);
1858 pblock->nBits = savebits;
1859 /*if ( NOTARY_PUBKEY33[0] == 0 )
1862 UpdateTime(pblock, consensusParams, pindexPrev);
1863 if (consensusParams.fPowAllowMinDifficultyBlocks)
1865 // Changing pblock->nTime can change work required on testnet:
1866 HASHTarget.SetCompact(pblock->nBits);
1867 HASHTarget_POW = komodo_PoWtarget(&percPoS,HASHTarget,Mining_height,ASSETCHAINS_STAKED);
1873 catch (const boost::thread_interrupted&)
1877 LogPrintf("KomodoMiner terminated\n");
1880 catch (const std::runtime_error &e)
1884 LogPrintf("KomodoMiner runtime error: %s\n", e.what());
1891 #ifdef ENABLE_WALLET
1892 void GenerateBitcoins(bool fGenerate, CWallet* pwallet, int nThreads)
1894 void GenerateBitcoins(bool fGenerate, int nThreads)
1897 // if we are supposed to catch stake cheaters, there must be a valid sapling parameter, we need it at
1898 // initialization, and this is the first time we can get it. store the Sapling address here
1899 extern boost::optional<libzcash::SaplingPaymentAddress> cheatCatcher;
1900 extern std::string VERUS_CHEATCATCHER;
1901 libzcash::PaymentAddress addr = DecodePaymentAddress(VERUS_CHEATCATCHER);
1902 if (VERUS_CHEATCATCHER.size() > 0 && IsValidPaymentAddress(addr))
1904 cheatCatcher = boost::get<libzcash::SaplingPaymentAddress>(addr);
1908 if (VERUS_CHEATCATCHER.size() > 0)
1909 fprintf(stderr, "-cheatcatcher parameter is invalid Sapling payment address\n");
1912 static boost::thread_group* minerThreads = NULL;
1915 nThreads = GetNumCores();
1917 if (minerThreads != NULL)
1919 minerThreads->interrupt_all();
1920 delete minerThreads;
1921 minerThreads = NULL;
1924 //fprintf(stderr,"nThreads.%d fGenerate.%d\n",(int32_t)nThreads,fGenerate);
1925 if ( nThreads == 0 && ASSETCHAINS_STAKED )
1928 if ((nThreads == 0 || !fGenerate) && (VERUS_MINTBLOCKS == 0 || pwallet == NULL))
1931 minerThreads = new boost::thread_group();
1933 #ifdef ENABLE_WALLET
1934 if (ASSETCHAINS_LWMAPOS != 0 && VERUS_MINTBLOCKS)
1936 minerThreads->create_thread(boost::bind(&VerusStaker, pwallet));
1940 for (int i = 0; i < nThreads; i++) {
1942 #ifdef ENABLE_WALLET
1943 if (ASSETCHAINS_ALGO == ASSETCHAINS_EQUIHASH)
1944 minerThreads->create_thread(boost::bind(&BitcoinMiner, pwallet));
1946 minerThreads->create_thread(boost::bind(&BitcoinMiner_noeq, pwallet));
1948 if (ASSETCHAINS_ALGO == ASSETCHAINS_EQUIHASH)
1949 minerThreads->create_thread(&BitcoinMiner);
1951 minerThreads->create_thread(&BitcoinMiner_noeq);
1956 #endif // ENABLE_MINING