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("bitcoin-qt");
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";
65 int fGenerateBitcoins = false;
66 int64 nTransactionFee = 0;
67 int fLimitProcessors = false;
68 int nLimitProcessors = 1;
69 int fMinimizeToTray = true;
70 int fMinimizeOnClose = true;
78 //////////////////////////////////////////////////////////////////////////////
80 // dispatching functions
83 // These functions dispatch to one or all registered wallets
86 void RegisterWallet(CWallet* pwalletIn)
88 CRITICAL_BLOCK(cs_setpwalletRegistered)
90 setpwalletRegistered.insert(pwalletIn);
94 void UnregisterWallet(CWallet* pwalletIn)
96 CRITICAL_BLOCK(cs_setpwalletRegistered)
98 setpwalletRegistered.erase(pwalletIn);
102 // check whether the passed transaction is from us
103 bool static IsFromMe(CTransaction& tx)
105 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
106 if (pwallet->IsFromMe(tx))
111 // get the wallet transaction with the given hash (if it exists)
112 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
114 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
115 if (pwallet->GetTransaction(hashTx,wtx))
120 // erases transaction with the given hash from all wallets
121 void static EraseFromWallets(uint256 hash)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->EraseFromWallet(hash);
127 // make sure all wallets know about the given transaction, in the given block
128 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
130 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
131 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
134 // notify wallets about a new best chain
135 void static SetBestChain(const CBlockLocator& loc)
137 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
138 pwallet->SetBestChain(loc);
141 // notify wallets about an updated transaction
142 void static UpdatedTransaction(const uint256& hashTx)
144 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
145 pwallet->UpdatedTransaction(hashTx);
149 void static PrintWallets(const CBlock& block)
151 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
152 pwallet->PrintWallet(block);
155 // notify wallets about an incoming inventory (for request counts)
156 void static Inventory(const uint256& hash)
158 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
159 pwallet->Inventory(hash);
162 // ask wallets to resend their transactions
163 void static ResendWalletTransactions()
165 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
166 pwallet->ResendWalletTransactions();
175 //////////////////////////////////////////////////////////////////////////////
177 // mapOrphanTransactions
180 void static AddOrphanTx(const CDataStream& vMsg)
183 CDataStream(vMsg) >> tx;
184 uint256 hash = tx.GetHash();
185 if (mapOrphanTransactions.count(hash))
187 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
188 BOOST_FOREACH(const CTxIn& txin, tx.vin)
189 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
192 void static EraseOrphanTx(uint256 hash)
194 if (!mapOrphanTransactions.count(hash))
196 const CDataStream* pvMsg = mapOrphanTransactions[hash];
198 CDataStream(*pvMsg) >> tx;
199 BOOST_FOREACH(const CTxIn& txin, tx.vin)
201 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
202 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
204 if ((*mi).second == pvMsg)
205 mapOrphanTransactionsByPrev.erase(mi++);
211 mapOrphanTransactions.erase(hash);
221 //////////////////////////////////////////////////////////////////////////////
223 // CTransaction and CTxIndex
226 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
229 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
231 if (!ReadFromDisk(txindexRet.pos))
233 if (prevout.n >= vout.size())
241 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
244 return ReadFromDisk(txdb, prevout, txindex);
247 bool CTransaction::ReadFromDisk(COutPoint prevout)
251 return ReadFromDisk(txdb, prevout, txindex);
254 bool CTransaction::IsStandard() const
256 BOOST_FOREACH(const CTxIn& txin, vin)
258 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
259 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
260 // ~65-byte public keys, plus a few script ops.
261 if (txin.scriptSig.size() > 500)
263 if (!txin.scriptSig.IsPushOnly())
266 BOOST_FOREACH(const CTxOut& txout, vout)
267 if (!::IsStandard(txout.scriptPubKey))
273 // Check transaction inputs, and make sure any
274 // pay-to-script-hash transactions are evaluating IsStandard scripts
276 // Why bother? To avoid denial-of-service attacks; an attacker
277 // can submit a standard HASH... OP_EQUAL transaction,
278 // which will get accepted into blocks. The redemption
279 // script can be anything; an attacker could use a very
280 // expensive-to-check-upon-redemption script like:
281 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
283 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
286 return true; // Coinbases don't use vin normally
288 for (int i = 0; i < vin.size(); i++)
290 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
292 vector<vector<unsigned char> > vSolutions;
293 txnouttype whichType;
294 // get the scriptPubKey corresponding to this input:
295 const CScript& prevScript = prev.scriptPubKey;
296 if (!Solver(prevScript, whichType, vSolutions))
298 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
300 // Transactions with extra stuff in their scriptSigs are
301 // non-standard. Note that this EvalScript() call will
302 // be quick, because if there are any operations
303 // beside "push data" in the scriptSig the
304 // IsStandard() call returns false
305 vector<vector<unsigned char> > stack;
306 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
309 if (whichType == TX_SCRIPTHASH)
313 CScript subscript(stack.back().begin(), stack.back().end());
314 vector<vector<unsigned char> > vSolutions2;
315 txnouttype whichType2;
316 if (!Solver(subscript, whichType2, vSolutions2))
318 if (whichType2 == TX_SCRIPTHASH)
320 nArgsExpected += ScriptSigArgsExpected(whichType2, vSolutions2);
323 if (stack.size() != nArgsExpected)
331 CTransaction::GetLegacySigOpCount() const
334 BOOST_FOREACH(const CTxIn& txin, vin)
336 nSigOps += txin.scriptSig.GetSigOpCount(false);
338 BOOST_FOREACH(const CTxOut& txout, vout)
340 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
346 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
358 // Load the block this tx is in
360 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
362 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
367 // Update the tx's hashBlock
368 hashBlock = pblock->GetHash();
370 // Locate the transaction
371 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
372 if (pblock->vtx[nIndex] == *(CTransaction*)this)
374 if (nIndex == pblock->vtx.size())
376 vMerkleBranch.clear();
378 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
382 // Fill in merkle branch
383 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
386 // Is the tx in a block that's in the main chain
387 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
388 if (mi == mapBlockIndex.end())
390 CBlockIndex* pindex = (*mi).second;
391 if (!pindex || !pindex->IsInMainChain())
394 return pindexBest->nHeight - pindex->nHeight + 1;
403 bool CTransaction::CheckTransaction() const
405 // Basic checks that don't depend on any context
407 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
409 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
411 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
412 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
414 // Check for negative or overflow output values
416 BOOST_FOREACH(const CTxOut& txout, vout)
418 if (txout.nValue < 0)
419 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
420 if (txout.nValue > MAX_MONEY)
421 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
422 nValueOut += txout.nValue;
423 if (!MoneyRange(nValueOut))
424 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
427 // Check for duplicate inputs
428 set<COutPoint> vInOutPoints;
429 BOOST_FOREACH(const CTxIn& txin, vin)
431 if (vInOutPoints.count(txin.prevout))
433 vInOutPoints.insert(txin.prevout);
438 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
439 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
443 BOOST_FOREACH(const CTxIn& txin, vin)
444 if (txin.prevout.IsNull())
445 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
451 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
454 *pfMissingInputs = false;
456 if (!CheckTransaction())
457 return error("AcceptToMemoryPool() : CheckTransaction failed");
459 // Coinbase is only valid in a block, not as a loose transaction
461 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
463 // To help v0.1.5 clients who would see it as a negative number
464 if ((int64)nLockTime > std::numeric_limits<int>::max())
465 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
467 // Rather not work on nonstandard transactions (unless -testnet)
468 if (!fTestNet && !IsStandard())
469 return error("AcceptToMemoryPool() : nonstandard transaction type");
471 // Do we already have it?
472 uint256 hash = GetHash();
473 CRITICAL_BLOCK(cs_mapTransactions)
474 if (mapTransactions.count(hash))
477 if (txdb.ContainsTx(hash))
480 // Check for conflicts with in-memory transactions
481 CTransaction* ptxOld = NULL;
482 for (int i = 0; i < vin.size(); i++)
484 COutPoint outpoint = vin[i].prevout;
485 if (mapNextTx.count(outpoint))
487 // Disable replacement feature for now
490 // Allow replacing with a newer version of the same transaction
493 ptxOld = mapNextTx[outpoint].ptx;
494 if (ptxOld->IsFinal())
496 if (!IsNewerThan(*ptxOld))
498 for (int i = 0; i < vin.size(); i++)
500 COutPoint outpoint = vin[i].prevout;
501 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
511 map<uint256, CTxIndex> mapUnused;
512 bool fInvalid = false;
513 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
516 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
518 *pfMissingInputs = true;
519 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
522 // Check for non-standard pay-to-script-hash in inputs
523 if (!AreInputsStandard(mapInputs) && !fTestNet)
524 return error("AcceptToMemoryPool() : nonstandard transaction input");
526 // Note: if you modify this code to accept non-standard transactions, then
527 // you should add code here to check that the transaction does a
528 // reasonable number of ECDSA signature verifications.
530 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
531 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
533 // Don't accept it if it can't get into a block
534 if (nFees < GetMinFee(1000, true, GMF_RELAY))
535 return error("AcceptToMemoryPool() : not enough fees");
537 // Continuously rate-limit free transactions
538 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
539 // be annoying or make other's transactions take longer to confirm.
540 if (nFees < MIN_RELAY_TX_FEE)
542 static CCriticalSection cs;
543 static double dFreeCount;
544 static int64 nLastTime;
545 int64 nNow = GetTime();
549 // Use an exponentially decaying ~10-minute window:
550 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
552 // -limitfreerelay unit is thousand-bytes-per-minute
553 // At default rate it would take over a month to fill 1GB
554 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
555 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
557 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
562 // Check against previous transactions
563 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
564 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
566 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
570 // Store transaction in memory
571 CRITICAL_BLOCK(cs_mapTransactions)
575 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
576 ptxOld->RemoveFromMemoryPool();
578 AddToMemoryPoolUnchecked();
581 ///// are we sure this is ok when loading transactions or restoring block txes
582 // If updated, erase old tx from wallet
584 EraseFromWallets(ptxOld->GetHash());
586 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
590 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
593 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
596 uint64 nPooledTx = 0;
598 bool CTransaction::AddToMemoryPoolUnchecked()
600 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
601 // Add to memory pool without checking anything. Don't call this directly,
602 // call AcceptToMemoryPool to properly check the transaction first.
603 CRITICAL_BLOCK(cs_mapTransactions)
605 uint256 hash = GetHash();
606 mapTransactions[hash] = *this;
607 for (int i = 0; i < vin.size(); i++)
608 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
609 nTransactionsUpdated++;
616 bool CTransaction::RemoveFromMemoryPool()
618 // Remove transaction from memory pool
619 CRITICAL_BLOCK(cs_mapTransactions)
621 BOOST_FOREACH(const CTxIn& txin, vin)
622 mapNextTx.erase(txin.prevout);
623 mapTransactions.erase(GetHash());
624 nTransactionsUpdated++;
635 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
637 if (hashBlock == 0 || nIndex == -1)
640 // Find the block it claims to be in
641 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
642 if (mi == mapBlockIndex.end())
644 CBlockIndex* pindex = (*mi).second;
645 if (!pindex || !pindex->IsInMainChain())
648 // Make sure the merkle branch connects to this block
649 if (!fMerkleVerified)
651 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
653 fMerkleVerified = true;
657 return pindexBest->nHeight - pindex->nHeight + 1;
661 int CMerkleTx::GetBlocksToMaturity() const
665 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
669 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
673 if (!IsInMainChain() && !ClientConnectInputs())
675 return CTransaction::AcceptToMemoryPool(txdb, false);
679 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
683 bool CMerkleTx::AcceptToMemoryPool()
686 return AcceptToMemoryPool(txdb);
691 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
693 CRITICAL_BLOCK(cs_mapTransactions)
695 // Add previous supporting transactions first
696 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
698 if (!tx.IsCoinBase())
700 uint256 hash = tx.GetHash();
701 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
702 tx.AcceptToMemoryPool(txdb, fCheckInputs);
705 return AcceptToMemoryPool(txdb, fCheckInputs);
710 bool CWalletTx::AcceptWalletTransaction()
713 return AcceptWalletTransaction(txdb);
716 int CTxIndex::GetDepthInMainChain() const
720 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
722 // Find the block in the index
723 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
724 if (mi == mapBlockIndex.end())
726 CBlockIndex* pindex = (*mi).second;
727 if (!pindex || !pindex->IsInMainChain())
729 return 1 + nBestHeight - pindex->nHeight;
741 //////////////////////////////////////////////////////////////////////////////
743 // CBlock and CBlockIndex
746 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
748 if (!fReadTransactions)
750 *this = pindex->GetBlockHeader();
753 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
755 if (GetHash() != pindex->GetBlockHash())
756 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
760 uint256 static GetOrphanRoot(const CBlock* pblock)
762 // Work back to the first block in the orphan chain
763 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
764 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
765 return pblock->GetHash();
768 int64 static GetBlockValue(int nHeight, int64 nFees)
770 int64 nSubsidy = 50 * COIN;
772 // Subsidy is cut in half every 4 years
773 nSubsidy >>= (nHeight / 210000);
775 return nSubsidy + nFees;
778 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
779 static const int64 nTargetSpacing = 10 * 60;
780 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
783 // minimum amount of work that could possibly be required nTime after
784 // minimum work required was nBase
786 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
788 // Testnet has min-difficulty blocks
789 // after nTargetSpacing*2 time between blocks:
790 if (fTestNet && nTime > nTargetSpacing*2)
791 return bnProofOfWorkLimit.GetCompact();
794 bnResult.SetCompact(nBase);
795 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
797 // Maximum 400% adjustment...
799 // ... in best-case exactly 4-times-normal target time
800 nTime -= nTargetTimespan*4;
802 if (bnResult > bnProofOfWorkLimit)
803 bnResult = bnProofOfWorkLimit;
804 return bnResult.GetCompact();
807 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
809 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
812 if (pindexLast == NULL)
813 return nProofOfWorkLimit;
815 // Only change once per interval
816 if ((pindexLast->nHeight+1) % nInterval != 0)
818 // Special rules for testnet after 15 Feb 2012:
819 if (fTestNet && pblock->nTime > 1329264000)
821 // If the new block's timestamp is more than 2* 10 minutes
822 // then allow mining of a min-difficulty block.
823 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
824 return nProofOfWorkLimit;
827 // Return the last non-special-min-difficulty-rules-block
828 const CBlockIndex* pindex = pindexLast;
829 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
830 pindex = pindex->pprev;
831 return pindex->nBits;
835 return pindexLast->nBits;
838 // Go back by what we want to be 14 days worth of blocks
839 const CBlockIndex* pindexFirst = pindexLast;
840 for (int i = 0; pindexFirst && i < nInterval-1; i++)
841 pindexFirst = pindexFirst->pprev;
844 // Limit adjustment step
845 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
846 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
847 if (nActualTimespan < nTargetTimespan/4)
848 nActualTimespan = nTargetTimespan/4;
849 if (nActualTimespan > nTargetTimespan*4)
850 nActualTimespan = nTargetTimespan*4;
854 bnNew.SetCompact(pindexLast->nBits);
855 bnNew *= nActualTimespan;
856 bnNew /= nTargetTimespan;
858 if (bnNew > bnProofOfWorkLimit)
859 bnNew = bnProofOfWorkLimit;
862 printf("GetNextWorkRequired RETARGET\n");
863 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
864 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
865 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
867 return bnNew.GetCompact();
870 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
873 bnTarget.SetCompact(nBits);
876 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
877 return error("CheckProofOfWork() : nBits below minimum work");
879 // Check proof of work matches claimed amount
880 if (hash > bnTarget.getuint256())
881 return error("CheckProofOfWork() : hash doesn't match nBits");
886 // Return maximum amount of blocks that other nodes claim to have
887 int GetNumBlocksOfPeers()
889 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
892 bool IsInitialBlockDownload()
894 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
896 static int64 nLastUpdate;
897 static CBlockIndex* pindexLastBest;
898 if (pindexBest != pindexLastBest)
900 pindexLastBest = pindexBest;
901 nLastUpdate = GetTime();
903 return (GetTime() - nLastUpdate < 10 &&
904 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
907 void static InvalidChainFound(CBlockIndex* pindexNew)
909 if (pindexNew->bnChainWork > bnBestInvalidWork)
911 bnBestInvalidWork = pindexNew->bnChainWork;
912 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
915 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());
916 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
917 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
918 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
931 bool CTransaction::DisconnectInputs(CTxDB& txdb)
933 // Relinquish previous transactions' spent pointers
936 BOOST_FOREACH(const CTxIn& txin, vin)
938 COutPoint prevout = txin.prevout;
940 // Get prev txindex from disk
942 if (!txdb.ReadTxIndex(prevout.hash, txindex))
943 return error("DisconnectInputs() : ReadTxIndex failed");
945 if (prevout.n >= txindex.vSpent.size())
946 return error("DisconnectInputs() : prevout.n out of range");
948 // Mark outpoint as not spent
949 txindex.vSpent[prevout.n].SetNull();
952 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
953 return error("DisconnectInputs() : UpdateTxIndex failed");
957 // Remove transaction from index
958 if (!txdb.EraseTxIndex(*this))
959 return error("DisconnectInputs() : EraseTxPos failed");
965 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
966 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
968 // FetchInputs can return false either because we just haven't seen some inputs
969 // (in which case the transaction should be stored as an orphan)
970 // or because the transaction is malformed (in which case the transaction should
971 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
975 return true; // Coinbase transactions have no inputs to fetch.
977 for (int i = 0; i < vin.size(); i++)
979 COutPoint prevout = vin[i].prevout;
980 if (inputsRet.count(prevout.hash))
981 continue; // Got it already
984 CTxIndex& txindex = inputsRet[prevout.hash].first;
986 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
988 // Get txindex from current proposed changes
989 txindex = mapTestPool.find(prevout.hash)->second;
993 // Read txindex from txdb
994 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
996 if (!fFound && (fBlock || fMiner))
997 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());
1000 CTransaction& txPrev = inputsRet[prevout.hash].second;
1001 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1003 // Get prev tx from single transactions in memory
1004 CRITICAL_BLOCK(cs_mapTransactions)
1006 if (!mapTransactions.count(prevout.hash))
1007 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1008 txPrev = mapTransactions[prevout.hash];
1011 txindex.vSpent.resize(txPrev.vout.size());
1015 // Get prev tx from disk
1016 if (!txPrev.ReadFromDisk(txindex.pos))
1017 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1021 // Make sure all prevout.n's are valid:
1022 for (int i = 0; i < vin.size(); i++)
1024 const COutPoint prevout = vin[i].prevout;
1025 assert(inputsRet.count(prevout.hash) != 0);
1026 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1027 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1028 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1030 // Revisit this if/when transaction replacement is implemented and allows
1033 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()));
1040 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1042 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1043 if (mi == inputs.end())
1044 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1046 const CTransaction& txPrev = (mi->second).second;
1047 if (input.prevout.n >= txPrev.vout.size())
1048 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1050 return txPrev.vout[input.prevout.n];
1053 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1059 for (int i = 0; i < vin.size(); i++)
1061 nResult += GetOutputFor(vin[i], inputs).nValue;
1067 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1073 for (int i = 0; i < vin.size(); i++)
1075 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1076 if (prevout.scriptPubKey.IsPayToScriptHash())
1077 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1082 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1083 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1084 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1086 // Take over previous transactions' spent pointers
1087 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1088 // fMiner is true when called from the internal bitcoin miner
1089 // ... both are false when called from CTransaction::AcceptToMemoryPool
1094 for (int i = 0; i < vin.size(); i++)
1096 COutPoint prevout = vin[i].prevout;
1097 assert(inputs.count(prevout.hash) > 0);
1098 CTxIndex& txindex = inputs[prevout.hash].first;
1099 CTransaction& txPrev = inputs[prevout.hash].second;
1101 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1102 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()));
1104 // If prev is coinbase, check that it's matured
1105 if (txPrev.IsCoinBase())
1106 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1107 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1108 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1110 // Check for conflicts (double-spend)
1111 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1112 // for an attacker to attempt to split the network.
1113 if (!txindex.vSpent[prevout.n].IsNull())
1114 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());
1116 // Check for negative or overflow input values
1117 nValueIn += txPrev.vout[prevout.n].nValue;
1118 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1119 return DoS(100, error("ConnectInputs() : txin values out of range"));
1121 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1122 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1123 // still computed and checked, and any change will be caught at the next checkpoint.
1124 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1127 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1128 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1131 // Mark outpoints as spent
1132 txindex.vSpent[prevout.n] = posThisTx;
1135 if (fBlock || fMiner)
1137 mapTestPool[prevout.hash] = txindex;
1141 if (nValueIn < GetValueOut())
1142 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1144 // Tally transaction fees
1145 int64 nTxFee = nValueIn - GetValueOut();
1147 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1149 if (!MoneyRange(nFees))
1150 return DoS(100, error("ConnectInputs() : nFees out of range"));
1157 bool CTransaction::ClientConnectInputs()
1162 // Take over previous transactions' spent pointers
1163 CRITICAL_BLOCK(cs_mapTransactions)
1166 for (int i = 0; i < vin.size(); i++)
1168 // Get prev tx from single transactions in memory
1169 COutPoint prevout = vin[i].prevout;
1170 if (!mapTransactions.count(prevout.hash))
1172 CTransaction& txPrev = mapTransactions[prevout.hash];
1174 if (prevout.n >= txPrev.vout.size())
1178 if (!VerifySignature(txPrev, *this, i, true, 0))
1179 return error("ConnectInputs() : VerifySignature failed");
1181 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1182 ///// this has to go away now that posNext is gone
1183 // // Check for conflicts
1184 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1185 // return error("ConnectInputs() : prev tx already used");
1187 // // Flag outpoints as used
1188 // txPrev.vout[prevout.n].posNext = posThisTx;
1190 nValueIn += txPrev.vout[prevout.n].nValue;
1192 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1193 return error("ClientConnectInputs() : txin values out of range");
1195 if (GetValueOut() > nValueIn)
1205 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1207 // Disconnect in reverse order
1208 for (int i = vtx.size()-1; i >= 0; i--)
1209 if (!vtx[i].DisconnectInputs(txdb))
1212 // Update block index on disk without changing it in memory.
1213 // The memory index structure will be changed after the db commits.
1216 CDiskBlockIndex blockindexPrev(pindex->pprev);
1217 blockindexPrev.hashNext = 0;
1218 if (!txdb.WriteBlockIndex(blockindexPrev))
1219 return error("DisconnectBlock() : WriteBlockIndex failed");
1225 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1227 // Check it again in case a previous version let a bad block in
1231 // To avoid being on the short end of a block-chain split,
1232 // don't do secondary validation of pay-to-script-hash transactions
1233 // until blocks with timestamps after paytoscripthashtime (see init.cpp for default).
1234 // This code can be removed once a super-majority of the network has upgraded.
1235 int64 nEvalSwitchTime = GetArg("-paytoscripthashtime", std::numeric_limits<int64_t>::max());
1236 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1238 //// issue here: it doesn't know the version
1239 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1241 map<uint256, CTxIndex> mapQueuedChanges;
1244 BOOST_FOREACH(CTransaction& tx, vtx)
1246 nSigOps += tx.GetLegacySigOpCount();
1247 if (nSigOps > MAX_BLOCK_SIGOPS)
1248 return DoS(100, error("ConnectBlock() : too many sigops"));
1250 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1251 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1253 MapPrevTx mapInputs;
1254 if (!tx.IsCoinBase())
1257 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1260 if (fStrictPayToScriptHash)
1262 // Add in sigops done by pay-to-script-hash inputs;
1263 // this is to prevent a "rogue miner" from creating
1264 // an incredibly-expensive-to-validate block.
1265 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1266 if (nSigOps > MAX_BLOCK_SIGOPS)
1267 return DoS(100, error("ConnectBlock() : too many sigops"));
1270 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1272 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1276 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1279 // Write queued txindex changes
1280 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1282 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1283 return error("ConnectBlock() : UpdateTxIndex failed");
1286 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1289 // Update block index on disk without changing it in memory.
1290 // The memory index structure will be changed after the db commits.
1293 CDiskBlockIndex blockindexPrev(pindex->pprev);
1294 blockindexPrev.hashNext = pindex->GetBlockHash();
1295 if (!txdb.WriteBlockIndex(blockindexPrev))
1296 return error("ConnectBlock() : WriteBlockIndex failed");
1299 // Watch for transactions paying to me
1300 BOOST_FOREACH(CTransaction& tx, vtx)
1301 SyncWithWallets(tx, this, true);
1306 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1308 printf("REORGANIZE\n");
1311 CBlockIndex* pfork = pindexBest;
1312 CBlockIndex* plonger = pindexNew;
1313 while (pfork != plonger)
1315 while (plonger->nHeight > pfork->nHeight)
1316 if (!(plonger = plonger->pprev))
1317 return error("Reorganize() : plonger->pprev is null");
1318 if (pfork == plonger)
1320 if (!(pfork = pfork->pprev))
1321 return error("Reorganize() : pfork->pprev is null");
1324 // List of what to disconnect
1325 vector<CBlockIndex*> vDisconnect;
1326 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1327 vDisconnect.push_back(pindex);
1329 // List of what to connect
1330 vector<CBlockIndex*> vConnect;
1331 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1332 vConnect.push_back(pindex);
1333 reverse(vConnect.begin(), vConnect.end());
1335 // Disconnect shorter branch
1336 vector<CTransaction> vResurrect;
1337 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1340 if (!block.ReadFromDisk(pindex))
1341 return error("Reorganize() : ReadFromDisk for disconnect failed");
1342 if (!block.DisconnectBlock(txdb, pindex))
1343 return error("Reorganize() : DisconnectBlock failed");
1345 // Queue memory transactions to resurrect
1346 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1347 if (!tx.IsCoinBase())
1348 vResurrect.push_back(tx);
1351 // Connect longer branch
1352 vector<CTransaction> vDelete;
1353 for (int i = 0; i < vConnect.size(); i++)
1355 CBlockIndex* pindex = vConnect[i];
1357 if (!block.ReadFromDisk(pindex))
1358 return error("Reorganize() : ReadFromDisk for connect failed");
1359 if (!block.ConnectBlock(txdb, pindex))
1363 return error("Reorganize() : ConnectBlock failed");
1366 // Queue memory transactions to delete
1367 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1368 vDelete.push_back(tx);
1370 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1371 return error("Reorganize() : WriteHashBestChain failed");
1373 // Make sure it's successfully written to disk before changing memory structure
1374 if (!txdb.TxnCommit())
1375 return error("Reorganize() : TxnCommit failed");
1377 // Disconnect shorter branch
1378 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1380 pindex->pprev->pnext = NULL;
1382 // Connect longer branch
1383 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1385 pindex->pprev->pnext = pindex;
1387 // Resurrect memory transactions that were in the disconnected branch
1388 BOOST_FOREACH(CTransaction& tx, vResurrect)
1389 tx.AcceptToMemoryPool(txdb, false);
1391 // Delete redundant memory transactions that are in the connected branch
1392 BOOST_FOREACH(CTransaction& tx, vDelete)
1393 tx.RemoveFromMemoryPool();
1400 runCommand(std::string strCommand)
1402 int nErr = ::system(strCommand.c_str());
1404 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1407 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1409 uint256 hash = GetHash();
1412 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1414 txdb.WriteHashBestChain(hash);
1415 if (!txdb.TxnCommit())
1416 return error("SetBestChain() : TxnCommit failed");
1417 pindexGenesisBlock = pindexNew;
1419 else if (hashPrevBlock == hashBestChain)
1421 // Adding to current best branch
1422 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1425 InvalidChainFound(pindexNew);
1426 return error("SetBestChain() : ConnectBlock failed");
1428 if (!txdb.TxnCommit())
1429 return error("SetBestChain() : TxnCommit failed");
1431 // Add to current best branch
1432 pindexNew->pprev->pnext = pindexNew;
1434 // Delete redundant memory transactions
1435 BOOST_FOREACH(CTransaction& tx, vtx)
1436 tx.RemoveFromMemoryPool();
1441 if (!Reorganize(txdb, pindexNew))
1444 InvalidChainFound(pindexNew);
1445 return error("SetBestChain() : Reorganize failed");
1449 // Update best block in wallet (so we can detect restored wallets)
1450 bool fIsInitialDownload = IsInitialBlockDownload();
1451 if (!fIsInitialDownload)
1453 const CBlockLocator locator(pindexNew);
1454 ::SetBestChain(locator);
1458 hashBestChain = hash;
1459 pindexBest = pindexNew;
1460 nBestHeight = pindexBest->nHeight;
1461 bnBestChainWork = pindexNew->bnChainWork;
1462 nTimeBestReceived = GetTime();
1463 nTransactionsUpdated++;
1464 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1466 std::string strCmd = GetArg("-blocknotify", "");
1468 if (!fIsInitialDownload && !strCmd.empty())
1470 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1471 boost::thread t(runCommand, strCmd); // thread runs free
1478 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1480 // Check for duplicate
1481 uint256 hash = GetHash();
1482 if (mapBlockIndex.count(hash))
1483 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1485 // Construct new block index object
1486 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1488 return error("AddToBlockIndex() : new CBlockIndex failed");
1489 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1490 pindexNew->phashBlock = &((*mi).first);
1491 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1492 if (miPrev != mapBlockIndex.end())
1494 pindexNew->pprev = (*miPrev).second;
1495 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1497 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1501 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1502 if (!txdb.TxnCommit())
1506 if (pindexNew->bnChainWork > bnBestChainWork)
1507 if (!SetBestChain(txdb, pindexNew))
1512 if (pindexNew == pindexBest)
1514 // Notify UI to display prev block's coinbase if it was ours
1515 static uint256 hashPrevBestCoinBase;
1516 UpdatedTransaction(hashPrevBestCoinBase);
1517 hashPrevBestCoinBase = vtx[0].GetHash();
1527 bool CBlock::CheckBlock() const
1529 // These are checks that are independent of context
1530 // that can be verified before saving an orphan block.
1533 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1534 return DoS(100, error("CheckBlock() : size limits failed"));
1536 // Check proof of work matches claimed amount
1537 if (!CheckProofOfWork(GetHash(), nBits))
1538 return DoS(50, error("CheckBlock() : proof of work failed"));
1541 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1542 return error("CheckBlock() : block timestamp too far in the future");
1544 // First transaction must be coinbase, the rest must not be
1545 if (vtx.empty() || !vtx[0].IsCoinBase())
1546 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1547 for (int i = 1; i < vtx.size(); i++)
1548 if (vtx[i].IsCoinBase())
1549 return DoS(100, error("CheckBlock() : more than one coinbase"));
1551 // Check transactions
1552 BOOST_FOREACH(const CTransaction& tx, vtx)
1553 if (!tx.CheckTransaction())
1554 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1557 BOOST_FOREACH(const CTransaction& tx, vtx)
1559 nSigOps += tx.GetLegacySigOpCount();
1561 if (nSigOps > MAX_BLOCK_SIGOPS)
1562 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1565 if (hashMerkleRoot != BuildMerkleTree())
1566 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1571 bool CBlock::AcceptBlock()
1573 // Check for duplicate
1574 uint256 hash = GetHash();
1575 if (mapBlockIndex.count(hash))
1576 return error("AcceptBlock() : block already in mapBlockIndex");
1578 // Get prev block index
1579 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1580 if (mi == mapBlockIndex.end())
1581 return DoS(10, error("AcceptBlock() : prev block not found"));
1582 CBlockIndex* pindexPrev = (*mi).second;
1583 int nHeight = pindexPrev->nHeight+1;
1585 // Check proof of work
1586 if (nBits != GetNextWorkRequired(pindexPrev, this))
1587 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1589 // Check timestamp against prev
1590 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1591 return error("AcceptBlock() : block's timestamp is too early");
1593 // Check that all transactions are finalized
1594 BOOST_FOREACH(const CTransaction& tx, vtx)
1595 if (!tx.IsFinal(nHeight, GetBlockTime()))
1596 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1598 // Check that the block chain matches the known block chain up to a checkpoint
1599 if (!Checkpoints::CheckBlock(nHeight, hash))
1600 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1602 // Write block to history file
1603 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1604 return error("AcceptBlock() : out of disk space");
1605 unsigned int nFile = -1;
1606 unsigned int nBlockPos = 0;
1607 if (!WriteToDisk(nFile, nBlockPos))
1608 return error("AcceptBlock() : WriteToDisk failed");
1609 if (!AddToBlockIndex(nFile, nBlockPos))
1610 return error("AcceptBlock() : AddToBlockIndex failed");
1612 // Relay inventory, but don't relay old inventory during initial block download
1613 if (hashBestChain == hash)
1614 CRITICAL_BLOCK(cs_vNodes)
1615 BOOST_FOREACH(CNode* pnode, vNodes)
1616 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1617 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1622 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1624 // Check for duplicate
1625 uint256 hash = pblock->GetHash();
1626 if (mapBlockIndex.count(hash))
1627 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1628 if (mapOrphanBlocks.count(hash))
1629 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1631 // Preliminary checks
1632 if (!pblock->CheckBlock())
1633 return error("ProcessBlock() : CheckBlock FAILED");
1635 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1636 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1638 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1639 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1642 pfrom->Misbehaving(100);
1643 return error("ProcessBlock() : block with timestamp before last checkpoint");
1646 bnNewBlock.SetCompact(pblock->nBits);
1648 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1649 if (bnNewBlock > bnRequired)
1651 pfrom->Misbehaving(100);
1652 return error("ProcessBlock() : block with too little proof-of-work");
1657 // If don't already have its previous block, shunt it off to holding area until we get it
1658 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1660 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1661 CBlock* pblock2 = new CBlock(*pblock);
1662 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1663 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1665 // Ask this guy to fill in what we're missing
1667 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1672 if (!pblock->AcceptBlock())
1673 return error("ProcessBlock() : AcceptBlock FAILED");
1675 // Recursively process any orphan blocks that depended on this one
1676 vector<uint256> vWorkQueue;
1677 vWorkQueue.push_back(hash);
1678 for (int i = 0; i < vWorkQueue.size(); i++)
1680 uint256 hashPrev = vWorkQueue[i];
1681 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1682 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1685 CBlock* pblockOrphan = (*mi).second;
1686 if (pblockOrphan->AcceptBlock())
1687 vWorkQueue.push_back(pblockOrphan->GetHash());
1688 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1689 delete pblockOrphan;
1691 mapOrphanBlocksByPrev.erase(hashPrev);
1694 printf("ProcessBlock: ACCEPTED\n");
1705 bool CheckDiskSpace(uint64 nAdditionalBytes)
1707 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1709 // Check for 15MB because database could create another 10MB log file at any time
1710 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1713 string strMessage = _("Warning: Disk space is low ");
1714 strMiscWarning = strMessage;
1715 printf("*** %s\n", strMessage.c_str());
1716 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1717 CreateThread(Shutdown, NULL);
1723 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1727 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1730 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1732 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1741 static unsigned int nCurrentBlockFile = 1;
1743 FILE* AppendBlockFile(unsigned int& nFileRet)
1748 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1751 if (fseek(file, 0, SEEK_END) != 0)
1753 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1754 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1756 nFileRet = nCurrentBlockFile;
1760 nCurrentBlockFile++;
1764 bool LoadBlockIndex(bool fAllowNew)
1768 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1769 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1770 pchMessageStart[0] = 0xfa;
1771 pchMessageStart[1] = 0xbf;
1772 pchMessageStart[2] = 0xb5;
1773 pchMessageStart[3] = 0xda;
1780 if (!txdb.LoadBlockIndex())
1785 // Init with genesis block
1787 if (mapBlockIndex.empty())
1793 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1794 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1795 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1796 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1797 // vMerkleTree: 4a5e1e
1800 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1802 txNew.vin.resize(1);
1803 txNew.vout.resize(1);
1804 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1805 txNew.vout[0].nValue = 50 * COIN;
1806 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1808 block.vtx.push_back(txNew);
1809 block.hashPrevBlock = 0;
1810 block.hashMerkleRoot = block.BuildMerkleTree();
1812 block.nTime = 1231006505;
1813 block.nBits = 0x1d00ffff;
1814 block.nNonce = 2083236893;
1818 block.nTime = 1296688602;
1819 block.nBits = 0x1d07fff8;
1820 block.nNonce = 384568319;
1824 printf("%s\n", block.GetHash().ToString().c_str());
1825 printf("%s\n", hashGenesisBlock.ToString().c_str());
1826 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1827 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1829 assert(block.GetHash() == hashGenesisBlock);
1831 // Start new block file
1833 unsigned int nBlockPos;
1834 if (!block.WriteToDisk(nFile, nBlockPos))
1835 return error("LoadBlockIndex() : writing genesis block to disk failed");
1836 if (!block.AddToBlockIndex(nFile, nBlockPos))
1837 return error("LoadBlockIndex() : genesis block not accepted");
1845 void PrintBlockTree()
1847 // precompute tree structure
1848 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1849 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1851 CBlockIndex* pindex = (*mi).second;
1852 mapNext[pindex->pprev].push_back(pindex);
1854 //while (rand() % 3 == 0)
1855 // mapNext[pindex->pprev].push_back(pindex);
1858 vector<pair<int, CBlockIndex*> > vStack;
1859 vStack.push_back(make_pair(0, pindexGenesisBlock));
1862 while (!vStack.empty())
1864 int nCol = vStack.back().first;
1865 CBlockIndex* pindex = vStack.back().second;
1868 // print split or gap
1869 if (nCol > nPrevCol)
1871 for (int i = 0; i < nCol-1; i++)
1875 else if (nCol < nPrevCol)
1877 for (int i = 0; i < nCol; i++)
1884 for (int i = 0; i < nCol; i++)
1889 block.ReadFromDisk(pindex);
1890 printf("%d (%u,%u) %s %s tx %d",
1894 block.GetHash().ToString().substr(0,20).c_str(),
1895 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1898 PrintWallets(block);
1900 // put the main timechain first
1901 vector<CBlockIndex*>& vNext = mapNext[pindex];
1902 for (int i = 0; i < vNext.size(); i++)
1904 if (vNext[i]->pnext)
1906 swap(vNext[0], vNext[i]);
1912 for (int i = 0; i < vNext.size(); i++)
1913 vStack.push_back(make_pair(nCol+i, vNext[i]));
1926 //////////////////////////////////////////////////////////////////////////////
1931 map<uint256, CAlert> mapAlerts;
1932 CCriticalSection cs_mapAlerts;
1934 string GetWarnings(string strFor)
1937 string strStatusBar;
1939 if (GetBoolArg("-testsafemode"))
1942 // Misc warnings like out of disk space and clock is wrong
1943 if (strMiscWarning != "")
1946 strStatusBar = strMiscWarning;
1949 // Longer invalid proof-of-work chain
1950 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1953 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1957 CRITICAL_BLOCK(cs_mapAlerts)
1959 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1961 const CAlert& alert = item.second;
1962 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1964 nPriority = alert.nPriority;
1965 strStatusBar = alert.strStatusBar;
1970 if (strFor == "statusbar")
1971 return strStatusBar;
1972 else if (strFor == "rpc")
1974 assert(!"GetWarnings() : invalid parameter");
1978 bool CAlert::ProcessAlert()
1980 if (!CheckSignature())
1985 CRITICAL_BLOCK(cs_mapAlerts)
1987 // Cancel previous alerts
1988 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1990 const CAlert& alert = (*mi).second;
1993 printf("cancelling alert %d\n", alert.nID);
1994 mapAlerts.erase(mi++);
1996 else if (!alert.IsInEffect())
1998 printf("expiring alert %d\n", alert.nID);
1999 mapAlerts.erase(mi++);
2005 // Check if this alert has been cancelled
2006 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2008 const CAlert& alert = item.second;
2009 if (alert.Cancels(*this))
2011 printf("alert already cancelled by %d\n", alert.nID);
2017 mapAlerts.insert(make_pair(GetHash(), *this));
2020 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2032 //////////////////////////////////////////////////////////////////////////////
2038 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2042 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2043 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2045 // Don't know what it is, just say we already got one
2052 // The message start string is designed to be unlikely to occur in normal data.
2053 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2054 // a large 4-byte int at any alignment.
2055 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2058 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2060 static map<CService, vector<unsigned char> > mapReuseKey;
2061 RandAddSeedPerfmon();
2063 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2064 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2066 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2068 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2076 if (strCommand == "version")
2078 // Each connection can only send one version message
2079 if (pfrom->nVersion != 0)
2081 pfrom->Misbehaving(1);
2089 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2090 if (pfrom->nVersion == 10300)
2091 pfrom->nVersion = 300;
2092 if (pfrom->nVersion >= 106 && !vRecv.empty())
2093 vRecv >> addrFrom >> nNonce;
2094 if (pfrom->nVersion >= 106 && !vRecv.empty())
2095 vRecv >> pfrom->strSubVer;
2096 if (pfrom->nVersion >= 209 && !vRecv.empty())
2097 vRecv >> pfrom->nStartingHeight;
2099 if (pfrom->nVersion == 0)
2102 // Disconnect if we connected to ourself
2103 if (nNonce == nLocalHostNonce && nNonce > 1)
2105 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2106 pfrom->fDisconnect = true;
2110 // Be shy and don't send version until we hear
2111 if (pfrom->fInbound)
2112 pfrom->PushVersion();
2114 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2116 AddTimeData(pfrom->addr, nTime);
2119 if (pfrom->nVersion >= 209)
2120 pfrom->PushMessage("verack");
2121 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2122 if (pfrom->nVersion < 209)
2123 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2125 if (!pfrom->fInbound)
2127 // Advertise our address
2128 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2129 !IsInitialBlockDownload())
2131 CAddress addr(addrLocalHost);
2132 addr.nTime = GetAdjustedTime();
2133 pfrom->PushAddress(addr);
2136 // Get recent addresses
2137 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2139 pfrom->PushMessage("getaddr");
2140 pfrom->fGetAddr = true;
2144 // Ask the first connected node for block updates
2145 static int nAskedForBlocks = 0;
2146 if (!pfrom->fClient &&
2147 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2148 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2151 pfrom->PushGetBlocks(pindexBest, uint256(0));
2155 CRITICAL_BLOCK(cs_mapAlerts)
2156 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2157 item.second.RelayTo(pfrom);
2159 pfrom->fSuccessfullyConnected = true;
2161 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2163 cPeerBlockCounts.input(pfrom->nStartingHeight);
2167 else if (pfrom->nVersion == 0)
2169 // Must have a version message before anything else
2170 pfrom->Misbehaving(1);
2175 else if (strCommand == "verack")
2177 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2181 else if (strCommand == "addr")
2183 vector<CAddress> vAddr;
2186 // Don't want addr from older versions unless seeding
2187 if (pfrom->nVersion < 209)
2189 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2191 if (vAddr.size() > 1000)
2193 pfrom->Misbehaving(20);
2194 return error("message addr size() = %d", vAddr.size());
2197 // Store the new addresses
2200 int64 nNow = GetAdjustedTime();
2201 int64 nSince = nNow - 10 * 60;
2202 BOOST_FOREACH(CAddress& addr, vAddr)
2206 // ignore IPv6 for now, since it isn't implemented anyway
2209 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2210 addr.nTime = nNow - 5 * 24 * 60 * 60;
2211 AddAddress(addr, 2 * 60 * 60, &addrDB);
2212 pfrom->AddAddressKnown(addr);
2213 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2215 // Relay to a limited number of other nodes
2216 CRITICAL_BLOCK(cs_vNodes)
2218 // Use deterministic randomness to send to the same nodes for 24 hours
2219 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2220 static uint256 hashSalt;
2222 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2223 int64 hashAddr = addr.GetHash();
2224 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2225 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2226 multimap<uint256, CNode*> mapMix;
2227 BOOST_FOREACH(CNode* pnode, vNodes)
2229 if (pnode->nVersion < 31402)
2231 unsigned int nPointer;
2232 memcpy(&nPointer, &pnode, sizeof(nPointer));
2233 uint256 hashKey = hashRand ^ nPointer;
2234 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2235 mapMix.insert(make_pair(hashKey, pnode));
2237 int nRelayNodes = 2;
2238 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2239 ((*mi).second)->PushAddress(addr);
2243 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2244 if (vAddr.size() < 1000)
2245 pfrom->fGetAddr = false;
2249 else if (strCommand == "inv")
2253 if (vInv.size() > 50000)
2255 pfrom->Misbehaving(20);
2256 return error("message inv size() = %d", vInv.size());
2260 BOOST_FOREACH(const CInv& inv, vInv)
2264 pfrom->AddInventoryKnown(inv);
2266 bool fAlreadyHave = AlreadyHave(txdb, inv);
2268 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2272 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2273 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2275 // Track requests for our stuff
2276 Inventory(inv.hash);
2281 else if (strCommand == "getdata")
2285 if (vInv.size() > 50000)
2287 pfrom->Misbehaving(20);
2288 return error("message getdata size() = %d", vInv.size());
2291 BOOST_FOREACH(const CInv& inv, vInv)
2295 printf("received getdata for: %s\n", inv.ToString().c_str());
2297 if (inv.type == MSG_BLOCK)
2299 // Send block from disk
2300 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2301 if (mi != mapBlockIndex.end())
2304 block.ReadFromDisk((*mi).second);
2305 pfrom->PushMessage("block", block);
2307 // Trigger them to send a getblocks request for the next batch of inventory
2308 if (inv.hash == pfrom->hashContinue)
2310 // Bypass PushInventory, this must send even if redundant,
2311 // and we want it right after the last block so they don't
2312 // wait for other stuff first.
2314 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2315 pfrom->PushMessage("inv", vInv);
2316 pfrom->hashContinue = 0;
2320 else if (inv.IsKnownType())
2322 // Send stream from relay memory
2323 CRITICAL_BLOCK(cs_mapRelay)
2325 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2326 if (mi != mapRelay.end())
2327 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2331 // Track requests for our stuff
2332 Inventory(inv.hash);
2337 else if (strCommand == "getblocks")
2339 CBlockLocator locator;
2341 vRecv >> locator >> hashStop;
2343 // Find the last block the caller has in the main chain
2344 CBlockIndex* pindex = locator.GetBlockIndex();
2346 // Send the rest of the chain
2348 pindex = pindex->pnext;
2349 int nLimit = 500 + locator.GetDistanceBack();
2350 unsigned int nBytes = 0;
2351 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2352 for (; pindex; pindex = pindex->pnext)
2354 if (pindex->GetBlockHash() == hashStop)
2356 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2359 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2361 block.ReadFromDisk(pindex, true);
2362 nBytes += block.GetSerializeSize(SER_NETWORK);
2363 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2365 // When this block is requested, we'll send an inv that'll make them
2366 // getblocks the next batch of inventory.
2367 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2368 pfrom->hashContinue = pindex->GetBlockHash();
2375 else if (strCommand == "getheaders")
2377 CBlockLocator locator;
2379 vRecv >> locator >> hashStop;
2381 CBlockIndex* pindex = NULL;
2382 if (locator.IsNull())
2384 // If locator is null, return the hashStop block
2385 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2386 if (mi == mapBlockIndex.end())
2388 pindex = (*mi).second;
2392 // Find the last block the caller has in the main chain
2393 pindex = locator.GetBlockIndex();
2395 pindex = pindex->pnext;
2398 vector<CBlock> vHeaders;
2399 int nLimit = 2000 + locator.GetDistanceBack();
2400 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2401 for (; pindex; pindex = pindex->pnext)
2403 vHeaders.push_back(pindex->GetBlockHeader());
2404 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2407 pfrom->PushMessage("headers", vHeaders);
2411 else if (strCommand == "tx")
2413 vector<uint256> vWorkQueue;
2414 CDataStream vMsg(vRecv);
2418 CInv inv(MSG_TX, tx.GetHash());
2419 pfrom->AddInventoryKnown(inv);
2421 bool fMissingInputs = false;
2422 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2424 SyncWithWallets(tx, NULL, true);
2425 RelayMessage(inv, vMsg);
2426 mapAlreadyAskedFor.erase(inv);
2427 vWorkQueue.push_back(inv.hash);
2429 // Recursively process any orphan transactions that depended on this one
2430 for (int i = 0; i < vWorkQueue.size(); i++)
2432 uint256 hashPrev = vWorkQueue[i];
2433 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2434 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2437 const CDataStream& vMsg = *((*mi).second);
2439 CDataStream(vMsg) >> tx;
2440 CInv inv(MSG_TX, tx.GetHash());
2442 if (tx.AcceptToMemoryPool(true))
2444 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2445 SyncWithWallets(tx, NULL, true);
2446 RelayMessage(inv, vMsg);
2447 mapAlreadyAskedFor.erase(inv);
2448 vWorkQueue.push_back(inv.hash);
2453 BOOST_FOREACH(uint256 hash, vWorkQueue)
2454 EraseOrphanTx(hash);
2456 else if (fMissingInputs)
2458 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2461 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2465 else if (strCommand == "block")
2470 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2473 CInv inv(MSG_BLOCK, block.GetHash());
2474 pfrom->AddInventoryKnown(inv);
2476 if (ProcessBlock(pfrom, &block))
2477 mapAlreadyAskedFor.erase(inv);
2478 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2482 else if (strCommand == "getaddr")
2484 // Nodes rebroadcast an addr every 24 hours
2485 pfrom->vAddrToSend.clear();
2486 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2487 CRITICAL_BLOCK(cs_mapAddresses)
2489 unsigned int nCount = 0;
2490 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2492 const CAddress& addr = item.second;
2493 if (addr.nTime > nSince)
2496 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2498 const CAddress& addr = item.second;
2499 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2500 pfrom->PushAddress(addr);
2506 else if (strCommand == "checkorder")
2511 if (!GetBoolArg("-allowreceivebyip"))
2513 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2520 /// we have a chance to check the order here
2522 // Keep giving the same key to the same ip until they use it
2523 if (!mapReuseKey.count(pfrom->addr))
2524 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2526 // Send back approval of order and pubkey to use
2527 CScript scriptPubKey;
2528 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2529 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2533 else if (strCommand == "reply")
2538 CRequestTracker tracker;
2539 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2541 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2542 if (mi != pfrom->mapRequests.end())
2544 tracker = (*mi).second;
2545 pfrom->mapRequests.erase(mi);
2548 if (!tracker.IsNull())
2549 tracker.fn(tracker.param1, vRecv);
2553 else if (strCommand == "ping")
2558 else if (strCommand == "alert")
2563 if (alert.ProcessAlert())
2566 pfrom->setKnown.insert(alert.GetHash());
2567 CRITICAL_BLOCK(cs_vNodes)
2568 BOOST_FOREACH(CNode* pnode, vNodes)
2569 alert.RelayTo(pnode);
2576 // Ignore unknown commands for extensibility
2580 // Update the last seen time for this node's address
2581 if (pfrom->fNetworkNode)
2582 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2583 AddressCurrentlyConnected(pfrom->addr);
2589 bool ProcessMessages(CNode* pfrom)
2591 CDataStream& vRecv = pfrom->vRecv;
2595 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2599 // (4) message start
2608 // Scan for message start
2609 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2610 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2611 if (vRecv.end() - pstart < nHeaderSize)
2613 if (vRecv.size() > nHeaderSize)
2615 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2616 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2620 if (pstart - vRecv.begin() > 0)
2621 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2622 vRecv.erase(vRecv.begin(), pstart);
2625 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2630 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2633 string strCommand = hdr.GetCommand();
2636 unsigned int nMessageSize = hdr.nMessageSize;
2637 if (nMessageSize > MAX_SIZE)
2639 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2642 if (nMessageSize > vRecv.size())
2644 // Rewind and wait for rest of message
2645 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2650 if (vRecv.GetVersion() >= 209)
2652 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2653 unsigned int nChecksum = 0;
2654 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2655 if (nChecksum != hdr.nChecksum)
2657 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2658 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2663 // Copy message to its own buffer
2664 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2665 vRecv.ignore(nMessageSize);
2671 CRITICAL_BLOCK(cs_main)
2672 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2676 catch (std::ios_base::failure& e)
2678 if (strstr(e.what(), "end of data"))
2680 // Allow exceptions from underlength message on vRecv
2681 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());
2683 else if (strstr(e.what(), "size too large"))
2685 // Allow exceptions from overlong size
2686 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2690 PrintExceptionContinue(&e, "ProcessMessage()");
2693 catch (std::exception& e) {
2694 PrintExceptionContinue(&e, "ProcessMessage()");
2696 PrintExceptionContinue(NULL, "ProcessMessage()");
2700 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2708 bool SendMessages(CNode* pto, bool fSendTrickle)
2710 CRITICAL_BLOCK(cs_main)
2712 // Don't send anything until we get their version message
2713 if (pto->nVersion == 0)
2717 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2718 pto->PushMessage("ping");
2720 // Resend wallet transactions that haven't gotten in a block yet
2721 ResendWalletTransactions();
2723 // Address refresh broadcast
2724 static int64 nLastRebroadcast;
2725 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2727 CRITICAL_BLOCK(cs_vNodes)
2729 BOOST_FOREACH(CNode* pnode, vNodes)
2731 // Periodically clear setAddrKnown to allow refresh broadcasts
2732 if (nLastRebroadcast)
2733 pnode->setAddrKnown.clear();
2735 // Rebroadcast our address
2736 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2738 CAddress addr(addrLocalHost);
2739 addr.nTime = GetAdjustedTime();
2740 pnode->PushAddress(addr);
2744 nLastRebroadcast = GetTime();
2747 // Clear out old addresses periodically so it's not too much work at once
2748 static int64 nLastClear;
2749 if (nLastClear == 0)
2750 nLastClear = GetTime();
2751 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2753 nLastClear = GetTime();
2754 CRITICAL_BLOCK(cs_mapAddresses)
2757 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2758 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2759 mi != mapAddresses.end();)
2761 const CAddress& addr = (*mi).second;
2762 if (addr.nTime < nSince)
2764 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2766 addrdb.EraseAddress(addr);
2767 mapAddresses.erase(mi++);
2781 vector<CAddress> vAddr;
2782 vAddr.reserve(pto->vAddrToSend.size());
2783 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2785 // returns true if wasn't already contained in the set
2786 if (pto->setAddrKnown.insert(addr).second)
2788 vAddr.push_back(addr);
2789 // receiver rejects addr messages larger than 1000
2790 if (vAddr.size() >= 1000)
2792 pto->PushMessage("addr", vAddr);
2797 pto->vAddrToSend.clear();
2799 pto->PushMessage("addr", vAddr);
2804 // Message: inventory
2807 vector<CInv> vInvWait;
2808 CRITICAL_BLOCK(pto->cs_inventory)
2810 vInv.reserve(pto->vInventoryToSend.size());
2811 vInvWait.reserve(pto->vInventoryToSend.size());
2812 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2814 if (pto->setInventoryKnown.count(inv))
2817 // trickle out tx inv to protect privacy
2818 if (inv.type == MSG_TX && !fSendTrickle)
2820 // 1/4 of tx invs blast to all immediately
2821 static uint256 hashSalt;
2823 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2824 uint256 hashRand = inv.hash ^ hashSalt;
2825 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2826 bool fTrickleWait = ((hashRand & 3) != 0);
2828 // always trickle our own transactions
2832 if (GetTransaction(inv.hash, wtx))
2834 fTrickleWait = true;
2839 vInvWait.push_back(inv);
2844 // returns true if wasn't already contained in the set
2845 if (pto->setInventoryKnown.insert(inv).second)
2847 vInv.push_back(inv);
2848 if (vInv.size() >= 1000)
2850 pto->PushMessage("inv", vInv);
2855 pto->vInventoryToSend = vInvWait;
2858 pto->PushMessage("inv", vInv);
2864 vector<CInv> vGetData;
2865 int64 nNow = GetTime() * 1000000;
2867 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2869 const CInv& inv = (*pto->mapAskFor.begin()).second;
2870 if (!AlreadyHave(txdb, inv))
2872 printf("sending getdata: %s\n", inv.ToString().c_str());
2873 vGetData.push_back(inv);
2874 if (vGetData.size() >= 1000)
2876 pto->PushMessage("getdata", vGetData);
2880 mapAlreadyAskedFor[inv] = nNow;
2881 pto->mapAskFor.erase(pto->mapAskFor.begin());
2883 if (!vGetData.empty())
2884 pto->PushMessage("getdata", vGetData);
2903 //////////////////////////////////////////////////////////////////////////////
2908 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2910 unsigned char* pdata = (unsigned char*)pbuffer;
2911 unsigned int blocks = 1 + ((len + 8) / 64);
2912 unsigned char* pend = pdata + 64 * blocks;
2913 memset(pdata + len, 0, 64 * blocks - len);
2915 unsigned int bits = len * 8;
2916 pend[-1] = (bits >> 0) & 0xff;
2917 pend[-2] = (bits >> 8) & 0xff;
2918 pend[-3] = (bits >> 16) & 0xff;
2919 pend[-4] = (bits >> 24) & 0xff;
2923 static const unsigned int pSHA256InitState[8] =
2924 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2926 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2929 unsigned char data[64];
2933 for (int i = 0; i < 16; i++)
2934 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2936 for (int i = 0; i < 8; i++)
2937 ctx.h[i] = ((uint32_t*)pinit)[i];
2939 SHA256_Update(&ctx, data, sizeof(data));
2940 for (int i = 0; i < 8; i++)
2941 ((uint32_t*)pstate)[i] = ctx.h[i];
2945 // ScanHash scans nonces looking for a hash with at least some zero bits.
2946 // It operates on big endian data. Caller does the byte reversing.
2947 // All input buffers are 16-byte aligned. nNonce is usually preserved
2948 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2949 // the block is rebuilt and nNonce starts over at zero.
2951 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2953 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2957 // Hash pdata using pmidstate as the starting state into
2958 // preformatted buffer phash1, then hash phash1 into phash
2960 SHA256Transform(phash1, pdata, pmidstate);
2961 SHA256Transform(phash, phash1, pSHA256InitState);
2963 // Return the nonce if the hash has at least some zero bits,
2964 // caller will check if it has enough to reach the target
2965 if (((unsigned short*)phash)[14] == 0)
2968 // If nothing found after trying for a while, return -1
2969 if ((nNonce & 0xffff) == 0)
2971 nHashesDone = 0xffff+1;
2977 // Some explaining would be appreciated
2982 set<uint256> setDependsOn;
2985 COrphan(CTransaction* ptxIn)
2993 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2994 BOOST_FOREACH(uint256 hash, setDependsOn)
2995 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3000 uint64 nLastBlockTx = 0;
3001 uint64 nLastBlockSize = 0;
3003 CBlock* CreateNewBlock(CReserveKey& reservekey)
3005 CBlockIndex* pindexPrev = pindexBest;
3008 auto_ptr<CBlock> pblock(new CBlock());
3012 // Create coinbase tx
3014 txNew.vin.resize(1);
3015 txNew.vin[0].prevout.SetNull();
3016 txNew.vout.resize(1);
3017 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3019 // Add our coinbase tx as first transaction
3020 pblock->vtx.push_back(txNew);
3022 // Collect memory pool transactions into the block
3024 CRITICAL_BLOCK(cs_main)
3025 CRITICAL_BLOCK(cs_mapTransactions)
3029 // Priority order to process transactions
3030 list<COrphan> vOrphan; // list memory doesn't move
3031 map<uint256, vector<COrphan*> > mapDependers;
3032 multimap<double, CTransaction*> mapPriority;
3033 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3035 CTransaction& tx = (*mi).second;
3036 if (tx.IsCoinBase() || !tx.IsFinal())
3039 COrphan* porphan = NULL;
3040 double dPriority = 0;
3041 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3043 // Read prev transaction
3044 CTransaction txPrev;
3046 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3048 // Has to wait for dependencies
3051 // Use list for automatic deletion
3052 vOrphan.push_back(COrphan(&tx));
3053 porphan = &vOrphan.back();
3055 mapDependers[txin.prevout.hash].push_back(porphan);
3056 porphan->setDependsOn.insert(txin.prevout.hash);
3059 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3061 // Read block header
3062 int nConf = txindex.GetDepthInMainChain();
3064 dPriority += (double)nValueIn * nConf;
3066 if (fDebug && GetBoolArg("-printpriority"))
3067 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3070 // Priority is sum(valuein * age) / txsize
3071 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3074 porphan->dPriority = dPriority;
3076 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3078 if (fDebug && GetBoolArg("-printpriority"))
3080 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3087 // Collect transactions into block
3088 map<uint256, CTxIndex> mapTestPool;
3089 uint64 nBlockSize = 1000;
3090 uint64 nBlockTx = 0;
3091 int nBlockSigOps = 100;
3092 while (!mapPriority.empty())
3094 // Take highest priority transaction off priority queue
3095 double dPriority = -(*mapPriority.begin()).first;
3096 CTransaction& tx = *(*mapPriority.begin()).second;
3097 mapPriority.erase(mapPriority.begin());
3100 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3101 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3104 // Legacy limits on sigOps:
3105 int nTxSigOps = tx.GetLegacySigOpCount();
3106 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3109 // Transaction fee required depends on block size
3110 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3111 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3113 // Connecting shouldn't fail due to dependency on other memory pool transactions
3114 // because we're already processing them in order of dependency
3115 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3116 MapPrevTx mapInputs;
3118 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3121 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3122 if (nTxFees < nMinFee)
3125 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3126 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3129 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3131 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3132 swap(mapTestPool, mapTestPoolTmp);
3135 pblock->vtx.push_back(tx);
3136 nBlockSize += nTxSize;
3138 nBlockSigOps += nTxSigOps;
3141 // Add transactions that depend on this one to the priority queue
3142 uint256 hash = tx.GetHash();
3143 if (mapDependers.count(hash))
3145 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3147 if (!porphan->setDependsOn.empty())
3149 porphan->setDependsOn.erase(hash);
3150 if (porphan->setDependsOn.empty())
3151 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3157 nLastBlockTx = nBlockTx;
3158 nLastBlockSize = nBlockSize;
3159 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3162 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3165 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3166 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3167 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3168 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3171 return pblock.release();
3175 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3177 // Update nExtraNonce
3178 static uint256 hashPrevBlock;
3179 if (hashPrevBlock != pblock->hashPrevBlock)
3182 hashPrevBlock = pblock->hashPrevBlock;
3185 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3186 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3188 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3192 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3195 // Prebuild hash buffers
3202 uint256 hashPrevBlock;
3203 uint256 hashMerkleRoot;
3206 unsigned int nNonce;
3209 unsigned char pchPadding0[64];
3211 unsigned char pchPadding1[64];
3214 memset(&tmp, 0, sizeof(tmp));
3216 tmp.block.nVersion = pblock->nVersion;
3217 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3218 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3219 tmp.block.nTime = pblock->nTime;
3220 tmp.block.nBits = pblock->nBits;
3221 tmp.block.nNonce = pblock->nNonce;
3223 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3224 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3226 // Byte swap all the input buffer
3227 for (int i = 0; i < sizeof(tmp)/4; i++)
3228 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3230 // Precalc the first half of the first hash, which stays constant
3231 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3233 memcpy(pdata, &tmp.block, 128);
3234 memcpy(phash1, &tmp.hash1, 64);
3238 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3240 uint256 hash = pblock->GetHash();
3241 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3243 if (hash > hashTarget)
3247 printf("BitcoinMiner:\n");
3248 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3250 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3251 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3254 CRITICAL_BLOCK(cs_main)
3256 if (pblock->hashPrevBlock != hashBestChain)
3257 return error("BitcoinMiner : generated block is stale");
3259 // Remove key from key pool
3260 reservekey.KeepKey();
3262 // Track how many getdata requests this block gets
3263 CRITICAL_BLOCK(wallet.cs_wallet)
3264 wallet.mapRequestCount[pblock->GetHash()] = 0;
3266 // Process this block the same as if we had received it from another node
3267 if (!ProcessBlock(NULL, pblock))
3268 return error("BitcoinMiner : ProcessBlock, block not accepted");
3274 void static ThreadBitcoinMiner(void* parg);
3276 void static BitcoinMiner(CWallet *pwallet)
3278 printf("BitcoinMiner started\n");
3279 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3281 // Each thread has its own key and counter
3282 CReserveKey reservekey(pwallet);
3283 unsigned int nExtraNonce = 0;
3285 while (fGenerateBitcoins)
3287 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3291 while (vNodes.empty() || IsInitialBlockDownload())
3296 if (!fGenerateBitcoins)
3304 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3305 CBlockIndex* pindexPrev = pindexBest;
3307 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3310 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3312 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3316 // Prebuild hash buffers
3318 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3319 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3320 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3322 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3324 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3325 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3331 int64 nStart = GetTime();
3332 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3334 uint256& hash = *alignup<16>(hashbuf);
3337 unsigned int nHashesDone = 0;
3338 unsigned int nNonceFound;
3341 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3342 (char*)&hash, nHashesDone);
3344 // Check if something found
3345 if (nNonceFound != -1)
3347 for (int i = 0; i < sizeof(hash)/4; i++)
3348 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3350 if (hash <= hashTarget)
3353 pblock->nNonce = ByteReverse(nNonceFound);
3354 assert(hash == pblock->GetHash());
3356 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3357 CheckWork(pblock.get(), *pwalletMain, reservekey);
3358 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3364 static int64 nHashCounter;
3365 if (nHPSTimerStart == 0)
3367 nHPSTimerStart = GetTimeMillis();
3371 nHashCounter += nHashesDone;
3372 if (GetTimeMillis() - nHPSTimerStart > 4000)
3374 static CCriticalSection cs;
3377 if (GetTimeMillis() - nHPSTimerStart > 4000)
3379 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3380 nHPSTimerStart = GetTimeMillis();
3382 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3383 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3384 static int64 nLogTime;
3385 if (GetTime() - nLogTime > 30 * 60)
3387 nLogTime = GetTime();
3388 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3389 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3395 // Check for stop or if block needs to be rebuilt
3398 if (!fGenerateBitcoins)
3400 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3404 if (nBlockNonce >= 0xffff0000)
3406 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3408 if (pindexPrev != pindexBest)
3411 // Update nTime every few seconds
3412 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3413 nBlockTime = ByteReverse(pblock->nTime);
3418 void static ThreadBitcoinMiner(void* parg)
3420 CWallet* pwallet = (CWallet*)parg;
3423 vnThreadsRunning[3]++;
3424 BitcoinMiner(pwallet);
3425 vnThreadsRunning[3]--;
3427 catch (std::exception& e) {
3428 vnThreadsRunning[3]--;
3429 PrintException(&e, "ThreadBitcoinMiner()");
3431 vnThreadsRunning[3]--;
3432 PrintException(NULL, "ThreadBitcoinMiner()");
3434 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3436 if (vnThreadsRunning[3] == 0)
3438 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3442 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3444 if (fGenerateBitcoins != fGenerate)
3446 fGenerateBitcoins = fGenerate;
3447 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3450 if (fGenerateBitcoins)
3452 int nProcessors = boost::thread::hardware_concurrency();
3453 printf("%d processors\n", nProcessors);
3454 if (nProcessors < 1)
3456 if (fLimitProcessors && nProcessors > nLimitProcessors)
3457 nProcessors = nLimitProcessors;
3458 int nAddThreads = nProcessors - vnThreadsRunning[3];
3459 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3460 for (int i = 0; i < nAddThreads; i++)
3462 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3463 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");