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;
26 static CTxMemPool mempool;
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 ptxOld->RemoveFromMemoryPool();
581 AddToMemoryPoolUnchecked();
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 uint64 nPooledTx = 0;
595 bool CTransaction::AddToMemoryPoolUnchecked()
597 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mempool.mapTx.size());
598 // Add to memory pool without checking anything. Don't call this directly,
599 // call AcceptToMemoryPool to properly check the transaction first.
602 uint256 hash = GetHash();
603 mempool.mapTx[hash] = *this;
604 for (int i = 0; i < vin.size(); i++)
605 mempool.mapNextTx[vin[i].prevout] = CInPoint(&mempool.mapTx[hash], i);
606 nTransactionsUpdated++;
613 bool CTransaction::RemoveFromMemoryPool()
615 // Remove transaction from memory pool
618 uint256 hash = GetHash();
619 if (mempool.mapTx.count(hash))
621 BOOST_FOREACH(const CTxIn& txin, vin)
622 mempool.mapNextTx.erase(txin.prevout);
623 mempool.mapTx.erase(hash);
624 nTransactionsUpdated++;
636 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
638 if (hashBlock == 0 || nIndex == -1)
641 // Find the block it claims to be in
642 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
643 if (mi == mapBlockIndex.end())
645 CBlockIndex* pindex = (*mi).second;
646 if (!pindex || !pindex->IsInMainChain())
649 // Make sure the merkle branch connects to this block
650 if (!fMerkleVerified)
652 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
654 fMerkleVerified = true;
658 return pindexBest->nHeight - pindex->nHeight + 1;
662 int CMerkleTx::GetBlocksToMaturity() const
666 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
670 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
674 if (!IsInMainChain() && !ClientConnectInputs())
676 return CTransaction::AcceptToMemoryPool(txdb, false);
680 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
684 bool CMerkleTx::AcceptToMemoryPool()
687 return AcceptToMemoryPool(txdb);
692 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
697 // Add previous supporting transactions first
698 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
700 if (!tx.IsCoinBase())
702 uint256 hash = tx.GetHash();
703 if (!mempool.mapTx.count(hash) && !txdb.ContainsTx(hash))
704 tx.AcceptToMemoryPool(txdb, fCheckInputs);
707 return AcceptToMemoryPool(txdb, fCheckInputs);
712 bool CWalletTx::AcceptWalletTransaction()
715 return AcceptWalletTransaction(txdb);
718 int CTxIndex::GetDepthInMainChain() const
722 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
724 // Find the block in the index
725 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
726 if (mi == mapBlockIndex.end())
728 CBlockIndex* pindex = (*mi).second;
729 if (!pindex || !pindex->IsInMainChain())
731 return 1 + nBestHeight - pindex->nHeight;
743 //////////////////////////////////////////////////////////////////////////////
745 // CBlock and CBlockIndex
748 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
750 if (!fReadTransactions)
752 *this = pindex->GetBlockHeader();
755 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
757 if (GetHash() != pindex->GetBlockHash())
758 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
762 uint256 static GetOrphanRoot(const CBlock* pblock)
764 // Work back to the first block in the orphan chain
765 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
766 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
767 return pblock->GetHash();
770 int64 static GetBlockValue(int nHeight, int64 nFees)
772 int64 nSubsidy = 50 * COIN;
774 // Subsidy is cut in half every 4 years
775 nSubsidy >>= (nHeight / 210000);
777 return nSubsidy + nFees;
780 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
781 static const int64 nTargetSpacing = 10 * 60;
782 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
785 // minimum amount of work that could possibly be required nTime after
786 // minimum work required was nBase
788 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
790 // Testnet has min-difficulty blocks
791 // after nTargetSpacing*2 time between blocks:
792 if (fTestNet && nTime > nTargetSpacing*2)
793 return bnProofOfWorkLimit.GetCompact();
796 bnResult.SetCompact(nBase);
797 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
799 // Maximum 400% adjustment...
801 // ... in best-case exactly 4-times-normal target time
802 nTime -= nTargetTimespan*4;
804 if (bnResult > bnProofOfWorkLimit)
805 bnResult = bnProofOfWorkLimit;
806 return bnResult.GetCompact();
809 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
811 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
814 if (pindexLast == NULL)
815 return nProofOfWorkLimit;
817 // Only change once per interval
818 if ((pindexLast->nHeight+1) % nInterval != 0)
820 // Special rules for testnet after 15 Feb 2012:
821 if (fTestNet && pblock->nTime > 1329264000)
823 // If the new block's timestamp is more than 2* 10 minutes
824 // then allow mining of a min-difficulty block.
825 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
826 return nProofOfWorkLimit;
829 // Return the last non-special-min-difficulty-rules-block
830 const CBlockIndex* pindex = pindexLast;
831 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
832 pindex = pindex->pprev;
833 return pindex->nBits;
837 return pindexLast->nBits;
840 // Go back by what we want to be 14 days worth of blocks
841 const CBlockIndex* pindexFirst = pindexLast;
842 for (int i = 0; pindexFirst && i < nInterval-1; i++)
843 pindexFirst = pindexFirst->pprev;
846 // Limit adjustment step
847 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
848 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
849 if (nActualTimespan < nTargetTimespan/4)
850 nActualTimespan = nTargetTimespan/4;
851 if (nActualTimespan > nTargetTimespan*4)
852 nActualTimespan = nTargetTimespan*4;
856 bnNew.SetCompact(pindexLast->nBits);
857 bnNew *= nActualTimespan;
858 bnNew /= nTargetTimespan;
860 if (bnNew > bnProofOfWorkLimit)
861 bnNew = bnProofOfWorkLimit;
864 printf("GetNextWorkRequired RETARGET\n");
865 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
866 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
867 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
869 return bnNew.GetCompact();
872 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
875 bnTarget.SetCompact(nBits);
878 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
879 return error("CheckProofOfWork() : nBits below minimum work");
881 // Check proof of work matches claimed amount
882 if (hash > bnTarget.getuint256())
883 return error("CheckProofOfWork() : hash doesn't match nBits");
888 // Return maximum amount of blocks that other nodes claim to have
889 int GetNumBlocksOfPeers()
891 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
894 bool IsInitialBlockDownload()
896 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
898 static int64 nLastUpdate;
899 static CBlockIndex* pindexLastBest;
900 if (pindexBest != pindexLastBest)
902 pindexLastBest = pindexBest;
903 nLastUpdate = GetTime();
905 return (GetTime() - nLastUpdate < 10 &&
906 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
909 void static InvalidChainFound(CBlockIndex* pindexNew)
911 if (pindexNew->bnChainWork > bnBestInvalidWork)
913 bnBestInvalidWork = pindexNew->bnChainWork;
914 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
917 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());
918 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
919 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
920 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
923 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
925 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
927 // Updating time can change work required on testnet:
929 nBits = GetNextWorkRequired(pindexPrev, this);
942 bool CTransaction::DisconnectInputs(CTxDB& txdb)
944 // Relinquish previous transactions' spent pointers
947 BOOST_FOREACH(const CTxIn& txin, vin)
949 COutPoint prevout = txin.prevout;
951 // Get prev txindex from disk
953 if (!txdb.ReadTxIndex(prevout.hash, txindex))
954 return error("DisconnectInputs() : ReadTxIndex failed");
956 if (prevout.n >= txindex.vSpent.size())
957 return error("DisconnectInputs() : prevout.n out of range");
959 // Mark outpoint as not spent
960 txindex.vSpent[prevout.n].SetNull();
963 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
964 return error("DisconnectInputs() : UpdateTxIndex failed");
968 // Remove transaction from index
969 // This can fail if a duplicate of this transaction was in a chain that got
970 // reorganized away. This is only possible if this transaction was completely
971 // spent, so erasing it would be a no-op anway.
972 txdb.EraseTxIndex(*this);
978 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
979 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
981 // FetchInputs can return false either because we just haven't seen some inputs
982 // (in which case the transaction should be stored as an orphan)
983 // or because the transaction is malformed (in which case the transaction should
984 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
988 return true; // Coinbase transactions have no inputs to fetch.
990 for (int i = 0; i < vin.size(); i++)
992 COutPoint prevout = vin[i].prevout;
993 if (inputsRet.count(prevout.hash))
994 continue; // Got it already
997 CTxIndex& txindex = inputsRet[prevout.hash].first;
999 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1001 // Get txindex from current proposed changes
1002 txindex = mapTestPool.find(prevout.hash)->second;
1006 // Read txindex from txdb
1007 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1009 if (!fFound && (fBlock || fMiner))
1010 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());
1013 CTransaction& txPrev = inputsRet[prevout.hash].second;
1014 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1016 // Get prev tx from single transactions in memory
1019 if (!mempool.mapTx.count(prevout.hash))
1020 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());
1021 txPrev = mempool.mapTx[prevout.hash];
1024 txindex.vSpent.resize(txPrev.vout.size());
1028 // Get prev tx from disk
1029 if (!txPrev.ReadFromDisk(txindex.pos))
1030 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1034 // Make sure all prevout.n's are valid:
1035 for (int i = 0; i < vin.size(); i++)
1037 const COutPoint prevout = vin[i].prevout;
1038 assert(inputsRet.count(prevout.hash) != 0);
1039 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1040 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1041 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1043 // Revisit this if/when transaction replacement is implemented and allows
1046 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()));
1053 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1055 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1056 if (mi == inputs.end())
1057 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1059 const CTransaction& txPrev = (mi->second).second;
1060 if (input.prevout.n >= txPrev.vout.size())
1061 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1063 return txPrev.vout[input.prevout.n];
1066 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1072 for (int i = 0; i < vin.size(); i++)
1074 nResult += GetOutputFor(vin[i], inputs).nValue;
1080 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1086 for (int i = 0; i < vin.size(); i++)
1088 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1089 if (prevout.scriptPubKey.IsPayToScriptHash())
1090 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1095 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1096 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1097 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1099 // Take over previous transactions' spent pointers
1100 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1101 // fMiner is true when called from the internal bitcoin miner
1102 // ... both are false when called from CTransaction::AcceptToMemoryPool
1107 for (int i = 0; i < vin.size(); i++)
1109 COutPoint prevout = vin[i].prevout;
1110 assert(inputs.count(prevout.hash) > 0);
1111 CTxIndex& txindex = inputs[prevout.hash].first;
1112 CTransaction& txPrev = inputs[prevout.hash].second;
1114 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1115 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()));
1117 // If prev is coinbase, check that it's matured
1118 if (txPrev.IsCoinBase())
1119 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1120 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1121 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1123 // Check for conflicts (double-spend)
1124 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1125 // for an attacker to attempt to split the network.
1126 if (!txindex.vSpent[prevout.n].IsNull())
1127 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());
1129 // Check for negative or overflow input values
1130 nValueIn += txPrev.vout[prevout.n].nValue;
1131 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1132 return DoS(100, error("ConnectInputs() : txin values out of range"));
1134 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1135 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1136 // still computed and checked, and any change will be caught at the next checkpoint.
1137 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1140 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1142 // only during transition phase for P2SH: do not invoke anti-DoS code for
1143 // potentially old clients relaying bad P2SH transactions
1144 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1145 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1147 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1151 // Mark outpoints as spent
1152 txindex.vSpent[prevout.n] = posThisTx;
1155 if (fBlock || fMiner)
1157 mapTestPool[prevout.hash] = txindex;
1161 if (nValueIn < GetValueOut())
1162 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1164 // Tally transaction fees
1165 int64 nTxFee = nValueIn - GetValueOut();
1167 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1169 if (!MoneyRange(nFees))
1170 return DoS(100, error("ConnectInputs() : nFees out of range"));
1177 bool CTransaction::ClientConnectInputs()
1182 // Take over previous transactions' spent pointers
1186 for (int i = 0; i < vin.size(); i++)
1188 // Get prev tx from single transactions in memory
1189 COutPoint prevout = vin[i].prevout;
1190 if (!mempool.mapTx.count(prevout.hash))
1192 CTransaction& txPrev = mempool.mapTx[prevout.hash];
1194 if (prevout.n >= txPrev.vout.size())
1198 if (!VerifySignature(txPrev, *this, i, true, 0))
1199 return error("ConnectInputs() : VerifySignature failed");
1201 ///// this is redundant with the mempool.mapNextTx stuff,
1202 ///// not sure which I want to get rid of
1203 ///// this has to go away now that posNext is gone
1204 // // Check for conflicts
1205 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1206 // return error("ConnectInputs() : prev tx already used");
1208 // // Flag outpoints as used
1209 // txPrev.vout[prevout.n].posNext = posThisTx;
1211 nValueIn += txPrev.vout[prevout.n].nValue;
1213 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1214 return error("ClientConnectInputs() : txin values out of range");
1216 if (GetValueOut() > nValueIn)
1226 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1228 // Disconnect in reverse order
1229 for (int i = vtx.size()-1; i >= 0; i--)
1230 if (!vtx[i].DisconnectInputs(txdb))
1233 // Update block index on disk without changing it in memory.
1234 // The memory index structure will be changed after the db commits.
1237 CDiskBlockIndex blockindexPrev(pindex->pprev);
1238 blockindexPrev.hashNext = 0;
1239 if (!txdb.WriteBlockIndex(blockindexPrev))
1240 return error("DisconnectBlock() : WriteBlockIndex failed");
1246 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1248 // Check it again in case a previous version let a bad block in
1252 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1253 // unless those are already completely spent.
1254 // If such overwrites are allowed, coinbases and transactions depending upon those
1255 // can be duplicated to remove the ability to spend the first instance -- even after
1256 // being sent to another address.
1257 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1258 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1259 // already refuses previously-known transaction id's entirely.
1260 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1261 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1262 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1264 BOOST_FOREACH(CTransaction& tx, vtx)
1266 CTxIndex txindexOld;
1267 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1269 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1276 // BIP16 didn't become active until Apr 1 2012 (Feb 15 on testnet)
1277 int64 nBIP16SwitchTime = fTestNet ? 1329264000 : 1333238400;
1278 bool fStrictPayToScriptHash = (pindex->nTime >= nBIP16SwitchTime);
1280 //// issue here: it doesn't know the version
1281 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1283 map<uint256, CTxIndex> mapQueuedChanges;
1286 BOOST_FOREACH(CTransaction& tx, vtx)
1288 nSigOps += tx.GetLegacySigOpCount();
1289 if (nSigOps > MAX_BLOCK_SIGOPS)
1290 return DoS(100, error("ConnectBlock() : too many sigops"));
1292 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1293 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1295 MapPrevTx mapInputs;
1296 if (!tx.IsCoinBase())
1299 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1302 if (fStrictPayToScriptHash)
1304 // Add in sigops done by pay-to-script-hash inputs;
1305 // this is to prevent a "rogue miner" from creating
1306 // an incredibly-expensive-to-validate block.
1307 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1308 if (nSigOps > MAX_BLOCK_SIGOPS)
1309 return DoS(100, error("ConnectBlock() : too many sigops"));
1312 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1314 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1318 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1321 // Write queued txindex changes
1322 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1324 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1325 return error("ConnectBlock() : UpdateTxIndex failed");
1328 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1331 // Update block index on disk without changing it in memory.
1332 // The memory index structure will be changed after the db commits.
1335 CDiskBlockIndex blockindexPrev(pindex->pprev);
1336 blockindexPrev.hashNext = pindex->GetBlockHash();
1337 if (!txdb.WriteBlockIndex(blockindexPrev))
1338 return error("ConnectBlock() : WriteBlockIndex failed");
1341 // Watch for transactions paying to me
1342 BOOST_FOREACH(CTransaction& tx, vtx)
1343 SyncWithWallets(tx, this, true);
1348 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1350 printf("REORGANIZE\n");
1353 CBlockIndex* pfork = pindexBest;
1354 CBlockIndex* plonger = pindexNew;
1355 while (pfork != plonger)
1357 while (plonger->nHeight > pfork->nHeight)
1358 if (!(plonger = plonger->pprev))
1359 return error("Reorganize() : plonger->pprev is null");
1360 if (pfork == plonger)
1362 if (!(pfork = pfork->pprev))
1363 return error("Reorganize() : pfork->pprev is null");
1366 // List of what to disconnect
1367 vector<CBlockIndex*> vDisconnect;
1368 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1369 vDisconnect.push_back(pindex);
1371 // List of what to connect
1372 vector<CBlockIndex*> vConnect;
1373 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1374 vConnect.push_back(pindex);
1375 reverse(vConnect.begin(), vConnect.end());
1377 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());
1378 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());
1380 // Disconnect shorter branch
1381 vector<CTransaction> vResurrect;
1382 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1385 if (!block.ReadFromDisk(pindex))
1386 return error("Reorganize() : ReadFromDisk for disconnect failed");
1387 if (!block.DisconnectBlock(txdb, pindex))
1388 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1390 // Queue memory transactions to resurrect
1391 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1392 if (!tx.IsCoinBase())
1393 vResurrect.push_back(tx);
1396 // Connect longer branch
1397 vector<CTransaction> vDelete;
1398 for (int i = 0; i < vConnect.size(); i++)
1400 CBlockIndex* pindex = vConnect[i];
1402 if (!block.ReadFromDisk(pindex))
1403 return error("Reorganize() : ReadFromDisk for connect failed");
1404 if (!block.ConnectBlock(txdb, pindex))
1408 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1411 // Queue memory transactions to delete
1412 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1413 vDelete.push_back(tx);
1415 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1416 return error("Reorganize() : WriteHashBestChain failed");
1418 // Make sure it's successfully written to disk before changing memory structure
1419 if (!txdb.TxnCommit())
1420 return error("Reorganize() : TxnCommit failed");
1422 // Disconnect shorter branch
1423 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1425 pindex->pprev->pnext = NULL;
1427 // Connect longer branch
1428 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1430 pindex->pprev->pnext = pindex;
1432 // Resurrect memory transactions that were in the disconnected branch
1433 BOOST_FOREACH(CTransaction& tx, vResurrect)
1434 tx.AcceptToMemoryPool(txdb, false);
1436 // Delete redundant memory transactions that are in the connected branch
1437 BOOST_FOREACH(CTransaction& tx, vDelete)
1438 tx.RemoveFromMemoryPool();
1440 printf("REORGANIZE: done\n");
1447 runCommand(std::string strCommand)
1449 int nErr = ::system(strCommand.c_str());
1451 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1454 // Called from inside SetBestChain: attaches a block to the new best chain being built
1455 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1457 uint256 hash = GetHash();
1459 // Adding to current best branch
1460 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1463 InvalidChainFound(pindexNew);
1466 if (!txdb.TxnCommit())
1467 return error("SetBestChain() : TxnCommit failed");
1469 // Add to current best branch
1470 pindexNew->pprev->pnext = pindexNew;
1472 // Delete redundant memory transactions
1473 BOOST_FOREACH(CTransaction& tx, vtx)
1474 tx.RemoveFromMemoryPool();
1479 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1481 uint256 hash = GetHash();
1484 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1486 txdb.WriteHashBestChain(hash);
1487 if (!txdb.TxnCommit())
1488 return error("SetBestChain() : TxnCommit failed");
1489 pindexGenesisBlock = pindexNew;
1491 else if (hashPrevBlock == hashBestChain)
1493 if (!SetBestChainInner(txdb, pindexNew))
1494 return error("SetBestChain() : SetBestChainInner failed");
1498 // the first block in the new chain that will cause it to become the new best chain
1499 CBlockIndex *pindexIntermediate = pindexNew;
1501 // list of blocks that need to be connected afterwards
1502 std::vector<CBlockIndex*> vpindexSecondary;
1504 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1505 // Try to limit how much needs to be done inside
1506 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainWork > pindexBest->bnChainWork)
1508 vpindexSecondary.push_back(pindexIntermediate);
1509 pindexIntermediate = pindexIntermediate->pprev;
1512 if (!vpindexSecondary.empty())
1513 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1515 // Switch to new best branch
1516 if (!Reorganize(txdb, pindexIntermediate))
1519 InvalidChainFound(pindexNew);
1520 return error("SetBestChain() : Reorganize failed");
1523 // Connect futher blocks
1524 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1527 if (!block.ReadFromDisk(pindex))
1529 printf("SetBestChain() : ReadFromDisk failed\n");
1533 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1534 if (!block.SetBestChainInner(txdb, pindex))
1539 // Update best block in wallet (so we can detect restored wallets)
1540 bool fIsInitialDownload = IsInitialBlockDownload();
1541 if (!fIsInitialDownload)
1543 const CBlockLocator locator(pindexNew);
1544 ::SetBestChain(locator);
1548 hashBestChain = hash;
1549 pindexBest = pindexNew;
1550 nBestHeight = pindexBest->nHeight;
1551 bnBestChainWork = pindexNew->bnChainWork;
1552 nTimeBestReceived = GetTime();
1553 nTransactionsUpdated++;
1554 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1556 std::string strCmd = GetArg("-blocknotify", "");
1558 if (!fIsInitialDownload && !strCmd.empty())
1560 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1561 boost::thread t(runCommand, strCmd); // thread runs free
1568 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1570 // Check for duplicate
1571 uint256 hash = GetHash();
1572 if (mapBlockIndex.count(hash))
1573 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1575 // Construct new block index object
1576 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1578 return error("AddToBlockIndex() : new CBlockIndex failed");
1579 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1580 pindexNew->phashBlock = &((*mi).first);
1581 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1582 if (miPrev != mapBlockIndex.end())
1584 pindexNew->pprev = (*miPrev).second;
1585 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1587 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1591 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1592 if (!txdb.TxnCommit())
1596 if (pindexNew->bnChainWork > bnBestChainWork)
1597 if (!SetBestChain(txdb, pindexNew))
1602 if (pindexNew == pindexBest)
1604 // Notify UI to display prev block's coinbase if it was ours
1605 static uint256 hashPrevBestCoinBase;
1606 UpdatedTransaction(hashPrevBestCoinBase);
1607 hashPrevBestCoinBase = vtx[0].GetHash();
1617 bool CBlock::CheckBlock() const
1619 // These are checks that are independent of context
1620 // that can be verified before saving an orphan block.
1623 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1624 return DoS(100, error("CheckBlock() : size limits failed"));
1626 // Check proof of work matches claimed amount
1627 if (!CheckProofOfWork(GetHash(), nBits))
1628 return DoS(50, error("CheckBlock() : proof of work failed"));
1631 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1632 return error("CheckBlock() : block timestamp too far in the future");
1634 // First transaction must be coinbase, the rest must not be
1635 if (vtx.empty() || !vtx[0].IsCoinBase())
1636 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1637 for (int i = 1; i < vtx.size(); i++)
1638 if (vtx[i].IsCoinBase())
1639 return DoS(100, error("CheckBlock() : more than one coinbase"));
1641 // Check transactions
1642 BOOST_FOREACH(const CTransaction& tx, vtx)
1643 if (!tx.CheckTransaction())
1644 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1647 BOOST_FOREACH(const CTransaction& tx, vtx)
1649 nSigOps += tx.GetLegacySigOpCount();
1651 if (nSigOps > MAX_BLOCK_SIGOPS)
1652 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1655 if (hashMerkleRoot != BuildMerkleTree())
1656 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1661 bool CBlock::AcceptBlock()
1663 // Check for duplicate
1664 uint256 hash = GetHash();
1665 if (mapBlockIndex.count(hash))
1666 return error("AcceptBlock() : block already in mapBlockIndex");
1668 // Get prev block index
1669 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1670 if (mi == mapBlockIndex.end())
1671 return DoS(10, error("AcceptBlock() : prev block not found"));
1672 CBlockIndex* pindexPrev = (*mi).second;
1673 int nHeight = pindexPrev->nHeight+1;
1675 // Check proof of work
1676 if (nBits != GetNextWorkRequired(pindexPrev, this))
1677 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1679 // Check timestamp against prev
1680 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1681 return error("AcceptBlock() : block's timestamp is too early");
1683 // Check that all transactions are finalized
1684 BOOST_FOREACH(const CTransaction& tx, vtx)
1685 if (!tx.IsFinal(nHeight, GetBlockTime()))
1686 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1688 // Check that the block chain matches the known block chain up to a checkpoint
1689 if (!Checkpoints::CheckBlock(nHeight, hash))
1690 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1692 // Write block to history file
1693 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1694 return error("AcceptBlock() : out of disk space");
1695 unsigned int nFile = -1;
1696 unsigned int nBlockPos = 0;
1697 if (!WriteToDisk(nFile, nBlockPos))
1698 return error("AcceptBlock() : WriteToDisk failed");
1699 if (!AddToBlockIndex(nFile, nBlockPos))
1700 return error("AcceptBlock() : AddToBlockIndex failed");
1702 // Relay inventory, but don't relay old inventory during initial block download
1703 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1704 if (hashBestChain == hash)
1707 BOOST_FOREACH(CNode* pnode, vNodes)
1708 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1709 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1715 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1717 // Check for duplicate
1718 uint256 hash = pblock->GetHash();
1719 if (mapBlockIndex.count(hash))
1720 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1721 if (mapOrphanBlocks.count(hash))
1722 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1724 // Preliminary checks
1725 if (!pblock->CheckBlock())
1726 return error("ProcessBlock() : CheckBlock FAILED");
1728 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1729 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1731 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1732 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1736 pfrom->Misbehaving(100);
1737 return error("ProcessBlock() : block with timestamp before last checkpoint");
1740 bnNewBlock.SetCompact(pblock->nBits);
1742 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1743 if (bnNewBlock > bnRequired)
1746 pfrom->Misbehaving(100);
1747 return error("ProcessBlock() : block with too little proof-of-work");
1752 // If don't already have its previous block, shunt it off to holding area until we get it
1753 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1755 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1756 CBlock* pblock2 = new CBlock(*pblock);
1757 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1758 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1760 // Ask this guy to fill in what we're missing
1762 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1767 if (!pblock->AcceptBlock())
1768 return error("ProcessBlock() : AcceptBlock FAILED");
1770 // Recursively process any orphan blocks that depended on this one
1771 vector<uint256> vWorkQueue;
1772 vWorkQueue.push_back(hash);
1773 for (int i = 0; i < vWorkQueue.size(); i++)
1775 uint256 hashPrev = vWorkQueue[i];
1776 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1777 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1780 CBlock* pblockOrphan = (*mi).second;
1781 if (pblockOrphan->AcceptBlock())
1782 vWorkQueue.push_back(pblockOrphan->GetHash());
1783 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1784 delete pblockOrphan;
1786 mapOrphanBlocksByPrev.erase(hashPrev);
1789 printf("ProcessBlock: ACCEPTED\n");
1800 bool CheckDiskSpace(uint64 nAdditionalBytes)
1802 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1804 // Check for 15MB because database could create another 10MB log file at any time
1805 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1808 string strMessage = _("Warning: Disk space is low ");
1809 strMiscWarning = strMessage;
1810 printf("*** %s\n", strMessage.c_str());
1811 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
1818 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1822 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
1825 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1827 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1836 static unsigned int nCurrentBlockFile = 1;
1838 FILE* AppendBlockFile(unsigned int& nFileRet)
1843 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1846 if (fseek(file, 0, SEEK_END) != 0)
1848 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1849 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1851 nFileRet = nCurrentBlockFile;
1855 nCurrentBlockFile++;
1859 bool LoadBlockIndex(bool fAllowNew)
1863 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1864 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1865 pchMessageStart[0] = 0xfa;
1866 pchMessageStart[1] = 0xbf;
1867 pchMessageStart[2] = 0xb5;
1868 pchMessageStart[3] = 0xda;
1875 if (!txdb.LoadBlockIndex())
1880 // Init with genesis block
1882 if (mapBlockIndex.empty())
1888 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1889 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1890 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1891 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1892 // vMerkleTree: 4a5e1e
1895 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1897 txNew.vin.resize(1);
1898 txNew.vout.resize(1);
1899 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1900 txNew.vout[0].nValue = 50 * COIN;
1901 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1903 block.vtx.push_back(txNew);
1904 block.hashPrevBlock = 0;
1905 block.hashMerkleRoot = block.BuildMerkleTree();
1907 block.nTime = 1231006505;
1908 block.nBits = 0x1d00ffff;
1909 block.nNonce = 2083236893;
1913 block.nTime = 1296688602;
1914 block.nBits = 0x1d07fff8;
1915 block.nNonce = 384568319;
1919 printf("%s\n", block.GetHash().ToString().c_str());
1920 printf("%s\n", hashGenesisBlock.ToString().c_str());
1921 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1922 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1924 assert(block.GetHash() == hashGenesisBlock);
1926 // Start new block file
1928 unsigned int nBlockPos;
1929 if (!block.WriteToDisk(nFile, nBlockPos))
1930 return error("LoadBlockIndex() : writing genesis block to disk failed");
1931 if (!block.AddToBlockIndex(nFile, nBlockPos))
1932 return error("LoadBlockIndex() : genesis block not accepted");
1940 void PrintBlockTree()
1942 // precompute tree structure
1943 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1944 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1946 CBlockIndex* pindex = (*mi).second;
1947 mapNext[pindex->pprev].push_back(pindex);
1949 //while (rand() % 3 == 0)
1950 // mapNext[pindex->pprev].push_back(pindex);
1953 vector<pair<int, CBlockIndex*> > vStack;
1954 vStack.push_back(make_pair(0, pindexGenesisBlock));
1957 while (!vStack.empty())
1959 int nCol = vStack.back().first;
1960 CBlockIndex* pindex = vStack.back().second;
1963 // print split or gap
1964 if (nCol > nPrevCol)
1966 for (int i = 0; i < nCol-1; i++)
1970 else if (nCol < nPrevCol)
1972 for (int i = 0; i < nCol; i++)
1979 for (int i = 0; i < nCol; i++)
1984 block.ReadFromDisk(pindex);
1985 printf("%d (%u,%u) %s %s tx %d",
1989 block.GetHash().ToString().substr(0,20).c_str(),
1990 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1993 PrintWallets(block);
1995 // put the main timechain first
1996 vector<CBlockIndex*>& vNext = mapNext[pindex];
1997 for (int i = 0; i < vNext.size(); i++)
1999 if (vNext[i]->pnext)
2001 swap(vNext[0], vNext[i]);
2007 for (int i = 0; i < vNext.size(); i++)
2008 vStack.push_back(make_pair(nCol+i, vNext[i]));
2021 //////////////////////////////////////////////////////////////////////////////
2026 map<uint256, CAlert> mapAlerts;
2027 CCriticalSection cs_mapAlerts;
2029 string GetWarnings(string strFor)
2032 string strStatusBar;
2034 if (GetBoolArg("-testsafemode"))
2037 // Misc warnings like out of disk space and clock is wrong
2038 if (strMiscWarning != "")
2041 strStatusBar = strMiscWarning;
2044 // Longer invalid proof-of-work chain
2045 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2048 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2054 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2056 const CAlert& alert = item.second;
2057 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2059 nPriority = alert.nPriority;
2060 strStatusBar = alert.strStatusBar;
2065 if (strFor == "statusbar")
2066 return strStatusBar;
2067 else if (strFor == "rpc")
2069 assert(!"GetWarnings() : invalid parameter");
2073 bool CAlert::ProcessAlert()
2075 if (!CheckSignature())
2082 // Cancel previous alerts
2083 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2085 const CAlert& alert = (*mi).second;
2088 printf("cancelling alert %d\n", alert.nID);
2089 mapAlerts.erase(mi++);
2091 else if (!alert.IsInEffect())
2093 printf("expiring alert %d\n", alert.nID);
2094 mapAlerts.erase(mi++);
2100 // Check if this alert has been cancelled
2101 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2103 const CAlert& alert = item.second;
2104 if (alert.Cancels(*this))
2106 printf("alert already cancelled by %d\n", alert.nID);
2112 mapAlerts.insert(make_pair(GetHash(), *this));
2115 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2127 //////////////////////////////////////////////////////////////////////////////
2133 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2137 case MSG_TX: return mempool.mapTx.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2138 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2140 // Don't know what it is, just say we already got one
2147 // The message start string is designed to be unlikely to occur in normal data.
2148 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2149 // a large 4-byte int at any alignment.
2150 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2153 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2155 static map<CService, vector<unsigned char> > mapReuseKey;
2156 RandAddSeedPerfmon();
2158 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2159 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2161 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2163 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2171 if (strCommand == "version")
2173 // Each connection can only send one version message
2174 if (pfrom->nVersion != 0)
2176 pfrom->Misbehaving(1);
2184 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2185 if (pfrom->nVersion < 209)
2187 // Since February 20, 2012, the protocol is initiated at version 209,
2188 // and earlier versions are no longer supported
2189 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2190 pfrom->fDisconnect = true;
2194 if (pfrom->nVersion == 10300)
2195 pfrom->nVersion = 300;
2197 vRecv >> addrFrom >> nNonce;
2199 vRecv >> pfrom->strSubVer;
2201 vRecv >> pfrom->nStartingHeight;
2203 // Disconnect if we connected to ourself
2204 if (nNonce == nLocalHostNonce && nNonce > 1)
2206 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2207 pfrom->fDisconnect = true;
2211 // Be shy and don't send version until we hear
2212 if (pfrom->fInbound)
2213 pfrom->PushVersion();
2215 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2217 AddTimeData(pfrom->addr, nTime);
2220 pfrom->PushMessage("verack");
2221 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2223 if (!pfrom->fInbound)
2225 // Advertise our address
2226 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2227 !IsInitialBlockDownload())
2229 CAddress addr(addrLocalHost);
2230 addr.nTime = GetAdjustedTime();
2231 pfrom->PushAddress(addr);
2234 // Get recent addresses
2235 if (pfrom->nVersion >= 31402 || addrman.size() < 1000)
2237 pfrom->PushMessage("getaddr");
2238 pfrom->fGetAddr = true;
2240 addrman.Good(pfrom->addr);
2242 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2244 addrman.Add(addrFrom, addrFrom);
2245 addrman.Good(addrFrom);
2249 // Ask the first connected node for block updates
2250 static int nAskedForBlocks = 0;
2251 if (!pfrom->fClient &&
2252 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2253 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2256 pfrom->PushGetBlocks(pindexBest, uint256(0));
2262 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2263 item.second.RelayTo(pfrom);
2266 pfrom->fSuccessfullyConnected = true;
2268 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2270 cPeerBlockCounts.input(pfrom->nStartingHeight);
2274 else if (pfrom->nVersion == 0)
2276 // Must have a version message before anything else
2277 pfrom->Misbehaving(1);
2282 else if (strCommand == "verack")
2284 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2288 else if (strCommand == "addr")
2290 vector<CAddress> vAddr;
2293 // Don't want addr from older versions unless seeding
2294 if (pfrom->nVersion < 31402 && addrman.size() > 1000)
2296 if (vAddr.size() > 1000)
2298 pfrom->Misbehaving(20);
2299 return error("message addr size() = %d", vAddr.size());
2302 // Store the new addresses
2303 int64 nNow = GetAdjustedTime();
2304 int64 nSince = nNow - 10 * 60;
2305 BOOST_FOREACH(CAddress& addr, vAddr)
2309 // ignore IPv6 for now, since it isn't implemented anyway
2312 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2313 addr.nTime = nNow - 5 * 24 * 60 * 60;
2314 pfrom->AddAddressKnown(addr);
2315 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2317 // Relay to a limited number of other nodes
2320 // Use deterministic randomness to send to the same nodes for 24 hours
2321 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2322 static uint256 hashSalt;
2324 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2325 int64 hashAddr = addr.GetHash();
2326 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2327 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2328 multimap<uint256, CNode*> mapMix;
2329 BOOST_FOREACH(CNode* pnode, vNodes)
2331 if (pnode->nVersion < 31402)
2333 unsigned int nPointer;
2334 memcpy(&nPointer, &pnode, sizeof(nPointer));
2335 uint256 hashKey = hashRand ^ nPointer;
2336 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2337 mapMix.insert(make_pair(hashKey, pnode));
2339 int nRelayNodes = 2;
2340 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2341 ((*mi).second)->PushAddress(addr);
2345 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2346 if (vAddr.size() < 1000)
2347 pfrom->fGetAddr = false;
2351 else if (strCommand == "inv")
2355 if (vInv.size() > 50000)
2357 pfrom->Misbehaving(20);
2358 return error("message inv size() = %d", vInv.size());
2362 for (int nInv = 0; nInv < vInv.size(); nInv++)
2364 const CInv &inv = vInv[nInv];
2368 pfrom->AddInventoryKnown(inv);
2370 bool fAlreadyHave = AlreadyHave(txdb, inv);
2372 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2374 // Always request the last block in an inv bundle (even if we already have it), as it is the
2375 // trigger for the other side to send further invs. If we are stuck on a (very long) side chain,
2376 // this is necessary to connect earlier received orphan blocks to the chain again.
2377 if (!fAlreadyHave || (inv.type == MSG_BLOCK && nInv==vInv.size()-1))
2379 if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2380 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2382 // Track requests for our stuff
2383 Inventory(inv.hash);
2388 else if (strCommand == "getdata")
2392 if (vInv.size() > 50000)
2394 pfrom->Misbehaving(20);
2395 return error("message getdata size() = %d", vInv.size());
2398 BOOST_FOREACH(const CInv& inv, vInv)
2402 printf("received getdata for: %s\n", inv.ToString().c_str());
2404 if (inv.type == MSG_BLOCK)
2406 // Send block from disk
2407 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2408 if (mi != mapBlockIndex.end())
2411 block.ReadFromDisk((*mi).second);
2412 pfrom->PushMessage("block", block);
2414 // Trigger them to send a getblocks request for the next batch of inventory
2415 if (inv.hash == pfrom->hashContinue)
2417 // Bypass PushInventory, this must send even if redundant,
2418 // and we want it right after the last block so they don't
2419 // wait for other stuff first.
2421 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2422 pfrom->PushMessage("inv", vInv);
2423 pfrom->hashContinue = 0;
2427 else if (inv.IsKnownType())
2429 // Send stream from relay memory
2432 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2433 if (mi != mapRelay.end())
2434 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2438 // Track requests for our stuff
2439 Inventory(inv.hash);
2444 else if (strCommand == "getblocks")
2446 CBlockLocator locator;
2448 vRecv >> locator >> hashStop;
2450 // Find the last block the caller has in the main chain
2451 CBlockIndex* pindex = locator.GetBlockIndex();
2453 // Send the rest of the chain
2455 pindex = pindex->pnext;
2456 int nLimit = 500 + locator.GetDistanceBack();
2457 unsigned int nBytes = 0;
2458 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2459 for (; pindex; pindex = pindex->pnext)
2461 if (pindex->GetBlockHash() == hashStop)
2463 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2466 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2468 block.ReadFromDisk(pindex, true);
2469 nBytes += block.GetSerializeSize(SER_NETWORK);
2470 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2472 // When this block is requested, we'll send an inv that'll make them
2473 // getblocks the next batch of inventory.
2474 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2475 pfrom->hashContinue = pindex->GetBlockHash();
2482 else if (strCommand == "getheaders")
2484 CBlockLocator locator;
2486 vRecv >> locator >> hashStop;
2488 CBlockIndex* pindex = NULL;
2489 if (locator.IsNull())
2491 // If locator is null, return the hashStop block
2492 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2493 if (mi == mapBlockIndex.end())
2495 pindex = (*mi).second;
2499 // Find the last block the caller has in the main chain
2500 pindex = locator.GetBlockIndex();
2502 pindex = pindex->pnext;
2505 vector<CBlock> vHeaders;
2507 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
2508 for (; pindex; pindex = pindex->pnext)
2510 vHeaders.push_back(pindex->GetBlockHeader());
2511 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2514 pfrom->PushMessage("headers", vHeaders);
2518 else if (strCommand == "tx")
2520 vector<uint256> vWorkQueue;
2521 CDataStream vMsg(vRecv);
2526 CInv inv(MSG_TX, tx.GetHash());
2527 pfrom->AddInventoryKnown(inv);
2529 bool fMissingInputs = false;
2530 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
2532 SyncWithWallets(tx, NULL, true);
2533 RelayMessage(inv, vMsg);
2534 mapAlreadyAskedFor.erase(inv);
2535 vWorkQueue.push_back(inv.hash);
2537 // Recursively process any orphan transactions that depended on this one
2538 for (int i = 0; i < vWorkQueue.size(); i++)
2540 uint256 hashPrev = vWorkQueue[i];
2541 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2542 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2545 const CDataStream& vMsg = *((*mi).second);
2547 CDataStream(vMsg) >> tx;
2548 CInv inv(MSG_TX, tx.GetHash());
2550 if (tx.AcceptToMemoryPool(txdb, true))
2552 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2553 SyncWithWallets(tx, NULL, true);
2554 RelayMessage(inv, vMsg);
2555 mapAlreadyAskedFor.erase(inv);
2556 vWorkQueue.push_back(inv.hash);
2561 BOOST_FOREACH(uint256 hash, vWorkQueue)
2562 EraseOrphanTx(hash);
2564 else if (fMissingInputs)
2566 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2569 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2570 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2572 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2574 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2578 else if (strCommand == "block")
2583 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2586 CInv inv(MSG_BLOCK, block.GetHash());
2587 pfrom->AddInventoryKnown(inv);
2589 if (ProcessBlock(pfrom, &block))
2590 mapAlreadyAskedFor.erase(inv);
2591 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2595 else if (strCommand == "getaddr")
2597 pfrom->vAddrToSend.clear();
2598 vector<CAddress> vAddr = addrman.GetAddr();
2599 BOOST_FOREACH(const CAddress &addr, vAddr)
2600 pfrom->PushAddress(addr);
2604 else if (strCommand == "checkorder")
2609 if (!GetBoolArg("-allowreceivebyip"))
2611 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2618 /// we have a chance to check the order here
2620 // Keep giving the same key to the same ip until they use it
2621 if (!mapReuseKey.count(pfrom->addr))
2622 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2624 // Send back approval of order and pubkey to use
2625 CScript scriptPubKey;
2626 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2627 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2631 else if (strCommand == "reply")
2636 CRequestTracker tracker;
2638 LOCK(pfrom->cs_mapRequests);
2639 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2640 if (mi != pfrom->mapRequests.end())
2642 tracker = (*mi).second;
2643 pfrom->mapRequests.erase(mi);
2646 if (!tracker.IsNull())
2647 tracker.fn(tracker.param1, vRecv);
2651 else if (strCommand == "ping")
2656 else if (strCommand == "alert")
2661 if (alert.ProcessAlert())
2664 pfrom->setKnown.insert(alert.GetHash());
2667 BOOST_FOREACH(CNode* pnode, vNodes)
2668 alert.RelayTo(pnode);
2676 // Ignore unknown commands for extensibility
2680 // Update the last seen time for this node's address
2681 if (pfrom->fNetworkNode)
2682 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2683 AddressCurrentlyConnected(pfrom->addr);
2689 bool ProcessMessages(CNode* pfrom)
2691 CDataStream& vRecv = pfrom->vRecv;
2695 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2699 // (4) message start
2708 // Scan for message start
2709 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2710 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2711 if (vRecv.end() - pstart < nHeaderSize)
2713 if (vRecv.size() > nHeaderSize)
2715 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2716 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2720 if (pstart - vRecv.begin() > 0)
2721 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2722 vRecv.erase(vRecv.begin(), pstart);
2725 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2730 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2733 string strCommand = hdr.GetCommand();
2736 unsigned int nMessageSize = hdr.nMessageSize;
2737 if (nMessageSize > MAX_SIZE)
2739 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2742 if (nMessageSize > vRecv.size())
2744 // Rewind and wait for rest of message
2745 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2750 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2751 unsigned int nChecksum = 0;
2752 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2753 if (nChecksum != hdr.nChecksum)
2755 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2756 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2760 // Copy message to its own buffer
2761 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2762 vRecv.ignore(nMessageSize);
2770 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2775 catch (std::ios_base::failure& e)
2777 if (strstr(e.what(), "end of data"))
2779 // Allow exceptions from underlength message on vRecv
2780 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());
2782 else if (strstr(e.what(), "size too large"))
2784 // Allow exceptions from overlong size
2785 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2789 PrintExceptionContinue(&e, "ProcessMessage()");
2792 catch (std::exception& e) {
2793 PrintExceptionContinue(&e, "ProcessMessage()");
2795 PrintExceptionContinue(NULL, "ProcessMessage()");
2799 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2807 bool SendMessages(CNode* pto, bool fSendTrickle)
2811 // Don't send anything until we get their version message
2812 if (pto->nVersion == 0)
2816 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2817 pto->PushMessage("ping");
2819 // Resend wallet transactions that haven't gotten in a block yet
2820 ResendWalletTransactions();
2822 // Address refresh broadcast
2823 static int64 nLastRebroadcast;
2824 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2828 BOOST_FOREACH(CNode* pnode, vNodes)
2830 // Periodically clear setAddrKnown to allow refresh broadcasts
2831 if (nLastRebroadcast)
2832 pnode->setAddrKnown.clear();
2834 // Rebroadcast our address
2835 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2837 CAddress addr(addrLocalHost);
2838 addr.nTime = GetAdjustedTime();
2839 pnode->PushAddress(addr);
2843 nLastRebroadcast = GetTime();
2851 vector<CAddress> vAddr;
2852 vAddr.reserve(pto->vAddrToSend.size());
2853 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2855 // returns true if wasn't already contained in the set
2856 if (pto->setAddrKnown.insert(addr).second)
2858 vAddr.push_back(addr);
2859 // receiver rejects addr messages larger than 1000
2860 if (vAddr.size() >= 1000)
2862 pto->PushMessage("addr", vAddr);
2867 pto->vAddrToSend.clear();
2869 pto->PushMessage("addr", vAddr);
2874 // Message: inventory
2877 vector<CInv> vInvWait;
2879 LOCK(pto->cs_inventory);
2880 vInv.reserve(pto->vInventoryToSend.size());
2881 vInvWait.reserve(pto->vInventoryToSend.size());
2882 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2884 if (pto->setInventoryKnown.count(inv))
2887 // trickle out tx inv to protect privacy
2888 if (inv.type == MSG_TX && !fSendTrickle)
2890 // 1/4 of tx invs blast to all immediately
2891 static uint256 hashSalt;
2893 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2894 uint256 hashRand = inv.hash ^ hashSalt;
2895 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2896 bool fTrickleWait = ((hashRand & 3) != 0);
2898 // always trickle our own transactions
2902 if (GetTransaction(inv.hash, wtx))
2904 fTrickleWait = true;
2909 vInvWait.push_back(inv);
2914 // returns true if wasn't already contained in the set
2915 if (pto->setInventoryKnown.insert(inv).second)
2917 vInv.push_back(inv);
2918 if (vInv.size() >= 1000)
2920 pto->PushMessage("inv", vInv);
2925 pto->vInventoryToSend = vInvWait;
2928 pto->PushMessage("inv", vInv);
2934 vector<CInv> vGetData;
2935 int64 nNow = GetTime() * 1000000;
2937 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2939 const CInv& inv = (*pto->mapAskFor.begin()).second;
2940 if (!AlreadyHave(txdb, inv))
2942 printf("sending getdata: %s\n", inv.ToString().c_str());
2943 vGetData.push_back(inv);
2944 if (vGetData.size() >= 1000)
2946 pto->PushMessage("getdata", vGetData);
2950 mapAlreadyAskedFor[inv] = nNow;
2951 pto->mapAskFor.erase(pto->mapAskFor.begin());
2953 if (!vGetData.empty())
2954 pto->PushMessage("getdata", vGetData);
2973 //////////////////////////////////////////////////////////////////////////////
2978 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2980 unsigned char* pdata = (unsigned char*)pbuffer;
2981 unsigned int blocks = 1 + ((len + 8) / 64);
2982 unsigned char* pend = pdata + 64 * blocks;
2983 memset(pdata + len, 0, 64 * blocks - len);
2985 unsigned int bits = len * 8;
2986 pend[-1] = (bits >> 0) & 0xff;
2987 pend[-2] = (bits >> 8) & 0xff;
2988 pend[-3] = (bits >> 16) & 0xff;
2989 pend[-4] = (bits >> 24) & 0xff;
2993 static const unsigned int pSHA256InitState[8] =
2994 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2996 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2999 unsigned char data[64];
3003 for (int i = 0; i < 16; i++)
3004 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3006 for (int i = 0; i < 8; i++)
3007 ctx.h[i] = ((uint32_t*)pinit)[i];
3009 SHA256_Update(&ctx, data, sizeof(data));
3010 for (int i = 0; i < 8; i++)
3011 ((uint32_t*)pstate)[i] = ctx.h[i];
3015 // ScanHash scans nonces looking for a hash with at least some zero bits.
3016 // It operates on big endian data. Caller does the byte reversing.
3017 // All input buffers are 16-byte aligned. nNonce is usually preserved
3018 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3019 // the block is rebuilt and nNonce starts over at zero.
3021 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3023 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3027 // Hash pdata using pmidstate as the starting state into
3028 // preformatted buffer phash1, then hash phash1 into phash
3030 SHA256Transform(phash1, pdata, pmidstate);
3031 SHA256Transform(phash, phash1, pSHA256InitState);
3033 // Return the nonce if the hash has at least some zero bits,
3034 // caller will check if it has enough to reach the target
3035 if (((unsigned short*)phash)[14] == 0)
3038 // If nothing found after trying for a while, return -1
3039 if ((nNonce & 0xffff) == 0)
3041 nHashesDone = 0xffff+1;
3047 // Some explaining would be appreciated
3052 set<uint256> setDependsOn;
3055 COrphan(CTransaction* ptxIn)
3063 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3064 BOOST_FOREACH(uint256 hash, setDependsOn)
3065 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3070 uint64 nLastBlockTx = 0;
3071 uint64 nLastBlockSize = 0;
3073 CBlock* CreateNewBlock(CReserveKey& reservekey)
3075 CBlockIndex* pindexPrev = pindexBest;
3078 auto_ptr<CBlock> pblock(new CBlock());
3082 // Create coinbase tx
3084 txNew.vin.resize(1);
3085 txNew.vin[0].prevout.SetNull();
3086 txNew.vout.resize(1);
3087 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3089 // Add our coinbase tx as first transaction
3090 pblock->vtx.push_back(txNew);
3092 // Collect memory pool transactions into the block
3095 LOCK2(cs_main, mempool.cs);
3098 // Priority order to process transactions
3099 list<COrphan> vOrphan; // list memory doesn't move
3100 map<uint256, vector<COrphan*> > mapDependers;
3101 multimap<double, CTransaction*> mapPriority;
3102 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
3104 CTransaction& tx = (*mi).second;
3105 if (tx.IsCoinBase() || !tx.IsFinal())
3108 COrphan* porphan = NULL;
3109 double dPriority = 0;
3110 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3112 // Read prev transaction
3113 CTransaction txPrev;
3115 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3117 // Has to wait for dependencies
3120 // Use list for automatic deletion
3121 vOrphan.push_back(COrphan(&tx));
3122 porphan = &vOrphan.back();
3124 mapDependers[txin.prevout.hash].push_back(porphan);
3125 porphan->setDependsOn.insert(txin.prevout.hash);
3128 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3130 // Read block header
3131 int nConf = txindex.GetDepthInMainChain();
3133 dPriority += (double)nValueIn * nConf;
3135 if (fDebug && GetBoolArg("-printpriority"))
3136 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3139 // Priority is sum(valuein * age) / txsize
3140 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3143 porphan->dPriority = dPriority;
3145 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3147 if (fDebug && GetBoolArg("-printpriority"))
3149 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3156 // Collect transactions into block
3157 map<uint256, CTxIndex> mapTestPool;
3158 uint64 nBlockSize = 1000;
3159 uint64 nBlockTx = 0;
3160 int nBlockSigOps = 100;
3161 while (!mapPriority.empty())
3163 // Take highest priority transaction off priority queue
3164 double dPriority = -(*mapPriority.begin()).first;
3165 CTransaction& tx = *(*mapPriority.begin()).second;
3166 mapPriority.erase(mapPriority.begin());
3169 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3170 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3173 // Legacy limits on sigOps:
3174 int nTxSigOps = tx.GetLegacySigOpCount();
3175 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3178 // Transaction fee required depends on block size
3179 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3180 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3182 // Connecting shouldn't fail due to dependency on other memory pool transactions
3183 // because we're already processing them in order of dependency
3184 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3185 MapPrevTx mapInputs;
3187 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3190 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3191 if (nTxFees < nMinFee)
3194 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3195 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3198 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3200 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3201 swap(mapTestPool, mapTestPoolTmp);
3204 pblock->vtx.push_back(tx);
3205 nBlockSize += nTxSize;
3207 nBlockSigOps += nTxSigOps;
3210 // Add transactions that depend on this one to the priority queue
3211 uint256 hash = tx.GetHash();
3212 if (mapDependers.count(hash))
3214 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3216 if (!porphan->setDependsOn.empty())
3218 porphan->setDependsOn.erase(hash);
3219 if (porphan->setDependsOn.empty())
3220 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3226 nLastBlockTx = nBlockTx;
3227 nLastBlockSize = nBlockSize;
3228 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3231 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3234 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3235 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3236 pblock->UpdateTime(pindexPrev);
3237 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3240 return pblock.release();
3244 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3246 // Update nExtraNonce
3247 static uint256 hashPrevBlock;
3248 if (hashPrevBlock != pblock->hashPrevBlock)
3251 hashPrevBlock = pblock->hashPrevBlock;
3254 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3255 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3257 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3261 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3264 // Prebuild hash buffers
3271 uint256 hashPrevBlock;
3272 uint256 hashMerkleRoot;
3275 unsigned int nNonce;
3278 unsigned char pchPadding0[64];
3280 unsigned char pchPadding1[64];
3283 memset(&tmp, 0, sizeof(tmp));
3285 tmp.block.nVersion = pblock->nVersion;
3286 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3287 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3288 tmp.block.nTime = pblock->nTime;
3289 tmp.block.nBits = pblock->nBits;
3290 tmp.block.nNonce = pblock->nNonce;
3292 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3293 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3295 // Byte swap all the input buffer
3296 for (int i = 0; i < sizeof(tmp)/4; i++)
3297 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3299 // Precalc the first half of the first hash, which stays constant
3300 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3302 memcpy(pdata, &tmp.block, 128);
3303 memcpy(phash1, &tmp.hash1, 64);
3307 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3309 uint256 hash = pblock->GetHash();
3310 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3312 if (hash > hashTarget)
3316 printf("BitcoinMiner:\n");
3317 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3319 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3320 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3325 if (pblock->hashPrevBlock != hashBestChain)
3326 return error("BitcoinMiner : generated block is stale");
3328 // Remove key from key pool
3329 reservekey.KeepKey();
3331 // Track how many getdata requests this block gets
3333 LOCK(wallet.cs_wallet);
3334 wallet.mapRequestCount[pblock->GetHash()] = 0;
3337 // Process this block the same as if we had received it from another node
3338 if (!ProcessBlock(NULL, pblock))
3339 return error("BitcoinMiner : ProcessBlock, block not accepted");
3345 void static ThreadBitcoinMiner(void* parg);
3347 static bool fGenerateBitcoins = false;
3348 static bool fLimitProcessors = false;
3349 static int nLimitProcessors = -1;
3351 void static BitcoinMiner(CWallet *pwallet)
3353 printf("BitcoinMiner started\n");
3354 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3356 // Each thread has its own key and counter
3357 CReserveKey reservekey(pwallet);
3358 unsigned int nExtraNonce = 0;
3360 while (fGenerateBitcoins)
3364 while (vNodes.empty() || IsInitialBlockDownload())
3369 if (!fGenerateBitcoins)
3377 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3378 CBlockIndex* pindexPrev = pindexBest;
3380 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3383 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3385 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3389 // Prebuild hash buffers
3391 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3392 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3393 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3395 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3397 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3398 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3399 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3405 int64 nStart = GetTime();
3406 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3408 uint256& hash = *alignup<16>(hashbuf);
3411 unsigned int nHashesDone = 0;
3412 unsigned int nNonceFound;
3415 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3416 (char*)&hash, nHashesDone);
3418 // Check if something found
3419 if (nNonceFound != -1)
3421 for (int i = 0; i < sizeof(hash)/4; i++)
3422 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3424 if (hash <= hashTarget)
3427 pblock->nNonce = ByteReverse(nNonceFound);
3428 assert(hash == pblock->GetHash());
3430 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3431 CheckWork(pblock.get(), *pwalletMain, reservekey);
3432 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3438 static int64 nHashCounter;
3439 if (nHPSTimerStart == 0)
3441 nHPSTimerStart = GetTimeMillis();
3445 nHashCounter += nHashesDone;
3446 if (GetTimeMillis() - nHPSTimerStart > 4000)
3448 static CCriticalSection cs;
3451 if (GetTimeMillis() - nHPSTimerStart > 4000)
3453 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3454 nHPSTimerStart = GetTimeMillis();
3456 static int64 nLogTime;
3457 if (GetTime() - nLogTime > 30 * 60)
3459 nLogTime = GetTime();
3460 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3461 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
3467 // Check for stop or if block needs to be rebuilt
3470 if (!fGenerateBitcoins)
3472 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
3476 if (nBlockNonce >= 0xffff0000)
3478 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3480 if (pindexPrev != pindexBest)
3483 // Update nTime every few seconds
3484 pblock->UpdateTime(pindexPrev);
3485 nBlockTime = ByteReverse(pblock->nTime);
3488 // Changing pblock->nTime can change work required on testnet:
3489 nBlockBits = ByteReverse(pblock->nBits);
3490 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3496 void static ThreadBitcoinMiner(void* parg)
3498 CWallet* pwallet = (CWallet*)parg;
3501 vnThreadsRunning[THREAD_MINER]++;
3502 BitcoinMiner(pwallet);
3503 vnThreadsRunning[THREAD_MINER]--;
3505 catch (std::exception& e) {
3506 vnThreadsRunning[THREAD_MINER]--;
3507 PrintException(&e, "ThreadBitcoinMiner()");
3509 vnThreadsRunning[THREAD_MINER]--;
3510 PrintException(NULL, "ThreadBitcoinMiner()");
3513 if (vnThreadsRunning[THREAD_MINER] == 0)
3515 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
3519 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3521 fGenerateBitcoins = fGenerate;
3522 nLimitProcessors = GetArg("-genproclimit", -1);
3523 if (nLimitProcessors == 0)
3524 fGenerateBitcoins = false;
3525 fLimitProcessors = (nLimitProcessors != -1);
3529 int nProcessors = boost::thread::hardware_concurrency();
3530 printf("%d processors\n", nProcessors);
3531 if (nProcessors < 1)
3533 if (fLimitProcessors && nProcessors > nLimitProcessors)
3534 nProcessors = nLimitProcessors;
3535 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
3536 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3537 for (int i = 0; i < nAddThreads; i++)
3539 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3540 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");