1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
9 #include "cryptopp/sha.h"
10 #include <boost/filesystem.hpp>
11 #include <boost/filesystem/fstream.hpp>
14 using namespace boost;
20 CCriticalSection cs_setpwalletRegistered;
21 set<CWallet*> setpwalletRegistered;
23 CCriticalSection cs_main;
25 map<uint256, CTransaction> mapTransactions;
26 CCriticalSection cs_mapTransactions;
27 unsigned int nTransactionsUpdated = 0;
28 map<COutPoint, CInPoint> mapNextTx;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 const int nTotalBlocksEstimate = 134444; // Conservative estimate of total nr of blocks on main chain
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 CBigNum bnBestChainWork = 0;
38 CBigNum bnBestInvalidWork = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
54 int fGenerateBitcoins = false;
55 int64 nTransactionFee = 0;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void static AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
169 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
170 BOOST_FOREACH(const CTxIn& txin, tx.vin)
171 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
174 void static EraseOrphanTx(uint256 hash)
176 if (!mapOrphanTransactions.count(hash))
178 const CDataStream* pvMsg = mapOrphanTransactions[hash];
180 CDataStream(*pvMsg) >> tx;
181 BOOST_FOREACH(const CTxIn& txin, tx.vin)
183 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
184 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
186 if ((*mi).second == pvMsg)
187 mapOrphanTransactionsByPrev.erase(mi++);
193 mapOrphanTransactions.erase(hash);
203 //////////////////////////////////////////////////////////////////////////////
205 // CTransaction and CTxIndex
208 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
211 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
213 if (!ReadFromDisk(txindexRet.pos))
215 if (prevout.n >= vout.size())
223 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
226 return ReadFromDisk(txdb, prevout, txindex);
229 bool CTransaction::ReadFromDisk(COutPoint prevout)
233 return ReadFromDisk(txdb, prevout, txindex);
238 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
250 // Load the block this tx is in
252 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
254 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
259 // Update the tx's hashBlock
260 hashBlock = pblock->GetHash();
262 // Locate the transaction
263 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
264 if (pblock->vtx[nIndex] == *(CTransaction*)this)
266 if (nIndex == pblock->vtx.size())
268 vMerkleBranch.clear();
270 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
274 // Fill in merkle branch
275 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
278 // Is the tx in a block that's in the main chain
279 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
280 if (mi == mapBlockIndex.end())
282 CBlockIndex* pindex = (*mi).second;
283 if (!pindex || !pindex->IsInMainChain())
286 return pindexBest->nHeight - pindex->nHeight + 1;
295 bool CTransaction::CheckTransaction() const
297 // Basic checks that don't depend on any context
298 if (vin.empty() || vout.empty())
299 return error("CTransaction::CheckTransaction() : vin or vout empty");
302 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
303 return error("CTransaction::CheckTransaction() : size limits failed");
305 // Check for negative or overflow output values
307 BOOST_FOREACH(const CTxOut& txout, vout)
309 if (txout.nValue < 0)
310 return error("CTransaction::CheckTransaction() : txout.nValue negative");
311 if (txout.nValue > MAX_MONEY)
312 return error("CTransaction::CheckTransaction() : txout.nValue too high");
313 nValueOut += txout.nValue;
314 if (!MoneyRange(nValueOut))
315 return error("CTransaction::CheckTransaction() : txout total out of range");
320 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
321 return error("CTransaction::CheckTransaction() : coinbase script size");
325 BOOST_FOREACH(const CTxIn& txin, vin)
326 if (txin.prevout.IsNull())
327 return error("CTransaction::CheckTransaction() : prevout is null");
333 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
336 *pfMissingInputs = false;
338 if (!CheckTransaction())
339 return error("AcceptToMemoryPool() : CheckTransaction failed");
341 // Coinbase is only valid in a block, not as a loose transaction
343 return error("AcceptToMemoryPool() : coinbase as individual tx");
345 // To help v0.1.5 clients who would see it as a negative number
346 if ((int64)nLockTime > INT_MAX)
347 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
350 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
351 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
352 // attacks disallow transactions with more than one SigOp per 34 bytes.
353 // 34 bytes because a TxOut is:
354 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
355 if (GetSigOpCount() > nSize / 34 || nSize < 100)
356 return error("AcceptToMemoryPool() : nonstandard transaction");
358 // Rather not work on nonstandard transactions (unless -testnet)
359 if (!fTestNet && !IsStandard())
360 return error("AcceptToMemoryPool() : nonstandard transaction type");
362 // Do we already have it?
363 uint256 hash = GetHash();
364 CRITICAL_BLOCK(cs_mapTransactions)
365 if (mapTransactions.count(hash))
368 if (txdb.ContainsTx(hash))
371 // Check for conflicts with in-memory transactions
372 CTransaction* ptxOld = NULL;
373 for (int i = 0; i < vin.size(); i++)
375 COutPoint outpoint = vin[i].prevout;
376 if (mapNextTx.count(outpoint))
378 // Disable replacement feature for now
381 // Allow replacing with a newer version of the same transaction
384 ptxOld = mapNextTx[outpoint].ptx;
385 if (ptxOld->IsFinal())
387 if (!IsNewerThan(*ptxOld))
389 for (int i = 0; i < vin.size(); i++)
391 COutPoint outpoint = vin[i].prevout;
392 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
401 // Check against previous transactions
402 map<uint256, CTxIndex> mapUnused;
404 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
407 *pfMissingInputs = true;
408 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
411 // Don't accept it if it can't get into a block
412 if (nFees < GetMinFee(1000, true, true))
413 return error("AcceptToMemoryPool() : not enough fees");
415 // Continuously rate-limit free transactions
416 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
417 // be annoying or make other's transactions take longer to confirm.
418 if (nFees < MIN_RELAY_TX_FEE)
420 static CCriticalSection cs;
421 static double dFreeCount;
422 static int64 nLastTime;
423 int64 nNow = GetTime();
427 // Use an exponentially decaying ~10-minute window:
428 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
430 // -limitfreerelay unit is thousand-bytes-per-minute
431 // At default rate it would take over a month to fill 1GB
432 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
433 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
435 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
441 // Store transaction in memory
442 CRITICAL_BLOCK(cs_mapTransactions)
446 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
447 ptxOld->RemoveFromMemoryPool();
449 AddToMemoryPoolUnchecked();
452 ///// are we sure this is ok when loading transactions or restoring block txes
453 // If updated, erase old tx from wallet
455 EraseFromWallets(ptxOld->GetHash());
457 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
461 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
464 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
467 bool CTransaction::AddToMemoryPoolUnchecked()
469 // Add to memory pool without checking anything. Don't call this directly,
470 // call AcceptToMemoryPool to properly check the transaction first.
471 CRITICAL_BLOCK(cs_mapTransactions)
473 uint256 hash = GetHash();
474 mapTransactions[hash] = *this;
475 for (int i = 0; i < vin.size(); i++)
476 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
477 nTransactionsUpdated++;
483 bool CTransaction::RemoveFromMemoryPool()
485 // Remove transaction from memory pool
486 CRITICAL_BLOCK(cs_mapTransactions)
488 BOOST_FOREACH(const CTxIn& txin, vin)
489 mapNextTx.erase(txin.prevout);
490 mapTransactions.erase(GetHash());
491 nTransactionsUpdated++;
501 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
503 if (hashBlock == 0 || nIndex == -1)
506 // Find the block it claims to be in
507 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
508 if (mi == mapBlockIndex.end())
510 CBlockIndex* pindex = (*mi).second;
511 if (!pindex || !pindex->IsInMainChain())
514 // Make sure the merkle branch connects to this block
515 if (!fMerkleVerified)
517 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
519 fMerkleVerified = true;
522 nHeightRet = pindex->nHeight;
523 return pindexBest->nHeight - pindex->nHeight + 1;
527 int CMerkleTx::GetBlocksToMaturity() const
531 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
535 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
539 if (!IsInMainChain() && !ClientConnectInputs())
541 return CTransaction::AcceptToMemoryPool(txdb, false);
545 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
549 bool CMerkleTx::AcceptToMemoryPool()
552 return AcceptToMemoryPool(txdb);
557 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
559 CRITICAL_BLOCK(cs_mapTransactions)
561 // Add previous supporting transactions first
562 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
564 if (!tx.IsCoinBase())
566 uint256 hash = tx.GetHash();
567 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
568 tx.AcceptToMemoryPool(txdb, fCheckInputs);
571 return AcceptToMemoryPool(txdb, fCheckInputs);
576 bool CWalletTx::AcceptWalletTransaction()
579 return AcceptWalletTransaction(txdb);
582 int CTxIndex::GetDepthInMainChain() const
586 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
588 // Find the block in the index
589 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
590 if (mi == mapBlockIndex.end())
592 CBlockIndex* pindex = (*mi).second;
593 if (!pindex || !pindex->IsInMainChain())
595 return 1 + nBestHeight - pindex->nHeight;
607 //////////////////////////////////////////////////////////////////////////////
609 // CBlock and CBlockIndex
612 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
614 if (!fReadTransactions)
616 *this = pindex->GetBlockHeader();
619 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
621 if (GetHash() != pindex->GetBlockHash())
622 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
626 uint256 static GetOrphanRoot(const CBlock* pblock)
628 // Work back to the first block in the orphan chain
629 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
630 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
631 return pblock->GetHash();
634 int64 static GetBlockValue(int nHeight, int64 nFees)
636 int64 nSubsidy = 50 * COIN;
638 // Subsidy is cut in half every 4 years
639 nSubsidy >>= (nHeight / 210000);
641 return nSubsidy + nFees;
644 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
646 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
647 const int64 nTargetSpacing = 10 * 60;
648 const int64 nInterval = nTargetTimespan / nTargetSpacing;
651 if (pindexLast == NULL)
652 return bnProofOfWorkLimit.GetCompact();
654 // Only change once per interval
655 if ((pindexLast->nHeight+1) % nInterval != 0)
656 return pindexLast->nBits;
658 // Go back by what we want to be 14 days worth of blocks
659 const CBlockIndex* pindexFirst = pindexLast;
660 for (int i = 0; pindexFirst && i < nInterval-1; i++)
661 pindexFirst = pindexFirst->pprev;
664 // Limit adjustment step
665 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
666 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
667 if (nActualTimespan < nTargetTimespan/4)
668 nActualTimespan = nTargetTimespan/4;
669 if (nActualTimespan > nTargetTimespan*4)
670 nActualTimespan = nTargetTimespan*4;
674 bnNew.SetCompact(pindexLast->nBits);
675 bnNew *= nActualTimespan;
676 bnNew /= nTargetTimespan;
678 if (bnNew > bnProofOfWorkLimit)
679 bnNew = bnProofOfWorkLimit;
682 printf("GetNextWorkRequired RETARGET\n");
683 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
684 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
685 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
687 return bnNew.GetCompact();
690 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
693 bnTarget.SetCompact(nBits);
696 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
697 return error("CheckProofOfWork() : nBits below minimum work");
699 // Check proof of work matches claimed amount
700 if (hash > bnTarget.getuint256())
701 return error("CheckProofOfWork() : hash doesn't match nBits");
706 // Return conservative estimate of total number of blocks, 0 if unknown
707 int GetTotalBlocksEstimate()
715 return nTotalBlocksEstimate;
719 bool IsInitialBlockDownload()
721 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
723 static int64 nLastUpdate;
724 static CBlockIndex* pindexLastBest;
725 if (pindexBest != pindexLastBest)
727 pindexLastBest = pindexBest;
728 nLastUpdate = GetTime();
730 return (GetTime() - nLastUpdate < 10 &&
731 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
734 void static InvalidChainFound(CBlockIndex* pindexNew)
736 if (pindexNew->bnChainWork > bnBestInvalidWork)
738 bnBestInvalidWork = pindexNew->bnChainWork;
739 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
742 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());
743 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
744 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
745 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
758 bool CTransaction::DisconnectInputs(CTxDB& txdb)
760 // Relinquish previous transactions' spent pointers
763 BOOST_FOREACH(const CTxIn& txin, vin)
765 COutPoint prevout = txin.prevout;
767 // Get prev txindex from disk
769 if (!txdb.ReadTxIndex(prevout.hash, txindex))
770 return error("DisconnectInputs() : ReadTxIndex failed");
772 if (prevout.n >= txindex.vSpent.size())
773 return error("DisconnectInputs() : prevout.n out of range");
775 // Mark outpoint as not spent
776 txindex.vSpent[prevout.n].SetNull();
779 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
780 return error("DisconnectInputs() : UpdateTxIndex failed");
784 // Remove transaction from index
785 if (!txdb.EraseTxIndex(*this))
786 return error("DisconnectInputs() : EraseTxPos failed");
792 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
793 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
795 // Take over previous transactions' spent pointers
799 for (int i = 0; i < vin.size(); i++)
801 COutPoint prevout = vin[i].prevout;
806 if (fMiner && mapTestPool.count(prevout.hash))
808 // Get txindex from current proposed changes
809 txindex = mapTestPool[prevout.hash];
813 // Read txindex from txdb
814 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
816 if (!fFound && (fBlock || fMiner))
817 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());
821 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
823 // Get prev tx from single transactions in memory
824 CRITICAL_BLOCK(cs_mapTransactions)
826 if (!mapTransactions.count(prevout.hash))
827 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
828 txPrev = mapTransactions[prevout.hash];
831 txindex.vSpent.resize(txPrev.vout.size());
835 // Get prev tx from disk
836 if (!txPrev.ReadFromDisk(txindex.pos))
837 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
840 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
841 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());
843 // If prev is coinbase, check that it's matured
844 if (txPrev.IsCoinBase())
845 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
846 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
847 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
850 if (!VerifySignature(txPrev, *this, i))
851 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
853 // Check for conflicts
854 if (!txindex.vSpent[prevout.n].IsNull())
855 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());
857 // Check for negative or overflow input values
858 nValueIn += txPrev.vout[prevout.n].nValue;
859 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
860 return error("ConnectInputs() : txin values out of range");
862 // Mark outpoints as spent
863 txindex.vSpent[prevout.n] = posThisTx;
868 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
869 return error("ConnectInputs() : UpdateTxIndex failed");
873 mapTestPool[prevout.hash] = txindex;
877 if (nValueIn < GetValueOut())
878 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
880 // Tally transaction fees
881 int64 nTxFee = nValueIn - GetValueOut();
883 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
884 if (nTxFee < nMinFee)
887 if (!MoneyRange(nFees))
888 return error("ConnectInputs() : nFees out of range");
893 // Add transaction to disk index
894 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
895 return error("ConnectInputs() : AddTxPos failed");
899 // Add transaction to test pool
900 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
907 bool CTransaction::ClientConnectInputs()
912 // Take over previous transactions' spent pointers
913 CRITICAL_BLOCK(cs_mapTransactions)
916 for (int i = 0; i < vin.size(); i++)
918 // Get prev tx from single transactions in memory
919 COutPoint prevout = vin[i].prevout;
920 if (!mapTransactions.count(prevout.hash))
922 CTransaction& txPrev = mapTransactions[prevout.hash];
924 if (prevout.n >= txPrev.vout.size())
928 if (!VerifySignature(txPrev, *this, i))
929 return error("ConnectInputs() : VerifySignature failed");
931 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
932 ///// this has to go away now that posNext is gone
933 // // Check for conflicts
934 // if (!txPrev.vout[prevout.n].posNext.IsNull())
935 // return error("ConnectInputs() : prev tx already used");
937 // // Flag outpoints as used
938 // txPrev.vout[prevout.n].posNext = posThisTx;
940 nValueIn += txPrev.vout[prevout.n].nValue;
942 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
943 return error("ClientConnectInputs() : txin values out of range");
945 if (GetValueOut() > nValueIn)
955 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
957 // Disconnect in reverse order
958 for (int i = vtx.size()-1; i >= 0; i--)
959 if (!vtx[i].DisconnectInputs(txdb))
962 // Update block index on disk without changing it in memory.
963 // The memory index structure will be changed after the db commits.
966 CDiskBlockIndex blockindexPrev(pindex->pprev);
967 blockindexPrev.hashNext = 0;
968 if (!txdb.WriteBlockIndex(blockindexPrev))
969 return error("DisconnectBlock() : WriteBlockIndex failed");
975 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
977 // Check it again in case a previous version let a bad block in
981 //// issue here: it doesn't know the version
982 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
984 map<uint256, CTxIndex> mapUnused;
986 BOOST_FOREACH(CTransaction& tx, vtx)
988 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
989 nTxPos += ::GetSerializeSize(tx, SER_DISK);
991 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
995 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
998 // Update block index on disk without changing it in memory.
999 // The memory index structure will be changed after the db commits.
1002 CDiskBlockIndex blockindexPrev(pindex->pprev);
1003 blockindexPrev.hashNext = pindex->GetBlockHash();
1004 if (!txdb.WriteBlockIndex(blockindexPrev))
1005 return error("ConnectBlock() : WriteBlockIndex failed");
1008 // Watch for transactions paying to me
1009 BOOST_FOREACH(CTransaction& tx, vtx)
1010 SyncWithWallets(tx, this, true);
1015 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1017 printf("REORGANIZE\n");
1020 CBlockIndex* pfork = pindexBest;
1021 CBlockIndex* plonger = pindexNew;
1022 while (pfork != plonger)
1024 while (plonger->nHeight > pfork->nHeight)
1025 if (!(plonger = plonger->pprev))
1026 return error("Reorganize() : plonger->pprev is null");
1027 if (pfork == plonger)
1029 if (!(pfork = pfork->pprev))
1030 return error("Reorganize() : pfork->pprev is null");
1033 // List of what to disconnect
1034 vector<CBlockIndex*> vDisconnect;
1035 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1036 vDisconnect.push_back(pindex);
1038 // List of what to connect
1039 vector<CBlockIndex*> vConnect;
1040 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1041 vConnect.push_back(pindex);
1042 reverse(vConnect.begin(), vConnect.end());
1044 // Disconnect shorter branch
1045 vector<CTransaction> vResurrect;
1046 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1049 if (!block.ReadFromDisk(pindex))
1050 return error("Reorganize() : ReadFromDisk for disconnect failed");
1051 if (!block.DisconnectBlock(txdb, pindex))
1052 return error("Reorganize() : DisconnectBlock failed");
1054 // Queue memory transactions to resurrect
1055 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1056 if (!tx.IsCoinBase())
1057 vResurrect.push_back(tx);
1060 // Connect longer branch
1061 vector<CTransaction> vDelete;
1062 for (int i = 0; i < vConnect.size(); i++)
1064 CBlockIndex* pindex = vConnect[i];
1066 if (!block.ReadFromDisk(pindex))
1067 return error("Reorganize() : ReadFromDisk for connect failed");
1068 if (!block.ConnectBlock(txdb, pindex))
1072 return error("Reorganize() : ConnectBlock failed");
1075 // Queue memory transactions to delete
1076 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1077 vDelete.push_back(tx);
1079 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1080 return error("Reorganize() : WriteHashBestChain failed");
1082 // Make sure it's successfully written to disk before changing memory structure
1083 if (!txdb.TxnCommit())
1084 return error("Reorganize() : TxnCommit failed");
1086 // Disconnect shorter branch
1087 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1089 pindex->pprev->pnext = NULL;
1091 // Connect longer branch
1092 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1094 pindex->pprev->pnext = pindex;
1096 // Resurrect memory transactions that were in the disconnected branch
1097 BOOST_FOREACH(CTransaction& tx, vResurrect)
1098 tx.AcceptToMemoryPool(txdb, false);
1100 // Delete redundant memory transactions that are in the connected branch
1101 BOOST_FOREACH(CTransaction& tx, vDelete)
1102 tx.RemoveFromMemoryPool();
1108 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1110 uint256 hash = GetHash();
1113 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1115 txdb.WriteHashBestChain(hash);
1116 if (!txdb.TxnCommit())
1117 return error("SetBestChain() : TxnCommit failed");
1118 pindexGenesisBlock = pindexNew;
1120 else if (hashPrevBlock == hashBestChain)
1122 // Adding to current best branch
1123 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1126 InvalidChainFound(pindexNew);
1127 return error("SetBestChain() : ConnectBlock failed");
1129 if (!txdb.TxnCommit())
1130 return error("SetBestChain() : TxnCommit failed");
1132 // Add to current best branch
1133 pindexNew->pprev->pnext = pindexNew;
1135 // Delete redundant memory transactions
1136 BOOST_FOREACH(CTransaction& tx, vtx)
1137 tx.RemoveFromMemoryPool();
1142 if (!Reorganize(txdb, pindexNew))
1145 InvalidChainFound(pindexNew);
1146 return error("SetBestChain() : Reorganize failed");
1150 // Update best block in wallet (so we can detect restored wallets)
1151 if (!IsInitialBlockDownload())
1153 const CBlockLocator locator(pindexNew);
1154 ::SetBestChain(locator);
1158 hashBestChain = hash;
1159 pindexBest = pindexNew;
1160 nBestHeight = pindexBest->nHeight;
1161 bnBestChainWork = pindexNew->bnChainWork;
1162 nTimeBestReceived = GetTime();
1163 nTransactionsUpdated++;
1164 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1170 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1172 // Check for duplicate
1173 uint256 hash = GetHash();
1174 if (mapBlockIndex.count(hash))
1175 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1177 // Construct new block index object
1178 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1180 return error("AddToBlockIndex() : new CBlockIndex failed");
1181 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1182 pindexNew->phashBlock = &((*mi).first);
1183 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1184 if (miPrev != mapBlockIndex.end())
1186 pindexNew->pprev = (*miPrev).second;
1187 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1189 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1193 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1194 if (!txdb.TxnCommit())
1198 if (pindexNew->bnChainWork > bnBestChainWork)
1199 if (!SetBestChain(txdb, pindexNew))
1204 if (pindexNew == pindexBest)
1206 // Notify UI to display prev block's coinbase if it was ours
1207 static uint256 hashPrevBestCoinBase;
1208 UpdatedTransaction(hashPrevBestCoinBase);
1209 hashPrevBestCoinBase = vtx[0].GetHash();
1219 bool CBlock::CheckBlock() const
1221 // These are checks that are independent of context
1222 // that can be verified before saving an orphan block.
1225 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1226 return error("CheckBlock() : size limits failed");
1228 // Check proof of work matches claimed amount
1229 if (!CheckProofOfWork(GetHash(), nBits))
1230 return error("CheckBlock() : proof of work failed");
1233 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1234 return error("CheckBlock() : block timestamp too far in the future");
1236 // First transaction must be coinbase, the rest must not be
1237 if (vtx.empty() || !vtx[0].IsCoinBase())
1238 return error("CheckBlock() : first tx is not coinbase");
1239 for (int i = 1; i < vtx.size(); i++)
1240 if (vtx[i].IsCoinBase())
1241 return error("CheckBlock() : more than one coinbase");
1243 // Check transactions
1244 BOOST_FOREACH(const CTransaction& tx, vtx)
1245 if (!tx.CheckTransaction())
1246 return error("CheckBlock() : CheckTransaction failed");
1248 // Check that it's not full of nonstandard transactions
1249 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1250 return error("CheckBlock() : too many nonstandard transactions");
1253 if (hashMerkleRoot != BuildMerkleTree())
1254 return error("CheckBlock() : hashMerkleRoot mismatch");
1259 bool CBlock::AcceptBlock()
1261 // Check for duplicate
1262 uint256 hash = GetHash();
1263 if (mapBlockIndex.count(hash))
1264 return error("AcceptBlock() : block already in mapBlockIndex");
1266 // Get prev block index
1267 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1268 if (mi == mapBlockIndex.end())
1269 return error("AcceptBlock() : prev block not found");
1270 CBlockIndex* pindexPrev = (*mi).second;
1271 int nHeight = pindexPrev->nHeight+1;
1273 // Check proof of work
1274 if (nBits != GetNextWorkRequired(pindexPrev))
1275 return error("AcceptBlock() : incorrect proof of work");
1277 // Check timestamp against prev
1278 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1279 return error("AcceptBlock() : block's timestamp is too early");
1281 // Check that all transactions are finalized
1282 BOOST_FOREACH(const CTransaction& tx, vtx)
1283 if (!tx.IsFinal(nHeight, GetBlockTime()))
1284 return error("AcceptBlock() : contains a non-final transaction");
1286 // Check that the block chain matches the known block chain up to a checkpoint
1288 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1289 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1290 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1291 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1292 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1293 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1294 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1295 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")))
1296 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1298 // Write block to history file
1299 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1300 return error("AcceptBlock() : out of disk space");
1301 unsigned int nFile = -1;
1302 unsigned int nBlockPos = 0;
1303 if (!WriteToDisk(nFile, nBlockPos))
1304 return error("AcceptBlock() : WriteToDisk failed");
1305 if (!AddToBlockIndex(nFile, nBlockPos))
1306 return error("AcceptBlock() : AddToBlockIndex failed");
1308 // Relay inventory, but don't relay old inventory during initial block download
1309 if (hashBestChain == hash)
1310 CRITICAL_BLOCK(cs_vNodes)
1311 BOOST_FOREACH(CNode* pnode, vNodes)
1312 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 134444))
1313 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1318 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1320 // Check for duplicate
1321 uint256 hash = pblock->GetHash();
1322 if (mapBlockIndex.count(hash))
1323 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1324 if (mapOrphanBlocks.count(hash))
1325 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1327 // Preliminary checks
1328 if (!pblock->CheckBlock())
1329 return error("ProcessBlock() : CheckBlock FAILED");
1331 // If don't already have its previous block, shunt it off to holding area until we get it
1332 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1334 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1335 CBlock* pblock2 = new CBlock(*pblock);
1336 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1337 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1339 // Ask this guy to fill in what we're missing
1341 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1346 if (!pblock->AcceptBlock())
1347 return error("ProcessBlock() : AcceptBlock FAILED");
1349 // Recursively process any orphan blocks that depended on this one
1350 vector<uint256> vWorkQueue;
1351 vWorkQueue.push_back(hash);
1352 for (int i = 0; i < vWorkQueue.size(); i++)
1354 uint256 hashPrev = vWorkQueue[i];
1355 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1356 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1359 CBlock* pblockOrphan = (*mi).second;
1360 if (pblockOrphan->AcceptBlock())
1361 vWorkQueue.push_back(pblockOrphan->GetHash());
1362 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1363 delete pblockOrphan;
1365 mapOrphanBlocksByPrev.erase(hashPrev);
1368 printf("ProcessBlock: ACCEPTED\n");
1379 template<typename Stream>
1380 bool static ScanMessageStart(Stream& s)
1382 // Scan ahead to the next pchMessageStart, which should normally be immediately
1383 // at the file pointer. Leaves file pointer at end of pchMessageStart.
1385 short prevmask = s.exceptions(0);
1386 const char* p = BEGIN(pchMessageStart);
1396 s.exceptions(prevmask);
1400 p = BEGIN(pchMessageStart);
1403 if (++p == END(pchMessageStart))
1406 s.exceptions(prevmask);
1415 s.exceptions(prevmask);
1420 bool CheckDiskSpace(uint64 nAdditionalBytes)
1422 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1424 // Check for 15MB because database could create another 10MB log file at any time
1425 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1428 string strMessage = _("Warning: Disk space is low ");
1429 strMiscWarning = strMessage;
1430 printf("*** %s\n", strMessage.c_str());
1431 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1432 CreateThread(Shutdown, NULL);
1438 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1442 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1445 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1447 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1456 static unsigned int nCurrentBlockFile = 1;
1458 FILE* AppendBlockFile(unsigned int& nFileRet)
1463 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1466 if (fseek(file, 0, SEEK_END) != 0)
1468 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1469 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1471 nFileRet = nCurrentBlockFile;
1475 nCurrentBlockFile++;
1479 bool LoadBlockIndex(bool fAllowNew)
1483 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1484 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1485 pchMessageStart[0] = 0xfa;
1486 pchMessageStart[1] = 0xbf;
1487 pchMessageStart[2] = 0xb5;
1488 pchMessageStart[3] = 0xda;
1495 if (!txdb.LoadBlockIndex())
1500 // Init with genesis block
1502 if (mapBlockIndex.empty())
1508 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1509 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1510 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1511 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1512 // vMerkleTree: 4a5e1e
1515 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1517 txNew.vin.resize(1);
1518 txNew.vout.resize(1);
1519 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1520 txNew.vout[0].nValue = 50 * COIN;
1521 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1523 block.vtx.push_back(txNew);
1524 block.hashPrevBlock = 0;
1525 block.hashMerkleRoot = block.BuildMerkleTree();
1527 block.nTime = 1231006505;
1528 block.nBits = 0x1d00ffff;
1529 block.nNonce = 2083236893;
1533 block.nTime = 1296688602;
1534 block.nBits = 0x1d07fff8;
1535 block.nNonce = 384568319;
1539 printf("%s\n", block.GetHash().ToString().c_str());
1540 printf("%s\n", hashGenesisBlock.ToString().c_str());
1541 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1542 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1544 assert(block.GetHash() == hashGenesisBlock);
1546 // Start new block file
1548 unsigned int nBlockPos;
1549 if (!block.WriteToDisk(nFile, nBlockPos))
1550 return error("LoadBlockIndex() : writing genesis block to disk failed");
1551 if (!block.AddToBlockIndex(nFile, nBlockPos))
1552 return error("LoadBlockIndex() : genesis block not accepted");
1560 void PrintBlockTree()
1562 // precompute tree structure
1563 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1564 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1566 CBlockIndex* pindex = (*mi).second;
1567 mapNext[pindex->pprev].push_back(pindex);
1569 //while (rand() % 3 == 0)
1570 // mapNext[pindex->pprev].push_back(pindex);
1573 vector<pair<int, CBlockIndex*> > vStack;
1574 vStack.push_back(make_pair(0, pindexGenesisBlock));
1577 while (!vStack.empty())
1579 int nCol = vStack.back().first;
1580 CBlockIndex* pindex = vStack.back().second;
1583 // print split or gap
1584 if (nCol > nPrevCol)
1586 for (int i = 0; i < nCol-1; i++)
1590 else if (nCol < nPrevCol)
1592 for (int i = 0; i < nCol; i++)
1599 for (int i = 0; i < nCol; i++)
1604 block.ReadFromDisk(pindex);
1605 printf("%d (%u,%u) %s %s tx %d",
1609 block.GetHash().ToString().substr(0,20).c_str(),
1610 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1613 PrintWallets(block);
1615 // put the main timechain first
1616 vector<CBlockIndex*>& vNext = mapNext[pindex];
1617 for (int i = 0; i < vNext.size(); i++)
1619 if (vNext[i]->pnext)
1621 swap(vNext[0], vNext[i]);
1627 for (int i = 0; i < vNext.size(); i++)
1628 vStack.push_back(make_pair(nCol+i, vNext[i]));
1641 //////////////////////////////////////////////////////////////////////////////
1646 map<uint256, CAlert> mapAlerts;
1647 CCriticalSection cs_mapAlerts;
1649 string GetWarnings(string strFor)
1652 string strStatusBar;
1654 if (GetBoolArg("-testsafemode"))
1657 // Misc warnings like out of disk space and clock is wrong
1658 if (strMiscWarning != "")
1661 strStatusBar = strMiscWarning;
1664 // Longer invalid proof-of-work chain
1665 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1668 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1672 CRITICAL_BLOCK(cs_mapAlerts)
1674 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1676 const CAlert& alert = item.second;
1677 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1679 nPriority = alert.nPriority;
1680 strStatusBar = alert.strStatusBar;
1685 if (strFor == "statusbar")
1686 return strStatusBar;
1687 else if (strFor == "rpc")
1689 assert(!"GetWarnings() : invalid parameter");
1693 bool CAlert::ProcessAlert()
1695 if (!CheckSignature())
1700 CRITICAL_BLOCK(cs_mapAlerts)
1702 // Cancel previous alerts
1703 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1705 const CAlert& alert = (*mi).second;
1708 printf("cancelling alert %d\n", alert.nID);
1709 mapAlerts.erase(mi++);
1711 else if (!alert.IsInEffect())
1713 printf("expiring alert %d\n", alert.nID);
1714 mapAlerts.erase(mi++);
1720 // Check if this alert has been cancelled
1721 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1723 const CAlert& alert = item.second;
1724 if (alert.Cancels(*this))
1726 printf("alert already cancelled by %d\n", alert.nID);
1732 mapAlerts.insert(make_pair(GetHash(), *this));
1735 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1747 //////////////////////////////////////////////////////////////////////////////
1753 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1757 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1758 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1760 // Don't know what it is, just say we already got one
1767 // The message start string is designed to be unlikely to occur in normal data.
1768 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1769 // a large 4-byte int at any alignment.
1770 char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1773 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1775 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1776 RandAddSeedPerfmon();
1778 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1779 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1780 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1782 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1790 if (strCommand == "version")
1792 // Each connection can only send one version message
1793 if (pfrom->nVersion != 0)
1800 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1801 if (pfrom->nVersion == 10300)
1802 pfrom->nVersion = 300;
1803 if (pfrom->nVersion >= 106 && !vRecv.empty())
1804 vRecv >> addrFrom >> nNonce;
1805 if (pfrom->nVersion >= 106 && !vRecv.empty())
1806 vRecv >> pfrom->strSubVer;
1807 if (pfrom->nVersion >= 209 && !vRecv.empty())
1808 vRecv >> pfrom->nStartingHeight;
1810 if (pfrom->nVersion == 0)
1813 // Disconnect if we connected to ourself
1814 if (nNonce == nLocalHostNonce && nNonce > 1)
1816 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1817 pfrom->fDisconnect = true;
1821 // Be shy and don't send version until we hear
1822 if (pfrom->fInbound)
1823 pfrom->PushVersion();
1825 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1827 AddTimeData(pfrom->addr.ip, nTime);
1830 if (pfrom->nVersion >= 209)
1831 pfrom->PushMessage("verack");
1832 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1833 if (pfrom->nVersion < 209)
1834 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1836 if (!pfrom->fInbound)
1838 // Advertise our address
1839 if (addrLocalHost.IsRoutable() && !fUseProxy)
1841 CAddress addr(addrLocalHost);
1842 addr.nTime = GetAdjustedTime();
1843 pfrom->PushAddress(addr);
1846 // Get recent addresses
1847 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1849 pfrom->PushMessage("getaddr");
1850 pfrom->fGetAddr = true;
1854 // Ask the first connected node for block updates
1855 static int nAskedForBlocks;
1856 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
1859 pfrom->PushGetBlocks(pindexBest, uint256(0));
1863 CRITICAL_BLOCK(cs_mapAlerts)
1864 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1865 item.second.RelayTo(pfrom);
1867 pfrom->fSuccessfullyConnected = true;
1869 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1873 else if (pfrom->nVersion == 0)
1875 // Must have a version message before anything else
1880 else if (strCommand == "verack")
1882 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1886 else if (strCommand == "addr")
1888 vector<CAddress> vAddr;
1891 // Don't want addr from older versions unless seeding
1892 if (pfrom->nVersion < 209)
1894 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1896 if (vAddr.size() > 1000)
1897 return error("message addr size() = %d", vAddr.size());
1899 // Store the new addresses
1902 int64 nNow = GetAdjustedTime();
1903 int64 nSince = nNow - 10 * 60;
1904 BOOST_FOREACH(CAddress& addr, vAddr)
1908 // ignore IPv6 for now, since it isn't implemented anyway
1911 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1912 addr.nTime = nNow - 5 * 24 * 60 * 60;
1913 AddAddress(addr, 2 * 60 * 60, &addrDB);
1914 pfrom->AddAddressKnown(addr);
1915 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1917 // Relay to a limited number of other nodes
1918 CRITICAL_BLOCK(cs_vNodes)
1920 // Use deterministic randomness to send to the same nodes for 24 hours
1921 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1922 static uint256 hashSalt;
1924 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1925 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1926 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1927 multimap<uint256, CNode*> mapMix;
1928 BOOST_FOREACH(CNode* pnode, vNodes)
1930 if (pnode->nVersion < 31402)
1932 unsigned int nPointer;
1933 memcpy(&nPointer, &pnode, sizeof(nPointer));
1934 uint256 hashKey = hashRand ^ nPointer;
1935 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1936 mapMix.insert(make_pair(hashKey, pnode));
1938 int nRelayNodes = 2;
1939 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1940 ((*mi).second)->PushAddress(addr);
1944 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1945 if (vAddr.size() < 1000)
1946 pfrom->fGetAddr = false;
1950 else if (strCommand == "inv")
1954 if (vInv.size() > 50000)
1955 return error("message inv size() = %d", vInv.size());
1958 BOOST_FOREACH(const CInv& inv, vInv)
1962 pfrom->AddInventoryKnown(inv);
1964 bool fAlreadyHave = AlreadyHave(txdb, inv);
1965 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1969 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1970 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1972 // Track requests for our stuff
1973 Inventory(inv.hash);
1978 else if (strCommand == "getdata")
1982 if (vInv.size() > 50000)
1983 return error("message getdata size() = %d", vInv.size());
1985 BOOST_FOREACH(const CInv& inv, vInv)
1989 printf("received getdata for: %s\n", inv.ToString().c_str());
1991 if (inv.type == MSG_BLOCK)
1993 // Send block from disk
1994 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1995 if (mi != mapBlockIndex.end())
1998 block.ReadFromDisk((*mi).second);
1999 pfrom->PushMessage("block", block);
2001 // Trigger them to send a getblocks request for the next batch of inventory
2002 if (inv.hash == pfrom->hashContinue)
2004 // Bypass PushInventory, this must send even if redundant,
2005 // and we want it right after the last block so they don't
2006 // wait for other stuff first.
2008 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2009 pfrom->PushMessage("inv", vInv);
2010 pfrom->hashContinue = 0;
2014 else if (inv.IsKnownType())
2016 // Send stream from relay memory
2017 CRITICAL_BLOCK(cs_mapRelay)
2019 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2020 if (mi != mapRelay.end())
2021 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2025 // Track requests for our stuff
2026 Inventory(inv.hash);
2031 else if (strCommand == "getblocks")
2033 CBlockLocator locator;
2035 vRecv >> locator >> hashStop;
2037 // Find the last block the caller has in the main chain
2038 CBlockIndex* pindex = locator.GetBlockIndex();
2040 // Send the rest of the chain
2042 pindex = pindex->pnext;
2043 int nLimit = 500 + locator.GetDistanceBack();
2044 unsigned int nBytes = 0;
2045 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2046 for (; pindex; pindex = pindex->pnext)
2048 if (pindex->GetBlockHash() == hashStop)
2050 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2053 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2055 block.ReadFromDisk(pindex, true);
2056 nBytes += block.GetSerializeSize(SER_NETWORK);
2057 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2059 // When this block is requested, we'll send an inv that'll make them
2060 // getblocks the next batch of inventory.
2061 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2062 pfrom->hashContinue = pindex->GetBlockHash();
2069 else if (strCommand == "getheaders")
2071 CBlockLocator locator;
2073 vRecv >> locator >> hashStop;
2075 CBlockIndex* pindex = NULL;
2076 if (locator.IsNull())
2078 // If locator is null, return the hashStop block
2079 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2080 if (mi == mapBlockIndex.end())
2082 pindex = (*mi).second;
2086 // Find the last block the caller has in the main chain
2087 pindex = locator.GetBlockIndex();
2089 pindex = pindex->pnext;
2092 vector<CBlock> vHeaders;
2093 int nLimit = 2000 + locator.GetDistanceBack();
2094 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2095 for (; pindex; pindex = pindex->pnext)
2097 vHeaders.push_back(pindex->GetBlockHeader());
2098 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2101 pfrom->PushMessage("headers", vHeaders);
2105 else if (strCommand == "tx")
2107 vector<uint256> vWorkQueue;
2108 CDataStream vMsg(vRecv);
2112 CInv inv(MSG_TX, tx.GetHash());
2113 pfrom->AddInventoryKnown(inv);
2115 bool fMissingInputs = false;
2116 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2118 SyncWithWallets(tx, NULL, true);
2119 RelayMessage(inv, vMsg);
2120 mapAlreadyAskedFor.erase(inv);
2121 vWorkQueue.push_back(inv.hash);
2123 // Recursively process any orphan transactions that depended on this one
2124 for (int i = 0; i < vWorkQueue.size(); i++)
2126 uint256 hashPrev = vWorkQueue[i];
2127 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2128 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2131 const CDataStream& vMsg = *((*mi).second);
2133 CDataStream(vMsg) >> tx;
2134 CInv inv(MSG_TX, tx.GetHash());
2136 if (tx.AcceptToMemoryPool(true))
2138 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2139 SyncWithWallets(tx, NULL, true);
2140 RelayMessage(inv, vMsg);
2141 mapAlreadyAskedFor.erase(inv);
2142 vWorkQueue.push_back(inv.hash);
2147 BOOST_FOREACH(uint256 hash, vWorkQueue)
2148 EraseOrphanTx(hash);
2150 else if (fMissingInputs)
2152 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2158 else if (strCommand == "block")
2163 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2166 CInv inv(MSG_BLOCK, block.GetHash());
2167 pfrom->AddInventoryKnown(inv);
2169 if (ProcessBlock(pfrom, &block))
2170 mapAlreadyAskedFor.erase(inv);
2174 else if (strCommand == "getaddr")
2176 // Nodes rebroadcast an addr every 24 hours
2177 pfrom->vAddrToSend.clear();
2178 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2179 CRITICAL_BLOCK(cs_mapAddresses)
2181 unsigned int nCount = 0;
2182 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2184 const CAddress& addr = item.second;
2185 if (addr.nTime > nSince)
2188 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2190 const CAddress& addr = item.second;
2191 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2192 pfrom->PushAddress(addr);
2198 else if (strCommand == "checkorder")
2203 if (!GetBoolArg("-allowreceivebyip"))
2205 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2212 /// we have a chance to check the order here
2214 // Keep giving the same key to the same ip until they use it
2215 if (!mapReuseKey.count(pfrom->addr.ip))
2216 mapReuseKey[pfrom->addr.ip] = pwalletMain->GetOrReuseKeyFromPool();
2218 // Send back approval of order and pubkey to use
2219 CScript scriptPubKey;
2220 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2221 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2225 else if (strCommand == "reply")
2230 CRequestTracker tracker;
2231 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2233 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2234 if (mi != pfrom->mapRequests.end())
2236 tracker = (*mi).second;
2237 pfrom->mapRequests.erase(mi);
2240 if (!tracker.IsNull())
2241 tracker.fn(tracker.param1, vRecv);
2245 else if (strCommand == "ping")
2250 else if (strCommand == "alert")
2255 if (alert.ProcessAlert())
2258 pfrom->setKnown.insert(alert.GetHash());
2259 CRITICAL_BLOCK(cs_vNodes)
2260 BOOST_FOREACH(CNode* pnode, vNodes)
2261 alert.RelayTo(pnode);
2268 // Ignore unknown commands for extensibility
2272 // Update the last seen time for this node's address
2273 if (pfrom->fNetworkNode)
2274 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2275 AddressCurrentlyConnected(pfrom->addr);
2281 bool ProcessMessages(CNode* pfrom)
2283 CDataStream& vRecv = pfrom->vRecv;
2287 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2291 // (4) message start
2300 // Scan for message start
2301 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2302 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2303 if (vRecv.end() - pstart < nHeaderSize)
2305 if (vRecv.size() > nHeaderSize)
2307 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2308 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2312 if (pstart - vRecv.begin() > 0)
2313 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2314 vRecv.erase(vRecv.begin(), pstart);
2317 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2322 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2325 string strCommand = hdr.GetCommand();
2328 unsigned int nMessageSize = hdr.nMessageSize;
2329 if (nMessageSize > MAX_SIZE)
2331 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2334 if (nMessageSize > vRecv.size())
2336 // Rewind and wait for rest of message
2337 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2342 if (vRecv.GetVersion() >= 209)
2344 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2345 unsigned int nChecksum = 0;
2346 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2347 if (nChecksum != hdr.nChecksum)
2349 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2350 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2355 // Copy message to its own buffer
2356 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2357 vRecv.ignore(nMessageSize);
2363 CRITICAL_BLOCK(cs_main)
2364 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2368 catch (std::ios_base::failure& e)
2370 if (strstr(e.what(), "end of data"))
2372 // Allow exceptions from underlength message on vRecv
2373 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());
2375 else if (strstr(e.what(), "size too large"))
2377 // Allow exceptions from overlong size
2378 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2382 PrintExceptionContinue(&e, "ProcessMessage()");
2385 catch (std::exception& e) {
2386 PrintExceptionContinue(&e, "ProcessMessage()");
2388 PrintExceptionContinue(NULL, "ProcessMessage()");
2392 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2400 bool SendMessages(CNode* pto, bool fSendTrickle)
2402 CRITICAL_BLOCK(cs_main)
2404 // Don't send anything until we get their version message
2405 if (pto->nVersion == 0)
2409 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2410 pto->PushMessage("ping");
2412 // Resend wallet transactions that haven't gotten in a block yet
2413 ResendWalletTransactions();
2415 // Address refresh broadcast
2416 static int64 nLastRebroadcast;
2417 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2419 nLastRebroadcast = GetTime();
2420 CRITICAL_BLOCK(cs_vNodes)
2422 BOOST_FOREACH(CNode* pnode, vNodes)
2424 // Periodically clear setAddrKnown to allow refresh broadcasts
2425 pnode->setAddrKnown.clear();
2427 // Rebroadcast our address
2428 if (addrLocalHost.IsRoutable() && !fUseProxy)
2430 CAddress addr(addrLocalHost);
2431 addr.nTime = GetAdjustedTime();
2432 pnode->PushAddress(addr);
2438 // Clear out old addresses periodically so it's not too much work at once
2439 static int64 nLastClear;
2440 if (nLastClear == 0)
2441 nLastClear = GetTime();
2442 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2444 nLastClear = GetTime();
2445 CRITICAL_BLOCK(cs_mapAddresses)
2448 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2449 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2450 mi != mapAddresses.end();)
2452 const CAddress& addr = (*mi).second;
2453 if (addr.nTime < nSince)
2455 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2457 addrdb.EraseAddress(addr);
2458 mapAddresses.erase(mi++);
2472 vector<CAddress> vAddr;
2473 vAddr.reserve(pto->vAddrToSend.size());
2474 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2476 // returns true if wasn't already contained in the set
2477 if (pto->setAddrKnown.insert(addr).second)
2479 vAddr.push_back(addr);
2480 // receiver rejects addr messages larger than 1000
2481 if (vAddr.size() >= 1000)
2483 pto->PushMessage("addr", vAddr);
2488 pto->vAddrToSend.clear();
2490 pto->PushMessage("addr", vAddr);
2495 // Message: inventory
2498 vector<CInv> vInvWait;
2499 CRITICAL_BLOCK(pto->cs_inventory)
2501 vInv.reserve(pto->vInventoryToSend.size());
2502 vInvWait.reserve(pto->vInventoryToSend.size());
2503 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2505 if (pto->setInventoryKnown.count(inv))
2508 // trickle out tx inv to protect privacy
2509 if (inv.type == MSG_TX && !fSendTrickle)
2511 // 1/4 of tx invs blast to all immediately
2512 static uint256 hashSalt;
2514 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2515 uint256 hashRand = inv.hash ^ hashSalt;
2516 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2517 bool fTrickleWait = ((hashRand & 3) != 0);
2519 // always trickle our own transactions
2523 if (GetTransaction(inv.hash, wtx))
2525 fTrickleWait = true;
2530 vInvWait.push_back(inv);
2535 // returns true if wasn't already contained in the set
2536 if (pto->setInventoryKnown.insert(inv).second)
2538 vInv.push_back(inv);
2539 if (vInv.size() >= 1000)
2541 pto->PushMessage("inv", vInv);
2546 pto->vInventoryToSend = vInvWait;
2549 pto->PushMessage("inv", vInv);
2555 vector<CInv> vGetData;
2556 int64 nNow = GetTime() * 1000000;
2558 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2560 const CInv& inv = (*pto->mapAskFor.begin()).second;
2561 if (!AlreadyHave(txdb, inv))
2563 printf("sending getdata: %s\n", inv.ToString().c_str());
2564 vGetData.push_back(inv);
2565 if (vGetData.size() >= 1000)
2567 pto->PushMessage("getdata", vGetData);
2571 mapAlreadyAskedFor[inv] = nNow;
2572 pto->mapAskFor.erase(pto->mapAskFor.begin());
2574 if (!vGetData.empty())
2575 pto->PushMessage("getdata", vGetData);
2594 //////////////////////////////////////////////////////////////////////////////
2599 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2601 unsigned char* pdata = (unsigned char*)pbuffer;
2602 unsigned int blocks = 1 + ((len + 8) / 64);
2603 unsigned char* pend = pdata + 64 * blocks;
2604 memset(pdata + len, 0, 64 * blocks - len);
2606 unsigned int bits = len * 8;
2607 pend[-1] = (bits >> 0) & 0xff;
2608 pend[-2] = (bits >> 8) & 0xff;
2609 pend[-3] = (bits >> 16) & 0xff;
2610 pend[-4] = (bits >> 24) & 0xff;
2614 using CryptoPP::ByteReverse;
2616 static const unsigned int pSHA256InitState[8] =
2617 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2619 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2621 memcpy(pstate, pinit, 32);
2622 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2626 // ScanHash scans nonces looking for a hash with at least some zero bits.
2627 // It operates on big endian data. Caller does the byte reversing.
2628 // All input buffers are 16-byte aligned. nNonce is usually preserved
2629 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2630 // the block is rebuilt and nNonce starts over at zero.
2632 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2634 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2638 // Hash pdata using pmidstate as the starting state into
2639 // preformatted buffer phash1, then hash phash1 into phash
2641 SHA256Transform(phash1, pdata, pmidstate);
2642 SHA256Transform(phash, phash1, pSHA256InitState);
2644 // Return the nonce if the hash has at least some zero bits,
2645 // caller will check if it has enough to reach the target
2646 if (((unsigned short*)phash)[14] == 0)
2649 // If nothing found after trying for a while, return -1
2650 if ((nNonce & 0xffff) == 0)
2652 nHashesDone = 0xffff+1;
2663 set<uint256> setDependsOn;
2666 COrphan(CTransaction* ptxIn)
2674 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2675 BOOST_FOREACH(uint256 hash, setDependsOn)
2676 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2681 CBlock* CreateNewBlock(CReserveKey& reservekey)
2683 CBlockIndex* pindexPrev = pindexBest;
2686 auto_ptr<CBlock> pblock(new CBlock());
2690 // Create coinbase tx
2692 txNew.vin.resize(1);
2693 txNew.vin[0].prevout.SetNull();
2694 txNew.vout.resize(1);
2695 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2697 // Add our coinbase tx as first transaction
2698 pblock->vtx.push_back(txNew);
2700 // Collect memory pool transactions into the block
2702 CRITICAL_BLOCK(cs_main)
2703 CRITICAL_BLOCK(cs_mapTransactions)
2707 // Priority order to process transactions
2708 list<COrphan> vOrphan; // list memory doesn't move
2709 map<uint256, vector<COrphan*> > mapDependers;
2710 multimap<double, CTransaction*> mapPriority;
2711 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2713 CTransaction& tx = (*mi).second;
2714 if (tx.IsCoinBase() || !tx.IsFinal())
2717 COrphan* porphan = NULL;
2718 double dPriority = 0;
2719 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2721 // Read prev transaction
2722 CTransaction txPrev;
2724 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2726 // Has to wait for dependencies
2729 // Use list for automatic deletion
2730 vOrphan.push_back(COrphan(&tx));
2731 porphan = &vOrphan.back();
2733 mapDependers[txin.prevout.hash].push_back(porphan);
2734 porphan->setDependsOn.insert(txin.prevout.hash);
2737 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2739 // Read block header
2740 int nConf = txindex.GetDepthInMainChain();
2742 dPriority += (double)nValueIn * nConf;
2744 if (fDebug && GetBoolArg("-printpriority"))
2745 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2748 // Priority is sum(valuein * age) / txsize
2749 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2752 porphan->dPriority = dPriority;
2754 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2756 if (fDebug && GetBoolArg("-printpriority"))
2758 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2765 // Collect transactions into block
2766 map<uint256, CTxIndex> mapTestPool;
2767 uint64 nBlockSize = 1000;
2768 int nBlockSigOps = 100;
2769 while (!mapPriority.empty())
2771 // Take highest priority transaction off priority queue
2772 double dPriority = -(*mapPriority.begin()).first;
2773 CTransaction& tx = *(*mapPriority.begin()).second;
2774 mapPriority.erase(mapPriority.begin());
2777 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2778 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2780 int nTxSigOps = tx.GetSigOpCount();
2781 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2784 // Transaction fee required depends on block size
2785 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2786 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2788 // Connecting shouldn't fail due to dependency on other memory pool transactions
2789 // because we're already processing them in order of dependency
2790 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2791 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2793 swap(mapTestPool, mapTestPoolTmp);
2796 pblock->vtx.push_back(tx);
2797 nBlockSize += nTxSize;
2798 nBlockSigOps += nTxSigOps;
2800 // Add transactions that depend on this one to the priority queue
2801 uint256 hash = tx.GetHash();
2802 if (mapDependers.count(hash))
2804 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2806 if (!porphan->setDependsOn.empty())
2808 porphan->setDependsOn.erase(hash);
2809 if (porphan->setDependsOn.empty())
2810 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2816 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2819 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2820 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2821 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2822 pblock->nBits = GetNextWorkRequired(pindexPrev);
2825 return pblock.release();
2829 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
2831 // Update nExtraNonce
2832 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2833 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
2838 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
2839 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2843 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2846 // Prebuild hash buffers
2853 uint256 hashPrevBlock;
2854 uint256 hashMerkleRoot;
2857 unsigned int nNonce;
2860 unsigned char pchPadding0[64];
2862 unsigned char pchPadding1[64];
2865 memset(&tmp, 0, sizeof(tmp));
2867 tmp.block.nVersion = pblock->nVersion;
2868 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2869 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2870 tmp.block.nTime = pblock->nTime;
2871 tmp.block.nBits = pblock->nBits;
2872 tmp.block.nNonce = pblock->nNonce;
2874 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2875 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2877 // Byte swap all the input buffer
2878 for (int i = 0; i < sizeof(tmp)/4; i++)
2879 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2881 // Precalc the first half of the first hash, which stays constant
2882 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2884 memcpy(pdata, &tmp.block, 128);
2885 memcpy(phash1, &tmp.hash1, 64);
2889 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2891 uint256 hash = pblock->GetHash();
2892 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2894 if (hash > hashTarget)
2898 printf("BitcoinMiner:\n");
2899 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2901 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2902 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2905 CRITICAL_BLOCK(cs_main)
2907 if (pblock->hashPrevBlock != hashBestChain)
2908 return error("BitcoinMiner : generated block is stale");
2910 // Remove key from key pool
2911 reservekey.KeepKey();
2913 // Track how many getdata requests this block gets
2914 CRITICAL_BLOCK(wallet.cs_mapRequestCount)
2915 wallet.mapRequestCount[pblock->GetHash()] = 0;
2917 // Process this block the same as if we had received it from another node
2918 if (!ProcessBlock(NULL, pblock))
2919 return error("BitcoinMiner : ProcessBlock, block not accepted");
2926 void static ThreadBitcoinMiner(void* parg);
2928 void static BitcoinMiner(CWallet *pwallet)
2930 printf("BitcoinMiner started\n");
2931 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2933 // Each thread has its own key and counter
2934 CReserveKey reservekey(pwallet);
2935 unsigned int nExtraNonce = 0;
2936 int64 nPrevTime = 0;
2938 while (fGenerateBitcoins)
2940 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2944 while (vNodes.empty() || IsInitialBlockDownload())
2949 if (!fGenerateBitcoins)
2957 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2958 CBlockIndex* pindexPrev = pindexBest;
2960 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2963 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
2965 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2969 // Prebuild hash buffers
2971 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2972 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2973 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2975 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2977 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2978 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2984 int64 nStart = GetTime();
2985 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2987 uint256& hash = *alignup<16>(hashbuf);
2990 unsigned int nHashesDone = 0;
2991 unsigned int nNonceFound;
2994 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2995 (char*)&hash, nHashesDone);
2997 // Check if something found
2998 if (nNonceFound != -1)
3000 for (int i = 0; i < sizeof(hash)/4; i++)
3001 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3003 if (hash <= hashTarget)
3006 pblock->nNonce = ByteReverse(nNonceFound);
3007 assert(hash == pblock->GetHash());
3009 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3010 CheckWork(pblock.get(), *pwalletMain, reservekey);
3011 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3017 static int64 nHashCounter;
3018 if (nHPSTimerStart == 0)
3020 nHPSTimerStart = GetTimeMillis();
3024 nHashCounter += nHashesDone;
3025 if (GetTimeMillis() - nHPSTimerStart > 4000)
3027 static CCriticalSection cs;
3030 if (GetTimeMillis() - nHPSTimerStart > 4000)
3032 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3033 nHPSTimerStart = GetTimeMillis();
3035 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3036 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3037 static int64 nLogTime;
3038 if (GetTime() - nLogTime > 30 * 60)
3040 nLogTime = GetTime();
3041 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3042 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3048 // Check for stop or if block needs to be rebuilt
3051 if (!fGenerateBitcoins)
3053 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3057 if (nBlockNonce >= 0xffff0000)
3059 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3061 if (pindexPrev != pindexBest)
3064 // Update nTime every few seconds
3065 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3066 nBlockTime = ByteReverse(pblock->nTime);
3071 void static ThreadBitcoinMiner(void* parg)
3073 CWallet* pwallet = (CWallet*)parg;
3076 vnThreadsRunning[3]++;
3077 BitcoinMiner(pwallet);
3078 vnThreadsRunning[3]--;
3080 catch (std::exception& e) {
3081 vnThreadsRunning[3]--;
3082 PrintException(&e, "ThreadBitcoinMiner()");
3084 vnThreadsRunning[3]--;
3085 PrintException(NULL, "ThreadBitcoinMiner()");
3087 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3089 if (vnThreadsRunning[3] == 0)
3091 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3095 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3097 if (fGenerateBitcoins != fGenerate)
3099 fGenerateBitcoins = fGenerate;
3100 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3103 if (fGenerateBitcoins)
3105 int nProcessors = boost::thread::hardware_concurrency();
3106 printf("%d processors\n", nProcessors);
3107 if (nProcessors < 1)
3109 if (fLimitProcessors && nProcessors > nLimitProcessors)
3110 nProcessors = nLimitProcessors;
3111 int nAddThreads = nProcessors - vnThreadsRunning[3];
3112 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3113 for (int i = 0; i < nAddThreads; i++)
3115 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3116 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");