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.
13 //////////////////////////////////////////////////////////////////////////////
18 int64_t nReserveBalance = 0;
19 static unsigned int nMaxStakeSearchInterval = 60;
20 uint64_t nStakeInputsMapSize = 0;
22 int static FormatHashBlocks(void* pbuffer, unsigned int len)
24 unsigned char* pdata = (unsigned char*)pbuffer;
25 unsigned int blocks = 1 + ((len + 8) / 64);
26 unsigned char* pend = pdata + 64 * blocks;
27 memset(pdata + len, 0, 64 * blocks - len);
29 unsigned int bits = len * 8;
30 pend[-1] = (bits >> 0) & 0xff;
31 pend[-2] = (bits >> 8) & 0xff;
32 pend[-3] = (bits >> 16) & 0xff;
33 pend[-4] = (bits >> 24) & 0xff;
37 static const unsigned int pSHA256InitState[8] =
38 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
40 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
43 unsigned char data[64];
47 for (int i = 0; i < 16; i++)
48 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
50 for (int i = 0; i < 8; i++)
51 ctx.h[i] = ((uint32_t*)pinit)[i];
53 SHA256_Update(&ctx, data, sizeof(data));
54 for (int i = 0; i < 8; i++)
55 ((uint32_t*)pstate)[i] = ctx.h[i];
58 // Some explaining would be appreciated
63 set<uint256> setDependsOn;
67 COrphan(CTransaction* ptxIn)
70 dPriority = dFeePerKb = 0;
75 printf("COrphan(hash=%s, dPriority=%.1f, dFeePerKb=%.1f)\n",
76 ptx->GetHash().ToString().substr(0,10).c_str(), dPriority, dFeePerKb);
77 BOOST_FOREACH(uint256 hash, setDependsOn)
78 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
83 uint64_t nLastBlockTx = 0;
84 uint64_t nLastBlockSize = 0;
85 uint32_t nLastCoinStakeSearchInterval = 0;
87 // We want to sort transactions by priority and fee, so:
88 typedef boost::tuple<double, double, CTransaction*> TxPriority;
89 class TxPriorityCompare
93 TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
94 bool operator()(const TxPriority& a, const TxPriority& b)
98 if (a.get<1>() == b.get<1>())
99 return a.get<0>() < b.get<0>();
100 return a.get<1>() < b.get<1>();
104 if (a.get<0>() == b.get<0>())
105 return a.get<1>() < b.get<1>();
106 return a.get<0>() < b.get<0>();
111 // CreateNewBlock: create new block (without proof-of-work/with provided coinstake)
112 CBlock* CreateNewBlock(CWallet* pwallet, CTransaction *txCoinStake)
114 bool fProofOfStake = txCoinStake != NULL;
117 auto_ptr<CBlock> pblock(new CBlock());
121 // Create coinbase tx
122 CTransaction txCoinBase;
123 txCoinBase.vin.resize(1);
124 txCoinBase.vin[0].prevout.SetNull();
125 txCoinBase.vout.resize(1);
129 CReserveKey reservekey(pwallet);
130 txCoinBase.vout[0].scriptPubKey.SetDestination(reservekey.GetReservedKey().GetID());
132 // Add our coinbase tx as first transaction
133 pblock->vtx.push_back(txCoinBase);
137 // Coinbase output must be empty for Proof-of-Stake block
138 txCoinBase.vout[0].SetEmpty();
140 // Syncronize timestamps
141 pblock->nTime = txCoinBase.nTime = txCoinStake->nTime;
143 // Add coinbase and coinstake transactions
144 pblock->vtx.push_back(txCoinBase);
145 pblock->vtx.push_back(*txCoinStake);
148 // Largest block you're willing to create:
149 unsigned int nBlockMaxSize = GetArg("-blockmaxsize", MAX_BLOCK_SIZE_GEN/2);
150 // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
151 nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
153 // How much of the block should be dedicated to high-priority transactions,
154 // included regardless of the fees they pay
155 unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", 27000);
156 nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
158 // Minimum block size you want to create; block will be filled with free transactions
159 // until there are no more or the block reaches this size:
160 unsigned int nBlockMinSize = GetArg("-blockminsize", 0);
161 nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
163 // Fee-per-kilobyte amount considered the same as "free"
164 // Be careful setting this: if you set it to zero then
165 // a transaction spammer can cheaply fill blocks using
166 // 1-satoshi-fee transactions. It should be set above the real
167 // cost to you of processing a transaction.
168 int64_t nMinTxFee = MIN_TX_FEE;
169 if (mapArgs.count("-mintxfee"))
170 ParseMoney(mapArgs["-mintxfee"], nMinTxFee);
172 CBlockIndex* pindexPrev = pindexBest;
174 pblock->nBits = GetNextTargetRequired(pindexPrev, fProofOfStake);
176 // Collect memory pool transactions into the block
179 LOCK2(cs_main, mempool.cs);
180 CBlockIndex* pindexPrev = pindexBest;
183 // Priority order to process transactions
184 list<COrphan> vOrphan; // list memory doesn't move
185 map<uint256, vector<COrphan*> > mapDependers;
187 // This vector will be sorted into a priority queue:
188 vector<TxPriority> vecPriority;
189 vecPriority.reserve(mempool.mapTx.size());
190 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
192 CTransaction& tx = (*mi).second;
193 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
196 COrphan* porphan = NULL;
197 double dPriority = 0;
198 int64_t nTotalIn = 0;
199 bool fMissingInputs = false;
200 BOOST_FOREACH(const CTxIn& txin, tx.vin)
202 // Read prev transaction
205 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
207 // This should never happen; all transactions in the memory
208 // pool should connect to either transactions in the chain
209 // or other transactions in the memory pool.
210 if (!mempool.mapTx.count(txin.prevout.hash))
212 printf("ERROR: mempool transaction missing input\n");
213 if (fDebug) assert("mempool transaction missing input" == 0);
214 fMissingInputs = true;
220 // Has to wait for dependencies
223 // Use list for automatic deletion
224 vOrphan.push_back(COrphan(&tx));
225 porphan = &vOrphan.back();
227 mapDependers[txin.prevout.hash].push_back(porphan);
228 porphan->setDependsOn.insert(txin.prevout.hash);
229 nTotalIn += mempool.mapTx[txin.prevout.hash].vout[txin.prevout.n].nValue;
232 int64_t nValueIn = txPrev.vout[txin.prevout.n].nValue;
233 nTotalIn += nValueIn;
235 int nConf = txindex.GetDepthInMainChain();
236 dPriority += (double)nValueIn * nConf;
238 if (fMissingInputs) continue;
240 // Priority is sum(valuein * age) / txsize
241 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
242 dPriority /= nTxSize;
244 // This is a more accurate fee-per-kilobyte than is used by the client code, because the
245 // client code rounds up the size to the nearest 1K. That's good, because it gives an
246 // incentive to create smaller transactions.
247 double dFeePerKb = double(nTotalIn-tx.GetValueOut()) / (double(nTxSize)/1000.0);
251 porphan->dPriority = dPriority;
252 porphan->dFeePerKb = dFeePerKb;
255 vecPriority.push_back(TxPriority(dPriority, dFeePerKb, &(*mi).second));
258 // Collect transactions into block
259 map<uint256, CTxIndex> mapTestPool;
260 uint64_t nBlockSize = 1000;
261 uint64_t nBlockTx = 0;
262 int nBlockSigOps = 100;
263 bool fSortedByFee = (nBlockPrioritySize <= 0);
265 TxPriorityCompare comparer(fSortedByFee);
266 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
268 while (!vecPriority.empty())
270 // Take highest priority transaction off the priority queue:
271 double dPriority = vecPriority.front().get<0>();
272 double dFeePerKb = vecPriority.front().get<1>();
273 CTransaction& tx = *(vecPriority.front().get<2>());
275 std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
276 vecPriority.pop_back();
279 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
280 if (nBlockSize + nTxSize >= nBlockMaxSize)
283 // Legacy limits on sigOps:
284 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
285 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
289 if (tx.nTime > GetAdjustedTime() || (fProofOfStake && tx.nTime > txCoinStake->nTime))
292 // Skip free transactions if we're past the minimum block size:
293 if (fSortedByFee && (dFeePerKb < nMinTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
296 // Prioritize by fee once past the priority size or we run out of high-priority
299 ((nBlockSize + nTxSize >= nBlockPrioritySize) || (dPriority < COIN * 144 / 250)))
302 comparer = TxPriorityCompare(fSortedByFee);
303 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
306 // Connecting shouldn't fail due to dependency on other memory pool transactions
307 // because we're already processing them in order of dependency
308 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
311 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
315 int64_t nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
316 int64_t nMinFee = tx.GetMinFee(nBlockSize, true, GMF_BLOCK, nTxSize);
317 if (nTxFees < nMinFee)
320 // Sigops accumulation
321 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
322 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
325 if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true, true, MANDATORY_SCRIPT_VERIFY_FLAGS))
327 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
328 swap(mapTestPool, mapTestPoolTmp);
331 pblock->vtx.push_back(tx);
332 nBlockSize += nTxSize;
334 nBlockSigOps += nTxSigOps;
337 if (fDebug && GetBoolArg("-printpriority"))
339 printf("priority %.1f feeperkb %.1f txid %s\n",
340 dPriority, dFeePerKb, tx.GetHash().ToString().c_str());
343 // Add transactions that depend on this one to the priority queue
344 uint256 hash = tx.GetHash();
345 if (mapDependers.count(hash))
347 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
349 if (!porphan->setDependsOn.empty())
351 porphan->setDependsOn.erase(hash);
352 if (porphan->setDependsOn.empty())
354 vecPriority.push_back(TxPriority(porphan->dPriority, porphan->dFeePerKb, porphan->ptx));
355 std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
362 nLastBlockTx = nBlockTx;
363 nLastBlockSize = nBlockSize;
367 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits, nFees);
370 printf("CreateNewBlock(): PoW reward %" PRIu64 "\n", pblock->vtx[0].vout[0].nValue);
373 if (fDebug && GetBoolArg("-printpriority"))
374 printf("CreateNewBlock(): total size %" PRIu64 "\n", nBlockSize);
377 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
380 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
381 pblock->nTime = max(pblock->GetBlockTime(), PastDrift(pindexPrev->GetBlockTime()));
382 pblock->UpdateTime(pindexPrev);
387 return pblock.release();
391 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
393 // Update nExtraNonce
394 static uint256 hashPrevBlock;
395 if (hashPrevBlock != pblock->hashPrevBlock)
398 hashPrevBlock = pblock->hashPrevBlock;
402 unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
403 pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
404 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
406 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
410 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
413 // Pre-build hash buffers
420 uint256 hashPrevBlock;
421 uint256 hashMerkleRoot;
427 unsigned char pchPadding0[64];
429 unsigned char pchPadding1[64];
432 memset(&tmp, 0, sizeof(tmp));
434 tmp.block.nVersion = pblock->nVersion;
435 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
436 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
437 tmp.block.nTime = pblock->nTime;
438 tmp.block.nBits = pblock->nBits;
439 tmp.block.nNonce = pblock->nNonce;
441 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
442 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
444 // Byte swap all the input buffer
445 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
446 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
448 // Precalc the first half of the first hash, which stays constant
449 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
451 memcpy(pdata, &tmp.block, 128);
452 memcpy(phash1, &tmp.hash1, 64);
456 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
458 uint256 hashBlock = pblock->GetHash();
459 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
461 if(!pblock->IsProofOfWork())
462 return error("CheckWork() : %s is not a proof-of-work block", hashBlock.GetHex().c_str());
464 if (hashBlock > hashTarget)
465 return error("CheckWork() : proof-of-work not meeting target");
468 printf("CheckWork() : new proof-of-work block found \n hash: %s \ntarget: %s\n", hashBlock.GetHex().c_str(), hashTarget.GetHex().c_str());
470 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
475 if (pblock->hashPrevBlock != hashBestChain)
476 return error("CheckWork() : generated block is stale");
478 // Remove key from key pool
479 reservekey.KeepKey();
481 // Track how many getdata requests this block gets
483 LOCK(wallet.cs_wallet);
484 wallet.mapRequestCount[hashBlock] = 0;
487 // Process this block the same as if we had received it from another node
488 if (!ProcessBlock(NULL, pblock))
489 return error("CheckWork() : ProcessBlock, block not accepted");
495 bool CheckStake(CBlock* pblock, CWallet& wallet)
497 uint256 proofHash = 0, hashTarget = 0;
498 uint256 hashBlock = pblock->GetHash();
500 if(!pblock->IsProofOfStake())
501 return error("CheckStake() : %s is not a proof-of-stake block", hashBlock.GetHex().c_str());
503 // verify hash target and signature of coinstake tx
504 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, proofHash, hashTarget))
505 return error("CheckStake() : proof-of-stake checking failed");
508 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());
510 printf("out %s\n", FormatMoney(pblock->vtx[1].GetValueOut()).c_str());
515 if (pblock->hashPrevBlock != hashBestChain)
516 return error("CheckStake() : generated block is stale");
518 // Track how many getdata requests this block gets
520 LOCK(wallet.cs_wallet);
521 wallet.mapRequestCount[hashBlock] = 0;
524 // Process this block the same as if we had received it from another node
525 if (!ProcessBlock(NULL, pblock))
526 return error("CheckStake() : ProcessBlock, block not accepted");
532 // Precalculated SHA256 contexts and metadata
533 // (txid, vout.n) => (SHA256_CTX, (tx.nTime, nAmount))
534 typedef std::map<std::pair<uint256, unsigned int>, std::pair<SHA256_CTX, std::pair<uint32_t, uint64_t> > > MidstateMap;
536 // Fill the inputs map with precalculated contexts and metadata
537 bool FillMap(CWallet *pwallet, uint32_t nUpperTime, MidstateMap &inputsMap)
539 // Choose coins to use
540 int64_t nBalance = pwallet->GetBalance();
542 if (nBalance <= nReserveBalance)
545 uint32_t nTime = GetAdjustedTime();
549 LOCK2(cs_main, pwallet->cs_wallet);
552 int64_t nValueIn = 0;
553 if (!pwallet->SelectCoinsSimple(nBalance - nReserveBalance, MIN_TX_FEE, MAX_MONEY, nUpperTime, nCoinbaseMaturity * 10, setCoins, nValueIn))
554 return error("FillMap() : SelectCoinsSimple failed");
556 if (setCoins.empty())
562 for(CoinsSet::const_iterator pcoin = setCoins.begin(); pcoin != setCoins.end(); pcoin++)
564 pair<uint256, uint32_t> key = make_pair(pcoin->first->GetHash(), pcoin->second);
566 // Skip existent inputs
567 if (inputsMap.find(key) != inputsMap.end())
570 // Trying to parse scriptPubKey
571 txnouttype whichType;
572 vector<valtype> vSolutions;
573 if (!Solver(pcoin->first->vout[pcoin->second].scriptPubKey, whichType, vSolutions))
576 // Only support pay to public key and pay to address
577 if (whichType != TX_PUBKEY && whichType != TX_PUBKEYHASH)
580 // Load transaction index item
581 if (!txdb.ReadTxIndex(pcoin->first->GetHash(), txindex))
585 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
588 // Only load coins meeting min age requirement
589 if (nStakeMinAge + block.nTime > nTime - nMaxStakeSearchInterval)
592 // Get stake modifier
593 uint64_t nStakeModifier = 0;
594 if (!GetKernelStakeModifier(block.GetHash(), nStakeModifier))
597 // Build static part of kernel
598 CDataStream ssKernel(SER_GETHASH, 0);
599 ssKernel << nStakeModifier;
600 ssKernel << block.nTime << (txindex.pos.nTxPos - txindex.pos.nBlockPos) << pcoin->first->nTime << pcoin->second;
601 CDataStream::const_iterator itK = ssKernel.begin();
603 // Init new sha256 context and update it
604 // with first 24 bytes of kernel
607 SHA256_Update(&ctx, (unsigned char*)&itK[0], 8 + 16);
609 // (txid, vout.n) => (SHA256_CTX, (tx.nTime, nAmount))
610 inputsMap[key] = make_pair(ctx, make_pair(pcoin->first->nTime, pcoin->first->vout[pcoin->second].nValue));
613 nStakeInputsMapSize = inputsMap.size();
616 printf("FillMap() : Map of %" PRIu64 " precalculated contexts has been created by stake miner\n", nStakeInputsMapSize);
622 // Scan inputs map in order to find a solution
623 bool ScanMap(const MidstateMap &inputsMap, uint32_t nBits, MidstateMap::key_type &LuckyInput, std::pair<uint256, uint32_t> &solution)
625 static uint32_t nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
626 uint32_t nSearchTime = GetAdjustedTime();
628 if (inputsMap.size() > 0 && nSearchTime > nLastCoinStakeSearchTime)
630 // Scanning interval (begintime, endtime)
631 std::pair<uint32_t, uint32_t> interval;
633 interval.first = nSearchTime;
634 interval.second = nSearchTime - min(nSearchTime-nLastCoinStakeSearchTime, nMaxStakeSearchInterval);
636 // (txid, nout) => (SHA256_CTX, (tx.nTime, nAmount))
637 for(MidstateMap::const_iterator input = inputsMap.begin(); input != inputsMap.end(); input++)
639 SHA256_CTX ctx = input->second.first;
641 // scan(State, Bits, Time, Amount, ...)
642 if (ScanContextBackward(ctx, nBits, input->second.second.first, input->second.second.second, interval, solution))
645 LuckyInput = input->first; // (txid, nout)
651 // Inputs map iteration can be big enough to consume few seconds while scanning.
652 // We're using dynamical calculation of scanning interval in order to compensate this delay.
653 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
654 nLastCoinStakeSearchTime = nSearchTime;
657 // No solutions were found
661 // Stake miner thread
662 void ThreadStakeMiner(void* parg)
664 SetThreadPriority(THREAD_PRIORITY_LOWEST);
666 // Make this thread recognisable as the mining thread
667 RenameThread("novacoin-miner");
668 CWallet* pwallet = (CWallet*)parg;
670 MidstateMap inputsMap;
671 if (!FillMap(pwallet, GetAdjustedTime(), inputsMap))
674 bool fTrySync = true;
676 CBlockIndex* pindexPrev = pindexBest;
677 uint32_t nBits = GetNextTargetRequired(pindexPrev, true);
679 printf("ThreadStakeMinter started\n");
683 vnThreadsRunning[THREAD_MINTER]++;
685 MidstateMap::key_type LuckyInput;
686 std::pair<uint256, uint32_t> solution;
694 while (pwallet->IsLocked())
698 goto _endloop; // Don't be afraid to use a goto if that's the best option.
701 while (vNodes.empty() || IsInitialBlockDownload())
712 // Don't try mine blocks unless we're at the top of chain and have at least three p2p connections.
714 if (vNodes.size() < 3 || nBestHeight < GetNumBlocksOfPeers())
721 if (ScanMap(inputsMap, nBits, LuckyInput, solution))
723 SetThreadPriority(THREAD_PRIORITY_NORMAL);
725 // Remove lucky input from the map
726 inputsMap.erase(inputsMap.find(LuckyInput));
729 CTransaction txCoinStake;
731 // Create new coinstake transaction
732 if (!pwallet->CreateCoinStake(LuckyInput.first, LuckyInput.second, solution.second, nBits, txCoinStake, key))
734 string strMessage = _("Warning: Unable to create coinstake transaction, see debug.log for the details. Mining thread has been stopped.");
735 strMiscWarning = strMessage;
736 printf("*** %s\n", strMessage.c_str());
741 // Now we have new coinstake, it's time to create the block ...
743 pblock = CreateNewBlock(pwallet, &txCoinStake);
746 string strMessage = _("Warning: Unable to allocate memory for the new block object. Mining thread has been stopped.");
747 strMiscWarning = strMessage;
748 printf("*** %s\n", strMessage.c_str());
753 unsigned int nExtraNonce = 0;
754 IncrementExtraNonce(pblock, pindexPrev, nExtraNonce);
757 if (!key.Sign(pblock->GetHash(), pblock->vchBlockSig))
759 string strMessage = _("Warning: Proof-of-Stake miner is unable to sign the block (locked wallet?). Mining thread has been stopped.");
760 strMiscWarning = strMessage;
761 printf("*** %s\n", strMessage.c_str());
766 CheckStake(pblock, *pwallet);
767 SetThreadPriority(THREAD_PRIORITY_LOWEST);
771 if (pindexPrev != pindexBest)
773 // The best block has been changed, we need to refill the map
774 if (FillMap(pwallet, GetAdjustedTime(), inputsMap))
776 pindexPrev = pindexBest;
777 nBits = GetNextTargetRequired(pindexPrev, true);
781 // Clear existent data if FillMap failed
789 (void)0; // do nothing
793 vnThreadsRunning[THREAD_MINTER]--;
795 catch (std::exception& e) {
796 vnThreadsRunning[THREAD_MINTER]--;
797 PrintException(&e, "ThreadStakeMinter()");
799 vnThreadsRunning[THREAD_MINTER]--;
800 PrintException(NULL, "ThreadStakeMinter()");
802 printf("ThreadStakeMinter exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINTER]);