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 multimap<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 void AddOrphanTx(const CDataStream& vMsg)
166 CDataStream(vMsg) >> tx;
167 uint256 hash = tx.GetHash();
168 if (mapOrphanTransactions.count(hash))
171 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
172 BOOST_FOREACH(const CTxIn& txin, tx.vin)
173 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
176 void static EraseOrphanTx(uint256 hash)
178 if (!mapOrphanTransactions.count(hash))
180 const CDataStream* pvMsg = mapOrphanTransactions[hash];
182 CDataStream(*pvMsg) >> tx;
183 BOOST_FOREACH(const CTxIn& txin, tx.vin)
185 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
186 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
188 if ((*mi).second == pvMsg)
189 mapOrphanTransactionsByPrev.erase(mi++);
195 mapOrphanTransactions.erase(hash);
198 int LimitOrphanTxSize(int nMaxOrphans)
201 while (mapOrphanTransactions.size() > nMaxOrphans)
203 // Evict a random orphan:
204 std::vector<unsigned char> randbytes(32);
205 RAND_bytes(&randbytes[0], 32);
206 uint256 randomhash(randbytes);
207 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
208 if (it == mapOrphanTransactions.end())
209 it = mapOrphanTransactions.begin();
210 EraseOrphanTx(it->first);
222 //////////////////////////////////////////////////////////////////////////////
224 // CTransaction and CTxIndex
227 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
230 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
232 if (!ReadFromDisk(txindexRet.pos))
234 if (prevout.n >= vout.size())
242 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
245 return ReadFromDisk(txdb, prevout, txindex);
248 bool CTransaction::ReadFromDisk(COutPoint prevout)
252 return ReadFromDisk(txdb, prevout, txindex);
255 bool CTransaction::IsStandard() const
257 BOOST_FOREACH(const CTxIn& txin, vin)
259 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
260 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
261 // ~65-byte public keys, plus a few script ops.
262 if (txin.scriptSig.size() > 500)
264 if (!txin.scriptSig.IsPushOnly())
267 BOOST_FOREACH(const CTxOut& txout, vout)
268 if (!::IsStandard(txout.scriptPubKey))
274 // Check transaction inputs, and make sure any
275 // pay-to-script-hash transactions are evaluating IsStandard scripts
277 // Why bother? To avoid denial-of-service attacks; an attacker
278 // can submit a standard HASH... OP_EQUAL transaction,
279 // which will get accepted into blocks. The redemption
280 // script can be anything; an attacker could use a very
281 // expensive-to-check-upon-redemption script like:
282 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
284 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
287 return true; // Coinbases don't use vin normally
289 for (unsigned int i = 0; i < vin.size(); i++)
291 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
293 vector<vector<unsigned char> > vSolutions;
294 txnouttype whichType;
295 // get the scriptPubKey corresponding to this input:
296 const CScript& prevScript = prev.scriptPubKey;
297 if (!Solver(prevScript, whichType, vSolutions))
299 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
301 // Transactions with extra stuff in their scriptSigs are
302 // non-standard. Note that this EvalScript() call will
303 // be quick, because if there are any operations
304 // beside "push data" in the scriptSig the
305 // IsStandard() call returns false
306 vector<vector<unsigned char> > stack;
307 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
310 if (whichType == TX_SCRIPTHASH)
314 CScript subscript(stack.back().begin(), stack.back().end());
315 vector<vector<unsigned char> > vSolutions2;
316 txnouttype whichType2;
317 if (!Solver(subscript, whichType2, vSolutions2))
319 if (whichType2 == TX_SCRIPTHASH)
321 nArgsExpected += ScriptSigArgsExpected(whichType2, vSolutions2);
324 if (stack.size() != nArgsExpected)
332 CTransaction::GetLegacySigOpCount() const
335 BOOST_FOREACH(const CTxIn& txin, vin)
337 nSigOps += txin.scriptSig.GetSigOpCount(false);
339 BOOST_FOREACH(const CTxOut& txout, vout)
341 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
347 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
359 // Load the block this tx is in
361 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
363 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
368 // Update the tx's hashBlock
369 hashBlock = pblock->GetHash();
371 // Locate the transaction
372 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
373 if (pblock->vtx[nIndex] == *(CTransaction*)this)
375 if (nIndex == pblock->vtx.size())
377 vMerkleBranch.clear();
379 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
383 // Fill in merkle branch
384 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
387 // Is the tx in a block that's in the main chain
388 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
389 if (mi == mapBlockIndex.end())
391 CBlockIndex* pindex = (*mi).second;
392 if (!pindex || !pindex->IsInMainChain())
395 return pindexBest->nHeight - pindex->nHeight + 1;
404 bool CTransaction::CheckTransaction() const
406 // Basic checks that don't depend on any context
408 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
410 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
412 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
413 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
415 // Check for negative or overflow output values
417 BOOST_FOREACH(const CTxOut& txout, vout)
419 if (txout.nValue < 0)
420 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
421 if (txout.nValue > MAX_MONEY)
422 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
423 nValueOut += txout.nValue;
424 if (!MoneyRange(nValueOut))
425 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
428 // Check for duplicate inputs
429 set<COutPoint> vInOutPoints;
430 BOOST_FOREACH(const CTxIn& txin, vin)
432 if (vInOutPoints.count(txin.prevout))
434 vInOutPoints.insert(txin.prevout);
439 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
440 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
444 BOOST_FOREACH(const CTxIn& txin, vin)
445 if (txin.prevout.IsNull())
446 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
452 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
453 bool* pfMissingInputs)
456 *pfMissingInputs = false;
458 if (!tx.CheckTransaction())
459 return error("CTxMemPool::accept() : CheckTransaction failed");
461 // Coinbase is only valid in a block, not as a loose transaction
463 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
465 // To help v0.1.5 clients who would see it as a negative number
466 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
467 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
469 // Rather not work on nonstandard transactions (unless -testnet)
470 if (!fTestNet && !tx.IsStandard())
471 return error("CTxMemPool::accept() : nonstandard transaction type");
473 // Do we already have it?
474 uint256 hash = tx.GetHash();
477 if (mapTx.count(hash))
481 if (txdb.ContainsTx(hash))
484 // Check for conflicts with in-memory transactions
485 CTransaction* ptxOld = NULL;
486 for (unsigned int i = 0; i < tx.vin.size(); i++)
488 COutPoint outpoint = tx.vin[i].prevout;
489 if (mapNextTx.count(outpoint))
491 // Disable replacement feature for now
494 // Allow replacing with a newer version of the same transaction
497 ptxOld = mapNextTx[outpoint].ptx;
498 if (ptxOld->IsFinal())
500 if (!tx.IsNewerThan(*ptxOld))
502 for (unsigned int i = 0; i < tx.vin.size(); i++)
504 COutPoint outpoint = tx.vin[i].prevout;
505 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
515 map<uint256, CTxIndex> mapUnused;
516 bool fInvalid = false;
517 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
520 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
522 *pfMissingInputs = true;
523 return error("CTxMemPool::accept() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
526 // Check for non-standard pay-to-script-hash in inputs
527 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
528 return error("CTxMemPool::accept() : nonstandard transaction input");
530 // Note: if you modify this code to accept non-standard transactions, then
531 // you should add code here to check that the transaction does a
532 // reasonable number of ECDSA signature verifications.
534 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
535 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
537 // Don't accept it if it can't get into a block
538 if (nFees < tx.GetMinFee(1000, true, GMF_RELAY))
539 return error("CTxMemPool::accept() : not enough fees");
541 // Continuously rate-limit free transactions
542 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
543 // be annoying or make other's transactions take longer to confirm.
544 if (nFees < MIN_RELAY_TX_FEE)
546 static CCriticalSection cs;
547 static double dFreeCount;
548 static int64 nLastTime;
549 int64 nNow = GetTime();
553 // Use an exponentially decaying ~10-minute window:
554 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
556 // -limitfreerelay unit is thousand-bytes-per-minute
557 // At default rate it would take over a month to fill 1GB
558 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
559 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
561 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
566 // Check against previous transactions
567 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
568 if (!tx.ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
570 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
574 // Store transaction in memory
579 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
585 ///// are we sure this is ok when loading transactions or restoring block txes
586 // If updated, erase old tx from wallet
588 EraseFromWallets(ptxOld->GetHash());
590 printf("CTxMemPool::accept() : accepted %s\n", hash.ToString().substr(0,10).c_str());
594 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
596 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
599 bool CTxMemPool::addUnchecked(CTransaction &tx)
601 printf("addUnchecked(): size %lu\n", mapTx.size());
602 // Add to memory pool without checking anything. Don't call this directly,
603 // call CTxMemPool::accept to properly check the transaction first.
606 uint256 hash = tx.GetHash();
608 for (unsigned int i = 0; i < tx.vin.size(); i++)
609 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
610 nTransactionsUpdated++;
616 bool CTxMemPool::remove(CTransaction &tx)
618 // Remove transaction from memory pool
621 uint256 hash = tx.GetHash();
622 if (mapTx.count(hash))
624 BOOST_FOREACH(const CTxIn& txin, tx.vin)
625 mapNextTx.erase(txin.prevout);
627 nTransactionsUpdated++;
638 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
640 if (hashBlock == 0 || nIndex == -1)
643 // Find the block it claims to be in
644 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
645 if (mi == mapBlockIndex.end())
647 CBlockIndex* pindex = (*mi).second;
648 if (!pindex || !pindex->IsInMainChain())
651 // Make sure the merkle branch connects to this block
652 if (!fMerkleVerified)
654 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
656 fMerkleVerified = true;
660 return pindexBest->nHeight - pindex->nHeight + 1;
664 int CMerkleTx::GetBlocksToMaturity() const
668 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
672 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
676 if (!IsInMainChain() && !ClientConnectInputs())
678 return CTransaction::AcceptToMemoryPool(txdb, false);
682 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
686 bool CMerkleTx::AcceptToMemoryPool()
689 return AcceptToMemoryPool(txdb);
694 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
699 // Add previous supporting transactions first
700 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
702 if (!tx.IsCoinBase())
704 uint256 hash = tx.GetHash();
705 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
706 tx.AcceptToMemoryPool(txdb, fCheckInputs);
709 return AcceptToMemoryPool(txdb, fCheckInputs);
714 bool CWalletTx::AcceptWalletTransaction()
717 return AcceptWalletTransaction(txdb);
720 int CTxIndex::GetDepthInMainChain() const
724 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
726 // Find the block in the index
727 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
728 if (mi == mapBlockIndex.end())
730 CBlockIndex* pindex = (*mi).second;
731 if (!pindex || !pindex->IsInMainChain())
733 return 1 + nBestHeight - pindex->nHeight;
745 //////////////////////////////////////////////////////////////////////////////
747 // CBlock and CBlockIndex
750 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
752 if (!fReadTransactions)
754 *this = pindex->GetBlockHeader();
757 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
759 if (GetHash() != pindex->GetBlockHash())
760 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
764 uint256 static GetOrphanRoot(const CBlock* pblock)
766 // Work back to the first block in the orphan chain
767 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
768 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
769 return pblock->GetHash();
772 int64 static GetBlockValue(int nHeight, int64 nFees)
774 int64 nSubsidy = 50 * COIN;
776 // Subsidy is cut in half every 4 years
777 nSubsidy >>= (nHeight / 210000);
779 return nSubsidy + nFees;
782 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
783 static const int64 nTargetSpacing = 10 * 60;
784 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
787 // minimum amount of work that could possibly be required nTime after
788 // minimum work required was nBase
790 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
792 // Testnet has min-difficulty blocks
793 // after nTargetSpacing*2 time between blocks:
794 if (fTestNet && nTime > nTargetSpacing*2)
795 return bnProofOfWorkLimit.GetCompact();
798 bnResult.SetCompact(nBase);
799 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
801 // Maximum 400% adjustment...
803 // ... in best-case exactly 4-times-normal target time
804 nTime -= nTargetTimespan*4;
806 if (bnResult > bnProofOfWorkLimit)
807 bnResult = bnProofOfWorkLimit;
808 return bnResult.GetCompact();
811 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
813 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
816 if (pindexLast == NULL)
817 return nProofOfWorkLimit;
819 // Only change once per interval
820 if ((pindexLast->nHeight+1) % nInterval != 0)
822 // Special rules for testnet after 15 Feb 2012:
823 if (fTestNet && pblock->nTime > 1329264000)
825 // If the new block's timestamp is more than 2* 10 minutes
826 // then allow mining of a min-difficulty block.
827 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
828 return nProofOfWorkLimit;
831 // Return the last non-special-min-difficulty-rules-block
832 const CBlockIndex* pindex = pindexLast;
833 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
834 pindex = pindex->pprev;
835 return pindex->nBits;
839 return pindexLast->nBits;
842 // Go back by what we want to be 14 days worth of blocks
843 const CBlockIndex* pindexFirst = pindexLast;
844 for (int i = 0; pindexFirst && i < nInterval-1; i++)
845 pindexFirst = pindexFirst->pprev;
848 // Limit adjustment step
849 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
850 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
851 if (nActualTimespan < nTargetTimespan/4)
852 nActualTimespan = nTargetTimespan/4;
853 if (nActualTimespan > nTargetTimespan*4)
854 nActualTimespan = nTargetTimespan*4;
858 bnNew.SetCompact(pindexLast->nBits);
859 bnNew *= nActualTimespan;
860 bnNew /= nTargetTimespan;
862 if (bnNew > bnProofOfWorkLimit)
863 bnNew = bnProofOfWorkLimit;
866 printf("GetNextWorkRequired RETARGET\n");
867 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
868 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
869 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
871 return bnNew.GetCompact();
874 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
877 bnTarget.SetCompact(nBits);
880 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
881 return error("CheckProofOfWork() : nBits below minimum work");
883 // Check proof of work matches claimed amount
884 if (hash > bnTarget.getuint256())
885 return error("CheckProofOfWork() : hash doesn't match nBits");
890 // Return maximum amount of blocks that other nodes claim to have
891 int GetNumBlocksOfPeers()
893 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
896 bool IsInitialBlockDownload()
898 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
900 static int64 nLastUpdate;
901 static CBlockIndex* pindexLastBest;
902 if (pindexBest != pindexLastBest)
904 pindexLastBest = pindexBest;
905 nLastUpdate = GetTime();
907 return (GetTime() - nLastUpdate < 10 &&
908 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
911 void static InvalidChainFound(CBlockIndex* pindexNew)
913 if (pindexNew->bnChainWork > bnBestInvalidWork)
915 bnBestInvalidWork = pindexNew->bnChainWork;
916 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
919 printf("InvalidChainFound: invalid block=%s height=%d work=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, pindexNew->bnChainWork.ToString().c_str());
920 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
921 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
922 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
925 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
927 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
929 // Updating time can change work required on testnet:
931 nBits = GetNextWorkRequired(pindexPrev, this);
944 bool CTransaction::DisconnectInputs(CTxDB& txdb)
946 // Relinquish previous transactions' spent pointers
949 BOOST_FOREACH(const CTxIn& txin, vin)
951 COutPoint prevout = txin.prevout;
953 // Get prev txindex from disk
955 if (!txdb.ReadTxIndex(prevout.hash, txindex))
956 return error("DisconnectInputs() : ReadTxIndex failed");
958 if (prevout.n >= txindex.vSpent.size())
959 return error("DisconnectInputs() : prevout.n out of range");
961 // Mark outpoint as not spent
962 txindex.vSpent[prevout.n].SetNull();
965 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
966 return error("DisconnectInputs() : UpdateTxIndex failed");
970 // Remove transaction from index
971 // This can fail if a duplicate of this transaction was in a chain that got
972 // reorganized away. This is only possible if this transaction was completely
973 // spent, so erasing it would be a no-op anway.
974 txdb.EraseTxIndex(*this);
980 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
981 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
983 // FetchInputs can return false either because we just haven't seen some inputs
984 // (in which case the transaction should be stored as an orphan)
985 // or because the transaction is malformed (in which case the transaction should
986 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
990 return true; // Coinbase transactions have no inputs to fetch.
992 for (unsigned int i = 0; i < vin.size(); i++)
994 COutPoint prevout = vin[i].prevout;
995 if (inputsRet.count(prevout.hash))
996 continue; // Got it already
999 CTxIndex& txindex = inputsRet[prevout.hash].first;
1001 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1003 // Get txindex from current proposed changes
1004 txindex = mapTestPool.find(prevout.hash)->second;
1008 // Read txindex from txdb
1009 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1011 if (!fFound && (fBlock || fMiner))
1012 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());
1015 CTransaction& txPrev = inputsRet[prevout.hash].second;
1016 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1018 // Get prev tx from single transactions in memory
1021 if (!mempool.exists(prevout.hash))
1022 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());
1023 txPrev = mempool.lookup(prevout.hash);
1026 txindex.vSpent.resize(txPrev.vout.size());
1030 // Get prev tx from disk
1031 if (!txPrev.ReadFromDisk(txindex.pos))
1032 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1036 // Make sure all prevout.n's are valid:
1037 for (unsigned int i = 0; i < vin.size(); i++)
1039 const COutPoint prevout = vin[i].prevout;
1040 assert(inputsRet.count(prevout.hash) != 0);
1041 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1042 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1043 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1045 // Revisit this if/when transaction replacement is implemented and allows
1048 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()));
1055 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1057 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1058 if (mi == inputs.end())
1059 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1061 const CTransaction& txPrev = (mi->second).second;
1062 if (input.prevout.n >= txPrev.vout.size())
1063 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1065 return txPrev.vout[input.prevout.n];
1068 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1074 for (unsigned int i = 0; i < vin.size(); i++)
1076 nResult += GetOutputFor(vin[i], inputs).nValue;
1082 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1088 for (unsigned int i = 0; i < vin.size(); i++)
1090 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1091 if (prevout.scriptPubKey.IsPayToScriptHash())
1092 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1097 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1098 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1099 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1101 // Take over previous transactions' spent pointers
1102 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1103 // fMiner is true when called from the internal bitcoin miner
1104 // ... both are false when called from CTransaction::AcceptToMemoryPool
1109 for (unsigned int i = 0; i < vin.size(); i++)
1111 COutPoint prevout = vin[i].prevout;
1112 assert(inputs.count(prevout.hash) > 0);
1113 CTxIndex& txindex = inputs[prevout.hash].first;
1114 CTransaction& txPrev = inputs[prevout.hash].second;
1116 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1117 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()));
1119 // If prev is coinbase, check that it's matured
1120 if (txPrev.IsCoinBase())
1121 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1122 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1123 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1125 // Check for conflicts (double-spend)
1126 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1127 // for an attacker to attempt to split the network.
1128 if (!txindex.vSpent[prevout.n].IsNull())
1129 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());
1131 // Check for negative or overflow input values
1132 nValueIn += txPrev.vout[prevout.n].nValue;
1133 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1134 return DoS(100, error("ConnectInputs() : txin values out of range"));
1136 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1137 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1138 // still computed and checked, and any change will be caught at the next checkpoint.
1139 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1142 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1144 // only during transition phase for P2SH: do not invoke anti-DoS code for
1145 // potentially old clients relaying bad P2SH transactions
1146 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1147 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1149 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1153 // Mark outpoints as spent
1154 txindex.vSpent[prevout.n] = posThisTx;
1157 if (fBlock || fMiner)
1159 mapTestPool[prevout.hash] = txindex;
1163 if (nValueIn < GetValueOut())
1164 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1166 // Tally transaction fees
1167 int64 nTxFee = nValueIn - GetValueOut();
1169 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1171 if (!MoneyRange(nFees))
1172 return DoS(100, error("ConnectInputs() : nFees out of range"));
1179 bool CTransaction::ClientConnectInputs()
1184 // Take over previous transactions' spent pointers
1188 for (unsigned int i = 0; i < vin.size(); i++)
1190 // Get prev tx from single transactions in memory
1191 COutPoint prevout = vin[i].prevout;
1192 if (!mempool.exists(prevout.hash))
1194 CTransaction& txPrev = mempool.lookup(prevout.hash);
1196 if (prevout.n >= txPrev.vout.size())
1200 if (!VerifySignature(txPrev, *this, i, true, 0))
1201 return error("ConnectInputs() : VerifySignature failed");
1203 ///// this is redundant with the mempool.mapNextTx stuff,
1204 ///// not sure which I want to get rid of
1205 ///// this has to go away now that posNext is gone
1206 // // Check for conflicts
1207 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1208 // return error("ConnectInputs() : prev tx already used");
1210 // // Flag outpoints as used
1211 // txPrev.vout[prevout.n].posNext = posThisTx;
1213 nValueIn += txPrev.vout[prevout.n].nValue;
1215 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1216 return error("ClientConnectInputs() : txin values out of range");
1218 if (GetValueOut() > nValueIn)
1228 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1230 // Disconnect in reverse order
1231 for (int i = vtx.size()-1; i >= 0; i--)
1232 if (!vtx[i].DisconnectInputs(txdb))
1235 // Update block index on disk without changing it in memory.
1236 // The memory index structure will be changed after the db commits.
1239 CDiskBlockIndex blockindexPrev(pindex->pprev);
1240 blockindexPrev.hashNext = 0;
1241 if (!txdb.WriteBlockIndex(blockindexPrev))
1242 return error("DisconnectBlock() : WriteBlockIndex failed");
1248 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1250 // Check it again in case a previous version let a bad block in
1254 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1255 // unless those are already completely spent.
1256 // If such overwrites are allowed, coinbases and transactions depending upon those
1257 // can be duplicated to remove the ability to spend the first instance -- even after
1258 // being sent to another address.
1259 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1260 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1261 // already refuses previously-known transaction id's entirely.
1262 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1263 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1264 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1266 BOOST_FOREACH(CTransaction& tx, vtx)
1268 CTxIndex txindexOld;
1269 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1271 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1278 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1279 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1280 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1282 //// issue here: it doesn't know the version
1283 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - 1 + GetSizeOfCompactSize(vtx.size());
1285 map<uint256, CTxIndex> mapQueuedChanges;
1288 BOOST_FOREACH(CTransaction& tx, vtx)
1290 nSigOps += tx.GetLegacySigOpCount();
1291 if (nSigOps > MAX_BLOCK_SIGOPS)
1292 return DoS(100, error("ConnectBlock() : too many sigops"));
1294 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1295 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1297 MapPrevTx mapInputs;
1298 if (!tx.IsCoinBase())
1301 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1304 if (fStrictPayToScriptHash)
1306 // Add in sigops done by pay-to-script-hash inputs;
1307 // this is to prevent a "rogue miner" from creating
1308 // an incredibly-expensive-to-validate block.
1309 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1310 if (nSigOps > MAX_BLOCK_SIGOPS)
1311 return DoS(100, error("ConnectBlock() : too many sigops"));
1314 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1316 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1320 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1323 // Write queued txindex changes
1324 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1326 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1327 return error("ConnectBlock() : UpdateTxIndex failed");
1330 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1333 // Update block index on disk without changing it in memory.
1334 // The memory index structure will be changed after the db commits.
1337 CDiskBlockIndex blockindexPrev(pindex->pprev);
1338 blockindexPrev.hashNext = pindex->GetBlockHash();
1339 if (!txdb.WriteBlockIndex(blockindexPrev))
1340 return error("ConnectBlock() : WriteBlockIndex failed");
1343 // Watch for transactions paying to me
1344 BOOST_FOREACH(CTransaction& tx, vtx)
1345 SyncWithWallets(tx, this, true);
1350 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1352 printf("REORGANIZE\n");
1355 CBlockIndex* pfork = pindexBest;
1356 CBlockIndex* plonger = pindexNew;
1357 while (pfork != plonger)
1359 while (plonger->nHeight > pfork->nHeight)
1360 if (!(plonger = plonger->pprev))
1361 return error("Reorganize() : plonger->pprev is null");
1362 if (pfork == plonger)
1364 if (!(pfork = pfork->pprev))
1365 return error("Reorganize() : pfork->pprev is null");
1368 // List of what to disconnect
1369 vector<CBlockIndex*> vDisconnect;
1370 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1371 vDisconnect.push_back(pindex);
1373 // List of what to connect
1374 vector<CBlockIndex*> vConnect;
1375 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1376 vConnect.push_back(pindex);
1377 reverse(vConnect.begin(), vConnect.end());
1379 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());
1380 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());
1382 // Disconnect shorter branch
1383 vector<CTransaction> vResurrect;
1384 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1387 if (!block.ReadFromDisk(pindex))
1388 return error("Reorganize() : ReadFromDisk for disconnect failed");
1389 if (!block.DisconnectBlock(txdb, pindex))
1390 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1392 // Queue memory transactions to resurrect
1393 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1394 if (!tx.IsCoinBase())
1395 vResurrect.push_back(tx);
1398 // Connect longer branch
1399 vector<CTransaction> vDelete;
1400 for (unsigned int i = 0; i < vConnect.size(); i++)
1402 CBlockIndex* pindex = vConnect[i];
1404 if (!block.ReadFromDisk(pindex))
1405 return error("Reorganize() : ReadFromDisk for connect failed");
1406 if (!block.ConnectBlock(txdb, pindex))
1410 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1413 // Queue memory transactions to delete
1414 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1415 vDelete.push_back(tx);
1417 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1418 return error("Reorganize() : WriteHashBestChain failed");
1420 // Make sure it's successfully written to disk before changing memory structure
1421 if (!txdb.TxnCommit())
1422 return error("Reorganize() : TxnCommit failed");
1424 // Disconnect shorter branch
1425 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1427 pindex->pprev->pnext = NULL;
1429 // Connect longer branch
1430 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1432 pindex->pprev->pnext = pindex;
1434 // Resurrect memory transactions that were in the disconnected branch
1435 BOOST_FOREACH(CTransaction& tx, vResurrect)
1436 tx.AcceptToMemoryPool(txdb, false);
1438 // Delete redundant memory transactions that are in the connected branch
1439 BOOST_FOREACH(CTransaction& tx, vDelete)
1442 printf("REORGANIZE: done\n");
1449 runCommand(std::string strCommand)
1451 int nErr = ::system(strCommand.c_str());
1453 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1456 // Called from inside SetBestChain: attaches a block to the new best chain being built
1457 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1459 uint256 hash = GetHash();
1461 // Adding to current best branch
1462 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1465 InvalidChainFound(pindexNew);
1468 if (!txdb.TxnCommit())
1469 return error("SetBestChain() : TxnCommit failed");
1471 // Add to current best branch
1472 pindexNew->pprev->pnext = pindexNew;
1474 // Delete redundant memory transactions
1475 BOOST_FOREACH(CTransaction& tx, vtx)
1481 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1483 uint256 hash = GetHash();
1486 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1488 txdb.WriteHashBestChain(hash);
1489 if (!txdb.TxnCommit())
1490 return error("SetBestChain() : TxnCommit failed");
1491 pindexGenesisBlock = pindexNew;
1493 else if (hashPrevBlock == hashBestChain)
1495 if (!SetBestChainInner(txdb, pindexNew))
1496 return error("SetBestChain() : SetBestChainInner failed");
1500 // the first block in the new chain that will cause it to become the new best chain
1501 CBlockIndex *pindexIntermediate = pindexNew;
1503 // list of blocks that need to be connected afterwards
1504 std::vector<CBlockIndex*> vpindexSecondary;
1506 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1507 // Try to limit how much needs to be done inside
1508 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1510 vpindexSecondary.push_back(pindexIntermediate);
1511 pindexIntermediate = pindexIntermediate->pprev;
1514 if (!vpindexSecondary.empty())
1515 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1517 // Switch to new best branch
1518 if (!Reorganize(txdb, pindexIntermediate))
1521 InvalidChainFound(pindexNew);
1522 return error("SetBestChain() : Reorganize failed");
1525 // Connect futher blocks
1526 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1529 if (!block.ReadFromDisk(pindex))
1531 printf("SetBestChain() : ReadFromDisk failed\n");
1535 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1536 if (!block.SetBestChainInner(txdb, pindex))
1541 // Update best block in wallet (so we can detect restored wallets)
1542 bool fIsInitialDownload = IsInitialBlockDownload();
1543 if (!fIsInitialDownload)
1545 const CBlockLocator locator(pindexNew);
1546 ::SetBestChain(locator);
1550 hashBestChain = hash;
1551 pindexBest = pindexNew;
1552 nBestHeight = pindexBest->nHeight;
1553 bnBestChainWork = pindexNew->bnChainWork;
1554 nTimeBestReceived = GetTime();
1555 nTransactionsUpdated++;
1556 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1558 std::string strCmd = GetArg("-blocknotify", "");
1560 if (!fIsInitialDownload && !strCmd.empty())
1562 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1563 boost::thread t(runCommand, strCmd); // thread runs free
1570 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1572 // Check for duplicate
1573 uint256 hash = GetHash();
1574 if (mapBlockIndex.count(hash))
1575 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1577 // Construct new block index object
1578 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1580 return error("AddToBlockIndex() : new CBlockIndex failed");
1581 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1582 pindexNew->phashBlock = &((*mi).first);
1583 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1584 if (miPrev != mapBlockIndex.end())
1586 pindexNew->pprev = (*miPrev).second;
1587 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1589 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1593 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1594 if (!txdb.TxnCommit())
1598 if (pindexNew->bnChainWork > bnBestChainWork)
1599 if (!SetBestChain(txdb, pindexNew))
1604 if (pindexNew == pindexBest)
1606 // Notify UI to display prev block's coinbase if it was ours
1607 static uint256 hashPrevBestCoinBase;
1608 UpdatedTransaction(hashPrevBestCoinBase);
1609 hashPrevBestCoinBase = vtx[0].GetHash();
1619 bool CBlock::CheckBlock() const
1621 // These are checks that are independent of context
1622 // that can be verified before saving an orphan block.
1625 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
1626 return DoS(100, error("CheckBlock() : size limits failed"));
1628 // Check proof of work matches claimed amount
1629 if (!CheckProofOfWork(GetHash(), nBits))
1630 return DoS(50, error("CheckBlock() : proof of work failed"));
1633 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1634 return error("CheckBlock() : block timestamp too far in the future");
1636 // First transaction must be coinbase, the rest must not be
1637 if (vtx.empty() || !vtx[0].IsCoinBase())
1638 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1639 for (unsigned int i = 1; i < vtx.size(); i++)
1640 if (vtx[i].IsCoinBase())
1641 return DoS(100, error("CheckBlock() : more than one coinbase"));
1643 // Check transactions
1644 BOOST_FOREACH(const CTransaction& tx, vtx)
1645 if (!tx.CheckTransaction())
1646 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1649 BOOST_FOREACH(const CTransaction& tx, vtx)
1651 nSigOps += tx.GetLegacySigOpCount();
1653 if (nSigOps > MAX_BLOCK_SIGOPS)
1654 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1657 if (hashMerkleRoot != BuildMerkleTree())
1658 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1663 bool CBlock::AcceptBlock()
1665 // Check for duplicate
1666 uint256 hash = GetHash();
1667 if (mapBlockIndex.count(hash))
1668 return error("AcceptBlock() : block already in mapBlockIndex");
1670 // Get prev block index
1671 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1672 if (mi == mapBlockIndex.end())
1673 return DoS(10, error("AcceptBlock() : prev block not found"));
1674 CBlockIndex* pindexPrev = (*mi).second;
1675 int nHeight = pindexPrev->nHeight+1;
1677 // Check proof of work
1678 if (nBits != GetNextWorkRequired(pindexPrev, this))
1679 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1681 // Check timestamp against prev
1682 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1683 return error("AcceptBlock() : block's timestamp is too early");
1685 // Check that all transactions are finalized
1686 BOOST_FOREACH(const CTransaction& tx, vtx)
1687 if (!tx.IsFinal(nHeight, GetBlockTime()))
1688 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1690 // Check that the block chain matches the known block chain up to a checkpoint
1691 if (!Checkpoints::CheckBlock(nHeight, hash))
1692 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1694 // Write block to history file
1695 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
1696 return error("AcceptBlock() : out of disk space");
1697 unsigned int nFile = -1;
1698 unsigned int nBlockPos = 0;
1699 if (!WriteToDisk(nFile, nBlockPos))
1700 return error("AcceptBlock() : WriteToDisk failed");
1701 if (!AddToBlockIndex(nFile, nBlockPos))
1702 return error("AcceptBlock() : AddToBlockIndex failed");
1704 // Relay inventory, but don't relay old inventory during initial block download
1705 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1706 if (hashBestChain == hash)
1709 BOOST_FOREACH(CNode* pnode, vNodes)
1710 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1711 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1717 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1719 // Check for duplicate
1720 uint256 hash = pblock->GetHash();
1721 if (mapBlockIndex.count(hash))
1722 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1723 if (mapOrphanBlocks.count(hash))
1724 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1726 // Preliminary checks
1727 if (!pblock->CheckBlock())
1728 return error("ProcessBlock() : CheckBlock FAILED");
1730 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1731 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1733 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1734 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1738 pfrom->Misbehaving(100);
1739 return error("ProcessBlock() : block with timestamp before last checkpoint");
1742 bnNewBlock.SetCompact(pblock->nBits);
1744 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1745 if (bnNewBlock > bnRequired)
1748 pfrom->Misbehaving(100);
1749 return error("ProcessBlock() : block with too little proof-of-work");
1754 // If don't already have its previous block, shunt it off to holding area until we get it
1755 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1757 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1758 CBlock* pblock2 = new CBlock(*pblock);
1759 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1760 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1762 // Ask this guy to fill in what we're missing
1764 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1769 if (!pblock->AcceptBlock())
1770 return error("ProcessBlock() : AcceptBlock FAILED");
1772 // Recursively process any orphan blocks that depended on this one
1773 vector<uint256> vWorkQueue;
1774 vWorkQueue.push_back(hash);
1775 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
1777 uint256 hashPrev = vWorkQueue[i];
1778 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1779 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1782 CBlock* pblockOrphan = (*mi).second;
1783 if (pblockOrphan->AcceptBlock())
1784 vWorkQueue.push_back(pblockOrphan->GetHash());
1785 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1786 delete pblockOrphan;
1788 mapOrphanBlocksByPrev.erase(hashPrev);
1791 printf("ProcessBlock: ACCEPTED\n");
1802 bool CheckDiskSpace(uint64 nAdditionalBytes)
1804 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1806 // Check for 15MB because database could create another 10MB log file at any time
1807 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1810 string strMessage = _("Warning: Disk space is low ");
1811 strMiscWarning = strMessage;
1812 printf("*** %s\n", strMessage.c_str());
1813 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1820 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1824 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1827 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1829 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1838 static unsigned int nCurrentBlockFile = 1;
1840 FILE* AppendBlockFile(unsigned int& nFileRet)
1845 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1848 if (fseek(file, 0, SEEK_END) != 0)
1850 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1851 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1853 nFileRet = nCurrentBlockFile;
1857 nCurrentBlockFile++;
1861 bool LoadBlockIndex(bool fAllowNew)
1865 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1866 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1867 pchMessageStart[0] = 0xfa;
1868 pchMessageStart[1] = 0xbf;
1869 pchMessageStart[2] = 0xb5;
1870 pchMessageStart[3] = 0xda;
1877 if (!txdb.LoadBlockIndex())
1882 // Init with genesis block
1884 if (mapBlockIndex.empty())
1890 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1891 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1892 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1893 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1894 // vMerkleTree: 4a5e1e
1897 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1899 txNew.vin.resize(1);
1900 txNew.vout.resize(1);
1901 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1902 txNew.vout[0].nValue = 50 * COIN;
1903 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1905 block.vtx.push_back(txNew);
1906 block.hashPrevBlock = 0;
1907 block.hashMerkleRoot = block.BuildMerkleTree();
1909 block.nTime = 1231006505;
1910 block.nBits = 0x1d00ffff;
1911 block.nNonce = 2083236893;
1915 block.nTime = 1296688602;
1916 block.nBits = 0x1d07fff8;
1917 block.nNonce = 384568319;
1921 printf("%s\n", block.GetHash().ToString().c_str());
1922 printf("%s\n", hashGenesisBlock.ToString().c_str());
1923 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1924 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1926 assert(block.GetHash() == hashGenesisBlock);
1928 // Start new block file
1930 unsigned int nBlockPos;
1931 if (!block.WriteToDisk(nFile, nBlockPos))
1932 return error("LoadBlockIndex() : writing genesis block to disk failed");
1933 if (!block.AddToBlockIndex(nFile, nBlockPos))
1934 return error("LoadBlockIndex() : genesis block not accepted");
1942 void PrintBlockTree()
1944 // precompute tree structure
1945 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1946 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1948 CBlockIndex* pindex = (*mi).second;
1949 mapNext[pindex->pprev].push_back(pindex);
1951 //while (rand() % 3 == 0)
1952 // mapNext[pindex->pprev].push_back(pindex);
1955 vector<pair<int, CBlockIndex*> > vStack;
1956 vStack.push_back(make_pair(0, pindexGenesisBlock));
1959 while (!vStack.empty())
1961 int nCol = vStack.back().first;
1962 CBlockIndex* pindex = vStack.back().second;
1965 // print split or gap
1966 if (nCol > nPrevCol)
1968 for (int i = 0; i < nCol-1; i++)
1972 else if (nCol < nPrevCol)
1974 for (int i = 0; i < nCol; i++)
1981 for (int i = 0; i < nCol; i++)
1986 block.ReadFromDisk(pindex);
1987 printf("%d (%u,%u) %s %s tx %d",
1991 block.GetHash().ToString().substr(0,20).c_str(),
1992 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1995 PrintWallets(block);
1997 // put the main timechain first
1998 vector<CBlockIndex*>& vNext = mapNext[pindex];
1999 for (unsigned int i = 0; i < vNext.size(); i++)
2001 if (vNext[i]->pnext)
2003 swap(vNext[0], vNext[i]);
2009 for (unsigned int i = 0; i < vNext.size(); i++)
2010 vStack.push_back(make_pair(nCol+i, vNext[i]));
2023 //////////////////////////////////////////////////////////////////////////////
2028 map<uint256, CAlert> mapAlerts;
2029 CCriticalSection cs_mapAlerts;
2031 string GetWarnings(string strFor)
2034 string strStatusBar;
2036 if (GetBoolArg("-testsafemode"))
2039 // Misc warnings like out of disk space and clock is wrong
2040 if (strMiscWarning != "")
2043 strStatusBar = strMiscWarning;
2046 // Longer invalid proof-of-work chain
2047 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2050 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2056 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2058 const CAlert& alert = item.second;
2059 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2061 nPriority = alert.nPriority;
2062 strStatusBar = alert.strStatusBar;
2067 if (strFor == "statusbar")
2068 return strStatusBar;
2069 else if (strFor == "rpc")
2071 assert(!"GetWarnings() : invalid parameter");
2075 bool CAlert::ProcessAlert()
2077 if (!CheckSignature())
2084 // Cancel previous alerts
2085 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2087 const CAlert& alert = (*mi).second;
2090 printf("cancelling alert %d\n", alert.nID);
2091 mapAlerts.erase(mi++);
2093 else if (!alert.IsInEffect())
2095 printf("expiring alert %d\n", alert.nID);
2096 mapAlerts.erase(mi++);
2102 // Check if this alert has been cancelled
2103 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2105 const CAlert& alert = item.second;
2106 if (alert.Cancels(*this))
2108 printf("alert already cancelled by %d\n", alert.nID);
2114 mapAlerts.insert(make_pair(GetHash(), *this));
2117 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2129 //////////////////////////////////////////////////////////////////////////////
2135 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2141 bool txInMap = false;
2144 txInMap = (mempool.exists(inv.hash));
2147 mapOrphanTransactions.count(inv.hash) ||
2148 txdb.ContainsTx(inv.hash);
2152 return mapBlockIndex.count(inv.hash) ||
2153 mapOrphanBlocks.count(inv.hash);
2155 // Don't know what it is, just say we already got one
2162 // The message start string is designed to be unlikely to occur in normal data.
2163 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2164 // a large 4-byte int at any alignment.
2165 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2168 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2170 static map<CService, vector<unsigned char> > mapReuseKey;
2171 RandAddSeedPerfmon();
2173 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2174 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2176 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2178 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2186 if (strCommand == "version")
2188 // Each connection can only send one version message
2189 if (pfrom->nVersion != 0)
2191 pfrom->Misbehaving(1);
2199 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2200 if (pfrom->nVersion < MIN_PROTO_VERSION)
2202 // Since February 20, 2012, the protocol is initiated at version 209,
2203 // and earlier versions are no longer supported
2204 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2205 pfrom->fDisconnect = true;
2209 if (pfrom->nVersion == 10300)
2210 pfrom->nVersion = 300;
2212 vRecv >> addrFrom >> nNonce;
2214 vRecv >> pfrom->strSubVer;
2216 vRecv >> pfrom->nStartingHeight;
2218 // Disconnect if we connected to ourself
2219 if (nNonce == nLocalHostNonce && nNonce > 1)
2221 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2222 pfrom->fDisconnect = true;
2226 // Be shy and don't send version until we hear
2227 if (pfrom->fInbound)
2228 pfrom->PushVersion();
2230 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2232 AddTimeData(pfrom->addr, nTime);
2235 pfrom->PushMessage("verack");
2236 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2238 if (!pfrom->fInbound)
2240 // Advertise our address
2241 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2242 !IsInitialBlockDownload())
2244 CAddress addr(addrLocalHost);
2245 addr.nTime = GetAdjustedTime();
2246 pfrom->PushAddress(addr);
2249 // Get recent addresses
2250 if (pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
2252 pfrom->PushMessage("getaddr");
2253 pfrom->fGetAddr = true;
2255 addrman.Good(pfrom->addr);
2257 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2259 addrman.Add(addrFrom, addrFrom);
2260 addrman.Good(addrFrom);
2264 // Ask the first connected node for block updates
2265 static int nAskedForBlocks = 0;
2266 if (!pfrom->fClient &&
2267 (pfrom->nVersion < NOBLKS_VERSION_START ||
2268 pfrom->nVersion >= NOBLKS_VERSION_END) &&
2269 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2272 pfrom->PushGetBlocks(pindexBest, uint256(0));
2278 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2279 item.second.RelayTo(pfrom);
2282 pfrom->fSuccessfullyConnected = true;
2284 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2286 cPeerBlockCounts.input(pfrom->nStartingHeight);
2290 else if (pfrom->nVersion == 0)
2292 // Must have a version message before anything else
2293 pfrom->Misbehaving(1);
2298 else if (strCommand == "verack")
2300 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2304 else if (strCommand == "addr")
2306 vector<CAddress> vAddr;
2309 // Don't want addr from older versions unless seeding
2310 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
2312 if (vAddr.size() > 1000)
2314 pfrom->Misbehaving(20);
2315 return error("message addr size() = %d", vAddr.size());
2318 // Store the new addresses
2319 int64 nNow = GetAdjustedTime();
2320 int64 nSince = nNow - 10 * 60;
2321 BOOST_FOREACH(CAddress& addr, vAddr)
2325 // ignore IPv6 for now, since it isn't implemented anyway
2328 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2329 addr.nTime = nNow - 5 * 24 * 60 * 60;
2330 pfrom->AddAddressKnown(addr);
2331 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2333 // Relay to a limited number of other nodes
2336 // Use deterministic randomness to send to the same nodes for 24 hours
2337 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2338 static uint256 hashSalt;
2340 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2341 int64 hashAddr = addr.GetHash();
2342 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2343 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2344 multimap<uint256, CNode*> mapMix;
2345 BOOST_FOREACH(CNode* pnode, vNodes)
2347 if (pnode->nVersion < CADDR_TIME_VERSION)
2349 unsigned int nPointer;
2350 memcpy(&nPointer, &pnode, sizeof(nPointer));
2351 uint256 hashKey = hashRand ^ nPointer;
2352 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2353 mapMix.insert(make_pair(hashKey, pnode));
2355 int nRelayNodes = 2;
2356 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2357 ((*mi).second)->PushAddress(addr);
2361 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2362 if (vAddr.size() < 1000)
2363 pfrom->fGetAddr = false;
2367 else if (strCommand == "inv")
2371 if (vInv.size() > 50000)
2373 pfrom->Misbehaving(20);
2374 return error("message inv size() = %d", vInv.size());
2378 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
2380 const CInv &inv = vInv[nInv];
2384 pfrom->AddInventoryKnown(inv);
2386 bool fAlreadyHave = AlreadyHave(txdb, inv);
2388 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2390 // Always request the last block in an inv bundle (even if we already have it), as it is the
2391 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2392 // this is necessary to connect earlier received orphan blocks to the chain again.
2393 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2395 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2396 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2398 // Track requests for our stuff
2399 Inventory(inv.hash);
2404 else if (strCommand == "getdata")
2408 if (vInv.size() > 50000)
2410 pfrom->Misbehaving(20);
2411 return error("message getdata size() = %d", vInv.size());
2414 BOOST_FOREACH(const CInv& inv, vInv)
2418 printf("received getdata for: %s\n", inv.ToString().c_str());
2420 if (inv.type == MSG_BLOCK)
2422 // Send block from disk
2423 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2424 if (mi != mapBlockIndex.end())
2427 block.ReadFromDisk((*mi).second);
2428 pfrom->PushMessage("block", block);
2430 // Trigger them to send a getblocks request for the next batch of inventory
2431 if (inv.hash == pfrom->hashContinue)
2433 // Bypass PushInventory, this must send even if redundant,
2434 // and we want it right after the last block so they don't
2435 // wait for other stuff first.
2437 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2438 pfrom->PushMessage("inv", vInv);
2439 pfrom->hashContinue = 0;
2443 else if (inv.IsKnownType())
2445 // Send stream from relay memory
2448 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2449 if (mi != mapRelay.end())
2450 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2454 // Track requests for our stuff
2455 Inventory(inv.hash);
2460 else if (strCommand == "getblocks")
2462 CBlockLocator locator;
2464 vRecv >> locator >> hashStop;
2466 // Find the last block the caller has in the main chain
2467 CBlockIndex* pindex = locator.GetBlockIndex();
2469 // Send the rest of the chain
2471 pindex = pindex->pnext;
2472 int nLimit = 500 + locator.GetDistanceBack();
2473 unsigned int nBytes = 0;
2474 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2475 for (; pindex; pindex = pindex->pnext)
2477 if (pindex->GetBlockHash() == hashStop)
2479 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2482 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2484 block.ReadFromDisk(pindex, true);
2485 nBytes += block.GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
2486 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2488 // When this block is requested, we'll send an inv that'll make them
2489 // getblocks the next batch of inventory.
2490 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2491 pfrom->hashContinue = pindex->GetBlockHash();
2498 else if (strCommand == "getheaders")
2500 CBlockLocator locator;
2502 vRecv >> locator >> hashStop;
2504 CBlockIndex* pindex = NULL;
2505 if (locator.IsNull())
2507 // If locator is null, return the hashStop block
2508 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2509 if (mi == mapBlockIndex.end())
2511 pindex = (*mi).second;
2515 // Find the last block the caller has in the main chain
2516 pindex = locator.GetBlockIndex();
2518 pindex = pindex->pnext;
2521 vector<CBlock> vHeaders;
2523 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2524 for (; pindex; pindex = pindex->pnext)
2526 vHeaders.push_back(pindex->GetBlockHeader());
2527 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2530 pfrom->PushMessage("headers", vHeaders);
2534 else if (strCommand == "tx")
2536 vector<uint256> vWorkQueue;
2537 CDataStream vMsg(vRecv);
2542 CInv inv(MSG_TX, tx.GetHash());
2543 pfrom->AddInventoryKnown(inv);
2545 bool fMissingInputs = false;
2546 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2548 SyncWithWallets(tx, NULL, true);
2549 RelayMessage(inv, vMsg);
2550 mapAlreadyAskedFor.erase(inv);
2551 vWorkQueue.push_back(inv.hash);
2553 // Recursively process any orphan transactions that depended on this one
2554 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2556 uint256 hashPrev = vWorkQueue[i];
2557 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2558 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2561 const CDataStream& vMsg = *((*mi).second);
2563 CDataStream(vMsg) >> tx;
2564 CInv inv(MSG_TX, tx.GetHash());
2566 if (tx.AcceptToMemoryPool(txdb, true))
2568 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2569 SyncWithWallets(tx, NULL, true);
2570 RelayMessage(inv, vMsg);
2571 mapAlreadyAskedFor.erase(inv);
2572 vWorkQueue.push_back(inv.hash);
2577 BOOST_FOREACH(uint256 hash, vWorkQueue)
2578 EraseOrphanTx(hash);
2580 else if (fMissingInputs)
2582 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2585 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2586 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2588 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2590 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2594 else if (strCommand == "block")
2599 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2602 CInv inv(MSG_BLOCK, block.GetHash());
2603 pfrom->AddInventoryKnown(inv);
2605 if (ProcessBlock(pfrom, &block))
2606 mapAlreadyAskedFor.erase(inv);
2607 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2611 else if (strCommand == "getaddr")
2613 pfrom->vAddrToSend.clear();
2614 vector<CAddress> vAddr = addrman.GetAddr();
2615 BOOST_FOREACH(const CAddress &addr, vAddr)
2616 pfrom->PushAddress(addr);
2620 else if (strCommand == "checkorder")
2625 if (!GetBoolArg("-allowreceivebyip"))
2627 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2634 /// we have a chance to check the order here
2636 // Keep giving the same key to the same ip until they use it
2637 if (!mapReuseKey.count(pfrom->addr))
2638 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2640 // Send back approval of order and pubkey to use
2641 CScript scriptPubKey;
2642 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2643 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2647 else if (strCommand == "reply")
2652 CRequestTracker tracker;
2654 LOCK(pfrom->cs_mapRequests);
2655 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2656 if (mi != pfrom->mapRequests.end())
2658 tracker = (*mi).second;
2659 pfrom->mapRequests.erase(mi);
2662 if (!tracker.IsNull())
2663 tracker.fn(tracker.param1, vRecv);
2667 else if (strCommand == "ping")
2669 if (pfrom->nVersion > BIP0031_VERSION)
2673 // Echo the message back with the nonce. This allows for two useful features:
2675 // 1) A remote node can quickly check if the connection is operational
2676 // 2) Remote nodes can measure the latency of the network thread. If this node
2677 // is overloaded it won't respond to pings quickly and the remote node can
2678 // avoid sending us more work, like chain download requests.
2680 // The nonce stops the remote getting confused between different pings: without
2681 // it, if the remote node sends a ping once per second and this node takes 5
2682 // seconds to respond to each, the 5th ping the remote sends would appear to
2683 // return very quickly.
2684 pfrom->PushMessage("pong", nonce);
2689 else if (strCommand == "alert")
2694 if (alert.ProcessAlert())
2697 pfrom->setKnown.insert(alert.GetHash());
2700 BOOST_FOREACH(CNode* pnode, vNodes)
2701 alert.RelayTo(pnode);
2709 // Ignore unknown commands for extensibility
2713 // Update the last seen time for this node's address
2714 if (pfrom->fNetworkNode)
2715 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2716 AddressCurrentlyConnected(pfrom->addr);
2722 bool ProcessMessages(CNode* pfrom)
2724 CDataStream& vRecv = pfrom->vRecv;
2728 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2732 // (4) message start
2741 // Scan for message start
2742 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2743 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2744 if (vRecv.end() - pstart < nHeaderSize)
2746 if (vRecv.size() > nHeaderSize)
2748 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2749 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2753 if (pstart - vRecv.begin() > 0)
2754 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2755 vRecv.erase(vRecv.begin(), pstart);
2758 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2763 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2766 string strCommand = hdr.GetCommand();
2769 unsigned int nMessageSize = hdr.nMessageSize;
2770 if (nMessageSize > MAX_SIZE)
2772 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2775 if (nMessageSize > vRecv.size())
2777 // Rewind and wait for rest of message
2778 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2783 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2784 unsigned int nChecksum = 0;
2785 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2786 if (nChecksum != hdr.nChecksum)
2788 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2789 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2793 // Copy message to its own buffer
2794 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2795 vRecv.ignore(nMessageSize);
2803 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2808 catch (std::ios_base::failure& e)
2810 if (strstr(e.what(), "end of data"))
2812 // Allow exceptions from underlength message on vRecv
2813 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());
2815 else if (strstr(e.what(), "size too large"))
2817 // Allow exceptions from overlong size
2818 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2822 PrintExceptionContinue(&e, "ProcessMessage()");
2825 catch (std::exception& e) {
2826 PrintExceptionContinue(&e, "ProcessMessage()");
2828 PrintExceptionContinue(NULL, "ProcessMessage()");
2832 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2840 bool SendMessages(CNode* pto, bool fSendTrickle)
2842 TRY_LOCK(cs_main, lockMain);
2844 // Don't send anything until we get their version message
2845 if (pto->nVersion == 0)
2848 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
2850 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
2851 if (pto->nVersion > BIP0031_VERSION)
2852 pto->PushMessage("ping", 0);
2854 pto->PushMessage("ping");
2857 // Resend wallet transactions that haven't gotten in a block yet
2858 ResendWalletTransactions();
2860 // Address refresh broadcast
2861 static int64 nLastRebroadcast;
2862 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2866 BOOST_FOREACH(CNode* pnode, vNodes)
2868 // Periodically clear setAddrKnown to allow refresh broadcasts
2869 if (nLastRebroadcast)
2870 pnode->setAddrKnown.clear();
2872 // Rebroadcast our address
2873 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2875 CAddress addr(addrLocalHost);
2876 addr.nTime = GetAdjustedTime();
2877 pnode->PushAddress(addr);
2881 nLastRebroadcast = GetTime();
2889 vector<CAddress> vAddr;
2890 vAddr.reserve(pto->vAddrToSend.size());
2891 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2893 // returns true if wasn't already contained in the set
2894 if (pto->setAddrKnown.insert(addr).second)
2896 vAddr.push_back(addr);
2897 // receiver rejects addr messages larger than 1000
2898 if (vAddr.size() >= 1000)
2900 pto->PushMessage("addr", vAddr);
2905 pto->vAddrToSend.clear();
2907 pto->PushMessage("addr", vAddr);
2912 // Message: inventory
2915 vector<CInv> vInvWait;
2917 LOCK(pto->cs_inventory);
2918 vInv.reserve(pto->vInventoryToSend.size());
2919 vInvWait.reserve(pto->vInventoryToSend.size());
2920 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2922 if (pto->setInventoryKnown.count(inv))
2925 // trickle out tx inv to protect privacy
2926 if (inv.type == MSG_TX && !fSendTrickle)
2928 // 1/4 of tx invs blast to all immediately
2929 static uint256 hashSalt;
2931 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2932 uint256 hashRand = inv.hash ^ hashSalt;
2933 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2934 bool fTrickleWait = ((hashRand & 3) != 0);
2936 // always trickle our own transactions
2940 if (GetTransaction(inv.hash, wtx))
2942 fTrickleWait = true;
2947 vInvWait.push_back(inv);
2952 // returns true if wasn't already contained in the set
2953 if (pto->setInventoryKnown.insert(inv).second)
2955 vInv.push_back(inv);
2956 if (vInv.size() >= 1000)
2958 pto->PushMessage("inv", vInv);
2963 pto->vInventoryToSend = vInvWait;
2966 pto->PushMessage("inv", vInv);
2972 vector<CInv> vGetData;
2973 int64 nNow = GetTime() * 1000000;
2975 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2977 const CInv& inv = (*pto->mapAskFor.begin()).second;
2978 if (!AlreadyHave(txdb, inv))
2980 printf("sending getdata: %s\n", inv.ToString().c_str());
2981 vGetData.push_back(inv);
2982 if (vGetData.size() >= 1000)
2984 pto->PushMessage("getdata", vGetData);
2988 mapAlreadyAskedFor[inv] = nNow;
2989 pto->mapAskFor.erase(pto->mapAskFor.begin());
2991 if (!vGetData.empty())
2992 pto->PushMessage("getdata", vGetData);
3011 //////////////////////////////////////////////////////////////////////////////
3016 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3018 unsigned char* pdata = (unsigned char*)pbuffer;
3019 unsigned int blocks = 1 + ((len + 8) / 64);
3020 unsigned char* pend = pdata + 64 * blocks;
3021 memset(pdata + len, 0, 64 * blocks - len);
3023 unsigned int bits = len * 8;
3024 pend[-1] = (bits >> 0) & 0xff;
3025 pend[-2] = (bits >> 8) & 0xff;
3026 pend[-3] = (bits >> 16) & 0xff;
3027 pend[-4] = (bits >> 24) & 0xff;
3031 static const unsigned int pSHA256InitState[8] =
3032 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3034 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3037 unsigned char data[64];
3041 for (int i = 0; i < 16; i++)
3042 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3044 for (int i = 0; i < 8; i++)
3045 ctx.h[i] = ((uint32_t*)pinit)[i];
3047 SHA256_Update(&ctx, data, sizeof(data));
3048 for (int i = 0; i < 8; i++)
3049 ((uint32_t*)pstate)[i] = ctx.h[i];
3053 // ScanHash scans nonces looking for a hash with at least some zero bits.
3054 // It operates on big endian data. Caller does the byte reversing.
3055 // All input buffers are 16-byte aligned. nNonce is usually preserved
3056 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3057 // the block is rebuilt and nNonce starts over at zero.
3059 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3061 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3065 // Hash pdata using pmidstate as the starting state into
3066 // preformatted buffer phash1, then hash phash1 into phash
3068 SHA256Transform(phash1, pdata, pmidstate);
3069 SHA256Transform(phash, phash1, pSHA256InitState);
3071 // Return the nonce if the hash has at least some zero bits,
3072 // caller will check if it has enough to reach the target
3073 if (((unsigned short*)phash)[14] == 0)
3076 // If nothing found after trying for a while, return -1
3077 if ((nNonce & 0xffff) == 0)
3079 nHashesDone = 0xffff+1;
3085 // Some explaining would be appreciated
3090 set<uint256> setDependsOn;
3093 COrphan(CTransaction* ptxIn)
3101 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3102 BOOST_FOREACH(uint256 hash, setDependsOn)
3103 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3108 uint64 nLastBlockTx = 0;
3109 uint64 nLastBlockSize = 0;
3111 CBlock* CreateNewBlock(CReserveKey& reservekey)
3113 CBlockIndex* pindexPrev = pindexBest;
3116 auto_ptr<CBlock> pblock(new CBlock());
3120 // Create coinbase tx
3122 txNew.vin.resize(1);
3123 txNew.vin[0].prevout.SetNull();
3124 txNew.vout.resize(1);
3125 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3127 // Add our coinbase tx as first transaction
3128 pblock->vtx.push_back(txNew);
3130 // Collect memory pool transactions into the block
3133 LOCK2(cs_main, mempool.cs);
3136 // Priority order to process transactions
3137 list<COrphan> vOrphan; // list memory doesn't move
3138 map<uint256, vector<COrphan*> > mapDependers;
3139 multimap<double, CTransaction*> mapPriority;
3140 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
3142 CTransaction& tx = (*mi).second;
3143 if (tx.IsCoinBase() || !tx.IsFinal())
3146 COrphan* porphan = NULL;
3147 double dPriority = 0;
3148 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3150 // Read prev transaction
3151 CTransaction txPrev;
3153 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3155 // Has to wait for dependencies
3158 // Use list for automatic deletion
3159 vOrphan.push_back(COrphan(&tx));
3160 porphan = &vOrphan.back();
3162 mapDependers[txin.prevout.hash].push_back(porphan);
3163 porphan->setDependsOn.insert(txin.prevout.hash);
3166 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3168 // Read block header
3169 int nConf = txindex.GetDepthInMainChain();
3171 dPriority += (double)nValueIn * nConf;
3173 if (fDebug && GetBoolArg("-printpriority"))
3174 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3177 // Priority is sum(valuein * age) / txsize
3178 dPriority /= ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3181 porphan->dPriority = dPriority;
3183 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3185 if (fDebug && GetBoolArg("-printpriority"))
3187 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3194 // Collect transactions into block
3195 map<uint256, CTxIndex> mapTestPool;
3196 uint64 nBlockSize = 1000;
3197 uint64 nBlockTx = 0;
3198 int nBlockSigOps = 100;
3199 while (!mapPriority.empty())
3201 // Take highest priority transaction off priority queue
3202 double dPriority = -(*mapPriority.begin()).first;
3203 CTransaction& tx = *(*mapPriority.begin()).second;
3204 mapPriority.erase(mapPriority.begin());
3207 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3208 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3211 // Legacy limits on sigOps:
3212 int nTxSigOps = tx.GetLegacySigOpCount();
3213 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3216 // Transaction fee required depends on block size
3217 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3218 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3220 // Connecting shouldn't fail due to dependency on other memory pool transactions
3221 // because we're already processing them in order of dependency
3222 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3223 MapPrevTx mapInputs;
3225 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3228 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3229 if (nTxFees < nMinFee)
3232 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3233 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3236 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3238 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3239 swap(mapTestPool, mapTestPoolTmp);
3242 pblock->vtx.push_back(tx);
3243 nBlockSize += nTxSize;
3245 nBlockSigOps += nTxSigOps;
3248 // Add transactions that depend on this one to the priority queue
3249 uint256 hash = tx.GetHash();
3250 if (mapDependers.count(hash))
3252 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3254 if (!porphan->setDependsOn.empty())
3256 porphan->setDependsOn.erase(hash);
3257 if (porphan->setDependsOn.empty())
3258 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3264 nLastBlockTx = nBlockTx;
3265 nLastBlockSize = nBlockSize;
3266 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3269 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3272 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3273 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3274 pblock->UpdateTime(pindexPrev);
3275 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3278 return pblock.release();
3282 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3284 // Update nExtraNonce
3285 static uint256 hashPrevBlock;
3286 if (hashPrevBlock != pblock->hashPrevBlock)
3289 hashPrevBlock = pblock->hashPrevBlock;
3292 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3293 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3295 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3299 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3302 // Prebuild hash buffers
3309 uint256 hashPrevBlock;
3310 uint256 hashMerkleRoot;
3313 unsigned int nNonce;
3316 unsigned char pchPadding0[64];
3318 unsigned char pchPadding1[64];
3321 memset(&tmp, 0, sizeof(tmp));
3323 tmp.block.nVersion = pblock->nVersion;
3324 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3325 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3326 tmp.block.nTime = pblock->nTime;
3327 tmp.block.nBits = pblock->nBits;
3328 tmp.block.nNonce = pblock->nNonce;
3330 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3331 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3333 // Byte swap all the input buffer
3334 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
3335 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3337 // Precalc the first half of the first hash, which stays constant
3338 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3340 memcpy(pdata, &tmp.block, 128);
3341 memcpy(phash1, &tmp.hash1, 64);
3345 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3347 uint256 hash = pblock->GetHash();
3348 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3350 if (hash > hashTarget)
3354 printf("BitcoinMiner:\n");
3355 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3357 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3358 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3363 if (pblock->hashPrevBlock != hashBestChain)
3364 return error("BitcoinMiner : generated block is stale");
3366 // Remove key from key pool
3367 reservekey.KeepKey();
3369 // Track how many getdata requests this block gets
3371 LOCK(wallet.cs_wallet);
3372 wallet.mapRequestCount[pblock->GetHash()] = 0;
3375 // Process this block the same as if we had received it from another node
3376 if (!ProcessBlock(NULL, pblock))
3377 return error("BitcoinMiner : ProcessBlock, block not accepted");
3383 void static ThreadBitcoinMiner(void* parg);
3385 static bool fGenerateBitcoins = false;
3386 static bool fLimitProcessors = false;
3387 static int nLimitProcessors = -1;
3389 void static BitcoinMiner(CWallet *pwallet)
3391 printf("BitcoinMiner started\n");
3392 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3394 // Each thread has its own key and counter
3395 CReserveKey reservekey(pwallet);
3396 unsigned int nExtraNonce = 0;
3398 while (fGenerateBitcoins)
3402 while (vNodes.empty() || IsInitialBlockDownload())
3407 if (!fGenerateBitcoins)
3415 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3416 CBlockIndex* pindexPrev = pindexBest;
3418 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3421 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3423 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3427 // Prebuild hash buffers
3429 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3430 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3431 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3433 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3435 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3436 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3437 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3443 int64 nStart = GetTime();
3444 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3446 uint256& hash = *alignup<16>(hashbuf);
3449 unsigned int nHashesDone = 0;
3450 unsigned int nNonceFound;
3453 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3454 (char*)&hash, nHashesDone);
3456 // Check if something found
3457 if (nNonceFound != -1)
3459 for (unsigned int i = 0; i < sizeof(hash)/4; i++)
3460 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3462 if (hash <= hashTarget)
3465 pblock->nNonce = ByteReverse(nNonceFound);
3466 assert(hash == pblock->GetHash());
3468 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3469 CheckWork(pblock.get(), *pwalletMain, reservekey);
3470 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3476 static int64 nHashCounter;
3477 if (nHPSTimerStart == 0)
3479 nHPSTimerStart = GetTimeMillis();
3483 nHashCounter += nHashesDone;
3484 if (GetTimeMillis() - nHPSTimerStart > 4000)
3486 static CCriticalSection cs;
3489 if (GetTimeMillis() - nHPSTimerStart > 4000)
3491 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3492 nHPSTimerStart = GetTimeMillis();
3494 static int64 nLogTime;
3495 if (GetTime() - nLogTime > 30 * 60)
3497 nLogTime = GetTime();
3498 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3499 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3505 // Check for stop or if block needs to be rebuilt
3508 if (!fGenerateBitcoins)
3510 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3514 if (nBlockNonce >= 0xffff0000)
3516 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3518 if (pindexPrev != pindexBest)
3521 // Update nTime every few seconds
3522 pblock->UpdateTime(pindexPrev);
3523 nBlockTime = ByteReverse(pblock->nTime);
3526 // Changing pblock->nTime can change work required on testnet:
3527 nBlockBits = ByteReverse(pblock->nBits);
3528 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3534 void static ThreadBitcoinMiner(void* parg)
3536 CWallet* pwallet = (CWallet*)parg;
3539 vnThreadsRunning[THREAD_MINER]++;
3540 BitcoinMiner(pwallet);
3541 vnThreadsRunning[THREAD_MINER]--;
3543 catch (std::exception& e) {
3544 vnThreadsRunning[THREAD_MINER]--;
3545 PrintException(&e, "ThreadBitcoinMiner()");
3547 vnThreadsRunning[THREAD_MINER]--;
3548 PrintException(NULL, "ThreadBitcoinMiner()");
3551 if (vnThreadsRunning[THREAD_MINER] == 0)
3553 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3557 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3559 fGenerateBitcoins = fGenerate;
3560 nLimitProcessors = GetArg("-genproclimit", -1);
3561 if (nLimitProcessors == 0)
3562 fGenerateBitcoins = false;
3563 fLimitProcessors = (nLimitProcessors != -1);
3567 int nProcessors = boost::thread::hardware_concurrency();
3568 printf("%d processors\n", nProcessors);
3569 if (nProcessors < 1)
3571 if (fLimitProcessors && nProcessors > nLimitProcessors)
3572 nProcessors = nLimitProcessors;
3573 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3574 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3575 for (int i = 0; i < nAddThreads; i++)
3577 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3578 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");