1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 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;
60 int fGenerateBitcoins = false;
61 int64 nTransactionFee = 0;
62 int fLimitProcessors = false;
63 int nLimitProcessors = 1;
64 int fMinimizeToTray = true;
65 int fMinimizeOnClose = true;
73 //////////////////////////////////////////////////////////////////////////////
75 // dispatching functions
78 // These functions dispatch to one or all registered wallets
81 void RegisterWallet(CWallet* pwalletIn)
83 CRITICAL_BLOCK(cs_setpwalletRegistered)
85 setpwalletRegistered.insert(pwalletIn);
89 void UnregisterWallet(CWallet* pwalletIn)
91 CRITICAL_BLOCK(cs_setpwalletRegistered)
93 setpwalletRegistered.erase(pwalletIn);
97 // check whether the passed transaction is from us
98 bool static IsFromMe(CTransaction& tx)
100 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
101 if (pwallet->IsFromMe(tx))
106 // get the wallet transaction with the given hash (if it exists)
107 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
109 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
110 if (pwallet->GetTransaction(hashTx,wtx))
115 // erases transaction with the given hash from all wallets
116 void static EraseFromWallets(uint256 hash)
118 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
119 pwallet->EraseFromWallet(hash);
122 // make sure all wallets know about the given transaction, in the given block
123 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
125 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
126 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
129 // notify wallets about a new best chain
130 void static SetBestChain(const CBlockLocator& loc)
132 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
133 pwallet->SetBestChain(loc);
136 // notify wallets about an updated transaction
137 void static UpdatedTransaction(const uint256& hashTx)
139 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
140 pwallet->UpdatedTransaction(hashTx);
144 void static PrintWallets(const CBlock& block)
146 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
147 pwallet->PrintWallet(block);
150 // notify wallets about an incoming inventory (for request counts)
151 void static Inventory(const uint256& hash)
153 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
154 pwallet->Inventory(hash);
157 // ask wallets to resend their transactions
158 void static ResendWalletTransactions()
160 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
161 pwallet->ResendWalletTransactions();
170 //////////////////////////////////////////////////////////////////////////////
172 // mapOrphanTransactions
175 void static AddOrphanTx(const CDataStream& vMsg)
178 CDataStream(vMsg) >> tx;
179 uint256 hash = tx.GetHash();
180 if (mapOrphanTransactions.count(hash))
182 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
183 BOOST_FOREACH(const CTxIn& txin, tx.vin)
184 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
187 void static EraseOrphanTx(uint256 hash)
189 if (!mapOrphanTransactions.count(hash))
191 const CDataStream* pvMsg = mapOrphanTransactions[hash];
193 CDataStream(*pvMsg) >> tx;
194 BOOST_FOREACH(const CTxIn& txin, tx.vin)
196 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
197 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
199 if ((*mi).second == pvMsg)
200 mapOrphanTransactionsByPrev.erase(mi++);
206 mapOrphanTransactions.erase(hash);
216 //////////////////////////////////////////////////////////////////////////////
218 // CTransaction and CTxIndex
221 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
224 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
226 if (!ReadFromDisk(txindexRet.pos))
228 if (prevout.n >= vout.size())
236 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
239 return ReadFromDisk(txdb, prevout, txindex);
242 bool CTransaction::ReadFromDisk(COutPoint prevout)
246 return ReadFromDisk(txdb, prevout, txindex);
249 bool CTransaction::IsStandard() const
251 BOOST_FOREACH(const CTxIn& txin, vin)
253 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
254 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
255 // ~65-byte public keys, plus a few script ops.
256 if (txin.scriptSig.size() > 500)
258 if (!txin.scriptSig.IsPushOnly())
261 BOOST_FOREACH(const CTxOut& txout, vout)
262 if (!::IsStandard(txout.scriptPubKey))
268 // Check transaction inputs, and make sure any
269 // pay-to-script-hash transactions are evaluating IsStandard scripts
271 // Why bother? To avoid denial-of-service attacks; an attacker
272 // can submit a standard HASH... OP_EQUAL transaction,
273 // which will get accepted into blocks. The redemption
274 // script can be anything; an attacker could use a very
275 // expensive-to-check-upon-redemption script like:
276 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
278 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
281 return true; // Allow non-standard on testnet
284 return true; // Coinbases are allowed to have any input
286 for (int i = 0; i < vin.size(); i++)
288 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
290 vector<vector<unsigned char> > vSolutions;
291 txnouttype whichType;
292 // get the scriptPubKey corresponding to this input:
293 const CScript& prevScript = prev.scriptPubKey;
294 if (!Solver(prevScript, whichType, vSolutions))
296 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
298 // Transactions with extra stuff in their scriptSigs are
299 // non-standard. Note that this EvalScript() call will
300 // be quick, because if there are any operations
301 // beside "push data" in the scriptSig the
302 // IsStandard() call returns false
303 vector<vector<unsigned char> > stack;
304 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
307 if (whichType == TX_SCRIPTHASH)
311 CScript subscript(stack.back().begin(), stack.back().end());
312 vector<vector<unsigned char> > vSolutions2;
313 txnouttype whichType2;
314 if (!Solver(subscript, whichType2, vSolutions2))
316 if (whichType2 == TX_SCRIPTHASH)
318 nArgsExpected += ScriptSigArgsExpected(whichType2, vSolutions2);
321 if (stack.size() != nArgsExpected)
329 CTransaction::GetLegacySigOpCount() const
332 BOOST_FOREACH(const CTxIn& txin, vin)
334 nSigOps += txin.scriptSig.GetSigOpCount(false);
336 BOOST_FOREACH(const CTxOut& txout, vout)
338 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
344 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
356 // Load the block this tx is in
358 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
360 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
365 // Update the tx's hashBlock
366 hashBlock = pblock->GetHash();
368 // Locate the transaction
369 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
370 if (pblock->vtx[nIndex] == *(CTransaction*)this)
372 if (nIndex == pblock->vtx.size())
374 vMerkleBranch.clear();
376 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
380 // Fill in merkle branch
381 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
384 // Is the tx in a block that's in the main chain
385 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
386 if (mi == mapBlockIndex.end())
388 CBlockIndex* pindex = (*mi).second;
389 if (!pindex || !pindex->IsInMainChain())
392 return pindexBest->nHeight - pindex->nHeight + 1;
401 bool CTransaction::CheckTransaction() const
403 // Basic checks that don't depend on any context
405 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
407 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
409 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
410 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
412 // Check for negative or overflow output values
414 BOOST_FOREACH(const CTxOut& txout, vout)
416 if (txout.nValue < 0)
417 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
418 if (txout.nValue > MAX_MONEY)
419 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
420 nValueOut += txout.nValue;
421 if (!MoneyRange(nValueOut))
422 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
425 // Check for duplicate inputs
426 set<COutPoint> vInOutPoints;
427 BOOST_FOREACH(const CTxIn& txin, vin)
429 if (vInOutPoints.count(txin.prevout))
431 vInOutPoints.insert(txin.prevout);
436 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
437 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
441 BOOST_FOREACH(const CTxIn& txin, vin)
442 if (txin.prevout.IsNull())
443 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
449 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
452 *pfMissingInputs = false;
454 if (!CheckTransaction())
455 return error("AcceptToMemoryPool() : CheckTransaction failed");
457 // Coinbase is only valid in a block, not as a loose transaction
459 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
461 // To help v0.1.5 clients who would see it as a negative number
462 if ((int64)nLockTime > std::numeric_limits<int>::max())
463 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
465 // Rather not work on nonstandard transactions (unless -testnet)
466 if (!fTestNet && !IsStandard())
467 return error("AcceptToMemoryPool() : nonstandard transaction type");
469 // Do we already have it?
470 uint256 hash = GetHash();
471 CRITICAL_BLOCK(cs_mapTransactions)
472 if (mapTransactions.count(hash))
475 if (txdb.ContainsTx(hash))
478 // Check for conflicts with in-memory transactions
479 CTransaction* ptxOld = NULL;
480 for (int i = 0; i < vin.size(); i++)
482 COutPoint outpoint = vin[i].prevout;
483 if (mapNextTx.count(outpoint))
485 // Disable replacement feature for now
488 // Allow replacing with a newer version of the same transaction
491 ptxOld = mapNextTx[outpoint].ptx;
492 if (ptxOld->IsFinal())
494 if (!IsNewerThan(*ptxOld))
496 for (int i = 0; i < vin.size(); i++)
498 COutPoint outpoint = vin[i].prevout;
499 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
509 map<uint256, CTxIndex> mapUnused;
510 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs))
513 *pfMissingInputs = true;
514 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
517 // Check for non-standard pay-to-script-hash in inputs
518 if (!AreInputsStandard(mapInputs))
519 return error("AcceptToMemoryPool() : nonstandard transaction input");
521 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
522 int nSigOps = GetSigOpCount(mapInputs);
523 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
525 // Don't accept it if it can't get into a block
526 if (nFees < GetMinFee(1000, true, GMF_RELAY))
527 return error("AcceptToMemoryPool() : not enough fees");
529 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
530 // attacks disallow transactions with more than one SigOp per 65 bytes.
531 // 65 bytes because that is the minimum size of an ECDSA signature
532 if (nSigOps > nSize / 65 || nSize < 100)
533 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
535 // Continuously rate-limit free transactions
536 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
537 // be annoying or make other's transactions take longer to confirm.
538 if (nFees < MIN_RELAY_TX_FEE)
540 static CCriticalSection cs;
541 static double dFreeCount;
542 static int64 nLastTime;
543 int64 nNow = GetTime();
547 // Use an exponentially decaying ~10-minute window:
548 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
550 // -limitfreerelay unit is thousand-bytes-per-minute
551 // At default rate it would take over a month to fill 1GB
552 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
553 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
555 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
560 // Check against previous transactions
561 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
562 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
565 *pfMissingInputs = true;
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)
789 bnResult.SetCompact(nBase);
790 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
792 // Maximum 400% adjustment...
794 // ... in best-case exactly 4-times-normal target time
795 nTime -= nTargetTimespan*4;
797 if (bnResult > bnProofOfWorkLimit)
798 bnResult = bnProofOfWorkLimit;
799 return bnResult.GetCompact();
802 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
806 if (pindexLast == NULL)
807 return bnProofOfWorkLimit.GetCompact();
809 // Only change once per interval
810 if ((pindexLast->nHeight+1) % nInterval != 0)
811 return pindexLast->nBits;
813 // Go back by what we want to be 14 days worth of blocks
814 const CBlockIndex* pindexFirst = pindexLast;
815 for (int i = 0; pindexFirst && i < nInterval-1; i++)
816 pindexFirst = pindexFirst->pprev;
819 // Limit adjustment step
820 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
821 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
822 if (nActualTimespan < nTargetTimespan/4)
823 nActualTimespan = nTargetTimespan/4;
824 if (nActualTimespan > nTargetTimespan*4)
825 nActualTimespan = nTargetTimespan*4;
829 bnNew.SetCompact(pindexLast->nBits);
830 bnNew *= nActualTimespan;
831 bnNew /= nTargetTimespan;
833 if (bnNew > bnProofOfWorkLimit)
834 bnNew = bnProofOfWorkLimit;
837 printf("GetNextWorkRequired RETARGET\n");
838 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
839 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
840 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
842 return bnNew.GetCompact();
845 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
848 bnTarget.SetCompact(nBits);
851 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
852 return error("CheckProofOfWork() : nBits below minimum work");
854 // Check proof of work matches claimed amount
855 if (hash > bnTarget.getuint256())
856 return error("CheckProofOfWork() : hash doesn't match nBits");
861 // Return maximum amount of blocks that other nodes claim to have
862 int GetNumBlocksOfPeers()
864 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
867 bool IsInitialBlockDownload()
869 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
871 static int64 nLastUpdate;
872 static CBlockIndex* pindexLastBest;
873 if (pindexBest != pindexLastBest)
875 pindexLastBest = pindexBest;
876 nLastUpdate = GetTime();
878 return (GetTime() - nLastUpdate < 10 &&
879 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
882 void static InvalidChainFound(CBlockIndex* pindexNew)
884 if (pindexNew->bnChainWork > bnBestInvalidWork)
886 bnBestInvalidWork = pindexNew->bnChainWork;
887 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
890 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());
891 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
892 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
893 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
906 bool CTransaction::DisconnectInputs(CTxDB& txdb)
908 // Relinquish previous transactions' spent pointers
911 BOOST_FOREACH(const CTxIn& txin, vin)
913 COutPoint prevout = txin.prevout;
915 // Get prev txindex from disk
917 if (!txdb.ReadTxIndex(prevout.hash, txindex))
918 return error("DisconnectInputs() : ReadTxIndex failed");
920 if (prevout.n >= txindex.vSpent.size())
921 return error("DisconnectInputs() : prevout.n out of range");
923 // Mark outpoint as not spent
924 txindex.vSpent[prevout.n].SetNull();
927 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
928 return error("DisconnectInputs() : UpdateTxIndex failed");
932 // Remove transaction from index
933 if (!txdb.EraseTxIndex(*this))
934 return error("DisconnectInputs() : EraseTxPos failed");
940 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
941 bool fBlock, bool fMiner, MapPrevTx& inputsRet)
944 return true; // Coinbase transactions have no inputs to fetch.
946 for (int i = 0; i < vin.size(); i++)
948 COutPoint prevout = vin[i].prevout;
949 if (inputsRet.count(prevout.hash))
950 continue; // Got it already
953 CTxIndex& txindex = inputsRet[prevout.hash].first;
955 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
957 // Get txindex from current proposed changes
958 txindex = mapTestPool.find(prevout.hash)->second;
962 // Read txindex from txdb
963 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
965 if (!fFound && (fBlock || fMiner))
966 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());
969 CTransaction& txPrev = inputsRet[prevout.hash].second;
970 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
972 // Get prev tx from single transactions in memory
973 CRITICAL_BLOCK(cs_mapTransactions)
975 if (!mapTransactions.count(prevout.hash))
976 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
977 txPrev = mapTransactions[prevout.hash];
980 txindex.vSpent.resize(txPrev.vout.size());
984 // Get prev tx from disk
985 if (!txPrev.ReadFromDisk(txindex.pos))
986 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
990 // Make sure all prevout.n's are valid:
991 for (int i = 0; i < vin.size(); i++)
993 const COutPoint prevout = vin[i].prevout;
994 assert(inputsRet.count(prevout.hash) != 0);
995 const CTxIndex& txindex = inputsRet[prevout.hash].first;
996 const CTransaction& txPrev = inputsRet[prevout.hash].second;
997 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
998 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()));
1004 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1006 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1007 if (mi == inputs.end())
1008 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1010 const CTransaction& txPrev = (mi->second).second;
1011 if (input.prevout.n >= txPrev.vout.size())
1012 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1014 return txPrev.vout[input.prevout.n];
1017 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1023 for (int i = 0; i < vin.size(); i++)
1025 nResult += GetOutputFor(vin[i], inputs).nValue;
1031 int CTransaction::GetSigOpCount(const MapPrevTx& inputs) const
1037 for (int i = 0; i < vin.size(); i++)
1039 nSigOps += GetOutputFor(vin[i], inputs).scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1044 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1045 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1046 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner)
1048 // Take over previous transactions' spent pointers
1049 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1050 // fMiner is true when called from the internal bitcoin miner
1051 // ... both are false when called from CTransaction::AcceptToMemoryPool
1056 for (int i = 0; i < vin.size(); i++)
1058 COutPoint prevout = vin[i].prevout;
1059 assert(inputs.count(prevout.hash) > 0);
1060 CTxIndex& txindex = inputs[prevout.hash].first;
1061 CTransaction& txPrev = inputs[prevout.hash].second;
1063 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1064 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()));
1066 // If prev is coinbase, check that it's matured
1067 if (txPrev.IsCoinBase())
1068 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1069 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1070 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1072 // Check for conflicts (double-spend)
1073 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1074 // for an attacker to attempt to split the network.
1075 if (!txindex.vSpent[prevout.n].IsNull())
1076 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());
1078 // Check for negative or overflow input values
1079 nValueIn += txPrev.vout[prevout.n].nValue;
1080 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1081 return DoS(100, error("ConnectInputs() : txin values out of range"));
1083 bool fStrictPayToScriptHash = true;
1086 // To avoid being on the short end of a block-chain split,
1087 // don't do secondary validation of pay-to-script-hash transactions
1088 // until blocks with timestamps after paytoscripthashtime:
1089 int64 nEvalSwitchTime = GetArg("paytoscripthashtime", 1329264000); // Feb 15, 2012
1090 fStrictPayToScriptHash = (pindexBlock->nTime >= nEvalSwitchTime);
1092 // if !fBlock, then always be strict-- don't accept
1093 // invalid-under-new-rules pay-to-script-hash transactions into
1094 // our memory pool (don't relay them, don't include them
1095 // in blocks we mine).
1097 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1098 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1099 // still computed and checked, and any change will be caught at the next checkpoint.
1100 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1103 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1104 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1107 // Mark outpoints as spent
1108 txindex.vSpent[prevout.n] = posThisTx;
1111 if (fBlock || fMiner)
1113 mapTestPool[prevout.hash] = txindex;
1117 if (nValueIn < GetValueOut())
1118 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1120 // Tally transaction fees
1121 int64 nTxFee = nValueIn - GetValueOut();
1123 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1125 if (!MoneyRange(nFees))
1126 return DoS(100, error("ConnectInputs() : nFees out of range"));
1133 bool CTransaction::ClientConnectInputs()
1138 // Take over previous transactions' spent pointers
1139 CRITICAL_BLOCK(cs_mapTransactions)
1142 for (int i = 0; i < vin.size(); i++)
1144 // Get prev tx from single transactions in memory
1145 COutPoint prevout = vin[i].prevout;
1146 if (!mapTransactions.count(prevout.hash))
1148 CTransaction& txPrev = mapTransactions[prevout.hash];
1150 if (prevout.n >= txPrev.vout.size())
1154 if (!VerifySignature(txPrev, *this, i, true, 0))
1155 return error("ConnectInputs() : VerifySignature failed");
1157 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1158 ///// this has to go away now that posNext is gone
1159 // // Check for conflicts
1160 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1161 // return error("ConnectInputs() : prev tx already used");
1163 // // Flag outpoints as used
1164 // txPrev.vout[prevout.n].posNext = posThisTx;
1166 nValueIn += txPrev.vout[prevout.n].nValue;
1168 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1169 return error("ClientConnectInputs() : txin values out of range");
1171 if (GetValueOut() > nValueIn)
1181 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1183 // Disconnect in reverse order
1184 for (int i = vtx.size()-1; i >= 0; i--)
1185 if (!vtx[i].DisconnectInputs(txdb))
1188 // Update block index on disk without changing it in memory.
1189 // The memory index structure will be changed after the db commits.
1192 CDiskBlockIndex blockindexPrev(pindex->pprev);
1193 blockindexPrev.hashNext = 0;
1194 if (!txdb.WriteBlockIndex(blockindexPrev))
1195 return error("DisconnectBlock() : WriteBlockIndex failed");
1201 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1203 // Check it again in case a previous version let a bad block in
1207 //// issue here: it doesn't know the version
1208 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1210 map<uint256, CTxIndex> mapQueuedChanges;
1213 BOOST_FOREACH(CTransaction& tx, vtx)
1215 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1216 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1218 MapPrevTx mapInputs;
1219 if (!tx.IsCoinBase())
1221 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs))
1224 int nTxOps = tx.GetSigOpCount(mapInputs);
1226 if (nSigOps > MAX_BLOCK_SIGOPS)
1227 return DoS(100, error("ConnectBlock() : too many sigops"));
1228 // There is a different MAX_BLOCK_SIGOPS check in AcceptBlock();
1229 // a block must satisfy both to make it into the best-chain
1230 // (AcceptBlock() is always called before ConnectBlock())
1232 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1234 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false))
1238 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1241 // Write queued txindex changes
1242 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1244 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1245 return error("ConnectBlock() : UpdateTxIndex failed");
1248 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1251 // Update block index on disk without changing it in memory.
1252 // The memory index structure will be changed after the db commits.
1255 CDiskBlockIndex blockindexPrev(pindex->pprev);
1256 blockindexPrev.hashNext = pindex->GetBlockHash();
1257 if (!txdb.WriteBlockIndex(blockindexPrev))
1258 return error("ConnectBlock() : WriteBlockIndex failed");
1261 // Watch for transactions paying to me
1262 BOOST_FOREACH(CTransaction& tx, vtx)
1263 SyncWithWallets(tx, this, true);
1268 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1270 printf("REORGANIZE\n");
1273 CBlockIndex* pfork = pindexBest;
1274 CBlockIndex* plonger = pindexNew;
1275 while (pfork != plonger)
1277 while (plonger->nHeight > pfork->nHeight)
1278 if (!(plonger = plonger->pprev))
1279 return error("Reorganize() : plonger->pprev is null");
1280 if (pfork == plonger)
1282 if (!(pfork = pfork->pprev))
1283 return error("Reorganize() : pfork->pprev is null");
1286 // List of what to disconnect
1287 vector<CBlockIndex*> vDisconnect;
1288 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1289 vDisconnect.push_back(pindex);
1291 // List of what to connect
1292 vector<CBlockIndex*> vConnect;
1293 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1294 vConnect.push_back(pindex);
1295 reverse(vConnect.begin(), vConnect.end());
1297 // Disconnect shorter branch
1298 vector<CTransaction> vResurrect;
1299 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1302 if (!block.ReadFromDisk(pindex))
1303 return error("Reorganize() : ReadFromDisk for disconnect failed");
1304 if (!block.DisconnectBlock(txdb, pindex))
1305 return error("Reorganize() : DisconnectBlock failed");
1307 // Queue memory transactions to resurrect
1308 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1309 if (!tx.IsCoinBase())
1310 vResurrect.push_back(tx);
1313 // Connect longer branch
1314 vector<CTransaction> vDelete;
1315 for (int i = 0; i < vConnect.size(); i++)
1317 CBlockIndex* pindex = vConnect[i];
1319 if (!block.ReadFromDisk(pindex))
1320 return error("Reorganize() : ReadFromDisk for connect failed");
1321 if (!block.ConnectBlock(txdb, pindex))
1325 return error("Reorganize() : ConnectBlock failed");
1328 // Queue memory transactions to delete
1329 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1330 vDelete.push_back(tx);
1332 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1333 return error("Reorganize() : WriteHashBestChain failed");
1335 // Make sure it's successfully written to disk before changing memory structure
1336 if (!txdb.TxnCommit())
1337 return error("Reorganize() : TxnCommit failed");
1339 // Disconnect shorter branch
1340 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1342 pindex->pprev->pnext = NULL;
1344 // Connect longer branch
1345 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1347 pindex->pprev->pnext = pindex;
1349 // Resurrect memory transactions that were in the disconnected branch
1350 BOOST_FOREACH(CTransaction& tx, vResurrect)
1351 tx.AcceptToMemoryPool(txdb, false);
1353 // Delete redundant memory transactions that are in the connected branch
1354 BOOST_FOREACH(CTransaction& tx, vDelete)
1355 tx.RemoveFromMemoryPool();
1362 runCommand(std::string strCommand)
1364 int nErr = ::system(strCommand.c_str());
1366 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1369 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1371 uint256 hash = GetHash();
1374 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1376 txdb.WriteHashBestChain(hash);
1377 if (!txdb.TxnCommit())
1378 return error("SetBestChain() : TxnCommit failed");
1379 pindexGenesisBlock = pindexNew;
1381 else if (hashPrevBlock == hashBestChain)
1383 // Adding to current best branch
1384 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1387 InvalidChainFound(pindexNew);
1388 return error("SetBestChain() : ConnectBlock failed");
1390 if (!txdb.TxnCommit())
1391 return error("SetBestChain() : TxnCommit failed");
1393 // Add to current best branch
1394 pindexNew->pprev->pnext = pindexNew;
1396 // Delete redundant memory transactions
1397 BOOST_FOREACH(CTransaction& tx, vtx)
1398 tx.RemoveFromMemoryPool();
1403 if (!Reorganize(txdb, pindexNew))
1406 InvalidChainFound(pindexNew);
1407 return error("SetBestChain() : Reorganize failed");
1411 // Update best block in wallet (so we can detect restored wallets)
1412 bool fIsInitialDownload = IsInitialBlockDownload();
1413 if (!fIsInitialDownload)
1415 const CBlockLocator locator(pindexNew);
1416 ::SetBestChain(locator);
1420 hashBestChain = hash;
1421 pindexBest = pindexNew;
1422 nBestHeight = pindexBest->nHeight;
1423 bnBestChainWork = pindexNew->bnChainWork;
1424 nTimeBestReceived = GetTime();
1425 nTransactionsUpdated++;
1426 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1428 std::string strCmd = GetArg("-blocknotify", "");
1430 if (!fIsInitialDownload && !strCmd.empty())
1432 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1433 boost::thread t(runCommand, strCmd); // thread runs free
1440 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1442 // Check for duplicate
1443 uint256 hash = GetHash();
1444 if (mapBlockIndex.count(hash))
1445 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1447 // Construct new block index object
1448 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1450 return error("AddToBlockIndex() : new CBlockIndex failed");
1451 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1452 pindexNew->phashBlock = &((*mi).first);
1453 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1454 if (miPrev != mapBlockIndex.end())
1456 pindexNew->pprev = (*miPrev).second;
1457 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1459 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1463 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1464 if (!txdb.TxnCommit())
1468 if (pindexNew->bnChainWork > bnBestChainWork)
1469 if (!SetBestChain(txdb, pindexNew))
1474 if (pindexNew == pindexBest)
1476 // Notify UI to display prev block's coinbase if it was ours
1477 static uint256 hashPrevBestCoinBase;
1478 UpdatedTransaction(hashPrevBestCoinBase);
1479 hashPrevBestCoinBase = vtx[0].GetHash();
1489 bool CBlock::CheckBlock() const
1491 // These are checks that are independent of context
1492 // that can be verified before saving an orphan block.
1495 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1496 return DoS(100, error("CheckBlock() : size limits failed"));
1498 // Check proof of work matches claimed amount
1499 if (!CheckProofOfWork(GetHash(), nBits))
1500 return DoS(50, error("CheckBlock() : proof of work failed"));
1503 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1504 return error("CheckBlock() : block timestamp too far in the future");
1506 // First transaction must be coinbase, the rest must not be
1507 if (vtx.empty() || !vtx[0].IsCoinBase())
1508 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1509 for (int i = 1; i < vtx.size(); i++)
1510 if (vtx[i].IsCoinBase())
1511 return DoS(100, error("CheckBlock() : more than one coinbase"));
1513 // Check transactions
1514 BOOST_FOREACH(const CTransaction& tx, vtx)
1515 if (!tx.CheckTransaction())
1516 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1518 // Pre-pay-to-script-hash (before version 0.6), this is how sigops
1519 // were counted; there is another check in ConnectBlock when
1520 // transaction inputs are fetched to count pay-to-script-hash sigops:
1522 BOOST_FOREACH(const CTransaction& tx, vtx)
1524 nSigOps += tx.GetLegacySigOpCount();
1526 if (nSigOps > MAX_BLOCK_SIGOPS)
1527 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1530 if (hashMerkleRoot != BuildMerkleTree())
1531 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1536 bool CBlock::AcceptBlock()
1538 // Check for duplicate
1539 uint256 hash = GetHash();
1540 if (mapBlockIndex.count(hash))
1541 return error("AcceptBlock() : block already in mapBlockIndex");
1543 // Get prev block index
1544 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1545 if (mi == mapBlockIndex.end())
1546 return DoS(10, error("AcceptBlock() : prev block not found"));
1547 CBlockIndex* pindexPrev = (*mi).second;
1548 int nHeight = pindexPrev->nHeight+1;
1550 // Check proof of work
1551 if (nBits != GetNextWorkRequired(pindexPrev))
1552 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1554 // Check timestamp against prev
1555 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1556 return error("AcceptBlock() : block's timestamp is too early");
1558 // Check that all transactions are finalized
1559 BOOST_FOREACH(const CTransaction& tx, vtx)
1560 if (!tx.IsFinal(nHeight, GetBlockTime()))
1561 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1563 // Check that the block chain matches the known block chain up to a checkpoint
1564 if (!Checkpoints::CheckBlock(nHeight, hash))
1565 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1567 // Write block to history file
1568 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1569 return error("AcceptBlock() : out of disk space");
1570 unsigned int nFile = -1;
1571 unsigned int nBlockPos = 0;
1572 if (!WriteToDisk(nFile, nBlockPos))
1573 return error("AcceptBlock() : WriteToDisk failed");
1574 if (!AddToBlockIndex(nFile, nBlockPos))
1575 return error("AcceptBlock() : AddToBlockIndex failed");
1577 // Relay inventory, but don't relay old inventory during initial block download
1578 if (hashBestChain == hash)
1579 CRITICAL_BLOCK(cs_vNodes)
1580 BOOST_FOREACH(CNode* pnode, vNodes)
1581 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1582 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1587 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1589 // Check for duplicate
1590 uint256 hash = pblock->GetHash();
1591 if (mapBlockIndex.count(hash))
1592 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1593 if (mapOrphanBlocks.count(hash))
1594 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1596 // Preliminary checks
1597 if (!pblock->CheckBlock())
1598 return error("ProcessBlock() : CheckBlock FAILED");
1600 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1601 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1603 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1604 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1607 pfrom->Misbehaving(100);
1608 return error("ProcessBlock() : block with timestamp before last checkpoint");
1611 bnNewBlock.SetCompact(pblock->nBits);
1613 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1614 if (bnNewBlock > bnRequired)
1616 pfrom->Misbehaving(100);
1617 return error("ProcessBlock() : block with too little proof-of-work");
1622 // If don't already have its previous block, shunt it off to holding area until we get it
1623 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1625 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1626 CBlock* pblock2 = new CBlock(*pblock);
1627 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1628 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1630 // Ask this guy to fill in what we're missing
1632 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1637 if (!pblock->AcceptBlock())
1638 return error("ProcessBlock() : AcceptBlock FAILED");
1640 // Recursively process any orphan blocks that depended on this one
1641 vector<uint256> vWorkQueue;
1642 vWorkQueue.push_back(hash);
1643 for (int i = 0; i < vWorkQueue.size(); i++)
1645 uint256 hashPrev = vWorkQueue[i];
1646 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1647 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1650 CBlock* pblockOrphan = (*mi).second;
1651 if (pblockOrphan->AcceptBlock())
1652 vWorkQueue.push_back(pblockOrphan->GetHash());
1653 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1654 delete pblockOrphan;
1656 mapOrphanBlocksByPrev.erase(hashPrev);
1659 printf("ProcessBlock: ACCEPTED\n");
1670 bool CheckDiskSpace(uint64 nAdditionalBytes)
1672 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1674 // Check for 15MB because database could create another 10MB log file at any time
1675 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1678 string strMessage = _("Warning: Disk space is low ");
1679 strMiscWarning = strMessage;
1680 printf("*** %s\n", strMessage.c_str());
1681 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1682 CreateThread(Shutdown, NULL);
1688 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1692 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1695 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1697 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1706 static unsigned int nCurrentBlockFile = 1;
1708 FILE* AppendBlockFile(unsigned int& nFileRet)
1713 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1716 if (fseek(file, 0, SEEK_END) != 0)
1718 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1719 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1721 nFileRet = nCurrentBlockFile;
1725 nCurrentBlockFile++;
1729 bool LoadBlockIndex(bool fAllowNew)
1733 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1734 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1735 pchMessageStart[0] = 0xfa;
1736 pchMessageStart[1] = 0xbf;
1737 pchMessageStart[2] = 0xb5;
1738 pchMessageStart[3] = 0xda;
1745 if (!txdb.LoadBlockIndex())
1750 // Init with genesis block
1752 if (mapBlockIndex.empty())
1758 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1759 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1760 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1761 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1762 // vMerkleTree: 4a5e1e
1765 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1767 txNew.vin.resize(1);
1768 txNew.vout.resize(1);
1769 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1770 txNew.vout[0].nValue = 50 * COIN;
1771 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1773 block.vtx.push_back(txNew);
1774 block.hashPrevBlock = 0;
1775 block.hashMerkleRoot = block.BuildMerkleTree();
1777 block.nTime = 1231006505;
1778 block.nBits = 0x1d00ffff;
1779 block.nNonce = 2083236893;
1783 block.nTime = 1296688602;
1784 block.nBits = 0x1d07fff8;
1785 block.nNonce = 384568319;
1789 printf("%s\n", block.GetHash().ToString().c_str());
1790 printf("%s\n", hashGenesisBlock.ToString().c_str());
1791 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1792 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1794 assert(block.GetHash() == hashGenesisBlock);
1796 // Start new block file
1798 unsigned int nBlockPos;
1799 if (!block.WriteToDisk(nFile, nBlockPos))
1800 return error("LoadBlockIndex() : writing genesis block to disk failed");
1801 if (!block.AddToBlockIndex(nFile, nBlockPos))
1802 return error("LoadBlockIndex() : genesis block not accepted");
1810 void PrintBlockTree()
1812 // precompute tree structure
1813 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1814 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1816 CBlockIndex* pindex = (*mi).second;
1817 mapNext[pindex->pprev].push_back(pindex);
1819 //while (rand() % 3 == 0)
1820 // mapNext[pindex->pprev].push_back(pindex);
1823 vector<pair<int, CBlockIndex*> > vStack;
1824 vStack.push_back(make_pair(0, pindexGenesisBlock));
1827 while (!vStack.empty())
1829 int nCol = vStack.back().first;
1830 CBlockIndex* pindex = vStack.back().second;
1833 // print split or gap
1834 if (nCol > nPrevCol)
1836 for (int i = 0; i < nCol-1; i++)
1840 else if (nCol < nPrevCol)
1842 for (int i = 0; i < nCol; i++)
1849 for (int i = 0; i < nCol; i++)
1854 block.ReadFromDisk(pindex);
1855 printf("%d (%u,%u) %s %s tx %d",
1859 block.GetHash().ToString().substr(0,20).c_str(),
1860 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1863 PrintWallets(block);
1865 // put the main timechain first
1866 vector<CBlockIndex*>& vNext = mapNext[pindex];
1867 for (int i = 0; i < vNext.size(); i++)
1869 if (vNext[i]->pnext)
1871 swap(vNext[0], vNext[i]);
1877 for (int i = 0; i < vNext.size(); i++)
1878 vStack.push_back(make_pair(nCol+i, vNext[i]));
1891 //////////////////////////////////////////////////////////////////////////////
1896 map<uint256, CAlert> mapAlerts;
1897 CCriticalSection cs_mapAlerts;
1899 string GetWarnings(string strFor)
1902 string strStatusBar;
1904 if (GetBoolArg("-testsafemode"))
1907 // Misc warnings like out of disk space and clock is wrong
1908 if (strMiscWarning != "")
1911 strStatusBar = strMiscWarning;
1914 // Longer invalid proof-of-work chain
1915 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1918 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1922 CRITICAL_BLOCK(cs_mapAlerts)
1924 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1926 const CAlert& alert = item.second;
1927 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1929 nPriority = alert.nPriority;
1930 strStatusBar = alert.strStatusBar;
1935 if (strFor == "statusbar")
1936 return strStatusBar;
1937 else if (strFor == "rpc")
1939 assert(!"GetWarnings() : invalid parameter");
1943 bool CAlert::ProcessAlert()
1945 if (!CheckSignature())
1950 CRITICAL_BLOCK(cs_mapAlerts)
1952 // Cancel previous alerts
1953 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1955 const CAlert& alert = (*mi).second;
1958 printf("cancelling alert %d\n", alert.nID);
1959 mapAlerts.erase(mi++);
1961 else if (!alert.IsInEffect())
1963 printf("expiring alert %d\n", alert.nID);
1964 mapAlerts.erase(mi++);
1970 // Check if this alert has been cancelled
1971 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1973 const CAlert& alert = item.second;
1974 if (alert.Cancels(*this))
1976 printf("alert already cancelled by %d\n", alert.nID);
1982 mapAlerts.insert(make_pair(GetHash(), *this));
1985 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1997 //////////////////////////////////////////////////////////////////////////////
2003 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2007 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2008 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2010 // Don't know what it is, just say we already got one
2017 // The message start string is designed to be unlikely to occur in normal data.
2018 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2019 // a large 4-byte int at any alignment.
2020 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2023 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2025 static map<CService, vector<unsigned char> > mapReuseKey;
2026 RandAddSeedPerfmon();
2028 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2029 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2031 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2033 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2041 if (strCommand == "version")
2043 // Each connection can only send one version message
2044 if (pfrom->nVersion != 0)
2046 pfrom->Misbehaving(1);
2054 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2055 if (pfrom->nVersion == 10300)
2056 pfrom->nVersion = 300;
2057 if (pfrom->nVersion >= 106 && !vRecv.empty())
2058 vRecv >> addrFrom >> nNonce;
2059 if (pfrom->nVersion >= 106 && !vRecv.empty())
2060 vRecv >> pfrom->strSubVer;
2061 if (pfrom->nVersion >= 209 && !vRecv.empty())
2062 vRecv >> pfrom->nStartingHeight;
2064 if (pfrom->nVersion == 0)
2067 // Disconnect if we connected to ourself
2068 if (nNonce == nLocalHostNonce && nNonce > 1)
2070 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2071 pfrom->fDisconnect = true;
2075 // Be shy and don't send version until we hear
2076 if (pfrom->fInbound)
2077 pfrom->PushVersion();
2079 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2081 AddTimeData(pfrom->addr, nTime);
2084 if (pfrom->nVersion >= 209)
2085 pfrom->PushMessage("verack");
2086 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2087 if (pfrom->nVersion < 209)
2088 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2090 if (!pfrom->fInbound)
2092 // Advertise our address
2093 if (addrLocalHost.IsRoutable() && !fUseProxy)
2095 CAddress addr(addrLocalHost);
2096 addr.nTime = GetAdjustedTime();
2097 pfrom->PushAddress(addr);
2100 // Get recent addresses
2101 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2103 pfrom->PushMessage("getaddr");
2104 pfrom->fGetAddr = true;
2108 // Ask the first connected node for block updates
2109 static int nAskedForBlocks = 0;
2110 if (!pfrom->fClient &&
2111 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2112 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2115 pfrom->PushGetBlocks(pindexBest, uint256(0));
2119 CRITICAL_BLOCK(cs_mapAlerts)
2120 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2121 item.second.RelayTo(pfrom);
2123 pfrom->fSuccessfullyConnected = true;
2125 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2127 cPeerBlockCounts.input(pfrom->nStartingHeight);
2131 else if (pfrom->nVersion == 0)
2133 // Must have a version message before anything else
2134 pfrom->Misbehaving(1);
2139 else if (strCommand == "verack")
2141 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2145 else if (strCommand == "addr")
2147 vector<CAddress> vAddr;
2150 // Don't want addr from older versions unless seeding
2151 if (pfrom->nVersion < 209)
2153 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2155 if (vAddr.size() > 1000)
2157 pfrom->Misbehaving(20);
2158 return error("message addr size() = %d", vAddr.size());
2161 // Store the new addresses
2164 int64 nNow = GetAdjustedTime();
2165 int64 nSince = nNow - 10 * 60;
2166 BOOST_FOREACH(CAddress& addr, vAddr)
2170 // ignore IPv6 for now, since it isn't implemented anyway
2173 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2174 addr.nTime = nNow - 5 * 24 * 60 * 60;
2175 AddAddress(addr, 2 * 60 * 60, &addrDB);
2176 pfrom->AddAddressKnown(addr);
2177 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2179 // Relay to a limited number of other nodes
2180 CRITICAL_BLOCK(cs_vNodes)
2182 // Use deterministic randomness to send to the same nodes for 24 hours
2183 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2184 static uint256 hashSalt;
2186 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2187 int64 hashAddr = addr.GetHash();
2188 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2189 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2190 multimap<uint256, CNode*> mapMix;
2191 BOOST_FOREACH(CNode* pnode, vNodes)
2193 if (pnode->nVersion < 31402)
2195 unsigned int nPointer;
2196 memcpy(&nPointer, &pnode, sizeof(nPointer));
2197 uint256 hashKey = hashRand ^ nPointer;
2198 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2199 mapMix.insert(make_pair(hashKey, pnode));
2201 int nRelayNodes = 2;
2202 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2203 ((*mi).second)->PushAddress(addr);
2207 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2208 if (vAddr.size() < 1000)
2209 pfrom->fGetAddr = false;
2213 else if (strCommand == "inv")
2217 if (vInv.size() > 50000)
2219 pfrom->Misbehaving(20);
2220 return error("message inv size() = %d", vInv.size());
2224 BOOST_FOREACH(const CInv& inv, vInv)
2228 pfrom->AddInventoryKnown(inv);
2230 bool fAlreadyHave = AlreadyHave(txdb, inv);
2232 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2236 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2237 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2239 // Track requests for our stuff
2240 Inventory(inv.hash);
2245 else if (strCommand == "getdata")
2249 if (vInv.size() > 50000)
2251 pfrom->Misbehaving(20);
2252 return error("message getdata size() = %d", vInv.size());
2255 BOOST_FOREACH(const CInv& inv, vInv)
2259 printf("received getdata for: %s\n", inv.ToString().c_str());
2261 if (inv.type == MSG_BLOCK)
2263 // Send block from disk
2264 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2265 if (mi != mapBlockIndex.end())
2268 block.ReadFromDisk((*mi).second);
2269 pfrom->PushMessage("block", block);
2271 // Trigger them to send a getblocks request for the next batch of inventory
2272 if (inv.hash == pfrom->hashContinue)
2274 // Bypass PushInventory, this must send even if redundant,
2275 // and we want it right after the last block so they don't
2276 // wait for other stuff first.
2278 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2279 pfrom->PushMessage("inv", vInv);
2280 pfrom->hashContinue = 0;
2284 else if (inv.IsKnownType())
2286 // Send stream from relay memory
2287 CRITICAL_BLOCK(cs_mapRelay)
2289 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2290 if (mi != mapRelay.end())
2291 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2295 // Track requests for our stuff
2296 Inventory(inv.hash);
2301 else if (strCommand == "getblocks")
2303 CBlockLocator locator;
2305 vRecv >> locator >> hashStop;
2307 // Find the last block the caller has in the main chain
2308 CBlockIndex* pindex = locator.GetBlockIndex();
2310 // Send the rest of the chain
2312 pindex = pindex->pnext;
2313 int nLimit = 500 + locator.GetDistanceBack();
2314 unsigned int nBytes = 0;
2315 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2316 for (; pindex; pindex = pindex->pnext)
2318 if (pindex->GetBlockHash() == hashStop)
2320 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2323 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2325 block.ReadFromDisk(pindex, true);
2326 nBytes += block.GetSerializeSize(SER_NETWORK);
2327 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2329 // When this block is requested, we'll send an inv that'll make them
2330 // getblocks the next batch of inventory.
2331 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2332 pfrom->hashContinue = pindex->GetBlockHash();
2339 else if (strCommand == "getheaders")
2341 CBlockLocator locator;
2343 vRecv >> locator >> hashStop;
2345 CBlockIndex* pindex = NULL;
2346 if (locator.IsNull())
2348 // If locator is null, return the hashStop block
2349 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2350 if (mi == mapBlockIndex.end())
2352 pindex = (*mi).second;
2356 // Find the last block the caller has in the main chain
2357 pindex = locator.GetBlockIndex();
2359 pindex = pindex->pnext;
2362 vector<CBlock> vHeaders;
2363 int nLimit = 2000 + locator.GetDistanceBack();
2364 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2365 for (; pindex; pindex = pindex->pnext)
2367 vHeaders.push_back(pindex->GetBlockHeader());
2368 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2371 pfrom->PushMessage("headers", vHeaders);
2375 else if (strCommand == "tx")
2377 vector<uint256> vWorkQueue;
2378 CDataStream vMsg(vRecv);
2382 CInv inv(MSG_TX, tx.GetHash());
2383 pfrom->AddInventoryKnown(inv);
2385 bool fMissingInputs = false;
2386 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2388 SyncWithWallets(tx, NULL, true);
2389 RelayMessage(inv, vMsg);
2390 mapAlreadyAskedFor.erase(inv);
2391 vWorkQueue.push_back(inv.hash);
2393 // Recursively process any orphan transactions that depended on this one
2394 for (int i = 0; i < vWorkQueue.size(); i++)
2396 uint256 hashPrev = vWorkQueue[i];
2397 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2398 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2401 const CDataStream& vMsg = *((*mi).second);
2403 CDataStream(vMsg) >> tx;
2404 CInv inv(MSG_TX, tx.GetHash());
2406 if (tx.AcceptToMemoryPool(true))
2408 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2409 SyncWithWallets(tx, NULL, true);
2410 RelayMessage(inv, vMsg);
2411 mapAlreadyAskedFor.erase(inv);
2412 vWorkQueue.push_back(inv.hash);
2417 BOOST_FOREACH(uint256 hash, vWorkQueue)
2418 EraseOrphanTx(hash);
2420 else if (fMissingInputs)
2422 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2425 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2429 else if (strCommand == "block")
2434 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2437 CInv inv(MSG_BLOCK, block.GetHash());
2438 pfrom->AddInventoryKnown(inv);
2440 if (ProcessBlock(pfrom, &block))
2441 mapAlreadyAskedFor.erase(inv);
2442 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2446 else if (strCommand == "getaddr")
2448 // Nodes rebroadcast an addr every 24 hours
2449 pfrom->vAddrToSend.clear();
2450 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2451 CRITICAL_BLOCK(cs_mapAddresses)
2453 unsigned int nCount = 0;
2454 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2456 const CAddress& addr = item.second;
2457 if (addr.nTime > nSince)
2460 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2462 const CAddress& addr = item.second;
2463 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2464 pfrom->PushAddress(addr);
2470 else if (strCommand == "checkorder")
2475 if (!GetBoolArg("-allowreceivebyip"))
2477 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2484 /// we have a chance to check the order here
2486 // Keep giving the same key to the same ip until they use it
2487 if (!mapReuseKey.count(pfrom->addr))
2488 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2490 // Send back approval of order and pubkey to use
2491 CScript scriptPubKey;
2492 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2493 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2497 else if (strCommand == "reply")
2502 CRequestTracker tracker;
2503 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2505 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2506 if (mi != pfrom->mapRequests.end())
2508 tracker = (*mi).second;
2509 pfrom->mapRequests.erase(mi);
2512 if (!tracker.IsNull())
2513 tracker.fn(tracker.param1, vRecv);
2517 else if (strCommand == "ping")
2522 else if (strCommand == "alert")
2527 if (alert.ProcessAlert())
2530 pfrom->setKnown.insert(alert.GetHash());
2531 CRITICAL_BLOCK(cs_vNodes)
2532 BOOST_FOREACH(CNode* pnode, vNodes)
2533 alert.RelayTo(pnode);
2540 // Ignore unknown commands for extensibility
2544 // Update the last seen time for this node's address
2545 if (pfrom->fNetworkNode)
2546 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2547 AddressCurrentlyConnected(pfrom->addr);
2553 bool ProcessMessages(CNode* pfrom)
2555 CDataStream& vRecv = pfrom->vRecv;
2559 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2563 // (4) message start
2572 // Scan for message start
2573 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2574 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2575 if (vRecv.end() - pstart < nHeaderSize)
2577 if (vRecv.size() > nHeaderSize)
2579 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2580 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2584 if (pstart - vRecv.begin() > 0)
2585 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2586 vRecv.erase(vRecv.begin(), pstart);
2589 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2594 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2597 string strCommand = hdr.GetCommand();
2600 unsigned int nMessageSize = hdr.nMessageSize;
2601 if (nMessageSize > MAX_SIZE)
2603 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2606 if (nMessageSize > vRecv.size())
2608 // Rewind and wait for rest of message
2609 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2614 if (vRecv.GetVersion() >= 209)
2616 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2617 unsigned int nChecksum = 0;
2618 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2619 if (nChecksum != hdr.nChecksum)
2621 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2622 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2627 // Copy message to its own buffer
2628 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2629 vRecv.ignore(nMessageSize);
2635 CRITICAL_BLOCK(cs_main)
2636 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2640 catch (std::ios_base::failure& e)
2642 if (strstr(e.what(), "end of data"))
2644 // Allow exceptions from underlength message on vRecv
2645 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());
2647 else if (strstr(e.what(), "size too large"))
2649 // Allow exceptions from overlong size
2650 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2654 PrintExceptionContinue(&e, "ProcessMessage()");
2657 catch (std::exception& e) {
2658 PrintExceptionContinue(&e, "ProcessMessage()");
2660 PrintExceptionContinue(NULL, "ProcessMessage()");
2664 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2672 bool SendMessages(CNode* pto, bool fSendTrickle)
2674 CRITICAL_BLOCK(cs_main)
2676 // Don't send anything until we get their version message
2677 if (pto->nVersion == 0)
2681 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2682 pto->PushMessage("ping");
2684 // Resend wallet transactions that haven't gotten in a block yet
2685 ResendWalletTransactions();
2687 // Address refresh broadcast
2688 static int64 nLastRebroadcast;
2689 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2691 nLastRebroadcast = GetTime();
2692 CRITICAL_BLOCK(cs_vNodes)
2694 BOOST_FOREACH(CNode* pnode, vNodes)
2696 // Periodically clear setAddrKnown to allow refresh broadcasts
2697 pnode->setAddrKnown.clear();
2699 // Rebroadcast our address
2700 if (addrLocalHost.IsRoutable() && !fUseProxy)
2702 CAddress addr(addrLocalHost);
2703 addr.nTime = GetAdjustedTime();
2704 pnode->PushAddress(addr);
2710 // Clear out old addresses periodically so it's not too much work at once
2711 static int64 nLastClear;
2712 if (nLastClear == 0)
2713 nLastClear = GetTime();
2714 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2716 nLastClear = GetTime();
2717 CRITICAL_BLOCK(cs_mapAddresses)
2720 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2721 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2722 mi != mapAddresses.end();)
2724 const CAddress& addr = (*mi).second;
2725 if (addr.nTime < nSince)
2727 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2729 addrdb.EraseAddress(addr);
2730 mapAddresses.erase(mi++);
2744 vector<CAddress> vAddr;
2745 vAddr.reserve(pto->vAddrToSend.size());
2746 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2748 // returns true if wasn't already contained in the set
2749 if (pto->setAddrKnown.insert(addr).second)
2751 vAddr.push_back(addr);
2752 // receiver rejects addr messages larger than 1000
2753 if (vAddr.size() >= 1000)
2755 pto->PushMessage("addr", vAddr);
2760 pto->vAddrToSend.clear();
2762 pto->PushMessage("addr", vAddr);
2767 // Message: inventory
2770 vector<CInv> vInvWait;
2771 CRITICAL_BLOCK(pto->cs_inventory)
2773 vInv.reserve(pto->vInventoryToSend.size());
2774 vInvWait.reserve(pto->vInventoryToSend.size());
2775 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2777 if (pto->setInventoryKnown.count(inv))
2780 // trickle out tx inv to protect privacy
2781 if (inv.type == MSG_TX && !fSendTrickle)
2783 // 1/4 of tx invs blast to all immediately
2784 static uint256 hashSalt;
2786 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2787 uint256 hashRand = inv.hash ^ hashSalt;
2788 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2789 bool fTrickleWait = ((hashRand & 3) != 0);
2791 // always trickle our own transactions
2795 if (GetTransaction(inv.hash, wtx))
2797 fTrickleWait = true;
2802 vInvWait.push_back(inv);
2807 // returns true if wasn't already contained in the set
2808 if (pto->setInventoryKnown.insert(inv).second)
2810 vInv.push_back(inv);
2811 if (vInv.size() >= 1000)
2813 pto->PushMessage("inv", vInv);
2818 pto->vInventoryToSend = vInvWait;
2821 pto->PushMessage("inv", vInv);
2827 vector<CInv> vGetData;
2828 int64 nNow = GetTime() * 1000000;
2830 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2832 const CInv& inv = (*pto->mapAskFor.begin()).second;
2833 if (!AlreadyHave(txdb, inv))
2835 printf("sending getdata: %s\n", inv.ToString().c_str());
2836 vGetData.push_back(inv);
2837 if (vGetData.size() >= 1000)
2839 pto->PushMessage("getdata", vGetData);
2843 mapAlreadyAskedFor[inv] = nNow;
2844 pto->mapAskFor.erase(pto->mapAskFor.begin());
2846 if (!vGetData.empty())
2847 pto->PushMessage("getdata", vGetData);
2866 //////////////////////////////////////////////////////////////////////////////
2871 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2873 unsigned char* pdata = (unsigned char*)pbuffer;
2874 unsigned int blocks = 1 + ((len + 8) / 64);
2875 unsigned char* pend = pdata + 64 * blocks;
2876 memset(pdata + len, 0, 64 * blocks - len);
2878 unsigned int bits = len * 8;
2879 pend[-1] = (bits >> 0) & 0xff;
2880 pend[-2] = (bits >> 8) & 0xff;
2881 pend[-3] = (bits >> 16) & 0xff;
2882 pend[-4] = (bits >> 24) & 0xff;
2886 static const unsigned int pSHA256InitState[8] =
2887 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2889 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2892 unsigned char data[64];
2896 for (int i = 0; i < 16; i++)
2897 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2899 for (int i = 0; i < 8; i++)
2900 ctx.h[i] = ((uint32_t*)pinit)[i];
2902 SHA256_Update(&ctx, data, sizeof(data));
2903 for (int i = 0; i < 8; i++)
2904 ((uint32_t*)pstate)[i] = ctx.h[i];
2908 // ScanHash scans nonces looking for a hash with at least some zero bits.
2909 // It operates on big endian data. Caller does the byte reversing.
2910 // All input buffers are 16-byte aligned. nNonce is usually preserved
2911 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2912 // the block is rebuilt and nNonce starts over at zero.
2914 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2916 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2920 // Hash pdata using pmidstate as the starting state into
2921 // preformatted buffer phash1, then hash phash1 into phash
2923 SHA256Transform(phash1, pdata, pmidstate);
2924 SHA256Transform(phash, phash1, pSHA256InitState);
2926 // Return the nonce if the hash has at least some zero bits,
2927 // caller will check if it has enough to reach the target
2928 if (((unsigned short*)phash)[14] == 0)
2931 // If nothing found after trying for a while, return -1
2932 if ((nNonce & 0xffff) == 0)
2934 nHashesDone = 0xffff+1;
2940 // Some explaining would be appreciated
2945 set<uint256> setDependsOn;
2948 COrphan(CTransaction* ptxIn)
2956 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2957 BOOST_FOREACH(uint256 hash, setDependsOn)
2958 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2963 uint64 nLastBlockTx = 0;
2964 uint64 nLastBlockSize = 0;
2966 CBlock* CreateNewBlock(CReserveKey& reservekey)
2968 CBlockIndex* pindexPrev = pindexBest;
2971 auto_ptr<CBlock> pblock(new CBlock());
2975 // Create coinbase tx
2977 txNew.vin.resize(1);
2978 txNew.vin[0].prevout.SetNull();
2979 txNew.vout.resize(1);
2980 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2982 // Add our coinbase tx as first transaction
2983 pblock->vtx.push_back(txNew);
2985 // Collect memory pool transactions into the block
2987 CRITICAL_BLOCK(cs_main)
2988 CRITICAL_BLOCK(cs_mapTransactions)
2992 // Priority order to process transactions
2993 list<COrphan> vOrphan; // list memory doesn't move
2994 map<uint256, vector<COrphan*> > mapDependers;
2995 multimap<double, CTransaction*> mapPriority;
2996 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2998 CTransaction& tx = (*mi).second;
2999 if (tx.IsCoinBase() || !tx.IsFinal())
3002 COrphan* porphan = NULL;
3003 double dPriority = 0;
3004 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3006 // Read prev transaction
3007 CTransaction txPrev;
3009 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3011 // Has to wait for dependencies
3014 // Use list for automatic deletion
3015 vOrphan.push_back(COrphan(&tx));
3016 porphan = &vOrphan.back();
3018 mapDependers[txin.prevout.hash].push_back(porphan);
3019 porphan->setDependsOn.insert(txin.prevout.hash);
3022 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3024 // Read block header
3025 int nConf = txindex.GetDepthInMainChain();
3027 dPriority += (double)nValueIn * nConf;
3029 if (fDebug && GetBoolArg("-printpriority"))
3030 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3033 // Priority is sum(valuein * age) / txsize
3034 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3037 porphan->dPriority = dPriority;
3039 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3041 if (fDebug && GetBoolArg("-printpriority"))
3043 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3050 // Collect transactions into block
3051 map<uint256, CTxIndex> mapTestPool;
3052 uint64 nBlockSize = 1000;
3053 uint64 nBlockTx = 0;
3054 int nBlockSigOps1 = 100; // pre-0.6 count of sigOps
3055 int nBlockSigOps2 = 100; // post-0.6 count of sigOps
3056 while (!mapPriority.empty())
3058 // Take highest priority transaction off priority queue
3059 double dPriority = -(*mapPriority.begin()).first;
3060 CTransaction& tx = *(*mapPriority.begin()).second;
3061 mapPriority.erase(mapPriority.begin());
3064 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3065 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3068 // Legacy limits on sigOps:
3069 int nTxSigOps1 = tx.GetLegacySigOpCount();
3070 if (nBlockSigOps1 + nTxSigOps1 >= MAX_BLOCK_SIGOPS)
3073 // Transaction fee required depends on block size
3074 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3075 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3077 // Connecting shouldn't fail due to dependency on other memory pool transactions
3078 // because we're already processing them in order of dependency
3079 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3080 MapPrevTx mapInputs;
3081 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs))
3084 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3085 if (nFees < nMinFee)
3088 int nTxSigOps2 = tx.GetSigOpCount(mapInputs);
3089 if (nBlockSigOps2 + nTxSigOps2 >= MAX_BLOCK_SIGOPS)
3092 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3094 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3095 swap(mapTestPool, mapTestPoolTmp);
3098 pblock->vtx.push_back(tx);
3099 nBlockSize += nTxSize;
3101 nBlockSigOps1 += nTxSigOps1;
3102 nBlockSigOps2 += nTxSigOps2;
3104 // Add transactions that depend on this one to the priority queue
3105 uint256 hash = tx.GetHash();
3106 if (mapDependers.count(hash))
3108 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3110 if (!porphan->setDependsOn.empty())
3112 porphan->setDependsOn.erase(hash);
3113 if (porphan->setDependsOn.empty())
3114 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3120 nLastBlockTx = nBlockTx;
3121 nLastBlockSize = nBlockSize;
3122 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3125 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3128 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3129 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3130 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3131 pblock->nBits = GetNextWorkRequired(pindexPrev);
3134 return pblock.release();
3138 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3140 // Update nExtraNonce
3141 static uint256 hashPrevBlock;
3142 if (hashPrevBlock != pblock->hashPrevBlock)
3145 hashPrevBlock = pblock->hashPrevBlock;
3148 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3150 // Put "/P2SH/" in the coinbase so everybody can tell when
3151 // a majority of miners support it
3152 const char* pszP2SH = "/P2SH/";
3153 pblock->vtx[0].vin[0].scriptSig += CScript() << std::vector<unsigned char>(pszP2SH, pszP2SH+strlen(pszP2SH));
3154 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3156 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3160 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3163 // Prebuild hash buffers
3170 uint256 hashPrevBlock;
3171 uint256 hashMerkleRoot;
3174 unsigned int nNonce;
3177 unsigned char pchPadding0[64];
3179 unsigned char pchPadding1[64];
3182 memset(&tmp, 0, sizeof(tmp));
3184 tmp.block.nVersion = pblock->nVersion;
3185 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3186 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3187 tmp.block.nTime = pblock->nTime;
3188 tmp.block.nBits = pblock->nBits;
3189 tmp.block.nNonce = pblock->nNonce;
3191 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3192 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3194 // Byte swap all the input buffer
3195 for (int i = 0; i < sizeof(tmp)/4; i++)
3196 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3198 // Precalc the first half of the first hash, which stays constant
3199 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3201 memcpy(pdata, &tmp.block, 128);
3202 memcpy(phash1, &tmp.hash1, 64);
3206 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3208 uint256 hash = pblock->GetHash();
3209 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3211 if (hash > hashTarget)
3215 printf("BitcoinMiner:\n");
3216 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3218 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3219 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3222 CRITICAL_BLOCK(cs_main)
3224 if (pblock->hashPrevBlock != hashBestChain)
3225 return error("BitcoinMiner : generated block is stale");
3227 // Remove key from key pool
3228 reservekey.KeepKey();
3230 // Track how many getdata requests this block gets
3231 CRITICAL_BLOCK(wallet.cs_wallet)
3232 wallet.mapRequestCount[pblock->GetHash()] = 0;
3234 // Process this block the same as if we had received it from another node
3235 if (!ProcessBlock(NULL, pblock))
3236 return error("BitcoinMiner : ProcessBlock, block not accepted");
3242 void static ThreadBitcoinMiner(void* parg);
3244 void static BitcoinMiner(CWallet *pwallet)
3246 printf("BitcoinMiner started\n");
3247 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3249 // Each thread has its own key and counter
3250 CReserveKey reservekey(pwallet);
3251 unsigned int nExtraNonce = 0;
3253 while (fGenerateBitcoins)
3255 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3259 while (vNodes.empty() || IsInitialBlockDownload())
3264 if (!fGenerateBitcoins)
3272 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3273 CBlockIndex* pindexPrev = pindexBest;
3275 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3278 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3280 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3284 // Prebuild hash buffers
3286 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3287 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3288 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3290 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3292 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3293 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3299 int64 nStart = GetTime();
3300 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3302 uint256& hash = *alignup<16>(hashbuf);
3305 unsigned int nHashesDone = 0;
3306 unsigned int nNonceFound;
3309 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3310 (char*)&hash, nHashesDone);
3312 // Check if something found
3313 if (nNonceFound != -1)
3315 for (int i = 0; i < sizeof(hash)/4; i++)
3316 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3318 if (hash <= hashTarget)
3321 pblock->nNonce = ByteReverse(nNonceFound);
3322 assert(hash == pblock->GetHash());
3324 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3325 CheckWork(pblock.get(), *pwalletMain, reservekey);
3326 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3332 static int64 nHashCounter;
3333 if (nHPSTimerStart == 0)
3335 nHPSTimerStart = GetTimeMillis();
3339 nHashCounter += nHashesDone;
3340 if (GetTimeMillis() - nHPSTimerStart > 4000)
3342 static CCriticalSection cs;
3345 if (GetTimeMillis() - nHPSTimerStart > 4000)
3347 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3348 nHPSTimerStart = GetTimeMillis();
3350 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3351 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3352 static int64 nLogTime;
3353 if (GetTime() - nLogTime > 30 * 60)
3355 nLogTime = GetTime();
3356 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3357 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3363 // Check for stop or if block needs to be rebuilt
3366 if (!fGenerateBitcoins)
3368 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3372 if (nBlockNonce >= 0xffff0000)
3374 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3376 if (pindexPrev != pindexBest)
3379 // Update nTime every few seconds
3380 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3381 nBlockTime = ByteReverse(pblock->nTime);
3386 void static ThreadBitcoinMiner(void* parg)
3388 CWallet* pwallet = (CWallet*)parg;
3391 vnThreadsRunning[3]++;
3392 BitcoinMiner(pwallet);
3393 vnThreadsRunning[3]--;
3395 catch (std::exception& e) {
3396 vnThreadsRunning[3]--;
3397 PrintException(&e, "ThreadBitcoinMiner()");
3399 vnThreadsRunning[3]--;
3400 PrintException(NULL, "ThreadBitcoinMiner()");
3402 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3404 if (vnThreadsRunning[3] == 0)
3406 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3410 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3412 if (fGenerateBitcoins != fGenerate)
3414 fGenerateBitcoins = fGenerate;
3415 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3418 if (fGenerateBitcoins)
3420 int nProcessors = boost::thread::hardware_concurrency();
3421 printf("%d processors\n", nProcessors);
3422 if (nProcessors < 1)
3424 if (fLimitProcessors && nProcessors > nLimitProcessors)
3425 nProcessors = nLimitProcessors;
3426 int nAddThreads = nProcessors - vnThreadsRunning[3];
3427 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3428 for (int i = 0; i < nAddThreads; i++)
3430 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3431 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");