1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Copyright (c) 2013 The NovaCoin developers
4 // Distributed under the MIT/X11 software license, see the accompanying
5 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
10 #include "kernel_worker.h"
14 //////////////////////////////////////////////////////////////////////////////
19 int64_t nReserveBalance = 0;
20 static unsigned int nMaxStakeSearchInterval = 60;
21 uint64_t nStakeInputsMapSize = 0;
23 int static FormatHashBlocks(void* pbuffer, unsigned int len)
25 unsigned char* pdata = (unsigned char*)pbuffer;
26 unsigned int blocks = 1 + ((len + 8) / 64);
27 unsigned char* pend = pdata + 64 * blocks;
28 memset(pdata + len, 0, 64 * blocks - len);
30 unsigned int bits = len * 8;
31 pend[-1] = (bits >> 0) & 0xff;
32 pend[-2] = (bits >> 8) & 0xff;
33 pend[-3] = (bits >> 16) & 0xff;
34 pend[-4] = (bits >> 24) & 0xff;
38 static const unsigned int pSHA256InitState[8] =
39 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
41 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
44 unsigned char data[64];
48 for (int i = 0; i < 16; i++)
49 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
51 for (int i = 0; i < 8; i++)
52 ctx.h[i] = ((uint32_t*)pinit)[i];
54 SHA256_Update(&ctx, data, sizeof(data));
55 for (int i = 0; i < 8; i++)
56 ((uint32_t*)pstate)[i] = ctx.h[i];
59 // Some explaining would be appreciated
64 set<uint256> setDependsOn;
68 COrphan(CTransaction* ptxIn)
71 dPriority = dFeePerKb = 0;
76 printf("COrphan(hash=%s, dPriority=%.1f, dFeePerKb=%.1f)\n",
77 ptx->GetHash().ToString().substr(0,10).c_str(), dPriority, dFeePerKb);
78 BOOST_FOREACH(uint256 hash, setDependsOn)
79 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
84 uint64_t nLastBlockTx = 0;
85 uint64_t nLastBlockSize = 0;
86 uint32_t nLastCoinStakeSearchInterval = 0;
88 // We want to sort transactions by priority and fee, so:
89 typedef boost::tuple<double, double, CTransaction*> TxPriority;
90 class TxPriorityCompare
94 TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
95 bool operator()(const TxPriority& a, const TxPriority& b)
99 if (a.get<1>() == b.get<1>())
100 return a.get<0>() < b.get<0>();
101 return a.get<1>() < b.get<1>();
105 if (a.get<0>() == b.get<0>())
106 return a.get<1>() < b.get<1>();
107 return a.get<0>() < b.get<0>();
112 // CreateNewBlock: create new block (without proof-of-work/with provided coinstake)
113 CBlock* CreateNewBlock(CWallet* pwallet, CTransaction *txCoinStake)
115 bool fProofOfStake = txCoinStake != NULL;
118 auto_ptr<CBlock> pblock(new CBlock());
122 // Create coinbase tx
123 CTransaction txCoinBase;
124 txCoinBase.vin.resize(1);
125 txCoinBase.vin[0].prevout.SetNull();
126 txCoinBase.vout.resize(1);
130 CReserveKey reservekey(pwallet);
131 txCoinBase.vout[0].scriptPubKey.SetDestination(reservekey.GetReservedKey().GetID());
133 // Add our coinbase tx as first transaction
134 pblock->vtx.push_back(txCoinBase);
138 // Coinbase output must be empty for Proof-of-Stake block
139 txCoinBase.vout[0].SetEmpty();
141 // Syncronize timestamps
142 pblock->nTime = txCoinBase.nTime = txCoinStake->nTime;
144 // Add coinbase and coinstake transactions
145 pblock->vtx.push_back(txCoinBase);
146 pblock->vtx.push_back(*txCoinStake);
149 // Largest block you're willing to create:
150 unsigned int nBlockMaxSize = GetArg("-blockmaxsize", MAX_BLOCK_SIZE_GEN/2);
151 // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
152 nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
154 // How much of the block should be dedicated to high-priority transactions,
155 // included regardless of the fees they pay
156 unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", 27000);
157 nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
159 // Minimum block size you want to create; block will be filled with free transactions
160 // until there are no more or the block reaches this size:
161 unsigned int nBlockMinSize = GetArg("-blockminsize", 0);
162 nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
164 // Fee-per-kilobyte amount considered the same as "free"
165 // Be careful setting this: if you set it to zero then
166 // a transaction spammer can cheaply fill blocks using
167 // 1-satoshi-fee transactions. It should be set above the real
168 // cost to you of processing a transaction.
169 int64_t nMinTxFee = MIN_TX_FEE;
170 if (mapArgs.count("-mintxfee"))
171 ParseMoney(mapArgs["-mintxfee"], nMinTxFee);
173 CBlockIndex* pindexPrev = pindexBest;
175 pblock->nBits = GetNextTargetRequired(pindexPrev, fProofOfStake);
177 // Collect memory pool transactions into the block
180 LOCK2(cs_main, mempool.cs);
181 CBlockIndex* pindexPrev = pindexBest;
184 // Priority order to process transactions
185 list<COrphan> vOrphan; // list memory doesn't move
186 map<uint256, vector<COrphan*> > mapDependers;
188 // This vector will be sorted into a priority queue:
189 vector<TxPriority> vecPriority;
190 vecPriority.reserve(mempool.mapTx.size());
191 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
193 CTransaction& tx = (*mi).second;
194 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
197 COrphan* porphan = NULL;
198 double dPriority = 0;
199 int64_t nTotalIn = 0;
200 bool fMissingInputs = false;
201 BOOST_FOREACH(const CTxIn& txin, tx.vin)
203 // Read prev transaction
206 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
208 // This should never happen; all transactions in the memory
209 // pool should connect to either transactions in the chain
210 // or other transactions in the memory pool.
211 if (!mempool.mapTx.count(txin.prevout.hash))
213 printf("ERROR: mempool transaction missing input\n");
214 if (fDebug) assert("mempool transaction missing input" == 0);
215 fMissingInputs = true;
221 // Has to wait for dependencies
224 // Use list for automatic deletion
225 vOrphan.push_back(COrphan(&tx));
226 porphan = &vOrphan.back();
228 mapDependers[txin.prevout.hash].push_back(porphan);
229 porphan->setDependsOn.insert(txin.prevout.hash);
230 nTotalIn += mempool.mapTx[txin.prevout.hash].vout[txin.prevout.n].nValue;
233 int64_t nValueIn = txPrev.vout[txin.prevout.n].nValue;
234 nTotalIn += nValueIn;
236 int nConf = txindex.GetDepthInMainChain();
237 dPriority += (double)nValueIn * nConf;
239 if (fMissingInputs) continue;
241 // Priority is sum(valuein * age) / txsize
242 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
243 dPriority /= nTxSize;
245 // This is a more accurate fee-per-kilobyte than is used by the client code, because the
246 // client code rounds up the size to the nearest 1K. That's good, because it gives an
247 // incentive to create smaller transactions.
248 double dFeePerKb = double(nTotalIn-tx.GetValueOut()) / (double(nTxSize)/1000.0);
252 porphan->dPriority = dPriority;
253 porphan->dFeePerKb = dFeePerKb;
256 vecPriority.push_back(TxPriority(dPriority, dFeePerKb, &(*mi).second));
259 // Collect transactions into block
260 map<uint256, CTxIndex> mapTestPool;
261 uint64_t nBlockSize = 1000;
262 uint64_t nBlockTx = 0;
263 int nBlockSigOps = 100;
264 bool fSortedByFee = (nBlockPrioritySize <= 0);
266 TxPriorityCompare comparer(fSortedByFee);
267 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
269 while (!vecPriority.empty())
271 // Take highest priority transaction off the priority queue:
272 double dPriority = vecPriority.front().get<0>();
273 double dFeePerKb = vecPriority.front().get<1>();
274 CTransaction& tx = *(vecPriority.front().get<2>());
276 std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
277 vecPriority.pop_back();
280 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
281 if (nBlockSize + nTxSize >= nBlockMaxSize)
284 // Legacy limits on sigOps:
285 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
286 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
290 if (tx.nTime > GetAdjustedTime() || (fProofOfStake && tx.nTime > txCoinStake->nTime))
293 // Skip free transactions if we're past the minimum block size:
294 if (fSortedByFee && (dFeePerKb < nMinTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
297 // Prioritize by fee once past the priority size or we run out of high-priority
300 ((nBlockSize + nTxSize >= nBlockPrioritySize) || (dPriority < COIN * 144 / 250)))
303 comparer = TxPriorityCompare(fSortedByFee);
304 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
307 // Connecting shouldn't fail due to dependency on other memory pool transactions
308 // because we're already processing them in order of dependency
309 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
312 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
316 int64_t nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
317 int64_t nMinFee = tx.GetMinFee(nBlockSize, true, GMF_BLOCK, nTxSize);
318 if (nTxFees < nMinFee)
321 // Sigops accumulation
322 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
323 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
326 if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true, true, MANDATORY_SCRIPT_VERIFY_FLAGS))
328 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
329 swap(mapTestPool, mapTestPoolTmp);
332 pblock->vtx.push_back(tx);
333 nBlockSize += nTxSize;
335 nBlockSigOps += nTxSigOps;
338 if (fDebug && GetBoolArg("-printpriority"))
340 printf("priority %.1f feeperkb %.1f txid %s\n",
341 dPriority, dFeePerKb, tx.GetHash().ToString().c_str());
344 // Add transactions that depend on this one to the priority queue
345 uint256 hash = tx.GetHash();
346 if (mapDependers.count(hash))
348 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
350 if (!porphan->setDependsOn.empty())
352 porphan->setDependsOn.erase(hash);
353 if (porphan->setDependsOn.empty())
355 vecPriority.push_back(TxPriority(porphan->dPriority, porphan->dFeePerKb, porphan->ptx));
356 std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
363 nLastBlockTx = nBlockTx;
364 nLastBlockSize = nBlockSize;
368 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits, nFees);
371 printf("CreateNewBlock(): PoW reward %" PRIu64 "\n", pblock->vtx[0].vout[0].nValue);
374 if (fDebug && GetBoolArg("-printpriority"))
375 printf("CreateNewBlock(): total size %" PRIu64 "\n", nBlockSize);
378 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
381 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
382 pblock->nTime = max(pblock->GetBlockTime(), PastDrift(pindexPrev->GetBlockTime()));
383 pblock->UpdateTime(pindexPrev);
388 return pblock.release();
392 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
394 // Update nExtraNonce
395 static uint256 hashPrevBlock;
396 if (hashPrevBlock != pblock->hashPrevBlock)
399 hashPrevBlock = pblock->hashPrevBlock;
403 unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
404 pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
405 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
407 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
411 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
414 // Pre-build hash buffers
421 uint256 hashPrevBlock;
422 uint256 hashMerkleRoot;
428 unsigned char pchPadding0[64];
430 unsigned char pchPadding1[64];
433 memset(&tmp, 0, sizeof(tmp));
435 tmp.block.nVersion = pblock->nVersion;
436 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
437 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
438 tmp.block.nTime = pblock->nTime;
439 tmp.block.nBits = pblock->nBits;
440 tmp.block.nNonce = pblock->nNonce;
442 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
443 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
445 // Byte swap all the input buffer
446 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
447 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
449 // Precalc the first half of the first hash, which stays constant
450 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
452 memcpy(pdata, &tmp.block, 128);
453 memcpy(phash1, &tmp.hash1, 64);
457 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
459 uint256 hashBlock = pblock->GetHash();
460 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
462 if(!pblock->IsProofOfWork())
463 return error("CheckWork() : %s is not a proof-of-work block", hashBlock.GetHex().c_str());
465 if (hashBlock > hashTarget)
466 return error("CheckWork() : proof-of-work not meeting target");
469 printf("CheckWork() : new proof-of-work block found \n hash: %s \ntarget: %s\n", hashBlock.GetHex().c_str(), hashTarget.GetHex().c_str());
471 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
476 if (pblock->hashPrevBlock != hashBestChain)
477 return error("CheckWork() : generated block is stale");
479 // Remove key from key pool
480 reservekey.KeepKey();
482 // Track how many getdata requests this block gets
484 LOCK(wallet.cs_wallet);
485 wallet.mapRequestCount[hashBlock] = 0;
488 // Process this block the same as if we had received it from another node
489 if (!ProcessBlock(NULL, pblock))
490 return error("CheckWork() : ProcessBlock, block not accepted");
496 bool CheckStake(CBlock* pblock, CWallet& wallet)
498 uint256 proofHash = 0, hashTarget = 0;
499 uint256 hashBlock = pblock->GetHash();
501 if(!pblock->IsProofOfStake())
502 return error("CheckStake() : %s is not a proof-of-stake block", hashBlock.GetHex().c_str());
504 // verify hash target and signature of coinstake tx
505 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, proofHash, hashTarget))
506 return error("CheckStake() : proof-of-stake checking failed");
509 printf("CheckStake() : new proof-of-stake block found \n hash: %s \nproofhash: %s \ntarget: %s\n", hashBlock.GetHex().c_str(), proofHash.GetHex().c_str(), hashTarget.GetHex().c_str());
511 printf("out %s\n", FormatMoney(pblock->vtx[1].GetValueOut()).c_str());
516 if (pblock->hashPrevBlock != hashBestChain)
517 return error("CheckStake() : generated block is stale");
519 // Track how many getdata requests this block gets
521 LOCK(wallet.cs_wallet);
522 wallet.mapRequestCount[hashBlock] = 0;
525 // Process this block the same as if we had received it from another node
526 if (!ProcessBlock(NULL, pblock))
527 return error("CheckStake() : ProcessBlock, block not accepted");
533 // Precalculated SHA256 contexts and metadata
534 // (txid, vout.n) => (kernel, (tx.nTime, nAmount))
535 typedef std::map<std::pair<uint256, unsigned int>, std::pair<std::vector<unsigned char>, std::pair<uint32_t, uint64_t> > > MidstateMap;
537 // Fill the inputs map with precalculated contexts and metadata
538 bool FillMap(CWallet *pwallet, uint32_t nUpperTime, MidstateMap &inputsMap)
540 // Choose coins to use
541 int64_t nBalance = pwallet->GetBalance();
543 if (nBalance <= nReserveBalance)
546 uint32_t nTime = GetAdjustedTime();
550 LOCK2(cs_main, pwallet->cs_wallet);
553 int64_t nValueIn = 0;
554 if (!pwallet->SelectCoinsSimple(nBalance - nReserveBalance, MIN_TX_FEE, MAX_MONEY, nUpperTime, nCoinbaseMaturity * 10, setCoins, nValueIn))
555 return error("FillMap() : SelectCoinsSimple failed");
557 if (setCoins.empty())
563 for(CoinsSet::const_iterator pcoin = setCoins.begin(); pcoin != setCoins.end(); pcoin++)
565 pair<uint256, uint32_t> key = make_pair(pcoin->first->GetHash(), pcoin->second);
567 // Skip existent inputs
568 if (inputsMap.find(key) != inputsMap.end())
571 // Trying to parse scriptPubKey
572 txnouttype whichType;
573 vector<valtype> vSolutions;
574 if (!Solver(pcoin->first->vout[pcoin->second].scriptPubKey, whichType, vSolutions))
577 // Only support pay to public key and pay to address
578 if (whichType != TX_PUBKEY && whichType != TX_PUBKEYHASH)
581 // Load transaction index item
582 if (!txdb.ReadTxIndex(pcoin->first->GetHash(), txindex))
586 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
589 // Only load coins meeting min age requirement
590 if (nStakeMinAge + block.nTime > nTime - nMaxStakeSearchInterval)
593 // Get stake modifier
594 uint64_t nStakeModifier = 0;
595 if (!GetKernelStakeModifier(block.GetHash(), nStakeModifier))
598 // Build static part of kernel
599 CDataStream ssKernel(SER_GETHASH, 0);
600 ssKernel << nStakeModifier;
601 ssKernel << block.nTime << (txindex.pos.nTxPos - txindex.pos.nBlockPos) << pcoin->first->nTime << pcoin->second;
603 // (txid, vout.n) => (kernel, (tx.nTime, nAmount))
604 inputsMap[key] = make_pair(std::vector<unsigned char>(ssKernel.begin(), ssKernel.end()), make_pair(pcoin->first->nTime, pcoin->first->vout[pcoin->second].nValue));
607 nStakeInputsMapSize = inputsMap.size();
610 printf("FillMap() : Map of %" PRIu64 " precalculated contexts has been created by stake miner\n", nStakeInputsMapSize);
616 // Scan inputs map in order to find a solution
617 bool ScanMap(const MidstateMap &inputsMap, uint32_t nBits, MidstateMap::key_type &LuckyInput, std::pair<uint256, uint32_t> &solution)
619 static uint32_t nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
620 uint32_t nSearchTime = GetAdjustedTime();
622 if (inputsMap.size() > 0 && nSearchTime > nLastCoinStakeSearchTime)
624 // Scanning interval (begintime, endtime)
625 std::pair<uint32_t, uint32_t> interval;
627 interval.first = nSearchTime;
628 interval.second = nSearchTime - min(nSearchTime-nLastCoinStakeSearchTime, nMaxStakeSearchInterval);
630 // (txid, nout) => (kernel, (tx.nTime, nAmount))
631 for(MidstateMap::const_iterator input = inputsMap.begin(); input != inputsMap.end(); input++)
633 unsigned char *kernel = (unsigned char *) &input->second.first[0];
635 // scan(State, Bits, Time, Amount, ...)
636 if (ScanKernelBackward(kernel, nBits, input->second.second.first, input->second.second.second, interval, solution))
639 LuckyInput = input->first; // (txid, nout)
645 // Inputs map iteration can be big enough to consume few seconds while scanning.
646 // We're using dynamical calculation of scanning interval in order to compensate this delay.
647 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
648 nLastCoinStakeSearchTime = nSearchTime;
651 // No solutions were found
655 // Stake miner thread
656 void ThreadStakeMiner(void* parg)
658 SetThreadPriority(THREAD_PRIORITY_LOWEST);
660 // Make this thread recognisable as the mining thread
661 RenameThread("novacoin-miner");
662 CWallet* pwallet = (CWallet*)parg;
664 MidstateMap inputsMap;
665 if (!FillMap(pwallet, GetAdjustedTime(), inputsMap))
668 bool fTrySync = true;
670 CBlockIndex* pindexPrev = pindexBest;
671 uint32_t nBits = GetNextTargetRequired(pindexPrev, true);
673 printf("ThreadStakeMinter started\n");
677 vnThreadsRunning[THREAD_MINTER]++;
679 MidstateMap::key_type LuckyInput;
680 std::pair<uint256, uint32_t> solution;
688 while (pwallet->IsLocked())
692 goto _endloop; // Don't be afraid to use a goto if that's the best option.
695 while (vNodes.empty() || IsInitialBlockDownload())
706 // Don't try mine blocks unless we're at the top of chain and have at least three p2p connections.
708 if (vNodes.size() < 3 || nBestHeight < GetNumBlocksOfPeers())
715 if (ScanMap(inputsMap, nBits, LuckyInput, solution))
717 SetThreadPriority(THREAD_PRIORITY_NORMAL);
719 // Remove lucky input from the map
720 inputsMap.erase(inputsMap.find(LuckyInput));
723 CTransaction txCoinStake;
725 // Create new coinstake transaction
726 if (!pwallet->CreateCoinStake(LuckyInput.first, LuckyInput.second, solution.second, nBits, txCoinStake, key))
728 string strMessage = _("Warning: Unable to create coinstake transaction, see debug.log for the details. Mining thread has been stopped.");
729 strMiscWarning = strMessage;
730 printf("*** %s\n", strMessage.c_str());
735 // Now we have new coinstake, it's time to create the block ...
737 pblock = CreateNewBlock(pwallet, &txCoinStake);
740 string strMessage = _("Warning: Unable to allocate memory for the new block object. Mining thread has been stopped.");
741 strMiscWarning = strMessage;
742 printf("*** %s\n", strMessage.c_str());
747 unsigned int nExtraNonce = 0;
748 IncrementExtraNonce(pblock, pindexPrev, nExtraNonce);
751 if (!key.Sign(pblock->GetHash(), pblock->vchBlockSig))
753 string strMessage = _("Warning: Proof-of-Stake miner is unable to sign the block (locked wallet?). Mining thread has been stopped.");
754 strMiscWarning = strMessage;
755 printf("*** %s\n", strMessage.c_str());
760 CheckStake(pblock, *pwallet);
761 SetThreadPriority(THREAD_PRIORITY_LOWEST);
765 if (pindexPrev != pindexBest)
767 // The best block has been changed, we need to refill the map
768 if (FillMap(pwallet, GetAdjustedTime(), inputsMap))
770 pindexPrev = pindexBest;
771 nBits = GetNextTargetRequired(pindexPrev, true);
775 // Clear existent data if FillMap failed
783 (void)0; // do nothing
787 vnThreadsRunning[THREAD_MINTER]--;
789 catch (std::exception& e) {
790 vnThreadsRunning[THREAD_MINTER]--;
791 PrintException(&e, "ThreadStakeMinter()");
793 vnThreadsRunning[THREAD_MINTER]--;
794 PrintException(NULL, "ThreadStakeMinter()");
796 printf("ThreadStakeMinter exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINTER]);