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 uint256 hash = GetHash();
622 if (mapTransactions.count(hash))
624 BOOST_FOREACH(const CTxIn& txin, vin)
625 mapNextTx.erase(txin.prevout);
626 mapTransactions.erase(hash);
627 nTransactionsUpdated++;
639 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
641 if (hashBlock == 0 || nIndex == -1)
644 // Find the block it claims to be in
645 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
646 if (mi == mapBlockIndex.end())
648 CBlockIndex* pindex = (*mi).second;
649 if (!pindex || !pindex->IsInMainChain())
652 // Make sure the merkle branch connects to this block
653 if (!fMerkleVerified)
655 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
657 fMerkleVerified = true;
661 return pindexBest->nHeight - pindex->nHeight + 1;
665 int CMerkleTx::GetBlocksToMaturity() const
669 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
673 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
677 if (!IsInMainChain() && !ClientConnectInputs())
679 return CTransaction::AcceptToMemoryPool(txdb, false);
683 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
687 bool CMerkleTx::AcceptToMemoryPool()
690 return AcceptToMemoryPool(txdb);
695 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
697 CRITICAL_BLOCK(cs_mapTransactions)
699 // Add previous supporting transactions first
700 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
702 if (!tx.IsCoinBase())
704 uint256 hash = tx.GetHash();
705 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
706 tx.AcceptToMemoryPool(txdb, fCheckInputs);
709 return AcceptToMemoryPool(txdb, fCheckInputs);
714 bool CWalletTx::AcceptWalletTransaction()
717 return AcceptWalletTransaction(txdb);
720 int CTxIndex::GetDepthInMainChain() const
724 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
726 // Find the block in the index
727 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
728 if (mi == mapBlockIndex.end())
730 CBlockIndex* pindex = (*mi).second;
731 if (!pindex || !pindex->IsInMainChain())
733 return 1 + nBestHeight - pindex->nHeight;
745 //////////////////////////////////////////////////////////////////////////////
747 // CBlock and CBlockIndex
750 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
752 if (!fReadTransactions)
754 *this = pindex->GetBlockHeader();
757 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
759 if (GetHash() != pindex->GetBlockHash())
760 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
764 uint256 static GetOrphanRoot(const CBlock* pblock)
766 // Work back to the first block in the orphan chain
767 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
768 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
769 return pblock->GetHash();
772 int64 static GetBlockValue(int nHeight, int64 nFees)
774 int64 nSubsidy = 50 * COIN;
776 // Subsidy is cut in half every 4 years
777 nSubsidy >>= (nHeight / 210000);
779 return nSubsidy + nFees;
782 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
783 static const int64 nTargetSpacing = 10 * 60;
784 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
787 // minimum amount of work that could possibly be required nTime after
788 // minimum work required was nBase
790 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
792 // Testnet has min-difficulty blocks
793 // after nTargetSpacing*2 time between blocks:
794 if (fTestNet && nTime > nTargetSpacing*2)
795 return bnProofOfWorkLimit.GetCompact();
798 bnResult.SetCompact(nBase);
799 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
801 // Maximum 400% adjustment...
803 // ... in best-case exactly 4-times-normal target time
804 nTime -= nTargetTimespan*4;
806 if (bnResult > bnProofOfWorkLimit)
807 bnResult = bnProofOfWorkLimit;
808 return bnResult.GetCompact();
811 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
813 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
816 if (pindexLast == NULL)
817 return nProofOfWorkLimit;
819 // Only change once per interval
820 if ((pindexLast->nHeight+1) % nInterval != 0)
822 // Special rules for testnet after 15 Feb 2012:
823 if (fTestNet && pblock->nTime > 1329264000)
825 // If the new block's timestamp is more than 2* 10 minutes
826 // then allow mining of a min-difficulty block.
827 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
828 return nProofOfWorkLimit;
831 // Return the last non-special-min-difficulty-rules-block
832 const CBlockIndex* pindex = pindexLast;
833 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
834 pindex = pindex->pprev;
835 return pindex->nBits;
839 return pindexLast->nBits;
842 // Go back by what we want to be 14 days worth of blocks
843 const CBlockIndex* pindexFirst = pindexLast;
844 for (int i = 0; pindexFirst && i < nInterval-1; i++)
845 pindexFirst = pindexFirst->pprev;
848 // Limit adjustment step
849 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
850 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
851 if (nActualTimespan < nTargetTimespan/4)
852 nActualTimespan = nTargetTimespan/4;
853 if (nActualTimespan > nTargetTimespan*4)
854 nActualTimespan = nTargetTimespan*4;
858 bnNew.SetCompact(pindexLast->nBits);
859 bnNew *= nActualTimespan;
860 bnNew /= nTargetTimespan;
862 if (bnNew > bnProofOfWorkLimit)
863 bnNew = bnProofOfWorkLimit;
866 printf("GetNextWorkRequired RETARGET\n");
867 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
868 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
869 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
871 return bnNew.GetCompact();
874 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
877 bnTarget.SetCompact(nBits);
880 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
881 return error("CheckProofOfWork() : nBits below minimum work");
883 // Check proof of work matches claimed amount
884 if (hash > bnTarget.getuint256())
885 return error("CheckProofOfWork() : hash doesn't match nBits");
890 // Return maximum amount of blocks that other nodes claim to have
891 int GetNumBlocksOfPeers()
893 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
896 bool IsInitialBlockDownload()
898 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
900 static int64 nLastUpdate;
901 static CBlockIndex* pindexLastBest;
902 if (pindexBest != pindexLastBest)
904 pindexLastBest = pindexBest;
905 nLastUpdate = GetTime();
907 return (GetTime() - nLastUpdate < 10 &&
908 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
911 void static InvalidChainFound(CBlockIndex* pindexNew)
913 if (pindexNew->bnChainWork > bnBestInvalidWork)
915 bnBestInvalidWork = pindexNew->bnChainWork;
916 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
919 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());
920 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
921 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
922 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
925 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
927 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
929 // Updating time can change work required on testnet:
931 nBits = GetNextWorkRequired(pindexPrev, this);
944 bool CTransaction::DisconnectInputs(CTxDB& txdb)
946 // Relinquish previous transactions' spent pointers
949 BOOST_FOREACH(const CTxIn& txin, vin)
951 COutPoint prevout = txin.prevout;
953 // Get prev txindex from disk
955 if (!txdb.ReadTxIndex(prevout.hash, txindex))
956 return error("DisconnectInputs() : ReadTxIndex failed");
958 if (prevout.n >= txindex.vSpent.size())
959 return error("DisconnectInputs() : prevout.n out of range");
961 // Mark outpoint as not spent
962 txindex.vSpent[prevout.n].SetNull();
965 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
966 return error("DisconnectInputs() : UpdateTxIndex failed");
970 // Remove transaction from index
971 if (!txdb.EraseTxIndex(*this))
972 return error("DisconnectInputs() : EraseTxPos failed");
978 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
979 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
981 // FetchInputs can return false either because we just haven't seen some inputs
982 // (in which case the transaction should be stored as an orphan)
983 // or because the transaction is malformed (in which case the transaction should
984 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
988 return true; // Coinbase transactions have no inputs to fetch.
990 for (int i = 0; i < vin.size(); i++)
992 COutPoint prevout = vin[i].prevout;
993 if (inputsRet.count(prevout.hash))
994 continue; // Got it already
997 CTxIndex& txindex = inputsRet[prevout.hash].first;
999 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1001 // Get txindex from current proposed changes
1002 txindex = mapTestPool.find(prevout.hash)->second;
1006 // Read txindex from txdb
1007 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1009 if (!fFound && (fBlock || fMiner))
1010 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());
1013 CTransaction& txPrev = inputsRet[prevout.hash].second;
1014 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1016 // Get prev tx from single transactions in memory
1017 CRITICAL_BLOCK(cs_mapTransactions)
1019 if (!mapTransactions.count(prevout.hash))
1020 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1021 txPrev = mapTransactions[prevout.hash];
1024 txindex.vSpent.resize(txPrev.vout.size());
1028 // Get prev tx from disk
1029 if (!txPrev.ReadFromDisk(txindex.pos))
1030 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1034 // Make sure all prevout.n's are valid:
1035 for (int i = 0; i < vin.size(); i++)
1037 const COutPoint prevout = vin[i].prevout;
1038 assert(inputsRet.count(prevout.hash) != 0);
1039 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1040 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1041 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1043 // Revisit this if/when transaction replacement is implemented and allows
1046 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()));
1053 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1055 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1056 if (mi == inputs.end())
1057 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1059 const CTransaction& txPrev = (mi->second).second;
1060 if (input.prevout.n >= txPrev.vout.size())
1061 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1063 return txPrev.vout[input.prevout.n];
1066 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1072 for (int i = 0; i < vin.size(); i++)
1074 nResult += GetOutputFor(vin[i], inputs).nValue;
1080 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1086 for (int i = 0; i < vin.size(); i++)
1088 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1089 if (prevout.scriptPubKey.IsPayToScriptHash())
1090 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1095 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1096 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1097 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1099 // Take over previous transactions' spent pointers
1100 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1101 // fMiner is true when called from the internal bitcoin miner
1102 // ... both are false when called from CTransaction::AcceptToMemoryPool
1107 for (int i = 0; i < vin.size(); i++)
1109 COutPoint prevout = vin[i].prevout;
1110 assert(inputs.count(prevout.hash) > 0);
1111 CTxIndex& txindex = inputs[prevout.hash].first;
1112 CTransaction& txPrev = inputs[prevout.hash].second;
1114 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1115 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()));
1117 // If prev is coinbase, check that it's matured
1118 if (txPrev.IsCoinBase())
1119 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1120 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1121 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1123 // Check for conflicts (double-spend)
1124 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1125 // for an attacker to attempt to split the network.
1126 if (!txindex.vSpent[prevout.n].IsNull())
1127 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());
1129 // Check for negative or overflow input values
1130 nValueIn += txPrev.vout[prevout.n].nValue;
1131 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1132 return DoS(100, error("ConnectInputs() : txin values out of range"));
1134 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1135 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1136 // still computed and checked, and any change will be caught at the next checkpoint.
1137 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1140 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1141 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1144 // Mark outpoints as spent
1145 txindex.vSpent[prevout.n] = posThisTx;
1148 if (fBlock || fMiner)
1150 mapTestPool[prevout.hash] = txindex;
1154 if (nValueIn < GetValueOut())
1155 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1157 // Tally transaction fees
1158 int64 nTxFee = nValueIn - GetValueOut();
1160 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1162 if (!MoneyRange(nFees))
1163 return DoS(100, error("ConnectInputs() : nFees out of range"));
1170 bool CTransaction::ClientConnectInputs()
1175 // Take over previous transactions' spent pointers
1176 CRITICAL_BLOCK(cs_mapTransactions)
1179 for (int i = 0; i < vin.size(); i++)
1181 // Get prev tx from single transactions in memory
1182 COutPoint prevout = vin[i].prevout;
1183 if (!mapTransactions.count(prevout.hash))
1185 CTransaction& txPrev = mapTransactions[prevout.hash];
1187 if (prevout.n >= txPrev.vout.size())
1191 if (!VerifySignature(txPrev, *this, i, true, 0))
1192 return error("ConnectInputs() : VerifySignature failed");
1194 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1195 ///// this has to go away now that posNext is gone
1196 // // Check for conflicts
1197 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1198 // return error("ConnectInputs() : prev tx already used");
1200 // // Flag outpoints as used
1201 // txPrev.vout[prevout.n].posNext = posThisTx;
1203 nValueIn += txPrev.vout[prevout.n].nValue;
1205 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1206 return error("ClientConnectInputs() : txin values out of range");
1208 if (GetValueOut() > nValueIn)
1218 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1220 // Disconnect in reverse order
1221 for (int i = vtx.size()-1; i >= 0; i--)
1222 if (!vtx[i].DisconnectInputs(txdb))
1225 // Update block index on disk without changing it in memory.
1226 // The memory index structure will be changed after the db commits.
1229 CDiskBlockIndex blockindexPrev(pindex->pprev);
1230 blockindexPrev.hashNext = 0;
1231 if (!txdb.WriteBlockIndex(blockindexPrev))
1232 return error("DisconnectBlock() : WriteBlockIndex failed");
1238 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1240 // Check it again in case a previous version let a bad block in
1244 // To avoid being on the short end of a block-chain split,
1245 // don't do secondary validation of pay-to-script-hash transactions
1246 // until blocks with timestamps after paytoscripthashtime (see init.cpp for default).
1247 // This code can be removed once a super-majority of the network has upgraded.
1248 int64 nEvalSwitchTime = GetArg("-paytoscripthashtime", std::numeric_limits<int64_t>::max());
1249 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1251 //// issue here: it doesn't know the version
1252 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1254 map<uint256, CTxIndex> mapQueuedChanges;
1257 BOOST_FOREACH(CTransaction& tx, vtx)
1259 nSigOps += tx.GetLegacySigOpCount();
1260 if (nSigOps > MAX_BLOCK_SIGOPS)
1261 return DoS(100, error("ConnectBlock() : too many sigops"));
1263 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1264 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1266 MapPrevTx mapInputs;
1267 if (!tx.IsCoinBase())
1270 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1273 if (fStrictPayToScriptHash)
1275 // Add in sigops done by pay-to-script-hash inputs;
1276 // this is to prevent a "rogue miner" from creating
1277 // an incredibly-expensive-to-validate block.
1278 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1279 if (nSigOps > MAX_BLOCK_SIGOPS)
1280 return DoS(100, error("ConnectBlock() : too many sigops"));
1283 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1285 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1289 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1292 // Write queued txindex changes
1293 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1295 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1296 return error("ConnectBlock() : UpdateTxIndex failed");
1299 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1302 // Update block index on disk without changing it in memory.
1303 // The memory index structure will be changed after the db commits.
1306 CDiskBlockIndex blockindexPrev(pindex->pprev);
1307 blockindexPrev.hashNext = pindex->GetBlockHash();
1308 if (!txdb.WriteBlockIndex(blockindexPrev))
1309 return error("ConnectBlock() : WriteBlockIndex failed");
1312 // Watch for transactions paying to me
1313 BOOST_FOREACH(CTransaction& tx, vtx)
1314 SyncWithWallets(tx, this, true);
1319 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1321 printf("REORGANIZE\n");
1324 CBlockIndex* pfork = pindexBest;
1325 CBlockIndex* plonger = pindexNew;
1326 while (pfork != plonger)
1328 while (plonger->nHeight > pfork->nHeight)
1329 if (!(plonger = plonger->pprev))
1330 return error("Reorganize() : plonger->pprev is null");
1331 if (pfork == plonger)
1333 if (!(pfork = pfork->pprev))
1334 return error("Reorganize() : pfork->pprev is null");
1337 // List of what to disconnect
1338 vector<CBlockIndex*> vDisconnect;
1339 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1340 vDisconnect.push_back(pindex);
1342 // List of what to connect
1343 vector<CBlockIndex*> vConnect;
1344 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1345 vConnect.push_back(pindex);
1346 reverse(vConnect.begin(), vConnect.end());
1348 // Disconnect shorter branch
1349 vector<CTransaction> vResurrect;
1350 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1353 if (!block.ReadFromDisk(pindex))
1354 return error("Reorganize() : ReadFromDisk for disconnect failed");
1355 if (!block.DisconnectBlock(txdb, pindex))
1356 return error("Reorganize() : DisconnectBlock failed");
1358 // Queue memory transactions to resurrect
1359 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1360 if (!tx.IsCoinBase())
1361 vResurrect.push_back(tx);
1364 // Connect longer branch
1365 vector<CTransaction> vDelete;
1366 for (int i = 0; i < vConnect.size(); i++)
1368 CBlockIndex* pindex = vConnect[i];
1370 if (!block.ReadFromDisk(pindex))
1371 return error("Reorganize() : ReadFromDisk for connect failed");
1372 if (!block.ConnectBlock(txdb, pindex))
1376 return error("Reorganize() : ConnectBlock failed");
1379 // Queue memory transactions to delete
1380 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1381 vDelete.push_back(tx);
1383 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1384 return error("Reorganize() : WriteHashBestChain failed");
1386 // Make sure it's successfully written to disk before changing memory structure
1387 if (!txdb.TxnCommit())
1388 return error("Reorganize() : TxnCommit failed");
1390 // Disconnect shorter branch
1391 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1393 pindex->pprev->pnext = NULL;
1395 // Connect longer branch
1396 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1398 pindex->pprev->pnext = pindex;
1400 // Resurrect memory transactions that were in the disconnected branch
1401 BOOST_FOREACH(CTransaction& tx, vResurrect)
1402 tx.AcceptToMemoryPool(txdb, false);
1404 // Delete redundant memory transactions that are in the connected branch
1405 BOOST_FOREACH(CTransaction& tx, vDelete)
1406 tx.RemoveFromMemoryPool();
1413 runCommand(std::string strCommand)
1415 int nErr = ::system(strCommand.c_str());
1417 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1420 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1422 uint256 hash = GetHash();
1425 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1427 txdb.WriteHashBestChain(hash);
1428 if (!txdb.TxnCommit())
1429 return error("SetBestChain() : TxnCommit failed");
1430 pindexGenesisBlock = pindexNew;
1432 else if (hashPrevBlock == hashBestChain)
1434 // Adding to current best branch
1435 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1438 InvalidChainFound(pindexNew);
1439 return error("SetBestChain() : ConnectBlock failed");
1441 if (!txdb.TxnCommit())
1442 return error("SetBestChain() : TxnCommit failed");
1444 // Add to current best branch
1445 pindexNew->pprev->pnext = pindexNew;
1447 // Delete redundant memory transactions
1448 BOOST_FOREACH(CTransaction& tx, vtx)
1449 tx.RemoveFromMemoryPool();
1454 if (!Reorganize(txdb, pindexNew))
1457 InvalidChainFound(pindexNew);
1458 return error("SetBestChain() : Reorganize failed");
1462 // Update best block in wallet (so we can detect restored wallets)
1463 bool fIsInitialDownload = IsInitialBlockDownload();
1464 if (!fIsInitialDownload)
1466 const CBlockLocator locator(pindexNew);
1467 ::SetBestChain(locator);
1471 hashBestChain = hash;
1472 pindexBest = pindexNew;
1473 nBestHeight = pindexBest->nHeight;
1474 bnBestChainWork = pindexNew->bnChainWork;
1475 nTimeBestReceived = GetTime();
1476 nTransactionsUpdated++;
1477 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1479 std::string strCmd = GetArg("-blocknotify", "");
1481 if (!fIsInitialDownload && !strCmd.empty())
1483 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1484 boost::thread t(runCommand, strCmd); // thread runs free
1491 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1493 // Check for duplicate
1494 uint256 hash = GetHash();
1495 if (mapBlockIndex.count(hash))
1496 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1498 // Construct new block index object
1499 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1501 return error("AddToBlockIndex() : new CBlockIndex failed");
1502 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1503 pindexNew->phashBlock = &((*mi).first);
1504 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1505 if (miPrev != mapBlockIndex.end())
1507 pindexNew->pprev = (*miPrev).second;
1508 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1510 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1514 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1515 if (!txdb.TxnCommit())
1519 if (pindexNew->bnChainWork > bnBestChainWork)
1520 if (!SetBestChain(txdb, pindexNew))
1525 if (pindexNew == pindexBest)
1527 // Notify UI to display prev block's coinbase if it was ours
1528 static uint256 hashPrevBestCoinBase;
1529 UpdatedTransaction(hashPrevBestCoinBase);
1530 hashPrevBestCoinBase = vtx[0].GetHash();
1540 bool CBlock::CheckBlock() const
1542 // These are checks that are independent of context
1543 // that can be verified before saving an orphan block.
1546 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1547 return DoS(100, error("CheckBlock() : size limits failed"));
1549 // Check proof of work matches claimed amount
1550 if (!CheckProofOfWork(GetHash(), nBits))
1551 return DoS(50, error("CheckBlock() : proof of work failed"));
1554 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1555 return error("CheckBlock() : block timestamp too far in the future");
1557 // First transaction must be coinbase, the rest must not be
1558 if (vtx.empty() || !vtx[0].IsCoinBase())
1559 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1560 for (int i = 1; i < vtx.size(); i++)
1561 if (vtx[i].IsCoinBase())
1562 return DoS(100, error("CheckBlock() : more than one coinbase"));
1564 // Check transactions
1565 BOOST_FOREACH(const CTransaction& tx, vtx)
1566 if (!tx.CheckTransaction())
1567 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1570 BOOST_FOREACH(const CTransaction& tx, vtx)
1572 nSigOps += tx.GetLegacySigOpCount();
1574 if (nSigOps > MAX_BLOCK_SIGOPS)
1575 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1578 if (hashMerkleRoot != BuildMerkleTree())
1579 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1584 bool CBlock::AcceptBlock()
1586 // Check for duplicate
1587 uint256 hash = GetHash();
1588 if (mapBlockIndex.count(hash))
1589 return error("AcceptBlock() : block already in mapBlockIndex");
1591 // Get prev block index
1592 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1593 if (mi == mapBlockIndex.end())
1594 return DoS(10, error("AcceptBlock() : prev block not found"));
1595 CBlockIndex* pindexPrev = (*mi).second;
1596 int nHeight = pindexPrev->nHeight+1;
1598 // Check proof of work
1599 if (nBits != GetNextWorkRequired(pindexPrev, this))
1600 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1602 // Check timestamp against prev
1603 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1604 return error("AcceptBlock() : block's timestamp is too early");
1606 // Check that all transactions are finalized
1607 BOOST_FOREACH(const CTransaction& tx, vtx)
1608 if (!tx.IsFinal(nHeight, GetBlockTime()))
1609 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1611 // Check that the block chain matches the known block chain up to a checkpoint
1612 if (!Checkpoints::CheckBlock(nHeight, hash))
1613 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1615 // Write block to history file
1616 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1617 return error("AcceptBlock() : out of disk space");
1618 unsigned int nFile = -1;
1619 unsigned int nBlockPos = 0;
1620 if (!WriteToDisk(nFile, nBlockPos))
1621 return error("AcceptBlock() : WriteToDisk failed");
1622 if (!AddToBlockIndex(nFile, nBlockPos))
1623 return error("AcceptBlock() : AddToBlockIndex failed");
1625 // Relay inventory, but don't relay old inventory during initial block download
1626 if (hashBestChain == hash)
1627 CRITICAL_BLOCK(cs_vNodes)
1628 BOOST_FOREACH(CNode* pnode, vNodes)
1629 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1630 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1635 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1637 // Check for duplicate
1638 uint256 hash = pblock->GetHash();
1639 if (mapBlockIndex.count(hash))
1640 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1641 if (mapOrphanBlocks.count(hash))
1642 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1644 // Preliminary checks
1645 if (!pblock->CheckBlock())
1646 return error("ProcessBlock() : CheckBlock FAILED");
1648 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1649 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1651 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1652 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1656 pfrom->Misbehaving(100);
1657 return error("ProcessBlock() : block with timestamp before last checkpoint");
1660 bnNewBlock.SetCompact(pblock->nBits);
1662 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1663 if (bnNewBlock > bnRequired)
1666 pfrom->Misbehaving(100);
1667 return error("ProcessBlock() : block with too little proof-of-work");
1672 // If don't already have its previous block, shunt it off to holding area until we get it
1673 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1675 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1676 CBlock* pblock2 = new CBlock(*pblock);
1677 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1678 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1680 // Ask this guy to fill in what we're missing
1682 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1687 if (!pblock->AcceptBlock())
1688 return error("ProcessBlock() : AcceptBlock FAILED");
1690 // Recursively process any orphan blocks that depended on this one
1691 vector<uint256> vWorkQueue;
1692 vWorkQueue.push_back(hash);
1693 for (int i = 0; i < vWorkQueue.size(); i++)
1695 uint256 hashPrev = vWorkQueue[i];
1696 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1697 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1700 CBlock* pblockOrphan = (*mi).second;
1701 if (pblockOrphan->AcceptBlock())
1702 vWorkQueue.push_back(pblockOrphan->GetHash());
1703 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1704 delete pblockOrphan;
1706 mapOrphanBlocksByPrev.erase(hashPrev);
1709 printf("ProcessBlock: ACCEPTED\n");
1720 bool CheckDiskSpace(uint64 nAdditionalBytes)
1722 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1724 // Check for 15MB because database could create another 10MB log file at any time
1725 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1728 string strMessage = _("Warning: Disk space is low ");
1729 strMiscWarning = strMessage;
1730 printf("*** %s\n", strMessage.c_str());
1731 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1732 CreateThread(Shutdown, NULL);
1738 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1742 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1745 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1747 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1756 static unsigned int nCurrentBlockFile = 1;
1758 FILE* AppendBlockFile(unsigned int& nFileRet)
1763 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1766 if (fseek(file, 0, SEEK_END) != 0)
1768 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1769 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1771 nFileRet = nCurrentBlockFile;
1775 nCurrentBlockFile++;
1779 bool LoadBlockIndex(bool fAllowNew)
1783 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1784 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1785 pchMessageStart[0] = 0xfa;
1786 pchMessageStart[1] = 0xbf;
1787 pchMessageStart[2] = 0xb5;
1788 pchMessageStart[3] = 0xda;
1795 if (!txdb.LoadBlockIndex())
1800 // Init with genesis block
1802 if (mapBlockIndex.empty())
1808 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1809 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1810 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1811 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1812 // vMerkleTree: 4a5e1e
1815 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1817 txNew.vin.resize(1);
1818 txNew.vout.resize(1);
1819 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1820 txNew.vout[0].nValue = 50 * COIN;
1821 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1823 block.vtx.push_back(txNew);
1824 block.hashPrevBlock = 0;
1825 block.hashMerkleRoot = block.BuildMerkleTree();
1827 block.nTime = 1231006505;
1828 block.nBits = 0x1d00ffff;
1829 block.nNonce = 2083236893;
1833 block.nTime = 1296688602;
1834 block.nBits = 0x1d07fff8;
1835 block.nNonce = 384568319;
1839 printf("%s\n", block.GetHash().ToString().c_str());
1840 printf("%s\n", hashGenesisBlock.ToString().c_str());
1841 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1842 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1844 assert(block.GetHash() == hashGenesisBlock);
1846 // Start new block file
1848 unsigned int nBlockPos;
1849 if (!block.WriteToDisk(nFile, nBlockPos))
1850 return error("LoadBlockIndex() : writing genesis block to disk failed");
1851 if (!block.AddToBlockIndex(nFile, nBlockPos))
1852 return error("LoadBlockIndex() : genesis block not accepted");
1860 void PrintBlockTree()
1862 // precompute tree structure
1863 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1864 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1866 CBlockIndex* pindex = (*mi).second;
1867 mapNext[pindex->pprev].push_back(pindex);
1869 //while (rand() % 3 == 0)
1870 // mapNext[pindex->pprev].push_back(pindex);
1873 vector<pair<int, CBlockIndex*> > vStack;
1874 vStack.push_back(make_pair(0, pindexGenesisBlock));
1877 while (!vStack.empty())
1879 int nCol = vStack.back().first;
1880 CBlockIndex* pindex = vStack.back().second;
1883 // print split or gap
1884 if (nCol > nPrevCol)
1886 for (int i = 0; i < nCol-1; i++)
1890 else if (nCol < nPrevCol)
1892 for (int i = 0; i < nCol; i++)
1899 for (int i = 0; i < nCol; i++)
1904 block.ReadFromDisk(pindex);
1905 printf("%d (%u,%u) %s %s tx %d",
1909 block.GetHash().ToString().substr(0,20).c_str(),
1910 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1913 PrintWallets(block);
1915 // put the main timechain first
1916 vector<CBlockIndex*>& vNext = mapNext[pindex];
1917 for (int i = 0; i < vNext.size(); i++)
1919 if (vNext[i]->pnext)
1921 swap(vNext[0], vNext[i]);
1927 for (int i = 0; i < vNext.size(); i++)
1928 vStack.push_back(make_pair(nCol+i, vNext[i]));
1941 //////////////////////////////////////////////////////////////////////////////
1946 map<uint256, CAlert> mapAlerts;
1947 CCriticalSection cs_mapAlerts;
1949 string GetWarnings(string strFor)
1952 string strStatusBar;
1954 if (GetBoolArg("-testsafemode"))
1957 // Misc warnings like out of disk space and clock is wrong
1958 if (strMiscWarning != "")
1961 strStatusBar = strMiscWarning;
1964 // Longer invalid proof-of-work chain
1965 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1968 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1972 CRITICAL_BLOCK(cs_mapAlerts)
1974 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1976 const CAlert& alert = item.second;
1977 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1979 nPriority = alert.nPriority;
1980 strStatusBar = alert.strStatusBar;
1985 if (strFor == "statusbar")
1986 return strStatusBar;
1987 else if (strFor == "rpc")
1989 assert(!"GetWarnings() : invalid parameter");
1993 bool CAlert::ProcessAlert()
1995 if (!CheckSignature())
2000 CRITICAL_BLOCK(cs_mapAlerts)
2002 // Cancel previous alerts
2003 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2005 const CAlert& alert = (*mi).second;
2008 printf("cancelling alert %d\n", alert.nID);
2009 mapAlerts.erase(mi++);
2011 else if (!alert.IsInEffect())
2013 printf("expiring alert %d\n", alert.nID);
2014 mapAlerts.erase(mi++);
2020 // Check if this alert has been cancelled
2021 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2023 const CAlert& alert = item.second;
2024 if (alert.Cancels(*this))
2026 printf("alert already cancelled by %d\n", alert.nID);
2032 mapAlerts.insert(make_pair(GetHash(), *this));
2035 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2047 //////////////////////////////////////////////////////////////////////////////
2053 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2057 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2058 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2060 // Don't know what it is, just say we already got one
2067 // The message start string is designed to be unlikely to occur in normal data.
2068 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2069 // a large 4-byte int at any alignment.
2070 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2073 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2075 static map<CService, vector<unsigned char> > mapReuseKey;
2076 RandAddSeedPerfmon();
2078 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2079 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2081 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2083 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2091 if (strCommand == "version")
2093 // Each connection can only send one version message
2094 if (pfrom->nVersion != 0)
2096 pfrom->Misbehaving(1);
2104 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2105 if (pfrom->nVersion == 10300)
2106 pfrom->nVersion = 300;
2107 if (pfrom->nVersion >= 106 && !vRecv.empty())
2108 vRecv >> addrFrom >> nNonce;
2109 if (pfrom->nVersion >= 106 && !vRecv.empty())
2110 vRecv >> pfrom->strSubVer;
2111 if (pfrom->nVersion >= 209 && !vRecv.empty())
2112 vRecv >> pfrom->nStartingHeight;
2114 if (pfrom->nVersion == 0)
2117 // Disconnect if we connected to ourself
2118 if (nNonce == nLocalHostNonce && nNonce > 1)
2120 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2121 pfrom->fDisconnect = true;
2125 // Be shy and don't send version until we hear
2126 if (pfrom->fInbound)
2127 pfrom->PushVersion();
2129 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2131 AddTimeData(pfrom->addr, nTime);
2134 if (pfrom->nVersion >= 209)
2135 pfrom->PushMessage("verack");
2136 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2137 if (pfrom->nVersion < 209)
2138 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2140 if (!pfrom->fInbound)
2142 // Advertise our address
2143 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2144 !IsInitialBlockDownload())
2146 CAddress addr(addrLocalHost);
2147 addr.nTime = GetAdjustedTime();
2148 pfrom->PushAddress(addr);
2151 // Get recent addresses
2152 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2154 pfrom->PushMessage("getaddr");
2155 pfrom->fGetAddr = true;
2159 // Ask the first connected node for block updates
2160 static int nAskedForBlocks = 0;
2161 if (!pfrom->fClient &&
2162 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2163 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2166 pfrom->PushGetBlocks(pindexBest, uint256(0));
2170 CRITICAL_BLOCK(cs_mapAlerts)
2171 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2172 item.second.RelayTo(pfrom);
2174 pfrom->fSuccessfullyConnected = true;
2176 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2178 cPeerBlockCounts.input(pfrom->nStartingHeight);
2182 else if (pfrom->nVersion == 0)
2184 // Must have a version message before anything else
2185 pfrom->Misbehaving(1);
2190 else if (strCommand == "verack")
2192 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2196 else if (strCommand == "addr")
2198 vector<CAddress> vAddr;
2201 // Don't want addr from older versions unless seeding
2202 if (pfrom->nVersion < 209)
2204 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2206 if (vAddr.size() > 1000)
2208 pfrom->Misbehaving(20);
2209 return error("message addr size() = %d", vAddr.size());
2212 // Store the new addresses
2215 int64 nNow = GetAdjustedTime();
2216 int64 nSince = nNow - 10 * 60;
2217 BOOST_FOREACH(CAddress& addr, vAddr)
2221 // ignore IPv6 for now, since it isn't implemented anyway
2224 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2225 addr.nTime = nNow - 5 * 24 * 60 * 60;
2226 AddAddress(addr, 2 * 60 * 60, &addrDB);
2227 pfrom->AddAddressKnown(addr);
2228 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2230 // Relay to a limited number of other nodes
2231 CRITICAL_BLOCK(cs_vNodes)
2233 // Use deterministic randomness to send to the same nodes for 24 hours
2234 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2235 static uint256 hashSalt;
2237 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2238 int64 hashAddr = addr.GetHash();
2239 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2240 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2241 multimap<uint256, CNode*> mapMix;
2242 BOOST_FOREACH(CNode* pnode, vNodes)
2244 if (pnode->nVersion < 31402)
2246 unsigned int nPointer;
2247 memcpy(&nPointer, &pnode, sizeof(nPointer));
2248 uint256 hashKey = hashRand ^ nPointer;
2249 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2250 mapMix.insert(make_pair(hashKey, pnode));
2252 int nRelayNodes = 2;
2253 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2254 ((*mi).second)->PushAddress(addr);
2258 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2259 if (vAddr.size() < 1000)
2260 pfrom->fGetAddr = false;
2264 else if (strCommand == "inv")
2268 if (vInv.size() > 50000)
2270 pfrom->Misbehaving(20);
2271 return error("message inv size() = %d", vInv.size());
2275 BOOST_FOREACH(const CInv& inv, vInv)
2279 pfrom->AddInventoryKnown(inv);
2281 bool fAlreadyHave = AlreadyHave(txdb, inv);
2283 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2287 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2288 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2290 // Track requests for our stuff
2291 Inventory(inv.hash);
2296 else if (strCommand == "getdata")
2300 if (vInv.size() > 50000)
2302 pfrom->Misbehaving(20);
2303 return error("message getdata size() = %d", vInv.size());
2306 BOOST_FOREACH(const CInv& inv, vInv)
2310 printf("received getdata for: %s\n", inv.ToString().c_str());
2312 if (inv.type == MSG_BLOCK)
2314 // Send block from disk
2315 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2316 if (mi != mapBlockIndex.end())
2319 block.ReadFromDisk((*mi).second);
2320 pfrom->PushMessage("block", block);
2322 // Trigger them to send a getblocks request for the next batch of inventory
2323 if (inv.hash == pfrom->hashContinue)
2325 // Bypass PushInventory, this must send even if redundant,
2326 // and we want it right after the last block so they don't
2327 // wait for other stuff first.
2329 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2330 pfrom->PushMessage("inv", vInv);
2331 pfrom->hashContinue = 0;
2335 else if (inv.IsKnownType())
2337 // Send stream from relay memory
2338 CRITICAL_BLOCK(cs_mapRelay)
2340 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2341 if (mi != mapRelay.end())
2342 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2346 // Track requests for our stuff
2347 Inventory(inv.hash);
2352 else if (strCommand == "getblocks")
2354 CBlockLocator locator;
2356 vRecv >> locator >> hashStop;
2358 // Find the last block the caller has in the main chain
2359 CBlockIndex* pindex = locator.GetBlockIndex();
2361 // Send the rest of the chain
2363 pindex = pindex->pnext;
2364 int nLimit = 500 + locator.GetDistanceBack();
2365 unsigned int nBytes = 0;
2366 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2367 for (; pindex; pindex = pindex->pnext)
2369 if (pindex->GetBlockHash() == hashStop)
2371 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2374 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2376 block.ReadFromDisk(pindex, true);
2377 nBytes += block.GetSerializeSize(SER_NETWORK);
2378 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2380 // When this block is requested, we'll send an inv that'll make them
2381 // getblocks the next batch of inventory.
2382 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2383 pfrom->hashContinue = pindex->GetBlockHash();
2390 else if (strCommand == "getheaders")
2392 CBlockLocator locator;
2394 vRecv >> locator >> hashStop;
2396 CBlockIndex* pindex = NULL;
2397 if (locator.IsNull())
2399 // If locator is null, return the hashStop block
2400 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2401 if (mi == mapBlockIndex.end())
2403 pindex = (*mi).second;
2407 // Find the last block the caller has in the main chain
2408 pindex = locator.GetBlockIndex();
2410 pindex = pindex->pnext;
2413 vector<CBlock> vHeaders;
2414 int nLimit = 2000 + locator.GetDistanceBack();
2415 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2416 for (; pindex; pindex = pindex->pnext)
2418 vHeaders.push_back(pindex->GetBlockHeader());
2419 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2422 pfrom->PushMessage("headers", vHeaders);
2426 else if (strCommand == "tx")
2428 vector<uint256> vWorkQueue;
2429 CDataStream vMsg(vRecv);
2433 CInv inv(MSG_TX, tx.GetHash());
2434 pfrom->AddInventoryKnown(inv);
2436 bool fMissingInputs = false;
2437 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2439 SyncWithWallets(tx, NULL, true);
2440 RelayMessage(inv, vMsg);
2441 mapAlreadyAskedFor.erase(inv);
2442 vWorkQueue.push_back(inv.hash);
2444 // Recursively process any orphan transactions that depended on this one
2445 for (int i = 0; i < vWorkQueue.size(); i++)
2447 uint256 hashPrev = vWorkQueue[i];
2448 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2449 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2452 const CDataStream& vMsg = *((*mi).second);
2454 CDataStream(vMsg) >> tx;
2455 CInv inv(MSG_TX, tx.GetHash());
2457 if (tx.AcceptToMemoryPool(true))
2459 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2460 SyncWithWallets(tx, NULL, true);
2461 RelayMessage(inv, vMsg);
2462 mapAlreadyAskedFor.erase(inv);
2463 vWorkQueue.push_back(inv.hash);
2468 BOOST_FOREACH(uint256 hash, vWorkQueue)
2469 EraseOrphanTx(hash);
2471 else if (fMissingInputs)
2473 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2476 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2480 else if (strCommand == "block")
2485 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2488 CInv inv(MSG_BLOCK, block.GetHash());
2489 pfrom->AddInventoryKnown(inv);
2491 if (ProcessBlock(pfrom, &block))
2492 mapAlreadyAskedFor.erase(inv);
2493 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2497 else if (strCommand == "getaddr")
2499 // Nodes rebroadcast an addr every 24 hours
2500 pfrom->vAddrToSend.clear();
2501 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2502 CRITICAL_BLOCK(cs_mapAddresses)
2504 unsigned int nCount = 0;
2505 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2507 const CAddress& addr = item.second;
2508 if (addr.nTime > nSince)
2511 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2513 const CAddress& addr = item.second;
2514 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2515 pfrom->PushAddress(addr);
2521 else if (strCommand == "checkorder")
2526 if (!GetBoolArg("-allowreceivebyip"))
2528 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2535 /// we have a chance to check the order here
2537 // Keep giving the same key to the same ip until they use it
2538 if (!mapReuseKey.count(pfrom->addr))
2539 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2541 // Send back approval of order and pubkey to use
2542 CScript scriptPubKey;
2543 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2544 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2548 else if (strCommand == "reply")
2553 CRequestTracker tracker;
2554 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2556 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2557 if (mi != pfrom->mapRequests.end())
2559 tracker = (*mi).second;
2560 pfrom->mapRequests.erase(mi);
2563 if (!tracker.IsNull())
2564 tracker.fn(tracker.param1, vRecv);
2568 else if (strCommand == "ping")
2573 else if (strCommand == "alert")
2578 if (alert.ProcessAlert())
2581 pfrom->setKnown.insert(alert.GetHash());
2582 CRITICAL_BLOCK(cs_vNodes)
2583 BOOST_FOREACH(CNode* pnode, vNodes)
2584 alert.RelayTo(pnode);
2591 // Ignore unknown commands for extensibility
2595 // Update the last seen time for this node's address
2596 if (pfrom->fNetworkNode)
2597 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2598 AddressCurrentlyConnected(pfrom->addr);
2604 bool ProcessMessages(CNode* pfrom)
2606 CDataStream& vRecv = pfrom->vRecv;
2610 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2614 // (4) message start
2623 // Scan for message start
2624 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2625 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2626 if (vRecv.end() - pstart < nHeaderSize)
2628 if (vRecv.size() > nHeaderSize)
2630 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2631 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2635 if (pstart - vRecv.begin() > 0)
2636 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2637 vRecv.erase(vRecv.begin(), pstart);
2640 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2645 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2648 string strCommand = hdr.GetCommand();
2651 unsigned int nMessageSize = hdr.nMessageSize;
2652 if (nMessageSize > MAX_SIZE)
2654 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2657 if (nMessageSize > vRecv.size())
2659 // Rewind and wait for rest of message
2660 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2665 if (vRecv.GetVersion() >= 209)
2667 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2668 unsigned int nChecksum = 0;
2669 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2670 if (nChecksum != hdr.nChecksum)
2672 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2673 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2678 // Copy message to its own buffer
2679 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2680 vRecv.ignore(nMessageSize);
2686 CRITICAL_BLOCK(cs_main)
2687 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2691 catch (std::ios_base::failure& e)
2693 if (strstr(e.what(), "end of data"))
2695 // Allow exceptions from underlength message on vRecv
2696 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());
2698 else if (strstr(e.what(), "size too large"))
2700 // Allow exceptions from overlong size
2701 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2705 PrintExceptionContinue(&e, "ProcessMessage()");
2708 catch (std::exception& e) {
2709 PrintExceptionContinue(&e, "ProcessMessage()");
2711 PrintExceptionContinue(NULL, "ProcessMessage()");
2715 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2723 bool SendMessages(CNode* pto, bool fSendTrickle)
2725 CRITICAL_BLOCK(cs_main)
2727 // Don't send anything until we get their version message
2728 if (pto->nVersion == 0)
2732 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2733 pto->PushMessage("ping");
2735 // Resend wallet transactions that haven't gotten in a block yet
2736 ResendWalletTransactions();
2738 // Address refresh broadcast
2739 static int64 nLastRebroadcast;
2740 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2742 CRITICAL_BLOCK(cs_vNodes)
2744 BOOST_FOREACH(CNode* pnode, vNodes)
2746 // Periodically clear setAddrKnown to allow refresh broadcasts
2747 if (nLastRebroadcast)
2748 pnode->setAddrKnown.clear();
2750 // Rebroadcast our address
2751 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2753 CAddress addr(addrLocalHost);
2754 addr.nTime = GetAdjustedTime();
2755 pnode->PushAddress(addr);
2759 nLastRebroadcast = GetTime();
2762 // Clear out old addresses periodically so it's not too much work at once
2763 static int64 nLastClear;
2764 if (nLastClear == 0)
2765 nLastClear = GetTime();
2766 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2768 nLastClear = GetTime();
2769 CRITICAL_BLOCK(cs_mapAddresses)
2772 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2773 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2774 mi != mapAddresses.end();)
2776 const CAddress& addr = (*mi).second;
2777 if (addr.nTime < nSince)
2779 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2781 addrdb.EraseAddress(addr);
2782 mapAddresses.erase(mi++);
2796 vector<CAddress> vAddr;
2797 vAddr.reserve(pto->vAddrToSend.size());
2798 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2800 // returns true if wasn't already contained in the set
2801 if (pto->setAddrKnown.insert(addr).second)
2803 vAddr.push_back(addr);
2804 // receiver rejects addr messages larger than 1000
2805 if (vAddr.size() >= 1000)
2807 pto->PushMessage("addr", vAddr);
2812 pto->vAddrToSend.clear();
2814 pto->PushMessage("addr", vAddr);
2819 // Message: inventory
2822 vector<CInv> vInvWait;
2823 CRITICAL_BLOCK(pto->cs_inventory)
2825 vInv.reserve(pto->vInventoryToSend.size());
2826 vInvWait.reserve(pto->vInventoryToSend.size());
2827 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2829 if (pto->setInventoryKnown.count(inv))
2832 // trickle out tx inv to protect privacy
2833 if (inv.type == MSG_TX && !fSendTrickle)
2835 // 1/4 of tx invs blast to all immediately
2836 static uint256 hashSalt;
2838 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2839 uint256 hashRand = inv.hash ^ hashSalt;
2840 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2841 bool fTrickleWait = ((hashRand & 3) != 0);
2843 // always trickle our own transactions
2847 if (GetTransaction(inv.hash, wtx))
2849 fTrickleWait = true;
2854 vInvWait.push_back(inv);
2859 // returns true if wasn't already contained in the set
2860 if (pto->setInventoryKnown.insert(inv).second)
2862 vInv.push_back(inv);
2863 if (vInv.size() >= 1000)
2865 pto->PushMessage("inv", vInv);
2870 pto->vInventoryToSend = vInvWait;
2873 pto->PushMessage("inv", vInv);
2879 vector<CInv> vGetData;
2880 int64 nNow = GetTime() * 1000000;
2882 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2884 const CInv& inv = (*pto->mapAskFor.begin()).second;
2885 if (!AlreadyHave(txdb, inv))
2887 printf("sending getdata: %s\n", inv.ToString().c_str());
2888 vGetData.push_back(inv);
2889 if (vGetData.size() >= 1000)
2891 pto->PushMessage("getdata", vGetData);
2895 mapAlreadyAskedFor[inv] = nNow;
2896 pto->mapAskFor.erase(pto->mapAskFor.begin());
2898 if (!vGetData.empty())
2899 pto->PushMessage("getdata", vGetData);
2918 //////////////////////////////////////////////////////////////////////////////
2923 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2925 unsigned char* pdata = (unsigned char*)pbuffer;
2926 unsigned int blocks = 1 + ((len + 8) / 64);
2927 unsigned char* pend = pdata + 64 * blocks;
2928 memset(pdata + len, 0, 64 * blocks - len);
2930 unsigned int bits = len * 8;
2931 pend[-1] = (bits >> 0) & 0xff;
2932 pend[-2] = (bits >> 8) & 0xff;
2933 pend[-3] = (bits >> 16) & 0xff;
2934 pend[-4] = (bits >> 24) & 0xff;
2938 static const unsigned int pSHA256InitState[8] =
2939 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2941 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2944 unsigned char data[64];
2948 for (int i = 0; i < 16; i++)
2949 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2951 for (int i = 0; i < 8; i++)
2952 ctx.h[i] = ((uint32_t*)pinit)[i];
2954 SHA256_Update(&ctx, data, sizeof(data));
2955 for (int i = 0; i < 8; i++)
2956 ((uint32_t*)pstate)[i] = ctx.h[i];
2960 // ScanHash scans nonces looking for a hash with at least some zero bits.
2961 // It operates on big endian data. Caller does the byte reversing.
2962 // All input buffers are 16-byte aligned. nNonce is usually preserved
2963 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2964 // the block is rebuilt and nNonce starts over at zero.
2966 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2968 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2972 // Hash pdata using pmidstate as the starting state into
2973 // preformatted buffer phash1, then hash phash1 into phash
2975 SHA256Transform(phash1, pdata, pmidstate);
2976 SHA256Transform(phash, phash1, pSHA256InitState);
2978 // Return the nonce if the hash has at least some zero bits,
2979 // caller will check if it has enough to reach the target
2980 if (((unsigned short*)phash)[14] == 0)
2983 // If nothing found after trying for a while, return -1
2984 if ((nNonce & 0xffff) == 0)
2986 nHashesDone = 0xffff+1;
2992 // Some explaining would be appreciated
2997 set<uint256> setDependsOn;
3000 COrphan(CTransaction* ptxIn)
3008 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3009 BOOST_FOREACH(uint256 hash, setDependsOn)
3010 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3015 uint64 nLastBlockTx = 0;
3016 uint64 nLastBlockSize = 0;
3018 CBlock* CreateNewBlock(CReserveKey& reservekey)
3020 CBlockIndex* pindexPrev = pindexBest;
3023 auto_ptr<CBlock> pblock(new CBlock());
3027 // Create coinbase tx
3029 txNew.vin.resize(1);
3030 txNew.vin[0].prevout.SetNull();
3031 txNew.vout.resize(1);
3032 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3034 // Add our coinbase tx as first transaction
3035 pblock->vtx.push_back(txNew);
3037 // Collect memory pool transactions into the block
3039 CRITICAL_BLOCK(cs_main)
3040 CRITICAL_BLOCK(cs_mapTransactions)
3044 // Priority order to process transactions
3045 list<COrphan> vOrphan; // list memory doesn't move
3046 map<uint256, vector<COrphan*> > mapDependers;
3047 multimap<double, CTransaction*> mapPriority;
3048 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3050 CTransaction& tx = (*mi).second;
3051 if (tx.IsCoinBase() || !tx.IsFinal())
3054 COrphan* porphan = NULL;
3055 double dPriority = 0;
3056 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3058 // Read prev transaction
3059 CTransaction txPrev;
3061 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3063 // Has to wait for dependencies
3066 // Use list for automatic deletion
3067 vOrphan.push_back(COrphan(&tx));
3068 porphan = &vOrphan.back();
3070 mapDependers[txin.prevout.hash].push_back(porphan);
3071 porphan->setDependsOn.insert(txin.prevout.hash);
3074 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3076 // Read block header
3077 int nConf = txindex.GetDepthInMainChain();
3079 dPriority += (double)nValueIn * nConf;
3081 if (fDebug && GetBoolArg("-printpriority"))
3082 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3085 // Priority is sum(valuein * age) / txsize
3086 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3089 porphan->dPriority = dPriority;
3091 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3093 if (fDebug && GetBoolArg("-printpriority"))
3095 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3102 // Collect transactions into block
3103 map<uint256, CTxIndex> mapTestPool;
3104 uint64 nBlockSize = 1000;
3105 uint64 nBlockTx = 0;
3106 int nBlockSigOps = 100;
3107 while (!mapPriority.empty())
3109 // Take highest priority transaction off priority queue
3110 double dPriority = -(*mapPriority.begin()).first;
3111 CTransaction& tx = *(*mapPriority.begin()).second;
3112 mapPriority.erase(mapPriority.begin());
3115 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3116 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3119 // Legacy limits on sigOps:
3120 int nTxSigOps = tx.GetLegacySigOpCount();
3121 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3124 // Transaction fee required depends on block size
3125 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3126 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3128 // Connecting shouldn't fail due to dependency on other memory pool transactions
3129 // because we're already processing them in order of dependency
3130 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3131 MapPrevTx mapInputs;
3133 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3136 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3137 if (nTxFees < nMinFee)
3140 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3141 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3144 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3146 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3147 swap(mapTestPool, mapTestPoolTmp);
3150 pblock->vtx.push_back(tx);
3151 nBlockSize += nTxSize;
3153 nBlockSigOps += nTxSigOps;
3156 // Add transactions that depend on this one to the priority queue
3157 uint256 hash = tx.GetHash();
3158 if (mapDependers.count(hash))
3160 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3162 if (!porphan->setDependsOn.empty())
3164 porphan->setDependsOn.erase(hash);
3165 if (porphan->setDependsOn.empty())
3166 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3172 nLastBlockTx = nBlockTx;
3173 nLastBlockSize = nBlockSize;
3174 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3177 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3180 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3181 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3182 pblock->UpdateTime(pindexPrev);
3183 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3186 return pblock.release();
3190 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3192 // Update nExtraNonce
3193 static uint256 hashPrevBlock;
3194 if (hashPrevBlock != pblock->hashPrevBlock)
3197 hashPrevBlock = pblock->hashPrevBlock;
3200 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3201 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3203 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3207 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3210 // Prebuild hash buffers
3217 uint256 hashPrevBlock;
3218 uint256 hashMerkleRoot;
3221 unsigned int nNonce;
3224 unsigned char pchPadding0[64];
3226 unsigned char pchPadding1[64];
3229 memset(&tmp, 0, sizeof(tmp));
3231 tmp.block.nVersion = pblock->nVersion;
3232 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3233 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3234 tmp.block.nTime = pblock->nTime;
3235 tmp.block.nBits = pblock->nBits;
3236 tmp.block.nNonce = pblock->nNonce;
3238 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3239 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3241 // Byte swap all the input buffer
3242 for (int i = 0; i < sizeof(tmp)/4; i++)
3243 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3245 // Precalc the first half of the first hash, which stays constant
3246 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3248 memcpy(pdata, &tmp.block, 128);
3249 memcpy(phash1, &tmp.hash1, 64);
3253 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3255 uint256 hash = pblock->GetHash();
3256 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3258 if (hash > hashTarget)
3262 printf("BitcoinMiner:\n");
3263 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3265 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3266 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3269 CRITICAL_BLOCK(cs_main)
3271 if (pblock->hashPrevBlock != hashBestChain)
3272 return error("BitcoinMiner : generated block is stale");
3274 // Remove key from key pool
3275 reservekey.KeepKey();
3277 // Track how many getdata requests this block gets
3278 CRITICAL_BLOCK(wallet.cs_wallet)
3279 wallet.mapRequestCount[pblock->GetHash()] = 0;
3281 // Process this block the same as if we had received it from another node
3282 if (!ProcessBlock(NULL, pblock))
3283 return error("BitcoinMiner : ProcessBlock, block not accepted");
3289 void static ThreadBitcoinMiner(void* parg);
3291 void static BitcoinMiner(CWallet *pwallet)
3293 printf("BitcoinMiner started\n");
3294 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3296 // Each thread has its own key and counter
3297 CReserveKey reservekey(pwallet);
3298 unsigned int nExtraNonce = 0;
3300 while (fGenerateBitcoins)
3302 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3306 while (vNodes.empty() || IsInitialBlockDownload())
3311 if (!fGenerateBitcoins)
3319 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3320 CBlockIndex* pindexPrev = pindexBest;
3322 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3325 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3327 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3331 // Prebuild hash buffers
3333 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3334 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3335 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3337 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3339 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3340 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3341 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3347 int64 nStart = GetTime();
3348 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3350 uint256& hash = *alignup<16>(hashbuf);
3353 unsigned int nHashesDone = 0;
3354 unsigned int nNonceFound;
3357 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3358 (char*)&hash, nHashesDone);
3360 // Check if something found
3361 if (nNonceFound != -1)
3363 for (int i = 0; i < sizeof(hash)/4; i++)
3364 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3366 if (hash <= hashTarget)
3369 pblock->nNonce = ByteReverse(nNonceFound);
3370 assert(hash == pblock->GetHash());
3372 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3373 CheckWork(pblock.get(), *pwalletMain, reservekey);
3374 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3380 static int64 nHashCounter;
3381 if (nHPSTimerStart == 0)
3383 nHPSTimerStart = GetTimeMillis();
3387 nHashCounter += nHashesDone;
3388 if (GetTimeMillis() - nHPSTimerStart > 4000)
3390 static CCriticalSection cs;
3393 if (GetTimeMillis() - nHPSTimerStart > 4000)
3395 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3396 nHPSTimerStart = GetTimeMillis();
3398 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3399 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3400 static int64 nLogTime;
3401 if (GetTime() - nLogTime > 30 * 60)
3403 nLogTime = GetTime();
3404 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3405 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3411 // Check for stop or if block needs to be rebuilt
3414 if (!fGenerateBitcoins)
3416 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3420 if (nBlockNonce >= 0xffff0000)
3422 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3424 if (pindexPrev != pindexBest)
3427 // Update nTime every few seconds
3428 pblock->UpdateTime(pindexPrev);
3429 nBlockTime = ByteReverse(pblock->nTime);
3432 // Changing pblock->nTime can change work required on testnet:
3433 nBlockBits = ByteReverse(pblock->nBits);
3434 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3440 void static ThreadBitcoinMiner(void* parg)
3442 CWallet* pwallet = (CWallet*)parg;
3445 vnThreadsRunning[THREAD_MINER]++;
3446 BitcoinMiner(pwallet);
3447 vnThreadsRunning[THREAD_MINER]--;
3449 catch (std::exception& e) {
3450 vnThreadsRunning[THREAD_MINER]--;
3451 PrintException(&e, "ThreadBitcoinMiner()");
3453 vnThreadsRunning[THREAD_MINER]--;
3454 PrintException(NULL, "ThreadBitcoinMiner()");
3456 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3458 if (vnThreadsRunning[THREAD_MINER] == 0)
3460 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3464 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3466 if (fGenerateBitcoins != fGenerate)
3468 fGenerateBitcoins = fGenerate;
3469 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3472 if (fGenerateBitcoins)
3474 int nProcessors = boost::thread::hardware_concurrency();
3475 printf("%d processors\n", nProcessors);
3476 if (nProcessors < 1)
3478 if (fLimitProcessors && nProcessors > nLimitProcessors)
3479 nProcessors = nLimitProcessors;
3480 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3481 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3482 for (int i = 0; i < nAddThreads; i++)
3484 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3485 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");