1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
9 #include "cryptopp/sha.h"
10 #include <boost/filesystem.hpp>
11 #include <boost/filesystem/fstream.hpp>
14 using namespace boost;
20 CCriticalSection cs_setpwalletRegistered;
21 set<CWallet*> setpwalletRegistered;
23 CCriticalSection cs_main;
25 static map<uint256, CTransaction> mapTransactions;
26 CCriticalSection cs_mapTransactions;
27 unsigned int nTransactionsUpdated = 0;
28 map<COutPoint, CInPoint> mapNextTx;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 const int nTotalBlocksEstimate = 140700; // Conservative estimate of total nr of blocks on main chain
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 CBigNum bnBestChainWork = 0;
38 CBigNum bnBestInvalidWork = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
45 map<uint256, CBlock*> mapOrphanBlocks;
46 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
48 map<uint256, CDataStream*> mapOrphanTransactions;
49 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
56 int fGenerateBitcoins = false;
57 int64 nTransactionFee = 0;
58 int fLimitProcessors = false;
59 int nLimitProcessors = 1;
60 int fMinimizeToTray = true;
61 int fMinimizeOnClose = true;
69 //////////////////////////////////////////////////////////////////////////////
71 // dispatching functions
74 void RegisterWallet(CWallet* pwalletIn)
76 CRITICAL_BLOCK(cs_setpwalletRegistered)
78 setpwalletRegistered.insert(pwalletIn);
82 void UnregisterWallet(CWallet* pwalletIn)
84 CRITICAL_BLOCK(cs_setpwalletRegistered)
86 setpwalletRegistered.erase(pwalletIn);
90 bool static IsFromMe(CTransaction& tx)
92 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
93 if (pwallet->IsFromMe(tx))
98 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
100 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
101 if (pwallet->GetTransaction(hashTx,wtx))
106 void static EraseFromWallets(uint256 hash)
108 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
109 pwallet->EraseFromWallet(hash);
112 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
114 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
115 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
118 void static SetBestChain(const CBlockLocator& loc)
120 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
121 pwallet->SetBestChain(loc);
124 void static UpdatedTransaction(const uint256& hashTx)
126 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
127 pwallet->UpdatedTransaction(hashTx);
130 void static PrintWallets(const CBlock& block)
132 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
133 pwallet->PrintWallet(block);
136 void static Inventory(const uint256& hash)
138 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
139 pwallet->Inventory(hash);
142 void static ResendWalletTransactions()
144 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
145 pwallet->ResendWalletTransactions();
154 //////////////////////////////////////////////////////////////////////////////
156 // mapOrphanTransactions
159 void static AddOrphanTx(const CDataStream& vMsg)
162 CDataStream(vMsg) >> tx;
163 uint256 hash = tx.GetHash();
164 if (mapOrphanTransactions.count(hash))
166 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
167 BOOST_FOREACH(const CTxIn& txin, tx.vin)
168 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
171 void static EraseOrphanTx(uint256 hash)
173 if (!mapOrphanTransactions.count(hash))
175 const CDataStream* pvMsg = mapOrphanTransactions[hash];
177 CDataStream(*pvMsg) >> tx;
178 BOOST_FOREACH(const CTxIn& txin, tx.vin)
180 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
181 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
183 if ((*mi).second == pvMsg)
184 mapOrphanTransactionsByPrev.erase(mi++);
190 mapOrphanTransactions.erase(hash);
200 //////////////////////////////////////////////////////////////////////////////
202 // CTransaction and CTxIndex
205 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
208 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
210 if (!ReadFromDisk(txindexRet.pos))
212 if (prevout.n >= vout.size())
220 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
223 return ReadFromDisk(txdb, prevout, txindex);
226 bool CTransaction::ReadFromDisk(COutPoint prevout)
230 return ReadFromDisk(txdb, prevout, txindex);
235 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
247 // Load the block this tx is in
249 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
251 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
256 // Update the tx's hashBlock
257 hashBlock = pblock->GetHash();
259 // Locate the transaction
260 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
261 if (pblock->vtx[nIndex] == *(CTransaction*)this)
263 if (nIndex == pblock->vtx.size())
265 vMerkleBranch.clear();
267 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
271 // Fill in merkle branch
272 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
275 // Is the tx in a block that's in the main chain
276 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
277 if (mi == mapBlockIndex.end())
279 CBlockIndex* pindex = (*mi).second;
280 if (!pindex || !pindex->IsInMainChain())
283 return pindexBest->nHeight - pindex->nHeight + 1;
292 bool CTransaction::CheckTransaction() const
294 // Basic checks that don't depend on any context
296 return error("CTransaction::CheckTransaction() : vin empty");
298 return error("CTransaction::CheckTransaction() : vout empty");
300 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
301 return error("CTransaction::CheckTransaction() : size limits failed");
303 // Check for negative or overflow output values
305 BOOST_FOREACH(const CTxOut& txout, vout)
307 if (txout.nValue < 0)
308 return error("CTransaction::CheckTransaction() : txout.nValue negative");
309 if (txout.nValue > MAX_MONEY)
310 return error("CTransaction::CheckTransaction() : txout.nValue too high");
311 nValueOut += txout.nValue;
312 if (!MoneyRange(nValueOut))
313 return error("CTransaction::CheckTransaction() : txout total out of range");
316 // Check for duplicate inputs
317 set<COutPoint> vInOutPoints;
318 BOOST_FOREACH(const CTxIn& txin, vin)
320 if (vInOutPoints.count(txin.prevout))
322 vInOutPoints.insert(txin.prevout);
327 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
328 return error("CTransaction::CheckTransaction() : coinbase script size");
332 BOOST_FOREACH(const CTxIn& txin, vin)
333 if (txin.prevout.IsNull())
334 return error("CTransaction::CheckTransaction() : prevout is null");
340 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
343 *pfMissingInputs = false;
345 if (!CheckTransaction())
346 return error("AcceptToMemoryPool() : CheckTransaction failed");
348 // Coinbase is only valid in a block, not as a loose transaction
350 return error("AcceptToMemoryPool() : coinbase as individual tx");
352 // To help v0.1.5 clients who would see it as a negative number
353 if ((int64)nLockTime > INT_MAX)
354 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
357 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
358 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
359 // attacks disallow transactions with more than one SigOp per 34 bytes.
360 // 34 bytes because a TxOut is:
361 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
362 if (GetSigOpCount() > nSize / 34 || nSize < 100)
363 return error("AcceptToMemoryPool() : nonstandard transaction");
365 // Rather not work on nonstandard transactions (unless -testnet)
366 if (!fTestNet && !IsStandard())
367 return error("AcceptToMemoryPool() : nonstandard transaction type");
369 // Do we already have it?
370 uint256 hash = GetHash();
371 CRITICAL_BLOCK(cs_mapTransactions)
372 if (mapTransactions.count(hash))
375 if (txdb.ContainsTx(hash))
378 // Check for conflicts with in-memory transactions
379 CTransaction* ptxOld = NULL;
380 for (int i = 0; i < vin.size(); i++)
382 COutPoint outpoint = vin[i].prevout;
383 if (mapNextTx.count(outpoint))
385 // Disable replacement feature for now
388 // Allow replacing with a newer version of the same transaction
391 ptxOld = mapNextTx[outpoint].ptx;
392 if (ptxOld->IsFinal())
394 if (!IsNewerThan(*ptxOld))
396 for (int i = 0; i < vin.size(); i++)
398 COutPoint outpoint = vin[i].prevout;
399 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
408 // Check against previous transactions
409 map<uint256, CTxIndex> mapUnused;
411 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
414 *pfMissingInputs = true;
415 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
418 // Don't accept it if it can't get into a block
419 if (nFees < GetMinFee(1000, true, true))
420 return error("AcceptToMemoryPool() : not enough fees");
422 // Continuously rate-limit free transactions
423 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
424 // be annoying or make other's transactions take longer to confirm.
425 if (nFees < MIN_RELAY_TX_FEE)
427 static CCriticalSection cs;
428 static double dFreeCount;
429 static int64 nLastTime;
430 int64 nNow = GetTime();
434 // Use an exponentially decaying ~10-minute window:
435 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
437 // -limitfreerelay unit is thousand-bytes-per-minute
438 // At default rate it would take over a month to fill 1GB
439 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
440 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
442 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
448 // Store transaction in memory
449 CRITICAL_BLOCK(cs_mapTransactions)
453 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
454 ptxOld->RemoveFromMemoryPool();
456 AddToMemoryPoolUnchecked();
459 ///// are we sure this is ok when loading transactions or restoring block txes
460 // If updated, erase old tx from wallet
462 EraseFromWallets(ptxOld->GetHash());
464 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
468 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
471 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
474 bool CTransaction::AddToMemoryPoolUnchecked()
476 // Add to memory pool without checking anything. Don't call this directly,
477 // call AcceptToMemoryPool to properly check the transaction first.
478 CRITICAL_BLOCK(cs_mapTransactions)
480 uint256 hash = GetHash();
481 mapTransactions[hash] = *this;
482 for (int i = 0; i < vin.size(); i++)
483 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
484 nTransactionsUpdated++;
490 bool CTransaction::RemoveFromMemoryPool()
492 // Remove transaction from memory pool
493 CRITICAL_BLOCK(cs_mapTransactions)
495 BOOST_FOREACH(const CTxIn& txin, vin)
496 mapNextTx.erase(txin.prevout);
497 mapTransactions.erase(GetHash());
498 nTransactionsUpdated++;
508 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
510 if (hashBlock == 0 || nIndex == -1)
513 // Find the block it claims to be in
514 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
515 if (mi == mapBlockIndex.end())
517 CBlockIndex* pindex = (*mi).second;
518 if (!pindex || !pindex->IsInMainChain())
521 // Make sure the merkle branch connects to this block
522 if (!fMerkleVerified)
524 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
526 fMerkleVerified = true;
529 nHeightRet = pindex->nHeight;
530 return pindexBest->nHeight - pindex->nHeight + 1;
534 int CMerkleTx::GetBlocksToMaturity() const
538 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
542 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
546 if (!IsInMainChain() && !ClientConnectInputs())
548 return CTransaction::AcceptToMemoryPool(txdb, false);
552 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
556 bool CMerkleTx::AcceptToMemoryPool()
559 return AcceptToMemoryPool(txdb);
564 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
566 CRITICAL_BLOCK(cs_mapTransactions)
568 // Add previous supporting transactions first
569 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
571 if (!tx.IsCoinBase())
573 uint256 hash = tx.GetHash();
574 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
575 tx.AcceptToMemoryPool(txdb, fCheckInputs);
578 return AcceptToMemoryPool(txdb, fCheckInputs);
583 bool CWalletTx::AcceptWalletTransaction()
586 return AcceptWalletTransaction(txdb);
589 int CTxIndex::GetDepthInMainChain() const
593 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
595 // Find the block in the index
596 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
597 if (mi == mapBlockIndex.end())
599 CBlockIndex* pindex = (*mi).second;
600 if (!pindex || !pindex->IsInMainChain())
602 return 1 + nBestHeight - pindex->nHeight;
614 //////////////////////////////////////////////////////////////////////////////
616 // CBlock and CBlockIndex
619 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
621 if (!fReadTransactions)
623 *this = pindex->GetBlockHeader();
626 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
628 if (GetHash() != pindex->GetBlockHash())
629 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
633 uint256 static GetOrphanRoot(const CBlock* pblock)
635 // Work back to the first block in the orphan chain
636 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
637 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
638 return pblock->GetHash();
641 int64 static GetBlockValue(int nHeight, int64 nFees)
643 int64 nSubsidy = 50 * COIN;
645 // Subsidy is cut in half every 4 years
646 nSubsidy >>= (nHeight / 210000);
648 return nSubsidy + nFees;
651 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
653 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
654 const int64 nTargetSpacing = 10 * 60;
655 const int64 nInterval = nTargetTimespan / nTargetSpacing;
658 if (pindexLast == NULL)
659 return bnProofOfWorkLimit.GetCompact();
661 // Only change once per interval
662 if ((pindexLast->nHeight+1) % nInterval != 0)
663 return pindexLast->nBits;
665 // Go back by what we want to be 14 days worth of blocks
666 const CBlockIndex* pindexFirst = pindexLast;
667 for (int i = 0; pindexFirst && i < nInterval-1; i++)
668 pindexFirst = pindexFirst->pprev;
671 // Limit adjustment step
672 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
673 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
674 if (nActualTimespan < nTargetTimespan/4)
675 nActualTimespan = nTargetTimespan/4;
676 if (nActualTimespan > nTargetTimespan*4)
677 nActualTimespan = nTargetTimespan*4;
681 bnNew.SetCompact(pindexLast->nBits);
682 bnNew *= nActualTimespan;
683 bnNew /= nTargetTimespan;
685 if (bnNew > bnProofOfWorkLimit)
686 bnNew = bnProofOfWorkLimit;
689 printf("GetNextWorkRequired RETARGET\n");
690 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
691 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
692 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
694 return bnNew.GetCompact();
697 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
700 bnTarget.SetCompact(nBits);
703 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
704 return error("CheckProofOfWork() : nBits below minimum work");
706 // Check proof of work matches claimed amount
707 if (hash > bnTarget.getuint256())
708 return error("CheckProofOfWork() : hash doesn't match nBits");
713 // Return conservative estimate of total number of blocks, 0 if unknown
714 int GetTotalBlocksEstimate()
722 return nTotalBlocksEstimate;
726 // Return maximum amount of blocks that other nodes claim to have
727 int GetNumBlocksOfPeers()
729 return std::max(cPeerBlockCounts.median(), GetTotalBlocksEstimate());
732 bool IsInitialBlockDownload()
734 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
736 static int64 nLastUpdate;
737 static CBlockIndex* pindexLastBest;
738 if (pindexBest != pindexLastBest)
740 pindexLastBest = pindexBest;
741 nLastUpdate = GetTime();
743 return (GetTime() - nLastUpdate < 10 &&
744 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
747 void static InvalidChainFound(CBlockIndex* pindexNew)
749 if (pindexNew->bnChainWork > bnBestInvalidWork)
751 bnBestInvalidWork = pindexNew->bnChainWork;
752 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
755 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());
756 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
757 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
758 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
771 bool CTransaction::DisconnectInputs(CTxDB& txdb)
773 // Relinquish previous transactions' spent pointers
776 BOOST_FOREACH(const CTxIn& txin, vin)
778 COutPoint prevout = txin.prevout;
780 // Get prev txindex from disk
782 if (!txdb.ReadTxIndex(prevout.hash, txindex))
783 return error("DisconnectInputs() : ReadTxIndex failed");
785 if (prevout.n >= txindex.vSpent.size())
786 return error("DisconnectInputs() : prevout.n out of range");
788 // Mark outpoint as not spent
789 txindex.vSpent[prevout.n].SetNull();
792 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
793 return error("DisconnectInputs() : UpdateTxIndex failed");
797 // Remove transaction from index
798 if (!txdb.EraseTxIndex(*this))
799 return error("DisconnectInputs() : EraseTxPos failed");
805 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
806 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
808 // Take over previous transactions' spent pointers
812 for (int i = 0; i < vin.size(); i++)
814 COutPoint prevout = vin[i].prevout;
819 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
821 // Get txindex from current proposed changes
822 txindex = mapTestPool[prevout.hash];
826 // Read txindex from txdb
827 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
829 if (!fFound && (fBlock || fMiner))
830 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());
834 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
836 // Get prev tx from single transactions in memory
837 CRITICAL_BLOCK(cs_mapTransactions)
839 if (!mapTransactions.count(prevout.hash))
840 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
841 txPrev = mapTransactions[prevout.hash];
844 txindex.vSpent.resize(txPrev.vout.size());
848 // Get prev tx from disk
849 if (!txPrev.ReadFromDisk(txindex.pos))
850 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
853 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
854 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());
856 // If prev is coinbase, check that it's matured
857 if (txPrev.IsCoinBase())
858 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
859 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
860 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
863 if (!VerifySignature(txPrev, *this, i))
864 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
866 // Check for conflicts
867 if (!txindex.vSpent[prevout.n].IsNull())
868 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());
870 // Check for negative or overflow input values
871 nValueIn += txPrev.vout[prevout.n].nValue;
872 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
873 return error("ConnectInputs() : txin values out of range");
875 // Mark outpoints as spent
876 txindex.vSpent[prevout.n] = posThisTx;
879 if (fBlock || fMiner)
881 mapTestPool[prevout.hash] = txindex;
885 if (nValueIn < GetValueOut())
886 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
888 // Tally transaction fees
889 int64 nTxFee = nValueIn - GetValueOut();
891 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
892 if (nTxFee < nMinFee)
895 if (!MoneyRange(nFees))
896 return error("ConnectInputs() : nFees out of range");
901 // Add transaction to changes
902 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
906 // Add transaction to test pool
907 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
914 bool CTransaction::ClientConnectInputs()
919 // Take over previous transactions' spent pointers
920 CRITICAL_BLOCK(cs_mapTransactions)
923 for (int i = 0; i < vin.size(); i++)
925 // Get prev tx from single transactions in memory
926 COutPoint prevout = vin[i].prevout;
927 if (!mapTransactions.count(prevout.hash))
929 CTransaction& txPrev = mapTransactions[prevout.hash];
931 if (prevout.n >= txPrev.vout.size())
935 if (!VerifySignature(txPrev, *this, i))
936 return error("ConnectInputs() : VerifySignature failed");
938 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
939 ///// this has to go away now that posNext is gone
940 // // Check for conflicts
941 // if (!txPrev.vout[prevout.n].posNext.IsNull())
942 // return error("ConnectInputs() : prev tx already used");
944 // // Flag outpoints as used
945 // txPrev.vout[prevout.n].posNext = posThisTx;
947 nValueIn += txPrev.vout[prevout.n].nValue;
949 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
950 return error("ClientConnectInputs() : txin values out of range");
952 if (GetValueOut() > nValueIn)
962 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
964 // Disconnect in reverse order
965 for (int i = vtx.size()-1; i >= 0; i--)
966 if (!vtx[i].DisconnectInputs(txdb))
969 // Update block index on disk without changing it in memory.
970 // The memory index structure will be changed after the db commits.
973 CDiskBlockIndex blockindexPrev(pindex->pprev);
974 blockindexPrev.hashNext = 0;
975 if (!txdb.WriteBlockIndex(blockindexPrev))
976 return error("DisconnectBlock() : WriteBlockIndex failed");
982 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
984 // Check it again in case a previous version let a bad block in
988 //// issue here: it doesn't know the version
989 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
991 map<uint256, CTxIndex> mapQueuedChanges;
993 BOOST_FOREACH(CTransaction& tx, vtx)
995 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
996 nTxPos += ::GetSerializeSize(tx, SER_DISK);
998 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1001 // Write queued txindex changes
1002 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1004 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1005 return error("ConnectBlock() : UpdateTxIndex failed");
1008 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1011 // Update block index on disk without changing it in memory.
1012 // The memory index structure will be changed after the db commits.
1015 CDiskBlockIndex blockindexPrev(pindex->pprev);
1016 blockindexPrev.hashNext = pindex->GetBlockHash();
1017 if (!txdb.WriteBlockIndex(blockindexPrev))
1018 return error("ConnectBlock() : WriteBlockIndex failed");
1021 // Watch for transactions paying to me
1022 BOOST_FOREACH(CTransaction& tx, vtx)
1023 SyncWithWallets(tx, this, true);
1028 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1030 printf("REORGANIZE\n");
1033 CBlockIndex* pfork = pindexBest;
1034 CBlockIndex* plonger = pindexNew;
1035 while (pfork != plonger)
1037 while (plonger->nHeight > pfork->nHeight)
1038 if (!(plonger = plonger->pprev))
1039 return error("Reorganize() : plonger->pprev is null");
1040 if (pfork == plonger)
1042 if (!(pfork = pfork->pprev))
1043 return error("Reorganize() : pfork->pprev is null");
1046 // List of what to disconnect
1047 vector<CBlockIndex*> vDisconnect;
1048 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1049 vDisconnect.push_back(pindex);
1051 // List of what to connect
1052 vector<CBlockIndex*> vConnect;
1053 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1054 vConnect.push_back(pindex);
1055 reverse(vConnect.begin(), vConnect.end());
1057 // Disconnect shorter branch
1058 vector<CTransaction> vResurrect;
1059 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1062 if (!block.ReadFromDisk(pindex))
1063 return error("Reorganize() : ReadFromDisk for disconnect failed");
1064 if (!block.DisconnectBlock(txdb, pindex))
1065 return error("Reorganize() : DisconnectBlock failed");
1067 // Queue memory transactions to resurrect
1068 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1069 if (!tx.IsCoinBase())
1070 vResurrect.push_back(tx);
1073 // Connect longer branch
1074 vector<CTransaction> vDelete;
1075 for (int i = 0; i < vConnect.size(); i++)
1077 CBlockIndex* pindex = vConnect[i];
1079 if (!block.ReadFromDisk(pindex))
1080 return error("Reorganize() : ReadFromDisk for connect failed");
1081 if (!block.ConnectBlock(txdb, pindex))
1085 return error("Reorganize() : ConnectBlock failed");
1088 // Queue memory transactions to delete
1089 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1090 vDelete.push_back(tx);
1092 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1093 return error("Reorganize() : WriteHashBestChain failed");
1095 // Make sure it's successfully written to disk before changing memory structure
1096 if (!txdb.TxnCommit())
1097 return error("Reorganize() : TxnCommit failed");
1099 // Disconnect shorter branch
1100 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1102 pindex->pprev->pnext = NULL;
1104 // Connect longer branch
1105 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1107 pindex->pprev->pnext = pindex;
1109 // Resurrect memory transactions that were in the disconnected branch
1110 BOOST_FOREACH(CTransaction& tx, vResurrect)
1111 tx.AcceptToMemoryPool(txdb, false);
1113 // Delete redundant memory transactions that are in the connected branch
1114 BOOST_FOREACH(CTransaction& tx, vDelete)
1115 tx.RemoveFromMemoryPool();
1121 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1123 uint256 hash = GetHash();
1126 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1128 txdb.WriteHashBestChain(hash);
1129 if (!txdb.TxnCommit())
1130 return error("SetBestChain() : TxnCommit failed");
1131 pindexGenesisBlock = pindexNew;
1133 else if (hashPrevBlock == hashBestChain)
1135 // Adding to current best branch
1136 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1139 InvalidChainFound(pindexNew);
1140 return error("SetBestChain() : ConnectBlock failed");
1142 if (!txdb.TxnCommit())
1143 return error("SetBestChain() : TxnCommit failed");
1145 // Add to current best branch
1146 pindexNew->pprev->pnext = pindexNew;
1148 // Delete redundant memory transactions
1149 BOOST_FOREACH(CTransaction& tx, vtx)
1150 tx.RemoveFromMemoryPool();
1155 if (!Reorganize(txdb, pindexNew))
1158 InvalidChainFound(pindexNew);
1159 return error("SetBestChain() : Reorganize failed");
1163 // Update best block in wallet (so we can detect restored wallets)
1164 if (!IsInitialBlockDownload())
1166 const CBlockLocator locator(pindexNew);
1167 ::SetBestChain(locator);
1171 hashBestChain = hash;
1172 pindexBest = pindexNew;
1173 nBestHeight = pindexBest->nHeight;
1174 bnBestChainWork = pindexNew->bnChainWork;
1175 nTimeBestReceived = GetTime();
1176 nTransactionsUpdated++;
1177 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1183 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1185 // Check for duplicate
1186 uint256 hash = GetHash();
1187 if (mapBlockIndex.count(hash))
1188 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1190 // Construct new block index object
1191 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1193 return error("AddToBlockIndex() : new CBlockIndex failed");
1194 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1195 pindexNew->phashBlock = &((*mi).first);
1196 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1197 if (miPrev != mapBlockIndex.end())
1199 pindexNew->pprev = (*miPrev).second;
1200 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1202 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1206 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1207 if (!txdb.TxnCommit())
1211 if (pindexNew->bnChainWork > bnBestChainWork)
1212 if (!SetBestChain(txdb, pindexNew))
1217 if (pindexNew == pindexBest)
1219 // Notify UI to display prev block's coinbase if it was ours
1220 static uint256 hashPrevBestCoinBase;
1221 UpdatedTransaction(hashPrevBestCoinBase);
1222 hashPrevBestCoinBase = vtx[0].GetHash();
1232 bool CBlock::CheckBlock() const
1234 // These are checks that are independent of context
1235 // that can be verified before saving an orphan block.
1238 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1239 return error("CheckBlock() : size limits failed");
1241 // Check proof of work matches claimed amount
1242 if (!CheckProofOfWork(GetHash(), nBits))
1243 return error("CheckBlock() : proof of work failed");
1246 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1247 return error("CheckBlock() : block timestamp too far in the future");
1249 // First transaction must be coinbase, the rest must not be
1250 if (vtx.empty() || !vtx[0].IsCoinBase())
1251 return error("CheckBlock() : first tx is not coinbase");
1252 for (int i = 1; i < vtx.size(); i++)
1253 if (vtx[i].IsCoinBase())
1254 return error("CheckBlock() : more than one coinbase");
1256 // Check transactions
1257 BOOST_FOREACH(const CTransaction& tx, vtx)
1258 if (!tx.CheckTransaction())
1259 return error("CheckBlock() : CheckTransaction failed");
1261 // Check that it's not full of nonstandard transactions
1262 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1263 return error("CheckBlock() : too many nonstandard transactions");
1266 if (hashMerkleRoot != BuildMerkleTree())
1267 return error("CheckBlock() : hashMerkleRoot mismatch");
1272 bool CBlock::AcceptBlock()
1274 // Check for duplicate
1275 uint256 hash = GetHash();
1276 if (mapBlockIndex.count(hash))
1277 return error("AcceptBlock() : block already in mapBlockIndex");
1279 // Get prev block index
1280 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1281 if (mi == mapBlockIndex.end())
1282 return error("AcceptBlock() : prev block not found");
1283 CBlockIndex* pindexPrev = (*mi).second;
1284 int nHeight = pindexPrev->nHeight+1;
1286 // Check proof of work
1287 if (nBits != GetNextWorkRequired(pindexPrev))
1288 return error("AcceptBlock() : incorrect proof of work");
1290 // Check timestamp against prev
1291 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1292 return error("AcceptBlock() : block's timestamp is too early");
1294 // Check that all transactions are finalized
1295 BOOST_FOREACH(const CTransaction& tx, vtx)
1296 if (!tx.IsFinal(nHeight, GetBlockTime()))
1297 return error("AcceptBlock() : contains a non-final transaction");
1299 // Check that the block chain matches the known block chain up to a checkpoint
1301 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1302 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1303 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1304 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1305 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1306 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1307 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1308 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")) ||
1309 (nHeight == 140700 && hash != uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd")))
1310 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1312 // Write block to history file
1313 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1314 return error("AcceptBlock() : out of disk space");
1315 unsigned int nFile = -1;
1316 unsigned int nBlockPos = 0;
1317 if (!WriteToDisk(nFile, nBlockPos))
1318 return error("AcceptBlock() : WriteToDisk failed");
1319 if (!AddToBlockIndex(nFile, nBlockPos))
1320 return error("AcceptBlock() : AddToBlockIndex failed");
1322 // Relay inventory, but don't relay old inventory during initial block download
1323 if (hashBestChain == hash)
1324 CRITICAL_BLOCK(cs_vNodes)
1325 BOOST_FOREACH(CNode* pnode, vNodes)
1326 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1327 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1332 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1334 // Check for duplicate
1335 uint256 hash = pblock->GetHash();
1336 if (mapBlockIndex.count(hash))
1337 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1338 if (mapOrphanBlocks.count(hash))
1339 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1341 // Preliminary checks
1342 if (!pblock->CheckBlock())
1343 return error("ProcessBlock() : CheckBlock FAILED");
1345 // If don't already have its previous block, shunt it off to holding area until we get it
1346 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1348 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1349 CBlock* pblock2 = new CBlock(*pblock);
1350 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1351 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1353 // Ask this guy to fill in what we're missing
1355 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1360 if (!pblock->AcceptBlock())
1361 return error("ProcessBlock() : AcceptBlock FAILED");
1363 // Recursively process any orphan blocks that depended on this one
1364 vector<uint256> vWorkQueue;
1365 vWorkQueue.push_back(hash);
1366 for (int i = 0; i < vWorkQueue.size(); i++)
1368 uint256 hashPrev = vWorkQueue[i];
1369 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1370 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1373 CBlock* pblockOrphan = (*mi).second;
1374 if (pblockOrphan->AcceptBlock())
1375 vWorkQueue.push_back(pblockOrphan->GetHash());
1376 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1377 delete pblockOrphan;
1379 mapOrphanBlocksByPrev.erase(hashPrev);
1382 printf("ProcessBlock: ACCEPTED\n");
1393 bool CheckDiskSpace(uint64 nAdditionalBytes)
1395 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1397 // Check for 15MB because database could create another 10MB log file at any time
1398 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1401 string strMessage = _("Warning: Disk space is low ");
1402 strMiscWarning = strMessage;
1403 printf("*** %s\n", strMessage.c_str());
1404 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1405 CreateThread(Shutdown, NULL);
1411 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1415 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1418 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1420 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1429 static unsigned int nCurrentBlockFile = 1;
1431 FILE* AppendBlockFile(unsigned int& nFileRet)
1436 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1439 if (fseek(file, 0, SEEK_END) != 0)
1441 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1442 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1444 nFileRet = nCurrentBlockFile;
1448 nCurrentBlockFile++;
1452 bool LoadBlockIndex(bool fAllowNew)
1456 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1457 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1458 pchMessageStart[0] = 0xfa;
1459 pchMessageStart[1] = 0xbf;
1460 pchMessageStart[2] = 0xb5;
1461 pchMessageStart[3] = 0xda;
1468 if (!txdb.LoadBlockIndex())
1473 // Init with genesis block
1475 if (mapBlockIndex.empty())
1481 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1482 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1483 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1484 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1485 // vMerkleTree: 4a5e1e
1488 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1490 txNew.vin.resize(1);
1491 txNew.vout.resize(1);
1492 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1493 txNew.vout[0].nValue = 50 * COIN;
1494 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1496 block.vtx.push_back(txNew);
1497 block.hashPrevBlock = 0;
1498 block.hashMerkleRoot = block.BuildMerkleTree();
1500 block.nTime = 1231006505;
1501 block.nBits = 0x1d00ffff;
1502 block.nNonce = 2083236893;
1506 block.nTime = 1296688602;
1507 block.nBits = 0x1d07fff8;
1508 block.nNonce = 384568319;
1512 printf("%s\n", block.GetHash().ToString().c_str());
1513 printf("%s\n", hashGenesisBlock.ToString().c_str());
1514 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1515 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1517 assert(block.GetHash() == hashGenesisBlock);
1519 // Start new block file
1521 unsigned int nBlockPos;
1522 if (!block.WriteToDisk(nFile, nBlockPos))
1523 return error("LoadBlockIndex() : writing genesis block to disk failed");
1524 if (!block.AddToBlockIndex(nFile, nBlockPos))
1525 return error("LoadBlockIndex() : genesis block not accepted");
1533 void PrintBlockTree()
1535 // precompute tree structure
1536 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1537 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1539 CBlockIndex* pindex = (*mi).second;
1540 mapNext[pindex->pprev].push_back(pindex);
1542 //while (rand() % 3 == 0)
1543 // mapNext[pindex->pprev].push_back(pindex);
1546 vector<pair<int, CBlockIndex*> > vStack;
1547 vStack.push_back(make_pair(0, pindexGenesisBlock));
1550 while (!vStack.empty())
1552 int nCol = vStack.back().first;
1553 CBlockIndex* pindex = vStack.back().second;
1556 // print split or gap
1557 if (nCol > nPrevCol)
1559 for (int i = 0; i < nCol-1; i++)
1563 else if (nCol < nPrevCol)
1565 for (int i = 0; i < nCol; i++)
1572 for (int i = 0; i < nCol; i++)
1577 block.ReadFromDisk(pindex);
1578 printf("%d (%u,%u) %s %s tx %d",
1582 block.GetHash().ToString().substr(0,20).c_str(),
1583 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1586 PrintWallets(block);
1588 // put the main timechain first
1589 vector<CBlockIndex*>& vNext = mapNext[pindex];
1590 for (int i = 0; i < vNext.size(); i++)
1592 if (vNext[i]->pnext)
1594 swap(vNext[0], vNext[i]);
1600 for (int i = 0; i < vNext.size(); i++)
1601 vStack.push_back(make_pair(nCol+i, vNext[i]));
1614 //////////////////////////////////////////////////////////////////////////////
1619 map<uint256, CAlert> mapAlerts;
1620 CCriticalSection cs_mapAlerts;
1622 string GetWarnings(string strFor)
1625 string strStatusBar;
1627 if (GetBoolArg("-testsafemode"))
1630 // Misc warnings like out of disk space and clock is wrong
1631 if (strMiscWarning != "")
1634 strStatusBar = strMiscWarning;
1637 // Longer invalid proof-of-work chain
1638 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1641 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1645 CRITICAL_BLOCK(cs_mapAlerts)
1647 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1649 const CAlert& alert = item.second;
1650 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1652 nPriority = alert.nPriority;
1653 strStatusBar = alert.strStatusBar;
1658 if (strFor == "statusbar")
1659 return strStatusBar;
1660 else if (strFor == "rpc")
1662 assert(!"GetWarnings() : invalid parameter");
1666 bool CAlert::ProcessAlert()
1668 if (!CheckSignature())
1673 CRITICAL_BLOCK(cs_mapAlerts)
1675 // Cancel previous alerts
1676 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1678 const CAlert& alert = (*mi).second;
1681 printf("cancelling alert %d\n", alert.nID);
1682 mapAlerts.erase(mi++);
1684 else if (!alert.IsInEffect())
1686 printf("expiring alert %d\n", alert.nID);
1687 mapAlerts.erase(mi++);
1693 // Check if this alert has been cancelled
1694 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1696 const CAlert& alert = item.second;
1697 if (alert.Cancels(*this))
1699 printf("alert already cancelled by %d\n", alert.nID);
1705 mapAlerts.insert(make_pair(GetHash(), *this));
1708 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1720 //////////////////////////////////////////////////////////////////////////////
1726 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1730 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1731 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1733 // Don't know what it is, just say we already got one
1740 // The message start string is designed to be unlikely to occur in normal data.
1741 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1742 // a large 4-byte int at any alignment.
1743 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1746 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1748 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1749 RandAddSeedPerfmon();
1751 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1752 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1754 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1756 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1764 if (strCommand == "version")
1766 // Each connection can only send one version message
1767 if (pfrom->nVersion != 0)
1774 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1775 if (pfrom->nVersion == 10300)
1776 pfrom->nVersion = 300;
1777 if (pfrom->nVersion >= 106 && !vRecv.empty())
1778 vRecv >> addrFrom >> nNonce;
1779 if (pfrom->nVersion >= 106 && !vRecv.empty())
1780 vRecv >> pfrom->strSubVer;
1781 if (pfrom->nVersion >= 209 && !vRecv.empty())
1782 vRecv >> pfrom->nStartingHeight;
1784 if (pfrom->nVersion == 0)
1787 // Disconnect if we connected to ourself
1788 if (nNonce == nLocalHostNonce && nNonce > 1)
1790 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1791 pfrom->fDisconnect = true;
1795 // Be shy and don't send version until we hear
1796 if (pfrom->fInbound)
1797 pfrom->PushVersion();
1799 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1801 AddTimeData(pfrom->addr.ip, nTime);
1804 if (pfrom->nVersion >= 209)
1805 pfrom->PushMessage("verack");
1806 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1807 if (pfrom->nVersion < 209)
1808 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1810 if (!pfrom->fInbound)
1812 // Advertise our address
1813 if (addrLocalHost.IsRoutable() && !fUseProxy)
1815 CAddress addr(addrLocalHost);
1816 addr.nTime = GetAdjustedTime();
1817 pfrom->PushAddress(addr);
1820 // Get recent addresses
1821 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1823 pfrom->PushMessage("getaddr");
1824 pfrom->fGetAddr = true;
1828 // Ask the first connected node for block updates
1829 static int nAskedForBlocks;
1830 if (!pfrom->fClient &&
1831 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1832 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1835 pfrom->PushGetBlocks(pindexBest, uint256(0));
1839 CRITICAL_BLOCK(cs_mapAlerts)
1840 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1841 item.second.RelayTo(pfrom);
1843 pfrom->fSuccessfullyConnected = true;
1845 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1847 cPeerBlockCounts.input(pfrom->nStartingHeight);
1851 else if (pfrom->nVersion == 0)
1853 // Must have a version message before anything else
1858 else if (strCommand == "verack")
1860 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1864 else if (strCommand == "addr")
1866 vector<CAddress> vAddr;
1869 // Don't want addr from older versions unless seeding
1870 if (pfrom->nVersion < 209)
1872 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1874 if (vAddr.size() > 1000)
1875 return error("message addr size() = %d", vAddr.size());
1877 // Store the new addresses
1880 int64 nNow = GetAdjustedTime();
1881 int64 nSince = nNow - 10 * 60;
1882 BOOST_FOREACH(CAddress& addr, vAddr)
1886 // ignore IPv6 for now, since it isn't implemented anyway
1889 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1890 addr.nTime = nNow - 5 * 24 * 60 * 60;
1891 AddAddress(addr, 2 * 60 * 60, &addrDB);
1892 pfrom->AddAddressKnown(addr);
1893 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1895 // Relay to a limited number of other nodes
1896 CRITICAL_BLOCK(cs_vNodes)
1898 // Use deterministic randomness to send to the same nodes for 24 hours
1899 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1900 static uint256 hashSalt;
1902 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1903 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1904 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1905 multimap<uint256, CNode*> mapMix;
1906 BOOST_FOREACH(CNode* pnode, vNodes)
1908 if (pnode->nVersion < 31402)
1910 unsigned int nPointer;
1911 memcpy(&nPointer, &pnode, sizeof(nPointer));
1912 uint256 hashKey = hashRand ^ nPointer;
1913 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1914 mapMix.insert(make_pair(hashKey, pnode));
1916 int nRelayNodes = 2;
1917 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1918 ((*mi).second)->PushAddress(addr);
1922 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1923 if (vAddr.size() < 1000)
1924 pfrom->fGetAddr = false;
1928 else if (strCommand == "inv")
1932 if (vInv.size() > 50000)
1933 return error("message inv size() = %d", vInv.size());
1936 BOOST_FOREACH(const CInv& inv, vInv)
1940 pfrom->AddInventoryKnown(inv);
1942 bool fAlreadyHave = AlreadyHave(txdb, inv);
1944 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1948 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1949 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1951 // Track requests for our stuff
1952 Inventory(inv.hash);
1957 else if (strCommand == "getdata")
1961 if (vInv.size() > 50000)
1962 return error("message getdata size() = %d", vInv.size());
1964 BOOST_FOREACH(const CInv& inv, vInv)
1968 printf("received getdata for: %s\n", inv.ToString().c_str());
1970 if (inv.type == MSG_BLOCK)
1972 // Send block from disk
1973 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1974 if (mi != mapBlockIndex.end())
1977 block.ReadFromDisk((*mi).second);
1978 pfrom->PushMessage("block", block);
1980 // Trigger them to send a getblocks request for the next batch of inventory
1981 if (inv.hash == pfrom->hashContinue)
1983 // Bypass PushInventory, this must send even if redundant,
1984 // and we want it right after the last block so they don't
1985 // wait for other stuff first.
1987 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
1988 pfrom->PushMessage("inv", vInv);
1989 pfrom->hashContinue = 0;
1993 else if (inv.IsKnownType())
1995 // Send stream from relay memory
1996 CRITICAL_BLOCK(cs_mapRelay)
1998 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
1999 if (mi != mapRelay.end())
2000 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2004 // Track requests for our stuff
2005 Inventory(inv.hash);
2010 else if (strCommand == "getblocks")
2012 CBlockLocator locator;
2014 vRecv >> locator >> hashStop;
2016 // Find the last block the caller has in the main chain
2017 CBlockIndex* pindex = locator.GetBlockIndex();
2019 // Send the rest of the chain
2021 pindex = pindex->pnext;
2022 int nLimit = 500 + locator.GetDistanceBack();
2023 unsigned int nBytes = 0;
2024 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2025 for (; pindex; pindex = pindex->pnext)
2027 if (pindex->GetBlockHash() == hashStop)
2029 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2032 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2034 block.ReadFromDisk(pindex, true);
2035 nBytes += block.GetSerializeSize(SER_NETWORK);
2036 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2038 // When this block is requested, we'll send an inv that'll make them
2039 // getblocks the next batch of inventory.
2040 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2041 pfrom->hashContinue = pindex->GetBlockHash();
2048 else if (strCommand == "getheaders")
2050 CBlockLocator locator;
2052 vRecv >> locator >> hashStop;
2054 CBlockIndex* pindex = NULL;
2055 if (locator.IsNull())
2057 // If locator is null, return the hashStop block
2058 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2059 if (mi == mapBlockIndex.end())
2061 pindex = (*mi).second;
2065 // Find the last block the caller has in the main chain
2066 pindex = locator.GetBlockIndex();
2068 pindex = pindex->pnext;
2071 vector<CBlock> vHeaders;
2072 int nLimit = 2000 + locator.GetDistanceBack();
2073 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2074 for (; pindex; pindex = pindex->pnext)
2076 vHeaders.push_back(pindex->GetBlockHeader());
2077 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2080 pfrom->PushMessage("headers", vHeaders);
2084 else if (strCommand == "tx")
2086 vector<uint256> vWorkQueue;
2087 CDataStream vMsg(vRecv);
2091 CInv inv(MSG_TX, tx.GetHash());
2092 pfrom->AddInventoryKnown(inv);
2094 bool fMissingInputs = false;
2095 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2097 SyncWithWallets(tx, NULL, true);
2098 RelayMessage(inv, vMsg);
2099 mapAlreadyAskedFor.erase(inv);
2100 vWorkQueue.push_back(inv.hash);
2102 // Recursively process any orphan transactions that depended on this one
2103 for (int i = 0; i < vWorkQueue.size(); i++)
2105 uint256 hashPrev = vWorkQueue[i];
2106 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2107 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2110 const CDataStream& vMsg = *((*mi).second);
2112 CDataStream(vMsg) >> tx;
2113 CInv inv(MSG_TX, tx.GetHash());
2115 if (tx.AcceptToMemoryPool(true))
2117 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2118 SyncWithWallets(tx, NULL, true);
2119 RelayMessage(inv, vMsg);
2120 mapAlreadyAskedFor.erase(inv);
2121 vWorkQueue.push_back(inv.hash);
2126 BOOST_FOREACH(uint256 hash, vWorkQueue)
2127 EraseOrphanTx(hash);
2129 else if (fMissingInputs)
2131 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2137 else if (strCommand == "block")
2142 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2145 CInv inv(MSG_BLOCK, block.GetHash());
2146 pfrom->AddInventoryKnown(inv);
2148 if (ProcessBlock(pfrom, &block))
2149 mapAlreadyAskedFor.erase(inv);
2153 else if (strCommand == "getaddr")
2155 // Nodes rebroadcast an addr every 24 hours
2156 pfrom->vAddrToSend.clear();
2157 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2158 CRITICAL_BLOCK(cs_mapAddresses)
2160 unsigned int nCount = 0;
2161 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2163 const CAddress& addr = item.second;
2164 if (addr.nTime > nSince)
2167 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2169 const CAddress& addr = item.second;
2170 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2171 pfrom->PushAddress(addr);
2177 else if (strCommand == "checkorder")
2182 if (!GetBoolArg("-allowreceivebyip"))
2184 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2191 /// we have a chance to check the order here
2193 // Keep giving the same key to the same ip until they use it
2194 if (!mapReuseKey.count(pfrom->addr.ip))
2195 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2197 // Send back approval of order and pubkey to use
2198 CScript scriptPubKey;
2199 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2200 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2204 else if (strCommand == "reply")
2209 CRequestTracker tracker;
2210 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2212 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2213 if (mi != pfrom->mapRequests.end())
2215 tracker = (*mi).second;
2216 pfrom->mapRequests.erase(mi);
2219 if (!tracker.IsNull())
2220 tracker.fn(tracker.param1, vRecv);
2224 else if (strCommand == "ping")
2229 else if (strCommand == "alert")
2234 if (alert.ProcessAlert())
2237 pfrom->setKnown.insert(alert.GetHash());
2238 CRITICAL_BLOCK(cs_vNodes)
2239 BOOST_FOREACH(CNode* pnode, vNodes)
2240 alert.RelayTo(pnode);
2247 // Ignore unknown commands for extensibility
2251 // Update the last seen time for this node's address
2252 if (pfrom->fNetworkNode)
2253 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2254 AddressCurrentlyConnected(pfrom->addr);
2260 bool ProcessMessages(CNode* pfrom)
2262 CDataStream& vRecv = pfrom->vRecv;
2266 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2270 // (4) message start
2279 // Scan for message start
2280 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2281 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2282 if (vRecv.end() - pstart < nHeaderSize)
2284 if (vRecv.size() > nHeaderSize)
2286 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2287 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2291 if (pstart - vRecv.begin() > 0)
2292 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2293 vRecv.erase(vRecv.begin(), pstart);
2296 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2301 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2304 string strCommand = hdr.GetCommand();
2307 unsigned int nMessageSize = hdr.nMessageSize;
2308 if (nMessageSize > MAX_SIZE)
2310 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2313 if (nMessageSize > vRecv.size())
2315 // Rewind and wait for rest of message
2316 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2321 if (vRecv.GetVersion() >= 209)
2323 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2324 unsigned int nChecksum = 0;
2325 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2326 if (nChecksum != hdr.nChecksum)
2328 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2329 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2334 // Copy message to its own buffer
2335 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2336 vRecv.ignore(nMessageSize);
2342 CRITICAL_BLOCK(cs_main)
2343 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2347 catch (std::ios_base::failure& e)
2349 if (strstr(e.what(), "end of data"))
2351 // Allow exceptions from underlength message on vRecv
2352 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());
2354 else if (strstr(e.what(), "size too large"))
2356 // Allow exceptions from overlong size
2357 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2361 PrintExceptionContinue(&e, "ProcessMessage()");
2364 catch (std::exception& e) {
2365 PrintExceptionContinue(&e, "ProcessMessage()");
2367 PrintExceptionContinue(NULL, "ProcessMessage()");
2371 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2379 bool SendMessages(CNode* pto, bool fSendTrickle)
2381 CRITICAL_BLOCK(cs_main)
2383 // Don't send anything until we get their version message
2384 if (pto->nVersion == 0)
2388 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2389 pto->PushMessage("ping");
2391 // Resend wallet transactions that haven't gotten in a block yet
2392 ResendWalletTransactions();
2394 // Address refresh broadcast
2395 static int64 nLastRebroadcast;
2396 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2398 nLastRebroadcast = GetTime();
2399 CRITICAL_BLOCK(cs_vNodes)
2401 BOOST_FOREACH(CNode* pnode, vNodes)
2403 // Periodically clear setAddrKnown to allow refresh broadcasts
2404 pnode->setAddrKnown.clear();
2406 // Rebroadcast our address
2407 if (addrLocalHost.IsRoutable() && !fUseProxy)
2409 CAddress addr(addrLocalHost);
2410 addr.nTime = GetAdjustedTime();
2411 pnode->PushAddress(addr);
2417 // Clear out old addresses periodically so it's not too much work at once
2418 static int64 nLastClear;
2419 if (nLastClear == 0)
2420 nLastClear = GetTime();
2421 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2423 nLastClear = GetTime();
2424 CRITICAL_BLOCK(cs_mapAddresses)
2427 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2428 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2429 mi != mapAddresses.end();)
2431 const CAddress& addr = (*mi).second;
2432 if (addr.nTime < nSince)
2434 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2436 addrdb.EraseAddress(addr);
2437 mapAddresses.erase(mi++);
2451 vector<CAddress> vAddr;
2452 vAddr.reserve(pto->vAddrToSend.size());
2453 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2455 // returns true if wasn't already contained in the set
2456 if (pto->setAddrKnown.insert(addr).second)
2458 vAddr.push_back(addr);
2459 // receiver rejects addr messages larger than 1000
2460 if (vAddr.size() >= 1000)
2462 pto->PushMessage("addr", vAddr);
2467 pto->vAddrToSend.clear();
2469 pto->PushMessage("addr", vAddr);
2474 // Message: inventory
2477 vector<CInv> vInvWait;
2478 CRITICAL_BLOCK(pto->cs_inventory)
2480 vInv.reserve(pto->vInventoryToSend.size());
2481 vInvWait.reserve(pto->vInventoryToSend.size());
2482 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2484 if (pto->setInventoryKnown.count(inv))
2487 // trickle out tx inv to protect privacy
2488 if (inv.type == MSG_TX && !fSendTrickle)
2490 // 1/4 of tx invs blast to all immediately
2491 static uint256 hashSalt;
2493 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2494 uint256 hashRand = inv.hash ^ hashSalt;
2495 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2496 bool fTrickleWait = ((hashRand & 3) != 0);
2498 // always trickle our own transactions
2502 if (GetTransaction(inv.hash, wtx))
2504 fTrickleWait = true;
2509 vInvWait.push_back(inv);
2514 // returns true if wasn't already contained in the set
2515 if (pto->setInventoryKnown.insert(inv).second)
2517 vInv.push_back(inv);
2518 if (vInv.size() >= 1000)
2520 pto->PushMessage("inv", vInv);
2525 pto->vInventoryToSend = vInvWait;
2528 pto->PushMessage("inv", vInv);
2534 vector<CInv> vGetData;
2535 int64 nNow = GetTime() * 1000000;
2537 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2539 const CInv& inv = (*pto->mapAskFor.begin()).second;
2540 if (!AlreadyHave(txdb, inv))
2542 printf("sending getdata: %s\n", inv.ToString().c_str());
2543 vGetData.push_back(inv);
2544 if (vGetData.size() >= 1000)
2546 pto->PushMessage("getdata", vGetData);
2550 mapAlreadyAskedFor[inv] = nNow;
2551 pto->mapAskFor.erase(pto->mapAskFor.begin());
2553 if (!vGetData.empty())
2554 pto->PushMessage("getdata", vGetData);
2573 //////////////////////////////////////////////////////////////////////////////
2578 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2580 unsigned char* pdata = (unsigned char*)pbuffer;
2581 unsigned int blocks = 1 + ((len + 8) / 64);
2582 unsigned char* pend = pdata + 64 * blocks;
2583 memset(pdata + len, 0, 64 * blocks - len);
2585 unsigned int bits = len * 8;
2586 pend[-1] = (bits >> 0) & 0xff;
2587 pend[-2] = (bits >> 8) & 0xff;
2588 pend[-3] = (bits >> 16) & 0xff;
2589 pend[-4] = (bits >> 24) & 0xff;
2593 using CryptoPP::ByteReverse;
2595 static const unsigned int pSHA256InitState[8] =
2596 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2598 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2600 memcpy(pstate, pinit, 32);
2601 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2605 // ScanHash scans nonces looking for a hash with at least some zero bits.
2606 // It operates on big endian data. Caller does the byte reversing.
2607 // All input buffers are 16-byte aligned. nNonce is usually preserved
2608 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2609 // the block is rebuilt and nNonce starts over at zero.
2611 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2613 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2617 // Hash pdata using pmidstate as the starting state into
2618 // preformatted buffer phash1, then hash phash1 into phash
2620 SHA256Transform(phash1, pdata, pmidstate);
2621 SHA256Transform(phash, phash1, pSHA256InitState);
2623 // Return the nonce if the hash has at least some zero bits,
2624 // caller will check if it has enough to reach the target
2625 if (((unsigned short*)phash)[14] == 0)
2628 // If nothing found after trying for a while, return -1
2629 if ((nNonce & 0xffff) == 0)
2631 nHashesDone = 0xffff+1;
2637 // Some explaining would be appreciated
2642 set<uint256> setDependsOn;
2645 COrphan(CTransaction* ptxIn)
2653 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2654 BOOST_FOREACH(uint256 hash, setDependsOn)
2655 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2660 CBlock* CreateNewBlock(CReserveKey& reservekey)
2662 CBlockIndex* pindexPrev = pindexBest;
2665 auto_ptr<CBlock> pblock(new CBlock());
2669 // Create coinbase tx
2671 txNew.vin.resize(1);
2672 txNew.vin[0].prevout.SetNull();
2673 txNew.vout.resize(1);
2674 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2676 // Add our coinbase tx as first transaction
2677 pblock->vtx.push_back(txNew);
2679 // Collect memory pool transactions into the block
2681 CRITICAL_BLOCK(cs_main)
2682 CRITICAL_BLOCK(cs_mapTransactions)
2686 // Priority order to process transactions
2687 list<COrphan> vOrphan; // list memory doesn't move
2688 map<uint256, vector<COrphan*> > mapDependers;
2689 multimap<double, CTransaction*> mapPriority;
2690 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2692 CTransaction& tx = (*mi).second;
2693 if (tx.IsCoinBase() || !tx.IsFinal())
2696 COrphan* porphan = NULL;
2697 double dPriority = 0;
2698 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2700 // Read prev transaction
2701 CTransaction txPrev;
2703 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2705 // Has to wait for dependencies
2708 // Use list for automatic deletion
2709 vOrphan.push_back(COrphan(&tx));
2710 porphan = &vOrphan.back();
2712 mapDependers[txin.prevout.hash].push_back(porphan);
2713 porphan->setDependsOn.insert(txin.prevout.hash);
2716 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2718 // Read block header
2719 int nConf = txindex.GetDepthInMainChain();
2721 dPriority += (double)nValueIn * nConf;
2723 if (fDebug && GetBoolArg("-printpriority"))
2724 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2727 // Priority is sum(valuein * age) / txsize
2728 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2731 porphan->dPriority = dPriority;
2733 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2735 if (fDebug && GetBoolArg("-printpriority"))
2737 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2744 // Collect transactions into block
2745 map<uint256, CTxIndex> mapTestPool;
2746 uint64 nBlockSize = 1000;
2747 int nBlockSigOps = 100;
2748 while (!mapPriority.empty())
2750 // Take highest priority transaction off priority queue
2751 double dPriority = -(*mapPriority.begin()).first;
2752 CTransaction& tx = *(*mapPriority.begin()).second;
2753 mapPriority.erase(mapPriority.begin());
2756 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2757 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2759 int nTxSigOps = tx.GetSigOpCount();
2760 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2763 // Transaction fee required depends on block size
2764 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2765 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2767 // Connecting shouldn't fail due to dependency on other memory pool transactions
2768 // because we're already processing them in order of dependency
2769 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2770 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2772 swap(mapTestPool, mapTestPoolTmp);
2775 pblock->vtx.push_back(tx);
2776 nBlockSize += nTxSize;
2777 nBlockSigOps += nTxSigOps;
2779 // Add transactions that depend on this one to the priority queue
2780 uint256 hash = tx.GetHash();
2781 if (mapDependers.count(hash))
2783 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2785 if (!porphan->setDependsOn.empty())
2787 porphan->setDependsOn.erase(hash);
2788 if (porphan->setDependsOn.empty())
2789 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2795 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2798 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2799 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2800 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2801 pblock->nBits = GetNextWorkRequired(pindexPrev);
2804 return pblock.release();
2808 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2810 // Update nExtraNonce
2811 static uint256 hashPrevBlock;
2812 if (hashPrevBlock != pblock->hashPrevBlock)
2815 hashPrevBlock = pblock->hashPrevBlock;
2818 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2819 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2823 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2826 // Prebuild hash buffers
2833 uint256 hashPrevBlock;
2834 uint256 hashMerkleRoot;
2837 unsigned int nNonce;
2840 unsigned char pchPadding0[64];
2842 unsigned char pchPadding1[64];
2845 memset(&tmp, 0, sizeof(tmp));
2847 tmp.block.nVersion = pblock->nVersion;
2848 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2849 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2850 tmp.block.nTime = pblock->nTime;
2851 tmp.block.nBits = pblock->nBits;
2852 tmp.block.nNonce = pblock->nNonce;
2854 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2855 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2857 // Byte swap all the input buffer
2858 for (int i = 0; i < sizeof(tmp)/4; i++)
2859 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2861 // Precalc the first half of the first hash, which stays constant
2862 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2864 memcpy(pdata, &tmp.block, 128);
2865 memcpy(phash1, &tmp.hash1, 64);
2869 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2871 uint256 hash = pblock->GetHash();
2872 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2874 if (hash > hashTarget)
2878 printf("BitcoinMiner:\n");
2879 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2881 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2882 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2885 CRITICAL_BLOCK(cs_main)
2887 if (pblock->hashPrevBlock != hashBestChain)
2888 return error("BitcoinMiner : generated block is stale");
2890 // Remove key from key pool
2891 reservekey.KeepKey();
2893 // Track how many getdata requests this block gets
2894 CRITICAL_BLOCK(wallet.cs_wallet)
2895 wallet.mapRequestCount[pblock->GetHash()] = 0;
2897 // Process this block the same as if we had received it from another node
2898 if (!ProcessBlock(NULL, pblock))
2899 return error("BitcoinMiner : ProcessBlock, block not accepted");
2906 void static ThreadBitcoinMiner(void* parg);
2908 void static BitcoinMiner(CWallet *pwallet)
2910 printf("BitcoinMiner started\n");
2911 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2913 // Each thread has its own key and counter
2914 CReserveKey reservekey(pwallet);
2915 unsigned int nExtraNonce = 0;
2917 while (fGenerateBitcoins)
2919 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2923 while (vNodes.empty() || IsInitialBlockDownload())
2928 if (!fGenerateBitcoins)
2936 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2937 CBlockIndex* pindexPrev = pindexBest;
2939 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2942 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2944 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2948 // Prebuild hash buffers
2950 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2951 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2952 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2954 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2956 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2957 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2963 int64 nStart = GetTime();
2964 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2966 uint256& hash = *alignup<16>(hashbuf);
2969 unsigned int nHashesDone = 0;
2970 unsigned int nNonceFound;
2973 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2974 (char*)&hash, nHashesDone);
2976 // Check if something found
2977 if (nNonceFound != -1)
2979 for (int i = 0; i < sizeof(hash)/4; i++)
2980 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2982 if (hash <= hashTarget)
2985 pblock->nNonce = ByteReverse(nNonceFound);
2986 assert(hash == pblock->GetHash());
2988 SetThreadPriority(THREAD_PRIORITY_NORMAL);
2989 CheckWork(pblock.get(), *pwalletMain, reservekey);
2990 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2996 static int64 nHashCounter;
2997 if (nHPSTimerStart == 0)
2999 nHPSTimerStart = GetTimeMillis();
3003 nHashCounter += nHashesDone;
3004 if (GetTimeMillis() - nHPSTimerStart > 4000)
3006 static CCriticalSection cs;
3009 if (GetTimeMillis() - nHPSTimerStart > 4000)
3011 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3012 nHPSTimerStart = GetTimeMillis();
3014 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3015 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3016 static int64 nLogTime;
3017 if (GetTime() - nLogTime > 30 * 60)
3019 nLogTime = GetTime();
3020 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3021 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3027 // Check for stop or if block needs to be rebuilt
3030 if (!fGenerateBitcoins)
3032 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3036 if (nBlockNonce >= 0xffff0000)
3038 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3040 if (pindexPrev != pindexBest)
3043 // Update nTime every few seconds
3044 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3045 nBlockTime = ByteReverse(pblock->nTime);
3050 void static ThreadBitcoinMiner(void* parg)
3052 CWallet* pwallet = (CWallet*)parg;
3055 vnThreadsRunning[3]++;
3056 BitcoinMiner(pwallet);
3057 vnThreadsRunning[3]--;
3059 catch (std::exception& e) {
3060 vnThreadsRunning[3]--;
3061 PrintException(&e, "ThreadBitcoinMiner()");
3063 vnThreadsRunning[3]--;
3064 PrintException(NULL, "ThreadBitcoinMiner()");
3066 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3068 if (vnThreadsRunning[3] == 0)
3070 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3074 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3076 if (fGenerateBitcoins != fGenerate)
3078 fGenerateBitcoins = fGenerate;
3079 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3082 if (fGenerateBitcoins)
3084 int nProcessors = boost::thread::hardware_concurrency();
3085 printf("%d processors\n", nProcessors);
3086 if (nProcessors < 1)
3088 if (fLimitProcessors && nProcessors > nLimitProcessors)
3089 nProcessors = nLimitProcessors;
3090 int nAddThreads = nProcessors - vnThreadsRunning[3];
3091 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3092 for (int i = 0; i < nAddThreads; i++)
3094 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3095 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");