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 (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);
308 // Transactions with extra stuff in their scriptSigs are
309 // non-standard. Note that this EvalScript() call will
310 // be quick, because if there are any operations
311 // beside "push data" in the scriptSig the
312 // IsStandard() call returns false
313 vector<vector<unsigned char> > stack;
314 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
317 if (whichType == TX_SCRIPTHASH)
321 CScript subscript(stack.back().begin(), stack.back().end());
322 vector<vector<unsigned char> > vSolutions2;
323 txnouttype whichType2;
324 if (!Solver(subscript, whichType2, vSolutions2))
326 if (whichType2 == TX_SCRIPTHASH)
328 nArgsExpected += ScriptSigArgsExpected(whichType2, vSolutions2);
331 if (stack.size() != nArgsExpected)
339 CTransaction::GetLegacySigOpCount() const
342 BOOST_FOREACH(const CTxIn& txin, vin)
344 nSigOps += txin.scriptSig.GetSigOpCount(false);
346 BOOST_FOREACH(const CTxOut& txout, vout)
348 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
354 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
366 // Load the block this tx is in
368 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
370 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
375 // Update the tx's hashBlock
376 hashBlock = pblock->GetHash();
378 // Locate the transaction
379 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
380 if (pblock->vtx[nIndex] == *(CTransaction*)this)
382 if (nIndex == pblock->vtx.size())
384 vMerkleBranch.clear();
386 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
390 // Fill in merkle branch
391 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
394 // Is the tx in a block that's in the main chain
395 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
396 if (mi == mapBlockIndex.end())
398 CBlockIndex* pindex = (*mi).second;
399 if (!pindex || !pindex->IsInMainChain())
402 return pindexBest->nHeight - pindex->nHeight + 1;
411 bool CTransaction::CheckTransaction() const
413 // Basic checks that don't depend on any context
415 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
417 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
419 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
420 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
422 // Check for negative or overflow output values
424 BOOST_FOREACH(const CTxOut& txout, vout)
426 if (txout.nValue < 0)
427 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
428 if (txout.nValue > MAX_MONEY)
429 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
430 nValueOut += txout.nValue;
431 if (!MoneyRange(nValueOut))
432 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
435 // Check for duplicate inputs
436 set<COutPoint> vInOutPoints;
437 BOOST_FOREACH(const CTxIn& txin, vin)
439 if (vInOutPoints.count(txin.prevout))
441 vInOutPoints.insert(txin.prevout);
446 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
447 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
451 BOOST_FOREACH(const CTxIn& txin, vin)
452 if (txin.prevout.IsNull())
453 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
459 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
462 *pfMissingInputs = false;
464 if (!CheckTransaction())
465 return error("AcceptToMemoryPool() : CheckTransaction failed");
467 // Coinbase is only valid in a block, not as a loose transaction
469 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
471 // To help v0.1.5 clients who would see it as a negative number
472 if ((int64)nLockTime > std::numeric_limits<int>::max())
473 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
475 // Rather not work on nonstandard transactions (unless -testnet)
476 if (!fTestNet && !IsStandard())
477 return error("AcceptToMemoryPool() : nonstandard transaction type");
479 // Do we already have it?
480 uint256 hash = GetHash();
481 CRITICAL_BLOCK(cs_mapTransactions)
482 if (mapTransactions.count(hash))
485 if (txdb.ContainsTx(hash))
488 // Check for conflicts with in-memory transactions
489 CTransaction* ptxOld = NULL;
490 for (int i = 0; i < vin.size(); i++)
492 COutPoint outpoint = vin[i].prevout;
493 if (mapNextTx.count(outpoint))
495 // Disable replacement feature for now
498 // Allow replacing with a newer version of the same transaction
501 ptxOld = mapNextTx[outpoint].ptx;
502 if (ptxOld->IsFinal())
504 if (!IsNewerThan(*ptxOld))
506 for (int i = 0; i < vin.size(); i++)
508 COutPoint outpoint = vin[i].prevout;
509 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
519 map<uint256, CTxIndex> mapUnused;
520 bool fInvalid = false;
521 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
524 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
526 *pfMissingInputs = true;
527 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
530 // Check for non-standard pay-to-script-hash in inputs
531 if (!AreInputsStandard(mapInputs) && !fTestNet)
532 return error("AcceptToMemoryPool() : nonstandard transaction input");
534 // Note: if you modify this code to accept non-standard transactions, then
535 // you should add code here to check that the transaction does a
536 // reasonable number of ECDSA signature verifications.
538 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
539 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
541 // Don't accept it if it can't get into a block
542 if (nFees < GetMinFee(1000, true, GMF_RELAY))
543 return error("AcceptToMemoryPool() : not enough fees");
545 // Continuously rate-limit free transactions
546 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
547 // be annoying or make other's transactions take longer to confirm.
548 if (nFees < MIN_RELAY_TX_FEE)
550 static CCriticalSection cs;
551 static double dFreeCount;
552 static int64 nLastTime;
553 int64 nNow = GetTime();
557 // Use an exponentially decaying ~10-minute window:
558 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
560 // -limitfreerelay unit is thousand-bytes-per-minute
561 // At default rate it would take over a month to fill 1GB
562 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
563 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
565 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
570 // Check against previous transactions
571 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
572 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
574 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
578 // Store transaction in memory
579 CRITICAL_BLOCK(cs_mapTransactions)
583 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
584 ptxOld->RemoveFromMemoryPool();
586 AddToMemoryPoolUnchecked();
589 ///// are we sure this is ok when loading transactions or restoring block txes
590 // If updated, erase old tx from wallet
592 EraseFromWallets(ptxOld->GetHash());
594 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
598 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
601 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
604 uint64 nPooledTx = 0;
606 bool CTransaction::AddToMemoryPoolUnchecked()
608 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
609 // Add to memory pool without checking anything. Don't call this directly,
610 // call AcceptToMemoryPool to properly check the transaction first.
611 CRITICAL_BLOCK(cs_mapTransactions)
613 uint256 hash = GetHash();
614 mapTransactions[hash] = *this;
615 for (int i = 0; i < vin.size(); i++)
616 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
617 nTransactionsUpdated++;
624 bool CTransaction::RemoveFromMemoryPool()
626 // Remove transaction from memory pool
627 CRITICAL_BLOCK(cs_mapTransactions)
629 uint256 hash = GetHash();
630 if (mapTransactions.count(hash))
632 BOOST_FOREACH(const CTxIn& txin, vin)
633 mapNextTx.erase(txin.prevout);
634 mapTransactions.erase(hash);
635 nTransactionsUpdated++;
647 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
649 if (hashBlock == 0 || nIndex == -1)
652 // Find the block it claims to be in
653 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
654 if (mi == mapBlockIndex.end())
656 CBlockIndex* pindex = (*mi).second;
657 if (!pindex || !pindex->IsInMainChain())
660 // Make sure the merkle branch connects to this block
661 if (!fMerkleVerified)
663 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
665 fMerkleVerified = true;
669 return pindexBest->nHeight - pindex->nHeight + 1;
673 int CMerkleTx::GetBlocksToMaturity() const
677 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
681 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
685 if (!IsInMainChain() && !ClientConnectInputs())
687 return CTransaction::AcceptToMemoryPool(txdb, false);
691 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
695 bool CMerkleTx::AcceptToMemoryPool()
698 return AcceptToMemoryPool(txdb);
703 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
705 CRITICAL_BLOCK(cs_mapTransactions)
707 // Add previous supporting transactions first
708 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
710 if (!tx.IsCoinBase())
712 uint256 hash = tx.GetHash();
713 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
714 tx.AcceptToMemoryPool(txdb, fCheckInputs);
717 return AcceptToMemoryPool(txdb, fCheckInputs);
722 bool CWalletTx::AcceptWalletTransaction()
725 return AcceptWalletTransaction(txdb);
728 int CTxIndex::GetDepthInMainChain() const
732 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
734 // Find the block in the index
735 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
736 if (mi == mapBlockIndex.end())
738 CBlockIndex* pindex = (*mi).second;
739 if (!pindex || !pindex->IsInMainChain())
741 return 1 + nBestHeight - pindex->nHeight;
753 //////////////////////////////////////////////////////////////////////////////
755 // CBlock and CBlockIndex
758 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
760 if (!fReadTransactions)
762 *this = pindex->GetBlockHeader();
765 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
767 if (GetHash() != pindex->GetBlockHash())
768 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
772 uint256 static GetOrphanRoot(const CBlock* pblock)
774 // Work back to the first block in the orphan chain
775 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
776 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
777 return pblock->GetHash();
780 int64 static GetBlockValue(int nHeight, int64 nFees)
782 int64 nSubsidy = 50 * COIN;
784 // Subsidy is cut in half every 4 years
785 nSubsidy >>= (nHeight / 210000);
787 return nSubsidy + nFees;
790 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
791 static const int64 nTargetSpacing = 10 * 60;
792 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
795 // minimum amount of work that could possibly be required nTime after
796 // minimum work required was nBase
798 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
800 // Testnet has min-difficulty blocks
801 // after nTargetSpacing*2 time between blocks:
802 if (fTestNet && nTime > nTargetSpacing*2)
803 return bnProofOfWorkLimit.GetCompact();
806 bnResult.SetCompact(nBase);
807 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
809 // Maximum 400% adjustment...
811 // ... in best-case exactly 4-times-normal target time
812 nTime -= nTargetTimespan*4;
814 if (bnResult > bnProofOfWorkLimit)
815 bnResult = bnProofOfWorkLimit;
816 return bnResult.GetCompact();
819 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
821 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
824 if (pindexLast == NULL)
825 return nProofOfWorkLimit;
827 // Only change once per interval
828 if ((pindexLast->nHeight+1) % nInterval != 0)
830 // Special rules for testnet after 15 Feb 2012:
831 if (fTestNet && pblock->nTime > 1329264000)
833 // If the new block's timestamp is more than 2* 10 minutes
834 // then allow mining of a min-difficulty block.
835 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
836 return nProofOfWorkLimit;
839 // Return the last non-special-min-difficulty-rules-block
840 const CBlockIndex* pindex = pindexLast;
841 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
842 pindex = pindex->pprev;
843 return pindex->nBits;
847 return pindexLast->nBits;
850 // Go back by what we want to be 14 days worth of blocks
851 const CBlockIndex* pindexFirst = pindexLast;
852 for (int i = 0; pindexFirst && i < nInterval-1; i++)
853 pindexFirst = pindexFirst->pprev;
856 // Limit adjustment step
857 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
858 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
859 if (nActualTimespan < nTargetTimespan/4)
860 nActualTimespan = nTargetTimespan/4;
861 if (nActualTimespan > nTargetTimespan*4)
862 nActualTimespan = nTargetTimespan*4;
866 bnNew.SetCompact(pindexLast->nBits);
867 bnNew *= nActualTimespan;
868 bnNew /= nTargetTimespan;
870 if (bnNew > bnProofOfWorkLimit)
871 bnNew = bnProofOfWorkLimit;
874 printf("GetNextWorkRequired RETARGET\n");
875 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
876 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
877 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
879 return bnNew.GetCompact();
882 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
885 bnTarget.SetCompact(nBits);
888 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
889 return error("CheckProofOfWork() : nBits below minimum work");
891 // Check proof of work matches claimed amount
892 if (hash > bnTarget.getuint256())
893 return error("CheckProofOfWork() : hash doesn't match nBits");
898 // Return maximum amount of blocks that other nodes claim to have
899 int GetNumBlocksOfPeers()
901 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
904 bool IsInitialBlockDownload()
906 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
908 static int64 nLastUpdate;
909 static CBlockIndex* pindexLastBest;
910 if (pindexBest != pindexLastBest)
912 pindexLastBest = pindexBest;
913 nLastUpdate = GetTime();
915 return (GetTime() - nLastUpdate < 10 &&
916 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
919 void static InvalidChainFound(CBlockIndex* pindexNew)
921 if (pindexNew->bnChainWork > bnBestInvalidWork)
923 bnBestInvalidWork = pindexNew->bnChainWork;
924 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
927 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());
928 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
929 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
930 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
933 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
935 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
937 // Updating time can change work required on testnet:
939 nBits = GetNextWorkRequired(pindexPrev, this);
952 bool CTransaction::DisconnectInputs(CTxDB& txdb)
954 // Relinquish previous transactions' spent pointers
957 BOOST_FOREACH(const CTxIn& txin, vin)
959 COutPoint prevout = txin.prevout;
961 // Get prev txindex from disk
963 if (!txdb.ReadTxIndex(prevout.hash, txindex))
964 return error("DisconnectInputs() : ReadTxIndex failed");
966 if (prevout.n >= txindex.vSpent.size())
967 return error("DisconnectInputs() : prevout.n out of range");
969 // Mark outpoint as not spent
970 txindex.vSpent[prevout.n].SetNull();
973 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
974 return error("DisconnectInputs() : UpdateTxIndex failed");
978 // Remove transaction from index
979 // This can fail if a duplicate of this transaction was in a chain that got
980 // reorganized away. This is only possible if this transaction was completely
981 // spent, so erasing it would be a no-op anway.
982 txdb.EraseTxIndex(*this);
988 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
989 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
991 // FetchInputs can return false either because we just haven't seen some inputs
992 // (in which case the transaction should be stored as an orphan)
993 // or because the transaction is malformed (in which case the transaction should
994 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
998 return true; // Coinbase transactions have no inputs to fetch.
1000 for (int i = 0; i < vin.size(); i++)
1002 COutPoint prevout = vin[i].prevout;
1003 if (inputsRet.count(prevout.hash))
1004 continue; // Got it already
1007 CTxIndex& txindex = inputsRet[prevout.hash].first;
1009 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1011 // Get txindex from current proposed changes
1012 txindex = mapTestPool.find(prevout.hash)->second;
1016 // Read txindex from txdb
1017 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1019 if (!fFound && (fBlock || fMiner))
1020 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());
1023 CTransaction& txPrev = inputsRet[prevout.hash].second;
1024 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1026 // Get prev tx from single transactions in memory
1027 CRITICAL_BLOCK(cs_mapTransactions)
1029 if (!mapTransactions.count(prevout.hash))
1030 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1031 txPrev = mapTransactions[prevout.hash];
1034 txindex.vSpent.resize(txPrev.vout.size());
1038 // Get prev tx from disk
1039 if (!txPrev.ReadFromDisk(txindex.pos))
1040 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1044 // Make sure all prevout.n's are valid:
1045 for (int i = 0; i < vin.size(); i++)
1047 const COutPoint prevout = vin[i].prevout;
1048 assert(inputsRet.count(prevout.hash) != 0);
1049 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1050 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1051 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1053 // Revisit this if/when transaction replacement is implemented and allows
1056 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()));
1063 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1065 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1066 if (mi == inputs.end())
1067 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1069 const CTransaction& txPrev = (mi->second).second;
1070 if (input.prevout.n >= txPrev.vout.size())
1071 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1073 return txPrev.vout[input.prevout.n];
1076 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1082 for (int i = 0; i < vin.size(); i++)
1084 nResult += GetOutputFor(vin[i], inputs).nValue;
1090 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1096 for (int i = 0; i < vin.size(); i++)
1098 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1099 if (prevout.scriptPubKey.IsPayToScriptHash())
1100 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1105 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1106 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1107 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1109 // Take over previous transactions' spent pointers
1110 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1111 // fMiner is true when called from the internal bitcoin miner
1112 // ... both are false when called from CTransaction::AcceptToMemoryPool
1117 for (int i = 0; i < vin.size(); i++)
1119 COutPoint prevout = vin[i].prevout;
1120 assert(inputs.count(prevout.hash) > 0);
1121 CTxIndex& txindex = inputs[prevout.hash].first;
1122 CTransaction& txPrev = inputs[prevout.hash].second;
1124 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1125 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()));
1127 // If prev is coinbase, check that it's matured
1128 if (txPrev.IsCoinBase())
1129 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1130 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1131 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1133 // Check for conflicts (double-spend)
1134 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1135 // for an attacker to attempt to split the network.
1136 if (!txindex.vSpent[prevout.n].IsNull())
1137 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());
1139 // Check for negative or overflow input values
1140 nValueIn += txPrev.vout[prevout.n].nValue;
1141 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1142 return DoS(100, error("ConnectInputs() : txin values out of range"));
1144 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1145 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1146 // still computed and checked, and any change will be caught at the next checkpoint.
1147 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1150 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1152 // only during transition phase for P2SH: do not invoke anti-DoS code for
1153 // potentially old clients relaying bad P2SH transactions
1154 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1155 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1157 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1161 // Mark outpoints as spent
1162 txindex.vSpent[prevout.n] = posThisTx;
1165 if (fBlock || fMiner)
1167 mapTestPool[prevout.hash] = txindex;
1171 if (nValueIn < GetValueOut())
1172 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1174 // Tally transaction fees
1175 int64 nTxFee = nValueIn - GetValueOut();
1177 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1179 if (!MoneyRange(nFees))
1180 return DoS(100, error("ConnectInputs() : nFees out of range"));
1187 bool CTransaction::ClientConnectInputs()
1192 // Take over previous transactions' spent pointers
1193 CRITICAL_BLOCK(cs_mapTransactions)
1196 for (int i = 0; i < vin.size(); i++)
1198 // Get prev tx from single transactions in memory
1199 COutPoint prevout = vin[i].prevout;
1200 if (!mapTransactions.count(prevout.hash))
1202 CTransaction& txPrev = mapTransactions[prevout.hash];
1204 if (prevout.n >= txPrev.vout.size())
1208 if (!VerifySignature(txPrev, *this, i, true, 0))
1209 return error("ConnectInputs() : VerifySignature failed");
1211 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1212 ///// this has to go away now that posNext is gone
1213 // // Check for conflicts
1214 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1215 // return error("ConnectInputs() : prev tx already used");
1217 // // Flag outpoints as used
1218 // txPrev.vout[prevout.n].posNext = posThisTx;
1220 nValueIn += txPrev.vout[prevout.n].nValue;
1222 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1223 return error("ClientConnectInputs() : txin values out of range");
1225 if (GetValueOut() > nValueIn)
1235 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1237 // Disconnect in reverse order
1238 for (int i = vtx.size()-1; i >= 0; i--)
1239 if (!vtx[i].DisconnectInputs(txdb))
1242 // Update block index on disk without changing it in memory.
1243 // The memory index structure will be changed after the db commits.
1246 CDiskBlockIndex blockindexPrev(pindex->pprev);
1247 blockindexPrev.hashNext = 0;
1248 if (!txdb.WriteBlockIndex(blockindexPrev))
1249 return error("DisconnectBlock() : WriteBlockIndex failed");
1255 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1257 // Check it again in case a previous version let a bad block in
1261 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1262 // unless those are already completely spent.
1263 // If such overwrites are allowed, coinbases and transactions depending upon those
1264 // can be duplicated to remove the ability to spend the first instance -- even after
1265 // being sent to another address.
1266 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1267 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1268 // already refuses previously-known transaction id's entirely.
1269 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1270 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1271 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1272 BOOST_FOREACH(CTransaction& tx, vtx)
1274 CTxIndex txindexOld;
1275 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1276 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1281 // To avoid being on the short end of a block-chain split,
1282 // don't do secondary validation of pay-to-script-hash transactions
1283 // until blocks with timestamps after paytoscripthashtime (see init.cpp for default).
1284 // This code can be removed once a super-majority of the network has upgraded.
1285 int64 nEvalSwitchTime = GetArg("-paytoscripthashtime", std::numeric_limits<int64_t>::max());
1286 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1288 //// issue here: it doesn't know the version
1289 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1291 map<uint256, CTxIndex> mapQueuedChanges;
1294 BOOST_FOREACH(CTransaction& tx, vtx)
1296 nSigOps += tx.GetLegacySigOpCount();
1297 if (nSigOps > MAX_BLOCK_SIGOPS)
1298 return DoS(100, error("ConnectBlock() : too many sigops"));
1300 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1301 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1303 MapPrevTx mapInputs;
1304 if (!tx.IsCoinBase())
1307 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1310 if (fStrictPayToScriptHash)
1312 // Add in sigops done by pay-to-script-hash inputs;
1313 // this is to prevent a "rogue miner" from creating
1314 // an incredibly-expensive-to-validate block.
1315 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1316 if (nSigOps > MAX_BLOCK_SIGOPS)
1317 return DoS(100, error("ConnectBlock() : too many sigops"));
1320 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1322 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1326 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1329 // Write queued txindex changes
1330 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1332 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1333 return error("ConnectBlock() : UpdateTxIndex failed");
1336 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1339 // Update block index on disk without changing it in memory.
1340 // The memory index structure will be changed after the db commits.
1343 CDiskBlockIndex blockindexPrev(pindex->pprev);
1344 blockindexPrev.hashNext = pindex->GetBlockHash();
1345 if (!txdb.WriteBlockIndex(blockindexPrev))
1346 return error("ConnectBlock() : WriteBlockIndex failed");
1349 // Watch for transactions paying to me
1350 BOOST_FOREACH(CTransaction& tx, vtx)
1351 SyncWithWallets(tx, this, true);
1356 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1358 printf("REORGANIZE\n");
1361 CBlockIndex* pfork = pindexBest;
1362 CBlockIndex* plonger = pindexNew;
1363 while (pfork != plonger)
1365 while (plonger->nHeight > pfork->nHeight)
1366 if (!(plonger = plonger->pprev))
1367 return error("Reorganize() : plonger->pprev is null");
1368 if (pfork == plonger)
1370 if (!(pfork = pfork->pprev))
1371 return error("Reorganize() : pfork->pprev is null");
1374 // List of what to disconnect
1375 vector<CBlockIndex*> vDisconnect;
1376 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1377 vDisconnect.push_back(pindex);
1379 // List of what to connect
1380 vector<CBlockIndex*> vConnect;
1381 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1382 vConnect.push_back(pindex);
1383 reverse(vConnect.begin(), vConnect.end());
1385 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());
1386 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());
1388 // Disconnect shorter branch
1389 vector<CTransaction> vResurrect;
1390 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1393 if (!block.ReadFromDisk(pindex))
1394 return error("Reorganize() : ReadFromDisk for disconnect failed");
1395 if (!block.DisconnectBlock(txdb, pindex))
1396 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1398 // Queue memory transactions to resurrect
1399 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1400 if (!tx.IsCoinBase())
1401 vResurrect.push_back(tx);
1404 // Connect longer branch
1405 vector<CTransaction> vDelete;
1406 for (int i = 0; i < vConnect.size(); i++)
1408 CBlockIndex* pindex = vConnect[i];
1410 if (!block.ReadFromDisk(pindex))
1411 return error("Reorganize() : ReadFromDisk for connect failed");
1412 if (!block.ConnectBlock(txdb, pindex))
1416 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1419 // Queue memory transactions to delete
1420 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1421 vDelete.push_back(tx);
1423 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1424 return error("Reorganize() : WriteHashBestChain failed");
1426 // Make sure it's successfully written to disk before changing memory structure
1427 if (!txdb.TxnCommit())
1428 return error("Reorganize() : TxnCommit failed");
1430 // Disconnect shorter branch
1431 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1433 pindex->pprev->pnext = NULL;
1435 // Connect longer branch
1436 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1438 pindex->pprev->pnext = pindex;
1440 // Resurrect memory transactions that were in the disconnected branch
1441 BOOST_FOREACH(CTransaction& tx, vResurrect)
1442 tx.AcceptToMemoryPool(txdb, false);
1444 // Delete redundant memory transactions that are in the connected branch
1445 BOOST_FOREACH(CTransaction& tx, vDelete)
1446 tx.RemoveFromMemoryPool();
1448 printf("REORGANIZE: done\n");
1455 runCommand(std::string strCommand)
1457 int nErr = ::system(strCommand.c_str());
1459 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1462 // Called from inside SetBestChain: attaches a block to the new best chain being built
1463 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1465 uint256 hash = GetHash();
1467 // Adding to current best branch
1468 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1471 InvalidChainFound(pindexNew);
1474 if (!txdb.TxnCommit())
1475 return error("SetBestChain() : TxnCommit failed");
1477 // Add to current best branch
1478 pindexNew->pprev->pnext = pindexNew;
1480 // Delete redundant memory transactions
1481 BOOST_FOREACH(CTransaction& tx, vtx)
1482 tx.RemoveFromMemoryPool();
1487 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1489 uint256 hash = GetHash();
1492 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1494 txdb.WriteHashBestChain(hash);
1495 if (!txdb.TxnCommit())
1496 return error("SetBestChain() : TxnCommit failed");
1497 pindexGenesisBlock = pindexNew;
1499 else if (hashPrevBlock == hashBestChain)
1501 if (!SetBestChainInner(txdb, pindexNew))
1502 return error("SetBestChain() : SetBestChainInner failed");
1506 // the first block in the new chain that will cause it to become the new best chain
1507 CBlockIndex *pindexIntermediate = pindexNew;
1509 // list of blocks that need to be connected afterwards
1510 std::vector<CBlockIndex*> vpindexSecondary;
1512 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1513 // Try to limit how much needs to be done inside
1514 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1516 vpindexSecondary.push_back(pindexIntermediate);
1517 pindexIntermediate = pindexIntermediate->pprev;
1520 if (!vpindexSecondary.empty())
1521 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1523 // Switch to new best branch
1524 if (!Reorganize(txdb, pindexIntermediate))
1527 InvalidChainFound(pindexNew);
1528 return error("SetBestChain() : Reorganize failed");
1531 // Connect futher blocks
1532 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1535 if (!block.ReadFromDisk(pindex))
1537 printf("SetBestChain() : ReadFromDisk failed\n");
1541 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1542 if (!block.SetBestChainInner(txdb, pindex))
1547 // Update best block in wallet (so we can detect restored wallets)
1548 bool fIsInitialDownload = IsInitialBlockDownload();
1549 if (!fIsInitialDownload)
1551 const CBlockLocator locator(pindexNew);
1552 ::SetBestChain(locator);
1556 hashBestChain = hash;
1557 pindexBest = pindexNew;
1558 nBestHeight = pindexBest->nHeight;
1559 bnBestChainWork = pindexNew->bnChainWork;
1560 nTimeBestReceived = GetTime();
1561 nTransactionsUpdated++;
1562 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1564 std::string strCmd = GetArg("-blocknotify", "");
1566 if (!fIsInitialDownload && !strCmd.empty())
1568 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1569 boost::thread t(runCommand, strCmd); // thread runs free
1576 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1578 // Check for duplicate
1579 uint256 hash = GetHash();
1580 if (mapBlockIndex.count(hash))
1581 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1583 // Construct new block index object
1584 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1586 return error("AddToBlockIndex() : new CBlockIndex failed");
1587 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1588 pindexNew->phashBlock = &((*mi).first);
1589 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1590 if (miPrev != mapBlockIndex.end())
1592 pindexNew->pprev = (*miPrev).second;
1593 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1595 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1599 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1600 if (!txdb.TxnCommit())
1604 if (pindexNew->bnChainWork > bnBestChainWork)
1605 if (!SetBestChain(txdb, pindexNew))
1610 if (pindexNew == pindexBest)
1612 // Notify UI to display prev block's coinbase if it was ours
1613 static uint256 hashPrevBestCoinBase;
1614 UpdatedTransaction(hashPrevBestCoinBase);
1615 hashPrevBestCoinBase = vtx[0].GetHash();
1625 bool CBlock::CheckBlock() const
1627 // These are checks that are independent of context
1628 // that can be verified before saving an orphan block.
1631 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1632 return DoS(100, error("CheckBlock() : size limits failed"));
1634 // Check proof of work matches claimed amount
1635 if (!CheckProofOfWork(GetHash(), nBits))
1636 return DoS(50, error("CheckBlock() : proof of work failed"));
1639 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1640 return error("CheckBlock() : block timestamp too far in the future");
1642 // First transaction must be coinbase, the rest must not be
1643 if (vtx.empty() || !vtx[0].IsCoinBase())
1644 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1645 for (int i = 1; i < vtx.size(); i++)
1646 if (vtx[i].IsCoinBase())
1647 return DoS(100, error("CheckBlock() : more than one coinbase"));
1649 // Check transactions
1650 BOOST_FOREACH(const CTransaction& tx, vtx)
1651 if (!tx.CheckTransaction())
1652 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1655 BOOST_FOREACH(const CTransaction& tx, vtx)
1657 nSigOps += tx.GetLegacySigOpCount();
1659 if (nSigOps > MAX_BLOCK_SIGOPS)
1660 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1663 if (hashMerkleRoot != BuildMerkleTree())
1664 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1669 bool CBlock::AcceptBlock()
1671 // Check for duplicate
1672 uint256 hash = GetHash();
1673 if (mapBlockIndex.count(hash))
1674 return error("AcceptBlock() : block already in mapBlockIndex");
1676 // Get prev block index
1677 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1678 if (mi == mapBlockIndex.end())
1679 return DoS(10, error("AcceptBlock() : prev block not found"));
1680 CBlockIndex* pindexPrev = (*mi).second;
1681 int nHeight = pindexPrev->nHeight+1;
1683 // Check proof of work
1684 if (nBits != GetNextWorkRequired(pindexPrev, this))
1685 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1687 // Check timestamp against prev
1688 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1689 return error("AcceptBlock() : block's timestamp is too early");
1691 // Check that all transactions are finalized
1692 BOOST_FOREACH(const CTransaction& tx, vtx)
1693 if (!tx.IsFinal(nHeight, GetBlockTime()))
1694 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1696 // Check that the block chain matches the known block chain up to a checkpoint
1697 if (!Checkpoints::CheckBlock(nHeight, hash))
1698 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1700 // Write block to history file
1701 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1702 return error("AcceptBlock() : out of disk space");
1703 unsigned int nFile = -1;
1704 unsigned int nBlockPos = 0;
1705 if (!WriteToDisk(nFile, nBlockPos))
1706 return error("AcceptBlock() : WriteToDisk failed");
1707 if (!AddToBlockIndex(nFile, nBlockPos))
1708 return error("AcceptBlock() : AddToBlockIndex failed");
1710 // Relay inventory, but don't relay old inventory during initial block download
1711 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1712 if (hashBestChain == hash)
1713 CRITICAL_BLOCK(cs_vNodes)
1714 BOOST_FOREACH(CNode* pnode, vNodes)
1715 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1716 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1721 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1723 // Check for duplicate
1724 uint256 hash = pblock->GetHash();
1725 if (mapBlockIndex.count(hash))
1726 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1727 if (mapOrphanBlocks.count(hash))
1728 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1730 // Preliminary checks
1731 if (!pblock->CheckBlock())
1732 return error("ProcessBlock() : CheckBlock FAILED");
1734 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1735 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1737 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1738 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1742 pfrom->Misbehaving(100);
1743 return error("ProcessBlock() : block with timestamp before last checkpoint");
1746 bnNewBlock.SetCompact(pblock->nBits);
1748 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1749 if (bnNewBlock > bnRequired)
1752 pfrom->Misbehaving(100);
1753 return error("ProcessBlock() : block with too little proof-of-work");
1758 // If don't already have its previous block, shunt it off to holding area until we get it
1759 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1761 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1762 CBlock* pblock2 = new CBlock(*pblock);
1763 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1764 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1766 // Ask this guy to fill in what we're missing
1768 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1773 if (!pblock->AcceptBlock())
1774 return error("ProcessBlock() : AcceptBlock FAILED");
1776 // Recursively process any orphan blocks that depended on this one
1777 vector<uint256> vWorkQueue;
1778 vWorkQueue.push_back(hash);
1779 for (int i = 0; i < vWorkQueue.size(); i++)
1781 uint256 hashPrev = vWorkQueue[i];
1782 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1783 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1786 CBlock* pblockOrphan = (*mi).second;
1787 if (pblockOrphan->AcceptBlock())
1788 vWorkQueue.push_back(pblockOrphan->GetHash());
1789 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1790 delete pblockOrphan;
1792 mapOrphanBlocksByPrev.erase(hashPrev);
1795 printf("ProcessBlock: ACCEPTED\n");
1806 bool CheckDiskSpace(uint64 nAdditionalBytes)
1808 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1810 // Check for 15MB because database could create another 10MB log file at any time
1811 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1814 string strMessage = _("Warning: Disk space is low ");
1815 strMiscWarning = strMessage;
1816 printf("*** %s\n", strMessage.c_str());
1817 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1818 CreateThread(Shutdown, NULL);
1824 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1828 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1831 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1833 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1842 static unsigned int nCurrentBlockFile = 1;
1844 FILE* AppendBlockFile(unsigned int& nFileRet)
1849 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1852 if (fseek(file, 0, SEEK_END) != 0)
1854 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1855 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1857 nFileRet = nCurrentBlockFile;
1861 nCurrentBlockFile++;
1865 bool LoadBlockIndex(bool fAllowNew)
1869 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1870 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1871 pchMessageStart[0] = 0xfa;
1872 pchMessageStart[1] = 0xbf;
1873 pchMessageStart[2] = 0xb5;
1874 pchMessageStart[3] = 0xda;
1881 if (!txdb.LoadBlockIndex())
1886 // Init with genesis block
1888 if (mapBlockIndex.empty())
1894 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1895 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1896 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1897 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1898 // vMerkleTree: 4a5e1e
1901 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1903 txNew.vin.resize(1);
1904 txNew.vout.resize(1);
1905 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1906 txNew.vout[0].nValue = 50 * COIN;
1907 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1909 block.vtx.push_back(txNew);
1910 block.hashPrevBlock = 0;
1911 block.hashMerkleRoot = block.BuildMerkleTree();
1913 block.nTime = 1231006505;
1914 block.nBits = 0x1d00ffff;
1915 block.nNonce = 2083236893;
1919 block.nTime = 1296688602;
1920 block.nBits = 0x1d07fff8;
1921 block.nNonce = 384568319;
1925 printf("%s\n", block.GetHash().ToString().c_str());
1926 printf("%s\n", hashGenesisBlock.ToString().c_str());
1927 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1928 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1930 assert(block.GetHash() == hashGenesisBlock);
1932 // Start new block file
1934 unsigned int nBlockPos;
1935 if (!block.WriteToDisk(nFile, nBlockPos))
1936 return error("LoadBlockIndex() : writing genesis block to disk failed");
1937 if (!block.AddToBlockIndex(nFile, nBlockPos))
1938 return error("LoadBlockIndex() : genesis block not accepted");
1946 void PrintBlockTree()
1948 // precompute tree structure
1949 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1950 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1952 CBlockIndex* pindex = (*mi).second;
1953 mapNext[pindex->pprev].push_back(pindex);
1955 //while (rand() % 3 == 0)
1956 // mapNext[pindex->pprev].push_back(pindex);
1959 vector<pair<int, CBlockIndex*> > vStack;
1960 vStack.push_back(make_pair(0, pindexGenesisBlock));
1963 while (!vStack.empty())
1965 int nCol = vStack.back().first;
1966 CBlockIndex* pindex = vStack.back().second;
1969 // print split or gap
1970 if (nCol > nPrevCol)
1972 for (int i = 0; i < nCol-1; i++)
1976 else if (nCol < nPrevCol)
1978 for (int i = 0; i < nCol; i++)
1985 for (int i = 0; i < nCol; i++)
1990 block.ReadFromDisk(pindex);
1991 printf("%d (%u,%u) %s %s tx %d",
1995 block.GetHash().ToString().substr(0,20).c_str(),
1996 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1999 PrintWallets(block);
2001 // put the main timechain first
2002 vector<CBlockIndex*>& vNext = mapNext[pindex];
2003 for (int i = 0; i < vNext.size(); i++)
2005 if (vNext[i]->pnext)
2007 swap(vNext[0], vNext[i]);
2013 for (int i = 0; i < vNext.size(); i++)
2014 vStack.push_back(make_pair(nCol+i, vNext[i]));
2027 //////////////////////////////////////////////////////////////////////////////
2032 map<uint256, CAlert> mapAlerts;
2033 CCriticalSection cs_mapAlerts;
2035 string GetWarnings(string strFor)
2038 string strStatusBar;
2040 if (GetBoolArg("-testsafemode"))
2043 // Misc warnings like out of disk space and clock is wrong
2044 if (strMiscWarning != "")
2047 strStatusBar = strMiscWarning;
2050 // Longer invalid proof-of-work chain
2051 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2054 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2058 CRITICAL_BLOCK(cs_mapAlerts)
2060 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2062 const CAlert& alert = item.second;
2063 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2065 nPriority = alert.nPriority;
2066 strStatusBar = alert.strStatusBar;
2071 if (strFor == "statusbar")
2072 return strStatusBar;
2073 else if (strFor == "rpc")
2075 assert(!"GetWarnings() : invalid parameter");
2079 bool CAlert::ProcessAlert()
2081 if (!CheckSignature())
2086 CRITICAL_BLOCK(cs_mapAlerts)
2088 // Cancel previous alerts
2089 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2091 const CAlert& alert = (*mi).second;
2094 printf("cancelling alert %d\n", alert.nID);
2095 mapAlerts.erase(mi++);
2097 else if (!alert.IsInEffect())
2099 printf("expiring alert %d\n", alert.nID);
2100 mapAlerts.erase(mi++);
2106 // Check if this alert has been cancelled
2107 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2109 const CAlert& alert = item.second;
2110 if (alert.Cancels(*this))
2112 printf("alert already cancelled by %d\n", alert.nID);
2118 mapAlerts.insert(make_pair(GetHash(), *this));
2121 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2133 //////////////////////////////////////////////////////////////////////////////
2139 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2143 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2144 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2146 // Don't know what it is, just say we already got one
2153 // The message start string is designed to be unlikely to occur in normal data.
2154 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2155 // a large 4-byte int at any alignment.
2156 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2159 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2161 static map<CService, vector<unsigned char> > mapReuseKey;
2162 RandAddSeedPerfmon();
2164 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2165 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2167 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2169 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2177 if (strCommand == "version")
2179 // Each connection can only send one version message
2180 if (pfrom->nVersion != 0)
2182 pfrom->Misbehaving(1);
2190 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2191 if (pfrom->nVersion < 209)
2193 // Since February 20, 2012, the protocol is initiated at version 209,
2194 // and earlier versions are no longer supported
2195 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2196 pfrom->fDisconnect = true;
2200 if (pfrom->nVersion == 10300)
2201 pfrom->nVersion = 300;
2203 vRecv >> addrFrom >> nNonce;
2205 vRecv >> pfrom->strSubVer;
2207 vRecv >> pfrom->nStartingHeight;
2209 // Disconnect if we connected to ourself
2210 if (nNonce == nLocalHostNonce && nNonce > 1)
2212 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2213 pfrom->fDisconnect = true;
2217 // Be shy and don't send version until we hear
2218 if (pfrom->fInbound)
2219 pfrom->PushVersion();
2221 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2223 AddTimeData(pfrom->addr, nTime);
2226 pfrom->PushMessage("verack");
2227 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2229 if (!pfrom->fInbound)
2231 // Advertise our address
2232 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2233 !IsInitialBlockDownload())
2235 CAddress addr(addrLocalHost);
2236 addr.nTime = GetAdjustedTime();
2237 pfrom->PushAddress(addr);
2240 // Get recent addresses
2241 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2243 pfrom->PushMessage("getaddr");
2244 pfrom->fGetAddr = true;
2248 // Ask the first connected node for block updates
2249 static int nAskedForBlocks = 0;
2250 if (!pfrom->fClient &&
2251 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2252 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2255 pfrom->PushGetBlocks(pindexBest, uint256(0));
2259 CRITICAL_BLOCK(cs_mapAlerts)
2260 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2261 item.second.RelayTo(pfrom);
2263 pfrom->fSuccessfullyConnected = true;
2265 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2267 cPeerBlockCounts.input(pfrom->nStartingHeight);
2271 else if (pfrom->nVersion == 0)
2273 // Must have a version message before anything else
2274 pfrom->Misbehaving(1);
2279 else if (strCommand == "verack")
2281 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2285 else if (strCommand == "addr")
2287 vector<CAddress> vAddr;
2290 // Don't want addr from older versions unless seeding
2291 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2293 if (vAddr.size() > 1000)
2295 pfrom->Misbehaving(20);
2296 return error("message addr size() = %d", vAddr.size());
2299 // Store the new addresses
2302 int64 nNow = GetAdjustedTime();
2303 int64 nSince = nNow - 10 * 60;
2304 BOOST_FOREACH(CAddress& addr, vAddr)
2308 // ignore IPv6 for now, since it isn't implemented anyway
2311 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2312 addr.nTime = nNow - 5 * 24 * 60 * 60;
2313 AddAddress(addr, 2 * 60 * 60, &addrDB);
2314 pfrom->AddAddressKnown(addr);
2315 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2317 // Relay to a limited number of other nodes
2318 CRITICAL_BLOCK(cs_vNodes)
2320 // Use deterministic randomness to send to the same nodes for 24 hours
2321 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2322 static uint256 hashSalt;
2324 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2325 int64 hashAddr = addr.GetHash();
2326 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2327 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2328 multimap<uint256, CNode*> mapMix;
2329 BOOST_FOREACH(CNode* pnode, vNodes)
2331 if (pnode->nVersion < 31402)
2333 unsigned int nPointer;
2334 memcpy(&nPointer, &pnode, sizeof(nPointer));
2335 uint256 hashKey = hashRand ^ nPointer;
2336 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2337 mapMix.insert(make_pair(hashKey, pnode));
2339 int nRelayNodes = 2;
2340 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2341 ((*mi).second)->PushAddress(addr);
2345 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2346 if (vAddr.size() < 1000)
2347 pfrom->fGetAddr = false;
2351 else if (strCommand == "inv")
2355 if (vInv.size() > 50000)
2357 pfrom->Misbehaving(20);
2358 return error("message inv size() = %d", vInv.size());
2362 for (int nInv = 0; nInv < vInv.size(); nInv++)
2364 const CInv &inv = vInv[nInv];
2368 pfrom->AddInventoryKnown(inv);
2370 bool fAlreadyHave = AlreadyHave(txdb, inv);
2372 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2374 // Always request the last block in an inv bundle (even if we already have it), as it is the
2375 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2376 // this is necessary to connect earlier received orphan blocks to the chain again.
2377 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2379 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2380 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2382 // Track requests for our stuff
2383 Inventory(inv.hash);
2388 else if (strCommand == "getdata")
2392 if (vInv.size() > 50000)
2394 pfrom->Misbehaving(20);
2395 return error("message getdata size() = %d", vInv.size());
2398 BOOST_FOREACH(const CInv& inv, vInv)
2402 printf("received getdata for: %s\n", inv.ToString().c_str());
2404 if (inv.type == MSG_BLOCK)
2406 // Send block from disk
2407 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2408 if (mi != mapBlockIndex.end())
2411 block.ReadFromDisk((*mi).second);
2412 pfrom->PushMessage("block", block);
2414 // Trigger them to send a getblocks request for the next batch of inventory
2415 if (inv.hash == pfrom->hashContinue)
2417 // Bypass PushInventory, this must send even if redundant,
2418 // and we want it right after the last block so they don't
2419 // wait for other stuff first.
2421 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2422 pfrom->PushMessage("inv", vInv);
2423 pfrom->hashContinue = 0;
2427 else if (inv.IsKnownType())
2429 // Send stream from relay memory
2430 CRITICAL_BLOCK(cs_mapRelay)
2432 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2433 if (mi != mapRelay.end())
2434 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2438 // Track requests for our stuff
2439 Inventory(inv.hash);
2444 else if (strCommand == "getblocks")
2446 CBlockLocator locator;
2448 vRecv >> locator >> hashStop;
2450 // Find the last block the caller has in the main chain
2451 CBlockIndex* pindex = locator.GetBlockIndex();
2453 // Send the rest of the chain
2455 pindex = pindex->pnext;
2456 int nLimit = 500 + locator.GetDistanceBack();
2457 unsigned int nBytes = 0;
2458 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2459 for (; pindex; pindex = pindex->pnext)
2461 if (pindex->GetBlockHash() == hashStop)
2463 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2466 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2468 block.ReadFromDisk(pindex, true);
2469 nBytes += block.GetSerializeSize(SER_NETWORK);
2470 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2472 // When this block is requested, we'll send an inv that'll make them
2473 // getblocks the next batch of inventory.
2474 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2475 pfrom->hashContinue = pindex->GetBlockHash();
2482 else if (strCommand == "getheaders")
2484 CBlockLocator locator;
2486 vRecv >> locator >> hashStop;
2488 CBlockIndex* pindex = NULL;
2489 if (locator.IsNull())
2491 // If locator is null, return the hashStop block
2492 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2493 if (mi == mapBlockIndex.end())
2495 pindex = (*mi).second;
2499 // Find the last block the caller has in the main chain
2500 pindex = locator.GetBlockIndex();
2502 pindex = pindex->pnext;
2505 vector<CBlock> vHeaders;
2506 int nLimit = 2000 + locator.GetDistanceBack();
2507 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2508 for (; pindex; pindex = pindex->pnext)
2510 vHeaders.push_back(pindex->GetBlockHeader());
2511 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2514 pfrom->PushMessage("headers", vHeaders);
2518 else if (strCommand == "tx")
2520 vector<uint256> vWorkQueue;
2521 CDataStream vMsg(vRecv);
2525 CInv inv(MSG_TX, tx.GetHash());
2526 pfrom->AddInventoryKnown(inv);
2528 bool fMissingInputs = false;
2529 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2531 SyncWithWallets(tx, NULL, true);
2532 RelayMessage(inv, vMsg);
2533 mapAlreadyAskedFor.erase(inv);
2534 vWorkQueue.push_back(inv.hash);
2536 // Recursively process any orphan transactions that depended on this one
2537 for (int i = 0; i < vWorkQueue.size(); i++)
2539 uint256 hashPrev = vWorkQueue[i];
2540 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2541 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2544 const CDataStream& vMsg = *((*mi).second);
2546 CDataStream(vMsg) >> tx;
2547 CInv inv(MSG_TX, tx.GetHash());
2549 if (tx.AcceptToMemoryPool(true))
2551 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2552 SyncWithWallets(tx, NULL, true);
2553 RelayMessage(inv, vMsg);
2554 mapAlreadyAskedFor.erase(inv);
2555 vWorkQueue.push_back(inv.hash);
2560 BOOST_FOREACH(uint256 hash, vWorkQueue)
2561 EraseOrphanTx(hash);
2563 else if (fMissingInputs)
2565 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2568 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2569 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2571 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2573 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2577 else if (strCommand == "block")
2582 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2585 CInv inv(MSG_BLOCK, block.GetHash());
2586 pfrom->AddInventoryKnown(inv);
2588 if (ProcessBlock(pfrom, &block))
2589 mapAlreadyAskedFor.erase(inv);
2590 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2594 else if (strCommand == "getaddr")
2596 // Nodes rebroadcast an addr every 24 hours
2597 pfrom->vAddrToSend.clear();
2598 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2599 CRITICAL_BLOCK(cs_mapAddresses)
2601 unsigned int nCount = 0;
2602 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2604 const CAddress& addr = item.second;
2605 if (addr.nTime > nSince)
2608 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2610 const CAddress& addr = item.second;
2611 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2612 pfrom->PushAddress(addr);
2618 else if (strCommand == "checkorder")
2623 if (!GetBoolArg("-allowreceivebyip"))
2625 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2632 /// we have a chance to check the order here
2634 // Keep giving the same key to the same ip until they use it
2635 if (!mapReuseKey.count(pfrom->addr))
2636 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2638 // Send back approval of order and pubkey to use
2639 CScript scriptPubKey;
2640 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2641 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2645 else if (strCommand == "reply")
2650 CRequestTracker tracker;
2651 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2653 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2654 if (mi != pfrom->mapRequests.end())
2656 tracker = (*mi).second;
2657 pfrom->mapRequests.erase(mi);
2660 if (!tracker.IsNull())
2661 tracker.fn(tracker.param1, vRecv);
2665 else if (strCommand == "ping")
2670 else if (strCommand == "alert")
2675 if (alert.ProcessAlert())
2678 pfrom->setKnown.insert(alert.GetHash());
2679 CRITICAL_BLOCK(cs_vNodes)
2680 BOOST_FOREACH(CNode* pnode, vNodes)
2681 alert.RelayTo(pnode);
2688 // Ignore unknown commands for extensibility
2692 // Update the last seen time for this node's address
2693 if (pfrom->fNetworkNode)
2694 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2695 AddressCurrentlyConnected(pfrom->addr);
2701 bool ProcessMessages(CNode* pfrom)
2703 CDataStream& vRecv = pfrom->vRecv;
2707 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2711 // (4) message start
2720 // Scan for message start
2721 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2722 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2723 if (vRecv.end() - pstart < nHeaderSize)
2725 if (vRecv.size() > nHeaderSize)
2727 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2728 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2732 if (pstart - vRecv.begin() > 0)
2733 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2734 vRecv.erase(vRecv.begin(), pstart);
2737 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2742 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2745 string strCommand = hdr.GetCommand();
2748 unsigned int nMessageSize = hdr.nMessageSize;
2749 if (nMessageSize > MAX_SIZE)
2751 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2754 if (nMessageSize > vRecv.size())
2756 // Rewind and wait for rest of message
2757 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2762 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2763 unsigned int nChecksum = 0;
2764 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2765 if (nChecksum != hdr.nChecksum)
2767 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2768 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2772 // Copy message to its own buffer
2773 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2774 vRecv.ignore(nMessageSize);
2780 CRITICAL_BLOCK(cs_main)
2781 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2785 catch (std::ios_base::failure& e)
2787 if (strstr(e.what(), "end of data"))
2789 // Allow exceptions from underlength message on vRecv
2790 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());
2792 else if (strstr(e.what(), "size too large"))
2794 // Allow exceptions from overlong size
2795 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2799 PrintExceptionContinue(&e, "ProcessMessage()");
2802 catch (std::exception& e) {
2803 PrintExceptionContinue(&e, "ProcessMessage()");
2805 PrintExceptionContinue(NULL, "ProcessMessage()");
2809 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2817 bool SendMessages(CNode* pto, bool fSendTrickle)
2819 CRITICAL_BLOCK(cs_main)
2821 // Don't send anything until we get their version message
2822 if (pto->nVersion == 0)
2826 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2827 pto->PushMessage("ping");
2829 // Resend wallet transactions that haven't gotten in a block yet
2830 ResendWalletTransactions();
2832 // Address refresh broadcast
2833 static int64 nLastRebroadcast;
2834 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2836 CRITICAL_BLOCK(cs_vNodes)
2838 BOOST_FOREACH(CNode* pnode, vNodes)
2840 // Periodically clear setAddrKnown to allow refresh broadcasts
2841 if (nLastRebroadcast)
2842 pnode->setAddrKnown.clear();
2844 // Rebroadcast our address
2845 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2847 CAddress addr(addrLocalHost);
2848 addr.nTime = GetAdjustedTime();
2849 pnode->PushAddress(addr);
2853 nLastRebroadcast = GetTime();
2856 // Clear out old addresses periodically so it's not too much work at once
2857 static int64 nLastClear;
2858 if (nLastClear == 0)
2859 nLastClear = GetTime();
2860 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2862 nLastClear = GetTime();
2863 CRITICAL_BLOCK(cs_mapAddresses)
2866 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2867 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2868 mi != mapAddresses.end();)
2870 const CAddress& addr = (*mi).second;
2871 if (addr.nTime < nSince)
2873 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2875 addrdb.EraseAddress(addr);
2876 mapAddresses.erase(mi++);
2890 vector<CAddress> vAddr;
2891 vAddr.reserve(pto->vAddrToSend.size());
2892 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2894 // returns true if wasn't already contained in the set
2895 if (pto->setAddrKnown.insert(addr).second)
2897 vAddr.push_back(addr);
2898 // receiver rejects addr messages larger than 1000
2899 if (vAddr.size() >= 1000)
2901 pto->PushMessage("addr", vAddr);
2906 pto->vAddrToSend.clear();
2908 pto->PushMessage("addr", vAddr);
2913 // Message: inventory
2916 vector<CInv> vInvWait;
2917 CRITICAL_BLOCK(pto->cs_inventory)
2919 vInv.reserve(pto->vInventoryToSend.size());
2920 vInvWait.reserve(pto->vInventoryToSend.size());
2921 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2923 if (pto->setInventoryKnown.count(inv))
2926 // trickle out tx inv to protect privacy
2927 if (inv.type == MSG_TX && !fSendTrickle)
2929 // 1/4 of tx invs blast to all immediately
2930 static uint256 hashSalt;
2932 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2933 uint256 hashRand = inv.hash ^ hashSalt;
2934 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2935 bool fTrickleWait = ((hashRand & 3) != 0);
2937 // always trickle our own transactions
2941 if (GetTransaction(inv.hash, wtx))
2943 fTrickleWait = true;
2948 vInvWait.push_back(inv);
2953 // returns true if wasn't already contained in the set
2954 if (pto->setInventoryKnown.insert(inv).second)
2956 vInv.push_back(inv);
2957 if (vInv.size() >= 1000)
2959 pto->PushMessage("inv", vInv);
2964 pto->vInventoryToSend = vInvWait;
2967 pto->PushMessage("inv", vInv);
2973 vector<CInv> vGetData;
2974 int64 nNow = GetTime() * 1000000;
2976 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2978 const CInv& inv = (*pto->mapAskFor.begin()).second;
2979 if (!AlreadyHave(txdb, inv))
2981 printf("sending getdata: %s\n", inv.ToString().c_str());
2982 vGetData.push_back(inv);
2983 if (vGetData.size() >= 1000)
2985 pto->PushMessage("getdata", vGetData);
2989 mapAlreadyAskedFor[inv] = nNow;
2990 pto->mapAskFor.erase(pto->mapAskFor.begin());
2992 if (!vGetData.empty())
2993 pto->PushMessage("getdata", vGetData);
3012 //////////////////////////////////////////////////////////////////////////////
3017 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3019 unsigned char* pdata = (unsigned char*)pbuffer;
3020 unsigned int blocks = 1 + ((len + 8) / 64);
3021 unsigned char* pend = pdata + 64 * blocks;
3022 memset(pdata + len, 0, 64 * blocks - len);
3024 unsigned int bits = len * 8;
3025 pend[-1] = (bits >> 0) & 0xff;
3026 pend[-2] = (bits >> 8) & 0xff;
3027 pend[-3] = (bits >> 16) & 0xff;
3028 pend[-4] = (bits >> 24) & 0xff;
3032 static const unsigned int pSHA256InitState[8] =
3033 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3035 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3038 unsigned char data[64];
3042 for (int i = 0; i < 16; i++)
3043 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3045 for (int i = 0; i < 8; i++)
3046 ctx.h[i] = ((uint32_t*)pinit)[i];
3048 SHA256_Update(&ctx, data, sizeof(data));
3049 for (int i = 0; i < 8; i++)
3050 ((uint32_t*)pstate)[i] = ctx.h[i];
3054 // ScanHash scans nonces looking for a hash with at least some zero bits.
3055 // It operates on big endian data. Caller does the byte reversing.
3056 // All input buffers are 16-byte aligned. nNonce is usually preserved
3057 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3058 // the block is rebuilt and nNonce starts over at zero.
3060 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3062 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3066 // Hash pdata using pmidstate as the starting state into
3067 // preformatted buffer phash1, then hash phash1 into phash
3069 SHA256Transform(phash1, pdata, pmidstate);
3070 SHA256Transform(phash, phash1, pSHA256InitState);
3072 // Return the nonce if the hash has at least some zero bits,
3073 // caller will check if it has enough to reach the target
3074 if (((unsigned short*)phash)[14] == 0)
3077 // If nothing found after trying for a while, return -1
3078 if ((nNonce & 0xffff) == 0)
3080 nHashesDone = 0xffff+1;
3086 // Some explaining would be appreciated
3091 set<uint256> setDependsOn;
3094 COrphan(CTransaction* ptxIn)
3102 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3103 BOOST_FOREACH(uint256 hash, setDependsOn)
3104 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3109 uint64 nLastBlockTx = 0;
3110 uint64 nLastBlockSize = 0;
3112 CBlock* CreateNewBlock(CReserveKey& reservekey)
3114 CBlockIndex* pindexPrev = pindexBest;
3117 auto_ptr<CBlock> pblock(new CBlock());
3121 // Create coinbase tx
3123 txNew.vin.resize(1);
3124 txNew.vin[0].prevout.SetNull();
3125 txNew.vout.resize(1);
3126 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3128 // Add our coinbase tx as first transaction
3129 pblock->vtx.push_back(txNew);
3131 // Collect memory pool transactions into the block
3133 CRITICAL_BLOCK(cs_main)
3134 CRITICAL_BLOCK(cs_mapTransactions)
3138 // Priority order to process transactions
3139 list<COrphan> vOrphan; // list memory doesn't move
3140 map<uint256, vector<COrphan*> > mapDependers;
3141 multimap<double, CTransaction*> mapPriority;
3142 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3144 CTransaction& tx = (*mi).second;
3145 if (tx.IsCoinBase() || !tx.IsFinal())
3148 COrphan* porphan = NULL;
3149 double dPriority = 0;
3150 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3152 // Read prev transaction
3153 CTransaction txPrev;
3155 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3157 // Has to wait for dependencies
3160 // Use list for automatic deletion
3161 vOrphan.push_back(COrphan(&tx));
3162 porphan = &vOrphan.back();
3164 mapDependers[txin.prevout.hash].push_back(porphan);
3165 porphan->setDependsOn.insert(txin.prevout.hash);
3168 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3170 // Read block header
3171 int nConf = txindex.GetDepthInMainChain();
3173 dPriority += (double)nValueIn * nConf;
3175 if (fDebug && GetBoolArg("-printpriority"))
3176 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3179 // Priority is sum(valuein * age) / txsize
3180 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3183 porphan->dPriority = dPriority;
3185 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3187 if (fDebug && GetBoolArg("-printpriority"))
3189 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3196 // Collect transactions into block
3197 map<uint256, CTxIndex> mapTestPool;
3198 uint64 nBlockSize = 1000;
3199 uint64 nBlockTx = 0;
3200 int nBlockSigOps = 100;
3201 while (!mapPriority.empty())
3203 // Take highest priority transaction off priority queue
3204 double dPriority = -(*mapPriority.begin()).first;
3205 CTransaction& tx = *(*mapPriority.begin()).second;
3206 mapPriority.erase(mapPriority.begin());
3209 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3210 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3213 // Legacy limits on sigOps:
3214 int nTxSigOps = tx.GetLegacySigOpCount();
3215 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3218 // Transaction fee required depends on block size
3219 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3220 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3222 // Connecting shouldn't fail due to dependency on other memory pool transactions
3223 // because we're already processing them in order of dependency
3224 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3225 MapPrevTx mapInputs;
3227 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3230 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3231 if (nTxFees < nMinFee)
3234 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3235 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3238 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3240 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3241 swap(mapTestPool, mapTestPoolTmp);
3244 pblock->vtx.push_back(tx);
3245 nBlockSize += nTxSize;
3247 nBlockSigOps += nTxSigOps;
3250 // Add transactions that depend on this one to the priority queue
3251 uint256 hash = tx.GetHash();
3252 if (mapDependers.count(hash))
3254 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3256 if (!porphan->setDependsOn.empty())
3258 porphan->setDependsOn.erase(hash);
3259 if (porphan->setDependsOn.empty())
3260 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3266 nLastBlockTx = nBlockTx;
3267 nLastBlockSize = nBlockSize;
3268 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3271 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3274 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3275 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3276 pblock->UpdateTime(pindexPrev);
3277 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3280 return pblock.release();
3284 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3286 // Update nExtraNonce
3287 static uint256 hashPrevBlock;
3288 if (hashPrevBlock != pblock->hashPrevBlock)
3291 hashPrevBlock = pblock->hashPrevBlock;
3294 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3295 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3297 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3301 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3304 // Prebuild hash buffers
3311 uint256 hashPrevBlock;
3312 uint256 hashMerkleRoot;
3315 unsigned int nNonce;
3318 unsigned char pchPadding0[64];
3320 unsigned char pchPadding1[64];
3323 memset(&tmp, 0, sizeof(tmp));
3325 tmp.block.nVersion = pblock->nVersion;
3326 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3327 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3328 tmp.block.nTime = pblock->nTime;
3329 tmp.block.nBits = pblock->nBits;
3330 tmp.block.nNonce = pblock->nNonce;
3332 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3333 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3335 // Byte swap all the input buffer
3336 for (int i = 0; i < sizeof(tmp)/4; i++)
3337 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3339 // Precalc the first half of the first hash, which stays constant
3340 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3342 memcpy(pdata, &tmp.block, 128);
3343 memcpy(phash1, &tmp.hash1, 64);
3347 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3349 uint256 hash = pblock->GetHash();
3350 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3352 if (hash > hashTarget)
3356 printf("BitcoinMiner:\n");
3357 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3359 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3360 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3363 CRITICAL_BLOCK(cs_main)
3365 if (pblock->hashPrevBlock != hashBestChain)
3366 return error("BitcoinMiner : generated block is stale");
3368 // Remove key from key pool
3369 reservekey.KeepKey();
3371 // Track how many getdata requests this block gets
3372 CRITICAL_BLOCK(wallet.cs_wallet)
3373 wallet.mapRequestCount[pblock->GetHash()] = 0;
3375 // Process this block the same as if we had received it from another node
3376 if (!ProcessBlock(NULL, pblock))
3377 return error("BitcoinMiner : ProcessBlock, block not accepted");
3383 void static ThreadBitcoinMiner(void* parg);
3385 static bool fGenerateBitcoins = false;
3386 static bool fLimitProcessors = false;
3387 static int nLimitProcessors = -1;
3389 void static BitcoinMiner(CWallet *pwallet)
3391 printf("BitcoinMiner started\n");
3392 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3394 // Each thread has its own key and counter
3395 CReserveKey reservekey(pwallet);
3396 unsigned int nExtraNonce = 0;
3398 while (fGenerateBitcoins)
3400 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3404 while (vNodes.empty() || IsInitialBlockDownload())
3409 if (!fGenerateBitcoins)
3417 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3418 CBlockIndex* pindexPrev = pindexBest;
3420 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3423 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3425 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3429 // Prebuild hash buffers
3431 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3432 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3433 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3435 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3437 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3438 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3439 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3445 int64 nStart = GetTime();
3446 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3448 uint256& hash = *alignup<16>(hashbuf);
3451 unsigned int nHashesDone = 0;
3452 unsigned int nNonceFound;
3455 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3456 (char*)&hash, nHashesDone);
3458 // Check if something found
3459 if (nNonceFound != -1)
3461 for (int i = 0; i < sizeof(hash)/4; i++)
3462 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3464 if (hash <= hashTarget)
3467 pblock->nNonce = ByteReverse(nNonceFound);
3468 assert(hash == pblock->GetHash());
3470 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3471 CheckWork(pblock.get(), *pwalletMain, reservekey);
3472 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3478 static int64 nHashCounter;
3479 if (nHPSTimerStart == 0)
3481 nHPSTimerStart = GetTimeMillis();
3485 nHashCounter += nHashesDone;
3486 if (GetTimeMillis() - nHPSTimerStart > 4000)
3488 static CCriticalSection cs;
3491 if (GetTimeMillis() - nHPSTimerStart > 4000)
3493 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3494 nHPSTimerStart = GetTimeMillis();
3496 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3497 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3498 static int64 nLogTime;
3499 if (GetTime() - nLogTime > 30 * 60)
3501 nLogTime = GetTime();
3502 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3503 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3509 // Check for stop or if block needs to be rebuilt
3512 if (!fGenerateBitcoins)
3514 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3518 if (nBlockNonce >= 0xffff0000)
3520 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3522 if (pindexPrev != pindexBest)
3525 // Update nTime every few seconds
3526 pblock->UpdateTime(pindexPrev);
3527 nBlockTime = ByteReverse(pblock->nTime);
3530 // Changing pblock->nTime can change work required on testnet:
3531 nBlockBits = ByteReverse(pblock->nBits);
3532 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3538 void static ThreadBitcoinMiner(void* parg)
3540 CWallet* pwallet = (CWallet*)parg;
3543 vnThreadsRunning[THREAD_MINER]++;
3544 BitcoinMiner(pwallet);
3545 vnThreadsRunning[THREAD_MINER]--;
3547 catch (std::exception& e) {
3548 vnThreadsRunning[THREAD_MINER]--;
3549 PrintException(&e, "ThreadBitcoinMiner()");
3551 vnThreadsRunning[THREAD_MINER]--;
3552 PrintException(NULL, "ThreadBitcoinMiner()");
3554 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3556 if (vnThreadsRunning[THREAD_MINER] == 0)
3558 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3562 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3564 fGenerateBitcoins = fGenerate;
3565 nLimitProcessors = GetArg("-genproclimit", -1);
3566 if (nLimitProcessors == 0)
3567 fGenerateBitcoins = false;
3568 fLimitProcessors = (nLimitProcessors != -1);
3572 int nProcessors = boost::thread::hardware_concurrency();
3573 printf("%d processors\n", nProcessors);
3574 if (nProcessors < 1)
3576 if (fLimitProcessors && nProcessors > nLimitProcessors)
3577 nProcessors = nLimitProcessors;
3578 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3579 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3580 for (int i = 0; i < nAddThreads; i++)
3582 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3583 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");