1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include <boost/algorithm/string/replace.hpp>
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 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 (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) > 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 CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
455 *pfMissingInputs = false;
457 if (!CheckTransaction())
458 return error("AcceptToMemoryPool() : CheckTransaction failed");
460 // Coinbase is only valid in a block, not as a loose transaction
462 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
464 // To help v0.1.5 clients who would see it as a negative number
465 if ((int64)nLockTime > std::numeric_limits<int>::max())
466 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
468 // Rather not work on nonstandard transactions (unless -testnet)
469 if (!fTestNet && !IsStandard())
470 return error("AcceptToMemoryPool() : nonstandard transaction type");
472 // Do we already have it?
473 uint256 hash = GetHash();
476 if (mempool.mapTx.count(hash))
480 if (txdb.ContainsTx(hash))
483 // Check for conflicts with in-memory transactions
484 CTransaction* ptxOld = NULL;
485 for (int i = 0; i < vin.size(); i++)
487 COutPoint outpoint = vin[i].prevout;
488 if (mempool.mapNextTx.count(outpoint))
490 // Disable replacement feature for now
493 // Allow replacing with a newer version of the same transaction
496 ptxOld = mempool.mapNextTx[outpoint].ptx;
497 if (ptxOld->IsFinal())
499 if (!IsNewerThan(*ptxOld))
501 for (int i = 0; i < vin.size(); i++)
503 COutPoint outpoint = vin[i].prevout;
504 if (!mempool.mapNextTx.count(outpoint) || mempool.mapNextTx[outpoint].ptx != ptxOld)
514 map<uint256, CTxIndex> mapUnused;
515 bool fInvalid = false;
516 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
519 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
521 *pfMissingInputs = true;
522 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
525 // Check for non-standard pay-to-script-hash in inputs
526 if (!AreInputsStandard(mapInputs) && !fTestNet)
527 return error("AcceptToMemoryPool() : nonstandard transaction input");
529 // Note: if you modify this code to accept non-standard transactions, then
530 // you should add code here to check that the transaction does a
531 // reasonable number of ECDSA signature verifications.
533 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
534 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
536 // Don't accept it if it can't get into a block
537 if (nFees < GetMinFee(1000, true, GMF_RELAY))
538 return error("AcceptToMemoryPool() : not enough fees");
540 // Continuously rate-limit free transactions
541 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
542 // be annoying or make other's transactions take longer to confirm.
543 if (nFees < MIN_RELAY_TX_FEE)
545 static CCriticalSection cs;
546 static double dFreeCount;
547 static int64 nLastTime;
548 int64 nNow = GetTime();
552 // Use an exponentially decaying ~10-minute window:
553 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
555 // -limitfreerelay unit is thousand-bytes-per-minute
556 // At default rate it would take over a month to fill 1GB
557 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
558 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
560 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
565 // Check against previous transactions
566 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
567 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
569 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
573 // Store transaction in memory
578 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
579 mempool.remove(*ptxOld);
581 mempool.addUnchecked(*this);
584 ///// are we sure this is ok when loading transactions or restoring block txes
585 // If updated, erase old tx from wallet
587 EraseFromWallets(ptxOld->GetHash());
589 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
593 bool CTxMemPool::addUnchecked(CTransaction &tx)
595 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTx.size());
596 // Add to memory pool without checking anything. Don't call this directly,
597 // call AcceptToMemoryPool to properly check the transaction first.
600 uint256 hash = tx.GetHash();
602 for (int i = 0; i < tx.vin.size(); i++)
603 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
604 nTransactionsUpdated++;
610 bool CTxMemPool::remove(CTransaction &tx)
612 // Remove transaction from memory pool
615 uint256 hash = tx.GetHash();
616 if (mapTx.count(hash))
618 BOOST_FOREACH(const CTxIn& txin, tx.vin)
619 mapNextTx.erase(txin.prevout);
621 nTransactionsUpdated++;
632 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
634 if (hashBlock == 0 || nIndex == -1)
637 // Find the block it claims to be in
638 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
639 if (mi == mapBlockIndex.end())
641 CBlockIndex* pindex = (*mi).second;
642 if (!pindex || !pindex->IsInMainChain())
645 // Make sure the merkle branch connects to this block
646 if (!fMerkleVerified)
648 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
650 fMerkleVerified = true;
654 return pindexBest->nHeight - pindex->nHeight + 1;
658 int CMerkleTx::GetBlocksToMaturity() const
662 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
666 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
670 if (!IsInMainChain() && !ClientConnectInputs())
672 return CTransaction::AcceptToMemoryPool(txdb, false);
676 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
680 bool CMerkleTx::AcceptToMemoryPool()
683 return AcceptToMemoryPool(txdb);
688 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
693 // Add previous supporting transactions first
694 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
696 if (!tx.IsCoinBase())
698 uint256 hash = tx.GetHash();
699 if (!mempool.mapTx.count(hash) && !txdb.ContainsTx(hash))
700 tx.AcceptToMemoryPool(txdb, fCheckInputs);
703 return AcceptToMemoryPool(txdb, fCheckInputs);
708 bool CWalletTx::AcceptWalletTransaction()
711 return AcceptWalletTransaction(txdb);
714 int CTxIndex::GetDepthInMainChain() const
718 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
720 // Find the block in the index
721 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
722 if (mi == mapBlockIndex.end())
724 CBlockIndex* pindex = (*mi).second;
725 if (!pindex || !pindex->IsInMainChain())
727 return 1 + nBestHeight - pindex->nHeight;
739 //////////////////////////////////////////////////////////////////////////////
741 // CBlock and CBlockIndex
744 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
746 if (!fReadTransactions)
748 *this = pindex->GetBlockHeader();
751 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
753 if (GetHash() != pindex->GetBlockHash())
754 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
758 uint256 static GetOrphanRoot(const CBlock* pblock)
760 // Work back to the first block in the orphan chain
761 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
762 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
763 return pblock->GetHash();
766 int64 static GetBlockValue(int nHeight, int64 nFees)
768 int64 nSubsidy = 50 * COIN;
770 // Subsidy is cut in half every 4 years
771 nSubsidy >>= (nHeight / 210000);
773 return nSubsidy + nFees;
776 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
777 static const int64 nTargetSpacing = 10 * 60;
778 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
781 // minimum amount of work that could possibly be required nTime after
782 // minimum work required was nBase
784 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
786 // Testnet has min-difficulty blocks
787 // after nTargetSpacing*2 time between blocks:
788 if (fTestNet && nTime > nTargetSpacing*2)
789 return bnProofOfWorkLimit.GetCompact();
792 bnResult.SetCompact(nBase);
793 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
795 // Maximum 400% adjustment...
797 // ... in best-case exactly 4-times-normal target time
798 nTime -= nTargetTimespan*4;
800 if (bnResult > bnProofOfWorkLimit)
801 bnResult = bnProofOfWorkLimit;
802 return bnResult.GetCompact();
805 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
807 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
810 if (pindexLast == NULL)
811 return nProofOfWorkLimit;
813 // Only change once per interval
814 if ((pindexLast->nHeight+1) % nInterval != 0)
816 // Special rules for testnet after 15 Feb 2012:
817 if (fTestNet && pblock->nTime > 1329264000)
819 // If the new block's timestamp is more than 2* 10 minutes
820 // then allow mining of a min-difficulty block.
821 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
822 return nProofOfWorkLimit;
825 // Return the last non-special-min-difficulty-rules-block
826 const CBlockIndex* pindex = pindexLast;
827 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
828 pindex = pindex->pprev;
829 return pindex->nBits;
833 return pindexLast->nBits;
836 // Go back by what we want to be 14 days worth of blocks
837 const CBlockIndex* pindexFirst = pindexLast;
838 for (int i = 0; pindexFirst && i < nInterval-1; i++)
839 pindexFirst = pindexFirst->pprev;
842 // Limit adjustment step
843 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
844 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
845 if (nActualTimespan < nTargetTimespan/4)
846 nActualTimespan = nTargetTimespan/4;
847 if (nActualTimespan > nTargetTimespan*4)
848 nActualTimespan = nTargetTimespan*4;
852 bnNew.SetCompact(pindexLast->nBits);
853 bnNew *= nActualTimespan;
854 bnNew /= nTargetTimespan;
856 if (bnNew > bnProofOfWorkLimit)
857 bnNew = bnProofOfWorkLimit;
860 printf("GetNextWorkRequired RETARGET\n");
861 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
862 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
863 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
865 return bnNew.GetCompact();
868 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
871 bnTarget.SetCompact(nBits);
874 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
875 return error("CheckProofOfWork() : nBits below minimum work");
877 // Check proof of work matches claimed amount
878 if (hash > bnTarget.getuint256())
879 return error("CheckProofOfWork() : hash doesn't match nBits");
884 // Return maximum amount of blocks that other nodes claim to have
885 int GetNumBlocksOfPeers()
887 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
890 bool IsInitialBlockDownload()
892 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
894 static int64 nLastUpdate;
895 static CBlockIndex* pindexLastBest;
896 if (pindexBest != pindexLastBest)
898 pindexLastBest = pindexBest;
899 nLastUpdate = GetTime();
901 return (GetTime() - nLastUpdate < 10 &&
902 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
905 void static InvalidChainFound(CBlockIndex* pindexNew)
907 if (pindexNew->bnChainWork > bnBestInvalidWork)
909 bnBestInvalidWork = pindexNew->bnChainWork;
910 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
913 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());
914 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
915 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
916 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
919 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
921 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
923 // Updating time can change work required on testnet:
925 nBits = GetNextWorkRequired(pindexPrev, this);
938 bool CTransaction::DisconnectInputs(CTxDB& txdb)
940 // Relinquish previous transactions' spent pointers
943 BOOST_FOREACH(const CTxIn& txin, vin)
945 COutPoint prevout = txin.prevout;
947 // Get prev txindex from disk
949 if (!txdb.ReadTxIndex(prevout.hash, txindex))
950 return error("DisconnectInputs() : ReadTxIndex failed");
952 if (prevout.n >= txindex.vSpent.size())
953 return error("DisconnectInputs() : prevout.n out of range");
955 // Mark outpoint as not spent
956 txindex.vSpent[prevout.n].SetNull();
959 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
960 return error("DisconnectInputs() : UpdateTxIndex failed");
964 // Remove transaction from index
965 // This can fail if a duplicate of this transaction was in a chain that got
966 // reorganized away. This is only possible if this transaction was completely
967 // spent, so erasing it would be a no-op anway.
968 txdb.EraseTxIndex(*this);
974 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
975 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
977 // FetchInputs can return false either because we just haven't seen some inputs
978 // (in which case the transaction should be stored as an orphan)
979 // or because the transaction is malformed (in which case the transaction should
980 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
984 return true; // Coinbase transactions have no inputs to fetch.
986 for (int i = 0; i < vin.size(); i++)
988 COutPoint prevout = vin[i].prevout;
989 if (inputsRet.count(prevout.hash))
990 continue; // Got it already
993 CTxIndex& txindex = inputsRet[prevout.hash].first;
995 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
997 // Get txindex from current proposed changes
998 txindex = mapTestPool.find(prevout.hash)->second;
1002 // Read txindex from txdb
1003 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1005 if (!fFound && (fBlock || fMiner))
1006 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());
1009 CTransaction& txPrev = inputsRet[prevout.hash].second;
1010 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1012 // Get prev tx from single transactions in memory
1015 if (!mempool.mapTx.count(prevout.hash))
1016 return error("FetchInputs() : %s mempool.mapTx prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1017 txPrev = mempool.mapTx[prevout.hash];
1020 txindex.vSpent.resize(txPrev.vout.size());
1024 // Get prev tx from disk
1025 if (!txPrev.ReadFromDisk(txindex.pos))
1026 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1030 // Make sure all prevout.n's are valid:
1031 for (int i = 0; i < vin.size(); i++)
1033 const COutPoint prevout = vin[i].prevout;
1034 assert(inputsRet.count(prevout.hash) != 0);
1035 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1036 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1037 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1039 // Revisit this if/when transaction replacement is implemented and allows
1042 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()));
1049 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1051 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1052 if (mi == inputs.end())
1053 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1055 const CTransaction& txPrev = (mi->second).second;
1056 if (input.prevout.n >= txPrev.vout.size())
1057 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1059 return txPrev.vout[input.prevout.n];
1062 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1068 for (int i = 0; i < vin.size(); i++)
1070 nResult += GetOutputFor(vin[i], inputs).nValue;
1076 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1082 for (int i = 0; i < vin.size(); i++)
1084 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1085 if (prevout.scriptPubKey.IsPayToScriptHash())
1086 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1091 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1092 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1093 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1095 // Take over previous transactions' spent pointers
1096 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1097 // fMiner is true when called from the internal bitcoin miner
1098 // ... both are false when called from CTransaction::AcceptToMemoryPool
1103 for (int i = 0; i < vin.size(); i++)
1105 COutPoint prevout = vin[i].prevout;
1106 assert(inputs.count(prevout.hash) > 0);
1107 CTxIndex& txindex = inputs[prevout.hash].first;
1108 CTransaction& txPrev = inputs[prevout.hash].second;
1110 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1111 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()));
1113 // If prev is coinbase, check that it's matured
1114 if (txPrev.IsCoinBase())
1115 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1116 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1117 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1119 // Check for conflicts (double-spend)
1120 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1121 // for an attacker to attempt to split the network.
1122 if (!txindex.vSpent[prevout.n].IsNull())
1123 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());
1125 // Check for negative or overflow input values
1126 nValueIn += txPrev.vout[prevout.n].nValue;
1127 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1128 return DoS(100, error("ConnectInputs() : txin values out of range"));
1130 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1131 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1132 // still computed and checked, and any change will be caught at the next checkpoint.
1133 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1136 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1138 // only during transition phase for P2SH: do not invoke anti-DoS code for
1139 // potentially old clients relaying bad P2SH transactions
1140 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1141 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1143 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1147 // Mark outpoints as spent
1148 txindex.vSpent[prevout.n] = posThisTx;
1151 if (fBlock || fMiner)
1153 mapTestPool[prevout.hash] = txindex;
1157 if (nValueIn < GetValueOut())
1158 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1160 // Tally transaction fees
1161 int64 nTxFee = nValueIn - GetValueOut();
1163 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1165 if (!MoneyRange(nFees))
1166 return DoS(100, error("ConnectInputs() : nFees out of range"));
1173 bool CTransaction::ClientConnectInputs()
1178 // Take over previous transactions' spent pointers
1182 for (int i = 0; i < vin.size(); i++)
1184 // Get prev tx from single transactions in memory
1185 COutPoint prevout = vin[i].prevout;
1186 if (!mempool.mapTx.count(prevout.hash))
1188 CTransaction& txPrev = mempool.mapTx[prevout.hash];
1190 if (prevout.n >= txPrev.vout.size())
1194 if (!VerifySignature(txPrev, *this, i, true, 0))
1195 return error("ConnectInputs() : VerifySignature failed");
1197 ///// this is redundant with the mempool.mapNextTx stuff,
1198 ///// not sure which I want to get rid of
1199 ///// this has to go away now that posNext is gone
1200 // // Check for conflicts
1201 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1202 // return error("ConnectInputs() : prev tx already used");
1204 // // Flag outpoints as used
1205 // txPrev.vout[prevout.n].posNext = posThisTx;
1207 nValueIn += txPrev.vout[prevout.n].nValue;
1209 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1210 return error("ClientConnectInputs() : txin values out of range");
1212 if (GetValueOut() > nValueIn)
1222 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1224 // Disconnect in reverse order
1225 for (int i = vtx.size()-1; i >= 0; i--)
1226 if (!vtx[i].DisconnectInputs(txdb))
1229 // Update block index on disk without changing it in memory.
1230 // The memory index structure will be changed after the db commits.
1233 CDiskBlockIndex blockindexPrev(pindex->pprev);
1234 blockindexPrev.hashNext = 0;
1235 if (!txdb.WriteBlockIndex(blockindexPrev))
1236 return error("DisconnectBlock() : WriteBlockIndex failed");
1242 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1244 // Check it again in case a previous version let a bad block in
1248 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1249 // unless those are already completely spent.
1250 // If such overwrites are allowed, coinbases and transactions depending upon those
1251 // can be duplicated to remove the ability to spend the first instance -- even after
1252 // being sent to another address.
1253 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1254 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1255 // already refuses previously-known transaction id's entirely.
1256 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1257 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1258 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1260 BOOST_FOREACH(CTransaction& tx, vtx)
1262 CTxIndex txindexOld;
1263 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1265 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1272 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1273 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1274 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1276 //// issue here: it doesn't know the version
1277 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1279 map<uint256, CTxIndex> mapQueuedChanges;
1282 BOOST_FOREACH(CTransaction& tx, vtx)
1284 nSigOps += tx.GetLegacySigOpCount();
1285 if (nSigOps > MAX_BLOCK_SIGOPS)
1286 return DoS(100, error("ConnectBlock() : too many sigops"));
1288 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1289 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1291 MapPrevTx mapInputs;
1292 if (!tx.IsCoinBase())
1295 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1298 if (fStrictPayToScriptHash)
1300 // Add in sigops done by pay-to-script-hash inputs;
1301 // this is to prevent a "rogue miner" from creating
1302 // an incredibly-expensive-to-validate block.
1303 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1304 if (nSigOps > MAX_BLOCK_SIGOPS)
1305 return DoS(100, error("ConnectBlock() : too many sigops"));
1308 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1310 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1314 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1317 // Write queued txindex changes
1318 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1320 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1321 return error("ConnectBlock() : UpdateTxIndex failed");
1324 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1327 // Update block index on disk without changing it in memory.
1328 // The memory index structure will be changed after the db commits.
1331 CDiskBlockIndex blockindexPrev(pindex->pprev);
1332 blockindexPrev.hashNext = pindex->GetBlockHash();
1333 if (!txdb.WriteBlockIndex(blockindexPrev))
1334 return error("ConnectBlock() : WriteBlockIndex failed");
1337 // Watch for transactions paying to me
1338 BOOST_FOREACH(CTransaction& tx, vtx)
1339 SyncWithWallets(tx, this, true);
1344 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1346 printf("REORGANIZE\n");
1349 CBlockIndex* pfork = pindexBest;
1350 CBlockIndex* plonger = pindexNew;
1351 while (pfork != plonger)
1353 while (plonger->nHeight > pfork->nHeight)
1354 if (!(plonger = plonger->pprev))
1355 return error("Reorganize() : plonger->pprev is null");
1356 if (pfork == plonger)
1358 if (!(pfork = pfork->pprev))
1359 return error("Reorganize() : pfork->pprev is null");
1362 // List of what to disconnect
1363 vector<CBlockIndex*> vDisconnect;
1364 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1365 vDisconnect.push_back(pindex);
1367 // List of what to connect
1368 vector<CBlockIndex*> vConnect;
1369 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1370 vConnect.push_back(pindex);
1371 reverse(vConnect.begin(), vConnect.end());
1373 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());
1374 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());
1376 // Disconnect shorter branch
1377 vector<CTransaction> vResurrect;
1378 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1381 if (!block.ReadFromDisk(pindex))
1382 return error("Reorganize() : ReadFromDisk for disconnect failed");
1383 if (!block.DisconnectBlock(txdb, pindex))
1384 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1386 // Queue memory transactions to resurrect
1387 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1388 if (!tx.IsCoinBase())
1389 vResurrect.push_back(tx);
1392 // Connect longer branch
1393 vector<CTransaction> vDelete;
1394 for (int i = 0; i < vConnect.size(); i++)
1396 CBlockIndex* pindex = vConnect[i];
1398 if (!block.ReadFromDisk(pindex))
1399 return error("Reorganize() : ReadFromDisk for connect failed");
1400 if (!block.ConnectBlock(txdb, pindex))
1404 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1407 // Queue memory transactions to delete
1408 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1409 vDelete.push_back(tx);
1411 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1412 return error("Reorganize() : WriteHashBestChain failed");
1414 // Make sure it's successfully written to disk before changing memory structure
1415 if (!txdb.TxnCommit())
1416 return error("Reorganize() : TxnCommit failed");
1418 // Disconnect shorter branch
1419 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1421 pindex->pprev->pnext = NULL;
1423 // Connect longer branch
1424 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1426 pindex->pprev->pnext = pindex;
1428 // Resurrect memory transactions that were in the disconnected branch
1429 BOOST_FOREACH(CTransaction& tx, vResurrect)
1430 tx.AcceptToMemoryPool(txdb, false);
1432 // Delete redundant memory transactions that are in the connected branch
1433 BOOST_FOREACH(CTransaction& tx, vDelete)
1436 printf("REORGANIZE: done\n");
1443 runCommand(std::string strCommand)
1445 int nErr = ::system(strCommand.c_str());
1447 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1450 // Called from inside SetBestChain: attaches a block to the new best chain being built
1451 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1453 uint256 hash = GetHash();
1455 // Adding to current best branch
1456 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1459 InvalidChainFound(pindexNew);
1462 if (!txdb.TxnCommit())
1463 return error("SetBestChain() : TxnCommit failed");
1465 // Add to current best branch
1466 pindexNew->pprev->pnext = pindexNew;
1468 // Delete redundant memory transactions
1469 BOOST_FOREACH(CTransaction& tx, vtx)
1475 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1477 uint256 hash = GetHash();
1480 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1482 txdb.WriteHashBestChain(hash);
1483 if (!txdb.TxnCommit())
1484 return error("SetBestChain() : TxnCommit failed");
1485 pindexGenesisBlock = pindexNew;
1487 else if (hashPrevBlock == hashBestChain)
1489 if (!SetBestChainInner(txdb, pindexNew))
1490 return error("SetBestChain() : SetBestChainInner failed");
1494 // the first block in the new chain that will cause it to become the new best chain
1495 CBlockIndex *pindexIntermediate = pindexNew;
1497 // list of blocks that need to be connected afterwards
1498 std::vector<CBlockIndex*> vpindexSecondary;
1500 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1501 // Try to limit how much needs to be done inside
1502 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1504 vpindexSecondary.push_back(pindexIntermediate);
1505 pindexIntermediate = pindexIntermediate->pprev;
1508 if (!vpindexSecondary.empty())
1509 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1511 // Switch to new best branch
1512 if (!Reorganize(txdb, pindexIntermediate))
1515 InvalidChainFound(pindexNew);
1516 return error("SetBestChain() : Reorganize failed");
1519 // Connect futher blocks
1520 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1523 if (!block.ReadFromDisk(pindex))
1525 printf("SetBestChain() : ReadFromDisk failed\n");
1529 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1530 if (!block.SetBestChainInner(txdb, pindex))
1535 // Update best block in wallet (so we can detect restored wallets)
1536 bool fIsInitialDownload = IsInitialBlockDownload();
1537 if (!fIsInitialDownload)
1539 const CBlockLocator locator(pindexNew);
1540 ::SetBestChain(locator);
1544 hashBestChain = hash;
1545 pindexBest = pindexNew;
1546 nBestHeight = pindexBest->nHeight;
1547 bnBestChainWork = pindexNew->bnChainWork;
1548 nTimeBestReceived = GetTime();
1549 nTransactionsUpdated++;
1550 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1552 std::string strCmd = GetArg("-blocknotify", "");
1554 if (!fIsInitialDownload && !strCmd.empty())
1556 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1557 boost::thread t(runCommand, strCmd); // thread runs free
1564 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1566 // Check for duplicate
1567 uint256 hash = GetHash();
1568 if (mapBlockIndex.count(hash))
1569 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1571 // Construct new block index object
1572 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1574 return error("AddToBlockIndex() : new CBlockIndex failed");
1575 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1576 pindexNew->phashBlock = &((*mi).first);
1577 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1578 if (miPrev != mapBlockIndex.end())
1580 pindexNew->pprev = (*miPrev).second;
1581 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1583 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1587 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1588 if (!txdb.TxnCommit())
1592 if (pindexNew->bnChainWork > bnBestChainWork)
1593 if (!SetBestChain(txdb, pindexNew))
1598 if (pindexNew == pindexBest)
1600 // Notify UI to display prev block's coinbase if it was ours
1601 static uint256 hashPrevBestCoinBase;
1602 UpdatedTransaction(hashPrevBestCoinBase);
1603 hashPrevBestCoinBase = vtx[0].GetHash();
1613 bool CBlock::CheckBlock() const
1615 // These are checks that are independent of context
1616 // that can be verified before saving an orphan block.
1619 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1620 return DoS(100, error("CheckBlock() : size limits failed"));
1622 // Check proof of work matches claimed amount
1623 if (!CheckProofOfWork(GetHash(), nBits))
1624 return DoS(50, error("CheckBlock() : proof of work failed"));
1627 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1628 return error("CheckBlock() : block timestamp too far in the future");
1630 // First transaction must be coinbase, the rest must not be
1631 if (vtx.empty() || !vtx[0].IsCoinBase())
1632 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1633 for (int i = 1; i < vtx.size(); i++)
1634 if (vtx[i].IsCoinBase())
1635 return DoS(100, error("CheckBlock() : more than one coinbase"));
1637 // Check transactions
1638 BOOST_FOREACH(const CTransaction& tx, vtx)
1639 if (!tx.CheckTransaction())
1640 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1643 BOOST_FOREACH(const CTransaction& tx, vtx)
1645 nSigOps += tx.GetLegacySigOpCount();
1647 if (nSigOps > MAX_BLOCK_SIGOPS)
1648 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1651 if (hashMerkleRoot != BuildMerkleTree())
1652 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1657 bool CBlock::AcceptBlock()
1659 // Check for duplicate
1660 uint256 hash = GetHash();
1661 if (mapBlockIndex.count(hash))
1662 return error("AcceptBlock() : block already in mapBlockIndex");
1664 // Get prev block index
1665 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1666 if (mi == mapBlockIndex.end())
1667 return DoS(10, error("AcceptBlock() : prev block not found"));
1668 CBlockIndex* pindexPrev = (*mi).second;
1669 int nHeight = pindexPrev->nHeight+1;
1671 // Check proof of work
1672 if (nBits != GetNextWorkRequired(pindexPrev, this))
1673 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1675 // Check timestamp against prev
1676 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1677 return error("AcceptBlock() : block's timestamp is too early");
1679 // Check that all transactions are finalized
1680 BOOST_FOREACH(const CTransaction& tx, vtx)
1681 if (!tx.IsFinal(nHeight, GetBlockTime()))
1682 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1684 // Check that the block chain matches the known block chain up to a checkpoint
1685 if (!Checkpoints::CheckBlock(nHeight, hash))
1686 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1688 // Write block to history file
1689 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1690 return error("AcceptBlock() : out of disk space");
1691 unsigned int nFile = -1;
1692 unsigned int nBlockPos = 0;
1693 if (!WriteToDisk(nFile, nBlockPos))
1694 return error("AcceptBlock() : WriteToDisk failed");
1695 if (!AddToBlockIndex(nFile, nBlockPos))
1696 return error("AcceptBlock() : AddToBlockIndex failed");
1698 // Relay inventory, but don't relay old inventory during initial block download
1699 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1700 if (hashBestChain == hash)
1703 BOOST_FOREACH(CNode* pnode, vNodes)
1704 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1705 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1711 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1713 // Check for duplicate
1714 uint256 hash = pblock->GetHash();
1715 if (mapBlockIndex.count(hash))
1716 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1717 if (mapOrphanBlocks.count(hash))
1718 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1720 // Preliminary checks
1721 if (!pblock->CheckBlock())
1722 return error("ProcessBlock() : CheckBlock FAILED");
1724 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1725 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1727 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1728 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1732 pfrom->Misbehaving(100);
1733 return error("ProcessBlock() : block with timestamp before last checkpoint");
1736 bnNewBlock.SetCompact(pblock->nBits);
1738 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1739 if (bnNewBlock > bnRequired)
1742 pfrom->Misbehaving(100);
1743 return error("ProcessBlock() : block with too little proof-of-work");
1748 // If don't already have its previous block, shunt it off to holding area until we get it
1749 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1751 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1752 CBlock* pblock2 = new CBlock(*pblock);
1753 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1754 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1756 // Ask this guy to fill in what we're missing
1758 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1763 if (!pblock->AcceptBlock())
1764 return error("ProcessBlock() : AcceptBlock FAILED");
1766 // Recursively process any orphan blocks that depended on this one
1767 vector<uint256> vWorkQueue;
1768 vWorkQueue.push_back(hash);
1769 for (int i = 0; i < vWorkQueue.size(); i++)
1771 uint256 hashPrev = vWorkQueue[i];
1772 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1773 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1776 CBlock* pblockOrphan = (*mi).second;
1777 if (pblockOrphan->AcceptBlock())
1778 vWorkQueue.push_back(pblockOrphan->GetHash());
1779 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1780 delete pblockOrphan;
1782 mapOrphanBlocksByPrev.erase(hashPrev);
1785 printf("ProcessBlock: ACCEPTED\n");
1796 bool CheckDiskSpace(uint64 nAdditionalBytes)
1798 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1800 // Check for 15MB because database could create another 10MB log file at any time
1801 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1804 string strMessage = _("Warning: Disk space is low ");
1805 strMiscWarning = strMessage;
1806 printf("*** %s\n", strMessage.c_str());
1807 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1814 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1818 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1821 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1823 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1832 static unsigned int nCurrentBlockFile = 1;
1834 FILE* AppendBlockFile(unsigned int& nFileRet)
1839 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1842 if (fseek(file, 0, SEEK_END) != 0)
1844 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1845 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1847 nFileRet = nCurrentBlockFile;
1851 nCurrentBlockFile++;
1855 bool LoadBlockIndex(bool fAllowNew)
1859 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1860 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1861 pchMessageStart[0] = 0xfa;
1862 pchMessageStart[1] = 0xbf;
1863 pchMessageStart[2] = 0xb5;
1864 pchMessageStart[3] = 0xda;
1871 if (!txdb.LoadBlockIndex())
1876 // Init with genesis block
1878 if (mapBlockIndex.empty())
1884 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1885 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1886 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1887 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1888 // vMerkleTree: 4a5e1e
1891 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1893 txNew.vin.resize(1);
1894 txNew.vout.resize(1);
1895 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1896 txNew.vout[0].nValue = 50 * COIN;
1897 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1899 block.vtx.push_back(txNew);
1900 block.hashPrevBlock = 0;
1901 block.hashMerkleRoot = block.BuildMerkleTree();
1903 block.nTime = 1231006505;
1904 block.nBits = 0x1d00ffff;
1905 block.nNonce = 2083236893;
1909 block.nTime = 1296688602;
1910 block.nBits = 0x1d07fff8;
1911 block.nNonce = 384568319;
1915 printf("%s\n", block.GetHash().ToString().c_str());
1916 printf("%s\n", hashGenesisBlock.ToString().c_str());
1917 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1918 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1920 assert(block.GetHash() == hashGenesisBlock);
1922 // Start new block file
1924 unsigned int nBlockPos;
1925 if (!block.WriteToDisk(nFile, nBlockPos))
1926 return error("LoadBlockIndex() : writing genesis block to disk failed");
1927 if (!block.AddToBlockIndex(nFile, nBlockPos))
1928 return error("LoadBlockIndex() : genesis block not accepted");
1936 void PrintBlockTree()
1938 // precompute tree structure
1939 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1940 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1942 CBlockIndex* pindex = (*mi).second;
1943 mapNext[pindex->pprev].push_back(pindex);
1945 //while (rand() % 3 == 0)
1946 // mapNext[pindex->pprev].push_back(pindex);
1949 vector<pair<int, CBlockIndex*> > vStack;
1950 vStack.push_back(make_pair(0, pindexGenesisBlock));
1953 while (!vStack.empty())
1955 int nCol = vStack.back().first;
1956 CBlockIndex* pindex = vStack.back().second;
1959 // print split or gap
1960 if (nCol > nPrevCol)
1962 for (int i = 0; i < nCol-1; i++)
1966 else if (nCol < nPrevCol)
1968 for (int i = 0; i < nCol; i++)
1975 for (int i = 0; i < nCol; i++)
1980 block.ReadFromDisk(pindex);
1981 printf("%d (%u,%u) %s %s tx %d",
1985 block.GetHash().ToString().substr(0,20).c_str(),
1986 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1989 PrintWallets(block);
1991 // put the main timechain first
1992 vector<CBlockIndex*>& vNext = mapNext[pindex];
1993 for (int i = 0; i < vNext.size(); i++)
1995 if (vNext[i]->pnext)
1997 swap(vNext[0], vNext[i]);
2003 for (int i = 0; i < vNext.size(); i++)
2004 vStack.push_back(make_pair(nCol+i, vNext[i]));
2017 //////////////////////////////////////////////////////////////////////////////
2022 map<uint256, CAlert> mapAlerts;
2023 CCriticalSection cs_mapAlerts;
2025 string GetWarnings(string strFor)
2028 string strStatusBar;
2030 if (GetBoolArg("-testsafemode"))
2033 // Misc warnings like out of disk space and clock is wrong
2034 if (strMiscWarning != "")
2037 strStatusBar = strMiscWarning;
2040 // Longer invalid proof-of-work chain
2041 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2044 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2050 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2052 const CAlert& alert = item.second;
2053 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2055 nPriority = alert.nPriority;
2056 strStatusBar = alert.strStatusBar;
2061 if (strFor == "statusbar")
2062 return strStatusBar;
2063 else if (strFor == "rpc")
2065 assert(!"GetWarnings() : invalid parameter");
2069 bool CAlert::ProcessAlert()
2071 if (!CheckSignature())
2078 // Cancel previous alerts
2079 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2081 const CAlert& alert = (*mi).second;
2084 printf("cancelling alert %d\n", alert.nID);
2085 mapAlerts.erase(mi++);
2087 else if (!alert.IsInEffect())
2089 printf("expiring alert %d\n", alert.nID);
2090 mapAlerts.erase(mi++);
2096 // Check if this alert has been cancelled
2097 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2099 const CAlert& alert = item.second;
2100 if (alert.Cancels(*this))
2102 printf("alert already cancelled by %d\n", alert.nID);
2108 mapAlerts.insert(make_pair(GetHash(), *this));
2111 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2123 //////////////////////////////////////////////////////////////////////////////
2129 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2133 case MSG_TX: return mempool.mapTx.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2134 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2136 // Don't know what it is, just say we already got one
2143 // The message start string is designed to be unlikely to occur in normal data.
2144 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2145 // a large 4-byte int at any alignment.
2146 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2149 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2151 static map<CService, vector<unsigned char> > mapReuseKey;
2152 RandAddSeedPerfmon();
2154 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2155 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2157 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2159 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2167 if (strCommand == "version")
2169 // Each connection can only send one version message
2170 if (pfrom->nVersion != 0)
2172 pfrom->Misbehaving(1);
2180 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2181 if (pfrom->nVersion < 209)
2183 // Since February 20, 2012, the protocol is initiated at version 209,
2184 // and earlier versions are no longer supported
2185 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2186 pfrom->fDisconnect = true;
2190 if (pfrom->nVersion == 10300)
2191 pfrom->nVersion = 300;
2193 vRecv >> addrFrom >> nNonce;
2195 vRecv >> pfrom->strSubVer;
2197 vRecv >> pfrom->nStartingHeight;
2199 // Disconnect if we connected to ourself
2200 if (nNonce == nLocalHostNonce && nNonce > 1)
2202 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2203 pfrom->fDisconnect = true;
2207 // Be shy and don't send version until we hear
2208 if (pfrom->fInbound)
2209 pfrom->PushVersion();
2211 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2213 AddTimeData(pfrom->addr, nTime);
2216 pfrom->PushMessage("verack");
2217 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2219 if (!pfrom->fInbound)
2221 // Advertise our address
2222 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2223 !IsInitialBlockDownload())
2225 CAddress addr(addrLocalHost);
2226 addr.nTime = GetAdjustedTime();
2227 pfrom->PushAddress(addr);
2230 // Get recent addresses
2231 if (pfrom->nVersion >= 31402 || addrman.size() < 1000)
2233 pfrom->PushMessage("getaddr");
2234 pfrom->fGetAddr = true;
2236 addrman.Good(pfrom->addr);
2238 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2240 addrman.Add(addrFrom, addrFrom);
2241 addrman.Good(addrFrom);
2245 // Ask the first connected node for block updates
2246 static int nAskedForBlocks = 0;
2247 if (!pfrom->fClient &&
2248 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2249 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2252 pfrom->PushGetBlocks(pindexBest, uint256(0));
2258 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2259 item.second.RelayTo(pfrom);
2262 pfrom->fSuccessfullyConnected = true;
2264 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2266 cPeerBlockCounts.input(pfrom->nStartingHeight);
2270 else if (pfrom->nVersion == 0)
2272 // Must have a version message before anything else
2273 pfrom->Misbehaving(1);
2278 else if (strCommand == "verack")
2280 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2284 else if (strCommand == "addr")
2286 vector<CAddress> vAddr;
2289 // Don't want addr from older versions unless seeding
2290 if (pfrom->nVersion < 31402 && addrman.size() > 1000)
2292 if (vAddr.size() > 1000)
2294 pfrom->Misbehaving(20);
2295 return error("message addr size() = %d", vAddr.size());
2298 // Store the new addresses
2299 int64 nNow = GetAdjustedTime();
2300 int64 nSince = nNow - 10 * 60;
2301 BOOST_FOREACH(CAddress& addr, vAddr)
2305 // ignore IPv6 for now, since it isn't implemented anyway
2308 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2309 addr.nTime = nNow - 5 * 24 * 60 * 60;
2310 pfrom->AddAddressKnown(addr);
2311 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2313 // Relay to a limited number of other nodes
2316 // Use deterministic randomness to send to the same nodes for 24 hours
2317 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2318 static uint256 hashSalt;
2320 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2321 int64 hashAddr = addr.GetHash();
2322 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2323 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2324 multimap<uint256, CNode*> mapMix;
2325 BOOST_FOREACH(CNode* pnode, vNodes)
2327 if (pnode->nVersion < 31402)
2329 unsigned int nPointer;
2330 memcpy(&nPointer, &pnode, sizeof(nPointer));
2331 uint256 hashKey = hashRand ^ nPointer;
2332 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2333 mapMix.insert(make_pair(hashKey, pnode));
2335 int nRelayNodes = 2;
2336 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2337 ((*mi).second)->PushAddress(addr);
2341 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2342 if (vAddr.size() < 1000)
2343 pfrom->fGetAddr = false;
2347 else if (strCommand == "inv")
2351 if (vInv.size() > 50000)
2353 pfrom->Misbehaving(20);
2354 return error("message inv size() = %d", vInv.size());
2358 for (int nInv = 0; nInv < vInv.size(); nInv++)
2360 const CInv &inv = vInv[nInv];
2364 pfrom->AddInventoryKnown(inv);
2366 bool fAlreadyHave = AlreadyHave(txdb, inv);
2368 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2370 // Always request the last block in an inv bundle (even if we already have it), as it is the
2371 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2372 // this is necessary to connect earlier received orphan blocks to the chain again.
2373 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2375 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2376 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2378 // Track requests for our stuff
2379 Inventory(inv.hash);
2384 else if (strCommand == "getdata")
2388 if (vInv.size() > 50000)
2390 pfrom->Misbehaving(20);
2391 return error("message getdata size() = %d", vInv.size());
2394 BOOST_FOREACH(const CInv& inv, vInv)
2398 printf("received getdata for: %s\n", inv.ToString().c_str());
2400 if (inv.type == MSG_BLOCK)
2402 // Send block from disk
2403 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2404 if (mi != mapBlockIndex.end())
2407 block.ReadFromDisk((*mi).second);
2408 pfrom->PushMessage("block", block);
2410 // Trigger them to send a getblocks request for the next batch of inventory
2411 if (inv.hash == pfrom->hashContinue)
2413 // Bypass PushInventory, this must send even if redundant,
2414 // and we want it right after the last block so they don't
2415 // wait for other stuff first.
2417 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2418 pfrom->PushMessage("inv", vInv);
2419 pfrom->hashContinue = 0;
2423 else if (inv.IsKnownType())
2425 // Send stream from relay memory
2428 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2429 if (mi != mapRelay.end())
2430 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2434 // Track requests for our stuff
2435 Inventory(inv.hash);
2440 else if (strCommand == "getblocks")
2442 CBlockLocator locator;
2444 vRecv >> locator >> hashStop;
2446 // Find the last block the caller has in the main chain
2447 CBlockIndex* pindex = locator.GetBlockIndex();
2449 // Send the rest of the chain
2451 pindex = pindex->pnext;
2452 int nLimit = 500 + locator.GetDistanceBack();
2453 unsigned int nBytes = 0;
2454 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2455 for (; pindex; pindex = pindex->pnext)
2457 if (pindex->GetBlockHash() == hashStop)
2459 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2462 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2464 block.ReadFromDisk(pindex, true);
2465 nBytes += block.GetSerializeSize(SER_NETWORK);
2466 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2468 // When this block is requested, we'll send an inv that'll make them
2469 // getblocks the next batch of inventory.
2470 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2471 pfrom->hashContinue = pindex->GetBlockHash();
2478 else if (strCommand == "getheaders")
2480 CBlockLocator locator;
2482 vRecv >> locator >> hashStop;
2484 CBlockIndex* pindex = NULL;
2485 if (locator.IsNull())
2487 // If locator is null, return the hashStop block
2488 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2489 if (mi == mapBlockIndex.end())
2491 pindex = (*mi).second;
2495 // Find the last block the caller has in the main chain
2496 pindex = locator.GetBlockIndex();
2498 pindex = pindex->pnext;
2501 vector<CBlock> vHeaders;
2503 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2504 for (; pindex; pindex = pindex->pnext)
2506 vHeaders.push_back(pindex->GetBlockHeader());
2507 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2510 pfrom->PushMessage("headers", vHeaders);
2514 else if (strCommand == "tx")
2516 vector<uint256> vWorkQueue;
2517 CDataStream vMsg(vRecv);
2522 CInv inv(MSG_TX, tx.GetHash());
2523 pfrom->AddInventoryKnown(inv);
2525 bool fMissingInputs = false;
2526 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2528 SyncWithWallets(tx, NULL, true);
2529 RelayMessage(inv, vMsg);
2530 mapAlreadyAskedFor.erase(inv);
2531 vWorkQueue.push_back(inv.hash);
2533 // Recursively process any orphan transactions that depended on this one
2534 for (int i = 0; i < vWorkQueue.size(); i++)
2536 uint256 hashPrev = vWorkQueue[i];
2537 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2538 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2541 const CDataStream& vMsg = *((*mi).second);
2543 CDataStream(vMsg) >> tx;
2544 CInv inv(MSG_TX, tx.GetHash());
2546 if (tx.AcceptToMemoryPool(txdb, true))
2548 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2549 SyncWithWallets(tx, NULL, true);
2550 RelayMessage(inv, vMsg);
2551 mapAlreadyAskedFor.erase(inv);
2552 vWorkQueue.push_back(inv.hash);
2557 BOOST_FOREACH(uint256 hash, vWorkQueue)
2558 EraseOrphanTx(hash);
2560 else if (fMissingInputs)
2562 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2565 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2566 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2568 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2570 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2574 else if (strCommand == "block")
2579 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2582 CInv inv(MSG_BLOCK, block.GetHash());
2583 pfrom->AddInventoryKnown(inv);
2585 if (ProcessBlock(pfrom, &block))
2586 mapAlreadyAskedFor.erase(inv);
2587 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2591 else if (strCommand == "getaddr")
2593 pfrom->vAddrToSend.clear();
2594 vector<CAddress> vAddr = addrman.GetAddr();
2595 BOOST_FOREACH(const CAddress &addr, vAddr)
2596 pfrom->PushAddress(addr);
2600 else if (strCommand == "checkorder")
2605 if (!GetBoolArg("-allowreceivebyip"))
2607 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2614 /// we have a chance to check the order here
2616 // Keep giving the same key to the same ip until they use it
2617 if (!mapReuseKey.count(pfrom->addr))
2618 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2620 // Send back approval of order and pubkey to use
2621 CScript scriptPubKey;
2622 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2623 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2627 else if (strCommand == "reply")
2632 CRequestTracker tracker;
2634 LOCK(pfrom->cs_mapRequests);
2635 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2636 if (mi != pfrom->mapRequests.end())
2638 tracker = (*mi).second;
2639 pfrom->mapRequests.erase(mi);
2642 if (!tracker.IsNull())
2643 tracker.fn(tracker.param1, vRecv);
2647 else if (strCommand == "ping")
2652 else if (strCommand == "alert")
2657 if (alert.ProcessAlert())
2660 pfrom->setKnown.insert(alert.GetHash());
2663 BOOST_FOREACH(CNode* pnode, vNodes)
2664 alert.RelayTo(pnode);
2672 // Ignore unknown commands for extensibility
2676 // Update the last seen time for this node's address
2677 if (pfrom->fNetworkNode)
2678 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2679 AddressCurrentlyConnected(pfrom->addr);
2685 bool ProcessMessages(CNode* pfrom)
2687 CDataStream& vRecv = pfrom->vRecv;
2691 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2695 // (4) message start
2704 // Scan for message start
2705 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2706 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2707 if (vRecv.end() - pstart < nHeaderSize)
2709 if (vRecv.size() > nHeaderSize)
2711 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2712 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2716 if (pstart - vRecv.begin() > 0)
2717 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2718 vRecv.erase(vRecv.begin(), pstart);
2721 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2726 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2729 string strCommand = hdr.GetCommand();
2732 unsigned int nMessageSize = hdr.nMessageSize;
2733 if (nMessageSize > MAX_SIZE)
2735 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2738 if (nMessageSize > vRecv.size())
2740 // Rewind and wait for rest of message
2741 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2746 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2747 unsigned int nChecksum = 0;
2748 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2749 if (nChecksum != hdr.nChecksum)
2751 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2752 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2756 // Copy message to its own buffer
2757 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2758 vRecv.ignore(nMessageSize);
2766 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2771 catch (std::ios_base::failure& e)
2773 if (strstr(e.what(), "end of data"))
2775 // Allow exceptions from underlength message on vRecv
2776 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());
2778 else if (strstr(e.what(), "size too large"))
2780 // Allow exceptions from overlong size
2781 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2785 PrintExceptionContinue(&e, "ProcessMessage()");
2788 catch (std::exception& e) {
2789 PrintExceptionContinue(&e, "ProcessMessage()");
2791 PrintExceptionContinue(NULL, "ProcessMessage()");
2795 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2803 bool SendMessages(CNode* pto, bool fSendTrickle)
2807 // Don't send anything until we get their version message
2808 if (pto->nVersion == 0)
2812 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2813 pto->PushMessage("ping");
2815 // Resend wallet transactions that haven't gotten in a block yet
2816 ResendWalletTransactions();
2818 // Address refresh broadcast
2819 static int64 nLastRebroadcast;
2820 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2824 BOOST_FOREACH(CNode* pnode, vNodes)
2826 // Periodically clear setAddrKnown to allow refresh broadcasts
2827 if (nLastRebroadcast)
2828 pnode->setAddrKnown.clear();
2830 // Rebroadcast our address
2831 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2833 CAddress addr(addrLocalHost);
2834 addr.nTime = GetAdjustedTime();
2835 pnode->PushAddress(addr);
2839 nLastRebroadcast = GetTime();
2847 vector<CAddress> vAddr;
2848 vAddr.reserve(pto->vAddrToSend.size());
2849 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2851 // returns true if wasn't already contained in the set
2852 if (pto->setAddrKnown.insert(addr).second)
2854 vAddr.push_back(addr);
2855 // receiver rejects addr messages larger than 1000
2856 if (vAddr.size() >= 1000)
2858 pto->PushMessage("addr", vAddr);
2863 pto->vAddrToSend.clear();
2865 pto->PushMessage("addr", vAddr);
2870 // Message: inventory
2873 vector<CInv> vInvWait;
2875 LOCK(pto->cs_inventory);
2876 vInv.reserve(pto->vInventoryToSend.size());
2877 vInvWait.reserve(pto->vInventoryToSend.size());
2878 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2880 if (pto->setInventoryKnown.count(inv))
2883 // trickle out tx inv to protect privacy
2884 if (inv.type == MSG_TX && !fSendTrickle)
2886 // 1/4 of tx invs blast to all immediately
2887 static uint256 hashSalt;
2889 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2890 uint256 hashRand = inv.hash ^ hashSalt;
2891 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2892 bool fTrickleWait = ((hashRand & 3) != 0);
2894 // always trickle our own transactions
2898 if (GetTransaction(inv.hash, wtx))
2900 fTrickleWait = true;
2905 vInvWait.push_back(inv);
2910 // returns true if wasn't already contained in the set
2911 if (pto->setInventoryKnown.insert(inv).second)
2913 vInv.push_back(inv);
2914 if (vInv.size() >= 1000)
2916 pto->PushMessage("inv", vInv);
2921 pto->vInventoryToSend = vInvWait;
2924 pto->PushMessage("inv", vInv);
2930 vector<CInv> vGetData;
2931 int64 nNow = GetTime() * 1000000;
2933 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2935 const CInv& inv = (*pto->mapAskFor.begin()).second;
2936 if (!AlreadyHave(txdb, inv))
2938 printf("sending getdata: %s\n", inv.ToString().c_str());
2939 vGetData.push_back(inv);
2940 if (vGetData.size() >= 1000)
2942 pto->PushMessage("getdata", vGetData);
2946 mapAlreadyAskedFor[inv] = nNow;
2947 pto->mapAskFor.erase(pto->mapAskFor.begin());
2949 if (!vGetData.empty())
2950 pto->PushMessage("getdata", vGetData);
2969 //////////////////////////////////////////////////////////////////////////////
2974 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2976 unsigned char* pdata = (unsigned char*)pbuffer;
2977 unsigned int blocks = 1 + ((len + 8) / 64);
2978 unsigned char* pend = pdata + 64 * blocks;
2979 memset(pdata + len, 0, 64 * blocks - len);
2981 unsigned int bits = len * 8;
2982 pend[-1] = (bits >> 0) & 0xff;
2983 pend[-2] = (bits >> 8) & 0xff;
2984 pend[-3] = (bits >> 16) & 0xff;
2985 pend[-4] = (bits >> 24) & 0xff;
2989 static const unsigned int pSHA256InitState[8] =
2990 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2992 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2995 unsigned char data[64];
2999 for (int i = 0; i < 16; i++)
3000 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3002 for (int i = 0; i < 8; i++)
3003 ctx.h[i] = ((uint32_t*)pinit)[i];
3005 SHA256_Update(&ctx, data, sizeof(data));
3006 for (int i = 0; i < 8; i++)
3007 ((uint32_t*)pstate)[i] = ctx.h[i];
3011 // ScanHash scans nonces looking for a hash with at least some zero bits.
3012 // It operates on big endian data. Caller does the byte reversing.
3013 // All input buffers are 16-byte aligned. nNonce is usually preserved
3014 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3015 // the block is rebuilt and nNonce starts over at zero.
3017 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3019 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3023 // Hash pdata using pmidstate as the starting state into
3024 // preformatted buffer phash1, then hash phash1 into phash
3026 SHA256Transform(phash1, pdata, pmidstate);
3027 SHA256Transform(phash, phash1, pSHA256InitState);
3029 // Return the nonce if the hash has at least some zero bits,
3030 // caller will check if it has enough to reach the target
3031 if (((unsigned short*)phash)[14] == 0)
3034 // If nothing found after trying for a while, return -1
3035 if ((nNonce & 0xffff) == 0)
3037 nHashesDone = 0xffff+1;
3043 // Some explaining would be appreciated
3048 set<uint256> setDependsOn;
3051 COrphan(CTransaction* ptxIn)
3059 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3060 BOOST_FOREACH(uint256 hash, setDependsOn)
3061 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3066 uint64 nLastBlockTx = 0;
3067 uint64 nLastBlockSize = 0;
3069 CBlock* CreateNewBlock(CReserveKey& reservekey)
3071 CBlockIndex* pindexPrev = pindexBest;
3074 auto_ptr<CBlock> pblock(new CBlock());
3078 // Create coinbase tx
3080 txNew.vin.resize(1);
3081 txNew.vin[0].prevout.SetNull();
3082 txNew.vout.resize(1);
3083 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3085 // Add our coinbase tx as first transaction
3086 pblock->vtx.push_back(txNew);
3088 // Collect memory pool transactions into the block
3091 LOCK2(cs_main, mempool.cs);
3094 // Priority order to process transactions
3095 list<COrphan> vOrphan; // list memory doesn't move
3096 map<uint256, vector<COrphan*> > mapDependers;
3097 multimap<double, CTransaction*> mapPriority;
3098 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
3100 CTransaction& tx = (*mi).second;
3101 if (tx.IsCoinBase() || !tx.IsFinal())
3104 COrphan* porphan = NULL;
3105 double dPriority = 0;
3106 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3108 // Read prev transaction
3109 CTransaction txPrev;
3111 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3113 // Has to wait for dependencies
3116 // Use list for automatic deletion
3117 vOrphan.push_back(COrphan(&tx));
3118 porphan = &vOrphan.back();
3120 mapDependers[txin.prevout.hash].push_back(porphan);
3121 porphan->setDependsOn.insert(txin.prevout.hash);
3124 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3126 // Read block header
3127 int nConf = txindex.GetDepthInMainChain();
3129 dPriority += (double)nValueIn * nConf;
3131 if (fDebug && GetBoolArg("-printpriority"))
3132 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3135 // Priority is sum(valuein * age) / txsize
3136 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3139 porphan->dPriority = dPriority;
3141 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3143 if (fDebug && GetBoolArg("-printpriority"))
3145 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3152 // Collect transactions into block
3153 map<uint256, CTxIndex> mapTestPool;
3154 uint64 nBlockSize = 1000;
3155 uint64 nBlockTx = 0;
3156 int nBlockSigOps = 100;
3157 while (!mapPriority.empty())
3159 // Take highest priority transaction off priority queue
3160 double dPriority = -(*mapPriority.begin()).first;
3161 CTransaction& tx = *(*mapPriority.begin()).second;
3162 mapPriority.erase(mapPriority.begin());
3165 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3166 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3169 // Legacy limits on sigOps:
3170 int nTxSigOps = tx.GetLegacySigOpCount();
3171 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3174 // Transaction fee required depends on block size
3175 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3176 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3178 // Connecting shouldn't fail due to dependency on other memory pool transactions
3179 // because we're already processing them in order of dependency
3180 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3181 MapPrevTx mapInputs;
3183 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3186 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3187 if (nTxFees < nMinFee)
3190 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3191 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3194 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3196 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3197 swap(mapTestPool, mapTestPoolTmp);
3200 pblock->vtx.push_back(tx);
3201 nBlockSize += nTxSize;
3203 nBlockSigOps += nTxSigOps;
3206 // Add transactions that depend on this one to the priority queue
3207 uint256 hash = tx.GetHash();
3208 if (mapDependers.count(hash))
3210 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3212 if (!porphan->setDependsOn.empty())
3214 porphan->setDependsOn.erase(hash);
3215 if (porphan->setDependsOn.empty())
3216 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3222 nLastBlockTx = nBlockTx;
3223 nLastBlockSize = nBlockSize;
3224 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3227 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3230 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3231 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3232 pblock->UpdateTime(pindexPrev);
3233 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3236 return pblock.release();
3240 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3242 // Update nExtraNonce
3243 static uint256 hashPrevBlock;
3244 if (hashPrevBlock != pblock->hashPrevBlock)
3247 hashPrevBlock = pblock->hashPrevBlock;
3250 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3251 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3253 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3257 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3260 // Prebuild hash buffers
3267 uint256 hashPrevBlock;
3268 uint256 hashMerkleRoot;
3271 unsigned int nNonce;
3274 unsigned char pchPadding0[64];
3276 unsigned char pchPadding1[64];
3279 memset(&tmp, 0, sizeof(tmp));
3281 tmp.block.nVersion = pblock->nVersion;
3282 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3283 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3284 tmp.block.nTime = pblock->nTime;
3285 tmp.block.nBits = pblock->nBits;
3286 tmp.block.nNonce = pblock->nNonce;
3288 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3289 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3291 // Byte swap all the input buffer
3292 for (int i = 0; i < sizeof(tmp)/4; i++)
3293 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3295 // Precalc the first half of the first hash, which stays constant
3296 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3298 memcpy(pdata, &tmp.block, 128);
3299 memcpy(phash1, &tmp.hash1, 64);
3303 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3305 uint256 hash = pblock->GetHash();
3306 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3308 if (hash > hashTarget)
3312 printf("BitcoinMiner:\n");
3313 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3315 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3316 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3321 if (pblock->hashPrevBlock != hashBestChain)
3322 return error("BitcoinMiner : generated block is stale");
3324 // Remove key from key pool
3325 reservekey.KeepKey();
3327 // Track how many getdata requests this block gets
3329 LOCK(wallet.cs_wallet);
3330 wallet.mapRequestCount[pblock->GetHash()] = 0;
3333 // Process this block the same as if we had received it from another node
3334 if (!ProcessBlock(NULL, pblock))
3335 return error("BitcoinMiner : ProcessBlock, block not accepted");
3341 void static ThreadBitcoinMiner(void* parg);
3343 static bool fGenerateBitcoins = false;
3344 static bool fLimitProcessors = false;
3345 static int nLimitProcessors = -1;
3347 void static BitcoinMiner(CWallet *pwallet)
3349 printf("BitcoinMiner started\n");
3350 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3352 // Each thread has its own key and counter
3353 CReserveKey reservekey(pwallet);
3354 unsigned int nExtraNonce = 0;
3356 while (fGenerateBitcoins)
3360 while (vNodes.empty() || IsInitialBlockDownload())
3365 if (!fGenerateBitcoins)
3373 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3374 CBlockIndex* pindexPrev = pindexBest;
3376 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3379 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3381 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3385 // Prebuild hash buffers
3387 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3388 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3389 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3391 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3393 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3394 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3395 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3401 int64 nStart = GetTime();
3402 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3404 uint256& hash = *alignup<16>(hashbuf);
3407 unsigned int nHashesDone = 0;
3408 unsigned int nNonceFound;
3411 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3412 (char*)&hash, nHashesDone);
3414 // Check if something found
3415 if (nNonceFound != -1)
3417 for (int i = 0; i < sizeof(hash)/4; i++)
3418 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3420 if (hash <= hashTarget)
3423 pblock->nNonce = ByteReverse(nNonceFound);
3424 assert(hash == pblock->GetHash());
3426 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3427 CheckWork(pblock.get(), *pwalletMain, reservekey);
3428 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3434 static int64 nHashCounter;
3435 if (nHPSTimerStart == 0)
3437 nHPSTimerStart = GetTimeMillis();
3441 nHashCounter += nHashesDone;
3442 if (GetTimeMillis() - nHPSTimerStart > 4000)
3444 static CCriticalSection cs;
3447 if (GetTimeMillis() - nHPSTimerStart > 4000)
3449 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3450 nHPSTimerStart = GetTimeMillis();
3452 static int64 nLogTime;
3453 if (GetTime() - nLogTime > 30 * 60)
3455 nLogTime = GetTime();
3456 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3457 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3463 // Check for stop or if block needs to be rebuilt
3466 if (!fGenerateBitcoins)
3468 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3472 if (nBlockNonce >= 0xffff0000)
3474 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3476 if (pindexPrev != pindexBest)
3479 // Update nTime every few seconds
3480 pblock->UpdateTime(pindexPrev);
3481 nBlockTime = ByteReverse(pblock->nTime);
3484 // Changing pblock->nTime can change work required on testnet:
3485 nBlockBits = ByteReverse(pblock->nBits);
3486 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3492 void static ThreadBitcoinMiner(void* parg)
3494 CWallet* pwallet = (CWallet*)parg;
3497 vnThreadsRunning[THREAD_MINER]++;
3498 BitcoinMiner(pwallet);
3499 vnThreadsRunning[THREAD_MINER]--;
3501 catch (std::exception& e) {
3502 vnThreadsRunning[THREAD_MINER]--;
3503 PrintException(&e, "ThreadBitcoinMiner()");
3505 vnThreadsRunning[THREAD_MINER]--;
3506 PrintException(NULL, "ThreadBitcoinMiner()");
3509 if (vnThreadsRunning[THREAD_MINER] == 0)
3511 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3515 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3517 fGenerateBitcoins = fGenerate;
3518 nLimitProcessors = GetArg("-genproclimit", -1);
3519 if (nLimitProcessors == 0)
3520 fGenerateBitcoins = false;
3521 fLimitProcessors = (nLimitProcessors != -1);
3525 int nProcessors = boost::thread::hardware_concurrency();
3526 printf("%d processors\n", nProcessors);
3527 if (nProcessors < 1)
3529 if (fLimitProcessors && nProcessors > nLimitProcessors)
3530 nProcessors = nLimitProcessors;
3531 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3532 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3533 for (int i = 0; i < nAddThreads; i++)
3535 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3536 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");