1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 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.
9 #include "cryptopp/sha.h"
10 #include <boost/filesystem.hpp>
11 #include <boost/filesystem/fstream.hpp>
14 using namespace boost;
20 CCriticalSection cs_setpwalletRegistered;
21 set<CWallet*> setpwalletRegistered;
23 CCriticalSection cs_main;
25 static map<uint256, CTransaction> mapTransactions;
26 CCriticalSection cs_mapTransactions;
27 unsigned int nTransactionsUpdated = 0;
28 map<COutPoint, CInPoint> mapNextTx;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 const int nTotalBlocksEstimate = 140700; // Conservative estimate of total nr of blocks on main chain
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 static AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
169 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
170 BOOST_FOREACH(const CTxIn& txin, tx.vin)
171 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
174 void static EraseOrphanTx(uint256 hash)
176 if (!mapOrphanTransactions.count(hash))
178 const CDataStream* pvMsg = mapOrphanTransactions[hash];
180 CDataStream(*pvMsg) >> tx;
181 BOOST_FOREACH(const CTxIn& txin, tx.vin)
183 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
184 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
186 if ((*mi).second == pvMsg)
187 mapOrphanTransactionsByPrev.erase(mi++);
193 mapOrphanTransactions.erase(hash);
203 //////////////////////////////////////////////////////////////////////////////
205 // CTransaction and CTxIndex
208 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
211 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
213 if (!ReadFromDisk(txindexRet.pos))
215 if (prevout.n >= vout.size())
223 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
226 return ReadFromDisk(txdb, prevout, txindex);
229 bool CTransaction::ReadFromDisk(COutPoint prevout)
233 return ReadFromDisk(txdb, prevout, txindex);
238 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
250 // Load the block this tx is in
252 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
254 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
259 // Update the tx's hashBlock
260 hashBlock = pblock->GetHash();
262 // Locate the transaction
263 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
264 if (pblock->vtx[nIndex] == *(CTransaction*)this)
266 if (nIndex == pblock->vtx.size())
268 vMerkleBranch.clear();
270 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
274 // Fill in merkle branch
275 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
278 // Is the tx in a block that's in the main chain
279 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
280 if (mi == mapBlockIndex.end())
282 CBlockIndex* pindex = (*mi).second;
283 if (!pindex || !pindex->IsInMainChain())
286 return pindexBest->nHeight - pindex->nHeight + 1;
295 bool CTransaction::CheckTransaction() const
297 // Basic checks that don't depend on any context
299 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
301 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
303 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
304 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
306 // Check for negative or overflow output values
308 BOOST_FOREACH(const CTxOut& txout, vout)
310 if (txout.nValue < 0)
311 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
312 if (txout.nValue > MAX_MONEY)
313 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
314 nValueOut += txout.nValue;
315 if (!MoneyRange(nValueOut))
316 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
319 // Check for duplicate inputs
320 set<COutPoint> vInOutPoints;
321 BOOST_FOREACH(const CTxIn& txin, vin)
323 if (vInOutPoints.count(txin.prevout))
325 vInOutPoints.insert(txin.prevout);
330 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
331 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
335 BOOST_FOREACH(const CTxIn& txin, vin)
336 if (txin.prevout.IsNull())
337 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
343 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
346 *pfMissingInputs = false;
348 if (!CheckTransaction())
349 return error("AcceptToMemoryPool() : CheckTransaction failed");
351 // Coinbase is only valid in a block, not as a loose transaction
353 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
355 // To help v0.1.5 clients who would see it as a negative number
356 if ((int64)nLockTime > INT_MAX)
357 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
360 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
361 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
362 // attacks disallow transactions with more than one SigOp per 34 bytes.
363 // 34 bytes because a TxOut is:
364 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
365 if (GetSigOpCount() > nSize / 34 || nSize < 100)
366 return DoS(10, error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount"));
368 // Rather not work on nonstandard transactions (unless -testnet)
369 if (!fTestNet && !IsStandard())
370 return error("AcceptToMemoryPool() : nonstandard transaction type");
372 // Do we already have it?
373 uint256 hash = GetHash();
374 CRITICAL_BLOCK(cs_mapTransactions)
375 if (mapTransactions.count(hash))
378 if (txdb.ContainsTx(hash))
381 // Check for conflicts with in-memory transactions
382 CTransaction* ptxOld = NULL;
383 for (int i = 0; i < vin.size(); i++)
385 COutPoint outpoint = vin[i].prevout;
386 if (mapNextTx.count(outpoint))
388 // Disable replacement feature for now
391 // Allow replacing with a newer version of the same transaction
394 ptxOld = mapNextTx[outpoint].ptx;
395 if (ptxOld->IsFinal())
397 if (!IsNewerThan(*ptxOld))
399 for (int i = 0; i < vin.size(); i++)
401 COutPoint outpoint = vin[i].prevout;
402 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
411 // Check against previous transactions
412 map<uint256, CTxIndex> mapUnused;
414 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
417 *pfMissingInputs = true;
418 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
421 // Don't accept it if it can't get into a block
422 if (nFees < GetMinFee(1000, true, true))
423 return error("AcceptToMemoryPool() : not enough fees");
425 // Continuously rate-limit free transactions
426 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
427 // be annoying or make other's transactions take longer to confirm.
428 if (nFees < MIN_RELAY_TX_FEE)
430 static CCriticalSection cs;
431 static double dFreeCount;
432 static int64 nLastTime;
433 int64 nNow = GetTime();
437 // Use an exponentially decaying ~10-minute window:
438 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
440 // -limitfreerelay unit is thousand-bytes-per-minute
441 // At default rate it would take over a month to fill 1GB
442 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
443 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
445 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
451 // Store transaction in memory
452 CRITICAL_BLOCK(cs_mapTransactions)
456 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
457 ptxOld->RemoveFromMemoryPool();
459 AddToMemoryPoolUnchecked();
462 ///// are we sure this is ok when loading transactions or restoring block txes
463 // If updated, erase old tx from wallet
465 EraseFromWallets(ptxOld->GetHash());
467 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
471 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
474 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
477 bool CTransaction::AddToMemoryPoolUnchecked()
479 // Add to memory pool without checking anything. Don't call this directly,
480 // call AcceptToMemoryPool to properly check the transaction first.
481 CRITICAL_BLOCK(cs_mapTransactions)
483 uint256 hash = GetHash();
484 mapTransactions[hash] = *this;
485 for (int i = 0; i < vin.size(); i++)
486 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
487 nTransactionsUpdated++;
493 bool CTransaction::RemoveFromMemoryPool()
495 // Remove transaction from memory pool
496 CRITICAL_BLOCK(cs_mapTransactions)
498 BOOST_FOREACH(const CTxIn& txin, vin)
499 mapNextTx.erase(txin.prevout);
500 mapTransactions.erase(GetHash());
501 nTransactionsUpdated++;
511 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
513 if (hashBlock == 0 || nIndex == -1)
516 // Find the block it claims to be in
517 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
518 if (mi == mapBlockIndex.end())
520 CBlockIndex* pindex = (*mi).second;
521 if (!pindex || !pindex->IsInMainChain())
524 // Make sure the merkle branch connects to this block
525 if (!fMerkleVerified)
527 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
529 fMerkleVerified = true;
532 nHeightRet = pindex->nHeight;
533 return pindexBest->nHeight - pindex->nHeight + 1;
537 int CMerkleTx::GetBlocksToMaturity() const
541 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
545 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
549 if (!IsInMainChain() && !ClientConnectInputs())
551 return CTransaction::AcceptToMemoryPool(txdb, false);
555 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
559 bool CMerkleTx::AcceptToMemoryPool()
562 return AcceptToMemoryPool(txdb);
567 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
569 CRITICAL_BLOCK(cs_mapTransactions)
571 // Add previous supporting transactions first
572 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
574 if (!tx.IsCoinBase())
576 uint256 hash = tx.GetHash();
577 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
578 tx.AcceptToMemoryPool(txdb, fCheckInputs);
581 return AcceptToMemoryPool(txdb, fCheckInputs);
586 bool CWalletTx::AcceptWalletTransaction()
589 return AcceptWalletTransaction(txdb);
592 int CTxIndex::GetDepthInMainChain() const
596 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
598 // Find the block in the index
599 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
600 if (mi == mapBlockIndex.end())
602 CBlockIndex* pindex = (*mi).second;
603 if (!pindex || !pindex->IsInMainChain())
605 return 1 + nBestHeight - pindex->nHeight;
617 //////////////////////////////////////////////////////////////////////////////
619 // CBlock and CBlockIndex
622 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
624 if (!fReadTransactions)
626 *this = pindex->GetBlockHeader();
629 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
631 if (GetHash() != pindex->GetBlockHash())
632 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
636 uint256 static GetOrphanRoot(const CBlock* pblock)
638 // Work back to the first block in the orphan chain
639 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
640 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
641 return pblock->GetHash();
644 int64 static GetBlockValue(int nHeight, int64 nFees)
646 int64 nSubsidy = 50 * COIN;
648 // Subsidy is cut in half every 4 years
649 nSubsidy >>= (nHeight / 210000);
651 return nSubsidy + nFees;
654 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
656 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
657 const int64 nTargetSpacing = 10 * 60;
658 const int64 nInterval = nTargetTimespan / nTargetSpacing;
661 if (pindexLast == NULL)
662 return bnProofOfWorkLimit.GetCompact();
664 // Only change once per interval
665 if ((pindexLast->nHeight+1) % nInterval != 0)
666 return pindexLast->nBits;
668 // Go back by what we want to be 14 days worth of blocks
669 const CBlockIndex* pindexFirst = pindexLast;
670 for (int i = 0; pindexFirst && i < nInterval-1; i++)
671 pindexFirst = pindexFirst->pprev;
674 // Limit adjustment step
675 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
676 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
677 if (nActualTimespan < nTargetTimespan/4)
678 nActualTimespan = nTargetTimespan/4;
679 if (nActualTimespan > nTargetTimespan*4)
680 nActualTimespan = nTargetTimespan*4;
684 bnNew.SetCompact(pindexLast->nBits);
685 bnNew *= nActualTimespan;
686 bnNew /= nTargetTimespan;
688 if (bnNew > bnProofOfWorkLimit)
689 bnNew = bnProofOfWorkLimit;
692 printf("GetNextWorkRequired RETARGET\n");
693 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
694 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
695 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
697 return bnNew.GetCompact();
700 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
703 bnTarget.SetCompact(nBits);
706 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
707 return error("CheckProofOfWork() : nBits below minimum work");
709 // Check proof of work matches claimed amount
710 if (hash > bnTarget.getuint256())
711 return error("CheckProofOfWork() : hash doesn't match nBits");
716 // Return conservative estimate of total number of blocks, 0 if unknown
717 int GetTotalBlocksEstimate()
725 return nTotalBlocksEstimate;
729 bool IsInitialBlockDownload()
731 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
733 static int64 nLastUpdate;
734 static CBlockIndex* pindexLastBest;
735 if (pindexBest != pindexLastBest)
737 pindexLastBest = pindexBest;
738 nLastUpdate = GetTime();
740 return (GetTime() - nLastUpdate < 10 &&
741 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
744 void static InvalidChainFound(CBlockIndex* pindexNew)
746 if (pindexNew->bnChainWork > bnBestInvalidWork)
748 bnBestInvalidWork = pindexNew->bnChainWork;
749 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
752 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());
753 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
754 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
755 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
768 bool CTransaction::DisconnectInputs(CTxDB& txdb)
770 // Relinquish previous transactions' spent pointers
773 BOOST_FOREACH(const CTxIn& txin, vin)
775 COutPoint prevout = txin.prevout;
777 // Get prev txindex from disk
779 if (!txdb.ReadTxIndex(prevout.hash, txindex))
780 return error("DisconnectInputs() : ReadTxIndex failed");
782 if (prevout.n >= txindex.vSpent.size())
783 return error("DisconnectInputs() : prevout.n out of range");
785 // Mark outpoint as not spent
786 txindex.vSpent[prevout.n].SetNull();
789 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
790 return error("DisconnectInputs() : UpdateTxIndex failed");
794 // Remove transaction from index
795 if (!txdb.EraseTxIndex(*this))
796 return error("DisconnectInputs() : EraseTxPos failed");
802 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
803 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
805 // Take over previous transactions' spent pointers
809 for (int i = 0; i < vin.size(); i++)
811 COutPoint prevout = vin[i].prevout;
816 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
818 // Get txindex from current proposed changes
819 txindex = mapTestPool[prevout.hash];
823 // Read txindex from txdb
824 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
826 if (!fFound && (fBlock || fMiner))
827 return fMiner ? false : error("ConnectInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
831 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
833 // Get prev tx from single transactions in memory
834 CRITICAL_BLOCK(cs_mapTransactions)
836 if (!mapTransactions.count(prevout.hash))
837 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
838 txPrev = mapTransactions[prevout.hash];
841 txindex.vSpent.resize(txPrev.vout.size());
845 // Get prev tx from disk
846 if (!txPrev.ReadFromDisk(txindex.pos))
847 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
850 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
851 return DoS(100, 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()));
853 // If prev is coinbase, check that it's matured
854 if (txPrev.IsCoinBase())
855 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
856 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
857 return DoS(10, error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight));
860 if (!VerifySignature(txPrev, *this, i))
861 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
863 // Check for conflicts (double-spend)
864 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
865 // for an attacker to attempt to split the network.
866 if (!txindex.vSpent[prevout.n].IsNull())
867 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());
869 // Check for negative or overflow input values
870 nValueIn += txPrev.vout[prevout.n].nValue;
871 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
872 return DoS(100, error("ConnectInputs() : txin values out of range"));
874 // Mark outpoints as spent
875 txindex.vSpent[prevout.n] = posThisTx;
878 if (fBlock || fMiner)
880 mapTestPool[prevout.hash] = txindex;
884 if (nValueIn < GetValueOut())
885 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
887 // Tally transaction fees
888 int64 nTxFee = nValueIn - GetValueOut();
890 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
891 if (nTxFee < nMinFee)
894 if (!MoneyRange(nFees))
895 return DoS(100, error("ConnectInputs() : nFees out of range"));
900 // Add transaction to changes
901 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
905 // Add transaction to test pool
906 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
913 bool CTransaction::ClientConnectInputs()
918 // Take over previous transactions' spent pointers
919 CRITICAL_BLOCK(cs_mapTransactions)
922 for (int i = 0; i < vin.size(); i++)
924 // Get prev tx from single transactions in memory
925 COutPoint prevout = vin[i].prevout;
926 if (!mapTransactions.count(prevout.hash))
928 CTransaction& txPrev = mapTransactions[prevout.hash];
930 if (prevout.n >= txPrev.vout.size())
934 if (!VerifySignature(txPrev, *this, i))
935 return error("ConnectInputs() : VerifySignature failed");
937 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
938 ///// this has to go away now that posNext is gone
939 // // Check for conflicts
940 // if (!txPrev.vout[prevout.n].posNext.IsNull())
941 // return error("ConnectInputs() : prev tx already used");
943 // // Flag outpoints as used
944 // txPrev.vout[prevout.n].posNext = posThisTx;
946 nValueIn += txPrev.vout[prevout.n].nValue;
948 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
949 return error("ClientConnectInputs() : txin values out of range");
951 if (GetValueOut() > nValueIn)
961 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
963 // Disconnect in reverse order
964 for (int i = vtx.size()-1; i >= 0; i--)
965 if (!vtx[i].DisconnectInputs(txdb))
968 // Update block index on disk without changing it in memory.
969 // The memory index structure will be changed after the db commits.
972 CDiskBlockIndex blockindexPrev(pindex->pprev);
973 blockindexPrev.hashNext = 0;
974 if (!txdb.WriteBlockIndex(blockindexPrev))
975 return error("DisconnectBlock() : WriteBlockIndex failed");
981 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
983 // Check it again in case a previous version let a bad block in
987 //// issue here: it doesn't know the version
988 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
990 map<uint256, CTxIndex> mapQueuedChanges;
992 BOOST_FOREACH(CTransaction& tx, vtx)
994 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
995 nTxPos += ::GetSerializeSize(tx, SER_DISK);
997 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1000 // Write queued txindex changes
1001 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1003 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1004 return error("ConnectBlock() : UpdateTxIndex failed");
1007 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1010 // Update block index on disk without changing it in memory.
1011 // The memory index structure will be changed after the db commits.
1014 CDiskBlockIndex blockindexPrev(pindex->pprev);
1015 blockindexPrev.hashNext = pindex->GetBlockHash();
1016 if (!txdb.WriteBlockIndex(blockindexPrev))
1017 return error("ConnectBlock() : WriteBlockIndex failed");
1020 // Watch for transactions paying to me
1021 BOOST_FOREACH(CTransaction& tx, vtx)
1022 SyncWithWallets(tx, this, true);
1027 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1029 printf("REORGANIZE\n");
1032 CBlockIndex* pfork = pindexBest;
1033 CBlockIndex* plonger = pindexNew;
1034 while (pfork != plonger)
1036 while (plonger->nHeight > pfork->nHeight)
1037 if (!(plonger = plonger->pprev))
1038 return error("Reorganize() : plonger->pprev is null");
1039 if (pfork == plonger)
1041 if (!(pfork = pfork->pprev))
1042 return error("Reorganize() : pfork->pprev is null");
1045 // List of what to disconnect
1046 vector<CBlockIndex*> vDisconnect;
1047 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1048 vDisconnect.push_back(pindex);
1050 // List of what to connect
1051 vector<CBlockIndex*> vConnect;
1052 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1053 vConnect.push_back(pindex);
1054 reverse(vConnect.begin(), vConnect.end());
1056 // Disconnect shorter branch
1057 vector<CTransaction> vResurrect;
1058 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1061 if (!block.ReadFromDisk(pindex))
1062 return error("Reorganize() : ReadFromDisk for disconnect failed");
1063 if (!block.DisconnectBlock(txdb, pindex))
1064 return error("Reorganize() : DisconnectBlock failed");
1066 // Queue memory transactions to resurrect
1067 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1068 if (!tx.IsCoinBase())
1069 vResurrect.push_back(tx);
1072 // Connect longer branch
1073 vector<CTransaction> vDelete;
1074 for (int i = 0; i < vConnect.size(); i++)
1076 CBlockIndex* pindex = vConnect[i];
1078 if (!block.ReadFromDisk(pindex))
1079 return error("Reorganize() : ReadFromDisk for connect failed");
1080 if (!block.ConnectBlock(txdb, pindex))
1084 return error("Reorganize() : ConnectBlock failed");
1087 // Queue memory transactions to delete
1088 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1089 vDelete.push_back(tx);
1091 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1092 return error("Reorganize() : WriteHashBestChain failed");
1094 // Make sure it's successfully written to disk before changing memory structure
1095 if (!txdb.TxnCommit())
1096 return error("Reorganize() : TxnCommit failed");
1098 // Disconnect shorter branch
1099 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1101 pindex->pprev->pnext = NULL;
1103 // Connect longer branch
1104 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1106 pindex->pprev->pnext = pindex;
1108 // Resurrect memory transactions that were in the disconnected branch
1109 BOOST_FOREACH(CTransaction& tx, vResurrect)
1110 tx.AcceptToMemoryPool(txdb, false);
1112 // Delete redundant memory transactions that are in the connected branch
1113 BOOST_FOREACH(CTransaction& tx, vDelete)
1114 tx.RemoveFromMemoryPool();
1120 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1122 uint256 hash = GetHash();
1125 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1127 txdb.WriteHashBestChain(hash);
1128 if (!txdb.TxnCommit())
1129 return error("SetBestChain() : TxnCommit failed");
1130 pindexGenesisBlock = pindexNew;
1132 else if (hashPrevBlock == hashBestChain)
1134 // Adding to current best branch
1135 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1138 InvalidChainFound(pindexNew);
1139 return error("SetBestChain() : ConnectBlock failed");
1141 if (!txdb.TxnCommit())
1142 return error("SetBestChain() : TxnCommit failed");
1144 // Add to current best branch
1145 pindexNew->pprev->pnext = pindexNew;
1147 // Delete redundant memory transactions
1148 BOOST_FOREACH(CTransaction& tx, vtx)
1149 tx.RemoveFromMemoryPool();
1154 if (!Reorganize(txdb, pindexNew))
1157 InvalidChainFound(pindexNew);
1158 return error("SetBestChain() : Reorganize failed");
1162 // Update best block in wallet (so we can detect restored wallets)
1163 if (!IsInitialBlockDownload())
1165 const CBlockLocator locator(pindexNew);
1166 ::SetBestChain(locator);
1170 hashBestChain = hash;
1171 pindexBest = pindexNew;
1172 nBestHeight = pindexBest->nHeight;
1173 bnBestChainWork = pindexNew->bnChainWork;
1174 nTimeBestReceived = GetTime();
1175 nTransactionsUpdated++;
1176 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1182 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1184 // Check for duplicate
1185 uint256 hash = GetHash();
1186 if (mapBlockIndex.count(hash))
1187 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1189 // Construct new block index object
1190 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1192 return error("AddToBlockIndex() : new CBlockIndex failed");
1193 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1194 pindexNew->phashBlock = &((*mi).first);
1195 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1196 if (miPrev != mapBlockIndex.end())
1198 pindexNew->pprev = (*miPrev).second;
1199 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1201 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1205 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1206 if (!txdb.TxnCommit())
1210 if (pindexNew->bnChainWork > bnBestChainWork)
1211 if (!SetBestChain(txdb, pindexNew))
1216 if (pindexNew == pindexBest)
1218 // Notify UI to display prev block's coinbase if it was ours
1219 static uint256 hashPrevBestCoinBase;
1220 UpdatedTransaction(hashPrevBestCoinBase);
1221 hashPrevBestCoinBase = vtx[0].GetHash();
1231 bool CBlock::CheckBlock() const
1233 // These are checks that are independent of context
1234 // that can be verified before saving an orphan block.
1237 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1238 return DoS(100, error("CheckBlock() : size limits failed"));
1240 // Check proof of work matches claimed amount
1241 if (!CheckProofOfWork(GetHash(), nBits))
1242 return DoS(50, error("CheckBlock() : proof of work failed"));
1245 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1246 return error("CheckBlock() : block timestamp too far in the future");
1248 // First transaction must be coinbase, the rest must not be
1249 if (vtx.empty() || !vtx[0].IsCoinBase())
1250 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1251 for (int i = 1; i < vtx.size(); i++)
1252 if (vtx[i].IsCoinBase())
1253 return DoS(100, error("CheckBlock() : more than one coinbase"));
1255 // Check transactions
1256 BOOST_FOREACH(const CTransaction& tx, vtx)
1257 if (!tx.CheckTransaction())
1258 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1260 // Check that it's not full of nonstandard transactions
1261 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1262 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1265 if (hashMerkleRoot != BuildMerkleTree())
1266 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1271 bool CBlock::AcceptBlock()
1273 // Check for duplicate
1274 uint256 hash = GetHash();
1275 if (mapBlockIndex.count(hash))
1276 return error("AcceptBlock() : block already in mapBlockIndex");
1278 // Get prev block index
1279 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1280 if (mi == mapBlockIndex.end())
1281 return DoS(10, error("AcceptBlock() : prev block not found"));
1282 CBlockIndex* pindexPrev = (*mi).second;
1283 int nHeight = pindexPrev->nHeight+1;
1285 // Check proof of work
1286 if (nBits != GetNextWorkRequired(pindexPrev))
1287 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1289 // Check timestamp against prev
1290 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1291 return error("AcceptBlock() : block's timestamp is too early");
1293 // Check that all transactions are finalized
1294 BOOST_FOREACH(const CTransaction& tx, vtx)
1295 if (!tx.IsFinal(nHeight, GetBlockTime()))
1296 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1298 // Check that the block chain matches the known block chain up to a checkpoint
1300 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1301 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1302 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1303 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1304 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1305 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1306 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1307 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")) ||
1308 (nHeight == 140700 && hash != uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd")))
1309 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1311 // Write block to history file
1312 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1313 return error("AcceptBlock() : out of disk space");
1314 unsigned int nFile = -1;
1315 unsigned int nBlockPos = 0;
1316 if (!WriteToDisk(nFile, nBlockPos))
1317 return error("AcceptBlock() : WriteToDisk failed");
1318 if (!AddToBlockIndex(nFile, nBlockPos))
1319 return error("AcceptBlock() : AddToBlockIndex failed");
1321 // Relay inventory, but don't relay old inventory during initial block download
1322 if (hashBestChain == hash)
1323 CRITICAL_BLOCK(cs_vNodes)
1324 BOOST_FOREACH(CNode* pnode, vNodes)
1325 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1326 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1331 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1333 // Check for duplicate
1334 uint256 hash = pblock->GetHash();
1335 if (mapBlockIndex.count(hash))
1336 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1337 if (mapOrphanBlocks.count(hash))
1338 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1340 // Preliminary checks
1341 if (!pblock->CheckBlock())
1342 return error("ProcessBlock() : CheckBlock FAILED");
1344 // If don't already have its previous block, shunt it off to holding area until we get it
1345 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1347 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1348 CBlock* pblock2 = new CBlock(*pblock);
1349 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1350 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1352 // Ask this guy to fill in what we're missing
1354 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1359 if (!pblock->AcceptBlock())
1360 return error("ProcessBlock() : AcceptBlock FAILED");
1362 // Recursively process any orphan blocks that depended on this one
1363 vector<uint256> vWorkQueue;
1364 vWorkQueue.push_back(hash);
1365 for (int i = 0; i < vWorkQueue.size(); i++)
1367 uint256 hashPrev = vWorkQueue[i];
1368 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1369 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1372 CBlock* pblockOrphan = (*mi).second;
1373 if (pblockOrphan->AcceptBlock())
1374 vWorkQueue.push_back(pblockOrphan->GetHash());
1375 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1376 delete pblockOrphan;
1378 mapOrphanBlocksByPrev.erase(hashPrev);
1381 printf("ProcessBlock: ACCEPTED\n");
1392 bool CheckDiskSpace(uint64 nAdditionalBytes)
1394 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1396 // Check for 15MB because database could create another 10MB log file at any time
1397 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1400 string strMessage = _("Warning: Disk space is low ");
1401 strMiscWarning = strMessage;
1402 printf("*** %s\n", strMessage.c_str());
1403 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1404 CreateThread(Shutdown, NULL);
1410 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1414 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1417 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1419 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1428 static unsigned int nCurrentBlockFile = 1;
1430 FILE* AppendBlockFile(unsigned int& nFileRet)
1435 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1438 if (fseek(file, 0, SEEK_END) != 0)
1440 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1441 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1443 nFileRet = nCurrentBlockFile;
1447 nCurrentBlockFile++;
1451 bool LoadBlockIndex(bool fAllowNew)
1455 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1456 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1457 pchMessageStart[0] = 0xfa;
1458 pchMessageStart[1] = 0xbf;
1459 pchMessageStart[2] = 0xb5;
1460 pchMessageStart[3] = 0xda;
1467 if (!txdb.LoadBlockIndex())
1472 // Init with genesis block
1474 if (mapBlockIndex.empty())
1480 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1481 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1482 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1483 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1484 // vMerkleTree: 4a5e1e
1487 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1489 txNew.vin.resize(1);
1490 txNew.vout.resize(1);
1491 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1492 txNew.vout[0].nValue = 50 * COIN;
1493 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1495 block.vtx.push_back(txNew);
1496 block.hashPrevBlock = 0;
1497 block.hashMerkleRoot = block.BuildMerkleTree();
1499 block.nTime = 1231006505;
1500 block.nBits = 0x1d00ffff;
1501 block.nNonce = 2083236893;
1505 block.nTime = 1296688602;
1506 block.nBits = 0x1d07fff8;
1507 block.nNonce = 384568319;
1511 printf("%s\n", block.GetHash().ToString().c_str());
1512 printf("%s\n", hashGenesisBlock.ToString().c_str());
1513 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1514 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1516 assert(block.GetHash() == hashGenesisBlock);
1518 // Start new block file
1520 unsigned int nBlockPos;
1521 if (!block.WriteToDisk(nFile, nBlockPos))
1522 return error("LoadBlockIndex() : writing genesis block to disk failed");
1523 if (!block.AddToBlockIndex(nFile, nBlockPos))
1524 return error("LoadBlockIndex() : genesis block not accepted");
1532 void PrintBlockTree()
1534 // precompute tree structure
1535 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1536 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1538 CBlockIndex* pindex = (*mi).second;
1539 mapNext[pindex->pprev].push_back(pindex);
1541 //while (rand() % 3 == 0)
1542 // mapNext[pindex->pprev].push_back(pindex);
1545 vector<pair<int, CBlockIndex*> > vStack;
1546 vStack.push_back(make_pair(0, pindexGenesisBlock));
1549 while (!vStack.empty())
1551 int nCol = vStack.back().first;
1552 CBlockIndex* pindex = vStack.back().second;
1555 // print split or gap
1556 if (nCol > nPrevCol)
1558 for (int i = 0; i < nCol-1; i++)
1562 else if (nCol < nPrevCol)
1564 for (int i = 0; i < nCol; i++)
1571 for (int i = 0; i < nCol; i++)
1576 block.ReadFromDisk(pindex);
1577 printf("%d (%u,%u) %s %s tx %d",
1581 block.GetHash().ToString().substr(0,20).c_str(),
1582 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1585 PrintWallets(block);
1587 // put the main timechain first
1588 vector<CBlockIndex*>& vNext = mapNext[pindex];
1589 for (int i = 0; i < vNext.size(); i++)
1591 if (vNext[i]->pnext)
1593 swap(vNext[0], vNext[i]);
1599 for (int i = 0; i < vNext.size(); i++)
1600 vStack.push_back(make_pair(nCol+i, vNext[i]));
1613 //////////////////////////////////////////////////////////////////////////////
1618 map<uint256, CAlert> mapAlerts;
1619 CCriticalSection cs_mapAlerts;
1621 string GetWarnings(string strFor)
1624 string strStatusBar;
1626 if (GetBoolArg("-testsafemode"))
1629 // Misc warnings like out of disk space and clock is wrong
1630 if (strMiscWarning != "")
1633 strStatusBar = strMiscWarning;
1636 // Longer invalid proof-of-work chain
1637 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1640 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1644 CRITICAL_BLOCK(cs_mapAlerts)
1646 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1648 const CAlert& alert = item.second;
1649 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1651 nPriority = alert.nPriority;
1652 strStatusBar = alert.strStatusBar;
1657 if (strFor == "statusbar")
1658 return strStatusBar;
1659 else if (strFor == "rpc")
1661 assert(!"GetWarnings() : invalid parameter");
1665 bool CAlert::ProcessAlert()
1667 if (!CheckSignature())
1672 CRITICAL_BLOCK(cs_mapAlerts)
1674 // Cancel previous alerts
1675 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1677 const CAlert& alert = (*mi).second;
1680 printf("cancelling alert %d\n", alert.nID);
1681 mapAlerts.erase(mi++);
1683 else if (!alert.IsInEffect())
1685 printf("expiring alert %d\n", alert.nID);
1686 mapAlerts.erase(mi++);
1692 // Check if this alert has been cancelled
1693 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1695 const CAlert& alert = item.second;
1696 if (alert.Cancels(*this))
1698 printf("alert already cancelled by %d\n", alert.nID);
1704 mapAlerts.insert(make_pair(GetHash(), *this));
1707 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1719 //////////////////////////////////////////////////////////////////////////////
1725 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1729 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1730 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1732 // Don't know what it is, just say we already got one
1739 // The message start string is designed to be unlikely to occur in normal data.
1740 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1741 // a large 4-byte int at any alignment.
1742 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1745 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1747 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1748 RandAddSeedPerfmon();
1750 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1751 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1753 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1755 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1763 if (strCommand == "version")
1765 // Each connection can only send one version message
1766 if (pfrom->nVersion != 0)
1773 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1774 if (pfrom->nVersion == 10300)
1775 pfrom->nVersion = 300;
1776 if (pfrom->nVersion >= 106 && !vRecv.empty())
1777 vRecv >> addrFrom >> nNonce;
1778 if (pfrom->nVersion >= 106 && !vRecv.empty())
1779 vRecv >> pfrom->strSubVer;
1780 if (pfrom->nVersion >= 209 && !vRecv.empty())
1781 vRecv >> pfrom->nStartingHeight;
1783 if (pfrom->nVersion == 0)
1786 // Disconnect if we connected to ourself
1787 if (nNonce == nLocalHostNonce && nNonce > 1)
1789 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1790 pfrom->fDisconnect = true;
1794 // Be shy and don't send version until we hear
1795 if (pfrom->fInbound)
1796 pfrom->PushVersion();
1798 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1800 AddTimeData(pfrom->addr.ip, nTime);
1803 if (pfrom->nVersion >= 209)
1804 pfrom->PushMessage("verack");
1805 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1806 if (pfrom->nVersion < 209)
1807 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1809 if (!pfrom->fInbound)
1811 // Advertise our address
1812 if (addrLocalHost.IsRoutable() && !fUseProxy)
1814 CAddress addr(addrLocalHost);
1815 addr.nTime = GetAdjustedTime();
1816 pfrom->PushAddress(addr);
1819 // Get recent addresses
1820 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1822 pfrom->PushMessage("getaddr");
1823 pfrom->fGetAddr = true;
1827 // Ask the first connected node for block updates
1828 static int nAskedForBlocks;
1829 if (!pfrom->fClient &&
1830 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1831 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1834 pfrom->PushGetBlocks(pindexBest, uint256(0));
1838 CRITICAL_BLOCK(cs_mapAlerts)
1839 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1840 item.second.RelayTo(pfrom);
1842 pfrom->fSuccessfullyConnected = true;
1844 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1848 else if (pfrom->nVersion == 0)
1850 // Must have a version message before anything else
1855 else if (strCommand == "verack")
1857 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1861 else if (strCommand == "addr")
1863 vector<CAddress> vAddr;
1866 // Don't want addr from older versions unless seeding
1867 if (pfrom->nVersion < 209)
1869 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1871 if (vAddr.size() > 1000)
1872 return error("message addr size() = %d", vAddr.size());
1874 // Store the new addresses
1877 int64 nNow = GetAdjustedTime();
1878 int64 nSince = nNow - 10 * 60;
1879 BOOST_FOREACH(CAddress& addr, vAddr)
1883 // ignore IPv6 for now, since it isn't implemented anyway
1886 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1887 addr.nTime = nNow - 5 * 24 * 60 * 60;
1888 AddAddress(addr, 2 * 60 * 60, &addrDB);
1889 pfrom->AddAddressKnown(addr);
1890 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1892 // Relay to a limited number of other nodes
1893 CRITICAL_BLOCK(cs_vNodes)
1895 // Use deterministic randomness to send to the same nodes for 24 hours
1896 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1897 static uint256 hashSalt;
1899 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1900 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1901 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1902 multimap<uint256, CNode*> mapMix;
1903 BOOST_FOREACH(CNode* pnode, vNodes)
1905 if (pnode->nVersion < 31402)
1907 unsigned int nPointer;
1908 memcpy(&nPointer, &pnode, sizeof(nPointer));
1909 uint256 hashKey = hashRand ^ nPointer;
1910 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1911 mapMix.insert(make_pair(hashKey, pnode));
1913 int nRelayNodes = 2;
1914 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1915 ((*mi).second)->PushAddress(addr);
1919 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1920 if (vAddr.size() < 1000)
1921 pfrom->fGetAddr = false;
1925 else if (strCommand == "inv")
1929 if (vInv.size() > 50000)
1930 return error("message inv size() = %d", vInv.size());
1933 BOOST_FOREACH(const CInv& inv, vInv)
1937 pfrom->AddInventoryKnown(inv);
1939 bool fAlreadyHave = AlreadyHave(txdb, inv);
1941 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1945 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1946 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1948 // Track requests for our stuff
1949 Inventory(inv.hash);
1954 else if (strCommand == "getdata")
1958 if (vInv.size() > 50000)
1959 return error("message getdata size() = %d", vInv.size());
1961 BOOST_FOREACH(const CInv& inv, vInv)
1965 printf("received getdata for: %s\n", inv.ToString().c_str());
1967 if (inv.type == MSG_BLOCK)
1969 // Send block from disk
1970 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1971 if (mi != mapBlockIndex.end())
1974 block.ReadFromDisk((*mi).second);
1975 pfrom->PushMessage("block", block);
1977 // Trigger them to send a getblocks request for the next batch of inventory
1978 if (inv.hash == pfrom->hashContinue)
1980 // Bypass PushInventory, this must send even if redundant,
1981 // and we want it right after the last block so they don't
1982 // wait for other stuff first.
1984 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
1985 pfrom->PushMessage("inv", vInv);
1986 pfrom->hashContinue = 0;
1990 else if (inv.IsKnownType())
1992 // Send stream from relay memory
1993 CRITICAL_BLOCK(cs_mapRelay)
1995 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
1996 if (mi != mapRelay.end())
1997 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2001 // Track requests for our stuff
2002 Inventory(inv.hash);
2007 else if (strCommand == "getblocks")
2009 CBlockLocator locator;
2011 vRecv >> locator >> hashStop;
2013 // Find the last block the caller has in the main chain
2014 CBlockIndex* pindex = locator.GetBlockIndex();
2016 // Send the rest of the chain
2018 pindex = pindex->pnext;
2019 int nLimit = 500 + locator.GetDistanceBack();
2020 unsigned int nBytes = 0;
2021 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2022 for (; pindex; pindex = pindex->pnext)
2024 if (pindex->GetBlockHash() == hashStop)
2026 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2029 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2031 block.ReadFromDisk(pindex, true);
2032 nBytes += block.GetSerializeSize(SER_NETWORK);
2033 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2035 // When this block is requested, we'll send an inv that'll make them
2036 // getblocks the next batch of inventory.
2037 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2038 pfrom->hashContinue = pindex->GetBlockHash();
2045 else if (strCommand == "getheaders")
2047 CBlockLocator locator;
2049 vRecv >> locator >> hashStop;
2051 CBlockIndex* pindex = NULL;
2052 if (locator.IsNull())
2054 // If locator is null, return the hashStop block
2055 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2056 if (mi == mapBlockIndex.end())
2058 pindex = (*mi).second;
2062 // Find the last block the caller has in the main chain
2063 pindex = locator.GetBlockIndex();
2065 pindex = pindex->pnext;
2068 vector<CBlock> vHeaders;
2069 int nLimit = 2000 + locator.GetDistanceBack();
2070 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2071 for (; pindex; pindex = pindex->pnext)
2073 vHeaders.push_back(pindex->GetBlockHeader());
2074 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2077 pfrom->PushMessage("headers", vHeaders);
2081 else if (strCommand == "tx")
2083 vector<uint256> vWorkQueue;
2084 CDataStream vMsg(vRecv);
2088 CInv inv(MSG_TX, tx.GetHash());
2089 pfrom->AddInventoryKnown(inv);
2091 bool fMissingInputs = false;
2092 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2094 SyncWithWallets(tx, NULL, true);
2095 RelayMessage(inv, vMsg);
2096 mapAlreadyAskedFor.erase(inv);
2097 vWorkQueue.push_back(inv.hash);
2099 // Recursively process any orphan transactions that depended on this one
2100 for (int i = 0; i < vWorkQueue.size(); i++)
2102 uint256 hashPrev = vWorkQueue[i];
2103 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2104 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2107 const CDataStream& vMsg = *((*mi).second);
2109 CDataStream(vMsg) >> tx;
2110 CInv inv(MSG_TX, tx.GetHash());
2112 if (tx.AcceptToMemoryPool(true))
2114 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2115 SyncWithWallets(tx, NULL, true);
2116 RelayMessage(inv, vMsg);
2117 mapAlreadyAskedFor.erase(inv);
2118 vWorkQueue.push_back(inv.hash);
2123 BOOST_FOREACH(uint256 hash, vWorkQueue)
2124 EraseOrphanTx(hash);
2126 else if (fMissingInputs)
2128 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2131 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2135 else if (strCommand == "block")
2140 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2143 CInv inv(MSG_BLOCK, block.GetHash());
2144 pfrom->AddInventoryKnown(inv);
2146 if (ProcessBlock(pfrom, &block))
2147 mapAlreadyAskedFor.erase(inv);
2148 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2152 else if (strCommand == "getaddr")
2154 // Nodes rebroadcast an addr every 24 hours
2155 pfrom->vAddrToSend.clear();
2156 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2157 CRITICAL_BLOCK(cs_mapAddresses)
2159 unsigned int nCount = 0;
2160 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2162 const CAddress& addr = item.second;
2163 if (addr.nTime > nSince)
2166 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2168 const CAddress& addr = item.second;
2169 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2170 pfrom->PushAddress(addr);
2176 else if (strCommand == "checkorder")
2181 if (!GetBoolArg("-allowreceivebyip"))
2183 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2190 /// we have a chance to check the order here
2192 // Keep giving the same key to the same ip until they use it
2193 if (!mapReuseKey.count(pfrom->addr.ip))
2194 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2196 // Send back approval of order and pubkey to use
2197 CScript scriptPubKey;
2198 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2199 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2203 else if (strCommand == "reply")
2208 CRequestTracker tracker;
2209 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2211 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2212 if (mi != pfrom->mapRequests.end())
2214 tracker = (*mi).second;
2215 pfrom->mapRequests.erase(mi);
2218 if (!tracker.IsNull())
2219 tracker.fn(tracker.param1, vRecv);
2223 else if (strCommand == "ping")
2228 else if (strCommand == "alert")
2233 if (alert.ProcessAlert())
2236 pfrom->setKnown.insert(alert.GetHash());
2237 CRITICAL_BLOCK(cs_vNodes)
2238 BOOST_FOREACH(CNode* pnode, vNodes)
2239 alert.RelayTo(pnode);
2246 // Ignore unknown commands for extensibility
2250 // Update the last seen time for this node's address
2251 if (pfrom->fNetworkNode)
2252 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2253 AddressCurrentlyConnected(pfrom->addr);
2259 bool ProcessMessages(CNode* pfrom)
2261 CDataStream& vRecv = pfrom->vRecv;
2265 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2269 // (4) message start
2278 // Scan for message start
2279 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2280 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2281 if (vRecv.end() - pstart < nHeaderSize)
2283 if (vRecv.size() > nHeaderSize)
2285 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2286 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2290 if (pstart - vRecv.begin() > 0)
2291 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2292 vRecv.erase(vRecv.begin(), pstart);
2295 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2300 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2303 string strCommand = hdr.GetCommand();
2306 unsigned int nMessageSize = hdr.nMessageSize;
2307 if (nMessageSize > MAX_SIZE)
2309 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2312 if (nMessageSize > vRecv.size())
2314 // Rewind and wait for rest of message
2315 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2320 if (vRecv.GetVersion() >= 209)
2322 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2323 unsigned int nChecksum = 0;
2324 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2325 if (nChecksum != hdr.nChecksum)
2327 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2328 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2333 // Copy message to its own buffer
2334 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2335 vRecv.ignore(nMessageSize);
2341 CRITICAL_BLOCK(cs_main)
2342 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2346 catch (std::ios_base::failure& e)
2348 if (strstr(e.what(), "end of data"))
2350 // Allow exceptions from underlength message on vRecv
2351 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());
2353 else if (strstr(e.what(), "size too large"))
2355 // Allow exceptions from overlong size
2356 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2360 PrintExceptionContinue(&e, "ProcessMessage()");
2363 catch (std::exception& e) {
2364 PrintExceptionContinue(&e, "ProcessMessage()");
2366 PrintExceptionContinue(NULL, "ProcessMessage()");
2370 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2378 bool SendMessages(CNode* pto, bool fSendTrickle)
2380 CRITICAL_BLOCK(cs_main)
2382 // Don't send anything until we get their version message
2383 if (pto->nVersion == 0)
2387 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2388 pto->PushMessage("ping");
2390 // Resend wallet transactions that haven't gotten in a block yet
2391 ResendWalletTransactions();
2393 // Address refresh broadcast
2394 static int64 nLastRebroadcast;
2395 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2397 nLastRebroadcast = GetTime();
2398 CRITICAL_BLOCK(cs_vNodes)
2400 BOOST_FOREACH(CNode* pnode, vNodes)
2402 // Periodically clear setAddrKnown to allow refresh broadcasts
2403 pnode->setAddrKnown.clear();
2405 // Rebroadcast our address
2406 if (addrLocalHost.IsRoutable() && !fUseProxy)
2408 CAddress addr(addrLocalHost);
2409 addr.nTime = GetAdjustedTime();
2410 pnode->PushAddress(addr);
2416 // Clear out old addresses periodically so it's not too much work at once
2417 static int64 nLastClear;
2418 if (nLastClear == 0)
2419 nLastClear = GetTime();
2420 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2422 nLastClear = GetTime();
2423 CRITICAL_BLOCK(cs_mapAddresses)
2426 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2427 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2428 mi != mapAddresses.end();)
2430 const CAddress& addr = (*mi).second;
2431 if (addr.nTime < nSince)
2433 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2435 addrdb.EraseAddress(addr);
2436 mapAddresses.erase(mi++);
2450 vector<CAddress> vAddr;
2451 vAddr.reserve(pto->vAddrToSend.size());
2452 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2454 // returns true if wasn't already contained in the set
2455 if (pto->setAddrKnown.insert(addr).second)
2457 vAddr.push_back(addr);
2458 // receiver rejects addr messages larger than 1000
2459 if (vAddr.size() >= 1000)
2461 pto->PushMessage("addr", vAddr);
2466 pto->vAddrToSend.clear();
2468 pto->PushMessage("addr", vAddr);
2473 // Message: inventory
2476 vector<CInv> vInvWait;
2477 CRITICAL_BLOCK(pto->cs_inventory)
2479 vInv.reserve(pto->vInventoryToSend.size());
2480 vInvWait.reserve(pto->vInventoryToSend.size());
2481 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2483 if (pto->setInventoryKnown.count(inv))
2486 // trickle out tx inv to protect privacy
2487 if (inv.type == MSG_TX && !fSendTrickle)
2489 // 1/4 of tx invs blast to all immediately
2490 static uint256 hashSalt;
2492 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2493 uint256 hashRand = inv.hash ^ hashSalt;
2494 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2495 bool fTrickleWait = ((hashRand & 3) != 0);
2497 // always trickle our own transactions
2501 if (GetTransaction(inv.hash, wtx))
2503 fTrickleWait = true;
2508 vInvWait.push_back(inv);
2513 // returns true if wasn't already contained in the set
2514 if (pto->setInventoryKnown.insert(inv).second)
2516 vInv.push_back(inv);
2517 if (vInv.size() >= 1000)
2519 pto->PushMessage("inv", vInv);
2524 pto->vInventoryToSend = vInvWait;
2527 pto->PushMessage("inv", vInv);
2533 vector<CInv> vGetData;
2534 int64 nNow = GetTime() * 1000000;
2536 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2538 const CInv& inv = (*pto->mapAskFor.begin()).second;
2539 if (!AlreadyHave(txdb, inv))
2541 printf("sending getdata: %s\n", inv.ToString().c_str());
2542 vGetData.push_back(inv);
2543 if (vGetData.size() >= 1000)
2545 pto->PushMessage("getdata", vGetData);
2549 mapAlreadyAskedFor[inv] = nNow;
2550 pto->mapAskFor.erase(pto->mapAskFor.begin());
2552 if (!vGetData.empty())
2553 pto->PushMessage("getdata", vGetData);
2572 //////////////////////////////////////////////////////////////////////////////
2577 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2579 unsigned char* pdata = (unsigned char*)pbuffer;
2580 unsigned int blocks = 1 + ((len + 8) / 64);
2581 unsigned char* pend = pdata + 64 * blocks;
2582 memset(pdata + len, 0, 64 * blocks - len);
2584 unsigned int bits = len * 8;
2585 pend[-1] = (bits >> 0) & 0xff;
2586 pend[-2] = (bits >> 8) & 0xff;
2587 pend[-3] = (bits >> 16) & 0xff;
2588 pend[-4] = (bits >> 24) & 0xff;
2592 using CryptoPP::ByteReverse;
2594 static const unsigned int pSHA256InitState[8] =
2595 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2597 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2599 memcpy(pstate, pinit, 32);
2600 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2604 // ScanHash scans nonces looking for a hash with at least some zero bits.
2605 // It operates on big endian data. Caller does the byte reversing.
2606 // All input buffers are 16-byte aligned. nNonce is usually preserved
2607 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2608 // the block is rebuilt and nNonce starts over at zero.
2610 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2612 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2616 // Hash pdata using pmidstate as the starting state into
2617 // preformatted buffer phash1, then hash phash1 into phash
2619 SHA256Transform(phash1, pdata, pmidstate);
2620 SHA256Transform(phash, phash1, pSHA256InitState);
2622 // Return the nonce if the hash has at least some zero bits,
2623 // caller will check if it has enough to reach the target
2624 if (((unsigned short*)phash)[14] == 0)
2627 // If nothing found after trying for a while, return -1
2628 if ((nNonce & 0xffff) == 0)
2630 nHashesDone = 0xffff+1;
2636 // Some explaining would be appreciated
2641 set<uint256> setDependsOn;
2644 COrphan(CTransaction* ptxIn)
2652 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2653 BOOST_FOREACH(uint256 hash, setDependsOn)
2654 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2659 CBlock* CreateNewBlock(CReserveKey& reservekey)
2661 CBlockIndex* pindexPrev = pindexBest;
2664 auto_ptr<CBlock> pblock(new CBlock());
2668 // Create coinbase tx
2670 txNew.vin.resize(1);
2671 txNew.vin[0].prevout.SetNull();
2672 txNew.vout.resize(1);
2673 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2675 // Add our coinbase tx as first transaction
2676 pblock->vtx.push_back(txNew);
2678 // Collect memory pool transactions into the block
2680 CRITICAL_BLOCK(cs_main)
2681 CRITICAL_BLOCK(cs_mapTransactions)
2685 // Priority order to process transactions
2686 list<COrphan> vOrphan; // list memory doesn't move
2687 map<uint256, vector<COrphan*> > mapDependers;
2688 multimap<double, CTransaction*> mapPriority;
2689 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2691 CTransaction& tx = (*mi).second;
2692 if (tx.IsCoinBase() || !tx.IsFinal())
2695 COrphan* porphan = NULL;
2696 double dPriority = 0;
2697 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2699 // Read prev transaction
2700 CTransaction txPrev;
2702 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2704 // Has to wait for dependencies
2707 // Use list for automatic deletion
2708 vOrphan.push_back(COrphan(&tx));
2709 porphan = &vOrphan.back();
2711 mapDependers[txin.prevout.hash].push_back(porphan);
2712 porphan->setDependsOn.insert(txin.prevout.hash);
2715 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2717 // Read block header
2718 int nConf = txindex.GetDepthInMainChain();
2720 dPriority += (double)nValueIn * nConf;
2722 if (fDebug && GetBoolArg("-printpriority"))
2723 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2726 // Priority is sum(valuein * age) / txsize
2727 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2730 porphan->dPriority = dPriority;
2732 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2734 if (fDebug && GetBoolArg("-printpriority"))
2736 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2743 // Collect transactions into block
2744 map<uint256, CTxIndex> mapTestPool;
2745 uint64 nBlockSize = 1000;
2746 int nBlockSigOps = 100;
2747 while (!mapPriority.empty())
2749 // Take highest priority transaction off priority queue
2750 double dPriority = -(*mapPriority.begin()).first;
2751 CTransaction& tx = *(*mapPriority.begin()).second;
2752 mapPriority.erase(mapPriority.begin());
2755 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2756 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2758 int nTxSigOps = tx.GetSigOpCount();
2759 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2762 // Transaction fee required depends on block size
2763 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2764 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2766 // Connecting shouldn't fail due to dependency on other memory pool transactions
2767 // because we're already processing them in order of dependency
2768 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2769 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2771 swap(mapTestPool, mapTestPoolTmp);
2774 pblock->vtx.push_back(tx);
2775 nBlockSize += nTxSize;
2776 nBlockSigOps += nTxSigOps;
2778 // Add transactions that depend on this one to the priority queue
2779 uint256 hash = tx.GetHash();
2780 if (mapDependers.count(hash))
2782 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2784 if (!porphan->setDependsOn.empty())
2786 porphan->setDependsOn.erase(hash);
2787 if (porphan->setDependsOn.empty())
2788 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2794 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2797 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2798 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2799 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2800 pblock->nBits = GetNextWorkRequired(pindexPrev);
2803 return pblock.release();
2807 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2809 // Update nExtraNonce
2810 static uint256 hashPrevBlock;
2811 if (hashPrevBlock != pblock->hashPrevBlock)
2814 hashPrevBlock = pblock->hashPrevBlock;
2817 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2818 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2822 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2825 // Prebuild hash buffers
2832 uint256 hashPrevBlock;
2833 uint256 hashMerkleRoot;
2836 unsigned int nNonce;
2839 unsigned char pchPadding0[64];
2841 unsigned char pchPadding1[64];
2844 memset(&tmp, 0, sizeof(tmp));
2846 tmp.block.nVersion = pblock->nVersion;
2847 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2848 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2849 tmp.block.nTime = pblock->nTime;
2850 tmp.block.nBits = pblock->nBits;
2851 tmp.block.nNonce = pblock->nNonce;
2853 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2854 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2856 // Byte swap all the input buffer
2857 for (int i = 0; i < sizeof(tmp)/4; i++)
2858 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2860 // Precalc the first half of the first hash, which stays constant
2861 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2863 memcpy(pdata, &tmp.block, 128);
2864 memcpy(phash1, &tmp.hash1, 64);
2868 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2870 uint256 hash = pblock->GetHash();
2871 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2873 if (hash > hashTarget)
2877 printf("BitcoinMiner:\n");
2878 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2880 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2881 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2884 CRITICAL_BLOCK(cs_main)
2886 if (pblock->hashPrevBlock != hashBestChain)
2887 return error("BitcoinMiner : generated block is stale");
2889 // Remove key from key pool
2890 reservekey.KeepKey();
2892 // Track how many getdata requests this block gets
2893 CRITICAL_BLOCK(wallet.cs_wallet)
2894 wallet.mapRequestCount[pblock->GetHash()] = 0;
2896 // Process this block the same as if we had received it from another node
2897 if (!ProcessBlock(NULL, pblock))
2898 return error("BitcoinMiner : ProcessBlock, block not accepted");
2905 void static ThreadBitcoinMiner(void* parg);
2907 void static BitcoinMiner(CWallet *pwallet)
2909 printf("BitcoinMiner started\n");
2910 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2912 // Each thread has its own key and counter
2913 CReserveKey reservekey(pwallet);
2914 unsigned int nExtraNonce = 0;
2916 while (fGenerateBitcoins)
2918 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2922 while (vNodes.empty() || IsInitialBlockDownload())
2927 if (!fGenerateBitcoins)
2935 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2936 CBlockIndex* pindexPrev = pindexBest;
2938 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2941 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2943 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2947 // Prebuild hash buffers
2949 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2950 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2951 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2953 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2955 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2956 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2962 int64 nStart = GetTime();
2963 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2965 uint256& hash = *alignup<16>(hashbuf);
2968 unsigned int nHashesDone = 0;
2969 unsigned int nNonceFound;
2972 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2973 (char*)&hash, nHashesDone);
2975 // Check if something found
2976 if (nNonceFound != -1)
2978 for (int i = 0; i < sizeof(hash)/4; i++)
2979 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2981 if (hash <= hashTarget)
2984 pblock->nNonce = ByteReverse(nNonceFound);
2985 assert(hash == pblock->GetHash());
2987 SetThreadPriority(THREAD_PRIORITY_NORMAL);
2988 CheckWork(pblock.get(), *pwalletMain, reservekey);
2989 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2995 static int64 nHashCounter;
2996 if (nHPSTimerStart == 0)
2998 nHPSTimerStart = GetTimeMillis();
3002 nHashCounter += nHashesDone;
3003 if (GetTimeMillis() - nHPSTimerStart > 4000)
3005 static CCriticalSection cs;
3008 if (GetTimeMillis() - nHPSTimerStart > 4000)
3010 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3011 nHPSTimerStart = GetTimeMillis();
3013 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3014 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3015 static int64 nLogTime;
3016 if (GetTime() - nLogTime > 30 * 60)
3018 nLogTime = GetTime();
3019 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3020 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3026 // Check for stop or if block needs to be rebuilt
3029 if (!fGenerateBitcoins)
3031 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3035 if (nBlockNonce >= 0xffff0000)
3037 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3039 if (pindexPrev != pindexBest)
3042 // Update nTime every few seconds
3043 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3044 nBlockTime = ByteReverse(pblock->nTime);
3049 void static ThreadBitcoinMiner(void* parg)
3051 CWallet* pwallet = (CWallet*)parg;
3054 vnThreadsRunning[3]++;
3055 BitcoinMiner(pwallet);
3056 vnThreadsRunning[3]--;
3058 catch (std::exception& e) {
3059 vnThreadsRunning[3]--;
3060 PrintException(&e, "ThreadBitcoinMiner()");
3062 vnThreadsRunning[3]--;
3063 PrintException(NULL, "ThreadBitcoinMiner()");
3065 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3067 if (vnThreadsRunning[3] == 0)
3069 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3073 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3075 if (fGenerateBitcoins != fGenerate)
3077 fGenerateBitcoins = fGenerate;
3078 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3081 if (fGenerateBitcoins)
3083 int nProcessors = boost::thread::hardware_concurrency();
3084 printf("%d processors\n", nProcessors);
3085 if (nProcessors < 1)
3087 if (fLimitProcessors && nProcessors > nLimitProcessors)
3088 nProcessors = nLimitProcessors;
3089 int nAddThreads = nProcessors - vnThreadsRunning[3];
3090 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3091 for (int i = 0; i < nAddThreads; i++)
3093 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3094 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");