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 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
54 int fGenerateBitcoins = false;
55 int64 nTransactionFee = 0;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void static AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
169 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
170 BOOST_FOREACH(const CTxIn& txin, tx.vin)
171 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
174 void static EraseOrphanTx(uint256 hash)
176 if (!mapOrphanTransactions.count(hash))
178 const CDataStream* pvMsg = mapOrphanTransactions[hash];
180 CDataStream(*pvMsg) >> tx;
181 BOOST_FOREACH(const CTxIn& txin, tx.vin)
183 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
184 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
186 if ((*mi).second == pvMsg)
187 mapOrphanTransactionsByPrev.erase(mi++);
193 mapOrphanTransactions.erase(hash);
203 //////////////////////////////////////////////////////////////////////////////
205 // CTransaction and CTxIndex
208 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
211 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
213 if (!ReadFromDisk(txindexRet.pos))
215 if (prevout.n >= vout.size())
223 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
226 return ReadFromDisk(txdb, prevout, txindex);
229 bool CTransaction::ReadFromDisk(COutPoint prevout)
233 return ReadFromDisk(txdb, prevout, txindex);
238 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
250 // Load the block this tx is in
252 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
254 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
259 // Update the tx's hashBlock
260 hashBlock = pblock->GetHash();
262 // Locate the transaction
263 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
264 if (pblock->vtx[nIndex] == *(CTransaction*)this)
266 if (nIndex == pblock->vtx.size())
268 vMerkleBranch.clear();
270 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
274 // Fill in merkle branch
275 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
278 // Is the tx in a block that's in the main chain
279 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
280 if (mi == mapBlockIndex.end())
282 CBlockIndex* pindex = (*mi).second;
283 if (!pindex || !pindex->IsInMainChain())
286 return pindexBest->nHeight - pindex->nHeight + 1;
295 bool CTransaction::CheckTransaction() const
297 // Basic checks that don't depend on any context
299 return error("CTransaction::CheckTransaction() : vin empty");
301 return error("CTransaction::CheckTransaction() : vout empty");
303 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
304 return error("CTransaction::CheckTransaction() : size limits failed");
306 // Check for negative or overflow output values
308 BOOST_FOREACH(const CTxOut& txout, vout)
310 if (txout.nValue < 0)
311 return error("CTransaction::CheckTransaction() : txout.nValue negative");
312 if (txout.nValue > MAX_MONEY)
313 return error("CTransaction::CheckTransaction() : txout.nValue too high");
314 nValueOut += txout.nValue;
315 if (!MoneyRange(nValueOut))
316 return error("CTransaction::CheckTransaction() : txout total out of range");
319 // Check for duplicate inputs
320 set<COutPoint> vInOutPoints;
321 BOOST_FOREACH(const CTxIn& txin, vin)
323 if (vInOutPoints.count(txin.prevout))
325 vInOutPoints.insert(txin.prevout);
330 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
331 return error("CTransaction::CheckTransaction() : coinbase script size");
335 BOOST_FOREACH(const CTxIn& txin, vin)
336 if (txin.prevout.IsNull())
337 return error("CTransaction::CheckTransaction() : prevout is null");
343 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
346 *pfMissingInputs = false;
348 if (!CheckTransaction())
349 return error("AcceptToMemoryPool() : CheckTransaction failed");
351 // Coinbase is only valid in a block, not as a loose transaction
353 return error("AcceptToMemoryPool() : coinbase as individual tx");
355 // To help v0.1.5 clients who would see it as a negative number
356 if ((int64)nLockTime > INT_MAX)
357 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
360 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
361 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
362 // attacks disallow transactions with more than one SigOp per 34 bytes.
363 // 34 bytes because a TxOut is:
364 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
365 if (GetSigOpCount() > nSize / 34 || nSize < 100)
366 return error("AcceptToMemoryPool() : nonstandard transaction");
368 // Rather not work on nonstandard transactions (unless -testnet)
369 if (!fTestNet && !IsStandard())
370 return error("AcceptToMemoryPool() : nonstandard transaction type");
372 // Do we already have it?
373 uint256 hash = GetHash();
374 CRITICAL_BLOCK(cs_mapTransactions)
375 if (mapTransactions.count(hash))
378 if (txdb.ContainsTx(hash))
381 // Check for conflicts with in-memory transactions
382 CTransaction* ptxOld = NULL;
383 for (int i = 0; i < vin.size(); i++)
385 COutPoint outpoint = vin[i].prevout;
386 if (mapNextTx.count(outpoint))
388 // Disable replacement feature for now
391 // Allow replacing with a newer version of the same transaction
394 ptxOld = mapNextTx[outpoint].ptx;
395 if (ptxOld->IsFinal())
397 if (!IsNewerThan(*ptxOld))
399 for (int i = 0; i < vin.size(); i++)
401 COutPoint outpoint = vin[i].prevout;
402 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
411 // Check against previous transactions
412 map<uint256, CTxIndex> mapUnused;
414 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
417 *pfMissingInputs = true;
418 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
421 // Don't accept it if it can't get into a block
422 if (nFees < GetMinFee(1000, true, true))
423 return error("AcceptToMemoryPool() : not enough fees");
425 // Continuously rate-limit free transactions
426 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
427 // be annoying or make other's transactions take longer to confirm.
428 if (nFees < MIN_RELAY_TX_FEE)
430 static CCriticalSection cs;
431 static double dFreeCount;
432 static int64 nLastTime;
433 int64 nNow = GetTime();
437 // Use an exponentially decaying ~10-minute window:
438 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
440 // -limitfreerelay unit is thousand-bytes-per-minute
441 // At default rate it would take over a month to fill 1GB
442 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
443 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
445 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
451 // Store transaction in memory
452 CRITICAL_BLOCK(cs_mapTransactions)
456 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
457 ptxOld->RemoveFromMemoryPool();
459 AddToMemoryPoolUnchecked();
462 ///// are we sure this is ok when loading transactions or restoring block txes
463 // If updated, erase old tx from wallet
465 EraseFromWallets(ptxOld->GetHash());
467 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
471 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
474 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
477 bool CTransaction::AddToMemoryPoolUnchecked()
479 // Add to memory pool without checking anything. Don't call this directly,
480 // call AcceptToMemoryPool to properly check the transaction first.
481 CRITICAL_BLOCK(cs_mapTransactions)
483 uint256 hash = GetHash();
484 mapTransactions[hash] = *this;
485 for (int i = 0; i < vin.size(); i++)
486 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
487 nTransactionsUpdated++;
493 bool CTransaction::RemoveFromMemoryPool()
495 // Remove transaction from memory pool
496 CRITICAL_BLOCK(cs_mapTransactions)
498 BOOST_FOREACH(const CTxIn& txin, vin)
499 mapNextTx.erase(txin.prevout);
500 mapTransactions.erase(GetHash());
501 nTransactionsUpdated++;
511 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
513 if (hashBlock == 0 || nIndex == -1)
516 // Find the block it claims to be in
517 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
518 if (mi == mapBlockIndex.end())
520 CBlockIndex* pindex = (*mi).second;
521 if (!pindex || !pindex->IsInMainChain())
524 // Make sure the merkle branch connects to this block
525 if (!fMerkleVerified)
527 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
529 fMerkleVerified = true;
532 nHeightRet = pindex->nHeight;
533 return pindexBest->nHeight - pindex->nHeight + 1;
537 int CMerkleTx::GetBlocksToMaturity() const
541 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
545 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
549 if (!IsInMainChain() && !ClientConnectInputs())
551 return CTransaction::AcceptToMemoryPool(txdb, false);
555 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
559 bool CMerkleTx::AcceptToMemoryPool()
562 return AcceptToMemoryPool(txdb);
567 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
569 CRITICAL_BLOCK(cs_mapTransactions)
571 // Add previous supporting transactions first
572 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
574 if (!tx.IsCoinBase())
576 uint256 hash = tx.GetHash();
577 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
578 tx.AcceptToMemoryPool(txdb, fCheckInputs);
581 return AcceptToMemoryPool(txdb, fCheckInputs);
586 bool CWalletTx::AcceptWalletTransaction()
589 return AcceptWalletTransaction(txdb);
592 int CTxIndex::GetDepthInMainChain() const
596 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
598 // Find the block in the index
599 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
600 if (mi == mapBlockIndex.end())
602 CBlockIndex* pindex = (*mi).second;
603 if (!pindex || !pindex->IsInMainChain())
605 return 1 + nBestHeight - pindex->nHeight;
617 //////////////////////////////////////////////////////////////////////////////
619 // CBlock and CBlockIndex
622 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
624 if (!fReadTransactions)
626 *this = pindex->GetBlockHeader();
629 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
631 if (GetHash() != pindex->GetBlockHash())
632 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
636 uint256 static GetOrphanRoot(const CBlock* pblock)
638 // Work back to the first block in the orphan chain
639 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
640 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
641 return pblock->GetHash();
644 int64 static GetBlockValue(int nHeight, int64 nFees)
646 int64 nSubsidy = 50 * COIN;
648 // Subsidy is cut in half every 4 years
649 nSubsidy >>= (nHeight / 210000);
651 return nSubsidy + nFees;
654 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
656 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
657 const int64 nTargetSpacing = 10 * 60;
658 const int64 nInterval = nTargetTimespan / nTargetSpacing;
661 if (pindexLast == NULL)
662 return bnProofOfWorkLimit.GetCompact();
664 // Only change once per interval
665 if ((pindexLast->nHeight+1) % nInterval != 0)
666 return pindexLast->nBits;
668 // Go back by what we want to be 14 days worth of blocks
669 const CBlockIndex* pindexFirst = pindexLast;
670 for (int i = 0; pindexFirst && i < nInterval-1; i++)
671 pindexFirst = pindexFirst->pprev;
674 // Limit adjustment step
675 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
676 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
677 if (nActualTimespan < nTargetTimespan/4)
678 nActualTimespan = nTargetTimespan/4;
679 if (nActualTimespan > nTargetTimespan*4)
680 nActualTimespan = nTargetTimespan*4;
684 bnNew.SetCompact(pindexLast->nBits);
685 bnNew *= nActualTimespan;
686 bnNew /= nTargetTimespan;
688 if (bnNew > bnProofOfWorkLimit)
689 bnNew = bnProofOfWorkLimit;
692 printf("GetNextWorkRequired RETARGET\n");
693 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
694 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
695 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
697 return bnNew.GetCompact();
700 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
703 bnTarget.SetCompact(nBits);
706 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
707 return error("CheckProofOfWork() : nBits below minimum work");
709 // Check proof of work matches claimed amount
710 if (hash > bnTarget.getuint256())
711 return error("CheckProofOfWork() : hash doesn't match nBits");
716 // Return conservative estimate of total number of blocks, 0 if unknown
717 int GetTotalBlocksEstimate()
725 return nTotalBlocksEstimate;
729 bool IsInitialBlockDownload()
731 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
733 static int64 nLastUpdate;
734 static CBlockIndex* pindexLastBest;
735 if (pindexBest != pindexLastBest)
737 pindexLastBest = pindexBest;
738 nLastUpdate = GetTime();
740 return (GetTime() - nLastUpdate < 10 &&
741 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
744 void static InvalidChainFound(CBlockIndex* pindexNew)
746 if (pindexNew->bnChainWork > bnBestInvalidWork)
748 bnBestInvalidWork = pindexNew->bnChainWork;
749 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
752 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());
753 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
754 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
755 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
768 bool CTransaction::DisconnectInputs(CTxDB& txdb)
770 // Relinquish previous transactions' spent pointers
773 BOOST_FOREACH(const CTxIn& txin, vin)
775 COutPoint prevout = txin.prevout;
777 // Get prev txindex from disk
779 if (!txdb.ReadTxIndex(prevout.hash, txindex))
780 return error("DisconnectInputs() : ReadTxIndex failed");
782 if (prevout.n >= txindex.vSpent.size())
783 return error("DisconnectInputs() : prevout.n out of range");
785 // Mark outpoint as not spent
786 txindex.vSpent[prevout.n].SetNull();
789 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
790 return error("DisconnectInputs() : UpdateTxIndex failed");
794 // Remove transaction from index
795 if (!txdb.EraseTxIndex(*this))
796 return error("DisconnectInputs() : EraseTxPos failed");
802 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
803 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
805 // Take over previous transactions' spent pointers
809 for (int i = 0; i < vin.size(); i++)
811 COutPoint prevout = vin[i].prevout;
816 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
818 // Get txindex from current proposed changes
819 txindex = mapTestPool[prevout.hash];
823 // Read txindex from txdb
824 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
826 if (!fFound && (fBlock || fMiner))
827 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());
831 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
833 // Get prev tx from single transactions in memory
834 CRITICAL_BLOCK(cs_mapTransactions)
836 if (!mapTransactions.count(prevout.hash))
837 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
838 txPrev = mapTransactions[prevout.hash];
841 txindex.vSpent.resize(txPrev.vout.size());
845 // Get prev tx from disk
846 if (!txPrev.ReadFromDisk(txindex.pos))
847 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
850 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
851 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());
853 // If prev is coinbase, check that it's matured
854 if (txPrev.IsCoinBase())
855 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
856 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
857 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
860 if (!VerifySignature(txPrev, *this, i))
861 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
863 // Check for conflicts
864 if (!txindex.vSpent[prevout.n].IsNull())
865 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());
867 // Check for negative or overflow input values
868 nValueIn += txPrev.vout[prevout.n].nValue;
869 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
870 return error("ConnectInputs() : txin values out of range");
872 // Mark outpoints as spent
873 txindex.vSpent[prevout.n] = posThisTx;
876 if (fBlock || fMiner)
878 mapTestPool[prevout.hash] = txindex;
882 if (nValueIn < GetValueOut())
883 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
885 // Tally transaction fees
886 int64 nTxFee = nValueIn - GetValueOut();
888 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
889 if (nTxFee < nMinFee)
892 if (!MoneyRange(nFees))
893 return error("ConnectInputs() : nFees out of range");
898 // Add transaction to changes
899 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
903 // Add transaction to test pool
904 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
911 bool CTransaction::ClientConnectInputs()
916 // Take over previous transactions' spent pointers
917 CRITICAL_BLOCK(cs_mapTransactions)
920 for (int i = 0; i < vin.size(); i++)
922 // Get prev tx from single transactions in memory
923 COutPoint prevout = vin[i].prevout;
924 if (!mapTransactions.count(prevout.hash))
926 CTransaction& txPrev = mapTransactions[prevout.hash];
928 if (prevout.n >= txPrev.vout.size())
932 if (!VerifySignature(txPrev, *this, i))
933 return error("ConnectInputs() : VerifySignature failed");
935 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
936 ///// this has to go away now that posNext is gone
937 // // Check for conflicts
938 // if (!txPrev.vout[prevout.n].posNext.IsNull())
939 // return error("ConnectInputs() : prev tx already used");
941 // // Flag outpoints as used
942 // txPrev.vout[prevout.n].posNext = posThisTx;
944 nValueIn += txPrev.vout[prevout.n].nValue;
946 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
947 return error("ClientConnectInputs() : txin values out of range");
949 if (GetValueOut() > nValueIn)
959 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
961 // Disconnect in reverse order
962 for (int i = vtx.size()-1; i >= 0; i--)
963 if (!vtx[i].DisconnectInputs(txdb))
966 // Update block index on disk without changing it in memory.
967 // The memory index structure will be changed after the db commits.
970 CDiskBlockIndex blockindexPrev(pindex->pprev);
971 blockindexPrev.hashNext = 0;
972 if (!txdb.WriteBlockIndex(blockindexPrev))
973 return error("DisconnectBlock() : WriteBlockIndex failed");
979 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
981 // Check it again in case a previous version let a bad block in
985 //// issue here: it doesn't know the version
986 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
988 map<uint256, CTxIndex> mapQueuedChanges;
990 BOOST_FOREACH(CTransaction& tx, vtx)
992 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
993 nTxPos += ::GetSerializeSize(tx, SER_DISK);
995 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
998 // Write queued txindex changes
999 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1001 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1002 return error("ConnectBlock() : UpdateTxIndex failed");
1005 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1008 // Update block index on disk without changing it in memory.
1009 // The memory index structure will be changed after the db commits.
1012 CDiskBlockIndex blockindexPrev(pindex->pprev);
1013 blockindexPrev.hashNext = pindex->GetBlockHash();
1014 if (!txdb.WriteBlockIndex(blockindexPrev))
1015 return error("ConnectBlock() : WriteBlockIndex failed");
1018 // Watch for transactions paying to me
1019 BOOST_FOREACH(CTransaction& tx, vtx)
1020 SyncWithWallets(tx, this, true);
1025 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1027 printf("REORGANIZE\n");
1030 CBlockIndex* pfork = pindexBest;
1031 CBlockIndex* plonger = pindexNew;
1032 while (pfork != plonger)
1034 while (plonger->nHeight > pfork->nHeight)
1035 if (!(plonger = plonger->pprev))
1036 return error("Reorganize() : plonger->pprev is null");
1037 if (pfork == plonger)
1039 if (!(pfork = pfork->pprev))
1040 return error("Reorganize() : pfork->pprev is null");
1043 // List of what to disconnect
1044 vector<CBlockIndex*> vDisconnect;
1045 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1046 vDisconnect.push_back(pindex);
1048 // List of what to connect
1049 vector<CBlockIndex*> vConnect;
1050 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1051 vConnect.push_back(pindex);
1052 reverse(vConnect.begin(), vConnect.end());
1054 // Disconnect shorter branch
1055 vector<CTransaction> vResurrect;
1056 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1059 if (!block.ReadFromDisk(pindex))
1060 return error("Reorganize() : ReadFromDisk for disconnect failed");
1061 if (!block.DisconnectBlock(txdb, pindex))
1062 return error("Reorganize() : DisconnectBlock failed");
1064 // Queue memory transactions to resurrect
1065 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1066 if (!tx.IsCoinBase())
1067 vResurrect.push_back(tx);
1070 // Connect longer branch
1071 vector<CTransaction> vDelete;
1072 for (int i = 0; i < vConnect.size(); i++)
1074 CBlockIndex* pindex = vConnect[i];
1076 if (!block.ReadFromDisk(pindex))
1077 return error("Reorganize() : ReadFromDisk for connect failed");
1078 if (!block.ConnectBlock(txdb, pindex))
1082 return error("Reorganize() : ConnectBlock failed");
1085 // Queue memory transactions to delete
1086 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1087 vDelete.push_back(tx);
1089 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1090 return error("Reorganize() : WriteHashBestChain failed");
1092 // Make sure it's successfully written to disk before changing memory structure
1093 if (!txdb.TxnCommit())
1094 return error("Reorganize() : TxnCommit failed");
1096 // Disconnect shorter branch
1097 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1099 pindex->pprev->pnext = NULL;
1101 // Connect longer branch
1102 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1104 pindex->pprev->pnext = pindex;
1106 // Resurrect memory transactions that were in the disconnected branch
1107 BOOST_FOREACH(CTransaction& tx, vResurrect)
1108 tx.AcceptToMemoryPool(txdb, false);
1110 // Delete redundant memory transactions that are in the connected branch
1111 BOOST_FOREACH(CTransaction& tx, vDelete)
1112 tx.RemoveFromMemoryPool();
1118 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1120 uint256 hash = GetHash();
1123 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1125 txdb.WriteHashBestChain(hash);
1126 if (!txdb.TxnCommit())
1127 return error("SetBestChain() : TxnCommit failed");
1128 pindexGenesisBlock = pindexNew;
1130 else if (hashPrevBlock == hashBestChain)
1132 // Adding to current best branch
1133 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1136 InvalidChainFound(pindexNew);
1137 return error("SetBestChain() : ConnectBlock failed");
1139 if (!txdb.TxnCommit())
1140 return error("SetBestChain() : TxnCommit failed");
1142 // Add to current best branch
1143 pindexNew->pprev->pnext = pindexNew;
1145 // Delete redundant memory transactions
1146 BOOST_FOREACH(CTransaction& tx, vtx)
1147 tx.RemoveFromMemoryPool();
1152 if (!Reorganize(txdb, pindexNew))
1155 InvalidChainFound(pindexNew);
1156 return error("SetBestChain() : Reorganize failed");
1160 // Update best block in wallet (so we can detect restored wallets)
1161 if (!IsInitialBlockDownload())
1163 const CBlockLocator locator(pindexNew);
1164 ::SetBestChain(locator);
1168 hashBestChain = hash;
1169 pindexBest = pindexNew;
1170 nBestHeight = pindexBest->nHeight;
1171 bnBestChainWork = pindexNew->bnChainWork;
1172 nTimeBestReceived = GetTime();
1173 nTransactionsUpdated++;
1174 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1180 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1182 // Check for duplicate
1183 uint256 hash = GetHash();
1184 if (mapBlockIndex.count(hash))
1185 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1187 // Construct new block index object
1188 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1190 return error("AddToBlockIndex() : new CBlockIndex failed");
1191 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1192 pindexNew->phashBlock = &((*mi).first);
1193 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1194 if (miPrev != mapBlockIndex.end())
1196 pindexNew->pprev = (*miPrev).second;
1197 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1199 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1203 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1204 if (!txdb.TxnCommit())
1208 if (pindexNew->bnChainWork > bnBestChainWork)
1209 if (!SetBestChain(txdb, pindexNew))
1214 if (pindexNew == pindexBest)
1216 // Notify UI to display prev block's coinbase if it was ours
1217 static uint256 hashPrevBestCoinBase;
1218 UpdatedTransaction(hashPrevBestCoinBase);
1219 hashPrevBestCoinBase = vtx[0].GetHash();
1229 bool CBlock::CheckBlock() const
1231 // These are checks that are independent of context
1232 // that can be verified before saving an orphan block.
1235 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1236 return error("CheckBlock() : size limits failed");
1238 // Check proof of work matches claimed amount
1239 if (!CheckProofOfWork(GetHash(), nBits))
1240 return error("CheckBlock() : proof of work failed");
1243 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1244 return error("CheckBlock() : block timestamp too far in the future");
1246 // First transaction must be coinbase, the rest must not be
1247 if (vtx.empty() || !vtx[0].IsCoinBase())
1248 return error("CheckBlock() : first tx is not coinbase");
1249 for (int i = 1; i < vtx.size(); i++)
1250 if (vtx[i].IsCoinBase())
1251 return error("CheckBlock() : more than one coinbase");
1253 // Check transactions
1254 BOOST_FOREACH(const CTransaction& tx, vtx)
1255 if (!tx.CheckTransaction())
1256 return error("CheckBlock() : CheckTransaction failed");
1258 // Check that it's not full of nonstandard transactions
1259 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1260 return error("CheckBlock() : too many nonstandard transactions");
1263 if (hashMerkleRoot != BuildMerkleTree())
1264 return error("CheckBlock() : hashMerkleRoot mismatch");
1269 bool CBlock::AcceptBlock()
1271 // Check for duplicate
1272 uint256 hash = GetHash();
1273 if (mapBlockIndex.count(hash))
1274 return error("AcceptBlock() : block already in mapBlockIndex");
1276 // Get prev block index
1277 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1278 if (mi == mapBlockIndex.end())
1279 return error("AcceptBlock() : prev block not found");
1280 CBlockIndex* pindexPrev = (*mi).second;
1281 int nHeight = pindexPrev->nHeight+1;
1283 // Check proof of work
1284 if (nBits != GetNextWorkRequired(pindexPrev))
1285 return error("AcceptBlock() : incorrect proof of work");
1287 // Check timestamp against prev
1288 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1289 return error("AcceptBlock() : block's timestamp is too early");
1291 // Check that all transactions are finalized
1292 BOOST_FOREACH(const CTransaction& tx, vtx)
1293 if (!tx.IsFinal(nHeight, GetBlockTime()))
1294 return error("AcceptBlock() : contains a non-final transaction");
1296 // Check that the block chain matches the known block chain up to a checkpoint
1298 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1299 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1300 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1301 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1302 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1303 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1304 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1305 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")) ||
1306 (nHeight == 140700 && hash != uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd")))
1307 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1309 // Write block to history file
1310 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1311 return error("AcceptBlock() : out of disk space");
1312 unsigned int nFile = -1;
1313 unsigned int nBlockPos = 0;
1314 if (!WriteToDisk(nFile, nBlockPos))
1315 return error("AcceptBlock() : WriteToDisk failed");
1316 if (!AddToBlockIndex(nFile, nBlockPos))
1317 return error("AcceptBlock() : AddToBlockIndex failed");
1319 // Relay inventory, but don't relay old inventory during initial block download
1320 if (hashBestChain == hash)
1321 CRITICAL_BLOCK(cs_vNodes)
1322 BOOST_FOREACH(CNode* pnode, vNodes)
1323 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1324 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1329 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1331 // Check for duplicate
1332 uint256 hash = pblock->GetHash();
1333 if (mapBlockIndex.count(hash))
1334 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1335 if (mapOrphanBlocks.count(hash))
1336 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1338 // Preliminary checks
1339 if (!pblock->CheckBlock())
1340 return error("ProcessBlock() : CheckBlock FAILED");
1342 // If don't already have its previous block, shunt it off to holding area until we get it
1343 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1345 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1346 CBlock* pblock2 = new CBlock(*pblock);
1347 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1348 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1350 // Ask this guy to fill in what we're missing
1352 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1357 if (!pblock->AcceptBlock())
1358 return error("ProcessBlock() : AcceptBlock FAILED");
1360 // Recursively process any orphan blocks that depended on this one
1361 vector<uint256> vWorkQueue;
1362 vWorkQueue.push_back(hash);
1363 for (int i = 0; i < vWorkQueue.size(); i++)
1365 uint256 hashPrev = vWorkQueue[i];
1366 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1367 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1370 CBlock* pblockOrphan = (*mi).second;
1371 if (pblockOrphan->AcceptBlock())
1372 vWorkQueue.push_back(pblockOrphan->GetHash());
1373 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1374 delete pblockOrphan;
1376 mapOrphanBlocksByPrev.erase(hashPrev);
1379 printf("ProcessBlock: ACCEPTED\n");
1390 bool CheckDiskSpace(uint64 nAdditionalBytes)
1392 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1394 // Check for 15MB because database could create another 10MB log file at any time
1395 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1398 string strMessage = _("Warning: Disk space is low ");
1399 strMiscWarning = strMessage;
1400 printf("*** %s\n", strMessage.c_str());
1401 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1402 CreateThread(Shutdown, NULL);
1408 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1412 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1415 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1417 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1426 static unsigned int nCurrentBlockFile = 1;
1428 FILE* AppendBlockFile(unsigned int& nFileRet)
1433 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1436 if (fseek(file, 0, SEEK_END) != 0)
1438 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1439 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1441 nFileRet = nCurrentBlockFile;
1445 nCurrentBlockFile++;
1449 bool LoadBlockIndex(bool fAllowNew)
1453 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1454 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1455 pchMessageStart[0] = 0xfa;
1456 pchMessageStart[1] = 0xbf;
1457 pchMessageStart[2] = 0xb5;
1458 pchMessageStart[3] = 0xda;
1465 if (!txdb.LoadBlockIndex())
1470 // Init with genesis block
1472 if (mapBlockIndex.empty())
1478 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1479 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1480 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1481 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1482 // vMerkleTree: 4a5e1e
1485 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1487 txNew.vin.resize(1);
1488 txNew.vout.resize(1);
1489 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1490 txNew.vout[0].nValue = 50 * COIN;
1491 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1493 block.vtx.push_back(txNew);
1494 block.hashPrevBlock = 0;
1495 block.hashMerkleRoot = block.BuildMerkleTree();
1497 block.nTime = 1231006505;
1498 block.nBits = 0x1d00ffff;
1499 block.nNonce = 2083236893;
1503 block.nTime = 1296688602;
1504 block.nBits = 0x1d07fff8;
1505 block.nNonce = 384568319;
1509 printf("%s\n", block.GetHash().ToString().c_str());
1510 printf("%s\n", hashGenesisBlock.ToString().c_str());
1511 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1512 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1514 assert(block.GetHash() == hashGenesisBlock);
1516 // Start new block file
1518 unsigned int nBlockPos;
1519 if (!block.WriteToDisk(nFile, nBlockPos))
1520 return error("LoadBlockIndex() : writing genesis block to disk failed");
1521 if (!block.AddToBlockIndex(nFile, nBlockPos))
1522 return error("LoadBlockIndex() : genesis block not accepted");
1530 void PrintBlockTree()
1532 // precompute tree structure
1533 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1534 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1536 CBlockIndex* pindex = (*mi).second;
1537 mapNext[pindex->pprev].push_back(pindex);
1539 //while (rand() % 3 == 0)
1540 // mapNext[pindex->pprev].push_back(pindex);
1543 vector<pair<int, CBlockIndex*> > vStack;
1544 vStack.push_back(make_pair(0, pindexGenesisBlock));
1547 while (!vStack.empty())
1549 int nCol = vStack.back().first;
1550 CBlockIndex* pindex = vStack.back().second;
1553 // print split or gap
1554 if (nCol > nPrevCol)
1556 for (int i = 0; i < nCol-1; i++)
1560 else if (nCol < nPrevCol)
1562 for (int i = 0; i < nCol; i++)
1569 for (int i = 0; i < nCol; i++)
1574 block.ReadFromDisk(pindex);
1575 printf("%d (%u,%u) %s %s tx %d",
1579 block.GetHash().ToString().substr(0,20).c_str(),
1580 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1583 PrintWallets(block);
1585 // put the main timechain first
1586 vector<CBlockIndex*>& vNext = mapNext[pindex];
1587 for (int i = 0; i < vNext.size(); i++)
1589 if (vNext[i]->pnext)
1591 swap(vNext[0], vNext[i]);
1597 for (int i = 0; i < vNext.size(); i++)
1598 vStack.push_back(make_pair(nCol+i, vNext[i]));
1611 //////////////////////////////////////////////////////////////////////////////
1616 map<uint256, CAlert> mapAlerts;
1617 CCriticalSection cs_mapAlerts;
1619 string GetWarnings(string strFor)
1622 string strStatusBar;
1624 if (GetBoolArg("-testsafemode"))
1627 // Misc warnings like out of disk space and clock is wrong
1628 if (strMiscWarning != "")
1631 strStatusBar = strMiscWarning;
1634 // Longer invalid proof-of-work chain
1635 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1638 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1642 CRITICAL_BLOCK(cs_mapAlerts)
1644 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1646 const CAlert& alert = item.second;
1647 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1649 nPriority = alert.nPriority;
1650 strStatusBar = alert.strStatusBar;
1655 if (strFor == "statusbar")
1656 return strStatusBar;
1657 else if (strFor == "rpc")
1659 assert(!"GetWarnings() : invalid parameter");
1663 bool CAlert::ProcessAlert()
1665 if (!CheckSignature())
1670 CRITICAL_BLOCK(cs_mapAlerts)
1672 // Cancel previous alerts
1673 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1675 const CAlert& alert = (*mi).second;
1678 printf("cancelling alert %d\n", alert.nID);
1679 mapAlerts.erase(mi++);
1681 else if (!alert.IsInEffect())
1683 printf("expiring alert %d\n", alert.nID);
1684 mapAlerts.erase(mi++);
1690 // Check if this alert has been cancelled
1691 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1693 const CAlert& alert = item.second;
1694 if (alert.Cancels(*this))
1696 printf("alert already cancelled by %d\n", alert.nID);
1702 mapAlerts.insert(make_pair(GetHash(), *this));
1705 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1717 //////////////////////////////////////////////////////////////////////////////
1723 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1727 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1728 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1730 // Don't know what it is, just say we already got one
1737 // The message start string is designed to be unlikely to occur in normal data.
1738 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1739 // a large 4-byte int at any alignment.
1740 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1743 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1745 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1746 RandAddSeedPerfmon();
1748 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1749 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1751 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1753 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1761 if (strCommand == "version")
1763 // Each connection can only send one version message
1764 if (pfrom->nVersion != 0)
1771 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1772 if (pfrom->nVersion == 10300)
1773 pfrom->nVersion = 300;
1774 if (pfrom->nVersion >= 106 && !vRecv.empty())
1775 vRecv >> addrFrom >> nNonce;
1776 if (pfrom->nVersion >= 106 && !vRecv.empty())
1777 vRecv >> pfrom->strSubVer;
1778 if (pfrom->nVersion >= 209 && !vRecv.empty())
1779 vRecv >> pfrom->nStartingHeight;
1781 if (pfrom->nVersion == 0)
1784 // Disconnect if we connected to ourself
1785 if (nNonce == nLocalHostNonce && nNonce > 1)
1787 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1788 pfrom->fDisconnect = true;
1792 // Be shy and don't send version until we hear
1793 if (pfrom->fInbound)
1794 pfrom->PushVersion();
1796 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1798 AddTimeData(pfrom->addr.ip, nTime);
1801 if (pfrom->nVersion >= 209)
1802 pfrom->PushMessage("verack");
1803 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1804 if (pfrom->nVersion < 209)
1805 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1807 if (!pfrom->fInbound)
1809 // Advertise our address
1810 if (addrLocalHost.IsRoutable() && !fUseProxy)
1812 CAddress addr(addrLocalHost);
1813 addr.nTime = GetAdjustedTime();
1814 pfrom->PushAddress(addr);
1817 // Get recent addresses
1818 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1820 pfrom->PushMessage("getaddr");
1821 pfrom->fGetAddr = true;
1825 // Ask the first connected node for block updates
1826 static int nAskedForBlocks;
1827 if (!pfrom->fClient &&
1828 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1829 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1832 pfrom->PushGetBlocks(pindexBest, uint256(0));
1836 CRITICAL_BLOCK(cs_mapAlerts)
1837 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1838 item.second.RelayTo(pfrom);
1840 pfrom->fSuccessfullyConnected = true;
1842 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1846 else if (pfrom->nVersion == 0)
1848 // Must have a version message before anything else
1853 else if (strCommand == "verack")
1855 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1859 else if (strCommand == "addr")
1861 vector<CAddress> vAddr;
1864 // Don't want addr from older versions unless seeding
1865 if (pfrom->nVersion < 209)
1867 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1869 if (vAddr.size() > 1000)
1870 return error("message addr size() = %d", vAddr.size());
1872 // Store the new addresses
1875 int64 nNow = GetAdjustedTime();
1876 int64 nSince = nNow - 10 * 60;
1877 BOOST_FOREACH(CAddress& addr, vAddr)
1881 // ignore IPv6 for now, since it isn't implemented anyway
1884 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1885 addr.nTime = nNow - 5 * 24 * 60 * 60;
1886 AddAddress(addr, 2 * 60 * 60, &addrDB);
1887 pfrom->AddAddressKnown(addr);
1888 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1890 // Relay to a limited number of other nodes
1891 CRITICAL_BLOCK(cs_vNodes)
1893 // Use deterministic randomness to send to the same nodes for 24 hours
1894 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1895 static uint256 hashSalt;
1897 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1898 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1899 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1900 multimap<uint256, CNode*> mapMix;
1901 BOOST_FOREACH(CNode* pnode, vNodes)
1903 if (pnode->nVersion < 31402)
1905 unsigned int nPointer;
1906 memcpy(&nPointer, &pnode, sizeof(nPointer));
1907 uint256 hashKey = hashRand ^ nPointer;
1908 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1909 mapMix.insert(make_pair(hashKey, pnode));
1911 int nRelayNodes = 2;
1912 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1913 ((*mi).second)->PushAddress(addr);
1917 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1918 if (vAddr.size() < 1000)
1919 pfrom->fGetAddr = false;
1923 else if (strCommand == "inv")
1927 if (vInv.size() > 50000)
1928 return error("message inv size() = %d", vInv.size());
1931 BOOST_FOREACH(const CInv& inv, vInv)
1935 pfrom->AddInventoryKnown(inv);
1937 bool fAlreadyHave = AlreadyHave(txdb, inv);
1939 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1943 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1944 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1946 // Track requests for our stuff
1947 Inventory(inv.hash);
1952 else if (strCommand == "getdata")
1956 if (vInv.size() > 50000)
1957 return error("message getdata size() = %d", vInv.size());
1959 BOOST_FOREACH(const CInv& inv, vInv)
1963 printf("received getdata for: %s\n", inv.ToString().c_str());
1965 if (inv.type == MSG_BLOCK)
1967 // Send block from disk
1968 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1969 if (mi != mapBlockIndex.end())
1972 block.ReadFromDisk((*mi).second);
1973 pfrom->PushMessage("block", block);
1975 // Trigger them to send a getblocks request for the next batch of inventory
1976 if (inv.hash == pfrom->hashContinue)
1978 // Bypass PushInventory, this must send even if redundant,
1979 // and we want it right after the last block so they don't
1980 // wait for other stuff first.
1982 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
1983 pfrom->PushMessage("inv", vInv);
1984 pfrom->hashContinue = 0;
1988 else if (inv.IsKnownType())
1990 // Send stream from relay memory
1991 CRITICAL_BLOCK(cs_mapRelay)
1993 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
1994 if (mi != mapRelay.end())
1995 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
1999 // Track requests for our stuff
2000 Inventory(inv.hash);
2005 else if (strCommand == "getblocks")
2007 CBlockLocator locator;
2009 vRecv >> locator >> hashStop;
2011 // Find the last block the caller has in the main chain
2012 CBlockIndex* pindex = locator.GetBlockIndex();
2014 // Send the rest of the chain
2016 pindex = pindex->pnext;
2017 int nLimit = 500 + locator.GetDistanceBack();
2018 unsigned int nBytes = 0;
2019 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2020 for (; pindex; pindex = pindex->pnext)
2022 if (pindex->GetBlockHash() == hashStop)
2024 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2027 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2029 block.ReadFromDisk(pindex, true);
2030 nBytes += block.GetSerializeSize(SER_NETWORK);
2031 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2033 // When this block is requested, we'll send an inv that'll make them
2034 // getblocks the next batch of inventory.
2035 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2036 pfrom->hashContinue = pindex->GetBlockHash();
2043 else if (strCommand == "getheaders")
2045 CBlockLocator locator;
2047 vRecv >> locator >> hashStop;
2049 CBlockIndex* pindex = NULL;
2050 if (locator.IsNull())
2052 // If locator is null, return the hashStop block
2053 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2054 if (mi == mapBlockIndex.end())
2056 pindex = (*mi).second;
2060 // Find the last block the caller has in the main chain
2061 pindex = locator.GetBlockIndex();
2063 pindex = pindex->pnext;
2066 vector<CBlock> vHeaders;
2067 int nLimit = 2000 + locator.GetDistanceBack();
2068 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2069 for (; pindex; pindex = pindex->pnext)
2071 vHeaders.push_back(pindex->GetBlockHeader());
2072 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2075 pfrom->PushMessage("headers", vHeaders);
2079 else if (strCommand == "tx")
2081 vector<uint256> vWorkQueue;
2082 CDataStream vMsg(vRecv);
2086 CInv inv(MSG_TX, tx.GetHash());
2087 pfrom->AddInventoryKnown(inv);
2089 bool fMissingInputs = false;
2090 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2092 SyncWithWallets(tx, NULL, true);
2093 RelayMessage(inv, vMsg);
2094 mapAlreadyAskedFor.erase(inv);
2095 vWorkQueue.push_back(inv.hash);
2097 // Recursively process any orphan transactions that depended on this one
2098 for (int i = 0; i < vWorkQueue.size(); i++)
2100 uint256 hashPrev = vWorkQueue[i];
2101 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2102 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2105 const CDataStream& vMsg = *((*mi).second);
2107 CDataStream(vMsg) >> tx;
2108 CInv inv(MSG_TX, tx.GetHash());
2110 if (tx.AcceptToMemoryPool(true))
2112 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2113 SyncWithWallets(tx, NULL, true);
2114 RelayMessage(inv, vMsg);
2115 mapAlreadyAskedFor.erase(inv);
2116 vWorkQueue.push_back(inv.hash);
2121 BOOST_FOREACH(uint256 hash, vWorkQueue)
2122 EraseOrphanTx(hash);
2124 else if (fMissingInputs)
2126 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2132 else if (strCommand == "block")
2137 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2140 CInv inv(MSG_BLOCK, block.GetHash());
2141 pfrom->AddInventoryKnown(inv);
2143 if (ProcessBlock(pfrom, &block))
2144 mapAlreadyAskedFor.erase(inv);
2148 else if (strCommand == "getaddr")
2150 // Nodes rebroadcast an addr every 24 hours
2151 pfrom->vAddrToSend.clear();
2152 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2153 CRITICAL_BLOCK(cs_mapAddresses)
2155 unsigned int nCount = 0;
2156 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2158 const CAddress& addr = item.second;
2159 if (addr.nTime > nSince)
2162 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2164 const CAddress& addr = item.second;
2165 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2166 pfrom->PushAddress(addr);
2172 else if (strCommand == "checkorder")
2177 if (!GetBoolArg("-allowreceivebyip"))
2179 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2186 /// we have a chance to check the order here
2188 // Keep giving the same key to the same ip until they use it
2189 if (!mapReuseKey.count(pfrom->addr.ip))
2190 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2192 // Send back approval of order and pubkey to use
2193 CScript scriptPubKey;
2194 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2195 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2199 else if (strCommand == "reply")
2204 CRequestTracker tracker;
2205 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2207 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2208 if (mi != pfrom->mapRequests.end())
2210 tracker = (*mi).second;
2211 pfrom->mapRequests.erase(mi);
2214 if (!tracker.IsNull())
2215 tracker.fn(tracker.param1, vRecv);
2219 else if (strCommand == "ping")
2224 else if (strCommand == "alert")
2229 if (alert.ProcessAlert())
2232 pfrom->setKnown.insert(alert.GetHash());
2233 CRITICAL_BLOCK(cs_vNodes)
2234 BOOST_FOREACH(CNode* pnode, vNodes)
2235 alert.RelayTo(pnode);
2242 // Ignore unknown commands for extensibility
2246 // Update the last seen time for this node's address
2247 if (pfrom->fNetworkNode)
2248 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2249 AddressCurrentlyConnected(pfrom->addr);
2255 bool ProcessMessages(CNode* pfrom)
2257 CDataStream& vRecv = pfrom->vRecv;
2261 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2265 // (4) message start
2274 // Scan for message start
2275 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2276 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2277 if (vRecv.end() - pstart < nHeaderSize)
2279 if (vRecv.size() > nHeaderSize)
2281 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2282 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2286 if (pstart - vRecv.begin() > 0)
2287 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2288 vRecv.erase(vRecv.begin(), pstart);
2291 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2296 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2299 string strCommand = hdr.GetCommand();
2302 unsigned int nMessageSize = hdr.nMessageSize;
2303 if (nMessageSize > MAX_SIZE)
2305 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2308 if (nMessageSize > vRecv.size())
2310 // Rewind and wait for rest of message
2311 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2316 if (vRecv.GetVersion() >= 209)
2318 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2319 unsigned int nChecksum = 0;
2320 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2321 if (nChecksum != hdr.nChecksum)
2323 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2324 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2329 // Copy message to its own buffer
2330 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2331 vRecv.ignore(nMessageSize);
2337 CRITICAL_BLOCK(cs_main)
2338 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2342 catch (std::ios_base::failure& e)
2344 if (strstr(e.what(), "end of data"))
2346 // Allow exceptions from underlength message on vRecv
2347 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());
2349 else if (strstr(e.what(), "size too large"))
2351 // Allow exceptions from overlong size
2352 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2356 PrintExceptionContinue(&e, "ProcessMessage()");
2359 catch (std::exception& e) {
2360 PrintExceptionContinue(&e, "ProcessMessage()");
2362 PrintExceptionContinue(NULL, "ProcessMessage()");
2366 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2374 bool SendMessages(CNode* pto, bool fSendTrickle)
2376 CRITICAL_BLOCK(cs_main)
2378 // Don't send anything until we get their version message
2379 if (pto->nVersion == 0)
2383 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2384 pto->PushMessage("ping");
2386 // Resend wallet transactions that haven't gotten in a block yet
2387 ResendWalletTransactions();
2389 // Address refresh broadcast
2390 static int64 nLastRebroadcast;
2391 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2393 nLastRebroadcast = GetTime();
2394 CRITICAL_BLOCK(cs_vNodes)
2396 BOOST_FOREACH(CNode* pnode, vNodes)
2398 // Periodically clear setAddrKnown to allow refresh broadcasts
2399 pnode->setAddrKnown.clear();
2401 // Rebroadcast our address
2402 if (addrLocalHost.IsRoutable() && !fUseProxy)
2404 CAddress addr(addrLocalHost);
2405 addr.nTime = GetAdjustedTime();
2406 pnode->PushAddress(addr);
2412 // Clear out old addresses periodically so it's not too much work at once
2413 static int64 nLastClear;
2414 if (nLastClear == 0)
2415 nLastClear = GetTime();
2416 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2418 nLastClear = GetTime();
2419 CRITICAL_BLOCK(cs_mapAddresses)
2422 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2423 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2424 mi != mapAddresses.end();)
2426 const CAddress& addr = (*mi).second;
2427 if (addr.nTime < nSince)
2429 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2431 addrdb.EraseAddress(addr);
2432 mapAddresses.erase(mi++);
2446 vector<CAddress> vAddr;
2447 vAddr.reserve(pto->vAddrToSend.size());
2448 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2450 // returns true if wasn't already contained in the set
2451 if (pto->setAddrKnown.insert(addr).second)
2453 vAddr.push_back(addr);
2454 // receiver rejects addr messages larger than 1000
2455 if (vAddr.size() >= 1000)
2457 pto->PushMessage("addr", vAddr);
2462 pto->vAddrToSend.clear();
2464 pto->PushMessage("addr", vAddr);
2469 // Message: inventory
2472 vector<CInv> vInvWait;
2473 CRITICAL_BLOCK(pto->cs_inventory)
2475 vInv.reserve(pto->vInventoryToSend.size());
2476 vInvWait.reserve(pto->vInventoryToSend.size());
2477 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2479 if (pto->setInventoryKnown.count(inv))
2482 // trickle out tx inv to protect privacy
2483 if (inv.type == MSG_TX && !fSendTrickle)
2485 // 1/4 of tx invs blast to all immediately
2486 static uint256 hashSalt;
2488 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2489 uint256 hashRand = inv.hash ^ hashSalt;
2490 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2491 bool fTrickleWait = ((hashRand & 3) != 0);
2493 // always trickle our own transactions
2497 if (GetTransaction(inv.hash, wtx))
2499 fTrickleWait = true;
2504 vInvWait.push_back(inv);
2509 // returns true if wasn't already contained in the set
2510 if (pto->setInventoryKnown.insert(inv).second)
2512 vInv.push_back(inv);
2513 if (vInv.size() >= 1000)
2515 pto->PushMessage("inv", vInv);
2520 pto->vInventoryToSend = vInvWait;
2523 pto->PushMessage("inv", vInv);
2529 vector<CInv> vGetData;
2530 int64 nNow = GetTime() * 1000000;
2532 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2534 const CInv& inv = (*pto->mapAskFor.begin()).second;
2535 if (!AlreadyHave(txdb, inv))
2537 printf("sending getdata: %s\n", inv.ToString().c_str());
2538 vGetData.push_back(inv);
2539 if (vGetData.size() >= 1000)
2541 pto->PushMessage("getdata", vGetData);
2545 mapAlreadyAskedFor[inv] = nNow;
2546 pto->mapAskFor.erase(pto->mapAskFor.begin());
2548 if (!vGetData.empty())
2549 pto->PushMessage("getdata", vGetData);
2568 //////////////////////////////////////////////////////////////////////////////
2573 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2575 unsigned char* pdata = (unsigned char*)pbuffer;
2576 unsigned int blocks = 1 + ((len + 8) / 64);
2577 unsigned char* pend = pdata + 64 * blocks;
2578 memset(pdata + len, 0, 64 * blocks - len);
2580 unsigned int bits = len * 8;
2581 pend[-1] = (bits >> 0) & 0xff;
2582 pend[-2] = (bits >> 8) & 0xff;
2583 pend[-3] = (bits >> 16) & 0xff;
2584 pend[-4] = (bits >> 24) & 0xff;
2588 using CryptoPP::ByteReverse;
2590 static const unsigned int pSHA256InitState[8] =
2591 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2593 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2595 memcpy(pstate, pinit, 32);
2596 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2600 // ScanHash scans nonces looking for a hash with at least some zero bits.
2601 // It operates on big endian data. Caller does the byte reversing.
2602 // All input buffers are 16-byte aligned. nNonce is usually preserved
2603 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2604 // the block is rebuilt and nNonce starts over at zero.
2606 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2608 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2612 // Hash pdata using pmidstate as the starting state into
2613 // preformatted buffer phash1, then hash phash1 into phash
2615 SHA256Transform(phash1, pdata, pmidstate);
2616 SHA256Transform(phash, phash1, pSHA256InitState);
2618 // Return the nonce if the hash has at least some zero bits,
2619 // caller will check if it has enough to reach the target
2620 if (((unsigned short*)phash)[14] == 0)
2623 // If nothing found after trying for a while, return -1
2624 if ((nNonce & 0xffff) == 0)
2626 nHashesDone = 0xffff+1;
2632 // Some explaining would be appreciated
2637 set<uint256> setDependsOn;
2640 COrphan(CTransaction* ptxIn)
2648 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2649 BOOST_FOREACH(uint256 hash, setDependsOn)
2650 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2655 CBlock* CreateNewBlock(CReserveKey& reservekey)
2657 CBlockIndex* pindexPrev = pindexBest;
2660 auto_ptr<CBlock> pblock(new CBlock());
2664 // Create coinbase tx
2666 txNew.vin.resize(1);
2667 txNew.vin[0].prevout.SetNull();
2668 txNew.vout.resize(1);
2669 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2671 // Add our coinbase tx as first transaction
2672 pblock->vtx.push_back(txNew);
2674 // Collect memory pool transactions into the block
2676 CRITICAL_BLOCK(cs_main)
2677 CRITICAL_BLOCK(cs_mapTransactions)
2681 // Priority order to process transactions
2682 list<COrphan> vOrphan; // list memory doesn't move
2683 map<uint256, vector<COrphan*> > mapDependers;
2684 multimap<double, CTransaction*> mapPriority;
2685 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2687 CTransaction& tx = (*mi).second;
2688 if (tx.IsCoinBase() || !tx.IsFinal())
2691 COrphan* porphan = NULL;
2692 double dPriority = 0;
2693 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2695 // Read prev transaction
2696 CTransaction txPrev;
2698 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2700 // Has to wait for dependencies
2703 // Use list for automatic deletion
2704 vOrphan.push_back(COrphan(&tx));
2705 porphan = &vOrphan.back();
2707 mapDependers[txin.prevout.hash].push_back(porphan);
2708 porphan->setDependsOn.insert(txin.prevout.hash);
2711 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2713 // Read block header
2714 int nConf = txindex.GetDepthInMainChain();
2716 dPriority += (double)nValueIn * nConf;
2718 if (fDebug && GetBoolArg("-printpriority"))
2719 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2722 // Priority is sum(valuein * age) / txsize
2723 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2726 porphan->dPriority = dPriority;
2728 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2730 if (fDebug && GetBoolArg("-printpriority"))
2732 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2739 // Collect transactions into block
2740 map<uint256, CTxIndex> mapTestPool;
2741 uint64 nBlockSize = 1000;
2742 int nBlockSigOps = 100;
2743 while (!mapPriority.empty())
2745 // Take highest priority transaction off priority queue
2746 double dPriority = -(*mapPriority.begin()).first;
2747 CTransaction& tx = *(*mapPriority.begin()).second;
2748 mapPriority.erase(mapPriority.begin());
2751 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2752 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2754 int nTxSigOps = tx.GetSigOpCount();
2755 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2758 // Transaction fee required depends on block size
2759 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2760 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2762 // Connecting shouldn't fail due to dependency on other memory pool transactions
2763 // because we're already processing them in order of dependency
2764 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2765 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2767 swap(mapTestPool, mapTestPoolTmp);
2770 pblock->vtx.push_back(tx);
2771 nBlockSize += nTxSize;
2772 nBlockSigOps += nTxSigOps;
2774 // Add transactions that depend on this one to the priority queue
2775 uint256 hash = tx.GetHash();
2776 if (mapDependers.count(hash))
2778 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2780 if (!porphan->setDependsOn.empty())
2782 porphan->setDependsOn.erase(hash);
2783 if (porphan->setDependsOn.empty())
2784 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2790 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2793 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2794 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2795 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2796 pblock->nBits = GetNextWorkRequired(pindexPrev);
2799 return pblock.release();
2803 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2805 // Update nExtraNonce
2806 static uint256 hashPrevBlock;
2807 if (hashPrevBlock != pblock->hashPrevBlock)
2810 hashPrevBlock = pblock->hashPrevBlock;
2813 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2814 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2818 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2821 // Prebuild hash buffers
2828 uint256 hashPrevBlock;
2829 uint256 hashMerkleRoot;
2832 unsigned int nNonce;
2835 unsigned char pchPadding0[64];
2837 unsigned char pchPadding1[64];
2840 memset(&tmp, 0, sizeof(tmp));
2842 tmp.block.nVersion = pblock->nVersion;
2843 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2844 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2845 tmp.block.nTime = pblock->nTime;
2846 tmp.block.nBits = pblock->nBits;
2847 tmp.block.nNonce = pblock->nNonce;
2849 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2850 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2852 // Byte swap all the input buffer
2853 for (int i = 0; i < sizeof(tmp)/4; i++)
2854 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2856 // Precalc the first half of the first hash, which stays constant
2857 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2859 memcpy(pdata, &tmp.block, 128);
2860 memcpy(phash1, &tmp.hash1, 64);
2864 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2866 uint256 hash = pblock->GetHash();
2867 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2869 if (hash > hashTarget)
2873 printf("BitcoinMiner:\n");
2874 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2876 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2877 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2880 CRITICAL_BLOCK(cs_main)
2882 if (pblock->hashPrevBlock != hashBestChain)
2883 return error("BitcoinMiner : generated block is stale");
2885 // Remove key from key pool
2886 reservekey.KeepKey();
2888 // Track how many getdata requests this block gets
2889 CRITICAL_BLOCK(wallet.cs_wallet)
2890 wallet.mapRequestCount[pblock->GetHash()] = 0;
2892 // Process this block the same as if we had received it from another node
2893 if (!ProcessBlock(NULL, pblock))
2894 return error("BitcoinMiner : ProcessBlock, block not accepted");
2901 void static ThreadBitcoinMiner(void* parg);
2903 void static BitcoinMiner(CWallet *pwallet)
2905 printf("BitcoinMiner started\n");
2906 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2908 // Each thread has its own key and counter
2909 CReserveKey reservekey(pwallet);
2910 unsigned int nExtraNonce = 0;
2912 while (fGenerateBitcoins)
2914 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2918 while (vNodes.empty() || IsInitialBlockDownload())
2923 if (!fGenerateBitcoins)
2931 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2932 CBlockIndex* pindexPrev = pindexBest;
2934 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2937 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2939 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2943 // Prebuild hash buffers
2945 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2946 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2947 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2949 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2951 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2952 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2958 int64 nStart = GetTime();
2959 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2961 uint256& hash = *alignup<16>(hashbuf);
2964 unsigned int nHashesDone = 0;
2965 unsigned int nNonceFound;
2968 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2969 (char*)&hash, nHashesDone);
2971 // Check if something found
2972 if (nNonceFound != -1)
2974 for (int i = 0; i < sizeof(hash)/4; i++)
2975 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2977 if (hash <= hashTarget)
2980 pblock->nNonce = ByteReverse(nNonceFound);
2981 assert(hash == pblock->GetHash());
2983 SetThreadPriority(THREAD_PRIORITY_NORMAL);
2984 CheckWork(pblock.get(), *pwalletMain, reservekey);
2985 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2991 static int64 nHashCounter;
2992 if (nHPSTimerStart == 0)
2994 nHPSTimerStart = GetTimeMillis();
2998 nHashCounter += nHashesDone;
2999 if (GetTimeMillis() - nHPSTimerStart > 4000)
3001 static CCriticalSection cs;
3004 if (GetTimeMillis() - nHPSTimerStart > 4000)
3006 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3007 nHPSTimerStart = GetTimeMillis();
3009 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3010 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3011 static int64 nLogTime;
3012 if (GetTime() - nLogTime > 30 * 60)
3014 nLogTime = GetTime();
3015 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3016 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3022 // Check for stop or if block needs to be rebuilt
3025 if (!fGenerateBitcoins)
3027 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3031 if (nBlockNonce >= 0xffff0000)
3033 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3035 if (pindexPrev != pindexBest)
3038 // Update nTime every few seconds
3039 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3040 nBlockTime = ByteReverse(pblock->nTime);
3045 void static ThreadBitcoinMiner(void* parg)
3047 CWallet* pwallet = (CWallet*)parg;
3050 vnThreadsRunning[3]++;
3051 BitcoinMiner(pwallet);
3052 vnThreadsRunning[3]--;
3054 catch (std::exception& e) {
3055 vnThreadsRunning[3]--;
3056 PrintException(&e, "ThreadBitcoinMiner()");
3058 vnThreadsRunning[3]--;
3059 PrintException(NULL, "ThreadBitcoinMiner()");
3061 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3063 if (vnThreadsRunning[3] == 0)
3065 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3069 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3071 if (fGenerateBitcoins != fGenerate)
3073 fGenerateBitcoins = fGenerate;
3074 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3077 if (fGenerateBitcoins)
3079 int nProcessors = boost::thread::hardware_concurrency();
3080 printf("%d processors\n", nProcessors);
3081 if (nProcessors < 1)
3083 if (fLimitProcessors && nProcessors > nLimitProcessors)
3084 nProcessors = nLimitProcessors;
3085 int nAddThreads = nProcessors - vnThreadsRunning[3];
3086 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3087 for (int i = 0; i < nAddThreads; i++)
3089 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3090 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");