1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Distributed under the MIT/X11 software license, see the accompanying
3 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
8 #include "cryptopp/sha.h"
9 #include <boost/filesystem.hpp>
10 #include <boost/filesystem/fstream.hpp>
13 using namespace boost;
19 CCriticalSection cs_setpwalletRegistered;
20 set<CWallet*> setpwalletRegistered;
22 CCriticalSection cs_main;
24 CCriticalSection cs_mapPubKeys;
25 map<uint160, vector<unsigned char> > mapPubKeys;
27 map<uint256, CTransaction> mapTransactions;
28 CCriticalSection cs_mapTransactions;
29 unsigned int nTransactionsUpdated = 0;
30 map<COutPoint, CInPoint> mapNextTx;
32 map<uint256, CBlockIndex*> mapBlockIndex;
33 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
34 CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
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 CAddress addrIncoming;
57 int fLimitProcessors = false;
58 int nLimitProcessors = 1;
59 int fMinimizeToTray = true;
60 int fMinimizeOnClose = true;
73 //////////////////////////////////////////////////////////////////////////////
75 // dispatching functions
78 void RegisterWallet(CWallet* pwalletIn)
80 CRITICAL_BLOCK(cs_setpwalletRegistered)
82 setpwalletRegistered.insert(pwalletIn);
86 void UnregisterWallet(CWallet* pwalletIn)
88 CRITICAL_BLOCK(cs_setpwalletRegistered)
90 setpwalletRegistered.erase(pwalletIn);
94 bool static IsFromMe(CTransaction& tx)
96 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
97 if (pwallet->IsFromMe(tx))
102 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
104 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
105 if (pwallet->GetTransaction(hashTx,wtx))
110 void static EraseFromWallets(uint256 hash)
112 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
113 pwallet->EraseFromWallet(hash);
116 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
118 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
119 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
122 void static SetBestChain(const CBlockLocator& loc)
124 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
125 pwallet->SetBestChain(loc);
128 void static UpdatedTransaction(const uint256& hashTx)
130 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
131 pwallet->UpdatedTransaction(hashTx);
134 void static PrintWallets(const CBlock& block)
136 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
137 pwallet->PrintWallet(block);
140 void static Inventory(const uint256& hash)
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 pwallet->Inventory(hash);
146 void static ResendWalletTransactions()
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->ResendWalletTransactions();
158 //////////////////////////////////////////////////////////////////////////////
160 // mapOrphanTransactions
163 void static AddOrphanTx(const CDataStream& vMsg)
166 CDataStream(vMsg) >> tx;
167 uint256 hash = tx.GetHash();
168 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);
204 //////////////////////////////////////////////////////////////////////////////
206 // CTransaction and CTxIndex
209 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
212 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
214 if (!ReadFromDisk(txindexRet.pos))
216 if (prevout.n >= vout.size())
224 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
227 return ReadFromDisk(txdb, prevout, txindex);
230 bool CTransaction::ReadFromDisk(COutPoint prevout)
234 return ReadFromDisk(txdb, prevout, txindex);
239 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
251 // Load the block this tx is in
253 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
255 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
260 // Update the tx's hashBlock
261 hashBlock = pblock->GetHash();
263 // Locate the transaction
264 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
265 if (pblock->vtx[nIndex] == *(CTransaction*)this)
267 if (nIndex == pblock->vtx.size())
269 vMerkleBranch.clear();
271 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
275 // Fill in merkle branch
276 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
279 // Is the tx in a block that's in the main chain
280 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
281 if (mi == mapBlockIndex.end())
283 CBlockIndex* pindex = (*mi).second;
284 if (!pindex || !pindex->IsInMainChain())
287 return pindexBest->nHeight - pindex->nHeight + 1;
296 bool CTransaction::CheckTransaction() const
298 // Basic checks that don't depend on any context
299 if (vin.empty() || vout.empty())
300 return error("CTransaction::CheckTransaction() : vin or vout empty");
303 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
304 return 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 error("CTransaction::CheckTransaction() : txout.nValue negative");
312 if (txout.nValue > MAX_MONEY)
313 return error("CTransaction::CheckTransaction() : txout.nValue too high");
314 nValueOut += txout.nValue;
315 if (!MoneyRange(nValueOut))
316 return error("CTransaction::CheckTransaction() : txout total out of range");
321 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
322 return error("CTransaction::CheckTransaction() : coinbase script size");
326 BOOST_FOREACH(const CTxIn& txin, vin)
327 if (txin.prevout.IsNull())
328 return error("CTransaction::CheckTransaction() : prevout is null");
334 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
337 *pfMissingInputs = false;
339 if (!CheckTransaction())
340 return error("AcceptToMemoryPool() : CheckTransaction failed");
342 // Coinbase is only valid in a block, not as a loose transaction
344 return error("AcceptToMemoryPool() : coinbase as individual tx");
346 // To help v0.1.5 clients who would see it as a negative number
347 if ((int64)nLockTime > INT_MAX)
348 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
351 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
352 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
353 // attacks disallow transactions with more than one SigOp per 34 bytes.
354 // 34 bytes because a TxOut is:
355 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
356 if (GetSigOpCount() > nSize / 34 || nSize < 100)
357 return error("AcceptToMemoryPool() : nonstandard transaction");
359 // Rather not work on nonstandard transactions (unless -testnet)
360 if (!fTestNet && !IsStandard())
361 return error("AcceptToMemoryPool() : nonstandard transaction type");
363 // Do we already have it?
364 uint256 hash = GetHash();
365 CRITICAL_BLOCK(cs_mapTransactions)
366 if (mapTransactions.count(hash))
369 if (txdb.ContainsTx(hash))
372 // Check for conflicts with in-memory transactions
373 CTransaction* ptxOld = NULL;
374 for (int i = 0; i < vin.size(); i++)
376 COutPoint outpoint = vin[i].prevout;
377 if (mapNextTx.count(outpoint))
379 // Disable replacement feature for now
382 // Allow replacing with a newer version of the same transaction
385 ptxOld = mapNextTx[outpoint].ptx;
386 if (ptxOld->IsFinal())
388 if (!IsNewerThan(*ptxOld))
390 for (int i = 0; i < vin.size(); i++)
392 COutPoint outpoint = vin[i].prevout;
393 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
402 // Check against previous transactions
403 map<uint256, CTxIndex> mapUnused;
405 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
408 *pfMissingInputs = true;
409 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
412 // Don't accept it if it can't get into a block
413 if (nFees < GetMinFee(1000, true, true))
414 return error("AcceptToMemoryPool() : not enough fees");
416 // Continuously rate-limit free transactions
417 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
418 // be annoying or make other's transactions take longer to confirm.
419 if (nFees < MIN_RELAY_TX_FEE)
421 static CCriticalSection cs;
422 static double dFreeCount;
423 static int64 nLastTime;
424 int64 nNow = GetTime();
428 // Use an exponentially decaying ~10-minute window:
429 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
431 // -limitfreerelay unit is thousand-bytes-per-minute
432 // At default rate it would take over a month to fill 1GB
433 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
434 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
436 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
442 // Store transaction in memory
443 CRITICAL_BLOCK(cs_mapTransactions)
447 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
448 ptxOld->RemoveFromMemoryPool();
450 AddToMemoryPoolUnchecked();
453 ///// are we sure this is ok when loading transactions or restoring block txes
454 // If updated, erase old tx from wallet
456 EraseFromWallets(ptxOld->GetHash());
458 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
462 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
465 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
468 bool CTransaction::AddToMemoryPoolUnchecked()
470 // Add to memory pool without checking anything. Don't call this directly,
471 // call AcceptToMemoryPool to properly check the transaction first.
472 CRITICAL_BLOCK(cs_mapTransactions)
474 uint256 hash = GetHash();
475 mapTransactions[hash] = *this;
476 for (int i = 0; i < vin.size(); i++)
477 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
478 nTransactionsUpdated++;
484 bool CTransaction::RemoveFromMemoryPool()
486 // Remove transaction from memory pool
487 CRITICAL_BLOCK(cs_mapTransactions)
489 BOOST_FOREACH(const CTxIn& txin, vin)
490 mapNextTx.erase(txin.prevout);
491 mapTransactions.erase(GetHash());
492 nTransactionsUpdated++;
502 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
504 if (hashBlock == 0 || nIndex == -1)
507 // Find the block it claims to be in
508 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
509 if (mi == mapBlockIndex.end())
511 CBlockIndex* pindex = (*mi).second;
512 if (!pindex || !pindex->IsInMainChain())
515 // Make sure the merkle branch connects to this block
516 if (!fMerkleVerified)
518 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
520 fMerkleVerified = true;
523 nHeightRet = pindex->nHeight;
524 return pindexBest->nHeight - pindex->nHeight + 1;
528 int CMerkleTx::GetBlocksToMaturity() const
532 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
536 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
540 if (!IsInMainChain() && !ClientConnectInputs())
542 return CTransaction::AcceptToMemoryPool(txdb, false);
546 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
550 bool CMerkleTx::AcceptToMemoryPool()
553 return AcceptToMemoryPool(txdb);
558 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
560 CRITICAL_BLOCK(cs_mapTransactions)
562 // Add previous supporting transactions first
563 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
565 if (!tx.IsCoinBase())
567 uint256 hash = tx.GetHash();
568 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
569 tx.AcceptToMemoryPool(txdb, fCheckInputs);
572 return AcceptToMemoryPool(txdb, fCheckInputs);
577 bool CWalletTx::AcceptWalletTransaction()
580 return AcceptWalletTransaction(txdb);
583 int CTxIndex::GetDepthInMainChain() const
587 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
589 // Find the block in the index
590 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
591 if (mi == mapBlockIndex.end())
593 CBlockIndex* pindex = (*mi).second;
594 if (!pindex || !pindex->IsInMainChain())
596 return 1 + nBestHeight - pindex->nHeight;
608 //////////////////////////////////////////////////////////////////////////////
610 // CBlock and CBlockIndex
613 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
615 if (!fReadTransactions)
617 *this = pindex->GetBlockHeader();
620 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
622 if (GetHash() != pindex->GetBlockHash())
623 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
627 uint256 static GetOrphanRoot(const CBlock* pblock)
629 // Work back to the first block in the orphan chain
630 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
631 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
632 return pblock->GetHash();
635 int64 static GetBlockValue(int nHeight, int64 nFees)
637 int64 nSubsidy = 50 * COIN;
639 // Subsidy is cut in half every 4 years
640 nSubsidy >>= (nHeight / 210000);
642 return nSubsidy + nFees;
645 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
647 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
648 const int64 nTargetSpacing = 10 * 60;
649 const int64 nInterval = nTargetTimespan / nTargetSpacing;
652 if (pindexLast == NULL)
653 return bnProofOfWorkLimit.GetCompact();
655 // Only change once per interval
656 if ((pindexLast->nHeight+1) % nInterval != 0)
657 return pindexLast->nBits;
659 // Go back by what we want to be 14 days worth of blocks
660 const CBlockIndex* pindexFirst = pindexLast;
661 for (int i = 0; pindexFirst && i < nInterval-1; i++)
662 pindexFirst = pindexFirst->pprev;
665 // Limit adjustment step
666 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
667 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
668 if (nActualTimespan < nTargetTimespan/4)
669 nActualTimespan = nTargetTimespan/4;
670 if (nActualTimespan > nTargetTimespan*4)
671 nActualTimespan = nTargetTimespan*4;
675 bnNew.SetCompact(pindexLast->nBits);
676 bnNew *= nActualTimespan;
677 bnNew /= nTargetTimespan;
679 if (bnNew > bnProofOfWorkLimit)
680 bnNew = bnProofOfWorkLimit;
683 printf("GetNextWorkRequired RETARGET\n");
684 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
685 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
686 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
688 return bnNew.GetCompact();
691 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
694 bnTarget.SetCompact(nBits);
697 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
698 return error("CheckProofOfWork() : nBits below minimum work");
700 // Check proof of work matches claimed amount
701 if (hash > bnTarget.getuint256())
702 return error("CheckProofOfWork() : hash doesn't match nBits");
707 bool IsInitialBlockDownload()
709 if (pindexBest == NULL || (!fTestNet && nBestHeight < 118000))
711 static int64 nLastUpdate;
712 static CBlockIndex* pindexLastBest;
713 if (pindexBest != pindexLastBest)
715 pindexLastBest = pindexBest;
716 nLastUpdate = GetTime();
718 return (GetTime() - nLastUpdate < 10 &&
719 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
722 void static InvalidChainFound(CBlockIndex* pindexNew)
724 if (pindexNew->bnChainWork > bnBestInvalidWork)
726 bnBestInvalidWork = pindexNew->bnChainWork;
727 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
730 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());
731 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
732 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
733 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
746 bool CTransaction::DisconnectInputs(CTxDB& txdb)
748 // Relinquish previous transactions' spent pointers
751 BOOST_FOREACH(const CTxIn& txin, vin)
753 COutPoint prevout = txin.prevout;
755 // Get prev txindex from disk
757 if (!txdb.ReadTxIndex(prevout.hash, txindex))
758 return error("DisconnectInputs() : ReadTxIndex failed");
760 if (prevout.n >= txindex.vSpent.size())
761 return error("DisconnectInputs() : prevout.n out of range");
763 // Mark outpoint as not spent
764 txindex.vSpent[prevout.n].SetNull();
767 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
768 return error("DisconnectInputs() : UpdateTxIndex failed");
772 // Remove transaction from index
773 if (!txdb.EraseTxIndex(*this))
774 return error("DisconnectInputs() : EraseTxPos failed");
780 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
781 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
783 // Take over previous transactions' spent pointers
787 for (int i = 0; i < vin.size(); i++)
789 COutPoint prevout = vin[i].prevout;
794 if (fMiner && mapTestPool.count(prevout.hash))
796 // Get txindex from current proposed changes
797 txindex = mapTestPool[prevout.hash];
801 // Read txindex from txdb
802 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
804 if (!fFound && (fBlock || fMiner))
805 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());
809 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
811 // Get prev tx from single transactions in memory
812 CRITICAL_BLOCK(cs_mapTransactions)
814 if (!mapTransactions.count(prevout.hash))
815 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
816 txPrev = mapTransactions[prevout.hash];
819 txindex.vSpent.resize(txPrev.vout.size());
823 // Get prev tx from disk
824 if (!txPrev.ReadFromDisk(txindex.pos))
825 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
828 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
829 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());
831 // If prev is coinbase, check that it's matured
832 if (txPrev.IsCoinBase())
833 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
834 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
835 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
838 if (!VerifySignature(txPrev, *this, i))
839 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
841 // Check for conflicts
842 if (!txindex.vSpent[prevout.n].IsNull())
843 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());
845 // Check for negative or overflow input values
846 nValueIn += txPrev.vout[prevout.n].nValue;
847 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
848 return error("ConnectInputs() : txin values out of range");
850 // Mark outpoints as spent
851 txindex.vSpent[prevout.n] = posThisTx;
856 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
857 return error("ConnectInputs() : UpdateTxIndex failed");
861 mapTestPool[prevout.hash] = txindex;
865 if (nValueIn < GetValueOut())
866 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
868 // Tally transaction fees
869 int64 nTxFee = nValueIn - GetValueOut();
871 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
872 if (nTxFee < nMinFee)
875 if (!MoneyRange(nFees))
876 return error("ConnectInputs() : nFees out of range");
881 // Add transaction to disk index
882 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
883 return error("ConnectInputs() : AddTxPos failed");
887 // Add transaction to test pool
888 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
895 bool CTransaction::ClientConnectInputs()
900 // Take over previous transactions' spent pointers
901 CRITICAL_BLOCK(cs_mapTransactions)
904 for (int i = 0; i < vin.size(); i++)
906 // Get prev tx from single transactions in memory
907 COutPoint prevout = vin[i].prevout;
908 if (!mapTransactions.count(prevout.hash))
910 CTransaction& txPrev = mapTransactions[prevout.hash];
912 if (prevout.n >= txPrev.vout.size())
916 if (!VerifySignature(txPrev, *this, i))
917 return error("ConnectInputs() : VerifySignature failed");
919 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
920 ///// this has to go away now that posNext is gone
921 // // Check for conflicts
922 // if (!txPrev.vout[prevout.n].posNext.IsNull())
923 // return error("ConnectInputs() : prev tx already used");
925 // // Flag outpoints as used
926 // txPrev.vout[prevout.n].posNext = posThisTx;
928 nValueIn += txPrev.vout[prevout.n].nValue;
930 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
931 return error("ClientConnectInputs() : txin values out of range");
933 if (GetValueOut() > nValueIn)
943 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
945 // Disconnect in reverse order
946 for (int i = vtx.size()-1; i >= 0; i--)
947 if (!vtx[i].DisconnectInputs(txdb))
950 // Update block index on disk without changing it in memory.
951 // The memory index structure will be changed after the db commits.
954 CDiskBlockIndex blockindexPrev(pindex->pprev);
955 blockindexPrev.hashNext = 0;
956 if (!txdb.WriteBlockIndex(blockindexPrev))
957 return error("DisconnectBlock() : WriteBlockIndex failed");
963 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
965 // Check it again in case a previous version let a bad block in
969 //// issue here: it doesn't know the version
970 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
972 map<uint256, CTxIndex> mapUnused;
974 BOOST_FOREACH(CTransaction& tx, vtx)
976 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
977 nTxPos += ::GetSerializeSize(tx, SER_DISK);
979 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
983 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
986 // Update block index on disk without changing it in memory.
987 // The memory index structure will be changed after the db commits.
990 CDiskBlockIndex blockindexPrev(pindex->pprev);
991 blockindexPrev.hashNext = pindex->GetBlockHash();
992 if (!txdb.WriteBlockIndex(blockindexPrev))
993 return error("ConnectBlock() : WriteBlockIndex failed");
996 // Watch for transactions paying to me
997 BOOST_FOREACH(CTransaction& tx, vtx)
998 SyncWithWallets(tx, this, true);
1003 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1005 printf("REORGANIZE\n");
1008 CBlockIndex* pfork = pindexBest;
1009 CBlockIndex* plonger = pindexNew;
1010 while (pfork != plonger)
1012 while (plonger->nHeight > pfork->nHeight)
1013 if (!(plonger = plonger->pprev))
1014 return error("Reorganize() : plonger->pprev is null");
1015 if (pfork == plonger)
1017 if (!(pfork = pfork->pprev))
1018 return error("Reorganize() : pfork->pprev is null");
1021 // List of what to disconnect
1022 vector<CBlockIndex*> vDisconnect;
1023 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1024 vDisconnect.push_back(pindex);
1026 // List of what to connect
1027 vector<CBlockIndex*> vConnect;
1028 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1029 vConnect.push_back(pindex);
1030 reverse(vConnect.begin(), vConnect.end());
1032 // Disconnect shorter branch
1033 vector<CTransaction> vResurrect;
1034 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1037 if (!block.ReadFromDisk(pindex))
1038 return error("Reorganize() : ReadFromDisk for disconnect failed");
1039 if (!block.DisconnectBlock(txdb, pindex))
1040 return error("Reorganize() : DisconnectBlock failed");
1042 // Queue memory transactions to resurrect
1043 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1044 if (!tx.IsCoinBase())
1045 vResurrect.push_back(tx);
1048 // Connect longer branch
1049 vector<CTransaction> vDelete;
1050 for (int i = 0; i < vConnect.size(); i++)
1052 CBlockIndex* pindex = vConnect[i];
1054 if (!block.ReadFromDisk(pindex))
1055 return error("Reorganize() : ReadFromDisk for connect failed");
1056 if (!block.ConnectBlock(txdb, pindex))
1060 return error("Reorganize() : ConnectBlock failed");
1063 // Queue memory transactions to delete
1064 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1065 vDelete.push_back(tx);
1067 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1068 return error("Reorganize() : WriteHashBestChain failed");
1070 // Make sure it's successfully written to disk before changing memory structure
1071 if (!txdb.TxnCommit())
1072 return error("Reorganize() : TxnCommit failed");
1074 // Disconnect shorter branch
1075 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1077 pindex->pprev->pnext = NULL;
1079 // Connect longer branch
1080 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1082 pindex->pprev->pnext = pindex;
1084 // Resurrect memory transactions that were in the disconnected branch
1085 BOOST_FOREACH(CTransaction& tx, vResurrect)
1086 tx.AcceptToMemoryPool(txdb, false);
1088 // Delete redundant memory transactions that are in the connected branch
1089 BOOST_FOREACH(CTransaction& tx, vDelete)
1090 tx.RemoveFromMemoryPool();
1096 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1098 uint256 hash = GetHash();
1101 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1103 txdb.WriteHashBestChain(hash);
1104 if (!txdb.TxnCommit())
1105 return error("SetBestChain() : TxnCommit failed");
1106 pindexGenesisBlock = pindexNew;
1108 else if (hashPrevBlock == hashBestChain)
1110 // Adding to current best branch
1111 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1114 InvalidChainFound(pindexNew);
1115 return error("SetBestChain() : ConnectBlock failed");
1117 if (!txdb.TxnCommit())
1118 return error("SetBestChain() : TxnCommit failed");
1120 // Add to current best branch
1121 pindexNew->pprev->pnext = pindexNew;
1123 // Delete redundant memory transactions
1124 BOOST_FOREACH(CTransaction& tx, vtx)
1125 tx.RemoveFromMemoryPool();
1130 if (!Reorganize(txdb, pindexNew))
1133 InvalidChainFound(pindexNew);
1134 return error("SetBestChain() : Reorganize failed");
1138 // Update best block in wallet (so we can detect restored wallets)
1139 if (!IsInitialBlockDownload())
1141 const CBlockLocator locator(pindexNew);
1142 ::SetBestChain(locator);
1146 hashBestChain = hash;
1147 pindexBest = pindexNew;
1148 nBestHeight = pindexBest->nHeight;
1149 bnBestChainWork = pindexNew->bnChainWork;
1150 nTimeBestReceived = GetTime();
1151 nTransactionsUpdated++;
1152 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1158 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1160 // Check for duplicate
1161 uint256 hash = GetHash();
1162 if (mapBlockIndex.count(hash))
1163 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1165 // Construct new block index object
1166 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1168 return error("AddToBlockIndex() : new CBlockIndex failed");
1169 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1170 pindexNew->phashBlock = &((*mi).first);
1171 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1172 if (miPrev != mapBlockIndex.end())
1174 pindexNew->pprev = (*miPrev).second;
1175 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1177 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1181 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1182 if (!txdb.TxnCommit())
1186 if (pindexNew->bnChainWork > bnBestChainWork)
1187 if (!SetBestChain(txdb, pindexNew))
1192 if (pindexNew == pindexBest)
1194 // Notify UI to display prev block's coinbase if it was ours
1195 static uint256 hashPrevBestCoinBase;
1196 UpdatedTransaction(hashPrevBestCoinBase);
1197 hashPrevBestCoinBase = vtx[0].GetHash();
1207 bool CBlock::CheckBlock() const
1209 // These are checks that are independent of context
1210 // that can be verified before saving an orphan block.
1213 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1214 return error("CheckBlock() : size limits failed");
1216 // Check proof of work matches claimed amount
1217 if (!CheckProofOfWork(GetHash(), nBits))
1218 return error("CheckBlock() : proof of work failed");
1221 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1222 return error("CheckBlock() : block timestamp too far in the future");
1224 // First transaction must be coinbase, the rest must not be
1225 if (vtx.empty() || !vtx[0].IsCoinBase())
1226 return error("CheckBlock() : first tx is not coinbase");
1227 for (int i = 1; i < vtx.size(); i++)
1228 if (vtx[i].IsCoinBase())
1229 return error("CheckBlock() : more than one coinbase");
1231 // Check transactions
1232 BOOST_FOREACH(const CTransaction& tx, vtx)
1233 if (!tx.CheckTransaction())
1234 return error("CheckBlock() : CheckTransaction failed");
1236 // Check that it's not full of nonstandard transactions
1237 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1238 return error("CheckBlock() : too many nonstandard transactions");
1241 if (hashMerkleRoot != BuildMerkleTree())
1242 return error("CheckBlock() : hashMerkleRoot mismatch");
1247 bool CBlock::AcceptBlock()
1249 // Check for duplicate
1250 uint256 hash = GetHash();
1251 if (mapBlockIndex.count(hash))
1252 return error("AcceptBlock() : block already in mapBlockIndex");
1254 // Get prev block index
1255 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1256 if (mi == mapBlockIndex.end())
1257 return error("AcceptBlock() : prev block not found");
1258 CBlockIndex* pindexPrev = (*mi).second;
1259 int nHeight = pindexPrev->nHeight+1;
1261 // Check proof of work
1262 if (nBits != GetNextWorkRequired(pindexPrev))
1263 return error("AcceptBlock() : incorrect proof of work");
1265 // Check timestamp against prev
1266 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1267 return error("AcceptBlock() : block's timestamp is too early");
1269 // Check that all transactions are finalized
1270 BOOST_FOREACH(const CTransaction& tx, vtx)
1271 if (!tx.IsFinal(nHeight, GetBlockTime()))
1272 return error("AcceptBlock() : contains a non-final transaction");
1274 // Check that the block chain matches the known block chain up to a checkpoint
1276 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1277 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1278 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1279 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1280 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1281 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1282 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")))
1283 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1285 // Write block to history file
1286 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1287 return error("AcceptBlock() : out of disk space");
1288 unsigned int nFile = -1;
1289 unsigned int nBlockPos = 0;
1290 if (!WriteToDisk(nFile, nBlockPos))
1291 return error("AcceptBlock() : WriteToDisk failed");
1292 if (!AddToBlockIndex(nFile, nBlockPos))
1293 return error("AcceptBlock() : AddToBlockIndex failed");
1295 // Relay inventory, but don't relay old inventory during initial block download
1296 if (hashBestChain == hash)
1297 CRITICAL_BLOCK(cs_vNodes)
1298 BOOST_FOREACH(CNode* pnode, vNodes)
1299 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 118000))
1300 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1305 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1307 // Check for duplicate
1308 uint256 hash = pblock->GetHash();
1309 if (mapBlockIndex.count(hash))
1310 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1311 if (mapOrphanBlocks.count(hash))
1312 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1314 // Preliminary checks
1315 if (!pblock->CheckBlock())
1316 return error("ProcessBlock() : CheckBlock FAILED");
1318 // If don't already have its previous block, shunt it off to holding area until we get it
1319 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1321 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1322 CBlock* pblock2 = new CBlock(*pblock);
1323 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1324 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1326 // Ask this guy to fill in what we're missing
1328 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1333 if (!pblock->AcceptBlock())
1334 return error("ProcessBlock() : AcceptBlock FAILED");
1336 // Recursively process any orphan blocks that depended on this one
1337 vector<uint256> vWorkQueue;
1338 vWorkQueue.push_back(hash);
1339 for (int i = 0; i < vWorkQueue.size(); i++)
1341 uint256 hashPrev = vWorkQueue[i];
1342 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1343 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1346 CBlock* pblockOrphan = (*mi).second;
1347 if (pblockOrphan->AcceptBlock())
1348 vWorkQueue.push_back(pblockOrphan->GetHash());
1349 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1350 delete pblockOrphan;
1352 mapOrphanBlocksByPrev.erase(hashPrev);
1355 printf("ProcessBlock: ACCEPTED\n");
1366 template<typename Stream>
1367 bool static ScanMessageStart(Stream& s)
1369 // Scan ahead to the next pchMessageStart, which should normally be immediately
1370 // at the file pointer. Leaves file pointer at end of pchMessageStart.
1372 short prevmask = s.exceptions(0);
1373 const char* p = BEGIN(pchMessageStart);
1383 s.exceptions(prevmask);
1387 p = BEGIN(pchMessageStart);
1390 if (++p == END(pchMessageStart))
1393 s.exceptions(prevmask);
1402 s.exceptions(prevmask);
1407 bool CheckDiskSpace(uint64 nAdditionalBytes)
1409 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1411 // Check for 15MB because database could create another 10MB log file at any time
1412 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1415 string strMessage = _("Warning: Disk space is low ");
1416 strMiscWarning = strMessage;
1417 printf("*** %s\n", strMessage.c_str());
1418 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1419 CreateThread(Shutdown, NULL);
1425 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1429 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1432 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1434 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1443 static unsigned int nCurrentBlockFile = 1;
1445 FILE* AppendBlockFile(unsigned int& nFileRet)
1450 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1453 if (fseek(file, 0, SEEK_END) != 0)
1455 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1456 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1458 nFileRet = nCurrentBlockFile;
1462 nCurrentBlockFile++;
1466 bool LoadBlockIndex(bool fAllowNew)
1470 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1471 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1472 pchMessageStart[0] = 0xfa;
1473 pchMessageStart[1] = 0xbf;
1474 pchMessageStart[2] = 0xb5;
1475 pchMessageStart[3] = 0xda;
1482 if (!txdb.LoadBlockIndex())
1487 // Init with genesis block
1489 if (mapBlockIndex.empty())
1495 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1496 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1497 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1498 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1499 // vMerkleTree: 4a5e1e
1502 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1504 txNew.vin.resize(1);
1505 txNew.vout.resize(1);
1506 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1507 txNew.vout[0].nValue = 50 * COIN;
1508 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1510 block.vtx.push_back(txNew);
1511 block.hashPrevBlock = 0;
1512 block.hashMerkleRoot = block.BuildMerkleTree();
1514 block.nTime = 1231006505;
1515 block.nBits = 0x1d00ffff;
1516 block.nNonce = 2083236893;
1520 block.nTime = 1296688602;
1521 block.nBits = 0x1d07fff8;
1522 block.nNonce = 384568319;
1526 printf("%s\n", block.GetHash().ToString().c_str());
1527 printf("%s\n", hashGenesisBlock.ToString().c_str());
1528 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1529 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1531 assert(block.GetHash() == hashGenesisBlock);
1533 // Start new block file
1535 unsigned int nBlockPos;
1536 if (!block.WriteToDisk(nFile, nBlockPos))
1537 return error("LoadBlockIndex() : writing genesis block to disk failed");
1538 if (!block.AddToBlockIndex(nFile, nBlockPos))
1539 return error("LoadBlockIndex() : genesis block not accepted");
1547 void PrintBlockTree()
1549 // precompute tree structure
1550 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1551 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1553 CBlockIndex* pindex = (*mi).second;
1554 mapNext[pindex->pprev].push_back(pindex);
1556 //while (rand() % 3 == 0)
1557 // mapNext[pindex->pprev].push_back(pindex);
1560 vector<pair<int, CBlockIndex*> > vStack;
1561 vStack.push_back(make_pair(0, pindexGenesisBlock));
1564 while (!vStack.empty())
1566 int nCol = vStack.back().first;
1567 CBlockIndex* pindex = vStack.back().second;
1570 // print split or gap
1571 if (nCol > nPrevCol)
1573 for (int i = 0; i < nCol-1; i++)
1577 else if (nCol < nPrevCol)
1579 for (int i = 0; i < nCol; i++)
1586 for (int i = 0; i < nCol; i++)
1591 block.ReadFromDisk(pindex);
1592 printf("%d (%u,%u) %s %s tx %d",
1596 block.GetHash().ToString().substr(0,20).c_str(),
1597 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1600 PrintWallets(block);
1602 // put the main timechain first
1603 vector<CBlockIndex*>& vNext = mapNext[pindex];
1604 for (int i = 0; i < vNext.size(); i++)
1606 if (vNext[i]->pnext)
1608 swap(vNext[0], vNext[i]);
1614 for (int i = 0; i < vNext.size(); i++)
1615 vStack.push_back(make_pair(nCol+i, vNext[i]));
1628 //////////////////////////////////////////////////////////////////////////////
1633 map<uint256, CAlert> mapAlerts;
1634 CCriticalSection cs_mapAlerts;
1636 string GetWarnings(string strFor)
1639 string strStatusBar;
1641 if (GetBoolArg("-testsafemode"))
1644 // Misc warnings like out of disk space and clock is wrong
1645 if (strMiscWarning != "")
1648 strStatusBar = strMiscWarning;
1651 // Longer invalid proof-of-work chain
1652 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1655 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1659 CRITICAL_BLOCK(cs_mapAlerts)
1661 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1663 const CAlert& alert = item.second;
1664 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1666 nPriority = alert.nPriority;
1667 strStatusBar = alert.strStatusBar;
1672 if (strFor == "statusbar")
1673 return strStatusBar;
1674 else if (strFor == "rpc")
1676 assert(("GetWarnings() : invalid parameter", false));
1680 bool CAlert::ProcessAlert()
1682 if (!CheckSignature())
1687 CRITICAL_BLOCK(cs_mapAlerts)
1689 // Cancel previous alerts
1690 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1692 const CAlert& alert = (*mi).second;
1695 printf("cancelling alert %d\n", alert.nID);
1696 mapAlerts.erase(mi++);
1698 else if (!alert.IsInEffect())
1700 printf("expiring alert %d\n", alert.nID);
1701 mapAlerts.erase(mi++);
1707 // Check if this alert has been cancelled
1708 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1710 const CAlert& alert = item.second;
1711 if (alert.Cancels(*this))
1713 printf("alert already cancelled by %d\n", alert.nID);
1719 mapAlerts.insert(make_pair(GetHash(), *this));
1722 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1734 //////////////////////////////////////////////////////////////////////////////
1740 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1744 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1745 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1747 // Don't know what it is, just say we already got one
1754 // The message start string is designed to be unlikely to occur in normal data.
1755 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1756 // a large 4-byte int at any alignment.
1757 char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1760 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1762 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1763 RandAddSeedPerfmon();
1765 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1766 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1767 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1769 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1777 if (strCommand == "version")
1779 // Each connection can only send one version message
1780 if (pfrom->nVersion != 0)
1787 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1788 if (pfrom->nVersion == 10300)
1789 pfrom->nVersion = 300;
1790 if (pfrom->nVersion >= 106 && !vRecv.empty())
1791 vRecv >> addrFrom >> nNonce;
1792 if (pfrom->nVersion >= 106 && !vRecv.empty())
1793 vRecv >> pfrom->strSubVer;
1794 if (pfrom->nVersion >= 209 && !vRecv.empty())
1795 vRecv >> pfrom->nStartingHeight;
1797 if (pfrom->nVersion == 0)
1800 // Disconnect if we connected to ourself
1801 if (nNonce == nLocalHostNonce && nNonce > 1)
1803 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1804 pfrom->fDisconnect = true;
1808 // Be shy and don't send version until we hear
1809 if (pfrom->fInbound)
1810 pfrom->PushVersion();
1812 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1814 AddTimeData(pfrom->addr.ip, nTime);
1817 if (pfrom->nVersion >= 209)
1818 pfrom->PushMessage("verack");
1819 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1820 if (pfrom->nVersion < 209)
1821 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1823 if (!pfrom->fInbound)
1825 // Advertise our address
1826 if (addrLocalHost.IsRoutable() && !fUseProxy)
1828 CAddress addr(addrLocalHost);
1829 addr.nTime = GetAdjustedTime();
1830 pfrom->PushAddress(addr);
1833 // Get recent addresses
1834 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1836 pfrom->PushMessage("getaddr");
1837 pfrom->fGetAddr = true;
1841 // Ask the first connected node for block updates
1842 static int nAskedForBlocks;
1843 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
1846 pfrom->PushGetBlocks(pindexBest, uint256(0));
1850 CRITICAL_BLOCK(cs_mapAlerts)
1851 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1852 item.second.RelayTo(pfrom);
1854 pfrom->fSuccessfullyConnected = true;
1856 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1860 else if (pfrom->nVersion == 0)
1862 // Must have a version message before anything else
1867 else if (strCommand == "verack")
1869 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1873 else if (strCommand == "addr")
1875 vector<CAddress> vAddr;
1878 // Don't want addr from older versions unless seeding
1879 if (pfrom->nVersion < 209)
1881 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1883 if (vAddr.size() > 1000)
1884 return error("message addr size() = %d", vAddr.size());
1886 // Store the new addresses
1887 int64 nNow = GetAdjustedTime();
1888 int64 nSince = nNow - 10 * 60;
1889 BOOST_FOREACH(CAddress& addr, vAddr)
1893 // ignore IPv6 for now, since it isn't implemented anyway
1896 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1897 addr.nTime = nNow - 5 * 24 * 60 * 60;
1898 AddAddress(addr, 2 * 60 * 60);
1899 pfrom->AddAddressKnown(addr);
1900 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1902 // Relay to a limited number of other nodes
1903 CRITICAL_BLOCK(cs_vNodes)
1905 // Use deterministic randomness to send to the same nodes for 24 hours
1906 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1907 static uint256 hashSalt;
1909 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1910 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1911 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1912 multimap<uint256, CNode*> mapMix;
1913 BOOST_FOREACH(CNode* pnode, vNodes)
1915 if (pnode->nVersion < 31402)
1917 unsigned int nPointer;
1918 memcpy(&nPointer, &pnode, sizeof(nPointer));
1919 uint256 hashKey = hashRand ^ nPointer;
1920 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1921 mapMix.insert(make_pair(hashKey, pnode));
1923 int nRelayNodes = 2;
1924 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1925 ((*mi).second)->PushAddress(addr);
1929 if (vAddr.size() < 1000)
1930 pfrom->fGetAddr = false;
1934 else if (strCommand == "inv")
1938 if (vInv.size() > 50000)
1939 return error("message inv size() = %d", vInv.size());
1942 BOOST_FOREACH(const CInv& inv, vInv)
1946 pfrom->AddInventoryKnown(inv);
1948 bool fAlreadyHave = AlreadyHave(txdb, inv);
1949 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1953 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1954 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1956 // Track requests for our stuff
1957 Inventory(inv.hash);
1962 else if (strCommand == "getdata")
1966 if (vInv.size() > 50000)
1967 return error("message getdata size() = %d", vInv.size());
1969 BOOST_FOREACH(const CInv& inv, vInv)
1973 printf("received getdata for: %s\n", inv.ToString().c_str());
1975 if (inv.type == MSG_BLOCK)
1977 // Send block from disk
1978 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1979 if (mi != mapBlockIndex.end())
1982 block.ReadFromDisk((*mi).second);
1983 pfrom->PushMessage("block", block);
1985 // Trigger them to send a getblocks request for the next batch of inventory
1986 if (inv.hash == pfrom->hashContinue)
1988 // Bypass PushInventory, this must send even if redundant,
1989 // and we want it right after the last block so they don't
1990 // wait for other stuff first.
1992 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
1993 pfrom->PushMessage("inv", vInv);
1994 pfrom->hashContinue = 0;
1998 else if (inv.IsKnownType())
2000 // Send stream from relay memory
2001 CRITICAL_BLOCK(cs_mapRelay)
2003 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2004 if (mi != mapRelay.end())
2005 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2009 // Track requests for our stuff
2010 Inventory(inv.hash);
2015 else if (strCommand == "getblocks")
2017 CBlockLocator locator;
2019 vRecv >> locator >> hashStop;
2021 // Find the last block the caller has in the main chain
2022 CBlockIndex* pindex = locator.GetBlockIndex();
2024 // Send the rest of the chain
2026 pindex = pindex->pnext;
2027 int nLimit = 500 + locator.GetDistanceBack();
2028 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2029 for (; pindex; pindex = pindex->pnext)
2031 if (pindex->GetBlockHash() == hashStop)
2033 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2036 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2039 // When this block is requested, we'll send an inv that'll make them
2040 // getblocks the next batch of inventory.
2041 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2042 pfrom->hashContinue = pindex->GetBlockHash();
2049 else if (strCommand == "getheaders")
2051 CBlockLocator locator;
2053 vRecv >> locator >> hashStop;
2055 CBlockIndex* pindex = NULL;
2056 if (locator.IsNull())
2058 // If locator is null, return the hashStop block
2059 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2060 if (mi == mapBlockIndex.end())
2062 pindex = (*mi).second;
2066 // Find the last block the caller has in the main chain
2067 pindex = locator.GetBlockIndex();
2069 pindex = pindex->pnext;
2072 vector<CBlock> vHeaders;
2073 int nLimit = 2000 + locator.GetDistanceBack();
2074 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2075 for (; pindex; pindex = pindex->pnext)
2077 vHeaders.push_back(pindex->GetBlockHeader());
2078 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2081 pfrom->PushMessage("headers", vHeaders);
2085 else if (strCommand == "tx")
2087 vector<uint256> vWorkQueue;
2088 CDataStream vMsg(vRecv);
2092 CInv inv(MSG_TX, tx.GetHash());
2093 pfrom->AddInventoryKnown(inv);
2095 bool fMissingInputs = false;
2096 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2098 SyncWithWallets(tx, NULL, true);
2099 RelayMessage(inv, vMsg);
2100 mapAlreadyAskedFor.erase(inv);
2101 vWorkQueue.push_back(inv.hash);
2103 // Recursively process any orphan transactions that depended on this one
2104 for (int i = 0; i < vWorkQueue.size(); i++)
2106 uint256 hashPrev = vWorkQueue[i];
2107 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2108 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2111 const CDataStream& vMsg = *((*mi).second);
2113 CDataStream(vMsg) >> tx;
2114 CInv inv(MSG_TX, tx.GetHash());
2116 if (tx.AcceptToMemoryPool(true))
2118 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2119 SyncWithWallets(tx, NULL, true);
2120 RelayMessage(inv, vMsg);
2121 mapAlreadyAskedFor.erase(inv);
2122 vWorkQueue.push_back(inv.hash);
2127 BOOST_FOREACH(uint256 hash, vWorkQueue)
2128 EraseOrphanTx(hash);
2130 else if (fMissingInputs)
2132 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2138 else if (strCommand == "block")
2143 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2146 CInv inv(MSG_BLOCK, block.GetHash());
2147 pfrom->AddInventoryKnown(inv);
2149 if (ProcessBlock(pfrom, &block))
2150 mapAlreadyAskedFor.erase(inv);
2154 else if (strCommand == "getaddr")
2156 // Nodes rebroadcast an addr every 24 hours
2157 pfrom->vAddrToSend.clear();
2158 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2159 CRITICAL_BLOCK(cs_mapAddresses)
2161 unsigned int nCount = 0;
2162 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2164 const CAddress& addr = item.second;
2165 if (addr.nTime > nSince)
2168 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2170 const CAddress& addr = item.second;
2171 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2172 pfrom->PushAddress(addr);
2178 else if (strCommand == "checkorder")
2183 if (!GetBoolArg("-allowreceivebyip"))
2185 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2192 /// we have a chance to check the order here
2194 // Keep giving the same key to the same ip until they use it
2195 if (!mapReuseKey.count(pfrom->addr.ip))
2196 mapReuseKey[pfrom->addr.ip] = pwalletMain->GetKeyFromKeyPool();
2198 // Send back approval of order and pubkey to use
2199 CScript scriptPubKey;
2200 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2201 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2205 else if (strCommand == "reply")
2210 CRequestTracker tracker;
2211 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2213 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2214 if (mi != pfrom->mapRequests.end())
2216 tracker = (*mi).second;
2217 pfrom->mapRequests.erase(mi);
2220 if (!tracker.IsNull())
2221 tracker.fn(tracker.param1, vRecv);
2225 else if (strCommand == "ping")
2230 else if (strCommand == "alert")
2235 if (alert.ProcessAlert())
2238 pfrom->setKnown.insert(alert.GetHash());
2239 CRITICAL_BLOCK(cs_vNodes)
2240 BOOST_FOREACH(CNode* pnode, vNodes)
2241 alert.RelayTo(pnode);
2248 // Ignore unknown commands for extensibility
2252 // Update the last seen time for this node's address
2253 if (pfrom->fNetworkNode)
2254 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2255 AddressCurrentlyConnected(pfrom->addr);
2261 bool ProcessMessages(CNode* pfrom)
2263 CDataStream& vRecv = pfrom->vRecv;
2267 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2271 // (4) message start
2280 // Scan for message start
2281 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2282 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2283 if (vRecv.end() - pstart < nHeaderSize)
2285 if (vRecv.size() > nHeaderSize)
2287 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2288 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2292 if (pstart - vRecv.begin() > 0)
2293 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2294 vRecv.erase(vRecv.begin(), pstart);
2297 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2302 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2305 string strCommand = hdr.GetCommand();
2308 unsigned int nMessageSize = hdr.nMessageSize;
2309 if (nMessageSize > MAX_SIZE)
2311 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2314 if (nMessageSize > vRecv.size())
2316 // Rewind and wait for rest of message
2317 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2322 if (vRecv.GetVersion() >= 209)
2324 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2325 unsigned int nChecksum = 0;
2326 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2327 if (nChecksum != hdr.nChecksum)
2329 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2330 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2335 // Copy message to its own buffer
2336 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2337 vRecv.ignore(nMessageSize);
2343 CRITICAL_BLOCK(cs_main)
2344 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2348 catch (std::ios_base::failure& e)
2350 if (strstr(e.what(), "end of data"))
2352 // Allow exceptions from underlength message on vRecv
2353 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());
2355 else if (strstr(e.what(), "size too large"))
2357 // Allow exceptions from overlong size
2358 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2362 PrintExceptionContinue(&e, "ProcessMessage()");
2365 catch (std::exception& e) {
2366 PrintExceptionContinue(&e, "ProcessMessage()");
2368 PrintExceptionContinue(NULL, "ProcessMessage()");
2372 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2380 bool SendMessages(CNode* pto, bool fSendTrickle)
2382 CRITICAL_BLOCK(cs_main)
2384 // Don't send anything until we get their version message
2385 if (pto->nVersion == 0)
2389 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2390 pto->PushMessage("ping");
2392 // Resend wallet transactions that haven't gotten in a block yet
2393 ResendWalletTransactions();
2395 // Address refresh broadcast
2396 static int64 nLastRebroadcast;
2397 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2399 nLastRebroadcast = GetTime();
2400 CRITICAL_BLOCK(cs_vNodes)
2402 BOOST_FOREACH(CNode* pnode, vNodes)
2404 // Periodically clear setAddrKnown to allow refresh broadcasts
2405 pnode->setAddrKnown.clear();
2407 // Rebroadcast our address
2408 if (addrLocalHost.IsRoutable() && !fUseProxy)
2410 CAddress addr(addrLocalHost);
2411 addr.nTime = GetAdjustedTime();
2412 pnode->PushAddress(addr);
2418 // Clear out old addresses periodically so it's not too much work at once
2419 static int64 nLastClear;
2420 if (nLastClear == 0)
2421 nLastClear = GetTime();
2422 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2424 nLastClear = GetTime();
2425 CRITICAL_BLOCK(cs_mapAddresses)
2428 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2429 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2430 mi != mapAddresses.end();)
2432 const CAddress& addr = (*mi).second;
2433 if (addr.nTime < nSince)
2435 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2437 addrdb.EraseAddress(addr);
2438 mapAddresses.erase(mi++);
2452 vector<CAddress> vAddr;
2453 vAddr.reserve(pto->vAddrToSend.size());
2454 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2456 // returns true if wasn't already contained in the set
2457 if (pto->setAddrKnown.insert(addr).second)
2459 vAddr.push_back(addr);
2460 // receiver rejects addr messages larger than 1000
2461 if (vAddr.size() >= 1000)
2463 pto->PushMessage("addr", vAddr);
2468 pto->vAddrToSend.clear();
2470 pto->PushMessage("addr", vAddr);
2475 // Message: inventory
2478 vector<CInv> vInvWait;
2479 CRITICAL_BLOCK(pto->cs_inventory)
2481 vInv.reserve(pto->vInventoryToSend.size());
2482 vInvWait.reserve(pto->vInventoryToSend.size());
2483 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2485 if (pto->setInventoryKnown.count(inv))
2488 // trickle out tx inv to protect privacy
2489 if (inv.type == MSG_TX && !fSendTrickle)
2491 // 1/4 of tx invs blast to all immediately
2492 static uint256 hashSalt;
2494 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2495 uint256 hashRand = inv.hash ^ hashSalt;
2496 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2497 bool fTrickleWait = ((hashRand & 3) != 0);
2499 // always trickle our own transactions
2503 if (GetTransaction(inv.hash, wtx))
2505 fTrickleWait = true;
2510 vInvWait.push_back(inv);
2515 // returns true if wasn't already contained in the set
2516 if (pto->setInventoryKnown.insert(inv).second)
2518 vInv.push_back(inv);
2519 if (vInv.size() >= 1000)
2521 pto->PushMessage("inv", vInv);
2526 pto->vInventoryToSend = vInvWait;
2529 pto->PushMessage("inv", vInv);
2535 vector<CInv> vGetData;
2536 int64 nNow = GetTime() * 1000000;
2538 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2540 const CInv& inv = (*pto->mapAskFor.begin()).second;
2541 if (!AlreadyHave(txdb, inv))
2543 printf("sending getdata: %s\n", inv.ToString().c_str());
2544 vGetData.push_back(inv);
2545 if (vGetData.size() >= 1000)
2547 pto->PushMessage("getdata", vGetData);
2551 pto->mapAskFor.erase(pto->mapAskFor.begin());
2553 if (!vGetData.empty())
2554 pto->PushMessage("getdata", vGetData);
2573 //////////////////////////////////////////////////////////////////////////////
2578 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2580 unsigned char* pdata = (unsigned char*)pbuffer;
2581 unsigned int blocks = 1 + ((len + 8) / 64);
2582 unsigned char* pend = pdata + 64 * blocks;
2583 memset(pdata + len, 0, 64 * blocks - len);
2585 unsigned int bits = len * 8;
2586 pend[-1] = (bits >> 0) & 0xff;
2587 pend[-2] = (bits >> 8) & 0xff;
2588 pend[-3] = (bits >> 16) & 0xff;
2589 pend[-4] = (bits >> 24) & 0xff;
2593 using CryptoPP::ByteReverse;
2595 static const unsigned int pSHA256InitState[8] =
2596 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2598 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2600 memcpy(pstate, pinit, 32);
2601 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2605 // ScanHash scans nonces looking for a hash with at least some zero bits.
2606 // It operates on big endian data. Caller does the byte reversing.
2607 // All input buffers are 16-byte aligned. nNonce is usually preserved
2608 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2609 // the block is rebuilt and nNonce starts over at zero.
2611 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2613 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2617 // Hash pdata using pmidstate as the starting state into
2618 // preformatted buffer phash1, then hash phash1 into phash
2620 SHA256Transform(phash1, pdata, pmidstate);
2621 SHA256Transform(phash, phash1, pSHA256InitState);
2623 // Return the nonce if the hash has at least some zero bits,
2624 // caller will check if it has enough to reach the target
2625 if (((unsigned short*)phash)[14] == 0)
2628 // If nothing found after trying for a while, return -1
2629 if ((nNonce & 0xffff) == 0)
2631 nHashesDone = 0xffff+1;
2642 set<uint256> setDependsOn;
2645 COrphan(CTransaction* ptxIn)
2653 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2654 BOOST_FOREACH(uint256 hash, setDependsOn)
2655 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2660 CBlock* CreateNewBlock(CReserveKey& reservekey)
2662 CBlockIndex* pindexPrev = pindexBest;
2665 auto_ptr<CBlock> pblock(new CBlock());
2669 // Create coinbase tx
2671 txNew.vin.resize(1);
2672 txNew.vin[0].prevout.SetNull();
2673 txNew.vout.resize(1);
2674 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2676 // Add our coinbase tx as first transaction
2677 pblock->vtx.push_back(txNew);
2679 // Collect memory pool transactions into the block
2681 CRITICAL_BLOCK(cs_main)
2682 CRITICAL_BLOCK(cs_mapTransactions)
2686 // Priority order to process transactions
2687 list<COrphan> vOrphan; // list memory doesn't move
2688 map<uint256, vector<COrphan*> > mapDependers;
2689 multimap<double, CTransaction*> mapPriority;
2690 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2692 CTransaction& tx = (*mi).second;
2693 if (tx.IsCoinBase() || !tx.IsFinal())
2696 COrphan* porphan = NULL;
2697 double dPriority = 0;
2698 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2700 // Read prev transaction
2701 CTransaction txPrev;
2703 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2705 // Has to wait for dependencies
2708 // Use list for automatic deletion
2709 vOrphan.push_back(COrphan(&tx));
2710 porphan = &vOrphan.back();
2712 mapDependers[txin.prevout.hash].push_back(porphan);
2713 porphan->setDependsOn.insert(txin.prevout.hash);
2716 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2718 // Read block header
2719 int nConf = txindex.GetDepthInMainChain();
2721 dPriority += (double)nValueIn * nConf;
2723 if (fDebug && GetBoolArg("-printpriority"))
2724 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2727 // Priority is sum(valuein * age) / txsize
2728 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2731 porphan->dPriority = dPriority;
2733 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2735 if (fDebug && GetBoolArg("-printpriority"))
2737 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2744 // Collect transactions into block
2745 map<uint256, CTxIndex> mapTestPool;
2746 uint64 nBlockSize = 1000;
2747 int nBlockSigOps = 100;
2748 while (!mapPriority.empty())
2750 // Take highest priority transaction off priority queue
2751 double dPriority = -(*mapPriority.begin()).first;
2752 CTransaction& tx = *(*mapPriority.begin()).second;
2753 mapPriority.erase(mapPriority.begin());
2756 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2757 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2759 int nTxSigOps = tx.GetSigOpCount();
2760 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2763 // Transaction fee required depends on block size
2764 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2765 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2767 // Connecting shouldn't fail due to dependency on other memory pool transactions
2768 // because we're already processing them in order of dependency
2769 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2770 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2772 swap(mapTestPool, mapTestPoolTmp);
2775 pblock->vtx.push_back(tx);
2776 nBlockSize += nTxSize;
2777 nBlockSigOps += nTxSigOps;
2779 // Add transactions that depend on this one to the priority queue
2780 uint256 hash = tx.GetHash();
2781 if (mapDependers.count(hash))
2783 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2785 if (!porphan->setDependsOn.empty())
2787 porphan->setDependsOn.erase(hash);
2788 if (porphan->setDependsOn.empty())
2789 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2795 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2798 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2799 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2800 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2801 pblock->nBits = GetNextWorkRequired(pindexPrev);
2804 return pblock.release();
2808 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
2810 // Update nExtraNonce
2811 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2812 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
2817 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << 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_mapRequestCount)
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;
2915 int64 nPrevTime = 0;
2917 while (fGenerateBitcoins)
2919 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2923 while (vNodes.empty() || IsInitialBlockDownload())
2928 if (!fGenerateBitcoins)
2936 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2937 CBlockIndex* pindexPrev = pindexBest;
2939 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2942 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
2944 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2948 // Prebuild hash buffers
2950 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2951 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2952 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2954 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2956 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2957 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2963 int64 nStart = GetTime();
2964 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2966 uint256& hash = *alignup<16>(hashbuf);
2969 unsigned int nHashesDone = 0;
2970 unsigned int nNonceFound;
2973 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2974 (char*)&hash, nHashesDone);
2976 // Check if something found
2977 if (nNonceFound != -1)
2979 for (int i = 0; i < sizeof(hash)/4; i++)
2980 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2982 if (hash <= hashTarget)
2985 pblock->nNonce = ByteReverse(nNonceFound);
2986 assert(hash == pblock->GetHash());
2988 SetThreadPriority(THREAD_PRIORITY_NORMAL);
2989 CheckWork(pblock.get(), *pwalletMain, reservekey);
2990 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2996 static int64 nHashCounter;
2997 if (nHPSTimerStart == 0)
2999 nHPSTimerStart = GetTimeMillis();
3003 nHashCounter += nHashesDone;
3004 if (GetTimeMillis() - nHPSTimerStart > 4000)
3006 static CCriticalSection cs;
3009 if (GetTimeMillis() - nHPSTimerStart > 4000)
3011 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3012 nHPSTimerStart = GetTimeMillis();
3014 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3015 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3016 static int64 nLogTime;
3017 if (GetTime() - nLogTime > 30 * 60)
3019 nLogTime = GetTime();
3020 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3021 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3027 // Check for stop or if block needs to be rebuilt
3030 if (!fGenerateBitcoins)
3032 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3036 if (nBlockNonce >= 0xffff0000)
3038 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3040 if (pindexPrev != pindexBest)
3043 // Update nTime every few seconds
3044 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3045 nBlockTime = ByteReverse(pblock->nTime);
3050 void static ThreadBitcoinMiner(void* parg)
3052 CWallet* pwallet = (CWallet*)parg;
3055 vnThreadsRunning[3]++;
3056 BitcoinMiner(pwallet);
3057 vnThreadsRunning[3]--;
3059 catch (std::exception& e) {
3060 vnThreadsRunning[3]--;
3061 PrintException(&e, "ThreadBitcoinMiner()");
3063 vnThreadsRunning[3]--;
3064 PrintException(NULL, "ThreadBitcoinMiner()");
3066 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3068 if (vnThreadsRunning[3] == 0)
3070 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3074 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3076 if (fGenerateBitcoins != fGenerate)
3078 fGenerateBitcoins = fGenerate;
3079 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3082 if (fGenerateBitcoins)
3084 int nProcessors = boost::thread::hardware_concurrency();
3085 printf("%d processors\n", nProcessors);
3086 if (nProcessors < 1)
3088 if (fLimitProcessors && nProcessors > nLimitProcessors)
3089 nProcessors = nLimitProcessors;
3090 int nAddThreads = nProcessors - vnThreadsRunning[3];
3091 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3092 for (int i = 0; i < nAddThreads; i++)
3094 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3095 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");