1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include <boost/algorithm/string/replace.hpp>
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 // Name of client reported in the 'version' message. Report the same name
22 // for both bitcoind and bitcoin-qt, to make it harder for attackers to
23 // target servers or GUI users specifically.
24 const std::string CLIENT_NAME("bitcoin-qt");
26 CCriticalSection cs_setpwalletRegistered;
27 set<CWallet*> setpwalletRegistered;
29 CCriticalSection cs_main;
31 static map<uint256, CTransaction> mapTransactions;
32 CCriticalSection cs_mapTransactions;
33 unsigned int nTransactionsUpdated = 0;
34 map<COutPoint, CInPoint> mapNextTx;
36 map<uint256, CBlockIndex*> mapBlockIndex;
37 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
38 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
39 CBlockIndex* pindexGenesisBlock = NULL;
41 CBigNum bnBestChainWork = 0;
42 CBigNum bnBestInvalidWork = 0;
43 uint256 hashBestChain = 0;
44 CBlockIndex* pindexBest = NULL;
45 int64 nTimeBestReceived = 0;
47 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
49 map<uint256, CBlock*> mapOrphanBlocks;
50 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
52 map<uint256, CDataStream*> mapOrphanTransactions;
53 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
60 int fGenerateBitcoins = false;
61 int64 nTransactionFee = 0;
62 int fLimitProcessors = false;
63 int nLimitProcessors = 1;
64 int fMinimizeToTray = true;
65 int fMinimizeOnClose = true;
73 //////////////////////////////////////////////////////////////////////////////
75 // dispatching functions
78 // These functions dispatch to one or all registered wallets
81 void RegisterWallet(CWallet* pwalletIn)
83 CRITICAL_BLOCK(cs_setpwalletRegistered)
85 setpwalletRegistered.insert(pwalletIn);
89 void UnregisterWallet(CWallet* pwalletIn)
91 CRITICAL_BLOCK(cs_setpwalletRegistered)
93 setpwalletRegistered.erase(pwalletIn);
97 // check whether the passed transaction is from us
98 bool static IsFromMe(CTransaction& tx)
100 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
101 if (pwallet->IsFromMe(tx))
106 // get the wallet transaction with the given hash (if it exists)
107 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
109 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
110 if (pwallet->GetTransaction(hashTx,wtx))
115 // erases transaction with the given hash from all wallets
116 void static EraseFromWallets(uint256 hash)
118 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
119 pwallet->EraseFromWallet(hash);
122 // make sure all wallets know about the given transaction, in the given block
123 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
125 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
126 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
129 // notify wallets about a new best chain
130 void static SetBestChain(const CBlockLocator& loc)
132 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
133 pwallet->SetBestChain(loc);
136 // notify wallets about an updated transaction
137 void static UpdatedTransaction(const uint256& hashTx)
139 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
140 pwallet->UpdatedTransaction(hashTx);
144 void static PrintWallets(const CBlock& block)
146 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
147 pwallet->PrintWallet(block);
150 // notify wallets about an incoming inventory (for request counts)
151 void static Inventory(const uint256& hash)
153 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
154 pwallet->Inventory(hash);
157 // ask wallets to resend their transactions
158 void static ResendWalletTransactions()
160 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
161 pwallet->ResendWalletTransactions();
170 //////////////////////////////////////////////////////////////////////////////
172 // mapOrphanTransactions
175 void static AddOrphanTx(const CDataStream& vMsg)
178 CDataStream(vMsg) >> tx;
179 uint256 hash = tx.GetHash();
180 if (mapOrphanTransactions.count(hash))
182 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
183 BOOST_FOREACH(const CTxIn& txin, tx.vin)
184 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
187 void static EraseOrphanTx(uint256 hash)
189 if (!mapOrphanTransactions.count(hash))
191 const CDataStream* pvMsg = mapOrphanTransactions[hash];
193 CDataStream(*pvMsg) >> tx;
194 BOOST_FOREACH(const CTxIn& txin, tx.vin)
196 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
197 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
199 if ((*mi).second == pvMsg)
200 mapOrphanTransactionsByPrev.erase(mi++);
206 mapOrphanTransactions.erase(hash);
216 //////////////////////////////////////////////////////////////////////////////
218 // CTransaction and CTxIndex
221 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
224 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
226 if (!ReadFromDisk(txindexRet.pos))
228 if (prevout.n >= vout.size())
236 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
239 return ReadFromDisk(txdb, prevout, txindex);
242 bool CTransaction::ReadFromDisk(COutPoint prevout)
246 return ReadFromDisk(txdb, prevout, txindex);
249 bool CTransaction::IsStandard() const
251 BOOST_FOREACH(const CTxIn& txin, vin)
253 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
254 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
255 // ~65-byte public keys, plus a few script ops.
256 if (txin.scriptSig.size() > 500)
258 if (!txin.scriptSig.IsPushOnly())
261 BOOST_FOREACH(const CTxOut& txout, vout)
262 if (!::IsStandard(txout.scriptPubKey))
268 // Check transaction inputs, and make sure any
269 // pay-to-script-hash transactions are evaluating IsStandard scripts
271 // Why bother? To avoid denial-of-service attacks; an attacker
272 // can submit a standard HASH... OP_EQUAL transaction,
273 // which will get accepted into blocks. The redemption
274 // script can be anything; an attacker could use a very
275 // expensive-to-check-upon-redemption script like:
276 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
278 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
281 return true; // Coinbases don't use vin normally
283 for (int i = 0; i < vin.size(); i++)
285 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
287 vector<vector<unsigned char> > vSolutions;
288 txnouttype whichType;
289 // get the scriptPubKey corresponding to this input:
290 const CScript& prevScript = prev.scriptPubKey;
291 if (!Solver(prevScript, whichType, vSolutions))
293 if (whichType == TX_SCRIPTHASH)
295 vector<vector<unsigned char> > stack;
297 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
301 CScript subscript(stack.back().begin(), stack.back().end());
302 if (!::IsStandard(subscript))
311 CTransaction::GetLegacySigOpCount() const
314 BOOST_FOREACH(const CTxIn& txin, vin)
316 nSigOps += txin.scriptSig.GetSigOpCount(false);
318 BOOST_FOREACH(const CTxOut& txout, vout)
320 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
326 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
338 // Load the block this tx is in
340 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
342 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
347 // Update the tx's hashBlock
348 hashBlock = pblock->GetHash();
350 // Locate the transaction
351 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
352 if (pblock->vtx[nIndex] == *(CTransaction*)this)
354 if (nIndex == pblock->vtx.size())
356 vMerkleBranch.clear();
358 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
362 // Fill in merkle branch
363 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
366 // Is the tx in a block that's in the main chain
367 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
368 if (mi == mapBlockIndex.end())
370 CBlockIndex* pindex = (*mi).second;
371 if (!pindex || !pindex->IsInMainChain())
374 return pindexBest->nHeight - pindex->nHeight + 1;
383 bool CTransaction::CheckTransaction() const
385 // Basic checks that don't depend on any context
387 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
389 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
391 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
392 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
394 // Check for negative or overflow output values
396 BOOST_FOREACH(const CTxOut& txout, vout)
398 if (txout.nValue < 0)
399 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
400 if (txout.nValue > MAX_MONEY)
401 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
402 nValueOut += txout.nValue;
403 if (!MoneyRange(nValueOut))
404 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
407 // Check for duplicate inputs
408 set<COutPoint> vInOutPoints;
409 BOOST_FOREACH(const CTxIn& txin, vin)
411 if (vInOutPoints.count(txin.prevout))
413 vInOutPoints.insert(txin.prevout);
418 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
419 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
423 BOOST_FOREACH(const CTxIn& txin, vin)
424 if (txin.prevout.IsNull())
425 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
431 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
434 *pfMissingInputs = false;
436 if (!CheckTransaction())
437 return error("AcceptToMemoryPool() : CheckTransaction failed");
439 // Coinbase is only valid in a block, not as a loose transaction
441 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
443 // To help v0.1.5 clients who would see it as a negative number
444 if ((int64)nLockTime > std::numeric_limits<int>::max())
445 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
447 // Rather not work on nonstandard transactions (unless -testnet)
448 if (!fTestNet && !IsStandard())
449 return error("AcceptToMemoryPool() : nonstandard transaction type");
451 // Do we already have it?
452 uint256 hash = GetHash();
453 CRITICAL_BLOCK(cs_mapTransactions)
454 if (mapTransactions.count(hash))
457 if (txdb.ContainsTx(hash))
460 // Check for conflicts with in-memory transactions
461 CTransaction* ptxOld = NULL;
462 for (int i = 0; i < vin.size(); i++)
464 COutPoint outpoint = vin[i].prevout;
465 if (mapNextTx.count(outpoint))
467 // Disable replacement feature for now
470 // Allow replacing with a newer version of the same transaction
473 ptxOld = mapNextTx[outpoint].ptx;
474 if (ptxOld->IsFinal())
476 if (!IsNewerThan(*ptxOld))
478 for (int i = 0; i < vin.size(); i++)
480 COutPoint outpoint = vin[i].prevout;
481 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
491 map<uint256, CTxIndex> mapUnused;
492 bool fInvalid = false;
493 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
496 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
498 *pfMissingInputs = true;
499 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
502 // Check for non-standard pay-to-script-hash in inputs
503 if (!AreInputsStandard(mapInputs) && !fTestNet)
504 return error("AcceptToMemoryPool() : nonstandard transaction input");
506 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
507 int nSigOps = GetSigOpCount(mapInputs);
508 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
510 // Don't accept it if it can't get into a block
511 if (nFees < GetMinFee(1000, true, GMF_RELAY))
512 return error("AcceptToMemoryPool() : not enough fees");
514 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
515 // attacks disallow transactions with more than one SigOp per 65 bytes.
516 // 65 bytes because that is the minimum size of an ECDSA signature
517 if (nSigOps > nSize / 65 || nSize < 100)
518 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
520 // Continuously rate-limit free transactions
521 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
522 // be annoying or make other's transactions take longer to confirm.
523 if (nFees < MIN_RELAY_TX_FEE)
525 static CCriticalSection cs;
526 static double dFreeCount;
527 static int64 nLastTime;
528 int64 nNow = GetTime();
532 // Use an exponentially decaying ~10-minute window:
533 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
535 // -limitfreerelay unit is thousand-bytes-per-minute
536 // At default rate it would take over a month to fill 1GB
537 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
538 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
540 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
545 // Check against previous transactions
546 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
547 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
549 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
553 // Store transaction in memory
554 CRITICAL_BLOCK(cs_mapTransactions)
558 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
559 ptxOld->RemoveFromMemoryPool();
561 AddToMemoryPoolUnchecked();
564 ///// are we sure this is ok when loading transactions or restoring block txes
565 // If updated, erase old tx from wallet
567 EraseFromWallets(ptxOld->GetHash());
569 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
573 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
576 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
579 uint64 nPooledTx = 0;
581 bool CTransaction::AddToMemoryPoolUnchecked()
583 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
584 // Add to memory pool without checking anything. Don't call this directly,
585 // call AcceptToMemoryPool to properly check the transaction first.
586 CRITICAL_BLOCK(cs_mapTransactions)
588 uint256 hash = GetHash();
589 mapTransactions[hash] = *this;
590 for (int i = 0; i < vin.size(); i++)
591 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
592 nTransactionsUpdated++;
599 bool CTransaction::RemoveFromMemoryPool()
601 // Remove transaction from memory pool
602 CRITICAL_BLOCK(cs_mapTransactions)
604 BOOST_FOREACH(const CTxIn& txin, vin)
605 mapNextTx.erase(txin.prevout);
606 mapTransactions.erase(GetHash());
607 nTransactionsUpdated++;
618 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
620 if (hashBlock == 0 || nIndex == -1)
623 // Find the block it claims to be in
624 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
625 if (mi == mapBlockIndex.end())
627 CBlockIndex* pindex = (*mi).second;
628 if (!pindex || !pindex->IsInMainChain())
631 // Make sure the merkle branch connects to this block
632 if (!fMerkleVerified)
634 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
636 fMerkleVerified = true;
640 return pindexBest->nHeight - pindex->nHeight + 1;
644 int CMerkleTx::GetBlocksToMaturity() const
648 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
652 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
656 if (!IsInMainChain() && !ClientConnectInputs())
658 return CTransaction::AcceptToMemoryPool(txdb, false);
662 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
666 bool CMerkleTx::AcceptToMemoryPool()
669 return AcceptToMemoryPool(txdb);
674 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
676 CRITICAL_BLOCK(cs_mapTransactions)
678 // Add previous supporting transactions first
679 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
681 if (!tx.IsCoinBase())
683 uint256 hash = tx.GetHash();
684 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
685 tx.AcceptToMemoryPool(txdb, fCheckInputs);
688 return AcceptToMemoryPool(txdb, fCheckInputs);
693 bool CWalletTx::AcceptWalletTransaction()
696 return AcceptWalletTransaction(txdb);
699 int CTxIndex::GetDepthInMainChain() const
703 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
705 // Find the block in the index
706 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
707 if (mi == mapBlockIndex.end())
709 CBlockIndex* pindex = (*mi).second;
710 if (!pindex || !pindex->IsInMainChain())
712 return 1 + nBestHeight - pindex->nHeight;
724 //////////////////////////////////////////////////////////////////////////////
726 // CBlock and CBlockIndex
729 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
731 if (!fReadTransactions)
733 *this = pindex->GetBlockHeader();
736 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
738 if (GetHash() != pindex->GetBlockHash())
739 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
743 uint256 static GetOrphanRoot(const CBlock* pblock)
745 // Work back to the first block in the orphan chain
746 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
747 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
748 return pblock->GetHash();
751 int64 static GetBlockValue(int nHeight, int64 nFees)
753 int64 nSubsidy = 50 * COIN;
755 // Subsidy is cut in half every 4 years
756 nSubsidy >>= (nHeight / 210000);
758 return nSubsidy + nFees;
761 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
762 static const int64 nTargetSpacing = 10 * 60;
763 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
766 // minimum amount of work that could possibly be required nTime after
767 // minimum work required was nBase
769 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
772 bnResult.SetCompact(nBase);
773 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
775 // Maximum 400% adjustment...
777 // ... in best-case exactly 4-times-normal target time
778 nTime -= nTargetTimespan*4;
780 if (bnResult > bnProofOfWorkLimit)
781 bnResult = bnProofOfWorkLimit;
782 return bnResult.GetCompact();
785 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
789 if (pindexLast == NULL)
790 return bnProofOfWorkLimit.GetCompact();
792 // Only change once per interval
793 if ((pindexLast->nHeight+1) % nInterval != 0)
794 return pindexLast->nBits;
796 // Go back by what we want to be 14 days worth of blocks
797 const CBlockIndex* pindexFirst = pindexLast;
798 for (int i = 0; pindexFirst && i < nInterval-1; i++)
799 pindexFirst = pindexFirst->pprev;
802 // Limit adjustment step
803 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
804 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
805 if (nActualTimespan < nTargetTimespan/4)
806 nActualTimespan = nTargetTimespan/4;
807 if (nActualTimespan > nTargetTimespan*4)
808 nActualTimespan = nTargetTimespan*4;
812 bnNew.SetCompact(pindexLast->nBits);
813 bnNew *= nActualTimespan;
814 bnNew /= nTargetTimespan;
816 if (bnNew > bnProofOfWorkLimit)
817 bnNew = bnProofOfWorkLimit;
820 printf("GetNextWorkRequired RETARGET\n");
821 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
822 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
823 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
825 return bnNew.GetCompact();
828 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
831 bnTarget.SetCompact(nBits);
834 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
835 return error("CheckProofOfWork() : nBits below minimum work");
837 // Check proof of work matches claimed amount
838 if (hash > bnTarget.getuint256())
839 return error("CheckProofOfWork() : hash doesn't match nBits");
844 // Return maximum amount of blocks that other nodes claim to have
845 int GetNumBlocksOfPeers()
847 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
850 bool IsInitialBlockDownload()
852 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
854 static int64 nLastUpdate;
855 static CBlockIndex* pindexLastBest;
856 if (pindexBest != pindexLastBest)
858 pindexLastBest = pindexBest;
859 nLastUpdate = GetTime();
861 return (GetTime() - nLastUpdate < 10 &&
862 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
865 void static InvalidChainFound(CBlockIndex* pindexNew)
867 if (pindexNew->bnChainWork > bnBestInvalidWork)
869 bnBestInvalidWork = pindexNew->bnChainWork;
870 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
873 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());
874 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
875 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
876 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
889 bool CTransaction::DisconnectInputs(CTxDB& txdb)
891 // Relinquish previous transactions' spent pointers
894 BOOST_FOREACH(const CTxIn& txin, vin)
896 COutPoint prevout = txin.prevout;
898 // Get prev txindex from disk
900 if (!txdb.ReadTxIndex(prevout.hash, txindex))
901 return error("DisconnectInputs() : ReadTxIndex failed");
903 if (prevout.n >= txindex.vSpent.size())
904 return error("DisconnectInputs() : prevout.n out of range");
906 // Mark outpoint as not spent
907 txindex.vSpent[prevout.n].SetNull();
910 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
911 return error("DisconnectInputs() : UpdateTxIndex failed");
915 // Remove transaction from index
916 if (!txdb.EraseTxIndex(*this))
917 return error("DisconnectInputs() : EraseTxPos failed");
923 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
924 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
926 // FetchInputs can return false either because we just haven't seen some inputs
927 // (in which case the transaction should be stored as an orphan)
928 // or because the transaction is malformed (in which case the transaction should
929 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
933 return true; // Coinbase transactions have no inputs to fetch.
935 for (int i = 0; i < vin.size(); i++)
937 COutPoint prevout = vin[i].prevout;
938 if (inputsRet.count(prevout.hash))
939 continue; // Got it already
942 CTxIndex& txindex = inputsRet[prevout.hash].first;
944 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
946 // Get txindex from current proposed changes
947 txindex = mapTestPool.find(prevout.hash)->second;
951 // Read txindex from txdb
952 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
954 if (!fFound && (fBlock || fMiner))
955 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());
958 CTransaction& txPrev = inputsRet[prevout.hash].second;
959 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
961 // Get prev tx from single transactions in memory
962 CRITICAL_BLOCK(cs_mapTransactions)
964 if (!mapTransactions.count(prevout.hash))
965 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
966 txPrev = mapTransactions[prevout.hash];
969 txindex.vSpent.resize(txPrev.vout.size());
973 // Get prev tx from disk
974 if (!txPrev.ReadFromDisk(txindex.pos))
975 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
979 // Make sure all prevout.n's are valid:
980 for (int i = 0; i < vin.size(); i++)
982 const COutPoint prevout = vin[i].prevout;
983 assert(inputsRet.count(prevout.hash) != 0);
984 const CTxIndex& txindex = inputsRet[prevout.hash].first;
985 const CTransaction& txPrev = inputsRet[prevout.hash].second;
986 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
988 // Revisit this if/when transaction replacement is implemented and allows
991 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()));
998 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1000 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1001 if (mi == inputs.end())
1002 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1004 const CTransaction& txPrev = (mi->second).second;
1005 if (input.prevout.n >= txPrev.vout.size())
1006 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1008 return txPrev.vout[input.prevout.n];
1011 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1017 for (int i = 0; i < vin.size(); i++)
1019 nResult += GetOutputFor(vin[i], inputs).nValue;
1025 int CTransaction::GetSigOpCount(const MapPrevTx& inputs) const
1031 for (int i = 0; i < vin.size(); i++)
1033 nSigOps += GetOutputFor(vin[i], inputs).scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1038 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1039 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1040 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner)
1042 // Take over previous transactions' spent pointers
1043 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1044 // fMiner is true when called from the internal bitcoin miner
1045 // ... both are false when called from CTransaction::AcceptToMemoryPool
1050 for (int i = 0; i < vin.size(); i++)
1052 COutPoint prevout = vin[i].prevout;
1053 assert(inputs.count(prevout.hash) > 0);
1054 CTxIndex& txindex = inputs[prevout.hash].first;
1055 CTransaction& txPrev = inputs[prevout.hash].second;
1057 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1058 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()));
1060 // If prev is coinbase, check that it's matured
1061 if (txPrev.IsCoinBase())
1062 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1063 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1064 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1066 // Check for conflicts (double-spend)
1067 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1068 // for an attacker to attempt to split the network.
1069 if (!txindex.vSpent[prevout.n].IsNull())
1070 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());
1072 // Check for negative or overflow input values
1073 nValueIn += txPrev.vout[prevout.n].nValue;
1074 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1075 return DoS(100, error("ConnectInputs() : txin values out of range"));
1077 bool fStrictPayToScriptHash = true;
1080 // To avoid being on the short end of a block-chain split,
1081 // don't do secondary validation of pay-to-script-hash transactions
1082 // until blocks with timestamps after paytoscripthashtime:
1083 int64 nEvalSwitchTime = GetArg("paytoscripthashtime", 1329264000); // Feb 15, 2012
1084 fStrictPayToScriptHash = (pindexBlock->nTime >= nEvalSwitchTime);
1086 // if !fBlock, then always be strict-- don't accept
1087 // invalid-under-new-rules pay-to-script-hash transactions into
1088 // our memory pool (don't relay them, don't include them
1089 // in blocks we mine).
1091 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1092 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1093 // still computed and checked, and any change will be caught at the next checkpoint.
1094 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1097 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1098 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1101 // Mark outpoints as spent
1102 txindex.vSpent[prevout.n] = posThisTx;
1105 if (fBlock || fMiner)
1107 mapTestPool[prevout.hash] = txindex;
1111 if (nValueIn < GetValueOut())
1112 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1114 // Tally transaction fees
1115 int64 nTxFee = nValueIn - GetValueOut();
1117 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1119 if (!MoneyRange(nFees))
1120 return DoS(100, error("ConnectInputs() : nFees out of range"));
1127 bool CTransaction::ClientConnectInputs()
1132 // Take over previous transactions' spent pointers
1133 CRITICAL_BLOCK(cs_mapTransactions)
1136 for (int i = 0; i < vin.size(); i++)
1138 // Get prev tx from single transactions in memory
1139 COutPoint prevout = vin[i].prevout;
1140 if (!mapTransactions.count(prevout.hash))
1142 CTransaction& txPrev = mapTransactions[prevout.hash];
1144 if (prevout.n >= txPrev.vout.size())
1148 if (!VerifySignature(txPrev, *this, i, true, 0))
1149 return error("ConnectInputs() : VerifySignature failed");
1151 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1152 ///// this has to go away now that posNext is gone
1153 // // Check for conflicts
1154 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1155 // return error("ConnectInputs() : prev tx already used");
1157 // // Flag outpoints as used
1158 // txPrev.vout[prevout.n].posNext = posThisTx;
1160 nValueIn += txPrev.vout[prevout.n].nValue;
1162 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1163 return error("ClientConnectInputs() : txin values out of range");
1165 if (GetValueOut() > nValueIn)
1175 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1177 // Disconnect in reverse order
1178 for (int i = vtx.size()-1; i >= 0; i--)
1179 if (!vtx[i].DisconnectInputs(txdb))
1182 // Update block index on disk without changing it in memory.
1183 // The memory index structure will be changed after the db commits.
1186 CDiskBlockIndex blockindexPrev(pindex->pprev);
1187 blockindexPrev.hashNext = 0;
1188 if (!txdb.WriteBlockIndex(blockindexPrev))
1189 return error("DisconnectBlock() : WriteBlockIndex failed");
1195 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1197 // Check it again in case a previous version let a bad block in
1201 //// issue here: it doesn't know the version
1202 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1204 map<uint256, CTxIndex> mapQueuedChanges;
1207 BOOST_FOREACH(CTransaction& tx, vtx)
1209 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1210 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1212 MapPrevTx mapInputs;
1213 if (!tx.IsCoinBase())
1216 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1219 int nTxOps = tx.GetSigOpCount(mapInputs);
1221 if (nSigOps > MAX_BLOCK_SIGOPS)
1222 return DoS(100, error("ConnectBlock() : too many sigops"));
1223 // There is a different MAX_BLOCK_SIGOPS check in AcceptBlock();
1224 // a block must satisfy both to make it into the best-chain
1225 // (AcceptBlock() is always called before ConnectBlock())
1227 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1229 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false))
1233 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1236 // Write queued txindex changes
1237 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1239 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1240 return error("ConnectBlock() : UpdateTxIndex failed");
1243 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1246 // Update block index on disk without changing it in memory.
1247 // The memory index structure will be changed after the db commits.
1250 CDiskBlockIndex blockindexPrev(pindex->pprev);
1251 blockindexPrev.hashNext = pindex->GetBlockHash();
1252 if (!txdb.WriteBlockIndex(blockindexPrev))
1253 return error("ConnectBlock() : WriteBlockIndex failed");
1256 // Watch for transactions paying to me
1257 BOOST_FOREACH(CTransaction& tx, vtx)
1258 SyncWithWallets(tx, this, true);
1263 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1265 printf("REORGANIZE\n");
1268 CBlockIndex* pfork = pindexBest;
1269 CBlockIndex* plonger = pindexNew;
1270 while (pfork != plonger)
1272 while (plonger->nHeight > pfork->nHeight)
1273 if (!(plonger = plonger->pprev))
1274 return error("Reorganize() : plonger->pprev is null");
1275 if (pfork == plonger)
1277 if (!(pfork = pfork->pprev))
1278 return error("Reorganize() : pfork->pprev is null");
1281 // List of what to disconnect
1282 vector<CBlockIndex*> vDisconnect;
1283 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1284 vDisconnect.push_back(pindex);
1286 // List of what to connect
1287 vector<CBlockIndex*> vConnect;
1288 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1289 vConnect.push_back(pindex);
1290 reverse(vConnect.begin(), vConnect.end());
1292 // Disconnect shorter branch
1293 vector<CTransaction> vResurrect;
1294 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1297 if (!block.ReadFromDisk(pindex))
1298 return error("Reorganize() : ReadFromDisk for disconnect failed");
1299 if (!block.DisconnectBlock(txdb, pindex))
1300 return error("Reorganize() : DisconnectBlock failed");
1302 // Queue memory transactions to resurrect
1303 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1304 if (!tx.IsCoinBase())
1305 vResurrect.push_back(tx);
1308 // Connect longer branch
1309 vector<CTransaction> vDelete;
1310 for (int i = 0; i < vConnect.size(); i++)
1312 CBlockIndex* pindex = vConnect[i];
1314 if (!block.ReadFromDisk(pindex))
1315 return error("Reorganize() : ReadFromDisk for connect failed");
1316 if (!block.ConnectBlock(txdb, pindex))
1320 return error("Reorganize() : ConnectBlock failed");
1323 // Queue memory transactions to delete
1324 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1325 vDelete.push_back(tx);
1327 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1328 return error("Reorganize() : WriteHashBestChain failed");
1330 // Make sure it's successfully written to disk before changing memory structure
1331 if (!txdb.TxnCommit())
1332 return error("Reorganize() : TxnCommit failed");
1334 // Disconnect shorter branch
1335 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1337 pindex->pprev->pnext = NULL;
1339 // Connect longer branch
1340 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1342 pindex->pprev->pnext = pindex;
1344 // Resurrect memory transactions that were in the disconnected branch
1345 BOOST_FOREACH(CTransaction& tx, vResurrect)
1346 tx.AcceptToMemoryPool(txdb, false);
1348 // Delete redundant memory transactions that are in the connected branch
1349 BOOST_FOREACH(CTransaction& tx, vDelete)
1350 tx.RemoveFromMemoryPool();
1357 runCommand(std::string strCommand)
1359 int nErr = ::system(strCommand.c_str());
1361 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1364 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1366 uint256 hash = GetHash();
1369 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1371 txdb.WriteHashBestChain(hash);
1372 if (!txdb.TxnCommit())
1373 return error("SetBestChain() : TxnCommit failed");
1374 pindexGenesisBlock = pindexNew;
1376 else if (hashPrevBlock == hashBestChain)
1378 // Adding to current best branch
1379 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1382 InvalidChainFound(pindexNew);
1383 return error("SetBestChain() : ConnectBlock failed");
1385 if (!txdb.TxnCommit())
1386 return error("SetBestChain() : TxnCommit failed");
1388 // Add to current best branch
1389 pindexNew->pprev->pnext = pindexNew;
1391 // Delete redundant memory transactions
1392 BOOST_FOREACH(CTransaction& tx, vtx)
1393 tx.RemoveFromMemoryPool();
1398 if (!Reorganize(txdb, pindexNew))
1401 InvalidChainFound(pindexNew);
1402 return error("SetBestChain() : Reorganize failed");
1406 // Update best block in wallet (so we can detect restored wallets)
1407 bool fIsInitialDownload = IsInitialBlockDownload();
1408 if (!fIsInitialDownload)
1410 const CBlockLocator locator(pindexNew);
1411 ::SetBestChain(locator);
1415 hashBestChain = hash;
1416 pindexBest = pindexNew;
1417 nBestHeight = pindexBest->nHeight;
1418 bnBestChainWork = pindexNew->bnChainWork;
1419 nTimeBestReceived = GetTime();
1420 nTransactionsUpdated++;
1421 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1423 std::string strCmd = GetArg("-blocknotify", "");
1425 if (!fIsInitialDownload && !strCmd.empty())
1427 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1428 boost::thread t(runCommand, strCmd); // thread runs free
1435 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1437 // Check for duplicate
1438 uint256 hash = GetHash();
1439 if (mapBlockIndex.count(hash))
1440 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1442 // Construct new block index object
1443 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1445 return error("AddToBlockIndex() : new CBlockIndex failed");
1446 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1447 pindexNew->phashBlock = &((*mi).first);
1448 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1449 if (miPrev != mapBlockIndex.end())
1451 pindexNew->pprev = (*miPrev).second;
1452 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1454 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1458 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1459 if (!txdb.TxnCommit())
1463 if (pindexNew->bnChainWork > bnBestChainWork)
1464 if (!SetBestChain(txdb, pindexNew))
1469 if (pindexNew == pindexBest)
1471 // Notify UI to display prev block's coinbase if it was ours
1472 static uint256 hashPrevBestCoinBase;
1473 UpdatedTransaction(hashPrevBestCoinBase);
1474 hashPrevBestCoinBase = vtx[0].GetHash();
1484 bool CBlock::CheckBlock() const
1486 // These are checks that are independent of context
1487 // that can be verified before saving an orphan block.
1490 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1491 return DoS(100, error("CheckBlock() : size limits failed"));
1493 // Check proof of work matches claimed amount
1494 if (!CheckProofOfWork(GetHash(), nBits))
1495 return DoS(50, error("CheckBlock() : proof of work failed"));
1498 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1499 return error("CheckBlock() : block timestamp too far in the future");
1501 // First transaction must be coinbase, the rest must not be
1502 if (vtx.empty() || !vtx[0].IsCoinBase())
1503 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1504 for (int i = 1; i < vtx.size(); i++)
1505 if (vtx[i].IsCoinBase())
1506 return DoS(100, error("CheckBlock() : more than one coinbase"));
1508 // Check transactions
1509 BOOST_FOREACH(const CTransaction& tx, vtx)
1510 if (!tx.CheckTransaction())
1511 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1513 // Pre-pay-to-script-hash (before version 0.6), this is how sigops
1514 // were counted; there is another check in ConnectBlock when
1515 // transaction inputs are fetched to count pay-to-script-hash sigops:
1517 BOOST_FOREACH(const CTransaction& tx, vtx)
1519 nSigOps += tx.GetLegacySigOpCount();
1521 if (nSigOps > MAX_BLOCK_SIGOPS)
1522 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1525 if (hashMerkleRoot != BuildMerkleTree())
1526 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1531 bool CBlock::AcceptBlock()
1533 // Check for duplicate
1534 uint256 hash = GetHash();
1535 if (mapBlockIndex.count(hash))
1536 return error("AcceptBlock() : block already in mapBlockIndex");
1538 // Get prev block index
1539 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1540 if (mi == mapBlockIndex.end())
1541 return DoS(10, error("AcceptBlock() : prev block not found"));
1542 CBlockIndex* pindexPrev = (*mi).second;
1543 int nHeight = pindexPrev->nHeight+1;
1545 // Check proof of work
1546 if (nBits != GetNextWorkRequired(pindexPrev))
1547 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1549 // Check timestamp against prev
1550 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1551 return error("AcceptBlock() : block's timestamp is too early");
1553 // Check that all transactions are finalized
1554 BOOST_FOREACH(const CTransaction& tx, vtx)
1555 if (!tx.IsFinal(nHeight, GetBlockTime()))
1556 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1558 // Check that the block chain matches the known block chain up to a checkpoint
1559 if (!Checkpoints::CheckBlock(nHeight, hash))
1560 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1562 // Write block to history file
1563 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1564 return error("AcceptBlock() : out of disk space");
1565 unsigned int nFile = -1;
1566 unsigned int nBlockPos = 0;
1567 if (!WriteToDisk(nFile, nBlockPos))
1568 return error("AcceptBlock() : WriteToDisk failed");
1569 if (!AddToBlockIndex(nFile, nBlockPos))
1570 return error("AcceptBlock() : AddToBlockIndex failed");
1572 // Relay inventory, but don't relay old inventory during initial block download
1573 if (hashBestChain == hash)
1574 CRITICAL_BLOCK(cs_vNodes)
1575 BOOST_FOREACH(CNode* pnode, vNodes)
1576 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1577 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1582 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1584 // Check for duplicate
1585 uint256 hash = pblock->GetHash();
1586 if (mapBlockIndex.count(hash))
1587 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1588 if (mapOrphanBlocks.count(hash))
1589 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1591 // Preliminary checks
1592 if (!pblock->CheckBlock())
1593 return error("ProcessBlock() : CheckBlock FAILED");
1595 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1596 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1598 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1599 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1602 pfrom->Misbehaving(100);
1603 return error("ProcessBlock() : block with timestamp before last checkpoint");
1606 bnNewBlock.SetCompact(pblock->nBits);
1608 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1609 if (bnNewBlock > bnRequired)
1611 pfrom->Misbehaving(100);
1612 return error("ProcessBlock() : block with too little proof-of-work");
1617 // If don't already have its previous block, shunt it off to holding area until we get it
1618 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1620 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1621 CBlock* pblock2 = new CBlock(*pblock);
1622 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1623 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1625 // Ask this guy to fill in what we're missing
1627 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1632 if (!pblock->AcceptBlock())
1633 return error("ProcessBlock() : AcceptBlock FAILED");
1635 // Recursively process any orphan blocks that depended on this one
1636 vector<uint256> vWorkQueue;
1637 vWorkQueue.push_back(hash);
1638 for (int i = 0; i < vWorkQueue.size(); i++)
1640 uint256 hashPrev = vWorkQueue[i];
1641 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1642 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1645 CBlock* pblockOrphan = (*mi).second;
1646 if (pblockOrphan->AcceptBlock())
1647 vWorkQueue.push_back(pblockOrphan->GetHash());
1648 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1649 delete pblockOrphan;
1651 mapOrphanBlocksByPrev.erase(hashPrev);
1654 printf("ProcessBlock: ACCEPTED\n");
1665 bool CheckDiskSpace(uint64 nAdditionalBytes)
1667 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1669 // Check for 15MB because database could create another 10MB log file at any time
1670 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1673 string strMessage = _("Warning: Disk space is low ");
1674 strMiscWarning = strMessage;
1675 printf("*** %s\n", strMessage.c_str());
1676 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1677 CreateThread(Shutdown, NULL);
1683 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1687 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1690 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1692 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1701 static unsigned int nCurrentBlockFile = 1;
1703 FILE* AppendBlockFile(unsigned int& nFileRet)
1708 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1711 if (fseek(file, 0, SEEK_END) != 0)
1713 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1714 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1716 nFileRet = nCurrentBlockFile;
1720 nCurrentBlockFile++;
1724 bool LoadBlockIndex(bool fAllowNew)
1728 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1729 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1730 pchMessageStart[0] = 0xfa;
1731 pchMessageStart[1] = 0xbf;
1732 pchMessageStart[2] = 0xb5;
1733 pchMessageStart[3] = 0xda;
1740 if (!txdb.LoadBlockIndex())
1745 // Init with genesis block
1747 if (mapBlockIndex.empty())
1753 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1754 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1755 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1756 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1757 // vMerkleTree: 4a5e1e
1760 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1762 txNew.vin.resize(1);
1763 txNew.vout.resize(1);
1764 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1765 txNew.vout[0].nValue = 50 * COIN;
1766 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1768 block.vtx.push_back(txNew);
1769 block.hashPrevBlock = 0;
1770 block.hashMerkleRoot = block.BuildMerkleTree();
1772 block.nTime = 1231006505;
1773 block.nBits = 0x1d00ffff;
1774 block.nNonce = 2083236893;
1778 block.nTime = 1296688602;
1779 block.nBits = 0x1d07fff8;
1780 block.nNonce = 384568319;
1784 printf("%s\n", block.GetHash().ToString().c_str());
1785 printf("%s\n", hashGenesisBlock.ToString().c_str());
1786 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1787 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1789 assert(block.GetHash() == hashGenesisBlock);
1791 // Start new block file
1793 unsigned int nBlockPos;
1794 if (!block.WriteToDisk(nFile, nBlockPos))
1795 return error("LoadBlockIndex() : writing genesis block to disk failed");
1796 if (!block.AddToBlockIndex(nFile, nBlockPos))
1797 return error("LoadBlockIndex() : genesis block not accepted");
1805 void PrintBlockTree()
1807 // precompute tree structure
1808 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1809 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1811 CBlockIndex* pindex = (*mi).second;
1812 mapNext[pindex->pprev].push_back(pindex);
1814 //while (rand() % 3 == 0)
1815 // mapNext[pindex->pprev].push_back(pindex);
1818 vector<pair<int, CBlockIndex*> > vStack;
1819 vStack.push_back(make_pair(0, pindexGenesisBlock));
1822 while (!vStack.empty())
1824 int nCol = vStack.back().first;
1825 CBlockIndex* pindex = vStack.back().second;
1828 // print split or gap
1829 if (nCol > nPrevCol)
1831 for (int i = 0; i < nCol-1; i++)
1835 else if (nCol < nPrevCol)
1837 for (int i = 0; i < nCol; i++)
1844 for (int i = 0; i < nCol; i++)
1849 block.ReadFromDisk(pindex);
1850 printf("%d (%u,%u) %s %s tx %d",
1854 block.GetHash().ToString().substr(0,20).c_str(),
1855 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1858 PrintWallets(block);
1860 // put the main timechain first
1861 vector<CBlockIndex*>& vNext = mapNext[pindex];
1862 for (int i = 0; i < vNext.size(); i++)
1864 if (vNext[i]->pnext)
1866 swap(vNext[0], vNext[i]);
1872 for (int i = 0; i < vNext.size(); i++)
1873 vStack.push_back(make_pair(nCol+i, vNext[i]));
1886 //////////////////////////////////////////////////////////////////////////////
1891 map<uint256, CAlert> mapAlerts;
1892 CCriticalSection cs_mapAlerts;
1894 string GetWarnings(string strFor)
1897 string strStatusBar;
1899 if (GetBoolArg("-testsafemode"))
1902 // Misc warnings like out of disk space and clock is wrong
1903 if (strMiscWarning != "")
1906 strStatusBar = strMiscWarning;
1909 // Longer invalid proof-of-work chain
1910 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1913 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1917 CRITICAL_BLOCK(cs_mapAlerts)
1919 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1921 const CAlert& alert = item.second;
1922 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1924 nPriority = alert.nPriority;
1925 strStatusBar = alert.strStatusBar;
1930 if (strFor == "statusbar")
1931 return strStatusBar;
1932 else if (strFor == "rpc")
1934 assert(!"GetWarnings() : invalid parameter");
1938 bool CAlert::ProcessAlert()
1940 if (!CheckSignature())
1945 CRITICAL_BLOCK(cs_mapAlerts)
1947 // Cancel previous alerts
1948 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1950 const CAlert& alert = (*mi).second;
1953 printf("cancelling alert %d\n", alert.nID);
1954 mapAlerts.erase(mi++);
1956 else if (!alert.IsInEffect())
1958 printf("expiring alert %d\n", alert.nID);
1959 mapAlerts.erase(mi++);
1965 // Check if this alert has been cancelled
1966 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1968 const CAlert& alert = item.second;
1969 if (alert.Cancels(*this))
1971 printf("alert already cancelled by %d\n", alert.nID);
1977 mapAlerts.insert(make_pair(GetHash(), *this));
1980 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1992 //////////////////////////////////////////////////////////////////////////////
1998 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2002 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2003 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2005 // Don't know what it is, just say we already got one
2012 // The message start string is designed to be unlikely to occur in normal data.
2013 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2014 // a large 4-byte int at any alignment.
2015 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2018 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2020 static map<CService, vector<unsigned char> > mapReuseKey;
2021 RandAddSeedPerfmon();
2023 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2024 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2026 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2028 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2036 if (strCommand == "version")
2038 // Each connection can only send one version message
2039 if (pfrom->nVersion != 0)
2041 pfrom->Misbehaving(1);
2049 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2050 if (pfrom->nVersion == 10300)
2051 pfrom->nVersion = 300;
2052 if (pfrom->nVersion >= 106 && !vRecv.empty())
2053 vRecv >> addrFrom >> nNonce;
2054 if (pfrom->nVersion >= 106 && !vRecv.empty())
2055 vRecv >> pfrom->strSubVer;
2056 if (pfrom->nVersion >= 209 && !vRecv.empty())
2057 vRecv >> pfrom->nStartingHeight;
2059 if (pfrom->nVersion == 0)
2062 // Disconnect if we connected to ourself
2063 if (nNonce == nLocalHostNonce && nNonce > 1)
2065 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2066 pfrom->fDisconnect = true;
2070 // Be shy and don't send version until we hear
2071 if (pfrom->fInbound)
2072 pfrom->PushVersion();
2074 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2076 AddTimeData(pfrom->addr, nTime);
2079 if (pfrom->nVersion >= 209)
2080 pfrom->PushMessage("verack");
2081 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2082 if (pfrom->nVersion < 209)
2083 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2085 if (!pfrom->fInbound)
2087 // Advertise our address
2088 if (addrLocalHost.IsRoutable() && !fUseProxy)
2090 CAddress addr(addrLocalHost);
2091 addr.nTime = GetAdjustedTime();
2092 pfrom->PushAddress(addr);
2095 // Get recent addresses
2096 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2098 pfrom->PushMessage("getaddr");
2099 pfrom->fGetAddr = true;
2103 // Ask the first connected node for block updates
2104 static int nAskedForBlocks = 0;
2105 if (!pfrom->fClient &&
2106 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2107 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2110 pfrom->PushGetBlocks(pindexBest, uint256(0));
2114 CRITICAL_BLOCK(cs_mapAlerts)
2115 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2116 item.second.RelayTo(pfrom);
2118 pfrom->fSuccessfullyConnected = true;
2120 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2122 cPeerBlockCounts.input(pfrom->nStartingHeight);
2126 else if (pfrom->nVersion == 0)
2128 // Must have a version message before anything else
2129 pfrom->Misbehaving(1);
2134 else if (strCommand == "verack")
2136 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2140 else if (strCommand == "addr")
2142 vector<CAddress> vAddr;
2145 // Don't want addr from older versions unless seeding
2146 if (pfrom->nVersion < 209)
2148 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2150 if (vAddr.size() > 1000)
2152 pfrom->Misbehaving(20);
2153 return error("message addr size() = %d", vAddr.size());
2156 // Store the new addresses
2159 int64 nNow = GetAdjustedTime();
2160 int64 nSince = nNow - 10 * 60;
2161 BOOST_FOREACH(CAddress& addr, vAddr)
2165 // ignore IPv6 for now, since it isn't implemented anyway
2168 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2169 addr.nTime = nNow - 5 * 24 * 60 * 60;
2170 AddAddress(addr, 2 * 60 * 60, &addrDB);
2171 pfrom->AddAddressKnown(addr);
2172 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2174 // Relay to a limited number of other nodes
2175 CRITICAL_BLOCK(cs_vNodes)
2177 // Use deterministic randomness to send to the same nodes for 24 hours
2178 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2179 static uint256 hashSalt;
2181 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2182 int64 hashAddr = addr.GetHash();
2183 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2184 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2185 multimap<uint256, CNode*> mapMix;
2186 BOOST_FOREACH(CNode* pnode, vNodes)
2188 if (pnode->nVersion < 31402)
2190 unsigned int nPointer;
2191 memcpy(&nPointer, &pnode, sizeof(nPointer));
2192 uint256 hashKey = hashRand ^ nPointer;
2193 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2194 mapMix.insert(make_pair(hashKey, pnode));
2196 int nRelayNodes = 2;
2197 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2198 ((*mi).second)->PushAddress(addr);
2202 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2203 if (vAddr.size() < 1000)
2204 pfrom->fGetAddr = false;
2208 else if (strCommand == "inv")
2212 if (vInv.size() > 50000)
2214 pfrom->Misbehaving(20);
2215 return error("message inv size() = %d", vInv.size());
2219 BOOST_FOREACH(const CInv& inv, vInv)
2223 pfrom->AddInventoryKnown(inv);
2225 bool fAlreadyHave = AlreadyHave(txdb, inv);
2227 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2231 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2232 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2234 // Track requests for our stuff
2235 Inventory(inv.hash);
2240 else if (strCommand == "getdata")
2244 if (vInv.size() > 50000)
2246 pfrom->Misbehaving(20);
2247 return error("message getdata size() = %d", vInv.size());
2250 BOOST_FOREACH(const CInv& inv, vInv)
2254 printf("received getdata for: %s\n", inv.ToString().c_str());
2256 if (inv.type == MSG_BLOCK)
2258 // Send block from disk
2259 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2260 if (mi != mapBlockIndex.end())
2263 block.ReadFromDisk((*mi).second);
2264 pfrom->PushMessage("block", block);
2266 // Trigger them to send a getblocks request for the next batch of inventory
2267 if (inv.hash == pfrom->hashContinue)
2269 // Bypass PushInventory, this must send even if redundant,
2270 // and we want it right after the last block so they don't
2271 // wait for other stuff first.
2273 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2274 pfrom->PushMessage("inv", vInv);
2275 pfrom->hashContinue = 0;
2279 else if (inv.IsKnownType())
2281 // Send stream from relay memory
2282 CRITICAL_BLOCK(cs_mapRelay)
2284 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2285 if (mi != mapRelay.end())
2286 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2290 // Track requests for our stuff
2291 Inventory(inv.hash);
2296 else if (strCommand == "getblocks")
2298 CBlockLocator locator;
2300 vRecv >> locator >> hashStop;
2302 // Find the last block the caller has in the main chain
2303 CBlockIndex* pindex = locator.GetBlockIndex();
2305 // Send the rest of the chain
2307 pindex = pindex->pnext;
2308 int nLimit = 500 + locator.GetDistanceBack();
2309 unsigned int nBytes = 0;
2310 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2311 for (; pindex; pindex = pindex->pnext)
2313 if (pindex->GetBlockHash() == hashStop)
2315 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2318 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2320 block.ReadFromDisk(pindex, true);
2321 nBytes += block.GetSerializeSize(SER_NETWORK);
2322 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2324 // When this block is requested, we'll send an inv that'll make them
2325 // getblocks the next batch of inventory.
2326 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2327 pfrom->hashContinue = pindex->GetBlockHash();
2334 else if (strCommand == "getheaders")
2336 CBlockLocator locator;
2338 vRecv >> locator >> hashStop;
2340 CBlockIndex* pindex = NULL;
2341 if (locator.IsNull())
2343 // If locator is null, return the hashStop block
2344 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2345 if (mi == mapBlockIndex.end())
2347 pindex = (*mi).second;
2351 // Find the last block the caller has in the main chain
2352 pindex = locator.GetBlockIndex();
2354 pindex = pindex->pnext;
2357 vector<CBlock> vHeaders;
2358 int nLimit = 2000 + locator.GetDistanceBack();
2359 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2360 for (; pindex; pindex = pindex->pnext)
2362 vHeaders.push_back(pindex->GetBlockHeader());
2363 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2366 pfrom->PushMessage("headers", vHeaders);
2370 else if (strCommand == "tx")
2372 vector<uint256> vWorkQueue;
2373 CDataStream vMsg(vRecv);
2377 CInv inv(MSG_TX, tx.GetHash());
2378 pfrom->AddInventoryKnown(inv);
2380 bool fMissingInputs = false;
2381 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2383 SyncWithWallets(tx, NULL, true);
2384 RelayMessage(inv, vMsg);
2385 mapAlreadyAskedFor.erase(inv);
2386 vWorkQueue.push_back(inv.hash);
2388 // Recursively process any orphan transactions that depended on this one
2389 for (int i = 0; i < vWorkQueue.size(); i++)
2391 uint256 hashPrev = vWorkQueue[i];
2392 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2393 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2396 const CDataStream& vMsg = *((*mi).second);
2398 CDataStream(vMsg) >> tx;
2399 CInv inv(MSG_TX, tx.GetHash());
2401 if (tx.AcceptToMemoryPool(true))
2403 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2404 SyncWithWallets(tx, NULL, true);
2405 RelayMessage(inv, vMsg);
2406 mapAlreadyAskedFor.erase(inv);
2407 vWorkQueue.push_back(inv.hash);
2412 BOOST_FOREACH(uint256 hash, vWorkQueue)
2413 EraseOrphanTx(hash);
2415 else if (fMissingInputs)
2417 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2420 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2424 else if (strCommand == "block")
2429 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2432 CInv inv(MSG_BLOCK, block.GetHash());
2433 pfrom->AddInventoryKnown(inv);
2435 if (ProcessBlock(pfrom, &block))
2436 mapAlreadyAskedFor.erase(inv);
2437 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2441 else if (strCommand == "getaddr")
2443 // Nodes rebroadcast an addr every 24 hours
2444 pfrom->vAddrToSend.clear();
2445 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2446 CRITICAL_BLOCK(cs_mapAddresses)
2448 unsigned int nCount = 0;
2449 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2451 const CAddress& addr = item.second;
2452 if (addr.nTime > nSince)
2455 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2457 const CAddress& addr = item.second;
2458 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2459 pfrom->PushAddress(addr);
2465 else if (strCommand == "checkorder")
2470 if (!GetBoolArg("-allowreceivebyip"))
2472 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2479 /// we have a chance to check the order here
2481 // Keep giving the same key to the same ip until they use it
2482 if (!mapReuseKey.count(pfrom->addr))
2483 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2485 // Send back approval of order and pubkey to use
2486 CScript scriptPubKey;
2487 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2488 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2492 else if (strCommand == "reply")
2497 CRequestTracker tracker;
2498 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2500 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2501 if (mi != pfrom->mapRequests.end())
2503 tracker = (*mi).second;
2504 pfrom->mapRequests.erase(mi);
2507 if (!tracker.IsNull())
2508 tracker.fn(tracker.param1, vRecv);
2512 else if (strCommand == "ping")
2517 else if (strCommand == "alert")
2522 if (alert.ProcessAlert())
2525 pfrom->setKnown.insert(alert.GetHash());
2526 CRITICAL_BLOCK(cs_vNodes)
2527 BOOST_FOREACH(CNode* pnode, vNodes)
2528 alert.RelayTo(pnode);
2535 // Ignore unknown commands for extensibility
2539 // Update the last seen time for this node's address
2540 if (pfrom->fNetworkNode)
2541 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2542 AddressCurrentlyConnected(pfrom->addr);
2548 bool ProcessMessages(CNode* pfrom)
2550 CDataStream& vRecv = pfrom->vRecv;
2554 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2558 // (4) message start
2567 // Scan for message start
2568 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2569 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2570 if (vRecv.end() - pstart < nHeaderSize)
2572 if (vRecv.size() > nHeaderSize)
2574 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2575 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2579 if (pstart - vRecv.begin() > 0)
2580 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2581 vRecv.erase(vRecv.begin(), pstart);
2584 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2589 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2592 string strCommand = hdr.GetCommand();
2595 unsigned int nMessageSize = hdr.nMessageSize;
2596 if (nMessageSize > MAX_SIZE)
2598 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2601 if (nMessageSize > vRecv.size())
2603 // Rewind and wait for rest of message
2604 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2609 if (vRecv.GetVersion() >= 209)
2611 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2612 unsigned int nChecksum = 0;
2613 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2614 if (nChecksum != hdr.nChecksum)
2616 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2617 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2622 // Copy message to its own buffer
2623 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2624 vRecv.ignore(nMessageSize);
2630 CRITICAL_BLOCK(cs_main)
2631 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2635 catch (std::ios_base::failure& e)
2637 if (strstr(e.what(), "end of data"))
2639 // Allow exceptions from underlength message on vRecv
2640 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());
2642 else if (strstr(e.what(), "size too large"))
2644 // Allow exceptions from overlong size
2645 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2649 PrintExceptionContinue(&e, "ProcessMessage()");
2652 catch (std::exception& e) {
2653 PrintExceptionContinue(&e, "ProcessMessage()");
2655 PrintExceptionContinue(NULL, "ProcessMessage()");
2659 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2667 bool SendMessages(CNode* pto, bool fSendTrickle)
2669 CRITICAL_BLOCK(cs_main)
2671 // Don't send anything until we get their version message
2672 if (pto->nVersion == 0)
2676 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2677 pto->PushMessage("ping");
2679 // Resend wallet transactions that haven't gotten in a block yet
2680 ResendWalletTransactions();
2682 // Address refresh broadcast
2683 static int64 nLastRebroadcast;
2684 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2686 nLastRebroadcast = GetTime();
2687 CRITICAL_BLOCK(cs_vNodes)
2689 BOOST_FOREACH(CNode* pnode, vNodes)
2691 // Periodically clear setAddrKnown to allow refresh broadcasts
2692 pnode->setAddrKnown.clear();
2694 // Rebroadcast our address
2695 if (addrLocalHost.IsRoutable() && !fUseProxy)
2697 CAddress addr(addrLocalHost);
2698 addr.nTime = GetAdjustedTime();
2699 pnode->PushAddress(addr);
2705 // Clear out old addresses periodically so it's not too much work at once
2706 static int64 nLastClear;
2707 if (nLastClear == 0)
2708 nLastClear = GetTime();
2709 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2711 nLastClear = GetTime();
2712 CRITICAL_BLOCK(cs_mapAddresses)
2715 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2716 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2717 mi != mapAddresses.end();)
2719 const CAddress& addr = (*mi).second;
2720 if (addr.nTime < nSince)
2722 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2724 addrdb.EraseAddress(addr);
2725 mapAddresses.erase(mi++);
2739 vector<CAddress> vAddr;
2740 vAddr.reserve(pto->vAddrToSend.size());
2741 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2743 // returns true if wasn't already contained in the set
2744 if (pto->setAddrKnown.insert(addr).second)
2746 vAddr.push_back(addr);
2747 // receiver rejects addr messages larger than 1000
2748 if (vAddr.size() >= 1000)
2750 pto->PushMessage("addr", vAddr);
2755 pto->vAddrToSend.clear();
2757 pto->PushMessage("addr", vAddr);
2762 // Message: inventory
2765 vector<CInv> vInvWait;
2766 CRITICAL_BLOCK(pto->cs_inventory)
2768 vInv.reserve(pto->vInventoryToSend.size());
2769 vInvWait.reserve(pto->vInventoryToSend.size());
2770 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2772 if (pto->setInventoryKnown.count(inv))
2775 // trickle out tx inv to protect privacy
2776 if (inv.type == MSG_TX && !fSendTrickle)
2778 // 1/4 of tx invs blast to all immediately
2779 static uint256 hashSalt;
2781 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2782 uint256 hashRand = inv.hash ^ hashSalt;
2783 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2784 bool fTrickleWait = ((hashRand & 3) != 0);
2786 // always trickle our own transactions
2790 if (GetTransaction(inv.hash, wtx))
2792 fTrickleWait = true;
2797 vInvWait.push_back(inv);
2802 // returns true if wasn't already contained in the set
2803 if (pto->setInventoryKnown.insert(inv).second)
2805 vInv.push_back(inv);
2806 if (vInv.size() >= 1000)
2808 pto->PushMessage("inv", vInv);
2813 pto->vInventoryToSend = vInvWait;
2816 pto->PushMessage("inv", vInv);
2822 vector<CInv> vGetData;
2823 int64 nNow = GetTime() * 1000000;
2825 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2827 const CInv& inv = (*pto->mapAskFor.begin()).second;
2828 if (!AlreadyHave(txdb, inv))
2830 printf("sending getdata: %s\n", inv.ToString().c_str());
2831 vGetData.push_back(inv);
2832 if (vGetData.size() >= 1000)
2834 pto->PushMessage("getdata", vGetData);
2838 mapAlreadyAskedFor[inv] = nNow;
2839 pto->mapAskFor.erase(pto->mapAskFor.begin());
2841 if (!vGetData.empty())
2842 pto->PushMessage("getdata", vGetData);
2861 //////////////////////////////////////////////////////////////////////////////
2866 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2868 unsigned char* pdata = (unsigned char*)pbuffer;
2869 unsigned int blocks = 1 + ((len + 8) / 64);
2870 unsigned char* pend = pdata + 64 * blocks;
2871 memset(pdata + len, 0, 64 * blocks - len);
2873 unsigned int bits = len * 8;
2874 pend[-1] = (bits >> 0) & 0xff;
2875 pend[-2] = (bits >> 8) & 0xff;
2876 pend[-3] = (bits >> 16) & 0xff;
2877 pend[-4] = (bits >> 24) & 0xff;
2881 static const unsigned int pSHA256InitState[8] =
2882 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2884 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2887 unsigned char data[64];
2891 for (int i = 0; i < 16; i++)
2892 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2894 for (int i = 0; i < 8; i++)
2895 ctx.h[i] = ((uint32_t*)pinit)[i];
2897 SHA256_Update(&ctx, data, sizeof(data));
2898 for (int i = 0; i < 8; i++)
2899 ((uint32_t*)pstate)[i] = ctx.h[i];
2903 // ScanHash scans nonces looking for a hash with at least some zero bits.
2904 // It operates on big endian data. Caller does the byte reversing.
2905 // All input buffers are 16-byte aligned. nNonce is usually preserved
2906 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2907 // the block is rebuilt and nNonce starts over at zero.
2909 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2911 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2915 // Hash pdata using pmidstate as the starting state into
2916 // preformatted buffer phash1, then hash phash1 into phash
2918 SHA256Transform(phash1, pdata, pmidstate);
2919 SHA256Transform(phash, phash1, pSHA256InitState);
2921 // Return the nonce if the hash has at least some zero bits,
2922 // caller will check if it has enough to reach the target
2923 if (((unsigned short*)phash)[14] == 0)
2926 // If nothing found after trying for a while, return -1
2927 if ((nNonce & 0xffff) == 0)
2929 nHashesDone = 0xffff+1;
2935 // Some explaining would be appreciated
2940 set<uint256> setDependsOn;
2943 COrphan(CTransaction* ptxIn)
2951 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2952 BOOST_FOREACH(uint256 hash, setDependsOn)
2953 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2958 uint64 nLastBlockTx = 0;
2959 uint64 nLastBlockSize = 0;
2961 CBlock* CreateNewBlock(CReserveKey& reservekey)
2963 CBlockIndex* pindexPrev = pindexBest;
2966 auto_ptr<CBlock> pblock(new CBlock());
2970 // Create coinbase tx
2972 txNew.vin.resize(1);
2973 txNew.vin[0].prevout.SetNull();
2974 txNew.vout.resize(1);
2975 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2977 // Add our coinbase tx as first transaction
2978 pblock->vtx.push_back(txNew);
2980 // Collect memory pool transactions into the block
2982 CRITICAL_BLOCK(cs_main)
2983 CRITICAL_BLOCK(cs_mapTransactions)
2987 // Priority order to process transactions
2988 list<COrphan> vOrphan; // list memory doesn't move
2989 map<uint256, vector<COrphan*> > mapDependers;
2990 multimap<double, CTransaction*> mapPriority;
2991 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2993 CTransaction& tx = (*mi).second;
2994 if (tx.IsCoinBase() || !tx.IsFinal())
2997 COrphan* porphan = NULL;
2998 double dPriority = 0;
2999 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3001 // Read prev transaction
3002 CTransaction txPrev;
3004 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3006 // Has to wait for dependencies
3009 // Use list for automatic deletion
3010 vOrphan.push_back(COrphan(&tx));
3011 porphan = &vOrphan.back();
3013 mapDependers[txin.prevout.hash].push_back(porphan);
3014 porphan->setDependsOn.insert(txin.prevout.hash);
3017 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3019 // Read block header
3020 int nConf = txindex.GetDepthInMainChain();
3022 dPriority += (double)nValueIn * nConf;
3024 if (fDebug && GetBoolArg("-printpriority"))
3025 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3028 // Priority is sum(valuein * age) / txsize
3029 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3032 porphan->dPriority = dPriority;
3034 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3036 if (fDebug && GetBoolArg("-printpriority"))
3038 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3045 // Collect transactions into block
3046 map<uint256, CTxIndex> mapTestPool;
3047 uint64 nBlockSize = 1000;
3048 uint64 nBlockTx = 0;
3049 int nBlockSigOps1 = 100; // pre-0.6 count of sigOps
3050 int nBlockSigOps2 = 100; // post-0.6 count of sigOps
3051 while (!mapPriority.empty())
3053 // Take highest priority transaction off priority queue
3054 double dPriority = -(*mapPriority.begin()).first;
3055 CTransaction& tx = *(*mapPriority.begin()).second;
3056 mapPriority.erase(mapPriority.begin());
3059 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3060 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3063 // Legacy limits on sigOps:
3064 int nTxSigOps1 = tx.GetLegacySigOpCount();
3065 if (nBlockSigOps1 + nTxSigOps1 >= MAX_BLOCK_SIGOPS)
3068 // Transaction fee required depends on block size
3069 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3070 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3072 // Connecting shouldn't fail due to dependency on other memory pool transactions
3073 // because we're already processing them in order of dependency
3074 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3075 MapPrevTx mapInputs;
3077 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3080 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3081 if (nFees < nMinFee)
3084 int nTxSigOps2 = tx.GetSigOpCount(mapInputs);
3085 if (nBlockSigOps2 + nTxSigOps2 >= MAX_BLOCK_SIGOPS)
3088 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3090 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3091 swap(mapTestPool, mapTestPoolTmp);
3094 pblock->vtx.push_back(tx);
3095 nBlockSize += nTxSize;
3097 nBlockSigOps1 += nTxSigOps1;
3098 nBlockSigOps2 += nTxSigOps2;
3100 // Add transactions that depend on this one to the priority queue
3101 uint256 hash = tx.GetHash();
3102 if (mapDependers.count(hash))
3104 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3106 if (!porphan->setDependsOn.empty())
3108 porphan->setDependsOn.erase(hash);
3109 if (porphan->setDependsOn.empty())
3110 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3116 nLastBlockTx = nBlockTx;
3117 nLastBlockSize = nBlockSize;
3118 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3121 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3124 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3125 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3126 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3127 pblock->nBits = GetNextWorkRequired(pindexPrev);
3130 return pblock.release();
3134 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3136 // Update nExtraNonce
3137 static uint256 hashPrevBlock;
3138 if (hashPrevBlock != pblock->hashPrevBlock)
3141 hashPrevBlock = pblock->hashPrevBlock;
3144 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3145 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3147 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3151 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3154 // Prebuild hash buffers
3161 uint256 hashPrevBlock;
3162 uint256 hashMerkleRoot;
3165 unsigned int nNonce;
3168 unsigned char pchPadding0[64];
3170 unsigned char pchPadding1[64];
3173 memset(&tmp, 0, sizeof(tmp));
3175 tmp.block.nVersion = pblock->nVersion;
3176 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3177 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3178 tmp.block.nTime = pblock->nTime;
3179 tmp.block.nBits = pblock->nBits;
3180 tmp.block.nNonce = pblock->nNonce;
3182 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3183 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3185 // Byte swap all the input buffer
3186 for (int i = 0; i < sizeof(tmp)/4; i++)
3187 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3189 // Precalc the first half of the first hash, which stays constant
3190 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3192 memcpy(pdata, &tmp.block, 128);
3193 memcpy(phash1, &tmp.hash1, 64);
3197 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3199 uint256 hash = pblock->GetHash();
3200 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3202 if (hash > hashTarget)
3206 printf("BitcoinMiner:\n");
3207 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3209 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3210 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3213 CRITICAL_BLOCK(cs_main)
3215 if (pblock->hashPrevBlock != hashBestChain)
3216 return error("BitcoinMiner : generated block is stale");
3218 // Remove key from key pool
3219 reservekey.KeepKey();
3221 // Track how many getdata requests this block gets
3222 CRITICAL_BLOCK(wallet.cs_wallet)
3223 wallet.mapRequestCount[pblock->GetHash()] = 0;
3225 // Process this block the same as if we had received it from another node
3226 if (!ProcessBlock(NULL, pblock))
3227 return error("BitcoinMiner : ProcessBlock, block not accepted");
3233 void static ThreadBitcoinMiner(void* parg);
3235 void static BitcoinMiner(CWallet *pwallet)
3237 printf("BitcoinMiner started\n");
3238 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3240 // Each thread has its own key and counter
3241 CReserveKey reservekey(pwallet);
3242 unsigned int nExtraNonce = 0;
3244 while (fGenerateBitcoins)
3246 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3250 while (vNodes.empty() || IsInitialBlockDownload())
3255 if (!fGenerateBitcoins)
3263 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3264 CBlockIndex* pindexPrev = pindexBest;
3266 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3269 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3271 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3275 // Prebuild hash buffers
3277 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3278 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3279 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3281 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3283 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3284 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3290 int64 nStart = GetTime();
3291 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3293 uint256& hash = *alignup<16>(hashbuf);
3296 unsigned int nHashesDone = 0;
3297 unsigned int nNonceFound;
3300 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3301 (char*)&hash, nHashesDone);
3303 // Check if something found
3304 if (nNonceFound != -1)
3306 for (int i = 0; i < sizeof(hash)/4; i++)
3307 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3309 if (hash <= hashTarget)
3312 pblock->nNonce = ByteReverse(nNonceFound);
3313 assert(hash == pblock->GetHash());
3315 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3316 CheckWork(pblock.get(), *pwalletMain, reservekey);
3317 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3323 static int64 nHashCounter;
3324 if (nHPSTimerStart == 0)
3326 nHPSTimerStart = GetTimeMillis();
3330 nHashCounter += nHashesDone;
3331 if (GetTimeMillis() - nHPSTimerStart > 4000)
3333 static CCriticalSection cs;
3336 if (GetTimeMillis() - nHPSTimerStart > 4000)
3338 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3339 nHPSTimerStart = GetTimeMillis();
3341 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3342 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3343 static int64 nLogTime;
3344 if (GetTime() - nLogTime > 30 * 60)
3346 nLogTime = GetTime();
3347 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3348 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3354 // Check for stop or if block needs to be rebuilt
3357 if (!fGenerateBitcoins)
3359 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3363 if (nBlockNonce >= 0xffff0000)
3365 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3367 if (pindexPrev != pindexBest)
3370 // Update nTime every few seconds
3371 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3372 nBlockTime = ByteReverse(pblock->nTime);
3377 void static ThreadBitcoinMiner(void* parg)
3379 CWallet* pwallet = (CWallet*)parg;
3382 vnThreadsRunning[3]++;
3383 BitcoinMiner(pwallet);
3384 vnThreadsRunning[3]--;
3386 catch (std::exception& e) {
3387 vnThreadsRunning[3]--;
3388 PrintException(&e, "ThreadBitcoinMiner()");
3390 vnThreadsRunning[3]--;
3391 PrintException(NULL, "ThreadBitcoinMiner()");
3393 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3395 if (vnThreadsRunning[3] == 0)
3397 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3401 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3403 if (fGenerateBitcoins != fGenerate)
3405 fGenerateBitcoins = fGenerate;
3406 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3409 if (fGenerateBitcoins)
3411 int nProcessors = boost::thread::hardware_concurrency();
3412 printf("%d processors\n", nProcessors);
3413 if (nProcessors < 1)
3415 if (fLimitProcessors && nProcessors > nLimitProcessors)
3416 nProcessors = nLimitProcessors;
3417 int nAddThreads = nProcessors - vnThreadsRunning[3];
3418 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3419 for (int i = 0; i < nAddThreads; i++)
3421 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3422 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");