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 extern unsigned int nMinerSleep;
20 int static FormatHashBlocks(void* pbuffer, unsigned int len)
22 unsigned char* pdata = (unsigned char*)pbuffer;
23 unsigned int blocks = 1 + ((len + 8) / 64);
24 unsigned char* pend = pdata + 64 * blocks;
25 memset(pdata + len, 0, 64 * blocks - len);
27 unsigned int bits = len * 8;
28 pend[-1] = (bits >> 0) & 0xff;
29 pend[-2] = (bits >> 8) & 0xff;
30 pend[-3] = (bits >> 16) & 0xff;
31 pend[-4] = (bits >> 24) & 0xff;
35 static const unsigned int pSHA256InitState[8] =
36 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
38 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
41 unsigned char data[64];
45 for (int i = 0; i < 16; i++)
46 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
48 for (int i = 0; i < 8; i++)
49 ctx.h[i] = ((uint32_t*)pinit)[i];
51 SHA256_Update(&ctx, data, sizeof(data));
52 for (int i = 0; i < 8; i++)
53 ((uint32_t*)pstate)[i] = ctx.h[i];
56 // Some explaining would be appreciated
61 set<uint256> setDependsOn;
65 COrphan(CTransaction* ptxIn)
68 dPriority = dFeePerKb = 0;
73 printf("COrphan(hash=%s, dPriority=%.1f, dFeePerKb=%.1f)\n",
74 ptx->GetHash().ToString().substr(0,10).c_str(), dPriority, dFeePerKb);
75 BOOST_FOREACH(uint256 hash, setDependsOn)
76 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
81 uint64_t nLastBlockTx = 0;
82 uint64_t nLastBlockSize = 0;
83 uint32_t nLastCoinStakeSearchInterval = 0;
85 // We want to sort transactions by priority and fee, so:
86 typedef boost::tuple<double, double, CTransaction*> TxPriority;
87 class TxPriorityCompare
91 TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
92 bool operator()(const TxPriority& a, const TxPriority& b)
96 if (a.get<1>() == b.get<1>())
97 return a.get<0>() < b.get<0>();
98 return a.get<1>() < b.get<1>();
102 if (a.get<0>() == b.get<0>())
103 return a.get<1>() < b.get<1>();
104 return a.get<0>() < b.get<0>();
109 // CreateNewBlock: create new block (without proof-of-work/proof-of-stake)
110 CBlock* CreateNewBlock(CWallet* pwallet, bool fProofOfStake)
113 auto_ptr<CBlock> pblock(new CBlock());
117 // Create coinbase tx
120 txNew.vin[0].prevout.SetNull();
121 txNew.vout.resize(1);
125 CReserveKey reservekey(pwallet);
126 txNew.vout[0].scriptPubKey.SetDestination(reservekey.GetReservedKey().GetID());
129 txNew.vout[0].SetEmpty();
131 // Add our coinbase tx as first transaction
132 pblock->vtx.push_back(txNew);
134 // Largest block you're willing to create:
135 unsigned int nBlockMaxSize = GetArg("-blockmaxsize", MAX_BLOCK_SIZE_GEN/2);
136 // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
137 nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
139 // How much of the block should be dedicated to high-priority transactions,
140 // included regardless of the fees they pay
141 unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", 27000);
142 nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
144 // Minimum block size you want to create; block will be filled with free transactions
145 // until there are no more or the block reaches this size:
146 unsigned int nBlockMinSize = GetArg("-blockminsize", 0);
147 nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
149 // Fee-per-kilobyte amount considered the same as "free"
150 // Be careful setting this: if you set it to zero then
151 // a transaction spammer can cheaply fill blocks using
152 // 1-satoshi-fee transactions. It should be set above the real
153 // cost to you of processing a transaction.
154 int64_t nMinTxFee = MIN_TX_FEE;
155 if (mapArgs.count("-mintxfee"))
156 ParseMoney(mapArgs["-mintxfee"], nMinTxFee);
158 CBlockIndex* pindexPrev = pindexBest;
160 pblock->nBits = GetNextTargetRequired(pindexPrev, fProofOfStake);
162 // Collect memory pool transactions into the block
165 LOCK2(cs_main, mempool.cs);
166 CBlockIndex* pindexPrev = pindexBest;
169 // Priority order to process transactions
170 list<COrphan> vOrphan; // list memory doesn't move
171 map<uint256, vector<COrphan*> > mapDependers;
173 // This vector will be sorted into a priority queue:
174 vector<TxPriority> vecPriority;
175 vecPriority.reserve(mempool.mapTx.size());
176 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
178 CTransaction& tx = (*mi).second;
179 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
182 COrphan* porphan = NULL;
183 double dPriority = 0;
184 int64_t nTotalIn = 0;
185 bool fMissingInputs = false;
186 BOOST_FOREACH(const CTxIn& txin, tx.vin)
188 // Read prev transaction
191 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
193 // This should never happen; all transactions in the memory
194 // pool should connect to either transactions in the chain
195 // or other transactions in the memory pool.
196 if (!mempool.mapTx.count(txin.prevout.hash))
198 printf("ERROR: mempool transaction missing input\n");
199 if (fDebug) assert("mempool transaction missing input" == 0);
200 fMissingInputs = true;
206 // Has to wait for dependencies
209 // Use list for automatic deletion
210 vOrphan.push_back(COrphan(&tx));
211 porphan = &vOrphan.back();
213 mapDependers[txin.prevout.hash].push_back(porphan);
214 porphan->setDependsOn.insert(txin.prevout.hash);
215 nTotalIn += mempool.mapTx[txin.prevout.hash].vout[txin.prevout.n].nValue;
218 int64_t nValueIn = txPrev.vout[txin.prevout.n].nValue;
219 nTotalIn += nValueIn;
221 int nConf = txindex.GetDepthInMainChain();
222 dPriority += (double)nValueIn * nConf;
224 if (fMissingInputs) continue;
226 // Priority is sum(valuein * age) / txsize
227 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
228 dPriority /= nTxSize;
230 // This is a more accurate fee-per-kilobyte than is used by the client code, because the
231 // client code rounds up the size to the nearest 1K. That's good, because it gives an
232 // incentive to create smaller transactions.
233 double dFeePerKb = double(nTotalIn-tx.GetValueOut()) / (double(nTxSize)/1000.0);
237 porphan->dPriority = dPriority;
238 porphan->dFeePerKb = dFeePerKb;
241 vecPriority.push_back(TxPriority(dPriority, dFeePerKb, &(*mi).second));
244 // Collect transactions into block
245 map<uint256, CTxIndex> mapTestPool;
246 uint64_t nBlockSize = 1000;
247 uint64_t nBlockTx = 0;
248 int nBlockSigOps = 100;
249 bool fSortedByFee = (nBlockPrioritySize <= 0);
251 TxPriorityCompare comparer(fSortedByFee);
252 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
254 while (!vecPriority.empty())
256 // Take highest priority transaction off the priority queue:
257 double dPriority = vecPriority.front().get<0>();
258 double dFeePerKb = vecPriority.front().get<1>();
259 CTransaction& tx = *(vecPriority.front().get<2>());
261 std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
262 vecPriority.pop_back();
265 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
266 if (nBlockSize + nTxSize >= nBlockMaxSize)
269 // Legacy limits on sigOps:
270 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
271 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
275 if (tx.nTime > GetAdjustedTime() || (fProofOfStake && tx.nTime > pblock->vtx[0].nTime))
278 // Simplify transaction fee - allow free = false
279 int64_t nMinFee = tx.GetMinFee(nBlockSize, true, GMF_BLOCK, nTxSize);
281 // Skip free transactions if we're past the minimum block size:
282 if (fSortedByFee && (dFeePerKb < nMinTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
285 // Prioritize by fee once past the priority size or we run out of high-priority
288 ((nBlockSize + nTxSize >= nBlockPrioritySize) || (dPriority < COIN * 144 / 250)))
291 comparer = TxPriorityCompare(fSortedByFee);
292 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
295 // Connecting shouldn't fail due to dependency on other memory pool transactions
296 // because we're already processing them in order of dependency
297 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
300 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
303 int64_t nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
304 if (nTxFees < nMinFee)
307 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
308 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
311 if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true, true, MANDATORY_SCRIPT_VERIFY_FLAGS))
313 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
314 swap(mapTestPool, mapTestPoolTmp);
317 pblock->vtx.push_back(tx);
318 nBlockSize += nTxSize;
320 nBlockSigOps += nTxSigOps;
323 if (fDebug && GetBoolArg("-printpriority"))
325 printf("priority %.1f feeperkb %.1f txid %s\n",
326 dPriority, dFeePerKb, tx.GetHash().ToString().c_str());
329 // Add transactions that depend on this one to the priority queue
330 uint256 hash = tx.GetHash();
331 if (mapDependers.count(hash))
333 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
335 if (!porphan->setDependsOn.empty())
337 porphan->setDependsOn.erase(hash);
338 if (porphan->setDependsOn.empty())
340 vecPriority.push_back(TxPriority(porphan->dPriority, porphan->dFeePerKb, porphan->ptx));
341 std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
348 nLastBlockTx = nBlockTx;
349 nLastBlockSize = nBlockSize;
353 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits, nFees);
356 printf("CreateNewBlock(): reward %" PRIu64 "\n", pblock->vtx[0].vout[0].nValue);
359 if (fDebug && GetBoolArg("-printpriority"))
360 printf("CreateNewBlock(): total size %" PRIu64 "\n", nBlockSize);
363 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
364 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
365 pblock->nTime = max(pblock->GetBlockTime(), PastDrift(pindexPrev->GetBlockTime()));
367 pblock->UpdateTime(pindexPrev);
371 return pblock.release();
375 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
377 // Update nExtraNonce
378 static uint256 hashPrevBlock;
379 if (hashPrevBlock != pblock->hashPrevBlock)
382 hashPrevBlock = pblock->hashPrevBlock;
386 unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
387 pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
388 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
390 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
394 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
397 // Pre-build hash buffers
404 uint256 hashPrevBlock;
405 uint256 hashMerkleRoot;
411 unsigned char pchPadding0[64];
413 unsigned char pchPadding1[64];
416 memset(&tmp, 0, sizeof(tmp));
418 tmp.block.nVersion = pblock->nVersion;
419 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
420 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
421 tmp.block.nTime = pblock->nTime;
422 tmp.block.nBits = pblock->nBits;
423 tmp.block.nNonce = pblock->nNonce;
425 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
426 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
428 // Byte swap all the input buffer
429 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
430 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
432 // Precalc the first half of the first hash, which stays constant
433 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
435 memcpy(pdata, &tmp.block, 128);
436 memcpy(phash1, &tmp.hash1, 64);
440 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
442 uint256 hashBlock = pblock->GetHash();
443 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
445 if(!pblock->IsProofOfWork())
446 return error("CheckWork() : %s is not a proof-of-work block", hashBlock.GetHex().c_str());
448 if (hashBlock > hashTarget)
449 return error("CheckWork() : proof-of-work not meeting target");
452 printf("CheckWork() : new proof-of-work block found \n hash: %s \ntarget: %s\n", hashBlock.GetHex().c_str(), hashTarget.GetHex().c_str());
454 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
459 if (pblock->hashPrevBlock != hashBestChain)
460 return error("CheckWork() : generated block is stale");
462 // Remove key from key pool
463 reservekey.KeepKey();
465 // Track how many getdata requests this block gets
467 LOCK(wallet.cs_wallet);
468 wallet.mapRequestCount[hashBlock] = 0;
471 // Process this block the same as if we had received it from another node
472 if (!ProcessBlock(NULL, pblock))
473 return error("CheckWork() : ProcessBlock, block not accepted");
479 bool CheckStake(CBlock* pblock, CWallet& wallet)
481 uint256 proofHash = 0, hashTarget = 0;
482 uint256 hashBlock = pblock->GetHash();
484 if(!pblock->IsProofOfStake())
485 return error("CheckStake() : %s is not a proof-of-stake block", hashBlock.GetHex().c_str());
487 // verify hash target and signature of coinstake tx
488 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, proofHash, hashTarget))
489 return error("CheckStake() : proof-of-stake checking failed");
492 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());
494 printf("out %s\n", FormatMoney(pblock->vtx[1].GetValueOut()).c_str());
499 if (pblock->hashPrevBlock != hashBestChain)
500 return error("CheckStake() : generated block is stale");
502 // Track how many getdata requests this block gets
504 LOCK(wallet.cs_wallet);
505 wallet.mapRequestCount[hashBlock] = 0;
508 // Process this block the same as if we had received it from another node
509 if (!ProcessBlock(NULL, pblock))
510 return error("CheckStake() : ProcessBlock, block not accepted");
516 void StakeMiner(CWallet *pwallet)
518 SetThreadPriority(THREAD_PRIORITY_LOWEST);
520 // Make this thread recognisable as the mining thread
521 RenameThread("novacoin-miner");
523 // Each thread has its own counter
524 unsigned int nExtraNonce = 0;
531 while (pwallet->IsLocked())
538 while (vNodes.empty() || IsInitialBlockDownload())
548 CBlockIndex* pindexPrev = pindexBest;
550 auto_ptr<CBlock> pblock(CreateNewBlock(pwallet, true));
553 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
555 // Trying to sign a block
556 if (pblock->SignBlock(*pwallet))
558 SetThreadPriority(THREAD_PRIORITY_NORMAL);
559 CheckStake(pblock.get(), *pwallet);
560 SetThreadPriority(THREAD_PRIORITY_LOWEST);