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 std::vector<unsigned char> randbytes(32);
220 RAND_bytes(&randbytes[0], 32);
221 uint256 randomhash(randbytes);
222 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
223 if (it == mapOrphanTransactions.end())
224 it = mapOrphanTransactions.begin();
225 EraseOrphanTx(it->first);
237 //////////////////////////////////////////////////////////////////////////////
239 // CTransaction and CTxIndex
242 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
245 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
247 if (!ReadFromDisk(txindexRet.pos))
249 if (prevout.n >= vout.size())
257 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
260 return ReadFromDisk(txdb, prevout, txindex);
263 bool CTransaction::ReadFromDisk(COutPoint prevout)
267 return ReadFromDisk(txdb, prevout, txindex);
270 bool CTransaction::IsStandard() const
272 BOOST_FOREACH(const CTxIn& txin, vin)
274 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
275 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
276 // ~65-byte public keys, plus a few script ops.
277 if (txin.scriptSig.size() > 500)
279 if (!txin.scriptSig.IsPushOnly())
282 BOOST_FOREACH(const CTxOut& txout, vout)
283 if (!::IsStandard(txout.scriptPubKey))
289 // Check transaction inputs, and make sure any
290 // pay-to-script-hash transactions are evaluating IsStandard scripts
292 // Why bother? To avoid denial-of-service attacks; an attacker
293 // can submit a standard HASH... OP_EQUAL transaction,
294 // which will get accepted into blocks. The redemption
295 // script can be anything; an attacker could use a very
296 // expensive-to-check-upon-redemption script like:
297 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
299 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
302 return true; // Coinbases don't use vin normally
304 for (unsigned int i = 0; i < vin.size(); i++)
306 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
308 vector<vector<unsigned char> > vSolutions;
309 txnouttype whichType;
310 // get the scriptPubKey corresponding to this input:
311 const CScript& prevScript = prev.scriptPubKey;
312 if (!Solver(prevScript, whichType, vSolutions))
314 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
315 if (nArgsExpected < 0)
318 // Transactions with extra stuff in their scriptSigs are
319 // non-standard. Note that this EvalScript() call will
320 // be quick, because if there are any operations
321 // beside "push data" in the scriptSig the
322 // IsStandard() call returns false
323 vector<vector<unsigned char> > stack;
324 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
327 if (whichType == TX_SCRIPTHASH)
331 CScript subscript(stack.back().begin(), stack.back().end());
332 vector<vector<unsigned char> > vSolutions2;
333 txnouttype whichType2;
334 if (!Solver(subscript, whichType2, vSolutions2))
336 if (whichType2 == TX_SCRIPTHASH)
340 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
343 nArgsExpected += tmpExpected;
346 if (stack.size() != (unsigned int)nArgsExpected)
354 CTransaction::GetLegacySigOpCount() const
356 unsigned int nSigOps = 0;
357 BOOST_FOREACH(const CTxIn& txin, vin)
359 nSigOps += txin.scriptSig.GetSigOpCount(false);
361 BOOST_FOREACH(const CTxOut& txout, vout)
363 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
369 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
381 // Load the block this tx is in
383 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
385 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
390 // Update the tx's hashBlock
391 hashBlock = pblock->GetHash();
393 // Locate the transaction
394 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
395 if (pblock->vtx[nIndex] == *(CTransaction*)this)
397 if (nIndex == (int)pblock->vtx.size())
399 vMerkleBranch.clear();
401 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
405 // Fill in merkle branch
406 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
409 // Is the tx in a block that's in the main chain
410 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
411 if (mi == mapBlockIndex.end())
413 CBlockIndex* pindex = (*mi).second;
414 if (!pindex || !pindex->IsInMainChain())
417 return pindexBest->nHeight - pindex->nHeight + 1;
426 bool CTransaction::CheckTransaction() const
428 // Basic checks that don't depend on any context
430 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
432 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
434 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
435 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
437 // Check for negative or overflow output values
439 BOOST_FOREACH(const CTxOut& txout, vout)
441 if (txout.nValue < 0)
442 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
443 if (txout.nValue > MAX_MONEY)
444 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
445 nValueOut += txout.nValue;
446 if (!MoneyRange(nValueOut))
447 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
450 // Check for duplicate inputs
451 set<COutPoint> vInOutPoints;
452 BOOST_FOREACH(const CTxIn& txin, vin)
454 if (vInOutPoints.count(txin.prevout))
456 vInOutPoints.insert(txin.prevout);
461 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
462 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
466 BOOST_FOREACH(const CTxIn& txin, vin)
467 if (txin.prevout.IsNull())
468 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
474 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
475 bool* pfMissingInputs)
478 *pfMissingInputs = false;
480 if (!tx.CheckTransaction())
481 return error("CTxMemPool::accept() : CheckTransaction failed");
483 // Coinbase is only valid in a block, not as a loose transaction
485 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
487 // To help v0.1.5 clients who would see it as a negative number
488 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
489 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
491 // Rather not work on nonstandard transactions (unless -testnet)
492 if (!fTestNet && !tx.IsStandard())
493 return error("CTxMemPool::accept() : nonstandard transaction type");
495 // Do we already have it?
496 uint256 hash = tx.GetHash();
499 if (mapTx.count(hash))
503 if (txdb.ContainsTx(hash))
506 // Check for conflicts with in-memory transactions
507 CTransaction* ptxOld = NULL;
508 for (unsigned int i = 0; i < tx.vin.size(); i++)
510 COutPoint outpoint = tx.vin[i].prevout;
511 if (mapNextTx.count(outpoint))
513 // Disable replacement feature for now
516 // Allow replacing with a newer version of the same transaction
519 ptxOld = mapNextTx[outpoint].ptx;
520 if (ptxOld->IsFinal())
522 if (!tx.IsNewerThan(*ptxOld))
524 for (unsigned int i = 0; i < tx.vin.size(); i++)
526 COutPoint outpoint = tx.vin[i].prevout;
527 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
537 map<uint256, CTxIndex> mapUnused;
538 bool fInvalid = false;
539 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
542 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
544 *pfMissingInputs = true;
545 return error("CTxMemPool::accept() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
548 // Check for non-standard pay-to-script-hash in inputs
549 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
550 return error("CTxMemPool::accept() : nonstandard transaction input");
552 // Note: if you modify this code to accept non-standard transactions, then
553 // you should add code here to check that the transaction does a
554 // reasonable number of ECDSA signature verifications.
556 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
557 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
559 // Don't accept it if it can't get into a block
560 if (nFees < tx.GetMinFee(1000, true, GMF_RELAY))
561 return error("CTxMemPool::accept() : not enough fees");
563 // Continuously rate-limit free transactions
564 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
565 // be annoying or make other's transactions take longer to confirm.
566 if (nFees < MIN_RELAY_TX_FEE)
568 static CCriticalSection cs;
569 static double dFreeCount;
570 static int64 nLastTime;
571 int64 nNow = GetTime();
575 // Use an exponentially decaying ~10-minute window:
576 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
578 // -limitfreerelay unit is thousand-bytes-per-minute
579 // At default rate it would take over a month to fill 1GB
580 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
581 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
583 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
588 // Check against previous transactions
589 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
590 if (!tx.ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
592 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
596 // Store transaction in memory
601 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
607 ///// are we sure this is ok when loading transactions or restoring block txes
608 // If updated, erase old tx from wallet
610 EraseFromWallets(ptxOld->GetHash());
612 printf("CTxMemPool::accept() : accepted %s\n", hash.ToString().substr(0,10).c_str());
616 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
618 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
621 bool CTxMemPool::addUnchecked(CTransaction &tx)
623 printf("addUnchecked(): size %lu\n", mapTx.size());
624 // Add to memory pool without checking anything. Don't call this directly,
625 // call CTxMemPool::accept to properly check the transaction first.
628 uint256 hash = tx.GetHash();
630 for (unsigned int i = 0; i < tx.vin.size(); i++)
631 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
632 nTransactionsUpdated++;
638 bool CTxMemPool::remove(CTransaction &tx)
640 // Remove transaction from memory pool
643 uint256 hash = tx.GetHash();
644 if (mapTx.count(hash))
646 BOOST_FOREACH(const CTxIn& txin, tx.vin)
647 mapNextTx.erase(txin.prevout);
649 nTransactionsUpdated++;
660 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
662 if (hashBlock == 0 || nIndex == -1)
665 // Find the block it claims to be in
666 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
667 if (mi == mapBlockIndex.end())
669 CBlockIndex* pindex = (*mi).second;
670 if (!pindex || !pindex->IsInMainChain())
673 // Make sure the merkle branch connects to this block
674 if (!fMerkleVerified)
676 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
678 fMerkleVerified = true;
682 return pindexBest->nHeight - pindex->nHeight + 1;
686 int CMerkleTx::GetBlocksToMaturity() const
690 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
694 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
698 if (!IsInMainChain() && !ClientConnectInputs())
700 return CTransaction::AcceptToMemoryPool(txdb, false);
704 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
708 bool CMerkleTx::AcceptToMemoryPool()
711 return AcceptToMemoryPool(txdb);
716 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
721 // Add previous supporting transactions first
722 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
724 if (!tx.IsCoinBase())
726 uint256 hash = tx.GetHash();
727 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
728 tx.AcceptToMemoryPool(txdb, fCheckInputs);
731 return AcceptToMemoryPool(txdb, fCheckInputs);
736 bool CWalletTx::AcceptWalletTransaction()
739 return AcceptWalletTransaction(txdb);
742 int CTxIndex::GetDepthInMainChain() const
746 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
748 // Find the block in the index
749 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
750 if (mi == mapBlockIndex.end())
752 CBlockIndex* pindex = (*mi).second;
753 if (!pindex || !pindex->IsInMainChain())
755 return 1 + nBestHeight - pindex->nHeight;
767 //////////////////////////////////////////////////////////////////////////////
769 // CBlock and CBlockIndex
772 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
774 if (!fReadTransactions)
776 *this = pindex->GetBlockHeader();
779 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
781 if (GetHash() != pindex->GetBlockHash())
782 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
786 uint256 static GetOrphanRoot(const CBlock* pblock)
788 // Work back to the first block in the orphan chain
789 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
790 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
791 return pblock->GetHash();
794 int64 static GetBlockValue(int nHeight, int64 nFees)
796 int64 nSubsidy = 50 * COIN;
798 // Subsidy is cut in half every 4 years
799 nSubsidy >>= (nHeight / 210000);
801 return nSubsidy + nFees;
804 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
805 static const int64 nTargetSpacing = 10 * 60;
806 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
809 // minimum amount of work that could possibly be required nTime after
810 // minimum work required was nBase
812 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
814 // Testnet has min-difficulty blocks
815 // after nTargetSpacing*2 time between blocks:
816 if (fTestNet && nTime > nTargetSpacing*2)
817 return bnProofOfWorkLimit.GetCompact();
820 bnResult.SetCompact(nBase);
821 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
823 // Maximum 400% adjustment...
825 // ... in best-case exactly 4-times-normal target time
826 nTime -= nTargetTimespan*4;
828 if (bnResult > bnProofOfWorkLimit)
829 bnResult = bnProofOfWorkLimit;
830 return bnResult.GetCompact();
833 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
835 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
838 if (pindexLast == NULL)
839 return nProofOfWorkLimit;
841 // Only change once per interval
842 if ((pindexLast->nHeight+1) % nInterval != 0)
844 // Special rules for testnet after 15 Feb 2012:
845 if (fTestNet && pblock->nTime > 1329264000)
847 // If the new block's timestamp is more than 2* 10 minutes
848 // then allow mining of a min-difficulty block.
849 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
850 return nProofOfWorkLimit;
853 // Return the last non-special-min-difficulty-rules-block
854 const CBlockIndex* pindex = pindexLast;
855 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
856 pindex = pindex->pprev;
857 return pindex->nBits;
861 return pindexLast->nBits;
864 // Go back by what we want to be 14 days worth of blocks
865 const CBlockIndex* pindexFirst = pindexLast;
866 for (int i = 0; pindexFirst && i < nInterval-1; i++)
867 pindexFirst = pindexFirst->pprev;
870 // Limit adjustment step
871 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
872 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
873 if (nActualTimespan < nTargetTimespan/4)
874 nActualTimespan = nTargetTimespan/4;
875 if (nActualTimespan > nTargetTimespan*4)
876 nActualTimespan = nTargetTimespan*4;
880 bnNew.SetCompact(pindexLast->nBits);
881 bnNew *= nActualTimespan;
882 bnNew /= nTargetTimespan;
884 if (bnNew > bnProofOfWorkLimit)
885 bnNew = bnProofOfWorkLimit;
888 printf("GetNextWorkRequired RETARGET\n");
889 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
890 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
891 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
893 return bnNew.GetCompact();
896 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
899 bnTarget.SetCompact(nBits);
902 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
903 return error("CheckProofOfWork() : nBits below minimum work");
905 // Check proof of work matches claimed amount
906 if (hash > bnTarget.getuint256())
907 return error("CheckProofOfWork() : hash doesn't match nBits");
912 // Return maximum amount of blocks that other nodes claim to have
913 int GetNumBlocksOfPeers()
915 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
918 bool IsInitialBlockDownload()
920 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
922 static int64 nLastUpdate;
923 static CBlockIndex* pindexLastBest;
924 if (pindexBest != pindexLastBest)
926 pindexLastBest = pindexBest;
927 nLastUpdate = GetTime();
929 return (GetTime() - nLastUpdate < 10 &&
930 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
933 void static InvalidChainFound(CBlockIndex* pindexNew)
935 if (pindexNew->bnChainWork > bnBestInvalidWork)
937 bnBestInvalidWork = pindexNew->bnChainWork;
938 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
941 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());
942 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
943 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
944 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
947 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
949 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
951 // Updating time can change work required on testnet:
953 nBits = GetNextWorkRequired(pindexPrev, this);
966 bool CTransaction::DisconnectInputs(CTxDB& txdb)
968 // Relinquish previous transactions' spent pointers
971 BOOST_FOREACH(const CTxIn& txin, vin)
973 COutPoint prevout = txin.prevout;
975 // Get prev txindex from disk
977 if (!txdb.ReadTxIndex(prevout.hash, txindex))
978 return error("DisconnectInputs() : ReadTxIndex failed");
980 if (prevout.n >= txindex.vSpent.size())
981 return error("DisconnectInputs() : prevout.n out of range");
983 // Mark outpoint as not spent
984 txindex.vSpent[prevout.n].SetNull();
987 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
988 return error("DisconnectInputs() : UpdateTxIndex failed");
992 // Remove transaction from index
993 // This can fail if a duplicate of this transaction was in a chain that got
994 // reorganized away. This is only possible if this transaction was completely
995 // spent, so erasing it would be a no-op anway.
996 txdb.EraseTxIndex(*this);
1002 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1003 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1005 // FetchInputs can return false either because we just haven't seen some inputs
1006 // (in which case the transaction should be stored as an orphan)
1007 // or because the transaction is malformed (in which case the transaction should
1008 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1012 return true; // Coinbase transactions have no inputs to fetch.
1014 for (unsigned int i = 0; i < vin.size(); i++)
1016 COutPoint prevout = vin[i].prevout;
1017 if (inputsRet.count(prevout.hash))
1018 continue; // Got it already
1021 CTxIndex& txindex = inputsRet[prevout.hash].first;
1023 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1025 // Get txindex from current proposed changes
1026 txindex = mapTestPool.find(prevout.hash)->second;
1030 // Read txindex from txdb
1031 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1033 if (!fFound && (fBlock || fMiner))
1034 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());
1037 CTransaction& txPrev = inputsRet[prevout.hash].second;
1038 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1040 // Get prev tx from single transactions in memory
1043 if (!mempool.exists(prevout.hash))
1044 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());
1045 txPrev = mempool.lookup(prevout.hash);
1048 txindex.vSpent.resize(txPrev.vout.size());
1052 // Get prev tx from disk
1053 if (!txPrev.ReadFromDisk(txindex.pos))
1054 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1058 // Make sure all prevout.n's are valid:
1059 for (unsigned int i = 0; i < vin.size(); i++)
1061 const COutPoint prevout = vin[i].prevout;
1062 assert(inputsRet.count(prevout.hash) != 0);
1063 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1064 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1065 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1067 // Revisit this if/when transaction replacement is implemented and allows
1070 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()));
1077 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1079 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1080 if (mi == inputs.end())
1081 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1083 const CTransaction& txPrev = (mi->second).second;
1084 if (input.prevout.n >= txPrev.vout.size())
1085 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1087 return txPrev.vout[input.prevout.n];
1090 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1096 for (unsigned int i = 0; i < vin.size(); i++)
1098 nResult += GetOutputFor(vin[i], inputs).nValue;
1104 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1109 unsigned int nSigOps = 0;
1110 for (unsigned int i = 0; i < vin.size(); i++)
1112 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1113 if (prevout.scriptPubKey.IsPayToScriptHash())
1114 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1119 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1120 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1121 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1123 // Take over previous transactions' spent pointers
1124 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1125 // fMiner is true when called from the internal bitcoin miner
1126 // ... both are false when called from CTransaction::AcceptToMemoryPool
1131 for (unsigned int i = 0; i < vin.size(); i++)
1133 COutPoint prevout = vin[i].prevout;
1134 assert(inputs.count(prevout.hash) > 0);
1135 CTxIndex& txindex = inputs[prevout.hash].first;
1136 CTransaction& txPrev = inputs[prevout.hash].second;
1138 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1139 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()));
1141 // If prev is coinbase, check that it's matured
1142 if (txPrev.IsCoinBase())
1143 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1144 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1145 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1147 // Check for negative or overflow input values
1148 nValueIn += txPrev.vout[prevout.n].nValue;
1149 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1150 return DoS(100, error("ConnectInputs() : txin values out of range"));
1153 // The first loop above does all the inexpensive checks.
1154 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1155 // Helps prevent CPU exhaustion attacks.
1156 for (unsigned int i = 0; i < vin.size(); i++)
1158 COutPoint prevout = vin[i].prevout;
1159 assert(inputs.count(prevout.hash) > 0);
1160 CTxIndex& txindex = inputs[prevout.hash].first;
1161 CTransaction& txPrev = inputs[prevout.hash].second;
1163 // Check for conflicts (double-spend)
1164 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1165 // for an attacker to attempt to split the network.
1166 if (!txindex.vSpent[prevout.n].IsNull())
1167 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());
1169 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1170 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1171 // still computed and checked, and any change will be caught at the next checkpoint.
1172 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1175 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1177 // only during transition phase for P2SH: do not invoke anti-DoS code for
1178 // potentially old clients relaying bad P2SH transactions
1179 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1180 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1182 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1186 // Mark outpoints as spent
1187 txindex.vSpent[prevout.n] = posThisTx;
1190 if (fBlock || fMiner)
1192 mapTestPool[prevout.hash] = txindex;
1196 if (nValueIn < GetValueOut())
1197 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1199 // Tally transaction fees
1200 int64 nTxFee = nValueIn - GetValueOut();
1202 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1204 if (!MoneyRange(nFees))
1205 return DoS(100, error("ConnectInputs() : nFees out of range"));
1212 bool CTransaction::ClientConnectInputs()
1217 // Take over previous transactions' spent pointers
1221 for (unsigned int i = 0; i < vin.size(); i++)
1223 // Get prev tx from single transactions in memory
1224 COutPoint prevout = vin[i].prevout;
1225 if (!mempool.exists(prevout.hash))
1227 CTransaction& txPrev = mempool.lookup(prevout.hash);
1229 if (prevout.n >= txPrev.vout.size())
1233 if (!VerifySignature(txPrev, *this, i, true, 0))
1234 return error("ConnectInputs() : VerifySignature failed");
1236 ///// this is redundant with the mempool.mapNextTx stuff,
1237 ///// not sure which I want to get rid of
1238 ///// this has to go away now that posNext is gone
1239 // // Check for conflicts
1240 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1241 // return error("ConnectInputs() : prev tx already used");
1243 // // Flag outpoints as used
1244 // txPrev.vout[prevout.n].posNext = posThisTx;
1246 nValueIn += txPrev.vout[prevout.n].nValue;
1248 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1249 return error("ClientConnectInputs() : txin values out of range");
1251 if (GetValueOut() > nValueIn)
1261 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1263 // Disconnect in reverse order
1264 for (int i = vtx.size()-1; i >= 0; i--)
1265 if (!vtx[i].DisconnectInputs(txdb))
1268 // Update block index on disk without changing it in memory.
1269 // The memory index structure will be changed after the db commits.
1272 CDiskBlockIndex blockindexPrev(pindex->pprev);
1273 blockindexPrev.hashNext = 0;
1274 if (!txdb.WriteBlockIndex(blockindexPrev))
1275 return error("DisconnectBlock() : WriteBlockIndex failed");
1281 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1283 // Check it again in case a previous version let a bad block in
1287 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1288 // unless those are already completely spent.
1289 // If such overwrites are allowed, coinbases and transactions depending upon those
1290 // can be duplicated to remove the ability to spend the first instance -- even after
1291 // being sent to another address.
1292 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1293 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1294 // already refuses previously-known transaction id's entirely.
1295 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1296 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1297 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1299 BOOST_FOREACH(CTransaction& tx, vtx)
1301 CTxIndex txindexOld;
1302 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1304 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1311 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1312 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1313 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1315 //// issue here: it doesn't know the version
1316 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - 1 + GetSizeOfCompactSize(vtx.size());
1318 map<uint256, CTxIndex> mapQueuedChanges;
1320 unsigned int nSigOps = 0;
1321 BOOST_FOREACH(CTransaction& tx, vtx)
1323 nSigOps += tx.GetLegacySigOpCount();
1324 if (nSigOps > MAX_BLOCK_SIGOPS)
1325 return DoS(100, error("ConnectBlock() : too many sigops"));
1327 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1328 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1330 MapPrevTx mapInputs;
1331 if (!tx.IsCoinBase())
1334 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1337 if (fStrictPayToScriptHash)
1339 // Add in sigops done by pay-to-script-hash inputs;
1340 // this is to prevent a "rogue miner" from creating
1341 // an incredibly-expensive-to-validate block.
1342 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1343 if (nSigOps > MAX_BLOCK_SIGOPS)
1344 return DoS(100, error("ConnectBlock() : too many sigops"));
1347 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1349 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1353 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1356 // Write queued txindex changes
1357 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1359 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1360 return error("ConnectBlock() : UpdateTxIndex failed");
1363 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1366 // Update block index on disk without changing it in memory.
1367 // The memory index structure will be changed after the db commits.
1370 CDiskBlockIndex blockindexPrev(pindex->pprev);
1371 blockindexPrev.hashNext = pindex->GetBlockHash();
1372 if (!txdb.WriteBlockIndex(blockindexPrev))
1373 return error("ConnectBlock() : WriteBlockIndex failed");
1376 // Watch for transactions paying to me
1377 BOOST_FOREACH(CTransaction& tx, vtx)
1378 SyncWithWallets(tx, this, true);
1383 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1385 printf("REORGANIZE\n");
1388 CBlockIndex* pfork = pindexBest;
1389 CBlockIndex* plonger = pindexNew;
1390 while (pfork != plonger)
1392 while (plonger->nHeight > pfork->nHeight)
1393 if (!(plonger = plonger->pprev))
1394 return error("Reorganize() : plonger->pprev is null");
1395 if (pfork == plonger)
1397 if (!(pfork = pfork->pprev))
1398 return error("Reorganize() : pfork->pprev is null");
1401 // List of what to disconnect
1402 vector<CBlockIndex*> vDisconnect;
1403 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1404 vDisconnect.push_back(pindex);
1406 // List of what to connect
1407 vector<CBlockIndex*> vConnect;
1408 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1409 vConnect.push_back(pindex);
1410 reverse(vConnect.begin(), vConnect.end());
1412 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());
1413 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());
1415 // Disconnect shorter branch
1416 vector<CTransaction> vResurrect;
1417 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1420 if (!block.ReadFromDisk(pindex))
1421 return error("Reorganize() : ReadFromDisk for disconnect failed");
1422 if (!block.DisconnectBlock(txdb, pindex))
1423 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1425 // Queue memory transactions to resurrect
1426 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1427 if (!tx.IsCoinBase())
1428 vResurrect.push_back(tx);
1431 // Connect longer branch
1432 vector<CTransaction> vDelete;
1433 for (unsigned int i = 0; i < vConnect.size(); i++)
1435 CBlockIndex* pindex = vConnect[i];
1437 if (!block.ReadFromDisk(pindex))
1438 return error("Reorganize() : ReadFromDisk for connect failed");
1439 if (!block.ConnectBlock(txdb, pindex))
1443 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1446 // Queue memory transactions to delete
1447 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1448 vDelete.push_back(tx);
1450 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1451 return error("Reorganize() : WriteHashBestChain failed");
1453 // Make sure it's successfully written to disk before changing memory structure
1454 if (!txdb.TxnCommit())
1455 return error("Reorganize() : TxnCommit failed");
1457 // Disconnect shorter branch
1458 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1460 pindex->pprev->pnext = NULL;
1462 // Connect longer branch
1463 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1465 pindex->pprev->pnext = pindex;
1467 // Resurrect memory transactions that were in the disconnected branch
1468 BOOST_FOREACH(CTransaction& tx, vResurrect)
1469 tx.AcceptToMemoryPool(txdb, false);
1471 // Delete redundant memory transactions that are in the connected branch
1472 BOOST_FOREACH(CTransaction& tx, vDelete)
1475 printf("REORGANIZE: done\n");
1482 runCommand(std::string strCommand)
1484 int nErr = ::system(strCommand.c_str());
1486 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1489 // Called from inside SetBestChain: attaches a block to the new best chain being built
1490 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1492 uint256 hash = GetHash();
1494 // Adding to current best branch
1495 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1498 InvalidChainFound(pindexNew);
1501 if (!txdb.TxnCommit())
1502 return error("SetBestChain() : TxnCommit failed");
1504 // Add to current best branch
1505 pindexNew->pprev->pnext = pindexNew;
1507 // Delete redundant memory transactions
1508 BOOST_FOREACH(CTransaction& tx, vtx)
1514 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1516 uint256 hash = GetHash();
1519 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1521 txdb.WriteHashBestChain(hash);
1522 if (!txdb.TxnCommit())
1523 return error("SetBestChain() : TxnCommit failed");
1524 pindexGenesisBlock = pindexNew;
1526 else if (hashPrevBlock == hashBestChain)
1528 if (!SetBestChainInner(txdb, pindexNew))
1529 return error("SetBestChain() : SetBestChainInner failed");
1533 // the first block in the new chain that will cause it to become the new best chain
1534 CBlockIndex *pindexIntermediate = pindexNew;
1536 // list of blocks that need to be connected afterwards
1537 std::vector<CBlockIndex*> vpindexSecondary;
1539 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1540 // Try to limit how much needs to be done inside
1541 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1543 vpindexSecondary.push_back(pindexIntermediate);
1544 pindexIntermediate = pindexIntermediate->pprev;
1547 if (!vpindexSecondary.empty())
1548 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1550 // Switch to new best branch
1551 if (!Reorganize(txdb, pindexIntermediate))
1554 InvalidChainFound(pindexNew);
1555 return error("SetBestChain() : Reorganize failed");
1558 // Connect futher blocks
1559 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1562 if (!block.ReadFromDisk(pindex))
1564 printf("SetBestChain() : ReadFromDisk failed\n");
1568 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1569 if (!block.SetBestChainInner(txdb, pindex))
1574 // Update best block in wallet (so we can detect restored wallets)
1575 bool fIsInitialDownload = IsInitialBlockDownload();
1576 if (!fIsInitialDownload)
1578 const CBlockLocator locator(pindexNew);
1579 ::SetBestChain(locator);
1583 hashBestChain = hash;
1584 pindexBest = pindexNew;
1585 nBestHeight = pindexBest->nHeight;
1586 bnBestChainWork = pindexNew->bnChainWork;
1587 nTimeBestReceived = GetTime();
1588 nTransactionsUpdated++;
1589 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1591 std::string strCmd = GetArg("-blocknotify", "");
1593 if (!fIsInitialDownload && !strCmd.empty())
1595 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1596 boost::thread t(runCommand, strCmd); // thread runs free
1603 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1605 // Check for duplicate
1606 uint256 hash = GetHash();
1607 if (mapBlockIndex.count(hash))
1608 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1610 // Construct new block index object
1611 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1613 return error("AddToBlockIndex() : new CBlockIndex failed");
1614 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1615 pindexNew->phashBlock = &((*mi).first);
1616 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1617 if (miPrev != mapBlockIndex.end())
1619 pindexNew->pprev = (*miPrev).second;
1620 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1622 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1626 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1627 if (!txdb.TxnCommit())
1631 if (pindexNew->bnChainWork > bnBestChainWork)
1632 if (!SetBestChain(txdb, pindexNew))
1637 if (pindexNew == pindexBest)
1639 // Notify UI to display prev block's coinbase if it was ours
1640 static uint256 hashPrevBestCoinBase;
1641 UpdatedTransaction(hashPrevBestCoinBase);
1642 hashPrevBestCoinBase = vtx[0].GetHash();
1652 bool CBlock::CheckBlock() const
1654 // These are checks that are independent of context
1655 // that can be verified before saving an orphan block.
1658 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
1659 return DoS(100, error("CheckBlock() : size limits failed"));
1661 // Check proof of work matches claimed amount
1662 if (!CheckProofOfWork(GetHash(), nBits))
1663 return DoS(50, error("CheckBlock() : proof of work failed"));
1666 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1667 return error("CheckBlock() : block timestamp too far in the future");
1669 // First transaction must be coinbase, the rest must not be
1670 if (vtx.empty() || !vtx[0].IsCoinBase())
1671 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1672 for (unsigned int i = 1; i < vtx.size(); i++)
1673 if (vtx[i].IsCoinBase())
1674 return DoS(100, error("CheckBlock() : more than one coinbase"));
1676 // Check transactions
1677 BOOST_FOREACH(const CTransaction& tx, vtx)
1678 if (!tx.CheckTransaction())
1679 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1681 // Check for duplicate txids. This is caught by ConnectInputs(),
1682 // but catching it earlier avoids a potential DoS attack:
1683 set<uint256> uniqueTx;
1684 BOOST_FOREACH(const CTransaction& tx, vtx)
1686 uniqueTx.insert(tx.GetHash());
1688 if (uniqueTx.size() != vtx.size())
1689 return DoS(100, error("CheckBlock() : duplicate transaction"));
1691 unsigned int nSigOps = 0;
1692 BOOST_FOREACH(const CTransaction& tx, vtx)
1694 nSigOps += tx.GetLegacySigOpCount();
1696 if (nSigOps > MAX_BLOCK_SIGOPS)
1697 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1700 if (hashMerkleRoot != BuildMerkleTree())
1701 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1706 bool CBlock::AcceptBlock()
1708 // Check for duplicate
1709 uint256 hash = GetHash();
1710 if (mapBlockIndex.count(hash))
1711 return error("AcceptBlock() : block already in mapBlockIndex");
1713 // Get prev block index
1714 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1715 if (mi == mapBlockIndex.end())
1716 return DoS(10, error("AcceptBlock() : prev block not found"));
1717 CBlockIndex* pindexPrev = (*mi).second;
1718 int nHeight = pindexPrev->nHeight+1;
1720 // Check proof of work
1721 if (nBits != GetNextWorkRequired(pindexPrev, this))
1722 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1724 // Check timestamp against prev
1725 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1726 return error("AcceptBlock() : block's timestamp is too early");
1728 // Check that all transactions are finalized
1729 BOOST_FOREACH(const CTransaction& tx, vtx)
1730 if (!tx.IsFinal(nHeight, GetBlockTime()))
1731 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1733 // Check that the block chain matches the known block chain up to a checkpoint
1734 if (!Checkpoints::CheckBlock(nHeight, hash))
1735 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1737 // Write block to history file
1738 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
1739 return error("AcceptBlock() : out of disk space");
1740 unsigned int nFile = -1;
1741 unsigned int nBlockPos = 0;
1742 if (!WriteToDisk(nFile, nBlockPos))
1743 return error("AcceptBlock() : WriteToDisk failed");
1744 if (!AddToBlockIndex(nFile, nBlockPos))
1745 return error("AcceptBlock() : AddToBlockIndex failed");
1747 // Relay inventory, but don't relay old inventory during initial block download
1748 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1749 if (hashBestChain == hash)
1752 BOOST_FOREACH(CNode* pnode, vNodes)
1753 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1754 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1760 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1762 // Check for duplicate
1763 uint256 hash = pblock->GetHash();
1764 if (mapBlockIndex.count(hash))
1765 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1766 if (mapOrphanBlocks.count(hash))
1767 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1769 // Preliminary checks
1770 if (!pblock->CheckBlock())
1771 return error("ProcessBlock() : CheckBlock FAILED");
1773 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1774 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1776 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1777 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1781 pfrom->Misbehaving(100);
1782 return error("ProcessBlock() : block with timestamp before last checkpoint");
1785 bnNewBlock.SetCompact(pblock->nBits);
1787 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1788 if (bnNewBlock > bnRequired)
1791 pfrom->Misbehaving(100);
1792 return error("ProcessBlock() : block with too little proof-of-work");
1797 // If don't already have its previous block, shunt it off to holding area until we get it
1798 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1800 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1801 CBlock* pblock2 = new CBlock(*pblock);
1802 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1803 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1805 // Ask this guy to fill in what we're missing
1807 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1812 if (!pblock->AcceptBlock())
1813 return error("ProcessBlock() : AcceptBlock FAILED");
1815 // Recursively process any orphan blocks that depended on this one
1816 vector<uint256> vWorkQueue;
1817 vWorkQueue.push_back(hash);
1818 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
1820 uint256 hashPrev = vWorkQueue[i];
1821 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1822 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1825 CBlock* pblockOrphan = (*mi).second;
1826 if (pblockOrphan->AcceptBlock())
1827 vWorkQueue.push_back(pblockOrphan->GetHash());
1828 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1829 delete pblockOrphan;
1831 mapOrphanBlocksByPrev.erase(hashPrev);
1834 printf("ProcessBlock: ACCEPTED\n");
1845 bool CheckDiskSpace(uint64 nAdditionalBytes)
1847 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1849 // Check for 15MB because database could create another 10MB log file at any time
1850 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1853 string strMessage = _("Warning: Disk space is low ");
1854 strMiscWarning = strMessage;
1855 printf("*** %s\n", strMessage.c_str());
1856 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1863 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1867 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1870 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1872 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1881 static unsigned int nCurrentBlockFile = 1;
1883 FILE* AppendBlockFile(unsigned int& nFileRet)
1888 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1891 if (fseek(file, 0, SEEK_END) != 0)
1893 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1894 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1896 nFileRet = nCurrentBlockFile;
1900 nCurrentBlockFile++;
1904 bool LoadBlockIndex(bool fAllowNew)
1908 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1909 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1910 pchMessageStart[0] = 0xfa;
1911 pchMessageStart[1] = 0xbf;
1912 pchMessageStart[2] = 0xb5;
1913 pchMessageStart[3] = 0xda;
1920 if (!txdb.LoadBlockIndex())
1925 // Init with genesis block
1927 if (mapBlockIndex.empty())
1933 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1934 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1935 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1936 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1937 // vMerkleTree: 4a5e1e
1940 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1942 txNew.vin.resize(1);
1943 txNew.vout.resize(1);
1944 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1945 txNew.vout[0].nValue = 50 * COIN;
1946 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1948 block.vtx.push_back(txNew);
1949 block.hashPrevBlock = 0;
1950 block.hashMerkleRoot = block.BuildMerkleTree();
1952 block.nTime = 1231006505;
1953 block.nBits = 0x1d00ffff;
1954 block.nNonce = 2083236893;
1958 block.nTime = 1296688602;
1959 block.nBits = 0x1d07fff8;
1960 block.nNonce = 384568319;
1964 printf("%s\n", block.GetHash().ToString().c_str());
1965 printf("%s\n", hashGenesisBlock.ToString().c_str());
1966 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1967 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1969 assert(block.GetHash() == hashGenesisBlock);
1971 // Start new block file
1973 unsigned int nBlockPos;
1974 if (!block.WriteToDisk(nFile, nBlockPos))
1975 return error("LoadBlockIndex() : writing genesis block to disk failed");
1976 if (!block.AddToBlockIndex(nFile, nBlockPos))
1977 return error("LoadBlockIndex() : genesis block not accepted");
1985 void PrintBlockTree()
1987 // precompute tree structure
1988 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1989 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1991 CBlockIndex* pindex = (*mi).second;
1992 mapNext[pindex->pprev].push_back(pindex);
1994 //while (rand() % 3 == 0)
1995 // mapNext[pindex->pprev].push_back(pindex);
1998 vector<pair<int, CBlockIndex*> > vStack;
1999 vStack.push_back(make_pair(0, pindexGenesisBlock));
2002 while (!vStack.empty())
2004 int nCol = vStack.back().first;
2005 CBlockIndex* pindex = vStack.back().second;
2008 // print split or gap
2009 if (nCol > nPrevCol)
2011 for (int i = 0; i < nCol-1; i++)
2015 else if (nCol < nPrevCol)
2017 for (int i = 0; i < nCol; i++)
2024 for (int i = 0; i < nCol; i++)
2029 block.ReadFromDisk(pindex);
2030 printf("%d (%u,%u) %s %s tx %d",
2034 block.GetHash().ToString().substr(0,20).c_str(),
2035 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2038 PrintWallets(block);
2040 // put the main timechain first
2041 vector<CBlockIndex*>& vNext = mapNext[pindex];
2042 for (unsigned int i = 0; i < vNext.size(); i++)
2044 if (vNext[i]->pnext)
2046 swap(vNext[0], vNext[i]);
2052 for (unsigned int i = 0; i < vNext.size(); i++)
2053 vStack.push_back(make_pair(nCol+i, vNext[i]));
2066 //////////////////////////////////////////////////////////////////////////////
2071 map<uint256, CAlert> mapAlerts;
2072 CCriticalSection cs_mapAlerts;
2074 string GetWarnings(string strFor)
2077 string strStatusBar;
2079 if (GetBoolArg("-testsafemode"))
2082 // Misc warnings like out of disk space and clock is wrong
2083 if (strMiscWarning != "")
2086 strStatusBar = strMiscWarning;
2089 // Longer invalid proof-of-work chain
2090 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2093 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2099 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2101 const CAlert& alert = item.second;
2102 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2104 nPriority = alert.nPriority;
2105 strStatusBar = alert.strStatusBar;
2110 if (strFor == "statusbar")
2111 return strStatusBar;
2112 else if (strFor == "rpc")
2114 assert(!"GetWarnings() : invalid parameter");
2118 bool CAlert::ProcessAlert()
2120 if (!CheckSignature())
2127 // Cancel previous alerts
2128 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2130 const CAlert& alert = (*mi).second;
2133 printf("cancelling alert %d\n", alert.nID);
2134 mapAlerts.erase(mi++);
2136 else if (!alert.IsInEffect())
2138 printf("expiring alert %d\n", alert.nID);
2139 mapAlerts.erase(mi++);
2145 // Check if this alert has been cancelled
2146 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2148 const CAlert& alert = item.second;
2149 if (alert.Cancels(*this))
2151 printf("alert already cancelled by %d\n", alert.nID);
2157 mapAlerts.insert(make_pair(GetHash(), *this));
2160 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2172 //////////////////////////////////////////////////////////////////////////////
2178 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2184 bool txInMap = false;
2187 txInMap = (mempool.exists(inv.hash));
2190 mapOrphanTransactions.count(inv.hash) ||
2191 txdb.ContainsTx(inv.hash);
2195 return mapBlockIndex.count(inv.hash) ||
2196 mapOrphanBlocks.count(inv.hash);
2198 // Don't know what it is, just say we already got one
2205 // The message start string is designed to be unlikely to occur in normal data.
2206 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2207 // a large 4-byte int at any alignment.
2208 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2211 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2213 static map<CService, vector<unsigned char> > mapReuseKey;
2214 RandAddSeedPerfmon();
2216 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2217 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2219 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2221 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2229 if (strCommand == "version")
2231 // Each connection can only send one version message
2232 if (pfrom->nVersion != 0)
2234 pfrom->Misbehaving(1);
2242 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2243 if (pfrom->nVersion < MIN_PROTO_VERSION)
2245 // Since February 20, 2012, the protocol is initiated at version 209,
2246 // and earlier versions are no longer supported
2247 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2248 pfrom->fDisconnect = true;
2252 if (pfrom->nVersion == 10300)
2253 pfrom->nVersion = 300;
2255 vRecv >> addrFrom >> nNonce;
2257 vRecv >> pfrom->strSubVer;
2259 vRecv >> pfrom->nStartingHeight;
2261 // Disconnect if we connected to ourself
2262 if (nNonce == nLocalHostNonce && nNonce > 1)
2264 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2265 pfrom->fDisconnect = true;
2269 // Be shy and don't send version until we hear
2270 if (pfrom->fInbound)
2271 pfrom->PushVersion();
2273 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2275 AddTimeData(pfrom->addr, nTime);
2278 pfrom->PushMessage("verack");
2279 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2281 if (!pfrom->fInbound)
2283 // Advertise our address
2284 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2285 !IsInitialBlockDownload())
2287 CAddress addr(addrLocalHost);
2288 addr.nTime = GetAdjustedTime();
2289 pfrom->PushAddress(addr);
2292 // Get recent addresses
2293 if (pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
2295 pfrom->PushMessage("getaddr");
2296 pfrom->fGetAddr = true;
2298 addrman.Good(pfrom->addr);
2300 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2302 addrman.Add(addrFrom, addrFrom);
2303 addrman.Good(addrFrom);
2307 // Ask the first connected node for block updates
2308 static int nAskedForBlocks = 0;
2309 if (!pfrom->fClient &&
2310 (pfrom->nVersion < NOBLKS_VERSION_START ||
2311 pfrom->nVersion >= NOBLKS_VERSION_END) &&
2312 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2315 pfrom->PushGetBlocks(pindexBest, uint256(0));
2321 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2322 item.second.RelayTo(pfrom);
2325 pfrom->fSuccessfullyConnected = true;
2327 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2329 cPeerBlockCounts.input(pfrom->nStartingHeight);
2333 else if (pfrom->nVersion == 0)
2335 // Must have a version message before anything else
2336 pfrom->Misbehaving(1);
2341 else if (strCommand == "verack")
2343 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2347 else if (strCommand == "addr")
2349 vector<CAddress> vAddr;
2352 // Don't want addr from older versions unless seeding
2353 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
2355 if (vAddr.size() > 1000)
2357 pfrom->Misbehaving(20);
2358 return error("message addr size() = %d", vAddr.size());
2361 // Store the new addresses
2362 int64 nNow = GetAdjustedTime();
2363 int64 nSince = nNow - 10 * 60;
2364 BOOST_FOREACH(CAddress& addr, vAddr)
2368 // ignore IPv6 for now, since it isn't implemented anyway
2371 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2372 addr.nTime = nNow - 5 * 24 * 60 * 60;
2373 pfrom->AddAddressKnown(addr);
2374 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2376 // Relay to a limited number of other nodes
2379 // Use deterministic randomness to send to the same nodes for 24 hours
2380 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2381 static uint256 hashSalt;
2383 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2384 int64 hashAddr = addr.GetHash();
2385 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2386 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2387 multimap<uint256, CNode*> mapMix;
2388 BOOST_FOREACH(CNode* pnode, vNodes)
2390 if (pnode->nVersion < CADDR_TIME_VERSION)
2392 unsigned int nPointer;
2393 memcpy(&nPointer, &pnode, sizeof(nPointer));
2394 uint256 hashKey = hashRand ^ nPointer;
2395 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2396 mapMix.insert(make_pair(hashKey, pnode));
2398 int nRelayNodes = 2;
2399 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2400 ((*mi).second)->PushAddress(addr);
2404 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2405 if (vAddr.size() < 1000)
2406 pfrom->fGetAddr = false;
2410 else if (strCommand == "inv")
2414 if (vInv.size() > 50000)
2416 pfrom->Misbehaving(20);
2417 return error("message inv size() = %d", vInv.size());
2421 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
2423 const CInv &inv = vInv[nInv];
2427 pfrom->AddInventoryKnown(inv);
2429 bool fAlreadyHave = AlreadyHave(txdb, inv);
2431 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2433 // Always request the last block in an inv bundle (even if we already have it), as it is the
2434 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2435 // this is necessary to connect earlier received orphan blocks to the chain again.
2436 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2438 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2439 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2441 // Track requests for our stuff
2442 Inventory(inv.hash);
2447 else if (strCommand == "getdata")
2451 if (vInv.size() > 50000)
2453 pfrom->Misbehaving(20);
2454 return error("message getdata size() = %d", vInv.size());
2457 BOOST_FOREACH(const CInv& inv, vInv)
2461 printf("received getdata for: %s\n", inv.ToString().c_str());
2463 if (inv.type == MSG_BLOCK)
2465 // Send block from disk
2466 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2467 if (mi != mapBlockIndex.end())
2470 block.ReadFromDisk((*mi).second);
2471 pfrom->PushMessage("block", block);
2473 // Trigger them to send a getblocks request for the next batch of inventory
2474 if (inv.hash == pfrom->hashContinue)
2476 // Bypass PushInventory, this must send even if redundant,
2477 // and we want it right after the last block so they don't
2478 // wait for other stuff first.
2480 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2481 pfrom->PushMessage("inv", vInv);
2482 pfrom->hashContinue = 0;
2486 else if (inv.IsKnownType())
2488 // Send stream from relay memory
2491 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2492 if (mi != mapRelay.end())
2493 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2497 // Track requests for our stuff
2498 Inventory(inv.hash);
2503 else if (strCommand == "getblocks")
2505 CBlockLocator locator;
2507 vRecv >> locator >> hashStop;
2509 // Find the last block the caller has in the main chain
2510 CBlockIndex* pindex = locator.GetBlockIndex();
2512 // Send the rest of the chain
2514 pindex = pindex->pnext;
2515 int nLimit = 500 + locator.GetDistanceBack();
2516 unsigned int nBytes = 0;
2517 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2518 for (; pindex; pindex = pindex->pnext)
2520 if (pindex->GetBlockHash() == hashStop)
2522 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2525 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2527 block.ReadFromDisk(pindex, true);
2528 nBytes += block.GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
2529 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2531 // When this block is requested, we'll send an inv that'll make them
2532 // getblocks the next batch of inventory.
2533 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2534 pfrom->hashContinue = pindex->GetBlockHash();
2541 else if (strCommand == "getheaders")
2543 CBlockLocator locator;
2545 vRecv >> locator >> hashStop;
2547 CBlockIndex* pindex = NULL;
2548 if (locator.IsNull())
2550 // If locator is null, return the hashStop block
2551 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2552 if (mi == mapBlockIndex.end())
2554 pindex = (*mi).second;
2558 // Find the last block the caller has in the main chain
2559 pindex = locator.GetBlockIndex();
2561 pindex = pindex->pnext;
2564 vector<CBlock> vHeaders;
2566 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2567 for (; pindex; pindex = pindex->pnext)
2569 vHeaders.push_back(pindex->GetBlockHeader());
2570 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2573 pfrom->PushMessage("headers", vHeaders);
2577 else if (strCommand == "tx")
2579 vector<uint256> vWorkQueue;
2580 vector<uint256> vEraseQueue;
2581 CDataStream vMsg(vRecv);
2586 CInv inv(MSG_TX, tx.GetHash());
2587 pfrom->AddInventoryKnown(inv);
2589 bool fMissingInputs = false;
2590 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2592 SyncWithWallets(tx, NULL, true);
2593 RelayMessage(inv, vMsg);
2594 mapAlreadyAskedFor.erase(inv);
2595 vWorkQueue.push_back(inv.hash);
2596 vEraseQueue.push_back(inv.hash);
2598 // Recursively process any orphan transactions that depended on this one
2599 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2601 uint256 hashPrev = vWorkQueue[i];
2602 for (map<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
2603 mi != mapOrphanTransactionsByPrev[hashPrev].end();
2606 const CDataStream& vMsg = *((*mi).second);
2608 CDataStream(vMsg) >> tx;
2609 CInv inv(MSG_TX, tx.GetHash());
2610 bool fMissingInputs2 = false;
2612 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
2614 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2615 SyncWithWallets(tx, NULL, true);
2616 RelayMessage(inv, vMsg);
2617 mapAlreadyAskedFor.erase(inv);
2618 vWorkQueue.push_back(inv.hash);
2619 vEraseQueue.push_back(inv.hash);
2621 else if (!fMissingInputs2)
2624 vEraseQueue.push_back(inv.hash);
2625 printf(" removed invalid orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2630 BOOST_FOREACH(uint256 hash, vEraseQueue)
2631 EraseOrphanTx(hash);
2633 else if (fMissingInputs)
2637 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2638 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2640 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
2642 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2646 else if (strCommand == "block")
2651 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2654 CInv inv(MSG_BLOCK, block.GetHash());
2655 pfrom->AddInventoryKnown(inv);
2657 if (ProcessBlock(pfrom, &block))
2658 mapAlreadyAskedFor.erase(inv);
2659 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2663 else if (strCommand == "getaddr")
2665 pfrom->vAddrToSend.clear();
2666 vector<CAddress> vAddr = addrman.GetAddr();
2667 BOOST_FOREACH(const CAddress &addr, vAddr)
2668 pfrom->PushAddress(addr);
2672 else if (strCommand == "checkorder")
2677 if (!GetBoolArg("-allowreceivebyip"))
2679 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2686 /// we have a chance to check the order here
2688 // Keep giving the same key to the same ip until they use it
2689 if (!mapReuseKey.count(pfrom->addr))
2690 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2692 // Send back approval of order and pubkey to use
2693 CScript scriptPubKey;
2694 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2695 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2699 else if (strCommand == "reply")
2704 CRequestTracker tracker;
2706 LOCK(pfrom->cs_mapRequests);
2707 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2708 if (mi != pfrom->mapRequests.end())
2710 tracker = (*mi).second;
2711 pfrom->mapRequests.erase(mi);
2714 if (!tracker.IsNull())
2715 tracker.fn(tracker.param1, vRecv);
2719 else if (strCommand == "ping")
2721 if (pfrom->nVersion > BIP0031_VERSION)
2725 // Echo the message back with the nonce. This allows for two useful features:
2727 // 1) A remote node can quickly check if the connection is operational
2728 // 2) Remote nodes can measure the latency of the network thread. If this node
2729 // is overloaded it won't respond to pings quickly and the remote node can
2730 // avoid sending us more work, like chain download requests.
2732 // The nonce stops the remote getting confused between different pings: without
2733 // it, if the remote node sends a ping once per second and this node takes 5
2734 // seconds to respond to each, the 5th ping the remote sends would appear to
2735 // return very quickly.
2736 pfrom->PushMessage("pong", nonce);
2741 else if (strCommand == "alert")
2746 if (alert.ProcessAlert())
2749 pfrom->setKnown.insert(alert.GetHash());
2752 BOOST_FOREACH(CNode* pnode, vNodes)
2753 alert.RelayTo(pnode);
2761 // Ignore unknown commands for extensibility
2765 // Update the last seen time for this node's address
2766 if (pfrom->fNetworkNode)
2767 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2768 AddressCurrentlyConnected(pfrom->addr);
2774 bool ProcessMessages(CNode* pfrom)
2776 CDataStream& vRecv = pfrom->vRecv;
2780 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2784 // (4) message start
2793 // Scan for message start
2794 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2795 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2796 if (vRecv.end() - pstart < nHeaderSize)
2798 if ((int)vRecv.size() > nHeaderSize)
2800 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2801 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2805 if (pstart - vRecv.begin() > 0)
2806 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2807 vRecv.erase(vRecv.begin(), pstart);
2810 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2815 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2818 string strCommand = hdr.GetCommand();
2821 unsigned int nMessageSize = hdr.nMessageSize;
2822 if (nMessageSize > MAX_SIZE)
2824 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2827 if (nMessageSize > vRecv.size())
2829 // Rewind and wait for rest of message
2830 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2835 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2836 unsigned int nChecksum = 0;
2837 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2838 if (nChecksum != hdr.nChecksum)
2840 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2841 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2845 // Copy message to its own buffer
2846 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2847 vRecv.ignore(nMessageSize);
2855 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2860 catch (std::ios_base::failure& e)
2862 if (strstr(e.what(), "end of data"))
2864 // Allow exceptions from underlength message on vRecv
2865 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());
2867 else if (strstr(e.what(), "size too large"))
2869 // Allow exceptions from overlong size
2870 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2874 PrintExceptionContinue(&e, "ProcessMessage()");
2877 catch (std::exception& e) {
2878 PrintExceptionContinue(&e, "ProcessMessage()");
2880 PrintExceptionContinue(NULL, "ProcessMessage()");
2884 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2892 bool SendMessages(CNode* pto, bool fSendTrickle)
2894 TRY_LOCK(cs_main, lockMain);
2896 // Don't send anything until we get their version message
2897 if (pto->nVersion == 0)
2900 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
2902 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
2903 if (pto->nVersion > BIP0031_VERSION)
2904 pto->PushMessage("ping", 0);
2906 pto->PushMessage("ping");
2909 // Resend wallet transactions that haven't gotten in a block yet
2910 ResendWalletTransactions();
2912 // Address refresh broadcast
2913 static int64 nLastRebroadcast;
2914 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2918 BOOST_FOREACH(CNode* pnode, vNodes)
2920 // Periodically clear setAddrKnown to allow refresh broadcasts
2921 if (nLastRebroadcast)
2922 pnode->setAddrKnown.clear();
2924 // Rebroadcast our address
2925 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2927 CAddress addr(addrLocalHost);
2928 addr.nTime = GetAdjustedTime();
2929 pnode->PushAddress(addr);
2933 nLastRebroadcast = GetTime();
2941 vector<CAddress> vAddr;
2942 vAddr.reserve(pto->vAddrToSend.size());
2943 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2945 // returns true if wasn't already contained in the set
2946 if (pto->setAddrKnown.insert(addr).second)
2948 vAddr.push_back(addr);
2949 // receiver rejects addr messages larger than 1000
2950 if (vAddr.size() >= 1000)
2952 pto->PushMessage("addr", vAddr);
2957 pto->vAddrToSend.clear();
2959 pto->PushMessage("addr", vAddr);
2964 // Message: inventory
2967 vector<CInv> vInvWait;
2969 LOCK(pto->cs_inventory);
2970 vInv.reserve(pto->vInventoryToSend.size());
2971 vInvWait.reserve(pto->vInventoryToSend.size());
2972 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2974 if (pto->setInventoryKnown.count(inv))
2977 // trickle out tx inv to protect privacy
2978 if (inv.type == MSG_TX && !fSendTrickle)
2980 // 1/4 of tx invs blast to all immediately
2981 static uint256 hashSalt;
2983 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2984 uint256 hashRand = inv.hash ^ hashSalt;
2985 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2986 bool fTrickleWait = ((hashRand & 3) != 0);
2988 // always trickle our own transactions
2992 if (GetTransaction(inv.hash, wtx))
2994 fTrickleWait = true;
2999 vInvWait.push_back(inv);
3004 // returns true if wasn't already contained in the set
3005 if (pto->setInventoryKnown.insert(inv).second)
3007 vInv.push_back(inv);
3008 if (vInv.size() >= 1000)
3010 pto->PushMessage("inv", vInv);
3015 pto->vInventoryToSend = vInvWait;
3018 pto->PushMessage("inv", vInv);
3024 vector<CInv> vGetData;
3025 int64 nNow = GetTime() * 1000000;
3027 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3029 const CInv& inv = (*pto->mapAskFor.begin()).second;
3030 if (!AlreadyHave(txdb, inv))
3032 printf("sending getdata: %s\n", inv.ToString().c_str());
3033 vGetData.push_back(inv);
3034 if (vGetData.size() >= 1000)
3036 pto->PushMessage("getdata", vGetData);
3040 mapAlreadyAskedFor[inv] = nNow;
3041 pto->mapAskFor.erase(pto->mapAskFor.begin());
3043 if (!vGetData.empty())
3044 pto->PushMessage("getdata", vGetData);
3063 //////////////////////////////////////////////////////////////////////////////
3068 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3070 unsigned char* pdata = (unsigned char*)pbuffer;
3071 unsigned int blocks = 1 + ((len + 8) / 64);
3072 unsigned char* pend = pdata + 64 * blocks;
3073 memset(pdata + len, 0, 64 * blocks - len);
3075 unsigned int bits = len * 8;
3076 pend[-1] = (bits >> 0) & 0xff;
3077 pend[-2] = (bits >> 8) & 0xff;
3078 pend[-3] = (bits >> 16) & 0xff;
3079 pend[-4] = (bits >> 24) & 0xff;
3083 static const unsigned int pSHA256InitState[8] =
3084 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3086 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3089 unsigned char data[64];
3093 for (int i = 0; i < 16; i++)
3094 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3096 for (int i = 0; i < 8; i++)
3097 ctx.h[i] = ((uint32_t*)pinit)[i];
3099 SHA256_Update(&ctx, data, sizeof(data));
3100 for (int i = 0; i < 8; i++)
3101 ((uint32_t*)pstate)[i] = ctx.h[i];
3105 // ScanHash scans nonces looking for a hash with at least some zero bits.
3106 // It operates on big endian data. Caller does the byte reversing.
3107 // All input buffers are 16-byte aligned. nNonce is usually preserved
3108 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3109 // the block is rebuilt and nNonce starts over at zero.
3111 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3113 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3117 // Hash pdata using pmidstate as the starting state into
3118 // preformatted buffer phash1, then hash phash1 into phash
3120 SHA256Transform(phash1, pdata, pmidstate);
3121 SHA256Transform(phash, phash1, pSHA256InitState);
3123 // Return the nonce if the hash has at least some zero bits,
3124 // caller will check if it has enough to reach the target
3125 if (((unsigned short*)phash)[14] == 0)
3128 // If nothing found after trying for a while, return -1
3129 if ((nNonce & 0xffff) == 0)
3131 nHashesDone = 0xffff+1;
3132 return (unsigned int) -1;
3137 // Some explaining would be appreciated
3142 set<uint256> setDependsOn;
3145 COrphan(CTransaction* ptxIn)
3153 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3154 BOOST_FOREACH(uint256 hash, setDependsOn)
3155 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3160 uint64 nLastBlockTx = 0;
3161 uint64 nLastBlockSize = 0;
3163 CBlock* CreateNewBlock(CReserveKey& reservekey)
3165 CBlockIndex* pindexPrev = pindexBest;
3168 auto_ptr<CBlock> pblock(new CBlock());
3172 // Create coinbase tx
3174 txNew.vin.resize(1);
3175 txNew.vin[0].prevout.SetNull();
3176 txNew.vout.resize(1);
3177 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3179 // Add our coinbase tx as first transaction
3180 pblock->vtx.push_back(txNew);
3182 // Collect memory pool transactions into the block
3185 LOCK2(cs_main, mempool.cs);
3188 // Priority order to process transactions
3189 list<COrphan> vOrphan; // list memory doesn't move
3190 map<uint256, vector<COrphan*> > mapDependers;
3191 multimap<double, CTransaction*> mapPriority;
3192 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
3194 CTransaction& tx = (*mi).second;
3195 if (tx.IsCoinBase() || !tx.IsFinal())
3198 COrphan* porphan = NULL;
3199 double dPriority = 0;
3200 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3202 // Read prev transaction
3203 CTransaction txPrev;
3205 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3207 // Has to wait for dependencies
3210 // Use list for automatic deletion
3211 vOrphan.push_back(COrphan(&tx));
3212 porphan = &vOrphan.back();
3214 mapDependers[txin.prevout.hash].push_back(porphan);
3215 porphan->setDependsOn.insert(txin.prevout.hash);
3218 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3220 // Read block header
3221 int nConf = txindex.GetDepthInMainChain();
3223 dPriority += (double)nValueIn * nConf;
3225 if (fDebug && GetBoolArg("-printpriority"))
3226 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3229 // Priority is sum(valuein * age) / txsize
3230 dPriority /= ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3233 porphan->dPriority = dPriority;
3235 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3237 if (fDebug && GetBoolArg("-printpriority"))
3239 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3246 // Collect transactions into block
3247 map<uint256, CTxIndex> mapTestPool;
3248 uint64 nBlockSize = 1000;
3249 uint64 nBlockTx = 0;
3250 int nBlockSigOps = 100;
3251 while (!mapPriority.empty())
3253 // Take highest priority transaction off priority queue
3254 double dPriority = -(*mapPriority.begin()).first;
3255 CTransaction& tx = *(*mapPriority.begin()).second;
3256 mapPriority.erase(mapPriority.begin());
3259 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3260 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3263 // Legacy limits on sigOps:
3264 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
3265 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3268 // Transaction fee required depends on block size
3269 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3270 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3272 // Connecting shouldn't fail due to dependency on other memory pool transactions
3273 // because we're already processing them in order of dependency
3274 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3275 MapPrevTx mapInputs;
3277 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3280 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3281 if (nTxFees < nMinFee)
3284 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3285 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3288 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3290 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3291 swap(mapTestPool, mapTestPoolTmp);
3294 pblock->vtx.push_back(tx);
3295 nBlockSize += nTxSize;
3297 nBlockSigOps += nTxSigOps;
3300 // Add transactions that depend on this one to the priority queue
3301 uint256 hash = tx.GetHash();
3302 if (mapDependers.count(hash))
3304 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3306 if (!porphan->setDependsOn.empty())
3308 porphan->setDependsOn.erase(hash);
3309 if (porphan->setDependsOn.empty())
3310 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3316 nLastBlockTx = nBlockTx;
3317 nLastBlockSize = nBlockSize;
3318 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3321 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3324 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3325 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3326 pblock->UpdateTime(pindexPrev);
3327 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3330 return pblock.release();
3334 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3336 // Update nExtraNonce
3337 static uint256 hashPrevBlock;
3338 if (hashPrevBlock != pblock->hashPrevBlock)
3341 hashPrevBlock = pblock->hashPrevBlock;
3344 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3345 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3347 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3351 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3354 // Prebuild hash buffers
3361 uint256 hashPrevBlock;
3362 uint256 hashMerkleRoot;
3365 unsigned int nNonce;
3368 unsigned char pchPadding0[64];
3370 unsigned char pchPadding1[64];
3373 memset(&tmp, 0, sizeof(tmp));
3375 tmp.block.nVersion = pblock->nVersion;
3376 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3377 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3378 tmp.block.nTime = pblock->nTime;
3379 tmp.block.nBits = pblock->nBits;
3380 tmp.block.nNonce = pblock->nNonce;
3382 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3383 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3385 // Byte swap all the input buffer
3386 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
3387 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3389 // Precalc the first half of the first hash, which stays constant
3390 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3392 memcpy(pdata, &tmp.block, 128);
3393 memcpy(phash1, &tmp.hash1, 64);
3397 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3399 uint256 hash = pblock->GetHash();
3400 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3402 if (hash > hashTarget)
3406 printf("BitcoinMiner:\n");
3407 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3409 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3410 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3415 if (pblock->hashPrevBlock != hashBestChain)
3416 return error("BitcoinMiner : generated block is stale");
3418 // Remove key from key pool
3419 reservekey.KeepKey();
3421 // Track how many getdata requests this block gets
3423 LOCK(wallet.cs_wallet);
3424 wallet.mapRequestCount[pblock->GetHash()] = 0;
3427 // Process this block the same as if we had received it from another node
3428 if (!ProcessBlock(NULL, pblock))
3429 return error("BitcoinMiner : ProcessBlock, block not accepted");
3435 void static ThreadBitcoinMiner(void* parg);
3437 static bool fGenerateBitcoins = false;
3438 static bool fLimitProcessors = false;
3439 static int nLimitProcessors = -1;
3441 void static BitcoinMiner(CWallet *pwallet)
3443 printf("BitcoinMiner started\n");
3444 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3446 // Each thread has its own key and counter
3447 CReserveKey reservekey(pwallet);
3448 unsigned int nExtraNonce = 0;
3450 while (fGenerateBitcoins)
3454 while (vNodes.empty() || IsInitialBlockDownload())
3459 if (!fGenerateBitcoins)
3467 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3468 CBlockIndex* pindexPrev = pindexBest;
3470 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3473 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3475 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3479 // Prebuild hash buffers
3481 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3482 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3483 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3485 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3487 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3488 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3489 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3495 int64 nStart = GetTime();
3496 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3498 uint256& hash = *alignup<16>(hashbuf);
3501 unsigned int nHashesDone = 0;
3502 unsigned int nNonceFound;
3505 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3506 (char*)&hash, nHashesDone);
3508 // Check if something found
3509 if (nNonceFound != (unsigned int) -1)
3511 for (unsigned int i = 0; i < sizeof(hash)/4; i++)
3512 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3514 if (hash <= hashTarget)
3517 pblock->nNonce = ByteReverse(nNonceFound);
3518 assert(hash == pblock->GetHash());
3520 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3521 CheckWork(pblock.get(), *pwalletMain, reservekey);
3522 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3528 static int64 nHashCounter;
3529 if (nHPSTimerStart == 0)
3531 nHPSTimerStart = GetTimeMillis();
3535 nHashCounter += nHashesDone;
3536 if (GetTimeMillis() - nHPSTimerStart > 4000)
3538 static CCriticalSection cs;
3541 if (GetTimeMillis() - nHPSTimerStart > 4000)
3543 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3544 nHPSTimerStart = GetTimeMillis();
3546 static int64 nLogTime;
3547 if (GetTime() - nLogTime > 30 * 60)
3549 nLogTime = GetTime();
3550 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3551 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3557 // Check for stop or if block needs to be rebuilt
3560 if (!fGenerateBitcoins)
3562 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3566 if (nBlockNonce >= 0xffff0000)
3568 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3570 if (pindexPrev != pindexBest)
3573 // Update nTime every few seconds
3574 pblock->UpdateTime(pindexPrev);
3575 nBlockTime = ByteReverse(pblock->nTime);
3578 // Changing pblock->nTime can change work required on testnet:
3579 nBlockBits = ByteReverse(pblock->nBits);
3580 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3586 void static ThreadBitcoinMiner(void* parg)
3588 CWallet* pwallet = (CWallet*)parg;
3591 vnThreadsRunning[THREAD_MINER]++;
3592 BitcoinMiner(pwallet);
3593 vnThreadsRunning[THREAD_MINER]--;
3595 catch (std::exception& e) {
3596 vnThreadsRunning[THREAD_MINER]--;
3597 PrintException(&e, "ThreadBitcoinMiner()");
3599 vnThreadsRunning[THREAD_MINER]--;
3600 PrintException(NULL, "ThreadBitcoinMiner()");
3603 if (vnThreadsRunning[THREAD_MINER] == 0)
3605 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3609 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3611 fGenerateBitcoins = fGenerate;
3612 nLimitProcessors = GetArg("-genproclimit", -1);
3613 if (nLimitProcessors == 0)
3614 fGenerateBitcoins = false;
3615 fLimitProcessors = (nLimitProcessors != -1);
3619 int nProcessors = boost::thread::hardware_concurrency();
3620 printf("%d processors\n", nProcessors);
3621 if (nProcessors < 1)
3623 if (fLimitProcessors && nProcessors > nLimitProcessors)
3624 nProcessors = nLimitProcessors;
3625 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3626 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3627 for (int i = 0; i < nAddThreads; i++)
3629 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3630 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");