1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include <boost/algorithm/string/replace.hpp>
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 // Name of client reported in the 'version' message. Report the same name
22 // for both bitcoind and bitcoin-qt, to make it harder for attackers to
23 // target servers or GUI users specifically.
24 const std::string CLIENT_NAME("Satoshi");
26 CCriticalSection cs_setpwalletRegistered;
27 set<CWallet*> setpwalletRegistered;
29 CCriticalSection cs_main;
31 static map<uint256, CTransaction> mapTransactions;
32 CCriticalSection cs_mapTransactions;
33 unsigned int nTransactionsUpdated = 0;
34 map<COutPoint, CInPoint> mapNextTx;
36 map<uint256, CBlockIndex*> mapBlockIndex;
37 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
38 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
39 CBlockIndex* pindexGenesisBlock = NULL;
41 CBigNum bnBestChainWork = 0;
42 CBigNum bnBestInvalidWork = 0;
43 uint256 hashBestChain = 0;
44 CBlockIndex* pindexBest = NULL;
45 int64 nTimeBestReceived = 0;
47 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
49 map<uint256, CBlock*> mapOrphanBlocks;
50 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
52 map<uint256, CDataStream*> mapOrphanTransactions;
53 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
55 // Constant stuff for coinbase transactions we create:
56 CScript COINBASE_FLAGS;
58 const string strMessageMagic = "Bitcoin Signed Message:\n";
64 int64 nTransactionFee = 0;
68 //////////////////////////////////////////////////////////////////////////////
70 // dispatching functions
73 // These functions dispatch to one or all registered wallets
76 void RegisterWallet(CWallet* pwalletIn)
79 LOCK(cs_setpwalletRegistered);
80 setpwalletRegistered.insert(pwalletIn);
84 void UnregisterWallet(CWallet* pwalletIn)
87 LOCK(cs_setpwalletRegistered);
88 setpwalletRegistered.erase(pwalletIn);
92 // check whether the passed transaction is from us
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 // get the wallet transaction with the given hash (if it exists)
102 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
104 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
105 if (pwallet->GetTransaction(hashTx,wtx))
110 // erases transaction with the given hash from all wallets
111 void static EraseFromWallets(uint256 hash)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 pwallet->EraseFromWallet(hash);
117 // make sure all wallets know about the given transaction, in the given block
118 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
120 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
121 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
124 // notify wallets about a new best chain
125 void static SetBestChain(const CBlockLocator& loc)
127 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
128 pwallet->SetBestChain(loc);
131 // notify wallets about an updated transaction
132 void static UpdatedTransaction(const uint256& hashTx)
134 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
135 pwallet->UpdatedTransaction(hashTx);
139 void static PrintWallets(const CBlock& block)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->PrintWallet(block);
145 // notify wallets about an incoming inventory (for request counts)
146 void static Inventory(const uint256& hash)
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->Inventory(hash);
152 // ask wallets to resend their transactions
153 void static ResendWalletTransactions()
155 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
156 pwallet->ResendWalletTransactions();
165 //////////////////////////////////////////////////////////////////////////////
167 // mapOrphanTransactions
170 void AddOrphanTx(const CDataStream& vMsg)
173 CDataStream(vMsg) >> tx;
174 uint256 hash = tx.GetHash();
175 if (mapOrphanTransactions.count(hash))
178 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
179 BOOST_FOREACH(const CTxIn& txin, tx.vin)
180 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
183 void static EraseOrphanTx(uint256 hash)
185 if (!mapOrphanTransactions.count(hash))
187 const CDataStream* pvMsg = mapOrphanTransactions[hash];
189 CDataStream(*pvMsg) >> tx;
190 BOOST_FOREACH(const CTxIn& txin, tx.vin)
192 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
193 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
195 if ((*mi).second == pvMsg)
196 mapOrphanTransactionsByPrev.erase(mi++);
202 mapOrphanTransactions.erase(hash);
205 int LimitOrphanTxSize(int nMaxOrphans)
208 while (mapOrphanTransactions.size() > nMaxOrphans)
210 // Evict a random orphan:
211 std::vector<unsigned char> randbytes(32);
212 RAND_bytes(&randbytes[0], 32);
213 uint256 randomhash(randbytes);
214 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
215 if (it == mapOrphanTransactions.end())
216 it = mapOrphanTransactions.begin();
217 EraseOrphanTx(it->first);
229 //////////////////////////////////////////////////////////////////////////////
231 // CTransaction and CTxIndex
234 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
237 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
239 if (!ReadFromDisk(txindexRet.pos))
241 if (prevout.n >= vout.size())
249 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
252 return ReadFromDisk(txdb, prevout, txindex);
255 bool CTransaction::ReadFromDisk(COutPoint prevout)
259 return ReadFromDisk(txdb, prevout, txindex);
262 bool CTransaction::IsStandard() const
264 BOOST_FOREACH(const CTxIn& txin, vin)
266 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
267 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
268 // ~65-byte public keys, plus a few script ops.
269 if (txin.scriptSig.size() > 500)
271 if (!txin.scriptSig.IsPushOnly())
274 BOOST_FOREACH(const CTxOut& txout, vout)
275 if (!::IsStandard(txout.scriptPubKey))
281 // Check transaction inputs, and make sure any
282 // pay-to-script-hash transactions are evaluating IsStandard scripts
284 // Why bother? To avoid denial-of-service attacks; an attacker
285 // can submit a standard HASH... OP_EQUAL transaction,
286 // which will get accepted into blocks. The redemption
287 // script can be anything; an attacker could use a very
288 // expensive-to-check-upon-redemption script like:
289 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
291 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
294 return true; // Coinbases don't use vin normally
296 for (int i = 0; i < vin.size(); i++)
298 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
300 vector<vector<unsigned char> > vSolutions;
301 txnouttype whichType;
302 // get the scriptPubKey corresponding to this input:
303 const CScript& prevScript = prev.scriptPubKey;
304 if (!Solver(prevScript, whichType, vSolutions))
306 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
308 // Transactions with extra stuff in their scriptSigs are
309 // non-standard. Note that this EvalScript() call will
310 // be quick, because if there are any operations
311 // beside "push data" in the scriptSig the
312 // IsStandard() call returns false
313 vector<vector<unsigned char> > stack;
314 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
317 if (whichType == TX_SCRIPTHASH)
321 CScript subscript(stack.back().begin(), stack.back().end());
322 vector<vector<unsigned char> > vSolutions2;
323 txnouttype whichType2;
324 if (!Solver(subscript, whichType2, vSolutions2))
326 if (whichType2 == TX_SCRIPTHASH)
328 nArgsExpected += ScriptSigArgsExpected(whichType2, vSolutions2);
331 if (stack.size() != nArgsExpected)
339 CTransaction::GetLegacySigOpCount() const
342 BOOST_FOREACH(const CTxIn& txin, vin)
344 nSigOps += txin.scriptSig.GetSigOpCount(false);
346 BOOST_FOREACH(const CTxOut& txout, vout)
348 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
354 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
366 // Load the block this tx is in
368 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
370 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
375 // Update the tx's hashBlock
376 hashBlock = pblock->GetHash();
378 // Locate the transaction
379 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
380 if (pblock->vtx[nIndex] == *(CTransaction*)this)
382 if (nIndex == pblock->vtx.size())
384 vMerkleBranch.clear();
386 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
390 // Fill in merkle branch
391 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
394 // Is the tx in a block that's in the main chain
395 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
396 if (mi == mapBlockIndex.end())
398 CBlockIndex* pindex = (*mi).second;
399 if (!pindex || !pindex->IsInMainChain())
402 return pindexBest->nHeight - pindex->nHeight + 1;
411 bool CTransaction::CheckTransaction() const
413 // Basic checks that don't depend on any context
415 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
417 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
419 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
420 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
422 // Check for negative or overflow output values
424 BOOST_FOREACH(const CTxOut& txout, vout)
426 if (txout.nValue < 0)
427 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
428 if (txout.nValue > MAX_MONEY)
429 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
430 nValueOut += txout.nValue;
431 if (!MoneyRange(nValueOut))
432 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
435 // Check for duplicate inputs
436 set<COutPoint> vInOutPoints;
437 BOOST_FOREACH(const CTxIn& txin, vin)
439 if (vInOutPoints.count(txin.prevout))
441 vInOutPoints.insert(txin.prevout);
446 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
447 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
451 BOOST_FOREACH(const CTxIn& txin, vin)
452 if (txin.prevout.IsNull())
453 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
459 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
462 *pfMissingInputs = false;
464 if (!CheckTransaction())
465 return error("AcceptToMemoryPool() : CheckTransaction failed");
467 // Coinbase is only valid in a block, not as a loose transaction
469 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
471 // To help v0.1.5 clients who would see it as a negative number
472 if ((int64)nLockTime > std::numeric_limits<int>::max())
473 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
475 // Rather not work on nonstandard transactions (unless -testnet)
476 if (!fTestNet && !IsStandard())
477 return error("AcceptToMemoryPool() : nonstandard transaction type");
479 // Do we already have it?
480 uint256 hash = GetHash();
482 LOCK(cs_mapTransactions);
483 if (mapTransactions.count(hash))
487 if (txdb.ContainsTx(hash))
490 // Check for conflicts with in-memory transactions
491 CTransaction* ptxOld = NULL;
492 for (int i = 0; i < vin.size(); i++)
494 COutPoint outpoint = vin[i].prevout;
495 if (mapNextTx.count(outpoint))
497 // Disable replacement feature for now
500 // Allow replacing with a newer version of the same transaction
503 ptxOld = mapNextTx[outpoint].ptx;
504 if (ptxOld->IsFinal())
506 if (!IsNewerThan(*ptxOld))
508 for (int i = 0; i < vin.size(); i++)
510 COutPoint outpoint = vin[i].prevout;
511 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
521 map<uint256, CTxIndex> mapUnused;
522 bool fInvalid = false;
523 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
526 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
528 *pfMissingInputs = true;
529 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
532 // Check for non-standard pay-to-script-hash in inputs
533 if (!AreInputsStandard(mapInputs) && !fTestNet)
534 return error("AcceptToMemoryPool() : nonstandard transaction input");
536 // Note: if you modify this code to accept non-standard transactions, then
537 // you should add code here to check that the transaction does a
538 // reasonable number of ECDSA signature verifications.
540 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
541 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
543 // Don't accept it if it can't get into a block
544 if (nFees < GetMinFee(1000, true, GMF_RELAY))
545 return error("AcceptToMemoryPool() : not enough fees");
547 // Continuously rate-limit free transactions
548 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
549 // be annoying or make other's transactions take longer to confirm.
550 if (nFees < MIN_RELAY_TX_FEE)
552 static CCriticalSection cs;
553 static double dFreeCount;
554 static int64 nLastTime;
555 int64 nNow = GetTime();
559 // Use an exponentially decaying ~10-minute window:
560 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
562 // -limitfreerelay unit is thousand-bytes-per-minute
563 // At default rate it would take over a month to fill 1GB
564 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
565 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
567 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
572 // Check against previous transactions
573 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
574 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
576 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
580 // Store transaction in memory
582 LOCK(cs_mapTransactions);
585 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
586 ptxOld->RemoveFromMemoryPool();
588 AddToMemoryPoolUnchecked();
591 ///// are we sure this is ok when loading transactions or restoring block txes
592 // If updated, erase old tx from wallet
594 EraseFromWallets(ptxOld->GetHash());
596 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
600 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
603 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
606 uint64 nPooledTx = 0;
608 bool CTransaction::AddToMemoryPoolUnchecked()
610 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
611 // Add to memory pool without checking anything. Don't call this directly,
612 // call AcceptToMemoryPool to properly check the transaction first.
614 LOCK(cs_mapTransactions);
615 uint256 hash = GetHash();
616 mapTransactions[hash] = *this;
617 for (int i = 0; i < vin.size(); i++)
618 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
619 nTransactionsUpdated++;
626 bool CTransaction::RemoveFromMemoryPool()
628 // Remove transaction from memory pool
630 LOCK(cs_mapTransactions);
631 uint256 hash = GetHash();
632 if (mapTransactions.count(hash))
634 BOOST_FOREACH(const CTxIn& txin, vin)
635 mapNextTx.erase(txin.prevout);
636 mapTransactions.erase(hash);
637 nTransactionsUpdated++;
649 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
651 if (hashBlock == 0 || nIndex == -1)
654 // Find the block it claims to be in
655 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
656 if (mi == mapBlockIndex.end())
658 CBlockIndex* pindex = (*mi).second;
659 if (!pindex || !pindex->IsInMainChain())
662 // Make sure the merkle branch connects to this block
663 if (!fMerkleVerified)
665 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
667 fMerkleVerified = true;
671 return pindexBest->nHeight - pindex->nHeight + 1;
675 int CMerkleTx::GetBlocksToMaturity() const
679 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
683 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
687 if (!IsInMainChain() && !ClientConnectInputs())
689 return CTransaction::AcceptToMemoryPool(txdb, false);
693 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
697 bool CMerkleTx::AcceptToMemoryPool()
700 return AcceptToMemoryPool(txdb);
705 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
709 LOCK(cs_mapTransactions);
710 // Add previous supporting transactions first
711 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
713 if (!tx.IsCoinBase())
715 uint256 hash = tx.GetHash();
716 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
717 tx.AcceptToMemoryPool(txdb, fCheckInputs);
720 return AcceptToMemoryPool(txdb, fCheckInputs);
725 bool CWalletTx::AcceptWalletTransaction()
728 return AcceptWalletTransaction(txdb);
731 int CTxIndex::GetDepthInMainChain() const
735 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
737 // Find the block in the index
738 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
739 if (mi == mapBlockIndex.end())
741 CBlockIndex* pindex = (*mi).second;
742 if (!pindex || !pindex->IsInMainChain())
744 return 1 + nBestHeight - pindex->nHeight;
756 //////////////////////////////////////////////////////////////////////////////
758 // CBlock and CBlockIndex
761 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
763 if (!fReadTransactions)
765 *this = pindex->GetBlockHeader();
768 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
770 if (GetHash() != pindex->GetBlockHash())
771 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
775 uint256 static GetOrphanRoot(const CBlock* pblock)
777 // Work back to the first block in the orphan chain
778 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
779 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
780 return pblock->GetHash();
783 int64 static GetBlockValue(int nHeight, int64 nFees)
785 int64 nSubsidy = 50 * COIN;
787 // Subsidy is cut in half every 4 years
788 nSubsidy >>= (nHeight / 210000);
790 return nSubsidy + nFees;
793 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
794 static const int64 nTargetSpacing = 10 * 60;
795 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
798 // minimum amount of work that could possibly be required nTime after
799 // minimum work required was nBase
801 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
803 // Testnet has min-difficulty blocks
804 // after nTargetSpacing*2 time between blocks:
805 if (fTestNet && nTime > nTargetSpacing*2)
806 return bnProofOfWorkLimit.GetCompact();
809 bnResult.SetCompact(nBase);
810 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
812 // Maximum 400% adjustment...
814 // ... in best-case exactly 4-times-normal target time
815 nTime -= nTargetTimespan*4;
817 if (bnResult > bnProofOfWorkLimit)
818 bnResult = bnProofOfWorkLimit;
819 return bnResult.GetCompact();
822 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
824 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
827 if (pindexLast == NULL)
828 return nProofOfWorkLimit;
830 // Only change once per interval
831 if ((pindexLast->nHeight+1) % nInterval != 0)
833 // Special rules for testnet after 15 Feb 2012:
834 if (fTestNet && pblock->nTime > 1329264000)
836 // If the new block's timestamp is more than 2* 10 minutes
837 // then allow mining of a min-difficulty block.
838 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
839 return nProofOfWorkLimit;
842 // Return the last non-special-min-difficulty-rules-block
843 const CBlockIndex* pindex = pindexLast;
844 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
845 pindex = pindex->pprev;
846 return pindex->nBits;
850 return pindexLast->nBits;
853 // Go back by what we want to be 14 days worth of blocks
854 const CBlockIndex* pindexFirst = pindexLast;
855 for (int i = 0; pindexFirst && i < nInterval-1; i++)
856 pindexFirst = pindexFirst->pprev;
859 // Limit adjustment step
860 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
861 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
862 if (nActualTimespan < nTargetTimespan/4)
863 nActualTimespan = nTargetTimespan/4;
864 if (nActualTimespan > nTargetTimespan*4)
865 nActualTimespan = nTargetTimespan*4;
869 bnNew.SetCompact(pindexLast->nBits);
870 bnNew *= nActualTimespan;
871 bnNew /= nTargetTimespan;
873 if (bnNew > bnProofOfWorkLimit)
874 bnNew = bnProofOfWorkLimit;
877 printf("GetNextWorkRequired RETARGET\n");
878 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
879 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
880 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
882 return bnNew.GetCompact();
885 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
888 bnTarget.SetCompact(nBits);
891 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
892 return error("CheckProofOfWork() : nBits below minimum work");
894 // Check proof of work matches claimed amount
895 if (hash > bnTarget.getuint256())
896 return error("CheckProofOfWork() : hash doesn't match nBits");
901 // Return maximum amount of blocks that other nodes claim to have
902 int GetNumBlocksOfPeers()
904 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
907 bool IsInitialBlockDownload()
909 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
911 static int64 nLastUpdate;
912 static CBlockIndex* pindexLastBest;
913 if (pindexBest != pindexLastBest)
915 pindexLastBest = pindexBest;
916 nLastUpdate = GetTime();
918 return (GetTime() - nLastUpdate < 10 &&
919 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
922 void static InvalidChainFound(CBlockIndex* pindexNew)
924 if (pindexNew->bnChainWork > bnBestInvalidWork)
926 bnBestInvalidWork = pindexNew->bnChainWork;
927 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
930 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());
931 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
932 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
933 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
936 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
938 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
940 // Updating time can change work required on testnet:
942 nBits = GetNextWorkRequired(pindexPrev, this);
955 bool CTransaction::DisconnectInputs(CTxDB& txdb)
957 // Relinquish previous transactions' spent pointers
960 BOOST_FOREACH(const CTxIn& txin, vin)
962 COutPoint prevout = txin.prevout;
964 // Get prev txindex from disk
966 if (!txdb.ReadTxIndex(prevout.hash, txindex))
967 return error("DisconnectInputs() : ReadTxIndex failed");
969 if (prevout.n >= txindex.vSpent.size())
970 return error("DisconnectInputs() : prevout.n out of range");
972 // Mark outpoint as not spent
973 txindex.vSpent[prevout.n].SetNull();
976 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
977 return error("DisconnectInputs() : UpdateTxIndex failed");
981 // Remove transaction from index
982 // This can fail if a duplicate of this transaction was in a chain that got
983 // reorganized away. This is only possible if this transaction was completely
984 // spent, so erasing it would be a no-op anway.
985 txdb.EraseTxIndex(*this);
991 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
992 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
994 // FetchInputs can return false either because we just haven't seen some inputs
995 // (in which case the transaction should be stored as an orphan)
996 // or because the transaction is malformed (in which case the transaction should
997 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1001 return true; // Coinbase transactions have no inputs to fetch.
1003 for (int i = 0; i < vin.size(); i++)
1005 COutPoint prevout = vin[i].prevout;
1006 if (inputsRet.count(prevout.hash))
1007 continue; // Got it already
1010 CTxIndex& txindex = inputsRet[prevout.hash].first;
1012 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1014 // Get txindex from current proposed changes
1015 txindex = mapTestPool.find(prevout.hash)->second;
1019 // Read txindex from txdb
1020 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1022 if (!fFound && (fBlock || fMiner))
1023 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());
1026 CTransaction& txPrev = inputsRet[prevout.hash].second;
1027 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1029 // Get prev tx from single transactions in memory
1031 LOCK(cs_mapTransactions);
1032 if (!mapTransactions.count(prevout.hash))
1033 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1034 txPrev = mapTransactions[prevout.hash];
1037 txindex.vSpent.resize(txPrev.vout.size());
1041 // Get prev tx from disk
1042 if (!txPrev.ReadFromDisk(txindex.pos))
1043 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1047 // Make sure all prevout.n's are valid:
1048 for (int i = 0; i < vin.size(); i++)
1050 const COutPoint prevout = vin[i].prevout;
1051 assert(inputsRet.count(prevout.hash) != 0);
1052 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1053 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1054 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1056 // Revisit this if/when transaction replacement is implemented and allows
1059 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()));
1066 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1068 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1069 if (mi == inputs.end())
1070 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1072 const CTransaction& txPrev = (mi->second).second;
1073 if (input.prevout.n >= txPrev.vout.size())
1074 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1076 return txPrev.vout[input.prevout.n];
1079 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1085 for (int i = 0; i < vin.size(); i++)
1087 nResult += GetOutputFor(vin[i], inputs).nValue;
1093 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1099 for (int i = 0; i < vin.size(); i++)
1101 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1102 if (prevout.scriptPubKey.IsPayToScriptHash())
1103 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1108 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1109 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1110 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1112 // Take over previous transactions' spent pointers
1113 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1114 // fMiner is true when called from the internal bitcoin miner
1115 // ... both are false when called from CTransaction::AcceptToMemoryPool
1120 for (int i = 0; i < vin.size(); i++)
1122 COutPoint prevout = vin[i].prevout;
1123 assert(inputs.count(prevout.hash) > 0);
1124 CTxIndex& txindex = inputs[prevout.hash].first;
1125 CTransaction& txPrev = inputs[prevout.hash].second;
1127 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1128 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()));
1130 // If prev is coinbase, check that it's matured
1131 if (txPrev.IsCoinBase())
1132 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1133 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1134 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1136 // Check for conflicts (double-spend)
1137 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1138 // for an attacker to attempt to split the network.
1139 if (!txindex.vSpent[prevout.n].IsNull())
1140 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());
1142 // Check for negative or overflow input values
1143 nValueIn += txPrev.vout[prevout.n].nValue;
1144 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1145 return DoS(100, error("ConnectInputs() : txin values out of range"));
1147 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1148 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1149 // still computed and checked, and any change will be caught at the next checkpoint.
1150 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1153 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1155 // only during transition phase for P2SH: do not invoke anti-DoS code for
1156 // potentially old clients relaying bad P2SH transactions
1157 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1158 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1160 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1164 // Mark outpoints as spent
1165 txindex.vSpent[prevout.n] = posThisTx;
1168 if (fBlock || fMiner)
1170 mapTestPool[prevout.hash] = txindex;
1174 if (nValueIn < GetValueOut())
1175 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1177 // Tally transaction fees
1178 int64 nTxFee = nValueIn - GetValueOut();
1180 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1182 if (!MoneyRange(nFees))
1183 return DoS(100, error("ConnectInputs() : nFees out of range"));
1190 bool CTransaction::ClientConnectInputs()
1195 // Take over previous transactions' spent pointers
1197 LOCK(cs_mapTransactions);
1199 for (int i = 0; i < vin.size(); i++)
1201 // Get prev tx from single transactions in memory
1202 COutPoint prevout = vin[i].prevout;
1203 if (!mapTransactions.count(prevout.hash))
1205 CTransaction& txPrev = mapTransactions[prevout.hash];
1207 if (prevout.n >= txPrev.vout.size())
1211 if (!VerifySignature(txPrev, *this, i, true, 0))
1212 return error("ConnectInputs() : VerifySignature failed");
1214 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1215 ///// this has to go away now that posNext is gone
1216 // // Check for conflicts
1217 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1218 // return error("ConnectInputs() : prev tx already used");
1220 // // Flag outpoints as used
1221 // txPrev.vout[prevout.n].posNext = posThisTx;
1223 nValueIn += txPrev.vout[prevout.n].nValue;
1225 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1226 return error("ClientConnectInputs() : txin values out of range");
1228 if (GetValueOut() > nValueIn)
1238 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1240 // Disconnect in reverse order
1241 for (int i = vtx.size()-1; i >= 0; i--)
1242 if (!vtx[i].DisconnectInputs(txdb))
1245 // Update block index on disk without changing it in memory.
1246 // The memory index structure will be changed after the db commits.
1249 CDiskBlockIndex blockindexPrev(pindex->pprev);
1250 blockindexPrev.hashNext = 0;
1251 if (!txdb.WriteBlockIndex(blockindexPrev))
1252 return error("DisconnectBlock() : WriteBlockIndex failed");
1258 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1260 // Check it again in case a previous version let a bad block in
1264 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1265 // unless those are already completely spent.
1266 // If such overwrites are allowed, coinbases and transactions depending upon those
1267 // can be duplicated to remove the ability to spend the first instance -- even after
1268 // being sent to another address.
1269 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1270 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1271 // already refuses previously-known transaction id's entirely.
1272 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1273 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1274 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1275 BOOST_FOREACH(CTransaction& tx, vtx)
1277 CTxIndex txindexOld;
1278 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1279 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1284 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1285 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1286 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1288 //// issue here: it doesn't know the version
1289 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1291 map<uint256, CTxIndex> mapQueuedChanges;
1294 BOOST_FOREACH(CTransaction& tx, vtx)
1296 nSigOps += tx.GetLegacySigOpCount();
1297 if (nSigOps > MAX_BLOCK_SIGOPS)
1298 return DoS(100, error("ConnectBlock() : too many sigops"));
1300 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1301 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1303 MapPrevTx mapInputs;
1304 if (!tx.IsCoinBase())
1307 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1310 if (fStrictPayToScriptHash)
1312 // Add in sigops done by pay-to-script-hash inputs;
1313 // this is to prevent a "rogue miner" from creating
1314 // an incredibly-expensive-to-validate block.
1315 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1316 if (nSigOps > MAX_BLOCK_SIGOPS)
1317 return DoS(100, error("ConnectBlock() : too many sigops"));
1320 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1322 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1326 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1329 // Write queued txindex changes
1330 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1332 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1333 return error("ConnectBlock() : UpdateTxIndex failed");
1336 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1339 // Update block index on disk without changing it in memory.
1340 // The memory index structure will be changed after the db commits.
1343 CDiskBlockIndex blockindexPrev(pindex->pprev);
1344 blockindexPrev.hashNext = pindex->GetBlockHash();
1345 if (!txdb.WriteBlockIndex(blockindexPrev))
1346 return error("ConnectBlock() : WriteBlockIndex failed");
1349 // Watch for transactions paying to me
1350 BOOST_FOREACH(CTransaction& tx, vtx)
1351 SyncWithWallets(tx, this, true);
1356 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1358 printf("REORGANIZE\n");
1361 CBlockIndex* pfork = pindexBest;
1362 CBlockIndex* plonger = pindexNew;
1363 while (pfork != plonger)
1365 while (plonger->nHeight > pfork->nHeight)
1366 if (!(plonger = plonger->pprev))
1367 return error("Reorganize() : plonger->pprev is null");
1368 if (pfork == plonger)
1370 if (!(pfork = pfork->pprev))
1371 return error("Reorganize() : pfork->pprev is null");
1374 // List of what to disconnect
1375 vector<CBlockIndex*> vDisconnect;
1376 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1377 vDisconnect.push_back(pindex);
1379 // List of what to connect
1380 vector<CBlockIndex*> vConnect;
1381 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1382 vConnect.push_back(pindex);
1383 reverse(vConnect.begin(), vConnect.end());
1385 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());
1386 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());
1388 // Disconnect shorter branch
1389 vector<CTransaction> vResurrect;
1390 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1393 if (!block.ReadFromDisk(pindex))
1394 return error("Reorganize() : ReadFromDisk for disconnect failed");
1395 if (!block.DisconnectBlock(txdb, pindex))
1396 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1398 // Queue memory transactions to resurrect
1399 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1400 if (!tx.IsCoinBase())
1401 vResurrect.push_back(tx);
1404 // Connect longer branch
1405 vector<CTransaction> vDelete;
1406 for (int i = 0; i < vConnect.size(); i++)
1408 CBlockIndex* pindex = vConnect[i];
1410 if (!block.ReadFromDisk(pindex))
1411 return error("Reorganize() : ReadFromDisk for connect failed");
1412 if (!block.ConnectBlock(txdb, pindex))
1416 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1419 // Queue memory transactions to delete
1420 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1421 vDelete.push_back(tx);
1423 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1424 return error("Reorganize() : WriteHashBestChain failed");
1426 // Make sure it's successfully written to disk before changing memory structure
1427 if (!txdb.TxnCommit())
1428 return error("Reorganize() : TxnCommit failed");
1430 // Disconnect shorter branch
1431 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1433 pindex->pprev->pnext = NULL;
1435 // Connect longer branch
1436 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1438 pindex->pprev->pnext = pindex;
1440 // Resurrect memory transactions that were in the disconnected branch
1441 BOOST_FOREACH(CTransaction& tx, vResurrect)
1442 tx.AcceptToMemoryPool(txdb, false);
1444 // Delete redundant memory transactions that are in the connected branch
1445 BOOST_FOREACH(CTransaction& tx, vDelete)
1446 tx.RemoveFromMemoryPool();
1448 printf("REORGANIZE: done\n");
1455 runCommand(std::string strCommand)
1457 int nErr = ::system(strCommand.c_str());
1459 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1462 // Called from inside SetBestChain: attaches a block to the new best chain being built
1463 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1465 uint256 hash = GetHash();
1467 // Adding to current best branch
1468 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1471 InvalidChainFound(pindexNew);
1474 if (!txdb.TxnCommit())
1475 return error("SetBestChain() : TxnCommit failed");
1477 // Add to current best branch
1478 pindexNew->pprev->pnext = pindexNew;
1480 // Delete redundant memory transactions
1481 BOOST_FOREACH(CTransaction& tx, vtx)
1482 tx.RemoveFromMemoryPool();
1487 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1489 uint256 hash = GetHash();
1492 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1494 txdb.WriteHashBestChain(hash);
1495 if (!txdb.TxnCommit())
1496 return error("SetBestChain() : TxnCommit failed");
1497 pindexGenesisBlock = pindexNew;
1499 else if (hashPrevBlock == hashBestChain)
1501 if (!SetBestChainInner(txdb, pindexNew))
1502 return error("SetBestChain() : SetBestChainInner failed");
1506 // the first block in the new chain that will cause it to become the new best chain
1507 CBlockIndex *pindexIntermediate = pindexNew;
1509 // list of blocks that need to be connected afterwards
1510 std::vector<CBlockIndex*> vpindexSecondary;
1512 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1513 // Try to limit how much needs to be done inside
1514 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1516 vpindexSecondary.push_back(pindexIntermediate);
1517 pindexIntermediate = pindexIntermediate->pprev;
1520 if (!vpindexSecondary.empty())
1521 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1523 // Switch to new best branch
1524 if (!Reorganize(txdb, pindexIntermediate))
1527 InvalidChainFound(pindexNew);
1528 return error("SetBestChain() : Reorganize failed");
1531 // Connect futher blocks
1532 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1535 if (!block.ReadFromDisk(pindex))
1537 printf("SetBestChain() : ReadFromDisk failed\n");
1541 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1542 if (!block.SetBestChainInner(txdb, pindex))
1547 // Update best block in wallet (so we can detect restored wallets)
1548 bool fIsInitialDownload = IsInitialBlockDownload();
1549 if (!fIsInitialDownload)
1551 const CBlockLocator locator(pindexNew);
1552 ::SetBestChain(locator);
1556 hashBestChain = hash;
1557 pindexBest = pindexNew;
1558 nBestHeight = pindexBest->nHeight;
1559 bnBestChainWork = pindexNew->bnChainWork;
1560 nTimeBestReceived = GetTime();
1561 nTransactionsUpdated++;
1562 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1564 std::string strCmd = GetArg("-blocknotify", "");
1566 if (!fIsInitialDownload && !strCmd.empty())
1568 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1569 boost::thread t(runCommand, strCmd); // thread runs free
1576 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1578 // Check for duplicate
1579 uint256 hash = GetHash();
1580 if (mapBlockIndex.count(hash))
1581 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1583 // Construct new block index object
1584 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1586 return error("AddToBlockIndex() : new CBlockIndex failed");
1587 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1588 pindexNew->phashBlock = &((*mi).first);
1589 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1590 if (miPrev != mapBlockIndex.end())
1592 pindexNew->pprev = (*miPrev).second;
1593 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1595 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1599 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1600 if (!txdb.TxnCommit())
1604 if (pindexNew->bnChainWork > bnBestChainWork)
1605 if (!SetBestChain(txdb, pindexNew))
1610 if (pindexNew == pindexBest)
1612 // Notify UI to display prev block's coinbase if it was ours
1613 static uint256 hashPrevBestCoinBase;
1614 UpdatedTransaction(hashPrevBestCoinBase);
1615 hashPrevBestCoinBase = vtx[0].GetHash();
1625 bool CBlock::CheckBlock() const
1627 // These are checks that are independent of context
1628 // that can be verified before saving an orphan block.
1631 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1632 return DoS(100, error("CheckBlock() : size limits failed"));
1634 // Check proof of work matches claimed amount
1635 if (!CheckProofOfWork(GetHash(), nBits))
1636 return DoS(50, error("CheckBlock() : proof of work failed"));
1639 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1640 return error("CheckBlock() : block timestamp too far in the future");
1642 // First transaction must be coinbase, the rest must not be
1643 if (vtx.empty() || !vtx[0].IsCoinBase())
1644 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1645 for (int i = 1; i < vtx.size(); i++)
1646 if (vtx[i].IsCoinBase())
1647 return DoS(100, error("CheckBlock() : more than one coinbase"));
1649 // Check transactions
1650 BOOST_FOREACH(const CTransaction& tx, vtx)
1651 if (!tx.CheckTransaction())
1652 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1655 BOOST_FOREACH(const CTransaction& tx, vtx)
1657 nSigOps += tx.GetLegacySigOpCount();
1659 if (nSigOps > MAX_BLOCK_SIGOPS)
1660 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1663 if (hashMerkleRoot != BuildMerkleTree())
1664 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1669 bool CBlock::AcceptBlock()
1671 // Check for duplicate
1672 uint256 hash = GetHash();
1673 if (mapBlockIndex.count(hash))
1674 return error("AcceptBlock() : block already in mapBlockIndex");
1676 // Get prev block index
1677 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1678 if (mi == mapBlockIndex.end())
1679 return DoS(10, error("AcceptBlock() : prev block not found"));
1680 CBlockIndex* pindexPrev = (*mi).second;
1681 int nHeight = pindexPrev->nHeight+1;
1683 // Check proof of work
1684 if (nBits != GetNextWorkRequired(pindexPrev, this))
1685 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1687 // Check timestamp against prev
1688 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1689 return error("AcceptBlock() : block's timestamp is too early");
1691 // Check that all transactions are finalized
1692 BOOST_FOREACH(const CTransaction& tx, vtx)
1693 if (!tx.IsFinal(nHeight, GetBlockTime()))
1694 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1696 // Check that the block chain matches the known block chain up to a checkpoint
1697 if (!Checkpoints::CheckBlock(nHeight, hash))
1698 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1700 // Write block to history file
1701 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1702 return error("AcceptBlock() : out of disk space");
1703 unsigned int nFile = -1;
1704 unsigned int nBlockPos = 0;
1705 if (!WriteToDisk(nFile, nBlockPos))
1706 return error("AcceptBlock() : WriteToDisk failed");
1707 if (!AddToBlockIndex(nFile, nBlockPos))
1708 return error("AcceptBlock() : AddToBlockIndex failed");
1710 // Relay inventory, but don't relay old inventory during initial block download
1711 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1712 if (hashBestChain == hash)
1715 BOOST_FOREACH(CNode* pnode, vNodes)
1716 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1717 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1723 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1725 // Check for duplicate
1726 uint256 hash = pblock->GetHash();
1727 if (mapBlockIndex.count(hash))
1728 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1729 if (mapOrphanBlocks.count(hash))
1730 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1732 // Preliminary checks
1733 if (!pblock->CheckBlock())
1734 return error("ProcessBlock() : CheckBlock FAILED");
1736 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1737 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1739 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1740 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1744 pfrom->Misbehaving(100);
1745 return error("ProcessBlock() : block with timestamp before last checkpoint");
1748 bnNewBlock.SetCompact(pblock->nBits);
1750 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1751 if (bnNewBlock > bnRequired)
1754 pfrom->Misbehaving(100);
1755 return error("ProcessBlock() : block with too little proof-of-work");
1760 // If don't already have its previous block, shunt it off to holding area until we get it
1761 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1763 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1764 CBlock* pblock2 = new CBlock(*pblock);
1765 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1766 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1768 // Ask this guy to fill in what we're missing
1770 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1775 if (!pblock->AcceptBlock())
1776 return error("ProcessBlock() : AcceptBlock FAILED");
1778 // Recursively process any orphan blocks that depended on this one
1779 vector<uint256> vWorkQueue;
1780 vWorkQueue.push_back(hash);
1781 for (int i = 0; i < vWorkQueue.size(); i++)
1783 uint256 hashPrev = vWorkQueue[i];
1784 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1785 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1788 CBlock* pblockOrphan = (*mi).second;
1789 if (pblockOrphan->AcceptBlock())
1790 vWorkQueue.push_back(pblockOrphan->GetHash());
1791 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1792 delete pblockOrphan;
1794 mapOrphanBlocksByPrev.erase(hashPrev);
1797 printf("ProcessBlock: ACCEPTED\n");
1808 bool CheckDiskSpace(uint64 nAdditionalBytes)
1810 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1812 // Check for 15MB because database could create another 10MB log file at any time
1813 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1816 string strMessage = _("Warning: Disk space is low ");
1817 strMiscWarning = strMessage;
1818 printf("*** %s\n", strMessage.c_str());
1819 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1826 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1830 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1833 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1835 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1844 static unsigned int nCurrentBlockFile = 1;
1846 FILE* AppendBlockFile(unsigned int& nFileRet)
1851 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1854 if (fseek(file, 0, SEEK_END) != 0)
1856 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1857 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1859 nFileRet = nCurrentBlockFile;
1863 nCurrentBlockFile++;
1867 bool LoadBlockIndex(bool fAllowNew)
1871 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1872 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1873 pchMessageStart[0] = 0xfa;
1874 pchMessageStart[1] = 0xbf;
1875 pchMessageStart[2] = 0xb5;
1876 pchMessageStart[3] = 0xda;
1883 if (!txdb.LoadBlockIndex())
1888 // Init with genesis block
1890 if (mapBlockIndex.empty())
1896 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1897 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1898 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1899 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1900 // vMerkleTree: 4a5e1e
1903 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1905 txNew.vin.resize(1);
1906 txNew.vout.resize(1);
1907 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1908 txNew.vout[0].nValue = 50 * COIN;
1909 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1911 block.vtx.push_back(txNew);
1912 block.hashPrevBlock = 0;
1913 block.hashMerkleRoot = block.BuildMerkleTree();
1915 block.nTime = 1231006505;
1916 block.nBits = 0x1d00ffff;
1917 block.nNonce = 2083236893;
1921 block.nTime = 1296688602;
1922 block.nBits = 0x1d07fff8;
1923 block.nNonce = 384568319;
1927 printf("%s\n", block.GetHash().ToString().c_str());
1928 printf("%s\n", hashGenesisBlock.ToString().c_str());
1929 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1930 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1932 assert(block.GetHash() == hashGenesisBlock);
1934 // Start new block file
1936 unsigned int nBlockPos;
1937 if (!block.WriteToDisk(nFile, nBlockPos))
1938 return error("LoadBlockIndex() : writing genesis block to disk failed");
1939 if (!block.AddToBlockIndex(nFile, nBlockPos))
1940 return error("LoadBlockIndex() : genesis block not accepted");
1948 void PrintBlockTree()
1950 // precompute tree structure
1951 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1952 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1954 CBlockIndex* pindex = (*mi).second;
1955 mapNext[pindex->pprev].push_back(pindex);
1957 //while (rand() % 3 == 0)
1958 // mapNext[pindex->pprev].push_back(pindex);
1961 vector<pair<int, CBlockIndex*> > vStack;
1962 vStack.push_back(make_pair(0, pindexGenesisBlock));
1965 while (!vStack.empty())
1967 int nCol = vStack.back().first;
1968 CBlockIndex* pindex = vStack.back().second;
1971 // print split or gap
1972 if (nCol > nPrevCol)
1974 for (int i = 0; i < nCol-1; i++)
1978 else if (nCol < nPrevCol)
1980 for (int i = 0; i < nCol; i++)
1987 for (int i = 0; i < nCol; i++)
1992 block.ReadFromDisk(pindex);
1993 printf("%d (%u,%u) %s %s tx %d",
1997 block.GetHash().ToString().substr(0,20).c_str(),
1998 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2001 PrintWallets(block);
2003 // put the main timechain first
2004 vector<CBlockIndex*>& vNext = mapNext[pindex];
2005 for (int i = 0; i < vNext.size(); i++)
2007 if (vNext[i]->pnext)
2009 swap(vNext[0], vNext[i]);
2015 for (int i = 0; i < vNext.size(); i++)
2016 vStack.push_back(make_pair(nCol+i, vNext[i]));
2029 //////////////////////////////////////////////////////////////////////////////
2034 map<uint256, CAlert> mapAlerts;
2035 CCriticalSection cs_mapAlerts;
2037 string GetWarnings(string strFor)
2040 string strStatusBar;
2042 if (GetBoolArg("-testsafemode"))
2045 // Misc warnings like out of disk space and clock is wrong
2046 if (strMiscWarning != "")
2049 strStatusBar = strMiscWarning;
2052 // Longer invalid proof-of-work chain
2053 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2056 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2062 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2064 const CAlert& alert = item.second;
2065 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2067 nPriority = alert.nPriority;
2068 strStatusBar = alert.strStatusBar;
2073 if (strFor == "statusbar")
2074 return strStatusBar;
2075 else if (strFor == "rpc")
2077 assert(!"GetWarnings() : invalid parameter");
2081 bool CAlert::ProcessAlert()
2083 if (!CheckSignature())
2090 // Cancel previous alerts
2091 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2093 const CAlert& alert = (*mi).second;
2096 printf("cancelling alert %d\n", alert.nID);
2097 mapAlerts.erase(mi++);
2099 else if (!alert.IsInEffect())
2101 printf("expiring alert %d\n", alert.nID);
2102 mapAlerts.erase(mi++);
2108 // Check if this alert has been cancelled
2109 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2111 const CAlert& alert = item.second;
2112 if (alert.Cancels(*this))
2114 printf("alert already cancelled by %d\n", alert.nID);
2120 mapAlerts.insert(make_pair(GetHash(), *this));
2123 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2135 //////////////////////////////////////////////////////////////////////////////
2141 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2145 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2146 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2148 // Don't know what it is, just say we already got one
2155 // The message start string is designed to be unlikely to occur in normal data.
2156 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2157 // a large 4-byte int at any alignment.
2158 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2161 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2163 static map<CService, vector<unsigned char> > mapReuseKey;
2164 RandAddSeedPerfmon();
2166 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2167 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2169 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2171 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2179 if (strCommand == "version")
2181 // Each connection can only send one version message
2182 if (pfrom->nVersion != 0)
2184 pfrom->Misbehaving(1);
2192 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2193 if (pfrom->nVersion < 209)
2195 // Since February 20, 2012, the protocol is initiated at version 209,
2196 // and earlier versions are no longer supported
2197 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2198 pfrom->fDisconnect = true;
2202 if (pfrom->nVersion == 10300)
2203 pfrom->nVersion = 300;
2205 vRecv >> addrFrom >> nNonce;
2207 vRecv >> pfrom->strSubVer;
2209 vRecv >> pfrom->nStartingHeight;
2211 // Disconnect if we connected to ourself
2212 if (nNonce == nLocalHostNonce && nNonce > 1)
2214 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2215 pfrom->fDisconnect = true;
2219 // Be shy and don't send version until we hear
2220 if (pfrom->fInbound)
2221 pfrom->PushVersion();
2223 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2225 AddTimeData(pfrom->addr, nTime);
2228 pfrom->PushMessage("verack");
2229 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2231 if (!pfrom->fInbound)
2233 // Advertise our address
2234 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2235 !IsInitialBlockDownload())
2237 CAddress addr(addrLocalHost);
2238 addr.nTime = GetAdjustedTime();
2239 pfrom->PushAddress(addr);
2242 // Get recent addresses
2243 if (pfrom->nVersion >= 31402 || addrman.size() < 1000)
2245 pfrom->PushMessage("getaddr");
2246 pfrom->fGetAddr = true;
2248 addrman.Good(pfrom->addr);
2250 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2252 addrman.Add(addrFrom, addrFrom);
2253 addrman.Good(addrFrom);
2257 // Ask the first connected node for block updates
2258 static int nAskedForBlocks = 0;
2259 if (!pfrom->fClient &&
2260 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2261 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2264 pfrom->PushGetBlocks(pindexBest, uint256(0));
2270 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2271 item.second.RelayTo(pfrom);
2274 pfrom->fSuccessfullyConnected = true;
2276 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2278 cPeerBlockCounts.input(pfrom->nStartingHeight);
2282 else if (pfrom->nVersion == 0)
2284 // Must have a version message before anything else
2285 pfrom->Misbehaving(1);
2290 else if (strCommand == "verack")
2292 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2296 else if (strCommand == "addr")
2298 vector<CAddress> vAddr;
2301 // Don't want addr from older versions unless seeding
2302 if (pfrom->nVersion < 31402 && addrman.size() > 1000)
2304 if (vAddr.size() > 1000)
2306 pfrom->Misbehaving(20);
2307 return error("message addr size() = %d", vAddr.size());
2310 // Store the new addresses
2311 int64 nNow = GetAdjustedTime();
2312 int64 nSince = nNow - 10 * 60;
2313 BOOST_FOREACH(CAddress& addr, vAddr)
2317 // ignore IPv6 for now, since it isn't implemented anyway
2320 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2321 addr.nTime = nNow - 5 * 24 * 60 * 60;
2322 pfrom->AddAddressKnown(addr);
2323 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2325 // Relay to a limited number of other nodes
2328 // Use deterministic randomness to send to the same nodes for 24 hours
2329 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2330 static uint256 hashSalt;
2332 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2333 int64 hashAddr = addr.GetHash();
2334 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2335 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2336 multimap<uint256, CNode*> mapMix;
2337 BOOST_FOREACH(CNode* pnode, vNodes)
2339 if (pnode->nVersion < 31402)
2341 unsigned int nPointer;
2342 memcpy(&nPointer, &pnode, sizeof(nPointer));
2343 uint256 hashKey = hashRand ^ nPointer;
2344 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2345 mapMix.insert(make_pair(hashKey, pnode));
2347 int nRelayNodes = 2;
2348 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2349 ((*mi).second)->PushAddress(addr);
2353 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2354 if (vAddr.size() < 1000)
2355 pfrom->fGetAddr = false;
2359 else if (strCommand == "inv")
2363 if (vInv.size() > 50000)
2365 pfrom->Misbehaving(20);
2366 return error("message inv size() = %d", vInv.size());
2370 for (int nInv = 0; nInv < vInv.size(); nInv++)
2372 const CInv &inv = vInv[nInv];
2376 pfrom->AddInventoryKnown(inv);
2378 bool fAlreadyHave = AlreadyHave(txdb, inv);
2380 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2382 // Always request the last block in an inv bundle (even if we already have it), as it is the
2383 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2384 // this is necessary to connect earlier received orphan blocks to the chain again.
2385 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2387 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2388 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2390 // Track requests for our stuff
2391 Inventory(inv.hash);
2396 else if (strCommand == "getdata")
2400 if (vInv.size() > 50000)
2402 pfrom->Misbehaving(20);
2403 return error("message getdata size() = %d", vInv.size());
2406 BOOST_FOREACH(const CInv& inv, vInv)
2410 printf("received getdata for: %s\n", inv.ToString().c_str());
2412 if (inv.type == MSG_BLOCK)
2414 // Send block from disk
2415 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2416 if (mi != mapBlockIndex.end())
2419 block.ReadFromDisk((*mi).second);
2420 pfrom->PushMessage("block", block);
2422 // Trigger them to send a getblocks request for the next batch of inventory
2423 if (inv.hash == pfrom->hashContinue)
2425 // Bypass PushInventory, this must send even if redundant,
2426 // and we want it right after the last block so they don't
2427 // wait for other stuff first.
2429 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2430 pfrom->PushMessage("inv", vInv);
2431 pfrom->hashContinue = 0;
2435 else if (inv.IsKnownType())
2437 // Send stream from relay memory
2440 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2441 if (mi != mapRelay.end())
2442 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2446 // Track requests for our stuff
2447 Inventory(inv.hash);
2452 else if (strCommand == "getblocks")
2454 CBlockLocator locator;
2456 vRecv >> locator >> hashStop;
2458 // Find the last block the caller has in the main chain
2459 CBlockIndex* pindex = locator.GetBlockIndex();
2461 // Send the rest of the chain
2463 pindex = pindex->pnext;
2464 int nLimit = 500 + locator.GetDistanceBack();
2465 unsigned int nBytes = 0;
2466 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2467 for (; pindex; pindex = pindex->pnext)
2469 if (pindex->GetBlockHash() == hashStop)
2471 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2474 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2476 block.ReadFromDisk(pindex, true);
2477 nBytes += block.GetSerializeSize(SER_NETWORK);
2478 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2480 // When this block is requested, we'll send an inv that'll make them
2481 // getblocks the next batch of inventory.
2482 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2483 pfrom->hashContinue = pindex->GetBlockHash();
2490 else if (strCommand == "getheaders")
2492 CBlockLocator locator;
2494 vRecv >> locator >> hashStop;
2496 CBlockIndex* pindex = NULL;
2497 if (locator.IsNull())
2499 // If locator is null, return the hashStop block
2500 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2501 if (mi == mapBlockIndex.end())
2503 pindex = (*mi).second;
2507 // Find the last block the caller has in the main chain
2508 pindex = locator.GetBlockIndex();
2510 pindex = pindex->pnext;
2513 vector<CBlock> vHeaders;
2515 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2516 for (; pindex; pindex = pindex->pnext)
2518 vHeaders.push_back(pindex->GetBlockHeader());
2519 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2522 pfrom->PushMessage("headers", vHeaders);
2526 else if (strCommand == "tx")
2528 vector<uint256> vWorkQueue;
2529 CDataStream vMsg(vRecv);
2533 CInv inv(MSG_TX, tx.GetHash());
2534 pfrom->AddInventoryKnown(inv);
2536 bool fMissingInputs = false;
2537 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2539 SyncWithWallets(tx, NULL, true);
2540 RelayMessage(inv, vMsg);
2541 mapAlreadyAskedFor.erase(inv);
2542 vWorkQueue.push_back(inv.hash);
2544 // Recursively process any orphan transactions that depended on this one
2545 for (int i = 0; i < vWorkQueue.size(); i++)
2547 uint256 hashPrev = vWorkQueue[i];
2548 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2549 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2552 const CDataStream& vMsg = *((*mi).second);
2554 CDataStream(vMsg) >> tx;
2555 CInv inv(MSG_TX, tx.GetHash());
2557 if (tx.AcceptToMemoryPool(true))
2559 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2560 SyncWithWallets(tx, NULL, true);
2561 RelayMessage(inv, vMsg);
2562 mapAlreadyAskedFor.erase(inv);
2563 vWorkQueue.push_back(inv.hash);
2568 BOOST_FOREACH(uint256 hash, vWorkQueue)
2569 EraseOrphanTx(hash);
2571 else if (fMissingInputs)
2573 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2576 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2577 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2579 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2581 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2585 else if (strCommand == "block")
2590 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2593 CInv inv(MSG_BLOCK, block.GetHash());
2594 pfrom->AddInventoryKnown(inv);
2596 if (ProcessBlock(pfrom, &block))
2597 mapAlreadyAskedFor.erase(inv);
2598 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2602 else if (strCommand == "getaddr")
2604 pfrom->vAddrToSend.clear();
2605 vector<CAddress> vAddr = addrman.GetAddr();
2606 BOOST_FOREACH(const CAddress &addr, vAddr)
2607 pfrom->PushAddress(addr);
2611 else if (strCommand == "checkorder")
2616 if (!GetBoolArg("-allowreceivebyip"))
2618 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2625 /// we have a chance to check the order here
2627 // Keep giving the same key to the same ip until they use it
2628 if (!mapReuseKey.count(pfrom->addr))
2629 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2631 // Send back approval of order and pubkey to use
2632 CScript scriptPubKey;
2633 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2634 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2638 else if (strCommand == "reply")
2643 CRequestTracker tracker;
2645 LOCK(pfrom->cs_mapRequests);
2646 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2647 if (mi != pfrom->mapRequests.end())
2649 tracker = (*mi).second;
2650 pfrom->mapRequests.erase(mi);
2653 if (!tracker.IsNull())
2654 tracker.fn(tracker.param1, vRecv);
2658 else if (strCommand == "ping")
2663 else if (strCommand == "alert")
2668 if (alert.ProcessAlert())
2671 pfrom->setKnown.insert(alert.GetHash());
2674 BOOST_FOREACH(CNode* pnode, vNodes)
2675 alert.RelayTo(pnode);
2683 // Ignore unknown commands for extensibility
2687 // Update the last seen time for this node's address
2688 if (pfrom->fNetworkNode)
2689 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2690 AddressCurrentlyConnected(pfrom->addr);
2696 bool ProcessMessages(CNode* pfrom)
2698 CDataStream& vRecv = pfrom->vRecv;
2702 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2706 // (4) message start
2715 // Scan for message start
2716 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2717 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2718 if (vRecv.end() - pstart < nHeaderSize)
2720 if (vRecv.size() > nHeaderSize)
2722 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2723 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2727 if (pstart - vRecv.begin() > 0)
2728 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2729 vRecv.erase(vRecv.begin(), pstart);
2732 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2737 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2740 string strCommand = hdr.GetCommand();
2743 unsigned int nMessageSize = hdr.nMessageSize;
2744 if (nMessageSize > MAX_SIZE)
2746 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2749 if (nMessageSize > vRecv.size())
2751 // Rewind and wait for rest of message
2752 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2757 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2758 unsigned int nChecksum = 0;
2759 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2760 if (nChecksum != hdr.nChecksum)
2762 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2763 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2767 // Copy message to its own buffer
2768 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2769 vRecv.ignore(nMessageSize);
2777 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2782 catch (std::ios_base::failure& e)
2784 if (strstr(e.what(), "end of data"))
2786 // Allow exceptions from underlength message on vRecv
2787 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());
2789 else if (strstr(e.what(), "size too large"))
2791 // Allow exceptions from overlong size
2792 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2796 PrintExceptionContinue(&e, "ProcessMessage()");
2799 catch (std::exception& e) {
2800 PrintExceptionContinue(&e, "ProcessMessage()");
2802 PrintExceptionContinue(NULL, "ProcessMessage()");
2806 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2814 bool SendMessages(CNode* pto, bool fSendTrickle)
2818 // Don't send anything until we get their version message
2819 if (pto->nVersion == 0)
2823 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2824 pto->PushMessage("ping");
2826 // Resend wallet transactions that haven't gotten in a block yet
2827 ResendWalletTransactions();
2829 // Address refresh broadcast
2830 static int64 nLastRebroadcast;
2831 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2835 BOOST_FOREACH(CNode* pnode, vNodes)
2837 // Periodically clear setAddrKnown to allow refresh broadcasts
2838 if (nLastRebroadcast)
2839 pnode->setAddrKnown.clear();
2841 // Rebroadcast our address
2842 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2844 CAddress addr(addrLocalHost);
2845 addr.nTime = GetAdjustedTime();
2846 pnode->PushAddress(addr);
2850 nLastRebroadcast = GetTime();
2858 vector<CAddress> vAddr;
2859 vAddr.reserve(pto->vAddrToSend.size());
2860 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2862 // returns true if wasn't already contained in the set
2863 if (pto->setAddrKnown.insert(addr).second)
2865 vAddr.push_back(addr);
2866 // receiver rejects addr messages larger than 1000
2867 if (vAddr.size() >= 1000)
2869 pto->PushMessage("addr", vAddr);
2874 pto->vAddrToSend.clear();
2876 pto->PushMessage("addr", vAddr);
2881 // Message: inventory
2884 vector<CInv> vInvWait;
2886 LOCK(pto->cs_inventory);
2887 vInv.reserve(pto->vInventoryToSend.size());
2888 vInvWait.reserve(pto->vInventoryToSend.size());
2889 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2891 if (pto->setInventoryKnown.count(inv))
2894 // trickle out tx inv to protect privacy
2895 if (inv.type == MSG_TX && !fSendTrickle)
2897 // 1/4 of tx invs blast to all immediately
2898 static uint256 hashSalt;
2900 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2901 uint256 hashRand = inv.hash ^ hashSalt;
2902 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2903 bool fTrickleWait = ((hashRand & 3) != 0);
2905 // always trickle our own transactions
2909 if (GetTransaction(inv.hash, wtx))
2911 fTrickleWait = true;
2916 vInvWait.push_back(inv);
2921 // returns true if wasn't already contained in the set
2922 if (pto->setInventoryKnown.insert(inv).second)
2924 vInv.push_back(inv);
2925 if (vInv.size() >= 1000)
2927 pto->PushMessage("inv", vInv);
2932 pto->vInventoryToSend = vInvWait;
2935 pto->PushMessage("inv", vInv);
2941 vector<CInv> vGetData;
2942 int64 nNow = GetTime() * 1000000;
2944 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2946 const CInv& inv = (*pto->mapAskFor.begin()).second;
2947 if (!AlreadyHave(txdb, inv))
2949 printf("sending getdata: %s\n", inv.ToString().c_str());
2950 vGetData.push_back(inv);
2951 if (vGetData.size() >= 1000)
2953 pto->PushMessage("getdata", vGetData);
2957 mapAlreadyAskedFor[inv] = nNow;
2958 pto->mapAskFor.erase(pto->mapAskFor.begin());
2960 if (!vGetData.empty())
2961 pto->PushMessage("getdata", vGetData);
2980 //////////////////////////////////////////////////////////////////////////////
2985 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2987 unsigned char* pdata = (unsigned char*)pbuffer;
2988 unsigned int blocks = 1 + ((len + 8) / 64);
2989 unsigned char* pend = pdata + 64 * blocks;
2990 memset(pdata + len, 0, 64 * blocks - len);
2992 unsigned int bits = len * 8;
2993 pend[-1] = (bits >> 0) & 0xff;
2994 pend[-2] = (bits >> 8) & 0xff;
2995 pend[-3] = (bits >> 16) & 0xff;
2996 pend[-4] = (bits >> 24) & 0xff;
3000 static const unsigned int pSHA256InitState[8] =
3001 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3003 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3006 unsigned char data[64];
3010 for (int i = 0; i < 16; i++)
3011 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3013 for (int i = 0; i < 8; i++)
3014 ctx.h[i] = ((uint32_t*)pinit)[i];
3016 SHA256_Update(&ctx, data, sizeof(data));
3017 for (int i = 0; i < 8; i++)
3018 ((uint32_t*)pstate)[i] = ctx.h[i];
3022 // ScanHash scans nonces looking for a hash with at least some zero bits.
3023 // It operates on big endian data. Caller does the byte reversing.
3024 // All input buffers are 16-byte aligned. nNonce is usually preserved
3025 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3026 // the block is rebuilt and nNonce starts over at zero.
3028 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3030 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3034 // Hash pdata using pmidstate as the starting state into
3035 // preformatted buffer phash1, then hash phash1 into phash
3037 SHA256Transform(phash1, pdata, pmidstate);
3038 SHA256Transform(phash, phash1, pSHA256InitState);
3040 // Return the nonce if the hash has at least some zero bits,
3041 // caller will check if it has enough to reach the target
3042 if (((unsigned short*)phash)[14] == 0)
3045 // If nothing found after trying for a while, return -1
3046 if ((nNonce & 0xffff) == 0)
3048 nHashesDone = 0xffff+1;
3054 // Some explaining would be appreciated
3059 set<uint256> setDependsOn;
3062 COrphan(CTransaction* ptxIn)
3070 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3071 BOOST_FOREACH(uint256 hash, setDependsOn)
3072 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3077 uint64 nLastBlockTx = 0;
3078 uint64 nLastBlockSize = 0;
3080 CBlock* CreateNewBlock(CReserveKey& reservekey)
3082 CBlockIndex* pindexPrev = pindexBest;
3085 auto_ptr<CBlock> pblock(new CBlock());
3089 // Create coinbase tx
3091 txNew.vin.resize(1);
3092 txNew.vin[0].prevout.SetNull();
3093 txNew.vout.resize(1);
3094 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3096 // Add our coinbase tx as first transaction
3097 pblock->vtx.push_back(txNew);
3099 // Collect memory pool transactions into the block
3102 LOCK2(cs_main, cs_mapTransactions);
3105 // Priority order to process transactions
3106 list<COrphan> vOrphan; // list memory doesn't move
3107 map<uint256, vector<COrphan*> > mapDependers;
3108 multimap<double, CTransaction*> mapPriority;
3109 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3111 CTransaction& tx = (*mi).second;
3112 if (tx.IsCoinBase() || !tx.IsFinal())
3115 COrphan* porphan = NULL;
3116 double dPriority = 0;
3117 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3119 // Read prev transaction
3120 CTransaction txPrev;
3122 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3124 // Has to wait for dependencies
3127 // Use list for automatic deletion
3128 vOrphan.push_back(COrphan(&tx));
3129 porphan = &vOrphan.back();
3131 mapDependers[txin.prevout.hash].push_back(porphan);
3132 porphan->setDependsOn.insert(txin.prevout.hash);
3135 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3137 // Read block header
3138 int nConf = txindex.GetDepthInMainChain();
3140 dPriority += (double)nValueIn * nConf;
3142 if (fDebug && GetBoolArg("-printpriority"))
3143 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3146 // Priority is sum(valuein * age) / txsize
3147 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3150 porphan->dPriority = dPriority;
3152 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3154 if (fDebug && GetBoolArg("-printpriority"))
3156 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3163 // Collect transactions into block
3164 map<uint256, CTxIndex> mapTestPool;
3165 uint64 nBlockSize = 1000;
3166 uint64 nBlockTx = 0;
3167 int nBlockSigOps = 100;
3168 while (!mapPriority.empty())
3170 // Take highest priority transaction off priority queue
3171 double dPriority = -(*mapPriority.begin()).first;
3172 CTransaction& tx = *(*mapPriority.begin()).second;
3173 mapPriority.erase(mapPriority.begin());
3176 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3177 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3180 // Legacy limits on sigOps:
3181 int nTxSigOps = tx.GetLegacySigOpCount();
3182 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3185 // Transaction fee required depends on block size
3186 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3187 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3189 // Connecting shouldn't fail due to dependency on other memory pool transactions
3190 // because we're already processing them in order of dependency
3191 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3192 MapPrevTx mapInputs;
3194 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3197 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3198 if (nTxFees < nMinFee)
3201 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3202 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3205 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3207 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3208 swap(mapTestPool, mapTestPoolTmp);
3211 pblock->vtx.push_back(tx);
3212 nBlockSize += nTxSize;
3214 nBlockSigOps += nTxSigOps;
3217 // Add transactions that depend on this one to the priority queue
3218 uint256 hash = tx.GetHash();
3219 if (mapDependers.count(hash))
3221 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3223 if (!porphan->setDependsOn.empty())
3225 porphan->setDependsOn.erase(hash);
3226 if (porphan->setDependsOn.empty())
3227 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3233 nLastBlockTx = nBlockTx;
3234 nLastBlockSize = nBlockSize;
3235 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3238 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3241 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3242 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3243 pblock->UpdateTime(pindexPrev);
3244 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3247 return pblock.release();
3251 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3253 // Update nExtraNonce
3254 static uint256 hashPrevBlock;
3255 if (hashPrevBlock != pblock->hashPrevBlock)
3258 hashPrevBlock = pblock->hashPrevBlock;
3261 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3262 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3264 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3268 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3271 // Prebuild hash buffers
3278 uint256 hashPrevBlock;
3279 uint256 hashMerkleRoot;
3282 unsigned int nNonce;
3285 unsigned char pchPadding0[64];
3287 unsigned char pchPadding1[64];
3290 memset(&tmp, 0, sizeof(tmp));
3292 tmp.block.nVersion = pblock->nVersion;
3293 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3294 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3295 tmp.block.nTime = pblock->nTime;
3296 tmp.block.nBits = pblock->nBits;
3297 tmp.block.nNonce = pblock->nNonce;
3299 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3300 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3302 // Byte swap all the input buffer
3303 for (int i = 0; i < sizeof(tmp)/4; i++)
3304 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3306 // Precalc the first half of the first hash, which stays constant
3307 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3309 memcpy(pdata, &tmp.block, 128);
3310 memcpy(phash1, &tmp.hash1, 64);
3314 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3316 uint256 hash = pblock->GetHash();
3317 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3319 if (hash > hashTarget)
3323 printf("BitcoinMiner:\n");
3324 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3326 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3327 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3332 if (pblock->hashPrevBlock != hashBestChain)
3333 return error("BitcoinMiner : generated block is stale");
3335 // Remove key from key pool
3336 reservekey.KeepKey();
3338 // Track how many getdata requests this block gets
3340 LOCK(wallet.cs_wallet);
3341 wallet.mapRequestCount[pblock->GetHash()] = 0;
3344 // Process this block the same as if we had received it from another node
3345 if (!ProcessBlock(NULL, pblock))
3346 return error("BitcoinMiner : ProcessBlock, block not accepted");
3352 void static ThreadBitcoinMiner(void* parg);
3354 static bool fGenerateBitcoins = false;
3355 static bool fLimitProcessors = false;
3356 static int nLimitProcessors = -1;
3358 void static BitcoinMiner(CWallet *pwallet)
3360 printf("BitcoinMiner started\n");
3361 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3363 // Each thread has its own key and counter
3364 CReserveKey reservekey(pwallet);
3365 unsigned int nExtraNonce = 0;
3367 while (fGenerateBitcoins)
3369 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3373 while (vNodes.empty() || IsInitialBlockDownload())
3378 if (!fGenerateBitcoins)
3386 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3387 CBlockIndex* pindexPrev = pindexBest;
3389 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3392 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3394 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3398 // Prebuild hash buffers
3400 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3401 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3402 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3404 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3406 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3407 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3408 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3414 int64 nStart = GetTime();
3415 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3417 uint256& hash = *alignup<16>(hashbuf);
3420 unsigned int nHashesDone = 0;
3421 unsigned int nNonceFound;
3424 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3425 (char*)&hash, nHashesDone);
3427 // Check if something found
3428 if (nNonceFound != -1)
3430 for (int i = 0; i < sizeof(hash)/4; i++)
3431 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3433 if (hash <= hashTarget)
3436 pblock->nNonce = ByteReverse(nNonceFound);
3437 assert(hash == pblock->GetHash());
3439 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3440 CheckWork(pblock.get(), *pwalletMain, reservekey);
3441 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3447 static int64 nHashCounter;
3448 if (nHPSTimerStart == 0)
3450 nHPSTimerStart = GetTimeMillis();
3454 nHashCounter += nHashesDone;
3455 if (GetTimeMillis() - nHPSTimerStart > 4000)
3457 static CCriticalSection cs;
3460 if (GetTimeMillis() - nHPSTimerStart > 4000)
3462 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3463 nHPSTimerStart = GetTimeMillis();
3465 static int64 nLogTime;
3466 if (GetTime() - nLogTime > 30 * 60)
3468 nLogTime = GetTime();
3469 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3470 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3476 // Check for stop or if block needs to be rebuilt
3479 if (!fGenerateBitcoins)
3481 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3485 if (nBlockNonce >= 0xffff0000)
3487 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3489 if (pindexPrev != pindexBest)
3492 // Update nTime every few seconds
3493 pblock->UpdateTime(pindexPrev);
3494 nBlockTime = ByteReverse(pblock->nTime);
3497 // Changing pblock->nTime can change work required on testnet:
3498 nBlockBits = ByteReverse(pblock->nBits);
3499 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3505 void static ThreadBitcoinMiner(void* parg)
3507 CWallet* pwallet = (CWallet*)parg;
3510 vnThreadsRunning[THREAD_MINER]++;
3511 BitcoinMiner(pwallet);
3512 vnThreadsRunning[THREAD_MINER]--;
3514 catch (std::exception& e) {
3515 vnThreadsRunning[THREAD_MINER]--;
3516 PrintException(&e, "ThreadBitcoinMiner()");
3518 vnThreadsRunning[THREAD_MINER]--;
3519 PrintException(NULL, "ThreadBitcoinMiner()");
3522 if (vnThreadsRunning[THREAD_MINER] == 0)
3524 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3528 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3530 fGenerateBitcoins = fGenerate;
3531 nLimitProcessors = GetArg("-genproclimit", -1);
3532 if (nLimitProcessors == 0)
3533 fGenerateBitcoins = false;
3534 fLimitProcessors = (nLimitProcessors != -1);
3538 int nProcessors = boost::thread::hardware_concurrency();
3539 printf("%d processors\n", nProcessors);
3540 if (nProcessors < 1)
3542 if (fLimitProcessors && nProcessors > nLimitProcessors)
3543 nProcessors = nLimitProcessors;
3544 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3545 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3546 for (int i = 0; i < nAddThreads; i++)
3548 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3549 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");