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.
6 #include "checkpoints.h"
10 #include "cryptopp/sha.h"
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
26 static map<uint256, CTransaction> mapTransactions;
27 CCriticalSection cs_mapTransactions;
28 unsigned int nTransactionsUpdated = 0;
29 map<COutPoint, CInPoint> mapNextTx;
31 map<uint256, CBlockIndex*> mapBlockIndex;
32 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 CBigNum bnBestChainWork = 0;
38 CBigNum bnBestInvalidWork = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
54 int fGenerateBitcoins = false;
55 int64 nTransactionFee = 0;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void 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 error("CTransaction::CheckTransaction() : vin empty");
301 return error("CTransaction::CheckTransaction() : 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");
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 error("CTransaction::CheckTransaction() : coinbase script size");
335 BOOST_FOREACH(const CTxIn& txin, vin)
336 if (txin.prevout.IsNull())
337 return 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 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 error("AcceptToMemoryPool() : nonstandard transaction");
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 bool IsInitialBlockDownload()
718 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
720 static int64 nLastUpdate;
721 static CBlockIndex* pindexLastBest;
722 if (pindexBest != pindexLastBest)
724 pindexLastBest = pindexBest;
725 nLastUpdate = GetTime();
727 return (GetTime() - nLastUpdate < 10 &&
728 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
731 void static InvalidChainFound(CBlockIndex* pindexNew)
733 if (pindexNew->bnChainWork > bnBestInvalidWork)
735 bnBestInvalidWork = pindexNew->bnChainWork;
736 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
739 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());
740 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
741 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
742 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
755 bool CTransaction::DisconnectInputs(CTxDB& txdb)
757 // Relinquish previous transactions' spent pointers
760 BOOST_FOREACH(const CTxIn& txin, vin)
762 COutPoint prevout = txin.prevout;
764 // Get prev txindex from disk
766 if (!txdb.ReadTxIndex(prevout.hash, txindex))
767 return error("DisconnectInputs() : ReadTxIndex failed");
769 if (prevout.n >= txindex.vSpent.size())
770 return error("DisconnectInputs() : prevout.n out of range");
772 // Mark outpoint as not spent
773 txindex.vSpent[prevout.n].SetNull();
776 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
777 return error("DisconnectInputs() : UpdateTxIndex failed");
781 // Remove transaction from index
782 if (!txdb.EraseTxIndex(*this))
783 return error("DisconnectInputs() : EraseTxPos failed");
789 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
790 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
792 // Take over previous transactions' spent pointers
796 for (int i = 0; i < vin.size(); i++)
798 COutPoint prevout = vin[i].prevout;
803 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
805 // Get txindex from current proposed changes
806 txindex = mapTestPool[prevout.hash];
810 // Read txindex from txdb
811 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
813 if (!fFound && (fBlock || fMiner))
814 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());
818 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
820 // Get prev tx from single transactions in memory
821 CRITICAL_BLOCK(cs_mapTransactions)
823 if (!mapTransactions.count(prevout.hash))
824 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
825 txPrev = mapTransactions[prevout.hash];
828 txindex.vSpent.resize(txPrev.vout.size());
832 // Get prev tx from disk
833 if (!txPrev.ReadFromDisk(txindex.pos))
834 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
837 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
838 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());
840 // If prev is coinbase, check that it's matured
841 if (txPrev.IsCoinBase())
842 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
843 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
844 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
847 if (!VerifySignature(txPrev, *this, i))
848 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
850 // Check for conflicts
851 if (!txindex.vSpent[prevout.n].IsNull())
852 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());
854 // Check for negative or overflow input values
855 nValueIn += txPrev.vout[prevout.n].nValue;
856 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
857 return error("ConnectInputs() : txin values out of range");
859 // Mark outpoints as spent
860 txindex.vSpent[prevout.n] = posThisTx;
863 if (fBlock || fMiner)
865 mapTestPool[prevout.hash] = txindex;
869 if (nValueIn < GetValueOut())
870 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
872 // Tally transaction fees
873 int64 nTxFee = nValueIn - GetValueOut();
875 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
876 if (nTxFee < nMinFee)
879 if (!MoneyRange(nFees))
880 return error("ConnectInputs() : nFees out of range");
885 // Add transaction to changes
886 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
890 // Add transaction to test pool
891 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
898 bool CTransaction::ClientConnectInputs()
903 // Take over previous transactions' spent pointers
904 CRITICAL_BLOCK(cs_mapTransactions)
907 for (int i = 0; i < vin.size(); i++)
909 // Get prev tx from single transactions in memory
910 COutPoint prevout = vin[i].prevout;
911 if (!mapTransactions.count(prevout.hash))
913 CTransaction& txPrev = mapTransactions[prevout.hash];
915 if (prevout.n >= txPrev.vout.size())
919 if (!VerifySignature(txPrev, *this, i))
920 return error("ConnectInputs() : VerifySignature failed");
922 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
923 ///// this has to go away now that posNext is gone
924 // // Check for conflicts
925 // if (!txPrev.vout[prevout.n].posNext.IsNull())
926 // return error("ConnectInputs() : prev tx already used");
928 // // Flag outpoints as used
929 // txPrev.vout[prevout.n].posNext = posThisTx;
931 nValueIn += txPrev.vout[prevout.n].nValue;
933 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
934 return error("ClientConnectInputs() : txin values out of range");
936 if (GetValueOut() > nValueIn)
946 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
948 // Disconnect in reverse order
949 for (int i = vtx.size()-1; i >= 0; i--)
950 if (!vtx[i].DisconnectInputs(txdb))
953 // Update block index on disk without changing it in memory.
954 // The memory index structure will be changed after the db commits.
957 CDiskBlockIndex blockindexPrev(pindex->pprev);
958 blockindexPrev.hashNext = 0;
959 if (!txdb.WriteBlockIndex(blockindexPrev))
960 return error("DisconnectBlock() : WriteBlockIndex failed");
966 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
968 // Check it again in case a previous version let a bad block in
972 //// issue here: it doesn't know the version
973 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
975 map<uint256, CTxIndex> mapQueuedChanges;
977 BOOST_FOREACH(CTransaction& tx, vtx)
979 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
980 nTxPos += ::GetSerializeSize(tx, SER_DISK);
982 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
985 // Write queued txindex changes
986 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
988 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
989 return error("ConnectBlock() : UpdateTxIndex failed");
992 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
995 // Update block index on disk without changing it in memory.
996 // The memory index structure will be changed after the db commits.
999 CDiskBlockIndex blockindexPrev(pindex->pprev);
1000 blockindexPrev.hashNext = pindex->GetBlockHash();
1001 if (!txdb.WriteBlockIndex(blockindexPrev))
1002 return error("ConnectBlock() : WriteBlockIndex failed");
1005 // Watch for transactions paying to me
1006 BOOST_FOREACH(CTransaction& tx, vtx)
1007 SyncWithWallets(tx, this, true);
1012 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1014 printf("REORGANIZE\n");
1017 CBlockIndex* pfork = pindexBest;
1018 CBlockIndex* plonger = pindexNew;
1019 while (pfork != plonger)
1021 while (plonger->nHeight > pfork->nHeight)
1022 if (!(plonger = plonger->pprev))
1023 return error("Reorganize() : plonger->pprev is null");
1024 if (pfork == plonger)
1026 if (!(pfork = pfork->pprev))
1027 return error("Reorganize() : pfork->pprev is null");
1030 // List of what to disconnect
1031 vector<CBlockIndex*> vDisconnect;
1032 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1033 vDisconnect.push_back(pindex);
1035 // List of what to connect
1036 vector<CBlockIndex*> vConnect;
1037 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1038 vConnect.push_back(pindex);
1039 reverse(vConnect.begin(), vConnect.end());
1041 // Disconnect shorter branch
1042 vector<CTransaction> vResurrect;
1043 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1046 if (!block.ReadFromDisk(pindex))
1047 return error("Reorganize() : ReadFromDisk for disconnect failed");
1048 if (!block.DisconnectBlock(txdb, pindex))
1049 return error("Reorganize() : DisconnectBlock failed");
1051 // Queue memory transactions to resurrect
1052 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1053 if (!tx.IsCoinBase())
1054 vResurrect.push_back(tx);
1057 // Connect longer branch
1058 vector<CTransaction> vDelete;
1059 for (int i = 0; i < vConnect.size(); i++)
1061 CBlockIndex* pindex = vConnect[i];
1063 if (!block.ReadFromDisk(pindex))
1064 return error("Reorganize() : ReadFromDisk for connect failed");
1065 if (!block.ConnectBlock(txdb, pindex))
1069 return error("Reorganize() : ConnectBlock failed");
1072 // Queue memory transactions to delete
1073 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1074 vDelete.push_back(tx);
1076 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1077 return error("Reorganize() : WriteHashBestChain failed");
1079 // Make sure it's successfully written to disk before changing memory structure
1080 if (!txdb.TxnCommit())
1081 return error("Reorganize() : TxnCommit failed");
1083 // Disconnect shorter branch
1084 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1086 pindex->pprev->pnext = NULL;
1088 // Connect longer branch
1089 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1091 pindex->pprev->pnext = pindex;
1093 // Resurrect memory transactions that were in the disconnected branch
1094 BOOST_FOREACH(CTransaction& tx, vResurrect)
1095 tx.AcceptToMemoryPool(txdb, false);
1097 // Delete redundant memory transactions that are in the connected branch
1098 BOOST_FOREACH(CTransaction& tx, vDelete)
1099 tx.RemoveFromMemoryPool();
1105 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1107 uint256 hash = GetHash();
1110 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1112 txdb.WriteHashBestChain(hash);
1113 if (!txdb.TxnCommit())
1114 return error("SetBestChain() : TxnCommit failed");
1115 pindexGenesisBlock = pindexNew;
1117 else if (hashPrevBlock == hashBestChain)
1119 // Adding to current best branch
1120 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1123 InvalidChainFound(pindexNew);
1124 return error("SetBestChain() : ConnectBlock failed");
1126 if (!txdb.TxnCommit())
1127 return error("SetBestChain() : TxnCommit failed");
1129 // Add to current best branch
1130 pindexNew->pprev->pnext = pindexNew;
1132 // Delete redundant memory transactions
1133 BOOST_FOREACH(CTransaction& tx, vtx)
1134 tx.RemoveFromMemoryPool();
1139 if (!Reorganize(txdb, pindexNew))
1142 InvalidChainFound(pindexNew);
1143 return error("SetBestChain() : Reorganize failed");
1147 // Update best block in wallet (so we can detect restored wallets)
1148 if (!IsInitialBlockDownload())
1150 const CBlockLocator locator(pindexNew);
1151 ::SetBestChain(locator);
1155 hashBestChain = hash;
1156 pindexBest = pindexNew;
1157 nBestHeight = pindexBest->nHeight;
1158 bnBestChainWork = pindexNew->bnChainWork;
1159 nTimeBestReceived = GetTime();
1160 nTransactionsUpdated++;
1161 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1167 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1169 // Check for duplicate
1170 uint256 hash = GetHash();
1171 if (mapBlockIndex.count(hash))
1172 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1174 // Construct new block index object
1175 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1177 return error("AddToBlockIndex() : new CBlockIndex failed");
1178 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1179 pindexNew->phashBlock = &((*mi).first);
1180 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1181 if (miPrev != mapBlockIndex.end())
1183 pindexNew->pprev = (*miPrev).second;
1184 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1186 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1190 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1191 if (!txdb.TxnCommit())
1195 if (pindexNew->bnChainWork > bnBestChainWork)
1196 if (!SetBestChain(txdb, pindexNew))
1201 if (pindexNew == pindexBest)
1203 // Notify UI to display prev block's coinbase if it was ours
1204 static uint256 hashPrevBestCoinBase;
1205 UpdatedTransaction(hashPrevBestCoinBase);
1206 hashPrevBestCoinBase = vtx[0].GetHash();
1216 bool CBlock::CheckBlock() const
1218 // These are checks that are independent of context
1219 // that can be verified before saving an orphan block.
1222 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1223 return error("CheckBlock() : size limits failed");
1225 // Check proof of work matches claimed amount
1226 if (!CheckProofOfWork(GetHash(), nBits))
1227 return error("CheckBlock() : proof of work failed");
1230 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1231 return error("CheckBlock() : block timestamp too far in the future");
1233 // First transaction must be coinbase, the rest must not be
1234 if (vtx.empty() || !vtx[0].IsCoinBase())
1235 return error("CheckBlock() : first tx is not coinbase");
1236 for (int i = 1; i < vtx.size(); i++)
1237 if (vtx[i].IsCoinBase())
1238 return error("CheckBlock() : more than one coinbase");
1240 // Check transactions
1241 BOOST_FOREACH(const CTransaction& tx, vtx)
1242 if (!tx.CheckTransaction())
1243 return error("CheckBlock() : CheckTransaction failed");
1245 // Check that it's not full of nonstandard transactions
1246 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1247 return error("CheckBlock() : too many nonstandard transactions");
1250 if (hashMerkleRoot != BuildMerkleTree())
1251 return error("CheckBlock() : hashMerkleRoot mismatch");
1256 bool CBlock::AcceptBlock()
1258 // Check for duplicate
1259 uint256 hash = GetHash();
1260 if (mapBlockIndex.count(hash))
1261 return error("AcceptBlock() : block already in mapBlockIndex");
1263 // Get prev block index
1264 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1265 if (mi == mapBlockIndex.end())
1266 return error("AcceptBlock() : prev block not found");
1267 CBlockIndex* pindexPrev = (*mi).second;
1268 int nHeight = pindexPrev->nHeight+1;
1270 // Check proof of work
1271 if (nBits != GetNextWorkRequired(pindexPrev))
1272 return error("AcceptBlock() : incorrect proof of work");
1274 // Check timestamp against prev
1275 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1276 return error("AcceptBlock() : block's timestamp is too early");
1278 // Check that all transactions are finalized
1279 BOOST_FOREACH(const CTransaction& tx, vtx)
1280 if (!tx.IsFinal(nHeight, GetBlockTime()))
1281 return error("AcceptBlock() : contains a non-final transaction");
1283 // Check that the block chain matches the known block chain up to a checkpoint
1284 if (!Checkpoints::CheckBlock(nHeight, hash))
1285 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1287 // Write block to history file
1288 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1289 return error("AcceptBlock() : out of disk space");
1290 unsigned int nFile = -1;
1291 unsigned int nBlockPos = 0;
1292 if (!WriteToDisk(nFile, nBlockPos))
1293 return error("AcceptBlock() : WriteToDisk failed");
1294 if (!AddToBlockIndex(nFile, nBlockPos))
1295 return error("AcceptBlock() : AddToBlockIndex failed");
1297 // Relay inventory, but don't relay old inventory during initial block download
1298 if (hashBestChain == hash)
1299 CRITICAL_BLOCK(cs_vNodes)
1300 BOOST_FOREACH(CNode* pnode, vNodes)
1301 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1302 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1307 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1309 // Check for duplicate
1310 uint256 hash = pblock->GetHash();
1311 if (mapBlockIndex.count(hash))
1312 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1313 if (mapOrphanBlocks.count(hash))
1314 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1316 // Preliminary checks
1317 if (!pblock->CheckBlock())
1318 return error("ProcessBlock() : CheckBlock FAILED");
1320 // If don't already have its previous block, shunt it off to holding area until we get it
1321 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1323 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1324 CBlock* pblock2 = new CBlock(*pblock);
1325 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1326 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1328 // Ask this guy to fill in what we're missing
1330 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1335 if (!pblock->AcceptBlock())
1336 return error("ProcessBlock() : AcceptBlock FAILED");
1338 // Recursively process any orphan blocks that depended on this one
1339 vector<uint256> vWorkQueue;
1340 vWorkQueue.push_back(hash);
1341 for (int i = 0; i < vWorkQueue.size(); i++)
1343 uint256 hashPrev = vWorkQueue[i];
1344 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1345 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1348 CBlock* pblockOrphan = (*mi).second;
1349 if (pblockOrphan->AcceptBlock())
1350 vWorkQueue.push_back(pblockOrphan->GetHash());
1351 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1352 delete pblockOrphan;
1354 mapOrphanBlocksByPrev.erase(hashPrev);
1357 printf("ProcessBlock: ACCEPTED\n");
1368 bool CheckDiskSpace(uint64 nAdditionalBytes)
1370 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1372 // Check for 15MB because database could create another 10MB log file at any time
1373 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1376 string strMessage = _("Warning: Disk space is low ");
1377 strMiscWarning = strMessage;
1378 printf("*** %s\n", strMessage.c_str());
1379 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1380 CreateThread(Shutdown, NULL);
1386 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1390 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1393 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1395 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1404 static unsigned int nCurrentBlockFile = 1;
1406 FILE* AppendBlockFile(unsigned int& nFileRet)
1411 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1414 if (fseek(file, 0, SEEK_END) != 0)
1416 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1417 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1419 nFileRet = nCurrentBlockFile;
1423 nCurrentBlockFile++;
1427 bool LoadBlockIndex(bool fAllowNew)
1431 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1432 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1433 pchMessageStart[0] = 0xfa;
1434 pchMessageStart[1] = 0xbf;
1435 pchMessageStart[2] = 0xb5;
1436 pchMessageStart[3] = 0xda;
1443 if (!txdb.LoadBlockIndex())
1448 // Init with genesis block
1450 if (mapBlockIndex.empty())
1456 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1457 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1458 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1459 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1460 // vMerkleTree: 4a5e1e
1463 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1465 txNew.vin.resize(1);
1466 txNew.vout.resize(1);
1467 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1468 txNew.vout[0].nValue = 50 * COIN;
1469 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1471 block.vtx.push_back(txNew);
1472 block.hashPrevBlock = 0;
1473 block.hashMerkleRoot = block.BuildMerkleTree();
1475 block.nTime = 1231006505;
1476 block.nBits = 0x1d00ffff;
1477 block.nNonce = 2083236893;
1481 block.nTime = 1296688602;
1482 block.nBits = 0x1d07fff8;
1483 block.nNonce = 384568319;
1487 printf("%s\n", block.GetHash().ToString().c_str());
1488 printf("%s\n", hashGenesisBlock.ToString().c_str());
1489 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1490 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1492 assert(block.GetHash() == hashGenesisBlock);
1494 // Start new block file
1496 unsigned int nBlockPos;
1497 if (!block.WriteToDisk(nFile, nBlockPos))
1498 return error("LoadBlockIndex() : writing genesis block to disk failed");
1499 if (!block.AddToBlockIndex(nFile, nBlockPos))
1500 return error("LoadBlockIndex() : genesis block not accepted");
1508 void PrintBlockTree()
1510 // precompute tree structure
1511 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1512 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1514 CBlockIndex* pindex = (*mi).second;
1515 mapNext[pindex->pprev].push_back(pindex);
1517 //while (rand() % 3 == 0)
1518 // mapNext[pindex->pprev].push_back(pindex);
1521 vector<pair<int, CBlockIndex*> > vStack;
1522 vStack.push_back(make_pair(0, pindexGenesisBlock));
1525 while (!vStack.empty())
1527 int nCol = vStack.back().first;
1528 CBlockIndex* pindex = vStack.back().second;
1531 // print split or gap
1532 if (nCol > nPrevCol)
1534 for (int i = 0; i < nCol-1; i++)
1538 else if (nCol < nPrevCol)
1540 for (int i = 0; i < nCol; i++)
1547 for (int i = 0; i < nCol; i++)
1552 block.ReadFromDisk(pindex);
1553 printf("%d (%u,%u) %s %s tx %d",
1557 block.GetHash().ToString().substr(0,20).c_str(),
1558 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1561 PrintWallets(block);
1563 // put the main timechain first
1564 vector<CBlockIndex*>& vNext = mapNext[pindex];
1565 for (int i = 0; i < vNext.size(); i++)
1567 if (vNext[i]->pnext)
1569 swap(vNext[0], vNext[i]);
1575 for (int i = 0; i < vNext.size(); i++)
1576 vStack.push_back(make_pair(nCol+i, vNext[i]));
1589 //////////////////////////////////////////////////////////////////////////////
1594 map<uint256, CAlert> mapAlerts;
1595 CCriticalSection cs_mapAlerts;
1597 string GetWarnings(string strFor)
1600 string strStatusBar;
1602 if (GetBoolArg("-testsafemode"))
1605 // Misc warnings like out of disk space and clock is wrong
1606 if (strMiscWarning != "")
1609 strStatusBar = strMiscWarning;
1612 // Longer invalid proof-of-work chain
1613 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1616 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1620 CRITICAL_BLOCK(cs_mapAlerts)
1622 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1624 const CAlert& alert = item.second;
1625 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1627 nPriority = alert.nPriority;
1628 strStatusBar = alert.strStatusBar;
1633 if (strFor == "statusbar")
1634 return strStatusBar;
1635 else if (strFor == "rpc")
1637 assert(!"GetWarnings() : invalid parameter");
1641 bool CAlert::ProcessAlert()
1643 if (!CheckSignature())
1648 CRITICAL_BLOCK(cs_mapAlerts)
1650 // Cancel previous alerts
1651 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1653 const CAlert& alert = (*mi).second;
1656 printf("cancelling alert %d\n", alert.nID);
1657 mapAlerts.erase(mi++);
1659 else if (!alert.IsInEffect())
1661 printf("expiring alert %d\n", alert.nID);
1662 mapAlerts.erase(mi++);
1668 // Check if this alert has been cancelled
1669 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1671 const CAlert& alert = item.second;
1672 if (alert.Cancels(*this))
1674 printf("alert already cancelled by %d\n", alert.nID);
1680 mapAlerts.insert(make_pair(GetHash(), *this));
1683 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1695 //////////////////////////////////////////////////////////////////////////////
1701 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1705 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1706 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1708 // Don't know what it is, just say we already got one
1715 // The message start string is designed to be unlikely to occur in normal data.
1716 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1717 // a large 4-byte int at any alignment.
1718 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1721 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1723 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1724 RandAddSeedPerfmon();
1726 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1727 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1729 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1731 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1739 if (strCommand == "version")
1741 // Each connection can only send one version message
1742 if (pfrom->nVersion != 0)
1749 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1750 if (pfrom->nVersion == 10300)
1751 pfrom->nVersion = 300;
1752 if (pfrom->nVersion >= 106 && !vRecv.empty())
1753 vRecv >> addrFrom >> nNonce;
1754 if (pfrom->nVersion >= 106 && !vRecv.empty())
1755 vRecv >> pfrom->strSubVer;
1756 if (pfrom->nVersion >= 209 && !vRecv.empty())
1757 vRecv >> pfrom->nStartingHeight;
1759 if (pfrom->nVersion == 0)
1762 // Disconnect if we connected to ourself
1763 if (nNonce == nLocalHostNonce && nNonce > 1)
1765 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1766 pfrom->fDisconnect = true;
1770 // Be shy and don't send version until we hear
1771 if (pfrom->fInbound)
1772 pfrom->PushVersion();
1774 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1776 AddTimeData(pfrom->addr.ip, nTime);
1779 if (pfrom->nVersion >= 209)
1780 pfrom->PushMessage("verack");
1781 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1782 if (pfrom->nVersion < 209)
1783 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1785 if (!pfrom->fInbound)
1787 // Advertise our address
1788 if (addrLocalHost.IsRoutable() && !fUseProxy)
1790 CAddress addr(addrLocalHost);
1791 addr.nTime = GetAdjustedTime();
1792 pfrom->PushAddress(addr);
1795 // Get recent addresses
1796 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1798 pfrom->PushMessage("getaddr");
1799 pfrom->fGetAddr = true;
1803 // Ask the first connected node for block updates
1804 static int nAskedForBlocks;
1805 if (!pfrom->fClient &&
1806 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1807 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1810 pfrom->PushGetBlocks(pindexBest, uint256(0));
1814 CRITICAL_BLOCK(cs_mapAlerts)
1815 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1816 item.second.RelayTo(pfrom);
1818 pfrom->fSuccessfullyConnected = true;
1820 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1824 else if (pfrom->nVersion == 0)
1826 // Must have a version message before anything else
1831 else if (strCommand == "verack")
1833 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1837 else if (strCommand == "addr")
1839 vector<CAddress> vAddr;
1842 // Don't want addr from older versions unless seeding
1843 if (pfrom->nVersion < 209)
1845 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1847 if (vAddr.size() > 1000)
1848 return error("message addr size() = %d", vAddr.size());
1850 // Store the new addresses
1853 int64 nNow = GetAdjustedTime();
1854 int64 nSince = nNow - 10 * 60;
1855 BOOST_FOREACH(CAddress& addr, vAddr)
1859 // ignore IPv6 for now, since it isn't implemented anyway
1862 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1863 addr.nTime = nNow - 5 * 24 * 60 * 60;
1864 AddAddress(addr, 2 * 60 * 60, &addrDB);
1865 pfrom->AddAddressKnown(addr);
1866 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1868 // Relay to a limited number of other nodes
1869 CRITICAL_BLOCK(cs_vNodes)
1871 // Use deterministic randomness to send to the same nodes for 24 hours
1872 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1873 static uint256 hashSalt;
1875 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1876 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1877 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1878 multimap<uint256, CNode*> mapMix;
1879 BOOST_FOREACH(CNode* pnode, vNodes)
1881 if (pnode->nVersion < 31402)
1883 unsigned int nPointer;
1884 memcpy(&nPointer, &pnode, sizeof(nPointer));
1885 uint256 hashKey = hashRand ^ nPointer;
1886 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1887 mapMix.insert(make_pair(hashKey, pnode));
1889 int nRelayNodes = 2;
1890 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1891 ((*mi).second)->PushAddress(addr);
1895 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1896 if (vAddr.size() < 1000)
1897 pfrom->fGetAddr = false;
1901 else if (strCommand == "inv")
1905 if (vInv.size() > 50000)
1906 return error("message inv size() = %d", vInv.size());
1909 BOOST_FOREACH(const CInv& inv, vInv)
1913 pfrom->AddInventoryKnown(inv);
1915 bool fAlreadyHave = AlreadyHave(txdb, inv);
1917 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1921 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1922 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1924 // Track requests for our stuff
1925 Inventory(inv.hash);
1930 else if (strCommand == "getdata")
1934 if (vInv.size() > 50000)
1935 return error("message getdata size() = %d", vInv.size());
1937 BOOST_FOREACH(const CInv& inv, vInv)
1941 printf("received getdata for: %s\n", inv.ToString().c_str());
1943 if (inv.type == MSG_BLOCK)
1945 // Send block from disk
1946 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1947 if (mi != mapBlockIndex.end())
1950 block.ReadFromDisk((*mi).second);
1951 pfrom->PushMessage("block", block);
1953 // Trigger them to send a getblocks request for the next batch of inventory
1954 if (inv.hash == pfrom->hashContinue)
1956 // Bypass PushInventory, this must send even if redundant,
1957 // and we want it right after the last block so they don't
1958 // wait for other stuff first.
1960 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
1961 pfrom->PushMessage("inv", vInv);
1962 pfrom->hashContinue = 0;
1966 else if (inv.IsKnownType())
1968 // Send stream from relay memory
1969 CRITICAL_BLOCK(cs_mapRelay)
1971 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
1972 if (mi != mapRelay.end())
1973 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
1977 // Track requests for our stuff
1978 Inventory(inv.hash);
1983 else if (strCommand == "getblocks")
1985 CBlockLocator locator;
1987 vRecv >> locator >> hashStop;
1989 // Find the last block the caller has in the main chain
1990 CBlockIndex* pindex = locator.GetBlockIndex();
1992 // Send the rest of the chain
1994 pindex = pindex->pnext;
1995 int nLimit = 500 + locator.GetDistanceBack();
1996 unsigned int nBytes = 0;
1997 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
1998 for (; pindex; pindex = pindex->pnext)
2000 if (pindex->GetBlockHash() == hashStop)
2002 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2005 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2007 block.ReadFromDisk(pindex, true);
2008 nBytes += block.GetSerializeSize(SER_NETWORK);
2009 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2011 // When this block is requested, we'll send an inv that'll make them
2012 // getblocks the next batch of inventory.
2013 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2014 pfrom->hashContinue = pindex->GetBlockHash();
2021 else if (strCommand == "getheaders")
2023 CBlockLocator locator;
2025 vRecv >> locator >> hashStop;
2027 CBlockIndex* pindex = NULL;
2028 if (locator.IsNull())
2030 // If locator is null, return the hashStop block
2031 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2032 if (mi == mapBlockIndex.end())
2034 pindex = (*mi).second;
2038 // Find the last block the caller has in the main chain
2039 pindex = locator.GetBlockIndex();
2041 pindex = pindex->pnext;
2044 vector<CBlock> vHeaders;
2045 int nLimit = 2000 + locator.GetDistanceBack();
2046 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2047 for (; pindex; pindex = pindex->pnext)
2049 vHeaders.push_back(pindex->GetBlockHeader());
2050 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2053 pfrom->PushMessage("headers", vHeaders);
2057 else if (strCommand == "tx")
2059 vector<uint256> vWorkQueue;
2060 CDataStream vMsg(vRecv);
2064 CInv inv(MSG_TX, tx.GetHash());
2065 pfrom->AddInventoryKnown(inv);
2067 bool fMissingInputs = false;
2068 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2070 SyncWithWallets(tx, NULL, true);
2071 RelayMessage(inv, vMsg);
2072 mapAlreadyAskedFor.erase(inv);
2073 vWorkQueue.push_back(inv.hash);
2075 // Recursively process any orphan transactions that depended on this one
2076 for (int i = 0; i < vWorkQueue.size(); i++)
2078 uint256 hashPrev = vWorkQueue[i];
2079 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2080 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2083 const CDataStream& vMsg = *((*mi).second);
2085 CDataStream(vMsg) >> tx;
2086 CInv inv(MSG_TX, tx.GetHash());
2088 if (tx.AcceptToMemoryPool(true))
2090 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2091 SyncWithWallets(tx, NULL, true);
2092 RelayMessage(inv, vMsg);
2093 mapAlreadyAskedFor.erase(inv);
2094 vWorkQueue.push_back(inv.hash);
2099 BOOST_FOREACH(uint256 hash, vWorkQueue)
2100 EraseOrphanTx(hash);
2102 else if (fMissingInputs)
2104 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2110 else if (strCommand == "block")
2115 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2118 CInv inv(MSG_BLOCK, block.GetHash());
2119 pfrom->AddInventoryKnown(inv);
2121 if (ProcessBlock(pfrom, &block))
2122 mapAlreadyAskedFor.erase(inv);
2126 else if (strCommand == "getaddr")
2128 // Nodes rebroadcast an addr every 24 hours
2129 pfrom->vAddrToSend.clear();
2130 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2131 CRITICAL_BLOCK(cs_mapAddresses)
2133 unsigned int nCount = 0;
2134 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2136 const CAddress& addr = item.second;
2137 if (addr.nTime > nSince)
2140 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2142 const CAddress& addr = item.second;
2143 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2144 pfrom->PushAddress(addr);
2150 else if (strCommand == "checkorder")
2155 if (!GetBoolArg("-allowreceivebyip"))
2157 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2164 /// we have a chance to check the order here
2166 // Keep giving the same key to the same ip until they use it
2167 if (!mapReuseKey.count(pfrom->addr.ip))
2168 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2170 // Send back approval of order and pubkey to use
2171 CScript scriptPubKey;
2172 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2173 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2177 else if (strCommand == "reply")
2182 CRequestTracker tracker;
2183 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2185 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2186 if (mi != pfrom->mapRequests.end())
2188 tracker = (*mi).second;
2189 pfrom->mapRequests.erase(mi);
2192 if (!tracker.IsNull())
2193 tracker.fn(tracker.param1, vRecv);
2197 else if (strCommand == "ping")
2202 else if (strCommand == "alert")
2207 if (alert.ProcessAlert())
2210 pfrom->setKnown.insert(alert.GetHash());
2211 CRITICAL_BLOCK(cs_vNodes)
2212 BOOST_FOREACH(CNode* pnode, vNodes)
2213 alert.RelayTo(pnode);
2220 // Ignore unknown commands for extensibility
2224 // Update the last seen time for this node's address
2225 if (pfrom->fNetworkNode)
2226 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2227 AddressCurrentlyConnected(pfrom->addr);
2233 bool ProcessMessages(CNode* pfrom)
2235 CDataStream& vRecv = pfrom->vRecv;
2239 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2243 // (4) message start
2252 // Scan for message start
2253 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2254 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2255 if (vRecv.end() - pstart < nHeaderSize)
2257 if (vRecv.size() > nHeaderSize)
2259 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2260 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2264 if (pstart - vRecv.begin() > 0)
2265 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2266 vRecv.erase(vRecv.begin(), pstart);
2269 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2274 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2277 string strCommand = hdr.GetCommand();
2280 unsigned int nMessageSize = hdr.nMessageSize;
2281 if (nMessageSize > MAX_SIZE)
2283 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2286 if (nMessageSize > vRecv.size())
2288 // Rewind and wait for rest of message
2289 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2294 if (vRecv.GetVersion() >= 209)
2296 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2297 unsigned int nChecksum = 0;
2298 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2299 if (nChecksum != hdr.nChecksum)
2301 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2302 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2307 // Copy message to its own buffer
2308 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2309 vRecv.ignore(nMessageSize);
2315 CRITICAL_BLOCK(cs_main)
2316 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2320 catch (std::ios_base::failure& e)
2322 if (strstr(e.what(), "end of data"))
2324 // Allow exceptions from underlength message on vRecv
2325 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());
2327 else if (strstr(e.what(), "size too large"))
2329 // Allow exceptions from overlong size
2330 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2334 PrintExceptionContinue(&e, "ProcessMessage()");
2337 catch (std::exception& e) {
2338 PrintExceptionContinue(&e, "ProcessMessage()");
2340 PrintExceptionContinue(NULL, "ProcessMessage()");
2344 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2352 bool SendMessages(CNode* pto, bool fSendTrickle)
2354 CRITICAL_BLOCK(cs_main)
2356 // Don't send anything until we get their version message
2357 if (pto->nVersion == 0)
2361 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2362 pto->PushMessage("ping");
2364 // Resend wallet transactions that haven't gotten in a block yet
2365 ResendWalletTransactions();
2367 // Address refresh broadcast
2368 static int64 nLastRebroadcast;
2369 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2371 nLastRebroadcast = GetTime();
2372 CRITICAL_BLOCK(cs_vNodes)
2374 BOOST_FOREACH(CNode* pnode, vNodes)
2376 // Periodically clear setAddrKnown to allow refresh broadcasts
2377 pnode->setAddrKnown.clear();
2379 // Rebroadcast our address
2380 if (addrLocalHost.IsRoutable() && !fUseProxy)
2382 CAddress addr(addrLocalHost);
2383 addr.nTime = GetAdjustedTime();
2384 pnode->PushAddress(addr);
2390 // Clear out old addresses periodically so it's not too much work at once
2391 static int64 nLastClear;
2392 if (nLastClear == 0)
2393 nLastClear = GetTime();
2394 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2396 nLastClear = GetTime();
2397 CRITICAL_BLOCK(cs_mapAddresses)
2400 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2401 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2402 mi != mapAddresses.end();)
2404 const CAddress& addr = (*mi).second;
2405 if (addr.nTime < nSince)
2407 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2409 addrdb.EraseAddress(addr);
2410 mapAddresses.erase(mi++);
2424 vector<CAddress> vAddr;
2425 vAddr.reserve(pto->vAddrToSend.size());
2426 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2428 // returns true if wasn't already contained in the set
2429 if (pto->setAddrKnown.insert(addr).second)
2431 vAddr.push_back(addr);
2432 // receiver rejects addr messages larger than 1000
2433 if (vAddr.size() >= 1000)
2435 pto->PushMessage("addr", vAddr);
2440 pto->vAddrToSend.clear();
2442 pto->PushMessage("addr", vAddr);
2447 // Message: inventory
2450 vector<CInv> vInvWait;
2451 CRITICAL_BLOCK(pto->cs_inventory)
2453 vInv.reserve(pto->vInventoryToSend.size());
2454 vInvWait.reserve(pto->vInventoryToSend.size());
2455 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2457 if (pto->setInventoryKnown.count(inv))
2460 // trickle out tx inv to protect privacy
2461 if (inv.type == MSG_TX && !fSendTrickle)
2463 // 1/4 of tx invs blast to all immediately
2464 static uint256 hashSalt;
2466 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2467 uint256 hashRand = inv.hash ^ hashSalt;
2468 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2469 bool fTrickleWait = ((hashRand & 3) != 0);
2471 // always trickle our own transactions
2475 if (GetTransaction(inv.hash, wtx))
2477 fTrickleWait = true;
2482 vInvWait.push_back(inv);
2487 // returns true if wasn't already contained in the set
2488 if (pto->setInventoryKnown.insert(inv).second)
2490 vInv.push_back(inv);
2491 if (vInv.size() >= 1000)
2493 pto->PushMessage("inv", vInv);
2498 pto->vInventoryToSend = vInvWait;
2501 pto->PushMessage("inv", vInv);
2507 vector<CInv> vGetData;
2508 int64 nNow = GetTime() * 1000000;
2510 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2512 const CInv& inv = (*pto->mapAskFor.begin()).second;
2513 if (!AlreadyHave(txdb, inv))
2515 printf("sending getdata: %s\n", inv.ToString().c_str());
2516 vGetData.push_back(inv);
2517 if (vGetData.size() >= 1000)
2519 pto->PushMessage("getdata", vGetData);
2523 mapAlreadyAskedFor[inv] = nNow;
2524 pto->mapAskFor.erase(pto->mapAskFor.begin());
2526 if (!vGetData.empty())
2527 pto->PushMessage("getdata", vGetData);
2546 //////////////////////////////////////////////////////////////////////////////
2551 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2553 unsigned char* pdata = (unsigned char*)pbuffer;
2554 unsigned int blocks = 1 + ((len + 8) / 64);
2555 unsigned char* pend = pdata + 64 * blocks;
2556 memset(pdata + len, 0, 64 * blocks - len);
2558 unsigned int bits = len * 8;
2559 pend[-1] = (bits >> 0) & 0xff;
2560 pend[-2] = (bits >> 8) & 0xff;
2561 pend[-3] = (bits >> 16) & 0xff;
2562 pend[-4] = (bits >> 24) & 0xff;
2566 using CryptoPP::ByteReverse;
2568 static const unsigned int pSHA256InitState[8] =
2569 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2571 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2573 memcpy(pstate, pinit, 32);
2574 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2578 // ScanHash scans nonces looking for a hash with at least some zero bits.
2579 // It operates on big endian data. Caller does the byte reversing.
2580 // All input buffers are 16-byte aligned. nNonce is usually preserved
2581 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2582 // the block is rebuilt and nNonce starts over at zero.
2584 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2586 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2590 // Hash pdata using pmidstate as the starting state into
2591 // preformatted buffer phash1, then hash phash1 into phash
2593 SHA256Transform(phash1, pdata, pmidstate);
2594 SHA256Transform(phash, phash1, pSHA256InitState);
2596 // Return the nonce if the hash has at least some zero bits,
2597 // caller will check if it has enough to reach the target
2598 if (((unsigned short*)phash)[14] == 0)
2601 // If nothing found after trying for a while, return -1
2602 if ((nNonce & 0xffff) == 0)
2604 nHashesDone = 0xffff+1;
2610 // Some explaining would be appreciated
2615 set<uint256> setDependsOn;
2618 COrphan(CTransaction* ptxIn)
2626 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2627 BOOST_FOREACH(uint256 hash, setDependsOn)
2628 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2633 CBlock* CreateNewBlock(CReserveKey& reservekey)
2635 CBlockIndex* pindexPrev = pindexBest;
2638 auto_ptr<CBlock> pblock(new CBlock());
2642 // Create coinbase tx
2644 txNew.vin.resize(1);
2645 txNew.vin[0].prevout.SetNull();
2646 txNew.vout.resize(1);
2647 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2649 // Add our coinbase tx as first transaction
2650 pblock->vtx.push_back(txNew);
2652 // Collect memory pool transactions into the block
2654 CRITICAL_BLOCK(cs_main)
2655 CRITICAL_BLOCK(cs_mapTransactions)
2659 // Priority order to process transactions
2660 list<COrphan> vOrphan; // list memory doesn't move
2661 map<uint256, vector<COrphan*> > mapDependers;
2662 multimap<double, CTransaction*> mapPriority;
2663 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2665 CTransaction& tx = (*mi).second;
2666 if (tx.IsCoinBase() || !tx.IsFinal())
2669 COrphan* porphan = NULL;
2670 double dPriority = 0;
2671 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2673 // Read prev transaction
2674 CTransaction txPrev;
2676 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2678 // Has to wait for dependencies
2681 // Use list for automatic deletion
2682 vOrphan.push_back(COrphan(&tx));
2683 porphan = &vOrphan.back();
2685 mapDependers[txin.prevout.hash].push_back(porphan);
2686 porphan->setDependsOn.insert(txin.prevout.hash);
2689 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2691 // Read block header
2692 int nConf = txindex.GetDepthInMainChain();
2694 dPriority += (double)nValueIn * nConf;
2696 if (fDebug && GetBoolArg("-printpriority"))
2697 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2700 // Priority is sum(valuein * age) / txsize
2701 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2704 porphan->dPriority = dPriority;
2706 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2708 if (fDebug && GetBoolArg("-printpriority"))
2710 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2717 // Collect transactions into block
2718 map<uint256, CTxIndex> mapTestPool;
2719 uint64 nBlockSize = 1000;
2720 int nBlockSigOps = 100;
2721 while (!mapPriority.empty())
2723 // Take highest priority transaction off priority queue
2724 double dPriority = -(*mapPriority.begin()).first;
2725 CTransaction& tx = *(*mapPriority.begin()).second;
2726 mapPriority.erase(mapPriority.begin());
2729 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2730 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2732 int nTxSigOps = tx.GetSigOpCount();
2733 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2736 // Transaction fee required depends on block size
2737 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2738 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2740 // Connecting shouldn't fail due to dependency on other memory pool transactions
2741 // because we're already processing them in order of dependency
2742 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2743 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2745 swap(mapTestPool, mapTestPoolTmp);
2748 pblock->vtx.push_back(tx);
2749 nBlockSize += nTxSize;
2750 nBlockSigOps += nTxSigOps;
2752 // Add transactions that depend on this one to the priority queue
2753 uint256 hash = tx.GetHash();
2754 if (mapDependers.count(hash))
2756 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2758 if (!porphan->setDependsOn.empty())
2760 porphan->setDependsOn.erase(hash);
2761 if (porphan->setDependsOn.empty())
2762 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2768 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2771 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2772 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2773 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2774 pblock->nBits = GetNextWorkRequired(pindexPrev);
2777 return pblock.release();
2781 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2783 // Update nExtraNonce
2784 static uint256 hashPrevBlock;
2785 if (hashPrevBlock != pblock->hashPrevBlock)
2788 hashPrevBlock = pblock->hashPrevBlock;
2791 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2792 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2796 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2799 // Prebuild hash buffers
2806 uint256 hashPrevBlock;
2807 uint256 hashMerkleRoot;
2810 unsigned int nNonce;
2813 unsigned char pchPadding0[64];
2815 unsigned char pchPadding1[64];
2818 memset(&tmp, 0, sizeof(tmp));
2820 tmp.block.nVersion = pblock->nVersion;
2821 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2822 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2823 tmp.block.nTime = pblock->nTime;
2824 tmp.block.nBits = pblock->nBits;
2825 tmp.block.nNonce = pblock->nNonce;
2827 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2828 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2830 // Byte swap all the input buffer
2831 for (int i = 0; i < sizeof(tmp)/4; i++)
2832 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2834 // Precalc the first half of the first hash, which stays constant
2835 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2837 memcpy(pdata, &tmp.block, 128);
2838 memcpy(phash1, &tmp.hash1, 64);
2842 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2844 uint256 hash = pblock->GetHash();
2845 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2847 if (hash > hashTarget)
2851 printf("BitcoinMiner:\n");
2852 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2854 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2855 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2858 CRITICAL_BLOCK(cs_main)
2860 if (pblock->hashPrevBlock != hashBestChain)
2861 return error("BitcoinMiner : generated block is stale");
2863 // Remove key from key pool
2864 reservekey.KeepKey();
2866 // Track how many getdata requests this block gets
2867 CRITICAL_BLOCK(wallet.cs_wallet)
2868 wallet.mapRequestCount[pblock->GetHash()] = 0;
2870 // Process this block the same as if we had received it from another node
2871 if (!ProcessBlock(NULL, pblock))
2872 return error("BitcoinMiner : ProcessBlock, block not accepted");
2879 void static ThreadBitcoinMiner(void* parg);
2881 void static BitcoinMiner(CWallet *pwallet)
2883 printf("BitcoinMiner started\n");
2884 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2886 // Each thread has its own key and counter
2887 CReserveKey reservekey(pwallet);
2888 unsigned int nExtraNonce = 0;
2890 while (fGenerateBitcoins)
2892 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2896 while (vNodes.empty() || IsInitialBlockDownload())
2901 if (!fGenerateBitcoins)
2909 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2910 CBlockIndex* pindexPrev = pindexBest;
2912 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2915 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2917 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2921 // Prebuild hash buffers
2923 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2924 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2925 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2927 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2929 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2930 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2936 int64 nStart = GetTime();
2937 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2939 uint256& hash = *alignup<16>(hashbuf);
2942 unsigned int nHashesDone = 0;
2943 unsigned int nNonceFound;
2946 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2947 (char*)&hash, nHashesDone);
2949 // Check if something found
2950 if (nNonceFound != -1)
2952 for (int i = 0; i < sizeof(hash)/4; i++)
2953 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2955 if (hash <= hashTarget)
2958 pblock->nNonce = ByteReverse(nNonceFound);
2959 assert(hash == pblock->GetHash());
2961 SetThreadPriority(THREAD_PRIORITY_NORMAL);
2962 CheckWork(pblock.get(), *pwalletMain, reservekey);
2963 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2969 static int64 nHashCounter;
2970 if (nHPSTimerStart == 0)
2972 nHPSTimerStart = GetTimeMillis();
2976 nHashCounter += nHashesDone;
2977 if (GetTimeMillis() - nHPSTimerStart > 4000)
2979 static CCriticalSection cs;
2982 if (GetTimeMillis() - nHPSTimerStart > 4000)
2984 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
2985 nHPSTimerStart = GetTimeMillis();
2987 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
2988 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
2989 static int64 nLogTime;
2990 if (GetTime() - nLogTime > 30 * 60)
2992 nLogTime = GetTime();
2993 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2994 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3000 // Check for stop or if block needs to be rebuilt
3003 if (!fGenerateBitcoins)
3005 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3009 if (nBlockNonce >= 0xffff0000)
3011 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3013 if (pindexPrev != pindexBest)
3016 // Update nTime every few seconds
3017 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3018 nBlockTime = ByteReverse(pblock->nTime);
3023 void static ThreadBitcoinMiner(void* parg)
3025 CWallet* pwallet = (CWallet*)parg;
3028 vnThreadsRunning[3]++;
3029 BitcoinMiner(pwallet);
3030 vnThreadsRunning[3]--;
3032 catch (std::exception& e) {
3033 vnThreadsRunning[3]--;
3034 PrintException(&e, "ThreadBitcoinMiner()");
3036 vnThreadsRunning[3]--;
3037 PrintException(NULL, "ThreadBitcoinMiner()");
3039 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3041 if (vnThreadsRunning[3] == 0)
3043 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3047 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3049 if (fGenerateBitcoins != fGenerate)
3051 fGenerateBitcoins = fGenerate;
3052 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3055 if (fGenerateBitcoins)
3057 int nProcessors = boost::thread::hardware_concurrency();
3058 printf("%d processors\n", nProcessors);
3059 if (nProcessors < 1)
3061 if (fLimitProcessors && nProcessors > nLimitProcessors)
3062 nProcessors = nLimitProcessors;
3063 int nAddThreads = nProcessors - vnThreadsRunning[3];
3064 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3065 for (int i = 0; i < nAddThreads; i++)
3067 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3068 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");