1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include "ui_interface.h"
11 #include <boost/algorithm/string/replace.hpp>
12 #include <boost/filesystem.hpp>
13 #include <boost/filesystem/fstream.hpp>
16 using namespace boost;
22 CCriticalSection cs_setpwalletRegistered;
23 set<CWallet*> setpwalletRegistered;
25 CCriticalSection cs_main;
28 unsigned int nTransactionsUpdated = 0;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 CBlockIndex* pindexGenesisBlock = NULL;
35 CBigNum bnBestChainWork = 0;
36 CBigNum bnBestInvalidWork = 0;
37 uint256 hashBestChain = 0;
38 CBlockIndex* pindexBest = NULL;
39 int64 nTimeBestReceived = 0;
41 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 map<uint256, map<uint256, CDataStream*> > mapOrphanTransactionsByPrev;
49 // Constant stuff for coinbase transactions we create:
50 CScript COINBASE_FLAGS;
52 const string strMessageMagic = "Bitcoin Signed Message:\n";
58 int64 nTransactionFee = 0;
62 //////////////////////////////////////////////////////////////////////////////
64 // dispatching functions
67 // These functions dispatch to one or all registered wallets
70 void RegisterWallet(CWallet* pwalletIn)
73 LOCK(cs_setpwalletRegistered);
74 setpwalletRegistered.insert(pwalletIn);
78 void UnregisterWallet(CWallet* pwalletIn)
81 LOCK(cs_setpwalletRegistered);
82 setpwalletRegistered.erase(pwalletIn);
86 // check whether the passed transaction is from us
87 bool static IsFromMe(CTransaction& tx)
89 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
90 if (pwallet->IsFromMe(tx))
95 // get the wallet transaction with the given hash (if it exists)
96 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
98 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
99 if (pwallet->GetTransaction(hashTx,wtx))
104 // erases transaction with the given hash from all wallets
105 void static EraseFromWallets(uint256 hash)
107 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
108 pwallet->EraseFromWallet(hash);
111 // make sure all wallets know about the given transaction, in the given block
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 // notify wallets about a new best chain
119 void static SetBestChain(const CBlockLocator& loc)
121 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
122 pwallet->SetBestChain(loc);
125 // notify wallets about an updated transaction
126 void static UpdatedTransaction(const uint256& hashTx)
128 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
129 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 // notify wallets about an incoming inventory (for request counts)
140 void static Inventory(const uint256& hash)
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 pwallet->Inventory(hash);
146 // ask wallets to resend their transactions
147 void static ResendWalletTransactions()
149 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
150 pwallet->ResendWalletTransactions();
159 //////////////////////////////////////////////////////////////////////////////
161 // mapOrphanTransactions
164 bool AddOrphanTx(const CDataStream& vMsg)
167 CDataStream(vMsg) >> tx;
168 uint256 hash = tx.GetHash();
169 if (mapOrphanTransactions.count(hash))
172 CDataStream* pvMsg = new CDataStream(vMsg);
174 // Ignore big transactions, to avoid a
175 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
176 // large transaction with a missing parent then we assume
177 // it will rebroadcast it later, after the parent transaction(s)
178 // have been mined or received.
179 // 10,000 orphans, each of which is at most 5,000 bytes big is
180 // at most 500 megabytes of orphans:
181 if (pvMsg->size() > 5000)
183 printf("ignoring large orphan tx (size: %u, hash: %s)\n", pvMsg->size(), hash.ToString().substr(0,10).c_str());
188 mapOrphanTransactions[hash] = pvMsg;
189 BOOST_FOREACH(const CTxIn& txin, tx.vin)
190 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(make_pair(hash, pvMsg));
192 printf("stored orphan tx %s (mapsz %u)\n", hash.ToString().substr(0,10).c_str(),
193 mapOrphanTransactions.size());
197 void static EraseOrphanTx(uint256 hash)
199 if (!mapOrphanTransactions.count(hash))
201 const CDataStream* pvMsg = mapOrphanTransactions[hash];
203 CDataStream(*pvMsg) >> tx;
204 BOOST_FOREACH(const CTxIn& txin, tx.vin)
206 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
207 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
208 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
211 mapOrphanTransactions.erase(hash);
214 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
216 unsigned int nEvicted = 0;
217 while (mapOrphanTransactions.size() > nMaxOrphans)
219 // Evict a random orphan:
220 uint256 randomhash = GetRandHash();
221 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
222 if (it == mapOrphanTransactions.end())
223 it = mapOrphanTransactions.begin();
224 EraseOrphanTx(it->first);
236 //////////////////////////////////////////////////////////////////////////////
238 // CTransaction and CTxIndex
241 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
244 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
246 if (!ReadFromDisk(txindexRet.pos))
248 if (prevout.n >= vout.size())
256 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
259 return ReadFromDisk(txdb, prevout, txindex);
262 bool CTransaction::ReadFromDisk(COutPoint prevout)
266 return ReadFromDisk(txdb, prevout, txindex);
269 bool CTransaction::IsStandard() const
271 BOOST_FOREACH(const CTxIn& txin, vin)
273 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
274 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
275 // ~65-byte public keys, plus a few script ops.
276 if (txin.scriptSig.size() > 500)
278 if (!txin.scriptSig.IsPushOnly())
281 BOOST_FOREACH(const CTxOut& txout, vout)
282 if (!::IsStandard(txout.scriptPubKey))
288 // Check transaction inputs, and make sure any
289 // pay-to-script-hash transactions are evaluating IsStandard scripts
291 // Why bother? To avoid denial-of-service attacks; an attacker
292 // can submit a standard HASH... OP_EQUAL transaction,
293 // which will get accepted into blocks. The redemption
294 // script can be anything; an attacker could use a very
295 // expensive-to-check-upon-redemption script like:
296 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
298 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
301 return true; // Coinbases don't use vin normally
303 for (unsigned int i = 0; i < vin.size(); i++)
305 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
307 vector<vector<unsigned char> > vSolutions;
308 txnouttype whichType;
309 // get the scriptPubKey corresponding to this input:
310 const CScript& prevScript = prev.scriptPubKey;
311 if (!Solver(prevScript, whichType, vSolutions))
313 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
314 if (nArgsExpected < 0)
317 // Transactions with extra stuff in their scriptSigs are
318 // non-standard. Note that this EvalScript() call will
319 // be quick, because if there are any operations
320 // beside "push data" in the scriptSig the
321 // IsStandard() call returns false
322 vector<vector<unsigned char> > stack;
323 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
326 if (whichType == TX_SCRIPTHASH)
330 CScript subscript(stack.back().begin(), stack.back().end());
331 vector<vector<unsigned char> > vSolutions2;
332 txnouttype whichType2;
333 if (!Solver(subscript, whichType2, vSolutions2))
335 if (whichType2 == TX_SCRIPTHASH)
339 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
342 nArgsExpected += tmpExpected;
345 if (stack.size() != (unsigned int)nArgsExpected)
353 CTransaction::GetLegacySigOpCount() const
355 unsigned int nSigOps = 0;
356 BOOST_FOREACH(const CTxIn& txin, vin)
358 nSigOps += txin.scriptSig.GetSigOpCount(false);
360 BOOST_FOREACH(const CTxOut& txout, vout)
362 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
368 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
380 // Load the block this tx is in
382 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
384 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
389 // Update the tx's hashBlock
390 hashBlock = pblock->GetHash();
392 // Locate the transaction
393 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
394 if (pblock->vtx[nIndex] == *(CTransaction*)this)
396 if (nIndex == (int)pblock->vtx.size())
398 vMerkleBranch.clear();
400 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
404 // Fill in merkle branch
405 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
408 // Is the tx in a block that's in the main chain
409 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
410 if (mi == mapBlockIndex.end())
412 CBlockIndex* pindex = (*mi).second;
413 if (!pindex || !pindex->IsInMainChain())
416 return pindexBest->nHeight - pindex->nHeight + 1;
425 bool CTransaction::CheckTransaction() const
427 // Basic checks that don't depend on any context
429 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
431 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
433 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
434 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
436 // Check for negative or overflow output values
438 BOOST_FOREACH(const CTxOut& txout, vout)
440 if (txout.nValue < 0)
441 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
442 if (txout.nValue > MAX_MONEY)
443 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
444 nValueOut += txout.nValue;
445 if (!MoneyRange(nValueOut))
446 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
449 // Check for duplicate inputs
450 set<COutPoint> vInOutPoints;
451 BOOST_FOREACH(const CTxIn& txin, vin)
453 if (vInOutPoints.count(txin.prevout))
455 vInOutPoints.insert(txin.prevout);
460 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
461 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
465 BOOST_FOREACH(const CTxIn& txin, vin)
466 if (txin.prevout.IsNull())
467 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
473 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
474 bool* pfMissingInputs)
477 *pfMissingInputs = false;
479 if (!tx.CheckTransaction())
480 return error("CTxMemPool::accept() : CheckTransaction failed");
482 // Coinbase is only valid in a block, not as a loose transaction
484 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
486 // To help v0.1.5 clients who would see it as a negative number
487 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
488 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
490 // Rather not work on nonstandard transactions (unless -testnet)
491 if (!fTestNet && !tx.IsStandard())
492 return error("CTxMemPool::accept() : nonstandard transaction type");
494 // Do we already have it?
495 uint256 hash = tx.GetHash();
498 if (mapTx.count(hash))
502 if (txdb.ContainsTx(hash))
505 // Check for conflicts with in-memory transactions
506 CTransaction* ptxOld = NULL;
507 for (unsigned int i = 0; i < tx.vin.size(); i++)
509 COutPoint outpoint = tx.vin[i].prevout;
510 if (mapNextTx.count(outpoint))
512 // Disable replacement feature for now
515 // Allow replacing with a newer version of the same transaction
518 ptxOld = mapNextTx[outpoint].ptx;
519 if (ptxOld->IsFinal())
521 if (!tx.IsNewerThan(*ptxOld))
523 for (unsigned int i = 0; i < tx.vin.size(); i++)
525 COutPoint outpoint = tx.vin[i].prevout;
526 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
536 map<uint256, CTxIndex> mapUnused;
537 bool fInvalid = false;
538 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
541 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
543 *pfMissingInputs = true;
544 return error("CTxMemPool::accept() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
547 // Check for non-standard pay-to-script-hash in inputs
548 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
549 return error("CTxMemPool::accept() : nonstandard transaction input");
551 // Note: if you modify this code to accept non-standard transactions, then
552 // you should add code here to check that the transaction does a
553 // reasonable number of ECDSA signature verifications.
555 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
556 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
558 // Don't accept it if it can't get into a block
559 if (nFees < tx.GetMinFee(1000, true, GMF_RELAY))
560 return error("CTxMemPool::accept() : not enough fees");
562 // Continuously rate-limit free transactions
563 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
564 // be annoying or make other's transactions take longer to confirm.
565 if (nFees < MIN_RELAY_TX_FEE)
567 static CCriticalSection cs;
568 static double dFreeCount;
569 static int64 nLastTime;
570 int64 nNow = GetTime();
574 // Use an exponentially decaying ~10-minute window:
575 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
577 // -limitfreerelay unit is thousand-bytes-per-minute
578 // At default rate it would take over a month to fill 1GB
579 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
580 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
582 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
587 // Check against previous transactions
588 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
589 if (!tx.ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
591 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
595 // Store transaction in memory
600 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
606 ///// are we sure this is ok when loading transactions or restoring block txes
607 // If updated, erase old tx from wallet
609 EraseFromWallets(ptxOld->GetHash());
611 printf("CTxMemPool::accept() : accepted %s\n", hash.ToString().substr(0,10).c_str());
615 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
617 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
620 bool CTxMemPool::addUnchecked(CTransaction &tx)
622 printf("addUnchecked(): size %lu\n", mapTx.size());
623 // Add to memory pool without checking anything. Don't call this directly,
624 // call CTxMemPool::accept to properly check the transaction first.
627 uint256 hash = tx.GetHash();
629 for (unsigned int i = 0; i < tx.vin.size(); i++)
630 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
631 nTransactionsUpdated++;
637 bool CTxMemPool::remove(CTransaction &tx)
639 // Remove transaction from memory pool
642 uint256 hash = tx.GetHash();
643 if (mapTx.count(hash))
645 BOOST_FOREACH(const CTxIn& txin, tx.vin)
646 mapNextTx.erase(txin.prevout);
648 nTransactionsUpdated++;
659 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
661 if (hashBlock == 0 || nIndex == -1)
664 // Find the block it claims to be in
665 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
666 if (mi == mapBlockIndex.end())
668 CBlockIndex* pindex = (*mi).second;
669 if (!pindex || !pindex->IsInMainChain())
672 // Make sure the merkle branch connects to this block
673 if (!fMerkleVerified)
675 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
677 fMerkleVerified = true;
681 return pindexBest->nHeight - pindex->nHeight + 1;
685 int CMerkleTx::GetBlocksToMaturity() const
689 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
693 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
697 if (!IsInMainChain() && !ClientConnectInputs())
699 return CTransaction::AcceptToMemoryPool(txdb, false);
703 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
707 bool CMerkleTx::AcceptToMemoryPool()
710 return AcceptToMemoryPool(txdb);
715 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
720 // Add previous supporting transactions first
721 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
723 if (!tx.IsCoinBase())
725 uint256 hash = tx.GetHash();
726 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
727 tx.AcceptToMemoryPool(txdb, fCheckInputs);
730 return AcceptToMemoryPool(txdb, fCheckInputs);
735 bool CWalletTx::AcceptWalletTransaction()
738 return AcceptWalletTransaction(txdb);
741 int CTxIndex::GetDepthInMainChain() const
745 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
747 // Find the block in the index
748 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
749 if (mi == mapBlockIndex.end())
751 CBlockIndex* pindex = (*mi).second;
752 if (!pindex || !pindex->IsInMainChain())
754 return 1 + nBestHeight - pindex->nHeight;
766 //////////////////////////////////////////////////////////////////////////////
768 // CBlock and CBlockIndex
771 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
773 if (!fReadTransactions)
775 *this = pindex->GetBlockHeader();
778 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
780 if (GetHash() != pindex->GetBlockHash())
781 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
785 uint256 static GetOrphanRoot(const CBlock* pblock)
787 // Work back to the first block in the orphan chain
788 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
789 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
790 return pblock->GetHash();
793 int64 static GetBlockValue(int nHeight, int64 nFees)
795 int64 nSubsidy = 50 * COIN;
797 // Subsidy is cut in half every 4 years
798 nSubsidy >>= (nHeight / 210000);
800 return nSubsidy + nFees;
803 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
804 static const int64 nTargetSpacing = 10 * 60;
805 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
808 // minimum amount of work that could possibly be required nTime after
809 // minimum work required was nBase
811 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
813 // Testnet has min-difficulty blocks
814 // after nTargetSpacing*2 time between blocks:
815 if (fTestNet && nTime > nTargetSpacing*2)
816 return bnProofOfWorkLimit.GetCompact();
819 bnResult.SetCompact(nBase);
820 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
822 // Maximum 400% adjustment...
824 // ... in best-case exactly 4-times-normal target time
825 nTime -= nTargetTimespan*4;
827 if (bnResult > bnProofOfWorkLimit)
828 bnResult = bnProofOfWorkLimit;
829 return bnResult.GetCompact();
832 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
834 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
837 if (pindexLast == NULL)
838 return nProofOfWorkLimit;
840 // Only change once per interval
841 if ((pindexLast->nHeight+1) % nInterval != 0)
843 // Special rules for testnet after 15 Feb 2012:
844 if (fTestNet && pblock->nTime > 1329264000)
846 // If the new block's timestamp is more than 2* 10 minutes
847 // then allow mining of a min-difficulty block.
848 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
849 return nProofOfWorkLimit;
852 // Return the last non-special-min-difficulty-rules-block
853 const CBlockIndex* pindex = pindexLast;
854 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
855 pindex = pindex->pprev;
856 return pindex->nBits;
860 return pindexLast->nBits;
863 // Go back by what we want to be 14 days worth of blocks
864 const CBlockIndex* pindexFirst = pindexLast;
865 for (int i = 0; pindexFirst && i < nInterval-1; i++)
866 pindexFirst = pindexFirst->pprev;
869 // Limit adjustment step
870 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
871 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
872 if (nActualTimespan < nTargetTimespan/4)
873 nActualTimespan = nTargetTimespan/4;
874 if (nActualTimespan > nTargetTimespan*4)
875 nActualTimespan = nTargetTimespan*4;
879 bnNew.SetCompact(pindexLast->nBits);
880 bnNew *= nActualTimespan;
881 bnNew /= nTargetTimespan;
883 if (bnNew > bnProofOfWorkLimit)
884 bnNew = bnProofOfWorkLimit;
887 printf("GetNextWorkRequired RETARGET\n");
888 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
889 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
890 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
892 return bnNew.GetCompact();
895 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
898 bnTarget.SetCompact(nBits);
901 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
902 return error("CheckProofOfWork() : nBits below minimum work");
904 // Check proof of work matches claimed amount
905 if (hash > bnTarget.getuint256())
906 return error("CheckProofOfWork() : hash doesn't match nBits");
911 // Return maximum amount of blocks that other nodes claim to have
912 int GetNumBlocksOfPeers()
914 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
917 bool IsInitialBlockDownload()
919 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
921 static int64 nLastUpdate;
922 static CBlockIndex* pindexLastBest;
923 if (pindexBest != pindexLastBest)
925 pindexLastBest = pindexBest;
926 nLastUpdate = GetTime();
928 return (GetTime() - nLastUpdate < 10 &&
929 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
932 void static InvalidChainFound(CBlockIndex* pindexNew)
934 if (pindexNew->bnChainWork > bnBestInvalidWork)
936 bnBestInvalidWork = pindexNew->bnChainWork;
937 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
940 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());
941 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
942 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
943 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
946 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
948 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
950 // Updating time can change work required on testnet:
952 nBits = GetNextWorkRequired(pindexPrev, this);
965 bool CTransaction::DisconnectInputs(CTxDB& txdb)
967 // Relinquish previous transactions' spent pointers
970 BOOST_FOREACH(const CTxIn& txin, vin)
972 COutPoint prevout = txin.prevout;
974 // Get prev txindex from disk
976 if (!txdb.ReadTxIndex(prevout.hash, txindex))
977 return error("DisconnectInputs() : ReadTxIndex failed");
979 if (prevout.n >= txindex.vSpent.size())
980 return error("DisconnectInputs() : prevout.n out of range");
982 // Mark outpoint as not spent
983 txindex.vSpent[prevout.n].SetNull();
986 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
987 return error("DisconnectInputs() : UpdateTxIndex failed");
991 // Remove transaction from index
992 // This can fail if a duplicate of this transaction was in a chain that got
993 // reorganized away. This is only possible if this transaction was completely
994 // spent, so erasing it would be a no-op anway.
995 txdb.EraseTxIndex(*this);
1001 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1002 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1004 // FetchInputs can return false either because we just haven't seen some inputs
1005 // (in which case the transaction should be stored as an orphan)
1006 // or because the transaction is malformed (in which case the transaction should
1007 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1011 return true; // Coinbase transactions have no inputs to fetch.
1013 for (unsigned int i = 0; i < vin.size(); i++)
1015 COutPoint prevout = vin[i].prevout;
1016 if (inputsRet.count(prevout.hash))
1017 continue; // Got it already
1020 CTxIndex& txindex = inputsRet[prevout.hash].first;
1022 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1024 // Get txindex from current proposed changes
1025 txindex = mapTestPool.find(prevout.hash)->second;
1029 // Read txindex from txdb
1030 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1032 if (!fFound && (fBlock || fMiner))
1033 return fMiner ? false : error("FetchInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1036 CTransaction& txPrev = inputsRet[prevout.hash].second;
1037 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1039 // Get prev tx from single transactions in memory
1042 if (!mempool.exists(prevout.hash))
1043 return error("FetchInputs() : %s mempool Tx prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1044 txPrev = mempool.lookup(prevout.hash);
1047 txindex.vSpent.resize(txPrev.vout.size());
1051 // Get prev tx from disk
1052 if (!txPrev.ReadFromDisk(txindex.pos))
1053 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1057 // Make sure all prevout.n's are valid:
1058 for (unsigned int i = 0; i < vin.size(); i++)
1060 const COutPoint prevout = vin[i].prevout;
1061 assert(inputsRet.count(prevout.hash) != 0);
1062 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1063 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1064 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1066 // Revisit this if/when transaction replacement is implemented and allows
1069 return DoS(100, error("FetchInputs() : %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()));
1076 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1078 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1079 if (mi == inputs.end())
1080 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1082 const CTransaction& txPrev = (mi->second).second;
1083 if (input.prevout.n >= txPrev.vout.size())
1084 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1086 return txPrev.vout[input.prevout.n];
1089 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1095 for (unsigned int i = 0; i < vin.size(); i++)
1097 nResult += GetOutputFor(vin[i], inputs).nValue;
1103 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1108 unsigned int nSigOps = 0;
1109 for (unsigned int i = 0; i < vin.size(); i++)
1111 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1112 if (prevout.scriptPubKey.IsPayToScriptHash())
1113 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1118 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1119 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1120 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1122 // Take over previous transactions' spent pointers
1123 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1124 // fMiner is true when called from the internal bitcoin miner
1125 // ... both are false when called from CTransaction::AcceptToMemoryPool
1130 for (unsigned int i = 0; i < vin.size(); i++)
1132 COutPoint prevout = vin[i].prevout;
1133 assert(inputs.count(prevout.hash) > 0);
1134 CTxIndex& txindex = inputs[prevout.hash].first;
1135 CTransaction& txPrev = inputs[prevout.hash].second;
1137 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1138 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
1140 // If prev is coinbase, check that it's matured
1141 if (txPrev.IsCoinBase())
1142 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1143 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1144 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1146 // Check for negative or overflow input values
1147 nValueIn += txPrev.vout[prevout.n].nValue;
1148 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1149 return DoS(100, error("ConnectInputs() : txin values out of range"));
1152 // The first loop above does all the inexpensive checks.
1153 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1154 // Helps prevent CPU exhaustion attacks.
1155 for (unsigned int i = 0; i < vin.size(); i++)
1157 COutPoint prevout = vin[i].prevout;
1158 assert(inputs.count(prevout.hash) > 0);
1159 CTxIndex& txindex = inputs[prevout.hash].first;
1160 CTransaction& txPrev = inputs[prevout.hash].second;
1162 // Check for conflicts (double-spend)
1163 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1164 // for an attacker to attempt to split the network.
1165 if (!txindex.vSpent[prevout.n].IsNull())
1166 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());
1168 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1169 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1170 // still computed and checked, and any change will be caught at the next checkpoint.
1171 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1174 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1176 // only during transition phase for P2SH: do not invoke anti-DoS code for
1177 // potentially old clients relaying bad P2SH transactions
1178 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1179 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1181 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1185 // Mark outpoints as spent
1186 txindex.vSpent[prevout.n] = posThisTx;
1189 if (fBlock || fMiner)
1191 mapTestPool[prevout.hash] = txindex;
1195 if (nValueIn < GetValueOut())
1196 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1198 // Tally transaction fees
1199 int64 nTxFee = nValueIn - GetValueOut();
1201 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1203 if (!MoneyRange(nFees))
1204 return DoS(100, error("ConnectInputs() : nFees out of range"));
1211 bool CTransaction::ClientConnectInputs()
1216 // Take over previous transactions' spent pointers
1220 for (unsigned int i = 0; i < vin.size(); i++)
1222 // Get prev tx from single transactions in memory
1223 COutPoint prevout = vin[i].prevout;
1224 if (!mempool.exists(prevout.hash))
1226 CTransaction& txPrev = mempool.lookup(prevout.hash);
1228 if (prevout.n >= txPrev.vout.size())
1232 if (!VerifySignature(txPrev, *this, i, true, 0))
1233 return error("ConnectInputs() : VerifySignature failed");
1235 ///// this is redundant with the mempool.mapNextTx stuff,
1236 ///// not sure which I want to get rid of
1237 ///// this has to go away now that posNext is gone
1238 // // Check for conflicts
1239 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1240 // return error("ConnectInputs() : prev tx already used");
1242 // // Flag outpoints as used
1243 // txPrev.vout[prevout.n].posNext = posThisTx;
1245 nValueIn += txPrev.vout[prevout.n].nValue;
1247 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1248 return error("ClientConnectInputs() : txin values out of range");
1250 if (GetValueOut() > nValueIn)
1260 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1262 // Disconnect in reverse order
1263 for (int i = vtx.size()-1; i >= 0; i--)
1264 if (!vtx[i].DisconnectInputs(txdb))
1267 // Update block index on disk without changing it in memory.
1268 // The memory index structure will be changed after the db commits.
1271 CDiskBlockIndex blockindexPrev(pindex->pprev);
1272 blockindexPrev.hashNext = 0;
1273 if (!txdb.WriteBlockIndex(blockindexPrev))
1274 return error("DisconnectBlock() : WriteBlockIndex failed");
1280 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1282 // Check it again in case a previous version let a bad block in
1286 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1287 // unless those are already completely spent.
1288 // If such overwrites are allowed, coinbases and transactions depending upon those
1289 // can be duplicated to remove the ability to spend the first instance -- even after
1290 // being sent to another address.
1291 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1292 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1293 // already refuses previously-known transaction id's entirely.
1294 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1295 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1296 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1298 BOOST_FOREACH(CTransaction& tx, vtx)
1300 CTxIndex txindexOld;
1301 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1303 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1310 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1311 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1312 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1314 //// issue here: it doesn't know the version
1315 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - 1 + GetSizeOfCompactSize(vtx.size());
1317 map<uint256, CTxIndex> mapQueuedChanges;
1319 unsigned int nSigOps = 0;
1320 BOOST_FOREACH(CTransaction& tx, vtx)
1322 nSigOps += tx.GetLegacySigOpCount();
1323 if (nSigOps > MAX_BLOCK_SIGOPS)
1324 return DoS(100, error("ConnectBlock() : too many sigops"));
1326 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1327 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1329 MapPrevTx mapInputs;
1330 if (!tx.IsCoinBase())
1333 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1336 if (fStrictPayToScriptHash)
1338 // Add in sigops done by pay-to-script-hash inputs;
1339 // this is to prevent a "rogue miner" from creating
1340 // an incredibly-expensive-to-validate block.
1341 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1342 if (nSigOps > MAX_BLOCK_SIGOPS)
1343 return DoS(100, error("ConnectBlock() : too many sigops"));
1346 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1348 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1352 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1355 // Write queued txindex changes
1356 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1358 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1359 return error("ConnectBlock() : UpdateTxIndex failed");
1362 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1365 // Update block index on disk without changing it in memory.
1366 // The memory index structure will be changed after the db commits.
1369 CDiskBlockIndex blockindexPrev(pindex->pprev);
1370 blockindexPrev.hashNext = pindex->GetBlockHash();
1371 if (!txdb.WriteBlockIndex(blockindexPrev))
1372 return error("ConnectBlock() : WriteBlockIndex failed");
1375 // Watch for transactions paying to me
1376 BOOST_FOREACH(CTransaction& tx, vtx)
1377 SyncWithWallets(tx, this, true);
1382 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1384 printf("REORGANIZE\n");
1387 CBlockIndex* pfork = pindexBest;
1388 CBlockIndex* plonger = pindexNew;
1389 while (pfork != plonger)
1391 while (plonger->nHeight > pfork->nHeight)
1392 if (!(plonger = plonger->pprev))
1393 return error("Reorganize() : plonger->pprev is null");
1394 if (pfork == plonger)
1396 if (!(pfork = pfork->pprev))
1397 return error("Reorganize() : pfork->pprev is null");
1400 // List of what to disconnect
1401 vector<CBlockIndex*> vDisconnect;
1402 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1403 vDisconnect.push_back(pindex);
1405 // List of what to connect
1406 vector<CBlockIndex*> vConnect;
1407 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1408 vConnect.push_back(pindex);
1409 reverse(vConnect.begin(), vConnect.end());
1411 printf("REORGANIZE: Disconnect %i blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1412 printf("REORGANIZE: Connect %i blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1414 // Disconnect shorter branch
1415 vector<CTransaction> vResurrect;
1416 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1419 if (!block.ReadFromDisk(pindex))
1420 return error("Reorganize() : ReadFromDisk for disconnect failed");
1421 if (!block.DisconnectBlock(txdb, pindex))
1422 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1424 // Queue memory transactions to resurrect
1425 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1426 if (!tx.IsCoinBase())
1427 vResurrect.push_back(tx);
1430 // Connect longer branch
1431 vector<CTransaction> vDelete;
1432 for (unsigned int i = 0; i < vConnect.size(); i++)
1434 CBlockIndex* pindex = vConnect[i];
1436 if (!block.ReadFromDisk(pindex))
1437 return error("Reorganize() : ReadFromDisk for connect failed");
1438 if (!block.ConnectBlock(txdb, pindex))
1442 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1445 // Queue memory transactions to delete
1446 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1447 vDelete.push_back(tx);
1449 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1450 return error("Reorganize() : WriteHashBestChain failed");
1452 // Make sure it's successfully written to disk before changing memory structure
1453 if (!txdb.TxnCommit())
1454 return error("Reorganize() : TxnCommit failed");
1456 // Disconnect shorter branch
1457 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1459 pindex->pprev->pnext = NULL;
1461 // Connect longer branch
1462 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1464 pindex->pprev->pnext = pindex;
1466 // Resurrect memory transactions that were in the disconnected branch
1467 BOOST_FOREACH(CTransaction& tx, vResurrect)
1468 tx.AcceptToMemoryPool(txdb, false);
1470 // Delete redundant memory transactions that are in the connected branch
1471 BOOST_FOREACH(CTransaction& tx, vDelete)
1474 printf("REORGANIZE: done\n");
1481 runCommand(std::string strCommand)
1483 int nErr = ::system(strCommand.c_str());
1485 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1488 // Called from inside SetBestChain: attaches a block to the new best chain being built
1489 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1491 uint256 hash = GetHash();
1493 // Adding to current best branch
1494 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1497 InvalidChainFound(pindexNew);
1500 if (!txdb.TxnCommit())
1501 return error("SetBestChain() : TxnCommit failed");
1503 // Add to current best branch
1504 pindexNew->pprev->pnext = pindexNew;
1506 // Delete redundant memory transactions
1507 BOOST_FOREACH(CTransaction& tx, vtx)
1513 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1515 uint256 hash = GetHash();
1517 if (!txdb.TxnBegin())
1518 return error("SetBestChain() : TxnBegin failed");
1520 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1522 txdb.WriteHashBestChain(hash);
1523 if (!txdb.TxnCommit())
1524 return error("SetBestChain() : TxnCommit failed");
1525 pindexGenesisBlock = pindexNew;
1527 else if (hashPrevBlock == hashBestChain)
1529 if (!SetBestChainInner(txdb, pindexNew))
1530 return error("SetBestChain() : SetBestChainInner failed");
1534 // the first block in the new chain that will cause it to become the new best chain
1535 CBlockIndex *pindexIntermediate = pindexNew;
1537 // list of blocks that need to be connected afterwards
1538 std::vector<CBlockIndex*> vpindexSecondary;
1540 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1541 // Try to limit how much needs to be done inside
1542 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1544 vpindexSecondary.push_back(pindexIntermediate);
1545 pindexIntermediate = pindexIntermediate->pprev;
1548 if (!vpindexSecondary.empty())
1549 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1551 // Switch to new best branch
1552 if (!Reorganize(txdb, pindexIntermediate))
1555 InvalidChainFound(pindexNew);
1556 return error("SetBestChain() : Reorganize failed");
1559 // Connect futher blocks
1560 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1563 if (!block.ReadFromDisk(pindex))
1565 printf("SetBestChain() : ReadFromDisk failed\n");
1568 if (!txdb.TxnBegin()) {
1569 printf("SetBestChain() : TxnBegin 2 failed\n");
1572 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1573 if (!block.SetBestChainInner(txdb, pindex))
1578 // Update best block in wallet (so we can detect restored wallets)
1579 bool fIsInitialDownload = IsInitialBlockDownload();
1580 if (!fIsInitialDownload)
1582 const CBlockLocator locator(pindexNew);
1583 ::SetBestChain(locator);
1587 hashBestChain = hash;
1588 pindexBest = pindexNew;
1589 nBestHeight = pindexBest->nHeight;
1590 bnBestChainWork = pindexNew->bnChainWork;
1591 nTimeBestReceived = GetTime();
1592 nTransactionsUpdated++;
1593 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1595 std::string strCmd = GetArg("-blocknotify", "");
1597 if (!fIsInitialDownload && !strCmd.empty())
1599 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1600 boost::thread t(runCommand, strCmd); // thread runs free
1607 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1609 // Check for duplicate
1610 uint256 hash = GetHash();
1611 if (mapBlockIndex.count(hash))
1612 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1614 // Construct new block index object
1615 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1617 return error("AddToBlockIndex() : new CBlockIndex failed");
1618 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1619 pindexNew->phashBlock = &((*mi).first);
1620 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1621 if (miPrev != mapBlockIndex.end())
1623 pindexNew->pprev = (*miPrev).second;
1624 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1626 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1629 if (!txdb.TxnBegin())
1631 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1632 if (!txdb.TxnCommit())
1636 if (pindexNew->bnChainWork > bnBestChainWork)
1637 if (!SetBestChain(txdb, pindexNew))
1642 if (pindexNew == pindexBest)
1644 // Notify UI to display prev block's coinbase if it was ours
1645 static uint256 hashPrevBestCoinBase;
1646 UpdatedTransaction(hashPrevBestCoinBase);
1647 hashPrevBestCoinBase = vtx[0].GetHash();
1657 bool CBlock::CheckBlock() const
1659 // These are checks that are independent of context
1660 // that can be verified before saving an orphan block.
1663 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
1664 return DoS(100, error("CheckBlock() : size limits failed"));
1666 // Check proof of work matches claimed amount
1667 if (!CheckProofOfWork(GetHash(), nBits))
1668 return DoS(50, error("CheckBlock() : proof of work failed"));
1671 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1672 return error("CheckBlock() : block timestamp too far in the future");
1674 // First transaction must be coinbase, the rest must not be
1675 if (vtx.empty() || !vtx[0].IsCoinBase())
1676 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1677 for (unsigned int i = 1; i < vtx.size(); i++)
1678 if (vtx[i].IsCoinBase())
1679 return DoS(100, error("CheckBlock() : more than one coinbase"));
1681 // Check transactions
1682 BOOST_FOREACH(const CTransaction& tx, vtx)
1683 if (!tx.CheckTransaction())
1684 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1686 // Check for duplicate txids. This is caught by ConnectInputs(),
1687 // but catching it earlier avoids a potential DoS attack:
1688 set<uint256> uniqueTx;
1689 BOOST_FOREACH(const CTransaction& tx, vtx)
1691 uniqueTx.insert(tx.GetHash());
1693 if (uniqueTx.size() != vtx.size())
1694 return DoS(100, error("CheckBlock() : duplicate transaction"));
1696 unsigned int nSigOps = 0;
1697 BOOST_FOREACH(const CTransaction& tx, vtx)
1699 nSigOps += tx.GetLegacySigOpCount();
1701 if (nSigOps > MAX_BLOCK_SIGOPS)
1702 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1705 if (hashMerkleRoot != BuildMerkleTree())
1706 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1711 bool CBlock::AcceptBlock()
1713 // Check for duplicate
1714 uint256 hash = GetHash();
1715 if (mapBlockIndex.count(hash))
1716 return error("AcceptBlock() : block already in mapBlockIndex");
1718 // Get prev block index
1719 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1720 if (mi == mapBlockIndex.end())
1721 return DoS(10, error("AcceptBlock() : prev block not found"));
1722 CBlockIndex* pindexPrev = (*mi).second;
1723 int nHeight = pindexPrev->nHeight+1;
1725 // Check proof of work
1726 if (nBits != GetNextWorkRequired(pindexPrev, this))
1727 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1729 // Check timestamp against prev
1730 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1731 return error("AcceptBlock() : block's timestamp is too early");
1733 // Check that all transactions are finalized
1734 BOOST_FOREACH(const CTransaction& tx, vtx)
1735 if (!tx.IsFinal(nHeight, GetBlockTime()))
1736 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1738 // Check that the block chain matches the known block chain up to a checkpoint
1739 if (!Checkpoints::CheckBlock(nHeight, hash))
1740 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1742 // Write block to history file
1743 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
1744 return error("AcceptBlock() : out of disk space");
1745 unsigned int nFile = -1;
1746 unsigned int nBlockPos = 0;
1747 if (!WriteToDisk(nFile, nBlockPos))
1748 return error("AcceptBlock() : WriteToDisk failed");
1749 if (!AddToBlockIndex(nFile, nBlockPos))
1750 return error("AcceptBlock() : AddToBlockIndex failed");
1752 // Relay inventory, but don't relay old inventory during initial block download
1753 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1754 if (hashBestChain == hash)
1757 BOOST_FOREACH(CNode* pnode, vNodes)
1758 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1759 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1765 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1767 // Check for duplicate
1768 uint256 hash = pblock->GetHash();
1769 if (mapBlockIndex.count(hash))
1770 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1771 if (mapOrphanBlocks.count(hash))
1772 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1774 // Preliminary checks
1775 if (!pblock->CheckBlock())
1776 return error("ProcessBlock() : CheckBlock FAILED");
1778 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1779 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1781 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1782 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1786 pfrom->Misbehaving(100);
1787 return error("ProcessBlock() : block with timestamp before last checkpoint");
1790 bnNewBlock.SetCompact(pblock->nBits);
1792 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1793 if (bnNewBlock > bnRequired)
1796 pfrom->Misbehaving(100);
1797 return error("ProcessBlock() : block with too little proof-of-work");
1802 // If don't already have its previous block, shunt it off to holding area until we get it
1803 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1805 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1806 CBlock* pblock2 = new CBlock(*pblock);
1807 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1808 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1810 // Ask this guy to fill in what we're missing
1812 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1817 if (!pblock->AcceptBlock())
1818 return error("ProcessBlock() : AcceptBlock FAILED");
1820 // Recursively process any orphan blocks that depended on this one
1821 vector<uint256> vWorkQueue;
1822 vWorkQueue.push_back(hash);
1823 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
1825 uint256 hashPrev = vWorkQueue[i];
1826 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1827 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1830 CBlock* pblockOrphan = (*mi).second;
1831 if (pblockOrphan->AcceptBlock())
1832 vWorkQueue.push_back(pblockOrphan->GetHash());
1833 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1834 delete pblockOrphan;
1836 mapOrphanBlocksByPrev.erase(hashPrev);
1839 printf("ProcessBlock: ACCEPTED\n");
1850 bool CheckDiskSpace(uint64 nAdditionalBytes)
1852 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1854 // Check for 15MB because database could create another 10MB log file at any time
1855 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1858 string strMessage = _("Warning: Disk space is low");
1859 strMiscWarning = strMessage;
1860 printf("*** %s\n", strMessage.c_str());
1861 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1868 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1872 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1875 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1877 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1886 static unsigned int nCurrentBlockFile = 1;
1888 FILE* AppendBlockFile(unsigned int& nFileRet)
1893 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1896 if (fseek(file, 0, SEEK_END) != 0)
1898 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1899 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1901 nFileRet = nCurrentBlockFile;
1905 nCurrentBlockFile++;
1909 bool LoadBlockIndex(bool fAllowNew)
1913 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1914 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1915 pchMessageStart[0] = 0xfa;
1916 pchMessageStart[1] = 0xbf;
1917 pchMessageStart[2] = 0xb5;
1918 pchMessageStart[3] = 0xda;
1925 if (!txdb.LoadBlockIndex())
1930 // Init with genesis block
1932 if (mapBlockIndex.empty())
1938 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1939 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1940 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1941 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1942 // vMerkleTree: 4a5e1e
1945 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1947 txNew.vin.resize(1);
1948 txNew.vout.resize(1);
1949 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1950 txNew.vout[0].nValue = 50 * COIN;
1951 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1953 block.vtx.push_back(txNew);
1954 block.hashPrevBlock = 0;
1955 block.hashMerkleRoot = block.BuildMerkleTree();
1957 block.nTime = 1231006505;
1958 block.nBits = 0x1d00ffff;
1959 block.nNonce = 2083236893;
1963 block.nTime = 1296688602;
1964 block.nBits = 0x1d07fff8;
1965 block.nNonce = 384568319;
1969 printf("%s\n", block.GetHash().ToString().c_str());
1970 printf("%s\n", hashGenesisBlock.ToString().c_str());
1971 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1972 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1974 assert(block.GetHash() == hashGenesisBlock);
1976 // Start new block file
1978 unsigned int nBlockPos;
1979 if (!block.WriteToDisk(nFile, nBlockPos))
1980 return error("LoadBlockIndex() : writing genesis block to disk failed");
1981 if (!block.AddToBlockIndex(nFile, nBlockPos))
1982 return error("LoadBlockIndex() : genesis block not accepted");
1990 void PrintBlockTree()
1992 // precompute tree structure
1993 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1994 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1996 CBlockIndex* pindex = (*mi).second;
1997 mapNext[pindex->pprev].push_back(pindex);
1999 //while (rand() % 3 == 0)
2000 // mapNext[pindex->pprev].push_back(pindex);
2003 vector<pair<int, CBlockIndex*> > vStack;
2004 vStack.push_back(make_pair(0, pindexGenesisBlock));
2007 while (!vStack.empty())
2009 int nCol = vStack.back().first;
2010 CBlockIndex* pindex = vStack.back().second;
2013 // print split or gap
2014 if (nCol > nPrevCol)
2016 for (int i = 0; i < nCol-1; i++)
2020 else if (nCol < nPrevCol)
2022 for (int i = 0; i < nCol; i++)
2029 for (int i = 0; i < nCol; i++)
2034 block.ReadFromDisk(pindex);
2035 printf("%d (%u,%u) %s %s tx %d",
2039 block.GetHash().ToString().substr(0,20).c_str(),
2040 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2043 PrintWallets(block);
2045 // put the main timechain first
2046 vector<CBlockIndex*>& vNext = mapNext[pindex];
2047 for (unsigned int i = 0; i < vNext.size(); i++)
2049 if (vNext[i]->pnext)
2051 swap(vNext[0], vNext[i]);
2057 for (unsigned int i = 0; i < vNext.size(); i++)
2058 vStack.push_back(make_pair(nCol+i, vNext[i]));
2071 //////////////////////////////////////////////////////////////////////////////
2076 map<uint256, CAlert> mapAlerts;
2077 CCriticalSection cs_mapAlerts;
2079 string GetWarnings(string strFor)
2082 string strStatusBar;
2084 if (GetBoolArg("-testsafemode"))
2087 // Misc warnings like out of disk space and clock is wrong
2088 if (strMiscWarning != "")
2091 strStatusBar = strMiscWarning;
2094 // Longer invalid proof-of-work chain
2095 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2098 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2104 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2106 const CAlert& alert = item.second;
2107 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2109 nPriority = alert.nPriority;
2110 strStatusBar = alert.strStatusBar;
2115 if (strFor == "statusbar")
2116 return strStatusBar;
2117 else if (strFor == "rpc")
2119 assert(!"GetWarnings() : invalid parameter");
2123 bool CAlert::ProcessAlert()
2125 if (!CheckSignature())
2132 // Cancel previous alerts
2133 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2135 const CAlert& alert = (*mi).second;
2138 printf("cancelling alert %d\n", alert.nID);
2139 mapAlerts.erase(mi++);
2141 else if (!alert.IsInEffect())
2143 printf("expiring alert %d\n", alert.nID);
2144 mapAlerts.erase(mi++);
2150 // Check if this alert has been cancelled
2151 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2153 const CAlert& alert = item.second;
2154 if (alert.Cancels(*this))
2156 printf("alert already cancelled by %d\n", alert.nID);
2162 mapAlerts.insert(make_pair(GetHash(), *this));
2165 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2177 //////////////////////////////////////////////////////////////////////////////
2183 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2189 bool txInMap = false;
2192 txInMap = (mempool.exists(inv.hash));
2195 mapOrphanTransactions.count(inv.hash) ||
2196 txdb.ContainsTx(inv.hash);
2200 return mapBlockIndex.count(inv.hash) ||
2201 mapOrphanBlocks.count(inv.hash);
2203 // Don't know what it is, just say we already got one
2210 // The message start string is designed to be unlikely to occur in normal data.
2211 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2212 // a large 4-byte int at any alignment.
2213 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2216 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2218 static map<CService, vector<unsigned char> > mapReuseKey;
2219 RandAddSeedPerfmon();
2221 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2222 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2224 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2226 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2234 if (strCommand == "version")
2236 // Each connection can only send one version message
2237 if (pfrom->nVersion != 0)
2239 pfrom->Misbehaving(1);
2247 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2248 if (pfrom->nVersion < MIN_PROTO_VERSION)
2250 // Since February 20, 2012, the protocol is initiated at version 209,
2251 // and earlier versions are no longer supported
2252 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2253 pfrom->fDisconnect = true;
2257 if (pfrom->nVersion == 10300)
2258 pfrom->nVersion = 300;
2260 vRecv >> addrFrom >> nNonce;
2262 vRecv >> pfrom->strSubVer;
2264 vRecv >> pfrom->nStartingHeight;
2266 // Disconnect if we connected to ourself
2267 if (nNonce == nLocalHostNonce && nNonce > 1)
2269 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2270 pfrom->fDisconnect = true;
2274 // Be shy and don't send version until we hear
2275 if (pfrom->fInbound)
2276 pfrom->PushVersion();
2278 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2280 AddTimeData(pfrom->addr, nTime);
2283 pfrom->PushMessage("verack");
2284 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2286 if (!pfrom->fInbound)
2288 // Advertise our address
2289 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2290 !IsInitialBlockDownload())
2292 CAddress addr(addrLocalHost);
2293 addr.nTime = GetAdjustedTime();
2294 pfrom->PushAddress(addr);
2297 // Get recent addresses
2298 if (pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
2300 pfrom->PushMessage("getaddr");
2301 pfrom->fGetAddr = true;
2303 addrman.Good(pfrom->addr);
2305 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2307 addrman.Add(addrFrom, addrFrom);
2308 addrman.Good(addrFrom);
2312 // Ask the first connected node for block updates
2313 static int nAskedForBlocks = 0;
2314 if (!pfrom->fClient &&
2315 (pfrom->nVersion < NOBLKS_VERSION_START ||
2316 pfrom->nVersion >= NOBLKS_VERSION_END) &&
2317 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2320 pfrom->PushGetBlocks(pindexBest, uint256(0));
2326 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2327 item.second.RelayTo(pfrom);
2330 pfrom->fSuccessfullyConnected = true;
2332 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2334 cPeerBlockCounts.input(pfrom->nStartingHeight);
2338 else if (pfrom->nVersion == 0)
2340 // Must have a version message before anything else
2341 pfrom->Misbehaving(1);
2346 else if (strCommand == "verack")
2348 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2352 else if (strCommand == "addr")
2354 vector<CAddress> vAddr;
2357 // Don't want addr from older versions unless seeding
2358 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
2360 if (vAddr.size() > 1000)
2362 pfrom->Misbehaving(20);
2363 return error("message addr size() = %d", vAddr.size());
2366 // Store the new addresses
2367 int64 nNow = GetAdjustedTime();
2368 int64 nSince = nNow - 10 * 60;
2369 BOOST_FOREACH(CAddress& addr, vAddr)
2373 // ignore IPv6 for now, since it isn't implemented anyway
2376 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2377 addr.nTime = nNow - 5 * 24 * 60 * 60;
2378 pfrom->AddAddressKnown(addr);
2379 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2381 // Relay to a limited number of other nodes
2384 // Use deterministic randomness to send to the same nodes for 24 hours
2385 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2386 static uint256 hashSalt;
2388 hashSalt = GetRandHash();
2389 int64 hashAddr = addr.GetHash();
2390 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2391 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2392 multimap<uint256, CNode*> mapMix;
2393 BOOST_FOREACH(CNode* pnode, vNodes)
2395 if (pnode->nVersion < CADDR_TIME_VERSION)
2397 unsigned int nPointer;
2398 memcpy(&nPointer, &pnode, sizeof(nPointer));
2399 uint256 hashKey = hashRand ^ nPointer;
2400 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2401 mapMix.insert(make_pair(hashKey, pnode));
2403 int nRelayNodes = 2;
2404 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2405 ((*mi).second)->PushAddress(addr);
2409 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2410 if (vAddr.size() < 1000)
2411 pfrom->fGetAddr = false;
2415 else if (strCommand == "inv")
2419 if (vInv.size() > 50000)
2421 pfrom->Misbehaving(20);
2422 return error("message inv size() = %d", vInv.size());
2425 // find last block in inv vector
2426 unsigned int nLastBlock = (unsigned int)(-1);
2427 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
2428 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
2429 nLastBlock = vInv.size() - 1 - nInv;
2434 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
2436 const CInv &inv = vInv[nInv];
2440 pfrom->AddInventoryKnown(inv);
2442 bool fAlreadyHave = AlreadyHave(txdb, inv);
2444 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2448 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
2449 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2450 } else if (nInv == nLastBlock) {
2451 // In case we are on a very long side-chain, it is possible that we already have
2452 // the last block in an inv bundle sent in response to getblocks. Try to detect
2453 // this situation and push another getblocks to continue.
2454 std::vector<CInv> vGetData(1,inv);
2455 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
2457 printf("force request: %s\n", inv.ToString().c_str());
2460 // Track requests for our stuff
2461 Inventory(inv.hash);
2466 else if (strCommand == "getdata")
2470 if (vInv.size() > 50000)
2472 pfrom->Misbehaving(20);
2473 return error("message getdata size() = %d", vInv.size());
2476 BOOST_FOREACH(const CInv& inv, vInv)
2480 printf("received getdata for: %s\n", inv.ToString().c_str());
2482 if (inv.type == MSG_BLOCK)
2484 // Send block from disk
2485 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2486 if (mi != mapBlockIndex.end())
2489 block.ReadFromDisk((*mi).second);
2490 pfrom->PushMessage("block", block);
2492 // Trigger them to send a getblocks request for the next batch of inventory
2493 if (inv.hash == pfrom->hashContinue)
2495 // Bypass PushInventory, this must send even if redundant,
2496 // and we want it right after the last block so they don't
2497 // wait for other stuff first.
2499 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2500 pfrom->PushMessage("inv", vInv);
2501 pfrom->hashContinue = 0;
2505 else if (inv.IsKnownType())
2507 // Send stream from relay memory
2510 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2511 if (mi != mapRelay.end())
2512 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2516 // Track requests for our stuff
2517 Inventory(inv.hash);
2522 else if (strCommand == "getblocks")
2524 CBlockLocator locator;
2526 vRecv >> locator >> hashStop;
2528 // Find the last block the caller has in the main chain
2529 CBlockIndex* pindex = locator.GetBlockIndex();
2531 // Send the rest of the chain
2533 pindex = pindex->pnext;
2534 int nLimit = 500 + locator.GetDistanceBack();
2535 unsigned int nBytes = 0;
2536 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2537 for (; pindex; pindex = pindex->pnext)
2539 if (pindex->GetBlockHash() == hashStop)
2541 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2544 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2546 block.ReadFromDisk(pindex, true);
2547 nBytes += block.GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
2548 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2550 // When this block is requested, we'll send an inv that'll make them
2551 // getblocks the next batch of inventory.
2552 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2553 pfrom->hashContinue = pindex->GetBlockHash();
2560 else if (strCommand == "getheaders")
2562 CBlockLocator locator;
2564 vRecv >> locator >> hashStop;
2566 CBlockIndex* pindex = NULL;
2567 if (locator.IsNull())
2569 // If locator is null, return the hashStop block
2570 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2571 if (mi == mapBlockIndex.end())
2573 pindex = (*mi).second;
2577 // Find the last block the caller has in the main chain
2578 pindex = locator.GetBlockIndex();
2580 pindex = pindex->pnext;
2583 vector<CBlock> vHeaders;
2585 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2586 for (; pindex; pindex = pindex->pnext)
2588 vHeaders.push_back(pindex->GetBlockHeader());
2589 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2592 pfrom->PushMessage("headers", vHeaders);
2596 else if (strCommand == "tx")
2598 vector<uint256> vWorkQueue;
2599 vector<uint256> vEraseQueue;
2600 CDataStream vMsg(vRecv);
2605 CInv inv(MSG_TX, tx.GetHash());
2606 pfrom->AddInventoryKnown(inv);
2608 bool fMissingInputs = false;
2609 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2611 SyncWithWallets(tx, NULL, true);
2612 RelayMessage(inv, vMsg);
2613 mapAlreadyAskedFor.erase(inv);
2614 vWorkQueue.push_back(inv.hash);
2615 vEraseQueue.push_back(inv.hash);
2617 // Recursively process any orphan transactions that depended on this one
2618 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2620 uint256 hashPrev = vWorkQueue[i];
2621 for (map<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
2622 mi != mapOrphanTransactionsByPrev[hashPrev].end();
2625 const CDataStream& vMsg = *((*mi).second);
2627 CDataStream(vMsg) >> tx;
2628 CInv inv(MSG_TX, tx.GetHash());
2629 bool fMissingInputs2 = false;
2631 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
2633 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2634 SyncWithWallets(tx, NULL, true);
2635 RelayMessage(inv, vMsg);
2636 mapAlreadyAskedFor.erase(inv);
2637 vWorkQueue.push_back(inv.hash);
2638 vEraseQueue.push_back(inv.hash);
2640 else if (!fMissingInputs2)
2643 vEraseQueue.push_back(inv.hash);
2644 printf(" removed invalid orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2649 BOOST_FOREACH(uint256 hash, vEraseQueue)
2650 EraseOrphanTx(hash);
2652 else if (fMissingInputs)
2656 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2657 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2659 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
2661 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2665 else if (strCommand == "block")
2670 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2673 CInv inv(MSG_BLOCK, block.GetHash());
2674 pfrom->AddInventoryKnown(inv);
2676 if (ProcessBlock(pfrom, &block))
2677 mapAlreadyAskedFor.erase(inv);
2678 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2682 else if (strCommand == "getaddr")
2684 pfrom->vAddrToSend.clear();
2685 vector<CAddress> vAddr = addrman.GetAddr();
2686 BOOST_FOREACH(const CAddress &addr, vAddr)
2687 pfrom->PushAddress(addr);
2691 else if (strCommand == "checkorder")
2696 if (!GetBoolArg("-allowreceivebyip"))
2698 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2705 /// we have a chance to check the order here
2707 // Keep giving the same key to the same ip until they use it
2708 if (!mapReuseKey.count(pfrom->addr))
2709 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2711 // Send back approval of order and pubkey to use
2712 CScript scriptPubKey;
2713 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2714 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2718 else if (strCommand == "reply")
2723 CRequestTracker tracker;
2725 LOCK(pfrom->cs_mapRequests);
2726 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2727 if (mi != pfrom->mapRequests.end())
2729 tracker = (*mi).second;
2730 pfrom->mapRequests.erase(mi);
2733 if (!tracker.IsNull())
2734 tracker.fn(tracker.param1, vRecv);
2738 else if (strCommand == "ping")
2740 if (pfrom->nVersion > BIP0031_VERSION)
2744 // Echo the message back with the nonce. This allows for two useful features:
2746 // 1) A remote node can quickly check if the connection is operational
2747 // 2) Remote nodes can measure the latency of the network thread. If this node
2748 // is overloaded it won't respond to pings quickly and the remote node can
2749 // avoid sending us more work, like chain download requests.
2751 // The nonce stops the remote getting confused between different pings: without
2752 // it, if the remote node sends a ping once per second and this node takes 5
2753 // seconds to respond to each, the 5th ping the remote sends would appear to
2754 // return very quickly.
2755 pfrom->PushMessage("pong", nonce);
2760 else if (strCommand == "alert")
2765 if (alert.ProcessAlert())
2768 pfrom->setKnown.insert(alert.GetHash());
2771 BOOST_FOREACH(CNode* pnode, vNodes)
2772 alert.RelayTo(pnode);
2780 // Ignore unknown commands for extensibility
2784 // Update the last seen time for this node's address
2785 if (pfrom->fNetworkNode)
2786 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2787 AddressCurrentlyConnected(pfrom->addr);
2793 bool ProcessMessages(CNode* pfrom)
2795 CDataStream& vRecv = pfrom->vRecv;
2799 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2803 // (4) message start
2812 // Scan for message start
2813 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2814 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2815 if (vRecv.end() - pstart < nHeaderSize)
2817 if ((int)vRecv.size() > nHeaderSize)
2819 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2820 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2824 if (pstart - vRecv.begin() > 0)
2825 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2826 vRecv.erase(vRecv.begin(), pstart);
2829 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2834 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2837 string strCommand = hdr.GetCommand();
2840 unsigned int nMessageSize = hdr.nMessageSize;
2841 if (nMessageSize > MAX_SIZE)
2843 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2846 if (nMessageSize > vRecv.size())
2848 // Rewind and wait for rest of message
2849 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2854 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2855 unsigned int nChecksum = 0;
2856 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2857 if (nChecksum != hdr.nChecksum)
2859 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2860 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2864 // Copy message to its own buffer
2865 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2866 vRecv.ignore(nMessageSize);
2874 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2879 catch (std::ios_base::failure& e)
2881 if (strstr(e.what(), "end of data"))
2883 // Allow exceptions from underlength message on vRecv
2884 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2886 else if (strstr(e.what(), "size too large"))
2888 // Allow exceptions from overlong size
2889 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2893 PrintExceptionContinue(&e, "ProcessMessages()");
2896 catch (std::exception& e) {
2897 PrintExceptionContinue(&e, "ProcessMessages()");
2899 PrintExceptionContinue(NULL, "ProcessMessages()");
2903 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2911 bool SendMessages(CNode* pto, bool fSendTrickle)
2913 TRY_LOCK(cs_main, lockMain);
2915 // Don't send anything until we get their version message
2916 if (pto->nVersion == 0)
2919 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
2921 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
2923 if (pto->nVersion > BIP0031_VERSION)
2924 pto->PushMessage("ping", nonce);
2926 pto->PushMessage("ping");
2929 // Resend wallet transactions that haven't gotten in a block yet
2930 ResendWalletTransactions();
2932 // Address refresh broadcast
2933 static int64 nLastRebroadcast;
2934 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2938 BOOST_FOREACH(CNode* pnode, vNodes)
2940 // Periodically clear setAddrKnown to allow refresh broadcasts
2941 if (nLastRebroadcast)
2942 pnode->setAddrKnown.clear();
2944 // Rebroadcast our address
2945 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2947 CAddress addr(addrLocalHost);
2948 addr.nTime = GetAdjustedTime();
2949 pnode->PushAddress(addr);
2953 nLastRebroadcast = GetTime();
2961 vector<CAddress> vAddr;
2962 vAddr.reserve(pto->vAddrToSend.size());
2963 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2965 // returns true if wasn't already contained in the set
2966 if (pto->setAddrKnown.insert(addr).second)
2968 vAddr.push_back(addr);
2969 // receiver rejects addr messages larger than 1000
2970 if (vAddr.size() >= 1000)
2972 pto->PushMessage("addr", vAddr);
2977 pto->vAddrToSend.clear();
2979 pto->PushMessage("addr", vAddr);
2984 // Message: inventory
2987 vector<CInv> vInvWait;
2989 LOCK(pto->cs_inventory);
2990 vInv.reserve(pto->vInventoryToSend.size());
2991 vInvWait.reserve(pto->vInventoryToSend.size());
2992 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2994 if (pto->setInventoryKnown.count(inv))
2997 // trickle out tx inv to protect privacy
2998 if (inv.type == MSG_TX && !fSendTrickle)
3000 // 1/4 of tx invs blast to all immediately
3001 static uint256 hashSalt;
3003 hashSalt = GetRandHash();
3004 uint256 hashRand = inv.hash ^ hashSalt;
3005 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3006 bool fTrickleWait = ((hashRand & 3) != 0);
3008 // always trickle our own transactions
3012 if (GetTransaction(inv.hash, wtx))
3014 fTrickleWait = true;
3019 vInvWait.push_back(inv);
3024 // returns true if wasn't already contained in the set
3025 if (pto->setInventoryKnown.insert(inv).second)
3027 vInv.push_back(inv);
3028 if (vInv.size() >= 1000)
3030 pto->PushMessage("inv", vInv);
3035 pto->vInventoryToSend = vInvWait;
3038 pto->PushMessage("inv", vInv);
3044 vector<CInv> vGetData;
3045 int64 nNow = GetTime() * 1000000;
3047 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3049 const CInv& inv = (*pto->mapAskFor.begin()).second;
3050 if (!AlreadyHave(txdb, inv))
3052 printf("sending getdata: %s\n", inv.ToString().c_str());
3053 vGetData.push_back(inv);
3054 if (vGetData.size() >= 1000)
3056 pto->PushMessage("getdata", vGetData);
3060 mapAlreadyAskedFor[inv] = nNow;
3061 pto->mapAskFor.erase(pto->mapAskFor.begin());
3063 if (!vGetData.empty())
3064 pto->PushMessage("getdata", vGetData);
3083 //////////////////////////////////////////////////////////////////////////////
3088 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3090 unsigned char* pdata = (unsigned char*)pbuffer;
3091 unsigned int blocks = 1 + ((len + 8) / 64);
3092 unsigned char* pend = pdata + 64 * blocks;
3093 memset(pdata + len, 0, 64 * blocks - len);
3095 unsigned int bits = len * 8;
3096 pend[-1] = (bits >> 0) & 0xff;
3097 pend[-2] = (bits >> 8) & 0xff;
3098 pend[-3] = (bits >> 16) & 0xff;
3099 pend[-4] = (bits >> 24) & 0xff;
3103 static const unsigned int pSHA256InitState[8] =
3104 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3106 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3109 unsigned char data[64];
3113 for (int i = 0; i < 16; i++)
3114 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3116 for (int i = 0; i < 8; i++)
3117 ctx.h[i] = ((uint32_t*)pinit)[i];
3119 SHA256_Update(&ctx, data, sizeof(data));
3120 for (int i = 0; i < 8; i++)
3121 ((uint32_t*)pstate)[i] = ctx.h[i];
3125 // ScanHash scans nonces looking for a hash with at least some zero bits.
3126 // It operates on big endian data. Caller does the byte reversing.
3127 // All input buffers are 16-byte aligned. nNonce is usually preserved
3128 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3129 // the block is rebuilt and nNonce starts over at zero.
3131 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3133 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3137 // Hash pdata using pmidstate as the starting state into
3138 // preformatted buffer phash1, then hash phash1 into phash
3140 SHA256Transform(phash1, pdata, pmidstate);
3141 SHA256Transform(phash, phash1, pSHA256InitState);
3143 // Return the nonce if the hash has at least some zero bits,
3144 // caller will check if it has enough to reach the target
3145 if (((unsigned short*)phash)[14] == 0)
3148 // If nothing found after trying for a while, return -1
3149 if ((nNonce & 0xffff) == 0)
3151 nHashesDone = 0xffff+1;
3152 return (unsigned int) -1;
3157 // Some explaining would be appreciated
3162 set<uint256> setDependsOn;
3165 COrphan(CTransaction* ptxIn)
3173 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3174 BOOST_FOREACH(uint256 hash, setDependsOn)
3175 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3180 uint64 nLastBlockTx = 0;
3181 uint64 nLastBlockSize = 0;
3183 CBlock* CreateNewBlock(CReserveKey& reservekey)
3185 CBlockIndex* pindexPrev = pindexBest;
3188 auto_ptr<CBlock> pblock(new CBlock());
3192 // Create coinbase tx
3194 txNew.vin.resize(1);
3195 txNew.vin[0].prevout.SetNull();
3196 txNew.vout.resize(1);
3197 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3199 // Add our coinbase tx as first transaction
3200 pblock->vtx.push_back(txNew);
3202 // Collect memory pool transactions into the block
3205 LOCK2(cs_main, mempool.cs);
3208 // Priority order to process transactions
3209 list<COrphan> vOrphan; // list memory doesn't move
3210 map<uint256, vector<COrphan*> > mapDependers;
3211 multimap<double, CTransaction*> mapPriority;
3212 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
3214 CTransaction& tx = (*mi).second;
3215 if (tx.IsCoinBase() || !tx.IsFinal())
3218 COrphan* porphan = NULL;
3219 double dPriority = 0;
3220 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3222 // Read prev transaction
3223 CTransaction txPrev;
3225 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3227 // Has to wait for dependencies
3230 // Use list for automatic deletion
3231 vOrphan.push_back(COrphan(&tx));
3232 porphan = &vOrphan.back();
3234 mapDependers[txin.prevout.hash].push_back(porphan);
3235 porphan->setDependsOn.insert(txin.prevout.hash);
3238 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3240 // Read block header
3241 int nConf = txindex.GetDepthInMainChain();
3243 dPriority += (double)nValueIn * nConf;
3245 if (fDebug && GetBoolArg("-printpriority"))
3246 printf("priority nValueIn=%-12"PRI64d" nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3249 // Priority is sum(valuein * age) / txsize
3250 dPriority /= ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3253 porphan->dPriority = dPriority;
3255 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3257 if (fDebug && GetBoolArg("-printpriority"))
3259 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3266 // Collect transactions into block
3267 map<uint256, CTxIndex> mapTestPool;
3268 uint64 nBlockSize = 1000;
3269 uint64 nBlockTx = 0;
3270 int nBlockSigOps = 100;
3271 while (!mapPriority.empty())
3273 // Take highest priority transaction off priority queue
3274 double dPriority = -(*mapPriority.begin()).first;
3275 CTransaction& tx = *(*mapPriority.begin()).second;
3276 mapPriority.erase(mapPriority.begin());
3279 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3280 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3283 // Legacy limits on sigOps:
3284 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
3285 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3288 // Transaction fee required depends on block size
3289 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3290 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3292 // Connecting shouldn't fail due to dependency on other memory pool transactions
3293 // because we're already processing them in order of dependency
3294 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3295 MapPrevTx mapInputs;
3297 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3300 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3301 if (nTxFees < nMinFee)
3304 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3305 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3308 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3310 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3311 swap(mapTestPool, mapTestPoolTmp);
3314 pblock->vtx.push_back(tx);
3315 nBlockSize += nTxSize;
3317 nBlockSigOps += nTxSigOps;
3320 // Add transactions that depend on this one to the priority queue
3321 uint256 hash = tx.GetHash();
3322 if (mapDependers.count(hash))
3324 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3326 if (!porphan->setDependsOn.empty())
3328 porphan->setDependsOn.erase(hash);
3329 if (porphan->setDependsOn.empty())
3330 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3336 nLastBlockTx = nBlockTx;
3337 nLastBlockSize = nBlockSize;
3338 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3341 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3344 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3345 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3346 pblock->UpdateTime(pindexPrev);
3347 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3350 return pblock.release();
3354 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3356 // Update nExtraNonce
3357 static uint256 hashPrevBlock;
3358 if (hashPrevBlock != pblock->hashPrevBlock)
3361 hashPrevBlock = pblock->hashPrevBlock;
3364 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3365 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3367 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3371 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3374 // Prebuild hash buffers
3381 uint256 hashPrevBlock;
3382 uint256 hashMerkleRoot;
3385 unsigned int nNonce;
3388 unsigned char pchPadding0[64];
3390 unsigned char pchPadding1[64];
3393 memset(&tmp, 0, sizeof(tmp));
3395 tmp.block.nVersion = pblock->nVersion;
3396 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3397 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3398 tmp.block.nTime = pblock->nTime;
3399 tmp.block.nBits = pblock->nBits;
3400 tmp.block.nNonce = pblock->nNonce;
3402 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3403 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3405 // Byte swap all the input buffer
3406 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
3407 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3409 // Precalc the first half of the first hash, which stays constant
3410 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3412 memcpy(pdata, &tmp.block, 128);
3413 memcpy(phash1, &tmp.hash1, 64);
3417 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3419 uint256 hash = pblock->GetHash();
3420 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3422 if (hash > hashTarget)
3426 printf("BitcoinMiner:\n");
3427 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3429 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3430 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3435 if (pblock->hashPrevBlock != hashBestChain)
3436 return error("BitcoinMiner : generated block is stale");
3438 // Remove key from key pool
3439 reservekey.KeepKey();
3441 // Track how many getdata requests this block gets
3443 LOCK(wallet.cs_wallet);
3444 wallet.mapRequestCount[pblock->GetHash()] = 0;
3447 // Process this block the same as if we had received it from another node
3448 if (!ProcessBlock(NULL, pblock))
3449 return error("BitcoinMiner : ProcessBlock, block not accepted");
3455 void static ThreadBitcoinMiner(void* parg);
3457 static bool fGenerateBitcoins = false;
3458 static bool fLimitProcessors = false;
3459 static int nLimitProcessors = -1;
3461 void static BitcoinMiner(CWallet *pwallet)
3463 printf("BitcoinMiner started\n");
3464 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3466 // Each thread has its own key and counter
3467 CReserveKey reservekey(pwallet);
3468 unsigned int nExtraNonce = 0;
3470 while (fGenerateBitcoins)
3474 while (vNodes.empty() || IsInitialBlockDownload())
3479 if (!fGenerateBitcoins)
3487 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3488 CBlockIndex* pindexPrev = pindexBest;
3490 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3493 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3495 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3499 // Prebuild hash buffers
3501 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3502 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3503 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3505 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3507 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3508 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3509 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3515 int64 nStart = GetTime();
3516 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3518 uint256& hash = *alignup<16>(hashbuf);
3521 unsigned int nHashesDone = 0;
3522 unsigned int nNonceFound;
3525 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3526 (char*)&hash, nHashesDone);
3528 // Check if something found
3529 if (nNonceFound != (unsigned int) -1)
3531 for (unsigned int i = 0; i < sizeof(hash)/4; i++)
3532 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3534 if (hash <= hashTarget)
3537 pblock->nNonce = ByteReverse(nNonceFound);
3538 assert(hash == pblock->GetHash());
3540 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3541 CheckWork(pblock.get(), *pwalletMain, reservekey);
3542 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3548 static int64 nHashCounter;
3549 if (nHPSTimerStart == 0)
3551 nHPSTimerStart = GetTimeMillis();
3555 nHashCounter += nHashesDone;
3556 if (GetTimeMillis() - nHPSTimerStart > 4000)
3558 static CCriticalSection cs;
3561 if (GetTimeMillis() - nHPSTimerStart > 4000)
3563 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3564 nHPSTimerStart = GetTimeMillis();
3566 static int64 nLogTime;
3567 if (GetTime() - nLogTime > 30 * 60)
3569 nLogTime = GetTime();
3570 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3571 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3577 // Check for stop or if block needs to be rebuilt
3580 if (!fGenerateBitcoins)
3582 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3586 if (nBlockNonce >= 0xffff0000)
3588 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3590 if (pindexPrev != pindexBest)
3593 // Update nTime every few seconds
3594 pblock->UpdateTime(pindexPrev);
3595 nBlockTime = ByteReverse(pblock->nTime);
3598 // Changing pblock->nTime can change work required on testnet:
3599 nBlockBits = ByteReverse(pblock->nBits);
3600 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3606 void static ThreadBitcoinMiner(void* parg)
3608 CWallet* pwallet = (CWallet*)parg;
3611 vnThreadsRunning[THREAD_MINER]++;
3612 BitcoinMiner(pwallet);
3613 vnThreadsRunning[THREAD_MINER]--;
3615 catch (std::exception& e) {
3616 vnThreadsRunning[THREAD_MINER]--;
3617 PrintException(&e, "ThreadBitcoinMiner()");
3619 vnThreadsRunning[THREAD_MINER]--;
3620 PrintException(NULL, "ThreadBitcoinMiner()");
3623 if (vnThreadsRunning[THREAD_MINER] == 0)
3625 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3629 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3631 fGenerateBitcoins = fGenerate;
3632 nLimitProcessors = GetArg("-genproclimit", -1);
3633 if (nLimitProcessors == 0)
3634 fGenerateBitcoins = false;
3635 fLimitProcessors = (nLimitProcessors != -1);
3639 int nProcessors = boost::thread::hardware_concurrency();
3640 printf("%d processors\n", nProcessors);
3641 if (nProcessors < 1)
3643 if (fLimitProcessors && nProcessors > nLimitProcessors)
3644 nProcessors = nLimitProcessors;
3645 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3646 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3647 for (int i = 0; i < nAddThreads; i++)
3649 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3650 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");