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))
1032 // only during transition phase for P2SH: do not invoke (external)
1033 // anti-DoS code for potentially old clients relaying bad P2SH
1035 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1036 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1038 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1041 // Mark outpoints as spent
1042 txindex.vSpent[prevout.n] = posThisTx;
1045 if (fBlock || fMiner)
1047 mapTestPool[prevout.hash] = txindex;
1051 if (nValueIn < GetValueOut())
1052 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
1054 // Tally transaction fees
1055 int64 nTxFee = nValueIn - GetValueOut();
1057 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
1059 if (!MoneyRange(nFees))
1060 return error("ConnectInputs() : nFees out of range");
1067 bool CTransaction::ClientConnectInputs()
1072 // Take over previous transactions' spent pointers
1073 CRITICAL_BLOCK(cs_mapTransactions)
1076 for (int i = 0; i < vin.size(); i++)
1078 // Get prev tx from single transactions in memory
1079 COutPoint prevout = vin[i].prevout;
1080 if (!mapTransactions.count(prevout.hash))
1082 CTransaction& txPrev = mapTransactions[prevout.hash];
1084 if (prevout.n >= txPrev.vout.size())
1088 if (!VerifySignature(txPrev, *this, i, true, 0))
1089 return error("ConnectInputs() : VerifySignature failed");
1091 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1092 ///// this has to go away now that posNext is gone
1093 // // Check for conflicts
1094 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1095 // return error("ConnectInputs() : prev tx already used");
1097 // // Flag outpoints as used
1098 // txPrev.vout[prevout.n].posNext = posThisTx;
1100 nValueIn += txPrev.vout[prevout.n].nValue;
1102 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1103 return error("ClientConnectInputs() : txin values out of range");
1105 if (GetValueOut() > nValueIn)
1115 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1117 // Disconnect in reverse order
1118 for (int i = vtx.size()-1; i >= 0; i--)
1119 if (!vtx[i].DisconnectInputs(txdb))
1122 // Update block index on disk without changing it in memory.
1123 // The memory index structure will be changed after the db commits.
1126 CDiskBlockIndex blockindexPrev(pindex->pprev);
1127 blockindexPrev.hashNext = 0;
1128 if (!txdb.WriteBlockIndex(blockindexPrev))
1129 return error("DisconnectBlock() : WriteBlockIndex failed");
1135 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1137 // Check it again in case a previous version let a bad block in
1141 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1142 // unless those are already completely spent.
1143 // If such overwrites are allowed, coinbases and transactions depending upon those
1144 // can be duplicated to remove the ability to spend the first instance -- even after
1145 // being sent to another address.
1146 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1147 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1148 // already refuses previously-known transaction id's entirely.
1149 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1150 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1151 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1153 BOOST_FOREACH(CTransaction& tx, vtx)
1155 CTxIndex txindexOld;
1156 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1158 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1165 // P2SH didn't become active until Apr 1 2012 (Feb 15 on testnet)
1166 int64 nEvalSwitchTime = fTestNet ? 1329264000 : 1333238400;
1167 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1169 //// issue here: it doesn't know the version
1170 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1172 map<uint256, CTxIndex> mapQueuedChanges;
1175 BOOST_FOREACH(CTransaction& tx, vtx)
1177 nSigOps += tx.GetSigOpCount();
1178 if (nSigOps > MAX_BLOCK_SIGOPS)
1179 return error("ConnectBlock() : too many sigops");
1181 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1182 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1185 MapPrevTx mapInputs;
1186 if (!tx.IsCoinBase())
1188 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1191 if (fStrictPayToScriptHash)
1193 // Add in sigops done by pay-to-script-hash inputs;
1194 // this is to prevent a "rogue miner" from creating
1195 // an incredibly-expensive-to-validate block.
1196 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1197 if (nSigOps > MAX_BLOCK_SIGOPS)
1198 return error("ConnectBlock() : too many sigops");
1201 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1203 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1207 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1210 // Write queued txindex changes
1211 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1213 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1214 return error("ConnectBlock() : UpdateTxIndex failed");
1217 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1220 // Update block index on disk without changing it in memory.
1221 // The memory index structure will be changed after the db commits.
1224 CDiskBlockIndex blockindexPrev(pindex->pprev);
1225 blockindexPrev.hashNext = pindex->GetBlockHash();
1226 if (!txdb.WriteBlockIndex(blockindexPrev))
1227 return error("ConnectBlock() : WriteBlockIndex failed");
1230 // Watch for transactions paying to me
1231 BOOST_FOREACH(CTransaction& tx, vtx)
1232 SyncWithWallets(tx, this, true);
1237 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1239 printf("REORGANIZE\n");
1242 CBlockIndex* pfork = pindexBest;
1243 CBlockIndex* plonger = pindexNew;
1244 while (pfork != plonger)
1246 while (plonger->nHeight > pfork->nHeight)
1247 if (!(plonger = plonger->pprev))
1248 return error("Reorganize() : plonger->pprev is null");
1249 if (pfork == plonger)
1251 if (!(pfork = pfork->pprev))
1252 return error("Reorganize() : pfork->pprev is null");
1255 // List of what to disconnect
1256 vector<CBlockIndex*> vDisconnect;
1257 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1258 vDisconnect.push_back(pindex);
1260 // List of what to connect
1261 vector<CBlockIndex*> vConnect;
1262 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1263 vConnect.push_back(pindex);
1264 reverse(vConnect.begin(), vConnect.end());
1266 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());
1267 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());
1269 // Disconnect shorter branch
1270 vector<CTransaction> vResurrect;
1271 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1274 if (!block.ReadFromDisk(pindex))
1275 return error("Reorganize() : ReadFromDisk for disconnect failed");
1276 if (!block.DisconnectBlock(txdb, pindex))
1277 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1279 // Queue memory transactions to resurrect
1280 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1281 if (!tx.IsCoinBase())
1282 vResurrect.push_back(tx);
1285 // Connect longer branch
1286 vector<CTransaction> vDelete;
1287 for (int i = 0; i < vConnect.size(); i++)
1289 CBlockIndex* pindex = vConnect[i];
1291 if (!block.ReadFromDisk(pindex))
1292 return error("Reorganize() : ReadFromDisk for connect failed");
1293 if (!block.ConnectBlock(txdb, pindex))
1297 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1300 // Queue memory transactions to delete
1301 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1302 vDelete.push_back(tx);
1304 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1305 return error("Reorganize() : WriteHashBestChain failed");
1307 // Make sure it's successfully written to disk before changing memory structure
1308 if (!txdb.TxnCommit())
1309 return error("Reorganize() : TxnCommit failed");
1311 // Disconnect shorter branch
1312 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1314 pindex->pprev->pnext = NULL;
1316 // Connect longer branch
1317 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1319 pindex->pprev->pnext = pindex;
1321 // Resurrect memory transactions that were in the disconnected branch
1322 BOOST_FOREACH(CTransaction& tx, vResurrect)
1323 tx.AcceptToMemoryPool(txdb, false);
1325 // Delete redundant memory transactions that are in the connected branch
1326 BOOST_FOREACH(CTransaction& tx, vDelete)
1327 tx.RemoveFromMemoryPool();
1329 printf("REORGANIZE: done\n");
1335 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1337 uint256 hash = GetHash();
1340 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1342 txdb.WriteHashBestChain(hash);
1343 if (!txdb.TxnCommit())
1344 return error("SetBestChain() : TxnCommit failed");
1345 pindexGenesisBlock = pindexNew;
1347 else if (hashPrevBlock == hashBestChain)
1349 // Adding to current best branch
1350 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1353 InvalidChainFound(pindexNew);
1354 return error("SetBestChain() : ConnectBlock failed");
1356 if (!txdb.TxnCommit())
1357 return error("SetBestChain() : TxnCommit failed");
1359 // Add to current best branch
1360 pindexNew->pprev->pnext = pindexNew;
1362 // Delete redundant memory transactions
1363 BOOST_FOREACH(CTransaction& tx, vtx)
1364 tx.RemoveFromMemoryPool();
1369 if (!Reorganize(txdb, pindexNew))
1372 InvalidChainFound(pindexNew);
1373 return error("SetBestChain() : Reorganize failed");
1377 // Update best block in wallet (so we can detect restored wallets)
1378 if (!IsInitialBlockDownload())
1380 const CBlockLocator locator(pindexNew);
1381 ::SetBestChain(locator);
1385 hashBestChain = hash;
1386 pindexBest = pindexNew;
1387 nBestHeight = pindexBest->nHeight;
1388 bnBestChainWork = pindexNew->bnChainWork;
1389 nTimeBestReceived = GetTime();
1390 nTransactionsUpdated++;
1391 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1397 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1399 // Check for duplicate
1400 uint256 hash = GetHash();
1401 if (mapBlockIndex.count(hash))
1402 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1404 // Construct new block index object
1405 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1407 return error("AddToBlockIndex() : new CBlockIndex failed");
1408 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1409 pindexNew->phashBlock = &((*mi).first);
1410 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1411 if (miPrev != mapBlockIndex.end())
1413 pindexNew->pprev = (*miPrev).second;
1414 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1416 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1420 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1421 if (!txdb.TxnCommit())
1425 if (pindexNew->bnChainWork > bnBestChainWork)
1426 if (!SetBestChain(txdb, pindexNew))
1431 if (pindexNew == pindexBest)
1433 // Notify UI to display prev block's coinbase if it was ours
1434 static uint256 hashPrevBestCoinBase;
1435 UpdatedTransaction(hashPrevBestCoinBase);
1436 hashPrevBestCoinBase = vtx[0].GetHash();
1446 bool CBlock::CheckBlock() const
1448 // These are checks that are independent of context
1449 // that can be verified before saving an orphan block.
1452 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1453 return error("CheckBlock() : size limits failed");
1455 // Check proof of work matches claimed amount
1456 if (!CheckProofOfWork(GetHash(), nBits))
1457 return error("CheckBlock() : proof of work failed");
1460 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1461 return error("CheckBlock() : block timestamp too far in the future");
1463 // First transaction must be coinbase, the rest must not be
1464 if (vtx.empty() || !vtx[0].IsCoinBase())
1465 return error("CheckBlock() : first tx is not coinbase");
1466 for (int i = 1; i < vtx.size(); i++)
1467 if (vtx[i].IsCoinBase())
1468 return error("CheckBlock() : more than one coinbase");
1470 // Check transactions
1471 BOOST_FOREACH(const CTransaction& tx, vtx)
1472 if (!tx.CheckTransaction())
1473 return error("CheckBlock() : CheckTransaction failed");
1475 // Check that it's not full of nonstandard transactions
1476 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1477 return error("CheckBlock() : out-of-bounds SigOpCount");
1480 if (hashMerkleRoot != BuildMerkleTree())
1481 return error("CheckBlock() : hashMerkleRoot mismatch");
1486 bool CBlock::AcceptBlock()
1488 // Check for duplicate
1489 uint256 hash = GetHash();
1490 if (mapBlockIndex.count(hash))
1491 return error("AcceptBlock() : block already in mapBlockIndex");
1493 // Get prev block index
1494 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1495 if (mi == mapBlockIndex.end())
1496 return error("AcceptBlock() : prev block not found");
1497 CBlockIndex* pindexPrev = (*mi).second;
1498 int nHeight = pindexPrev->nHeight+1;
1500 // Check proof of work
1501 if (nBits != GetNextWorkRequired(pindexPrev, this))
1502 return error("AcceptBlock() : incorrect proof of work");
1504 // Check timestamp against prev
1505 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1506 return error("AcceptBlock() : block's timestamp is too early");
1508 // Check that all transactions are finalized
1509 BOOST_FOREACH(const CTransaction& tx, vtx)
1510 if (!tx.IsFinal(nHeight, GetBlockTime()))
1511 return error("AcceptBlock() : contains a non-final transaction");
1513 // Check that the block chain matches the known block chain up to a checkpoint
1514 if (!Checkpoints::CheckBlock(nHeight, hash))
1515 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1517 // Write block to history file
1518 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1519 return error("AcceptBlock() : out of disk space");
1520 unsigned int nFile = -1;
1521 unsigned int nBlockPos = 0;
1522 if (!WriteToDisk(nFile, nBlockPos))
1523 return error("AcceptBlock() : WriteToDisk failed");
1524 if (!AddToBlockIndex(nFile, nBlockPos))
1525 return error("AcceptBlock() : AddToBlockIndex failed");
1527 // Relay inventory, but don't relay old inventory during initial block download
1528 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1529 if (hashBestChain == hash)
1530 CRITICAL_BLOCK(cs_vNodes)
1531 BOOST_FOREACH(CNode* pnode, vNodes)
1532 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1533 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1538 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1540 // Check for duplicate
1541 uint256 hash = pblock->GetHash();
1542 if (mapBlockIndex.count(hash))
1543 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1544 if (mapOrphanBlocks.count(hash))
1545 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1547 // Preliminary checks
1548 if (!pblock->CheckBlock())
1549 return error("ProcessBlock() : CheckBlock FAILED");
1551 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1552 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1554 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1555 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1558 return error("ProcessBlock() : block with timestamp before last checkpoint");
1561 bnNewBlock.SetCompact(pblock->nBits);
1563 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1564 if (bnNewBlock > bnRequired)
1566 return error("ProcessBlock() : block with too little proof-of-work");
1571 // If don't already have its previous block, shunt it off to holding area until we get it
1572 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1574 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1575 CBlock* pblock2 = new CBlock(*pblock);
1576 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1577 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1579 // Ask this guy to fill in what we're missing
1581 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1586 if (!pblock->AcceptBlock())
1587 return error("ProcessBlock() : AcceptBlock FAILED");
1589 // Recursively process any orphan blocks that depended on this one
1590 vector<uint256> vWorkQueue;
1591 vWorkQueue.push_back(hash);
1592 for (int i = 0; i < vWorkQueue.size(); i++)
1594 uint256 hashPrev = vWorkQueue[i];
1595 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1596 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1599 CBlock* pblockOrphan = (*mi).second;
1600 if (pblockOrphan->AcceptBlock())
1601 vWorkQueue.push_back(pblockOrphan->GetHash());
1602 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1603 delete pblockOrphan;
1605 mapOrphanBlocksByPrev.erase(hashPrev);
1608 printf("ProcessBlock: ACCEPTED\n");
1619 bool CheckDiskSpace(uint64 nAdditionalBytes)
1621 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1623 // Check for 15MB because database could create another 10MB log file at any time
1624 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1627 string strMessage = _("Warning: Disk space is low ");
1628 strMiscWarning = strMessage;
1629 printf("*** %s\n", strMessage.c_str());
1630 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1631 CreateThread(Shutdown, NULL);
1637 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1641 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1644 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1646 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1655 static unsigned int nCurrentBlockFile = 1;
1657 FILE* AppendBlockFile(unsigned int& nFileRet)
1662 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1665 if (fseek(file, 0, SEEK_END) != 0)
1667 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1668 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1670 nFileRet = nCurrentBlockFile;
1674 nCurrentBlockFile++;
1678 bool LoadBlockIndex(bool fAllowNew)
1682 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1683 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1684 pchMessageStart[0] = 0xfa;
1685 pchMessageStart[1] = 0xbf;
1686 pchMessageStart[2] = 0xb5;
1687 pchMessageStart[3] = 0xda;
1694 if (!txdb.LoadBlockIndex())
1699 // Init with genesis block
1701 if (mapBlockIndex.empty())
1707 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1708 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1709 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1710 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1711 // vMerkleTree: 4a5e1e
1714 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1716 txNew.vin.resize(1);
1717 txNew.vout.resize(1);
1718 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1719 txNew.vout[0].nValue = 50 * COIN;
1720 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1722 block.vtx.push_back(txNew);
1723 block.hashPrevBlock = 0;
1724 block.hashMerkleRoot = block.BuildMerkleTree();
1726 block.nTime = 1231006505;
1727 block.nBits = 0x1d00ffff;
1728 block.nNonce = 2083236893;
1732 block.nTime = 1296688602;
1733 block.nBits = 0x1d07fff8;
1734 block.nNonce = 384568319;
1738 printf("%s\n", block.GetHash().ToString().c_str());
1739 printf("%s\n", hashGenesisBlock.ToString().c_str());
1740 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1741 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1743 assert(block.GetHash() == hashGenesisBlock);
1745 // Start new block file
1747 unsigned int nBlockPos;
1748 if (!block.WriteToDisk(nFile, nBlockPos))
1749 return error("LoadBlockIndex() : writing genesis block to disk failed");
1750 if (!block.AddToBlockIndex(nFile, nBlockPos))
1751 return error("LoadBlockIndex() : genesis block not accepted");
1759 void PrintBlockTree()
1761 // precompute tree structure
1762 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1763 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1765 CBlockIndex* pindex = (*mi).second;
1766 mapNext[pindex->pprev].push_back(pindex);
1768 //while (rand() % 3 == 0)
1769 // mapNext[pindex->pprev].push_back(pindex);
1772 vector<pair<int, CBlockIndex*> > vStack;
1773 vStack.push_back(make_pair(0, pindexGenesisBlock));
1776 while (!vStack.empty())
1778 int nCol = vStack.back().first;
1779 CBlockIndex* pindex = vStack.back().second;
1782 // print split or gap
1783 if (nCol > nPrevCol)
1785 for (int i = 0; i < nCol-1; i++)
1789 else if (nCol < nPrevCol)
1791 for (int i = 0; i < nCol; i++)
1798 for (int i = 0; i < nCol; i++)
1803 block.ReadFromDisk(pindex);
1804 printf("%d (%u,%u) %s %s tx %d",
1808 block.GetHash().ToString().substr(0,20).c_str(),
1809 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1812 PrintWallets(block);
1814 // put the main timechain first
1815 vector<CBlockIndex*>& vNext = mapNext[pindex];
1816 for (int i = 0; i < vNext.size(); i++)
1818 if (vNext[i]->pnext)
1820 swap(vNext[0], vNext[i]);
1826 for (int i = 0; i < vNext.size(); i++)
1827 vStack.push_back(make_pair(nCol+i, vNext[i]));
1840 //////////////////////////////////////////////////////////////////////////////
1845 map<uint256, CAlert> mapAlerts;
1846 CCriticalSection cs_mapAlerts;
1848 string GetWarnings(string strFor)
1851 string strStatusBar;
1853 if (GetBoolArg("-testsafemode"))
1856 // Misc warnings like out of disk space and clock is wrong
1857 if (strMiscWarning != "")
1860 strStatusBar = strMiscWarning;
1863 // Longer invalid proof-of-work chain
1864 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1867 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1871 CRITICAL_BLOCK(cs_mapAlerts)
1873 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1875 const CAlert& alert = item.second;
1876 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1878 nPriority = alert.nPriority;
1879 strStatusBar = alert.strStatusBar;
1884 if (strFor == "statusbar")
1885 return strStatusBar;
1886 else if (strFor == "rpc")
1888 assert(!"GetWarnings() : invalid parameter");
1892 bool CAlert::ProcessAlert()
1894 if (!CheckSignature())
1899 CRITICAL_BLOCK(cs_mapAlerts)
1901 // Cancel previous alerts
1902 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1904 const CAlert& alert = (*mi).second;
1907 printf("cancelling alert %d\n", alert.nID);
1908 mapAlerts.erase(mi++);
1910 else if (!alert.IsInEffect())
1912 printf("expiring alert %d\n", alert.nID);
1913 mapAlerts.erase(mi++);
1919 // Check if this alert has been cancelled
1920 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1922 const CAlert& alert = item.second;
1923 if (alert.Cancels(*this))
1925 printf("alert already cancelled by %d\n", alert.nID);
1931 mapAlerts.insert(make_pair(GetHash(), *this));
1934 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1946 //////////////////////////////////////////////////////////////////////////////
1952 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1956 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1957 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1959 // Don't know what it is, just say we already got one
1966 // The message start string is designed to be unlikely to occur in normal data.
1967 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1968 // a large 4-byte int at any alignment.
1969 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1972 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1974 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1975 RandAddSeedPerfmon();
1977 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1978 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1980 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1982 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1990 if (strCommand == "version")
1992 // Each connection can only send one version message
1993 if (pfrom->nVersion != 0)
2000 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2001 if (pfrom->nVersion == 10300)
2002 pfrom->nVersion = 300;
2003 if (pfrom->nVersion >= 106 && !vRecv.empty())
2004 vRecv >> addrFrom >> nNonce;
2005 if (pfrom->nVersion >= 106 && !vRecv.empty())
2006 vRecv >> pfrom->strSubVer;
2007 if (pfrom->nVersion >= 209 && !vRecv.empty())
2008 vRecv >> pfrom->nStartingHeight;
2010 if (pfrom->nVersion == 0)
2013 // Disconnect if we connected to ourself
2014 if (nNonce == nLocalHostNonce && nNonce > 1)
2016 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2017 pfrom->fDisconnect = true;
2021 // Be shy and don't send version until we hear
2022 if (pfrom->fInbound)
2023 pfrom->PushVersion();
2025 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2027 AddTimeData(pfrom->addr.ip, nTime);
2030 if (pfrom->nVersion >= 209)
2031 pfrom->PushMessage("verack");
2032 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2033 if (pfrom->nVersion < 209)
2034 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2036 if (!pfrom->fInbound)
2038 // Advertise our address
2039 if (addrLocalHost.IsRoutable() && !fUseProxy)
2041 CAddress addr(addrLocalHost);
2042 addr.nTime = GetAdjustedTime();
2043 pfrom->PushAddress(addr);
2046 // Get recent addresses
2047 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2049 pfrom->PushMessage("getaddr");
2050 pfrom->fGetAddr = true;
2054 // Ask the first connected node for block updates
2055 static int nAskedForBlocks = 0;
2056 if (!pfrom->fClient &&
2057 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2058 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2061 pfrom->PushGetBlocks(pindexBest, uint256(0));
2065 CRITICAL_BLOCK(cs_mapAlerts)
2066 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2067 item.second.RelayTo(pfrom);
2069 pfrom->fSuccessfullyConnected = true;
2071 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2075 else if (pfrom->nVersion == 0)
2077 // Must have a version message before anything else
2082 else if (strCommand == "verack")
2084 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2088 else if (strCommand == "addr")
2090 vector<CAddress> vAddr;
2093 // Don't want addr from older versions unless seeding
2094 if (pfrom->nVersion < 209)
2096 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2098 if (vAddr.size() > 1000)
2099 return error("message addr size() = %d", vAddr.size());
2101 // Store the new addresses
2104 int64 nNow = GetAdjustedTime();
2105 int64 nSince = nNow - 10 * 60;
2106 BOOST_FOREACH(CAddress& addr, vAddr)
2110 // ignore IPv6 for now, since it isn't implemented anyway
2113 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2114 addr.nTime = nNow - 5 * 24 * 60 * 60;
2115 AddAddress(addr, 2 * 60 * 60, &addrDB);
2116 pfrom->AddAddressKnown(addr);
2117 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2119 // Relay to a limited number of other nodes
2120 CRITICAL_BLOCK(cs_vNodes)
2122 // Use deterministic randomness to send to the same nodes for 24 hours
2123 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2124 static uint256 hashSalt;
2126 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2127 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2128 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2129 multimap<uint256, CNode*> mapMix;
2130 BOOST_FOREACH(CNode* pnode, vNodes)
2132 if (pnode->nVersion < 31402)
2134 unsigned int nPointer;
2135 memcpy(&nPointer, &pnode, sizeof(nPointer));
2136 uint256 hashKey = hashRand ^ nPointer;
2137 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2138 mapMix.insert(make_pair(hashKey, pnode));
2140 int nRelayNodes = 2;
2141 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2142 ((*mi).second)->PushAddress(addr);
2146 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2147 if (vAddr.size() < 1000)
2148 pfrom->fGetAddr = false;
2152 else if (strCommand == "inv")
2156 if (vInv.size() > 50000)
2157 return error("message inv size() = %d", vInv.size());
2160 BOOST_FOREACH(const CInv& inv, vInv)
2164 pfrom->AddInventoryKnown(inv);
2166 bool fAlreadyHave = AlreadyHave(txdb, inv);
2168 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2172 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2173 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2175 // Track requests for our stuff
2176 Inventory(inv.hash);
2181 else if (strCommand == "getdata")
2185 if (vInv.size() > 50000)
2186 return error("message getdata size() = %d", vInv.size());
2188 BOOST_FOREACH(const CInv& inv, vInv)
2192 printf("received getdata for: %s\n", inv.ToString().c_str());
2194 if (inv.type == MSG_BLOCK)
2196 // Send block from disk
2197 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2198 if (mi != mapBlockIndex.end())
2201 block.ReadFromDisk((*mi).second);
2202 pfrom->PushMessage("block", block);
2204 // Trigger them to send a getblocks request for the next batch of inventory
2205 if (inv.hash == pfrom->hashContinue)
2207 // Bypass PushInventory, this must send even if redundant,
2208 // and we want it right after the last block so they don't
2209 // wait for other stuff first.
2211 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2212 pfrom->PushMessage("inv", vInv);
2213 pfrom->hashContinue = 0;
2217 else if (inv.IsKnownType())
2219 // Send stream from relay memory
2220 CRITICAL_BLOCK(cs_mapRelay)
2222 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2223 if (mi != mapRelay.end())
2224 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2228 // Track requests for our stuff
2229 Inventory(inv.hash);
2234 else if (strCommand == "getblocks")
2236 CBlockLocator locator;
2238 vRecv >> locator >> hashStop;
2240 // Find the last block the caller has in the main chain
2241 CBlockIndex* pindex = locator.GetBlockIndex();
2243 // Send the rest of the chain
2245 pindex = pindex->pnext;
2246 int nLimit = 500 + locator.GetDistanceBack();
2247 unsigned int nBytes = 0;
2248 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2249 for (; pindex; pindex = pindex->pnext)
2251 if (pindex->GetBlockHash() == hashStop)
2253 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2256 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2258 block.ReadFromDisk(pindex, true);
2259 nBytes += block.GetSerializeSize(SER_NETWORK);
2260 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2262 // When this block is requested, we'll send an inv that'll make them
2263 // getblocks the next batch of inventory.
2264 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2265 pfrom->hashContinue = pindex->GetBlockHash();
2272 else if (strCommand == "getheaders")
2274 CBlockLocator locator;
2276 vRecv >> locator >> hashStop;
2278 CBlockIndex* pindex = NULL;
2279 if (locator.IsNull())
2281 // If locator is null, return the hashStop block
2282 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2283 if (mi == mapBlockIndex.end())
2285 pindex = (*mi).second;
2289 // Find the last block the caller has in the main chain
2290 pindex = locator.GetBlockIndex();
2292 pindex = pindex->pnext;
2295 vector<CBlock> vHeaders;
2296 int nLimit = 2000 + locator.GetDistanceBack();
2297 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2298 for (; pindex; pindex = pindex->pnext)
2300 vHeaders.push_back(pindex->GetBlockHeader());
2301 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2304 pfrom->PushMessage("headers", vHeaders);
2308 else if (strCommand == "tx")
2310 vector<uint256> vWorkQueue;
2311 CDataStream vMsg(vRecv);
2315 CInv inv(MSG_TX, tx.GetHash());
2316 pfrom->AddInventoryKnown(inv);
2318 bool fMissingInputs = false;
2319 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2321 SyncWithWallets(tx, NULL, true);
2322 RelayMessage(inv, vMsg);
2323 mapAlreadyAskedFor.erase(inv);
2324 vWorkQueue.push_back(inv.hash);
2326 // Recursively process any orphan transactions that depended on this one
2327 for (int i = 0; i < vWorkQueue.size(); i++)
2329 uint256 hashPrev = vWorkQueue[i];
2330 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2331 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2334 const CDataStream& vMsg = *((*mi).second);
2336 CDataStream(vMsg) >> tx;
2337 CInv inv(MSG_TX, tx.GetHash());
2339 if (tx.AcceptToMemoryPool(true))
2341 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2342 SyncWithWallets(tx, NULL, true);
2343 RelayMessage(inv, vMsg);
2344 mapAlreadyAskedFor.erase(inv);
2345 vWorkQueue.push_back(inv.hash);
2350 BOOST_FOREACH(uint256 hash, vWorkQueue)
2351 EraseOrphanTx(hash);
2353 else if (fMissingInputs)
2355 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2358 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2359 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2361 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2366 else if (strCommand == "block")
2371 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2374 CInv inv(MSG_BLOCK, block.GetHash());
2375 pfrom->AddInventoryKnown(inv);
2377 if (ProcessBlock(pfrom, &block))
2378 mapAlreadyAskedFor.erase(inv);
2382 else if (strCommand == "getaddr")
2384 // Nodes rebroadcast an addr every 24 hours
2385 pfrom->vAddrToSend.clear();
2386 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2387 CRITICAL_BLOCK(cs_mapAddresses)
2389 unsigned int nCount = 0;
2390 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2392 const CAddress& addr = item.second;
2393 if (addr.nTime > nSince)
2396 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2398 const CAddress& addr = item.second;
2399 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2400 pfrom->PushAddress(addr);
2406 else if (strCommand == "checkorder")
2411 if (!GetBoolArg("-allowreceivebyip"))
2413 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2420 /// we have a chance to check the order here
2422 // Keep giving the same key to the same ip until they use it
2423 if (!mapReuseKey.count(pfrom->addr.ip))
2424 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2426 // Send back approval of order and pubkey to use
2427 CScript scriptPubKey;
2428 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2429 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2433 else if (strCommand == "reply")
2438 CRequestTracker tracker;
2439 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2441 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2442 if (mi != pfrom->mapRequests.end())
2444 tracker = (*mi).second;
2445 pfrom->mapRequests.erase(mi);
2448 if (!tracker.IsNull())
2449 tracker.fn(tracker.param1, vRecv);
2453 else if (strCommand == "ping")
2458 else if (strCommand == "alert")
2463 if (alert.ProcessAlert())
2466 pfrom->setKnown.insert(alert.GetHash());
2467 CRITICAL_BLOCK(cs_vNodes)
2468 BOOST_FOREACH(CNode* pnode, vNodes)
2469 alert.RelayTo(pnode);
2476 // Ignore unknown commands for extensibility
2480 // Update the last seen time for this node's address
2481 if (pfrom->fNetworkNode)
2482 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2483 AddressCurrentlyConnected(pfrom->addr);
2489 bool ProcessMessages(CNode* pfrom)
2491 CDataStream& vRecv = pfrom->vRecv;
2495 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2499 // (4) message start
2508 // Scan for message start
2509 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2510 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2511 if (vRecv.end() - pstart < nHeaderSize)
2513 if (vRecv.size() > nHeaderSize)
2515 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2516 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2520 if (pstart - vRecv.begin() > 0)
2521 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2522 vRecv.erase(vRecv.begin(), pstart);
2525 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2530 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2533 string strCommand = hdr.GetCommand();
2536 unsigned int nMessageSize = hdr.nMessageSize;
2537 if (nMessageSize > MAX_SIZE)
2539 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2542 if (nMessageSize > vRecv.size())
2544 // Rewind and wait for rest of message
2545 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2550 if (vRecv.GetVersion() >= 209)
2552 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2553 unsigned int nChecksum = 0;
2554 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2555 if (nChecksum != hdr.nChecksum)
2557 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2558 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2563 // Copy message to its own buffer
2564 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2565 vRecv.ignore(nMessageSize);
2571 CRITICAL_BLOCK(cs_main)
2572 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2576 catch (std::ios_base::failure& e)
2578 if (strstr(e.what(), "end of data"))
2580 // Allow exceptions from underlength message on vRecv
2581 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());
2583 else if (strstr(e.what(), "size too large"))
2585 // Allow exceptions from overlong size
2586 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2590 PrintExceptionContinue(&e, "ProcessMessage()");
2593 catch (std::exception& e) {
2594 PrintExceptionContinue(&e, "ProcessMessage()");
2596 PrintExceptionContinue(NULL, "ProcessMessage()");
2600 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2608 bool SendMessages(CNode* pto, bool fSendTrickle)
2610 CRITICAL_BLOCK(cs_main)
2612 // Don't send anything until we get their version message
2613 if (pto->nVersion == 0)
2617 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2618 pto->PushMessage("ping");
2620 // Resend wallet transactions that haven't gotten in a block yet
2621 ResendWalletTransactions();
2623 // Address refresh broadcast
2624 static int64 nLastRebroadcast;
2625 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2627 nLastRebroadcast = GetTime();
2628 CRITICAL_BLOCK(cs_vNodes)
2630 BOOST_FOREACH(CNode* pnode, vNodes)
2632 // Periodically clear setAddrKnown to allow refresh broadcasts
2633 pnode->setAddrKnown.clear();
2635 // Rebroadcast our address
2636 if (addrLocalHost.IsRoutable() && !fUseProxy)
2638 CAddress addr(addrLocalHost);
2639 addr.nTime = GetAdjustedTime();
2640 pnode->PushAddress(addr);
2646 // Clear out old addresses periodically so it's not too much work at once
2647 static int64 nLastClear;
2648 if (nLastClear == 0)
2649 nLastClear = GetTime();
2650 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2652 nLastClear = GetTime();
2653 CRITICAL_BLOCK(cs_mapAddresses)
2656 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2657 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2658 mi != mapAddresses.end();)
2660 const CAddress& addr = (*mi).second;
2661 if (addr.nTime < nSince)
2663 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2665 addrdb.EraseAddress(addr);
2666 mapAddresses.erase(mi++);
2680 vector<CAddress> vAddr;
2681 vAddr.reserve(pto->vAddrToSend.size());
2682 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2684 // returns true if wasn't already contained in the set
2685 if (pto->setAddrKnown.insert(addr).second)
2687 vAddr.push_back(addr);
2688 // receiver rejects addr messages larger than 1000
2689 if (vAddr.size() >= 1000)
2691 pto->PushMessage("addr", vAddr);
2696 pto->vAddrToSend.clear();
2698 pto->PushMessage("addr", vAddr);
2703 // Message: inventory
2706 vector<CInv> vInvWait;
2707 CRITICAL_BLOCK(pto->cs_inventory)
2709 vInv.reserve(pto->vInventoryToSend.size());
2710 vInvWait.reserve(pto->vInventoryToSend.size());
2711 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2713 if (pto->setInventoryKnown.count(inv))
2716 // trickle out tx inv to protect privacy
2717 if (inv.type == MSG_TX && !fSendTrickle)
2719 // 1/4 of tx invs blast to all immediately
2720 static uint256 hashSalt;
2722 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2723 uint256 hashRand = inv.hash ^ hashSalt;
2724 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2725 bool fTrickleWait = ((hashRand & 3) != 0);
2727 // always trickle our own transactions
2731 if (GetTransaction(inv.hash, wtx))
2733 fTrickleWait = true;
2738 vInvWait.push_back(inv);
2743 // returns true if wasn't already contained in the set
2744 if (pto->setInventoryKnown.insert(inv).second)
2746 vInv.push_back(inv);
2747 if (vInv.size() >= 1000)
2749 pto->PushMessage("inv", vInv);
2754 pto->vInventoryToSend = vInvWait;
2757 pto->PushMessage("inv", vInv);
2763 vector<CInv> vGetData;
2764 int64 nNow = GetTime() * 1000000;
2766 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2768 const CInv& inv = (*pto->mapAskFor.begin()).second;
2769 if (!AlreadyHave(txdb, inv))
2771 printf("sending getdata: %s\n", inv.ToString().c_str());
2772 vGetData.push_back(inv);
2773 if (vGetData.size() >= 1000)
2775 pto->PushMessage("getdata", vGetData);
2779 mapAlreadyAskedFor[inv] = nNow;
2780 pto->mapAskFor.erase(pto->mapAskFor.begin());
2782 if (!vGetData.empty())
2783 pto->PushMessage("getdata", vGetData);
2802 //////////////////////////////////////////////////////////////////////////////
2807 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2809 unsigned char* pdata = (unsigned char*)pbuffer;
2810 unsigned int blocks = 1 + ((len + 8) / 64);
2811 unsigned char* pend = pdata + 64 * blocks;
2812 memset(pdata + len, 0, 64 * blocks - len);
2814 unsigned int bits = len * 8;
2815 pend[-1] = (bits >> 0) & 0xff;
2816 pend[-2] = (bits >> 8) & 0xff;
2817 pend[-3] = (bits >> 16) & 0xff;
2818 pend[-4] = (bits >> 24) & 0xff;
2822 using CryptoPP::ByteReverse;
2824 static const unsigned int pSHA256InitState[8] =
2825 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2827 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2829 memcpy(pstate, pinit, 32);
2830 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2834 // ScanHash scans nonces looking for a hash with at least some zero bits.
2835 // It operates on big endian data. Caller does the byte reversing.
2836 // All input buffers are 16-byte aligned. nNonce is usually preserved
2837 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2838 // the block is rebuilt and nNonce starts over at zero.
2840 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2842 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2846 // Hash pdata using pmidstate as the starting state into
2847 // preformatted buffer phash1, then hash phash1 into phash
2849 SHA256Transform(phash1, pdata, pmidstate);
2850 SHA256Transform(phash, phash1, pSHA256InitState);
2852 // Return the nonce if the hash has at least some zero bits,
2853 // caller will check if it has enough to reach the target
2854 if (((unsigned short*)phash)[14] == 0)
2857 // If nothing found after trying for a while, return -1
2858 if ((nNonce & 0xffff) == 0)
2860 nHashesDone = 0xffff+1;
2866 // Some explaining would be appreciated
2871 set<uint256> setDependsOn;
2874 COrphan(CTransaction* ptxIn)
2882 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2883 BOOST_FOREACH(uint256 hash, setDependsOn)
2884 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2889 CBlock* CreateNewBlock(CReserveKey& reservekey)
2891 CBlockIndex* pindexPrev = pindexBest;
2894 auto_ptr<CBlock> pblock(new CBlock());
2898 // Create coinbase tx
2900 txNew.vin.resize(1);
2901 txNew.vin[0].prevout.SetNull();
2902 txNew.vout.resize(1);
2903 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2905 // Add our coinbase tx as first transaction
2906 pblock->vtx.push_back(txNew);
2908 // Collect memory pool transactions into the block
2910 CRITICAL_BLOCK(cs_main)
2911 CRITICAL_BLOCK(cs_mapTransactions)
2915 // Priority order to process transactions
2916 list<COrphan> vOrphan; // list memory doesn't move
2917 map<uint256, vector<COrphan*> > mapDependers;
2918 multimap<double, CTransaction*> mapPriority;
2919 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2921 CTransaction& tx = (*mi).second;
2922 if (tx.IsCoinBase() || !tx.IsFinal())
2925 COrphan* porphan = NULL;
2926 double dPriority = 0;
2927 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2929 // Read prev transaction
2930 CTransaction txPrev;
2932 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2934 // Has to wait for dependencies
2937 // Use list for automatic deletion
2938 vOrphan.push_back(COrphan(&tx));
2939 porphan = &vOrphan.back();
2941 mapDependers[txin.prevout.hash].push_back(porphan);
2942 porphan->setDependsOn.insert(txin.prevout.hash);
2945 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2947 // Read block header
2948 int nConf = txindex.GetDepthInMainChain();
2950 dPriority += (double)nValueIn * nConf;
2952 if (fDebug && GetBoolArg("-printpriority"))
2953 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2956 // Priority is sum(valuein * age) / txsize
2957 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2960 porphan->dPriority = dPriority;
2962 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2964 if (fDebug && GetBoolArg("-printpriority"))
2966 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2973 // Collect transactions into block
2974 map<uint256, CTxIndex> mapTestPool;
2975 uint64 nBlockSize = 1000;
2976 int nBlockSigOps = 100;
2977 while (!mapPriority.empty())
2979 // Take highest priority transaction off priority queue
2980 double dPriority = -(*mapPriority.begin()).first;
2981 CTransaction& tx = *(*mapPriority.begin()).second;
2982 mapPriority.erase(mapPriority.begin());
2985 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2986 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2989 // Legacy limits on sigOps:
2990 int nTxSigOps = tx.GetSigOpCount();
2991 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2994 // Transaction fee required depends on block size
2995 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2996 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2998 // Connecting shouldn't fail due to dependency on other memory pool transactions
2999 // because we're already processing them in order of dependency
3000 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3002 MapPrevTx mapInputs;
3003 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3006 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3007 if (nTxFees < nMinFee)
3010 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3011 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3014 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3016 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3017 swap(mapTestPool, mapTestPoolTmp);
3020 pblock->vtx.push_back(tx);
3021 nBlockSize += nTxSize;
3022 nBlockSigOps += nTxSigOps;
3025 // Add transactions that depend on this one to the priority queue
3026 uint256 hash = tx.GetHash();
3027 if (mapDependers.count(hash))
3029 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3031 if (!porphan->setDependsOn.empty())
3033 porphan->setDependsOn.erase(hash);
3034 if (porphan->setDependsOn.empty())
3035 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3041 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3044 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3045 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3046 pblock->UpdateTime(pindexPrev);
3047 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3050 return pblock.release();
3054 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3056 // Update nExtraNonce
3057 static uint256 hashPrevBlock;
3058 if (hashPrevBlock != pblock->hashPrevBlock)
3061 hashPrevBlock = pblock->hashPrevBlock;
3064 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3065 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3069 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3072 // Prebuild hash buffers
3079 uint256 hashPrevBlock;
3080 uint256 hashMerkleRoot;
3083 unsigned int nNonce;
3086 unsigned char pchPadding0[64];
3088 unsigned char pchPadding1[64];
3091 memset(&tmp, 0, sizeof(tmp));
3093 tmp.block.nVersion = pblock->nVersion;
3094 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3095 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3096 tmp.block.nTime = pblock->nTime;
3097 tmp.block.nBits = pblock->nBits;
3098 tmp.block.nNonce = pblock->nNonce;
3100 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3101 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3103 // Byte swap all the input buffer
3104 for (int i = 0; i < sizeof(tmp)/4; i++)
3105 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3107 // Precalc the first half of the first hash, which stays constant
3108 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3110 memcpy(pdata, &tmp.block, 128);
3111 memcpy(phash1, &tmp.hash1, 64);
3115 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3117 uint256 hash = pblock->GetHash();
3118 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3120 if (hash > hashTarget)
3124 printf("BitcoinMiner:\n");
3125 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3127 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3128 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3131 CRITICAL_BLOCK(cs_main)
3133 if (pblock->hashPrevBlock != hashBestChain)
3134 return error("BitcoinMiner : generated block is stale");
3136 // Remove key from key pool
3137 reservekey.KeepKey();
3139 // Track how many getdata requests this block gets
3140 CRITICAL_BLOCK(wallet.cs_wallet)
3141 wallet.mapRequestCount[pblock->GetHash()] = 0;
3143 // Process this block the same as if we had received it from another node
3144 if (!ProcessBlock(NULL, pblock))
3145 return error("BitcoinMiner : ProcessBlock, block not accepted");
3152 void static ThreadBitcoinMiner(void* parg);
3154 void static BitcoinMiner(CWallet *pwallet)
3156 printf("BitcoinMiner started\n");
3157 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3159 // Each thread has its own key and counter
3160 CReserveKey reservekey(pwallet);
3161 unsigned int nExtraNonce = 0;
3163 while (fGenerateBitcoins)
3165 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3169 while (vNodes.empty() || IsInitialBlockDownload())
3174 if (!fGenerateBitcoins)
3182 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3183 CBlockIndex* pindexPrev = pindexBest;
3185 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3188 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3190 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3194 // Prebuild hash buffers
3196 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3197 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3198 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3200 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3202 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3203 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3204 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3210 int64 nStart = GetTime();
3211 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3213 uint256& hash = *alignup<16>(hashbuf);
3216 unsigned int nHashesDone = 0;
3217 unsigned int nNonceFound;
3220 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3221 (char*)&hash, nHashesDone);
3223 // Check if something found
3224 if (nNonceFound != -1)
3226 for (int i = 0; i < sizeof(hash)/4; i++)
3227 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3229 if (hash <= hashTarget)
3232 pblock->nNonce = ByteReverse(nNonceFound);
3233 assert(hash == pblock->GetHash());
3235 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3236 CheckWork(pblock.get(), *pwalletMain, reservekey);
3237 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3243 static int64 nHashCounter;
3244 if (nHPSTimerStart == 0)
3246 nHPSTimerStart = GetTimeMillis();
3250 nHashCounter += nHashesDone;
3251 if (GetTimeMillis() - nHPSTimerStart > 4000)
3253 static CCriticalSection cs;
3256 if (GetTimeMillis() - nHPSTimerStart > 4000)
3258 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3259 nHPSTimerStart = GetTimeMillis();
3261 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3262 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3263 static int64 nLogTime;
3264 if (GetTime() - nLogTime > 30 * 60)
3266 nLogTime = GetTime();
3267 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3268 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3274 // Check for stop or if block needs to be rebuilt
3277 if (!fGenerateBitcoins)
3279 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3283 if (nBlockNonce >= 0xffff0000)
3285 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3287 if (pindexPrev != pindexBest)
3290 // Update nTime every few seconds
3291 pblock->UpdateTime(pindexPrev);
3292 nBlockTime = ByteReverse(pblock->nTime);
3295 // Changing pblock->nTime can change work required on testnet:
3296 nBlockBits = ByteReverse(pblock->nBits);
3297 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3303 void static ThreadBitcoinMiner(void* parg)
3305 CWallet* pwallet = (CWallet*)parg;
3308 vnThreadsRunning[3]++;
3309 BitcoinMiner(pwallet);
3310 vnThreadsRunning[3]--;
3312 catch (std::exception& e) {
3313 vnThreadsRunning[3]--;
3314 PrintException(&e, "ThreadBitcoinMiner()");
3316 vnThreadsRunning[3]--;
3317 PrintException(NULL, "ThreadBitcoinMiner()");
3319 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3321 if (vnThreadsRunning[3] == 0)
3323 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3327 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3329 if (fGenerateBitcoins != fGenerate)
3331 fGenerateBitcoins = fGenerate;
3332 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3335 if (fGenerateBitcoins)
3337 int nProcessors = boost::thread::hardware_concurrency();
3338 printf("%d processors\n", nProcessors);
3339 if (nProcessors < 1)
3341 if (fLimitProcessors && nProcessors > nLimitProcessors)
3342 nProcessors = nLimitProcessors;
3343 int nAddThreads = nProcessors - vnThreadsRunning[3];
3344 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3345 for (int i = 0; i < nAddThreads; i++)
3347 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3348 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");