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; // Allow non-standard on testnet
284 return true; // Coinbases are allowed to have any input
286 for (int i = 0; i < vin.size(); i++)
288 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
290 vector<vector<unsigned char> > vSolutions;
291 txnouttype whichType;
292 // get the scriptPubKey corresponding to this input:
293 const CScript& prevScript = prev.scriptPubKey;
294 if (!Solver(prevScript, whichType, vSolutions))
296 if (whichType == TX_SCRIPTHASH)
298 vector<vector<unsigned char> > stack;
300 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
304 CScript subscript(stack.back().begin(), stack.back().end());
305 if (!::IsStandard(subscript))
314 CTransaction::GetLegacySigOpCount() const
317 BOOST_FOREACH(const CTxIn& txin, vin)
319 nSigOps += txin.scriptSig.GetSigOpCount(false);
321 BOOST_FOREACH(const CTxOut& txout, vout)
323 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
329 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
341 // Load the block this tx is in
343 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
345 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
350 // Update the tx's hashBlock
351 hashBlock = pblock->GetHash();
353 // Locate the transaction
354 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
355 if (pblock->vtx[nIndex] == *(CTransaction*)this)
357 if (nIndex == pblock->vtx.size())
359 vMerkleBranch.clear();
361 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
365 // Fill in merkle branch
366 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
369 // Is the tx in a block that's in the main chain
370 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
371 if (mi == mapBlockIndex.end())
373 CBlockIndex* pindex = (*mi).second;
374 if (!pindex || !pindex->IsInMainChain())
377 return pindexBest->nHeight - pindex->nHeight + 1;
386 bool CTransaction::CheckTransaction() const
388 // Basic checks that don't depend on any context
390 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
392 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
394 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
395 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
397 // Check for negative or overflow output values
399 BOOST_FOREACH(const CTxOut& txout, vout)
401 if (txout.nValue < 0)
402 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
403 if (txout.nValue > MAX_MONEY)
404 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
405 nValueOut += txout.nValue;
406 if (!MoneyRange(nValueOut))
407 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
410 // Check for duplicate inputs
411 set<COutPoint> vInOutPoints;
412 BOOST_FOREACH(const CTxIn& txin, vin)
414 if (vInOutPoints.count(txin.prevout))
416 vInOutPoints.insert(txin.prevout);
421 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
422 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
426 BOOST_FOREACH(const CTxIn& txin, vin)
427 if (txin.prevout.IsNull())
428 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
434 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
437 *pfMissingInputs = false;
439 if (!CheckTransaction())
440 return error("AcceptToMemoryPool() : CheckTransaction failed");
442 // Coinbase is only valid in a block, not as a loose transaction
444 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
446 // To help v0.1.5 clients who would see it as a negative number
447 if ((int64)nLockTime > std::numeric_limits<int>::max())
448 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
450 // Rather not work on nonstandard transactions (unless -testnet)
451 if (!fTestNet && !IsStandard())
452 return error("AcceptToMemoryPool() : nonstandard transaction type");
454 // Do we already have it?
455 uint256 hash = GetHash();
456 CRITICAL_BLOCK(cs_mapTransactions)
457 if (mapTransactions.count(hash))
460 if (txdb.ContainsTx(hash))
463 // Check for conflicts with in-memory transactions
464 CTransaction* ptxOld = NULL;
465 for (int i = 0; i < vin.size(); i++)
467 COutPoint outpoint = vin[i].prevout;
468 if (mapNextTx.count(outpoint))
470 // Disable replacement feature for now
473 // Allow replacing with a newer version of the same transaction
476 ptxOld = mapNextTx[outpoint].ptx;
477 if (ptxOld->IsFinal())
479 if (!IsNewerThan(*ptxOld))
481 for (int i = 0; i < vin.size(); i++)
483 COutPoint outpoint = vin[i].prevout;
484 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
494 map<uint256, CTxIndex> mapUnused;
495 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs))
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))
504 return error("AcceptToMemoryPool() : nonstandard transaction input");
506 // Note: if you modify this code to accept non-standard transactions, then
507 // you should add code here to check that the transaction does a
508 // reasonable number of ECDSA signature verifications.
510 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
511 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
513 // Don't accept it if it can't get into a block
514 if (nFees < GetMinFee(1000, true, GMF_RELAY))
515 return error("AcceptToMemoryPool() : not enough fees");
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::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1019 for (int i = 0; i < vin.size(); i++)
1021 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1022 if (prevout.scriptPubKey.IsPayToScriptHash())
1023 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1028 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1029 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1030 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1032 // Take over previous transactions' spent pointers
1033 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1034 // fMiner is true when called from the internal bitcoin miner
1035 // ... both are false when called from CTransaction::AcceptToMemoryPool
1040 for (int i = 0; i < vin.size(); i++)
1042 COutPoint prevout = vin[i].prevout;
1043 assert(inputs.count(prevout.hash) > 0);
1044 CTxIndex& txindex = inputs[prevout.hash].first;
1045 CTransaction& txPrev = inputs[prevout.hash].second;
1047 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1048 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()));
1050 // If prev is coinbase, check that it's matured
1051 if (txPrev.IsCoinBase())
1052 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1053 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1054 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1056 // Check for conflicts (double-spend)
1057 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1058 // for an attacker to attempt to split the network.
1059 if (!txindex.vSpent[prevout.n].IsNull())
1060 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());
1062 // Check for negative or overflow input values
1063 nValueIn += txPrev.vout[prevout.n].nValue;
1064 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1065 return DoS(100, error("ConnectInputs() : txin values out of range"));
1067 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1068 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1069 // still computed and checked, and any change will be caught at the next checkpoint.
1070 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1073 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1074 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1077 // Mark outpoints as spent
1078 txindex.vSpent[prevout.n] = posThisTx;
1081 if (fBlock || fMiner)
1083 mapTestPool[prevout.hash] = txindex;
1087 if (nValueIn < GetValueOut())
1088 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1090 // Tally transaction fees
1091 int64 nTxFee = nValueIn - GetValueOut();
1093 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1095 if (!MoneyRange(nFees))
1096 return DoS(100, error("ConnectInputs() : nFees out of range"));
1103 bool CTransaction::ClientConnectInputs()
1108 // Take over previous transactions' spent pointers
1109 CRITICAL_BLOCK(cs_mapTransactions)
1112 for (int i = 0; i < vin.size(); i++)
1114 // Get prev tx from single transactions in memory
1115 COutPoint prevout = vin[i].prevout;
1116 if (!mapTransactions.count(prevout.hash))
1118 CTransaction& txPrev = mapTransactions[prevout.hash];
1120 if (prevout.n >= txPrev.vout.size())
1124 if (!VerifySignature(txPrev, *this, i, true, 0))
1125 return error("ConnectInputs() : VerifySignature failed");
1127 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1128 ///// this has to go away now that posNext is gone
1129 // // Check for conflicts
1130 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1131 // return error("ConnectInputs() : prev tx already used");
1133 // // Flag outpoints as used
1134 // txPrev.vout[prevout.n].posNext = posThisTx;
1136 nValueIn += txPrev.vout[prevout.n].nValue;
1138 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1139 return error("ClientConnectInputs() : txin values out of range");
1141 if (GetValueOut() > nValueIn)
1151 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1153 // Disconnect in reverse order
1154 for (int i = vtx.size()-1; i >= 0; i--)
1155 if (!vtx[i].DisconnectInputs(txdb))
1158 // Update block index on disk without changing it in memory.
1159 // The memory index structure will be changed after the db commits.
1162 CDiskBlockIndex blockindexPrev(pindex->pprev);
1163 blockindexPrev.hashNext = 0;
1164 if (!txdb.WriteBlockIndex(blockindexPrev))
1165 return error("DisconnectBlock() : WriteBlockIndex failed");
1171 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1173 // Check it again in case a previous version let a bad block in
1177 // To avoid being on the short end of a block-chain split,
1178 // don't do secondary validation of pay-to-script-hash transactions
1179 // until blocks with timestamps after paytoscripthashtime:
1180 int64 nEvalSwitchTime = GetArg("-paytoscripthashtime", 1329264000); // Feb 15, 2012
1181 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1183 //// issue here: it doesn't know the version
1184 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1186 map<uint256, CTxIndex> mapQueuedChanges;
1189 BOOST_FOREACH(CTransaction& tx, vtx)
1191 nSigOps += tx.GetLegacySigOpCount();
1192 if (nSigOps > MAX_BLOCK_SIGOPS)
1193 return DoS(100, error("ConnectBlock() : too many sigops"));
1195 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1196 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1198 MapPrevTx mapInputs;
1199 if (!tx.IsCoinBase())
1201 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs))
1204 if (fStrictPayToScriptHash)
1206 // Add in sigops done by pay-to-script-hash inputs;
1207 // this is to prevent a "rogue miner" from creating
1208 // an incredibly-expensive-to-validate block.
1209 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1210 if (nSigOps > MAX_BLOCK_SIGOPS)
1211 return DoS(100, error("ConnectBlock() : too many sigops"));
1214 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1216 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
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"));
1501 BOOST_FOREACH(const CTransaction& tx, vtx)
1503 nSigOps += tx.GetLegacySigOpCount();
1505 if (nSigOps > MAX_BLOCK_SIGOPS)
1506 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1509 if (hashMerkleRoot != BuildMerkleTree())
1510 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1515 bool CBlock::AcceptBlock()
1517 // Check for duplicate
1518 uint256 hash = GetHash();
1519 if (mapBlockIndex.count(hash))
1520 return error("AcceptBlock() : block already in mapBlockIndex");
1522 // Get prev block index
1523 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1524 if (mi == mapBlockIndex.end())
1525 return DoS(10, error("AcceptBlock() : prev block not found"));
1526 CBlockIndex* pindexPrev = (*mi).second;
1527 int nHeight = pindexPrev->nHeight+1;
1529 // Check proof of work
1530 if (nBits != GetNextWorkRequired(pindexPrev))
1531 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1533 // Check timestamp against prev
1534 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1535 return error("AcceptBlock() : block's timestamp is too early");
1537 // Check that all transactions are finalized
1538 BOOST_FOREACH(const CTransaction& tx, vtx)
1539 if (!tx.IsFinal(nHeight, GetBlockTime()))
1540 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1542 // Check that the block chain matches the known block chain up to a checkpoint
1543 if (!Checkpoints::CheckBlock(nHeight, hash))
1544 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1546 // Write block to history file
1547 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1548 return error("AcceptBlock() : out of disk space");
1549 unsigned int nFile = -1;
1550 unsigned int nBlockPos = 0;
1551 if (!WriteToDisk(nFile, nBlockPos))
1552 return error("AcceptBlock() : WriteToDisk failed");
1553 if (!AddToBlockIndex(nFile, nBlockPos))
1554 return error("AcceptBlock() : AddToBlockIndex failed");
1556 // Relay inventory, but don't relay old inventory during initial block download
1557 if (hashBestChain == hash)
1558 CRITICAL_BLOCK(cs_vNodes)
1559 BOOST_FOREACH(CNode* pnode, vNodes)
1560 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1561 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1566 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1568 // Check for duplicate
1569 uint256 hash = pblock->GetHash();
1570 if (mapBlockIndex.count(hash))
1571 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1572 if (mapOrphanBlocks.count(hash))
1573 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1575 // Preliminary checks
1576 if (!pblock->CheckBlock())
1577 return error("ProcessBlock() : CheckBlock FAILED");
1579 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1580 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1582 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1583 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1586 pfrom->Misbehaving(100);
1587 return error("ProcessBlock() : block with timestamp before last checkpoint");
1590 bnNewBlock.SetCompact(pblock->nBits);
1592 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1593 if (bnNewBlock > bnRequired)
1595 pfrom->Misbehaving(100);
1596 return error("ProcessBlock() : block with too little proof-of-work");
1601 // If don't already have its previous block, shunt it off to holding area until we get it
1602 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1604 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1605 CBlock* pblock2 = new CBlock(*pblock);
1606 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1607 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1609 // Ask this guy to fill in what we're missing
1611 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1616 if (!pblock->AcceptBlock())
1617 return error("ProcessBlock() : AcceptBlock FAILED");
1619 // Recursively process any orphan blocks that depended on this one
1620 vector<uint256> vWorkQueue;
1621 vWorkQueue.push_back(hash);
1622 for (int i = 0; i < vWorkQueue.size(); i++)
1624 uint256 hashPrev = vWorkQueue[i];
1625 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1626 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1629 CBlock* pblockOrphan = (*mi).second;
1630 if (pblockOrphan->AcceptBlock())
1631 vWorkQueue.push_back(pblockOrphan->GetHash());
1632 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1633 delete pblockOrphan;
1635 mapOrphanBlocksByPrev.erase(hashPrev);
1638 printf("ProcessBlock: ACCEPTED\n");
1649 bool CheckDiskSpace(uint64 nAdditionalBytes)
1651 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1653 // Check for 15MB because database could create another 10MB log file at any time
1654 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1657 string strMessage = _("Warning: Disk space is low ");
1658 strMiscWarning = strMessage;
1659 printf("*** %s\n", strMessage.c_str());
1660 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1661 CreateThread(Shutdown, NULL);
1667 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1671 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1674 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1676 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1685 static unsigned int nCurrentBlockFile = 1;
1687 FILE* AppendBlockFile(unsigned int& nFileRet)
1692 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1695 if (fseek(file, 0, SEEK_END) != 0)
1697 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1698 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1700 nFileRet = nCurrentBlockFile;
1704 nCurrentBlockFile++;
1708 bool LoadBlockIndex(bool fAllowNew)
1712 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1713 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1714 pchMessageStart[0] = 0xfa;
1715 pchMessageStart[1] = 0xbf;
1716 pchMessageStart[2] = 0xb5;
1717 pchMessageStart[3] = 0xda;
1724 if (!txdb.LoadBlockIndex())
1729 // Init with genesis block
1731 if (mapBlockIndex.empty())
1737 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1738 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1739 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1740 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1741 // vMerkleTree: 4a5e1e
1744 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1746 txNew.vin.resize(1);
1747 txNew.vout.resize(1);
1748 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1749 txNew.vout[0].nValue = 50 * COIN;
1750 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1752 block.vtx.push_back(txNew);
1753 block.hashPrevBlock = 0;
1754 block.hashMerkleRoot = block.BuildMerkleTree();
1756 block.nTime = 1231006505;
1757 block.nBits = 0x1d00ffff;
1758 block.nNonce = 2083236893;
1762 block.nTime = 1296688602;
1763 block.nBits = 0x1d07fff8;
1764 block.nNonce = 384568319;
1768 printf("%s\n", block.GetHash().ToString().c_str());
1769 printf("%s\n", hashGenesisBlock.ToString().c_str());
1770 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1771 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1773 assert(block.GetHash() == hashGenesisBlock);
1775 // Start new block file
1777 unsigned int nBlockPos;
1778 if (!block.WriteToDisk(nFile, nBlockPos))
1779 return error("LoadBlockIndex() : writing genesis block to disk failed");
1780 if (!block.AddToBlockIndex(nFile, nBlockPos))
1781 return error("LoadBlockIndex() : genesis block not accepted");
1789 void PrintBlockTree()
1791 // precompute tree structure
1792 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1793 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1795 CBlockIndex* pindex = (*mi).second;
1796 mapNext[pindex->pprev].push_back(pindex);
1798 //while (rand() % 3 == 0)
1799 // mapNext[pindex->pprev].push_back(pindex);
1802 vector<pair<int, CBlockIndex*> > vStack;
1803 vStack.push_back(make_pair(0, pindexGenesisBlock));
1806 while (!vStack.empty())
1808 int nCol = vStack.back().first;
1809 CBlockIndex* pindex = vStack.back().second;
1812 // print split or gap
1813 if (nCol > nPrevCol)
1815 for (int i = 0; i < nCol-1; i++)
1819 else if (nCol < nPrevCol)
1821 for (int i = 0; i < nCol; i++)
1828 for (int i = 0; i < nCol; i++)
1833 block.ReadFromDisk(pindex);
1834 printf("%d (%u,%u) %s %s tx %d",
1838 block.GetHash().ToString().substr(0,20).c_str(),
1839 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1842 PrintWallets(block);
1844 // put the main timechain first
1845 vector<CBlockIndex*>& vNext = mapNext[pindex];
1846 for (int i = 0; i < vNext.size(); i++)
1848 if (vNext[i]->pnext)
1850 swap(vNext[0], vNext[i]);
1856 for (int i = 0; i < vNext.size(); i++)
1857 vStack.push_back(make_pair(nCol+i, vNext[i]));
1870 //////////////////////////////////////////////////////////////////////////////
1875 map<uint256, CAlert> mapAlerts;
1876 CCriticalSection cs_mapAlerts;
1878 string GetWarnings(string strFor)
1881 string strStatusBar;
1883 if (GetBoolArg("-testsafemode"))
1886 // Misc warnings like out of disk space and clock is wrong
1887 if (strMiscWarning != "")
1890 strStatusBar = strMiscWarning;
1893 // Longer invalid proof-of-work chain
1894 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1897 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1901 CRITICAL_BLOCK(cs_mapAlerts)
1903 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1905 const CAlert& alert = item.second;
1906 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1908 nPriority = alert.nPriority;
1909 strStatusBar = alert.strStatusBar;
1914 if (strFor == "statusbar")
1915 return strStatusBar;
1916 else if (strFor == "rpc")
1918 assert(!"GetWarnings() : invalid parameter");
1922 bool CAlert::ProcessAlert()
1924 if (!CheckSignature())
1929 CRITICAL_BLOCK(cs_mapAlerts)
1931 // Cancel previous alerts
1932 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1934 const CAlert& alert = (*mi).second;
1937 printf("cancelling alert %d\n", alert.nID);
1938 mapAlerts.erase(mi++);
1940 else if (!alert.IsInEffect())
1942 printf("expiring alert %d\n", alert.nID);
1943 mapAlerts.erase(mi++);
1949 // Check if this alert has been cancelled
1950 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1952 const CAlert& alert = item.second;
1953 if (alert.Cancels(*this))
1955 printf("alert already cancelled by %d\n", alert.nID);
1961 mapAlerts.insert(make_pair(GetHash(), *this));
1964 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1976 //////////////////////////////////////////////////////////////////////////////
1982 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1986 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1987 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1989 // Don't know what it is, just say we already got one
1996 // The message start string is designed to be unlikely to occur in normal data.
1997 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1998 // a large 4-byte int at any alignment.
1999 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2002 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2004 static map<CService, vector<unsigned char> > mapReuseKey;
2005 RandAddSeedPerfmon();
2007 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2008 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2010 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2012 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2020 if (strCommand == "version")
2022 // Each connection can only send one version message
2023 if (pfrom->nVersion != 0)
2025 pfrom->Misbehaving(1);
2033 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2034 if (pfrom->nVersion == 10300)
2035 pfrom->nVersion = 300;
2036 if (pfrom->nVersion >= 106 && !vRecv.empty())
2037 vRecv >> addrFrom >> nNonce;
2038 if (pfrom->nVersion >= 106 && !vRecv.empty())
2039 vRecv >> pfrom->strSubVer;
2040 if (pfrom->nVersion >= 209 && !vRecv.empty())
2041 vRecv >> pfrom->nStartingHeight;
2043 if (pfrom->nVersion == 0)
2046 // Disconnect if we connected to ourself
2047 if (nNonce == nLocalHostNonce && nNonce > 1)
2049 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2050 pfrom->fDisconnect = true;
2054 // Be shy and don't send version until we hear
2055 if (pfrom->fInbound)
2056 pfrom->PushVersion();
2058 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2060 AddTimeData(pfrom->addr, nTime);
2063 if (pfrom->nVersion >= 209)
2064 pfrom->PushMessage("verack");
2065 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2066 if (pfrom->nVersion < 209)
2067 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2069 if (!pfrom->fInbound)
2071 // Advertise our address
2072 if (addrLocalHost.IsRoutable() && !fUseProxy)
2074 CAddress addr(addrLocalHost);
2075 addr.nTime = GetAdjustedTime();
2076 pfrom->PushAddress(addr);
2079 // Get recent addresses
2080 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2082 pfrom->PushMessage("getaddr");
2083 pfrom->fGetAddr = true;
2087 // Ask the first connected node for block updates
2088 static int nAskedForBlocks = 0;
2089 if (!pfrom->fClient &&
2090 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2091 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2094 pfrom->PushGetBlocks(pindexBest, uint256(0));
2098 CRITICAL_BLOCK(cs_mapAlerts)
2099 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2100 item.second.RelayTo(pfrom);
2102 pfrom->fSuccessfullyConnected = true;
2104 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2106 cPeerBlockCounts.input(pfrom->nStartingHeight);
2110 else if (pfrom->nVersion == 0)
2112 // Must have a version message before anything else
2113 pfrom->Misbehaving(1);
2118 else if (strCommand == "verack")
2120 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2124 else if (strCommand == "addr")
2126 vector<CAddress> vAddr;
2129 // Don't want addr from older versions unless seeding
2130 if (pfrom->nVersion < 209)
2132 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2134 if (vAddr.size() > 1000)
2136 pfrom->Misbehaving(20);
2137 return error("message addr size() = %d", vAddr.size());
2140 // Store the new addresses
2143 int64 nNow = GetAdjustedTime();
2144 int64 nSince = nNow - 10 * 60;
2145 BOOST_FOREACH(CAddress& addr, vAddr)
2149 // ignore IPv6 for now, since it isn't implemented anyway
2152 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2153 addr.nTime = nNow - 5 * 24 * 60 * 60;
2154 AddAddress(addr, 2 * 60 * 60, &addrDB);
2155 pfrom->AddAddressKnown(addr);
2156 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2158 // Relay to a limited number of other nodes
2159 CRITICAL_BLOCK(cs_vNodes)
2161 // Use deterministic randomness to send to the same nodes for 24 hours
2162 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2163 static uint256 hashSalt;
2165 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2166 int64 hashAddr = addr.GetHash();
2167 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2168 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2169 multimap<uint256, CNode*> mapMix;
2170 BOOST_FOREACH(CNode* pnode, vNodes)
2172 if (pnode->nVersion < 31402)
2174 unsigned int nPointer;
2175 memcpy(&nPointer, &pnode, sizeof(nPointer));
2176 uint256 hashKey = hashRand ^ nPointer;
2177 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2178 mapMix.insert(make_pair(hashKey, pnode));
2180 int nRelayNodes = 2;
2181 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2182 ((*mi).second)->PushAddress(addr);
2186 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2187 if (vAddr.size() < 1000)
2188 pfrom->fGetAddr = false;
2192 else if (strCommand == "inv")
2196 if (vInv.size() > 50000)
2198 pfrom->Misbehaving(20);
2199 return error("message inv size() = %d", vInv.size());
2203 BOOST_FOREACH(const CInv& inv, vInv)
2207 pfrom->AddInventoryKnown(inv);
2209 bool fAlreadyHave = AlreadyHave(txdb, inv);
2211 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2215 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2216 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2218 // Track requests for our stuff
2219 Inventory(inv.hash);
2224 else if (strCommand == "getdata")
2228 if (vInv.size() > 50000)
2230 pfrom->Misbehaving(20);
2231 return error("message getdata size() = %d", vInv.size());
2234 BOOST_FOREACH(const CInv& inv, vInv)
2238 printf("received getdata for: %s\n", inv.ToString().c_str());
2240 if (inv.type == MSG_BLOCK)
2242 // Send block from disk
2243 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2244 if (mi != mapBlockIndex.end())
2247 block.ReadFromDisk((*mi).second);
2248 pfrom->PushMessage("block", block);
2250 // Trigger them to send a getblocks request for the next batch of inventory
2251 if (inv.hash == pfrom->hashContinue)
2253 // Bypass PushInventory, this must send even if redundant,
2254 // and we want it right after the last block so they don't
2255 // wait for other stuff first.
2257 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2258 pfrom->PushMessage("inv", vInv);
2259 pfrom->hashContinue = 0;
2263 else if (inv.IsKnownType())
2265 // Send stream from relay memory
2266 CRITICAL_BLOCK(cs_mapRelay)
2268 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2269 if (mi != mapRelay.end())
2270 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2274 // Track requests for our stuff
2275 Inventory(inv.hash);
2280 else if (strCommand == "getblocks")
2282 CBlockLocator locator;
2284 vRecv >> locator >> hashStop;
2286 // Find the last block the caller has in the main chain
2287 CBlockIndex* pindex = locator.GetBlockIndex();
2289 // Send the rest of the chain
2291 pindex = pindex->pnext;
2292 int nLimit = 500 + locator.GetDistanceBack();
2293 unsigned int nBytes = 0;
2294 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2295 for (; pindex; pindex = pindex->pnext)
2297 if (pindex->GetBlockHash() == hashStop)
2299 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2302 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2304 block.ReadFromDisk(pindex, true);
2305 nBytes += block.GetSerializeSize(SER_NETWORK);
2306 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2308 // When this block is requested, we'll send an inv that'll make them
2309 // getblocks the next batch of inventory.
2310 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2311 pfrom->hashContinue = pindex->GetBlockHash();
2318 else if (strCommand == "getheaders")
2320 CBlockLocator locator;
2322 vRecv >> locator >> hashStop;
2324 CBlockIndex* pindex = NULL;
2325 if (locator.IsNull())
2327 // If locator is null, return the hashStop block
2328 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2329 if (mi == mapBlockIndex.end())
2331 pindex = (*mi).second;
2335 // Find the last block the caller has in the main chain
2336 pindex = locator.GetBlockIndex();
2338 pindex = pindex->pnext;
2341 vector<CBlock> vHeaders;
2342 int nLimit = 2000 + locator.GetDistanceBack();
2343 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2344 for (; pindex; pindex = pindex->pnext)
2346 vHeaders.push_back(pindex->GetBlockHeader());
2347 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2350 pfrom->PushMessage("headers", vHeaders);
2354 else if (strCommand == "tx")
2356 vector<uint256> vWorkQueue;
2357 CDataStream vMsg(vRecv);
2361 CInv inv(MSG_TX, tx.GetHash());
2362 pfrom->AddInventoryKnown(inv);
2364 bool fMissingInputs = false;
2365 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2367 SyncWithWallets(tx, NULL, true);
2368 RelayMessage(inv, vMsg);
2369 mapAlreadyAskedFor.erase(inv);
2370 vWorkQueue.push_back(inv.hash);
2372 // Recursively process any orphan transactions that depended on this one
2373 for (int i = 0; i < vWorkQueue.size(); i++)
2375 uint256 hashPrev = vWorkQueue[i];
2376 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2377 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2380 const CDataStream& vMsg = *((*mi).second);
2382 CDataStream(vMsg) >> tx;
2383 CInv inv(MSG_TX, tx.GetHash());
2385 if (tx.AcceptToMemoryPool(true))
2387 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2388 SyncWithWallets(tx, NULL, true);
2389 RelayMessage(inv, vMsg);
2390 mapAlreadyAskedFor.erase(inv);
2391 vWorkQueue.push_back(inv.hash);
2396 BOOST_FOREACH(uint256 hash, vWorkQueue)
2397 EraseOrphanTx(hash);
2399 else if (fMissingInputs)
2401 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2404 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2408 else if (strCommand == "block")
2413 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2416 CInv inv(MSG_BLOCK, block.GetHash());
2417 pfrom->AddInventoryKnown(inv);
2419 if (ProcessBlock(pfrom, &block))
2420 mapAlreadyAskedFor.erase(inv);
2421 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2425 else if (strCommand == "getaddr")
2427 // Nodes rebroadcast an addr every 24 hours
2428 pfrom->vAddrToSend.clear();
2429 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2430 CRITICAL_BLOCK(cs_mapAddresses)
2432 unsigned int nCount = 0;
2433 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2435 const CAddress& addr = item.second;
2436 if (addr.nTime > nSince)
2439 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2441 const CAddress& addr = item.second;
2442 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2443 pfrom->PushAddress(addr);
2449 else if (strCommand == "checkorder")
2454 if (!GetBoolArg("-allowreceivebyip"))
2456 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2463 /// we have a chance to check the order here
2465 // Keep giving the same key to the same ip until they use it
2466 if (!mapReuseKey.count(pfrom->addr))
2467 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2469 // Send back approval of order and pubkey to use
2470 CScript scriptPubKey;
2471 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2472 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2476 else if (strCommand == "reply")
2481 CRequestTracker tracker;
2482 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2484 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2485 if (mi != pfrom->mapRequests.end())
2487 tracker = (*mi).second;
2488 pfrom->mapRequests.erase(mi);
2491 if (!tracker.IsNull())
2492 tracker.fn(tracker.param1, vRecv);
2496 else if (strCommand == "ping")
2501 else if (strCommand == "alert")
2506 if (alert.ProcessAlert())
2509 pfrom->setKnown.insert(alert.GetHash());
2510 CRITICAL_BLOCK(cs_vNodes)
2511 BOOST_FOREACH(CNode* pnode, vNodes)
2512 alert.RelayTo(pnode);
2519 // Ignore unknown commands for extensibility
2523 // Update the last seen time for this node's address
2524 if (pfrom->fNetworkNode)
2525 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2526 AddressCurrentlyConnected(pfrom->addr);
2532 bool ProcessMessages(CNode* pfrom)
2534 CDataStream& vRecv = pfrom->vRecv;
2538 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2542 // (4) message start
2551 // Scan for message start
2552 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2553 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2554 if (vRecv.end() - pstart < nHeaderSize)
2556 if (vRecv.size() > nHeaderSize)
2558 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2559 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2563 if (pstart - vRecv.begin() > 0)
2564 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2565 vRecv.erase(vRecv.begin(), pstart);
2568 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2573 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2576 string strCommand = hdr.GetCommand();
2579 unsigned int nMessageSize = hdr.nMessageSize;
2580 if (nMessageSize > MAX_SIZE)
2582 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2585 if (nMessageSize > vRecv.size())
2587 // Rewind and wait for rest of message
2588 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2593 if (vRecv.GetVersion() >= 209)
2595 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2596 unsigned int nChecksum = 0;
2597 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2598 if (nChecksum != hdr.nChecksum)
2600 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2601 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2606 // Copy message to its own buffer
2607 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2608 vRecv.ignore(nMessageSize);
2614 CRITICAL_BLOCK(cs_main)
2615 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2619 catch (std::ios_base::failure& e)
2621 if (strstr(e.what(), "end of data"))
2623 // Allow exceptions from underlength message on vRecv
2624 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());
2626 else if (strstr(e.what(), "size too large"))
2628 // Allow exceptions from overlong size
2629 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2633 PrintExceptionContinue(&e, "ProcessMessage()");
2636 catch (std::exception& e) {
2637 PrintExceptionContinue(&e, "ProcessMessage()");
2639 PrintExceptionContinue(NULL, "ProcessMessage()");
2643 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2651 bool SendMessages(CNode* pto, bool fSendTrickle)
2653 CRITICAL_BLOCK(cs_main)
2655 // Don't send anything until we get their version message
2656 if (pto->nVersion == 0)
2660 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2661 pto->PushMessage("ping");
2663 // Resend wallet transactions that haven't gotten in a block yet
2664 ResendWalletTransactions();
2666 // Address refresh broadcast
2667 static int64 nLastRebroadcast;
2668 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2670 nLastRebroadcast = GetTime();
2671 CRITICAL_BLOCK(cs_vNodes)
2673 BOOST_FOREACH(CNode* pnode, vNodes)
2675 // Periodically clear setAddrKnown to allow refresh broadcasts
2676 pnode->setAddrKnown.clear();
2678 // Rebroadcast our address
2679 if (addrLocalHost.IsRoutable() && !fUseProxy)
2681 CAddress addr(addrLocalHost);
2682 addr.nTime = GetAdjustedTime();
2683 pnode->PushAddress(addr);
2689 // Clear out old addresses periodically so it's not too much work at once
2690 static int64 nLastClear;
2691 if (nLastClear == 0)
2692 nLastClear = GetTime();
2693 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2695 nLastClear = GetTime();
2696 CRITICAL_BLOCK(cs_mapAddresses)
2699 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2700 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2701 mi != mapAddresses.end();)
2703 const CAddress& addr = (*mi).second;
2704 if (addr.nTime < nSince)
2706 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2708 addrdb.EraseAddress(addr);
2709 mapAddresses.erase(mi++);
2723 vector<CAddress> vAddr;
2724 vAddr.reserve(pto->vAddrToSend.size());
2725 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2727 // returns true if wasn't already contained in the set
2728 if (pto->setAddrKnown.insert(addr).second)
2730 vAddr.push_back(addr);
2731 // receiver rejects addr messages larger than 1000
2732 if (vAddr.size() >= 1000)
2734 pto->PushMessage("addr", vAddr);
2739 pto->vAddrToSend.clear();
2741 pto->PushMessage("addr", vAddr);
2746 // Message: inventory
2749 vector<CInv> vInvWait;
2750 CRITICAL_BLOCK(pto->cs_inventory)
2752 vInv.reserve(pto->vInventoryToSend.size());
2753 vInvWait.reserve(pto->vInventoryToSend.size());
2754 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2756 if (pto->setInventoryKnown.count(inv))
2759 // trickle out tx inv to protect privacy
2760 if (inv.type == MSG_TX && !fSendTrickle)
2762 // 1/4 of tx invs blast to all immediately
2763 static uint256 hashSalt;
2765 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2766 uint256 hashRand = inv.hash ^ hashSalt;
2767 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2768 bool fTrickleWait = ((hashRand & 3) != 0);
2770 // always trickle our own transactions
2774 if (GetTransaction(inv.hash, wtx))
2776 fTrickleWait = true;
2781 vInvWait.push_back(inv);
2786 // returns true if wasn't already contained in the set
2787 if (pto->setInventoryKnown.insert(inv).second)
2789 vInv.push_back(inv);
2790 if (vInv.size() >= 1000)
2792 pto->PushMessage("inv", vInv);
2797 pto->vInventoryToSend = vInvWait;
2800 pto->PushMessage("inv", vInv);
2806 vector<CInv> vGetData;
2807 int64 nNow = GetTime() * 1000000;
2809 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2811 const CInv& inv = (*pto->mapAskFor.begin()).second;
2812 if (!AlreadyHave(txdb, inv))
2814 printf("sending getdata: %s\n", inv.ToString().c_str());
2815 vGetData.push_back(inv);
2816 if (vGetData.size() >= 1000)
2818 pto->PushMessage("getdata", vGetData);
2822 mapAlreadyAskedFor[inv] = nNow;
2823 pto->mapAskFor.erase(pto->mapAskFor.begin());
2825 if (!vGetData.empty())
2826 pto->PushMessage("getdata", vGetData);
2845 //////////////////////////////////////////////////////////////////////////////
2850 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2852 unsigned char* pdata = (unsigned char*)pbuffer;
2853 unsigned int blocks = 1 + ((len + 8) / 64);
2854 unsigned char* pend = pdata + 64 * blocks;
2855 memset(pdata + len, 0, 64 * blocks - len);
2857 unsigned int bits = len * 8;
2858 pend[-1] = (bits >> 0) & 0xff;
2859 pend[-2] = (bits >> 8) & 0xff;
2860 pend[-3] = (bits >> 16) & 0xff;
2861 pend[-4] = (bits >> 24) & 0xff;
2865 static const unsigned int pSHA256InitState[8] =
2866 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2868 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2871 unsigned char data[64];
2875 for (int i = 0; i < 16; i++)
2876 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2878 for (int i = 0; i < 8; i++)
2879 ctx.h[i] = ((uint32_t*)pinit)[i];
2881 SHA256_Update(&ctx, data, sizeof(data));
2882 for (int i = 0; i < 8; i++)
2883 ((uint32_t*)pstate)[i] = ctx.h[i];
2887 // ScanHash scans nonces looking for a hash with at least some zero bits.
2888 // It operates on big endian data. Caller does the byte reversing.
2889 // All input buffers are 16-byte aligned. nNonce is usually preserved
2890 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2891 // the block is rebuilt and nNonce starts over at zero.
2893 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2895 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2899 // Hash pdata using pmidstate as the starting state into
2900 // preformatted buffer phash1, then hash phash1 into phash
2902 SHA256Transform(phash1, pdata, pmidstate);
2903 SHA256Transform(phash, phash1, pSHA256InitState);
2905 // Return the nonce if the hash has at least some zero bits,
2906 // caller will check if it has enough to reach the target
2907 if (((unsigned short*)phash)[14] == 0)
2910 // If nothing found after trying for a while, return -1
2911 if ((nNonce & 0xffff) == 0)
2913 nHashesDone = 0xffff+1;
2919 // Some explaining would be appreciated
2924 set<uint256> setDependsOn;
2927 COrphan(CTransaction* ptxIn)
2935 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2936 BOOST_FOREACH(uint256 hash, setDependsOn)
2937 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2942 uint64 nLastBlockTx = 0;
2943 uint64 nLastBlockSize = 0;
2945 CBlock* CreateNewBlock(CReserveKey& reservekey)
2947 CBlockIndex* pindexPrev = pindexBest;
2950 auto_ptr<CBlock> pblock(new CBlock());
2954 // Create coinbase tx
2956 txNew.vin.resize(1);
2957 txNew.vin[0].prevout.SetNull();
2958 txNew.vout.resize(1);
2959 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2961 // Add our coinbase tx as first transaction
2962 pblock->vtx.push_back(txNew);
2964 // Collect memory pool transactions into the block
2966 CRITICAL_BLOCK(cs_main)
2967 CRITICAL_BLOCK(cs_mapTransactions)
2971 // Priority order to process transactions
2972 list<COrphan> vOrphan; // list memory doesn't move
2973 map<uint256, vector<COrphan*> > mapDependers;
2974 multimap<double, CTransaction*> mapPriority;
2975 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2977 CTransaction& tx = (*mi).second;
2978 if (tx.IsCoinBase() || !tx.IsFinal())
2981 COrphan* porphan = NULL;
2982 double dPriority = 0;
2983 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2985 // Read prev transaction
2986 CTransaction txPrev;
2988 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2990 // Has to wait for dependencies
2993 // Use list for automatic deletion
2994 vOrphan.push_back(COrphan(&tx));
2995 porphan = &vOrphan.back();
2997 mapDependers[txin.prevout.hash].push_back(porphan);
2998 porphan->setDependsOn.insert(txin.prevout.hash);
3001 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3003 // Read block header
3004 int nConf = txindex.GetDepthInMainChain();
3006 dPriority += (double)nValueIn * nConf;
3008 if (fDebug && GetBoolArg("-printpriority"))
3009 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3012 // Priority is sum(valuein * age) / txsize
3013 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3016 porphan->dPriority = dPriority;
3018 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3020 if (fDebug && GetBoolArg("-printpriority"))
3022 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3029 // Collect transactions into block
3030 map<uint256, CTxIndex> mapTestPool;
3031 uint64 nBlockSize = 1000;
3032 uint64 nBlockTx = 0;
3033 int nBlockSigOps = 100;
3034 while (!mapPriority.empty())
3036 // Take highest priority transaction off priority queue
3037 double dPriority = -(*mapPriority.begin()).first;
3038 CTransaction& tx = *(*mapPriority.begin()).second;
3039 mapPriority.erase(mapPriority.begin());
3042 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3043 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3046 // Legacy limits on sigOps:
3047 int nTxSigOps = tx.GetLegacySigOpCount();
3048 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3051 // Transaction fee required depends on block size
3052 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3053 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3055 // Connecting shouldn't fail due to dependency on other memory pool transactions
3056 // because we're already processing them in order of dependency
3057 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3058 MapPrevTx mapInputs;
3059 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs))
3062 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3063 if (nFees < nMinFee)
3066 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3067 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3070 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3072 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3073 swap(mapTestPool, mapTestPoolTmp);
3076 pblock->vtx.push_back(tx);
3077 nBlockSize += nTxSize;
3079 nBlockSigOps += nTxSigOps;
3081 // Add transactions that depend on this one to the priority queue
3082 uint256 hash = tx.GetHash();
3083 if (mapDependers.count(hash))
3085 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3087 if (!porphan->setDependsOn.empty())
3089 porphan->setDependsOn.erase(hash);
3090 if (porphan->setDependsOn.empty())
3091 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3097 nLastBlockTx = nBlockTx;
3098 nLastBlockSize = nBlockSize;
3099 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3102 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3105 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3106 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3107 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3108 pblock->nBits = GetNextWorkRequired(pindexPrev);
3111 return pblock.release();
3115 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3117 // Update nExtraNonce
3118 static uint256 hashPrevBlock;
3119 if (hashPrevBlock != pblock->hashPrevBlock)
3122 hashPrevBlock = pblock->hashPrevBlock;
3125 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3126 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3128 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3132 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3135 // Prebuild hash buffers
3142 uint256 hashPrevBlock;
3143 uint256 hashMerkleRoot;
3146 unsigned int nNonce;
3149 unsigned char pchPadding0[64];
3151 unsigned char pchPadding1[64];
3154 memset(&tmp, 0, sizeof(tmp));
3156 tmp.block.nVersion = pblock->nVersion;
3157 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3158 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3159 tmp.block.nTime = pblock->nTime;
3160 tmp.block.nBits = pblock->nBits;
3161 tmp.block.nNonce = pblock->nNonce;
3163 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3164 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3166 // Byte swap all the input buffer
3167 for (int i = 0; i < sizeof(tmp)/4; i++)
3168 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3170 // Precalc the first half of the first hash, which stays constant
3171 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3173 memcpy(pdata, &tmp.block, 128);
3174 memcpy(phash1, &tmp.hash1, 64);
3178 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3180 uint256 hash = pblock->GetHash();
3181 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3183 if (hash > hashTarget)
3187 printf("BitcoinMiner:\n");
3188 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3190 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3191 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3194 CRITICAL_BLOCK(cs_main)
3196 if (pblock->hashPrevBlock != hashBestChain)
3197 return error("BitcoinMiner : generated block is stale");
3199 // Remove key from key pool
3200 reservekey.KeepKey();
3202 // Track how many getdata requests this block gets
3203 CRITICAL_BLOCK(wallet.cs_wallet)
3204 wallet.mapRequestCount[pblock->GetHash()] = 0;
3206 // Process this block the same as if we had received it from another node
3207 if (!ProcessBlock(NULL, pblock))
3208 return error("BitcoinMiner : ProcessBlock, block not accepted");
3214 void static ThreadBitcoinMiner(void* parg);
3216 void static BitcoinMiner(CWallet *pwallet)
3218 printf("BitcoinMiner started\n");
3219 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3221 // Each thread has its own key and counter
3222 CReserveKey reservekey(pwallet);
3223 unsigned int nExtraNonce = 0;
3225 while (fGenerateBitcoins)
3227 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3231 while (vNodes.empty() || IsInitialBlockDownload())
3236 if (!fGenerateBitcoins)
3244 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3245 CBlockIndex* pindexPrev = pindexBest;
3247 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3250 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3252 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3256 // Prebuild hash buffers
3258 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3259 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3260 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3262 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3264 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3265 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3271 int64 nStart = GetTime();
3272 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3274 uint256& hash = *alignup<16>(hashbuf);
3277 unsigned int nHashesDone = 0;
3278 unsigned int nNonceFound;
3281 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3282 (char*)&hash, nHashesDone);
3284 // Check if something found
3285 if (nNonceFound != -1)
3287 for (int i = 0; i < sizeof(hash)/4; i++)
3288 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3290 if (hash <= hashTarget)
3293 pblock->nNonce = ByteReverse(nNonceFound);
3294 assert(hash == pblock->GetHash());
3296 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3297 CheckWork(pblock.get(), *pwalletMain, reservekey);
3298 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3304 static int64 nHashCounter;
3305 if (nHPSTimerStart == 0)
3307 nHPSTimerStart = GetTimeMillis();
3311 nHashCounter += nHashesDone;
3312 if (GetTimeMillis() - nHPSTimerStart > 4000)
3314 static CCriticalSection cs;
3317 if (GetTimeMillis() - nHPSTimerStart > 4000)
3319 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3320 nHPSTimerStart = GetTimeMillis();
3322 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3323 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3324 static int64 nLogTime;
3325 if (GetTime() - nLogTime > 30 * 60)
3327 nLogTime = GetTime();
3328 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3329 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3335 // Check for stop or if block needs to be rebuilt
3338 if (!fGenerateBitcoins)
3340 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3344 if (nBlockNonce >= 0xffff0000)
3346 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3348 if (pindexPrev != pindexBest)
3351 // Update nTime every few seconds
3352 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3353 nBlockTime = ByteReverse(pblock->nTime);
3358 void static ThreadBitcoinMiner(void* parg)
3360 CWallet* pwallet = (CWallet*)parg;
3363 vnThreadsRunning[3]++;
3364 BitcoinMiner(pwallet);
3365 vnThreadsRunning[3]--;
3367 catch (std::exception& e) {
3368 vnThreadsRunning[3]--;
3369 PrintException(&e, "ThreadBitcoinMiner()");
3371 vnThreadsRunning[3]--;
3372 PrintException(NULL, "ThreadBitcoinMiner()");
3374 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3376 if (vnThreadsRunning[3] == 0)
3378 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3382 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3384 if (fGenerateBitcoins != fGenerate)
3386 fGenerateBitcoins = fGenerate;
3387 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3390 if (fGenerateBitcoins)
3392 int nProcessors = boost::thread::hardware_concurrency();
3393 printf("%d processors\n", nProcessors);
3394 if (nProcessors < 1)
3396 if (fLimitProcessors && nProcessors > nLimitProcessors)
3397 nProcessors = nLimitProcessors;
3398 int nAddThreads = nProcessors - vnThreadsRunning[3];
3399 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3400 for (int i = 0; i < nAddThreads; i++)
3402 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3403 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");