1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
9 #include "cryptopp/sha.h"
10 #include <boost/filesystem.hpp>
11 #include <boost/filesystem/fstream.hpp>
14 using namespace boost;
20 CCriticalSection cs_setpwalletRegistered;
21 set<CWallet*> setpwalletRegistered;
23 CCriticalSection cs_main;
25 static map<uint256, CTransaction> mapTransactions;
26 CCriticalSection cs_mapTransactions;
27 unsigned int nTransactionsUpdated = 0;
28 map<COutPoint, CInPoint> mapNextTx;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 const int nTotalBlocksEstimate = 140700; // Conservative estimate of total nr of blocks on main chain
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 int nMaxBlocksOfPeers = 0; // Amount of blocks that other nodes claim to have
36 CBlockIndex* pindexGenesisBlock = NULL;
38 CBigNum bnBestChainWork = 0;
39 CBigNum bnBestInvalidWork = 0;
40 uint256 hashBestChain = 0;
41 CBlockIndex* pindexBest = NULL;
42 int64 nTimeBestReceived = 0;
44 map<uint256, CBlock*> mapOrphanBlocks;
45 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
47 map<uint256, CDataStream*> mapOrphanTransactions;
48 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
55 int fGenerateBitcoins = false;
56 int64 nTransactionFee = 0;
57 int fLimitProcessors = false;
58 int nLimitProcessors = 1;
59 int fMinimizeToTray = true;
60 int fMinimizeOnClose = true;
73 //////////////////////////////////////////////////////////////////////////////
75 // dispatching functions
78 void RegisterWallet(CWallet* pwalletIn)
80 CRITICAL_BLOCK(cs_setpwalletRegistered)
82 setpwalletRegistered.insert(pwalletIn);
86 void UnregisterWallet(CWallet* pwalletIn)
88 CRITICAL_BLOCK(cs_setpwalletRegistered)
90 setpwalletRegistered.erase(pwalletIn);
94 bool static IsFromMe(CTransaction& tx)
96 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
97 if (pwallet->IsFromMe(tx))
102 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
104 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
105 if (pwallet->GetTransaction(hashTx,wtx))
110 void static EraseFromWallets(uint256 hash)
112 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
113 pwallet->EraseFromWallet(hash);
116 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
118 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
119 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
122 void static SetBestChain(const CBlockLocator& loc)
124 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
125 pwallet->SetBestChain(loc);
128 void static UpdatedTransaction(const uint256& hashTx)
130 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
131 pwallet->UpdatedTransaction(hashTx);
134 void static PrintWallets(const CBlock& block)
136 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
137 pwallet->PrintWallet(block);
140 void static Inventory(const uint256& hash)
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 pwallet->Inventory(hash);
146 void static ResendWalletTransactions()
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->ResendWalletTransactions();
158 //////////////////////////////////////////////////////////////////////////////
160 // mapOrphanTransactions
163 void static AddOrphanTx(const CDataStream& vMsg)
166 CDataStream(vMsg) >> tx;
167 uint256 hash = tx.GetHash();
168 if (mapOrphanTransactions.count(hash))
170 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
171 BOOST_FOREACH(const CTxIn& txin, tx.vin)
172 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
175 void static EraseOrphanTx(uint256 hash)
177 if (!mapOrphanTransactions.count(hash))
179 const CDataStream* pvMsg = mapOrphanTransactions[hash];
181 CDataStream(*pvMsg) >> tx;
182 BOOST_FOREACH(const CTxIn& txin, tx.vin)
184 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
185 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
187 if ((*mi).second == pvMsg)
188 mapOrphanTransactionsByPrev.erase(mi++);
194 mapOrphanTransactions.erase(hash);
204 //////////////////////////////////////////////////////////////////////////////
206 // CTransaction and CTxIndex
209 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
212 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
214 if (!ReadFromDisk(txindexRet.pos))
216 if (prevout.n >= vout.size())
224 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
227 return ReadFromDisk(txdb, prevout, txindex);
230 bool CTransaction::ReadFromDisk(COutPoint prevout)
234 return ReadFromDisk(txdb, prevout, txindex);
239 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
251 // Load the block this tx is in
253 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
255 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
260 // Update the tx's hashBlock
261 hashBlock = pblock->GetHash();
263 // Locate the transaction
264 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
265 if (pblock->vtx[nIndex] == *(CTransaction*)this)
267 if (nIndex == pblock->vtx.size())
269 vMerkleBranch.clear();
271 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
275 // Fill in merkle branch
276 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
279 // Is the tx in a block that's in the main chain
280 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
281 if (mi == mapBlockIndex.end())
283 CBlockIndex* pindex = (*mi).second;
284 if (!pindex || !pindex->IsInMainChain())
287 return pindexBest->nHeight - pindex->nHeight + 1;
296 bool CTransaction::CheckTransaction() const
298 // Basic checks that don't depend on any context
300 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
302 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
304 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
305 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
307 // Check for negative or overflow output values
309 BOOST_FOREACH(const CTxOut& txout, vout)
311 if (txout.nValue < 0)
312 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
313 if (txout.nValue > MAX_MONEY)
314 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
315 nValueOut += txout.nValue;
316 if (!MoneyRange(nValueOut))
317 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
320 // Check for duplicate inputs
321 set<COutPoint> vInOutPoints;
322 BOOST_FOREACH(const CTxIn& txin, vin)
324 if (vInOutPoints.count(txin.prevout))
326 vInOutPoints.insert(txin.prevout);
331 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
332 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
336 BOOST_FOREACH(const CTxIn& txin, vin)
337 if (txin.prevout.IsNull())
338 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
344 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
347 *pfMissingInputs = false;
349 if (!CheckTransaction())
350 return error("AcceptToMemoryPool() : CheckTransaction failed");
352 // Coinbase is only valid in a block, not as a loose transaction
354 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
356 // To help v0.1.5 clients who would see it as a negative number
357 if ((int64)nLockTime > INT_MAX)
358 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
361 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
362 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
363 // attacks disallow transactions with more than one SigOp per 34 bytes.
364 // 34 bytes because a TxOut is:
365 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
366 if (GetSigOpCount() > nSize / 34 || nSize < 100)
367 return DoS(10, error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount"));
369 // Rather not work on nonstandard transactions (unless -testnet)
370 if (!fTestNet && !IsStandard())
371 return error("AcceptToMemoryPool() : nonstandard transaction type");
373 // Do we already have it?
374 uint256 hash = GetHash();
375 CRITICAL_BLOCK(cs_mapTransactions)
376 if (mapTransactions.count(hash))
379 if (txdb.ContainsTx(hash))
382 // Check for conflicts with in-memory transactions
383 CTransaction* ptxOld = NULL;
384 for (int i = 0; i < vin.size(); i++)
386 COutPoint outpoint = vin[i].prevout;
387 if (mapNextTx.count(outpoint))
389 // Disable replacement feature for now
392 // Allow replacing with a newer version of the same transaction
395 ptxOld = mapNextTx[outpoint].ptx;
396 if (ptxOld->IsFinal())
398 if (!IsNewerThan(*ptxOld))
400 for (int i = 0; i < vin.size(); i++)
402 COutPoint outpoint = vin[i].prevout;
403 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
412 // Check against previous transactions
413 map<uint256, CTxIndex> mapUnused;
415 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
418 *pfMissingInputs = true;
419 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
422 // Don't accept it if it can't get into a block
423 if (nFees < GetMinFee(1000, true, true))
424 return error("AcceptToMemoryPool() : not enough fees");
426 // Continuously rate-limit free transactions
427 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
428 // be annoying or make other's transactions take longer to confirm.
429 if (nFees < MIN_RELAY_TX_FEE)
431 static CCriticalSection cs;
432 static double dFreeCount;
433 static int64 nLastTime;
434 int64 nNow = GetTime();
438 // Use an exponentially decaying ~10-minute window:
439 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
441 // -limitfreerelay unit is thousand-bytes-per-minute
442 // At default rate it would take over a month to fill 1GB
443 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
444 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
446 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
452 // Store transaction in memory
453 CRITICAL_BLOCK(cs_mapTransactions)
457 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
458 ptxOld->RemoveFromMemoryPool();
460 AddToMemoryPoolUnchecked();
463 ///// are we sure this is ok when loading transactions or restoring block txes
464 // If updated, erase old tx from wallet
466 EraseFromWallets(ptxOld->GetHash());
468 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
472 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
475 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
478 bool CTransaction::AddToMemoryPoolUnchecked()
480 // Add to memory pool without checking anything. Don't call this directly,
481 // call AcceptToMemoryPool to properly check the transaction first.
482 CRITICAL_BLOCK(cs_mapTransactions)
484 uint256 hash = GetHash();
485 mapTransactions[hash] = *this;
486 for (int i = 0; i < vin.size(); i++)
487 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
488 nTransactionsUpdated++;
494 bool CTransaction::RemoveFromMemoryPool()
496 // Remove transaction from memory pool
497 CRITICAL_BLOCK(cs_mapTransactions)
499 BOOST_FOREACH(const CTxIn& txin, vin)
500 mapNextTx.erase(txin.prevout);
501 mapTransactions.erase(GetHash());
502 nTransactionsUpdated++;
512 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
514 if (hashBlock == 0 || nIndex == -1)
517 // Find the block it claims to be in
518 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
519 if (mi == mapBlockIndex.end())
521 CBlockIndex* pindex = (*mi).second;
522 if (!pindex || !pindex->IsInMainChain())
525 // Make sure the merkle branch connects to this block
526 if (!fMerkleVerified)
528 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
530 fMerkleVerified = true;
533 nHeightRet = pindex->nHeight;
534 return pindexBest->nHeight - pindex->nHeight + 1;
538 int CMerkleTx::GetBlocksToMaturity() const
542 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
546 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
550 if (!IsInMainChain() && !ClientConnectInputs())
552 return CTransaction::AcceptToMemoryPool(txdb, false);
556 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
560 bool CMerkleTx::AcceptToMemoryPool()
563 return AcceptToMemoryPool(txdb);
568 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
570 CRITICAL_BLOCK(cs_mapTransactions)
572 // Add previous supporting transactions first
573 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
575 if (!tx.IsCoinBase())
577 uint256 hash = tx.GetHash();
578 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
579 tx.AcceptToMemoryPool(txdb, fCheckInputs);
582 return AcceptToMemoryPool(txdb, fCheckInputs);
587 bool CWalletTx::AcceptWalletTransaction()
590 return AcceptWalletTransaction(txdb);
593 int CTxIndex::GetDepthInMainChain() const
597 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
599 // Find the block in the index
600 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
601 if (mi == mapBlockIndex.end())
603 CBlockIndex* pindex = (*mi).second;
604 if (!pindex || !pindex->IsInMainChain())
606 return 1 + nBestHeight - pindex->nHeight;
618 //////////////////////////////////////////////////////////////////////////////
620 // CBlock and CBlockIndex
623 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
625 if (!fReadTransactions)
627 *this = pindex->GetBlockHeader();
630 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
632 if (GetHash() != pindex->GetBlockHash())
633 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
637 uint256 static GetOrphanRoot(const CBlock* pblock)
639 // Work back to the first block in the orphan chain
640 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
641 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
642 return pblock->GetHash();
645 int64 static GetBlockValue(int nHeight, int64 nFees)
647 int64 nSubsidy = 50 * COIN;
649 // Subsidy is cut in half every 4 years
650 nSubsidy >>= (nHeight / 210000);
652 return nSubsidy + nFees;
655 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
657 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
658 const int64 nTargetSpacing = 10 * 60;
659 const int64 nInterval = nTargetTimespan / nTargetSpacing;
662 if (pindexLast == NULL)
663 return bnProofOfWorkLimit.GetCompact();
665 // Only change once per interval
666 if ((pindexLast->nHeight+1) % nInterval != 0)
667 return pindexLast->nBits;
669 // Go back by what we want to be 14 days worth of blocks
670 const CBlockIndex* pindexFirst = pindexLast;
671 for (int i = 0; pindexFirst && i < nInterval-1; i++)
672 pindexFirst = pindexFirst->pprev;
675 // Limit adjustment step
676 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
677 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
678 if (nActualTimespan < nTargetTimespan/4)
679 nActualTimespan = nTargetTimespan/4;
680 if (nActualTimespan > nTargetTimespan*4)
681 nActualTimespan = nTargetTimespan*4;
685 bnNew.SetCompact(pindexLast->nBits);
686 bnNew *= nActualTimespan;
687 bnNew /= nTargetTimespan;
689 if (bnNew > bnProofOfWorkLimit)
690 bnNew = bnProofOfWorkLimit;
693 printf("GetNextWorkRequired RETARGET\n");
694 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
695 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
696 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
698 return bnNew.GetCompact();
701 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
704 bnTarget.SetCompact(nBits);
707 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
708 return error("CheckProofOfWork() : nBits below minimum work");
710 // Check proof of work matches claimed amount
711 if (hash > bnTarget.getuint256())
712 return error("CheckProofOfWork() : hash doesn't match nBits");
717 // Return conservative estimate of total number of blocks, 0 if unknown
718 int GetTotalBlocksEstimate()
726 return nTotalBlocksEstimate;
730 // Return maximum amount of blocks that other nodes claim to have
731 int GetNumBlocksOfPeers()
733 return std::max(nMaxBlocksOfPeers, GetTotalBlocksEstimate());
736 bool IsInitialBlockDownload()
738 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
740 static int64 nLastUpdate;
741 static CBlockIndex* pindexLastBest;
742 if (pindexBest != pindexLastBest)
744 pindexLastBest = pindexBest;
745 nLastUpdate = GetTime();
747 return (GetTime() - nLastUpdate < 10 &&
748 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
751 void static InvalidChainFound(CBlockIndex* pindexNew)
753 if (pindexNew->bnChainWork > bnBestInvalidWork)
755 bnBestInvalidWork = pindexNew->bnChainWork;
756 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
759 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());
760 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
761 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
762 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
775 bool CTransaction::DisconnectInputs(CTxDB& txdb)
777 // Relinquish previous transactions' spent pointers
780 BOOST_FOREACH(const CTxIn& txin, vin)
782 COutPoint prevout = txin.prevout;
784 // Get prev txindex from disk
786 if (!txdb.ReadTxIndex(prevout.hash, txindex))
787 return error("DisconnectInputs() : ReadTxIndex failed");
789 if (prevout.n >= txindex.vSpent.size())
790 return error("DisconnectInputs() : prevout.n out of range");
792 // Mark outpoint as not spent
793 txindex.vSpent[prevout.n].SetNull();
796 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
797 return error("DisconnectInputs() : UpdateTxIndex failed");
801 // Remove transaction from index
802 if (!txdb.EraseTxIndex(*this))
803 return error("DisconnectInputs() : EraseTxPos failed");
809 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
810 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
812 // Take over previous transactions' spent pointers
813 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
814 // fMiner is true when called from the internal bitcoin miner
815 // ... both are false when called from CTransaction::AcceptToMemoryPool
819 for (int i = 0; i < vin.size(); i++)
821 COutPoint prevout = vin[i].prevout;
826 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
828 // Get txindex from current proposed changes
829 txindex = mapTestPool[prevout.hash];
833 // Read txindex from txdb
834 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
836 if (!fFound && (fBlock || fMiner))
837 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());
841 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
843 // Get prev tx from single transactions in memory
844 CRITICAL_BLOCK(cs_mapTransactions)
846 if (!mapTransactions.count(prevout.hash))
847 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
848 txPrev = mapTransactions[prevout.hash];
851 txindex.vSpent.resize(txPrev.vout.size());
855 // Get prev tx from disk
856 if (!txPrev.ReadFromDisk(txindex.pos))
857 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
860 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
861 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
863 // If prev is coinbase, check that it's matured
864 if (txPrev.IsCoinBase())
865 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
866 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
867 return DoS(10, error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight));
869 // Skip ECDSA signature verification when connecting blocks (fBlock=true) during initial download
870 // (before the last blockchain checkpoint). This is safe because block merkle hashes are
871 // still computed and checked, and any change will be caught at the next checkpoint.
872 if (!(fBlock && IsInitialBlockDownload()))
874 if (!VerifySignature(txPrev, *this, i))
875 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
877 // Check for conflicts (double-spend)
878 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
879 // for an attacker to attempt to split the network.
880 if (!txindex.vSpent[prevout.n].IsNull())
881 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());
883 // Check for negative or overflow input values
884 nValueIn += txPrev.vout[prevout.n].nValue;
885 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
886 return DoS(100, error("ConnectInputs() : txin values out of range"));
888 // Mark outpoints as spent
889 txindex.vSpent[prevout.n] = posThisTx;
892 if (fBlock || fMiner)
894 mapTestPool[prevout.hash] = txindex;
898 if (nValueIn < GetValueOut())
899 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
901 // Tally transaction fees
902 int64 nTxFee = nValueIn - GetValueOut();
904 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
905 if (nTxFee < nMinFee)
908 if (!MoneyRange(nFees))
909 return DoS(100, error("ConnectInputs() : nFees out of range"));
914 // Add transaction to changes
915 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
919 // Add transaction to test pool
920 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
927 bool CTransaction::ClientConnectInputs()
932 // Take over previous transactions' spent pointers
933 CRITICAL_BLOCK(cs_mapTransactions)
936 for (int i = 0; i < vin.size(); i++)
938 // Get prev tx from single transactions in memory
939 COutPoint prevout = vin[i].prevout;
940 if (!mapTransactions.count(prevout.hash))
942 CTransaction& txPrev = mapTransactions[prevout.hash];
944 if (prevout.n >= txPrev.vout.size())
948 if (!VerifySignature(txPrev, *this, i))
949 return error("ConnectInputs() : VerifySignature failed");
951 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
952 ///// this has to go away now that posNext is gone
953 // // Check for conflicts
954 // if (!txPrev.vout[prevout.n].posNext.IsNull())
955 // return error("ConnectInputs() : prev tx already used");
957 // // Flag outpoints as used
958 // txPrev.vout[prevout.n].posNext = posThisTx;
960 nValueIn += txPrev.vout[prevout.n].nValue;
962 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
963 return error("ClientConnectInputs() : txin values out of range");
965 if (GetValueOut() > nValueIn)
975 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
977 // Disconnect in reverse order
978 for (int i = vtx.size()-1; i >= 0; i--)
979 if (!vtx[i].DisconnectInputs(txdb))
982 // Update block index on disk without changing it in memory.
983 // The memory index structure will be changed after the db commits.
986 CDiskBlockIndex blockindexPrev(pindex->pprev);
987 blockindexPrev.hashNext = 0;
988 if (!txdb.WriteBlockIndex(blockindexPrev))
989 return error("DisconnectBlock() : WriteBlockIndex failed");
995 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
997 // Check it again in case a previous version let a bad block in
1001 //// issue here: it doesn't know the version
1002 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1004 map<uint256, CTxIndex> mapQueuedChanges;
1006 BOOST_FOREACH(CTransaction& tx, vtx)
1008 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1009 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1011 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1014 // Write queued txindex changes
1015 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1017 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1018 return error("ConnectBlock() : UpdateTxIndex failed");
1021 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1024 // Update block index on disk without changing it in memory.
1025 // The memory index structure will be changed after the db commits.
1028 CDiskBlockIndex blockindexPrev(pindex->pprev);
1029 blockindexPrev.hashNext = pindex->GetBlockHash();
1030 if (!txdb.WriteBlockIndex(blockindexPrev))
1031 return error("ConnectBlock() : WriteBlockIndex failed");
1034 // Watch for transactions paying to me
1035 BOOST_FOREACH(CTransaction& tx, vtx)
1036 SyncWithWallets(tx, this, true);
1041 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1043 printf("REORGANIZE\n");
1046 CBlockIndex* pfork = pindexBest;
1047 CBlockIndex* plonger = pindexNew;
1048 while (pfork != plonger)
1050 while (plonger->nHeight > pfork->nHeight)
1051 if (!(plonger = plonger->pprev))
1052 return error("Reorganize() : plonger->pprev is null");
1053 if (pfork == plonger)
1055 if (!(pfork = pfork->pprev))
1056 return error("Reorganize() : pfork->pprev is null");
1059 // List of what to disconnect
1060 vector<CBlockIndex*> vDisconnect;
1061 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1062 vDisconnect.push_back(pindex);
1064 // List of what to connect
1065 vector<CBlockIndex*> vConnect;
1066 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1067 vConnect.push_back(pindex);
1068 reverse(vConnect.begin(), vConnect.end());
1070 // Disconnect shorter branch
1071 vector<CTransaction> vResurrect;
1072 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1075 if (!block.ReadFromDisk(pindex))
1076 return error("Reorganize() : ReadFromDisk for disconnect failed");
1077 if (!block.DisconnectBlock(txdb, pindex))
1078 return error("Reorganize() : DisconnectBlock failed");
1080 // Queue memory transactions to resurrect
1081 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1082 if (!tx.IsCoinBase())
1083 vResurrect.push_back(tx);
1086 // Connect longer branch
1087 vector<CTransaction> vDelete;
1088 for (int i = 0; i < vConnect.size(); i++)
1090 CBlockIndex* pindex = vConnect[i];
1092 if (!block.ReadFromDisk(pindex))
1093 return error("Reorganize() : ReadFromDisk for connect failed");
1094 if (!block.ConnectBlock(txdb, pindex))
1098 return error("Reorganize() : ConnectBlock failed");
1101 // Queue memory transactions to delete
1102 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1103 vDelete.push_back(tx);
1105 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1106 return error("Reorganize() : WriteHashBestChain failed");
1108 // Make sure it's successfully written to disk before changing memory structure
1109 if (!txdb.TxnCommit())
1110 return error("Reorganize() : TxnCommit failed");
1112 // Disconnect shorter branch
1113 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1115 pindex->pprev->pnext = NULL;
1117 // Connect longer branch
1118 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1120 pindex->pprev->pnext = pindex;
1122 // Resurrect memory transactions that were in the disconnected branch
1123 BOOST_FOREACH(CTransaction& tx, vResurrect)
1124 tx.AcceptToMemoryPool(txdb, false);
1126 // Delete redundant memory transactions that are in the connected branch
1127 BOOST_FOREACH(CTransaction& tx, vDelete)
1128 tx.RemoveFromMemoryPool();
1134 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1136 uint256 hash = GetHash();
1139 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1141 txdb.WriteHashBestChain(hash);
1142 if (!txdb.TxnCommit())
1143 return error("SetBestChain() : TxnCommit failed");
1144 pindexGenesisBlock = pindexNew;
1146 else if (hashPrevBlock == hashBestChain)
1148 // Adding to current best branch
1149 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1152 InvalidChainFound(pindexNew);
1153 return error("SetBestChain() : ConnectBlock failed");
1155 if (!txdb.TxnCommit())
1156 return error("SetBestChain() : TxnCommit failed");
1158 // Add to current best branch
1159 pindexNew->pprev->pnext = pindexNew;
1161 // Delete redundant memory transactions
1162 BOOST_FOREACH(CTransaction& tx, vtx)
1163 tx.RemoveFromMemoryPool();
1168 if (!Reorganize(txdb, pindexNew))
1171 InvalidChainFound(pindexNew);
1172 return error("SetBestChain() : Reorganize failed");
1176 // Update best block in wallet (so we can detect restored wallets)
1177 if (!IsInitialBlockDownload())
1179 const CBlockLocator locator(pindexNew);
1180 ::SetBestChain(locator);
1184 hashBestChain = hash;
1185 pindexBest = pindexNew;
1186 nBestHeight = pindexBest->nHeight;
1187 bnBestChainWork = pindexNew->bnChainWork;
1188 nTimeBestReceived = GetTime();
1189 nTransactionsUpdated++;
1190 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1196 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1198 // Check for duplicate
1199 uint256 hash = GetHash();
1200 if (mapBlockIndex.count(hash))
1201 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1203 // Construct new block index object
1204 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1206 return error("AddToBlockIndex() : new CBlockIndex failed");
1207 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1208 pindexNew->phashBlock = &((*mi).first);
1209 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1210 if (miPrev != mapBlockIndex.end())
1212 pindexNew->pprev = (*miPrev).second;
1213 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1215 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1219 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1220 if (!txdb.TxnCommit())
1224 if (pindexNew->bnChainWork > bnBestChainWork)
1225 if (!SetBestChain(txdb, pindexNew))
1230 if (pindexNew == pindexBest)
1232 // Notify UI to display prev block's coinbase if it was ours
1233 static uint256 hashPrevBestCoinBase;
1234 UpdatedTransaction(hashPrevBestCoinBase);
1235 hashPrevBestCoinBase = vtx[0].GetHash();
1245 bool CBlock::CheckBlock() const
1247 // These are checks that are independent of context
1248 // that can be verified before saving an orphan block.
1251 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1252 return DoS(100, error("CheckBlock() : size limits failed"));
1254 // Check proof of work matches claimed amount
1255 if (!CheckProofOfWork(GetHash(), nBits))
1256 return DoS(50, error("CheckBlock() : proof of work failed"));
1259 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1260 return error("CheckBlock() : block timestamp too far in the future");
1262 // First transaction must be coinbase, the rest must not be
1263 if (vtx.empty() || !vtx[0].IsCoinBase())
1264 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1265 for (int i = 1; i < vtx.size(); i++)
1266 if (vtx[i].IsCoinBase())
1267 return DoS(100, error("CheckBlock() : more than one coinbase"));
1269 // Check transactions
1270 BOOST_FOREACH(const CTransaction& tx, vtx)
1271 if (!tx.CheckTransaction())
1272 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1274 // Check that it's not full of nonstandard transactions
1275 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1276 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1279 if (hashMerkleRoot != BuildMerkleTree())
1280 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1285 bool CBlock::AcceptBlock()
1287 // Check for duplicate
1288 uint256 hash = GetHash();
1289 if (mapBlockIndex.count(hash))
1290 return error("AcceptBlock() : block already in mapBlockIndex");
1292 // Get prev block index
1293 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1294 if (mi == mapBlockIndex.end())
1295 return DoS(10, error("AcceptBlock() : prev block not found"));
1296 CBlockIndex* pindexPrev = (*mi).second;
1297 int nHeight = pindexPrev->nHeight+1;
1299 // Check proof of work
1300 if (nBits != GetNextWorkRequired(pindexPrev))
1301 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1303 // Check timestamp against prev
1304 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1305 return error("AcceptBlock() : block's timestamp is too early");
1307 // Check that all transactions are finalized
1308 BOOST_FOREACH(const CTransaction& tx, vtx)
1309 if (!tx.IsFinal(nHeight, GetBlockTime()))
1310 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1312 // Check that the block chain matches the known block chain up to a checkpoint
1314 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1315 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1316 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1317 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1318 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1319 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1320 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1321 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")) ||
1322 (nHeight == 140700 && hash != uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd")))
1323 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1325 // Write block to history file
1326 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1327 return error("AcceptBlock() : out of disk space");
1328 unsigned int nFile = -1;
1329 unsigned int nBlockPos = 0;
1330 if (!WriteToDisk(nFile, nBlockPos))
1331 return error("AcceptBlock() : WriteToDisk failed");
1332 if (!AddToBlockIndex(nFile, nBlockPos))
1333 return error("AcceptBlock() : AddToBlockIndex failed");
1335 // Relay inventory, but don't relay old inventory during initial block download
1336 if (hashBestChain == hash)
1337 CRITICAL_BLOCK(cs_vNodes)
1338 BOOST_FOREACH(CNode* pnode, vNodes)
1339 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1340 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1345 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1347 // Check for duplicate
1348 uint256 hash = pblock->GetHash();
1349 if (mapBlockIndex.count(hash))
1350 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1351 if (mapOrphanBlocks.count(hash))
1352 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1354 // Preliminary checks
1355 if (!pblock->CheckBlock())
1356 return error("ProcessBlock() : CheckBlock FAILED");
1358 // If don't already have its previous block, shunt it off to holding area until we get it
1359 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1361 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1362 CBlock* pblock2 = new CBlock(*pblock);
1363 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1364 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1366 // Ask this guy to fill in what we're missing
1368 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1373 if (!pblock->AcceptBlock())
1374 return error("ProcessBlock() : AcceptBlock FAILED");
1376 // Recursively process any orphan blocks that depended on this one
1377 vector<uint256> vWorkQueue;
1378 vWorkQueue.push_back(hash);
1379 for (int i = 0; i < vWorkQueue.size(); i++)
1381 uint256 hashPrev = vWorkQueue[i];
1382 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1383 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1386 CBlock* pblockOrphan = (*mi).second;
1387 if (pblockOrphan->AcceptBlock())
1388 vWorkQueue.push_back(pblockOrphan->GetHash());
1389 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1390 delete pblockOrphan;
1392 mapOrphanBlocksByPrev.erase(hashPrev);
1395 printf("ProcessBlock: ACCEPTED\n");
1406 bool CheckDiskSpace(uint64 nAdditionalBytes)
1408 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1410 // Check for 15MB because database could create another 10MB log file at any time
1411 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1414 string strMessage = _("Warning: Disk space is low ");
1415 strMiscWarning = strMessage;
1416 printf("*** %s\n", strMessage.c_str());
1417 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1418 CreateThread(Shutdown, NULL);
1424 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1428 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1431 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1433 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1442 static unsigned int nCurrentBlockFile = 1;
1444 FILE* AppendBlockFile(unsigned int& nFileRet)
1449 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1452 if (fseek(file, 0, SEEK_END) != 0)
1454 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1455 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1457 nFileRet = nCurrentBlockFile;
1461 nCurrentBlockFile++;
1465 bool LoadBlockIndex(bool fAllowNew)
1469 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1470 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1471 pchMessageStart[0] = 0xfa;
1472 pchMessageStart[1] = 0xbf;
1473 pchMessageStart[2] = 0xb5;
1474 pchMessageStart[3] = 0xda;
1481 if (!txdb.LoadBlockIndex())
1486 // Init with genesis block
1488 if (mapBlockIndex.empty())
1494 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1495 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1496 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1497 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1498 // vMerkleTree: 4a5e1e
1501 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1503 txNew.vin.resize(1);
1504 txNew.vout.resize(1);
1505 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1506 txNew.vout[0].nValue = 50 * COIN;
1507 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1509 block.vtx.push_back(txNew);
1510 block.hashPrevBlock = 0;
1511 block.hashMerkleRoot = block.BuildMerkleTree();
1513 block.nTime = 1231006505;
1514 block.nBits = 0x1d00ffff;
1515 block.nNonce = 2083236893;
1519 block.nTime = 1296688602;
1520 block.nBits = 0x1d07fff8;
1521 block.nNonce = 384568319;
1525 printf("%s\n", block.GetHash().ToString().c_str());
1526 printf("%s\n", hashGenesisBlock.ToString().c_str());
1527 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1528 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1530 assert(block.GetHash() == hashGenesisBlock);
1532 // Start new block file
1534 unsigned int nBlockPos;
1535 if (!block.WriteToDisk(nFile, nBlockPos))
1536 return error("LoadBlockIndex() : writing genesis block to disk failed");
1537 if (!block.AddToBlockIndex(nFile, nBlockPos))
1538 return error("LoadBlockIndex() : genesis block not accepted");
1546 void PrintBlockTree()
1548 // precompute tree structure
1549 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1550 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1552 CBlockIndex* pindex = (*mi).second;
1553 mapNext[pindex->pprev].push_back(pindex);
1555 //while (rand() % 3 == 0)
1556 // mapNext[pindex->pprev].push_back(pindex);
1559 vector<pair<int, CBlockIndex*> > vStack;
1560 vStack.push_back(make_pair(0, pindexGenesisBlock));
1563 while (!vStack.empty())
1565 int nCol = vStack.back().first;
1566 CBlockIndex* pindex = vStack.back().second;
1569 // print split or gap
1570 if (nCol > nPrevCol)
1572 for (int i = 0; i < nCol-1; i++)
1576 else if (nCol < nPrevCol)
1578 for (int i = 0; i < nCol; i++)
1585 for (int i = 0; i < nCol; i++)
1590 block.ReadFromDisk(pindex);
1591 printf("%d (%u,%u) %s %s tx %d",
1595 block.GetHash().ToString().substr(0,20).c_str(),
1596 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1599 PrintWallets(block);
1601 // put the main timechain first
1602 vector<CBlockIndex*>& vNext = mapNext[pindex];
1603 for (int i = 0; i < vNext.size(); i++)
1605 if (vNext[i]->pnext)
1607 swap(vNext[0], vNext[i]);
1613 for (int i = 0; i < vNext.size(); i++)
1614 vStack.push_back(make_pair(nCol+i, vNext[i]));
1627 //////////////////////////////////////////////////////////////////////////////
1632 map<uint256, CAlert> mapAlerts;
1633 CCriticalSection cs_mapAlerts;
1635 string GetWarnings(string strFor)
1638 string strStatusBar;
1640 if (GetBoolArg("-testsafemode"))
1643 // Misc warnings like out of disk space and clock is wrong
1644 if (strMiscWarning != "")
1647 strStatusBar = strMiscWarning;
1650 // Longer invalid proof-of-work chain
1651 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1654 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1658 CRITICAL_BLOCK(cs_mapAlerts)
1660 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1662 const CAlert& alert = item.second;
1663 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1665 nPriority = alert.nPriority;
1666 strStatusBar = alert.strStatusBar;
1671 if (strFor == "statusbar")
1672 return strStatusBar;
1673 else if (strFor == "rpc")
1675 assert(!"GetWarnings() : invalid parameter");
1679 bool CAlert::ProcessAlert()
1681 if (!CheckSignature())
1686 CRITICAL_BLOCK(cs_mapAlerts)
1688 // Cancel previous alerts
1689 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1691 const CAlert& alert = (*mi).second;
1694 printf("cancelling alert %d\n", alert.nID);
1695 mapAlerts.erase(mi++);
1697 else if (!alert.IsInEffect())
1699 printf("expiring alert %d\n", alert.nID);
1700 mapAlerts.erase(mi++);
1706 // Check if this alert has been cancelled
1707 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1709 const CAlert& alert = item.second;
1710 if (alert.Cancels(*this))
1712 printf("alert already cancelled by %d\n", alert.nID);
1718 mapAlerts.insert(make_pair(GetHash(), *this));
1721 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1733 //////////////////////////////////////////////////////////////////////////////
1739 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1743 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1744 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1746 // Don't know what it is, just say we already got one
1753 // The message start string is designed to be unlikely to occur in normal data.
1754 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1755 // a large 4-byte int at any alignment.
1756 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1759 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1761 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1762 RandAddSeedPerfmon();
1764 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1765 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1767 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1769 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1777 if (strCommand == "version")
1779 // Each connection can only send one version message
1780 if (pfrom->nVersion != 0)
1782 pfrom->Misbehaving(1);
1790 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1791 if (pfrom->nVersion == 10300)
1792 pfrom->nVersion = 300;
1793 if (pfrom->nVersion >= 106 && !vRecv.empty())
1794 vRecv >> addrFrom >> nNonce;
1795 if (pfrom->nVersion >= 106 && !vRecv.empty())
1796 vRecv >> pfrom->strSubVer;
1797 if (pfrom->nVersion >= 209 && !vRecv.empty())
1798 vRecv >> pfrom->nStartingHeight;
1800 if (pfrom->nVersion == 0)
1803 // Disconnect if we connected to ourself
1804 if (nNonce == nLocalHostNonce && nNonce > 1)
1806 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1807 pfrom->fDisconnect = true;
1811 // Be shy and don't send version until we hear
1812 if (pfrom->fInbound)
1813 pfrom->PushVersion();
1815 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1817 AddTimeData(pfrom->addr.ip, nTime);
1820 if (pfrom->nVersion >= 209)
1821 pfrom->PushMessage("verack");
1822 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1823 if (pfrom->nVersion < 209)
1824 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1826 if (!pfrom->fInbound)
1828 // Advertise our address
1829 if (addrLocalHost.IsRoutable() && !fUseProxy)
1831 CAddress addr(addrLocalHost);
1832 addr.nTime = GetAdjustedTime();
1833 pfrom->PushAddress(addr);
1836 // Get recent addresses
1837 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1839 pfrom->PushMessage("getaddr");
1840 pfrom->fGetAddr = true;
1844 // Ask the first connected node for block updates
1845 static int nAskedForBlocks;
1846 if (!pfrom->fClient &&
1847 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1848 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1851 pfrom->PushGetBlocks(pindexBest, uint256(0));
1855 CRITICAL_BLOCK(cs_mapAlerts)
1856 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1857 item.second.RelayTo(pfrom);
1859 pfrom->fSuccessfullyConnected = true;
1861 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1862 if(pfrom->nStartingHeight > nMaxBlocksOfPeers)
1864 nMaxBlocksOfPeers = pfrom->nStartingHeight;
1869 else if (pfrom->nVersion == 0)
1871 // Must have a version message before anything else
1872 pfrom->Misbehaving(1);
1877 else if (strCommand == "verack")
1879 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1883 else if (strCommand == "addr")
1885 vector<CAddress> vAddr;
1888 // Don't want addr from older versions unless seeding
1889 if (pfrom->nVersion < 209)
1891 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1893 if (vAddr.size() > 1000)
1895 pfrom->Misbehaving(20);
1896 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)
1956 pfrom->Misbehaving(20);
1957 return error("message inv size() = %d", vInv.size());
1961 BOOST_FOREACH(const CInv& inv, vInv)
1965 pfrom->AddInventoryKnown(inv);
1967 bool fAlreadyHave = AlreadyHave(txdb, inv);
1969 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1973 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1974 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1976 // Track requests for our stuff
1977 Inventory(inv.hash);
1982 else if (strCommand == "getdata")
1986 if (vInv.size() > 50000)
1988 pfrom->Misbehaving(20);
1989 return error("message getdata size() = %d", vInv.size());
1992 BOOST_FOREACH(const CInv& inv, vInv)
1996 printf("received getdata for: %s\n", inv.ToString().c_str());
1998 if (inv.type == MSG_BLOCK)
2000 // Send block from disk
2001 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2002 if (mi != mapBlockIndex.end())
2005 block.ReadFromDisk((*mi).second);
2006 pfrom->PushMessage("block", block);
2008 // Trigger them to send a getblocks request for the next batch of inventory
2009 if (inv.hash == pfrom->hashContinue)
2011 // Bypass PushInventory, this must send even if redundant,
2012 // and we want it right after the last block so they don't
2013 // wait for other stuff first.
2015 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2016 pfrom->PushMessage("inv", vInv);
2017 pfrom->hashContinue = 0;
2021 else if (inv.IsKnownType())
2023 // Send stream from relay memory
2024 CRITICAL_BLOCK(cs_mapRelay)
2026 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2027 if (mi != mapRelay.end())
2028 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2032 // Track requests for our stuff
2033 Inventory(inv.hash);
2038 else if (strCommand == "getblocks")
2040 CBlockLocator locator;
2042 vRecv >> locator >> hashStop;
2044 // Find the last block the caller has in the main chain
2045 CBlockIndex* pindex = locator.GetBlockIndex();
2047 // Send the rest of the chain
2049 pindex = pindex->pnext;
2050 int nLimit = 500 + locator.GetDistanceBack();
2051 unsigned int nBytes = 0;
2052 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2053 for (; pindex; pindex = pindex->pnext)
2055 if (pindex->GetBlockHash() == hashStop)
2057 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2060 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2062 block.ReadFromDisk(pindex, true);
2063 nBytes += block.GetSerializeSize(SER_NETWORK);
2064 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2066 // When this block is requested, we'll send an inv that'll make them
2067 // getblocks the next batch of inventory.
2068 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2069 pfrom->hashContinue = pindex->GetBlockHash();
2076 else if (strCommand == "getheaders")
2078 CBlockLocator locator;
2080 vRecv >> locator >> hashStop;
2082 CBlockIndex* pindex = NULL;
2083 if (locator.IsNull())
2085 // If locator is null, return the hashStop block
2086 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2087 if (mi == mapBlockIndex.end())
2089 pindex = (*mi).second;
2093 // Find the last block the caller has in the main chain
2094 pindex = locator.GetBlockIndex();
2096 pindex = pindex->pnext;
2099 vector<CBlock> vHeaders;
2100 int nLimit = 2000 + locator.GetDistanceBack();
2101 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2102 for (; pindex; pindex = pindex->pnext)
2104 vHeaders.push_back(pindex->GetBlockHeader());
2105 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2108 pfrom->PushMessage("headers", vHeaders);
2112 else if (strCommand == "tx")
2114 vector<uint256> vWorkQueue;
2115 CDataStream vMsg(vRecv);
2119 CInv inv(MSG_TX, tx.GetHash());
2120 pfrom->AddInventoryKnown(inv);
2122 bool fMissingInputs = false;
2123 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2125 SyncWithWallets(tx, NULL, true);
2126 RelayMessage(inv, vMsg);
2127 mapAlreadyAskedFor.erase(inv);
2128 vWorkQueue.push_back(inv.hash);
2130 // Recursively process any orphan transactions that depended on this one
2131 for (int i = 0; i < vWorkQueue.size(); i++)
2133 uint256 hashPrev = vWorkQueue[i];
2134 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2135 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2138 const CDataStream& vMsg = *((*mi).second);
2140 CDataStream(vMsg) >> tx;
2141 CInv inv(MSG_TX, tx.GetHash());
2143 if (tx.AcceptToMemoryPool(true))
2145 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2146 SyncWithWallets(tx, NULL, true);
2147 RelayMessage(inv, vMsg);
2148 mapAlreadyAskedFor.erase(inv);
2149 vWorkQueue.push_back(inv.hash);
2154 BOOST_FOREACH(uint256 hash, vWorkQueue)
2155 EraseOrphanTx(hash);
2157 else if (fMissingInputs)
2159 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2162 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2166 else if (strCommand == "block")
2171 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2174 CInv inv(MSG_BLOCK, block.GetHash());
2175 pfrom->AddInventoryKnown(inv);
2177 if (ProcessBlock(pfrom, &block))
2178 mapAlreadyAskedFor.erase(inv);
2179 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2183 else if (strCommand == "getaddr")
2185 // Nodes rebroadcast an addr every 24 hours
2186 pfrom->vAddrToSend.clear();
2187 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2188 CRITICAL_BLOCK(cs_mapAddresses)
2190 unsigned int nCount = 0;
2191 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2193 const CAddress& addr = item.second;
2194 if (addr.nTime > nSince)
2197 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2199 const CAddress& addr = item.second;
2200 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2201 pfrom->PushAddress(addr);
2207 else if (strCommand == "checkorder")
2212 if (!GetBoolArg("-allowreceivebyip"))
2214 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2221 /// we have a chance to check the order here
2223 // Keep giving the same key to the same ip until they use it
2224 if (!mapReuseKey.count(pfrom->addr.ip))
2225 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2227 // Send back approval of order and pubkey to use
2228 CScript scriptPubKey;
2229 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2230 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2234 else if (strCommand == "reply")
2239 CRequestTracker tracker;
2240 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2242 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2243 if (mi != pfrom->mapRequests.end())
2245 tracker = (*mi).second;
2246 pfrom->mapRequests.erase(mi);
2249 if (!tracker.IsNull())
2250 tracker.fn(tracker.param1, vRecv);
2254 else if (strCommand == "ping")
2259 else if (strCommand == "alert")
2264 if (alert.ProcessAlert())
2267 pfrom->setKnown.insert(alert.GetHash());
2268 CRITICAL_BLOCK(cs_vNodes)
2269 BOOST_FOREACH(CNode* pnode, vNodes)
2270 alert.RelayTo(pnode);
2277 // Ignore unknown commands for extensibility
2281 // Update the last seen time for this node's address
2282 if (pfrom->fNetworkNode)
2283 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2284 AddressCurrentlyConnected(pfrom->addr);
2290 bool ProcessMessages(CNode* pfrom)
2292 CDataStream& vRecv = pfrom->vRecv;
2296 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2300 // (4) message start
2309 // Scan for message start
2310 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2311 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2312 if (vRecv.end() - pstart < nHeaderSize)
2314 if (vRecv.size() > nHeaderSize)
2316 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2317 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2321 if (pstart - vRecv.begin() > 0)
2322 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2323 vRecv.erase(vRecv.begin(), pstart);
2326 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2331 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2334 string strCommand = hdr.GetCommand();
2337 unsigned int nMessageSize = hdr.nMessageSize;
2338 if (nMessageSize > MAX_SIZE)
2340 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2343 if (nMessageSize > vRecv.size())
2345 // Rewind and wait for rest of message
2346 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2351 if (vRecv.GetVersion() >= 209)
2353 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2354 unsigned int nChecksum = 0;
2355 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2356 if (nChecksum != hdr.nChecksum)
2358 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2359 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2364 // Copy message to its own buffer
2365 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2366 vRecv.ignore(nMessageSize);
2372 CRITICAL_BLOCK(cs_main)
2373 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2377 catch (std::ios_base::failure& e)
2379 if (strstr(e.what(), "end of data"))
2381 // Allow exceptions from underlength message on vRecv
2382 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());
2384 else if (strstr(e.what(), "size too large"))
2386 // Allow exceptions from overlong size
2387 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2391 PrintExceptionContinue(&e, "ProcessMessage()");
2394 catch (std::exception& e) {
2395 PrintExceptionContinue(&e, "ProcessMessage()");
2397 PrintExceptionContinue(NULL, "ProcessMessage()");
2401 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2409 bool SendMessages(CNode* pto, bool fSendTrickle)
2411 CRITICAL_BLOCK(cs_main)
2413 // Don't send anything until we get their version message
2414 if (pto->nVersion == 0)
2418 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2419 pto->PushMessage("ping");
2421 // Resend wallet transactions that haven't gotten in a block yet
2422 ResendWalletTransactions();
2424 // Address refresh broadcast
2425 static int64 nLastRebroadcast;
2426 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2428 nLastRebroadcast = GetTime();
2429 CRITICAL_BLOCK(cs_vNodes)
2431 BOOST_FOREACH(CNode* pnode, vNodes)
2433 // Periodically clear setAddrKnown to allow refresh broadcasts
2434 pnode->setAddrKnown.clear();
2436 // Rebroadcast our address
2437 if (addrLocalHost.IsRoutable() && !fUseProxy)
2439 CAddress addr(addrLocalHost);
2440 addr.nTime = GetAdjustedTime();
2441 pnode->PushAddress(addr);
2447 // Clear out old addresses periodically so it's not too much work at once
2448 static int64 nLastClear;
2449 if (nLastClear == 0)
2450 nLastClear = GetTime();
2451 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2453 nLastClear = GetTime();
2454 CRITICAL_BLOCK(cs_mapAddresses)
2457 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2458 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2459 mi != mapAddresses.end();)
2461 const CAddress& addr = (*mi).second;
2462 if (addr.nTime < nSince)
2464 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2466 addrdb.EraseAddress(addr);
2467 mapAddresses.erase(mi++);
2481 vector<CAddress> vAddr;
2482 vAddr.reserve(pto->vAddrToSend.size());
2483 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2485 // returns true if wasn't already contained in the set
2486 if (pto->setAddrKnown.insert(addr).second)
2488 vAddr.push_back(addr);
2489 // receiver rejects addr messages larger than 1000
2490 if (vAddr.size() >= 1000)
2492 pto->PushMessage("addr", vAddr);
2497 pto->vAddrToSend.clear();
2499 pto->PushMessage("addr", vAddr);
2504 // Message: inventory
2507 vector<CInv> vInvWait;
2508 CRITICAL_BLOCK(pto->cs_inventory)
2510 vInv.reserve(pto->vInventoryToSend.size());
2511 vInvWait.reserve(pto->vInventoryToSend.size());
2512 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2514 if (pto->setInventoryKnown.count(inv))
2517 // trickle out tx inv to protect privacy
2518 if (inv.type == MSG_TX && !fSendTrickle)
2520 // 1/4 of tx invs blast to all immediately
2521 static uint256 hashSalt;
2523 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2524 uint256 hashRand = inv.hash ^ hashSalt;
2525 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2526 bool fTrickleWait = ((hashRand & 3) != 0);
2528 // always trickle our own transactions
2532 if (GetTransaction(inv.hash, wtx))
2534 fTrickleWait = true;
2539 vInvWait.push_back(inv);
2544 // returns true if wasn't already contained in the set
2545 if (pto->setInventoryKnown.insert(inv).second)
2547 vInv.push_back(inv);
2548 if (vInv.size() >= 1000)
2550 pto->PushMessage("inv", vInv);
2555 pto->vInventoryToSend = vInvWait;
2558 pto->PushMessage("inv", vInv);
2564 vector<CInv> vGetData;
2565 int64 nNow = GetTime() * 1000000;
2567 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2569 const CInv& inv = (*pto->mapAskFor.begin()).second;
2570 if (!AlreadyHave(txdb, inv))
2572 printf("sending getdata: %s\n", inv.ToString().c_str());
2573 vGetData.push_back(inv);
2574 if (vGetData.size() >= 1000)
2576 pto->PushMessage("getdata", vGetData);
2580 mapAlreadyAskedFor[inv] = nNow;
2581 pto->mapAskFor.erase(pto->mapAskFor.begin());
2583 if (!vGetData.empty())
2584 pto->PushMessage("getdata", vGetData);
2603 //////////////////////////////////////////////////////////////////////////////
2608 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2610 unsigned char* pdata = (unsigned char*)pbuffer;
2611 unsigned int blocks = 1 + ((len + 8) / 64);
2612 unsigned char* pend = pdata + 64 * blocks;
2613 memset(pdata + len, 0, 64 * blocks - len);
2615 unsigned int bits = len * 8;
2616 pend[-1] = (bits >> 0) & 0xff;
2617 pend[-2] = (bits >> 8) & 0xff;
2618 pend[-3] = (bits >> 16) & 0xff;
2619 pend[-4] = (bits >> 24) & 0xff;
2623 using CryptoPP::ByteReverse;
2625 static const unsigned int pSHA256InitState[8] =
2626 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2628 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2630 memcpy(pstate, pinit, 32);
2631 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2635 // ScanHash scans nonces looking for a hash with at least some zero bits.
2636 // It operates on big endian data. Caller does the byte reversing.
2637 // All input buffers are 16-byte aligned. nNonce is usually preserved
2638 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2639 // the block is rebuilt and nNonce starts over at zero.
2641 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2643 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2647 // Hash pdata using pmidstate as the starting state into
2648 // preformatted buffer phash1, then hash phash1 into phash
2650 SHA256Transform(phash1, pdata, pmidstate);
2651 SHA256Transform(phash, phash1, pSHA256InitState);
2653 // Return the nonce if the hash has at least some zero bits,
2654 // caller will check if it has enough to reach the target
2655 if (((unsigned short*)phash)[14] == 0)
2658 // If nothing found after trying for a while, return -1
2659 if ((nNonce & 0xffff) == 0)
2661 nHashesDone = 0xffff+1;
2667 // Some explaining would be appreciated
2672 set<uint256> setDependsOn;
2675 COrphan(CTransaction* ptxIn)
2683 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2684 BOOST_FOREACH(uint256 hash, setDependsOn)
2685 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2690 CBlock* CreateNewBlock(CReserveKey& reservekey)
2692 CBlockIndex* pindexPrev = pindexBest;
2695 auto_ptr<CBlock> pblock(new CBlock());
2699 // Create coinbase tx
2701 txNew.vin.resize(1);
2702 txNew.vin[0].prevout.SetNull();
2703 txNew.vout.resize(1);
2704 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2706 // Add our coinbase tx as first transaction
2707 pblock->vtx.push_back(txNew);
2709 // Collect memory pool transactions into the block
2711 CRITICAL_BLOCK(cs_main)
2712 CRITICAL_BLOCK(cs_mapTransactions)
2716 // Priority order to process transactions
2717 list<COrphan> vOrphan; // list memory doesn't move
2718 map<uint256, vector<COrphan*> > mapDependers;
2719 multimap<double, CTransaction*> mapPriority;
2720 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2722 CTransaction& tx = (*mi).second;
2723 if (tx.IsCoinBase() || !tx.IsFinal())
2726 COrphan* porphan = NULL;
2727 double dPriority = 0;
2728 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2730 // Read prev transaction
2731 CTransaction txPrev;
2733 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2735 // Has to wait for dependencies
2738 // Use list for automatic deletion
2739 vOrphan.push_back(COrphan(&tx));
2740 porphan = &vOrphan.back();
2742 mapDependers[txin.prevout.hash].push_back(porphan);
2743 porphan->setDependsOn.insert(txin.prevout.hash);
2746 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2748 // Read block header
2749 int nConf = txindex.GetDepthInMainChain();
2751 dPriority += (double)nValueIn * nConf;
2753 if (fDebug && GetBoolArg("-printpriority"))
2754 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2757 // Priority is sum(valuein * age) / txsize
2758 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2761 porphan->dPriority = dPriority;
2763 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2765 if (fDebug && GetBoolArg("-printpriority"))
2767 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2774 // Collect transactions into block
2775 map<uint256, CTxIndex> mapTestPool;
2776 uint64 nBlockSize = 1000;
2777 int nBlockSigOps = 100;
2778 while (!mapPriority.empty())
2780 // Take highest priority transaction off priority queue
2781 double dPriority = -(*mapPriority.begin()).first;
2782 CTransaction& tx = *(*mapPriority.begin()).second;
2783 mapPriority.erase(mapPriority.begin());
2786 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2787 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2789 int nTxSigOps = tx.GetSigOpCount();
2790 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2793 // Transaction fee required depends on block size
2794 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2795 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2797 // Connecting shouldn't fail due to dependency on other memory pool transactions
2798 // because we're already processing them in order of dependency
2799 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2800 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2802 swap(mapTestPool, mapTestPoolTmp);
2805 pblock->vtx.push_back(tx);
2806 nBlockSize += nTxSize;
2807 nBlockSigOps += nTxSigOps;
2809 // Add transactions that depend on this one to the priority queue
2810 uint256 hash = tx.GetHash();
2811 if (mapDependers.count(hash))
2813 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2815 if (!porphan->setDependsOn.empty())
2817 porphan->setDependsOn.erase(hash);
2818 if (porphan->setDependsOn.empty())
2819 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2825 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2828 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2829 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2830 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2831 pblock->nBits = GetNextWorkRequired(pindexPrev);
2834 return pblock.release();
2838 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2840 // Update nExtraNonce
2841 static uint256 hashPrevBlock;
2842 if (hashPrevBlock != pblock->hashPrevBlock)
2845 hashPrevBlock = pblock->hashPrevBlock;
2848 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2849 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2853 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2856 // Prebuild hash buffers
2863 uint256 hashPrevBlock;
2864 uint256 hashMerkleRoot;
2867 unsigned int nNonce;
2870 unsigned char pchPadding0[64];
2872 unsigned char pchPadding1[64];
2875 memset(&tmp, 0, sizeof(tmp));
2877 tmp.block.nVersion = pblock->nVersion;
2878 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2879 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2880 tmp.block.nTime = pblock->nTime;
2881 tmp.block.nBits = pblock->nBits;
2882 tmp.block.nNonce = pblock->nNonce;
2884 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2885 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2887 // Byte swap all the input buffer
2888 for (int i = 0; i < sizeof(tmp)/4; i++)
2889 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2891 // Precalc the first half of the first hash, which stays constant
2892 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2894 memcpy(pdata, &tmp.block, 128);
2895 memcpy(phash1, &tmp.hash1, 64);
2899 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2901 uint256 hash = pblock->GetHash();
2902 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2904 if (hash > hashTarget)
2908 printf("BitcoinMiner:\n");
2909 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2911 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2912 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2915 CRITICAL_BLOCK(cs_main)
2917 if (pblock->hashPrevBlock != hashBestChain)
2918 return error("BitcoinMiner : generated block is stale");
2920 // Remove key from key pool
2921 reservekey.KeepKey();
2923 // Track how many getdata requests this block gets
2924 CRITICAL_BLOCK(wallet.cs_wallet)
2925 wallet.mapRequestCount[pblock->GetHash()] = 0;
2927 // Process this block the same as if we had received it from another node
2928 if (!ProcessBlock(NULL, pblock))
2929 return error("BitcoinMiner : ProcessBlock, block not accepted");
2936 void static ThreadBitcoinMiner(void* parg);
2938 void static BitcoinMiner(CWallet *pwallet)
2940 printf("BitcoinMiner started\n");
2941 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2943 // Each thread has its own key and counter
2944 CReserveKey reservekey(pwallet);
2945 unsigned int nExtraNonce = 0;
2947 while (fGenerateBitcoins)
2949 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2953 while (vNodes.empty() || IsInitialBlockDownload())
2958 if (!fGenerateBitcoins)
2966 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2967 CBlockIndex* pindexPrev = pindexBest;
2969 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2972 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2974 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2978 // Prebuild hash buffers
2980 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2981 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2982 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2984 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2986 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2987 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2993 int64 nStart = GetTime();
2994 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2996 uint256& hash = *alignup<16>(hashbuf);
2999 unsigned int nHashesDone = 0;
3000 unsigned int nNonceFound;
3003 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3004 (char*)&hash, nHashesDone);
3006 // Check if something found
3007 if (nNonceFound != -1)
3009 for (int i = 0; i < sizeof(hash)/4; i++)
3010 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3012 if (hash <= hashTarget)
3015 pblock->nNonce = ByteReverse(nNonceFound);
3016 assert(hash == pblock->GetHash());
3018 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3019 CheckWork(pblock.get(), *pwalletMain, reservekey);
3020 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3026 static int64 nHashCounter;
3027 if (nHPSTimerStart == 0)
3029 nHPSTimerStart = GetTimeMillis();
3033 nHashCounter += nHashesDone;
3034 if (GetTimeMillis() - nHPSTimerStart > 4000)
3036 static CCriticalSection cs;
3039 if (GetTimeMillis() - nHPSTimerStart > 4000)
3041 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3042 nHPSTimerStart = GetTimeMillis();
3044 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3045 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3046 static int64 nLogTime;
3047 if (GetTime() - nLogTime > 30 * 60)
3049 nLogTime = GetTime();
3050 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3051 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3057 // Check for stop or if block needs to be rebuilt
3060 if (!fGenerateBitcoins)
3062 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3066 if (nBlockNonce >= 0xffff0000)
3068 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3070 if (pindexPrev != pindexBest)
3073 // Update nTime every few seconds
3074 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3075 nBlockTime = ByteReverse(pblock->nTime);
3080 void static ThreadBitcoinMiner(void* parg)
3082 CWallet* pwallet = (CWallet*)parg;
3085 vnThreadsRunning[3]++;
3086 BitcoinMiner(pwallet);
3087 vnThreadsRunning[3]--;
3089 catch (std::exception& e) {
3090 vnThreadsRunning[3]--;
3091 PrintException(&e, "ThreadBitcoinMiner()");
3093 vnThreadsRunning[3]--;
3094 PrintException(NULL, "ThreadBitcoinMiner()");
3096 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3098 if (vnThreadsRunning[3] == 0)
3100 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3104 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3106 if (fGenerateBitcoins != fGenerate)
3108 fGenerateBitcoins = fGenerate;
3109 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3112 if (fGenerateBitcoins)
3114 int nProcessors = boost::thread::hardware_concurrency();
3115 printf("%d processors\n", nProcessors);
3116 if (nProcessors < 1)
3118 if (fLimitProcessors && nProcessors > nLimitProcessors)
3119 nProcessors = nLimitProcessors;
3120 int nAddThreads = nProcessors - vnThreadsRunning[3];
3121 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3122 for (int i = 0; i < nAddThreads; i++)
3124 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3125 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");