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 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1282 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1283 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1285 //// issue here: it doesn't know the version
1286 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1288 map<uint256, CTxIndex> mapQueuedChanges;
1291 BOOST_FOREACH(CTransaction& tx, vtx)
1293 nSigOps += tx.GetLegacySigOpCount();
1294 if (nSigOps > MAX_BLOCK_SIGOPS)
1295 return DoS(100, error("ConnectBlock() : too many sigops"));
1297 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1298 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1300 MapPrevTx mapInputs;
1301 if (!tx.IsCoinBase())
1304 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1307 if (fStrictPayToScriptHash)
1309 // Add in sigops done by pay-to-script-hash inputs;
1310 // this is to prevent a "rogue miner" from creating
1311 // an incredibly-expensive-to-validate block.
1312 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1313 if (nSigOps > MAX_BLOCK_SIGOPS)
1314 return DoS(100, error("ConnectBlock() : too many sigops"));
1317 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1319 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1323 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1326 // Write queued txindex changes
1327 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1329 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1330 return error("ConnectBlock() : UpdateTxIndex failed");
1333 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1336 // Update block index on disk without changing it in memory.
1337 // The memory index structure will be changed after the db commits.
1340 CDiskBlockIndex blockindexPrev(pindex->pprev);
1341 blockindexPrev.hashNext = pindex->GetBlockHash();
1342 if (!txdb.WriteBlockIndex(blockindexPrev))
1343 return error("ConnectBlock() : WriteBlockIndex failed");
1346 // Watch for transactions paying to me
1347 BOOST_FOREACH(CTransaction& tx, vtx)
1348 SyncWithWallets(tx, this, true);
1353 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1355 printf("REORGANIZE\n");
1358 CBlockIndex* pfork = pindexBest;
1359 CBlockIndex* plonger = pindexNew;
1360 while (pfork != plonger)
1362 while (plonger->nHeight > pfork->nHeight)
1363 if (!(plonger = plonger->pprev))
1364 return error("Reorganize() : plonger->pprev is null");
1365 if (pfork == plonger)
1367 if (!(pfork = pfork->pprev))
1368 return error("Reorganize() : pfork->pprev is null");
1371 // List of what to disconnect
1372 vector<CBlockIndex*> vDisconnect;
1373 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1374 vDisconnect.push_back(pindex);
1376 // List of what to connect
1377 vector<CBlockIndex*> vConnect;
1378 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1379 vConnect.push_back(pindex);
1380 reverse(vConnect.begin(), vConnect.end());
1382 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());
1383 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());
1385 // Disconnect shorter branch
1386 vector<CTransaction> vResurrect;
1387 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1390 if (!block.ReadFromDisk(pindex))
1391 return error("Reorganize() : ReadFromDisk for disconnect failed");
1392 if (!block.DisconnectBlock(txdb, pindex))
1393 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1395 // Queue memory transactions to resurrect
1396 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1397 if (!tx.IsCoinBase())
1398 vResurrect.push_back(tx);
1401 // Connect longer branch
1402 vector<CTransaction> vDelete;
1403 for (int i = 0; i < vConnect.size(); i++)
1405 CBlockIndex* pindex = vConnect[i];
1407 if (!block.ReadFromDisk(pindex))
1408 return error("Reorganize() : ReadFromDisk for connect failed");
1409 if (!block.ConnectBlock(txdb, pindex))
1413 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1416 // Queue memory transactions to delete
1417 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1418 vDelete.push_back(tx);
1420 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1421 return error("Reorganize() : WriteHashBestChain failed");
1423 // Make sure it's successfully written to disk before changing memory structure
1424 if (!txdb.TxnCommit())
1425 return error("Reorganize() : TxnCommit failed");
1427 // Disconnect shorter branch
1428 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1430 pindex->pprev->pnext = NULL;
1432 // Connect longer branch
1433 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1435 pindex->pprev->pnext = pindex;
1437 // Resurrect memory transactions that were in the disconnected branch
1438 BOOST_FOREACH(CTransaction& tx, vResurrect)
1439 tx.AcceptToMemoryPool(txdb, false);
1441 // Delete redundant memory transactions that are in the connected branch
1442 BOOST_FOREACH(CTransaction& tx, vDelete)
1443 tx.RemoveFromMemoryPool();
1445 printf("REORGANIZE: done\n");
1452 runCommand(std::string strCommand)
1454 int nErr = ::system(strCommand.c_str());
1456 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1459 // Called from inside SetBestChain: attaches a block to the new best chain being built
1460 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1462 uint256 hash = GetHash();
1464 // Adding to current best branch
1465 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1468 InvalidChainFound(pindexNew);
1471 if (!txdb.TxnCommit())
1472 return error("SetBestChain() : TxnCommit failed");
1474 // Add to current best branch
1475 pindexNew->pprev->pnext = pindexNew;
1477 // Delete redundant memory transactions
1478 BOOST_FOREACH(CTransaction& tx, vtx)
1479 tx.RemoveFromMemoryPool();
1484 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1486 uint256 hash = GetHash();
1489 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1491 txdb.WriteHashBestChain(hash);
1492 if (!txdb.TxnCommit())
1493 return error("SetBestChain() : TxnCommit failed");
1494 pindexGenesisBlock = pindexNew;
1496 else if (hashPrevBlock == hashBestChain)
1498 if (!SetBestChainInner(txdb, pindexNew))
1499 return error("SetBestChain() : SetBestChainInner failed");
1503 // the first block in the new chain that will cause it to become the new best chain
1504 CBlockIndex *pindexIntermediate = pindexNew;
1506 // list of blocks that need to be connected afterwards
1507 std::vector<CBlockIndex*> vpindexSecondary;
1509 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1510 // Try to limit how much needs to be done inside
1511 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1513 vpindexSecondary.push_back(pindexIntermediate);
1514 pindexIntermediate = pindexIntermediate->pprev;
1517 if (!vpindexSecondary.empty())
1518 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1520 // Switch to new best branch
1521 if (!Reorganize(txdb, pindexIntermediate))
1524 InvalidChainFound(pindexNew);
1525 return error("SetBestChain() : Reorganize failed");
1528 // Connect futher blocks
1529 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1532 if (!block.ReadFromDisk(pindex))
1534 printf("SetBestChain() : ReadFromDisk failed\n");
1538 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1539 if (!block.SetBestChainInner(txdb, pindex))
1544 // Update best block in wallet (so we can detect restored wallets)
1545 bool fIsInitialDownload = IsInitialBlockDownload();
1546 if (!fIsInitialDownload)
1548 const CBlockLocator locator(pindexNew);
1549 ::SetBestChain(locator);
1553 hashBestChain = hash;
1554 pindexBest = pindexNew;
1555 nBestHeight = pindexBest->nHeight;
1556 bnBestChainWork = pindexNew->bnChainWork;
1557 nTimeBestReceived = GetTime();
1558 nTransactionsUpdated++;
1559 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1561 std::string strCmd = GetArg("-blocknotify", "");
1563 if (!fIsInitialDownload && !strCmd.empty())
1565 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1566 boost::thread t(runCommand, strCmd); // thread runs free
1573 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1575 // Check for duplicate
1576 uint256 hash = GetHash();
1577 if (mapBlockIndex.count(hash))
1578 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1580 // Construct new block index object
1581 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1583 return error("AddToBlockIndex() : new CBlockIndex failed");
1584 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1585 pindexNew->phashBlock = &((*mi).first);
1586 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1587 if (miPrev != mapBlockIndex.end())
1589 pindexNew->pprev = (*miPrev).second;
1590 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1592 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1596 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1597 if (!txdb.TxnCommit())
1601 if (pindexNew->bnChainWork > bnBestChainWork)
1602 if (!SetBestChain(txdb, pindexNew))
1607 if (pindexNew == pindexBest)
1609 // Notify UI to display prev block's coinbase if it was ours
1610 static uint256 hashPrevBestCoinBase;
1611 UpdatedTransaction(hashPrevBestCoinBase);
1612 hashPrevBestCoinBase = vtx[0].GetHash();
1622 bool CBlock::CheckBlock() const
1624 // These are checks that are independent of context
1625 // that can be verified before saving an orphan block.
1628 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1629 return DoS(100, error("CheckBlock() : size limits failed"));
1631 // Check proof of work matches claimed amount
1632 if (!CheckProofOfWork(GetHash(), nBits))
1633 return DoS(50, error("CheckBlock() : proof of work failed"));
1636 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1637 return error("CheckBlock() : block timestamp too far in the future");
1639 // First transaction must be coinbase, the rest must not be
1640 if (vtx.empty() || !vtx[0].IsCoinBase())
1641 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1642 for (int i = 1; i < vtx.size(); i++)
1643 if (vtx[i].IsCoinBase())
1644 return DoS(100, error("CheckBlock() : more than one coinbase"));
1646 // Check transactions
1647 BOOST_FOREACH(const CTransaction& tx, vtx)
1648 if (!tx.CheckTransaction())
1649 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1652 BOOST_FOREACH(const CTransaction& tx, vtx)
1654 nSigOps += tx.GetLegacySigOpCount();
1656 if (nSigOps > MAX_BLOCK_SIGOPS)
1657 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1660 if (hashMerkleRoot != BuildMerkleTree())
1661 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1666 bool CBlock::AcceptBlock()
1668 // Check for duplicate
1669 uint256 hash = GetHash();
1670 if (mapBlockIndex.count(hash))
1671 return error("AcceptBlock() : block already in mapBlockIndex");
1673 // Get prev block index
1674 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1675 if (mi == mapBlockIndex.end())
1676 return DoS(10, error("AcceptBlock() : prev block not found"));
1677 CBlockIndex* pindexPrev = (*mi).second;
1678 int nHeight = pindexPrev->nHeight+1;
1680 // Check proof of work
1681 if (nBits != GetNextWorkRequired(pindexPrev, this))
1682 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1684 // Check timestamp against prev
1685 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1686 return error("AcceptBlock() : block's timestamp is too early");
1688 // Check that all transactions are finalized
1689 BOOST_FOREACH(const CTransaction& tx, vtx)
1690 if (!tx.IsFinal(nHeight, GetBlockTime()))
1691 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1693 // Check that the block chain matches the known block chain up to a checkpoint
1694 if (!Checkpoints::CheckBlock(nHeight, hash))
1695 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1697 // Write block to history file
1698 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1699 return error("AcceptBlock() : out of disk space");
1700 unsigned int nFile = -1;
1701 unsigned int nBlockPos = 0;
1702 if (!WriteToDisk(nFile, nBlockPos))
1703 return error("AcceptBlock() : WriteToDisk failed");
1704 if (!AddToBlockIndex(nFile, nBlockPos))
1705 return error("AcceptBlock() : AddToBlockIndex failed");
1707 // Relay inventory, but don't relay old inventory during initial block download
1708 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1709 if (hashBestChain == hash)
1710 CRITICAL_BLOCK(cs_vNodes)
1711 BOOST_FOREACH(CNode* pnode, vNodes)
1712 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1713 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1718 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1720 // Check for duplicate
1721 uint256 hash = pblock->GetHash();
1722 if (mapBlockIndex.count(hash))
1723 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1724 if (mapOrphanBlocks.count(hash))
1725 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1727 // Preliminary checks
1728 if (!pblock->CheckBlock())
1729 return error("ProcessBlock() : CheckBlock FAILED");
1731 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1732 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1734 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1735 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1739 pfrom->Misbehaving(100);
1740 return error("ProcessBlock() : block with timestamp before last checkpoint");
1743 bnNewBlock.SetCompact(pblock->nBits);
1745 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1746 if (bnNewBlock > bnRequired)
1749 pfrom->Misbehaving(100);
1750 return error("ProcessBlock() : block with too little proof-of-work");
1755 // If don't already have its previous block, shunt it off to holding area until we get it
1756 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1758 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1759 CBlock* pblock2 = new CBlock(*pblock);
1760 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1761 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1763 // Ask this guy to fill in what we're missing
1765 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1770 if (!pblock->AcceptBlock())
1771 return error("ProcessBlock() : AcceptBlock FAILED");
1773 // Recursively process any orphan blocks that depended on this one
1774 vector<uint256> vWorkQueue;
1775 vWorkQueue.push_back(hash);
1776 for (int i = 0; i < vWorkQueue.size(); i++)
1778 uint256 hashPrev = vWorkQueue[i];
1779 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1780 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1783 CBlock* pblockOrphan = (*mi).second;
1784 if (pblockOrphan->AcceptBlock())
1785 vWorkQueue.push_back(pblockOrphan->GetHash());
1786 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1787 delete pblockOrphan;
1789 mapOrphanBlocksByPrev.erase(hashPrev);
1792 printf("ProcessBlock: ACCEPTED\n");
1803 bool CheckDiskSpace(uint64 nAdditionalBytes)
1805 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1807 // Check for 15MB because database could create another 10MB log file at any time
1808 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1811 string strMessage = _("Warning: Disk space is low ");
1812 strMiscWarning = strMessage;
1813 printf("*** %s\n", strMessage.c_str());
1814 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1821 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1825 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1828 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1830 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1839 static unsigned int nCurrentBlockFile = 1;
1841 FILE* AppendBlockFile(unsigned int& nFileRet)
1846 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1849 if (fseek(file, 0, SEEK_END) != 0)
1851 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1852 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1854 nFileRet = nCurrentBlockFile;
1858 nCurrentBlockFile++;
1862 bool LoadBlockIndex(bool fAllowNew)
1866 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1867 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1868 pchMessageStart[0] = 0xfa;
1869 pchMessageStart[1] = 0xbf;
1870 pchMessageStart[2] = 0xb5;
1871 pchMessageStart[3] = 0xda;
1878 if (!txdb.LoadBlockIndex())
1883 // Init with genesis block
1885 if (mapBlockIndex.empty())
1891 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1892 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1893 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1894 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1895 // vMerkleTree: 4a5e1e
1898 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1900 txNew.vin.resize(1);
1901 txNew.vout.resize(1);
1902 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1903 txNew.vout[0].nValue = 50 * COIN;
1904 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1906 block.vtx.push_back(txNew);
1907 block.hashPrevBlock = 0;
1908 block.hashMerkleRoot = block.BuildMerkleTree();
1910 block.nTime = 1231006505;
1911 block.nBits = 0x1d00ffff;
1912 block.nNonce = 2083236893;
1916 block.nTime = 1296688602;
1917 block.nBits = 0x1d07fff8;
1918 block.nNonce = 384568319;
1922 printf("%s\n", block.GetHash().ToString().c_str());
1923 printf("%s\n", hashGenesisBlock.ToString().c_str());
1924 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1925 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1927 assert(block.GetHash() == hashGenesisBlock);
1929 // Start new block file
1931 unsigned int nBlockPos;
1932 if (!block.WriteToDisk(nFile, nBlockPos))
1933 return error("LoadBlockIndex() : writing genesis block to disk failed");
1934 if (!block.AddToBlockIndex(nFile, nBlockPos))
1935 return error("LoadBlockIndex() : genesis block not accepted");
1943 void PrintBlockTree()
1945 // precompute tree structure
1946 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1947 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1949 CBlockIndex* pindex = (*mi).second;
1950 mapNext[pindex->pprev].push_back(pindex);
1952 //while (rand() % 3 == 0)
1953 // mapNext[pindex->pprev].push_back(pindex);
1956 vector<pair<int, CBlockIndex*> > vStack;
1957 vStack.push_back(make_pair(0, pindexGenesisBlock));
1960 while (!vStack.empty())
1962 int nCol = vStack.back().first;
1963 CBlockIndex* pindex = vStack.back().second;
1966 // print split or gap
1967 if (nCol > nPrevCol)
1969 for (int i = 0; i < nCol-1; i++)
1973 else if (nCol < nPrevCol)
1975 for (int i = 0; i < nCol; i++)
1982 for (int i = 0; i < nCol; i++)
1987 block.ReadFromDisk(pindex);
1988 printf("%d (%u,%u) %s %s tx %d",
1992 block.GetHash().ToString().substr(0,20).c_str(),
1993 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1996 PrintWallets(block);
1998 // put the main timechain first
1999 vector<CBlockIndex*>& vNext = mapNext[pindex];
2000 for (int i = 0; i < vNext.size(); i++)
2002 if (vNext[i]->pnext)
2004 swap(vNext[0], vNext[i]);
2010 for (int i = 0; i < vNext.size(); i++)
2011 vStack.push_back(make_pair(nCol+i, vNext[i]));
2024 //////////////////////////////////////////////////////////////////////////////
2029 map<uint256, CAlert> mapAlerts;
2030 CCriticalSection cs_mapAlerts;
2032 string GetWarnings(string strFor)
2035 string strStatusBar;
2037 if (GetBoolArg("-testsafemode"))
2040 // Misc warnings like out of disk space and clock is wrong
2041 if (strMiscWarning != "")
2044 strStatusBar = strMiscWarning;
2047 // Longer invalid proof-of-work chain
2048 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2051 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2055 CRITICAL_BLOCK(cs_mapAlerts)
2057 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2059 const CAlert& alert = item.second;
2060 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2062 nPriority = alert.nPriority;
2063 strStatusBar = alert.strStatusBar;
2068 if (strFor == "statusbar")
2069 return strStatusBar;
2070 else if (strFor == "rpc")
2072 assert(!"GetWarnings() : invalid parameter");
2076 bool CAlert::ProcessAlert()
2078 if (!CheckSignature())
2083 CRITICAL_BLOCK(cs_mapAlerts)
2085 // Cancel previous alerts
2086 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2088 const CAlert& alert = (*mi).second;
2091 printf("cancelling alert %d\n", alert.nID);
2092 mapAlerts.erase(mi++);
2094 else if (!alert.IsInEffect())
2096 printf("expiring alert %d\n", alert.nID);
2097 mapAlerts.erase(mi++);
2103 // Check if this alert has been cancelled
2104 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2106 const CAlert& alert = item.second;
2107 if (alert.Cancels(*this))
2109 printf("alert already cancelled by %d\n", alert.nID);
2115 mapAlerts.insert(make_pair(GetHash(), *this));
2118 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2130 //////////////////////////////////////////////////////////////////////////////
2136 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2140 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2141 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2143 // Don't know what it is, just say we already got one
2150 // The message start string is designed to be unlikely to occur in normal data.
2151 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2152 // a large 4-byte int at any alignment.
2153 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2156 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2158 static map<CService, vector<unsigned char> > mapReuseKey;
2159 RandAddSeedPerfmon();
2161 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2162 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2164 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2166 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2174 if (strCommand == "version")
2176 // Each connection can only send one version message
2177 if (pfrom->nVersion != 0)
2179 pfrom->Misbehaving(1);
2187 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2188 if (pfrom->nVersion < 209)
2190 // Since February 20, 2012, the protocol is initiated at version 209,
2191 // and earlier versions are no longer supported
2192 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2193 pfrom->fDisconnect = true;
2197 if (pfrom->nVersion == 10300)
2198 pfrom->nVersion = 300;
2200 vRecv >> addrFrom >> nNonce;
2202 vRecv >> pfrom->strSubVer;
2204 vRecv >> pfrom->nStartingHeight;
2206 // Disconnect if we connected to ourself
2207 if (nNonce == nLocalHostNonce && nNonce > 1)
2209 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2210 pfrom->fDisconnect = true;
2214 // Be shy and don't send version until we hear
2215 if (pfrom->fInbound)
2216 pfrom->PushVersion();
2218 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2220 AddTimeData(pfrom->addr, nTime);
2223 pfrom->PushMessage("verack");
2224 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2226 if (!pfrom->fInbound)
2228 // Advertise our address
2229 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2230 !IsInitialBlockDownload())
2232 CAddress addr(addrLocalHost);
2233 addr.nTime = GetAdjustedTime();
2234 pfrom->PushAddress(addr);
2237 // Get recent addresses
2238 if (pfrom->nVersion >= 31402 || addrman.size() < 1000)
2240 pfrom->PushMessage("getaddr");
2241 pfrom->fGetAddr = true;
2243 addrman.Good(pfrom->addr);
2245 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2247 addrman.Add(addrFrom, addrFrom);
2248 addrman.Good(addrFrom);
2252 // Ask the first connected node for block updates
2253 static int nAskedForBlocks = 0;
2254 if (!pfrom->fClient &&
2255 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2256 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2259 pfrom->PushGetBlocks(pindexBest, uint256(0));
2263 CRITICAL_BLOCK(cs_mapAlerts)
2264 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2265 item.second.RelayTo(pfrom);
2267 pfrom->fSuccessfullyConnected = true;
2269 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2271 cPeerBlockCounts.input(pfrom->nStartingHeight);
2275 else if (pfrom->nVersion == 0)
2277 // Must have a version message before anything else
2278 pfrom->Misbehaving(1);
2283 else if (strCommand == "verack")
2285 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2289 else if (strCommand == "addr")
2291 vector<CAddress> vAddr;
2294 // Don't want addr from older versions unless seeding
2295 if (pfrom->nVersion < 31402 && addrman.size() > 1000)
2297 if (vAddr.size() > 1000)
2299 pfrom->Misbehaving(20);
2300 return error("message addr size() = %d", vAddr.size());
2303 // Store the new addresses
2304 int64 nNow = GetAdjustedTime();
2305 int64 nSince = nNow - 10 * 60;
2306 BOOST_FOREACH(CAddress& addr, vAddr)
2310 // ignore IPv6 for now, since it isn't implemented anyway
2313 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2314 addr.nTime = nNow - 5 * 24 * 60 * 60;
2315 pfrom->AddAddressKnown(addr);
2316 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2318 // Relay to a limited number of other nodes
2319 CRITICAL_BLOCK(cs_vNodes)
2321 // Use deterministic randomness to send to the same nodes for 24 hours
2322 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2323 static uint256 hashSalt;
2325 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2326 int64 hashAddr = addr.GetHash();
2327 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2328 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2329 multimap<uint256, CNode*> mapMix;
2330 BOOST_FOREACH(CNode* pnode, vNodes)
2332 if (pnode->nVersion < 31402)
2334 unsigned int nPointer;
2335 memcpy(&nPointer, &pnode, sizeof(nPointer));
2336 uint256 hashKey = hashRand ^ nPointer;
2337 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2338 mapMix.insert(make_pair(hashKey, pnode));
2340 int nRelayNodes = 2;
2341 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2342 ((*mi).second)->PushAddress(addr);
2346 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2347 if (vAddr.size() < 1000)
2348 pfrom->fGetAddr = false;
2352 else if (strCommand == "inv")
2356 if (vInv.size() > 50000)
2358 pfrom->Misbehaving(20);
2359 return error("message inv size() = %d", vInv.size());
2363 for (int nInv = 0; nInv < vInv.size(); nInv++)
2365 const CInv &inv = vInv[nInv];
2369 pfrom->AddInventoryKnown(inv);
2371 bool fAlreadyHave = AlreadyHave(txdb, inv);
2373 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2375 // Always request the last block in an inv bundle (even if we already have it), as it is the
2376 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2377 // this is necessary to connect earlier received orphan blocks to the chain again.
2378 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2380 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2381 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2383 // Track requests for our stuff
2384 Inventory(inv.hash);
2389 else if (strCommand == "getdata")
2393 if (vInv.size() > 50000)
2395 pfrom->Misbehaving(20);
2396 return error("message getdata size() = %d", vInv.size());
2399 BOOST_FOREACH(const CInv& inv, vInv)
2403 printf("received getdata for: %s\n", inv.ToString().c_str());
2405 if (inv.type == MSG_BLOCK)
2407 // Send block from disk
2408 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2409 if (mi != mapBlockIndex.end())
2412 block.ReadFromDisk((*mi).second);
2413 pfrom->PushMessage("block", block);
2415 // Trigger them to send a getblocks request for the next batch of inventory
2416 if (inv.hash == pfrom->hashContinue)
2418 // Bypass PushInventory, this must send even if redundant,
2419 // and we want it right after the last block so they don't
2420 // wait for other stuff first.
2422 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2423 pfrom->PushMessage("inv", vInv);
2424 pfrom->hashContinue = 0;
2428 else if (inv.IsKnownType())
2430 // Send stream from relay memory
2431 CRITICAL_BLOCK(cs_mapRelay)
2433 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2434 if (mi != mapRelay.end())
2435 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2439 // Track requests for our stuff
2440 Inventory(inv.hash);
2445 else if (strCommand == "getblocks")
2447 CBlockLocator locator;
2449 vRecv >> locator >> hashStop;
2451 // Find the last block the caller has in the main chain
2452 CBlockIndex* pindex = locator.GetBlockIndex();
2454 // Send the rest of the chain
2456 pindex = pindex->pnext;
2457 int nLimit = 500 + locator.GetDistanceBack();
2458 unsigned int nBytes = 0;
2459 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2460 for (; pindex; pindex = pindex->pnext)
2462 if (pindex->GetBlockHash() == hashStop)
2464 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2467 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2469 block.ReadFromDisk(pindex, true);
2470 nBytes += block.GetSerializeSize(SER_NETWORK);
2471 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2473 // When this block is requested, we'll send an inv that'll make them
2474 // getblocks the next batch of inventory.
2475 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2476 pfrom->hashContinue = pindex->GetBlockHash();
2483 else if (strCommand == "getheaders")
2485 CBlockLocator locator;
2487 vRecv >> locator >> hashStop;
2489 CBlockIndex* pindex = NULL;
2490 if (locator.IsNull())
2492 // If locator is null, return the hashStop block
2493 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2494 if (mi == mapBlockIndex.end())
2496 pindex = (*mi).second;
2500 // Find the last block the caller has in the main chain
2501 pindex = locator.GetBlockIndex();
2503 pindex = pindex->pnext;
2506 vector<CBlock> vHeaders;
2508 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2509 for (; pindex; pindex = pindex->pnext)
2511 vHeaders.push_back(pindex->GetBlockHeader());
2512 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2515 pfrom->PushMessage("headers", vHeaders);
2519 else if (strCommand == "tx")
2521 vector<uint256> vWorkQueue;
2522 CDataStream vMsg(vRecv);
2526 CInv inv(MSG_TX, tx.GetHash());
2527 pfrom->AddInventoryKnown(inv);
2529 bool fMissingInputs = false;
2530 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2532 SyncWithWallets(tx, NULL, true);
2533 RelayMessage(inv, vMsg);
2534 mapAlreadyAskedFor.erase(inv);
2535 vWorkQueue.push_back(inv.hash);
2537 // Recursively process any orphan transactions that depended on this one
2538 for (int i = 0; i < vWorkQueue.size(); i++)
2540 uint256 hashPrev = vWorkQueue[i];
2541 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2542 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2545 const CDataStream& vMsg = *((*mi).second);
2547 CDataStream(vMsg) >> tx;
2548 CInv inv(MSG_TX, tx.GetHash());
2550 if (tx.AcceptToMemoryPool(true))
2552 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2553 SyncWithWallets(tx, NULL, true);
2554 RelayMessage(inv, vMsg);
2555 mapAlreadyAskedFor.erase(inv);
2556 vWorkQueue.push_back(inv.hash);
2561 BOOST_FOREACH(uint256 hash, vWorkQueue)
2562 EraseOrphanTx(hash);
2564 else if (fMissingInputs)
2566 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2569 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2570 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2572 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2574 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2578 else if (strCommand == "block")
2583 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2586 CInv inv(MSG_BLOCK, block.GetHash());
2587 pfrom->AddInventoryKnown(inv);
2589 if (ProcessBlock(pfrom, &block))
2590 mapAlreadyAskedFor.erase(inv);
2591 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2595 else if (strCommand == "getaddr")
2597 pfrom->vAddrToSend.clear();
2598 vector<CAddress> vAddr = addrman.GetAddr();
2599 BOOST_FOREACH(const CAddress &addr, vAddr)
2600 pfrom->PushAddress(addr);
2604 else if (strCommand == "checkorder")
2609 if (!GetBoolArg("-allowreceivebyip"))
2611 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2618 /// we have a chance to check the order here
2620 // Keep giving the same key to the same ip until they use it
2621 if (!mapReuseKey.count(pfrom->addr))
2622 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2624 // Send back approval of order and pubkey to use
2625 CScript scriptPubKey;
2626 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2627 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2631 else if (strCommand == "reply")
2636 CRequestTracker tracker;
2637 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2639 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2640 if (mi != pfrom->mapRequests.end())
2642 tracker = (*mi).second;
2643 pfrom->mapRequests.erase(mi);
2646 if (!tracker.IsNull())
2647 tracker.fn(tracker.param1, vRecv);
2651 else if (strCommand == "ping")
2656 else if (strCommand == "alert")
2661 if (alert.ProcessAlert())
2664 pfrom->setKnown.insert(alert.GetHash());
2665 CRITICAL_BLOCK(cs_vNodes)
2666 BOOST_FOREACH(CNode* pnode, vNodes)
2667 alert.RelayTo(pnode);
2674 // Ignore unknown commands for extensibility
2678 // Update the last seen time for this node's address
2679 if (pfrom->fNetworkNode)
2680 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2681 AddressCurrentlyConnected(pfrom->addr);
2687 bool ProcessMessages(CNode* pfrom)
2689 CDataStream& vRecv = pfrom->vRecv;
2693 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2697 // (4) message start
2706 // Scan for message start
2707 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2708 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2709 if (vRecv.end() - pstart < nHeaderSize)
2711 if (vRecv.size() > nHeaderSize)
2713 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2714 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2718 if (pstart - vRecv.begin() > 0)
2719 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2720 vRecv.erase(vRecv.begin(), pstart);
2723 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2728 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2731 string strCommand = hdr.GetCommand();
2734 unsigned int nMessageSize = hdr.nMessageSize;
2735 if (nMessageSize > MAX_SIZE)
2737 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2740 if (nMessageSize > vRecv.size())
2742 // Rewind and wait for rest of message
2743 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2748 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2749 unsigned int nChecksum = 0;
2750 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2751 if (nChecksum != hdr.nChecksum)
2753 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2754 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2758 // Copy message to its own buffer
2759 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2760 vRecv.ignore(nMessageSize);
2766 CRITICAL_BLOCK(cs_main)
2767 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2771 catch (std::ios_base::failure& e)
2773 if (strstr(e.what(), "end of data"))
2775 // Allow exceptions from underlength message on vRecv
2776 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());
2778 else if (strstr(e.what(), "size too large"))
2780 // Allow exceptions from overlong size
2781 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2785 PrintExceptionContinue(&e, "ProcessMessage()");
2788 catch (std::exception& e) {
2789 PrintExceptionContinue(&e, "ProcessMessage()");
2791 PrintExceptionContinue(NULL, "ProcessMessage()");
2795 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2803 bool SendMessages(CNode* pto, bool fSendTrickle)
2805 CRITICAL_BLOCK(cs_main)
2807 // Don't send anything until we get their version message
2808 if (pto->nVersion == 0)
2812 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2813 pto->PushMessage("ping");
2815 // Resend wallet transactions that haven't gotten in a block yet
2816 ResendWalletTransactions();
2818 // Address refresh broadcast
2819 static int64 nLastRebroadcast;
2820 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2822 CRITICAL_BLOCK(cs_vNodes)
2824 BOOST_FOREACH(CNode* pnode, vNodes)
2826 // Periodically clear setAddrKnown to allow refresh broadcasts
2827 if (nLastRebroadcast)
2828 pnode->setAddrKnown.clear();
2830 // Rebroadcast our address
2831 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2833 CAddress addr(addrLocalHost);
2834 addr.nTime = GetAdjustedTime();
2835 pnode->PushAddress(addr);
2839 nLastRebroadcast = GetTime();
2847 vector<CAddress> vAddr;
2848 vAddr.reserve(pto->vAddrToSend.size());
2849 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2851 // returns true if wasn't already contained in the set
2852 if (pto->setAddrKnown.insert(addr).second)
2854 vAddr.push_back(addr);
2855 // receiver rejects addr messages larger than 1000
2856 if (vAddr.size() >= 1000)
2858 pto->PushMessage("addr", vAddr);
2863 pto->vAddrToSend.clear();
2865 pto->PushMessage("addr", vAddr);
2870 // Message: inventory
2873 vector<CInv> vInvWait;
2874 CRITICAL_BLOCK(pto->cs_inventory)
2876 vInv.reserve(pto->vInventoryToSend.size());
2877 vInvWait.reserve(pto->vInventoryToSend.size());
2878 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2880 if (pto->setInventoryKnown.count(inv))
2883 // trickle out tx inv to protect privacy
2884 if (inv.type == MSG_TX && !fSendTrickle)
2886 // 1/4 of tx invs blast to all immediately
2887 static uint256 hashSalt;
2889 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2890 uint256 hashRand = inv.hash ^ hashSalt;
2891 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2892 bool fTrickleWait = ((hashRand & 3) != 0);
2894 // always trickle our own transactions
2898 if (GetTransaction(inv.hash, wtx))
2900 fTrickleWait = true;
2905 vInvWait.push_back(inv);
2910 // returns true if wasn't already contained in the set
2911 if (pto->setInventoryKnown.insert(inv).second)
2913 vInv.push_back(inv);
2914 if (vInv.size() >= 1000)
2916 pto->PushMessage("inv", vInv);
2921 pto->vInventoryToSend = vInvWait;
2924 pto->PushMessage("inv", vInv);
2930 vector<CInv> vGetData;
2931 int64 nNow = GetTime() * 1000000;
2933 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2935 const CInv& inv = (*pto->mapAskFor.begin()).second;
2936 if (!AlreadyHave(txdb, inv))
2938 printf("sending getdata: %s\n", inv.ToString().c_str());
2939 vGetData.push_back(inv);
2940 if (vGetData.size() >= 1000)
2942 pto->PushMessage("getdata", vGetData);
2946 mapAlreadyAskedFor[inv] = nNow;
2947 pto->mapAskFor.erase(pto->mapAskFor.begin());
2949 if (!vGetData.empty())
2950 pto->PushMessage("getdata", vGetData);
2969 //////////////////////////////////////////////////////////////////////////////
2974 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2976 unsigned char* pdata = (unsigned char*)pbuffer;
2977 unsigned int blocks = 1 + ((len + 8) / 64);
2978 unsigned char* pend = pdata + 64 * blocks;
2979 memset(pdata + len, 0, 64 * blocks - len);
2981 unsigned int bits = len * 8;
2982 pend[-1] = (bits >> 0) & 0xff;
2983 pend[-2] = (bits >> 8) & 0xff;
2984 pend[-3] = (bits >> 16) & 0xff;
2985 pend[-4] = (bits >> 24) & 0xff;
2989 static const unsigned int pSHA256InitState[8] =
2990 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2992 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2995 unsigned char data[64];
2999 for (int i = 0; i < 16; i++)
3000 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3002 for (int i = 0; i < 8; i++)
3003 ctx.h[i] = ((uint32_t*)pinit)[i];
3005 SHA256_Update(&ctx, data, sizeof(data));
3006 for (int i = 0; i < 8; i++)
3007 ((uint32_t*)pstate)[i] = ctx.h[i];
3011 // ScanHash scans nonces looking for a hash with at least some zero bits.
3012 // It operates on big endian data. Caller does the byte reversing.
3013 // All input buffers are 16-byte aligned. nNonce is usually preserved
3014 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3015 // the block is rebuilt and nNonce starts over at zero.
3017 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3019 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3023 // Hash pdata using pmidstate as the starting state into
3024 // preformatted buffer phash1, then hash phash1 into phash
3026 SHA256Transform(phash1, pdata, pmidstate);
3027 SHA256Transform(phash, phash1, pSHA256InitState);
3029 // Return the nonce if the hash has at least some zero bits,
3030 // caller will check if it has enough to reach the target
3031 if (((unsigned short*)phash)[14] == 0)
3034 // If nothing found after trying for a while, return -1
3035 if ((nNonce & 0xffff) == 0)
3037 nHashesDone = 0xffff+1;
3043 // Some explaining would be appreciated
3048 set<uint256> setDependsOn;
3051 COrphan(CTransaction* ptxIn)
3059 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3060 BOOST_FOREACH(uint256 hash, setDependsOn)
3061 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3066 uint64 nLastBlockTx = 0;
3067 uint64 nLastBlockSize = 0;
3069 CBlock* CreateNewBlock(CReserveKey& reservekey)
3071 CBlockIndex* pindexPrev = pindexBest;
3074 auto_ptr<CBlock> pblock(new CBlock());
3078 // Create coinbase tx
3080 txNew.vin.resize(1);
3081 txNew.vin[0].prevout.SetNull();
3082 txNew.vout.resize(1);
3083 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3085 // Add our coinbase tx as first transaction
3086 pblock->vtx.push_back(txNew);
3088 // Collect memory pool transactions into the block
3090 CRITICAL_BLOCK(cs_main)
3091 CRITICAL_BLOCK(cs_mapTransactions)
3095 // Priority order to process transactions
3096 list<COrphan> vOrphan; // list memory doesn't move
3097 map<uint256, vector<COrphan*> > mapDependers;
3098 multimap<double, CTransaction*> mapPriority;
3099 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3101 CTransaction& tx = (*mi).second;
3102 if (tx.IsCoinBase() || !tx.IsFinal())
3105 COrphan* porphan = NULL;
3106 double dPriority = 0;
3107 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3109 // Read prev transaction
3110 CTransaction txPrev;
3112 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3114 // Has to wait for dependencies
3117 // Use list for automatic deletion
3118 vOrphan.push_back(COrphan(&tx));
3119 porphan = &vOrphan.back();
3121 mapDependers[txin.prevout.hash].push_back(porphan);
3122 porphan->setDependsOn.insert(txin.prevout.hash);
3125 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3127 // Read block header
3128 int nConf = txindex.GetDepthInMainChain();
3130 dPriority += (double)nValueIn * nConf;
3132 if (fDebug && GetBoolArg("-printpriority"))
3133 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3136 // Priority is sum(valuein * age) / txsize
3137 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3140 porphan->dPriority = dPriority;
3142 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3144 if (fDebug && GetBoolArg("-printpriority"))
3146 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3153 // Collect transactions into block
3154 map<uint256, CTxIndex> mapTestPool;
3155 uint64 nBlockSize = 1000;
3156 uint64 nBlockTx = 0;
3157 int nBlockSigOps = 100;
3158 while (!mapPriority.empty())
3160 // Take highest priority transaction off priority queue
3161 double dPriority = -(*mapPriority.begin()).first;
3162 CTransaction& tx = *(*mapPriority.begin()).second;
3163 mapPriority.erase(mapPriority.begin());
3166 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3167 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3170 // Legacy limits on sigOps:
3171 int nTxSigOps = tx.GetLegacySigOpCount();
3172 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3175 // Transaction fee required depends on block size
3176 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3177 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3179 // Connecting shouldn't fail due to dependency on other memory pool transactions
3180 // because we're already processing them in order of dependency
3181 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3182 MapPrevTx mapInputs;
3184 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3187 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3188 if (nTxFees < nMinFee)
3191 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3192 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3195 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3197 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3198 swap(mapTestPool, mapTestPoolTmp);
3201 pblock->vtx.push_back(tx);
3202 nBlockSize += nTxSize;
3204 nBlockSigOps += nTxSigOps;
3207 // Add transactions that depend on this one to the priority queue
3208 uint256 hash = tx.GetHash();
3209 if (mapDependers.count(hash))
3211 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3213 if (!porphan->setDependsOn.empty())
3215 porphan->setDependsOn.erase(hash);
3216 if (porphan->setDependsOn.empty())
3217 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3223 nLastBlockTx = nBlockTx;
3224 nLastBlockSize = nBlockSize;
3225 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3228 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3231 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3232 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3233 pblock->UpdateTime(pindexPrev);
3234 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3237 return pblock.release();
3241 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3243 // Update nExtraNonce
3244 static uint256 hashPrevBlock;
3245 if (hashPrevBlock != pblock->hashPrevBlock)
3248 hashPrevBlock = pblock->hashPrevBlock;
3251 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3252 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3254 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3258 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3261 // Prebuild hash buffers
3268 uint256 hashPrevBlock;
3269 uint256 hashMerkleRoot;
3272 unsigned int nNonce;
3275 unsigned char pchPadding0[64];
3277 unsigned char pchPadding1[64];
3280 memset(&tmp, 0, sizeof(tmp));
3282 tmp.block.nVersion = pblock->nVersion;
3283 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3284 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3285 tmp.block.nTime = pblock->nTime;
3286 tmp.block.nBits = pblock->nBits;
3287 tmp.block.nNonce = pblock->nNonce;
3289 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3290 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3292 // Byte swap all the input buffer
3293 for (int i = 0; i < sizeof(tmp)/4; i++)
3294 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3296 // Precalc the first half of the first hash, which stays constant
3297 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3299 memcpy(pdata, &tmp.block, 128);
3300 memcpy(phash1, &tmp.hash1, 64);
3304 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3306 uint256 hash = pblock->GetHash();
3307 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3309 if (hash > hashTarget)
3313 printf("BitcoinMiner:\n");
3314 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3316 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3317 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3320 CRITICAL_BLOCK(cs_main)
3322 if (pblock->hashPrevBlock != hashBestChain)
3323 return error("BitcoinMiner : generated block is stale");
3325 // Remove key from key pool
3326 reservekey.KeepKey();
3328 // Track how many getdata requests this block gets
3329 CRITICAL_BLOCK(wallet.cs_wallet)
3330 wallet.mapRequestCount[pblock->GetHash()] = 0;
3332 // Process this block the same as if we had received it from another node
3333 if (!ProcessBlock(NULL, pblock))
3334 return error("BitcoinMiner : ProcessBlock, block not accepted");
3340 void static ThreadBitcoinMiner(void* parg);
3342 static bool fGenerateBitcoins = false;
3343 static bool fLimitProcessors = false;
3344 static int nLimitProcessors = -1;
3346 void static BitcoinMiner(CWallet *pwallet)
3348 printf("BitcoinMiner started\n");
3349 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3351 // Each thread has its own key and counter
3352 CReserveKey reservekey(pwallet);
3353 unsigned int nExtraNonce = 0;
3355 while (fGenerateBitcoins)
3357 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3361 while (vNodes.empty() || IsInitialBlockDownload())
3366 if (!fGenerateBitcoins)
3374 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3375 CBlockIndex* pindexPrev = pindexBest;
3377 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3380 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3382 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3386 // Prebuild hash buffers
3388 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3389 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3390 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3392 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3394 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3395 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3396 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3402 int64 nStart = GetTime();
3403 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3405 uint256& hash = *alignup<16>(hashbuf);
3408 unsigned int nHashesDone = 0;
3409 unsigned int nNonceFound;
3412 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3413 (char*)&hash, nHashesDone);
3415 // Check if something found
3416 if (nNonceFound != -1)
3418 for (int i = 0; i < sizeof(hash)/4; i++)
3419 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3421 if (hash <= hashTarget)
3424 pblock->nNonce = ByteReverse(nNonceFound);
3425 assert(hash == pblock->GetHash());
3427 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3428 CheckWork(pblock.get(), *pwalletMain, reservekey);
3429 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3435 static int64 nHashCounter;
3436 if (nHPSTimerStart == 0)
3438 nHPSTimerStart = GetTimeMillis();
3442 nHashCounter += nHashesDone;
3443 if (GetTimeMillis() - nHPSTimerStart > 4000)
3445 static CCriticalSection cs;
3448 if (GetTimeMillis() - nHPSTimerStart > 4000)
3450 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3451 nHPSTimerStart = GetTimeMillis();
3453 static int64 nLogTime;
3454 if (GetTime() - nLogTime > 30 * 60)
3456 nLogTime = GetTime();
3457 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3458 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3464 // Check for stop or if block needs to be rebuilt
3467 if (!fGenerateBitcoins)
3469 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3473 if (nBlockNonce >= 0xffff0000)
3475 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3477 if (pindexPrev != pindexBest)
3480 // Update nTime every few seconds
3481 pblock->UpdateTime(pindexPrev);
3482 nBlockTime = ByteReverse(pblock->nTime);
3485 // Changing pblock->nTime can change work required on testnet:
3486 nBlockBits = ByteReverse(pblock->nBits);
3487 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3493 void static ThreadBitcoinMiner(void* parg)
3495 CWallet* pwallet = (CWallet*)parg;
3498 vnThreadsRunning[THREAD_MINER]++;
3499 BitcoinMiner(pwallet);
3500 vnThreadsRunning[THREAD_MINER]--;
3502 catch (std::exception& e) {
3503 vnThreadsRunning[THREAD_MINER]--;
3504 PrintException(&e, "ThreadBitcoinMiner()");
3506 vnThreadsRunning[THREAD_MINER]--;
3507 PrintException(NULL, "ThreadBitcoinMiner()");
3510 if (vnThreadsRunning[THREAD_MINER] == 0)
3512 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3516 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3518 fGenerateBitcoins = fGenerate;
3519 nLimitProcessors = GetArg("-genproclimit", -1);
3520 if (nLimitProcessors == 0)
3521 fGenerateBitcoins = false;
3522 fLimitProcessors = (nLimitProcessors != -1);
3526 int nProcessors = boost::thread::hardware_concurrency();
3527 printf("%d processors\n", nProcessors);
3528 if (nProcessors < 1)
3530 if (fLimitProcessors && nProcessors > nLimitProcessors)
3531 nProcessors = nLimitProcessors;
3532 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3533 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3534 for (int i = 0; i < nAddThreads; i++)
3536 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3537 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");