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 license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include <boost/algorithm/string/replace.hpp>
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 // Name of client reported in the 'version' message. Report the same name
22 // for both bitcoind and bitcoin-qt, to make it harder for attackers to
23 // target servers or GUI users specifically.
24 const std::string CLIENT_NAME("Satoshi");
26 CCriticalSection cs_setpwalletRegistered;
27 set<CWallet*> setpwalletRegistered;
29 CCriticalSection cs_main;
31 static map<uint256, CTransaction> mapTransactions;
32 CCriticalSection cs_mapTransactions;
33 unsigned int nTransactionsUpdated = 0;
34 map<COutPoint, CInPoint> mapNextTx;
36 map<uint256, CBlockIndex*> mapBlockIndex;
37 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
38 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
39 CBlockIndex* pindexGenesisBlock = NULL;
41 CBigNum bnBestChainWork = 0;
42 CBigNum bnBestInvalidWork = 0;
43 uint256 hashBestChain = 0;
44 CBlockIndex* pindexBest = NULL;
45 int64 nTimeBestReceived = 0;
47 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
49 map<uint256, CBlock*> mapOrphanBlocks;
50 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
52 map<uint256, CDataStream*> mapOrphanTransactions;
53 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
55 // Constant stuff for coinbase transactions we create:
56 CScript COINBASE_FLAGS;
58 const string strMessageMagic = "Bitcoin Signed Message:\n";
64 int64 nTransactionFee = 0;
68 //////////////////////////////////////////////////////////////////////////////
70 // dispatching functions
73 // These functions dispatch to one or all registered wallets
76 void RegisterWallet(CWallet* pwalletIn)
78 CRITICAL_BLOCK(cs_setpwalletRegistered)
80 setpwalletRegistered.insert(pwalletIn);
84 void UnregisterWallet(CWallet* pwalletIn)
86 CRITICAL_BLOCK(cs_setpwalletRegistered)
88 setpwalletRegistered.erase(pwalletIn);
92 // check whether the passed transaction is from us
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 // get the wallet transaction with the given hash (if it exists)
102 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
104 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
105 if (pwallet->GetTransaction(hashTx,wtx))
110 // erases transaction with the given hash from all wallets
111 void static EraseFromWallets(uint256 hash)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 pwallet->EraseFromWallet(hash);
117 // make sure all wallets know about the given transaction, in the given block
118 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
120 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
121 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
124 // notify wallets about a new best chain
125 void static SetBestChain(const CBlockLocator& loc)
127 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
128 pwallet->SetBestChain(loc);
131 // notify wallets about an updated transaction
132 void static UpdatedTransaction(const uint256& hashTx)
134 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
135 pwallet->UpdatedTransaction(hashTx);
139 void static PrintWallets(const CBlock& block)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->PrintWallet(block);
145 // notify wallets about an incoming inventory (for request counts)
146 void static Inventory(const uint256& hash)
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->Inventory(hash);
152 // ask wallets to resend their transactions
153 void static ResendWalletTransactions()
155 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
156 pwallet->ResendWalletTransactions();
165 //////////////////////////////////////////////////////////////////////////////
167 // mapOrphanTransactions
170 void AddOrphanTx(const CDataStream& vMsg)
173 CDataStream(vMsg) >> tx;
174 uint256 hash = tx.GetHash();
175 if (mapOrphanTransactions.count(hash))
178 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
179 BOOST_FOREACH(const CTxIn& txin, tx.vin)
180 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
183 void static EraseOrphanTx(uint256 hash)
185 if (!mapOrphanTransactions.count(hash))
187 const CDataStream* pvMsg = mapOrphanTransactions[hash];
189 CDataStream(*pvMsg) >> tx;
190 BOOST_FOREACH(const CTxIn& txin, tx.vin)
192 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
193 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
195 if ((*mi).second == pvMsg)
196 mapOrphanTransactionsByPrev.erase(mi++);
202 mapOrphanTransactions.erase(hash);
205 int LimitOrphanTxSize(int nMaxOrphans)
208 while (mapOrphanTransactions.size() > nMaxOrphans)
210 // Evict a random orphan:
211 std::vector<unsigned char> randbytes(32);
212 RAND_bytes(&randbytes[0], 32);
213 uint256 randomhash(randbytes);
214 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
215 if (it == mapOrphanTransactions.end())
216 it = mapOrphanTransactions.begin();
217 EraseOrphanTx(it->first);
229 //////////////////////////////////////////////////////////////////////////////
231 // CTransaction and CTxIndex
234 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
237 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
239 if (!ReadFromDisk(txindexRet.pos))
241 if (prevout.n >= vout.size())
249 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
252 return ReadFromDisk(txdb, prevout, txindex);
255 bool CTransaction::ReadFromDisk(COutPoint prevout)
259 return ReadFromDisk(txdb, prevout, txindex);
262 bool CTransaction::IsStandard() const
264 BOOST_FOREACH(const CTxIn& txin, vin)
266 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
267 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
268 // ~65-byte public keys, plus a few script ops.
269 if (txin.scriptSig.size() > 500)
271 if (!txin.scriptSig.IsPushOnly())
274 BOOST_FOREACH(const CTxOut& txout, vout)
275 if (!::IsStandard(txout.scriptPubKey))
281 // Check transaction inputs, and make sure any
282 // pay-to-script-hash transactions are evaluating IsStandard scripts
284 // Why bother? To avoid denial-of-service attacks; an attacker
285 // can submit a standard HASH... OP_EQUAL transaction,
286 // which will get accepted into blocks. The redemption
287 // script can be anything; an attacker could use a very
288 // expensive-to-check-upon-redemption script like:
289 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
291 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
294 return true; // Coinbases don't use vin normally
296 for (unsigned int i = 0; i < vin.size(); i++)
298 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
300 vector<vector<unsigned char> > vSolutions;
301 txnouttype whichType;
302 // get the scriptPubKey corresponding to this input:
303 const CScript& prevScript = prev.scriptPubKey;
304 if (!Solver(prevScript, whichType, vSolutions))
306 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
307 if (nArgsExpected < 0)
310 // Transactions with extra stuff in their scriptSigs are
311 // non-standard. Note that this EvalScript() call will
312 // be quick, because if there are any operations
313 // beside "push data" in the scriptSig the
314 // IsStandard() call returns false
315 vector<vector<unsigned char> > stack;
316 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
319 if (whichType == TX_SCRIPTHASH)
323 CScript subscript(stack.back().begin(), stack.back().end());
324 vector<vector<unsigned char> > vSolutions2;
325 txnouttype whichType2;
326 if (!Solver(subscript, whichType2, vSolutions2))
328 if (whichType2 == TX_SCRIPTHASH)
332 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
335 nArgsExpected += tmpExpected;
338 if (stack.size() != (unsigned int)nArgsExpected)
346 CTransaction::GetLegacySigOpCount() const
349 BOOST_FOREACH(const CTxIn& txin, vin)
351 nSigOps += txin.scriptSig.GetSigOpCount(false);
353 BOOST_FOREACH(const CTxOut& txout, vout)
355 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
361 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
373 // Load the block this tx is in
375 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
377 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
382 // Update the tx's hashBlock
383 hashBlock = pblock->GetHash();
385 // Locate the transaction
386 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
387 if (pblock->vtx[nIndex] == *(CTransaction*)this)
389 if (nIndex == pblock->vtx.size())
391 vMerkleBranch.clear();
393 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
397 // Fill in merkle branch
398 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
401 // Is the tx in a block that's in the main chain
402 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
403 if (mi == mapBlockIndex.end())
405 CBlockIndex* pindex = (*mi).second;
406 if (!pindex || !pindex->IsInMainChain())
409 return pindexBest->nHeight - pindex->nHeight + 1;
418 bool CTransaction::CheckTransaction() const
420 // Basic checks that don't depend on any context
422 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
424 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
426 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
427 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
429 // Check for negative or overflow output values
431 BOOST_FOREACH(const CTxOut& txout, vout)
433 if (txout.nValue < 0)
434 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
435 if (txout.nValue > MAX_MONEY)
436 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
437 nValueOut += txout.nValue;
438 if (!MoneyRange(nValueOut))
439 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
442 // Check for duplicate inputs
443 set<COutPoint> vInOutPoints;
444 BOOST_FOREACH(const CTxIn& txin, vin)
446 if (vInOutPoints.count(txin.prevout))
448 vInOutPoints.insert(txin.prevout);
453 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
454 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
458 BOOST_FOREACH(const CTxIn& txin, vin)
459 if (txin.prevout.IsNull())
460 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
466 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
469 *pfMissingInputs = false;
471 if (!CheckTransaction())
472 return error("AcceptToMemoryPool() : CheckTransaction failed");
474 // Coinbase is only valid in a block, not as a loose transaction
476 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
478 // To help v0.1.5 clients who would see it as a negative number
479 if ((int64)nLockTime > std::numeric_limits<int>::max())
480 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
482 // Rather not work on nonstandard transactions (unless -testnet)
483 if (!fTestNet && !IsStandard())
484 return error("AcceptToMemoryPool() : nonstandard transaction type");
486 // Do we already have it?
487 uint256 hash = GetHash();
488 CRITICAL_BLOCK(cs_mapTransactions)
489 if (mapTransactions.count(hash))
492 if (txdb.ContainsTx(hash))
495 // Check for conflicts with in-memory transactions
496 CTransaction* ptxOld = NULL;
497 for (unsigned int i = 0; i < vin.size(); i++)
499 COutPoint outpoint = vin[i].prevout;
500 if (mapNextTx.count(outpoint))
502 // Disable replacement feature for now
505 // Allow replacing with a newer version of the same transaction
508 ptxOld = mapNextTx[outpoint].ptx;
509 if (ptxOld->IsFinal())
511 if (!IsNewerThan(*ptxOld))
513 for (unsigned int i = 0; i < vin.size(); i++)
515 COutPoint outpoint = vin[i].prevout;
516 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
526 map<uint256, CTxIndex> mapUnused;
527 bool fInvalid = false;
528 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
531 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
533 *pfMissingInputs = true;
534 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
537 // Check for non-standard pay-to-script-hash in inputs
538 if (!AreInputsStandard(mapInputs) && !fTestNet)
539 return error("AcceptToMemoryPool() : nonstandard transaction input");
541 // Note: if you modify this code to accept non-standard transactions, then
542 // you should add code here to check that the transaction does a
543 // reasonable number of ECDSA signature verifications.
545 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
546 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
548 // Don't accept it if it can't get into a block
549 if (nFees < GetMinFee(1000, true, GMF_RELAY))
550 return error("AcceptToMemoryPool() : not enough fees");
552 // Continuously rate-limit free transactions
553 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
554 // be annoying or make other's transactions take longer to confirm.
555 if (nFees < MIN_RELAY_TX_FEE)
557 static CCriticalSection cs;
558 static double dFreeCount;
559 static int64 nLastTime;
560 int64 nNow = GetTime();
564 // Use an exponentially decaying ~10-minute window:
565 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
567 // -limitfreerelay unit is thousand-bytes-per-minute
568 // At default rate it would take over a month to fill 1GB
569 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
570 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
572 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
577 // Check against previous transactions
578 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
579 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
581 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
585 // Store transaction in memory
586 CRITICAL_BLOCK(cs_mapTransactions)
590 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
591 ptxOld->RemoveFromMemoryPool();
593 AddToMemoryPoolUnchecked();
596 ///// are we sure this is ok when loading transactions or restoring block txes
597 // If updated, erase old tx from wallet
599 EraseFromWallets(ptxOld->GetHash());
601 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
605 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
608 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
611 uint64 nPooledTx = 0;
613 bool CTransaction::AddToMemoryPoolUnchecked()
615 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
616 // Add to memory pool without checking anything. Don't call this directly,
617 // call AcceptToMemoryPool to properly check the transaction first.
618 CRITICAL_BLOCK(cs_mapTransactions)
620 uint256 hash = GetHash();
621 mapTransactions[hash] = *this;
622 for (unsigned int i = 0; i < vin.size(); i++)
623 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
624 nTransactionsUpdated++;
631 bool CTransaction::RemoveFromMemoryPool()
633 // Remove transaction from memory pool
634 CRITICAL_BLOCK(cs_mapTransactions)
636 uint256 hash = GetHash();
637 if (mapTransactions.count(hash))
639 BOOST_FOREACH(const CTxIn& txin, vin)
640 mapNextTx.erase(txin.prevout);
641 mapTransactions.erase(hash);
642 nTransactionsUpdated++;
654 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
656 if (hashBlock == 0 || nIndex == -1)
659 // Find the block it claims to be in
660 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
661 if (mi == mapBlockIndex.end())
663 CBlockIndex* pindex = (*mi).second;
664 if (!pindex || !pindex->IsInMainChain())
667 // Make sure the merkle branch connects to this block
668 if (!fMerkleVerified)
670 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
672 fMerkleVerified = true;
676 return pindexBest->nHeight - pindex->nHeight + 1;
680 int CMerkleTx::GetBlocksToMaturity() const
684 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
688 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
692 if (!IsInMainChain() && !ClientConnectInputs())
694 return CTransaction::AcceptToMemoryPool(txdb, false);
698 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
702 bool CMerkleTx::AcceptToMemoryPool()
705 return AcceptToMemoryPool(txdb);
710 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
712 CRITICAL_BLOCK(cs_mapTransactions)
714 // Add previous supporting transactions first
715 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
717 if (!tx.IsCoinBase())
719 uint256 hash = tx.GetHash();
720 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
721 tx.AcceptToMemoryPool(txdb, fCheckInputs);
724 return AcceptToMemoryPool(txdb, fCheckInputs);
729 bool CWalletTx::AcceptWalletTransaction()
732 return AcceptWalletTransaction(txdb);
735 int CTxIndex::GetDepthInMainChain() const
739 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
741 // Find the block in the index
742 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
743 if (mi == mapBlockIndex.end())
745 CBlockIndex* pindex = (*mi).second;
746 if (!pindex || !pindex->IsInMainChain())
748 return 1 + nBestHeight - pindex->nHeight;
760 //////////////////////////////////////////////////////////////////////////////
762 // CBlock and CBlockIndex
765 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
767 if (!fReadTransactions)
769 *this = pindex->GetBlockHeader();
772 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
774 if (GetHash() != pindex->GetBlockHash())
775 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
779 uint256 static GetOrphanRoot(const CBlock* pblock)
781 // Work back to the first block in the orphan chain
782 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
783 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
784 return pblock->GetHash();
787 int64 static GetBlockValue(int nHeight, int64 nFees)
789 int64 nSubsidy = 50 * COIN;
791 // Subsidy is cut in half every 4 years
792 nSubsidy >>= (nHeight / 210000);
794 return nSubsidy + nFees;
797 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
798 static const int64 nTargetSpacing = 10 * 60;
799 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
802 // minimum amount of work that could possibly be required nTime after
803 // minimum work required was nBase
805 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
807 // Testnet has min-difficulty blocks
808 // after nTargetSpacing*2 time between blocks:
809 if (fTestNet && nTime > nTargetSpacing*2)
810 return bnProofOfWorkLimit.GetCompact();
813 bnResult.SetCompact(nBase);
814 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
816 // Maximum 400% adjustment...
818 // ... in best-case exactly 4-times-normal target time
819 nTime -= nTargetTimespan*4;
821 if (bnResult > bnProofOfWorkLimit)
822 bnResult = bnProofOfWorkLimit;
823 return bnResult.GetCompact();
826 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
828 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
831 if (pindexLast == NULL)
832 return nProofOfWorkLimit;
834 // Only change once per interval
835 if ((pindexLast->nHeight+1) % nInterval != 0)
837 // Special rules for testnet after 15 Feb 2012:
838 if (fTestNet && pblock->nTime > 1329264000)
840 // If the new block's timestamp is more than 2* 10 minutes
841 // then allow mining of a min-difficulty block.
842 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
843 return nProofOfWorkLimit;
846 // Return the last non-special-min-difficulty-rules-block
847 const CBlockIndex* pindex = pindexLast;
848 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
849 pindex = pindex->pprev;
850 return pindex->nBits;
854 return pindexLast->nBits;
857 // Go back by what we want to be 14 days worth of blocks
858 const CBlockIndex* pindexFirst = pindexLast;
859 for (int i = 0; pindexFirst && i < nInterval-1; i++)
860 pindexFirst = pindexFirst->pprev;
863 // Limit adjustment step
864 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
865 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
866 if (nActualTimespan < nTargetTimespan/4)
867 nActualTimespan = nTargetTimespan/4;
868 if (nActualTimespan > nTargetTimespan*4)
869 nActualTimespan = nTargetTimespan*4;
873 bnNew.SetCompact(pindexLast->nBits);
874 bnNew *= nActualTimespan;
875 bnNew /= nTargetTimespan;
877 if (bnNew > bnProofOfWorkLimit)
878 bnNew = bnProofOfWorkLimit;
881 printf("GetNextWorkRequired RETARGET\n");
882 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
883 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
884 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
886 return bnNew.GetCompact();
889 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
892 bnTarget.SetCompact(nBits);
895 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
896 return error("CheckProofOfWork() : nBits below minimum work");
898 // Check proof of work matches claimed amount
899 if (hash > bnTarget.getuint256())
900 return error("CheckProofOfWork() : hash doesn't match nBits");
905 // Return maximum amount of blocks that other nodes claim to have
906 int GetNumBlocksOfPeers()
908 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
911 bool IsInitialBlockDownload()
913 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
915 static int64 nLastUpdate;
916 static CBlockIndex* pindexLastBest;
917 if (pindexBest != pindexLastBest)
919 pindexLastBest = pindexBest;
920 nLastUpdate = GetTime();
922 return (GetTime() - nLastUpdate < 10 &&
923 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
926 void static InvalidChainFound(CBlockIndex* pindexNew)
928 if (pindexNew->bnChainWork > bnBestInvalidWork)
930 bnBestInvalidWork = pindexNew->bnChainWork;
931 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
934 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());
935 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
936 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
937 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
940 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
942 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
944 // Updating time can change work required on testnet:
946 nBits = GetNextWorkRequired(pindexPrev, this);
959 bool CTransaction::DisconnectInputs(CTxDB& txdb)
961 // Relinquish previous transactions' spent pointers
964 BOOST_FOREACH(const CTxIn& txin, vin)
966 COutPoint prevout = txin.prevout;
968 // Get prev txindex from disk
970 if (!txdb.ReadTxIndex(prevout.hash, txindex))
971 return error("DisconnectInputs() : ReadTxIndex failed");
973 if (prevout.n >= txindex.vSpent.size())
974 return error("DisconnectInputs() : prevout.n out of range");
976 // Mark outpoint as not spent
977 txindex.vSpent[prevout.n].SetNull();
980 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
981 return error("DisconnectInputs() : UpdateTxIndex failed");
985 // Remove transaction from index
986 // This can fail if a duplicate of this transaction was in a chain that got
987 // reorganized away. This is only possible if this transaction was completely
988 // spent, so erasing it would be a no-op anway.
989 txdb.EraseTxIndex(*this);
995 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
996 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
998 // FetchInputs can return false either because we just haven't seen some inputs
999 // (in which case the transaction should be stored as an orphan)
1000 // or because the transaction is malformed (in which case the transaction should
1001 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1005 return true; // Coinbase transactions have no inputs to fetch.
1007 for (unsigned int i = 0; i < vin.size(); i++)
1009 COutPoint prevout = vin[i].prevout;
1010 if (inputsRet.count(prevout.hash))
1011 continue; // Got it already
1014 CTxIndex& txindex = inputsRet[prevout.hash].first;
1016 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1018 // Get txindex from current proposed changes
1019 txindex = mapTestPool.find(prevout.hash)->second;
1023 // Read txindex from txdb
1024 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1026 if (!fFound && (fBlock || fMiner))
1027 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());
1030 CTransaction& txPrev = inputsRet[prevout.hash].second;
1031 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1033 // Get prev tx from single transactions in memory
1034 CRITICAL_BLOCK(cs_mapTransactions)
1036 if (!mapTransactions.count(prevout.hash))
1037 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1038 txPrev = mapTransactions[prevout.hash];
1041 txindex.vSpent.resize(txPrev.vout.size());
1045 // Get prev tx from disk
1046 if (!txPrev.ReadFromDisk(txindex.pos))
1047 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1051 // Make sure all prevout.n's are valid:
1052 for (unsigned int i = 0; i < vin.size(); i++)
1054 const COutPoint prevout = vin[i].prevout;
1055 assert(inputsRet.count(prevout.hash) != 0);
1056 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1057 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1058 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1060 // Revisit this if/when transaction replacement is implemented and allows
1063 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()));
1070 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1072 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1073 if (mi == inputs.end())
1074 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1076 const CTransaction& txPrev = (mi->second).second;
1077 if (input.prevout.n >= txPrev.vout.size())
1078 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1080 return txPrev.vout[input.prevout.n];
1083 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1089 for (unsigned int i = 0; i < vin.size(); i++)
1091 nResult += GetOutputFor(vin[i], inputs).nValue;
1097 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1103 for (unsigned int i = 0; i < vin.size(); i++)
1105 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1106 if (prevout.scriptPubKey.IsPayToScriptHash())
1107 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1112 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1113 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1114 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1116 // Take over previous transactions' spent pointers
1117 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1118 // fMiner is true when called from the internal bitcoin miner
1119 // ... both are false when called from CTransaction::AcceptToMemoryPool
1124 for (unsigned int i = 0; i < vin.size(); i++)
1126 COutPoint prevout = vin[i].prevout;
1127 assert(inputs.count(prevout.hash) > 0);
1128 CTxIndex& txindex = inputs[prevout.hash].first;
1129 CTransaction& txPrev = inputs[prevout.hash].second;
1131 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1132 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()));
1134 // If prev is coinbase, check that it's matured
1135 if (txPrev.IsCoinBase())
1136 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1137 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1138 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1140 // Check for conflicts (double-spend)
1141 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1142 // for an attacker to attempt to split the network.
1143 if (!txindex.vSpent[prevout.n].IsNull())
1144 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());
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"));
1151 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1152 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1153 // still computed and checked, and any change will be caught at the next checkpoint.
1154 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1157 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1159 // only during transition phase for P2SH: do not invoke anti-DoS code for
1160 // potentially old clients relaying bad P2SH transactions
1161 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1162 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1164 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1168 // Mark outpoints as spent
1169 txindex.vSpent[prevout.n] = posThisTx;
1172 if (fBlock || fMiner)
1174 mapTestPool[prevout.hash] = txindex;
1178 if (nValueIn < GetValueOut())
1179 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1181 // Tally transaction fees
1182 int64 nTxFee = nValueIn - GetValueOut();
1184 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1186 if (!MoneyRange(nFees))
1187 return DoS(100, error("ConnectInputs() : nFees out of range"));
1194 bool CTransaction::ClientConnectInputs()
1199 // Take over previous transactions' spent pointers
1200 CRITICAL_BLOCK(cs_mapTransactions)
1203 for (unsigned int i = 0; i < vin.size(); i++)
1205 // Get prev tx from single transactions in memory
1206 COutPoint prevout = vin[i].prevout;
1207 if (!mapTransactions.count(prevout.hash))
1209 CTransaction& txPrev = mapTransactions[prevout.hash];
1211 if (prevout.n >= txPrev.vout.size())
1215 if (!VerifySignature(txPrev, *this, i, true, 0))
1216 return error("ConnectInputs() : VerifySignature failed");
1218 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1219 ///// this has to go away now that posNext is gone
1220 // // Check for conflicts
1221 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1222 // return error("ConnectInputs() : prev tx already used");
1224 // // Flag outpoints as used
1225 // txPrev.vout[prevout.n].posNext = posThisTx;
1227 nValueIn += txPrev.vout[prevout.n].nValue;
1229 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1230 return error("ClientConnectInputs() : txin values out of range");
1232 if (GetValueOut() > nValueIn)
1242 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1244 // Disconnect in reverse order
1245 for (int i = vtx.size()-1; i >= 0; i--)
1246 if (!vtx[i].DisconnectInputs(txdb))
1249 // Update block index on disk without changing it in memory.
1250 // The memory index structure will be changed after the db commits.
1253 CDiskBlockIndex blockindexPrev(pindex->pprev);
1254 blockindexPrev.hashNext = 0;
1255 if (!txdb.WriteBlockIndex(blockindexPrev))
1256 return error("DisconnectBlock() : WriteBlockIndex failed");
1262 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1264 // Check it again in case a previous version let a bad block in
1268 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1269 // unless those are already completely spent.
1270 // If such overwrites are allowed, coinbases and transactions depending upon those
1271 // can be duplicated to remove the ability to spend the first instance -- even after
1272 // being sent to another address.
1273 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1274 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1275 // already refuses previously-known transaction id's entirely.
1276 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1277 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1278 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1280 BOOST_FOREACH(CTransaction& tx, vtx)
1282 CTxIndex txindexOld;
1283 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1285 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1292 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1293 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1294 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1296 //// issue here: it doesn't know the version
1297 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1299 map<uint256, CTxIndex> mapQueuedChanges;
1302 BOOST_FOREACH(CTransaction& tx, vtx)
1304 nSigOps += tx.GetLegacySigOpCount();
1305 if (nSigOps > MAX_BLOCK_SIGOPS)
1306 return DoS(100, error("ConnectBlock() : too many sigops"));
1308 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1309 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1311 MapPrevTx mapInputs;
1312 if (!tx.IsCoinBase())
1315 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1318 if (fStrictPayToScriptHash)
1320 // Add in sigops done by pay-to-script-hash inputs;
1321 // this is to prevent a "rogue miner" from creating
1322 // an incredibly-expensive-to-validate block.
1323 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1324 if (nSigOps > MAX_BLOCK_SIGOPS)
1325 return DoS(100, error("ConnectBlock() : too many sigops"));
1328 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1330 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1334 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1337 // Write queued txindex changes
1338 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1340 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1341 return error("ConnectBlock() : UpdateTxIndex failed");
1344 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1347 // Update block index on disk without changing it in memory.
1348 // The memory index structure will be changed after the db commits.
1351 CDiskBlockIndex blockindexPrev(pindex->pprev);
1352 blockindexPrev.hashNext = pindex->GetBlockHash();
1353 if (!txdb.WriteBlockIndex(blockindexPrev))
1354 return error("ConnectBlock() : WriteBlockIndex failed");
1357 // Watch for transactions paying to me
1358 BOOST_FOREACH(CTransaction& tx, vtx)
1359 SyncWithWallets(tx, this, true);
1364 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1366 printf("REORGANIZE\n");
1369 CBlockIndex* pfork = pindexBest;
1370 CBlockIndex* plonger = pindexNew;
1371 while (pfork != plonger)
1373 while (plonger->nHeight > pfork->nHeight)
1374 if (!(plonger = plonger->pprev))
1375 return error("Reorganize() : plonger->pprev is null");
1376 if (pfork == plonger)
1378 if (!(pfork = pfork->pprev))
1379 return error("Reorganize() : pfork->pprev is null");
1382 // List of what to disconnect
1383 vector<CBlockIndex*> vDisconnect;
1384 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1385 vDisconnect.push_back(pindex);
1387 // List of what to connect
1388 vector<CBlockIndex*> vConnect;
1389 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1390 vConnect.push_back(pindex);
1391 reverse(vConnect.begin(), vConnect.end());
1393 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());
1394 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());
1396 // Disconnect shorter branch
1397 vector<CTransaction> vResurrect;
1398 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1401 if (!block.ReadFromDisk(pindex))
1402 return error("Reorganize() : ReadFromDisk for disconnect failed");
1403 if (!block.DisconnectBlock(txdb, pindex))
1404 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1406 // Queue memory transactions to resurrect
1407 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1408 if (!tx.IsCoinBase())
1409 vResurrect.push_back(tx);
1412 // Connect longer branch
1413 vector<CTransaction> vDelete;
1414 for (unsigned int i = 0; i < vConnect.size(); i++)
1416 CBlockIndex* pindex = vConnect[i];
1418 if (!block.ReadFromDisk(pindex))
1419 return error("Reorganize() : ReadFromDisk for connect failed");
1420 if (!block.ConnectBlock(txdb, pindex))
1424 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1427 // Queue memory transactions to delete
1428 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1429 vDelete.push_back(tx);
1431 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1432 return error("Reorganize() : WriteHashBestChain failed");
1434 // Make sure it's successfully written to disk before changing memory structure
1435 if (!txdb.TxnCommit())
1436 return error("Reorganize() : TxnCommit failed");
1438 // Disconnect shorter branch
1439 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1441 pindex->pprev->pnext = NULL;
1443 // Connect longer branch
1444 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1446 pindex->pprev->pnext = pindex;
1448 // Resurrect memory transactions that were in the disconnected branch
1449 BOOST_FOREACH(CTransaction& tx, vResurrect)
1450 tx.AcceptToMemoryPool(txdb, false);
1452 // Delete redundant memory transactions that are in the connected branch
1453 BOOST_FOREACH(CTransaction& tx, vDelete)
1454 tx.RemoveFromMemoryPool();
1456 printf("REORGANIZE: done\n");
1463 runCommand(std::string strCommand)
1465 int nErr = ::system(strCommand.c_str());
1467 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1470 // Called from inside SetBestChain: attaches a block to the new best chain being built
1471 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1473 uint256 hash = GetHash();
1475 // Adding to current best branch
1476 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1479 InvalidChainFound(pindexNew);
1482 if (!txdb.TxnCommit())
1483 return error("SetBestChain() : TxnCommit failed");
1485 // Add to current best branch
1486 pindexNew->pprev->pnext = pindexNew;
1488 // Delete redundant memory transactions
1489 BOOST_FOREACH(CTransaction& tx, vtx)
1490 tx.RemoveFromMemoryPool();
1495 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1497 uint256 hash = GetHash();
1500 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1502 txdb.WriteHashBestChain(hash);
1503 if (!txdb.TxnCommit())
1504 return error("SetBestChain() : TxnCommit failed");
1505 pindexGenesisBlock = pindexNew;
1507 else if (hashPrevBlock == hashBestChain)
1509 if (!SetBestChainInner(txdb, pindexNew))
1510 return error("SetBestChain() : SetBestChainInner failed");
1514 // the first block in the new chain that will cause it to become the new best chain
1515 CBlockIndex *pindexIntermediate = pindexNew;
1517 // list of blocks that need to be connected afterwards
1518 std::vector<CBlockIndex*> vpindexSecondary;
1520 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1521 // Try to limit how much needs to be done inside
1522 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1524 vpindexSecondary.push_back(pindexIntermediate);
1525 pindexIntermediate = pindexIntermediate->pprev;
1528 if (!vpindexSecondary.empty())
1529 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1531 // Switch to new best branch
1532 if (!Reorganize(txdb, pindexIntermediate))
1535 InvalidChainFound(pindexNew);
1536 return error("SetBestChain() : Reorganize failed");
1539 // Connect futher blocks
1540 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1543 if (!block.ReadFromDisk(pindex))
1545 printf("SetBestChain() : ReadFromDisk failed\n");
1549 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1550 if (!block.SetBestChainInner(txdb, pindex))
1555 // Update best block in wallet (so we can detect restored wallets)
1556 bool fIsInitialDownload = IsInitialBlockDownload();
1557 if (!fIsInitialDownload)
1559 const CBlockLocator locator(pindexNew);
1560 ::SetBestChain(locator);
1564 hashBestChain = hash;
1565 pindexBest = pindexNew;
1566 nBestHeight = pindexBest->nHeight;
1567 bnBestChainWork = pindexNew->bnChainWork;
1568 nTimeBestReceived = GetTime();
1569 nTransactionsUpdated++;
1570 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1572 std::string strCmd = GetArg("-blocknotify", "");
1574 if (!fIsInitialDownload && !strCmd.empty())
1576 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1577 boost::thread t(runCommand, strCmd); // thread runs free
1584 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1586 // Check for duplicate
1587 uint256 hash = GetHash();
1588 if (mapBlockIndex.count(hash))
1589 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1591 // Construct new block index object
1592 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1594 return error("AddToBlockIndex() : new CBlockIndex failed");
1595 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1596 pindexNew->phashBlock = &((*mi).first);
1597 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1598 if (miPrev != mapBlockIndex.end())
1600 pindexNew->pprev = (*miPrev).second;
1601 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1603 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1607 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1608 if (!txdb.TxnCommit())
1612 if (pindexNew->bnChainWork > bnBestChainWork)
1613 if (!SetBestChain(txdb, pindexNew))
1618 if (pindexNew == pindexBest)
1620 // Notify UI to display prev block's coinbase if it was ours
1621 static uint256 hashPrevBestCoinBase;
1622 UpdatedTransaction(hashPrevBestCoinBase);
1623 hashPrevBestCoinBase = vtx[0].GetHash();
1633 bool CBlock::CheckBlock() const
1635 // These are checks that are independent of context
1636 // that can be verified before saving an orphan block.
1639 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1640 return DoS(100, error("CheckBlock() : size limits failed"));
1642 // Check proof of work matches claimed amount
1643 if (!CheckProofOfWork(GetHash(), nBits))
1644 return DoS(50, error("CheckBlock() : proof of work failed"));
1647 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1648 return error("CheckBlock() : block timestamp too far in the future");
1650 // First transaction must be coinbase, the rest must not be
1651 if (vtx.empty() || !vtx[0].IsCoinBase())
1652 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1653 for (unsigned int i = 1; i < vtx.size(); i++)
1654 if (vtx[i].IsCoinBase())
1655 return DoS(100, error("CheckBlock() : more than one coinbase"));
1657 // Check transactions
1658 BOOST_FOREACH(const CTransaction& tx, vtx)
1659 if (!tx.CheckTransaction())
1660 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1662 // Check for duplicate txids. This is caught by ConnectInputs(),
1663 // but catching it earlier avoids a potential DoS attack:
1664 set<uint256> uniqueTx;
1665 BOOST_FOREACH(const CTransaction& tx, vtx)
1667 uniqueTx.insert(tx.GetHash());
1669 if (uniqueTx.size() != vtx.size())
1670 return DoS(100, error("CheckBlock() : duplicate transaction"));
1672 // Check for duplicate txids. This is caught by ConnectInputs(),
1673 // but catching it earlier avoids a potential DoS attack:
1674 set<uint256> uniqueTx;
1675 BOOST_FOREACH(const CTransaction& tx, vtx)
1677 uniqueTx.insert(tx.GetHash());
1679 if (uniqueTx.size() != vtx.size())
1680 return error("CheckBlock() : duplicate transaction");
1683 BOOST_FOREACH(const CTransaction& tx, vtx)
1685 nSigOps += tx.GetLegacySigOpCount();
1687 if (nSigOps > MAX_BLOCK_SIGOPS)
1688 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1691 if (hashMerkleRoot != BuildMerkleTree())
1692 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1697 bool CBlock::AcceptBlock()
1699 // Check for duplicate
1700 uint256 hash = GetHash();
1701 if (mapBlockIndex.count(hash))
1702 return error("AcceptBlock() : block already in mapBlockIndex");
1704 // Get prev block index
1705 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1706 if (mi == mapBlockIndex.end())
1707 return DoS(10, error("AcceptBlock() : prev block not found"));
1708 CBlockIndex* pindexPrev = (*mi).second;
1709 int nHeight = pindexPrev->nHeight+1;
1711 // Check proof of work
1712 if (nBits != GetNextWorkRequired(pindexPrev, this))
1713 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1715 // Check timestamp against prev
1716 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1717 return error("AcceptBlock() : block's timestamp is too early");
1719 // Check that all transactions are finalized
1720 BOOST_FOREACH(const CTransaction& tx, vtx)
1721 if (!tx.IsFinal(nHeight, GetBlockTime()))
1722 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1724 // Check that the block chain matches the known block chain up to a checkpoint
1725 if (!Checkpoints::CheckBlock(nHeight, hash))
1726 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1728 // Write block to history file
1729 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1730 return error("AcceptBlock() : out of disk space");
1731 unsigned int nFile = -1;
1732 unsigned int nBlockPos = 0;
1733 if (!WriteToDisk(nFile, nBlockPos))
1734 return error("AcceptBlock() : WriteToDisk failed");
1735 if (!AddToBlockIndex(nFile, nBlockPos))
1736 return error("AcceptBlock() : AddToBlockIndex failed");
1738 // Relay inventory, but don't relay old inventory during initial block download
1739 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1740 if (hashBestChain == hash)
1741 CRITICAL_BLOCK(cs_vNodes)
1742 BOOST_FOREACH(CNode* pnode, vNodes)
1743 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1744 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1749 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1751 // Check for duplicate
1752 uint256 hash = pblock->GetHash();
1753 if (mapBlockIndex.count(hash))
1754 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1755 if (mapOrphanBlocks.count(hash))
1756 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1758 // Preliminary checks
1759 if (!pblock->CheckBlock())
1760 return error("ProcessBlock() : CheckBlock FAILED");
1762 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1763 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1765 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1766 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1770 pfrom->Misbehaving(100);
1771 return error("ProcessBlock() : block with timestamp before last checkpoint");
1774 bnNewBlock.SetCompact(pblock->nBits);
1776 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1777 if (bnNewBlock > bnRequired)
1780 pfrom->Misbehaving(100);
1781 return error("ProcessBlock() : block with too little proof-of-work");
1786 // If don't already have its previous block, shunt it off to holding area until we get it
1787 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1789 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1790 CBlock* pblock2 = new CBlock(*pblock);
1791 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1792 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1794 // Ask this guy to fill in what we're missing
1796 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1801 if (!pblock->AcceptBlock())
1802 return error("ProcessBlock() : AcceptBlock FAILED");
1804 // Recursively process any orphan blocks that depended on this one
1805 vector<uint256> vWorkQueue;
1806 vWorkQueue.push_back(hash);
1807 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
1809 uint256 hashPrev = vWorkQueue[i];
1810 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1811 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1814 CBlock* pblockOrphan = (*mi).second;
1815 if (pblockOrphan->AcceptBlock())
1816 vWorkQueue.push_back(pblockOrphan->GetHash());
1817 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1818 delete pblockOrphan;
1820 mapOrphanBlocksByPrev.erase(hashPrev);
1823 printf("ProcessBlock: ACCEPTED\n");
1834 bool CheckDiskSpace(uint64 nAdditionalBytes)
1836 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1838 // Check for 15MB because database could create another 10MB log file at any time
1839 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1842 string strMessage = _("Warning: Disk space is low ");
1843 strMiscWarning = strMessage;
1844 printf("*** %s\n", strMessage.c_str());
1845 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1846 CreateThread(Shutdown, NULL);
1852 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1856 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1859 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1861 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1870 static unsigned int nCurrentBlockFile = 1;
1872 FILE* AppendBlockFile(unsigned int& nFileRet)
1877 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1880 if (fseek(file, 0, SEEK_END) != 0)
1882 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1883 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1885 nFileRet = nCurrentBlockFile;
1889 nCurrentBlockFile++;
1893 bool LoadBlockIndex(bool fAllowNew)
1897 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1898 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1899 pchMessageStart[0] = 0xfa;
1900 pchMessageStart[1] = 0xbf;
1901 pchMessageStart[2] = 0xb5;
1902 pchMessageStart[3] = 0xda;
1909 if (!txdb.LoadBlockIndex())
1914 // Init with genesis block
1916 if (mapBlockIndex.empty())
1922 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1923 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1924 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1925 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1926 // vMerkleTree: 4a5e1e
1929 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1931 txNew.vin.resize(1);
1932 txNew.vout.resize(1);
1933 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1934 txNew.vout[0].nValue = 50 * COIN;
1935 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1937 block.vtx.push_back(txNew);
1938 block.hashPrevBlock = 0;
1939 block.hashMerkleRoot = block.BuildMerkleTree();
1941 block.nTime = 1231006505;
1942 block.nBits = 0x1d00ffff;
1943 block.nNonce = 2083236893;
1947 block.nTime = 1296688602;
1948 block.nBits = 0x1d07fff8;
1949 block.nNonce = 384568319;
1953 printf("%s\n", block.GetHash().ToString().c_str());
1954 printf("%s\n", hashGenesisBlock.ToString().c_str());
1955 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1956 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1958 assert(block.GetHash() == hashGenesisBlock);
1960 // Start new block file
1962 unsigned int nBlockPos;
1963 if (!block.WriteToDisk(nFile, nBlockPos))
1964 return error("LoadBlockIndex() : writing genesis block to disk failed");
1965 if (!block.AddToBlockIndex(nFile, nBlockPos))
1966 return error("LoadBlockIndex() : genesis block not accepted");
1974 void PrintBlockTree()
1976 // precompute tree structure
1977 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1978 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1980 CBlockIndex* pindex = (*mi).second;
1981 mapNext[pindex->pprev].push_back(pindex);
1983 //while (rand() % 3 == 0)
1984 // mapNext[pindex->pprev].push_back(pindex);
1987 vector<pair<int, CBlockIndex*> > vStack;
1988 vStack.push_back(make_pair(0, pindexGenesisBlock));
1991 while (!vStack.empty())
1993 int nCol = vStack.back().first;
1994 CBlockIndex* pindex = vStack.back().second;
1997 // print split or gap
1998 if (nCol > nPrevCol)
2000 for (int i = 0; i < nCol-1; i++)
2004 else if (nCol < nPrevCol)
2006 for (int i = 0; i < nCol; i++)
2013 for (int i = 0; i < nCol; i++)
2018 block.ReadFromDisk(pindex);
2019 printf("%d (%u,%u) %s %s tx %d",
2023 block.GetHash().ToString().substr(0,20).c_str(),
2024 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2027 PrintWallets(block);
2029 // put the main timechain first
2030 vector<CBlockIndex*>& vNext = mapNext[pindex];
2031 for (unsigned int i = 0; i < vNext.size(); i++)
2033 if (vNext[i]->pnext)
2035 swap(vNext[0], vNext[i]);
2041 for (unsigned int i = 0; i < vNext.size(); i++)
2042 vStack.push_back(make_pair(nCol+i, vNext[i]));
2055 //////////////////////////////////////////////////////////////////////////////
2060 map<uint256, CAlert> mapAlerts;
2061 CCriticalSection cs_mapAlerts;
2063 string GetWarnings(string strFor)
2066 string strStatusBar;
2068 if (GetBoolArg("-testsafemode"))
2071 // Misc warnings like out of disk space and clock is wrong
2072 if (strMiscWarning != "")
2075 strStatusBar = strMiscWarning;
2078 // Longer invalid proof-of-work chain
2079 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2082 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2086 CRITICAL_BLOCK(cs_mapAlerts)
2088 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2090 const CAlert& alert = item.second;
2091 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2093 nPriority = alert.nPriority;
2094 strStatusBar = alert.strStatusBar;
2099 if (strFor == "statusbar")
2100 return strStatusBar;
2101 else if (strFor == "rpc")
2103 assert(!"GetWarnings() : invalid parameter");
2107 bool CAlert::ProcessAlert()
2109 if (!CheckSignature())
2114 CRITICAL_BLOCK(cs_mapAlerts)
2116 // Cancel previous alerts
2117 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2119 const CAlert& alert = (*mi).second;
2122 printf("cancelling alert %d\n", alert.nID);
2123 mapAlerts.erase(mi++);
2125 else if (!alert.IsInEffect())
2127 printf("expiring alert %d\n", alert.nID);
2128 mapAlerts.erase(mi++);
2134 // Check if this alert has been cancelled
2135 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2137 const CAlert& alert = item.second;
2138 if (alert.Cancels(*this))
2140 printf("alert already cancelled by %d\n", alert.nID);
2146 mapAlerts.insert(make_pair(GetHash(), *this));
2149 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2161 //////////////////////////////////////////////////////////////////////////////
2167 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2173 bool txInMap = false;
2174 CRITICAL_BLOCK(cs_mapTransactions)
2176 txInMap = (mapTransactions.count(inv.hash) != 0);
2179 mapOrphanTransactions.count(inv.hash) ||
2180 txdb.ContainsTx(inv.hash);
2183 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2185 // Don't know what it is, just say we already got one
2192 // The message start string is designed to be unlikely to occur in normal data.
2193 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2194 // a large 4-byte int at any alignment.
2195 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2198 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2200 static map<CService, vector<unsigned char> > mapReuseKey;
2201 RandAddSeedPerfmon();
2203 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2204 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2206 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2208 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2216 if (strCommand == "version")
2218 // Each connection can only send one version message
2219 if (pfrom->nVersion != 0)
2221 pfrom->Misbehaving(1);
2229 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2230 if (pfrom->nVersion < 209)
2232 // Since February 20, 2012, the protocol is initiated at version 209,
2233 // and earlier versions are no longer supported
2234 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2235 pfrom->fDisconnect = true;
2239 if (pfrom->nVersion == 10300)
2240 pfrom->nVersion = 300;
2242 vRecv >> addrFrom >> nNonce;
2244 vRecv >> pfrom->strSubVer;
2246 vRecv >> pfrom->nStartingHeight;
2248 // Disconnect if we connected to ourself
2249 if (nNonce == nLocalHostNonce && nNonce > 1)
2251 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2252 pfrom->fDisconnect = true;
2256 // Be shy and don't send version until we hear
2257 if (pfrom->fInbound)
2258 pfrom->PushVersion();
2260 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2262 AddTimeData(pfrom->addr, nTime);
2265 pfrom->PushMessage("verack");
2266 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2268 if (!pfrom->fInbound)
2270 // Advertise our address
2271 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2272 !IsInitialBlockDownload())
2274 CAddress addr(addrLocalHost);
2275 addr.nTime = GetAdjustedTime();
2276 pfrom->PushAddress(addr);
2279 // Get recent addresses
2280 if (pfrom->nVersion >= 31402 || addrman.size() < 1000)
2282 pfrom->PushMessage("getaddr");
2283 pfrom->fGetAddr = true;
2285 addrman.Good(pfrom->addr);
2287 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2289 addrman.Add(addrFrom, addrFrom);
2290 addrman.Good(addrFrom);
2294 // Ask the first connected node for block updates
2295 static int nAskedForBlocks = 0;
2296 if (!pfrom->fClient &&
2297 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2298 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2301 pfrom->PushGetBlocks(pindexBest, uint256(0));
2305 CRITICAL_BLOCK(cs_mapAlerts)
2306 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2307 item.second.RelayTo(pfrom);
2309 pfrom->fSuccessfullyConnected = true;
2311 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2313 cPeerBlockCounts.input(pfrom->nStartingHeight);
2317 else if (pfrom->nVersion == 0)
2319 // Must have a version message before anything else
2320 pfrom->Misbehaving(1);
2325 else if (strCommand == "verack")
2327 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2331 else if (strCommand == "addr")
2333 vector<CAddress> vAddr;
2336 // Don't want addr from older versions unless seeding
2337 if (pfrom->nVersion < 31402 && addrman.size() > 1000)
2339 if (vAddr.size() > 1000)
2341 pfrom->Misbehaving(20);
2342 return error("message addr size() = %d", vAddr.size());
2345 // Store the new addresses
2346 int64 nNow = GetAdjustedTime();
2347 int64 nSince = nNow - 10 * 60;
2348 BOOST_FOREACH(CAddress& addr, vAddr)
2352 // ignore IPv6 for now, since it isn't implemented anyway
2355 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2356 addr.nTime = nNow - 5 * 24 * 60 * 60;
2357 pfrom->AddAddressKnown(addr);
2358 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2360 // Relay to a limited number of other nodes
2361 CRITICAL_BLOCK(cs_vNodes)
2363 // Use deterministic randomness to send to the same nodes for 24 hours
2364 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2365 static uint256 hashSalt;
2367 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2368 int64 hashAddr = addr.GetHash();
2369 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2370 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2371 multimap<uint256, CNode*> mapMix;
2372 BOOST_FOREACH(CNode* pnode, vNodes)
2374 if (pnode->nVersion < 31402)
2376 unsigned int nPointer;
2377 memcpy(&nPointer, &pnode, sizeof(nPointer));
2378 uint256 hashKey = hashRand ^ nPointer;
2379 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2380 mapMix.insert(make_pair(hashKey, pnode));
2382 int nRelayNodes = 2;
2383 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2384 ((*mi).second)->PushAddress(addr);
2388 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2389 if (vAddr.size() < 1000)
2390 pfrom->fGetAddr = false;
2394 else if (strCommand == "inv")
2398 if (vInv.size() > 50000)
2400 pfrom->Misbehaving(20);
2401 return error("message inv size() = %d", vInv.size());
2405 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
2407 const CInv &inv = vInv[nInv];
2411 pfrom->AddInventoryKnown(inv);
2413 bool fAlreadyHave = AlreadyHave(txdb, inv);
2415 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2417 // Always request the last block in an inv bundle (even if we already have it), as it is the
2418 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2419 // this is necessary to connect earlier received orphan blocks to the chain again.
2420 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2422 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2423 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2425 // Track requests for our stuff
2426 Inventory(inv.hash);
2431 else if (strCommand == "getdata")
2435 if (vInv.size() > 50000)
2437 pfrom->Misbehaving(20);
2438 return error("message getdata size() = %d", vInv.size());
2441 BOOST_FOREACH(const CInv& inv, vInv)
2445 printf("received getdata for: %s\n", inv.ToString().c_str());
2447 if (inv.type == MSG_BLOCK)
2449 // Send block from disk
2450 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2451 if (mi != mapBlockIndex.end())
2454 block.ReadFromDisk((*mi).second);
2455 pfrom->PushMessage("block", block);
2457 // Trigger them to send a getblocks request for the next batch of inventory
2458 if (inv.hash == pfrom->hashContinue)
2460 // Bypass PushInventory, this must send even if redundant,
2461 // and we want it right after the last block so they don't
2462 // wait for other stuff first.
2464 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2465 pfrom->PushMessage("inv", vInv);
2466 pfrom->hashContinue = 0;
2470 else if (inv.IsKnownType())
2472 // Send stream from relay memory
2473 CRITICAL_BLOCK(cs_mapRelay)
2475 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2476 if (mi != mapRelay.end())
2477 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2481 // Track requests for our stuff
2482 Inventory(inv.hash);
2487 else if (strCommand == "getblocks")
2489 CBlockLocator locator;
2491 vRecv >> locator >> hashStop;
2493 // Find the last block the caller has in the main chain
2494 CBlockIndex* pindex = locator.GetBlockIndex();
2496 // Send the rest of the chain
2498 pindex = pindex->pnext;
2499 int nLimit = 500 + locator.GetDistanceBack();
2500 unsigned int nBytes = 0;
2501 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2502 for (; pindex; pindex = pindex->pnext)
2504 if (pindex->GetBlockHash() == hashStop)
2506 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2509 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2511 block.ReadFromDisk(pindex, true);
2512 nBytes += block.GetSerializeSize(SER_NETWORK);
2513 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2515 // When this block is requested, we'll send an inv that'll make them
2516 // getblocks the next batch of inventory.
2517 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2518 pfrom->hashContinue = pindex->GetBlockHash();
2525 else if (strCommand == "getheaders")
2527 CBlockLocator locator;
2529 vRecv >> locator >> hashStop;
2531 CBlockIndex* pindex = NULL;
2532 if (locator.IsNull())
2534 // If locator is null, return the hashStop block
2535 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2536 if (mi == mapBlockIndex.end())
2538 pindex = (*mi).second;
2542 // Find the last block the caller has in the main chain
2543 pindex = locator.GetBlockIndex();
2545 pindex = pindex->pnext;
2548 vector<CBlock> vHeaders;
2549 int nLimit = 2000 + locator.GetDistanceBack();
2550 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2551 for (; pindex; pindex = pindex->pnext)
2553 vHeaders.push_back(pindex->GetBlockHeader());
2554 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2557 pfrom->PushMessage("headers", vHeaders);
2561 else if (strCommand == "tx")
2563 vector<uint256> vWorkQueue;
2564 CDataStream vMsg(vRecv);
2568 CInv inv(MSG_TX, tx.GetHash());
2569 pfrom->AddInventoryKnown(inv);
2571 bool fMissingInputs = false;
2572 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2574 SyncWithWallets(tx, NULL, true);
2575 RelayMessage(inv, vMsg);
2576 mapAlreadyAskedFor.erase(inv);
2577 vWorkQueue.push_back(inv.hash);
2579 // Recursively process any orphan transactions that depended on this one
2580 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2582 uint256 hashPrev = vWorkQueue[i];
2583 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2584 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2587 const CDataStream& vMsg = *((*mi).second);
2589 CDataStream(vMsg) >> tx;
2590 CInv inv(MSG_TX, tx.GetHash());
2592 if (tx.AcceptToMemoryPool(true))
2594 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2595 SyncWithWallets(tx, NULL, true);
2596 RelayMessage(inv, vMsg);
2597 mapAlreadyAskedFor.erase(inv);
2598 vWorkQueue.push_back(inv.hash);
2603 BOOST_FOREACH(uint256 hash, vWorkQueue)
2604 EraseOrphanTx(hash);
2606 else if (fMissingInputs)
2608 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2611 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2612 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2614 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2616 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2620 else if (strCommand == "block")
2625 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2628 CInv inv(MSG_BLOCK, block.GetHash());
2629 pfrom->AddInventoryKnown(inv);
2631 if (ProcessBlock(pfrom, &block))
2632 mapAlreadyAskedFor.erase(inv);
2633 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2637 else if (strCommand == "getaddr")
2639 pfrom->vAddrToSend.clear();
2640 vector<CAddress> vAddr = addrman.GetAddr();
2641 BOOST_FOREACH(const CAddress &addr, vAddr)
2642 pfrom->PushAddress(addr);
2646 else if (strCommand == "checkorder")
2651 if (!GetBoolArg("-allowreceivebyip"))
2653 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2660 /// we have a chance to check the order here
2662 // Keep giving the same key to the same ip until they use it
2663 if (!mapReuseKey.count(pfrom->addr))
2664 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2666 // Send back approval of order and pubkey to use
2667 CScript scriptPubKey;
2668 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2669 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2673 else if (strCommand == "reply")
2678 CRequestTracker tracker;
2679 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2681 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2682 if (mi != pfrom->mapRequests.end())
2684 tracker = (*mi).second;
2685 pfrom->mapRequests.erase(mi);
2688 if (!tracker.IsNull())
2689 tracker.fn(tracker.param1, vRecv);
2693 else if (strCommand == "ping")
2698 else if (strCommand == "alert")
2703 if (alert.ProcessAlert())
2706 pfrom->setKnown.insert(alert.GetHash());
2707 CRITICAL_BLOCK(cs_vNodes)
2708 BOOST_FOREACH(CNode* pnode, vNodes)
2709 alert.RelayTo(pnode);
2716 // Ignore unknown commands for extensibility
2720 // Update the last seen time for this node's address
2721 if (pfrom->fNetworkNode)
2722 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2723 AddressCurrentlyConnected(pfrom->addr);
2729 bool ProcessMessages(CNode* pfrom)
2731 CDataStream& vRecv = pfrom->vRecv;
2735 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2739 // (4) message start
2748 // Scan for message start
2749 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2750 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2751 if (vRecv.end() - pstart < nHeaderSize)
2753 if (vRecv.size() > nHeaderSize)
2755 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2756 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2760 if (pstart - vRecv.begin() > 0)
2761 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2762 vRecv.erase(vRecv.begin(), pstart);
2765 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2770 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2773 string strCommand = hdr.GetCommand();
2776 unsigned int nMessageSize = hdr.nMessageSize;
2777 if (nMessageSize > MAX_SIZE)
2779 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2782 if (nMessageSize > vRecv.size())
2784 // Rewind and wait for rest of message
2785 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2790 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2791 unsigned int nChecksum = 0;
2792 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2793 if (nChecksum != hdr.nChecksum)
2795 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2796 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2800 // Copy message to its own buffer
2801 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2802 vRecv.ignore(nMessageSize);
2808 CRITICAL_BLOCK(cs_main)
2809 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2813 catch (std::ios_base::failure& e)
2815 if (strstr(e.what(), "end of data"))
2817 // Allow exceptions from underlength message on vRecv
2818 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2820 else if (strstr(e.what(), "size too large"))
2822 // Allow exceptions from overlong size
2823 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2827 PrintExceptionContinue(&e, "ProcessMessage()");
2830 catch (std::exception& e) {
2831 PrintExceptionContinue(&e, "ProcessMessage()");
2833 PrintExceptionContinue(NULL, "ProcessMessage()");
2837 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2845 bool SendMessages(CNode* pto, bool fSendTrickle)
2847 TRY_CRITICAL_BLOCK(cs_main)
2849 // Don't send anything until we get their version message
2850 if (pto->nVersion == 0)
2854 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2855 pto->PushMessage("ping");
2857 // Resend wallet transactions that haven't gotten in a block yet
2858 ResendWalletTransactions();
2860 // Address refresh broadcast
2861 static int64 nLastRebroadcast;
2862 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2864 CRITICAL_BLOCK(cs_vNodes)
2866 BOOST_FOREACH(CNode* pnode, vNodes)
2868 // Periodically clear setAddrKnown to allow refresh broadcasts
2869 if (nLastRebroadcast)
2870 pnode->setAddrKnown.clear();
2872 // Rebroadcast our address
2873 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2875 CAddress addr(addrLocalHost);
2876 addr.nTime = GetAdjustedTime();
2877 pnode->PushAddress(addr);
2881 nLastRebroadcast = GetTime();
2889 vector<CAddress> vAddr;
2890 vAddr.reserve(pto->vAddrToSend.size());
2891 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2893 // returns true if wasn't already contained in the set
2894 if (pto->setAddrKnown.insert(addr).second)
2896 vAddr.push_back(addr);
2897 // receiver rejects addr messages larger than 1000
2898 if (vAddr.size() >= 1000)
2900 pto->PushMessage("addr", vAddr);
2905 pto->vAddrToSend.clear();
2907 pto->PushMessage("addr", vAddr);
2912 // Message: inventory
2915 vector<CInv> vInvWait;
2916 CRITICAL_BLOCK(pto->cs_inventory)
2918 vInv.reserve(pto->vInventoryToSend.size());
2919 vInvWait.reserve(pto->vInventoryToSend.size());
2920 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2922 if (pto->setInventoryKnown.count(inv))
2925 // trickle out tx inv to protect privacy
2926 if (inv.type == MSG_TX && !fSendTrickle)
2928 // 1/4 of tx invs blast to all immediately
2929 static uint256 hashSalt;
2931 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2932 uint256 hashRand = inv.hash ^ hashSalt;
2933 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2934 bool fTrickleWait = ((hashRand & 3) != 0);
2936 // always trickle our own transactions
2940 if (GetTransaction(inv.hash, wtx))
2942 fTrickleWait = true;
2947 vInvWait.push_back(inv);
2952 // returns true if wasn't already contained in the set
2953 if (pto->setInventoryKnown.insert(inv).second)
2955 vInv.push_back(inv);
2956 if (vInv.size() >= 1000)
2958 pto->PushMessage("inv", vInv);
2963 pto->vInventoryToSend = vInvWait;
2966 pto->PushMessage("inv", vInv);
2972 vector<CInv> vGetData;
2973 int64 nNow = GetTime() * 1000000;
2975 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2977 const CInv& inv = (*pto->mapAskFor.begin()).second;
2978 if (!AlreadyHave(txdb, inv))
2980 printf("sending getdata: %s\n", inv.ToString().c_str());
2981 vGetData.push_back(inv);
2982 if (vGetData.size() >= 1000)
2984 pto->PushMessage("getdata", vGetData);
2988 mapAlreadyAskedFor[inv] = nNow;
2989 pto->mapAskFor.erase(pto->mapAskFor.begin());
2991 if (!vGetData.empty())
2992 pto->PushMessage("getdata", vGetData);
3011 //////////////////////////////////////////////////////////////////////////////
3016 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3018 unsigned char* pdata = (unsigned char*)pbuffer;
3019 unsigned int blocks = 1 + ((len + 8) / 64);
3020 unsigned char* pend = pdata + 64 * blocks;
3021 memset(pdata + len, 0, 64 * blocks - len);
3023 unsigned int bits = len * 8;
3024 pend[-1] = (bits >> 0) & 0xff;
3025 pend[-2] = (bits >> 8) & 0xff;
3026 pend[-3] = (bits >> 16) & 0xff;
3027 pend[-4] = (bits >> 24) & 0xff;
3031 static const unsigned int pSHA256InitState[8] =
3032 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3034 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3037 unsigned char data[64];
3041 for (int i = 0; i < 16; i++)
3042 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3044 for (int i = 0; i < 8; i++)
3045 ctx.h[i] = ((uint32_t*)pinit)[i];
3047 SHA256_Update(&ctx, data, sizeof(data));
3048 for (int i = 0; i < 8; i++)
3049 ((uint32_t*)pstate)[i] = ctx.h[i];
3053 // ScanHash scans nonces looking for a hash with at least some zero bits.
3054 // It operates on big endian data. Caller does the byte reversing.
3055 // All input buffers are 16-byte aligned. nNonce is usually preserved
3056 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3057 // the block is rebuilt and nNonce starts over at zero.
3059 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3061 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3065 // Hash pdata using pmidstate as the starting state into
3066 // preformatted buffer phash1, then hash phash1 into phash
3068 SHA256Transform(phash1, pdata, pmidstate);
3069 SHA256Transform(phash, phash1, pSHA256InitState);
3071 // Return the nonce if the hash has at least some zero bits,
3072 // caller will check if it has enough to reach the target
3073 if (((unsigned short*)phash)[14] == 0)
3076 // If nothing found after trying for a while, return -1
3077 if ((nNonce & 0xffff) == 0)
3079 nHashesDone = 0xffff+1;
3085 // Some explaining would be appreciated
3090 set<uint256> setDependsOn;
3093 COrphan(CTransaction* ptxIn)
3101 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3102 BOOST_FOREACH(uint256 hash, setDependsOn)
3103 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3108 uint64 nLastBlockTx = 0;
3109 uint64 nLastBlockSize = 0;
3111 CBlock* CreateNewBlock(CReserveKey& reservekey)
3113 CBlockIndex* pindexPrev = pindexBest;
3116 auto_ptr<CBlock> pblock(new CBlock());
3120 // Create coinbase tx
3122 txNew.vin.resize(1);
3123 txNew.vin[0].prevout.SetNull();
3124 txNew.vout.resize(1);
3125 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3127 // Add our coinbase tx as first transaction
3128 pblock->vtx.push_back(txNew);
3130 // Collect memory pool transactions into the block
3132 CRITICAL_BLOCK(cs_main)
3133 CRITICAL_BLOCK(cs_mapTransactions)
3137 // Priority order to process transactions
3138 list<COrphan> vOrphan; // list memory doesn't move
3139 map<uint256, vector<COrphan*> > mapDependers;
3140 multimap<double, CTransaction*> mapPriority;
3141 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3143 CTransaction& tx = (*mi).second;
3144 if (tx.IsCoinBase() || !tx.IsFinal())
3147 COrphan* porphan = NULL;
3148 double dPriority = 0;
3149 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3151 // Read prev transaction
3152 CTransaction txPrev;
3154 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3156 // Has to wait for dependencies
3159 // Use list for automatic deletion
3160 vOrphan.push_back(COrphan(&tx));
3161 porphan = &vOrphan.back();
3163 mapDependers[txin.prevout.hash].push_back(porphan);
3164 porphan->setDependsOn.insert(txin.prevout.hash);
3167 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3169 // Read block header
3170 int nConf = txindex.GetDepthInMainChain();
3172 dPriority += (double)nValueIn * nConf;
3174 if (fDebug && GetBoolArg("-printpriority"))
3175 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3178 // Priority is sum(valuein * age) / txsize
3179 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3182 porphan->dPriority = dPriority;
3184 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3186 if (fDebug && GetBoolArg("-printpriority"))
3188 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3195 // Collect transactions into block
3196 map<uint256, CTxIndex> mapTestPool;
3197 uint64 nBlockSize = 1000;
3198 uint64 nBlockTx = 0;
3199 int nBlockSigOps = 100;
3200 while (!mapPriority.empty())
3202 // Take highest priority transaction off priority queue
3203 double dPriority = -(*mapPriority.begin()).first;
3204 CTransaction& tx = *(*mapPriority.begin()).second;
3205 mapPriority.erase(mapPriority.begin());
3208 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3209 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3212 // Legacy limits on sigOps:
3213 int nTxSigOps = tx.GetLegacySigOpCount();
3214 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3217 // Transaction fee required depends on block size
3218 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3219 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3221 // Connecting shouldn't fail due to dependency on other memory pool transactions
3222 // because we're already processing them in order of dependency
3223 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3224 MapPrevTx mapInputs;
3226 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3229 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3230 if (nTxFees < nMinFee)
3233 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3234 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3237 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3239 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3240 swap(mapTestPool, mapTestPoolTmp);
3243 pblock->vtx.push_back(tx);
3244 nBlockSize += nTxSize;
3246 nBlockSigOps += nTxSigOps;
3249 // Add transactions that depend on this one to the priority queue
3250 uint256 hash = tx.GetHash();
3251 if (mapDependers.count(hash))
3253 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3255 if (!porphan->setDependsOn.empty())
3257 porphan->setDependsOn.erase(hash);
3258 if (porphan->setDependsOn.empty())
3259 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3265 nLastBlockTx = nBlockTx;
3266 nLastBlockSize = nBlockSize;
3267 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3270 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3273 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3274 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3275 pblock->UpdateTime(pindexPrev);
3276 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3279 return pblock.release();
3283 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3285 // Update nExtraNonce
3286 static uint256 hashPrevBlock;
3287 if (hashPrevBlock != pblock->hashPrevBlock)
3290 hashPrevBlock = pblock->hashPrevBlock;
3293 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3294 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3296 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3300 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3303 // Prebuild hash buffers
3310 uint256 hashPrevBlock;
3311 uint256 hashMerkleRoot;
3314 unsigned int nNonce;
3317 unsigned char pchPadding0[64];
3319 unsigned char pchPadding1[64];
3322 memset(&tmp, 0, sizeof(tmp));
3324 tmp.block.nVersion = pblock->nVersion;
3325 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3326 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3327 tmp.block.nTime = pblock->nTime;
3328 tmp.block.nBits = pblock->nBits;
3329 tmp.block.nNonce = pblock->nNonce;
3331 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3332 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3334 // Byte swap all the input buffer
3335 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
3336 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3338 // Precalc the first half of the first hash, which stays constant
3339 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3341 memcpy(pdata, &tmp.block, 128);
3342 memcpy(phash1, &tmp.hash1, 64);
3346 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3348 uint256 hash = pblock->GetHash();
3349 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3351 if (hash > hashTarget)
3355 printf("BitcoinMiner:\n");
3356 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3358 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3359 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3362 CRITICAL_BLOCK(cs_main)
3364 if (pblock->hashPrevBlock != hashBestChain)
3365 return error("BitcoinMiner : generated block is stale");
3367 // Remove key from key pool
3368 reservekey.KeepKey();
3370 // Track how many getdata requests this block gets
3371 CRITICAL_BLOCK(wallet.cs_wallet)
3372 wallet.mapRequestCount[pblock->GetHash()] = 0;
3374 // Process this block the same as if we had received it from another node
3375 if (!ProcessBlock(NULL, pblock))
3376 return error("BitcoinMiner : ProcessBlock, block not accepted");
3382 void static ThreadBitcoinMiner(void* parg);
3384 static bool fGenerateBitcoins = false;
3385 static bool fLimitProcessors = false;
3386 static int nLimitProcessors = -1;
3388 void static BitcoinMiner(CWallet *pwallet)
3390 printf("BitcoinMiner started\n");
3391 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3393 // Each thread has its own key and counter
3394 CReserveKey reservekey(pwallet);
3395 unsigned int nExtraNonce = 0;
3397 while (fGenerateBitcoins)
3399 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3403 while (vNodes.empty() || IsInitialBlockDownload())
3408 if (!fGenerateBitcoins)
3416 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3417 CBlockIndex* pindexPrev = pindexBest;
3419 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3422 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3424 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3428 // Prebuild hash buffers
3430 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3431 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3432 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3434 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3436 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3437 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3438 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3444 int64 nStart = GetTime();
3445 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3447 uint256& hash = *alignup<16>(hashbuf);
3450 unsigned int nHashesDone = 0;
3451 unsigned int nNonceFound;
3454 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3455 (char*)&hash, nHashesDone);
3457 // Check if something found
3458 if (nNonceFound != -1)
3460 for (unsigned int i = 0; i < sizeof(hash)/4; i++)
3461 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3463 if (hash <= hashTarget)
3466 pblock->nNonce = ByteReverse(nNonceFound);
3467 assert(hash == pblock->GetHash());
3469 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3470 CheckWork(pblock.get(), *pwalletMain, reservekey);
3471 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3477 static int64 nHashCounter;
3478 if (nHPSTimerStart == 0)
3480 nHPSTimerStart = GetTimeMillis();
3484 nHashCounter += nHashesDone;
3485 if (GetTimeMillis() - nHPSTimerStart > 4000)
3487 static CCriticalSection cs;
3490 if (GetTimeMillis() - nHPSTimerStart > 4000)
3492 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3493 nHPSTimerStart = GetTimeMillis();
3495 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3496 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3497 static int64 nLogTime;
3498 if (GetTime() - nLogTime > 30 * 60)
3500 nLogTime = GetTime();
3501 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3502 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3508 // Check for stop or if block needs to be rebuilt
3511 if (!fGenerateBitcoins)
3513 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3517 if (nBlockNonce >= 0xffff0000)
3519 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3521 if (pindexPrev != pindexBest)
3524 // Update nTime every few seconds
3525 pblock->UpdateTime(pindexPrev);
3526 nBlockTime = ByteReverse(pblock->nTime);
3529 // Changing pblock->nTime can change work required on testnet:
3530 nBlockBits = ByteReverse(pblock->nBits);
3531 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3537 void static ThreadBitcoinMiner(void* parg)
3539 CWallet* pwallet = (CWallet*)parg;
3542 vnThreadsRunning[THREAD_MINER]++;
3543 BitcoinMiner(pwallet);
3544 vnThreadsRunning[THREAD_MINER]--;
3546 catch (std::exception& e) {
3547 vnThreadsRunning[THREAD_MINER]--;
3548 PrintException(&e, "ThreadBitcoinMiner()");
3550 vnThreadsRunning[THREAD_MINER]--;
3551 PrintException(NULL, "ThreadBitcoinMiner()");
3553 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3555 if (vnThreadsRunning[THREAD_MINER] == 0)
3557 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3561 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3563 fGenerateBitcoins = fGenerate;
3564 nLimitProcessors = GetArg("-genproclimit", -1);
3565 if (nLimitProcessors == 0)
3566 fGenerateBitcoins = false;
3567 fLimitProcessors = (nLimitProcessors != -1);
3571 int nProcessors = boost::thread::hardware_concurrency();
3572 printf("%d processors\n", nProcessors);
3573 if (nProcessors < 1)
3575 if (fLimitProcessors && nProcessors > nLimitProcessors)
3576 nProcessors = nLimitProcessors;
3577 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3578 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3579 for (int i = 0; i < nAddThreads; i++)
3581 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3582 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");