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");
820 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
822 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
824 // Updating time can change work required on testnet:
826 nBits = GetNextWorkRequired(pindexPrev, this);
839 bool CTransaction::DisconnectInputs(CTxDB& txdb)
841 // Relinquish previous transactions' spent pointers
844 BOOST_FOREACH(const CTxIn& txin, vin)
846 COutPoint prevout = txin.prevout;
848 // Get prev txindex from disk
850 if (!txdb.ReadTxIndex(prevout.hash, txindex))
851 return error("DisconnectInputs() : ReadTxIndex failed");
853 if (prevout.n >= txindex.vSpent.size())
854 return error("DisconnectInputs() : prevout.n out of range");
856 // Mark outpoint as not spent
857 txindex.vSpent[prevout.n].SetNull();
860 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
861 return error("DisconnectInputs() : UpdateTxIndex failed");
865 // Remove transaction from index
866 // This can fail if a duplicate of this transaction was in a chain that got
867 // reorganized away. This is only possible if this transaction was completely
868 // spent, so erasing it would be a no-op anway.
869 txdb.EraseTxIndex(*this);
875 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
876 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
878 // FetchInputs can return false either because we just haven't seen some inputs
879 // (in which case the transaction should be stored as an orphan)
880 // or because the transaction is malformed (in which case the transaction should
881 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
885 return true; // Coinbase transactions have no inputs to fetch.
887 for (int i = 0; i < vin.size(); i++)
889 COutPoint prevout = vin[i].prevout;
890 if (inputsRet.count(prevout.hash))
891 continue; // Got it already
894 CTxIndex& txindex = inputsRet[prevout.hash].first;
896 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
898 // Get txindex from current proposed changes
899 txindex = mapTestPool.find(prevout.hash)->second;
903 // Read txindex from txdb
904 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
906 if (!fFound && (fBlock || fMiner))
907 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());
910 CTransaction& txPrev = inputsRet[prevout.hash].second;
911 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
913 // Get prev tx from single transactions in memory
914 CRITICAL_BLOCK(cs_mapTransactions)
916 if (!mapTransactions.count(prevout.hash))
917 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
918 txPrev = mapTransactions[prevout.hash];
921 txindex.vSpent.resize(txPrev.vout.size());
925 // Get prev tx from disk
926 if (!txPrev.ReadFromDisk(txindex.pos))
927 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
931 // Make sure all prevout.n's are valid:
932 for (int i = 0; i < vin.size(); i++)
934 const COutPoint prevout = vin[i].prevout;
935 assert(inputsRet.count(prevout.hash) != 0);
936 const CTxIndex& txindex = inputsRet[prevout.hash].first;
937 const CTransaction& txPrev = inputsRet[prevout.hash].second;
938 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
940 // Revisit this if/when transaction replacement is implemented and allows
943 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());
950 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
952 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
953 if (mi == inputs.end())
954 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
956 const CTransaction& txPrev = (mi->second).second;
957 if (input.prevout.n >= txPrev.vout.size())
958 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
960 return txPrev.vout[input.prevout.n];
963 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
969 for (int i = 0; i < vin.size(); i++)
971 nResult += GetOutputFor(vin[i], inputs).nValue;
977 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
983 for (int i = 0; i < vin.size(); i++)
985 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
986 if (prevout.scriptPubKey.IsPayToScriptHash())
987 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
992 bool CTransaction::ConnectInputs(MapPrevTx inputs,
993 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
994 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
996 // Take over previous transactions' spent pointers
997 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
998 // fMiner is true when called from the internal bitcoin miner
999 // ... both are false when called from CTransaction::AcceptToMemoryPool
1004 for (int i = 0; i < vin.size(); i++)
1006 COutPoint prevout = vin[i].prevout;
1007 assert(inputs.count(prevout.hash) > 0);
1008 CTxIndex& txindex = inputs[prevout.hash].first;
1009 CTransaction& txPrev = inputs[prevout.hash].second;
1011 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1012 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());
1014 // If prev is coinbase, check that it's matured
1015 if (txPrev.IsCoinBase())
1016 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1017 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1018 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1020 // Check for conflicts (double-spend)
1021 if (!txindex.vSpent[prevout.n].IsNull())
1022 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());
1024 // Check for negative or overflow input values
1025 nValueIn += txPrev.vout[prevout.n].nValue;
1026 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1027 return error("ConnectInputs() : txin values out of range");
1030 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1031 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1033 // Mark outpoints as spent
1034 txindex.vSpent[prevout.n] = posThisTx;
1037 if (fBlock || fMiner)
1039 mapTestPool[prevout.hash] = txindex;
1043 if (nValueIn < GetValueOut())
1044 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
1046 // Tally transaction fees
1047 int64 nTxFee = nValueIn - GetValueOut();
1049 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
1051 if (!MoneyRange(nFees))
1052 return error("ConnectInputs() : nFees out of range");
1059 bool CTransaction::ClientConnectInputs()
1064 // Take over previous transactions' spent pointers
1065 CRITICAL_BLOCK(cs_mapTransactions)
1068 for (int i = 0; i < vin.size(); i++)
1070 // Get prev tx from single transactions in memory
1071 COutPoint prevout = vin[i].prevout;
1072 if (!mapTransactions.count(prevout.hash))
1074 CTransaction& txPrev = mapTransactions[prevout.hash];
1076 if (prevout.n >= txPrev.vout.size())
1080 if (!VerifySignature(txPrev, *this, i, true, 0))
1081 return error("ConnectInputs() : VerifySignature failed");
1083 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1084 ///// this has to go away now that posNext is gone
1085 // // Check for conflicts
1086 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1087 // return error("ConnectInputs() : prev tx already used");
1089 // // Flag outpoints as used
1090 // txPrev.vout[prevout.n].posNext = posThisTx;
1092 nValueIn += txPrev.vout[prevout.n].nValue;
1094 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1095 return error("ClientConnectInputs() : txin values out of range");
1097 if (GetValueOut() > nValueIn)
1107 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1109 // Disconnect in reverse order
1110 for (int i = vtx.size()-1; i >= 0; i--)
1111 if (!vtx[i].DisconnectInputs(txdb))
1114 // Update block index on disk without changing it in memory.
1115 // The memory index structure will be changed after the db commits.
1118 CDiskBlockIndex blockindexPrev(pindex->pprev);
1119 blockindexPrev.hashNext = 0;
1120 if (!txdb.WriteBlockIndex(blockindexPrev))
1121 return error("DisconnectBlock() : WriteBlockIndex failed");
1127 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1129 // Check it again in case a previous version let a bad block in
1133 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1134 // unless those are already completely spent.
1135 // If such overwrites are allowed, coinbases and transactions depending upon those
1136 // can be duplicated to remove the ability to spend the first instance -- even after
1137 // being sent to another address.
1138 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1139 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1140 // already refuses previously-known transaction id's entirely.
1141 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1142 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1143 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1144 BOOST_FOREACH(CTransaction& tx, vtx)
1146 CTxIndex txindexOld;
1147 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1148 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1153 // P2SH didn't become active until Apr 1 2012 (Feb 15 on testnet)
1154 int64 nEvalSwitchTime = fTestNet ? 1329264000 : 1333238400;
1155 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1157 //// issue here: it doesn't know the version
1158 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1160 map<uint256, CTxIndex> mapQueuedChanges;
1163 BOOST_FOREACH(CTransaction& tx, vtx)
1165 nSigOps += tx.GetSigOpCount();
1166 if (nSigOps > MAX_BLOCK_SIGOPS)
1167 return error("ConnectBlock() : too many sigops");
1169 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1170 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1173 MapPrevTx mapInputs;
1174 if (!tx.IsCoinBase())
1176 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1179 if (fStrictPayToScriptHash)
1181 // Add in sigops done by pay-to-script-hash inputs;
1182 // this is to prevent a "rogue miner" from creating
1183 // an incredibly-expensive-to-validate block.
1184 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1185 if (nSigOps > MAX_BLOCK_SIGOPS)
1186 return error("ConnectBlock() : too many sigops");
1189 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1191 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1195 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1198 // Write queued txindex changes
1199 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1201 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1202 return error("ConnectBlock() : UpdateTxIndex failed");
1205 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1208 // Update block index on disk without changing it in memory.
1209 // The memory index structure will be changed after the db commits.
1212 CDiskBlockIndex blockindexPrev(pindex->pprev);
1213 blockindexPrev.hashNext = pindex->GetBlockHash();
1214 if (!txdb.WriteBlockIndex(blockindexPrev))
1215 return error("ConnectBlock() : WriteBlockIndex failed");
1218 // Watch for transactions paying to me
1219 BOOST_FOREACH(CTransaction& tx, vtx)
1220 SyncWithWallets(tx, this, true);
1225 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1227 printf("REORGANIZE\n");
1230 CBlockIndex* pfork = pindexBest;
1231 CBlockIndex* plonger = pindexNew;
1232 while (pfork != plonger)
1234 while (plonger->nHeight > pfork->nHeight)
1235 if (!(plonger = plonger->pprev))
1236 return error("Reorganize() : plonger->pprev is null");
1237 if (pfork == plonger)
1239 if (!(pfork = pfork->pprev))
1240 return error("Reorganize() : pfork->pprev is null");
1243 // List of what to disconnect
1244 vector<CBlockIndex*> vDisconnect;
1245 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1246 vDisconnect.push_back(pindex);
1248 // List of what to connect
1249 vector<CBlockIndex*> vConnect;
1250 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1251 vConnect.push_back(pindex);
1252 reverse(vConnect.begin(), vConnect.end());
1254 printf("REORGANIZE: Disconnect %i blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1255 printf("REORGANIZE: Connect %i blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1257 // Disconnect shorter branch
1258 vector<CTransaction> vResurrect;
1259 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1262 if (!block.ReadFromDisk(pindex))
1263 return error("Reorganize() : ReadFromDisk for disconnect failed");
1264 if (!block.DisconnectBlock(txdb, pindex))
1265 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1267 // Queue memory transactions to resurrect
1268 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1269 if (!tx.IsCoinBase())
1270 vResurrect.push_back(tx);
1273 // Connect longer branch
1274 vector<CTransaction> vDelete;
1275 for (int i = 0; i < vConnect.size(); i++)
1277 CBlockIndex* pindex = vConnect[i];
1279 if (!block.ReadFromDisk(pindex))
1280 return error("Reorganize() : ReadFromDisk for connect failed");
1281 if (!block.ConnectBlock(txdb, pindex))
1285 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1288 // Queue memory transactions to delete
1289 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1290 vDelete.push_back(tx);
1292 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1293 return error("Reorganize() : WriteHashBestChain failed");
1295 // Make sure it's successfully written to disk before changing memory structure
1296 if (!txdb.TxnCommit())
1297 return error("Reorganize() : TxnCommit failed");
1299 // Disconnect shorter branch
1300 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1302 pindex->pprev->pnext = NULL;
1304 // Connect longer branch
1305 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1307 pindex->pprev->pnext = pindex;
1309 // Resurrect memory transactions that were in the disconnected branch
1310 BOOST_FOREACH(CTransaction& tx, vResurrect)
1311 tx.AcceptToMemoryPool(txdb, false);
1313 // Delete redundant memory transactions that are in the connected branch
1314 BOOST_FOREACH(CTransaction& tx, vDelete)
1315 tx.RemoveFromMemoryPool();
1317 printf("REORGANIZE: done\n");
1323 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1325 uint256 hash = GetHash();
1328 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1330 txdb.WriteHashBestChain(hash);
1331 if (!txdb.TxnCommit())
1332 return error("SetBestChain() : TxnCommit failed");
1333 pindexGenesisBlock = pindexNew;
1335 else if (hashPrevBlock == hashBestChain)
1337 // Adding to current best branch
1338 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1341 InvalidChainFound(pindexNew);
1342 return error("SetBestChain() : ConnectBlock failed");
1344 if (!txdb.TxnCommit())
1345 return error("SetBestChain() : TxnCommit failed");
1347 // Add to current best branch
1348 pindexNew->pprev->pnext = pindexNew;
1350 // Delete redundant memory transactions
1351 BOOST_FOREACH(CTransaction& tx, vtx)
1352 tx.RemoveFromMemoryPool();
1357 if (!Reorganize(txdb, pindexNew))
1360 InvalidChainFound(pindexNew);
1361 return error("SetBestChain() : Reorganize failed");
1365 // Update best block in wallet (so we can detect restored wallets)
1366 if (!IsInitialBlockDownload())
1368 const CBlockLocator locator(pindexNew);
1369 ::SetBestChain(locator);
1373 hashBestChain = hash;
1374 pindexBest = pindexNew;
1375 nBestHeight = pindexBest->nHeight;
1376 bnBestChainWork = pindexNew->bnChainWork;
1377 nTimeBestReceived = GetTime();
1378 nTransactionsUpdated++;
1379 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1385 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1387 // Check for duplicate
1388 uint256 hash = GetHash();
1389 if (mapBlockIndex.count(hash))
1390 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1392 // Construct new block index object
1393 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1395 return error("AddToBlockIndex() : new CBlockIndex failed");
1396 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1397 pindexNew->phashBlock = &((*mi).first);
1398 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1399 if (miPrev != mapBlockIndex.end())
1401 pindexNew->pprev = (*miPrev).second;
1402 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1404 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1408 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1409 if (!txdb.TxnCommit())
1413 if (pindexNew->bnChainWork > bnBestChainWork)
1414 if (!SetBestChain(txdb, pindexNew))
1419 if (pindexNew == pindexBest)
1421 // Notify UI to display prev block's coinbase if it was ours
1422 static uint256 hashPrevBestCoinBase;
1423 UpdatedTransaction(hashPrevBestCoinBase);
1424 hashPrevBestCoinBase = vtx[0].GetHash();
1434 bool CBlock::CheckBlock() const
1436 // These are checks that are independent of context
1437 // that can be verified before saving an orphan block.
1440 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1441 return error("CheckBlock() : size limits failed");
1443 // Check proof of work matches claimed amount
1444 if (!CheckProofOfWork(GetHash(), nBits))
1445 return error("CheckBlock() : proof of work failed");
1448 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1449 return error("CheckBlock() : block timestamp too far in the future");
1451 // First transaction must be coinbase, the rest must not be
1452 if (vtx.empty() || !vtx[0].IsCoinBase())
1453 return error("CheckBlock() : first tx is not coinbase");
1454 for (int i = 1; i < vtx.size(); i++)
1455 if (vtx[i].IsCoinBase())
1456 return error("CheckBlock() : more than one coinbase");
1458 // Check transactions
1459 BOOST_FOREACH(const CTransaction& tx, vtx)
1460 if (!tx.CheckTransaction())
1461 return error("CheckBlock() : CheckTransaction failed");
1463 // Check that it's not full of nonstandard transactions
1464 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1465 return error("CheckBlock() : out-of-bounds SigOpCount");
1468 if (hashMerkleRoot != BuildMerkleTree())
1469 return error("CheckBlock() : hashMerkleRoot mismatch");
1474 bool CBlock::AcceptBlock()
1476 // Check for duplicate
1477 uint256 hash = GetHash();
1478 if (mapBlockIndex.count(hash))
1479 return error("AcceptBlock() : block already in mapBlockIndex");
1481 // Get prev block index
1482 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1483 if (mi == mapBlockIndex.end())
1484 return error("AcceptBlock() : prev block not found");
1485 CBlockIndex* pindexPrev = (*mi).second;
1486 int nHeight = pindexPrev->nHeight+1;
1488 // Check proof of work
1489 if (nBits != GetNextWorkRequired(pindexPrev, this))
1490 return error("AcceptBlock() : incorrect proof of work");
1492 // Check timestamp against prev
1493 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1494 return error("AcceptBlock() : block's timestamp is too early");
1496 // Check that all transactions are finalized
1497 BOOST_FOREACH(const CTransaction& tx, vtx)
1498 if (!tx.IsFinal(nHeight, GetBlockTime()))
1499 return error("AcceptBlock() : contains a non-final transaction");
1501 // Check that the block chain matches the known block chain up to a checkpoint
1502 if (!Checkpoints::CheckBlock(nHeight, hash))
1503 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1505 // Write block to history file
1506 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1507 return error("AcceptBlock() : out of disk space");
1508 unsigned int nFile = -1;
1509 unsigned int nBlockPos = 0;
1510 if (!WriteToDisk(nFile, nBlockPos))
1511 return error("AcceptBlock() : WriteToDisk failed");
1512 if (!AddToBlockIndex(nFile, nBlockPos))
1513 return error("AcceptBlock() : AddToBlockIndex failed");
1515 // Relay inventory, but don't relay old inventory during initial block download
1516 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1517 if (hashBestChain == hash)
1518 CRITICAL_BLOCK(cs_vNodes)
1519 BOOST_FOREACH(CNode* pnode, vNodes)
1520 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1521 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1526 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1528 // Check for duplicate
1529 uint256 hash = pblock->GetHash();
1530 if (mapBlockIndex.count(hash))
1531 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1532 if (mapOrphanBlocks.count(hash))
1533 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1535 // Preliminary checks
1536 if (!pblock->CheckBlock())
1537 return error("ProcessBlock() : CheckBlock FAILED");
1539 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1540 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1542 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1543 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1546 return error("ProcessBlock() : block with timestamp before last checkpoint");
1549 bnNewBlock.SetCompact(pblock->nBits);
1551 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1552 if (bnNewBlock > bnRequired)
1554 return error("ProcessBlock() : block with too little proof-of-work");
1559 // If don't already have its previous block, shunt it off to holding area until we get it
1560 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1562 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1563 CBlock* pblock2 = new CBlock(*pblock);
1564 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1565 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1567 // Ask this guy to fill in what we're missing
1569 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1574 if (!pblock->AcceptBlock())
1575 return error("ProcessBlock() : AcceptBlock FAILED");
1577 // Recursively process any orphan blocks that depended on this one
1578 vector<uint256> vWorkQueue;
1579 vWorkQueue.push_back(hash);
1580 for (int i = 0; i < vWorkQueue.size(); i++)
1582 uint256 hashPrev = vWorkQueue[i];
1583 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1584 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1587 CBlock* pblockOrphan = (*mi).second;
1588 if (pblockOrphan->AcceptBlock())
1589 vWorkQueue.push_back(pblockOrphan->GetHash());
1590 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1591 delete pblockOrphan;
1593 mapOrphanBlocksByPrev.erase(hashPrev);
1596 printf("ProcessBlock: ACCEPTED\n");
1607 bool CheckDiskSpace(uint64 nAdditionalBytes)
1609 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1611 // Check for 15MB because database could create another 10MB log file at any time
1612 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1615 string strMessage = _("Warning: Disk space is low ");
1616 strMiscWarning = strMessage;
1617 printf("*** %s\n", strMessage.c_str());
1618 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1619 CreateThread(Shutdown, NULL);
1625 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1629 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1632 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1634 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1643 static unsigned int nCurrentBlockFile = 1;
1645 FILE* AppendBlockFile(unsigned int& nFileRet)
1650 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1653 if (fseek(file, 0, SEEK_END) != 0)
1655 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1656 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1658 nFileRet = nCurrentBlockFile;
1662 nCurrentBlockFile++;
1666 bool LoadBlockIndex(bool fAllowNew)
1670 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1671 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1672 pchMessageStart[0] = 0xfa;
1673 pchMessageStart[1] = 0xbf;
1674 pchMessageStart[2] = 0xb5;
1675 pchMessageStart[3] = 0xda;
1682 if (!txdb.LoadBlockIndex())
1687 // Init with genesis block
1689 if (mapBlockIndex.empty())
1695 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1696 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1697 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1698 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1699 // vMerkleTree: 4a5e1e
1702 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1704 txNew.vin.resize(1);
1705 txNew.vout.resize(1);
1706 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1707 txNew.vout[0].nValue = 50 * COIN;
1708 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1710 block.vtx.push_back(txNew);
1711 block.hashPrevBlock = 0;
1712 block.hashMerkleRoot = block.BuildMerkleTree();
1714 block.nTime = 1231006505;
1715 block.nBits = 0x1d00ffff;
1716 block.nNonce = 2083236893;
1720 block.nTime = 1296688602;
1721 block.nBits = 0x1d07fff8;
1722 block.nNonce = 384568319;
1726 printf("%s\n", block.GetHash().ToString().c_str());
1727 printf("%s\n", hashGenesisBlock.ToString().c_str());
1728 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1729 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1731 assert(block.GetHash() == hashGenesisBlock);
1733 // Start new block file
1735 unsigned int nBlockPos;
1736 if (!block.WriteToDisk(nFile, nBlockPos))
1737 return error("LoadBlockIndex() : writing genesis block to disk failed");
1738 if (!block.AddToBlockIndex(nFile, nBlockPos))
1739 return error("LoadBlockIndex() : genesis block not accepted");
1747 void PrintBlockTree()
1749 // precompute tree structure
1750 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1751 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1753 CBlockIndex* pindex = (*mi).second;
1754 mapNext[pindex->pprev].push_back(pindex);
1756 //while (rand() % 3 == 0)
1757 // mapNext[pindex->pprev].push_back(pindex);
1760 vector<pair<int, CBlockIndex*> > vStack;
1761 vStack.push_back(make_pair(0, pindexGenesisBlock));
1764 while (!vStack.empty())
1766 int nCol = vStack.back().first;
1767 CBlockIndex* pindex = vStack.back().second;
1770 // print split or gap
1771 if (nCol > nPrevCol)
1773 for (int i = 0; i < nCol-1; i++)
1777 else if (nCol < nPrevCol)
1779 for (int i = 0; i < nCol; i++)
1786 for (int i = 0; i < nCol; i++)
1791 block.ReadFromDisk(pindex);
1792 printf("%d (%u,%u) %s %s tx %d",
1796 block.GetHash().ToString().substr(0,20).c_str(),
1797 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1800 PrintWallets(block);
1802 // put the main timechain first
1803 vector<CBlockIndex*>& vNext = mapNext[pindex];
1804 for (int i = 0; i < vNext.size(); i++)
1806 if (vNext[i]->pnext)
1808 swap(vNext[0], vNext[i]);
1814 for (int i = 0; i < vNext.size(); i++)
1815 vStack.push_back(make_pair(nCol+i, vNext[i]));
1828 //////////////////////////////////////////////////////////////////////////////
1833 map<uint256, CAlert> mapAlerts;
1834 CCriticalSection cs_mapAlerts;
1836 string GetWarnings(string strFor)
1839 string strStatusBar;
1841 if (GetBoolArg("-testsafemode"))
1844 // Misc warnings like out of disk space and clock is wrong
1845 if (strMiscWarning != "")
1848 strStatusBar = strMiscWarning;
1851 // Longer invalid proof-of-work chain
1852 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1855 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1859 CRITICAL_BLOCK(cs_mapAlerts)
1861 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1863 const CAlert& alert = item.second;
1864 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1866 nPriority = alert.nPriority;
1867 strStatusBar = alert.strStatusBar;
1872 if (strFor == "statusbar")
1873 return strStatusBar;
1874 else if (strFor == "rpc")
1876 assert(!"GetWarnings() : invalid parameter");
1880 bool CAlert::ProcessAlert()
1882 if (!CheckSignature())
1887 CRITICAL_BLOCK(cs_mapAlerts)
1889 // Cancel previous alerts
1890 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1892 const CAlert& alert = (*mi).second;
1895 printf("cancelling alert %d\n", alert.nID);
1896 mapAlerts.erase(mi++);
1898 else if (!alert.IsInEffect())
1900 printf("expiring alert %d\n", alert.nID);
1901 mapAlerts.erase(mi++);
1907 // Check if this alert has been cancelled
1908 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1910 const CAlert& alert = item.second;
1911 if (alert.Cancels(*this))
1913 printf("alert already cancelled by %d\n", alert.nID);
1919 mapAlerts.insert(make_pair(GetHash(), *this));
1922 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1934 //////////////////////////////////////////////////////////////////////////////
1940 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1944 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1945 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1947 // Don't know what it is, just say we already got one
1954 // The message start string is designed to be unlikely to occur in normal data.
1955 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1956 // a large 4-byte int at any alignment.
1957 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1960 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1962 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1963 RandAddSeedPerfmon();
1965 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1966 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1968 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1970 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1978 if (strCommand == "version")
1980 // Each connection can only send one version message
1981 if (pfrom->nVersion != 0)
1988 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1989 if (pfrom->nVersion == 10300)
1990 pfrom->nVersion = 300;
1991 if (pfrom->nVersion >= 106 && !vRecv.empty())
1992 vRecv >> addrFrom >> nNonce;
1993 if (pfrom->nVersion >= 106 && !vRecv.empty())
1994 vRecv >> pfrom->strSubVer;
1995 if (pfrom->nVersion >= 209 && !vRecv.empty())
1996 vRecv >> pfrom->nStartingHeight;
1998 if (pfrom->nVersion == 0)
2001 // Disconnect if we connected to ourself
2002 if (nNonce == nLocalHostNonce && nNonce > 1)
2004 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2005 pfrom->fDisconnect = true;
2009 // Be shy and don't send version until we hear
2010 if (pfrom->fInbound)
2011 pfrom->PushVersion();
2013 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2015 AddTimeData(pfrom->addr.ip, nTime);
2018 if (pfrom->nVersion >= 209)
2019 pfrom->PushMessage("verack");
2020 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2021 if (pfrom->nVersion < 209)
2022 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2024 if (!pfrom->fInbound)
2026 // Advertise our address
2027 if (addrLocalHost.IsRoutable() && !fUseProxy)
2029 CAddress addr(addrLocalHost);
2030 addr.nTime = GetAdjustedTime();
2031 pfrom->PushAddress(addr);
2034 // Get recent addresses
2035 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2037 pfrom->PushMessage("getaddr");
2038 pfrom->fGetAddr = true;
2042 // Ask the first connected node for block updates
2043 static int nAskedForBlocks = 0;
2044 if (!pfrom->fClient &&
2045 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2046 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2049 pfrom->PushGetBlocks(pindexBest, uint256(0));
2053 CRITICAL_BLOCK(cs_mapAlerts)
2054 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2055 item.second.RelayTo(pfrom);
2057 pfrom->fSuccessfullyConnected = true;
2059 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2063 else if (pfrom->nVersion == 0)
2065 // Must have a version message before anything else
2070 else if (strCommand == "verack")
2072 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2076 else if (strCommand == "addr")
2078 vector<CAddress> vAddr;
2081 // Don't want addr from older versions unless seeding
2082 if (pfrom->nVersion < 209)
2084 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2086 if (vAddr.size() > 1000)
2087 return error("message addr size() = %d", vAddr.size());
2089 // Store the new addresses
2092 int64 nNow = GetAdjustedTime();
2093 int64 nSince = nNow - 10 * 60;
2094 BOOST_FOREACH(CAddress& addr, vAddr)
2098 // ignore IPv6 for now, since it isn't implemented anyway
2101 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2102 addr.nTime = nNow - 5 * 24 * 60 * 60;
2103 AddAddress(addr, 2 * 60 * 60, &addrDB);
2104 pfrom->AddAddressKnown(addr);
2105 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2107 // Relay to a limited number of other nodes
2108 CRITICAL_BLOCK(cs_vNodes)
2110 // Use deterministic randomness to send to the same nodes for 24 hours
2111 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2112 static uint256 hashSalt;
2114 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2115 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2116 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2117 multimap<uint256, CNode*> mapMix;
2118 BOOST_FOREACH(CNode* pnode, vNodes)
2120 if (pnode->nVersion < 31402)
2122 unsigned int nPointer;
2123 memcpy(&nPointer, &pnode, sizeof(nPointer));
2124 uint256 hashKey = hashRand ^ nPointer;
2125 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2126 mapMix.insert(make_pair(hashKey, pnode));
2128 int nRelayNodes = 2;
2129 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2130 ((*mi).second)->PushAddress(addr);
2134 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2135 if (vAddr.size() < 1000)
2136 pfrom->fGetAddr = false;
2140 else if (strCommand == "inv")
2144 if (vInv.size() > 50000)
2145 return error("message inv size() = %d", vInv.size());
2148 BOOST_FOREACH(const CInv& inv, vInv)
2152 pfrom->AddInventoryKnown(inv);
2154 bool fAlreadyHave = AlreadyHave(txdb, inv);
2156 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2160 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2161 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2163 // Track requests for our stuff
2164 Inventory(inv.hash);
2169 else if (strCommand == "getdata")
2173 if (vInv.size() > 50000)
2174 return error("message getdata size() = %d", vInv.size());
2176 BOOST_FOREACH(const CInv& inv, vInv)
2180 printf("received getdata for: %s\n", inv.ToString().c_str());
2182 if (inv.type == MSG_BLOCK)
2184 // Send block from disk
2185 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2186 if (mi != mapBlockIndex.end())
2189 block.ReadFromDisk((*mi).second);
2190 pfrom->PushMessage("block", block);
2192 // Trigger them to send a getblocks request for the next batch of inventory
2193 if (inv.hash == pfrom->hashContinue)
2195 // Bypass PushInventory, this must send even if redundant,
2196 // and we want it right after the last block so they don't
2197 // wait for other stuff first.
2199 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2200 pfrom->PushMessage("inv", vInv);
2201 pfrom->hashContinue = 0;
2205 else if (inv.IsKnownType())
2207 // Send stream from relay memory
2208 CRITICAL_BLOCK(cs_mapRelay)
2210 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2211 if (mi != mapRelay.end())
2212 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2216 // Track requests for our stuff
2217 Inventory(inv.hash);
2222 else if (strCommand == "getblocks")
2224 CBlockLocator locator;
2226 vRecv >> locator >> hashStop;
2228 // Find the last block the caller has in the main chain
2229 CBlockIndex* pindex = locator.GetBlockIndex();
2231 // Send the rest of the chain
2233 pindex = pindex->pnext;
2234 int nLimit = 500 + locator.GetDistanceBack();
2235 unsigned int nBytes = 0;
2236 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2237 for (; pindex; pindex = pindex->pnext)
2239 if (pindex->GetBlockHash() == hashStop)
2241 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2244 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2246 block.ReadFromDisk(pindex, true);
2247 nBytes += block.GetSerializeSize(SER_NETWORK);
2248 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2250 // When this block is requested, we'll send an inv that'll make them
2251 // getblocks the next batch of inventory.
2252 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2253 pfrom->hashContinue = pindex->GetBlockHash();
2260 else if (strCommand == "getheaders")
2262 CBlockLocator locator;
2264 vRecv >> locator >> hashStop;
2266 CBlockIndex* pindex = NULL;
2267 if (locator.IsNull())
2269 // If locator is null, return the hashStop block
2270 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2271 if (mi == mapBlockIndex.end())
2273 pindex = (*mi).second;
2277 // Find the last block the caller has in the main chain
2278 pindex = locator.GetBlockIndex();
2280 pindex = pindex->pnext;
2283 vector<CBlock> vHeaders;
2284 int nLimit = 2000 + locator.GetDistanceBack();
2285 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2286 for (; pindex; pindex = pindex->pnext)
2288 vHeaders.push_back(pindex->GetBlockHeader());
2289 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2292 pfrom->PushMessage("headers", vHeaders);
2296 else if (strCommand == "tx")
2298 vector<uint256> vWorkQueue;
2299 CDataStream vMsg(vRecv);
2303 CInv inv(MSG_TX, tx.GetHash());
2304 pfrom->AddInventoryKnown(inv);
2306 bool fMissingInputs = false;
2307 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2309 SyncWithWallets(tx, NULL, true);
2310 RelayMessage(inv, vMsg);
2311 mapAlreadyAskedFor.erase(inv);
2312 vWorkQueue.push_back(inv.hash);
2314 // Recursively process any orphan transactions that depended on this one
2315 for (int i = 0; i < vWorkQueue.size(); i++)
2317 uint256 hashPrev = vWorkQueue[i];
2318 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2319 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2322 const CDataStream& vMsg = *((*mi).second);
2324 CDataStream(vMsg) >> tx;
2325 CInv inv(MSG_TX, tx.GetHash());
2327 if (tx.AcceptToMemoryPool(true))
2329 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2330 SyncWithWallets(tx, NULL, true);
2331 RelayMessage(inv, vMsg);
2332 mapAlreadyAskedFor.erase(inv);
2333 vWorkQueue.push_back(inv.hash);
2338 BOOST_FOREACH(uint256 hash, vWorkQueue)
2339 EraseOrphanTx(hash);
2341 else if (fMissingInputs)
2343 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2346 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2347 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2349 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2354 else if (strCommand == "block")
2359 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2362 CInv inv(MSG_BLOCK, block.GetHash());
2363 pfrom->AddInventoryKnown(inv);
2365 if (ProcessBlock(pfrom, &block))
2366 mapAlreadyAskedFor.erase(inv);
2370 else if (strCommand == "getaddr")
2372 // Nodes rebroadcast an addr every 24 hours
2373 pfrom->vAddrToSend.clear();
2374 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2375 CRITICAL_BLOCK(cs_mapAddresses)
2377 unsigned int nCount = 0;
2378 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2380 const CAddress& addr = item.second;
2381 if (addr.nTime > nSince)
2384 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2386 const CAddress& addr = item.second;
2387 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2388 pfrom->PushAddress(addr);
2394 else if (strCommand == "checkorder")
2399 if (!GetBoolArg("-allowreceivebyip"))
2401 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2408 /// we have a chance to check the order here
2410 // Keep giving the same key to the same ip until they use it
2411 if (!mapReuseKey.count(pfrom->addr.ip))
2412 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2414 // Send back approval of order and pubkey to use
2415 CScript scriptPubKey;
2416 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2417 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2421 else if (strCommand == "reply")
2426 CRequestTracker tracker;
2427 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2429 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2430 if (mi != pfrom->mapRequests.end())
2432 tracker = (*mi).second;
2433 pfrom->mapRequests.erase(mi);
2436 if (!tracker.IsNull())
2437 tracker.fn(tracker.param1, vRecv);
2441 else if (strCommand == "ping")
2446 else if (strCommand == "alert")
2451 if (alert.ProcessAlert())
2454 pfrom->setKnown.insert(alert.GetHash());
2455 CRITICAL_BLOCK(cs_vNodes)
2456 BOOST_FOREACH(CNode* pnode, vNodes)
2457 alert.RelayTo(pnode);
2464 // Ignore unknown commands for extensibility
2468 // Update the last seen time for this node's address
2469 if (pfrom->fNetworkNode)
2470 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2471 AddressCurrentlyConnected(pfrom->addr);
2477 bool ProcessMessages(CNode* pfrom)
2479 CDataStream& vRecv = pfrom->vRecv;
2483 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2487 // (4) message start
2496 // Scan for message start
2497 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2498 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2499 if (vRecv.end() - pstart < nHeaderSize)
2501 if (vRecv.size() > nHeaderSize)
2503 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2504 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2508 if (pstart - vRecv.begin() > 0)
2509 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2510 vRecv.erase(vRecv.begin(), pstart);
2513 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2518 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2521 string strCommand = hdr.GetCommand();
2524 unsigned int nMessageSize = hdr.nMessageSize;
2525 if (nMessageSize > MAX_SIZE)
2527 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2530 if (nMessageSize > vRecv.size())
2532 // Rewind and wait for rest of message
2533 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2538 if (vRecv.GetVersion() >= 209)
2540 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2541 unsigned int nChecksum = 0;
2542 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2543 if (nChecksum != hdr.nChecksum)
2545 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2546 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2551 // Copy message to its own buffer
2552 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2553 vRecv.ignore(nMessageSize);
2559 CRITICAL_BLOCK(cs_main)
2560 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2564 catch (std::ios_base::failure& e)
2566 if (strstr(e.what(), "end of data"))
2568 // Allow exceptions from underlength message on vRecv
2569 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());
2571 else if (strstr(e.what(), "size too large"))
2573 // Allow exceptions from overlong size
2574 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2578 PrintExceptionContinue(&e, "ProcessMessage()");
2581 catch (std::exception& e) {
2582 PrintExceptionContinue(&e, "ProcessMessage()");
2584 PrintExceptionContinue(NULL, "ProcessMessage()");
2588 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2596 bool SendMessages(CNode* pto, bool fSendTrickle)
2598 CRITICAL_BLOCK(cs_main)
2600 // Don't send anything until we get their version message
2601 if (pto->nVersion == 0)
2605 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2606 pto->PushMessage("ping");
2608 // Resend wallet transactions that haven't gotten in a block yet
2609 ResendWalletTransactions();
2611 // Address refresh broadcast
2612 static int64 nLastRebroadcast;
2613 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2615 nLastRebroadcast = GetTime();
2616 CRITICAL_BLOCK(cs_vNodes)
2618 BOOST_FOREACH(CNode* pnode, vNodes)
2620 // Periodically clear setAddrKnown to allow refresh broadcasts
2621 pnode->setAddrKnown.clear();
2623 // Rebroadcast our address
2624 if (addrLocalHost.IsRoutable() && !fUseProxy)
2626 CAddress addr(addrLocalHost);
2627 addr.nTime = GetAdjustedTime();
2628 pnode->PushAddress(addr);
2634 // Clear out old addresses periodically so it's not too much work at once
2635 static int64 nLastClear;
2636 if (nLastClear == 0)
2637 nLastClear = GetTime();
2638 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2640 nLastClear = GetTime();
2641 CRITICAL_BLOCK(cs_mapAddresses)
2644 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2645 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2646 mi != mapAddresses.end();)
2648 const CAddress& addr = (*mi).second;
2649 if (addr.nTime < nSince)
2651 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2653 addrdb.EraseAddress(addr);
2654 mapAddresses.erase(mi++);
2668 vector<CAddress> vAddr;
2669 vAddr.reserve(pto->vAddrToSend.size());
2670 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2672 // returns true if wasn't already contained in the set
2673 if (pto->setAddrKnown.insert(addr).second)
2675 vAddr.push_back(addr);
2676 // receiver rejects addr messages larger than 1000
2677 if (vAddr.size() >= 1000)
2679 pto->PushMessage("addr", vAddr);
2684 pto->vAddrToSend.clear();
2686 pto->PushMessage("addr", vAddr);
2691 // Message: inventory
2694 vector<CInv> vInvWait;
2695 CRITICAL_BLOCK(pto->cs_inventory)
2697 vInv.reserve(pto->vInventoryToSend.size());
2698 vInvWait.reserve(pto->vInventoryToSend.size());
2699 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2701 if (pto->setInventoryKnown.count(inv))
2704 // trickle out tx inv to protect privacy
2705 if (inv.type == MSG_TX && !fSendTrickle)
2707 // 1/4 of tx invs blast to all immediately
2708 static uint256 hashSalt;
2710 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2711 uint256 hashRand = inv.hash ^ hashSalt;
2712 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2713 bool fTrickleWait = ((hashRand & 3) != 0);
2715 // always trickle our own transactions
2719 if (GetTransaction(inv.hash, wtx))
2721 fTrickleWait = true;
2726 vInvWait.push_back(inv);
2731 // returns true if wasn't already contained in the set
2732 if (pto->setInventoryKnown.insert(inv).second)
2734 vInv.push_back(inv);
2735 if (vInv.size() >= 1000)
2737 pto->PushMessage("inv", vInv);
2742 pto->vInventoryToSend = vInvWait;
2745 pto->PushMessage("inv", vInv);
2751 vector<CInv> vGetData;
2752 int64 nNow = GetTime() * 1000000;
2754 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2756 const CInv& inv = (*pto->mapAskFor.begin()).second;
2757 if (!AlreadyHave(txdb, inv))
2759 printf("sending getdata: %s\n", inv.ToString().c_str());
2760 vGetData.push_back(inv);
2761 if (vGetData.size() >= 1000)
2763 pto->PushMessage("getdata", vGetData);
2767 mapAlreadyAskedFor[inv] = nNow;
2768 pto->mapAskFor.erase(pto->mapAskFor.begin());
2770 if (!vGetData.empty())
2771 pto->PushMessage("getdata", vGetData);
2790 //////////////////////////////////////////////////////////////////////////////
2795 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2797 unsigned char* pdata = (unsigned char*)pbuffer;
2798 unsigned int blocks = 1 + ((len + 8) / 64);
2799 unsigned char* pend = pdata + 64 * blocks;
2800 memset(pdata + len, 0, 64 * blocks - len);
2802 unsigned int bits = len * 8;
2803 pend[-1] = (bits >> 0) & 0xff;
2804 pend[-2] = (bits >> 8) & 0xff;
2805 pend[-3] = (bits >> 16) & 0xff;
2806 pend[-4] = (bits >> 24) & 0xff;
2810 using CryptoPP::ByteReverse;
2812 static const unsigned int pSHA256InitState[8] =
2813 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2815 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2817 memcpy(pstate, pinit, 32);
2818 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2822 // ScanHash scans nonces looking for a hash with at least some zero bits.
2823 // It operates on big endian data. Caller does the byte reversing.
2824 // All input buffers are 16-byte aligned. nNonce is usually preserved
2825 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2826 // the block is rebuilt and nNonce starts over at zero.
2828 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2830 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2834 // Hash pdata using pmidstate as the starting state into
2835 // preformatted buffer phash1, then hash phash1 into phash
2837 SHA256Transform(phash1, pdata, pmidstate);
2838 SHA256Transform(phash, phash1, pSHA256InitState);
2840 // Return the nonce if the hash has at least some zero bits,
2841 // caller will check if it has enough to reach the target
2842 if (((unsigned short*)phash)[14] == 0)
2845 // If nothing found after trying for a while, return -1
2846 if ((nNonce & 0xffff) == 0)
2848 nHashesDone = 0xffff+1;
2854 // Some explaining would be appreciated
2859 set<uint256> setDependsOn;
2862 COrphan(CTransaction* ptxIn)
2870 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2871 BOOST_FOREACH(uint256 hash, setDependsOn)
2872 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2877 CBlock* CreateNewBlock(CReserveKey& reservekey)
2879 CBlockIndex* pindexPrev = pindexBest;
2882 auto_ptr<CBlock> pblock(new CBlock());
2886 // Create coinbase tx
2888 txNew.vin.resize(1);
2889 txNew.vin[0].prevout.SetNull();
2890 txNew.vout.resize(1);
2891 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2893 // Add our coinbase tx as first transaction
2894 pblock->vtx.push_back(txNew);
2896 // Collect memory pool transactions into the block
2898 CRITICAL_BLOCK(cs_main)
2899 CRITICAL_BLOCK(cs_mapTransactions)
2903 // Priority order to process transactions
2904 list<COrphan> vOrphan; // list memory doesn't move
2905 map<uint256, vector<COrphan*> > mapDependers;
2906 multimap<double, CTransaction*> mapPriority;
2907 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2909 CTransaction& tx = (*mi).second;
2910 if (tx.IsCoinBase() || !tx.IsFinal())
2913 COrphan* porphan = NULL;
2914 double dPriority = 0;
2915 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2917 // Read prev transaction
2918 CTransaction txPrev;
2920 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2922 // Has to wait for dependencies
2925 // Use list for automatic deletion
2926 vOrphan.push_back(COrphan(&tx));
2927 porphan = &vOrphan.back();
2929 mapDependers[txin.prevout.hash].push_back(porphan);
2930 porphan->setDependsOn.insert(txin.prevout.hash);
2933 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2935 // Read block header
2936 int nConf = txindex.GetDepthInMainChain();
2938 dPriority += (double)nValueIn * nConf;
2940 if (fDebug && GetBoolArg("-printpriority"))
2941 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2944 // Priority is sum(valuein * age) / txsize
2945 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2948 porphan->dPriority = dPriority;
2950 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2952 if (fDebug && GetBoolArg("-printpriority"))
2954 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2961 // Collect transactions into block
2962 map<uint256, CTxIndex> mapTestPool;
2963 uint64 nBlockSize = 1000;
2964 int nBlockSigOps = 100;
2965 while (!mapPriority.empty())
2967 // Take highest priority transaction off priority queue
2968 double dPriority = -(*mapPriority.begin()).first;
2969 CTransaction& tx = *(*mapPriority.begin()).second;
2970 mapPriority.erase(mapPriority.begin());
2973 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2974 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2977 // Legacy limits on sigOps:
2978 int nTxSigOps = tx.GetSigOpCount();
2979 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2982 // Transaction fee required depends on block size
2983 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2984 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2986 // Connecting shouldn't fail due to dependency on other memory pool transactions
2987 // because we're already processing them in order of dependency
2988 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2990 MapPrevTx mapInputs;
2991 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
2994 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
2995 if (nTxFees < nMinFee)
2998 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
2999 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3002 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3004 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3005 swap(mapTestPool, mapTestPoolTmp);
3008 pblock->vtx.push_back(tx);
3009 nBlockSize += nTxSize;
3010 nBlockSigOps += nTxSigOps;
3013 // Add transactions that depend on this one to the priority queue
3014 uint256 hash = tx.GetHash();
3015 if (mapDependers.count(hash))
3017 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3019 if (!porphan->setDependsOn.empty())
3021 porphan->setDependsOn.erase(hash);
3022 if (porphan->setDependsOn.empty())
3023 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3029 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3032 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3033 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3034 pblock->UpdateTime(pindexPrev);
3035 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3038 return pblock.release();
3042 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3044 // Update nExtraNonce
3045 static uint256 hashPrevBlock;
3046 if (hashPrevBlock != pblock->hashPrevBlock)
3049 hashPrevBlock = pblock->hashPrevBlock;
3052 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3053 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3057 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3060 // Prebuild hash buffers
3067 uint256 hashPrevBlock;
3068 uint256 hashMerkleRoot;
3071 unsigned int nNonce;
3074 unsigned char pchPadding0[64];
3076 unsigned char pchPadding1[64];
3079 memset(&tmp, 0, sizeof(tmp));
3081 tmp.block.nVersion = pblock->nVersion;
3082 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3083 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3084 tmp.block.nTime = pblock->nTime;
3085 tmp.block.nBits = pblock->nBits;
3086 tmp.block.nNonce = pblock->nNonce;
3088 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3089 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3091 // Byte swap all the input buffer
3092 for (int i = 0; i < sizeof(tmp)/4; i++)
3093 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3095 // Precalc the first half of the first hash, which stays constant
3096 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3098 memcpy(pdata, &tmp.block, 128);
3099 memcpy(phash1, &tmp.hash1, 64);
3103 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3105 uint256 hash = pblock->GetHash();
3106 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3108 if (hash > hashTarget)
3112 printf("BitcoinMiner:\n");
3113 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3115 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3116 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3119 CRITICAL_BLOCK(cs_main)
3121 if (pblock->hashPrevBlock != hashBestChain)
3122 return error("BitcoinMiner : generated block is stale");
3124 // Remove key from key pool
3125 reservekey.KeepKey();
3127 // Track how many getdata requests this block gets
3128 CRITICAL_BLOCK(wallet.cs_wallet)
3129 wallet.mapRequestCount[pblock->GetHash()] = 0;
3131 // Process this block the same as if we had received it from another node
3132 if (!ProcessBlock(NULL, pblock))
3133 return error("BitcoinMiner : ProcessBlock, block not accepted");
3140 void static ThreadBitcoinMiner(void* parg);
3142 void static BitcoinMiner(CWallet *pwallet)
3144 printf("BitcoinMiner started\n");
3145 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3147 // Each thread has its own key and counter
3148 CReserveKey reservekey(pwallet);
3149 unsigned int nExtraNonce = 0;
3151 while (fGenerateBitcoins)
3153 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3157 while (vNodes.empty() || IsInitialBlockDownload())
3162 if (!fGenerateBitcoins)
3170 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3171 CBlockIndex* pindexPrev = pindexBest;
3173 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3176 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3178 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3182 // Prebuild hash buffers
3184 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3185 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3186 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3188 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3190 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3191 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3192 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3198 int64 nStart = GetTime();
3199 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3201 uint256& hash = *alignup<16>(hashbuf);
3204 unsigned int nHashesDone = 0;
3205 unsigned int nNonceFound;
3208 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3209 (char*)&hash, nHashesDone);
3211 // Check if something found
3212 if (nNonceFound != -1)
3214 for (int i = 0; i < sizeof(hash)/4; i++)
3215 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3217 if (hash <= hashTarget)
3220 pblock->nNonce = ByteReverse(nNonceFound);
3221 assert(hash == pblock->GetHash());
3223 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3224 CheckWork(pblock.get(), *pwalletMain, reservekey);
3225 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3231 static int64 nHashCounter;
3232 if (nHPSTimerStart == 0)
3234 nHPSTimerStart = GetTimeMillis();
3238 nHashCounter += nHashesDone;
3239 if (GetTimeMillis() - nHPSTimerStart > 4000)
3241 static CCriticalSection cs;
3244 if (GetTimeMillis() - nHPSTimerStart > 4000)
3246 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3247 nHPSTimerStart = GetTimeMillis();
3249 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3250 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3251 static int64 nLogTime;
3252 if (GetTime() - nLogTime > 30 * 60)
3254 nLogTime = GetTime();
3255 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3256 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3262 // Check for stop or if block needs to be rebuilt
3265 if (!fGenerateBitcoins)
3267 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3271 if (nBlockNonce >= 0xffff0000)
3273 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3275 if (pindexPrev != pindexBest)
3278 // Update nTime every few seconds
3279 pblock->UpdateTime(pindexPrev);
3280 nBlockTime = ByteReverse(pblock->nTime);
3283 // Changing pblock->nTime can change work required on testnet:
3284 nBlockBits = ByteReverse(pblock->nBits);
3285 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3291 void static ThreadBitcoinMiner(void* parg)
3293 CWallet* pwallet = (CWallet*)parg;
3296 vnThreadsRunning[3]++;
3297 BitcoinMiner(pwallet);
3298 vnThreadsRunning[3]--;
3300 catch (std::exception& e) {
3301 vnThreadsRunning[3]--;
3302 PrintException(&e, "ThreadBitcoinMiner()");
3304 vnThreadsRunning[3]--;
3305 PrintException(NULL, "ThreadBitcoinMiner()");
3307 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3309 if (vnThreadsRunning[3] == 0)
3311 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3315 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3317 if (fGenerateBitcoins != fGenerate)
3319 fGenerateBitcoins = fGenerate;
3320 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3323 if (fGenerateBitcoins)
3325 int nProcessors = boost::thread::hardware_concurrency();
3326 printf("%d processors\n", nProcessors);
3327 if (nProcessors < 1)
3329 if (fLimitProcessors && nProcessors > nLimitProcessors)
3330 nProcessors = nLimitProcessors;
3331 int nAddThreads = nProcessors - vnThreadsRunning[3];
3332 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3333 for (int i = 0; i < nAddThreads; i++)
3335 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3336 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");