1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
5 #include "checkpoints.h"
9 #include "ui_interface.h"
10 #include <boost/algorithm/string/replace.hpp>
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
27 unsigned int nTransactionsUpdated = 0;
29 map<uint256, CBlockIndex*> mapBlockIndex;
30 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
31 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
32 CBlockIndex* pindexGenesisBlock = NULL;
34 CBigNum bnBestChainWork = 0;
35 CBigNum bnBestInvalidWork = 0;
36 uint256 hashBestChain = 0;
37 CBlockIndex* pindexBest = NULL;
38 int64 nTimeBestReceived = 0;
40 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
42 map<uint256, CBlock*> mapOrphanBlocks;
43 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
45 map<uint256, CDataStream*> mapOrphanTransactions;
46 map<uint256, map<uint256, CDataStream*> > mapOrphanTransactionsByPrev;
48 // Constant stuff for coinbase transactions we create:
49 CScript COINBASE_FLAGS;
51 const string strMessageMagic = "Bitcoin Signed Message:\n";
57 int64 nTransactionFee = 0;
61 //////////////////////////////////////////////////////////////////////////////
63 // dispatching functions
66 // These functions dispatch to one or all registered wallets
69 void RegisterWallet(CWallet* pwalletIn)
72 LOCK(cs_setpwalletRegistered);
73 setpwalletRegistered.insert(pwalletIn);
77 void UnregisterWallet(CWallet* pwalletIn)
80 LOCK(cs_setpwalletRegistered);
81 setpwalletRegistered.erase(pwalletIn);
85 // check whether the passed transaction is from us
86 bool static IsFromMe(CTransaction& tx)
88 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
89 if (pwallet->IsFromMe(tx))
94 // get the wallet transaction with the given hash (if it exists)
95 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
97 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
98 if (pwallet->GetTransaction(hashTx,wtx))
103 // erases transaction with the given hash from all wallets
104 void static EraseFromWallets(uint256 hash)
106 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
107 pwallet->EraseFromWallet(hash);
110 // make sure all wallets know about the given transaction, in the given block
111 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
117 // notify wallets about a new best chain
118 void static SetBestChain(const CBlockLocator& loc)
120 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
121 pwallet->SetBestChain(loc);
124 // notify wallets about an updated transaction
125 void static UpdatedTransaction(const uint256& hashTx)
127 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
128 pwallet->UpdatedTransaction(hashTx);
132 void static PrintWallets(const CBlock& block)
134 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
135 pwallet->PrintWallet(block);
138 // notify wallets about an incoming inventory (for request counts)
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 // ask wallets to resend their transactions
146 void static ResendWalletTransactions()
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->ResendWalletTransactions();
158 //////////////////////////////////////////////////////////////////////////////
160 // mapOrphanTransactions
163 bool AddOrphanTx(const CDataStream& vMsg)
166 CDataStream(vMsg) >> tx;
167 uint256 hash = tx.GetHash();
168 if (mapOrphanTransactions.count(hash))
171 CDataStream* pvMsg = new CDataStream(vMsg);
173 // Ignore big transactions, to avoid a
174 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
175 // large transaction with a missing parent then we assume
176 // it will rebroadcast it later, after the parent transaction(s)
177 // have been mined or received.
178 // 10,000 orphans, each of which is at most 5,000 bytes big is
179 // at most 500 megabytes of orphans:
180 if (pvMsg->size() > 5000)
183 printf("ignoring large orphan tx (size: %u, hash: %s)\n", pvMsg->size(), hash.ToString().substr(0,10).c_str());
187 mapOrphanTransactions[hash] = pvMsg;
188 BOOST_FOREACH(const CTxIn& txin, tx.vin)
189 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(make_pair(hash, pvMsg));
191 printf("stored orphan tx %s (mapsz %u)\n", hash.ToString().substr(0,10).c_str(),
192 mapOrphanTransactions.size());
196 void static EraseOrphanTx(uint256 hash)
198 if (!mapOrphanTransactions.count(hash))
200 const CDataStream* pvMsg = mapOrphanTransactions[hash];
202 CDataStream(*pvMsg) >> tx;
203 BOOST_FOREACH(const CTxIn& txin, tx.vin)
205 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
206 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
207 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
210 mapOrphanTransactions.erase(hash);
213 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
215 unsigned int nEvicted = 0;
216 while (mapOrphanTransactions.size() > nMaxOrphans)
218 // Evict a random orphan:
219 uint256 randomhash = GetRandHash();
220 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
221 if (it == mapOrphanTransactions.end())
222 it = mapOrphanTransactions.begin();
223 EraseOrphanTx(it->first);
235 //////////////////////////////////////////////////////////////////////////////
237 // CTransaction and CTxIndex
240 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
243 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
245 if (!ReadFromDisk(txindexRet.pos))
247 if (prevout.n >= vout.size())
255 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
258 return ReadFromDisk(txdb, prevout, txindex);
261 bool CTransaction::ReadFromDisk(COutPoint prevout)
265 return ReadFromDisk(txdb, prevout, txindex);
268 bool CTransaction::IsStandard() const
270 BOOST_FOREACH(const CTxIn& txin, vin)
272 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
273 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
274 // ~65-byte public keys, plus a few script ops.
275 if (txin.scriptSig.size() > 500)
277 if (!txin.scriptSig.IsPushOnly())
280 BOOST_FOREACH(const CTxOut& txout, vout)
281 if (!::IsStandard(txout.scriptPubKey))
287 // Check transaction inputs, and make sure any
288 // pay-to-script-hash transactions are evaluating IsStandard scripts
290 // Why bother? To avoid denial-of-service attacks; an attacker
291 // can submit a standard HASH... OP_EQUAL transaction,
292 // which will get accepted into blocks. The redemption
293 // script can be anything; an attacker could use a very
294 // expensive-to-check-upon-redemption script like:
295 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
297 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
300 return true; // Coinbases don't use vin normally
302 for (unsigned int i = 0; i < vin.size(); i++)
304 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
306 vector<vector<unsigned char> > vSolutions;
307 txnouttype whichType;
308 // get the scriptPubKey corresponding to this input:
309 const CScript& prevScript = prev.scriptPubKey;
310 if (!Solver(prevScript, whichType, vSolutions))
312 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
313 if (nArgsExpected < 0)
316 // Transactions with extra stuff in their scriptSigs are
317 // non-standard. Note that this EvalScript() call will
318 // be quick, because if there are any operations
319 // beside "push data" in the scriptSig the
320 // IsStandard() call returns false
321 vector<vector<unsigned char> > stack;
322 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
325 if (whichType == TX_SCRIPTHASH)
329 CScript subscript(stack.back().begin(), stack.back().end());
330 vector<vector<unsigned char> > vSolutions2;
331 txnouttype whichType2;
332 if (!Solver(subscript, whichType2, vSolutions2))
334 if (whichType2 == TX_SCRIPTHASH)
338 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
341 nArgsExpected += tmpExpected;
344 if (stack.size() != (unsigned int)nArgsExpected)
352 CTransaction::GetLegacySigOpCount() const
354 unsigned int nSigOps = 0;
355 BOOST_FOREACH(const CTxIn& txin, vin)
357 nSigOps += txin.scriptSig.GetSigOpCount(false);
359 BOOST_FOREACH(const CTxOut& txout, vout)
361 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
367 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
379 // Load the block this tx is in
381 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
383 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
388 // Update the tx's hashBlock
389 hashBlock = pblock->GetHash();
391 // Locate the transaction
392 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
393 if (pblock->vtx[nIndex] == *(CTransaction*)this)
395 if (nIndex == (int)pblock->vtx.size())
397 vMerkleBranch.clear();
399 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
403 // Fill in merkle branch
404 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
407 // Is the tx in a block that's in the main chain
408 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
409 if (mi == mapBlockIndex.end())
411 CBlockIndex* pindex = (*mi).second;
412 if (!pindex || !pindex->IsInMainChain())
415 return pindexBest->nHeight - pindex->nHeight + 1;
424 bool CTransaction::CheckTransaction() const
426 // Basic checks that don't depend on any context
428 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
430 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
432 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
433 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
435 // Check for negative or overflow output values
437 BOOST_FOREACH(const CTxOut& txout, vout)
439 if (txout.nValue < 0)
440 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
441 if (txout.nValue > MAX_MONEY)
442 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
443 nValueOut += txout.nValue;
444 if (!MoneyRange(nValueOut))
445 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
448 // Check for duplicate inputs
449 set<COutPoint> vInOutPoints;
450 BOOST_FOREACH(const CTxIn& txin, vin)
452 if (vInOutPoints.count(txin.prevout))
454 vInOutPoints.insert(txin.prevout);
459 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
460 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
464 BOOST_FOREACH(const CTxIn& txin, vin)
465 if (txin.prevout.IsNull())
466 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
472 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
473 bool* pfMissingInputs)
476 *pfMissingInputs = false;
478 if (!tx.CheckTransaction())
479 return error("CTxMemPool::accept() : CheckTransaction failed");
481 // Coinbase is only valid in a block, not as a loose transaction
483 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
485 // To help v0.1.5 clients who would see it as a negative number
486 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
487 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
489 // Rather not work on nonstandard transactions (unless -testnet)
490 if (!fTestNet && !tx.IsStandard())
491 return error("CTxMemPool::accept() : nonstandard transaction type");
493 // Do we already have it?
494 uint256 hash = tx.GetHash();
497 if (mapTx.count(hash))
501 if (txdb.ContainsTx(hash))
504 // Check for conflicts with in-memory transactions
505 CTransaction* ptxOld = NULL;
506 for (unsigned int i = 0; i < tx.vin.size(); i++)
508 COutPoint outpoint = tx.vin[i].prevout;
509 if (mapNextTx.count(outpoint))
511 // Disable replacement feature for now
514 // Allow replacing with a newer version of the same transaction
517 ptxOld = mapNextTx[outpoint].ptx;
518 if (ptxOld->IsFinal())
520 if (!tx.IsNewerThan(*ptxOld))
522 for (unsigned int i = 0; i < tx.vin.size(); i++)
524 COutPoint outpoint = tx.vin[i].prevout;
525 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
535 map<uint256, CTxIndex> mapUnused;
536 bool fInvalid = false;
537 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
540 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
542 *pfMissingInputs = true;
543 return error("CTxMemPool::accept() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
546 // Check for non-standard pay-to-script-hash in inputs
547 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
548 return error("CTxMemPool::accept() : nonstandard transaction input");
550 // Note: if you modify this code to accept non-standard transactions, then
551 // you should add code here to check that the transaction does a
552 // reasonable number of ECDSA signature verifications.
554 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
555 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
557 // Don't accept it if it can't get into a block
558 if (nFees < tx.GetMinFee(1000, true, GMF_RELAY))
559 return error("CTxMemPool::accept() : not enough fees");
561 // Continuously rate-limit free transactions
562 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
563 // be annoying or make other's transactions take longer to confirm.
564 if (nFees < MIN_RELAY_TX_FEE)
566 static CCriticalSection cs;
567 static double dFreeCount;
568 static int64 nLastTime;
569 int64 nNow = GetTime();
573 // Use an exponentially decaying ~10-minute window:
574 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
576 // -limitfreerelay unit is thousand-bytes-per-minute
577 // At default rate it would take over a month to fill 1GB
578 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
579 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
581 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
586 // Check against previous transactions
587 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
588 if (!tx.ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
590 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
594 // Store transaction in memory
599 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
605 ///// are we sure this is ok when loading transactions or restoring block txes
606 // If updated, erase old tx from wallet
608 EraseFromWallets(ptxOld->GetHash());
610 printf("CTxMemPool::accept() : accepted %s\n", hash.ToString().substr(0,10).c_str());
614 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
616 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
619 bool CTxMemPool::addUnchecked(CTransaction &tx)
621 printf("addUnchecked(): size %lu\n", mapTx.size());
622 // Add to memory pool without checking anything. Don't call this directly,
623 // call CTxMemPool::accept to properly check the transaction first.
626 uint256 hash = tx.GetHash();
628 for (unsigned int i = 0; i < tx.vin.size(); i++)
629 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
630 nTransactionsUpdated++;
636 bool CTxMemPool::remove(CTransaction &tx)
638 // Remove transaction from memory pool
641 uint256 hash = tx.GetHash();
642 if (mapTx.count(hash))
644 BOOST_FOREACH(const CTxIn& txin, tx.vin)
645 mapNextTx.erase(txin.prevout);
647 nTransactionsUpdated++;
658 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
660 if (hashBlock == 0 || nIndex == -1)
663 // Find the block it claims to be in
664 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
665 if (mi == mapBlockIndex.end())
667 CBlockIndex* pindex = (*mi).second;
668 if (!pindex || !pindex->IsInMainChain())
671 // Make sure the merkle branch connects to this block
672 if (!fMerkleVerified)
674 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
676 fMerkleVerified = true;
680 return pindexBest->nHeight - pindex->nHeight + 1;
684 int CMerkleTx::GetBlocksToMaturity() const
688 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
692 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
696 if (!IsInMainChain() && !ClientConnectInputs())
698 return CTransaction::AcceptToMemoryPool(txdb, false);
702 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
706 bool CMerkleTx::AcceptToMemoryPool()
709 return AcceptToMemoryPool(txdb);
714 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
719 // Add previous supporting transactions first
720 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
722 if (!tx.IsCoinBase())
724 uint256 hash = tx.GetHash();
725 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
726 tx.AcceptToMemoryPool(txdb, fCheckInputs);
729 return AcceptToMemoryPool(txdb, fCheckInputs);
734 bool CWalletTx::AcceptWalletTransaction()
737 return AcceptWalletTransaction(txdb);
740 int CTxIndex::GetDepthInMainChain() const
744 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
746 // Find the block in the index
747 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
748 if (mi == mapBlockIndex.end())
750 CBlockIndex* pindex = (*mi).second;
751 if (!pindex || !pindex->IsInMainChain())
753 return 1 + nBestHeight - pindex->nHeight;
765 //////////////////////////////////////////////////////////////////////////////
767 // CBlock and CBlockIndex
770 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
772 if (!fReadTransactions)
774 *this = pindex->GetBlockHeader();
777 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
779 if (GetHash() != pindex->GetBlockHash())
780 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
784 uint256 static GetOrphanRoot(const CBlock* pblock)
786 // Work back to the first block in the orphan chain
787 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
788 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
789 return pblock->GetHash();
792 int64 static GetBlockValue(int nHeight, int64 nFees)
794 int64 nSubsidy = 50 * COIN;
796 // Subsidy is cut in half every 4 years
797 nSubsidy >>= (nHeight / 210000);
799 return nSubsidy + nFees;
802 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
803 static const int64 nTargetSpacing = 10 * 60;
804 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
807 // minimum amount of work that could possibly be required nTime after
808 // minimum work required was nBase
810 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
812 // Testnet has min-difficulty blocks
813 // after nTargetSpacing*2 time between blocks:
814 if (fTestNet && nTime > nTargetSpacing*2)
815 return bnProofOfWorkLimit.GetCompact();
818 bnResult.SetCompact(nBase);
819 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
821 // Maximum 400% adjustment...
823 // ... in best-case exactly 4-times-normal target time
824 nTime -= nTargetTimespan*4;
826 if (bnResult > bnProofOfWorkLimit)
827 bnResult = bnProofOfWorkLimit;
828 return bnResult.GetCompact();
831 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
833 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
836 if (pindexLast == NULL)
837 return nProofOfWorkLimit;
839 // Only change once per interval
840 if ((pindexLast->nHeight+1) % nInterval != 0)
842 // Special rules for testnet after 15 Feb 2012:
843 if (fTestNet && pblock->nTime > 1329264000)
845 // If the new block's timestamp is more than 2* 10 minutes
846 // then allow mining of a min-difficulty block.
847 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
848 return nProofOfWorkLimit;
851 // Return the last non-special-min-difficulty-rules-block
852 const CBlockIndex* pindex = pindexLast;
853 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
854 pindex = pindex->pprev;
855 return pindex->nBits;
859 return pindexLast->nBits;
862 // Go back by what we want to be 14 days worth of blocks
863 const CBlockIndex* pindexFirst = pindexLast;
864 for (int i = 0; pindexFirst && i < nInterval-1; i++)
865 pindexFirst = pindexFirst->pprev;
868 // Limit adjustment step
869 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
870 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
871 if (nActualTimespan < nTargetTimespan/4)
872 nActualTimespan = nTargetTimespan/4;
873 if (nActualTimespan > nTargetTimespan*4)
874 nActualTimespan = nTargetTimespan*4;
878 bnNew.SetCompact(pindexLast->nBits);
879 bnNew *= nActualTimespan;
880 bnNew /= nTargetTimespan;
882 if (bnNew > bnProofOfWorkLimit)
883 bnNew = bnProofOfWorkLimit;
886 printf("GetNextWorkRequired RETARGET\n");
887 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
888 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
889 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
891 return bnNew.GetCompact();
894 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
897 bnTarget.SetCompact(nBits);
900 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
901 return error("CheckProofOfWork() : nBits below minimum work");
903 // Check proof of work matches claimed amount
904 if (hash > bnTarget.getuint256())
905 return error("CheckProofOfWork() : hash doesn't match nBits");
910 // Return maximum amount of blocks that other nodes claim to have
911 int GetNumBlocksOfPeers()
913 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
916 bool IsInitialBlockDownload()
918 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
920 static int64 nLastUpdate;
921 static CBlockIndex* pindexLastBest;
922 if (pindexBest != pindexLastBest)
924 pindexLastBest = pindexBest;
925 nLastUpdate = GetTime();
927 return (GetTime() - nLastUpdate < 10 &&
928 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
931 void static InvalidChainFound(CBlockIndex* pindexNew)
933 if (pindexNew->bnChainWork > bnBestInvalidWork)
935 bnBestInvalidWork = pindexNew->bnChainWork;
936 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
939 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());
940 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
941 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
942 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
945 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
947 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
949 // Updating time can change work required on testnet:
951 nBits = GetNextWorkRequired(pindexPrev, this);
964 bool CTransaction::DisconnectInputs(CTxDB& txdb)
966 // Relinquish previous transactions' spent pointers
969 BOOST_FOREACH(const CTxIn& txin, vin)
971 COutPoint prevout = txin.prevout;
973 // Get prev txindex from disk
975 if (!txdb.ReadTxIndex(prevout.hash, txindex))
976 return error("DisconnectInputs() : ReadTxIndex failed");
978 if (prevout.n >= txindex.vSpent.size())
979 return error("DisconnectInputs() : prevout.n out of range");
981 // Mark outpoint as not spent
982 txindex.vSpent[prevout.n].SetNull();
985 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
986 return error("DisconnectInputs() : UpdateTxIndex failed");
990 // Remove transaction from index
991 // This can fail if a duplicate of this transaction was in a chain that got
992 // reorganized away. This is only possible if this transaction was completely
993 // spent, so erasing it would be a no-op anway.
994 txdb.EraseTxIndex(*this);
1000 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1001 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1003 // FetchInputs can return false either because we just haven't seen some inputs
1004 // (in which case the transaction should be stored as an orphan)
1005 // or because the transaction is malformed (in which case the transaction should
1006 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1010 return true; // Coinbase transactions have no inputs to fetch.
1012 for (unsigned int i = 0; i < vin.size(); i++)
1014 COutPoint prevout = vin[i].prevout;
1015 if (inputsRet.count(prevout.hash))
1016 continue; // Got it already
1019 CTxIndex& txindex = inputsRet[prevout.hash].first;
1021 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1023 // Get txindex from current proposed changes
1024 txindex = mapTestPool.find(prevout.hash)->second;
1028 // Read txindex from txdb
1029 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1031 if (!fFound && (fBlock || fMiner))
1032 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());
1035 CTransaction& txPrev = inputsRet[prevout.hash].second;
1036 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1038 // Get prev tx from single transactions in memory
1041 if (!mempool.exists(prevout.hash))
1042 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());
1043 txPrev = mempool.lookup(prevout.hash);
1046 txindex.vSpent.resize(txPrev.vout.size());
1050 // Get prev tx from disk
1051 if (!txPrev.ReadFromDisk(txindex.pos))
1052 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1056 // Make sure all prevout.n's are valid:
1057 for (unsigned int i = 0; i < vin.size(); i++)
1059 const COutPoint prevout = vin[i].prevout;
1060 assert(inputsRet.count(prevout.hash) != 0);
1061 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1062 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1063 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1065 // Revisit this if/when transaction replacement is implemented and allows
1068 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()));
1075 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1077 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1078 if (mi == inputs.end())
1079 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1081 const CTransaction& txPrev = (mi->second).second;
1082 if (input.prevout.n >= txPrev.vout.size())
1083 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1085 return txPrev.vout[input.prevout.n];
1088 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1094 for (unsigned int i = 0; i < vin.size(); i++)
1096 nResult += GetOutputFor(vin[i], inputs).nValue;
1102 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1107 unsigned int nSigOps = 0;
1108 for (unsigned int i = 0; i < vin.size(); i++)
1110 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1111 if (prevout.scriptPubKey.IsPayToScriptHash())
1112 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1117 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1118 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1119 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1121 // Take over previous transactions' spent pointers
1122 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1123 // fMiner is true when called from the internal bitcoin miner
1124 // ... both are false when called from CTransaction::AcceptToMemoryPool
1129 for (unsigned int i = 0; i < vin.size(); i++)
1131 COutPoint prevout = vin[i].prevout;
1132 assert(inputs.count(prevout.hash) > 0);
1133 CTxIndex& txindex = inputs[prevout.hash].first;
1134 CTransaction& txPrev = inputs[prevout.hash].second;
1136 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1137 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()));
1139 // If prev is coinbase, check that it's matured
1140 if (txPrev.IsCoinBase())
1141 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1142 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1143 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1145 // Check for negative or overflow input values
1146 nValueIn += txPrev.vout[prevout.n].nValue;
1147 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1148 return DoS(100, error("ConnectInputs() : txin values out of range"));
1151 // The first loop above does all the inexpensive checks.
1152 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1153 // Helps prevent CPU exhaustion attacks.
1154 for (unsigned int i = 0; i < vin.size(); i++)
1156 COutPoint prevout = vin[i].prevout;
1157 assert(inputs.count(prevout.hash) > 0);
1158 CTxIndex& txindex = inputs[prevout.hash].first;
1159 CTransaction& txPrev = inputs[prevout.hash].second;
1161 // Check for conflicts (double-spend)
1162 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1163 // for an attacker to attempt to split the network.
1164 if (!txindex.vSpent[prevout.n].IsNull())
1165 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());
1167 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1168 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1169 // still computed and checked, and any change will be caught at the next checkpoint.
1170 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1173 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1175 // only during transition phase for P2SH: do not invoke anti-DoS code for
1176 // potentially old clients relaying bad P2SH transactions
1177 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1178 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1180 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1184 // Mark outpoints as spent
1185 txindex.vSpent[prevout.n] = posThisTx;
1188 if (fBlock || fMiner)
1190 mapTestPool[prevout.hash] = txindex;
1194 if (nValueIn < GetValueOut())
1195 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1197 // Tally transaction fees
1198 int64 nTxFee = nValueIn - GetValueOut();
1200 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1202 if (!MoneyRange(nFees))
1203 return DoS(100, error("ConnectInputs() : nFees out of range"));
1210 bool CTransaction::ClientConnectInputs()
1215 // Take over previous transactions' spent pointers
1219 for (unsigned int i = 0; i < vin.size(); i++)
1221 // Get prev tx from single transactions in memory
1222 COutPoint prevout = vin[i].prevout;
1223 if (!mempool.exists(prevout.hash))
1225 CTransaction& txPrev = mempool.lookup(prevout.hash);
1227 if (prevout.n >= txPrev.vout.size())
1231 if (!VerifySignature(txPrev, *this, i, true, 0))
1232 return error("ConnectInputs() : VerifySignature failed");
1234 ///// this is redundant with the mempool.mapNextTx stuff,
1235 ///// not sure which I want to get rid of
1236 ///// this has to go away now that posNext is gone
1237 // // Check for conflicts
1238 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1239 // return error("ConnectInputs() : prev tx already used");
1241 // // Flag outpoints as used
1242 // txPrev.vout[prevout.n].posNext = posThisTx;
1244 nValueIn += txPrev.vout[prevout.n].nValue;
1246 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1247 return error("ClientConnectInputs() : txin values out of range");
1249 if (GetValueOut() > nValueIn)
1259 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1261 // Disconnect in reverse order
1262 for (int i = vtx.size()-1; i >= 0; i--)
1263 if (!vtx[i].DisconnectInputs(txdb))
1266 // Update block index on disk without changing it in memory.
1267 // The memory index structure will be changed after the db commits.
1270 CDiskBlockIndex blockindexPrev(pindex->pprev);
1271 blockindexPrev.hashNext = 0;
1272 if (!txdb.WriteBlockIndex(blockindexPrev))
1273 return error("DisconnectBlock() : WriteBlockIndex failed");
1279 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1281 // Check it again in case a previous version let a bad block in
1285 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1286 // unless those are already completely spent.
1287 // If such overwrites are allowed, coinbases and transactions depending upon those
1288 // can be duplicated to remove the ability to spend the first instance -- even after
1289 // being sent to another address.
1290 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1291 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1292 // already refuses previously-known transaction id's entirely.
1293 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1294 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1295 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1297 BOOST_FOREACH(CTransaction& tx, vtx)
1299 CTxIndex txindexOld;
1300 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1302 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1309 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1310 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1311 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1313 //// issue here: it doesn't know the version
1314 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - 1 + GetSizeOfCompactSize(vtx.size());
1316 map<uint256, CTxIndex> mapQueuedChanges;
1318 unsigned int nSigOps = 0;
1319 BOOST_FOREACH(CTransaction& tx, vtx)
1321 nSigOps += tx.GetLegacySigOpCount();
1322 if (nSigOps > MAX_BLOCK_SIGOPS)
1323 return DoS(100, error("ConnectBlock() : too many sigops"));
1325 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1326 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1328 MapPrevTx mapInputs;
1329 if (!tx.IsCoinBase())
1332 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1335 if (fStrictPayToScriptHash)
1337 // Add in sigops done by pay-to-script-hash inputs;
1338 // this is to prevent a "rogue miner" from creating
1339 // an incredibly-expensive-to-validate block.
1340 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1341 if (nSigOps > MAX_BLOCK_SIGOPS)
1342 return DoS(100, error("ConnectBlock() : too many sigops"));
1345 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1347 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1351 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1354 // Write queued txindex changes
1355 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1357 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1358 return error("ConnectBlock() : UpdateTxIndex failed");
1361 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1364 // Update block index on disk without changing it in memory.
1365 // The memory index structure will be changed after the db commits.
1368 CDiskBlockIndex blockindexPrev(pindex->pprev);
1369 blockindexPrev.hashNext = pindex->GetBlockHash();
1370 if (!txdb.WriteBlockIndex(blockindexPrev))
1371 return error("ConnectBlock() : WriteBlockIndex failed");
1374 // Watch for transactions paying to me
1375 BOOST_FOREACH(CTransaction& tx, vtx)
1376 SyncWithWallets(tx, this, true);
1381 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1383 printf("REORGANIZE\n");
1386 CBlockIndex* pfork = pindexBest;
1387 CBlockIndex* plonger = pindexNew;
1388 while (pfork != plonger)
1390 while (plonger->nHeight > pfork->nHeight)
1391 if (!(plonger = plonger->pprev))
1392 return error("Reorganize() : plonger->pprev is null");
1393 if (pfork == plonger)
1395 if (!(pfork = pfork->pprev))
1396 return error("Reorganize() : pfork->pprev is null");
1399 // List of what to disconnect
1400 vector<CBlockIndex*> vDisconnect;
1401 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1402 vDisconnect.push_back(pindex);
1404 // List of what to connect
1405 vector<CBlockIndex*> vConnect;
1406 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1407 vConnect.push_back(pindex);
1408 reverse(vConnect.begin(), vConnect.end());
1410 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());
1411 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());
1413 // Disconnect shorter branch
1414 vector<CTransaction> vResurrect;
1415 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1418 if (!block.ReadFromDisk(pindex))
1419 return error("Reorganize() : ReadFromDisk for disconnect failed");
1420 if (!block.DisconnectBlock(txdb, pindex))
1421 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1423 // Queue memory transactions to resurrect
1424 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1425 if (!tx.IsCoinBase())
1426 vResurrect.push_back(tx);
1429 // Connect longer branch
1430 vector<CTransaction> vDelete;
1431 for (unsigned int i = 0; i < vConnect.size(); i++)
1433 CBlockIndex* pindex = vConnect[i];
1435 if (!block.ReadFromDisk(pindex))
1436 return error("Reorganize() : ReadFromDisk for connect failed");
1437 if (!block.ConnectBlock(txdb, pindex))
1441 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1444 // Queue memory transactions to delete
1445 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1446 vDelete.push_back(tx);
1448 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1449 return error("Reorganize() : WriteHashBestChain failed");
1451 // Make sure it's successfully written to disk before changing memory structure
1452 if (!txdb.TxnCommit())
1453 return error("Reorganize() : TxnCommit failed");
1455 // Disconnect shorter branch
1456 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1458 pindex->pprev->pnext = NULL;
1460 // Connect longer branch
1461 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1463 pindex->pprev->pnext = pindex;
1465 // Resurrect memory transactions that were in the disconnected branch
1466 BOOST_FOREACH(CTransaction& tx, vResurrect)
1467 tx.AcceptToMemoryPool(txdb, false);
1469 // Delete redundant memory transactions that are in the connected branch
1470 BOOST_FOREACH(CTransaction& tx, vDelete)
1473 printf("REORGANIZE: done\n");
1480 runCommand(std::string strCommand)
1482 int nErr = ::system(strCommand.c_str());
1484 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1487 // Called from inside SetBestChain: attaches a block to the new best chain being built
1488 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1490 uint256 hash = GetHash();
1492 // Adding to current best branch
1493 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1496 InvalidChainFound(pindexNew);
1499 if (!txdb.TxnCommit())
1500 return error("SetBestChain() : TxnCommit failed");
1502 // Add to current best branch
1503 pindexNew->pprev->pnext = pindexNew;
1505 // Delete redundant memory transactions
1506 BOOST_FOREACH(CTransaction& tx, vtx)
1512 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1514 uint256 hash = GetHash();
1517 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1519 txdb.WriteHashBestChain(hash);
1520 if (!txdb.TxnCommit())
1521 return error("SetBestChain() : TxnCommit failed");
1522 pindexGenesisBlock = pindexNew;
1524 else if (hashPrevBlock == hashBestChain)
1526 if (!SetBestChainInner(txdb, pindexNew))
1527 return error("SetBestChain() : SetBestChainInner failed");
1531 // the first block in the new chain that will cause it to become the new best chain
1532 CBlockIndex *pindexIntermediate = pindexNew;
1534 // list of blocks that need to be connected afterwards
1535 std::vector<CBlockIndex*> vpindexSecondary;
1537 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1538 // Try to limit how much needs to be done inside
1539 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1541 vpindexSecondary.push_back(pindexIntermediate);
1542 pindexIntermediate = pindexIntermediate->pprev;
1545 if (!vpindexSecondary.empty())
1546 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1548 // Switch to new best branch
1549 if (!Reorganize(txdb, pindexIntermediate))
1552 InvalidChainFound(pindexNew);
1553 return error("SetBestChain() : Reorganize failed");
1556 // Connect futher blocks
1557 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1560 if (!block.ReadFromDisk(pindex))
1562 printf("SetBestChain() : ReadFromDisk failed\n");
1566 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1567 if (!block.SetBestChainInner(txdb, pindex))
1572 // Update best block in wallet (so we can detect restored wallets)
1573 bool fIsInitialDownload = IsInitialBlockDownload();
1574 if (!fIsInitialDownload)
1576 const CBlockLocator locator(pindexNew);
1577 ::SetBestChain(locator);
1581 hashBestChain = hash;
1582 pindexBest = pindexNew;
1583 nBestHeight = pindexBest->nHeight;
1584 bnBestChainWork = pindexNew->bnChainWork;
1585 nTimeBestReceived = GetTime();
1586 nTransactionsUpdated++;
1587 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1589 std::string strCmd = GetArg("-blocknotify", "");
1591 if (!fIsInitialDownload && !strCmd.empty())
1593 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1594 boost::thread t(runCommand, strCmd); // thread runs free
1601 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1603 // Check for duplicate
1604 uint256 hash = GetHash();
1605 if (mapBlockIndex.count(hash))
1606 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1608 // Construct new block index object
1609 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1611 return error("AddToBlockIndex() : new CBlockIndex failed");
1612 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1613 pindexNew->phashBlock = &((*mi).first);
1614 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1615 if (miPrev != mapBlockIndex.end())
1617 pindexNew->pprev = (*miPrev).second;
1618 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1620 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1624 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1625 if (!txdb.TxnCommit())
1629 if (pindexNew->bnChainWork > bnBestChainWork)
1630 if (!SetBestChain(txdb, pindexNew))
1635 if (pindexNew == pindexBest)
1637 // Notify UI to display prev block's coinbase if it was ours
1638 static uint256 hashPrevBestCoinBase;
1639 UpdatedTransaction(hashPrevBestCoinBase);
1640 hashPrevBestCoinBase = vtx[0].GetHash();
1650 bool CBlock::CheckBlock() const
1652 // These are checks that are independent of context
1653 // that can be verified before saving an orphan block.
1656 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
1657 return DoS(100, error("CheckBlock() : size limits failed"));
1659 // Check proof of work matches claimed amount
1660 if (!CheckProofOfWork(GetHash(), nBits))
1661 return DoS(50, error("CheckBlock() : proof of work failed"));
1664 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1665 return error("CheckBlock() : block timestamp too far in the future");
1667 // First transaction must be coinbase, the rest must not be
1668 if (vtx.empty() || !vtx[0].IsCoinBase())
1669 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1670 for (unsigned int i = 1; i < vtx.size(); i++)
1671 if (vtx[i].IsCoinBase())
1672 return DoS(100, error("CheckBlock() : more than one coinbase"));
1674 // Check transactions
1675 BOOST_FOREACH(const CTransaction& tx, vtx)
1676 if (!tx.CheckTransaction())
1677 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1679 // Check for duplicate txids. This is caught by ConnectInputs(),
1680 // but catching it earlier avoids a potential DoS attack:
1681 set<uint256> uniqueTx;
1682 BOOST_FOREACH(const CTransaction& tx, vtx)
1684 uniqueTx.insert(tx.GetHash());
1686 if (uniqueTx.size() != vtx.size())
1687 return DoS(100, error("CheckBlock() : duplicate transaction"));
1689 unsigned int nSigOps = 0;
1690 BOOST_FOREACH(const CTransaction& tx, vtx)
1692 nSigOps += tx.GetLegacySigOpCount();
1694 if (nSigOps > MAX_BLOCK_SIGOPS)
1695 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1698 if (hashMerkleRoot != BuildMerkleTree())
1699 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1704 bool CBlock::AcceptBlock()
1706 // Check for duplicate
1707 uint256 hash = GetHash();
1708 if (mapBlockIndex.count(hash))
1709 return error("AcceptBlock() : block already in mapBlockIndex");
1711 // Get prev block index
1712 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1713 if (mi == mapBlockIndex.end())
1714 return DoS(10, error("AcceptBlock() : prev block not found"));
1715 CBlockIndex* pindexPrev = (*mi).second;
1716 int nHeight = pindexPrev->nHeight+1;
1718 // Check proof of work
1719 if (nBits != GetNextWorkRequired(pindexPrev, this))
1720 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1722 // Check timestamp against prev
1723 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1724 return error("AcceptBlock() : block's timestamp is too early");
1726 // Check that all transactions are finalized
1727 BOOST_FOREACH(const CTransaction& tx, vtx)
1728 if (!tx.IsFinal(nHeight, GetBlockTime()))
1729 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1731 // Check that the block chain matches the known block chain up to a checkpoint
1732 if (!Checkpoints::CheckBlock(nHeight, hash))
1733 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1735 // Write block to history file
1736 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
1737 return error("AcceptBlock() : out of disk space");
1738 unsigned int nFile = -1;
1739 unsigned int nBlockPos = 0;
1740 if (!WriteToDisk(nFile, nBlockPos))
1741 return error("AcceptBlock() : WriteToDisk failed");
1742 if (!AddToBlockIndex(nFile, nBlockPos))
1743 return error("AcceptBlock() : AddToBlockIndex failed");
1745 // Relay inventory, but don't relay old inventory during initial block download
1746 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1747 if (hashBestChain == hash)
1750 BOOST_FOREACH(CNode* pnode, vNodes)
1751 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1752 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1758 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1760 // Check for duplicate
1761 uint256 hash = pblock->GetHash();
1762 if (mapBlockIndex.count(hash))
1763 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1764 if (mapOrphanBlocks.count(hash))
1765 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1767 // Preliminary checks
1768 if (!pblock->CheckBlock())
1769 return error("ProcessBlock() : CheckBlock FAILED");
1771 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1772 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1774 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1775 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1779 pfrom->Misbehaving(100);
1780 return error("ProcessBlock() : block with timestamp before last checkpoint");
1783 bnNewBlock.SetCompact(pblock->nBits);
1785 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1786 if (bnNewBlock > bnRequired)
1789 pfrom->Misbehaving(100);
1790 return error("ProcessBlock() : block with too little proof-of-work");
1795 // If don't already have its previous block, shunt it off to holding area until we get it
1796 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1798 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1799 CBlock* pblock2 = new CBlock(*pblock);
1800 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1801 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1803 // Ask this guy to fill in what we're missing
1805 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1810 if (!pblock->AcceptBlock())
1811 return error("ProcessBlock() : AcceptBlock FAILED");
1813 // Recursively process any orphan blocks that depended on this one
1814 vector<uint256> vWorkQueue;
1815 vWorkQueue.push_back(hash);
1816 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
1818 uint256 hashPrev = vWorkQueue[i];
1819 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1820 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1823 CBlock* pblockOrphan = (*mi).second;
1824 if (pblockOrphan->AcceptBlock())
1825 vWorkQueue.push_back(pblockOrphan->GetHash());
1826 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1827 delete pblockOrphan;
1829 mapOrphanBlocksByPrev.erase(hashPrev);
1832 printf("ProcessBlock: ACCEPTED\n");
1843 bool CheckDiskSpace(uint64 nAdditionalBytes)
1845 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1847 // Check for 15MB because database could create another 10MB log file at any time
1848 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1851 string strMessage = _("Warning: Disk space is low ");
1852 strMiscWarning = strMessage;
1853 printf("*** %s\n", strMessage.c_str());
1854 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1861 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1865 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1868 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1870 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1879 static unsigned int nCurrentBlockFile = 1;
1881 FILE* AppendBlockFile(unsigned int& nFileRet)
1886 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1889 if (fseek(file, 0, SEEK_END) != 0)
1891 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1892 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1894 nFileRet = nCurrentBlockFile;
1898 nCurrentBlockFile++;
1902 bool LoadBlockIndex(bool fAllowNew)
1906 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1907 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1908 pchMessageStart[0] = 0xfa;
1909 pchMessageStart[1] = 0xbf;
1910 pchMessageStart[2] = 0xb5;
1911 pchMessageStart[3] = 0xda;
1918 if (!txdb.LoadBlockIndex())
1923 // Init with genesis block
1925 if (mapBlockIndex.empty())
1931 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1932 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1933 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1934 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1935 // vMerkleTree: 4a5e1e
1938 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1940 txNew.vin.resize(1);
1941 txNew.vout.resize(1);
1942 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1943 txNew.vout[0].nValue = 50 * COIN;
1944 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1946 block.vtx.push_back(txNew);
1947 block.hashPrevBlock = 0;
1948 block.hashMerkleRoot = block.BuildMerkleTree();
1950 block.nTime = 1231006505;
1951 block.nBits = 0x1d00ffff;
1952 block.nNonce = 2083236893;
1956 block.nTime = 1296688602;
1957 block.nBits = 0x1d07fff8;
1958 block.nNonce = 384568319;
1962 printf("%s\n", block.GetHash().ToString().c_str());
1963 printf("%s\n", hashGenesisBlock.ToString().c_str());
1964 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1965 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1967 assert(block.GetHash() == hashGenesisBlock);
1969 // Start new block file
1971 unsigned int nBlockPos;
1972 if (!block.WriteToDisk(nFile, nBlockPos))
1973 return error("LoadBlockIndex() : writing genesis block to disk failed");
1974 if (!block.AddToBlockIndex(nFile, nBlockPos))
1975 return error("LoadBlockIndex() : genesis block not accepted");
1983 void PrintBlockTree()
1985 // precompute tree structure
1986 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1987 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1989 CBlockIndex* pindex = (*mi).second;
1990 mapNext[pindex->pprev].push_back(pindex);
1992 //while (rand() % 3 == 0)
1993 // mapNext[pindex->pprev].push_back(pindex);
1996 vector<pair<int, CBlockIndex*> > vStack;
1997 vStack.push_back(make_pair(0, pindexGenesisBlock));
2000 while (!vStack.empty())
2002 int nCol = vStack.back().first;
2003 CBlockIndex* pindex = vStack.back().second;
2006 // print split or gap
2007 if (nCol > nPrevCol)
2009 for (int i = 0; i < nCol-1; i++)
2013 else if (nCol < nPrevCol)
2015 for (int i = 0; i < nCol; i++)
2022 for (int i = 0; i < nCol; i++)
2027 block.ReadFromDisk(pindex);
2028 printf("%d (%u,%u) %s %s tx %d",
2032 block.GetHash().ToString().substr(0,20).c_str(),
2033 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2036 PrintWallets(block);
2038 // put the main timechain first
2039 vector<CBlockIndex*>& vNext = mapNext[pindex];
2040 for (unsigned int i = 0; i < vNext.size(); i++)
2042 if (vNext[i]->pnext)
2044 swap(vNext[0], vNext[i]);
2050 for (unsigned int i = 0; i < vNext.size(); i++)
2051 vStack.push_back(make_pair(nCol+i, vNext[i]));
2064 //////////////////////////////////////////////////////////////////////////////
2069 map<uint256, CAlert> mapAlerts;
2070 CCriticalSection cs_mapAlerts;
2072 string GetWarnings(string strFor)
2075 string strStatusBar;
2077 if (GetBoolArg("-testsafemode"))
2080 // Misc warnings like out of disk space and clock is wrong
2081 if (strMiscWarning != "")
2084 strStatusBar = strMiscWarning;
2087 // Longer invalid proof-of-work chain
2088 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2091 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2097 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2099 const CAlert& alert = item.second;
2100 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2102 nPriority = alert.nPriority;
2103 strStatusBar = alert.strStatusBar;
2108 if (strFor == "statusbar")
2109 return strStatusBar;
2110 else if (strFor == "rpc")
2112 assert(!"GetWarnings() : invalid parameter");
2116 bool CAlert::ProcessAlert()
2118 if (!CheckSignature())
2125 // Cancel previous alerts
2126 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2128 const CAlert& alert = (*mi).second;
2131 printf("cancelling alert %d\n", alert.nID);
2132 mapAlerts.erase(mi++);
2134 else if (!alert.IsInEffect())
2136 printf("expiring alert %d\n", alert.nID);
2137 mapAlerts.erase(mi++);
2143 // Check if this alert has been cancelled
2144 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2146 const CAlert& alert = item.second;
2147 if (alert.Cancels(*this))
2149 printf("alert already cancelled by %d\n", alert.nID);
2155 mapAlerts.insert(make_pair(GetHash(), *this));
2158 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2170 //////////////////////////////////////////////////////////////////////////////
2176 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2182 bool txInMap = false;
2185 txInMap = (mempool.exists(inv.hash));
2188 mapOrphanTransactions.count(inv.hash) ||
2189 txdb.ContainsTx(inv.hash);
2193 return mapBlockIndex.count(inv.hash) ||
2194 mapOrphanBlocks.count(inv.hash);
2196 // Don't know what it is, just say we already got one
2203 // The message start string is designed to be unlikely to occur in normal data.
2204 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2205 // a large 4-byte int at any alignment.
2206 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2209 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2211 static map<CService, vector<unsigned char> > mapReuseKey;
2212 RandAddSeedPerfmon();
2214 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2215 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2217 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2219 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2227 if (strCommand == "version")
2229 // Each connection can only send one version message
2230 if (pfrom->nVersion != 0)
2232 pfrom->Misbehaving(1);
2240 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2241 if (pfrom->nVersion < MIN_PROTO_VERSION)
2243 // Since February 20, 2012, the protocol is initiated at version 209,
2244 // and earlier versions are no longer supported
2245 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2246 pfrom->fDisconnect = true;
2250 if (pfrom->nVersion == 10300)
2251 pfrom->nVersion = 300;
2253 vRecv >> addrFrom >> nNonce;
2255 vRecv >> pfrom->strSubVer;
2257 vRecv >> pfrom->nStartingHeight;
2259 // Disconnect if we connected to ourself
2260 if (nNonce == nLocalHostNonce && nNonce > 1)
2262 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2263 pfrom->fDisconnect = true;
2267 // Be shy and don't send version until we hear
2268 if (pfrom->fInbound)
2269 pfrom->PushVersion();
2271 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2273 AddTimeData(pfrom->addr, nTime);
2276 pfrom->PushMessage("verack");
2277 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2279 if (!pfrom->fInbound)
2281 // Advertise our address
2282 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2283 !IsInitialBlockDownload())
2285 CAddress addr(addrLocalHost);
2286 addr.nTime = GetAdjustedTime();
2287 pfrom->PushAddress(addr);
2290 // Get recent addresses
2291 if (pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
2293 pfrom->PushMessage("getaddr");
2294 pfrom->fGetAddr = true;
2296 addrman.Good(pfrom->addr);
2298 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2300 addrman.Add(addrFrom, addrFrom);
2301 addrman.Good(addrFrom);
2305 // Ask the first connected node for block updates
2306 static int nAskedForBlocks = 0;
2307 if (!pfrom->fClient &&
2308 (pfrom->nVersion < NOBLKS_VERSION_START ||
2309 pfrom->nVersion >= NOBLKS_VERSION_END) &&
2310 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2313 pfrom->PushGetBlocks(pindexBest, uint256(0));
2319 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2320 item.second.RelayTo(pfrom);
2323 pfrom->fSuccessfullyConnected = true;
2325 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2327 cPeerBlockCounts.input(pfrom->nStartingHeight);
2331 else if (pfrom->nVersion == 0)
2333 // Must have a version message before anything else
2334 pfrom->Misbehaving(1);
2339 else if (strCommand == "verack")
2341 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2345 else if (strCommand == "addr")
2347 vector<CAddress> vAddr;
2350 // Don't want addr from older versions unless seeding
2351 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
2353 if (vAddr.size() > 1000)
2355 pfrom->Misbehaving(20);
2356 return error("message addr size() = %d", vAddr.size());
2359 // Store the new addresses
2360 int64 nNow = GetAdjustedTime();
2361 int64 nSince = nNow - 10 * 60;
2362 BOOST_FOREACH(CAddress& addr, vAddr)
2366 // ignore IPv6 for now, since it isn't implemented anyway
2369 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2370 addr.nTime = nNow - 5 * 24 * 60 * 60;
2371 pfrom->AddAddressKnown(addr);
2372 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2374 // Relay to a limited number of other nodes
2377 // Use deterministic randomness to send to the same nodes for 24 hours
2378 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2379 static uint256 hashSalt;
2381 hashSalt = GetRandHash();
2382 int64 hashAddr = addr.GetHash();
2383 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2384 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2385 multimap<uint256, CNode*> mapMix;
2386 BOOST_FOREACH(CNode* pnode, vNodes)
2388 if (pnode->nVersion < CADDR_TIME_VERSION)
2390 unsigned int nPointer;
2391 memcpy(&nPointer, &pnode, sizeof(nPointer));
2392 uint256 hashKey = hashRand ^ nPointer;
2393 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2394 mapMix.insert(make_pair(hashKey, pnode));
2396 int nRelayNodes = 2;
2397 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2398 ((*mi).second)->PushAddress(addr);
2402 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2403 if (vAddr.size() < 1000)
2404 pfrom->fGetAddr = false;
2408 else if (strCommand == "inv")
2412 if (vInv.size() > 50000)
2414 pfrom->Misbehaving(20);
2415 return error("message inv size() = %d", vInv.size());
2419 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
2421 const CInv &inv = vInv[nInv];
2425 pfrom->AddInventoryKnown(inv);
2427 bool fAlreadyHave = AlreadyHave(txdb, inv);
2429 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2431 // Always request the last block in an inv bundle (even if we already have it), as it is the
2432 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2433 // this is necessary to connect earlier received orphan blocks to the chain again.
2434 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2436 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2437 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2439 // Track requests for our stuff
2440 Inventory(inv.hash);
2445 else if (strCommand == "getdata")
2449 if (vInv.size() > 50000)
2451 pfrom->Misbehaving(20);
2452 return error("message getdata size() = %d", vInv.size());
2455 BOOST_FOREACH(const CInv& inv, vInv)
2459 printf("received getdata for: %s\n", inv.ToString().c_str());
2461 if (inv.type == MSG_BLOCK)
2463 // Send block from disk
2464 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2465 if (mi != mapBlockIndex.end())
2468 block.ReadFromDisk((*mi).second);
2469 pfrom->PushMessage("block", block);
2471 // Trigger them to send a getblocks request for the next batch of inventory
2472 if (inv.hash == pfrom->hashContinue)
2474 // Bypass PushInventory, this must send even if redundant,
2475 // and we want it right after the last block so they don't
2476 // wait for other stuff first.
2478 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2479 pfrom->PushMessage("inv", vInv);
2480 pfrom->hashContinue = 0;
2484 else if (inv.IsKnownType())
2486 // Send stream from relay memory
2489 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2490 if (mi != mapRelay.end())
2491 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2495 // Track requests for our stuff
2496 Inventory(inv.hash);
2501 else if (strCommand == "getblocks")
2503 CBlockLocator locator;
2505 vRecv >> locator >> hashStop;
2507 // Find the last block the caller has in the main chain
2508 CBlockIndex* pindex = locator.GetBlockIndex();
2510 // Send the rest of the chain
2512 pindex = pindex->pnext;
2513 int nLimit = 500 + locator.GetDistanceBack();
2514 unsigned int nBytes = 0;
2515 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2516 for (; pindex; pindex = pindex->pnext)
2518 if (pindex->GetBlockHash() == hashStop)
2520 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2523 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2525 block.ReadFromDisk(pindex, true);
2526 nBytes += block.GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
2527 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2529 // When this block is requested, we'll send an inv that'll make them
2530 // getblocks the next batch of inventory.
2531 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2532 pfrom->hashContinue = pindex->GetBlockHash();
2539 else if (strCommand == "getheaders")
2541 CBlockLocator locator;
2543 vRecv >> locator >> hashStop;
2545 CBlockIndex* pindex = NULL;
2546 if (locator.IsNull())
2548 // If locator is null, return the hashStop block
2549 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2550 if (mi == mapBlockIndex.end())
2552 pindex = (*mi).second;
2556 // Find the last block the caller has in the main chain
2557 pindex = locator.GetBlockIndex();
2559 pindex = pindex->pnext;
2562 vector<CBlock> vHeaders;
2564 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2565 for (; pindex; pindex = pindex->pnext)
2567 vHeaders.push_back(pindex->GetBlockHeader());
2568 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2571 pfrom->PushMessage("headers", vHeaders);
2575 else if (strCommand == "tx")
2577 vector<uint256> vWorkQueue;
2578 vector<uint256> vEraseQueue;
2579 CDataStream vMsg(vRecv);
2584 CInv inv(MSG_TX, tx.GetHash());
2585 pfrom->AddInventoryKnown(inv);
2587 bool fMissingInputs = false;
2588 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2590 SyncWithWallets(tx, NULL, true);
2591 RelayMessage(inv, vMsg);
2592 mapAlreadyAskedFor.erase(inv);
2593 vWorkQueue.push_back(inv.hash);
2594 vEraseQueue.push_back(inv.hash);
2596 // Recursively process any orphan transactions that depended on this one
2597 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2599 uint256 hashPrev = vWorkQueue[i];
2600 for (map<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
2601 mi != mapOrphanTransactionsByPrev[hashPrev].end();
2604 const CDataStream& vMsg = *((*mi).second);
2606 CDataStream(vMsg) >> tx;
2607 CInv inv(MSG_TX, tx.GetHash());
2608 bool fMissingInputs2 = false;
2610 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
2612 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2613 SyncWithWallets(tx, NULL, true);
2614 RelayMessage(inv, vMsg);
2615 mapAlreadyAskedFor.erase(inv);
2616 vWorkQueue.push_back(inv.hash);
2617 vEraseQueue.push_back(inv.hash);
2619 else if (!fMissingInputs2)
2622 vEraseQueue.push_back(inv.hash);
2623 printf(" removed invalid orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2628 BOOST_FOREACH(uint256 hash, vEraseQueue)
2629 EraseOrphanTx(hash);
2631 else if (fMissingInputs)
2635 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2636 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2638 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
2640 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2644 else if (strCommand == "block")
2649 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2652 CInv inv(MSG_BLOCK, block.GetHash());
2653 pfrom->AddInventoryKnown(inv);
2655 if (ProcessBlock(pfrom, &block))
2656 mapAlreadyAskedFor.erase(inv);
2657 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2661 else if (strCommand == "getaddr")
2663 pfrom->vAddrToSend.clear();
2664 vector<CAddress> vAddr = addrman.GetAddr();
2665 BOOST_FOREACH(const CAddress &addr, vAddr)
2666 pfrom->PushAddress(addr);
2670 else if (strCommand == "checkorder")
2675 if (!GetBoolArg("-allowreceivebyip"))
2677 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2684 /// we have a chance to check the order here
2686 // Keep giving the same key to the same ip until they use it
2687 if (!mapReuseKey.count(pfrom->addr))
2688 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2690 // Send back approval of order and pubkey to use
2691 CScript scriptPubKey;
2692 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2693 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2697 else if (strCommand == "reply")
2702 CRequestTracker tracker;
2704 LOCK(pfrom->cs_mapRequests);
2705 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2706 if (mi != pfrom->mapRequests.end())
2708 tracker = (*mi).second;
2709 pfrom->mapRequests.erase(mi);
2712 if (!tracker.IsNull())
2713 tracker.fn(tracker.param1, vRecv);
2717 else if (strCommand == "ping")
2719 if (pfrom->nVersion > BIP0031_VERSION)
2723 // Echo the message back with the nonce. This allows for two useful features:
2725 // 1) A remote node can quickly check if the connection is operational
2726 // 2) Remote nodes can measure the latency of the network thread. If this node
2727 // is overloaded it won't respond to pings quickly and the remote node can
2728 // avoid sending us more work, like chain download requests.
2730 // The nonce stops the remote getting confused between different pings: without
2731 // it, if the remote node sends a ping once per second and this node takes 5
2732 // seconds to respond to each, the 5th ping the remote sends would appear to
2733 // return very quickly.
2734 pfrom->PushMessage("pong", nonce);
2739 else if (strCommand == "alert")
2744 if (alert.ProcessAlert())
2747 pfrom->setKnown.insert(alert.GetHash());
2750 BOOST_FOREACH(CNode* pnode, vNodes)
2751 alert.RelayTo(pnode);
2759 // Ignore unknown commands for extensibility
2763 // Update the last seen time for this node's address
2764 if (pfrom->fNetworkNode)
2765 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2766 AddressCurrentlyConnected(pfrom->addr);
2772 bool ProcessMessages(CNode* pfrom)
2774 CDataStream& vRecv = pfrom->vRecv;
2778 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2782 // (4) message start
2791 // Scan for message start
2792 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2793 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2794 if (vRecv.end() - pstart < nHeaderSize)
2796 if ((int)vRecv.size() > nHeaderSize)
2798 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2799 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2803 if (pstart - vRecv.begin() > 0)
2804 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2805 vRecv.erase(vRecv.begin(), pstart);
2808 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2813 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2816 string strCommand = hdr.GetCommand();
2819 unsigned int nMessageSize = hdr.nMessageSize;
2820 if (nMessageSize > MAX_SIZE)
2822 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2825 if (nMessageSize > vRecv.size())
2827 // Rewind and wait for rest of message
2828 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2833 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2834 unsigned int nChecksum = 0;
2835 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2836 if (nChecksum != hdr.nChecksum)
2838 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2839 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2843 // Copy message to its own buffer
2844 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2845 vRecv.ignore(nMessageSize);
2853 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2858 catch (std::ios_base::failure& e)
2860 if (strstr(e.what(), "end of data"))
2862 // Allow exceptions from underlength message on vRecv
2863 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2865 else if (strstr(e.what(), "size too large"))
2867 // Allow exceptions from overlong size
2868 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2872 PrintExceptionContinue(&e, "ProcessMessage()");
2875 catch (std::exception& e) {
2876 PrintExceptionContinue(&e, "ProcessMessage()");
2878 PrintExceptionContinue(NULL, "ProcessMessage()");
2882 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2890 bool SendMessages(CNode* pto, bool fSendTrickle)
2892 TRY_LOCK(cs_main, lockMain);
2894 // Don't send anything until we get their version message
2895 if (pto->nVersion == 0)
2898 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
2900 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
2901 if (pto->nVersion > BIP0031_VERSION)
2902 pto->PushMessage("ping", 0);
2904 pto->PushMessage("ping");
2907 // Resend wallet transactions that haven't gotten in a block yet
2908 ResendWalletTransactions();
2910 // Address refresh broadcast
2911 static int64 nLastRebroadcast;
2912 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2916 BOOST_FOREACH(CNode* pnode, vNodes)
2918 // Periodically clear setAddrKnown to allow refresh broadcasts
2919 if (nLastRebroadcast)
2920 pnode->setAddrKnown.clear();
2922 // Rebroadcast our address
2923 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2925 CAddress addr(addrLocalHost);
2926 addr.nTime = GetAdjustedTime();
2927 pnode->PushAddress(addr);
2931 nLastRebroadcast = GetTime();
2939 vector<CAddress> vAddr;
2940 vAddr.reserve(pto->vAddrToSend.size());
2941 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2943 // returns true if wasn't already contained in the set
2944 if (pto->setAddrKnown.insert(addr).second)
2946 vAddr.push_back(addr);
2947 // receiver rejects addr messages larger than 1000
2948 if (vAddr.size() >= 1000)
2950 pto->PushMessage("addr", vAddr);
2955 pto->vAddrToSend.clear();
2957 pto->PushMessage("addr", vAddr);
2962 // Message: inventory
2965 vector<CInv> vInvWait;
2967 LOCK(pto->cs_inventory);
2968 vInv.reserve(pto->vInventoryToSend.size());
2969 vInvWait.reserve(pto->vInventoryToSend.size());
2970 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2972 if (pto->setInventoryKnown.count(inv))
2975 // trickle out tx inv to protect privacy
2976 if (inv.type == MSG_TX && !fSendTrickle)
2978 // 1/4 of tx invs blast to all immediately
2979 static uint256 hashSalt;
2981 hashSalt = GetRandHash();
2982 uint256 hashRand = inv.hash ^ hashSalt;
2983 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2984 bool fTrickleWait = ((hashRand & 3) != 0);
2986 // always trickle our own transactions
2990 if (GetTransaction(inv.hash, wtx))
2992 fTrickleWait = true;
2997 vInvWait.push_back(inv);
3002 // returns true if wasn't already contained in the set
3003 if (pto->setInventoryKnown.insert(inv).second)
3005 vInv.push_back(inv);
3006 if (vInv.size() >= 1000)
3008 pto->PushMessage("inv", vInv);
3013 pto->vInventoryToSend = vInvWait;
3016 pto->PushMessage("inv", vInv);
3022 vector<CInv> vGetData;
3023 int64 nNow = GetTime() * 1000000;
3025 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3027 const CInv& inv = (*pto->mapAskFor.begin()).second;
3028 if (!AlreadyHave(txdb, inv))
3030 printf("sending getdata: %s\n", inv.ToString().c_str());
3031 vGetData.push_back(inv);
3032 if (vGetData.size() >= 1000)
3034 pto->PushMessage("getdata", vGetData);
3038 mapAlreadyAskedFor[inv] = nNow;
3039 pto->mapAskFor.erase(pto->mapAskFor.begin());
3041 if (!vGetData.empty())
3042 pto->PushMessage("getdata", vGetData);
3061 //////////////////////////////////////////////////////////////////////////////
3066 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3068 unsigned char* pdata = (unsigned char*)pbuffer;
3069 unsigned int blocks = 1 + ((len + 8) / 64);
3070 unsigned char* pend = pdata + 64 * blocks;
3071 memset(pdata + len, 0, 64 * blocks - len);
3073 unsigned int bits = len * 8;
3074 pend[-1] = (bits >> 0) & 0xff;
3075 pend[-2] = (bits >> 8) & 0xff;
3076 pend[-3] = (bits >> 16) & 0xff;
3077 pend[-4] = (bits >> 24) & 0xff;
3081 static const unsigned int pSHA256InitState[8] =
3082 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3084 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3087 unsigned char data[64];
3091 for (int i = 0; i < 16; i++)
3092 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3094 for (int i = 0; i < 8; i++)
3095 ctx.h[i] = ((uint32_t*)pinit)[i];
3097 SHA256_Update(&ctx, data, sizeof(data));
3098 for (int i = 0; i < 8; i++)
3099 ((uint32_t*)pstate)[i] = ctx.h[i];
3103 // ScanHash scans nonces looking for a hash with at least some zero bits.
3104 // It operates on big endian data. Caller does the byte reversing.
3105 // All input buffers are 16-byte aligned. nNonce is usually preserved
3106 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3107 // the block is rebuilt and nNonce starts over at zero.
3109 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3111 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3115 // Hash pdata using pmidstate as the starting state into
3116 // preformatted buffer phash1, then hash phash1 into phash
3118 SHA256Transform(phash1, pdata, pmidstate);
3119 SHA256Transform(phash, phash1, pSHA256InitState);
3121 // Return the nonce if the hash has at least some zero bits,
3122 // caller will check if it has enough to reach the target
3123 if (((unsigned short*)phash)[14] == 0)
3126 // If nothing found after trying for a while, return -1
3127 if ((nNonce & 0xffff) == 0)
3129 nHashesDone = 0xffff+1;
3130 return (unsigned int) -1;
3135 // Some explaining would be appreciated
3140 set<uint256> setDependsOn;
3143 COrphan(CTransaction* ptxIn)
3151 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3152 BOOST_FOREACH(uint256 hash, setDependsOn)
3153 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3158 uint64 nLastBlockTx = 0;
3159 uint64 nLastBlockSize = 0;
3161 CBlock* CreateNewBlock(CReserveKey& reservekey)
3163 CBlockIndex* pindexPrev = pindexBest;
3166 auto_ptr<CBlock> pblock(new CBlock());
3170 // Create coinbase tx
3172 txNew.vin.resize(1);
3173 txNew.vin[0].prevout.SetNull();
3174 txNew.vout.resize(1);
3175 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3177 // Add our coinbase tx as first transaction
3178 pblock->vtx.push_back(txNew);
3180 // Collect memory pool transactions into the block
3183 LOCK2(cs_main, mempool.cs);
3186 // Priority order to process transactions
3187 list<COrphan> vOrphan; // list memory doesn't move
3188 map<uint256, vector<COrphan*> > mapDependers;
3189 multimap<double, CTransaction*> mapPriority;
3190 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
3192 CTransaction& tx = (*mi).second;
3193 if (tx.IsCoinBase() || !tx.IsFinal())
3196 COrphan* porphan = NULL;
3197 double dPriority = 0;
3198 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3200 // Read prev transaction
3201 CTransaction txPrev;
3203 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3205 // Has to wait for dependencies
3208 // Use list for automatic deletion
3209 vOrphan.push_back(COrphan(&tx));
3210 porphan = &vOrphan.back();
3212 mapDependers[txin.prevout.hash].push_back(porphan);
3213 porphan->setDependsOn.insert(txin.prevout.hash);
3216 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3218 // Read block header
3219 int nConf = txindex.GetDepthInMainChain();
3221 dPriority += (double)nValueIn * nConf;
3223 if (fDebug && GetBoolArg("-printpriority"))
3224 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3227 // Priority is sum(valuein * age) / txsize
3228 dPriority /= ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3231 porphan->dPriority = dPriority;
3233 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3235 if (fDebug && GetBoolArg("-printpriority"))
3237 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3244 // Collect transactions into block
3245 map<uint256, CTxIndex> mapTestPool;
3246 uint64 nBlockSize = 1000;
3247 uint64 nBlockTx = 0;
3248 int nBlockSigOps = 100;
3249 while (!mapPriority.empty())
3251 // Take highest priority transaction off priority queue
3252 double dPriority = -(*mapPriority.begin()).first;
3253 CTransaction& tx = *(*mapPriority.begin()).second;
3254 mapPriority.erase(mapPriority.begin());
3257 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3258 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3261 // Legacy limits on sigOps:
3262 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
3263 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3266 // Transaction fee required depends on block size
3267 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3268 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3270 // Connecting shouldn't fail due to dependency on other memory pool transactions
3271 // because we're already processing them in order of dependency
3272 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3273 MapPrevTx mapInputs;
3275 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3278 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3279 if (nTxFees < nMinFee)
3282 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3283 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3286 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3288 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3289 swap(mapTestPool, mapTestPoolTmp);
3292 pblock->vtx.push_back(tx);
3293 nBlockSize += nTxSize;
3295 nBlockSigOps += nTxSigOps;
3298 // Add transactions that depend on this one to the priority queue
3299 uint256 hash = tx.GetHash();
3300 if (mapDependers.count(hash))
3302 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3304 if (!porphan->setDependsOn.empty())
3306 porphan->setDependsOn.erase(hash);
3307 if (porphan->setDependsOn.empty())
3308 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3314 nLastBlockTx = nBlockTx;
3315 nLastBlockSize = nBlockSize;
3316 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3319 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3322 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3323 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3324 pblock->UpdateTime(pindexPrev);
3325 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3328 return pblock.release();
3332 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3334 // Update nExtraNonce
3335 static uint256 hashPrevBlock;
3336 if (hashPrevBlock != pblock->hashPrevBlock)
3339 hashPrevBlock = pblock->hashPrevBlock;
3342 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3343 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3345 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3349 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3352 // Prebuild hash buffers
3359 uint256 hashPrevBlock;
3360 uint256 hashMerkleRoot;
3363 unsigned int nNonce;
3366 unsigned char pchPadding0[64];
3368 unsigned char pchPadding1[64];
3371 memset(&tmp, 0, sizeof(tmp));
3373 tmp.block.nVersion = pblock->nVersion;
3374 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3375 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3376 tmp.block.nTime = pblock->nTime;
3377 tmp.block.nBits = pblock->nBits;
3378 tmp.block.nNonce = pblock->nNonce;
3380 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3381 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3383 // Byte swap all the input buffer
3384 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
3385 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3387 // Precalc the first half of the first hash, which stays constant
3388 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3390 memcpy(pdata, &tmp.block, 128);
3391 memcpy(phash1, &tmp.hash1, 64);
3395 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3397 uint256 hash = pblock->GetHash();
3398 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3400 if (hash > hashTarget)
3404 printf("BitcoinMiner:\n");
3405 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3407 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3408 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3413 if (pblock->hashPrevBlock != hashBestChain)
3414 return error("BitcoinMiner : generated block is stale");
3416 // Remove key from key pool
3417 reservekey.KeepKey();
3419 // Track how many getdata requests this block gets
3421 LOCK(wallet.cs_wallet);
3422 wallet.mapRequestCount[pblock->GetHash()] = 0;
3425 // Process this block the same as if we had received it from another node
3426 if (!ProcessBlock(NULL, pblock))
3427 return error("BitcoinMiner : ProcessBlock, block not accepted");
3433 void static ThreadBitcoinMiner(void* parg);
3435 static bool fGenerateBitcoins = false;
3436 static bool fLimitProcessors = false;
3437 static int nLimitProcessors = -1;
3439 void static BitcoinMiner(CWallet *pwallet)
3441 printf("BitcoinMiner started\n");
3442 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3444 // Each thread has its own key and counter
3445 CReserveKey reservekey(pwallet);
3446 unsigned int nExtraNonce = 0;
3448 while (fGenerateBitcoins)
3452 while (vNodes.empty() || IsInitialBlockDownload())
3457 if (!fGenerateBitcoins)
3465 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3466 CBlockIndex* pindexPrev = pindexBest;
3468 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3471 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3473 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3477 // Prebuild hash buffers
3479 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3480 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3481 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3483 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3485 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3486 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3487 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3493 int64 nStart = GetTime();
3494 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3496 uint256& hash = *alignup<16>(hashbuf);
3499 unsigned int nHashesDone = 0;
3500 unsigned int nNonceFound;
3503 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3504 (char*)&hash, nHashesDone);
3506 // Check if something found
3507 if (nNonceFound != (unsigned int) -1)
3509 for (unsigned int i = 0; i < sizeof(hash)/4; i++)
3510 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3512 if (hash <= hashTarget)
3515 pblock->nNonce = ByteReverse(nNonceFound);
3516 assert(hash == pblock->GetHash());
3518 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3519 CheckWork(pblock.get(), *pwalletMain, reservekey);
3520 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3526 static int64 nHashCounter;
3527 if (nHPSTimerStart == 0)
3529 nHPSTimerStart = GetTimeMillis();
3533 nHashCounter += nHashesDone;
3534 if (GetTimeMillis() - nHPSTimerStart > 4000)
3536 static CCriticalSection cs;
3539 if (GetTimeMillis() - nHPSTimerStart > 4000)
3541 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3542 nHPSTimerStart = GetTimeMillis();
3544 static int64 nLogTime;
3545 if (GetTime() - nLogTime > 30 * 60)
3547 nLogTime = GetTime();
3548 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3549 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3555 // Check for stop or if block needs to be rebuilt
3558 if (!fGenerateBitcoins)
3560 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3564 if (nBlockNonce >= 0xffff0000)
3566 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3568 if (pindexPrev != pindexBest)
3571 // Update nTime every few seconds
3572 pblock->UpdateTime(pindexPrev);
3573 nBlockTime = ByteReverse(pblock->nTime);
3576 // Changing pblock->nTime can change work required on testnet:
3577 nBlockBits = ByteReverse(pblock->nBits);
3578 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3584 void static ThreadBitcoinMiner(void* parg)
3586 CWallet* pwallet = (CWallet*)parg;
3589 vnThreadsRunning[THREAD_MINER]++;
3590 BitcoinMiner(pwallet);
3591 vnThreadsRunning[THREAD_MINER]--;
3593 catch (std::exception& e) {
3594 vnThreadsRunning[THREAD_MINER]--;
3595 PrintException(&e, "ThreadBitcoinMiner()");
3597 vnThreadsRunning[THREAD_MINER]--;
3598 PrintException(NULL, "ThreadBitcoinMiner()");
3601 if (vnThreadsRunning[THREAD_MINER] == 0)
3603 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3607 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3609 fGenerateBitcoins = fGenerate;
3610 nLimitProcessors = GetArg("-genproclimit", -1);
3611 if (nLimitProcessors == 0)
3612 fGenerateBitcoins = false;
3613 fLimitProcessors = (nLimitProcessors != -1);
3617 int nProcessors = boost::thread::hardware_concurrency();
3618 printf("%d processors\n", nProcessors);
3619 if (nProcessors < 1)
3621 if (fLimitProcessors && nProcessors > nLimitProcessors)
3622 nProcessors = nLimitProcessors;
3623 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3624 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3625 for (int i = 0; i < nAddThreads; i++)
3627 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3628 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");