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 COPYING or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include "ui_interface.h"
11 #include <boost/algorithm/string/replace.hpp>
12 #include <boost/filesystem.hpp>
13 #include <boost/filesystem/fstream.hpp>
16 using namespace boost;
22 CCriticalSection cs_setpwalletRegistered;
23 set<CWallet*> setpwalletRegistered;
25 CCriticalSection cs_main;
28 unsigned int nTransactionsUpdated = 0;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 CBlockIndex* pindexGenesisBlock = NULL;
35 CBigNum bnBestChainWork = 0;
36 CBigNum bnBestInvalidWork = 0;
37 uint256 hashBestChain = 0;
38 CBlockIndex* pindexBest = NULL;
39 int64 nTimeBestReceived = 0;
41 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
49 // Constant stuff for coinbase transactions we create:
50 CScript COINBASE_FLAGS;
52 const string strMessageMagic = "Bitcoin Signed Message:\n";
58 int64 nTransactionFee = 0;
62 //////////////////////////////////////////////////////////////////////////////
64 // dispatching functions
67 // These functions dispatch to one or all registered wallets
70 void RegisterWallet(CWallet* pwalletIn)
73 LOCK(cs_setpwalletRegistered);
74 setpwalletRegistered.insert(pwalletIn);
78 void UnregisterWallet(CWallet* pwalletIn)
81 LOCK(cs_setpwalletRegistered);
82 setpwalletRegistered.erase(pwalletIn);
86 // check whether the passed transaction is from us
87 bool static IsFromMe(CTransaction& tx)
89 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
90 if (pwallet->IsFromMe(tx))
95 // get the wallet transaction with the given hash (if it exists)
96 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
98 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
99 if (pwallet->GetTransaction(hashTx,wtx))
104 // erases transaction with the given hash from all wallets
105 void static EraseFromWallets(uint256 hash)
107 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
108 pwallet->EraseFromWallet(hash);
111 // make sure all wallets know about the given transaction, in the given block
112 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
114 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
115 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
118 // notify wallets about a new best chain
119 void static SetBestChain(const CBlockLocator& loc)
121 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
122 pwallet->SetBestChain(loc);
125 // notify wallets about an updated transaction
126 void static UpdatedTransaction(const uint256& hashTx)
128 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
129 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 // notify wallets about an incoming inventory (for request counts)
140 void static Inventory(const uint256& hash)
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 pwallet->Inventory(hash);
146 // ask wallets to resend their transactions
147 void static ResendWalletTransactions()
149 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
150 pwallet->ResendWalletTransactions();
159 //////////////////////////////////////////////////////////////////////////////
161 // mapOrphanTransactions
164 void AddOrphanTx(const CDataStream& vMsg)
167 CDataStream(vMsg) >> tx;
168 uint256 hash = tx.GetHash();
169 if (mapOrphanTransactions.count(hash))
172 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
173 BOOST_FOREACH(const CTxIn& txin, tx.vin)
174 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
177 void static EraseOrphanTx(uint256 hash)
179 if (!mapOrphanTransactions.count(hash))
181 const CDataStream* pvMsg = mapOrphanTransactions[hash];
183 CDataStream(*pvMsg) >> tx;
184 BOOST_FOREACH(const CTxIn& txin, tx.vin)
186 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
187 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
189 if ((*mi).second == pvMsg)
190 mapOrphanTransactionsByPrev.erase(mi++);
196 mapOrphanTransactions.erase(hash);
199 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
201 unsigned int nEvicted = 0;
202 while (mapOrphanTransactions.size() > nMaxOrphans)
204 // Evict a random orphan:
205 std::vector<unsigned char> randbytes(32);
206 RAND_bytes(&randbytes[0], 32);
207 uint256 randomhash(randbytes);
208 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
209 if (it == mapOrphanTransactions.end())
210 it = mapOrphanTransactions.begin();
211 EraseOrphanTx(it->first);
223 //////////////////////////////////////////////////////////////////////////////
225 // CTransaction and CTxIndex
228 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
231 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
233 if (!ReadFromDisk(txindexRet.pos))
235 if (prevout.n >= vout.size())
243 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
246 return ReadFromDisk(txdb, prevout, txindex);
249 bool CTransaction::ReadFromDisk(COutPoint prevout)
253 return ReadFromDisk(txdb, prevout, txindex);
256 bool CTransaction::IsStandard() const
258 BOOST_FOREACH(const CTxIn& txin, vin)
260 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
261 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
262 // ~65-byte public keys, plus a few script ops.
263 if (txin.scriptSig.size() > 500)
265 if (!txin.scriptSig.IsPushOnly())
268 BOOST_FOREACH(const CTxOut& txout, vout)
269 if (!::IsStandard(txout.scriptPubKey))
275 // Check transaction inputs, and make sure any
276 // pay-to-script-hash transactions are evaluating IsStandard scripts
278 // Why bother? To avoid denial-of-service attacks; an attacker
279 // can submit a standard HASH... OP_EQUAL transaction,
280 // which will get accepted into blocks. The redemption
281 // script can be anything; an attacker could use a very
282 // expensive-to-check-upon-redemption script like:
283 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
285 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
288 return true; // Coinbases don't use vin normally
290 for (unsigned int i = 0; i < vin.size(); i++)
292 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
294 vector<vector<unsigned char> > vSolutions;
295 txnouttype whichType;
296 // get the scriptPubKey corresponding to this input:
297 const CScript& prevScript = prev.scriptPubKey;
298 if (!Solver(prevScript, whichType, vSolutions))
300 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
301 if (nArgsExpected < 0)
304 // Transactions with extra stuff in their scriptSigs are
305 // non-standard. Note that this EvalScript() call will
306 // be quick, because if there are any operations
307 // beside "push data" in the scriptSig the
308 // IsStandard() call returns false
309 vector<vector<unsigned char> > stack;
310 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
313 if (whichType == TX_SCRIPTHASH)
317 CScript subscript(stack.back().begin(), stack.back().end());
318 vector<vector<unsigned char> > vSolutions2;
319 txnouttype whichType2;
320 if (!Solver(subscript, whichType2, vSolutions2))
322 if (whichType2 == TX_SCRIPTHASH)
326 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
329 nArgsExpected += tmpExpected;
332 if (stack.size() != (unsigned int)nArgsExpected)
340 CTransaction::GetLegacySigOpCount() const
342 unsigned int nSigOps = 0;
343 BOOST_FOREACH(const CTxIn& txin, vin)
345 nSigOps += txin.scriptSig.GetSigOpCount(false);
347 BOOST_FOREACH(const CTxOut& txout, vout)
349 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
355 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
367 // Load the block this tx is in
369 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
371 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
376 // Update the tx's hashBlock
377 hashBlock = pblock->GetHash();
379 // Locate the transaction
380 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
381 if (pblock->vtx[nIndex] == *(CTransaction*)this)
383 if (nIndex == (int)pblock->vtx.size())
385 vMerkleBranch.clear();
387 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
391 // Fill in merkle branch
392 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
395 // Is the tx in a block that's in the main chain
396 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
397 if (mi == mapBlockIndex.end())
399 CBlockIndex* pindex = (*mi).second;
400 if (!pindex || !pindex->IsInMainChain())
403 return pindexBest->nHeight - pindex->nHeight + 1;
412 bool CTransaction::CheckTransaction() const
414 // Basic checks that don't depend on any context
416 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
418 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
420 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
421 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
423 // Check for negative or overflow output values
425 BOOST_FOREACH(const CTxOut& txout, vout)
427 if (txout.nValue < 0)
428 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
429 if (txout.nValue > MAX_MONEY)
430 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
431 nValueOut += txout.nValue;
432 if (!MoneyRange(nValueOut))
433 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
436 // Check for duplicate inputs
437 set<COutPoint> vInOutPoints;
438 BOOST_FOREACH(const CTxIn& txin, vin)
440 if (vInOutPoints.count(txin.prevout))
442 vInOutPoints.insert(txin.prevout);
447 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
448 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
452 BOOST_FOREACH(const CTxIn& txin, vin)
453 if (txin.prevout.IsNull())
454 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
460 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
461 bool* pfMissingInputs)
464 *pfMissingInputs = false;
466 if (!tx.CheckTransaction())
467 return error("CTxMemPool::accept() : CheckTransaction failed");
469 // Coinbase is only valid in a block, not as a loose transaction
471 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
473 // To help v0.1.5 clients who would see it as a negative number
474 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
475 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
477 // Rather not work on nonstandard transactions (unless -testnet)
478 if (!fTestNet && !tx.IsStandard())
479 return error("CTxMemPool::accept() : nonstandard transaction type");
481 // Do we already have it?
482 uint256 hash = tx.GetHash();
485 if (mapTx.count(hash))
489 if (txdb.ContainsTx(hash))
492 // Check for conflicts with in-memory transactions
493 CTransaction* ptxOld = NULL;
494 for (unsigned int i = 0; i < tx.vin.size(); i++)
496 COutPoint outpoint = tx.vin[i].prevout;
497 if (mapNextTx.count(outpoint))
499 // Disable replacement feature for now
502 // Allow replacing with a newer version of the same transaction
505 ptxOld = mapNextTx[outpoint].ptx;
506 if (ptxOld->IsFinal())
508 if (!tx.IsNewerThan(*ptxOld))
510 for (unsigned int i = 0; i < tx.vin.size(); i++)
512 COutPoint outpoint = tx.vin[i].prevout;
513 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
523 map<uint256, CTxIndex> mapUnused;
524 bool fInvalid = false;
525 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
528 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
530 *pfMissingInputs = true;
531 return error("CTxMemPool::accept() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
534 // Check for non-standard pay-to-script-hash in inputs
535 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
536 return error("CTxMemPool::accept() : nonstandard transaction input");
538 // Note: if you modify this code to accept non-standard transactions, then
539 // you should add code here to check that the transaction does a
540 // reasonable number of ECDSA signature verifications.
542 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
543 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
545 // Don't accept it if it can't get into a block
546 if (nFees < tx.GetMinFee(1000, true, GMF_RELAY))
547 return error("CTxMemPool::accept() : not enough fees");
549 // Continuously rate-limit free transactions
550 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
551 // be annoying or make other's transactions take longer to confirm.
552 if (nFees < MIN_RELAY_TX_FEE)
554 static CCriticalSection cs;
555 static double dFreeCount;
556 static int64 nLastTime;
557 int64 nNow = GetTime();
561 // Use an exponentially decaying ~10-minute window:
562 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
564 // -limitfreerelay unit is thousand-bytes-per-minute
565 // At default rate it would take over a month to fill 1GB
566 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
567 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
569 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
574 // Check against previous transactions
575 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
576 if (!tx.ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
578 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
582 // Store transaction in memory
587 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
593 ///// are we sure this is ok when loading transactions or restoring block txes
594 // If updated, erase old tx from wallet
596 EraseFromWallets(ptxOld->GetHash());
598 printf("CTxMemPool::accept() : accepted %s\n", hash.ToString().substr(0,10).c_str());
602 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
604 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
607 bool CTxMemPool::addUnchecked(CTransaction &tx)
609 printf("addUnchecked(): size %lu\n", mapTx.size());
610 // Add to memory pool without checking anything. Don't call this directly,
611 // call CTxMemPool::accept to properly check the transaction first.
614 uint256 hash = tx.GetHash();
616 for (unsigned int i = 0; i < tx.vin.size(); i++)
617 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
618 nTransactionsUpdated++;
624 bool CTxMemPool::remove(CTransaction &tx)
626 // Remove transaction from memory pool
629 uint256 hash = tx.GetHash();
630 if (mapTx.count(hash))
632 BOOST_FOREACH(const CTxIn& txin, tx.vin)
633 mapNextTx.erase(txin.prevout);
635 nTransactionsUpdated++;
646 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
648 if (hashBlock == 0 || nIndex == -1)
651 // Find the block it claims to be in
652 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
653 if (mi == mapBlockIndex.end())
655 CBlockIndex* pindex = (*mi).second;
656 if (!pindex || !pindex->IsInMainChain())
659 // Make sure the merkle branch connects to this block
660 if (!fMerkleVerified)
662 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
664 fMerkleVerified = true;
668 return pindexBest->nHeight - pindex->nHeight + 1;
672 int CMerkleTx::GetBlocksToMaturity() const
676 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
680 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
684 if (!IsInMainChain() && !ClientConnectInputs())
686 return CTransaction::AcceptToMemoryPool(txdb, false);
690 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
694 bool CMerkleTx::AcceptToMemoryPool()
697 return AcceptToMemoryPool(txdb);
702 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
707 // Add previous supporting transactions first
708 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
710 if (!tx.IsCoinBase())
712 uint256 hash = tx.GetHash();
713 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
714 tx.AcceptToMemoryPool(txdb, fCheckInputs);
717 return AcceptToMemoryPool(txdb, fCheckInputs);
722 bool CWalletTx::AcceptWalletTransaction()
725 return AcceptWalletTransaction(txdb);
728 int CTxIndex::GetDepthInMainChain() const
732 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
734 // Find the block in the index
735 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
736 if (mi == mapBlockIndex.end())
738 CBlockIndex* pindex = (*mi).second;
739 if (!pindex || !pindex->IsInMainChain())
741 return 1 + nBestHeight - pindex->nHeight;
753 //////////////////////////////////////////////////////////////////////////////
755 // CBlock and CBlockIndex
758 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
760 if (!fReadTransactions)
762 *this = pindex->GetBlockHeader();
765 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
767 if (GetHash() != pindex->GetBlockHash())
768 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
772 uint256 static GetOrphanRoot(const CBlock* pblock)
774 // Work back to the first block in the orphan chain
775 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
776 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
777 return pblock->GetHash();
780 int64 static GetBlockValue(int nHeight, int64 nFees)
782 int64 nSubsidy = 50 * COIN;
784 // Subsidy is cut in half every 4 years
785 nSubsidy >>= (nHeight / 210000);
787 return nSubsidy + nFees;
790 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
791 static const int64 nTargetSpacing = 10 * 60;
792 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
795 // minimum amount of work that could possibly be required nTime after
796 // minimum work required was nBase
798 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
800 // Testnet has min-difficulty blocks
801 // after nTargetSpacing*2 time between blocks:
802 if (fTestNet && nTime > nTargetSpacing*2)
803 return bnProofOfWorkLimit.GetCompact();
806 bnResult.SetCompact(nBase);
807 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
809 // Maximum 400% adjustment...
811 // ... in best-case exactly 4-times-normal target time
812 nTime -= nTargetTimespan*4;
814 if (bnResult > bnProofOfWorkLimit)
815 bnResult = bnProofOfWorkLimit;
816 return bnResult.GetCompact();
819 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
821 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
824 if (pindexLast == NULL)
825 return nProofOfWorkLimit;
827 // Only change once per interval
828 if ((pindexLast->nHeight+1) % nInterval != 0)
830 // Special rules for testnet after 15 Feb 2012:
831 if (fTestNet && pblock->nTime > 1329264000)
833 // If the new block's timestamp is more than 2* 10 minutes
834 // then allow mining of a min-difficulty block.
835 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
836 return nProofOfWorkLimit;
839 // Return the last non-special-min-difficulty-rules-block
840 const CBlockIndex* pindex = pindexLast;
841 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
842 pindex = pindex->pprev;
843 return pindex->nBits;
847 return pindexLast->nBits;
850 // Go back by what we want to be 14 days worth of blocks
851 const CBlockIndex* pindexFirst = pindexLast;
852 for (int i = 0; pindexFirst && i < nInterval-1; i++)
853 pindexFirst = pindexFirst->pprev;
856 // Limit adjustment step
857 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
858 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
859 if (nActualTimespan < nTargetTimespan/4)
860 nActualTimespan = nTargetTimespan/4;
861 if (nActualTimespan > nTargetTimespan*4)
862 nActualTimespan = nTargetTimespan*4;
866 bnNew.SetCompact(pindexLast->nBits);
867 bnNew *= nActualTimespan;
868 bnNew /= nTargetTimespan;
870 if (bnNew > bnProofOfWorkLimit)
871 bnNew = bnProofOfWorkLimit;
874 printf("GetNextWorkRequired RETARGET\n");
875 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
876 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
877 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
879 return bnNew.GetCompact();
882 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
885 bnTarget.SetCompact(nBits);
888 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
889 return error("CheckProofOfWork() : nBits below minimum work");
891 // Check proof of work matches claimed amount
892 if (hash > bnTarget.getuint256())
893 return error("CheckProofOfWork() : hash doesn't match nBits");
898 // Return maximum amount of blocks that other nodes claim to have
899 int GetNumBlocksOfPeers()
901 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
904 bool IsInitialBlockDownload()
906 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
908 static int64 nLastUpdate;
909 static CBlockIndex* pindexLastBest;
910 if (pindexBest != pindexLastBest)
912 pindexLastBest = pindexBest;
913 nLastUpdate = GetTime();
915 return (GetTime() - nLastUpdate < 10 &&
916 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
919 void static InvalidChainFound(CBlockIndex* pindexNew)
921 if (pindexNew->bnChainWork > bnBestInvalidWork)
923 bnBestInvalidWork = pindexNew->bnChainWork;
924 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
927 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());
928 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
929 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
930 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
933 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
935 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
937 // Updating time can change work required on testnet:
939 nBits = GetNextWorkRequired(pindexPrev, this);
952 bool CTransaction::DisconnectInputs(CTxDB& txdb)
954 // Relinquish previous transactions' spent pointers
957 BOOST_FOREACH(const CTxIn& txin, vin)
959 COutPoint prevout = txin.prevout;
961 // Get prev txindex from disk
963 if (!txdb.ReadTxIndex(prevout.hash, txindex))
964 return error("DisconnectInputs() : ReadTxIndex failed");
966 if (prevout.n >= txindex.vSpent.size())
967 return error("DisconnectInputs() : prevout.n out of range");
969 // Mark outpoint as not spent
970 txindex.vSpent[prevout.n].SetNull();
973 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
974 return error("DisconnectInputs() : UpdateTxIndex failed");
978 // Remove transaction from index
979 // This can fail if a duplicate of this transaction was in a chain that got
980 // reorganized away. This is only possible if this transaction was completely
981 // spent, so erasing it would be a no-op anway.
982 txdb.EraseTxIndex(*this);
988 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
989 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
991 // FetchInputs can return false either because we just haven't seen some inputs
992 // (in which case the transaction should be stored as an orphan)
993 // or because the transaction is malformed (in which case the transaction should
994 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
998 return true; // Coinbase transactions have no inputs to fetch.
1000 for (unsigned int i = 0; i < vin.size(); i++)
1002 COutPoint prevout = vin[i].prevout;
1003 if (inputsRet.count(prevout.hash))
1004 continue; // Got it already
1007 CTxIndex& txindex = inputsRet[prevout.hash].first;
1009 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1011 // Get txindex from current proposed changes
1012 txindex = mapTestPool.find(prevout.hash)->second;
1016 // Read txindex from txdb
1017 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1019 if (!fFound && (fBlock || fMiner))
1020 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());
1023 CTransaction& txPrev = inputsRet[prevout.hash].second;
1024 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1026 // Get prev tx from single transactions in memory
1029 if (!mempool.exists(prevout.hash))
1030 return error("FetchInputs() : %s mempool Tx prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1031 txPrev = mempool.lookup(prevout.hash);
1034 txindex.vSpent.resize(txPrev.vout.size());
1038 // Get prev tx from disk
1039 if (!txPrev.ReadFromDisk(txindex.pos))
1040 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1044 // Make sure all prevout.n's are valid:
1045 for (unsigned int i = 0; i < vin.size(); i++)
1047 const COutPoint prevout = vin[i].prevout;
1048 assert(inputsRet.count(prevout.hash) != 0);
1049 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1050 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1051 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1053 // Revisit this if/when transaction replacement is implemented and allows
1056 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()));
1063 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1065 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1066 if (mi == inputs.end())
1067 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1069 const CTransaction& txPrev = (mi->second).second;
1070 if (input.prevout.n >= txPrev.vout.size())
1071 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1073 return txPrev.vout[input.prevout.n];
1076 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1082 for (unsigned int i = 0; i < vin.size(); i++)
1084 nResult += GetOutputFor(vin[i], inputs).nValue;
1090 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1095 unsigned int nSigOps = 0;
1096 for (unsigned int i = 0; i < vin.size(); i++)
1098 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1099 if (prevout.scriptPubKey.IsPayToScriptHash())
1100 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1105 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1106 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1107 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1109 // Take over previous transactions' spent pointers
1110 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1111 // fMiner is true when called from the internal bitcoin miner
1112 // ... both are false when called from CTransaction::AcceptToMemoryPool
1117 for (unsigned int i = 0; i < vin.size(); i++)
1119 COutPoint prevout = vin[i].prevout;
1120 assert(inputs.count(prevout.hash) > 0);
1121 CTxIndex& txindex = inputs[prevout.hash].first;
1122 CTransaction& txPrev = inputs[prevout.hash].second;
1124 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1125 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()));
1127 // If prev is coinbase, check that it's matured
1128 if (txPrev.IsCoinBase())
1129 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1130 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1131 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1133 // Check for conflicts (double-spend)
1134 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1135 // for an attacker to attempt to split the network.
1136 if (!txindex.vSpent[prevout.n].IsNull())
1137 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());
1139 // Check for negative or overflow input values
1140 nValueIn += txPrev.vout[prevout.n].nValue;
1141 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1142 return DoS(100, error("ConnectInputs() : txin values out of range"));
1144 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1145 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1146 // still computed and checked, and any change will be caught at the next checkpoint.
1147 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1150 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1152 // only during transition phase for P2SH: do not invoke anti-DoS code for
1153 // potentially old clients relaying bad P2SH transactions
1154 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1155 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1157 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1161 // Mark outpoints as spent
1162 txindex.vSpent[prevout.n] = posThisTx;
1165 if (fBlock || fMiner)
1167 mapTestPool[prevout.hash] = txindex;
1171 if (nValueIn < GetValueOut())
1172 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1174 // Tally transaction fees
1175 int64 nTxFee = nValueIn - GetValueOut();
1177 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1179 if (!MoneyRange(nFees))
1180 return DoS(100, error("ConnectInputs() : nFees out of range"));
1187 bool CTransaction::ClientConnectInputs()
1192 // Take over previous transactions' spent pointers
1196 for (unsigned int i = 0; i < vin.size(); i++)
1198 // Get prev tx from single transactions in memory
1199 COutPoint prevout = vin[i].prevout;
1200 if (!mempool.exists(prevout.hash))
1202 CTransaction& txPrev = mempool.lookup(prevout.hash);
1204 if (prevout.n >= txPrev.vout.size())
1208 if (!VerifySignature(txPrev, *this, i, true, 0))
1209 return error("ConnectInputs() : VerifySignature failed");
1211 ///// this is redundant with the mempool.mapNextTx stuff,
1212 ///// not sure which I want to get rid of
1213 ///// this has to go away now that posNext is gone
1214 // // Check for conflicts
1215 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1216 // return error("ConnectInputs() : prev tx already used");
1218 // // Flag outpoints as used
1219 // txPrev.vout[prevout.n].posNext = posThisTx;
1221 nValueIn += txPrev.vout[prevout.n].nValue;
1223 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1224 return error("ClientConnectInputs() : txin values out of range");
1226 if (GetValueOut() > nValueIn)
1236 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1238 // Disconnect in reverse order
1239 for (int i = vtx.size()-1; i >= 0; i--)
1240 if (!vtx[i].DisconnectInputs(txdb))
1243 // Update block index on disk without changing it in memory.
1244 // The memory index structure will be changed after the db commits.
1247 CDiskBlockIndex blockindexPrev(pindex->pprev);
1248 blockindexPrev.hashNext = 0;
1249 if (!txdb.WriteBlockIndex(blockindexPrev))
1250 return error("DisconnectBlock() : WriteBlockIndex failed");
1256 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1258 // Check it again in case a previous version let a bad block in
1262 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1263 // unless those are already completely spent.
1264 // If such overwrites are allowed, coinbases and transactions depending upon those
1265 // can be duplicated to remove the ability to spend the first instance -- even after
1266 // being sent to another address.
1267 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1268 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1269 // already refuses previously-known transaction id's entirely.
1270 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1271 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1272 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1274 BOOST_FOREACH(CTransaction& tx, vtx)
1276 CTxIndex txindexOld;
1277 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1279 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1286 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1287 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1288 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1290 //// issue here: it doesn't know the version
1291 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - 1 + GetSizeOfCompactSize(vtx.size());
1293 map<uint256, CTxIndex> mapQueuedChanges;
1295 unsigned int nSigOps = 0;
1296 BOOST_FOREACH(CTransaction& tx, vtx)
1298 nSigOps += tx.GetLegacySigOpCount();
1299 if (nSigOps > MAX_BLOCK_SIGOPS)
1300 return DoS(100, error("ConnectBlock() : too many sigops"));
1302 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1303 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1305 MapPrevTx mapInputs;
1306 if (!tx.IsCoinBase())
1309 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1312 if (fStrictPayToScriptHash)
1314 // Add in sigops done by pay-to-script-hash inputs;
1315 // this is to prevent a "rogue miner" from creating
1316 // an incredibly-expensive-to-validate block.
1317 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1318 if (nSigOps > MAX_BLOCK_SIGOPS)
1319 return DoS(100, error("ConnectBlock() : too many sigops"));
1322 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1324 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1328 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1331 // Write queued txindex changes
1332 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1334 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1335 return error("ConnectBlock() : UpdateTxIndex failed");
1338 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1341 // Update block index on disk without changing it in memory.
1342 // The memory index structure will be changed after the db commits.
1345 CDiskBlockIndex blockindexPrev(pindex->pprev);
1346 blockindexPrev.hashNext = pindex->GetBlockHash();
1347 if (!txdb.WriteBlockIndex(blockindexPrev))
1348 return error("ConnectBlock() : WriteBlockIndex failed");
1351 // Watch for transactions paying to me
1352 BOOST_FOREACH(CTransaction& tx, vtx)
1353 SyncWithWallets(tx, this, true);
1358 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1360 printf("REORGANIZE\n");
1363 CBlockIndex* pfork = pindexBest;
1364 CBlockIndex* plonger = pindexNew;
1365 while (pfork != plonger)
1367 while (plonger->nHeight > pfork->nHeight)
1368 if (!(plonger = plonger->pprev))
1369 return error("Reorganize() : plonger->pprev is null");
1370 if (pfork == plonger)
1372 if (!(pfork = pfork->pprev))
1373 return error("Reorganize() : pfork->pprev is null");
1376 // List of what to disconnect
1377 vector<CBlockIndex*> vDisconnect;
1378 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1379 vDisconnect.push_back(pindex);
1381 // List of what to connect
1382 vector<CBlockIndex*> vConnect;
1383 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1384 vConnect.push_back(pindex);
1385 reverse(vConnect.begin(), vConnect.end());
1387 printf("REORGANIZE: Disconnect %i blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1388 printf("REORGANIZE: Connect %i blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1390 // Disconnect shorter branch
1391 vector<CTransaction> vResurrect;
1392 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1395 if (!block.ReadFromDisk(pindex))
1396 return error("Reorganize() : ReadFromDisk for disconnect failed");
1397 if (!block.DisconnectBlock(txdb, pindex))
1398 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1400 // Queue memory transactions to resurrect
1401 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1402 if (!tx.IsCoinBase())
1403 vResurrect.push_back(tx);
1406 // Connect longer branch
1407 vector<CTransaction> vDelete;
1408 for (unsigned int i = 0; i < vConnect.size(); i++)
1410 CBlockIndex* pindex = vConnect[i];
1412 if (!block.ReadFromDisk(pindex))
1413 return error("Reorganize() : ReadFromDisk for connect failed");
1414 if (!block.ConnectBlock(txdb, pindex))
1418 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1421 // Queue memory transactions to delete
1422 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1423 vDelete.push_back(tx);
1425 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1426 return error("Reorganize() : WriteHashBestChain failed");
1428 // Make sure it's successfully written to disk before changing memory structure
1429 if (!txdb.TxnCommit())
1430 return error("Reorganize() : TxnCommit failed");
1432 // Disconnect shorter branch
1433 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1435 pindex->pprev->pnext = NULL;
1437 // Connect longer branch
1438 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1440 pindex->pprev->pnext = pindex;
1442 // Resurrect memory transactions that were in the disconnected branch
1443 BOOST_FOREACH(CTransaction& tx, vResurrect)
1444 tx.AcceptToMemoryPool(txdb, false);
1446 // Delete redundant memory transactions that are in the connected branch
1447 BOOST_FOREACH(CTransaction& tx, vDelete)
1450 printf("REORGANIZE: done\n");
1457 runCommand(std::string strCommand)
1459 int nErr = ::system(strCommand.c_str());
1461 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1464 // Called from inside SetBestChain: attaches a block to the new best chain being built
1465 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1467 uint256 hash = GetHash();
1469 // Adding to current best branch
1470 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1473 InvalidChainFound(pindexNew);
1476 if (!txdb.TxnCommit())
1477 return error("SetBestChain() : TxnCommit failed");
1479 // Add to current best branch
1480 pindexNew->pprev->pnext = pindexNew;
1482 // Delete redundant memory transactions
1483 BOOST_FOREACH(CTransaction& tx, vtx)
1489 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1491 uint256 hash = GetHash();
1493 if (!txdb.TxnBegin())
1494 return error("SetBestChain() : TxnBegin failed");
1496 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1498 txdb.WriteHashBestChain(hash);
1499 if (!txdb.TxnCommit())
1500 return error("SetBestChain() : TxnCommit failed");
1501 pindexGenesisBlock = pindexNew;
1503 else if (hashPrevBlock == hashBestChain)
1505 if (!SetBestChainInner(txdb, pindexNew))
1506 return error("SetBestChain() : SetBestChainInner failed");
1510 // the first block in the new chain that will cause it to become the new best chain
1511 CBlockIndex *pindexIntermediate = pindexNew;
1513 // list of blocks that need to be connected afterwards
1514 std::vector<CBlockIndex*> vpindexSecondary;
1516 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1517 // Try to limit how much needs to be done inside
1518 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1520 vpindexSecondary.push_back(pindexIntermediate);
1521 pindexIntermediate = pindexIntermediate->pprev;
1524 if (!vpindexSecondary.empty())
1525 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1527 // Switch to new best branch
1528 if (!Reorganize(txdb, pindexIntermediate))
1531 InvalidChainFound(pindexNew);
1532 return error("SetBestChain() : Reorganize failed");
1535 // Connect futher blocks
1536 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1539 if (!block.ReadFromDisk(pindex))
1541 printf("SetBestChain() : ReadFromDisk failed\n");
1544 if (!txdb.TxnBegin()) {
1545 printf("SetBestChain() : TxnBegin 2 failed\n");
1548 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1549 if (!block.SetBestChainInner(txdb, pindex))
1554 // Update best block in wallet (so we can detect restored wallets)
1555 bool fIsInitialDownload = IsInitialBlockDownload();
1556 if (!fIsInitialDownload)
1558 const CBlockLocator locator(pindexNew);
1559 ::SetBestChain(locator);
1563 hashBestChain = hash;
1564 pindexBest = pindexNew;
1565 nBestHeight = pindexBest->nHeight;
1566 bnBestChainWork = pindexNew->bnChainWork;
1567 nTimeBestReceived = GetTime();
1568 nTransactionsUpdated++;
1569 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1571 std::string strCmd = GetArg("-blocknotify", "");
1573 if (!fIsInitialDownload && !strCmd.empty())
1575 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1576 boost::thread t(runCommand, strCmd); // thread runs free
1583 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1585 // Check for duplicate
1586 uint256 hash = GetHash();
1587 if (mapBlockIndex.count(hash))
1588 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1590 // Construct new block index object
1591 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1593 return error("AddToBlockIndex() : new CBlockIndex failed");
1594 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1595 pindexNew->phashBlock = &((*mi).first);
1596 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1597 if (miPrev != mapBlockIndex.end())
1599 pindexNew->pprev = (*miPrev).second;
1600 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1602 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1605 if (!txdb.TxnBegin())
1607 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1608 if (!txdb.TxnCommit())
1612 if (pindexNew->bnChainWork > bnBestChainWork)
1613 if (!SetBestChain(txdb, pindexNew))
1618 if (pindexNew == pindexBest)
1620 // Notify UI to display prev block's coinbase if it was ours
1621 static uint256 hashPrevBestCoinBase;
1622 UpdatedTransaction(hashPrevBestCoinBase);
1623 hashPrevBestCoinBase = vtx[0].GetHash();
1633 bool CBlock::CheckBlock() const
1635 // These are checks that are independent of context
1636 // that can be verified before saving an orphan block.
1639 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
1640 return DoS(100, error("CheckBlock() : size limits failed"));
1642 // Check proof of work matches claimed amount
1643 if (!CheckProofOfWork(GetHash(), nBits))
1644 return DoS(50, error("CheckBlock() : proof of work failed"));
1647 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1648 return error("CheckBlock() : block timestamp too far in the future");
1650 // First transaction must be coinbase, the rest must not be
1651 if (vtx.empty() || !vtx[0].IsCoinBase())
1652 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1653 for (unsigned int i = 1; i < vtx.size(); i++)
1654 if (vtx[i].IsCoinBase())
1655 return DoS(100, error("CheckBlock() : more than one coinbase"));
1657 // Check transactions
1658 BOOST_FOREACH(const CTransaction& tx, vtx)
1659 if (!tx.CheckTransaction())
1660 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1662 // Check for duplicate txids. This is caught by ConnectInputs(),
1663 // but catching it earlier avoids a potential DoS attack:
1664 set<uint256> uniqueTx;
1665 BOOST_FOREACH(const CTransaction& tx, vtx)
1667 uniqueTx.insert(tx.GetHash());
1669 if (uniqueTx.size() != vtx.size())
1670 return DoS(100, error("CheckBlock() : duplicate transaction"));
1672 unsigned int nSigOps = 0;
1673 BOOST_FOREACH(const CTransaction& tx, vtx)
1675 nSigOps += tx.GetLegacySigOpCount();
1677 if (nSigOps > MAX_BLOCK_SIGOPS)
1678 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1681 if (hashMerkleRoot != BuildMerkleTree())
1682 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1687 bool CBlock::AcceptBlock()
1689 // Check for duplicate
1690 uint256 hash = GetHash();
1691 if (mapBlockIndex.count(hash))
1692 return error("AcceptBlock() : block already in mapBlockIndex");
1694 // Get prev block index
1695 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1696 if (mi == mapBlockIndex.end())
1697 return DoS(10, error("AcceptBlock() : prev block not found"));
1698 CBlockIndex* pindexPrev = (*mi).second;
1699 int nHeight = pindexPrev->nHeight+1;
1701 // Check proof of work
1702 if (nBits != GetNextWorkRequired(pindexPrev, this))
1703 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1705 // Check timestamp against prev
1706 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1707 return error("AcceptBlock() : block's timestamp is too early");
1709 // Check that all transactions are finalized
1710 BOOST_FOREACH(const CTransaction& tx, vtx)
1711 if (!tx.IsFinal(nHeight, GetBlockTime()))
1712 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1714 // Check that the block chain matches the known block chain up to a checkpoint
1715 if (!Checkpoints::CheckBlock(nHeight, hash))
1716 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1718 // Write block to history file
1719 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
1720 return error("AcceptBlock() : out of disk space");
1721 unsigned int nFile = -1;
1722 unsigned int nBlockPos = 0;
1723 if (!WriteToDisk(nFile, nBlockPos))
1724 return error("AcceptBlock() : WriteToDisk failed");
1725 if (!AddToBlockIndex(nFile, nBlockPos))
1726 return error("AcceptBlock() : AddToBlockIndex failed");
1728 // Relay inventory, but don't relay old inventory during initial block download
1729 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1730 if (hashBestChain == hash)
1733 BOOST_FOREACH(CNode* pnode, vNodes)
1734 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1735 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1741 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1743 // Check for duplicate
1744 uint256 hash = pblock->GetHash();
1745 if (mapBlockIndex.count(hash))
1746 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1747 if (mapOrphanBlocks.count(hash))
1748 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1750 // Preliminary checks
1751 if (!pblock->CheckBlock())
1752 return error("ProcessBlock() : CheckBlock FAILED");
1754 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1755 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1757 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1758 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1762 pfrom->Misbehaving(100);
1763 return error("ProcessBlock() : block with timestamp before last checkpoint");
1766 bnNewBlock.SetCompact(pblock->nBits);
1768 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1769 if (bnNewBlock > bnRequired)
1772 pfrom->Misbehaving(100);
1773 return error("ProcessBlock() : block with too little proof-of-work");
1778 // If don't already have its previous block, shunt it off to holding area until we get it
1779 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1781 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1782 CBlock* pblock2 = new CBlock(*pblock);
1783 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1784 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1786 // Ask this guy to fill in what we're missing
1788 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1793 if (!pblock->AcceptBlock())
1794 return error("ProcessBlock() : AcceptBlock FAILED");
1796 // Recursively process any orphan blocks that depended on this one
1797 vector<uint256> vWorkQueue;
1798 vWorkQueue.push_back(hash);
1799 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
1801 uint256 hashPrev = vWorkQueue[i];
1802 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1803 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1806 CBlock* pblockOrphan = (*mi).second;
1807 if (pblockOrphan->AcceptBlock())
1808 vWorkQueue.push_back(pblockOrphan->GetHash());
1809 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1810 delete pblockOrphan;
1812 mapOrphanBlocksByPrev.erase(hashPrev);
1815 printf("ProcessBlock: ACCEPTED\n");
1826 bool CheckDiskSpace(uint64 nAdditionalBytes)
1828 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1830 // Check for 15MB because database could create another 10MB log file at any time
1831 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1834 string strMessage = _("Warning: Disk space is low");
1835 strMiscWarning = strMessage;
1836 printf("*** %s\n", strMessage.c_str());
1837 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1844 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1848 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1851 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1853 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1862 static unsigned int nCurrentBlockFile = 1;
1864 FILE* AppendBlockFile(unsigned int& nFileRet)
1869 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1872 if (fseek(file, 0, SEEK_END) != 0)
1874 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1875 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1877 nFileRet = nCurrentBlockFile;
1881 nCurrentBlockFile++;
1885 bool LoadBlockIndex(bool fAllowNew)
1889 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1890 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1891 pchMessageStart[0] = 0xfa;
1892 pchMessageStart[1] = 0xbf;
1893 pchMessageStart[2] = 0xb5;
1894 pchMessageStart[3] = 0xda;
1901 if (!txdb.LoadBlockIndex())
1906 // Init with genesis block
1908 if (mapBlockIndex.empty())
1914 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1915 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1916 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1917 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1918 // vMerkleTree: 4a5e1e
1921 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1923 txNew.vin.resize(1);
1924 txNew.vout.resize(1);
1925 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1926 txNew.vout[0].nValue = 50 * COIN;
1927 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1929 block.vtx.push_back(txNew);
1930 block.hashPrevBlock = 0;
1931 block.hashMerkleRoot = block.BuildMerkleTree();
1933 block.nTime = 1231006505;
1934 block.nBits = 0x1d00ffff;
1935 block.nNonce = 2083236893;
1939 block.nTime = 1296688602;
1940 block.nBits = 0x1d07fff8;
1941 block.nNonce = 384568319;
1945 printf("%s\n", block.GetHash().ToString().c_str());
1946 printf("%s\n", hashGenesisBlock.ToString().c_str());
1947 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1948 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1950 assert(block.GetHash() == hashGenesisBlock);
1952 // Start new block file
1954 unsigned int nBlockPos;
1955 if (!block.WriteToDisk(nFile, nBlockPos))
1956 return error("LoadBlockIndex() : writing genesis block to disk failed");
1957 if (!block.AddToBlockIndex(nFile, nBlockPos))
1958 return error("LoadBlockIndex() : genesis block not accepted");
1966 void PrintBlockTree()
1968 // precompute tree structure
1969 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1970 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1972 CBlockIndex* pindex = (*mi).second;
1973 mapNext[pindex->pprev].push_back(pindex);
1975 //while (rand() % 3 == 0)
1976 // mapNext[pindex->pprev].push_back(pindex);
1979 vector<pair<int, CBlockIndex*> > vStack;
1980 vStack.push_back(make_pair(0, pindexGenesisBlock));
1983 while (!vStack.empty())
1985 int nCol = vStack.back().first;
1986 CBlockIndex* pindex = vStack.back().second;
1989 // print split or gap
1990 if (nCol > nPrevCol)
1992 for (int i = 0; i < nCol-1; i++)
1996 else if (nCol < nPrevCol)
1998 for (int i = 0; i < nCol; i++)
2005 for (int i = 0; i < nCol; i++)
2010 block.ReadFromDisk(pindex);
2011 printf("%d (%u,%u) %s %s tx %d",
2015 block.GetHash().ToString().substr(0,20).c_str(),
2016 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2019 PrintWallets(block);
2021 // put the main timechain first
2022 vector<CBlockIndex*>& vNext = mapNext[pindex];
2023 for (unsigned int i = 0; i < vNext.size(); i++)
2025 if (vNext[i]->pnext)
2027 swap(vNext[0], vNext[i]);
2033 for (unsigned int i = 0; i < vNext.size(); i++)
2034 vStack.push_back(make_pair(nCol+i, vNext[i]));
2047 //////////////////////////////////////////////////////////////////////////////
2052 map<uint256, CAlert> mapAlerts;
2053 CCriticalSection cs_mapAlerts;
2055 string GetWarnings(string strFor)
2058 string strStatusBar;
2060 if (GetBoolArg("-testsafemode"))
2063 // Misc warnings like out of disk space and clock is wrong
2064 if (strMiscWarning != "")
2067 strStatusBar = strMiscWarning;
2070 // Longer invalid proof-of-work chain
2071 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2074 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2080 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2082 const CAlert& alert = item.second;
2083 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2085 nPriority = alert.nPriority;
2086 strStatusBar = alert.strStatusBar;
2091 if (strFor == "statusbar")
2092 return strStatusBar;
2093 else if (strFor == "rpc")
2095 assert(!"GetWarnings() : invalid parameter");
2099 bool CAlert::ProcessAlert()
2101 if (!CheckSignature())
2108 // Cancel previous alerts
2109 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2111 const CAlert& alert = (*mi).second;
2114 printf("cancelling alert %d\n", alert.nID);
2115 mapAlerts.erase(mi++);
2117 else if (!alert.IsInEffect())
2119 printf("expiring alert %d\n", alert.nID);
2120 mapAlerts.erase(mi++);
2126 // Check if this alert has been cancelled
2127 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2129 const CAlert& alert = item.second;
2130 if (alert.Cancels(*this))
2132 printf("alert already cancelled by %d\n", alert.nID);
2138 mapAlerts.insert(make_pair(GetHash(), *this));
2141 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2153 //////////////////////////////////////////////////////////////////////////////
2159 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2165 bool txInMap = false;
2168 txInMap = (mempool.exists(inv.hash));
2171 mapOrphanTransactions.count(inv.hash) ||
2172 txdb.ContainsTx(inv.hash);
2176 return mapBlockIndex.count(inv.hash) ||
2177 mapOrphanBlocks.count(inv.hash);
2179 // Don't know what it is, just say we already got one
2186 // The message start string is designed to be unlikely to occur in normal data.
2187 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2188 // a large 4-byte int at any alignment.
2189 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2192 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2194 static map<CService, vector<unsigned char> > mapReuseKey;
2195 RandAddSeedPerfmon();
2197 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2198 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2200 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2202 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2210 if (strCommand == "version")
2212 // Each connection can only send one version message
2213 if (pfrom->nVersion != 0)
2215 pfrom->Misbehaving(1);
2223 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2224 if (pfrom->nVersion < MIN_PROTO_VERSION)
2226 // Since February 20, 2012, the protocol is initiated at version 209,
2227 // and earlier versions are no longer supported
2228 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2229 pfrom->fDisconnect = true;
2233 if (pfrom->nVersion == 10300)
2234 pfrom->nVersion = 300;
2236 vRecv >> addrFrom >> nNonce;
2238 vRecv >> pfrom->strSubVer;
2240 vRecv >> pfrom->nStartingHeight;
2242 // Disconnect if we connected to ourself
2243 if (nNonce == nLocalHostNonce && nNonce > 1)
2245 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2246 pfrom->fDisconnect = true;
2250 // Be shy and don't send version until we hear
2251 if (pfrom->fInbound)
2252 pfrom->PushVersion();
2254 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2256 AddTimeData(pfrom->addr, nTime);
2259 pfrom->PushMessage("verack");
2260 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2262 if (!pfrom->fInbound)
2264 // Advertise our address
2265 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2266 !IsInitialBlockDownload())
2268 CAddress addr(addrLocalHost);
2269 addr.nTime = GetAdjustedTime();
2270 pfrom->PushAddress(addr);
2273 // Get recent addresses
2274 if (pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
2276 pfrom->PushMessage("getaddr");
2277 pfrom->fGetAddr = true;
2279 addrman.Good(pfrom->addr);
2281 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2283 addrman.Add(addrFrom, addrFrom);
2284 addrman.Good(addrFrom);
2288 // Ask the first connected node for block updates
2289 static int nAskedForBlocks = 0;
2290 if (!pfrom->fClient &&
2291 (pfrom->nVersion < NOBLKS_VERSION_START ||
2292 pfrom->nVersion >= NOBLKS_VERSION_END) &&
2293 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2296 pfrom->PushGetBlocks(pindexBest, uint256(0));
2302 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2303 item.second.RelayTo(pfrom);
2306 pfrom->fSuccessfullyConnected = true;
2308 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2310 cPeerBlockCounts.input(pfrom->nStartingHeight);
2314 else if (pfrom->nVersion == 0)
2316 // Must have a version message before anything else
2317 pfrom->Misbehaving(1);
2322 else if (strCommand == "verack")
2324 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2328 else if (strCommand == "addr")
2330 vector<CAddress> vAddr;
2333 // Don't want addr from older versions unless seeding
2334 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
2336 if (vAddr.size() > 1000)
2338 pfrom->Misbehaving(20);
2339 return error("message addr size() = %d", vAddr.size());
2342 // Store the new addresses
2343 int64 nNow = GetAdjustedTime();
2344 int64 nSince = nNow - 10 * 60;
2345 BOOST_FOREACH(CAddress& addr, vAddr)
2349 // ignore IPv6 for now, since it isn't implemented anyway
2352 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2353 addr.nTime = nNow - 5 * 24 * 60 * 60;
2354 pfrom->AddAddressKnown(addr);
2355 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2357 // Relay to a limited number of other nodes
2360 // Use deterministic randomness to send to the same nodes for 24 hours
2361 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2362 static uint256 hashSalt;
2364 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2365 int64 hashAddr = addr.GetHash();
2366 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2367 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2368 multimap<uint256, CNode*> mapMix;
2369 BOOST_FOREACH(CNode* pnode, vNodes)
2371 if (pnode->nVersion < CADDR_TIME_VERSION)
2373 unsigned int nPointer;
2374 memcpy(&nPointer, &pnode, sizeof(nPointer));
2375 uint256 hashKey = hashRand ^ nPointer;
2376 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2377 mapMix.insert(make_pair(hashKey, pnode));
2379 int nRelayNodes = 2;
2380 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2381 ((*mi).second)->PushAddress(addr);
2385 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2386 if (vAddr.size() < 1000)
2387 pfrom->fGetAddr = false;
2391 else if (strCommand == "inv")
2395 if (vInv.size() > 50000)
2397 pfrom->Misbehaving(20);
2398 return error("message inv size() = %d", vInv.size());
2401 // find last block in inv vector
2402 unsigned int nLastBlock = (unsigned int)(-1);
2403 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
2404 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
2405 nLastBlock = vInv.size() - 1 - nInv;
2410 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
2412 const CInv &inv = vInv[nInv];
2416 pfrom->AddInventoryKnown(inv);
2418 bool fAlreadyHave = AlreadyHave(txdb, inv);
2420 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2424 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
2425 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2426 } else if (nInv == nLastBlock) {
2427 // In case we are on a very long side-chain, it is possible that we already have
2428 // the last block in an inv bundle sent in response to getblocks. Try to detect
2429 // this situation and push another getblocks to continue.
2430 std::vector<CInv> vGetData(1,inv);
2431 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
2433 printf("force request: %s\n", inv.ToString().c_str());
2436 // Track requests for our stuff
2437 Inventory(inv.hash);
2442 else if (strCommand == "getdata")
2446 if (vInv.size() > 50000)
2448 pfrom->Misbehaving(20);
2449 return error("message getdata size() = %d", vInv.size());
2452 BOOST_FOREACH(const CInv& inv, vInv)
2456 printf("received getdata for: %s\n", inv.ToString().c_str());
2458 if (inv.type == MSG_BLOCK)
2460 // Send block from disk
2461 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2462 if (mi != mapBlockIndex.end())
2465 block.ReadFromDisk((*mi).second);
2466 pfrom->PushMessage("block", block);
2468 // Trigger them to send a getblocks request for the next batch of inventory
2469 if (inv.hash == pfrom->hashContinue)
2471 // Bypass PushInventory, this must send even if redundant,
2472 // and we want it right after the last block so they don't
2473 // wait for other stuff first.
2475 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2476 pfrom->PushMessage("inv", vInv);
2477 pfrom->hashContinue = 0;
2481 else if (inv.IsKnownType())
2483 // Send stream from relay memory
2486 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2487 if (mi != mapRelay.end())
2488 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2492 // Track requests for our stuff
2493 Inventory(inv.hash);
2498 else if (strCommand == "getblocks")
2500 CBlockLocator locator;
2502 vRecv >> locator >> hashStop;
2504 // Find the last block the caller has in the main chain
2505 CBlockIndex* pindex = locator.GetBlockIndex();
2507 // Send the rest of the chain
2509 pindex = pindex->pnext;
2510 int nLimit = 500 + locator.GetDistanceBack();
2511 unsigned int nBytes = 0;
2512 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2513 for (; pindex; pindex = pindex->pnext)
2515 if (pindex->GetBlockHash() == hashStop)
2517 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2520 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2522 block.ReadFromDisk(pindex, true);
2523 nBytes += block.GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
2524 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2526 // When this block is requested, we'll send an inv that'll make them
2527 // getblocks the next batch of inventory.
2528 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2529 pfrom->hashContinue = pindex->GetBlockHash();
2536 else if (strCommand == "getheaders")
2538 CBlockLocator locator;
2540 vRecv >> locator >> hashStop;
2542 CBlockIndex* pindex = NULL;
2543 if (locator.IsNull())
2545 // If locator is null, return the hashStop block
2546 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2547 if (mi == mapBlockIndex.end())
2549 pindex = (*mi).second;
2553 // Find the last block the caller has in the main chain
2554 pindex = locator.GetBlockIndex();
2556 pindex = pindex->pnext;
2559 vector<CBlock> vHeaders;
2561 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2562 for (; pindex; pindex = pindex->pnext)
2564 vHeaders.push_back(pindex->GetBlockHeader());
2565 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2568 pfrom->PushMessage("headers", vHeaders);
2572 else if (strCommand == "tx")
2574 vector<uint256> vWorkQueue;
2575 CDataStream vMsg(vRecv);
2580 CInv inv(MSG_TX, tx.GetHash());
2581 pfrom->AddInventoryKnown(inv);
2583 bool fMissingInputs = false;
2584 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2586 SyncWithWallets(tx, NULL, true);
2587 RelayMessage(inv, vMsg);
2588 mapAlreadyAskedFor.erase(inv);
2589 vWorkQueue.push_back(inv.hash);
2591 // Recursively process any orphan transactions that depended on this one
2592 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2594 uint256 hashPrev = vWorkQueue[i];
2595 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2596 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2599 const CDataStream& vMsg = *((*mi).second);
2601 CDataStream(vMsg) >> tx;
2602 CInv inv(MSG_TX, tx.GetHash());
2604 if (tx.AcceptToMemoryPool(txdb, true))
2606 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2607 SyncWithWallets(tx, NULL, true);
2608 RelayMessage(inv, vMsg);
2609 mapAlreadyAskedFor.erase(inv);
2610 vWorkQueue.push_back(inv.hash);
2615 BOOST_FOREACH(uint256 hash, vWorkQueue)
2616 EraseOrphanTx(hash);
2618 else if (fMissingInputs)
2620 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2623 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2624 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2626 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
2628 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2632 else if (strCommand == "block")
2637 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2640 CInv inv(MSG_BLOCK, block.GetHash());
2641 pfrom->AddInventoryKnown(inv);
2643 if (ProcessBlock(pfrom, &block))
2644 mapAlreadyAskedFor.erase(inv);
2645 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2649 else if (strCommand == "getaddr")
2651 pfrom->vAddrToSend.clear();
2652 vector<CAddress> vAddr = addrman.GetAddr();
2653 BOOST_FOREACH(const CAddress &addr, vAddr)
2654 pfrom->PushAddress(addr);
2658 else if (strCommand == "checkorder")
2663 if (!GetBoolArg("-allowreceivebyip"))
2665 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2672 /// we have a chance to check the order here
2674 // Keep giving the same key to the same ip until they use it
2675 if (!mapReuseKey.count(pfrom->addr))
2676 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2678 // Send back approval of order and pubkey to use
2679 CScript scriptPubKey;
2680 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2681 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2685 else if (strCommand == "reply")
2690 CRequestTracker tracker;
2692 LOCK(pfrom->cs_mapRequests);
2693 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2694 if (mi != pfrom->mapRequests.end())
2696 tracker = (*mi).second;
2697 pfrom->mapRequests.erase(mi);
2700 if (!tracker.IsNull())
2701 tracker.fn(tracker.param1, vRecv);
2705 else if (strCommand == "ping")
2707 if (pfrom->nVersion > BIP0031_VERSION)
2711 // Echo the message back with the nonce. This allows for two useful features:
2713 // 1) A remote node can quickly check if the connection is operational
2714 // 2) Remote nodes can measure the latency of the network thread. If this node
2715 // is overloaded it won't respond to pings quickly and the remote node can
2716 // avoid sending us more work, like chain download requests.
2718 // The nonce stops the remote getting confused between different pings: without
2719 // it, if the remote node sends a ping once per second and this node takes 5
2720 // seconds to respond to each, the 5th ping the remote sends would appear to
2721 // return very quickly.
2722 pfrom->PushMessage("pong", nonce);
2727 else if (strCommand == "alert")
2732 if (alert.ProcessAlert())
2735 pfrom->setKnown.insert(alert.GetHash());
2738 BOOST_FOREACH(CNode* pnode, vNodes)
2739 alert.RelayTo(pnode);
2747 // Ignore unknown commands for extensibility
2751 // Update the last seen time for this node's address
2752 if (pfrom->fNetworkNode)
2753 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2754 AddressCurrentlyConnected(pfrom->addr);
2760 bool ProcessMessages(CNode* pfrom)
2762 CDataStream& vRecv = pfrom->vRecv;
2766 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2770 // (4) message start
2779 // Scan for message start
2780 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2781 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2782 if (vRecv.end() - pstart < nHeaderSize)
2784 if ((int)vRecv.size() > nHeaderSize)
2786 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2787 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2791 if (pstart - vRecv.begin() > 0)
2792 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2793 vRecv.erase(vRecv.begin(), pstart);
2796 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2801 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2804 string strCommand = hdr.GetCommand();
2807 unsigned int nMessageSize = hdr.nMessageSize;
2808 if (nMessageSize > MAX_SIZE)
2810 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2813 if (nMessageSize > vRecv.size())
2815 // Rewind and wait for rest of message
2816 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2821 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2822 unsigned int nChecksum = 0;
2823 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2824 if (nChecksum != hdr.nChecksum)
2826 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2827 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2831 // Copy message to its own buffer
2832 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2833 vRecv.ignore(nMessageSize);
2841 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2846 catch (std::ios_base::failure& e)
2848 if (strstr(e.what(), "end of data"))
2850 // Allow exceptions from underlength message on vRecv
2851 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2853 else if (strstr(e.what(), "size too large"))
2855 // Allow exceptions from overlong size
2856 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2860 PrintExceptionContinue(&e, "ProcessMessages()");
2863 catch (std::exception& e) {
2864 PrintExceptionContinue(&e, "ProcessMessages()");
2866 PrintExceptionContinue(NULL, "ProcessMessages()");
2870 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2878 bool SendMessages(CNode* pto, bool fSendTrickle)
2880 TRY_LOCK(cs_main, lockMain);
2882 // Don't send anything until we get their version message
2883 if (pto->nVersion == 0)
2886 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
2888 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
2889 if (pto->nVersion > BIP0031_VERSION)
2890 pto->PushMessage("ping", 0);
2892 pto->PushMessage("ping");
2895 // Resend wallet transactions that haven't gotten in a block yet
2896 ResendWalletTransactions();
2898 // Address refresh broadcast
2899 static int64 nLastRebroadcast;
2900 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2904 BOOST_FOREACH(CNode* pnode, vNodes)
2906 // Periodically clear setAddrKnown to allow refresh broadcasts
2907 if (nLastRebroadcast)
2908 pnode->setAddrKnown.clear();
2910 // Rebroadcast our address
2911 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2913 CAddress addr(addrLocalHost);
2914 addr.nTime = GetAdjustedTime();
2915 pnode->PushAddress(addr);
2919 nLastRebroadcast = GetTime();
2927 vector<CAddress> vAddr;
2928 vAddr.reserve(pto->vAddrToSend.size());
2929 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2931 // returns true if wasn't already contained in the set
2932 if (pto->setAddrKnown.insert(addr).second)
2934 vAddr.push_back(addr);
2935 // receiver rejects addr messages larger than 1000
2936 if (vAddr.size() >= 1000)
2938 pto->PushMessage("addr", vAddr);
2943 pto->vAddrToSend.clear();
2945 pto->PushMessage("addr", vAddr);
2950 // Message: inventory
2953 vector<CInv> vInvWait;
2955 LOCK(pto->cs_inventory);
2956 vInv.reserve(pto->vInventoryToSend.size());
2957 vInvWait.reserve(pto->vInventoryToSend.size());
2958 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2960 if (pto->setInventoryKnown.count(inv))
2963 // trickle out tx inv to protect privacy
2964 if (inv.type == MSG_TX && !fSendTrickle)
2966 // 1/4 of tx invs blast to all immediately
2967 static uint256 hashSalt;
2969 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2970 uint256 hashRand = inv.hash ^ hashSalt;
2971 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2972 bool fTrickleWait = ((hashRand & 3) != 0);
2974 // always trickle our own transactions
2978 if (GetTransaction(inv.hash, wtx))
2980 fTrickleWait = true;
2985 vInvWait.push_back(inv);
2990 // returns true if wasn't already contained in the set
2991 if (pto->setInventoryKnown.insert(inv).second)
2993 vInv.push_back(inv);
2994 if (vInv.size() >= 1000)
2996 pto->PushMessage("inv", vInv);
3001 pto->vInventoryToSend = vInvWait;
3004 pto->PushMessage("inv", vInv);
3010 vector<CInv> vGetData;
3011 int64 nNow = GetTime() * 1000000;
3013 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3015 const CInv& inv = (*pto->mapAskFor.begin()).second;
3016 if (!AlreadyHave(txdb, inv))
3018 printf("sending getdata: %s\n", inv.ToString().c_str());
3019 vGetData.push_back(inv);
3020 if (vGetData.size() >= 1000)
3022 pto->PushMessage("getdata", vGetData);
3026 mapAlreadyAskedFor[inv] = nNow;
3027 pto->mapAskFor.erase(pto->mapAskFor.begin());
3029 if (!vGetData.empty())
3030 pto->PushMessage("getdata", vGetData);
3049 //////////////////////////////////////////////////////////////////////////////
3054 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3056 unsigned char* pdata = (unsigned char*)pbuffer;
3057 unsigned int blocks = 1 + ((len + 8) / 64);
3058 unsigned char* pend = pdata + 64 * blocks;
3059 memset(pdata + len, 0, 64 * blocks - len);
3061 unsigned int bits = len * 8;
3062 pend[-1] = (bits >> 0) & 0xff;
3063 pend[-2] = (bits >> 8) & 0xff;
3064 pend[-3] = (bits >> 16) & 0xff;
3065 pend[-4] = (bits >> 24) & 0xff;
3069 static const unsigned int pSHA256InitState[8] =
3070 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3072 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3075 unsigned char data[64];
3079 for (int i = 0; i < 16; i++)
3080 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3082 for (int i = 0; i < 8; i++)
3083 ctx.h[i] = ((uint32_t*)pinit)[i];
3085 SHA256_Update(&ctx, data, sizeof(data));
3086 for (int i = 0; i < 8; i++)
3087 ((uint32_t*)pstate)[i] = ctx.h[i];
3091 // ScanHash scans nonces looking for a hash with at least some zero bits.
3092 // It operates on big endian data. Caller does the byte reversing.
3093 // All input buffers are 16-byte aligned. nNonce is usually preserved
3094 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3095 // the block is rebuilt and nNonce starts over at zero.
3097 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3099 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3103 // Hash pdata using pmidstate as the starting state into
3104 // preformatted buffer phash1, then hash phash1 into phash
3106 SHA256Transform(phash1, pdata, pmidstate);
3107 SHA256Transform(phash, phash1, pSHA256InitState);
3109 // Return the nonce if the hash has at least some zero bits,
3110 // caller will check if it has enough to reach the target
3111 if (((unsigned short*)phash)[14] == 0)
3114 // If nothing found after trying for a while, return -1
3115 if ((nNonce & 0xffff) == 0)
3117 nHashesDone = 0xffff+1;
3118 return (unsigned int) -1;
3123 // Some explaining would be appreciated
3128 set<uint256> setDependsOn;
3131 COrphan(CTransaction* ptxIn)
3139 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3140 BOOST_FOREACH(uint256 hash, setDependsOn)
3141 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3146 uint64 nLastBlockTx = 0;
3147 uint64 nLastBlockSize = 0;
3149 CBlock* CreateNewBlock(CReserveKey& reservekey)
3151 CBlockIndex* pindexPrev = pindexBest;
3154 auto_ptr<CBlock> pblock(new CBlock());
3158 // Create coinbase tx
3160 txNew.vin.resize(1);
3161 txNew.vin[0].prevout.SetNull();
3162 txNew.vout.resize(1);
3163 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3165 // Add our coinbase tx as first transaction
3166 pblock->vtx.push_back(txNew);
3168 // Collect memory pool transactions into the block
3171 LOCK2(cs_main, mempool.cs);
3174 // Priority order to process transactions
3175 list<COrphan> vOrphan; // list memory doesn't move
3176 map<uint256, vector<COrphan*> > mapDependers;
3177 multimap<double, CTransaction*> mapPriority;
3178 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
3180 CTransaction& tx = (*mi).second;
3181 if (tx.IsCoinBase() || !tx.IsFinal())
3184 COrphan* porphan = NULL;
3185 double dPriority = 0;
3186 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3188 // Read prev transaction
3189 CTransaction txPrev;
3191 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3193 // Has to wait for dependencies
3196 // Use list for automatic deletion
3197 vOrphan.push_back(COrphan(&tx));
3198 porphan = &vOrphan.back();
3200 mapDependers[txin.prevout.hash].push_back(porphan);
3201 porphan->setDependsOn.insert(txin.prevout.hash);
3204 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3206 // Read block header
3207 int nConf = txindex.GetDepthInMainChain();
3209 dPriority += (double)nValueIn * nConf;
3211 if (fDebug && GetBoolArg("-printpriority"))
3212 printf("priority nValueIn=%-12"PRI64d" nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3215 // Priority is sum(valuein * age) / txsize
3216 dPriority /= ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3219 porphan->dPriority = dPriority;
3221 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3223 if (fDebug && GetBoolArg("-printpriority"))
3225 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3232 // Collect transactions into block
3233 map<uint256, CTxIndex> mapTestPool;
3234 uint64 nBlockSize = 1000;
3235 uint64 nBlockTx = 0;
3236 int nBlockSigOps = 100;
3237 while (!mapPriority.empty())
3239 // Take highest priority transaction off priority queue
3240 double dPriority = -(*mapPriority.begin()).first;
3241 CTransaction& tx = *(*mapPriority.begin()).second;
3242 mapPriority.erase(mapPriority.begin());
3245 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3246 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3249 // Legacy limits on sigOps:
3250 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
3251 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3254 // Transaction fee required depends on block size
3255 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3256 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3258 // Connecting shouldn't fail due to dependency on other memory pool transactions
3259 // because we're already processing them in order of dependency
3260 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3261 MapPrevTx mapInputs;
3263 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3266 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3267 if (nTxFees < nMinFee)
3270 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3271 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3274 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3276 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3277 swap(mapTestPool, mapTestPoolTmp);
3280 pblock->vtx.push_back(tx);
3281 nBlockSize += nTxSize;
3283 nBlockSigOps += nTxSigOps;
3286 // Add transactions that depend on this one to the priority queue
3287 uint256 hash = tx.GetHash();
3288 if (mapDependers.count(hash))
3290 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3292 if (!porphan->setDependsOn.empty())
3294 porphan->setDependsOn.erase(hash);
3295 if (porphan->setDependsOn.empty())
3296 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3302 nLastBlockTx = nBlockTx;
3303 nLastBlockSize = nBlockSize;
3304 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3307 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3310 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3311 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3312 pblock->UpdateTime(pindexPrev);
3313 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3316 return pblock.release();
3320 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3322 // Update nExtraNonce
3323 static uint256 hashPrevBlock;
3324 if (hashPrevBlock != pblock->hashPrevBlock)
3327 hashPrevBlock = pblock->hashPrevBlock;
3330 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3331 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3333 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3337 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3340 // Prebuild hash buffers
3347 uint256 hashPrevBlock;
3348 uint256 hashMerkleRoot;
3351 unsigned int nNonce;
3354 unsigned char pchPadding0[64];
3356 unsigned char pchPadding1[64];
3359 memset(&tmp, 0, sizeof(tmp));
3361 tmp.block.nVersion = pblock->nVersion;
3362 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3363 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3364 tmp.block.nTime = pblock->nTime;
3365 tmp.block.nBits = pblock->nBits;
3366 tmp.block.nNonce = pblock->nNonce;
3368 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3369 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3371 // Byte swap all the input buffer
3372 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
3373 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3375 // Precalc the first half of the first hash, which stays constant
3376 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3378 memcpy(pdata, &tmp.block, 128);
3379 memcpy(phash1, &tmp.hash1, 64);
3383 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3385 uint256 hash = pblock->GetHash();
3386 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3388 if (hash > hashTarget)
3392 printf("BitcoinMiner:\n");
3393 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3395 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3396 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3401 if (pblock->hashPrevBlock != hashBestChain)
3402 return error("BitcoinMiner : generated block is stale");
3404 // Remove key from key pool
3405 reservekey.KeepKey();
3407 // Track how many getdata requests this block gets
3409 LOCK(wallet.cs_wallet);
3410 wallet.mapRequestCount[pblock->GetHash()] = 0;
3413 // Process this block the same as if we had received it from another node
3414 if (!ProcessBlock(NULL, pblock))
3415 return error("BitcoinMiner : ProcessBlock, block not accepted");
3421 void static ThreadBitcoinMiner(void* parg);
3423 static bool fGenerateBitcoins = false;
3424 static bool fLimitProcessors = false;
3425 static int nLimitProcessors = -1;
3427 void static BitcoinMiner(CWallet *pwallet)
3429 printf("BitcoinMiner started\n");
3430 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3432 // Each thread has its own key and counter
3433 CReserveKey reservekey(pwallet);
3434 unsigned int nExtraNonce = 0;
3436 while (fGenerateBitcoins)
3440 while (vNodes.empty() || IsInitialBlockDownload())
3445 if (!fGenerateBitcoins)
3453 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3454 CBlockIndex* pindexPrev = pindexBest;
3456 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3459 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3461 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3465 // Prebuild hash buffers
3467 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3468 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3469 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3471 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3473 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3474 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3475 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3481 int64 nStart = GetTime();
3482 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3484 uint256& hash = *alignup<16>(hashbuf);
3487 unsigned int nHashesDone = 0;
3488 unsigned int nNonceFound;
3491 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3492 (char*)&hash, nHashesDone);
3494 // Check if something found
3495 if (nNonceFound != (unsigned int) -1)
3497 for (unsigned int i = 0; i < sizeof(hash)/4; i++)
3498 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3500 if (hash <= hashTarget)
3503 pblock->nNonce = ByteReverse(nNonceFound);
3504 assert(hash == pblock->GetHash());
3506 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3507 CheckWork(pblock.get(), *pwalletMain, reservekey);
3508 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3514 static int64 nHashCounter;
3515 if (nHPSTimerStart == 0)
3517 nHPSTimerStart = GetTimeMillis();
3521 nHashCounter += nHashesDone;
3522 if (GetTimeMillis() - nHPSTimerStart > 4000)
3524 static CCriticalSection cs;
3527 if (GetTimeMillis() - nHPSTimerStart > 4000)
3529 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3530 nHPSTimerStart = GetTimeMillis();
3532 static int64 nLogTime;
3533 if (GetTime() - nLogTime > 30 * 60)
3535 nLogTime = GetTime();
3536 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3537 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3543 // Check for stop or if block needs to be rebuilt
3546 if (!fGenerateBitcoins)
3548 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3552 if (nBlockNonce >= 0xffff0000)
3554 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3556 if (pindexPrev != pindexBest)
3559 // Update nTime every few seconds
3560 pblock->UpdateTime(pindexPrev);
3561 nBlockTime = ByteReverse(pblock->nTime);
3564 // Changing pblock->nTime can change work required on testnet:
3565 nBlockBits = ByteReverse(pblock->nBits);
3566 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3572 void static ThreadBitcoinMiner(void* parg)
3574 CWallet* pwallet = (CWallet*)parg;
3577 vnThreadsRunning[THREAD_MINER]++;
3578 BitcoinMiner(pwallet);
3579 vnThreadsRunning[THREAD_MINER]--;
3581 catch (std::exception& e) {
3582 vnThreadsRunning[THREAD_MINER]--;
3583 PrintException(&e, "ThreadBitcoinMiner()");
3585 vnThreadsRunning[THREAD_MINER]--;
3586 PrintException(NULL, "ThreadBitcoinMiner()");
3589 if (vnThreadsRunning[THREAD_MINER] == 0)
3591 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3595 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3597 fGenerateBitcoins = fGenerate;
3598 nLimitProcessors = GetArg("-genproclimit", -1);
3599 if (nLimitProcessors == 0)
3600 fGenerateBitcoins = false;
3601 fLimitProcessors = (nLimitProcessors != -1);
3605 int nProcessors = boost::thread::hardware_concurrency();
3606 printf("%d processors\n", nProcessors);
3607 if (nProcessors < 1)
3609 if (fLimitProcessors && nProcessors > nLimitProcessors)
3610 nProcessors = nLimitProcessors;
3611 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3612 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3613 for (int i = 0; i < nAddThreads; i++)
3615 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3616 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");