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 static AddOrphanTx(const CDataStream& vMsg)
173 CDataStream(vMsg) >> tx;
174 uint256 hash = tx.GetHash();
175 if (mapOrphanTransactions.count(hash))
177 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
178 BOOST_FOREACH(const CTxIn& txin, tx.vin)
179 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
182 void static EraseOrphanTx(uint256 hash)
184 if (!mapOrphanTransactions.count(hash))
186 const CDataStream* pvMsg = mapOrphanTransactions[hash];
188 CDataStream(*pvMsg) >> tx;
189 BOOST_FOREACH(const CTxIn& txin, tx.vin)
191 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
192 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
194 if ((*mi).second == pvMsg)
195 mapOrphanTransactionsByPrev.erase(mi++);
201 mapOrphanTransactions.erase(hash);
211 //////////////////////////////////////////////////////////////////////////////
213 // CTransaction and CTxIndex
216 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
219 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
221 if (!ReadFromDisk(txindexRet.pos))
223 if (prevout.n >= vout.size())
231 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
234 return ReadFromDisk(txdb, prevout, txindex);
237 bool CTransaction::ReadFromDisk(COutPoint prevout)
241 return ReadFromDisk(txdb, prevout, txindex);
244 bool CTransaction::IsStandard() const
246 BOOST_FOREACH(const CTxIn& txin, vin)
248 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
249 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
250 // ~65-byte public keys, plus a few script ops.
251 if (txin.scriptSig.size() > 500)
253 if (!txin.scriptSig.IsPushOnly())
256 BOOST_FOREACH(const CTxOut& txout, vout)
257 if (!::IsStandard(txout.scriptPubKey))
263 // Check transaction inputs, and make sure any
264 // pay-to-script-hash transactions are evaluating IsStandard scripts
266 // Why bother? To avoid denial-of-service attacks; an attacker
267 // can submit a standard HASH... OP_EQUAL transaction,
268 // which will get accepted into blocks. The redemption
269 // script can be anything; an attacker could use a very
270 // expensive-to-check-upon-redemption script like:
271 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
273 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
276 return true; // Coinbases don't use vin normally
278 for (int i = 0; i < vin.size(); i++)
280 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
282 vector<vector<unsigned char> > vSolutions;
283 txnouttype whichType;
284 // get the scriptPubKey corresponding to this input:
285 const CScript& prevScript = prev.scriptPubKey;
286 if (!Solver(prevScript, whichType, vSolutions))
288 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
290 // Transactions with extra stuff in their scriptSigs are
291 // non-standard. Note that this EvalScript() call will
292 // be quick, because if there are any operations
293 // beside "push data" in the scriptSig the
294 // IsStandard() call returns false
295 vector<vector<unsigned char> > stack;
296 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
299 if (whichType == TX_SCRIPTHASH)
303 CScript subscript(stack.back().begin(), stack.back().end());
304 vector<vector<unsigned char> > vSolutions2;
305 txnouttype whichType2;
306 if (!Solver(subscript, whichType2, vSolutions2))
308 if (whichType2 == TX_SCRIPTHASH)
310 nArgsExpected += ScriptSigArgsExpected(whichType2, vSolutions2);
313 if (stack.size() != nArgsExpected)
321 CTransaction::GetLegacySigOpCount() const
324 BOOST_FOREACH(const CTxIn& txin, vin)
326 nSigOps += txin.scriptSig.GetSigOpCount(false);
328 BOOST_FOREACH(const CTxOut& txout, vout)
330 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
336 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
348 // Load the block this tx is in
350 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
352 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
357 // Update the tx's hashBlock
358 hashBlock = pblock->GetHash();
360 // Locate the transaction
361 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
362 if (pblock->vtx[nIndex] == *(CTransaction*)this)
364 if (nIndex == pblock->vtx.size())
366 vMerkleBranch.clear();
368 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
372 // Fill in merkle branch
373 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
376 // Is the tx in a block that's in the main chain
377 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
378 if (mi == mapBlockIndex.end())
380 CBlockIndex* pindex = (*mi).second;
381 if (!pindex || !pindex->IsInMainChain())
384 return pindexBest->nHeight - pindex->nHeight + 1;
393 bool CTransaction::CheckTransaction() const
395 // Basic checks that don't depend on any context
397 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
399 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
401 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
402 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
404 // Check for negative or overflow output values
406 BOOST_FOREACH(const CTxOut& txout, vout)
408 if (txout.nValue < 0)
409 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
410 if (txout.nValue > MAX_MONEY)
411 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
412 nValueOut += txout.nValue;
413 if (!MoneyRange(nValueOut))
414 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
417 // Check for duplicate inputs
418 set<COutPoint> vInOutPoints;
419 BOOST_FOREACH(const CTxIn& txin, vin)
421 if (vInOutPoints.count(txin.prevout))
423 vInOutPoints.insert(txin.prevout);
428 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
429 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
433 BOOST_FOREACH(const CTxIn& txin, vin)
434 if (txin.prevout.IsNull())
435 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
441 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
444 *pfMissingInputs = false;
446 if (!CheckTransaction())
447 return error("AcceptToMemoryPool() : CheckTransaction failed");
449 // Coinbase is only valid in a block, not as a loose transaction
451 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
453 // To help v0.1.5 clients who would see it as a negative number
454 if ((int64)nLockTime > std::numeric_limits<int>::max())
455 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
457 // Rather not work on nonstandard transactions (unless -testnet)
458 if (!fTestNet && !IsStandard())
459 return error("AcceptToMemoryPool() : nonstandard transaction type");
461 // Do we already have it?
462 uint256 hash = GetHash();
463 CRITICAL_BLOCK(cs_mapTransactions)
464 if (mapTransactions.count(hash))
467 if (txdb.ContainsTx(hash))
470 // Check for conflicts with in-memory transactions
471 CTransaction* ptxOld = NULL;
472 for (int i = 0; i < vin.size(); i++)
474 COutPoint outpoint = vin[i].prevout;
475 if (mapNextTx.count(outpoint))
477 // Disable replacement feature for now
480 // Allow replacing with a newer version of the same transaction
483 ptxOld = mapNextTx[outpoint].ptx;
484 if (ptxOld->IsFinal())
486 if (!IsNewerThan(*ptxOld))
488 for (int i = 0; i < vin.size(); i++)
490 COutPoint outpoint = vin[i].prevout;
491 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
501 map<uint256, CTxIndex> mapUnused;
502 bool fInvalid = false;
503 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
506 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
508 *pfMissingInputs = true;
509 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
512 // Check for non-standard pay-to-script-hash in inputs
513 if (!AreInputsStandard(mapInputs) && !fTestNet)
514 return error("AcceptToMemoryPool() : nonstandard transaction input");
516 // Note: if you modify this code to accept non-standard transactions, then
517 // you should add code here to check that the transaction does a
518 // reasonable number of ECDSA signature verifications.
520 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
521 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
523 // Don't accept it if it can't get into a block
524 if (nFees < GetMinFee(1000, true, GMF_RELAY))
525 return error("AcceptToMemoryPool() : not enough fees");
527 // Continuously rate-limit free transactions
528 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
529 // be annoying or make other's transactions take longer to confirm.
530 if (nFees < MIN_RELAY_TX_FEE)
532 static CCriticalSection cs;
533 static double dFreeCount;
534 static int64 nLastTime;
535 int64 nNow = GetTime();
539 // Use an exponentially decaying ~10-minute window:
540 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
542 // -limitfreerelay unit is thousand-bytes-per-minute
543 // At default rate it would take over a month to fill 1GB
544 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
545 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
547 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
552 // Check against previous transactions
553 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
554 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
556 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
560 // Store transaction in memory
561 CRITICAL_BLOCK(cs_mapTransactions)
565 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
566 ptxOld->RemoveFromMemoryPool();
568 AddToMemoryPoolUnchecked();
571 ///// are we sure this is ok when loading transactions or restoring block txes
572 // If updated, erase old tx from wallet
574 EraseFromWallets(ptxOld->GetHash());
576 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
580 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
583 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
586 uint64 nPooledTx = 0;
588 bool CTransaction::AddToMemoryPoolUnchecked()
590 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
591 // Add to memory pool without checking anything. Don't call this directly,
592 // call AcceptToMemoryPool to properly check the transaction first.
593 CRITICAL_BLOCK(cs_mapTransactions)
595 uint256 hash = GetHash();
596 mapTransactions[hash] = *this;
597 for (int i = 0; i < vin.size(); i++)
598 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
599 nTransactionsUpdated++;
606 bool CTransaction::RemoveFromMemoryPool()
608 // Remove transaction from memory pool
609 CRITICAL_BLOCK(cs_mapTransactions)
611 uint256 hash = GetHash();
612 if (mapTransactions.count(hash))
614 BOOST_FOREACH(const CTxIn& txin, vin)
615 mapNextTx.erase(txin.prevout);
616 mapTransactions.erase(hash);
617 nTransactionsUpdated++;
629 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
631 if (hashBlock == 0 || nIndex == -1)
634 // Find the block it claims to be in
635 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
636 if (mi == mapBlockIndex.end())
638 CBlockIndex* pindex = (*mi).second;
639 if (!pindex || !pindex->IsInMainChain())
642 // Make sure the merkle branch connects to this block
643 if (!fMerkleVerified)
645 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
647 fMerkleVerified = true;
651 return pindexBest->nHeight - pindex->nHeight + 1;
655 int CMerkleTx::GetBlocksToMaturity() const
659 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
663 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
667 if (!IsInMainChain() && !ClientConnectInputs())
669 return CTransaction::AcceptToMemoryPool(txdb, false);
673 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
677 bool CMerkleTx::AcceptToMemoryPool()
680 return AcceptToMemoryPool(txdb);
685 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
687 CRITICAL_BLOCK(cs_mapTransactions)
689 // Add previous supporting transactions first
690 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
692 if (!tx.IsCoinBase())
694 uint256 hash = tx.GetHash();
695 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
696 tx.AcceptToMemoryPool(txdb, fCheckInputs);
699 return AcceptToMemoryPool(txdb, fCheckInputs);
704 bool CWalletTx::AcceptWalletTransaction()
707 return AcceptWalletTransaction(txdb);
710 int CTxIndex::GetDepthInMainChain() const
714 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
716 // Find the block in the index
717 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
718 if (mi == mapBlockIndex.end())
720 CBlockIndex* pindex = (*mi).second;
721 if (!pindex || !pindex->IsInMainChain())
723 return 1 + nBestHeight - pindex->nHeight;
735 //////////////////////////////////////////////////////////////////////////////
737 // CBlock and CBlockIndex
740 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
742 if (!fReadTransactions)
744 *this = pindex->GetBlockHeader();
747 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
749 if (GetHash() != pindex->GetBlockHash())
750 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
754 uint256 static GetOrphanRoot(const CBlock* pblock)
756 // Work back to the first block in the orphan chain
757 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
758 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
759 return pblock->GetHash();
762 int64 static GetBlockValue(int nHeight, int64 nFees)
764 int64 nSubsidy = 50 * COIN;
766 // Subsidy is cut in half every 4 years
767 nSubsidy >>= (nHeight / 210000);
769 return nSubsidy + nFees;
772 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
773 static const int64 nTargetSpacing = 10 * 60;
774 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
777 // minimum amount of work that could possibly be required nTime after
778 // minimum work required was nBase
780 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
782 // Testnet has min-difficulty blocks
783 // after nTargetSpacing*2 time between blocks:
784 if (fTestNet && nTime > nTargetSpacing*2)
785 return bnProofOfWorkLimit.GetCompact();
788 bnResult.SetCompact(nBase);
789 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
791 // Maximum 400% adjustment...
793 // ... in best-case exactly 4-times-normal target time
794 nTime -= nTargetTimespan*4;
796 if (bnResult > bnProofOfWorkLimit)
797 bnResult = bnProofOfWorkLimit;
798 return bnResult.GetCompact();
801 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
803 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
806 if (pindexLast == NULL)
807 return nProofOfWorkLimit;
809 // Only change once per interval
810 if ((pindexLast->nHeight+1) % nInterval != 0)
812 // Special rules for testnet after 15 Feb 2012:
813 if (fTestNet && pblock->nTime > 1329264000)
815 // If the new block's timestamp is more than 2* 10 minutes
816 // then allow mining of a min-difficulty block.
817 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
818 return nProofOfWorkLimit;
821 // Return the last non-special-min-difficulty-rules-block
822 const CBlockIndex* pindex = pindexLast;
823 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
824 pindex = pindex->pprev;
825 return pindex->nBits;
829 return pindexLast->nBits;
832 // Go back by what we want to be 14 days worth of blocks
833 const CBlockIndex* pindexFirst = pindexLast;
834 for (int i = 0; pindexFirst && i < nInterval-1; i++)
835 pindexFirst = pindexFirst->pprev;
838 // Limit adjustment step
839 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
840 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
841 if (nActualTimespan < nTargetTimespan/4)
842 nActualTimespan = nTargetTimespan/4;
843 if (nActualTimespan > nTargetTimespan*4)
844 nActualTimespan = nTargetTimespan*4;
848 bnNew.SetCompact(pindexLast->nBits);
849 bnNew *= nActualTimespan;
850 bnNew /= nTargetTimespan;
852 if (bnNew > bnProofOfWorkLimit)
853 bnNew = bnProofOfWorkLimit;
856 printf("GetNextWorkRequired RETARGET\n");
857 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
858 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
859 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
861 return bnNew.GetCompact();
864 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
867 bnTarget.SetCompact(nBits);
870 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
871 return error("CheckProofOfWork() : nBits below minimum work");
873 // Check proof of work matches claimed amount
874 if (hash > bnTarget.getuint256())
875 return error("CheckProofOfWork() : hash doesn't match nBits");
880 // Return maximum amount of blocks that other nodes claim to have
881 int GetNumBlocksOfPeers()
883 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
886 bool IsInitialBlockDownload()
888 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
890 static int64 nLastUpdate;
891 static CBlockIndex* pindexLastBest;
892 if (pindexBest != pindexLastBest)
894 pindexLastBest = pindexBest;
895 nLastUpdate = GetTime();
897 return (GetTime() - nLastUpdate < 10 &&
898 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
901 void static InvalidChainFound(CBlockIndex* pindexNew)
903 if (pindexNew->bnChainWork > bnBestInvalidWork)
905 bnBestInvalidWork = pindexNew->bnChainWork;
906 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
909 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());
910 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
911 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
912 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
915 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
917 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
919 // Updating time can change work required on testnet:
921 nBits = GetNextWorkRequired(pindexPrev, this);
934 bool CTransaction::DisconnectInputs(CTxDB& txdb)
936 // Relinquish previous transactions' spent pointers
939 BOOST_FOREACH(const CTxIn& txin, vin)
941 COutPoint prevout = txin.prevout;
943 // Get prev txindex from disk
945 if (!txdb.ReadTxIndex(prevout.hash, txindex))
946 return error("DisconnectInputs() : ReadTxIndex failed");
948 if (prevout.n >= txindex.vSpent.size())
949 return error("DisconnectInputs() : prevout.n out of range");
951 // Mark outpoint as not spent
952 txindex.vSpent[prevout.n].SetNull();
955 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
956 return error("DisconnectInputs() : UpdateTxIndex failed");
960 // Remove transaction from index
961 if (!txdb.EraseTxIndex(*this))
962 return error("DisconnectInputs() : EraseTxPos failed");
968 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
969 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
971 // FetchInputs can return false either because we just haven't seen some inputs
972 // (in which case the transaction should be stored as an orphan)
973 // or because the transaction is malformed (in which case the transaction should
974 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
978 return true; // Coinbase transactions have no inputs to fetch.
980 for (int i = 0; i < vin.size(); i++)
982 COutPoint prevout = vin[i].prevout;
983 if (inputsRet.count(prevout.hash))
984 continue; // Got it already
987 CTxIndex& txindex = inputsRet[prevout.hash].first;
989 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
991 // Get txindex from current proposed changes
992 txindex = mapTestPool.find(prevout.hash)->second;
996 // Read txindex from txdb
997 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
999 if (!fFound && (fBlock || fMiner))
1000 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());
1003 CTransaction& txPrev = inputsRet[prevout.hash].second;
1004 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1006 // Get prev tx from single transactions in memory
1007 CRITICAL_BLOCK(cs_mapTransactions)
1009 if (!mapTransactions.count(prevout.hash))
1010 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1011 txPrev = mapTransactions[prevout.hash];
1014 txindex.vSpent.resize(txPrev.vout.size());
1018 // Get prev tx from disk
1019 if (!txPrev.ReadFromDisk(txindex.pos))
1020 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1024 // Make sure all prevout.n's are valid:
1025 for (int i = 0; i < vin.size(); i++)
1027 const COutPoint prevout = vin[i].prevout;
1028 assert(inputsRet.count(prevout.hash) != 0);
1029 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1030 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1031 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1033 // Revisit this if/when transaction replacement is implemented and allows
1036 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()));
1043 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1045 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1046 if (mi == inputs.end())
1047 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1049 const CTransaction& txPrev = (mi->second).second;
1050 if (input.prevout.n >= txPrev.vout.size())
1051 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1053 return txPrev.vout[input.prevout.n];
1056 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1062 for (int i = 0; i < vin.size(); i++)
1064 nResult += GetOutputFor(vin[i], inputs).nValue;
1070 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1076 for (int i = 0; i < vin.size(); i++)
1078 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1079 if (prevout.scriptPubKey.IsPayToScriptHash())
1080 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1085 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1086 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1087 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1089 // Take over previous transactions' spent pointers
1090 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1091 // fMiner is true when called from the internal bitcoin miner
1092 // ... both are false when called from CTransaction::AcceptToMemoryPool
1097 for (int i = 0; i < vin.size(); i++)
1099 COutPoint prevout = vin[i].prevout;
1100 assert(inputs.count(prevout.hash) > 0);
1101 CTxIndex& txindex = inputs[prevout.hash].first;
1102 CTransaction& txPrev = inputs[prevout.hash].second;
1104 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1105 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()));
1107 // If prev is coinbase, check that it's matured
1108 if (txPrev.IsCoinBase())
1109 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1110 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1111 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1113 // Check for conflicts (double-spend)
1114 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1115 // for an attacker to attempt to split the network.
1116 if (!txindex.vSpent[prevout.n].IsNull())
1117 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());
1119 // Check for negative or overflow input values
1120 nValueIn += txPrev.vout[prevout.n].nValue;
1121 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1122 return DoS(100, error("ConnectInputs() : txin values out of range"));
1124 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1125 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1126 // still computed and checked, and any change will be caught at the next checkpoint.
1127 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1130 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1131 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1134 // Mark outpoints as spent
1135 txindex.vSpent[prevout.n] = posThisTx;
1138 if (fBlock || fMiner)
1140 mapTestPool[prevout.hash] = txindex;
1144 if (nValueIn < GetValueOut())
1145 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1147 // Tally transaction fees
1148 int64 nTxFee = nValueIn - GetValueOut();
1150 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1152 if (!MoneyRange(nFees))
1153 return DoS(100, error("ConnectInputs() : nFees out of range"));
1160 bool CTransaction::ClientConnectInputs()
1165 // Take over previous transactions' spent pointers
1166 CRITICAL_BLOCK(cs_mapTransactions)
1169 for (int i = 0; i < vin.size(); i++)
1171 // Get prev tx from single transactions in memory
1172 COutPoint prevout = vin[i].prevout;
1173 if (!mapTransactions.count(prevout.hash))
1175 CTransaction& txPrev = mapTransactions[prevout.hash];
1177 if (prevout.n >= txPrev.vout.size())
1181 if (!VerifySignature(txPrev, *this, i, true, 0))
1182 return error("ConnectInputs() : VerifySignature failed");
1184 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1185 ///// this has to go away now that posNext is gone
1186 // // Check for conflicts
1187 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1188 // return error("ConnectInputs() : prev tx already used");
1190 // // Flag outpoints as used
1191 // txPrev.vout[prevout.n].posNext = posThisTx;
1193 nValueIn += txPrev.vout[prevout.n].nValue;
1195 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1196 return error("ClientConnectInputs() : txin values out of range");
1198 if (GetValueOut() > nValueIn)
1208 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1210 // Disconnect in reverse order
1211 for (int i = vtx.size()-1; i >= 0; i--)
1212 if (!vtx[i].DisconnectInputs(txdb))
1215 // Update block index on disk without changing it in memory.
1216 // The memory index structure will be changed after the db commits.
1219 CDiskBlockIndex blockindexPrev(pindex->pprev);
1220 blockindexPrev.hashNext = 0;
1221 if (!txdb.WriteBlockIndex(blockindexPrev))
1222 return error("DisconnectBlock() : WriteBlockIndex failed");
1228 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1230 // Check it again in case a previous version let a bad block in
1234 // To avoid being on the short end of a block-chain split,
1235 // don't do secondary validation of pay-to-script-hash transactions
1236 // until blocks with timestamps after paytoscripthashtime (see init.cpp for default).
1237 // This code can be removed once a super-majority of the network has upgraded.
1238 int64 nEvalSwitchTime = GetArg("-paytoscripthashtime", std::numeric_limits<int64_t>::max());
1239 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1241 //// issue here: it doesn't know the version
1242 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1244 map<uint256, CTxIndex> mapQueuedChanges;
1247 BOOST_FOREACH(CTransaction& tx, vtx)
1249 nSigOps += tx.GetLegacySigOpCount();
1250 if (nSigOps > MAX_BLOCK_SIGOPS)
1251 return DoS(100, error("ConnectBlock() : too many sigops"));
1253 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1254 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1256 MapPrevTx mapInputs;
1257 if (!tx.IsCoinBase())
1260 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1263 if (fStrictPayToScriptHash)
1265 // Add in sigops done by pay-to-script-hash inputs;
1266 // this is to prevent a "rogue miner" from creating
1267 // an incredibly-expensive-to-validate block.
1268 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1269 if (nSigOps > MAX_BLOCK_SIGOPS)
1270 return DoS(100, error("ConnectBlock() : too many sigops"));
1273 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1275 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1279 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1282 // Write queued txindex changes
1283 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1285 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1286 return error("ConnectBlock() : UpdateTxIndex failed");
1289 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1292 // Update block index on disk without changing it in memory.
1293 // The memory index structure will be changed after the db commits.
1296 CDiskBlockIndex blockindexPrev(pindex->pprev);
1297 blockindexPrev.hashNext = pindex->GetBlockHash();
1298 if (!txdb.WriteBlockIndex(blockindexPrev))
1299 return error("ConnectBlock() : WriteBlockIndex failed");
1302 // Watch for transactions paying to me
1303 BOOST_FOREACH(CTransaction& tx, vtx)
1304 SyncWithWallets(tx, this, true);
1309 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1311 printf("REORGANIZE\n");
1314 CBlockIndex* pfork = pindexBest;
1315 CBlockIndex* plonger = pindexNew;
1316 while (pfork != plonger)
1318 while (plonger->nHeight > pfork->nHeight)
1319 if (!(plonger = plonger->pprev))
1320 return error("Reorganize() : plonger->pprev is null");
1321 if (pfork == plonger)
1323 if (!(pfork = pfork->pprev))
1324 return error("Reorganize() : pfork->pprev is null");
1327 // List of what to disconnect
1328 vector<CBlockIndex*> vDisconnect;
1329 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1330 vDisconnect.push_back(pindex);
1332 // List of what to connect
1333 vector<CBlockIndex*> vConnect;
1334 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1335 vConnect.push_back(pindex);
1336 reverse(vConnect.begin(), vConnect.end());
1338 // Disconnect shorter branch
1339 vector<CTransaction> vResurrect;
1340 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1343 if (!block.ReadFromDisk(pindex))
1344 return error("Reorganize() : ReadFromDisk for disconnect failed");
1345 if (!block.DisconnectBlock(txdb, pindex))
1346 return error("Reorganize() : DisconnectBlock failed");
1348 // Queue memory transactions to resurrect
1349 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1350 if (!tx.IsCoinBase())
1351 vResurrect.push_back(tx);
1354 // Connect longer branch
1355 vector<CTransaction> vDelete;
1356 for (int i = 0; i < vConnect.size(); i++)
1358 CBlockIndex* pindex = vConnect[i];
1360 if (!block.ReadFromDisk(pindex))
1361 return error("Reorganize() : ReadFromDisk for connect failed");
1362 if (!block.ConnectBlock(txdb, pindex))
1366 return error("Reorganize() : ConnectBlock failed");
1369 // Queue memory transactions to delete
1370 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1371 vDelete.push_back(tx);
1373 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1374 return error("Reorganize() : WriteHashBestChain failed");
1376 // Make sure it's successfully written to disk before changing memory structure
1377 if (!txdb.TxnCommit())
1378 return error("Reorganize() : TxnCommit failed");
1380 // Disconnect shorter branch
1381 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1383 pindex->pprev->pnext = NULL;
1385 // Connect longer branch
1386 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1388 pindex->pprev->pnext = pindex;
1390 // Resurrect memory transactions that were in the disconnected branch
1391 BOOST_FOREACH(CTransaction& tx, vResurrect)
1392 tx.AcceptToMemoryPool(txdb, false);
1394 // Delete redundant memory transactions that are in the connected branch
1395 BOOST_FOREACH(CTransaction& tx, vDelete)
1396 tx.RemoveFromMemoryPool();
1398 printf("REORGANIZE: Disconnected %i blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1399 printf("REORGANIZE: Connected %i blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1406 runCommand(std::string strCommand)
1408 int nErr = ::system(strCommand.c_str());
1410 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1413 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1415 uint256 hash = GetHash();
1418 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1420 txdb.WriteHashBestChain(hash);
1421 if (!txdb.TxnCommit())
1422 return error("SetBestChain() : TxnCommit failed");
1423 pindexGenesisBlock = pindexNew;
1425 else if (hashPrevBlock == hashBestChain)
1427 // Adding to current best branch
1428 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1431 InvalidChainFound(pindexNew);
1432 return error("SetBestChain() : ConnectBlock failed");
1434 if (!txdb.TxnCommit())
1435 return error("SetBestChain() : TxnCommit failed");
1437 // Add to current best branch
1438 pindexNew->pprev->pnext = pindexNew;
1440 // Delete redundant memory transactions
1441 BOOST_FOREACH(CTransaction& tx, vtx)
1442 tx.RemoveFromMemoryPool();
1447 if (!Reorganize(txdb, pindexNew))
1450 InvalidChainFound(pindexNew);
1451 return error("SetBestChain() : Reorganize failed");
1455 // Update best block in wallet (so we can detect restored wallets)
1456 bool fIsInitialDownload = IsInitialBlockDownload();
1457 if (!fIsInitialDownload)
1459 const CBlockLocator locator(pindexNew);
1460 ::SetBestChain(locator);
1464 hashBestChain = hash;
1465 pindexBest = pindexNew;
1466 nBestHeight = pindexBest->nHeight;
1467 bnBestChainWork = pindexNew->bnChainWork;
1468 nTimeBestReceived = GetTime();
1469 nTransactionsUpdated++;
1470 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1472 std::string strCmd = GetArg("-blocknotify", "");
1474 if (!fIsInitialDownload && !strCmd.empty())
1476 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1477 boost::thread t(runCommand, strCmd); // thread runs free
1484 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1486 // Check for duplicate
1487 uint256 hash = GetHash();
1488 if (mapBlockIndex.count(hash))
1489 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1491 // Construct new block index object
1492 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1494 return error("AddToBlockIndex() : new CBlockIndex failed");
1495 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1496 pindexNew->phashBlock = &((*mi).first);
1497 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1498 if (miPrev != mapBlockIndex.end())
1500 pindexNew->pprev = (*miPrev).second;
1501 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1503 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1507 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1508 if (!txdb.TxnCommit())
1512 if (pindexNew->bnChainWork > bnBestChainWork)
1513 if (!SetBestChain(txdb, pindexNew))
1518 if (pindexNew == pindexBest)
1520 // Notify UI to display prev block's coinbase if it was ours
1521 static uint256 hashPrevBestCoinBase;
1522 UpdatedTransaction(hashPrevBestCoinBase);
1523 hashPrevBestCoinBase = vtx[0].GetHash();
1533 bool CBlock::CheckBlock() const
1535 // These are checks that are independent of context
1536 // that can be verified before saving an orphan block.
1539 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1540 return DoS(100, error("CheckBlock() : size limits failed"));
1542 // Check proof of work matches claimed amount
1543 if (!CheckProofOfWork(GetHash(), nBits))
1544 return DoS(50, error("CheckBlock() : proof of work failed"));
1547 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1548 return error("CheckBlock() : block timestamp too far in the future");
1550 // First transaction must be coinbase, the rest must not be
1551 if (vtx.empty() || !vtx[0].IsCoinBase())
1552 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1553 for (int i = 1; i < vtx.size(); i++)
1554 if (vtx[i].IsCoinBase())
1555 return DoS(100, error("CheckBlock() : more than one coinbase"));
1557 // Check transactions
1558 BOOST_FOREACH(const CTransaction& tx, vtx)
1559 if (!tx.CheckTransaction())
1560 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1563 BOOST_FOREACH(const CTransaction& tx, vtx)
1565 nSigOps += tx.GetLegacySigOpCount();
1567 if (nSigOps > MAX_BLOCK_SIGOPS)
1568 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1571 if (hashMerkleRoot != BuildMerkleTree())
1572 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1577 bool CBlock::AcceptBlock()
1579 // Check for duplicate
1580 uint256 hash = GetHash();
1581 if (mapBlockIndex.count(hash))
1582 return error("AcceptBlock() : block already in mapBlockIndex");
1584 // Get prev block index
1585 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1586 if (mi == mapBlockIndex.end())
1587 return DoS(10, error("AcceptBlock() : prev block not found"));
1588 CBlockIndex* pindexPrev = (*mi).second;
1589 int nHeight = pindexPrev->nHeight+1;
1591 // Check proof of work
1592 if (nBits != GetNextWorkRequired(pindexPrev, this))
1593 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1595 // Check timestamp against prev
1596 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1597 return error("AcceptBlock() : block's timestamp is too early");
1599 // Check that all transactions are finalized
1600 BOOST_FOREACH(const CTransaction& tx, vtx)
1601 if (!tx.IsFinal(nHeight, GetBlockTime()))
1602 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1604 // Check that the block chain matches the known block chain up to a checkpoint
1605 if (!Checkpoints::CheckBlock(nHeight, hash))
1606 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1608 // Write block to history file
1609 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1610 return error("AcceptBlock() : out of disk space");
1611 unsigned int nFile = -1;
1612 unsigned int nBlockPos = 0;
1613 if (!WriteToDisk(nFile, nBlockPos))
1614 return error("AcceptBlock() : WriteToDisk failed");
1615 if (!AddToBlockIndex(nFile, nBlockPos))
1616 return error("AcceptBlock() : AddToBlockIndex failed");
1618 // Relay inventory, but don't relay old inventory during initial block download
1619 if (hashBestChain == hash)
1620 CRITICAL_BLOCK(cs_vNodes)
1621 BOOST_FOREACH(CNode* pnode, vNodes)
1622 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1623 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1628 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1630 // Check for duplicate
1631 uint256 hash = pblock->GetHash();
1632 if (mapBlockIndex.count(hash))
1633 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1634 if (mapOrphanBlocks.count(hash))
1635 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1637 // Preliminary checks
1638 if (!pblock->CheckBlock())
1639 return error("ProcessBlock() : CheckBlock FAILED");
1641 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1642 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1644 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1645 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1649 pfrom->Misbehaving(100);
1650 return error("ProcessBlock() : block with timestamp before last checkpoint");
1653 bnNewBlock.SetCompact(pblock->nBits);
1655 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1656 if (bnNewBlock > bnRequired)
1659 pfrom->Misbehaving(100);
1660 return error("ProcessBlock() : block with too little proof-of-work");
1665 // If don't already have its previous block, shunt it off to holding area until we get it
1666 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1668 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1669 CBlock* pblock2 = new CBlock(*pblock);
1670 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1671 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1673 // Ask this guy to fill in what we're missing
1675 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1680 if (!pblock->AcceptBlock())
1681 return error("ProcessBlock() : AcceptBlock FAILED");
1683 // Recursively process any orphan blocks that depended on this one
1684 vector<uint256> vWorkQueue;
1685 vWorkQueue.push_back(hash);
1686 for (int i = 0; i < vWorkQueue.size(); i++)
1688 uint256 hashPrev = vWorkQueue[i];
1689 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1690 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1693 CBlock* pblockOrphan = (*mi).second;
1694 if (pblockOrphan->AcceptBlock())
1695 vWorkQueue.push_back(pblockOrphan->GetHash());
1696 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1697 delete pblockOrphan;
1699 mapOrphanBlocksByPrev.erase(hashPrev);
1702 printf("ProcessBlock: ACCEPTED\n");
1713 bool CheckDiskSpace(uint64 nAdditionalBytes)
1715 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1717 // Check for 15MB because database could create another 10MB log file at any time
1718 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1721 string strMessage = _("Warning: Disk space is low ");
1722 strMiscWarning = strMessage;
1723 printf("*** %s\n", strMessage.c_str());
1724 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1725 CreateThread(Shutdown, NULL);
1731 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1735 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1738 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1740 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1749 static unsigned int nCurrentBlockFile = 1;
1751 FILE* AppendBlockFile(unsigned int& nFileRet)
1756 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1759 if (fseek(file, 0, SEEK_END) != 0)
1761 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1762 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1764 nFileRet = nCurrentBlockFile;
1768 nCurrentBlockFile++;
1772 bool LoadBlockIndex(bool fAllowNew)
1776 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1777 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1778 pchMessageStart[0] = 0xfa;
1779 pchMessageStart[1] = 0xbf;
1780 pchMessageStart[2] = 0xb5;
1781 pchMessageStart[3] = 0xda;
1788 if (!txdb.LoadBlockIndex())
1793 // Init with genesis block
1795 if (mapBlockIndex.empty())
1801 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1802 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1803 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1804 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1805 // vMerkleTree: 4a5e1e
1808 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1810 txNew.vin.resize(1);
1811 txNew.vout.resize(1);
1812 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1813 txNew.vout[0].nValue = 50 * COIN;
1814 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1816 block.vtx.push_back(txNew);
1817 block.hashPrevBlock = 0;
1818 block.hashMerkleRoot = block.BuildMerkleTree();
1820 block.nTime = 1231006505;
1821 block.nBits = 0x1d00ffff;
1822 block.nNonce = 2083236893;
1826 block.nTime = 1296688602;
1827 block.nBits = 0x1d07fff8;
1828 block.nNonce = 384568319;
1832 printf("%s\n", block.GetHash().ToString().c_str());
1833 printf("%s\n", hashGenesisBlock.ToString().c_str());
1834 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1835 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1837 assert(block.GetHash() == hashGenesisBlock);
1839 // Start new block file
1841 unsigned int nBlockPos;
1842 if (!block.WriteToDisk(nFile, nBlockPos))
1843 return error("LoadBlockIndex() : writing genesis block to disk failed");
1844 if (!block.AddToBlockIndex(nFile, nBlockPos))
1845 return error("LoadBlockIndex() : genesis block not accepted");
1853 void PrintBlockTree()
1855 // precompute tree structure
1856 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1857 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1859 CBlockIndex* pindex = (*mi).second;
1860 mapNext[pindex->pprev].push_back(pindex);
1862 //while (rand() % 3 == 0)
1863 // mapNext[pindex->pprev].push_back(pindex);
1866 vector<pair<int, CBlockIndex*> > vStack;
1867 vStack.push_back(make_pair(0, pindexGenesisBlock));
1870 while (!vStack.empty())
1872 int nCol = vStack.back().first;
1873 CBlockIndex* pindex = vStack.back().second;
1876 // print split or gap
1877 if (nCol > nPrevCol)
1879 for (int i = 0; i < nCol-1; i++)
1883 else if (nCol < nPrevCol)
1885 for (int i = 0; i < nCol; i++)
1892 for (int i = 0; i < nCol; i++)
1897 block.ReadFromDisk(pindex);
1898 printf("%d (%u,%u) %s %s tx %d",
1902 block.GetHash().ToString().substr(0,20).c_str(),
1903 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1906 PrintWallets(block);
1908 // put the main timechain first
1909 vector<CBlockIndex*>& vNext = mapNext[pindex];
1910 for (int i = 0; i < vNext.size(); i++)
1912 if (vNext[i]->pnext)
1914 swap(vNext[0], vNext[i]);
1920 for (int i = 0; i < vNext.size(); i++)
1921 vStack.push_back(make_pair(nCol+i, vNext[i]));
1934 //////////////////////////////////////////////////////////////////////////////
1939 map<uint256, CAlert> mapAlerts;
1940 CCriticalSection cs_mapAlerts;
1942 string GetWarnings(string strFor)
1945 string strStatusBar;
1947 if (GetBoolArg("-testsafemode"))
1950 // Misc warnings like out of disk space and clock is wrong
1951 if (strMiscWarning != "")
1954 strStatusBar = strMiscWarning;
1957 // Longer invalid proof-of-work chain
1958 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1961 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1965 CRITICAL_BLOCK(cs_mapAlerts)
1967 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1969 const CAlert& alert = item.second;
1970 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1972 nPriority = alert.nPriority;
1973 strStatusBar = alert.strStatusBar;
1978 if (strFor == "statusbar")
1979 return strStatusBar;
1980 else if (strFor == "rpc")
1982 assert(!"GetWarnings() : invalid parameter");
1986 bool CAlert::ProcessAlert()
1988 if (!CheckSignature())
1993 CRITICAL_BLOCK(cs_mapAlerts)
1995 // Cancel previous alerts
1996 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1998 const CAlert& alert = (*mi).second;
2001 printf("cancelling alert %d\n", alert.nID);
2002 mapAlerts.erase(mi++);
2004 else if (!alert.IsInEffect())
2006 printf("expiring alert %d\n", alert.nID);
2007 mapAlerts.erase(mi++);
2013 // Check if this alert has been cancelled
2014 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2016 const CAlert& alert = item.second;
2017 if (alert.Cancels(*this))
2019 printf("alert already cancelled by %d\n", alert.nID);
2025 mapAlerts.insert(make_pair(GetHash(), *this));
2028 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2040 //////////////////////////////////////////////////////////////////////////////
2046 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2050 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2051 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2053 // Don't know what it is, just say we already got one
2060 // The message start string is designed to be unlikely to occur in normal data.
2061 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2062 // a large 4-byte int at any alignment.
2063 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2066 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2068 static map<CService, vector<unsigned char> > mapReuseKey;
2069 RandAddSeedPerfmon();
2071 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2072 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2074 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2076 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2084 if (strCommand == "version")
2086 // Each connection can only send one version message
2087 if (pfrom->nVersion != 0)
2089 pfrom->Misbehaving(1);
2097 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2098 if (pfrom->nVersion < 209)
2100 // Since Februari 20, 2012, the protocol is initiated at version 209,
2101 // and earlier versions are no longer supported
2102 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2103 pfrom->fDisconnect = true;
2107 if (pfrom->nVersion == 10300)
2108 pfrom->nVersion = 300;
2110 vRecv >> addrFrom >> nNonce;
2112 vRecv >> pfrom->strSubVer;
2114 vRecv >> pfrom->nStartingHeight;
2116 // Disconnect if we connected to ourself
2117 if (nNonce == nLocalHostNonce && nNonce > 1)
2119 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2120 pfrom->fDisconnect = true;
2124 // Be shy and don't send version until we hear
2125 if (pfrom->fInbound)
2126 pfrom->PushVersion();
2128 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2130 AddTimeData(pfrom->addr, nTime);
2133 pfrom->PushMessage("verack");
2134 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2136 if (!pfrom->fInbound)
2138 // Advertise our address
2139 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2140 !IsInitialBlockDownload())
2142 CAddress addr(addrLocalHost);
2143 addr.nTime = GetAdjustedTime();
2144 pfrom->PushAddress(addr);
2147 // Get recent addresses
2148 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2150 pfrom->PushMessage("getaddr");
2151 pfrom->fGetAddr = true;
2155 // Ask the first connected node for block updates
2156 static int nAskedForBlocks = 0;
2157 if (!pfrom->fClient &&
2158 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2159 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2162 pfrom->PushGetBlocks(pindexBest, uint256(0));
2166 CRITICAL_BLOCK(cs_mapAlerts)
2167 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2168 item.second.RelayTo(pfrom);
2170 pfrom->fSuccessfullyConnected = true;
2172 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2174 cPeerBlockCounts.input(pfrom->nStartingHeight);
2178 else if (pfrom->nVersion == 0)
2180 // Must have a version message before anything else
2181 pfrom->Misbehaving(1);
2186 else if (strCommand == "verack")
2188 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2192 else if (strCommand == "addr")
2194 vector<CAddress> vAddr;
2197 // Don't want addr from older versions unless seeding
2198 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2200 if (vAddr.size() > 1000)
2202 pfrom->Misbehaving(20);
2203 return error("message addr size() = %d", vAddr.size());
2206 // Store the new addresses
2209 int64 nNow = GetAdjustedTime();
2210 int64 nSince = nNow - 10 * 60;
2211 BOOST_FOREACH(CAddress& addr, vAddr)
2215 // ignore IPv6 for now, since it isn't implemented anyway
2218 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2219 addr.nTime = nNow - 5 * 24 * 60 * 60;
2220 AddAddress(addr, 2 * 60 * 60, &addrDB);
2221 pfrom->AddAddressKnown(addr);
2222 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2224 // Relay to a limited number of other nodes
2225 CRITICAL_BLOCK(cs_vNodes)
2227 // Use deterministic randomness to send to the same nodes for 24 hours
2228 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2229 static uint256 hashSalt;
2231 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2232 int64 hashAddr = addr.GetHash();
2233 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2234 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2235 multimap<uint256, CNode*> mapMix;
2236 BOOST_FOREACH(CNode* pnode, vNodes)
2238 if (pnode->nVersion < 31402)
2240 unsigned int nPointer;
2241 memcpy(&nPointer, &pnode, sizeof(nPointer));
2242 uint256 hashKey = hashRand ^ nPointer;
2243 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2244 mapMix.insert(make_pair(hashKey, pnode));
2246 int nRelayNodes = 2;
2247 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2248 ((*mi).second)->PushAddress(addr);
2252 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2253 if (vAddr.size() < 1000)
2254 pfrom->fGetAddr = false;
2258 else if (strCommand == "inv")
2262 if (vInv.size() > 50000)
2264 pfrom->Misbehaving(20);
2265 return error("message inv size() = %d", vInv.size());
2269 BOOST_FOREACH(const CInv& inv, vInv)
2273 pfrom->AddInventoryKnown(inv);
2275 bool fAlreadyHave = AlreadyHave(txdb, inv);
2277 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2281 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2282 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2284 // Track requests for our stuff
2285 Inventory(inv.hash);
2290 else if (strCommand == "getdata")
2294 if (vInv.size() > 50000)
2296 pfrom->Misbehaving(20);
2297 return error("message getdata size() = %d", vInv.size());
2300 BOOST_FOREACH(const CInv& inv, vInv)
2304 printf("received getdata for: %s\n", inv.ToString().c_str());
2306 if (inv.type == MSG_BLOCK)
2308 // Send block from disk
2309 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2310 if (mi != mapBlockIndex.end())
2313 block.ReadFromDisk((*mi).second);
2314 pfrom->PushMessage("block", block);
2316 // Trigger them to send a getblocks request for the next batch of inventory
2317 if (inv.hash == pfrom->hashContinue)
2319 // Bypass PushInventory, this must send even if redundant,
2320 // and we want it right after the last block so they don't
2321 // wait for other stuff first.
2323 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2324 pfrom->PushMessage("inv", vInv);
2325 pfrom->hashContinue = 0;
2329 else if (inv.IsKnownType())
2331 // Send stream from relay memory
2332 CRITICAL_BLOCK(cs_mapRelay)
2334 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2335 if (mi != mapRelay.end())
2336 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2340 // Track requests for our stuff
2341 Inventory(inv.hash);
2346 else if (strCommand == "getblocks")
2348 CBlockLocator locator;
2350 vRecv >> locator >> hashStop;
2352 // Find the last block the caller has in the main chain
2353 CBlockIndex* pindex = locator.GetBlockIndex();
2355 // Send the rest of the chain
2357 pindex = pindex->pnext;
2358 int nLimit = 500 + locator.GetDistanceBack();
2359 unsigned int nBytes = 0;
2360 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2361 for (; pindex; pindex = pindex->pnext)
2363 if (pindex->GetBlockHash() == hashStop)
2365 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2368 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2370 block.ReadFromDisk(pindex, true);
2371 nBytes += block.GetSerializeSize(SER_NETWORK);
2372 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2374 // When this block is requested, we'll send an inv that'll make them
2375 // getblocks the next batch of inventory.
2376 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2377 pfrom->hashContinue = pindex->GetBlockHash();
2384 else if (strCommand == "getheaders")
2386 CBlockLocator locator;
2388 vRecv >> locator >> hashStop;
2390 CBlockIndex* pindex = NULL;
2391 if (locator.IsNull())
2393 // If locator is null, return the hashStop block
2394 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2395 if (mi == mapBlockIndex.end())
2397 pindex = (*mi).second;
2401 // Find the last block the caller has in the main chain
2402 pindex = locator.GetBlockIndex();
2404 pindex = pindex->pnext;
2407 vector<CBlock> vHeaders;
2408 int nLimit = 2000 + locator.GetDistanceBack();
2409 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2410 for (; pindex; pindex = pindex->pnext)
2412 vHeaders.push_back(pindex->GetBlockHeader());
2413 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2416 pfrom->PushMessage("headers", vHeaders);
2420 else if (strCommand == "tx")
2422 vector<uint256> vWorkQueue;
2423 CDataStream vMsg(vRecv);
2427 CInv inv(MSG_TX, tx.GetHash());
2428 pfrom->AddInventoryKnown(inv);
2430 bool fMissingInputs = false;
2431 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2433 SyncWithWallets(tx, NULL, true);
2434 RelayMessage(inv, vMsg);
2435 mapAlreadyAskedFor.erase(inv);
2436 vWorkQueue.push_back(inv.hash);
2438 // Recursively process any orphan transactions that depended on this one
2439 for (int i = 0; i < vWorkQueue.size(); i++)
2441 uint256 hashPrev = vWorkQueue[i];
2442 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2443 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2446 const CDataStream& vMsg = *((*mi).second);
2448 CDataStream(vMsg) >> tx;
2449 CInv inv(MSG_TX, tx.GetHash());
2451 if (tx.AcceptToMemoryPool(true))
2453 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2454 SyncWithWallets(tx, NULL, true);
2455 RelayMessage(inv, vMsg);
2456 mapAlreadyAskedFor.erase(inv);
2457 vWorkQueue.push_back(inv.hash);
2462 BOOST_FOREACH(uint256 hash, vWorkQueue)
2463 EraseOrphanTx(hash);
2465 else if (fMissingInputs)
2467 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2470 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2474 else if (strCommand == "block")
2479 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2482 CInv inv(MSG_BLOCK, block.GetHash());
2483 pfrom->AddInventoryKnown(inv);
2485 if (ProcessBlock(pfrom, &block))
2486 mapAlreadyAskedFor.erase(inv);
2487 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2491 else if (strCommand == "getaddr")
2493 // Nodes rebroadcast an addr every 24 hours
2494 pfrom->vAddrToSend.clear();
2495 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2496 CRITICAL_BLOCK(cs_mapAddresses)
2498 unsigned int nCount = 0;
2499 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2501 const CAddress& addr = item.second;
2502 if (addr.nTime > nSince)
2505 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2507 const CAddress& addr = item.second;
2508 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2509 pfrom->PushAddress(addr);
2515 else if (strCommand == "checkorder")
2520 if (!GetBoolArg("-allowreceivebyip"))
2522 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2529 /// we have a chance to check the order here
2531 // Keep giving the same key to the same ip until they use it
2532 if (!mapReuseKey.count(pfrom->addr))
2533 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2535 // Send back approval of order and pubkey to use
2536 CScript scriptPubKey;
2537 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2538 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2542 else if (strCommand == "reply")
2547 CRequestTracker tracker;
2548 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2550 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2551 if (mi != pfrom->mapRequests.end())
2553 tracker = (*mi).second;
2554 pfrom->mapRequests.erase(mi);
2557 if (!tracker.IsNull())
2558 tracker.fn(tracker.param1, vRecv);
2562 else if (strCommand == "ping")
2567 else if (strCommand == "alert")
2572 if (alert.ProcessAlert())
2575 pfrom->setKnown.insert(alert.GetHash());
2576 CRITICAL_BLOCK(cs_vNodes)
2577 BOOST_FOREACH(CNode* pnode, vNodes)
2578 alert.RelayTo(pnode);
2585 // Ignore unknown commands for extensibility
2589 // Update the last seen time for this node's address
2590 if (pfrom->fNetworkNode)
2591 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2592 AddressCurrentlyConnected(pfrom->addr);
2598 bool ProcessMessages(CNode* pfrom)
2600 CDataStream& vRecv = pfrom->vRecv;
2604 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2608 // (4) message start
2617 // Scan for message start
2618 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2619 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2620 if (vRecv.end() - pstart < nHeaderSize)
2622 if (vRecv.size() > nHeaderSize)
2624 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2625 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2629 if (pstart - vRecv.begin() > 0)
2630 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2631 vRecv.erase(vRecv.begin(), pstart);
2634 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2639 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2642 string strCommand = hdr.GetCommand();
2645 unsigned int nMessageSize = hdr.nMessageSize;
2646 if (nMessageSize > MAX_SIZE)
2648 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2651 if (nMessageSize > vRecv.size())
2653 // Rewind and wait for rest of message
2654 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2659 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2660 unsigned int nChecksum = 0;
2661 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2662 if (nChecksum != hdr.nChecksum)
2664 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2665 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2669 // Copy message to its own buffer
2670 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2671 vRecv.ignore(nMessageSize);
2677 CRITICAL_BLOCK(cs_main)
2678 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2682 catch (std::ios_base::failure& e)
2684 if (strstr(e.what(), "end of data"))
2686 // Allow exceptions from underlength message on vRecv
2687 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());
2689 else if (strstr(e.what(), "size too large"))
2691 // Allow exceptions from overlong size
2692 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2696 PrintExceptionContinue(&e, "ProcessMessage()");
2699 catch (std::exception& e) {
2700 PrintExceptionContinue(&e, "ProcessMessage()");
2702 PrintExceptionContinue(NULL, "ProcessMessage()");
2706 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2714 bool SendMessages(CNode* pto, bool fSendTrickle)
2716 CRITICAL_BLOCK(cs_main)
2718 // Don't send anything until we get their version message
2719 if (pto->nVersion == 0)
2723 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2724 pto->PushMessage("ping");
2726 // Resend wallet transactions that haven't gotten in a block yet
2727 ResendWalletTransactions();
2729 // Address refresh broadcast
2730 static int64 nLastRebroadcast;
2731 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2733 CRITICAL_BLOCK(cs_vNodes)
2735 BOOST_FOREACH(CNode* pnode, vNodes)
2737 // Periodically clear setAddrKnown to allow refresh broadcasts
2738 if (nLastRebroadcast)
2739 pnode->setAddrKnown.clear();
2741 // Rebroadcast our address
2742 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2744 CAddress addr(addrLocalHost);
2745 addr.nTime = GetAdjustedTime();
2746 pnode->PushAddress(addr);
2750 nLastRebroadcast = GetTime();
2753 // Clear out old addresses periodically so it's not too much work at once
2754 static int64 nLastClear;
2755 if (nLastClear == 0)
2756 nLastClear = GetTime();
2757 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2759 nLastClear = GetTime();
2760 CRITICAL_BLOCK(cs_mapAddresses)
2763 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2764 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2765 mi != mapAddresses.end();)
2767 const CAddress& addr = (*mi).second;
2768 if (addr.nTime < nSince)
2770 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2772 addrdb.EraseAddress(addr);
2773 mapAddresses.erase(mi++);
2787 vector<CAddress> vAddr;
2788 vAddr.reserve(pto->vAddrToSend.size());
2789 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2791 // returns true if wasn't already contained in the set
2792 if (pto->setAddrKnown.insert(addr).second)
2794 vAddr.push_back(addr);
2795 // receiver rejects addr messages larger than 1000
2796 if (vAddr.size() >= 1000)
2798 pto->PushMessage("addr", vAddr);
2803 pto->vAddrToSend.clear();
2805 pto->PushMessage("addr", vAddr);
2810 // Message: inventory
2813 vector<CInv> vInvWait;
2814 CRITICAL_BLOCK(pto->cs_inventory)
2816 vInv.reserve(pto->vInventoryToSend.size());
2817 vInvWait.reserve(pto->vInventoryToSend.size());
2818 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2820 if (pto->setInventoryKnown.count(inv))
2823 // trickle out tx inv to protect privacy
2824 if (inv.type == MSG_TX && !fSendTrickle)
2826 // 1/4 of tx invs blast to all immediately
2827 static uint256 hashSalt;
2829 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2830 uint256 hashRand = inv.hash ^ hashSalt;
2831 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2832 bool fTrickleWait = ((hashRand & 3) != 0);
2834 // always trickle our own transactions
2838 if (GetTransaction(inv.hash, wtx))
2840 fTrickleWait = true;
2845 vInvWait.push_back(inv);
2850 // returns true if wasn't already contained in the set
2851 if (pto->setInventoryKnown.insert(inv).second)
2853 vInv.push_back(inv);
2854 if (vInv.size() >= 1000)
2856 pto->PushMessage("inv", vInv);
2861 pto->vInventoryToSend = vInvWait;
2864 pto->PushMessage("inv", vInv);
2870 vector<CInv> vGetData;
2871 int64 nNow = GetTime() * 1000000;
2873 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2875 const CInv& inv = (*pto->mapAskFor.begin()).second;
2876 if (!AlreadyHave(txdb, inv))
2878 printf("sending getdata: %s\n", inv.ToString().c_str());
2879 vGetData.push_back(inv);
2880 if (vGetData.size() >= 1000)
2882 pto->PushMessage("getdata", vGetData);
2886 mapAlreadyAskedFor[inv] = nNow;
2887 pto->mapAskFor.erase(pto->mapAskFor.begin());
2889 if (!vGetData.empty())
2890 pto->PushMessage("getdata", vGetData);
2909 //////////////////////////////////////////////////////////////////////////////
2914 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2916 unsigned char* pdata = (unsigned char*)pbuffer;
2917 unsigned int blocks = 1 + ((len + 8) / 64);
2918 unsigned char* pend = pdata + 64 * blocks;
2919 memset(pdata + len, 0, 64 * blocks - len);
2921 unsigned int bits = len * 8;
2922 pend[-1] = (bits >> 0) & 0xff;
2923 pend[-2] = (bits >> 8) & 0xff;
2924 pend[-3] = (bits >> 16) & 0xff;
2925 pend[-4] = (bits >> 24) & 0xff;
2929 static const unsigned int pSHA256InitState[8] =
2930 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2932 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2935 unsigned char data[64];
2939 for (int i = 0; i < 16; i++)
2940 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2942 for (int i = 0; i < 8; i++)
2943 ctx.h[i] = ((uint32_t*)pinit)[i];
2945 SHA256_Update(&ctx, data, sizeof(data));
2946 for (int i = 0; i < 8; i++)
2947 ((uint32_t*)pstate)[i] = ctx.h[i];
2951 // ScanHash scans nonces looking for a hash with at least some zero bits.
2952 // It operates on big endian data. Caller does the byte reversing.
2953 // All input buffers are 16-byte aligned. nNonce is usually preserved
2954 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2955 // the block is rebuilt and nNonce starts over at zero.
2957 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2959 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2963 // Hash pdata using pmidstate as the starting state into
2964 // preformatted buffer phash1, then hash phash1 into phash
2966 SHA256Transform(phash1, pdata, pmidstate);
2967 SHA256Transform(phash, phash1, pSHA256InitState);
2969 // Return the nonce if the hash has at least some zero bits,
2970 // caller will check if it has enough to reach the target
2971 if (((unsigned short*)phash)[14] == 0)
2974 // If nothing found after trying for a while, return -1
2975 if ((nNonce & 0xffff) == 0)
2977 nHashesDone = 0xffff+1;
2983 // Some explaining would be appreciated
2988 set<uint256> setDependsOn;
2991 COrphan(CTransaction* ptxIn)
2999 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3000 BOOST_FOREACH(uint256 hash, setDependsOn)
3001 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3006 uint64 nLastBlockTx = 0;
3007 uint64 nLastBlockSize = 0;
3009 CBlock* CreateNewBlock(CReserveKey& reservekey)
3011 CBlockIndex* pindexPrev = pindexBest;
3014 auto_ptr<CBlock> pblock(new CBlock());
3018 // Create coinbase tx
3020 txNew.vin.resize(1);
3021 txNew.vin[0].prevout.SetNull();
3022 txNew.vout.resize(1);
3023 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3025 // Add our coinbase tx as first transaction
3026 pblock->vtx.push_back(txNew);
3028 // Collect memory pool transactions into the block
3030 CRITICAL_BLOCK(cs_main)
3031 CRITICAL_BLOCK(cs_mapTransactions)
3035 // Priority order to process transactions
3036 list<COrphan> vOrphan; // list memory doesn't move
3037 map<uint256, vector<COrphan*> > mapDependers;
3038 multimap<double, CTransaction*> mapPriority;
3039 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3041 CTransaction& tx = (*mi).second;
3042 if (tx.IsCoinBase() || !tx.IsFinal())
3045 COrphan* porphan = NULL;
3046 double dPriority = 0;
3047 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3049 // Read prev transaction
3050 CTransaction txPrev;
3052 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3054 // Has to wait for dependencies
3057 // Use list for automatic deletion
3058 vOrphan.push_back(COrphan(&tx));
3059 porphan = &vOrphan.back();
3061 mapDependers[txin.prevout.hash].push_back(porphan);
3062 porphan->setDependsOn.insert(txin.prevout.hash);
3065 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3067 // Read block header
3068 int nConf = txindex.GetDepthInMainChain();
3070 dPriority += (double)nValueIn * nConf;
3072 if (fDebug && GetBoolArg("-printpriority"))
3073 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3076 // Priority is sum(valuein * age) / txsize
3077 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3080 porphan->dPriority = dPriority;
3082 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3084 if (fDebug && GetBoolArg("-printpriority"))
3086 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3093 // Collect transactions into block
3094 map<uint256, CTxIndex> mapTestPool;
3095 uint64 nBlockSize = 1000;
3096 uint64 nBlockTx = 0;
3097 int nBlockSigOps = 100;
3098 while (!mapPriority.empty())
3100 // Take highest priority transaction off priority queue
3101 double dPriority = -(*mapPriority.begin()).first;
3102 CTransaction& tx = *(*mapPriority.begin()).second;
3103 mapPriority.erase(mapPriority.begin());
3106 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3107 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3110 // Legacy limits on sigOps:
3111 int nTxSigOps = tx.GetLegacySigOpCount();
3112 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3115 // Transaction fee required depends on block size
3116 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3117 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3119 // Connecting shouldn't fail due to dependency on other memory pool transactions
3120 // because we're already processing them in order of dependency
3121 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3122 MapPrevTx mapInputs;
3124 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3127 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3128 if (nTxFees < nMinFee)
3131 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3132 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3135 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3137 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3138 swap(mapTestPool, mapTestPoolTmp);
3141 pblock->vtx.push_back(tx);
3142 nBlockSize += nTxSize;
3144 nBlockSigOps += nTxSigOps;
3147 // Add transactions that depend on this one to the priority queue
3148 uint256 hash = tx.GetHash();
3149 if (mapDependers.count(hash))
3151 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3153 if (!porphan->setDependsOn.empty())
3155 porphan->setDependsOn.erase(hash);
3156 if (porphan->setDependsOn.empty())
3157 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3163 nLastBlockTx = nBlockTx;
3164 nLastBlockSize = nBlockSize;
3165 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3168 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3171 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3172 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3173 pblock->UpdateTime(pindexPrev);
3174 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3177 return pblock.release();
3181 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3183 // Update nExtraNonce
3184 static uint256 hashPrevBlock;
3185 if (hashPrevBlock != pblock->hashPrevBlock)
3188 hashPrevBlock = pblock->hashPrevBlock;
3191 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3192 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3194 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3198 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3201 // Prebuild hash buffers
3208 uint256 hashPrevBlock;
3209 uint256 hashMerkleRoot;
3212 unsigned int nNonce;
3215 unsigned char pchPadding0[64];
3217 unsigned char pchPadding1[64];
3220 memset(&tmp, 0, sizeof(tmp));
3222 tmp.block.nVersion = pblock->nVersion;
3223 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3224 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3225 tmp.block.nTime = pblock->nTime;
3226 tmp.block.nBits = pblock->nBits;
3227 tmp.block.nNonce = pblock->nNonce;
3229 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3230 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3232 // Byte swap all the input buffer
3233 for (int i = 0; i < sizeof(tmp)/4; i++)
3234 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3236 // Precalc the first half of the first hash, which stays constant
3237 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3239 memcpy(pdata, &tmp.block, 128);
3240 memcpy(phash1, &tmp.hash1, 64);
3244 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3246 uint256 hash = pblock->GetHash();
3247 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3249 if (hash > hashTarget)
3253 printf("BitcoinMiner:\n");
3254 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3256 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3257 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3260 CRITICAL_BLOCK(cs_main)
3262 if (pblock->hashPrevBlock != hashBestChain)
3263 return error("BitcoinMiner : generated block is stale");
3265 // Remove key from key pool
3266 reservekey.KeepKey();
3268 // Track how many getdata requests this block gets
3269 CRITICAL_BLOCK(wallet.cs_wallet)
3270 wallet.mapRequestCount[pblock->GetHash()] = 0;
3272 // Process this block the same as if we had received it from another node
3273 if (!ProcessBlock(NULL, pblock))
3274 return error("BitcoinMiner : ProcessBlock, block not accepted");
3280 void static ThreadBitcoinMiner(void* parg);
3282 static bool fGenerateBitcoins = false;
3283 static bool fLimitProcessors = false;
3284 static int nLimitProcessors = -1;
3286 void static BitcoinMiner(CWallet *pwallet)
3288 printf("BitcoinMiner started\n");
3289 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3291 // Each thread has its own key and counter
3292 CReserveKey reservekey(pwallet);
3293 unsigned int nExtraNonce = 0;
3295 while (fGenerateBitcoins)
3297 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3301 while (vNodes.empty() || IsInitialBlockDownload())
3306 if (!fGenerateBitcoins)
3314 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3315 CBlockIndex* pindexPrev = pindexBest;
3317 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3320 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3322 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3326 // Prebuild hash buffers
3328 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3329 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3330 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3332 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3334 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3335 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3336 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3342 int64 nStart = GetTime();
3343 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3345 uint256& hash = *alignup<16>(hashbuf);
3348 unsigned int nHashesDone = 0;
3349 unsigned int nNonceFound;
3352 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3353 (char*)&hash, nHashesDone);
3355 // Check if something found
3356 if (nNonceFound != -1)
3358 for (int i = 0; i < sizeof(hash)/4; i++)
3359 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3361 if (hash <= hashTarget)
3364 pblock->nNonce = ByteReverse(nNonceFound);
3365 assert(hash == pblock->GetHash());
3367 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3368 CheckWork(pblock.get(), *pwalletMain, reservekey);
3369 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3375 static int64 nHashCounter;
3376 if (nHPSTimerStart == 0)
3378 nHPSTimerStart = GetTimeMillis();
3382 nHashCounter += nHashesDone;
3383 if (GetTimeMillis() - nHPSTimerStart > 4000)
3385 static CCriticalSection cs;
3388 if (GetTimeMillis() - nHPSTimerStart > 4000)
3390 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3391 nHPSTimerStart = GetTimeMillis();
3393 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3394 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3395 static int64 nLogTime;
3396 if (GetTime() - nLogTime > 30 * 60)
3398 nLogTime = GetTime();
3399 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3400 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3406 // Check for stop or if block needs to be rebuilt
3409 if (!fGenerateBitcoins)
3411 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3415 if (nBlockNonce >= 0xffff0000)
3417 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3419 if (pindexPrev != pindexBest)
3422 // Update nTime every few seconds
3423 pblock->UpdateTime(pindexPrev);
3424 nBlockTime = ByteReverse(pblock->nTime);
3427 // Changing pblock->nTime can change work required on testnet:
3428 nBlockBits = ByteReverse(pblock->nBits);
3429 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3435 void static ThreadBitcoinMiner(void* parg)
3437 CWallet* pwallet = (CWallet*)parg;
3440 vnThreadsRunning[THREAD_MINER]++;
3441 BitcoinMiner(pwallet);
3442 vnThreadsRunning[THREAD_MINER]--;
3444 catch (std::exception& e) {
3445 vnThreadsRunning[THREAD_MINER]--;
3446 PrintException(&e, "ThreadBitcoinMiner()");
3448 vnThreadsRunning[THREAD_MINER]--;
3449 PrintException(NULL, "ThreadBitcoinMiner()");
3451 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3453 if (vnThreadsRunning[THREAD_MINER] == 0)
3455 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3459 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3461 fGenerateBitcoins = fGenerate;
3462 nLimitProcessors = GetArg("-genproclimit", -1);
3463 if (nLimitProcessors == 0)
3464 fGenerateBitcoins = false;
3465 fLimitProcessors = (nLimitProcessors != -1);
3469 int nProcessors = boost::thread::hardware_concurrency();
3470 printf("%d processors\n", nProcessors);
3471 if (nProcessors < 1)
3473 if (fLimitProcessors && nProcessors > nLimitProcessors)
3474 nProcessors = nLimitProcessors;
3475 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3476 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3477 for (int i = 0; i < nAddThreads; i++)
3479 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3480 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");