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 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs))
495 *pfMissingInputs = true;
496 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
499 // Check for non-standard pay-to-script-hash in inputs
500 if (!AreInputsStandard(mapInputs) && !fTestNet)
501 return error("AcceptToMemoryPool() : nonstandard transaction input");
503 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
504 int nSigOps = GetSigOpCount(mapInputs);
505 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
507 // Don't accept it if it can't get into a block
508 if (nFees < GetMinFee(1000, true, GMF_RELAY))
509 return error("AcceptToMemoryPool() : not enough fees");
511 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
512 // attacks disallow transactions with more than one SigOp per 65 bytes.
513 // 65 bytes because that is the minimum size of an ECDSA signature
514 if (nSigOps > nSize / 65 || nSize < 100)
515 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
517 // Continuously rate-limit free transactions
518 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
519 // be annoying or make other's transactions take longer to confirm.
520 if (nFees < MIN_RELAY_TX_FEE)
522 static CCriticalSection cs;
523 static double dFreeCount;
524 static int64 nLastTime;
525 int64 nNow = GetTime();
529 // Use an exponentially decaying ~10-minute window:
530 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
532 // -limitfreerelay unit is thousand-bytes-per-minute
533 // At default rate it would take over a month to fill 1GB
534 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
535 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
537 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
542 // Check against previous transactions
543 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
544 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
547 *pfMissingInputs = true;
548 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
552 // Store transaction in memory
553 CRITICAL_BLOCK(cs_mapTransactions)
557 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
558 ptxOld->RemoveFromMemoryPool();
560 AddToMemoryPoolUnchecked();
563 ///// are we sure this is ok when loading transactions or restoring block txes
564 // If updated, erase old tx from wallet
566 EraseFromWallets(ptxOld->GetHash());
568 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
572 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
575 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
578 uint64 nPooledTx = 0;
580 bool CTransaction::AddToMemoryPoolUnchecked()
582 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
583 // Add to memory pool without checking anything. Don't call this directly,
584 // call AcceptToMemoryPool to properly check the transaction first.
585 CRITICAL_BLOCK(cs_mapTransactions)
587 uint256 hash = GetHash();
588 mapTransactions[hash] = *this;
589 for (int i = 0; i < vin.size(); i++)
590 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
591 nTransactionsUpdated++;
598 bool CTransaction::RemoveFromMemoryPool()
600 // Remove transaction from memory pool
601 CRITICAL_BLOCK(cs_mapTransactions)
603 BOOST_FOREACH(const CTxIn& txin, vin)
604 mapNextTx.erase(txin.prevout);
605 mapTransactions.erase(GetHash());
606 nTransactionsUpdated++;
617 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
619 if (hashBlock == 0 || nIndex == -1)
622 // Find the block it claims to be in
623 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
624 if (mi == mapBlockIndex.end())
626 CBlockIndex* pindex = (*mi).second;
627 if (!pindex || !pindex->IsInMainChain())
630 // Make sure the merkle branch connects to this block
631 if (!fMerkleVerified)
633 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
635 fMerkleVerified = true;
639 return pindexBest->nHeight - pindex->nHeight + 1;
643 int CMerkleTx::GetBlocksToMaturity() const
647 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
651 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
655 if (!IsInMainChain() && !ClientConnectInputs())
657 return CTransaction::AcceptToMemoryPool(txdb, false);
661 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
665 bool CMerkleTx::AcceptToMemoryPool()
668 return AcceptToMemoryPool(txdb);
673 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
675 CRITICAL_BLOCK(cs_mapTransactions)
677 // Add previous supporting transactions first
678 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
680 if (!tx.IsCoinBase())
682 uint256 hash = tx.GetHash();
683 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
684 tx.AcceptToMemoryPool(txdb, fCheckInputs);
687 return AcceptToMemoryPool(txdb, fCheckInputs);
692 bool CWalletTx::AcceptWalletTransaction()
695 return AcceptWalletTransaction(txdb);
698 int CTxIndex::GetDepthInMainChain() const
702 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
704 // Find the block in the index
705 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
706 if (mi == mapBlockIndex.end())
708 CBlockIndex* pindex = (*mi).second;
709 if (!pindex || !pindex->IsInMainChain())
711 return 1 + nBestHeight - pindex->nHeight;
723 //////////////////////////////////////////////////////////////////////////////
725 // CBlock and CBlockIndex
728 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
730 if (!fReadTransactions)
732 *this = pindex->GetBlockHeader();
735 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
737 if (GetHash() != pindex->GetBlockHash())
738 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
742 uint256 static GetOrphanRoot(const CBlock* pblock)
744 // Work back to the first block in the orphan chain
745 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
746 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
747 return pblock->GetHash();
750 int64 static GetBlockValue(int nHeight, int64 nFees)
752 int64 nSubsidy = 50 * COIN;
754 // Subsidy is cut in half every 4 years
755 nSubsidy >>= (nHeight / 210000);
757 return nSubsidy + nFees;
760 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
761 static const int64 nTargetSpacing = 10 * 60;
762 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
765 // minimum amount of work that could possibly be required nTime after
766 // minimum work required was nBase
768 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
771 bnResult.SetCompact(nBase);
772 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
774 // Maximum 400% adjustment...
776 // ... in best-case exactly 4-times-normal target time
777 nTime -= nTargetTimespan*4;
779 if (bnResult > bnProofOfWorkLimit)
780 bnResult = bnProofOfWorkLimit;
781 return bnResult.GetCompact();
784 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
788 if (pindexLast == NULL)
789 return bnProofOfWorkLimit.GetCompact();
791 // Only change once per interval
792 if ((pindexLast->nHeight+1) % nInterval != 0)
793 return pindexLast->nBits;
795 // Go back by what we want to be 14 days worth of blocks
796 const CBlockIndex* pindexFirst = pindexLast;
797 for (int i = 0; pindexFirst && i < nInterval-1; i++)
798 pindexFirst = pindexFirst->pprev;
801 // Limit adjustment step
802 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
803 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
804 if (nActualTimespan < nTargetTimespan/4)
805 nActualTimespan = nTargetTimespan/4;
806 if (nActualTimespan > nTargetTimespan*4)
807 nActualTimespan = nTargetTimespan*4;
811 bnNew.SetCompact(pindexLast->nBits);
812 bnNew *= nActualTimespan;
813 bnNew /= nTargetTimespan;
815 if (bnNew > bnProofOfWorkLimit)
816 bnNew = bnProofOfWorkLimit;
819 printf("GetNextWorkRequired RETARGET\n");
820 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
821 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
822 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
824 return bnNew.GetCompact();
827 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
830 bnTarget.SetCompact(nBits);
833 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
834 return error("CheckProofOfWork() : nBits below minimum work");
836 // Check proof of work matches claimed amount
837 if (hash > bnTarget.getuint256())
838 return error("CheckProofOfWork() : hash doesn't match nBits");
843 // Return maximum amount of blocks that other nodes claim to have
844 int GetNumBlocksOfPeers()
846 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
849 bool IsInitialBlockDownload()
851 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
853 static int64 nLastUpdate;
854 static CBlockIndex* pindexLastBest;
855 if (pindexBest != pindexLastBest)
857 pindexLastBest = pindexBest;
858 nLastUpdate = GetTime();
860 return (GetTime() - nLastUpdate < 10 &&
861 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
864 void static InvalidChainFound(CBlockIndex* pindexNew)
866 if (pindexNew->bnChainWork > bnBestInvalidWork)
868 bnBestInvalidWork = pindexNew->bnChainWork;
869 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
872 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());
873 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
874 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
875 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
888 bool CTransaction::DisconnectInputs(CTxDB& txdb)
890 // Relinquish previous transactions' spent pointers
893 BOOST_FOREACH(const CTxIn& txin, vin)
895 COutPoint prevout = txin.prevout;
897 // Get prev txindex from disk
899 if (!txdb.ReadTxIndex(prevout.hash, txindex))
900 return error("DisconnectInputs() : ReadTxIndex failed");
902 if (prevout.n >= txindex.vSpent.size())
903 return error("DisconnectInputs() : prevout.n out of range");
905 // Mark outpoint as not spent
906 txindex.vSpent[prevout.n].SetNull();
909 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
910 return error("DisconnectInputs() : UpdateTxIndex failed");
914 // Remove transaction from index
915 if (!txdb.EraseTxIndex(*this))
916 return error("DisconnectInputs() : EraseTxPos failed");
922 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
923 bool fBlock, bool fMiner, MapPrevTx& inputsRet)
926 return true; // Coinbase transactions have no inputs to fetch.
928 for (int i = 0; i < vin.size(); i++)
930 COutPoint prevout = vin[i].prevout;
931 if (inputsRet.count(prevout.hash))
932 continue; // Got it already
935 CTxIndex& txindex = inputsRet[prevout.hash].first;
937 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
939 // Get txindex from current proposed changes
940 txindex = mapTestPool.find(prevout.hash)->second;
944 // Read txindex from txdb
945 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
947 if (!fFound && (fBlock || fMiner))
948 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());
951 CTransaction& txPrev = inputsRet[prevout.hash].second;
952 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
954 // Get prev tx from single transactions in memory
955 CRITICAL_BLOCK(cs_mapTransactions)
957 if (!mapTransactions.count(prevout.hash))
958 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
959 txPrev = mapTransactions[prevout.hash];
962 txindex.vSpent.resize(txPrev.vout.size());
966 // Get prev tx from disk
967 if (!txPrev.ReadFromDisk(txindex.pos))
968 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
972 // Make sure all prevout.n's are valid:
973 for (int i = 0; i < vin.size(); i++)
975 const COutPoint prevout = vin[i].prevout;
976 assert(inputsRet.count(prevout.hash) != 0);
977 const CTxIndex& txindex = inputsRet[prevout.hash].first;
978 const CTransaction& txPrev = inputsRet[prevout.hash].second;
979 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
980 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()));
986 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
988 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
989 if (mi == inputs.end())
990 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
992 const CTransaction& txPrev = (mi->second).second;
993 if (input.prevout.n >= txPrev.vout.size())
994 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
996 return txPrev.vout[input.prevout.n];
999 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1005 for (int i = 0; i < vin.size(); i++)
1007 nResult += GetOutputFor(vin[i], inputs).nValue;
1013 int CTransaction::GetSigOpCount(const MapPrevTx& inputs) const
1019 for (int i = 0; i < vin.size(); i++)
1021 nSigOps += GetOutputFor(vin[i], inputs).scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1026 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1027 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1028 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner)
1030 // Take over previous transactions' spent pointers
1031 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1032 // fMiner is true when called from the internal bitcoin miner
1033 // ... both are false when called from CTransaction::AcceptToMemoryPool
1038 for (int i = 0; i < vin.size(); i++)
1040 COutPoint prevout = vin[i].prevout;
1041 assert(inputs.count(prevout.hash) > 0);
1042 CTxIndex& txindex = inputs[prevout.hash].first;
1043 CTransaction& txPrev = inputs[prevout.hash].second;
1045 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1046 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()));
1048 // If prev is coinbase, check that it's matured
1049 if (txPrev.IsCoinBase())
1050 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1051 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1052 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1054 // Check for conflicts (double-spend)
1055 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1056 // for an attacker to attempt to split the network.
1057 if (!txindex.vSpent[prevout.n].IsNull())
1058 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());
1060 // Check for negative or overflow input values
1061 nValueIn += txPrev.vout[prevout.n].nValue;
1062 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1063 return DoS(100, error("ConnectInputs() : txin values out of range"));
1065 bool fStrictPayToScriptHash = true;
1068 // To avoid being on the short end of a block-chain split,
1069 // don't do secondary validation of pay-to-script-hash transactions
1070 // until blocks with timestamps after paytoscripthashtime:
1071 int64 nEvalSwitchTime = GetArg("paytoscripthashtime", 1329264000); // Feb 15, 2012
1072 fStrictPayToScriptHash = (pindexBlock->nTime >= nEvalSwitchTime);
1074 // if !fBlock, then always be strict-- don't accept
1075 // invalid-under-new-rules pay-to-script-hash transactions into
1076 // our memory pool (don't relay them, don't include them
1077 // in blocks we mine).
1079 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1080 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1081 // still computed and checked, and any change will be caught at the next checkpoint.
1082 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1085 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1086 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1089 // Mark outpoints as spent
1090 txindex.vSpent[prevout.n] = posThisTx;
1093 if (fBlock || fMiner)
1095 mapTestPool[prevout.hash] = txindex;
1099 if (nValueIn < GetValueOut())
1100 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1102 // Tally transaction fees
1103 int64 nTxFee = nValueIn - GetValueOut();
1105 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1107 if (!MoneyRange(nFees))
1108 return DoS(100, error("ConnectInputs() : nFees out of range"));
1115 bool CTransaction::ClientConnectInputs()
1120 // Take over previous transactions' spent pointers
1121 CRITICAL_BLOCK(cs_mapTransactions)
1124 for (int i = 0; i < vin.size(); i++)
1126 // Get prev tx from single transactions in memory
1127 COutPoint prevout = vin[i].prevout;
1128 if (!mapTransactions.count(prevout.hash))
1130 CTransaction& txPrev = mapTransactions[prevout.hash];
1132 if (prevout.n >= txPrev.vout.size())
1136 if (!VerifySignature(txPrev, *this, i, true, 0))
1137 return error("ConnectInputs() : VerifySignature failed");
1139 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1140 ///// this has to go away now that posNext is gone
1141 // // Check for conflicts
1142 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1143 // return error("ConnectInputs() : prev tx already used");
1145 // // Flag outpoints as used
1146 // txPrev.vout[prevout.n].posNext = posThisTx;
1148 nValueIn += txPrev.vout[prevout.n].nValue;
1150 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1151 return error("ClientConnectInputs() : txin values out of range");
1153 if (GetValueOut() > nValueIn)
1163 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1165 // Disconnect in reverse order
1166 for (int i = vtx.size()-1; i >= 0; i--)
1167 if (!vtx[i].DisconnectInputs(txdb))
1170 // Update block index on disk without changing it in memory.
1171 // The memory index structure will be changed after the db commits.
1174 CDiskBlockIndex blockindexPrev(pindex->pprev);
1175 blockindexPrev.hashNext = 0;
1176 if (!txdb.WriteBlockIndex(blockindexPrev))
1177 return error("DisconnectBlock() : WriteBlockIndex failed");
1183 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1185 // Check it again in case a previous version let a bad block in
1189 //// issue here: it doesn't know the version
1190 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1192 map<uint256, CTxIndex> mapQueuedChanges;
1195 BOOST_FOREACH(CTransaction& tx, vtx)
1197 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1198 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1200 MapPrevTx mapInputs;
1201 if (!tx.IsCoinBase())
1203 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs))
1206 int nTxOps = tx.GetSigOpCount(mapInputs);
1208 if (nSigOps > MAX_BLOCK_SIGOPS)
1209 return DoS(100, error("ConnectBlock() : too many sigops"));
1210 // There is a different MAX_BLOCK_SIGOPS check in AcceptBlock();
1211 // a block must satisfy both to make it into the best-chain
1212 // (AcceptBlock() is always called before ConnectBlock())
1214 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1216 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false))
1220 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1223 // Write queued txindex changes
1224 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1226 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1227 return error("ConnectBlock() : UpdateTxIndex failed");
1230 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
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 = pindex->GetBlockHash();
1239 if (!txdb.WriteBlockIndex(blockindexPrev))
1240 return error("ConnectBlock() : WriteBlockIndex failed");
1243 // Watch for transactions paying to me
1244 BOOST_FOREACH(CTransaction& tx, vtx)
1245 SyncWithWallets(tx, this, true);
1250 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1252 printf("REORGANIZE\n");
1255 CBlockIndex* pfork = pindexBest;
1256 CBlockIndex* plonger = pindexNew;
1257 while (pfork != plonger)
1259 while (plonger->nHeight > pfork->nHeight)
1260 if (!(plonger = plonger->pprev))
1261 return error("Reorganize() : plonger->pprev is null");
1262 if (pfork == plonger)
1264 if (!(pfork = pfork->pprev))
1265 return error("Reorganize() : pfork->pprev is null");
1268 // List of what to disconnect
1269 vector<CBlockIndex*> vDisconnect;
1270 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1271 vDisconnect.push_back(pindex);
1273 // List of what to connect
1274 vector<CBlockIndex*> vConnect;
1275 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1276 vConnect.push_back(pindex);
1277 reverse(vConnect.begin(), vConnect.end());
1279 // Disconnect shorter branch
1280 vector<CTransaction> vResurrect;
1281 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1284 if (!block.ReadFromDisk(pindex))
1285 return error("Reorganize() : ReadFromDisk for disconnect failed");
1286 if (!block.DisconnectBlock(txdb, pindex))
1287 return error("Reorganize() : DisconnectBlock failed");
1289 // Queue memory transactions to resurrect
1290 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1291 if (!tx.IsCoinBase())
1292 vResurrect.push_back(tx);
1295 // Connect longer branch
1296 vector<CTransaction> vDelete;
1297 for (int i = 0; i < vConnect.size(); i++)
1299 CBlockIndex* pindex = vConnect[i];
1301 if (!block.ReadFromDisk(pindex))
1302 return error("Reorganize() : ReadFromDisk for connect failed");
1303 if (!block.ConnectBlock(txdb, pindex))
1307 return error("Reorganize() : ConnectBlock failed");
1310 // Queue memory transactions to delete
1311 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1312 vDelete.push_back(tx);
1314 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1315 return error("Reorganize() : WriteHashBestChain failed");
1317 // Make sure it's successfully written to disk before changing memory structure
1318 if (!txdb.TxnCommit())
1319 return error("Reorganize() : TxnCommit failed");
1321 // Disconnect shorter branch
1322 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1324 pindex->pprev->pnext = NULL;
1326 // Connect longer branch
1327 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1329 pindex->pprev->pnext = pindex;
1331 // Resurrect memory transactions that were in the disconnected branch
1332 BOOST_FOREACH(CTransaction& tx, vResurrect)
1333 tx.AcceptToMemoryPool(txdb, false);
1335 // Delete redundant memory transactions that are in the connected branch
1336 BOOST_FOREACH(CTransaction& tx, vDelete)
1337 tx.RemoveFromMemoryPool();
1344 runCommand(std::string strCommand)
1346 int nErr = ::system(strCommand.c_str());
1348 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1351 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1353 uint256 hash = GetHash();
1356 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1358 txdb.WriteHashBestChain(hash);
1359 if (!txdb.TxnCommit())
1360 return error("SetBestChain() : TxnCommit failed");
1361 pindexGenesisBlock = pindexNew;
1363 else if (hashPrevBlock == hashBestChain)
1365 // Adding to current best branch
1366 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1369 InvalidChainFound(pindexNew);
1370 return error("SetBestChain() : ConnectBlock failed");
1372 if (!txdb.TxnCommit())
1373 return error("SetBestChain() : TxnCommit failed");
1375 // Add to current best branch
1376 pindexNew->pprev->pnext = pindexNew;
1378 // Delete redundant memory transactions
1379 BOOST_FOREACH(CTransaction& tx, vtx)
1380 tx.RemoveFromMemoryPool();
1385 if (!Reorganize(txdb, pindexNew))
1388 InvalidChainFound(pindexNew);
1389 return error("SetBestChain() : Reorganize failed");
1393 // Update best block in wallet (so we can detect restored wallets)
1394 bool fIsInitialDownload = IsInitialBlockDownload();
1395 if (!fIsInitialDownload)
1397 const CBlockLocator locator(pindexNew);
1398 ::SetBestChain(locator);
1402 hashBestChain = hash;
1403 pindexBest = pindexNew;
1404 nBestHeight = pindexBest->nHeight;
1405 bnBestChainWork = pindexNew->bnChainWork;
1406 nTimeBestReceived = GetTime();
1407 nTransactionsUpdated++;
1408 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1410 std::string strCmd = GetArg("-blocknotify", "");
1412 if (!fIsInitialDownload && !strCmd.empty())
1414 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1415 boost::thread t(runCommand, strCmd); // thread runs free
1422 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1424 // Check for duplicate
1425 uint256 hash = GetHash();
1426 if (mapBlockIndex.count(hash))
1427 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1429 // Construct new block index object
1430 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1432 return error("AddToBlockIndex() : new CBlockIndex failed");
1433 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1434 pindexNew->phashBlock = &((*mi).first);
1435 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1436 if (miPrev != mapBlockIndex.end())
1438 pindexNew->pprev = (*miPrev).second;
1439 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1441 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1445 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1446 if (!txdb.TxnCommit())
1450 if (pindexNew->bnChainWork > bnBestChainWork)
1451 if (!SetBestChain(txdb, pindexNew))
1456 if (pindexNew == pindexBest)
1458 // Notify UI to display prev block's coinbase if it was ours
1459 static uint256 hashPrevBestCoinBase;
1460 UpdatedTransaction(hashPrevBestCoinBase);
1461 hashPrevBestCoinBase = vtx[0].GetHash();
1471 bool CBlock::CheckBlock() const
1473 // These are checks that are independent of context
1474 // that can be verified before saving an orphan block.
1477 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1478 return DoS(100, error("CheckBlock() : size limits failed"));
1480 // Check proof of work matches claimed amount
1481 if (!CheckProofOfWork(GetHash(), nBits))
1482 return DoS(50, error("CheckBlock() : proof of work failed"));
1485 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1486 return error("CheckBlock() : block timestamp too far in the future");
1488 // First transaction must be coinbase, the rest must not be
1489 if (vtx.empty() || !vtx[0].IsCoinBase())
1490 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1491 for (int i = 1; i < vtx.size(); i++)
1492 if (vtx[i].IsCoinBase())
1493 return DoS(100, error("CheckBlock() : more than one coinbase"));
1495 // Check transactions
1496 BOOST_FOREACH(const CTransaction& tx, vtx)
1497 if (!tx.CheckTransaction())
1498 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1500 // Pre-pay-to-script-hash (before version 0.6), this is how sigops
1501 // were counted; there is another check in ConnectBlock when
1502 // transaction inputs are fetched to count pay-to-script-hash sigops:
1504 BOOST_FOREACH(const CTransaction& tx, vtx)
1506 nSigOps += tx.GetLegacySigOpCount();
1508 if (nSigOps > MAX_BLOCK_SIGOPS)
1509 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1512 if (hashMerkleRoot != BuildMerkleTree())
1513 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1518 bool CBlock::AcceptBlock()
1520 // Check for duplicate
1521 uint256 hash = GetHash();
1522 if (mapBlockIndex.count(hash))
1523 return error("AcceptBlock() : block already in mapBlockIndex");
1525 // Get prev block index
1526 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1527 if (mi == mapBlockIndex.end())
1528 return DoS(10, error("AcceptBlock() : prev block not found"));
1529 CBlockIndex* pindexPrev = (*mi).second;
1530 int nHeight = pindexPrev->nHeight+1;
1532 // Check proof of work
1533 if (nBits != GetNextWorkRequired(pindexPrev))
1534 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1536 // Check timestamp against prev
1537 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1538 return error("AcceptBlock() : block's timestamp is too early");
1540 // Check that all transactions are finalized
1541 BOOST_FOREACH(const CTransaction& tx, vtx)
1542 if (!tx.IsFinal(nHeight, GetBlockTime()))
1543 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1545 // Check that the block chain matches the known block chain up to a checkpoint
1546 if (!Checkpoints::CheckBlock(nHeight, hash))
1547 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1549 // Write block to history file
1550 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1551 return error("AcceptBlock() : out of disk space");
1552 unsigned int nFile = -1;
1553 unsigned int nBlockPos = 0;
1554 if (!WriteToDisk(nFile, nBlockPos))
1555 return error("AcceptBlock() : WriteToDisk failed");
1556 if (!AddToBlockIndex(nFile, nBlockPos))
1557 return error("AcceptBlock() : AddToBlockIndex failed");
1559 // Relay inventory, but don't relay old inventory during initial block download
1560 if (hashBestChain == hash)
1561 CRITICAL_BLOCK(cs_vNodes)
1562 BOOST_FOREACH(CNode* pnode, vNodes)
1563 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1564 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1569 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1571 // Check for duplicate
1572 uint256 hash = pblock->GetHash();
1573 if (mapBlockIndex.count(hash))
1574 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1575 if (mapOrphanBlocks.count(hash))
1576 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1578 // Preliminary checks
1579 if (!pblock->CheckBlock())
1580 return error("ProcessBlock() : CheckBlock FAILED");
1582 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1583 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1585 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1586 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1589 pfrom->Misbehaving(100);
1590 return error("ProcessBlock() : block with timestamp before last checkpoint");
1593 bnNewBlock.SetCompact(pblock->nBits);
1595 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1596 if (bnNewBlock > bnRequired)
1598 pfrom->Misbehaving(100);
1599 return error("ProcessBlock() : block with too little proof-of-work");
1604 // If don't already have its previous block, shunt it off to holding area until we get it
1605 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1607 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1608 CBlock* pblock2 = new CBlock(*pblock);
1609 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1610 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1612 // Ask this guy to fill in what we're missing
1614 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1619 if (!pblock->AcceptBlock())
1620 return error("ProcessBlock() : AcceptBlock FAILED");
1622 // Recursively process any orphan blocks that depended on this one
1623 vector<uint256> vWorkQueue;
1624 vWorkQueue.push_back(hash);
1625 for (int i = 0; i < vWorkQueue.size(); i++)
1627 uint256 hashPrev = vWorkQueue[i];
1628 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1629 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1632 CBlock* pblockOrphan = (*mi).second;
1633 if (pblockOrphan->AcceptBlock())
1634 vWorkQueue.push_back(pblockOrphan->GetHash());
1635 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1636 delete pblockOrphan;
1638 mapOrphanBlocksByPrev.erase(hashPrev);
1641 printf("ProcessBlock: ACCEPTED\n");
1652 bool CheckDiskSpace(uint64 nAdditionalBytes)
1654 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1656 // Check for 15MB because database could create another 10MB log file at any time
1657 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1660 string strMessage = _("Warning: Disk space is low ");
1661 strMiscWarning = strMessage;
1662 printf("*** %s\n", strMessage.c_str());
1663 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1664 CreateThread(Shutdown, NULL);
1670 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1674 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1677 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1679 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1688 static unsigned int nCurrentBlockFile = 1;
1690 FILE* AppendBlockFile(unsigned int& nFileRet)
1695 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1698 if (fseek(file, 0, SEEK_END) != 0)
1700 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1701 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1703 nFileRet = nCurrentBlockFile;
1707 nCurrentBlockFile++;
1711 bool LoadBlockIndex(bool fAllowNew)
1715 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1716 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1717 pchMessageStart[0] = 0xfa;
1718 pchMessageStart[1] = 0xbf;
1719 pchMessageStart[2] = 0xb5;
1720 pchMessageStart[3] = 0xda;
1727 if (!txdb.LoadBlockIndex())
1732 // Init with genesis block
1734 if (mapBlockIndex.empty())
1740 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1741 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1742 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1743 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1744 // vMerkleTree: 4a5e1e
1747 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1749 txNew.vin.resize(1);
1750 txNew.vout.resize(1);
1751 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1752 txNew.vout[0].nValue = 50 * COIN;
1753 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1755 block.vtx.push_back(txNew);
1756 block.hashPrevBlock = 0;
1757 block.hashMerkleRoot = block.BuildMerkleTree();
1759 block.nTime = 1231006505;
1760 block.nBits = 0x1d00ffff;
1761 block.nNonce = 2083236893;
1765 block.nTime = 1296688602;
1766 block.nBits = 0x1d07fff8;
1767 block.nNonce = 384568319;
1771 printf("%s\n", block.GetHash().ToString().c_str());
1772 printf("%s\n", hashGenesisBlock.ToString().c_str());
1773 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1774 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1776 assert(block.GetHash() == hashGenesisBlock);
1778 // Start new block file
1780 unsigned int nBlockPos;
1781 if (!block.WriteToDisk(nFile, nBlockPos))
1782 return error("LoadBlockIndex() : writing genesis block to disk failed");
1783 if (!block.AddToBlockIndex(nFile, nBlockPos))
1784 return error("LoadBlockIndex() : genesis block not accepted");
1792 void PrintBlockTree()
1794 // precompute tree structure
1795 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1796 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1798 CBlockIndex* pindex = (*mi).second;
1799 mapNext[pindex->pprev].push_back(pindex);
1801 //while (rand() % 3 == 0)
1802 // mapNext[pindex->pprev].push_back(pindex);
1805 vector<pair<int, CBlockIndex*> > vStack;
1806 vStack.push_back(make_pair(0, pindexGenesisBlock));
1809 while (!vStack.empty())
1811 int nCol = vStack.back().first;
1812 CBlockIndex* pindex = vStack.back().second;
1815 // print split or gap
1816 if (nCol > nPrevCol)
1818 for (int i = 0; i < nCol-1; i++)
1822 else if (nCol < nPrevCol)
1824 for (int i = 0; i < nCol; i++)
1831 for (int i = 0; i < nCol; i++)
1836 block.ReadFromDisk(pindex);
1837 printf("%d (%u,%u) %s %s tx %d",
1841 block.GetHash().ToString().substr(0,20).c_str(),
1842 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1845 PrintWallets(block);
1847 // put the main timechain first
1848 vector<CBlockIndex*>& vNext = mapNext[pindex];
1849 for (int i = 0; i < vNext.size(); i++)
1851 if (vNext[i]->pnext)
1853 swap(vNext[0], vNext[i]);
1859 for (int i = 0; i < vNext.size(); i++)
1860 vStack.push_back(make_pair(nCol+i, vNext[i]));
1873 //////////////////////////////////////////////////////////////////////////////
1878 map<uint256, CAlert> mapAlerts;
1879 CCriticalSection cs_mapAlerts;
1881 string GetWarnings(string strFor)
1884 string strStatusBar;
1886 if (GetBoolArg("-testsafemode"))
1889 // Misc warnings like out of disk space and clock is wrong
1890 if (strMiscWarning != "")
1893 strStatusBar = strMiscWarning;
1896 // Longer invalid proof-of-work chain
1897 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1900 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1904 CRITICAL_BLOCK(cs_mapAlerts)
1906 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1908 const CAlert& alert = item.second;
1909 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1911 nPriority = alert.nPriority;
1912 strStatusBar = alert.strStatusBar;
1917 if (strFor == "statusbar")
1918 return strStatusBar;
1919 else if (strFor == "rpc")
1921 assert(!"GetWarnings() : invalid parameter");
1925 bool CAlert::ProcessAlert()
1927 if (!CheckSignature())
1932 CRITICAL_BLOCK(cs_mapAlerts)
1934 // Cancel previous alerts
1935 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1937 const CAlert& alert = (*mi).second;
1940 printf("cancelling alert %d\n", alert.nID);
1941 mapAlerts.erase(mi++);
1943 else if (!alert.IsInEffect())
1945 printf("expiring alert %d\n", alert.nID);
1946 mapAlerts.erase(mi++);
1952 // Check if this alert has been cancelled
1953 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1955 const CAlert& alert = item.second;
1956 if (alert.Cancels(*this))
1958 printf("alert already cancelled by %d\n", alert.nID);
1964 mapAlerts.insert(make_pair(GetHash(), *this));
1967 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1979 //////////////////////////////////////////////////////////////////////////////
1985 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1989 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1990 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1992 // Don't know what it is, just say we already got one
1999 // The message start string is designed to be unlikely to occur in normal data.
2000 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2001 // a large 4-byte int at any alignment.
2002 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2005 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2007 static map<CService, vector<unsigned char> > mapReuseKey;
2008 RandAddSeedPerfmon();
2010 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2011 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2013 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2015 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2023 if (strCommand == "version")
2025 // Each connection can only send one version message
2026 if (pfrom->nVersion != 0)
2028 pfrom->Misbehaving(1);
2036 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2037 if (pfrom->nVersion == 10300)
2038 pfrom->nVersion = 300;
2039 if (pfrom->nVersion >= 106 && !vRecv.empty())
2040 vRecv >> addrFrom >> nNonce;
2041 if (pfrom->nVersion >= 106 && !vRecv.empty())
2042 vRecv >> pfrom->strSubVer;
2043 if (pfrom->nVersion >= 209 && !vRecv.empty())
2044 vRecv >> pfrom->nStartingHeight;
2046 if (pfrom->nVersion == 0)
2049 // Disconnect if we connected to ourself
2050 if (nNonce == nLocalHostNonce && nNonce > 1)
2052 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2053 pfrom->fDisconnect = true;
2057 // Be shy and don't send version until we hear
2058 if (pfrom->fInbound)
2059 pfrom->PushVersion();
2061 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2063 AddTimeData(pfrom->addr, nTime);
2066 if (pfrom->nVersion >= 209)
2067 pfrom->PushMessage("verack");
2068 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2069 if (pfrom->nVersion < 209)
2070 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2072 if (!pfrom->fInbound)
2074 // Advertise our address
2075 if (addrLocalHost.IsRoutable() && !fUseProxy)
2077 CAddress addr(addrLocalHost);
2078 addr.nTime = GetAdjustedTime();
2079 pfrom->PushAddress(addr);
2082 // Get recent addresses
2083 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2085 pfrom->PushMessage("getaddr");
2086 pfrom->fGetAddr = true;
2090 // Ask the first connected node for block updates
2091 static int nAskedForBlocks = 0;
2092 if (!pfrom->fClient &&
2093 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2094 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2097 pfrom->PushGetBlocks(pindexBest, uint256(0));
2101 CRITICAL_BLOCK(cs_mapAlerts)
2102 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2103 item.second.RelayTo(pfrom);
2105 pfrom->fSuccessfullyConnected = true;
2107 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2109 cPeerBlockCounts.input(pfrom->nStartingHeight);
2113 else if (pfrom->nVersion == 0)
2115 // Must have a version message before anything else
2116 pfrom->Misbehaving(1);
2121 else if (strCommand == "verack")
2123 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2127 else if (strCommand == "addr")
2129 vector<CAddress> vAddr;
2132 // Don't want addr from older versions unless seeding
2133 if (pfrom->nVersion < 209)
2135 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2137 if (vAddr.size() > 1000)
2139 pfrom->Misbehaving(20);
2140 return error("message addr size() = %d", vAddr.size());
2143 // Store the new addresses
2146 int64 nNow = GetAdjustedTime();
2147 int64 nSince = nNow - 10 * 60;
2148 BOOST_FOREACH(CAddress& addr, vAddr)
2152 // ignore IPv6 for now, since it isn't implemented anyway
2155 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2156 addr.nTime = nNow - 5 * 24 * 60 * 60;
2157 AddAddress(addr, 2 * 60 * 60, &addrDB);
2158 pfrom->AddAddressKnown(addr);
2159 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2161 // Relay to a limited number of other nodes
2162 CRITICAL_BLOCK(cs_vNodes)
2164 // Use deterministic randomness to send to the same nodes for 24 hours
2165 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2166 static uint256 hashSalt;
2168 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2169 int64 hashAddr = addr.GetHash();
2170 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2171 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2172 multimap<uint256, CNode*> mapMix;
2173 BOOST_FOREACH(CNode* pnode, vNodes)
2175 if (pnode->nVersion < 31402)
2177 unsigned int nPointer;
2178 memcpy(&nPointer, &pnode, sizeof(nPointer));
2179 uint256 hashKey = hashRand ^ nPointer;
2180 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2181 mapMix.insert(make_pair(hashKey, pnode));
2183 int nRelayNodes = 2;
2184 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2185 ((*mi).second)->PushAddress(addr);
2189 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2190 if (vAddr.size() < 1000)
2191 pfrom->fGetAddr = false;
2195 else if (strCommand == "inv")
2199 if (vInv.size() > 50000)
2201 pfrom->Misbehaving(20);
2202 return error("message inv size() = %d", vInv.size());
2206 BOOST_FOREACH(const CInv& inv, vInv)
2210 pfrom->AddInventoryKnown(inv);
2212 bool fAlreadyHave = AlreadyHave(txdb, inv);
2214 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2218 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2219 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2221 // Track requests for our stuff
2222 Inventory(inv.hash);
2227 else if (strCommand == "getdata")
2231 if (vInv.size() > 50000)
2233 pfrom->Misbehaving(20);
2234 return error("message getdata size() = %d", vInv.size());
2237 BOOST_FOREACH(const CInv& inv, vInv)
2241 printf("received getdata for: %s\n", inv.ToString().c_str());
2243 if (inv.type == MSG_BLOCK)
2245 // Send block from disk
2246 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2247 if (mi != mapBlockIndex.end())
2250 block.ReadFromDisk((*mi).second);
2251 pfrom->PushMessage("block", block);
2253 // Trigger them to send a getblocks request for the next batch of inventory
2254 if (inv.hash == pfrom->hashContinue)
2256 // Bypass PushInventory, this must send even if redundant,
2257 // and we want it right after the last block so they don't
2258 // wait for other stuff first.
2260 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2261 pfrom->PushMessage("inv", vInv);
2262 pfrom->hashContinue = 0;
2266 else if (inv.IsKnownType())
2268 // Send stream from relay memory
2269 CRITICAL_BLOCK(cs_mapRelay)
2271 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2272 if (mi != mapRelay.end())
2273 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2277 // Track requests for our stuff
2278 Inventory(inv.hash);
2283 else if (strCommand == "getblocks")
2285 CBlockLocator locator;
2287 vRecv >> locator >> hashStop;
2289 // Find the last block the caller has in the main chain
2290 CBlockIndex* pindex = locator.GetBlockIndex();
2292 // Send the rest of the chain
2294 pindex = pindex->pnext;
2295 int nLimit = 500 + locator.GetDistanceBack();
2296 unsigned int nBytes = 0;
2297 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2298 for (; pindex; pindex = pindex->pnext)
2300 if (pindex->GetBlockHash() == hashStop)
2302 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2305 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2307 block.ReadFromDisk(pindex, true);
2308 nBytes += block.GetSerializeSize(SER_NETWORK);
2309 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2311 // When this block is requested, we'll send an inv that'll make them
2312 // getblocks the next batch of inventory.
2313 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2314 pfrom->hashContinue = pindex->GetBlockHash();
2321 else if (strCommand == "getheaders")
2323 CBlockLocator locator;
2325 vRecv >> locator >> hashStop;
2327 CBlockIndex* pindex = NULL;
2328 if (locator.IsNull())
2330 // If locator is null, return the hashStop block
2331 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2332 if (mi == mapBlockIndex.end())
2334 pindex = (*mi).second;
2338 // Find the last block the caller has in the main chain
2339 pindex = locator.GetBlockIndex();
2341 pindex = pindex->pnext;
2344 vector<CBlock> vHeaders;
2345 int nLimit = 2000 + locator.GetDistanceBack();
2346 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2347 for (; pindex; pindex = pindex->pnext)
2349 vHeaders.push_back(pindex->GetBlockHeader());
2350 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2353 pfrom->PushMessage("headers", vHeaders);
2357 else if (strCommand == "tx")
2359 vector<uint256> vWorkQueue;
2360 CDataStream vMsg(vRecv);
2364 CInv inv(MSG_TX, tx.GetHash());
2365 pfrom->AddInventoryKnown(inv);
2367 bool fMissingInputs = false;
2368 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2370 SyncWithWallets(tx, NULL, true);
2371 RelayMessage(inv, vMsg);
2372 mapAlreadyAskedFor.erase(inv);
2373 vWorkQueue.push_back(inv.hash);
2375 // Recursively process any orphan transactions that depended on this one
2376 for (int i = 0; i < vWorkQueue.size(); i++)
2378 uint256 hashPrev = vWorkQueue[i];
2379 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2380 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2383 const CDataStream& vMsg = *((*mi).second);
2385 CDataStream(vMsg) >> tx;
2386 CInv inv(MSG_TX, tx.GetHash());
2388 if (tx.AcceptToMemoryPool(true))
2390 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2391 SyncWithWallets(tx, NULL, true);
2392 RelayMessage(inv, vMsg);
2393 mapAlreadyAskedFor.erase(inv);
2394 vWorkQueue.push_back(inv.hash);
2399 BOOST_FOREACH(uint256 hash, vWorkQueue)
2400 EraseOrphanTx(hash);
2402 else if (fMissingInputs)
2404 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2407 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2411 else if (strCommand == "block")
2416 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2419 CInv inv(MSG_BLOCK, block.GetHash());
2420 pfrom->AddInventoryKnown(inv);
2422 if (ProcessBlock(pfrom, &block))
2423 mapAlreadyAskedFor.erase(inv);
2424 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2428 else if (strCommand == "getaddr")
2430 // Nodes rebroadcast an addr every 24 hours
2431 pfrom->vAddrToSend.clear();
2432 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2433 CRITICAL_BLOCK(cs_mapAddresses)
2435 unsigned int nCount = 0;
2436 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2438 const CAddress& addr = item.second;
2439 if (addr.nTime > nSince)
2442 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2444 const CAddress& addr = item.second;
2445 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2446 pfrom->PushAddress(addr);
2452 else if (strCommand == "checkorder")
2457 if (!GetBoolArg("-allowreceivebyip"))
2459 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2466 /// we have a chance to check the order here
2468 // Keep giving the same key to the same ip until they use it
2469 if (!mapReuseKey.count(pfrom->addr))
2470 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2472 // Send back approval of order and pubkey to use
2473 CScript scriptPubKey;
2474 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2475 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2479 else if (strCommand == "reply")
2484 CRequestTracker tracker;
2485 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2487 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2488 if (mi != pfrom->mapRequests.end())
2490 tracker = (*mi).second;
2491 pfrom->mapRequests.erase(mi);
2494 if (!tracker.IsNull())
2495 tracker.fn(tracker.param1, vRecv);
2499 else if (strCommand == "ping")
2504 else if (strCommand == "alert")
2509 if (alert.ProcessAlert())
2512 pfrom->setKnown.insert(alert.GetHash());
2513 CRITICAL_BLOCK(cs_vNodes)
2514 BOOST_FOREACH(CNode* pnode, vNodes)
2515 alert.RelayTo(pnode);
2522 // Ignore unknown commands for extensibility
2526 // Update the last seen time for this node's address
2527 if (pfrom->fNetworkNode)
2528 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2529 AddressCurrentlyConnected(pfrom->addr);
2535 bool ProcessMessages(CNode* pfrom)
2537 CDataStream& vRecv = pfrom->vRecv;
2541 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2545 // (4) message start
2554 // Scan for message start
2555 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2556 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2557 if (vRecv.end() - pstart < nHeaderSize)
2559 if (vRecv.size() > nHeaderSize)
2561 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2562 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2566 if (pstart - vRecv.begin() > 0)
2567 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2568 vRecv.erase(vRecv.begin(), pstart);
2571 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2576 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2579 string strCommand = hdr.GetCommand();
2582 unsigned int nMessageSize = hdr.nMessageSize;
2583 if (nMessageSize > MAX_SIZE)
2585 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2588 if (nMessageSize > vRecv.size())
2590 // Rewind and wait for rest of message
2591 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2596 if (vRecv.GetVersion() >= 209)
2598 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2599 unsigned int nChecksum = 0;
2600 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2601 if (nChecksum != hdr.nChecksum)
2603 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2604 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2609 // Copy message to its own buffer
2610 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2611 vRecv.ignore(nMessageSize);
2617 CRITICAL_BLOCK(cs_main)
2618 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2622 catch (std::ios_base::failure& e)
2624 if (strstr(e.what(), "end of data"))
2626 // Allow exceptions from underlength message on vRecv
2627 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());
2629 else if (strstr(e.what(), "size too large"))
2631 // Allow exceptions from overlong size
2632 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2636 PrintExceptionContinue(&e, "ProcessMessage()");
2639 catch (std::exception& e) {
2640 PrintExceptionContinue(&e, "ProcessMessage()");
2642 PrintExceptionContinue(NULL, "ProcessMessage()");
2646 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2654 bool SendMessages(CNode* pto, bool fSendTrickle)
2656 CRITICAL_BLOCK(cs_main)
2658 // Don't send anything until we get their version message
2659 if (pto->nVersion == 0)
2663 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2664 pto->PushMessage("ping");
2666 // Resend wallet transactions that haven't gotten in a block yet
2667 ResendWalletTransactions();
2669 // Address refresh broadcast
2670 static int64 nLastRebroadcast;
2671 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2673 nLastRebroadcast = GetTime();
2674 CRITICAL_BLOCK(cs_vNodes)
2676 BOOST_FOREACH(CNode* pnode, vNodes)
2678 // Periodically clear setAddrKnown to allow refresh broadcasts
2679 pnode->setAddrKnown.clear();
2681 // Rebroadcast our address
2682 if (addrLocalHost.IsRoutable() && !fUseProxy)
2684 CAddress addr(addrLocalHost);
2685 addr.nTime = GetAdjustedTime();
2686 pnode->PushAddress(addr);
2692 // Clear out old addresses periodically so it's not too much work at once
2693 static int64 nLastClear;
2694 if (nLastClear == 0)
2695 nLastClear = GetTime();
2696 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2698 nLastClear = GetTime();
2699 CRITICAL_BLOCK(cs_mapAddresses)
2702 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2703 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2704 mi != mapAddresses.end();)
2706 const CAddress& addr = (*mi).second;
2707 if (addr.nTime < nSince)
2709 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2711 addrdb.EraseAddress(addr);
2712 mapAddresses.erase(mi++);
2726 vector<CAddress> vAddr;
2727 vAddr.reserve(pto->vAddrToSend.size());
2728 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2730 // returns true if wasn't already contained in the set
2731 if (pto->setAddrKnown.insert(addr).second)
2733 vAddr.push_back(addr);
2734 // receiver rejects addr messages larger than 1000
2735 if (vAddr.size() >= 1000)
2737 pto->PushMessage("addr", vAddr);
2742 pto->vAddrToSend.clear();
2744 pto->PushMessage("addr", vAddr);
2749 // Message: inventory
2752 vector<CInv> vInvWait;
2753 CRITICAL_BLOCK(pto->cs_inventory)
2755 vInv.reserve(pto->vInventoryToSend.size());
2756 vInvWait.reserve(pto->vInventoryToSend.size());
2757 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2759 if (pto->setInventoryKnown.count(inv))
2762 // trickle out tx inv to protect privacy
2763 if (inv.type == MSG_TX && !fSendTrickle)
2765 // 1/4 of tx invs blast to all immediately
2766 static uint256 hashSalt;
2768 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2769 uint256 hashRand = inv.hash ^ hashSalt;
2770 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2771 bool fTrickleWait = ((hashRand & 3) != 0);
2773 // always trickle our own transactions
2777 if (GetTransaction(inv.hash, wtx))
2779 fTrickleWait = true;
2784 vInvWait.push_back(inv);
2789 // returns true if wasn't already contained in the set
2790 if (pto->setInventoryKnown.insert(inv).second)
2792 vInv.push_back(inv);
2793 if (vInv.size() >= 1000)
2795 pto->PushMessage("inv", vInv);
2800 pto->vInventoryToSend = vInvWait;
2803 pto->PushMessage("inv", vInv);
2809 vector<CInv> vGetData;
2810 int64 nNow = GetTime() * 1000000;
2812 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2814 const CInv& inv = (*pto->mapAskFor.begin()).second;
2815 if (!AlreadyHave(txdb, inv))
2817 printf("sending getdata: %s\n", inv.ToString().c_str());
2818 vGetData.push_back(inv);
2819 if (vGetData.size() >= 1000)
2821 pto->PushMessage("getdata", vGetData);
2825 mapAlreadyAskedFor[inv] = nNow;
2826 pto->mapAskFor.erase(pto->mapAskFor.begin());
2828 if (!vGetData.empty())
2829 pto->PushMessage("getdata", vGetData);
2848 //////////////////////////////////////////////////////////////////////////////
2853 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2855 unsigned char* pdata = (unsigned char*)pbuffer;
2856 unsigned int blocks = 1 + ((len + 8) / 64);
2857 unsigned char* pend = pdata + 64 * blocks;
2858 memset(pdata + len, 0, 64 * blocks - len);
2860 unsigned int bits = len * 8;
2861 pend[-1] = (bits >> 0) & 0xff;
2862 pend[-2] = (bits >> 8) & 0xff;
2863 pend[-3] = (bits >> 16) & 0xff;
2864 pend[-4] = (bits >> 24) & 0xff;
2868 static const unsigned int pSHA256InitState[8] =
2869 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2871 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2874 unsigned char data[64];
2878 for (int i = 0; i < 16; i++)
2879 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2881 for (int i = 0; i < 8; i++)
2882 ctx.h[i] = ((uint32_t*)pinit)[i];
2884 SHA256_Update(&ctx, data, sizeof(data));
2885 for (int i = 0; i < 8; i++)
2886 ((uint32_t*)pstate)[i] = ctx.h[i];
2890 // ScanHash scans nonces looking for a hash with at least some zero bits.
2891 // It operates on big endian data. Caller does the byte reversing.
2892 // All input buffers are 16-byte aligned. nNonce is usually preserved
2893 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2894 // the block is rebuilt and nNonce starts over at zero.
2896 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2898 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2902 // Hash pdata using pmidstate as the starting state into
2903 // preformatted buffer phash1, then hash phash1 into phash
2905 SHA256Transform(phash1, pdata, pmidstate);
2906 SHA256Transform(phash, phash1, pSHA256InitState);
2908 // Return the nonce if the hash has at least some zero bits,
2909 // caller will check if it has enough to reach the target
2910 if (((unsigned short*)phash)[14] == 0)
2913 // If nothing found after trying for a while, return -1
2914 if ((nNonce & 0xffff) == 0)
2916 nHashesDone = 0xffff+1;
2922 // Some explaining would be appreciated
2927 set<uint256> setDependsOn;
2930 COrphan(CTransaction* ptxIn)
2938 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2939 BOOST_FOREACH(uint256 hash, setDependsOn)
2940 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2945 uint64 nLastBlockTx = 0;
2946 uint64 nLastBlockSize = 0;
2948 CBlock* CreateNewBlock(CReserveKey& reservekey)
2950 CBlockIndex* pindexPrev = pindexBest;
2953 auto_ptr<CBlock> pblock(new CBlock());
2957 // Create coinbase tx
2959 txNew.vin.resize(1);
2960 txNew.vin[0].prevout.SetNull();
2961 txNew.vout.resize(1);
2962 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2964 // Add our coinbase tx as first transaction
2965 pblock->vtx.push_back(txNew);
2967 // Collect memory pool transactions into the block
2969 CRITICAL_BLOCK(cs_main)
2970 CRITICAL_BLOCK(cs_mapTransactions)
2974 // Priority order to process transactions
2975 list<COrphan> vOrphan; // list memory doesn't move
2976 map<uint256, vector<COrphan*> > mapDependers;
2977 multimap<double, CTransaction*> mapPriority;
2978 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2980 CTransaction& tx = (*mi).second;
2981 if (tx.IsCoinBase() || !tx.IsFinal())
2984 COrphan* porphan = NULL;
2985 double dPriority = 0;
2986 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2988 // Read prev transaction
2989 CTransaction txPrev;
2991 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2993 // Has to wait for dependencies
2996 // Use list for automatic deletion
2997 vOrphan.push_back(COrphan(&tx));
2998 porphan = &vOrphan.back();
3000 mapDependers[txin.prevout.hash].push_back(porphan);
3001 porphan->setDependsOn.insert(txin.prevout.hash);
3004 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3006 // Read block header
3007 int nConf = txindex.GetDepthInMainChain();
3009 dPriority += (double)nValueIn * nConf;
3011 if (fDebug && GetBoolArg("-printpriority"))
3012 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3015 // Priority is sum(valuein * age) / txsize
3016 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3019 porphan->dPriority = dPriority;
3021 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3023 if (fDebug && GetBoolArg("-printpriority"))
3025 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3032 // Collect transactions into block
3033 map<uint256, CTxIndex> mapTestPool;
3034 uint64 nBlockSize = 1000;
3035 uint64 nBlockTx = 0;
3036 int nBlockSigOps1 = 100; // pre-0.6 count of sigOps
3037 int nBlockSigOps2 = 100; // post-0.6 count of sigOps
3038 while (!mapPriority.empty())
3040 // Take highest priority transaction off priority queue
3041 double dPriority = -(*mapPriority.begin()).first;
3042 CTransaction& tx = *(*mapPriority.begin()).second;
3043 mapPriority.erase(mapPriority.begin());
3046 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3047 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3050 // Legacy limits on sigOps:
3051 int nTxSigOps1 = tx.GetLegacySigOpCount();
3052 if (nBlockSigOps1 + nTxSigOps1 >= MAX_BLOCK_SIGOPS)
3055 // Transaction fee required depends on block size
3056 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3057 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3059 // Connecting shouldn't fail due to dependency on other memory pool transactions
3060 // because we're already processing them in order of dependency
3061 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3062 MapPrevTx mapInputs;
3063 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs))
3066 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3067 if (nFees < nMinFee)
3070 int nTxSigOps2 = tx.GetSigOpCount(mapInputs);
3071 if (nBlockSigOps2 + nTxSigOps2 >= MAX_BLOCK_SIGOPS)
3074 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3076 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3077 swap(mapTestPool, mapTestPoolTmp);
3080 pblock->vtx.push_back(tx);
3081 nBlockSize += nTxSize;
3083 nBlockSigOps1 += nTxSigOps1;
3084 nBlockSigOps2 += nTxSigOps2;
3086 // Add transactions that depend on this one to the priority queue
3087 uint256 hash = tx.GetHash();
3088 if (mapDependers.count(hash))
3090 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3092 if (!porphan->setDependsOn.empty())
3094 porphan->setDependsOn.erase(hash);
3095 if (porphan->setDependsOn.empty())
3096 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3102 nLastBlockTx = nBlockTx;
3103 nLastBlockSize = nBlockSize;
3104 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3107 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3110 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3111 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3112 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3113 pblock->nBits = GetNextWorkRequired(pindexPrev);
3116 return pblock.release();
3120 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3122 // Update nExtraNonce
3123 static uint256 hashPrevBlock;
3124 if (hashPrevBlock != pblock->hashPrevBlock)
3127 hashPrevBlock = pblock->hashPrevBlock;
3130 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3131 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3133 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3137 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3140 // Prebuild hash buffers
3147 uint256 hashPrevBlock;
3148 uint256 hashMerkleRoot;
3151 unsigned int nNonce;
3154 unsigned char pchPadding0[64];
3156 unsigned char pchPadding1[64];
3159 memset(&tmp, 0, sizeof(tmp));
3161 tmp.block.nVersion = pblock->nVersion;
3162 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3163 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3164 tmp.block.nTime = pblock->nTime;
3165 tmp.block.nBits = pblock->nBits;
3166 tmp.block.nNonce = pblock->nNonce;
3168 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3169 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3171 // Byte swap all the input buffer
3172 for (int i = 0; i < sizeof(tmp)/4; i++)
3173 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3175 // Precalc the first half of the first hash, which stays constant
3176 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3178 memcpy(pdata, &tmp.block, 128);
3179 memcpy(phash1, &tmp.hash1, 64);
3183 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3185 uint256 hash = pblock->GetHash();
3186 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3188 if (hash > hashTarget)
3192 printf("BitcoinMiner:\n");
3193 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3195 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3196 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3199 CRITICAL_BLOCK(cs_main)
3201 if (pblock->hashPrevBlock != hashBestChain)
3202 return error("BitcoinMiner : generated block is stale");
3204 // Remove key from key pool
3205 reservekey.KeepKey();
3207 // Track how many getdata requests this block gets
3208 CRITICAL_BLOCK(wallet.cs_wallet)
3209 wallet.mapRequestCount[pblock->GetHash()] = 0;
3211 // Process this block the same as if we had received it from another node
3212 if (!ProcessBlock(NULL, pblock))
3213 return error("BitcoinMiner : ProcessBlock, block not accepted");
3219 void static ThreadBitcoinMiner(void* parg);
3221 void static BitcoinMiner(CWallet *pwallet)
3223 printf("BitcoinMiner started\n");
3224 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3226 // Each thread has its own key and counter
3227 CReserveKey reservekey(pwallet);
3228 unsigned int nExtraNonce = 0;
3230 while (fGenerateBitcoins)
3232 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3236 while (vNodes.empty() || IsInitialBlockDownload())
3241 if (!fGenerateBitcoins)
3249 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3250 CBlockIndex* pindexPrev = pindexBest;
3252 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3255 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3257 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3261 // Prebuild hash buffers
3263 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3264 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3265 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3267 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3269 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3270 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3276 int64 nStart = GetTime();
3277 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3279 uint256& hash = *alignup<16>(hashbuf);
3282 unsigned int nHashesDone = 0;
3283 unsigned int nNonceFound;
3286 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3287 (char*)&hash, nHashesDone);
3289 // Check if something found
3290 if (nNonceFound != -1)
3292 for (int i = 0; i < sizeof(hash)/4; i++)
3293 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3295 if (hash <= hashTarget)
3298 pblock->nNonce = ByteReverse(nNonceFound);
3299 assert(hash == pblock->GetHash());
3301 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3302 CheckWork(pblock.get(), *pwalletMain, reservekey);
3303 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3309 static int64 nHashCounter;
3310 if (nHPSTimerStart == 0)
3312 nHPSTimerStart = GetTimeMillis();
3316 nHashCounter += nHashesDone;
3317 if (GetTimeMillis() - nHPSTimerStart > 4000)
3319 static CCriticalSection cs;
3322 if (GetTimeMillis() - nHPSTimerStart > 4000)
3324 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3325 nHPSTimerStart = GetTimeMillis();
3327 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3328 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3329 static int64 nLogTime;
3330 if (GetTime() - nLogTime > 30 * 60)
3332 nLogTime = GetTime();
3333 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3334 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3340 // Check for stop or if block needs to be rebuilt
3343 if (!fGenerateBitcoins)
3345 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3349 if (nBlockNonce >= 0xffff0000)
3351 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3353 if (pindexPrev != pindexBest)
3356 // Update nTime every few seconds
3357 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3358 nBlockTime = ByteReverse(pblock->nTime);
3363 void static ThreadBitcoinMiner(void* parg)
3365 CWallet* pwallet = (CWallet*)parg;
3368 vnThreadsRunning[3]++;
3369 BitcoinMiner(pwallet);
3370 vnThreadsRunning[3]--;
3372 catch (std::exception& e) {
3373 vnThreadsRunning[3]--;
3374 PrintException(&e, "ThreadBitcoinMiner()");
3376 vnThreadsRunning[3]--;
3377 PrintException(NULL, "ThreadBitcoinMiner()");
3379 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3381 if (vnThreadsRunning[3] == 0)
3383 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3387 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3389 if (fGenerateBitcoins != fGenerate)
3391 fGenerateBitcoins = fGenerate;
3392 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3395 if (fGenerateBitcoins)
3397 int nProcessors = boost::thread::hardware_concurrency();
3398 printf("%d processors\n", nProcessors);
3399 if (nProcessors < 1)
3401 if (fLimitProcessors && nProcessors > nLimitProcessors)
3402 nProcessors = nLimitProcessors;
3403 int nAddThreads = nProcessors - vnThreadsRunning[3];
3404 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3405 for (int i = 0; i < nAddThreads; i++)
3407 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3408 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");