1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include <boost/algorithm/string/replace.hpp>
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 // Name of client reported in the 'version' message. Report the same name
22 // for both bitcoind and bitcoin-qt, to make it harder for attackers to
23 // target servers or GUI users specifically.
24 const std::string CLIENT_NAME("Satoshi");
26 CCriticalSection cs_setpwalletRegistered;
27 set<CWallet*> setpwalletRegistered;
29 CCriticalSection cs_main;
31 static map<uint256, CTransaction> mapTransactions;
32 CCriticalSection cs_mapTransactions;
33 unsigned int nTransactionsUpdated = 0;
34 map<COutPoint, CInPoint> mapNextTx;
36 map<uint256, CBlockIndex*> mapBlockIndex;
37 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
38 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
39 CBlockIndex* pindexGenesisBlock = NULL;
41 CBigNum bnBestChainWork = 0;
42 CBigNum bnBestInvalidWork = 0;
43 uint256 hashBestChain = 0;
44 CBlockIndex* pindexBest = NULL;
45 int64 nTimeBestReceived = 0;
47 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
49 map<uint256, CBlock*> mapOrphanBlocks;
50 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
52 map<uint256, CDataStream*> mapOrphanTransactions;
53 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
55 // Constant stuff for coinbase transactions we create:
56 CScript COINBASE_FLAGS;
58 const string strMessageMagic = "Bitcoin Signed Message:\n";
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))
1142 // only during transition phase for P2SH: do not invoke anti-DoS code for
1143 // potentially old clients relaying bad P2SH transactions
1144 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1145 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1147 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1151 // Mark outpoints as spent
1152 txindex.vSpent[prevout.n] = posThisTx;
1155 if (fBlock || fMiner)
1157 mapTestPool[prevout.hash] = txindex;
1161 if (nValueIn < GetValueOut())
1162 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1164 // Tally transaction fees
1165 int64 nTxFee = nValueIn - GetValueOut();
1167 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1169 if (!MoneyRange(nFees))
1170 return DoS(100, error("ConnectInputs() : nFees out of range"));
1177 bool CTransaction::ClientConnectInputs()
1182 // Take over previous transactions' spent pointers
1183 CRITICAL_BLOCK(cs_mapTransactions)
1186 for (int i = 0; i < vin.size(); i++)
1188 // Get prev tx from single transactions in memory
1189 COutPoint prevout = vin[i].prevout;
1190 if (!mapTransactions.count(prevout.hash))
1192 CTransaction& txPrev = mapTransactions[prevout.hash];
1194 if (prevout.n >= txPrev.vout.size())
1198 if (!VerifySignature(txPrev, *this, i, true, 0))
1199 return error("ConnectInputs() : VerifySignature failed");
1201 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1202 ///// this has to go away now that posNext is gone
1203 // // Check for conflicts
1204 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1205 // return error("ConnectInputs() : prev tx already used");
1207 // // Flag outpoints as used
1208 // txPrev.vout[prevout.n].posNext = posThisTx;
1210 nValueIn += txPrev.vout[prevout.n].nValue;
1212 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1213 return error("ClientConnectInputs() : txin values out of range");
1215 if (GetValueOut() > nValueIn)
1225 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1227 // Disconnect in reverse order
1228 for (int i = vtx.size()-1; i >= 0; i--)
1229 if (!vtx[i].DisconnectInputs(txdb))
1232 // Update block index on disk without changing it in memory.
1233 // The memory index structure will be changed after the db commits.
1236 CDiskBlockIndex blockindexPrev(pindex->pprev);
1237 blockindexPrev.hashNext = 0;
1238 if (!txdb.WriteBlockIndex(blockindexPrev))
1239 return error("DisconnectBlock() : WriteBlockIndex failed");
1245 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1247 // Check it again in case a previous version let a bad block in
1251 // To avoid being on the short end of a block-chain split,
1252 // don't do secondary validation of pay-to-script-hash transactions
1253 // until blocks with timestamps after paytoscripthashtime (see init.cpp for default).
1254 // This code can be removed once a super-majority of the network has upgraded.
1255 int64 nEvalSwitchTime = GetArg("-paytoscripthashtime", std::numeric_limits<int64_t>::max());
1256 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1258 //// issue here: it doesn't know the version
1259 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1261 map<uint256, CTxIndex> mapQueuedChanges;
1264 BOOST_FOREACH(CTransaction& tx, vtx)
1266 nSigOps += tx.GetLegacySigOpCount();
1267 if (nSigOps > MAX_BLOCK_SIGOPS)
1268 return DoS(100, error("ConnectBlock() : too many sigops"));
1270 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1271 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1273 MapPrevTx mapInputs;
1274 if (!tx.IsCoinBase())
1277 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1280 if (fStrictPayToScriptHash)
1282 // Add in sigops done by pay-to-script-hash inputs;
1283 // this is to prevent a "rogue miner" from creating
1284 // an incredibly-expensive-to-validate block.
1285 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1286 if (nSigOps > MAX_BLOCK_SIGOPS)
1287 return DoS(100, error("ConnectBlock() : too many sigops"));
1290 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1292 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1296 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1299 // Write queued txindex changes
1300 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1302 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1303 return error("ConnectBlock() : UpdateTxIndex failed");
1306 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1309 // Update block index on disk without changing it in memory.
1310 // The memory index structure will be changed after the db commits.
1313 CDiskBlockIndex blockindexPrev(pindex->pprev);
1314 blockindexPrev.hashNext = pindex->GetBlockHash();
1315 if (!txdb.WriteBlockIndex(blockindexPrev))
1316 return error("ConnectBlock() : WriteBlockIndex failed");
1319 // Watch for transactions paying to me
1320 BOOST_FOREACH(CTransaction& tx, vtx)
1321 SyncWithWallets(tx, this, true);
1326 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1328 printf("REORGANIZE\n");
1331 CBlockIndex* pfork = pindexBest;
1332 CBlockIndex* plonger = pindexNew;
1333 while (pfork != plonger)
1335 while (plonger->nHeight > pfork->nHeight)
1336 if (!(plonger = plonger->pprev))
1337 return error("Reorganize() : plonger->pprev is null");
1338 if (pfork == plonger)
1340 if (!(pfork = pfork->pprev))
1341 return error("Reorganize() : pfork->pprev is null");
1344 // List of what to disconnect
1345 vector<CBlockIndex*> vDisconnect;
1346 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1347 vDisconnect.push_back(pindex);
1349 // List of what to connect
1350 vector<CBlockIndex*> vConnect;
1351 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1352 vConnect.push_back(pindex);
1353 reverse(vConnect.begin(), vConnect.end());
1355 // Disconnect shorter branch
1356 vector<CTransaction> vResurrect;
1357 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1360 if (!block.ReadFromDisk(pindex))
1361 return error("Reorganize() : ReadFromDisk for disconnect failed");
1362 if (!block.DisconnectBlock(txdb, pindex))
1363 return error("Reorganize() : DisconnectBlock failed");
1365 // Queue memory transactions to resurrect
1366 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1367 if (!tx.IsCoinBase())
1368 vResurrect.push_back(tx);
1371 // Connect longer branch
1372 vector<CTransaction> vDelete;
1373 for (int i = 0; i < vConnect.size(); i++)
1375 CBlockIndex* pindex = vConnect[i];
1377 if (!block.ReadFromDisk(pindex))
1378 return error("Reorganize() : ReadFromDisk for connect failed");
1379 if (!block.ConnectBlock(txdb, pindex))
1383 return error("Reorganize() : ConnectBlock failed");
1386 // Queue memory transactions to delete
1387 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1388 vDelete.push_back(tx);
1390 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1391 return error("Reorganize() : WriteHashBestChain failed");
1393 // Make sure it's successfully written to disk before changing memory structure
1394 if (!txdb.TxnCommit())
1395 return error("Reorganize() : TxnCommit failed");
1397 // Disconnect shorter branch
1398 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1400 pindex->pprev->pnext = NULL;
1402 // Connect longer branch
1403 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1405 pindex->pprev->pnext = pindex;
1407 // Resurrect memory transactions that were in the disconnected branch
1408 BOOST_FOREACH(CTransaction& tx, vResurrect)
1409 tx.AcceptToMemoryPool(txdb, false);
1411 // Delete redundant memory transactions that are in the connected branch
1412 BOOST_FOREACH(CTransaction& tx, vDelete)
1413 tx.RemoveFromMemoryPool();
1415 printf("REORGANIZE: Disconnected %i blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1416 printf("REORGANIZE: Connected %i blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1423 runCommand(std::string strCommand)
1425 int nErr = ::system(strCommand.c_str());
1427 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1430 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1432 uint256 hash = GetHash();
1435 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1437 txdb.WriteHashBestChain(hash);
1438 if (!txdb.TxnCommit())
1439 return error("SetBestChain() : TxnCommit failed");
1440 pindexGenesisBlock = pindexNew;
1442 else if (hashPrevBlock == hashBestChain)
1444 // Adding to current best branch
1445 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1448 InvalidChainFound(pindexNew);
1449 return error("SetBestChain() : ConnectBlock failed");
1451 if (!txdb.TxnCommit())
1452 return error("SetBestChain() : TxnCommit failed");
1454 // Add to current best branch
1455 pindexNew->pprev->pnext = pindexNew;
1457 // Delete redundant memory transactions
1458 BOOST_FOREACH(CTransaction& tx, vtx)
1459 tx.RemoveFromMemoryPool();
1464 if (!Reorganize(txdb, pindexNew))
1467 InvalidChainFound(pindexNew);
1468 return error("SetBestChain() : Reorganize failed");
1472 // Update best block in wallet (so we can detect restored wallets)
1473 bool fIsInitialDownload = IsInitialBlockDownload();
1474 if (!fIsInitialDownload)
1476 const CBlockLocator locator(pindexNew);
1477 ::SetBestChain(locator);
1481 hashBestChain = hash;
1482 pindexBest = pindexNew;
1483 nBestHeight = pindexBest->nHeight;
1484 bnBestChainWork = pindexNew->bnChainWork;
1485 nTimeBestReceived = GetTime();
1486 nTransactionsUpdated++;
1487 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1489 std::string strCmd = GetArg("-blocknotify", "");
1491 if (!fIsInitialDownload && !strCmd.empty())
1493 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1494 boost::thread t(runCommand, strCmd); // thread runs free
1501 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1503 // Check for duplicate
1504 uint256 hash = GetHash();
1505 if (mapBlockIndex.count(hash))
1506 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1508 // Construct new block index object
1509 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1511 return error("AddToBlockIndex() : new CBlockIndex failed");
1512 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1513 pindexNew->phashBlock = &((*mi).first);
1514 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1515 if (miPrev != mapBlockIndex.end())
1517 pindexNew->pprev = (*miPrev).second;
1518 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1520 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1524 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1525 if (!txdb.TxnCommit())
1529 if (pindexNew->bnChainWork > bnBestChainWork)
1530 if (!SetBestChain(txdb, pindexNew))
1535 if (pindexNew == pindexBest)
1537 // Notify UI to display prev block's coinbase if it was ours
1538 static uint256 hashPrevBestCoinBase;
1539 UpdatedTransaction(hashPrevBestCoinBase);
1540 hashPrevBestCoinBase = vtx[0].GetHash();
1550 bool CBlock::CheckBlock() const
1552 // These are checks that are independent of context
1553 // that can be verified before saving an orphan block.
1556 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1557 return DoS(100, error("CheckBlock() : size limits failed"));
1559 // Check proof of work matches claimed amount
1560 if (!CheckProofOfWork(GetHash(), nBits))
1561 return DoS(50, error("CheckBlock() : proof of work failed"));
1564 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1565 return error("CheckBlock() : block timestamp too far in the future");
1567 // First transaction must be coinbase, the rest must not be
1568 if (vtx.empty() || !vtx[0].IsCoinBase())
1569 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1570 for (int i = 1; i < vtx.size(); i++)
1571 if (vtx[i].IsCoinBase())
1572 return DoS(100, error("CheckBlock() : more than one coinbase"));
1574 // Check transactions
1575 BOOST_FOREACH(const CTransaction& tx, vtx)
1576 if (!tx.CheckTransaction())
1577 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1580 BOOST_FOREACH(const CTransaction& tx, vtx)
1582 nSigOps += tx.GetLegacySigOpCount();
1584 if (nSigOps > MAX_BLOCK_SIGOPS)
1585 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1588 if (hashMerkleRoot != BuildMerkleTree())
1589 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1594 bool CBlock::AcceptBlock()
1596 // Check for duplicate
1597 uint256 hash = GetHash();
1598 if (mapBlockIndex.count(hash))
1599 return error("AcceptBlock() : block already in mapBlockIndex");
1601 // Get prev block index
1602 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1603 if (mi == mapBlockIndex.end())
1604 return DoS(10, error("AcceptBlock() : prev block not found"));
1605 CBlockIndex* pindexPrev = (*mi).second;
1606 int nHeight = pindexPrev->nHeight+1;
1608 // Check proof of work
1609 if (nBits != GetNextWorkRequired(pindexPrev, this))
1610 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1612 // Check timestamp against prev
1613 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1614 return error("AcceptBlock() : block's timestamp is too early");
1616 // Check that all transactions are finalized
1617 BOOST_FOREACH(const CTransaction& tx, vtx)
1618 if (!tx.IsFinal(nHeight, GetBlockTime()))
1619 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1621 // Check that the block chain matches the known block chain up to a checkpoint
1622 if (!Checkpoints::CheckBlock(nHeight, hash))
1623 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1625 // Write block to history file
1626 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1627 return error("AcceptBlock() : out of disk space");
1628 unsigned int nFile = -1;
1629 unsigned int nBlockPos = 0;
1630 if (!WriteToDisk(nFile, nBlockPos))
1631 return error("AcceptBlock() : WriteToDisk failed");
1632 if (!AddToBlockIndex(nFile, nBlockPos))
1633 return error("AcceptBlock() : AddToBlockIndex failed");
1635 // Relay inventory, but don't relay old inventory during initial block download
1636 if (hashBestChain == hash)
1637 CRITICAL_BLOCK(cs_vNodes)
1638 BOOST_FOREACH(CNode* pnode, vNodes)
1639 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1640 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1645 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1647 // Check for duplicate
1648 uint256 hash = pblock->GetHash();
1649 if (mapBlockIndex.count(hash))
1650 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1651 if (mapOrphanBlocks.count(hash))
1652 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1654 // Preliminary checks
1655 if (!pblock->CheckBlock())
1656 return error("ProcessBlock() : CheckBlock FAILED");
1658 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1659 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1661 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1662 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1666 pfrom->Misbehaving(100);
1667 return error("ProcessBlock() : block with timestamp before last checkpoint");
1670 bnNewBlock.SetCompact(pblock->nBits);
1672 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1673 if (bnNewBlock > bnRequired)
1676 pfrom->Misbehaving(100);
1677 return error("ProcessBlock() : block with too little proof-of-work");
1682 // If don't already have its previous block, shunt it off to holding area until we get it
1683 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1685 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1686 CBlock* pblock2 = new CBlock(*pblock);
1687 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1688 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1690 // Ask this guy to fill in what we're missing
1692 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1697 if (!pblock->AcceptBlock())
1698 return error("ProcessBlock() : AcceptBlock FAILED");
1700 // Recursively process any orphan blocks that depended on this one
1701 vector<uint256> vWorkQueue;
1702 vWorkQueue.push_back(hash);
1703 for (int i = 0; i < vWorkQueue.size(); i++)
1705 uint256 hashPrev = vWorkQueue[i];
1706 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1707 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1710 CBlock* pblockOrphan = (*mi).second;
1711 if (pblockOrphan->AcceptBlock())
1712 vWorkQueue.push_back(pblockOrphan->GetHash());
1713 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1714 delete pblockOrphan;
1716 mapOrphanBlocksByPrev.erase(hashPrev);
1719 printf("ProcessBlock: ACCEPTED\n");
1730 bool CheckDiskSpace(uint64 nAdditionalBytes)
1732 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1734 // Check for 15MB because database could create another 10MB log file at any time
1735 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1738 string strMessage = _("Warning: Disk space is low ");
1739 strMiscWarning = strMessage;
1740 printf("*** %s\n", strMessage.c_str());
1741 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1742 CreateThread(Shutdown, NULL);
1748 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1752 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1755 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1757 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1766 static unsigned int nCurrentBlockFile = 1;
1768 FILE* AppendBlockFile(unsigned int& nFileRet)
1773 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1776 if (fseek(file, 0, SEEK_END) != 0)
1778 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1779 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1781 nFileRet = nCurrentBlockFile;
1785 nCurrentBlockFile++;
1789 bool LoadBlockIndex(bool fAllowNew)
1793 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1794 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1795 pchMessageStart[0] = 0xfa;
1796 pchMessageStart[1] = 0xbf;
1797 pchMessageStart[2] = 0xb5;
1798 pchMessageStart[3] = 0xda;
1805 if (!txdb.LoadBlockIndex())
1810 // Init with genesis block
1812 if (mapBlockIndex.empty())
1818 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1819 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1820 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1821 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1822 // vMerkleTree: 4a5e1e
1825 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1827 txNew.vin.resize(1);
1828 txNew.vout.resize(1);
1829 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1830 txNew.vout[0].nValue = 50 * COIN;
1831 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1833 block.vtx.push_back(txNew);
1834 block.hashPrevBlock = 0;
1835 block.hashMerkleRoot = block.BuildMerkleTree();
1837 block.nTime = 1231006505;
1838 block.nBits = 0x1d00ffff;
1839 block.nNonce = 2083236893;
1843 block.nTime = 1296688602;
1844 block.nBits = 0x1d07fff8;
1845 block.nNonce = 384568319;
1849 printf("%s\n", block.GetHash().ToString().c_str());
1850 printf("%s\n", hashGenesisBlock.ToString().c_str());
1851 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1852 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1854 assert(block.GetHash() == hashGenesisBlock);
1856 // Start new block file
1858 unsigned int nBlockPos;
1859 if (!block.WriteToDisk(nFile, nBlockPos))
1860 return error("LoadBlockIndex() : writing genesis block to disk failed");
1861 if (!block.AddToBlockIndex(nFile, nBlockPos))
1862 return error("LoadBlockIndex() : genesis block not accepted");
1870 void PrintBlockTree()
1872 // precompute tree structure
1873 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1874 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1876 CBlockIndex* pindex = (*mi).second;
1877 mapNext[pindex->pprev].push_back(pindex);
1879 //while (rand() % 3 == 0)
1880 // mapNext[pindex->pprev].push_back(pindex);
1883 vector<pair<int, CBlockIndex*> > vStack;
1884 vStack.push_back(make_pair(0, pindexGenesisBlock));
1887 while (!vStack.empty())
1889 int nCol = vStack.back().first;
1890 CBlockIndex* pindex = vStack.back().second;
1893 // print split or gap
1894 if (nCol > nPrevCol)
1896 for (int i = 0; i < nCol-1; i++)
1900 else if (nCol < nPrevCol)
1902 for (int i = 0; i < nCol; i++)
1909 for (int i = 0; i < nCol; i++)
1914 block.ReadFromDisk(pindex);
1915 printf("%d (%u,%u) %s %s tx %d",
1919 block.GetHash().ToString().substr(0,20).c_str(),
1920 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1923 PrintWallets(block);
1925 // put the main timechain first
1926 vector<CBlockIndex*>& vNext = mapNext[pindex];
1927 for (int i = 0; i < vNext.size(); i++)
1929 if (vNext[i]->pnext)
1931 swap(vNext[0], vNext[i]);
1937 for (int i = 0; i < vNext.size(); i++)
1938 vStack.push_back(make_pair(nCol+i, vNext[i]));
1951 //////////////////////////////////////////////////////////////////////////////
1956 map<uint256, CAlert> mapAlerts;
1957 CCriticalSection cs_mapAlerts;
1959 string GetWarnings(string strFor)
1962 string strStatusBar;
1964 if (GetBoolArg("-testsafemode"))
1967 // Misc warnings like out of disk space and clock is wrong
1968 if (strMiscWarning != "")
1971 strStatusBar = strMiscWarning;
1974 // Longer invalid proof-of-work chain
1975 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1978 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1982 CRITICAL_BLOCK(cs_mapAlerts)
1984 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1986 const CAlert& alert = item.second;
1987 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1989 nPriority = alert.nPriority;
1990 strStatusBar = alert.strStatusBar;
1995 if (strFor == "statusbar")
1996 return strStatusBar;
1997 else if (strFor == "rpc")
1999 assert(!"GetWarnings() : invalid parameter");
2003 bool CAlert::ProcessAlert()
2005 if (!CheckSignature())
2010 CRITICAL_BLOCK(cs_mapAlerts)
2012 // Cancel previous alerts
2013 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2015 const CAlert& alert = (*mi).second;
2018 printf("cancelling alert %d\n", alert.nID);
2019 mapAlerts.erase(mi++);
2021 else if (!alert.IsInEffect())
2023 printf("expiring alert %d\n", alert.nID);
2024 mapAlerts.erase(mi++);
2030 // Check if this alert has been cancelled
2031 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2033 const CAlert& alert = item.second;
2034 if (alert.Cancels(*this))
2036 printf("alert already cancelled by %d\n", alert.nID);
2042 mapAlerts.insert(make_pair(GetHash(), *this));
2045 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2057 //////////////////////////////////////////////////////////////////////////////
2063 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2067 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2068 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2070 // Don't know what it is, just say we already got one
2077 // The message start string is designed to be unlikely to occur in normal data.
2078 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2079 // a large 4-byte int at any alignment.
2080 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2083 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2085 static map<CService, vector<unsigned char> > mapReuseKey;
2086 RandAddSeedPerfmon();
2088 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2089 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2091 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2093 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2101 if (strCommand == "version")
2103 // Each connection can only send one version message
2104 if (pfrom->nVersion != 0)
2106 pfrom->Misbehaving(1);
2114 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2115 if (pfrom->nVersion < 209)
2117 // Since Februari 20, 2012, the protocol is initiated at version 209,
2118 // and earlier versions are no longer supported
2119 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2120 pfrom->fDisconnect = true;
2124 if (pfrom->nVersion == 10300)
2125 pfrom->nVersion = 300;
2127 vRecv >> addrFrom >> nNonce;
2129 vRecv >> pfrom->strSubVer;
2131 vRecv >> pfrom->nStartingHeight;
2133 // Disconnect if we connected to ourself
2134 if (nNonce == nLocalHostNonce && nNonce > 1)
2136 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2137 pfrom->fDisconnect = true;
2141 // Be shy and don't send version until we hear
2142 if (pfrom->fInbound)
2143 pfrom->PushVersion();
2145 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2147 AddTimeData(pfrom->addr, nTime);
2150 pfrom->PushMessage("verack");
2151 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2153 if (!pfrom->fInbound)
2155 // Advertise our address
2156 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2157 !IsInitialBlockDownload())
2159 CAddress addr(addrLocalHost);
2160 addr.nTime = GetAdjustedTime();
2161 pfrom->PushAddress(addr);
2164 // Get recent addresses
2165 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2167 pfrom->PushMessage("getaddr");
2168 pfrom->fGetAddr = true;
2172 // Ask the first connected node for block updates
2173 static int nAskedForBlocks = 0;
2174 if (!pfrom->fClient &&
2175 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2176 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2179 pfrom->PushGetBlocks(pindexBest, uint256(0));
2183 CRITICAL_BLOCK(cs_mapAlerts)
2184 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2185 item.second.RelayTo(pfrom);
2187 pfrom->fSuccessfullyConnected = true;
2189 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2191 cPeerBlockCounts.input(pfrom->nStartingHeight);
2195 else if (pfrom->nVersion == 0)
2197 // Must have a version message before anything else
2198 pfrom->Misbehaving(1);
2203 else if (strCommand == "verack")
2205 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2209 else if (strCommand == "addr")
2211 vector<CAddress> vAddr;
2214 // Don't want addr from older versions unless seeding
2215 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2217 if (vAddr.size() > 1000)
2219 pfrom->Misbehaving(20);
2220 return error("message addr size() = %d", vAddr.size());
2223 // Store the new addresses
2226 int64 nNow = GetAdjustedTime();
2227 int64 nSince = nNow - 10 * 60;
2228 BOOST_FOREACH(CAddress& addr, vAddr)
2232 // ignore IPv6 for now, since it isn't implemented anyway
2235 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2236 addr.nTime = nNow - 5 * 24 * 60 * 60;
2237 AddAddress(addr, 2 * 60 * 60, &addrDB);
2238 pfrom->AddAddressKnown(addr);
2239 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2241 // Relay to a limited number of other nodes
2242 CRITICAL_BLOCK(cs_vNodes)
2244 // Use deterministic randomness to send to the same nodes for 24 hours
2245 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2246 static uint256 hashSalt;
2248 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2249 int64 hashAddr = addr.GetHash();
2250 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2251 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2252 multimap<uint256, CNode*> mapMix;
2253 BOOST_FOREACH(CNode* pnode, vNodes)
2255 if (pnode->nVersion < 31402)
2257 unsigned int nPointer;
2258 memcpy(&nPointer, &pnode, sizeof(nPointer));
2259 uint256 hashKey = hashRand ^ nPointer;
2260 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2261 mapMix.insert(make_pair(hashKey, pnode));
2263 int nRelayNodes = 2;
2264 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2265 ((*mi).second)->PushAddress(addr);
2269 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2270 if (vAddr.size() < 1000)
2271 pfrom->fGetAddr = false;
2275 else if (strCommand == "inv")
2279 if (vInv.size() > 50000)
2281 pfrom->Misbehaving(20);
2282 return error("message inv size() = %d", vInv.size());
2286 BOOST_FOREACH(const CInv& inv, vInv)
2290 pfrom->AddInventoryKnown(inv);
2292 bool fAlreadyHave = AlreadyHave(txdb, inv);
2294 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2298 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2299 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2301 // Track requests for our stuff
2302 Inventory(inv.hash);
2307 else if (strCommand == "getdata")
2311 if (vInv.size() > 50000)
2313 pfrom->Misbehaving(20);
2314 return error("message getdata size() = %d", vInv.size());
2317 BOOST_FOREACH(const CInv& inv, vInv)
2321 printf("received getdata for: %s\n", inv.ToString().c_str());
2323 if (inv.type == MSG_BLOCK)
2325 // Send block from disk
2326 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2327 if (mi != mapBlockIndex.end())
2330 block.ReadFromDisk((*mi).second);
2331 pfrom->PushMessage("block", block);
2333 // Trigger them to send a getblocks request for the next batch of inventory
2334 if (inv.hash == pfrom->hashContinue)
2336 // Bypass PushInventory, this must send even if redundant,
2337 // and we want it right after the last block so they don't
2338 // wait for other stuff first.
2340 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2341 pfrom->PushMessage("inv", vInv);
2342 pfrom->hashContinue = 0;
2346 else if (inv.IsKnownType())
2348 // Send stream from relay memory
2349 CRITICAL_BLOCK(cs_mapRelay)
2351 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2352 if (mi != mapRelay.end())
2353 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2357 // Track requests for our stuff
2358 Inventory(inv.hash);
2363 else if (strCommand == "getblocks")
2365 CBlockLocator locator;
2367 vRecv >> locator >> hashStop;
2369 // Find the last block the caller has in the main chain
2370 CBlockIndex* pindex = locator.GetBlockIndex();
2372 // Send the rest of the chain
2374 pindex = pindex->pnext;
2375 int nLimit = 500 + locator.GetDistanceBack();
2376 unsigned int nBytes = 0;
2377 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2378 for (; pindex; pindex = pindex->pnext)
2380 if (pindex->GetBlockHash() == hashStop)
2382 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2385 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2387 block.ReadFromDisk(pindex, true);
2388 nBytes += block.GetSerializeSize(SER_NETWORK);
2389 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2391 // When this block is requested, we'll send an inv that'll make them
2392 // getblocks the next batch of inventory.
2393 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2394 pfrom->hashContinue = pindex->GetBlockHash();
2401 else if (strCommand == "getheaders")
2403 CBlockLocator locator;
2405 vRecv >> locator >> hashStop;
2407 CBlockIndex* pindex = NULL;
2408 if (locator.IsNull())
2410 // If locator is null, return the hashStop block
2411 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2412 if (mi == mapBlockIndex.end())
2414 pindex = (*mi).second;
2418 // Find the last block the caller has in the main chain
2419 pindex = locator.GetBlockIndex();
2421 pindex = pindex->pnext;
2424 vector<CBlock> vHeaders;
2425 int nLimit = 2000 + locator.GetDistanceBack();
2426 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2427 for (; pindex; pindex = pindex->pnext)
2429 vHeaders.push_back(pindex->GetBlockHeader());
2430 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2433 pfrom->PushMessage("headers", vHeaders);
2437 else if (strCommand == "tx")
2439 vector<uint256> vWorkQueue;
2440 CDataStream vMsg(vRecv);
2444 CInv inv(MSG_TX, tx.GetHash());
2445 pfrom->AddInventoryKnown(inv);
2447 bool fMissingInputs = false;
2448 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2450 SyncWithWallets(tx, NULL, true);
2451 RelayMessage(inv, vMsg);
2452 mapAlreadyAskedFor.erase(inv);
2453 vWorkQueue.push_back(inv.hash);
2455 // Recursively process any orphan transactions that depended on this one
2456 for (int i = 0; i < vWorkQueue.size(); i++)
2458 uint256 hashPrev = vWorkQueue[i];
2459 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2460 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2463 const CDataStream& vMsg = *((*mi).second);
2465 CDataStream(vMsg) >> tx;
2466 CInv inv(MSG_TX, tx.GetHash());
2468 if (tx.AcceptToMemoryPool(true))
2470 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2471 SyncWithWallets(tx, NULL, true);
2472 RelayMessage(inv, vMsg);
2473 mapAlreadyAskedFor.erase(inv);
2474 vWorkQueue.push_back(inv.hash);
2479 BOOST_FOREACH(uint256 hash, vWorkQueue)
2480 EraseOrphanTx(hash);
2482 else if (fMissingInputs)
2484 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2487 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2491 else if (strCommand == "block")
2496 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2499 CInv inv(MSG_BLOCK, block.GetHash());
2500 pfrom->AddInventoryKnown(inv);
2502 if (ProcessBlock(pfrom, &block))
2503 mapAlreadyAskedFor.erase(inv);
2504 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2508 else if (strCommand == "getaddr")
2510 // Nodes rebroadcast an addr every 24 hours
2511 pfrom->vAddrToSend.clear();
2512 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2513 CRITICAL_BLOCK(cs_mapAddresses)
2515 unsigned int nCount = 0;
2516 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2518 const CAddress& addr = item.second;
2519 if (addr.nTime > nSince)
2522 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2524 const CAddress& addr = item.second;
2525 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2526 pfrom->PushAddress(addr);
2532 else if (strCommand == "checkorder")
2537 if (!GetBoolArg("-allowreceivebyip"))
2539 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2546 /// we have a chance to check the order here
2548 // Keep giving the same key to the same ip until they use it
2549 if (!mapReuseKey.count(pfrom->addr))
2550 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2552 // Send back approval of order and pubkey to use
2553 CScript scriptPubKey;
2554 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2555 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2559 else if (strCommand == "reply")
2564 CRequestTracker tracker;
2565 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2567 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2568 if (mi != pfrom->mapRequests.end())
2570 tracker = (*mi).second;
2571 pfrom->mapRequests.erase(mi);
2574 if (!tracker.IsNull())
2575 tracker.fn(tracker.param1, vRecv);
2579 else if (strCommand == "ping")
2584 else if (strCommand == "alert")
2589 if (alert.ProcessAlert())
2592 pfrom->setKnown.insert(alert.GetHash());
2593 CRITICAL_BLOCK(cs_vNodes)
2594 BOOST_FOREACH(CNode* pnode, vNodes)
2595 alert.RelayTo(pnode);
2602 // Ignore unknown commands for extensibility
2606 // Update the last seen time for this node's address
2607 if (pfrom->fNetworkNode)
2608 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2609 AddressCurrentlyConnected(pfrom->addr);
2615 bool ProcessMessages(CNode* pfrom)
2617 CDataStream& vRecv = pfrom->vRecv;
2621 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2625 // (4) message start
2634 // Scan for message start
2635 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2636 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2637 if (vRecv.end() - pstart < nHeaderSize)
2639 if (vRecv.size() > nHeaderSize)
2641 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2642 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2646 if (pstart - vRecv.begin() > 0)
2647 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2648 vRecv.erase(vRecv.begin(), pstart);
2651 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2656 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2659 string strCommand = hdr.GetCommand();
2662 unsigned int nMessageSize = hdr.nMessageSize;
2663 if (nMessageSize > MAX_SIZE)
2665 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2668 if (nMessageSize > vRecv.size())
2670 // Rewind and wait for rest of message
2671 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2676 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2677 unsigned int nChecksum = 0;
2678 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2679 if (nChecksum != hdr.nChecksum)
2681 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2682 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2686 // Copy message to its own buffer
2687 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2688 vRecv.ignore(nMessageSize);
2694 CRITICAL_BLOCK(cs_main)
2695 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2699 catch (std::ios_base::failure& e)
2701 if (strstr(e.what(), "end of data"))
2703 // Allow exceptions from underlength message on vRecv
2704 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());
2706 else if (strstr(e.what(), "size too large"))
2708 // Allow exceptions from overlong size
2709 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2713 PrintExceptionContinue(&e, "ProcessMessage()");
2716 catch (std::exception& e) {
2717 PrintExceptionContinue(&e, "ProcessMessage()");
2719 PrintExceptionContinue(NULL, "ProcessMessage()");
2723 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2731 bool SendMessages(CNode* pto, bool fSendTrickle)
2733 CRITICAL_BLOCK(cs_main)
2735 // Don't send anything until we get their version message
2736 if (pto->nVersion == 0)
2740 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2741 pto->PushMessage("ping");
2743 // Resend wallet transactions that haven't gotten in a block yet
2744 ResendWalletTransactions();
2746 // Address refresh broadcast
2747 static int64 nLastRebroadcast;
2748 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2750 CRITICAL_BLOCK(cs_vNodes)
2752 BOOST_FOREACH(CNode* pnode, vNodes)
2754 // Periodically clear setAddrKnown to allow refresh broadcasts
2755 if (nLastRebroadcast)
2756 pnode->setAddrKnown.clear();
2758 // Rebroadcast our address
2759 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2761 CAddress addr(addrLocalHost);
2762 addr.nTime = GetAdjustedTime();
2763 pnode->PushAddress(addr);
2767 nLastRebroadcast = GetTime();
2770 // Clear out old addresses periodically so it's not too much work at once
2771 static int64 nLastClear;
2772 if (nLastClear == 0)
2773 nLastClear = GetTime();
2774 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2776 nLastClear = GetTime();
2777 CRITICAL_BLOCK(cs_mapAddresses)
2780 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2781 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2782 mi != mapAddresses.end();)
2784 const CAddress& addr = (*mi).second;
2785 if (addr.nTime < nSince)
2787 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2789 addrdb.EraseAddress(addr);
2790 mapAddresses.erase(mi++);
2804 vector<CAddress> vAddr;
2805 vAddr.reserve(pto->vAddrToSend.size());
2806 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2808 // returns true if wasn't already contained in the set
2809 if (pto->setAddrKnown.insert(addr).second)
2811 vAddr.push_back(addr);
2812 // receiver rejects addr messages larger than 1000
2813 if (vAddr.size() >= 1000)
2815 pto->PushMessage("addr", vAddr);
2820 pto->vAddrToSend.clear();
2822 pto->PushMessage("addr", vAddr);
2827 // Message: inventory
2830 vector<CInv> vInvWait;
2831 CRITICAL_BLOCK(pto->cs_inventory)
2833 vInv.reserve(pto->vInventoryToSend.size());
2834 vInvWait.reserve(pto->vInventoryToSend.size());
2835 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2837 if (pto->setInventoryKnown.count(inv))
2840 // trickle out tx inv to protect privacy
2841 if (inv.type == MSG_TX && !fSendTrickle)
2843 // 1/4 of tx invs blast to all immediately
2844 static uint256 hashSalt;
2846 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2847 uint256 hashRand = inv.hash ^ hashSalt;
2848 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2849 bool fTrickleWait = ((hashRand & 3) != 0);
2851 // always trickle our own transactions
2855 if (GetTransaction(inv.hash, wtx))
2857 fTrickleWait = true;
2862 vInvWait.push_back(inv);
2867 // returns true if wasn't already contained in the set
2868 if (pto->setInventoryKnown.insert(inv).second)
2870 vInv.push_back(inv);
2871 if (vInv.size() >= 1000)
2873 pto->PushMessage("inv", vInv);
2878 pto->vInventoryToSend = vInvWait;
2881 pto->PushMessage("inv", vInv);
2887 vector<CInv> vGetData;
2888 int64 nNow = GetTime() * 1000000;
2890 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2892 const CInv& inv = (*pto->mapAskFor.begin()).second;
2893 if (!AlreadyHave(txdb, inv))
2895 printf("sending getdata: %s\n", inv.ToString().c_str());
2896 vGetData.push_back(inv);
2897 if (vGetData.size() >= 1000)
2899 pto->PushMessage("getdata", vGetData);
2903 mapAlreadyAskedFor[inv] = nNow;
2904 pto->mapAskFor.erase(pto->mapAskFor.begin());
2906 if (!vGetData.empty())
2907 pto->PushMessage("getdata", vGetData);
2926 //////////////////////////////////////////////////////////////////////////////
2931 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2933 unsigned char* pdata = (unsigned char*)pbuffer;
2934 unsigned int blocks = 1 + ((len + 8) / 64);
2935 unsigned char* pend = pdata + 64 * blocks;
2936 memset(pdata + len, 0, 64 * blocks - len);
2938 unsigned int bits = len * 8;
2939 pend[-1] = (bits >> 0) & 0xff;
2940 pend[-2] = (bits >> 8) & 0xff;
2941 pend[-3] = (bits >> 16) & 0xff;
2942 pend[-4] = (bits >> 24) & 0xff;
2946 static const unsigned int pSHA256InitState[8] =
2947 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2949 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2952 unsigned char data[64];
2956 for (int i = 0; i < 16; i++)
2957 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2959 for (int i = 0; i < 8; i++)
2960 ctx.h[i] = ((uint32_t*)pinit)[i];
2962 SHA256_Update(&ctx, data, sizeof(data));
2963 for (int i = 0; i < 8; i++)
2964 ((uint32_t*)pstate)[i] = ctx.h[i];
2968 // ScanHash scans nonces looking for a hash with at least some zero bits.
2969 // It operates on big endian data. Caller does the byte reversing.
2970 // All input buffers are 16-byte aligned. nNonce is usually preserved
2971 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2972 // the block is rebuilt and nNonce starts over at zero.
2974 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2976 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2980 // Hash pdata using pmidstate as the starting state into
2981 // preformatted buffer phash1, then hash phash1 into phash
2983 SHA256Transform(phash1, pdata, pmidstate);
2984 SHA256Transform(phash, phash1, pSHA256InitState);
2986 // Return the nonce if the hash has at least some zero bits,
2987 // caller will check if it has enough to reach the target
2988 if (((unsigned short*)phash)[14] == 0)
2991 // If nothing found after trying for a while, return -1
2992 if ((nNonce & 0xffff) == 0)
2994 nHashesDone = 0xffff+1;
3000 // Some explaining would be appreciated
3005 set<uint256> setDependsOn;
3008 COrphan(CTransaction* ptxIn)
3016 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3017 BOOST_FOREACH(uint256 hash, setDependsOn)
3018 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3023 uint64 nLastBlockTx = 0;
3024 uint64 nLastBlockSize = 0;
3026 CBlock* CreateNewBlock(CReserveKey& reservekey)
3028 CBlockIndex* pindexPrev = pindexBest;
3031 auto_ptr<CBlock> pblock(new CBlock());
3035 // Create coinbase tx
3037 txNew.vin.resize(1);
3038 txNew.vin[0].prevout.SetNull();
3039 txNew.vout.resize(1);
3040 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3042 // Add our coinbase tx as first transaction
3043 pblock->vtx.push_back(txNew);
3045 // Collect memory pool transactions into the block
3047 CRITICAL_BLOCK(cs_main)
3048 CRITICAL_BLOCK(cs_mapTransactions)
3052 // Priority order to process transactions
3053 list<COrphan> vOrphan; // list memory doesn't move
3054 map<uint256, vector<COrphan*> > mapDependers;
3055 multimap<double, CTransaction*> mapPriority;
3056 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3058 CTransaction& tx = (*mi).second;
3059 if (tx.IsCoinBase() || !tx.IsFinal())
3062 COrphan* porphan = NULL;
3063 double dPriority = 0;
3064 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3066 // Read prev transaction
3067 CTransaction txPrev;
3069 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3071 // Has to wait for dependencies
3074 // Use list for automatic deletion
3075 vOrphan.push_back(COrphan(&tx));
3076 porphan = &vOrphan.back();
3078 mapDependers[txin.prevout.hash].push_back(porphan);
3079 porphan->setDependsOn.insert(txin.prevout.hash);
3082 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3084 // Read block header
3085 int nConf = txindex.GetDepthInMainChain();
3087 dPriority += (double)nValueIn * nConf;
3089 if (fDebug && GetBoolArg("-printpriority"))
3090 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3093 // Priority is sum(valuein * age) / txsize
3094 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3097 porphan->dPriority = dPriority;
3099 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3101 if (fDebug && GetBoolArg("-printpriority"))
3103 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3110 // Collect transactions into block
3111 map<uint256, CTxIndex> mapTestPool;
3112 uint64 nBlockSize = 1000;
3113 uint64 nBlockTx = 0;
3114 int nBlockSigOps = 100;
3115 while (!mapPriority.empty())
3117 // Take highest priority transaction off priority queue
3118 double dPriority = -(*mapPriority.begin()).first;
3119 CTransaction& tx = *(*mapPriority.begin()).second;
3120 mapPriority.erase(mapPriority.begin());
3123 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3124 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3127 // Legacy limits on sigOps:
3128 int nTxSigOps = tx.GetLegacySigOpCount();
3129 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3132 // Transaction fee required depends on block size
3133 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3134 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3136 // Connecting shouldn't fail due to dependency on other memory pool transactions
3137 // because we're already processing them in order of dependency
3138 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3139 MapPrevTx mapInputs;
3141 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3144 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3145 if (nTxFees < nMinFee)
3148 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3149 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3152 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3154 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3155 swap(mapTestPool, mapTestPoolTmp);
3158 pblock->vtx.push_back(tx);
3159 nBlockSize += nTxSize;
3161 nBlockSigOps += nTxSigOps;
3164 // Add transactions that depend on this one to the priority queue
3165 uint256 hash = tx.GetHash();
3166 if (mapDependers.count(hash))
3168 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3170 if (!porphan->setDependsOn.empty())
3172 porphan->setDependsOn.erase(hash);
3173 if (porphan->setDependsOn.empty())
3174 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3180 nLastBlockTx = nBlockTx;
3181 nLastBlockSize = nBlockSize;
3182 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3185 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3188 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3189 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3190 pblock->UpdateTime(pindexPrev);
3191 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3194 return pblock.release();
3198 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3200 // Update nExtraNonce
3201 static uint256 hashPrevBlock;
3202 if (hashPrevBlock != pblock->hashPrevBlock)
3205 hashPrevBlock = pblock->hashPrevBlock;
3208 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3209 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3211 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3215 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3218 // Prebuild hash buffers
3225 uint256 hashPrevBlock;
3226 uint256 hashMerkleRoot;
3229 unsigned int nNonce;
3232 unsigned char pchPadding0[64];
3234 unsigned char pchPadding1[64];
3237 memset(&tmp, 0, sizeof(tmp));
3239 tmp.block.nVersion = pblock->nVersion;
3240 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3241 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3242 tmp.block.nTime = pblock->nTime;
3243 tmp.block.nBits = pblock->nBits;
3244 tmp.block.nNonce = pblock->nNonce;
3246 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3247 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3249 // Byte swap all the input buffer
3250 for (int i = 0; i < sizeof(tmp)/4; i++)
3251 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3253 // Precalc the first half of the first hash, which stays constant
3254 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3256 memcpy(pdata, &tmp.block, 128);
3257 memcpy(phash1, &tmp.hash1, 64);
3261 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3263 uint256 hash = pblock->GetHash();
3264 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3266 if (hash > hashTarget)
3270 printf("BitcoinMiner:\n");
3271 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3273 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3274 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3277 CRITICAL_BLOCK(cs_main)
3279 if (pblock->hashPrevBlock != hashBestChain)
3280 return error("BitcoinMiner : generated block is stale");
3282 // Remove key from key pool
3283 reservekey.KeepKey();
3285 // Track how many getdata requests this block gets
3286 CRITICAL_BLOCK(wallet.cs_wallet)
3287 wallet.mapRequestCount[pblock->GetHash()] = 0;
3289 // Process this block the same as if we had received it from another node
3290 if (!ProcessBlock(NULL, pblock))
3291 return error("BitcoinMiner : ProcessBlock, block not accepted");
3297 void static ThreadBitcoinMiner(void* parg);
3299 void static BitcoinMiner(CWallet *pwallet)
3301 printf("BitcoinMiner started\n");
3302 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3304 // Each thread has its own key and counter
3305 CReserveKey reservekey(pwallet);
3306 unsigned int nExtraNonce = 0;
3308 while (fGenerateBitcoins)
3310 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3314 while (vNodes.empty() || IsInitialBlockDownload())
3319 if (!fGenerateBitcoins)
3327 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3328 CBlockIndex* pindexPrev = pindexBest;
3330 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3333 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3335 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3339 // Prebuild hash buffers
3341 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3342 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3343 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3345 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3347 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3348 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3349 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3355 int64 nStart = GetTime();
3356 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3358 uint256& hash = *alignup<16>(hashbuf);
3361 unsigned int nHashesDone = 0;
3362 unsigned int nNonceFound;
3365 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3366 (char*)&hash, nHashesDone);
3368 // Check if something found
3369 if (nNonceFound != -1)
3371 for (int i = 0; i < sizeof(hash)/4; i++)
3372 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3374 if (hash <= hashTarget)
3377 pblock->nNonce = ByteReverse(nNonceFound);
3378 assert(hash == pblock->GetHash());
3380 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3381 CheckWork(pblock.get(), *pwalletMain, reservekey);
3382 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3388 static int64 nHashCounter;
3389 if (nHPSTimerStart == 0)
3391 nHPSTimerStart = GetTimeMillis();
3395 nHashCounter += nHashesDone;
3396 if (GetTimeMillis() - nHPSTimerStart > 4000)
3398 static CCriticalSection cs;
3401 if (GetTimeMillis() - nHPSTimerStart > 4000)
3403 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3404 nHPSTimerStart = GetTimeMillis();
3406 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3407 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3408 static int64 nLogTime;
3409 if (GetTime() - nLogTime > 30 * 60)
3411 nLogTime = GetTime();
3412 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3413 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3419 // Check for stop or if block needs to be rebuilt
3422 if (!fGenerateBitcoins)
3424 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3428 if (nBlockNonce >= 0xffff0000)
3430 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3432 if (pindexPrev != pindexBest)
3435 // Update nTime every few seconds
3436 pblock->UpdateTime(pindexPrev);
3437 nBlockTime = ByteReverse(pblock->nTime);
3440 // Changing pblock->nTime can change work required on testnet:
3441 nBlockBits = ByteReverse(pblock->nBits);
3442 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3448 void static ThreadBitcoinMiner(void* parg)
3450 CWallet* pwallet = (CWallet*)parg;
3453 vnThreadsRunning[THREAD_MINER]++;
3454 BitcoinMiner(pwallet);
3455 vnThreadsRunning[THREAD_MINER]--;
3457 catch (std::exception& e) {
3458 vnThreadsRunning[THREAD_MINER]--;
3459 PrintException(&e, "ThreadBitcoinMiner()");
3461 vnThreadsRunning[THREAD_MINER]--;
3462 PrintException(NULL, "ThreadBitcoinMiner()");
3464 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3466 if (vnThreadsRunning[THREAD_MINER] == 0)
3468 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3472 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3474 if (fGenerateBitcoins != fGenerate)
3476 fGenerateBitcoins = fGenerate;
3477 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3480 if (fGenerateBitcoins)
3482 int nProcessors = boost::thread::hardware_concurrency();
3483 printf("%d processors\n", nProcessors);
3484 if (nProcessors < 1)
3486 if (fLimitProcessors && nProcessors > nLimitProcessors)
3487 nProcessors = nLimitProcessors;
3488 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3489 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3490 for (int i = 0; i < nAddThreads; i++)
3492 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3493 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");