1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include "cryptopp/sha.h"
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
26 static map<uint256, CTransaction> mapTransactions;
27 CCriticalSection cs_mapTransactions;
28 unsigned int nTransactionsUpdated = 0;
29 map<COutPoint, CInPoint> mapNextTx;
31 map<uint256, CBlockIndex*> mapBlockIndex;
32 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 CBigNum bnBestChainWork = 0;
38 CBigNum bnBestInvalidWork = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
54 int fGenerateBitcoins = false;
55 int64 nTransactionFee = 0;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
170 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
171 BOOST_FOREACH(const CTxIn& txin, tx.vin)
172 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
175 void static EraseOrphanTx(uint256 hash)
177 if (!mapOrphanTransactions.count(hash))
179 const CDataStream* pvMsg = mapOrphanTransactions[hash];
181 CDataStream(*pvMsg) >> tx;
182 BOOST_FOREACH(const CTxIn& txin, tx.vin)
184 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
185 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
187 if ((*mi).second == pvMsg)
188 mapOrphanTransactionsByPrev.erase(mi++);
194 mapOrphanTransactions.erase(hash);
197 int LimitOrphanTxSize(int nMaxOrphans)
200 while (mapOrphanTransactions.size() > nMaxOrphans)
202 // Evict a random orphan:
203 std::vector<unsigned char> randbytes(32);
204 RAND_bytes(&randbytes[0], 32);
205 uint256 randomhash(randbytes);
206 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
207 if (it == mapOrphanTransactions.end())
208 it = mapOrphanTransactions.begin();
209 EraseOrphanTx(it->first);
221 //////////////////////////////////////////////////////////////////////////////
223 // CTransaction and CTxIndex
226 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
229 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
231 if (!ReadFromDisk(txindexRet.pos))
233 if (prevout.n >= vout.size())
241 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
244 return ReadFromDisk(txdb, prevout, txindex);
247 bool CTransaction::ReadFromDisk(COutPoint prevout)
251 return ReadFromDisk(txdb, prevout, txindex);
256 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
268 // Load the block this tx is in
270 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
272 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
277 // Update the tx's hashBlock
278 hashBlock = pblock->GetHash();
280 // Locate the transaction
281 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
282 if (pblock->vtx[nIndex] == *(CTransaction*)this)
284 if (nIndex == pblock->vtx.size())
286 vMerkleBranch.clear();
288 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
292 // Fill in merkle branch
293 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
296 // Is the tx in a block that's in the main chain
297 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
298 if (mi == mapBlockIndex.end())
300 CBlockIndex* pindex = (*mi).second;
301 if (!pindex || !pindex->IsInMainChain())
304 return pindexBest->nHeight - pindex->nHeight + 1;
313 bool CTransaction::CheckTransaction() const
315 // Basic checks that don't depend on any context
317 return error("CTransaction::CheckTransaction() : vin empty");
319 return error("CTransaction::CheckTransaction() : vout empty");
321 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
322 return error("CTransaction::CheckTransaction() : size limits failed");
324 // Check for negative or overflow output values
326 BOOST_FOREACH(const CTxOut& txout, vout)
328 if (txout.nValue < 0)
329 return error("CTransaction::CheckTransaction() : txout.nValue negative");
330 if (txout.nValue > MAX_MONEY)
331 return error("CTransaction::CheckTransaction() : txout.nValue too high");
332 nValueOut += txout.nValue;
333 if (!MoneyRange(nValueOut))
334 return error("CTransaction::CheckTransaction() : txout total out of range");
337 // Check for duplicate inputs
338 set<COutPoint> vInOutPoints;
339 BOOST_FOREACH(const CTxIn& txin, vin)
341 if (vInOutPoints.count(txin.prevout))
343 vInOutPoints.insert(txin.prevout);
348 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
349 return error("CTransaction::CheckTransaction() : coinbase script size");
353 BOOST_FOREACH(const CTxIn& txin, vin)
354 if (txin.prevout.IsNull())
355 return error("CTransaction::CheckTransaction() : prevout is null");
361 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
364 *pfMissingInputs = false;
366 if (!CheckTransaction())
367 return error("AcceptToMemoryPool() : CheckTransaction failed");
369 // Coinbase is only valid in a block, not as a loose transaction
371 return error("AcceptToMemoryPool() : coinbase as individual tx");
373 // To help v0.1.5 clients who would see it as a negative number
374 if ((int64)nLockTime > INT_MAX)
375 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
377 // Rather not work on nonstandard transactions (unless -testnet)
378 if (!fTestNet && !IsStandard())
379 return error("AcceptToMemoryPool() : nonstandard transaction type");
381 // Do we already have it?
382 uint256 hash = GetHash();
383 CRITICAL_BLOCK(cs_mapTransactions)
384 if (mapTransactions.count(hash))
387 if (txdb.ContainsTx(hash))
390 // Check for conflicts with in-memory transactions
391 CTransaction* ptxOld = NULL;
392 for (int i = 0; i < vin.size(); i++)
394 COutPoint outpoint = vin[i].prevout;
395 if (mapNextTx.count(outpoint))
397 // Disable replacement feature for now
400 // Allow replacing with a newer version of the same transaction
403 ptxOld = mapNextTx[outpoint].ptx;
404 if (ptxOld->IsFinal())
406 if (!IsNewerThan(*ptxOld))
408 for (int i = 0; i < vin.size(); i++)
410 COutPoint outpoint = vin[i].prevout;
411 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
421 map<uint256, CTxIndex> mapUnused;
422 bool fInvalid = false;
423 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
426 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
428 *pfMissingInputs = true;
429 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
433 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
434 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
435 // attacks disallow transactions with more than one SigOp per 34 bytes.
436 // 34 bytes because a TxOut is:
437 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
438 if (GetSigOpCount() > nSize / 34 || nSize < 100)
439 return error("AcceptToMemoryPool() : nonstandard transaction");
441 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
443 // Don't accept it if it can't get into a block
444 if (nFees < GetMinFee(1000, true, true))
445 return error("AcceptToMemoryPool() : not enough fees");
447 // Continuously rate-limit free transactions
448 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
449 // be annoying or make other's transactions take longer to confirm.
450 if (nFees < MIN_RELAY_TX_FEE)
452 static CCriticalSection cs;
453 static double dFreeCount;
454 static int64 nLastTime;
455 int64 nNow = GetTime();
459 // Use an exponentially decaying ~10-minute window:
460 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
462 // -limitfreerelay unit is thousand-bytes-per-minute
463 // At default rate it would take over a month to fill 1GB
464 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
465 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
467 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
472 // Check against previous transactions
473 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
474 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
476 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
480 // Store transaction in memory
481 CRITICAL_BLOCK(cs_mapTransactions)
485 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
486 ptxOld->RemoveFromMemoryPool();
488 AddToMemoryPoolUnchecked();
491 ///// are we sure this is ok when loading transactions or restoring block txes
492 // If updated, erase old tx from wallet
494 EraseFromWallets(ptxOld->GetHash());
496 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
500 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
503 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
506 bool CTransaction::AddToMemoryPoolUnchecked()
508 // Add to memory pool without checking anything. Don't call this directly,
509 // call AcceptToMemoryPool to properly check the transaction first.
510 CRITICAL_BLOCK(cs_mapTransactions)
512 uint256 hash = GetHash();
513 mapTransactions[hash] = *this;
514 for (int i = 0; i < vin.size(); i++)
515 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
516 nTransactionsUpdated++;
522 bool CTransaction::RemoveFromMemoryPool()
524 // Remove transaction from memory pool
525 CRITICAL_BLOCK(cs_mapTransactions)
527 BOOST_FOREACH(const CTxIn& txin, vin)
528 mapNextTx.erase(txin.prevout);
529 mapTransactions.erase(GetHash());
530 nTransactionsUpdated++;
540 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
542 if (hashBlock == 0 || nIndex == -1)
545 // Find the block it claims to be in
546 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
547 if (mi == mapBlockIndex.end())
549 CBlockIndex* pindex = (*mi).second;
550 if (!pindex || !pindex->IsInMainChain())
553 // Make sure the merkle branch connects to this block
554 if (!fMerkleVerified)
556 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
558 fMerkleVerified = true;
561 nHeightRet = pindex->nHeight;
562 return pindexBest->nHeight - pindex->nHeight + 1;
566 int CMerkleTx::GetBlocksToMaturity() const
570 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
574 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
578 if (!IsInMainChain() && !ClientConnectInputs())
580 return CTransaction::AcceptToMemoryPool(txdb, false);
584 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
588 bool CMerkleTx::AcceptToMemoryPool()
591 return AcceptToMemoryPool(txdb);
596 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
598 CRITICAL_BLOCK(cs_mapTransactions)
600 // Add previous supporting transactions first
601 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
603 if (!tx.IsCoinBase())
605 uint256 hash = tx.GetHash();
606 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
607 tx.AcceptToMemoryPool(txdb, fCheckInputs);
610 return AcceptToMemoryPool(txdb, fCheckInputs);
615 bool CWalletTx::AcceptWalletTransaction()
618 return AcceptWalletTransaction(txdb);
621 int CTxIndex::GetDepthInMainChain() const
625 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
627 // Find the block in the index
628 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
629 if (mi == mapBlockIndex.end())
631 CBlockIndex* pindex = (*mi).second;
632 if (!pindex || !pindex->IsInMainChain())
634 return 1 + nBestHeight - pindex->nHeight;
646 //////////////////////////////////////////////////////////////////////////////
648 // CBlock and CBlockIndex
651 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
653 if (!fReadTransactions)
655 *this = pindex->GetBlockHeader();
658 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
660 if (GetHash() != pindex->GetBlockHash())
661 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
665 uint256 static GetOrphanRoot(const CBlock* pblock)
667 // Work back to the first block in the orphan chain
668 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
669 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
670 return pblock->GetHash();
673 int64 static GetBlockValue(int nHeight, int64 nFees)
675 int64 nSubsidy = 50 * COIN;
677 // Subsidy is cut in half every 4 years
678 nSubsidy >>= (nHeight / 210000);
680 return nSubsidy + nFees;
683 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
684 static const int64 nTargetSpacing = 10 * 60;
685 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
688 // minimum amount of work that could possibly be required nTime after
689 // minimum work required was nBase
691 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
693 // Testnet has min-difficulty blocks
694 // after nTargetSpacing*2 time between blocks:
695 if (fTestNet && nTime > nTargetSpacing*2)
696 return bnProofOfWorkLimit.GetCompact();
699 bnResult.SetCompact(nBase);
700 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
702 // Maximum 400% adjustment...
704 // ... in best-case exactly 4-times-normal target time
705 nTime -= nTargetTimespan*4;
707 if (bnResult > bnProofOfWorkLimit)
708 bnResult = bnProofOfWorkLimit;
709 return bnResult.GetCompact();
712 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
714 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
717 if (pindexLast == NULL)
718 return nProofOfWorkLimit;
720 // Only change once per interval
721 if ((pindexLast->nHeight+1) % nInterval != 0)
723 // Special rules for testnet after 15 Feb 2012:
724 if (fTestNet && pblock->nTime > 1329264000)
726 // If the new block's timestamp is more than 2* 10 minutes
727 // then allow mining of a min-difficulty block.
728 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
729 return nProofOfWorkLimit;
732 // Return the last non-special-min-difficulty-rules-block
733 const CBlockIndex* pindex = pindexLast;
734 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
735 pindex = pindex->pprev;
736 return pindex->nBits;
740 return pindexLast->nBits;
743 // Go back by what we want to be 14 days worth of blocks
744 const CBlockIndex* pindexFirst = pindexLast;
745 for (int i = 0; pindexFirst && i < nInterval-1; i++)
746 pindexFirst = pindexFirst->pprev;
749 // Limit adjustment step
750 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
751 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
752 if (nActualTimespan < nTargetTimespan/4)
753 nActualTimespan = nTargetTimespan/4;
754 if (nActualTimespan > nTargetTimespan*4)
755 nActualTimespan = nTargetTimespan*4;
759 bnNew.SetCompact(pindexLast->nBits);
760 bnNew *= nActualTimespan;
761 bnNew /= nTargetTimespan;
763 if (bnNew > bnProofOfWorkLimit)
764 bnNew = bnProofOfWorkLimit;
767 printf("GetNextWorkRequired RETARGET\n");
768 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
769 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
770 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
772 return bnNew.GetCompact();
775 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
778 bnTarget.SetCompact(nBits);
781 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
782 return error("CheckProofOfWork() : nBits below minimum work");
784 // Check proof of work matches claimed amount
785 if (hash > bnTarget.getuint256())
786 return error("CheckProofOfWork() : hash doesn't match nBits");
791 bool IsInitialBlockDownload()
793 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
795 static int64 nLastUpdate;
796 static CBlockIndex* pindexLastBest;
797 if (pindexBest != pindexLastBest)
799 pindexLastBest = pindexBest;
800 nLastUpdate = GetTime();
802 return (GetTime() - nLastUpdate < 10 &&
803 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
806 void static InvalidChainFound(CBlockIndex* pindexNew)
808 if (pindexNew->bnChainWork > bnBestInvalidWork)
810 bnBestInvalidWork = pindexNew->bnChainWork;
811 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
814 printf("InvalidChainFound: invalid block=%s height=%d work=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, pindexNew->bnChainWork.ToString().c_str());
815 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
816 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
817 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
830 bool CTransaction::DisconnectInputs(CTxDB& txdb)
832 // Relinquish previous transactions' spent pointers
835 BOOST_FOREACH(const CTxIn& txin, vin)
837 COutPoint prevout = txin.prevout;
839 // Get prev txindex from disk
841 if (!txdb.ReadTxIndex(prevout.hash, txindex))
842 return error("DisconnectInputs() : ReadTxIndex failed");
844 if (prevout.n >= txindex.vSpent.size())
845 return error("DisconnectInputs() : prevout.n out of range");
847 // Mark outpoint as not spent
848 txindex.vSpent[prevout.n].SetNull();
851 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
852 return error("DisconnectInputs() : UpdateTxIndex failed");
856 // Remove transaction from index
857 // This can fail if a duplicate of this transaction was in a chain that got
858 // reorganized away. This is only possible if this transaction was completely
859 // spent, so erasing it would be a no-op anway.
860 txdb.EraseTxIndex(*this);
866 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
867 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
869 // FetchInputs can return false either because we just haven't seen some inputs
870 // (in which case the transaction should be stored as an orphan)
871 // or because the transaction is malformed (in which case the transaction should
872 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
876 return true; // Coinbase transactions have no inputs to fetch.
878 for (int i = 0; i < vin.size(); i++)
880 COutPoint prevout = vin[i].prevout;
881 if (inputsRet.count(prevout.hash))
882 continue; // Got it already
885 CTxIndex& txindex = inputsRet[prevout.hash].first;
887 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
889 // Get txindex from current proposed changes
890 txindex = mapTestPool.find(prevout.hash)->second;
894 // Read txindex from txdb
895 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
897 if (!fFound && (fBlock || fMiner))
898 return fMiner ? false : error("FetchInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
901 CTransaction& txPrev = inputsRet[prevout.hash].second;
902 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
904 // Get prev tx from single transactions in memory
905 CRITICAL_BLOCK(cs_mapTransactions)
907 if (!mapTransactions.count(prevout.hash))
908 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
909 txPrev = mapTransactions[prevout.hash];
912 txindex.vSpent.resize(txPrev.vout.size());
916 // Get prev tx from disk
917 if (!txPrev.ReadFromDisk(txindex.pos))
918 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
922 // Make sure all prevout.n's are valid:
923 for (int i = 0; i < vin.size(); i++)
925 const COutPoint prevout = vin[i].prevout;
926 assert(inputsRet.count(prevout.hash) != 0);
927 const CTxIndex& txindex = inputsRet[prevout.hash].first;
928 const CTransaction& txPrev = inputsRet[prevout.hash].second;
929 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
931 // Revisit this if/when transaction replacement is implemented and allows
934 return error("FetchInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str());
941 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
943 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
944 if (mi == inputs.end())
945 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
947 const CTransaction& txPrev = (mi->second).second;
948 if (input.prevout.n >= txPrev.vout.size())
949 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
951 return txPrev.vout[input.prevout.n];
954 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
960 for (int i = 0; i < vin.size(); i++)
962 nResult += GetOutputFor(vin[i], inputs).nValue;
968 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
974 for (int i = 0; i < vin.size(); i++)
976 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
977 if (prevout.scriptPubKey.IsPayToScriptHash())
978 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
983 bool CTransaction::ConnectInputs(MapPrevTx inputs,
984 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
985 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
987 // Take over previous transactions' spent pointers
988 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
989 // fMiner is true when called from the internal bitcoin miner
990 // ... both are false when called from CTransaction::AcceptToMemoryPool
995 for (int i = 0; i < vin.size(); i++)
997 COutPoint prevout = vin[i].prevout;
998 assert(inputs.count(prevout.hash) > 0);
999 CTxIndex& txindex = inputs[prevout.hash].first;
1000 CTransaction& txPrev = inputs[prevout.hash].second;
1002 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1003 return error("ConnectInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str());
1005 // If prev is coinbase, check that it's matured
1006 if (txPrev.IsCoinBase())
1007 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1008 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1009 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1011 // Check for conflicts (double-spend)
1012 if (!txindex.vSpent[prevout.n].IsNull())
1013 return fMiner ? false : error("ConnectInputs() : %s prev tx already used at %s", GetHash().ToString().substr(0,10).c_str(), txindex.vSpent[prevout.n].ToString().c_str());
1015 // Check for negative or overflow input values
1016 nValueIn += txPrev.vout[prevout.n].nValue;
1017 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1018 return error("ConnectInputs() : txin values out of range");
1021 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1022 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1024 // Mark outpoints as spent
1025 txindex.vSpent[prevout.n] = posThisTx;
1028 if (fBlock || fMiner)
1030 mapTestPool[prevout.hash] = txindex;
1034 if (nValueIn < GetValueOut())
1035 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
1037 // Tally transaction fees
1038 int64 nTxFee = nValueIn - GetValueOut();
1040 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
1042 if (!MoneyRange(nFees))
1043 return error("ConnectInputs() : nFees out of range");
1050 bool CTransaction::ClientConnectInputs()
1055 // Take over previous transactions' spent pointers
1056 CRITICAL_BLOCK(cs_mapTransactions)
1059 for (int i = 0; i < vin.size(); i++)
1061 // Get prev tx from single transactions in memory
1062 COutPoint prevout = vin[i].prevout;
1063 if (!mapTransactions.count(prevout.hash))
1065 CTransaction& txPrev = mapTransactions[prevout.hash];
1067 if (prevout.n >= txPrev.vout.size())
1071 if (!VerifySignature(txPrev, *this, i, true, 0))
1072 return error("ConnectInputs() : VerifySignature failed");
1074 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1075 ///// this has to go away now that posNext is gone
1076 // // Check for conflicts
1077 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1078 // return error("ConnectInputs() : prev tx already used");
1080 // // Flag outpoints as used
1081 // txPrev.vout[prevout.n].posNext = posThisTx;
1083 nValueIn += txPrev.vout[prevout.n].nValue;
1085 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1086 return error("ClientConnectInputs() : txin values out of range");
1088 if (GetValueOut() > nValueIn)
1098 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1100 // Disconnect in reverse order
1101 for (int i = vtx.size()-1; i >= 0; i--)
1102 if (!vtx[i].DisconnectInputs(txdb))
1105 // Update block index on disk without changing it in memory.
1106 // The memory index structure will be changed after the db commits.
1109 CDiskBlockIndex blockindexPrev(pindex->pprev);
1110 blockindexPrev.hashNext = 0;
1111 if (!txdb.WriteBlockIndex(blockindexPrev))
1112 return error("DisconnectBlock() : WriteBlockIndex failed");
1118 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1120 // Check it again in case a previous version let a bad block in
1124 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1125 // unless those are already completely spent.
1126 // If such overwrites are allowed, coinbases and transactions depending upon those
1127 // can be duplicated to remove the ability to spend the first instance -- even after
1128 // being sent to another address.
1129 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1130 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1131 // already refuses previously-known transaction id's entirely.
1132 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1133 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1134 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1135 BOOST_FOREACH(CTransaction& tx, vtx)
1137 CTxIndex txindexOld;
1138 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1139 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1144 // P2SH didn't become active until Apr 1 2012 (Feb 15 on testnet)
1145 int64 nEvalSwitchTime = fTestNet ? 1329264000 : 1333238400;
1146 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1148 //// issue here: it doesn't know the version
1149 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1151 map<uint256, CTxIndex> mapQueuedChanges;
1154 BOOST_FOREACH(CTransaction& tx, vtx)
1156 nSigOps += tx.GetSigOpCount();
1157 if (nSigOps > MAX_BLOCK_SIGOPS)
1158 return error("ConnectBlock() : too many sigops");
1160 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1161 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1164 MapPrevTx mapInputs;
1165 if (!tx.IsCoinBase())
1167 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1170 if (fStrictPayToScriptHash)
1172 // Add in sigops done by pay-to-script-hash inputs;
1173 // this is to prevent a "rogue miner" from creating
1174 // an incredibly-expensive-to-validate block.
1175 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1176 if (nSigOps > MAX_BLOCK_SIGOPS)
1177 return error("ConnectBlock() : too many sigops");
1180 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1182 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1186 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1189 // Write queued txindex changes
1190 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1192 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1193 return error("ConnectBlock() : UpdateTxIndex failed");
1196 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1199 // Update block index on disk without changing it in memory.
1200 // The memory index structure will be changed after the db commits.
1203 CDiskBlockIndex blockindexPrev(pindex->pprev);
1204 blockindexPrev.hashNext = pindex->GetBlockHash();
1205 if (!txdb.WriteBlockIndex(blockindexPrev))
1206 return error("ConnectBlock() : WriteBlockIndex failed");
1209 // Watch for transactions paying to me
1210 BOOST_FOREACH(CTransaction& tx, vtx)
1211 SyncWithWallets(tx, this, true);
1216 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1218 printf("REORGANIZE\n");
1221 CBlockIndex* pfork = pindexBest;
1222 CBlockIndex* plonger = pindexNew;
1223 while (pfork != plonger)
1225 while (plonger->nHeight > pfork->nHeight)
1226 if (!(plonger = plonger->pprev))
1227 return error("Reorganize() : plonger->pprev is null");
1228 if (pfork == plonger)
1230 if (!(pfork = pfork->pprev))
1231 return error("Reorganize() : pfork->pprev is null");
1234 // List of what to disconnect
1235 vector<CBlockIndex*> vDisconnect;
1236 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1237 vDisconnect.push_back(pindex);
1239 // List of what to connect
1240 vector<CBlockIndex*> vConnect;
1241 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1242 vConnect.push_back(pindex);
1243 reverse(vConnect.begin(), vConnect.end());
1245 // Disconnect shorter branch
1246 vector<CTransaction> vResurrect;
1247 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1250 if (!block.ReadFromDisk(pindex))
1251 return error("Reorganize() : ReadFromDisk for disconnect failed");
1252 if (!block.DisconnectBlock(txdb, pindex))
1253 return error("Reorganize() : DisconnectBlock failed");
1255 // Queue memory transactions to resurrect
1256 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1257 if (!tx.IsCoinBase())
1258 vResurrect.push_back(tx);
1261 // Connect longer branch
1262 vector<CTransaction> vDelete;
1263 for (int i = 0; i < vConnect.size(); i++)
1265 CBlockIndex* pindex = vConnect[i];
1267 if (!block.ReadFromDisk(pindex))
1268 return error("Reorganize() : ReadFromDisk for connect failed");
1269 if (!block.ConnectBlock(txdb, pindex))
1273 return error("Reorganize() : ConnectBlock failed");
1276 // Queue memory transactions to delete
1277 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1278 vDelete.push_back(tx);
1280 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1281 return error("Reorganize() : WriteHashBestChain failed");
1283 // Make sure it's successfully written to disk before changing memory structure
1284 if (!txdb.TxnCommit())
1285 return error("Reorganize() : TxnCommit failed");
1287 // Disconnect shorter branch
1288 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1290 pindex->pprev->pnext = NULL;
1292 // Connect longer branch
1293 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1295 pindex->pprev->pnext = pindex;
1297 // Resurrect memory transactions that were in the disconnected branch
1298 BOOST_FOREACH(CTransaction& tx, vResurrect)
1299 tx.AcceptToMemoryPool(txdb, false);
1301 // Delete redundant memory transactions that are in the connected branch
1302 BOOST_FOREACH(CTransaction& tx, vDelete)
1303 tx.RemoveFromMemoryPool();
1309 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1311 uint256 hash = GetHash();
1314 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1316 txdb.WriteHashBestChain(hash);
1317 if (!txdb.TxnCommit())
1318 return error("SetBestChain() : TxnCommit failed");
1319 pindexGenesisBlock = pindexNew;
1321 else if (hashPrevBlock == hashBestChain)
1323 // Adding to current best branch
1324 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1327 InvalidChainFound(pindexNew);
1328 return error("SetBestChain() : ConnectBlock failed");
1330 if (!txdb.TxnCommit())
1331 return error("SetBestChain() : TxnCommit failed");
1333 // Add to current best branch
1334 pindexNew->pprev->pnext = pindexNew;
1336 // Delete redundant memory transactions
1337 BOOST_FOREACH(CTransaction& tx, vtx)
1338 tx.RemoveFromMemoryPool();
1343 if (!Reorganize(txdb, pindexNew))
1346 InvalidChainFound(pindexNew);
1347 return error("SetBestChain() : Reorganize failed");
1351 // Update best block in wallet (so we can detect restored wallets)
1352 if (!IsInitialBlockDownload())
1354 const CBlockLocator locator(pindexNew);
1355 ::SetBestChain(locator);
1359 hashBestChain = hash;
1360 pindexBest = pindexNew;
1361 nBestHeight = pindexBest->nHeight;
1362 bnBestChainWork = pindexNew->bnChainWork;
1363 nTimeBestReceived = GetTime();
1364 nTransactionsUpdated++;
1365 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1371 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1373 // Check for duplicate
1374 uint256 hash = GetHash();
1375 if (mapBlockIndex.count(hash))
1376 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1378 // Construct new block index object
1379 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1381 return error("AddToBlockIndex() : new CBlockIndex failed");
1382 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1383 pindexNew->phashBlock = &((*mi).first);
1384 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1385 if (miPrev != mapBlockIndex.end())
1387 pindexNew->pprev = (*miPrev).second;
1388 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1390 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1394 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1395 if (!txdb.TxnCommit())
1399 if (pindexNew->bnChainWork > bnBestChainWork)
1400 if (!SetBestChain(txdb, pindexNew))
1405 if (pindexNew == pindexBest)
1407 // Notify UI to display prev block's coinbase if it was ours
1408 static uint256 hashPrevBestCoinBase;
1409 UpdatedTransaction(hashPrevBestCoinBase);
1410 hashPrevBestCoinBase = vtx[0].GetHash();
1420 bool CBlock::CheckBlock() const
1422 // These are checks that are independent of context
1423 // that can be verified before saving an orphan block.
1426 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1427 return error("CheckBlock() : size limits failed");
1429 // Check proof of work matches claimed amount
1430 if (!CheckProofOfWork(GetHash(), nBits))
1431 return error("CheckBlock() : proof of work failed");
1434 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1435 return error("CheckBlock() : block timestamp too far in the future");
1437 // First transaction must be coinbase, the rest must not be
1438 if (vtx.empty() || !vtx[0].IsCoinBase())
1439 return error("CheckBlock() : first tx is not coinbase");
1440 for (int i = 1; i < vtx.size(); i++)
1441 if (vtx[i].IsCoinBase())
1442 return error("CheckBlock() : more than one coinbase");
1444 // Check transactions
1445 BOOST_FOREACH(const CTransaction& tx, vtx)
1446 if (!tx.CheckTransaction())
1447 return error("CheckBlock() : CheckTransaction failed");
1449 // Check that it's not full of nonstandard transactions
1450 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1451 return error("CheckBlock() : out-of-bounds SigOpCount");
1454 if (hashMerkleRoot != BuildMerkleTree())
1455 return error("CheckBlock() : hashMerkleRoot mismatch");
1460 bool CBlock::AcceptBlock()
1462 // Check for duplicate
1463 uint256 hash = GetHash();
1464 if (mapBlockIndex.count(hash))
1465 return error("AcceptBlock() : block already in mapBlockIndex");
1467 // Get prev block index
1468 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1469 if (mi == mapBlockIndex.end())
1470 return error("AcceptBlock() : prev block not found");
1471 CBlockIndex* pindexPrev = (*mi).second;
1472 int nHeight = pindexPrev->nHeight+1;
1474 // Check proof of work
1475 if (nBits != GetNextWorkRequired(pindexPrev, this))
1476 return error("AcceptBlock() : incorrect proof of work");
1478 // Check timestamp against prev
1479 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1480 return error("AcceptBlock() : block's timestamp is too early");
1482 // Check that all transactions are finalized
1483 BOOST_FOREACH(const CTransaction& tx, vtx)
1484 if (!tx.IsFinal(nHeight, GetBlockTime()))
1485 return error("AcceptBlock() : contains a non-final transaction");
1487 // Check that the block chain matches the known block chain up to a checkpoint
1488 if (!Checkpoints::CheckBlock(nHeight, hash))
1489 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1491 // Write block to history file
1492 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1493 return error("AcceptBlock() : out of disk space");
1494 unsigned int nFile = -1;
1495 unsigned int nBlockPos = 0;
1496 if (!WriteToDisk(nFile, nBlockPos))
1497 return error("AcceptBlock() : WriteToDisk failed");
1498 if (!AddToBlockIndex(nFile, nBlockPos))
1499 return error("AcceptBlock() : AddToBlockIndex failed");
1501 // Relay inventory, but don't relay old inventory during initial block download
1502 if (hashBestChain == hash)
1503 CRITICAL_BLOCK(cs_vNodes)
1504 BOOST_FOREACH(CNode* pnode, vNodes)
1505 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1506 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1511 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1513 // Check for duplicate
1514 uint256 hash = pblock->GetHash();
1515 if (mapBlockIndex.count(hash))
1516 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1517 if (mapOrphanBlocks.count(hash))
1518 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1520 // Preliminary checks
1521 if (!pblock->CheckBlock())
1522 return error("ProcessBlock() : CheckBlock FAILED");
1524 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1525 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1527 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1528 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1531 return error("ProcessBlock() : block with timestamp before last checkpoint");
1534 bnNewBlock.SetCompact(pblock->nBits);
1536 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1537 if (bnNewBlock > bnRequired)
1539 return error("ProcessBlock() : block with too little proof-of-work");
1544 // If don't already have its previous block, shunt it off to holding area until we get it
1545 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1547 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1548 CBlock* pblock2 = new CBlock(*pblock);
1549 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1550 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1552 // Ask this guy to fill in what we're missing
1554 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1559 if (!pblock->AcceptBlock())
1560 return error("ProcessBlock() : AcceptBlock FAILED");
1562 // Recursively process any orphan blocks that depended on this one
1563 vector<uint256> vWorkQueue;
1564 vWorkQueue.push_back(hash);
1565 for (int i = 0; i < vWorkQueue.size(); i++)
1567 uint256 hashPrev = vWorkQueue[i];
1568 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1569 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1572 CBlock* pblockOrphan = (*mi).second;
1573 if (pblockOrphan->AcceptBlock())
1574 vWorkQueue.push_back(pblockOrphan->GetHash());
1575 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1576 delete pblockOrphan;
1578 mapOrphanBlocksByPrev.erase(hashPrev);
1581 printf("ProcessBlock: ACCEPTED\n");
1592 bool CheckDiskSpace(uint64 nAdditionalBytes)
1594 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1596 // Check for 15MB because database could create another 10MB log file at any time
1597 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1600 string strMessage = _("Warning: Disk space is low ");
1601 strMiscWarning = strMessage;
1602 printf("*** %s\n", strMessage.c_str());
1603 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1604 CreateThread(Shutdown, NULL);
1610 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1614 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1617 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1619 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1628 static unsigned int nCurrentBlockFile = 1;
1630 FILE* AppendBlockFile(unsigned int& nFileRet)
1635 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1638 if (fseek(file, 0, SEEK_END) != 0)
1640 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1641 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1643 nFileRet = nCurrentBlockFile;
1647 nCurrentBlockFile++;
1651 bool LoadBlockIndex(bool fAllowNew)
1655 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1656 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1657 pchMessageStart[0] = 0xfa;
1658 pchMessageStart[1] = 0xbf;
1659 pchMessageStart[2] = 0xb5;
1660 pchMessageStart[3] = 0xda;
1667 if (!txdb.LoadBlockIndex())
1672 // Init with genesis block
1674 if (mapBlockIndex.empty())
1680 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1681 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1682 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1683 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1684 // vMerkleTree: 4a5e1e
1687 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1689 txNew.vin.resize(1);
1690 txNew.vout.resize(1);
1691 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1692 txNew.vout[0].nValue = 50 * COIN;
1693 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1695 block.vtx.push_back(txNew);
1696 block.hashPrevBlock = 0;
1697 block.hashMerkleRoot = block.BuildMerkleTree();
1699 block.nTime = 1231006505;
1700 block.nBits = 0x1d00ffff;
1701 block.nNonce = 2083236893;
1705 block.nTime = 1296688602;
1706 block.nBits = 0x1d07fff8;
1707 block.nNonce = 384568319;
1711 printf("%s\n", block.GetHash().ToString().c_str());
1712 printf("%s\n", hashGenesisBlock.ToString().c_str());
1713 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1714 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1716 assert(block.GetHash() == hashGenesisBlock);
1718 // Start new block file
1720 unsigned int nBlockPos;
1721 if (!block.WriteToDisk(nFile, nBlockPos))
1722 return error("LoadBlockIndex() : writing genesis block to disk failed");
1723 if (!block.AddToBlockIndex(nFile, nBlockPos))
1724 return error("LoadBlockIndex() : genesis block not accepted");
1732 void PrintBlockTree()
1734 // precompute tree structure
1735 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1736 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1738 CBlockIndex* pindex = (*mi).second;
1739 mapNext[pindex->pprev].push_back(pindex);
1741 //while (rand() % 3 == 0)
1742 // mapNext[pindex->pprev].push_back(pindex);
1745 vector<pair<int, CBlockIndex*> > vStack;
1746 vStack.push_back(make_pair(0, pindexGenesisBlock));
1749 while (!vStack.empty())
1751 int nCol = vStack.back().first;
1752 CBlockIndex* pindex = vStack.back().second;
1755 // print split or gap
1756 if (nCol > nPrevCol)
1758 for (int i = 0; i < nCol-1; i++)
1762 else if (nCol < nPrevCol)
1764 for (int i = 0; i < nCol; i++)
1771 for (int i = 0; i < nCol; i++)
1776 block.ReadFromDisk(pindex);
1777 printf("%d (%u,%u) %s %s tx %d",
1781 block.GetHash().ToString().substr(0,20).c_str(),
1782 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1785 PrintWallets(block);
1787 // put the main timechain first
1788 vector<CBlockIndex*>& vNext = mapNext[pindex];
1789 for (int i = 0; i < vNext.size(); i++)
1791 if (vNext[i]->pnext)
1793 swap(vNext[0], vNext[i]);
1799 for (int i = 0; i < vNext.size(); i++)
1800 vStack.push_back(make_pair(nCol+i, vNext[i]));
1813 //////////////////////////////////////////////////////////////////////////////
1818 map<uint256, CAlert> mapAlerts;
1819 CCriticalSection cs_mapAlerts;
1821 string GetWarnings(string strFor)
1824 string strStatusBar;
1826 if (GetBoolArg("-testsafemode"))
1829 // Misc warnings like out of disk space and clock is wrong
1830 if (strMiscWarning != "")
1833 strStatusBar = strMiscWarning;
1836 // Longer invalid proof-of-work chain
1837 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1840 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1844 CRITICAL_BLOCK(cs_mapAlerts)
1846 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1848 const CAlert& alert = item.second;
1849 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1851 nPriority = alert.nPriority;
1852 strStatusBar = alert.strStatusBar;
1857 if (strFor == "statusbar")
1858 return strStatusBar;
1859 else if (strFor == "rpc")
1861 assert(!"GetWarnings() : invalid parameter");
1865 bool CAlert::ProcessAlert()
1867 if (!CheckSignature())
1872 CRITICAL_BLOCK(cs_mapAlerts)
1874 // Cancel previous alerts
1875 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1877 const CAlert& alert = (*mi).second;
1880 printf("cancelling alert %d\n", alert.nID);
1881 mapAlerts.erase(mi++);
1883 else if (!alert.IsInEffect())
1885 printf("expiring alert %d\n", alert.nID);
1886 mapAlerts.erase(mi++);
1892 // Check if this alert has been cancelled
1893 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1895 const CAlert& alert = item.second;
1896 if (alert.Cancels(*this))
1898 printf("alert already cancelled by %d\n", alert.nID);
1904 mapAlerts.insert(make_pair(GetHash(), *this));
1907 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1919 //////////////////////////////////////////////////////////////////////////////
1925 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1929 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1930 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1932 // Don't know what it is, just say we already got one
1939 // The message start string is designed to be unlikely to occur in normal data.
1940 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1941 // a large 4-byte int at any alignment.
1942 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1945 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1947 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1948 RandAddSeedPerfmon();
1950 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1951 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1953 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1955 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1963 if (strCommand == "version")
1965 // Each connection can only send one version message
1966 if (pfrom->nVersion != 0)
1973 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1974 if (pfrom->nVersion == 10300)
1975 pfrom->nVersion = 300;
1976 if (pfrom->nVersion >= 106 && !vRecv.empty())
1977 vRecv >> addrFrom >> nNonce;
1978 if (pfrom->nVersion >= 106 && !vRecv.empty())
1979 vRecv >> pfrom->strSubVer;
1980 if (pfrom->nVersion >= 209 && !vRecv.empty())
1981 vRecv >> pfrom->nStartingHeight;
1983 if (pfrom->nVersion == 0)
1986 // Disconnect if we connected to ourself
1987 if (nNonce == nLocalHostNonce && nNonce > 1)
1989 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1990 pfrom->fDisconnect = true;
1994 // Be shy and don't send version until we hear
1995 if (pfrom->fInbound)
1996 pfrom->PushVersion();
1998 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2000 AddTimeData(pfrom->addr.ip, nTime);
2003 if (pfrom->nVersion >= 209)
2004 pfrom->PushMessage("verack");
2005 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2006 if (pfrom->nVersion < 209)
2007 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2009 if (!pfrom->fInbound)
2011 // Advertise our address
2012 if (addrLocalHost.IsRoutable() && !fUseProxy)
2014 CAddress addr(addrLocalHost);
2015 addr.nTime = GetAdjustedTime();
2016 pfrom->PushAddress(addr);
2019 // Get recent addresses
2020 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2022 pfrom->PushMessage("getaddr");
2023 pfrom->fGetAddr = true;
2027 // Ask the first connected node for block updates
2028 static int nAskedForBlocks;
2029 if (!pfrom->fClient &&
2030 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2031 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2034 pfrom->PushGetBlocks(pindexBest, uint256(0));
2038 CRITICAL_BLOCK(cs_mapAlerts)
2039 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2040 item.second.RelayTo(pfrom);
2042 pfrom->fSuccessfullyConnected = true;
2044 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2048 else if (pfrom->nVersion == 0)
2050 // Must have a version message before anything else
2055 else if (strCommand == "verack")
2057 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2061 else if (strCommand == "addr")
2063 vector<CAddress> vAddr;
2066 // Don't want addr from older versions unless seeding
2067 if (pfrom->nVersion < 209)
2069 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2071 if (vAddr.size() > 1000)
2072 return error("message addr size() = %d", vAddr.size());
2074 // Store the new addresses
2077 int64 nNow = GetAdjustedTime();
2078 int64 nSince = nNow - 10 * 60;
2079 BOOST_FOREACH(CAddress& addr, vAddr)
2083 // ignore IPv6 for now, since it isn't implemented anyway
2086 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2087 addr.nTime = nNow - 5 * 24 * 60 * 60;
2088 AddAddress(addr, 2 * 60 * 60, &addrDB);
2089 pfrom->AddAddressKnown(addr);
2090 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2092 // Relay to a limited number of other nodes
2093 CRITICAL_BLOCK(cs_vNodes)
2095 // Use deterministic randomness to send to the same nodes for 24 hours
2096 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2097 static uint256 hashSalt;
2099 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2100 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2101 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2102 multimap<uint256, CNode*> mapMix;
2103 BOOST_FOREACH(CNode* pnode, vNodes)
2105 if (pnode->nVersion < 31402)
2107 unsigned int nPointer;
2108 memcpy(&nPointer, &pnode, sizeof(nPointer));
2109 uint256 hashKey = hashRand ^ nPointer;
2110 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2111 mapMix.insert(make_pair(hashKey, pnode));
2113 int nRelayNodes = 2;
2114 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2115 ((*mi).second)->PushAddress(addr);
2119 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2120 if (vAddr.size() < 1000)
2121 pfrom->fGetAddr = false;
2125 else if (strCommand == "inv")
2129 if (vInv.size() > 50000)
2130 return error("message inv size() = %d", vInv.size());
2133 BOOST_FOREACH(const CInv& inv, vInv)
2137 pfrom->AddInventoryKnown(inv);
2139 bool fAlreadyHave = AlreadyHave(txdb, inv);
2141 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2145 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2146 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2148 // Track requests for our stuff
2149 Inventory(inv.hash);
2154 else if (strCommand == "getdata")
2158 if (vInv.size() > 50000)
2159 return error("message getdata size() = %d", vInv.size());
2161 BOOST_FOREACH(const CInv& inv, vInv)
2165 printf("received getdata for: %s\n", inv.ToString().c_str());
2167 if (inv.type == MSG_BLOCK)
2169 // Send block from disk
2170 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2171 if (mi != mapBlockIndex.end())
2174 block.ReadFromDisk((*mi).second);
2175 pfrom->PushMessage("block", block);
2177 // Trigger them to send a getblocks request for the next batch of inventory
2178 if (inv.hash == pfrom->hashContinue)
2180 // Bypass PushInventory, this must send even if redundant,
2181 // and we want it right after the last block so they don't
2182 // wait for other stuff first.
2184 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2185 pfrom->PushMessage("inv", vInv);
2186 pfrom->hashContinue = 0;
2190 else if (inv.IsKnownType())
2192 // Send stream from relay memory
2193 CRITICAL_BLOCK(cs_mapRelay)
2195 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2196 if (mi != mapRelay.end())
2197 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2201 // Track requests for our stuff
2202 Inventory(inv.hash);
2207 else if (strCommand == "getblocks")
2209 CBlockLocator locator;
2211 vRecv >> locator >> hashStop;
2213 // Find the last block the caller has in the main chain
2214 CBlockIndex* pindex = locator.GetBlockIndex();
2216 // Send the rest of the chain
2218 pindex = pindex->pnext;
2219 int nLimit = 500 + locator.GetDistanceBack();
2220 unsigned int nBytes = 0;
2221 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2222 for (; pindex; pindex = pindex->pnext)
2224 if (pindex->GetBlockHash() == hashStop)
2226 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2229 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2231 block.ReadFromDisk(pindex, true);
2232 nBytes += block.GetSerializeSize(SER_NETWORK);
2233 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2235 // When this block is requested, we'll send an inv that'll make them
2236 // getblocks the next batch of inventory.
2237 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2238 pfrom->hashContinue = pindex->GetBlockHash();
2245 else if (strCommand == "getheaders")
2247 CBlockLocator locator;
2249 vRecv >> locator >> hashStop;
2251 CBlockIndex* pindex = NULL;
2252 if (locator.IsNull())
2254 // If locator is null, return the hashStop block
2255 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2256 if (mi == mapBlockIndex.end())
2258 pindex = (*mi).second;
2262 // Find the last block the caller has in the main chain
2263 pindex = locator.GetBlockIndex();
2265 pindex = pindex->pnext;
2268 vector<CBlock> vHeaders;
2269 int nLimit = 2000 + locator.GetDistanceBack();
2270 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2271 for (; pindex; pindex = pindex->pnext)
2273 vHeaders.push_back(pindex->GetBlockHeader());
2274 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2277 pfrom->PushMessage("headers", vHeaders);
2281 else if (strCommand == "tx")
2283 vector<uint256> vWorkQueue;
2284 CDataStream vMsg(vRecv);
2288 CInv inv(MSG_TX, tx.GetHash());
2289 pfrom->AddInventoryKnown(inv);
2291 bool fMissingInputs = false;
2292 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2294 SyncWithWallets(tx, NULL, true);
2295 RelayMessage(inv, vMsg);
2296 mapAlreadyAskedFor.erase(inv);
2297 vWorkQueue.push_back(inv.hash);
2299 // Recursively process any orphan transactions that depended on this one
2300 for (int i = 0; i < vWorkQueue.size(); i++)
2302 uint256 hashPrev = vWorkQueue[i];
2303 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2304 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2307 const CDataStream& vMsg = *((*mi).second);
2309 CDataStream(vMsg) >> tx;
2310 CInv inv(MSG_TX, tx.GetHash());
2312 if (tx.AcceptToMemoryPool(true))
2314 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2315 SyncWithWallets(tx, NULL, true);
2316 RelayMessage(inv, vMsg);
2317 mapAlreadyAskedFor.erase(inv);
2318 vWorkQueue.push_back(inv.hash);
2323 BOOST_FOREACH(uint256 hash, vWorkQueue)
2324 EraseOrphanTx(hash);
2326 else if (fMissingInputs)
2328 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2331 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2332 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2334 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2339 else if (strCommand == "block")
2344 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2347 CInv inv(MSG_BLOCK, block.GetHash());
2348 pfrom->AddInventoryKnown(inv);
2350 if (ProcessBlock(pfrom, &block))
2351 mapAlreadyAskedFor.erase(inv);
2355 else if (strCommand == "getaddr")
2357 // Nodes rebroadcast an addr every 24 hours
2358 pfrom->vAddrToSend.clear();
2359 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2360 CRITICAL_BLOCK(cs_mapAddresses)
2362 unsigned int nCount = 0;
2363 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2365 const CAddress& addr = item.second;
2366 if (addr.nTime > nSince)
2369 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2371 const CAddress& addr = item.second;
2372 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2373 pfrom->PushAddress(addr);
2379 else if (strCommand == "checkorder")
2384 if (!GetBoolArg("-allowreceivebyip"))
2386 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2393 /// we have a chance to check the order here
2395 // Keep giving the same key to the same ip until they use it
2396 if (!mapReuseKey.count(pfrom->addr.ip))
2397 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2399 // Send back approval of order and pubkey to use
2400 CScript scriptPubKey;
2401 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2402 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2406 else if (strCommand == "reply")
2411 CRequestTracker tracker;
2412 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2414 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2415 if (mi != pfrom->mapRequests.end())
2417 tracker = (*mi).second;
2418 pfrom->mapRequests.erase(mi);
2421 if (!tracker.IsNull())
2422 tracker.fn(tracker.param1, vRecv);
2426 else if (strCommand == "ping")
2431 else if (strCommand == "alert")
2436 if (alert.ProcessAlert())
2439 pfrom->setKnown.insert(alert.GetHash());
2440 CRITICAL_BLOCK(cs_vNodes)
2441 BOOST_FOREACH(CNode* pnode, vNodes)
2442 alert.RelayTo(pnode);
2449 // Ignore unknown commands for extensibility
2453 // Update the last seen time for this node's address
2454 if (pfrom->fNetworkNode)
2455 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2456 AddressCurrentlyConnected(pfrom->addr);
2462 bool ProcessMessages(CNode* pfrom)
2464 CDataStream& vRecv = pfrom->vRecv;
2468 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2472 // (4) message start
2481 // Scan for message start
2482 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2483 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2484 if (vRecv.end() - pstart < nHeaderSize)
2486 if (vRecv.size() > nHeaderSize)
2488 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2489 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2493 if (pstart - vRecv.begin() > 0)
2494 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2495 vRecv.erase(vRecv.begin(), pstart);
2498 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2503 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2506 string strCommand = hdr.GetCommand();
2509 unsigned int nMessageSize = hdr.nMessageSize;
2510 if (nMessageSize > MAX_SIZE)
2512 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2515 if (nMessageSize > vRecv.size())
2517 // Rewind and wait for rest of message
2518 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2523 if (vRecv.GetVersion() >= 209)
2525 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2526 unsigned int nChecksum = 0;
2527 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2528 if (nChecksum != hdr.nChecksum)
2530 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2531 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2536 // Copy message to its own buffer
2537 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2538 vRecv.ignore(nMessageSize);
2544 CRITICAL_BLOCK(cs_main)
2545 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2549 catch (std::ios_base::failure& e)
2551 if (strstr(e.what(), "end of data"))
2553 // Allow exceptions from underlength message on vRecv
2554 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2556 else if (strstr(e.what(), "size too large"))
2558 // Allow exceptions from overlong size
2559 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2563 PrintExceptionContinue(&e, "ProcessMessage()");
2566 catch (std::exception& e) {
2567 PrintExceptionContinue(&e, "ProcessMessage()");
2569 PrintExceptionContinue(NULL, "ProcessMessage()");
2573 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2581 bool SendMessages(CNode* pto, bool fSendTrickle)
2583 CRITICAL_BLOCK(cs_main)
2585 // Don't send anything until we get their version message
2586 if (pto->nVersion == 0)
2590 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2591 pto->PushMessage("ping");
2593 // Resend wallet transactions that haven't gotten in a block yet
2594 ResendWalletTransactions();
2596 // Address refresh broadcast
2597 static int64 nLastRebroadcast;
2598 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2600 nLastRebroadcast = GetTime();
2601 CRITICAL_BLOCK(cs_vNodes)
2603 BOOST_FOREACH(CNode* pnode, vNodes)
2605 // Periodically clear setAddrKnown to allow refresh broadcasts
2606 pnode->setAddrKnown.clear();
2608 // Rebroadcast our address
2609 if (addrLocalHost.IsRoutable() && !fUseProxy)
2611 CAddress addr(addrLocalHost);
2612 addr.nTime = GetAdjustedTime();
2613 pnode->PushAddress(addr);
2619 // Clear out old addresses periodically so it's not too much work at once
2620 static int64 nLastClear;
2621 if (nLastClear == 0)
2622 nLastClear = GetTime();
2623 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2625 nLastClear = GetTime();
2626 CRITICAL_BLOCK(cs_mapAddresses)
2629 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2630 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2631 mi != mapAddresses.end();)
2633 const CAddress& addr = (*mi).second;
2634 if (addr.nTime < nSince)
2636 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2638 addrdb.EraseAddress(addr);
2639 mapAddresses.erase(mi++);
2653 vector<CAddress> vAddr;
2654 vAddr.reserve(pto->vAddrToSend.size());
2655 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2657 // returns true if wasn't already contained in the set
2658 if (pto->setAddrKnown.insert(addr).second)
2660 vAddr.push_back(addr);
2661 // receiver rejects addr messages larger than 1000
2662 if (vAddr.size() >= 1000)
2664 pto->PushMessage("addr", vAddr);
2669 pto->vAddrToSend.clear();
2671 pto->PushMessage("addr", vAddr);
2676 // Message: inventory
2679 vector<CInv> vInvWait;
2680 CRITICAL_BLOCK(pto->cs_inventory)
2682 vInv.reserve(pto->vInventoryToSend.size());
2683 vInvWait.reserve(pto->vInventoryToSend.size());
2684 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2686 if (pto->setInventoryKnown.count(inv))
2689 // trickle out tx inv to protect privacy
2690 if (inv.type == MSG_TX && !fSendTrickle)
2692 // 1/4 of tx invs blast to all immediately
2693 static uint256 hashSalt;
2695 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2696 uint256 hashRand = inv.hash ^ hashSalt;
2697 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2698 bool fTrickleWait = ((hashRand & 3) != 0);
2700 // always trickle our own transactions
2704 if (GetTransaction(inv.hash, wtx))
2706 fTrickleWait = true;
2711 vInvWait.push_back(inv);
2716 // returns true if wasn't already contained in the set
2717 if (pto->setInventoryKnown.insert(inv).second)
2719 vInv.push_back(inv);
2720 if (vInv.size() >= 1000)
2722 pto->PushMessage("inv", vInv);
2727 pto->vInventoryToSend = vInvWait;
2730 pto->PushMessage("inv", vInv);
2736 vector<CInv> vGetData;
2737 int64 nNow = GetTime() * 1000000;
2739 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2741 const CInv& inv = (*pto->mapAskFor.begin()).second;
2742 if (!AlreadyHave(txdb, inv))
2744 printf("sending getdata: %s\n", inv.ToString().c_str());
2745 vGetData.push_back(inv);
2746 if (vGetData.size() >= 1000)
2748 pto->PushMessage("getdata", vGetData);
2752 mapAlreadyAskedFor[inv] = nNow;
2753 pto->mapAskFor.erase(pto->mapAskFor.begin());
2755 if (!vGetData.empty())
2756 pto->PushMessage("getdata", vGetData);
2775 //////////////////////////////////////////////////////////////////////////////
2780 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2782 unsigned char* pdata = (unsigned char*)pbuffer;
2783 unsigned int blocks = 1 + ((len + 8) / 64);
2784 unsigned char* pend = pdata + 64 * blocks;
2785 memset(pdata + len, 0, 64 * blocks - len);
2787 unsigned int bits = len * 8;
2788 pend[-1] = (bits >> 0) & 0xff;
2789 pend[-2] = (bits >> 8) & 0xff;
2790 pend[-3] = (bits >> 16) & 0xff;
2791 pend[-4] = (bits >> 24) & 0xff;
2795 using CryptoPP::ByteReverse;
2797 static const unsigned int pSHA256InitState[8] =
2798 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2800 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2802 memcpy(pstate, pinit, 32);
2803 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2807 // ScanHash scans nonces looking for a hash with at least some zero bits.
2808 // It operates on big endian data. Caller does the byte reversing.
2809 // All input buffers are 16-byte aligned. nNonce is usually preserved
2810 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2811 // the block is rebuilt and nNonce starts over at zero.
2813 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2815 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2819 // Hash pdata using pmidstate as the starting state into
2820 // preformatted buffer phash1, then hash phash1 into phash
2822 SHA256Transform(phash1, pdata, pmidstate);
2823 SHA256Transform(phash, phash1, pSHA256InitState);
2825 // Return the nonce if the hash has at least some zero bits,
2826 // caller will check if it has enough to reach the target
2827 if (((unsigned short*)phash)[14] == 0)
2830 // If nothing found after trying for a while, return -1
2831 if ((nNonce & 0xffff) == 0)
2833 nHashesDone = 0xffff+1;
2839 // Some explaining would be appreciated
2844 set<uint256> setDependsOn;
2847 COrphan(CTransaction* ptxIn)
2855 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2856 BOOST_FOREACH(uint256 hash, setDependsOn)
2857 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2862 CBlock* CreateNewBlock(CReserveKey& reservekey)
2864 CBlockIndex* pindexPrev = pindexBest;
2867 auto_ptr<CBlock> pblock(new CBlock());
2871 // Create coinbase tx
2873 txNew.vin.resize(1);
2874 txNew.vin[0].prevout.SetNull();
2875 txNew.vout.resize(1);
2876 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2878 // Add our coinbase tx as first transaction
2879 pblock->vtx.push_back(txNew);
2881 // Collect memory pool transactions into the block
2883 CRITICAL_BLOCK(cs_main)
2884 CRITICAL_BLOCK(cs_mapTransactions)
2888 // Priority order to process transactions
2889 list<COrphan> vOrphan; // list memory doesn't move
2890 map<uint256, vector<COrphan*> > mapDependers;
2891 multimap<double, CTransaction*> mapPriority;
2892 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2894 CTransaction& tx = (*mi).second;
2895 if (tx.IsCoinBase() || !tx.IsFinal())
2898 COrphan* porphan = NULL;
2899 double dPriority = 0;
2900 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2902 // Read prev transaction
2903 CTransaction txPrev;
2905 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2907 // Has to wait for dependencies
2910 // Use list for automatic deletion
2911 vOrphan.push_back(COrphan(&tx));
2912 porphan = &vOrphan.back();
2914 mapDependers[txin.prevout.hash].push_back(porphan);
2915 porphan->setDependsOn.insert(txin.prevout.hash);
2918 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2920 // Read block header
2921 int nConf = txindex.GetDepthInMainChain();
2923 dPriority += (double)nValueIn * nConf;
2925 if (fDebug && GetBoolArg("-printpriority"))
2926 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2929 // Priority is sum(valuein * age) / txsize
2930 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2933 porphan->dPriority = dPriority;
2935 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2937 if (fDebug && GetBoolArg("-printpriority"))
2939 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2946 // Collect transactions into block
2947 map<uint256, CTxIndex> mapTestPool;
2948 uint64 nBlockSize = 1000;
2949 int nBlockSigOps = 100;
2950 while (!mapPriority.empty())
2952 // Take highest priority transaction off priority queue
2953 double dPriority = -(*mapPriority.begin()).first;
2954 CTransaction& tx = *(*mapPriority.begin()).second;
2955 mapPriority.erase(mapPriority.begin());
2958 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2959 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2962 // Legacy limits on sigOps:
2963 int nTxSigOps = tx.GetSigOpCount();
2964 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2967 // Transaction fee required depends on block size
2968 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2969 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2971 // Connecting shouldn't fail due to dependency on other memory pool transactions
2972 // because we're already processing them in order of dependency
2973 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2975 MapPrevTx mapInputs;
2976 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
2979 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
2980 if (nTxFees < nMinFee)
2983 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
2984 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2987 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
2989 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
2990 swap(mapTestPool, mapTestPoolTmp);
2993 pblock->vtx.push_back(tx);
2994 nBlockSize += nTxSize;
2995 nBlockSigOps += nTxSigOps;
2998 // Add transactions that depend on this one to the priority queue
2999 uint256 hash = tx.GetHash();
3000 if (mapDependers.count(hash))
3002 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3004 if (!porphan->setDependsOn.empty())
3006 porphan->setDependsOn.erase(hash);
3007 if (porphan->setDependsOn.empty())
3008 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3014 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3017 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3018 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3019 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3020 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3023 return pblock.release();
3027 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3029 // Update nExtraNonce
3030 static uint256 hashPrevBlock;
3031 if (hashPrevBlock != pblock->hashPrevBlock)
3034 hashPrevBlock = pblock->hashPrevBlock;
3037 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3038 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3042 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3045 // Prebuild hash buffers
3052 uint256 hashPrevBlock;
3053 uint256 hashMerkleRoot;
3056 unsigned int nNonce;
3059 unsigned char pchPadding0[64];
3061 unsigned char pchPadding1[64];
3064 memset(&tmp, 0, sizeof(tmp));
3066 tmp.block.nVersion = pblock->nVersion;
3067 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3068 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3069 tmp.block.nTime = pblock->nTime;
3070 tmp.block.nBits = pblock->nBits;
3071 tmp.block.nNonce = pblock->nNonce;
3073 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3074 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3076 // Byte swap all the input buffer
3077 for (int i = 0; i < sizeof(tmp)/4; i++)
3078 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3080 // Precalc the first half of the first hash, which stays constant
3081 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3083 memcpy(pdata, &tmp.block, 128);
3084 memcpy(phash1, &tmp.hash1, 64);
3088 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3090 uint256 hash = pblock->GetHash();
3091 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3093 if (hash > hashTarget)
3097 printf("BitcoinMiner:\n");
3098 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3100 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3101 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3104 CRITICAL_BLOCK(cs_main)
3106 if (pblock->hashPrevBlock != hashBestChain)
3107 return error("BitcoinMiner : generated block is stale");
3109 // Remove key from key pool
3110 reservekey.KeepKey();
3112 // Track how many getdata requests this block gets
3113 CRITICAL_BLOCK(wallet.cs_wallet)
3114 wallet.mapRequestCount[pblock->GetHash()] = 0;
3116 // Process this block the same as if we had received it from another node
3117 if (!ProcessBlock(NULL, pblock))
3118 return error("BitcoinMiner : ProcessBlock, block not accepted");
3125 void static ThreadBitcoinMiner(void* parg);
3127 void static BitcoinMiner(CWallet *pwallet)
3129 printf("BitcoinMiner started\n");
3130 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3132 // Each thread has its own key and counter
3133 CReserveKey reservekey(pwallet);
3134 unsigned int nExtraNonce = 0;
3136 while (fGenerateBitcoins)
3138 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3142 while (vNodes.empty() || IsInitialBlockDownload())
3147 if (!fGenerateBitcoins)
3155 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3156 CBlockIndex* pindexPrev = pindexBest;
3158 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3161 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3163 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3167 // Prebuild hash buffers
3169 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3170 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3171 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3173 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3175 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3176 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3182 int64 nStart = GetTime();
3183 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3185 uint256& hash = *alignup<16>(hashbuf);
3188 unsigned int nHashesDone = 0;
3189 unsigned int nNonceFound;
3192 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3193 (char*)&hash, nHashesDone);
3195 // Check if something found
3196 if (nNonceFound != -1)
3198 for (int i = 0; i < sizeof(hash)/4; i++)
3199 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3201 if (hash <= hashTarget)
3204 pblock->nNonce = ByteReverse(nNonceFound);
3205 assert(hash == pblock->GetHash());
3207 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3208 CheckWork(pblock.get(), *pwalletMain, reservekey);
3209 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3215 static int64 nHashCounter;
3216 if (nHPSTimerStart == 0)
3218 nHPSTimerStart = GetTimeMillis();
3222 nHashCounter += nHashesDone;
3223 if (GetTimeMillis() - nHPSTimerStart > 4000)
3225 static CCriticalSection cs;
3228 if (GetTimeMillis() - nHPSTimerStart > 4000)
3230 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3231 nHPSTimerStart = GetTimeMillis();
3233 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3234 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3235 static int64 nLogTime;
3236 if (GetTime() - nLogTime > 30 * 60)
3238 nLogTime = GetTime();
3239 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3240 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3246 // Check for stop or if block needs to be rebuilt
3249 if (!fGenerateBitcoins)
3251 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3255 if (nBlockNonce >= 0xffff0000)
3257 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3259 if (pindexPrev != pindexBest)
3262 // Update nTime every few seconds
3263 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3264 nBlockTime = ByteReverse(pblock->nTime);
3269 void static ThreadBitcoinMiner(void* parg)
3271 CWallet* pwallet = (CWallet*)parg;
3274 vnThreadsRunning[3]++;
3275 BitcoinMiner(pwallet);
3276 vnThreadsRunning[3]--;
3278 catch (std::exception& e) {
3279 vnThreadsRunning[3]--;
3280 PrintException(&e, "ThreadBitcoinMiner()");
3282 vnThreadsRunning[3]--;
3283 PrintException(NULL, "ThreadBitcoinMiner()");
3285 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3287 if (vnThreadsRunning[3] == 0)
3289 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3293 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3295 if (fGenerateBitcoins != fGenerate)
3297 fGenerateBitcoins = fGenerate;
3298 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3301 if (fGenerateBitcoins)
3303 int nProcessors = boost::thread::hardware_concurrency();
3304 printf("%d processors\n", nProcessors);
3305 if (nProcessors < 1)
3307 if (fLimitProcessors && nProcessors > nLimitProcessors)
3308 nProcessors = nLimitProcessors;
3309 int nAddThreads = nProcessors - vnThreadsRunning[3];
3310 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3311 for (int i = 0; i < nAddThreads; i++)
3313 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3314 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");