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 // in an OP_EVAL, which is 3 ~80-byte signatures, 3
255 // ~65-byte public keys, plus a few script ops.
256 if (txin.scriptSig.size() > 500)
257 return error("nonstandard txin, size %d is too large\n", txin.scriptSig.size());
258 if (!txin.scriptSig.IsPushOnly())
259 return error("nonstandard txin (opcodes other than PUSH): %s", txin.scriptSig.ToString().c_str());
261 BOOST_FOREACH(const CTxOut& txout, vout)
262 if (!::IsStandard(txout.scriptPubKey))
263 return error("nonstandard txout: %s", txout.scriptPubKey.ToString().c_str());
268 // Check transaction inputs, and make sure any
269 // OP_EVAL transactions are evaluating IsStandard scripts
271 // Why bother? To avoid denial-of-service attacks; an attacker
272 // can submit a standard DUP HASH... OP_EVAL transaction,
273 // which will get accepted into blocks. The script being
274 // EVAL'ed 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(std::map<uint256, std::pair<CTxIndex, CTransaction> > mapInputs) const
281 return true; // Allow non-standard on testnet
283 for (int i = 0; i < vin.size(); i++)
285 COutPoint prevout = vin[i].prevout;
286 assert(mapInputs.count(prevout.hash) > 0);
287 CTransaction& txPrev = mapInputs[prevout.hash].second;
288 assert(prevout.n < txPrev.vout.size());
290 vector<vector<unsigned char> > vSolutions;
291 txnouttype whichType;
292 // get the scriptPubKey corresponding to this input:
293 CScript& prevScript = txPrev.vout[prevout.n].scriptPubKey;
294 if (!Solver(prevScript, whichType, vSolutions))
295 return error("nonstandard txin (spending nonstandard txout %s)", prevScript.ToString().c_str());
296 if (whichType == TX_SCRIPTHASH)
298 vector<vector<unsigned char> > stack;
300 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0, true, nUnused))
302 CScript subscript(stack.back().begin(), stack.back().end());
303 if (!::IsStandard(subscript))
304 return error("nonstandard txin (nonstandard OP_EVAL subscript %s)", subscript.ToString().c_str());
313 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
325 // Load the block this tx is in
327 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
329 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
334 // Update the tx's hashBlock
335 hashBlock = pblock->GetHash();
337 // Locate the transaction
338 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
339 if (pblock->vtx[nIndex] == *(CTransaction*)this)
341 if (nIndex == pblock->vtx.size())
343 vMerkleBranch.clear();
345 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
349 // Fill in merkle branch
350 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
353 // Is the tx in a block that's in the main chain
354 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
355 if (mi == mapBlockIndex.end())
357 CBlockIndex* pindex = (*mi).second;
358 if (!pindex || !pindex->IsInMainChain())
361 return pindexBest->nHeight - pindex->nHeight + 1;
370 bool CTransaction::CheckTransaction() const
372 // Basic checks that don't depend on any context
374 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
376 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
378 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
379 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
381 // Check for negative or overflow output values
383 BOOST_FOREACH(const CTxOut& txout, vout)
385 if (txout.nValue < 0)
386 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
387 if (txout.nValue > MAX_MONEY)
388 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
389 nValueOut += txout.nValue;
390 if (!MoneyRange(nValueOut))
391 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
394 // Check for duplicate inputs
395 set<COutPoint> vInOutPoints;
396 BOOST_FOREACH(const CTxIn& txin, vin)
398 if (vInOutPoints.count(txin.prevout))
400 vInOutPoints.insert(txin.prevout);
405 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
406 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
410 BOOST_FOREACH(const CTxIn& txin, vin)
411 if (txin.prevout.IsNull())
412 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
418 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
421 *pfMissingInputs = false;
423 if (!CheckTransaction())
424 return error("AcceptToMemoryPool() : CheckTransaction failed");
426 // Coinbase is only valid in a block, not as a loose transaction
428 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
430 // To help v0.1.5 clients who would see it as a negative number
431 if ((int64)nLockTime > std::numeric_limits<int>::max())
432 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
434 // Rather not work on nonstandard transactions (unless -testnet)
435 if (!fTestNet && !IsStandard())
436 return error("AcceptToMemoryPool() : nonstandard transaction type");
438 // Do we already have it?
439 uint256 hash = GetHash();
440 CRITICAL_BLOCK(cs_mapTransactions)
441 if (mapTransactions.count(hash))
444 if (txdb.ContainsTx(hash))
447 // Check for conflicts with in-memory transactions
448 CTransaction* ptxOld = NULL;
449 for (int i = 0; i < vin.size(); i++)
451 COutPoint outpoint = vin[i].prevout;
452 if (mapNextTx.count(outpoint))
454 // Disable replacement feature for now
457 // Allow replacing with a newer version of the same transaction
460 ptxOld = mapNextTx[outpoint].ptx;
461 if (ptxOld->IsFinal())
463 if (!IsNewerThan(*ptxOld))
465 for (int i = 0; i < vin.size(); i++)
467 COutPoint outpoint = vin[i].prevout;
468 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
477 map<uint256, pair<CTxIndex, CTransaction> > mapInputs;
478 map<uint256, CTxIndex> mapUnused;
479 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs))
482 *pfMissingInputs = true;
483 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
486 // Check for non-standard OP_EVALs in inputs
487 if (!AreInputsStandard(mapInputs))
488 return error("AcceptToMemoryPool() : nonstandard transaction input");
490 // Check against previous transactions
493 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false, nSigOps))
496 *pfMissingInputs = true;
497 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
499 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
500 // attacks disallow transactions with more than one SigOp per 65 bytes.
501 // 65 bytes because that is the minimum size of an ECDSA signature
502 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
503 if (nSigOps > nSize / 65 || nSize < 100)
504 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
506 // Don't accept it if it can't get into a block
507 if (nFees < GetMinFee(1000, true, GMF_RELAY))
508 return error("AcceptToMemoryPool() : not enough fees");
510 // Continuously rate-limit free transactions
511 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
512 // be annoying or make other's transactions take longer to confirm.
513 if (nFees < MIN_RELAY_TX_FEE)
515 static CCriticalSection cs;
516 static double dFreeCount;
517 static int64 nLastTime;
518 int64 nNow = GetTime();
522 // Use an exponentially decaying ~10-minute window:
523 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
525 // -limitfreerelay unit is thousand-bytes-per-minute
526 // At default rate it would take over a month to fill 1GB
527 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
528 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
530 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
536 // Store transaction in memory
537 CRITICAL_BLOCK(cs_mapTransactions)
541 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
542 ptxOld->RemoveFromMemoryPool();
544 AddToMemoryPoolUnchecked();
547 ///// are we sure this is ok when loading transactions or restoring block txes
548 // If updated, erase old tx from wallet
550 EraseFromWallets(ptxOld->GetHash());
552 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
556 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
559 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
562 uint64 nPooledTx = 0;
564 bool CTransaction::AddToMemoryPoolUnchecked()
566 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
567 // Add to memory pool without checking anything. Don't call this directly,
568 // call AcceptToMemoryPool to properly check the transaction first.
569 CRITICAL_BLOCK(cs_mapTransactions)
571 uint256 hash = GetHash();
572 mapTransactions[hash] = *this;
573 for (int i = 0; i < vin.size(); i++)
574 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
575 nTransactionsUpdated++;
582 bool CTransaction::RemoveFromMemoryPool()
584 // Remove transaction from memory pool
585 CRITICAL_BLOCK(cs_mapTransactions)
587 BOOST_FOREACH(const CTxIn& txin, vin)
588 mapNextTx.erase(txin.prevout);
589 mapTransactions.erase(GetHash());
590 nTransactionsUpdated++;
601 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
603 if (hashBlock == 0 || nIndex == -1)
606 // Find the block it claims to be in
607 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
608 if (mi == mapBlockIndex.end())
610 CBlockIndex* pindex = (*mi).second;
611 if (!pindex || !pindex->IsInMainChain())
614 // Make sure the merkle branch connects to this block
615 if (!fMerkleVerified)
617 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
619 fMerkleVerified = true;
623 return pindexBest->nHeight - pindex->nHeight + 1;
627 int CMerkleTx::GetBlocksToMaturity() const
631 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
635 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
639 if (!IsInMainChain() && !ClientConnectInputs())
641 return CTransaction::AcceptToMemoryPool(txdb, false);
645 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
649 bool CMerkleTx::AcceptToMemoryPool()
652 return AcceptToMemoryPool(txdb);
657 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
659 CRITICAL_BLOCK(cs_mapTransactions)
661 // Add previous supporting transactions first
662 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
664 if (!tx.IsCoinBase())
666 uint256 hash = tx.GetHash();
667 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
668 tx.AcceptToMemoryPool(txdb, fCheckInputs);
671 return AcceptToMemoryPool(txdb, fCheckInputs);
676 bool CWalletTx::AcceptWalletTransaction()
679 return AcceptWalletTransaction(txdb);
682 int CTxIndex::GetDepthInMainChain() const
686 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
688 // Find the block in the index
689 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
690 if (mi == mapBlockIndex.end())
692 CBlockIndex* pindex = (*mi).second;
693 if (!pindex || !pindex->IsInMainChain())
695 return 1 + nBestHeight - pindex->nHeight;
707 //////////////////////////////////////////////////////////////////////////////
709 // CBlock and CBlockIndex
712 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
714 if (!fReadTransactions)
716 *this = pindex->GetBlockHeader();
719 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
721 if (GetHash() != pindex->GetBlockHash())
722 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
726 uint256 static GetOrphanRoot(const CBlock* pblock)
728 // Work back to the first block in the orphan chain
729 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
730 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
731 return pblock->GetHash();
734 int64 static GetBlockValue(int nHeight, int64 nFees)
736 int64 nSubsidy = 50 * COIN;
738 // Subsidy is cut in half every 4 years
739 nSubsidy >>= (nHeight / 210000);
741 return nSubsidy + nFees;
744 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
745 static const int64 nTargetSpacing = 10 * 60;
746 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
749 // minimum amount of work that could possibly be required nTime after
750 // minimum work required was nBase
752 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
755 bnResult.SetCompact(nBase);
756 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
758 // Maximum 400% adjustment...
760 // ... in best-case exactly 4-times-normal target time
761 nTime -= nTargetTimespan*4;
763 if (bnResult > bnProofOfWorkLimit)
764 bnResult = bnProofOfWorkLimit;
765 return bnResult.GetCompact();
768 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
772 if (pindexLast == NULL)
773 return bnProofOfWorkLimit.GetCompact();
775 // Only change once per interval
776 if ((pindexLast->nHeight+1) % nInterval != 0)
777 return pindexLast->nBits;
779 // Go back by what we want to be 14 days worth of blocks
780 const CBlockIndex* pindexFirst = pindexLast;
781 for (int i = 0; pindexFirst && i < nInterval-1; i++)
782 pindexFirst = pindexFirst->pprev;
785 // Limit adjustment step
786 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
787 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
788 if (nActualTimespan < nTargetTimespan/4)
789 nActualTimespan = nTargetTimespan/4;
790 if (nActualTimespan > nTargetTimespan*4)
791 nActualTimespan = nTargetTimespan*4;
795 bnNew.SetCompact(pindexLast->nBits);
796 bnNew *= nActualTimespan;
797 bnNew /= nTargetTimespan;
799 if (bnNew > bnProofOfWorkLimit)
800 bnNew = bnProofOfWorkLimit;
803 printf("GetNextWorkRequired RETARGET\n");
804 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
805 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
806 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
808 return bnNew.GetCompact();
811 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
814 bnTarget.SetCompact(nBits);
817 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
818 return error("CheckProofOfWork() : nBits below minimum work");
820 // Check proof of work matches claimed amount
821 if (hash > bnTarget.getuint256())
822 return error("CheckProofOfWork() : hash doesn't match nBits");
827 // Return maximum amount of blocks that other nodes claim to have
828 int GetNumBlocksOfPeers()
830 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
833 bool IsInitialBlockDownload()
835 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
837 static int64 nLastUpdate;
838 static CBlockIndex* pindexLastBest;
839 if (pindexBest != pindexLastBest)
841 pindexLastBest = pindexBest;
842 nLastUpdate = GetTime();
844 return (GetTime() - nLastUpdate < 10 &&
845 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
848 void static InvalidChainFound(CBlockIndex* pindexNew)
850 if (pindexNew->bnChainWork > bnBestInvalidWork)
852 bnBestInvalidWork = pindexNew->bnChainWork;
853 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
856 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());
857 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
858 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
859 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
872 bool CTransaction::DisconnectInputs(CTxDB& txdb)
874 // Relinquish previous transactions' spent pointers
877 BOOST_FOREACH(const CTxIn& txin, vin)
879 COutPoint prevout = txin.prevout;
881 // Get prev txindex from disk
883 if (!txdb.ReadTxIndex(prevout.hash, txindex))
884 return error("DisconnectInputs() : ReadTxIndex failed");
886 if (prevout.n >= txindex.vSpent.size())
887 return error("DisconnectInputs() : prevout.n out of range");
889 // Mark outpoint as not spent
890 txindex.vSpent[prevout.n].SetNull();
893 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
894 return error("DisconnectInputs() : UpdateTxIndex failed");
898 // Remove transaction from index
899 if (!txdb.EraseTxIndex(*this))
900 return error("DisconnectInputs() : EraseTxPos failed");
906 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
907 bool fBlock, bool fMiner, map<uint256, pair<CTxIndex, CTransaction> >& inputsRet)
910 return true; // Coinbase transactions have no inputs to fetch.
912 for (int i = 0; i < vin.size(); i++)
914 COutPoint prevout = vin[i].prevout;
915 if (inputsRet.count(prevout.hash))
916 continue; // Got it already
919 CTxIndex& txindex = inputsRet[prevout.hash].first;
921 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
923 // Get txindex from current proposed changes
924 txindex = mapTestPool.find(prevout.hash)->second;
928 // Read txindex from txdb
929 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
931 if (!fFound && (fBlock || fMiner))
932 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());
935 CTransaction& txPrev = inputsRet[prevout.hash].second;
936 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
938 // Get prev tx from single transactions in memory
939 CRITICAL_BLOCK(cs_mapTransactions)
941 if (!mapTransactions.count(prevout.hash))
942 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
943 txPrev = mapTransactions[prevout.hash];
946 txindex.vSpent.resize(txPrev.vout.size());
950 // Get prev tx from disk
951 if (!txPrev.ReadFromDisk(txindex.pos))
952 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
956 // Make sure all prevout.n's are valid:
957 for (int i = 0; i < vin.size(); i++)
959 const COutPoint prevout = vin[i].prevout;
960 const CTxIndex& txindex = inputsRet[prevout.hash].first;
961 const CTransaction& txPrev = inputsRet[prevout.hash].second;
962 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
963 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()));
969 bool CTransaction::ConnectInputs(map<uint256, pair<CTxIndex, CTransaction> > inputs,
970 map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
971 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int& nSigOpsRet, int64 nMinFee)
973 // Take over previous transactions' spent pointers
974 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
975 // fMiner is true when called from the internal bitcoin miner
976 // ... both are false when called from CTransaction::AcceptToMemoryPool
980 for (int i = 0; i < vin.size(); i++)
982 COutPoint prevout = vin[i].prevout;
983 assert(inputs.count(prevout.hash) > 0);
984 CTxIndex& txindex = inputs[prevout.hash].first;
985 CTransaction& txPrev = inputs[prevout.hash].second;
987 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
988 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()));
990 // If prev is coinbase, check that it's matured
991 if (txPrev.IsCoinBase())
992 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
993 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
994 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
996 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
997 // before the last blockchain checkpoint. This is safe because block merkle hashes are
998 // still computed and checked, and any change will be caught at the next checkpoint.
999 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1001 bool fStrictOpEval = true;
1002 // This code should be removed when OP_EVAL has
1003 // a majority of hashing power on the network.
1006 // To avoid being on the short end of a block-chain split,
1007 // interpret OP_EVAL as a NO_OP until blocks with timestamps
1008 // after opevaltime:
1009 int64 nEvalSwitchTime = GetArg("opevaltime", 1328054400); // Feb 1, 2012
1010 fStrictOpEval = (pindexBlock->nTime >= nEvalSwitchTime);
1012 // if !fBlock, then always be strict-- don't accept
1013 // invalid-under-new-rules OP_EVAL transactions into
1014 // our memory pool (don't relay them, don't include them
1015 // in blocks we mine).
1018 if (!VerifySignature(txPrev, *this, i, nSigOpsRet, fStrictOpEval))
1019 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1022 // Check for conflicts (double-spend)
1023 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1024 // for an attacker to attempt to split the network.
1025 if (!txindex.vSpent[prevout.n].IsNull())
1026 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());
1028 // Check for negative or overflow input values
1029 nValueIn += txPrev.vout[prevout.n].nValue;
1030 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1031 return DoS(100, error("ConnectInputs() : txin values out of range"));
1033 // Mark outpoints as spent
1034 txindex.vSpent[prevout.n] = posThisTx;
1037 if (fBlock || fMiner)
1039 mapTestPool[prevout.hash] = txindex;
1043 if (nValueIn < GetValueOut())
1044 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1046 // Tally transaction fees
1047 int64 nTxFee = nValueIn - GetValueOut();
1049 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1050 if (nTxFee < nMinFee)
1053 if (!MoneyRange(nFees))
1054 return DoS(100, error("ConnectInputs() : nFees out of range"));
1059 // Add transaction to changes
1060 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
1064 // Add transaction to test pool
1065 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
1072 bool CTransaction::ClientConnectInputs()
1077 // Take over previous transactions' spent pointers
1078 CRITICAL_BLOCK(cs_mapTransactions)
1081 for (int i = 0; i < vin.size(); i++)
1083 // Get prev tx from single transactions in memory
1084 COutPoint prevout = vin[i].prevout;
1085 if (!mapTransactions.count(prevout.hash))
1087 CTransaction& txPrev = mapTransactions[prevout.hash];
1089 if (prevout.n >= txPrev.vout.size())
1094 if (!VerifySignature(txPrev, *this, i, nUnused, false))
1095 return error("ConnectInputs() : VerifySignature failed");
1097 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1098 ///// this has to go away now that posNext is gone
1099 // // Check for conflicts
1100 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1101 // return error("ConnectInputs() : prev tx already used");
1103 // // Flag outpoints as used
1104 // txPrev.vout[prevout.n].posNext = posThisTx;
1106 nValueIn += txPrev.vout[prevout.n].nValue;
1108 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1109 return error("ClientConnectInputs() : txin values out of range");
1111 if (GetValueOut() > nValueIn)
1121 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1123 // Disconnect in reverse order
1124 for (int i = vtx.size()-1; i >= 0; i--)
1125 if (!vtx[i].DisconnectInputs(txdb))
1128 // Update block index on disk without changing it in memory.
1129 // The memory index structure will be changed after the db commits.
1132 CDiskBlockIndex blockindexPrev(pindex->pprev);
1133 blockindexPrev.hashNext = 0;
1134 if (!txdb.WriteBlockIndex(blockindexPrev))
1135 return error("DisconnectBlock() : WriteBlockIndex failed");
1141 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1143 // Check it again in case a previous version let a bad block in
1147 //// issue here: it doesn't know the version
1148 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1150 map<uint256, CTxIndex> mapQueuedChanges;
1153 BOOST_FOREACH(CTransaction& tx, vtx)
1155 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1156 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1158 map<uint256, pair<CTxIndex, CTransaction> > mapInputs;
1159 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs))
1161 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, nFees, true, false, nSigOps))
1163 if (nSigOps > MAX_BLOCK_SIGOPS)
1164 return DoS(100, error("ConnectBlock() : too many sigops"));
1167 // Write queued txindex changes
1168 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1170 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1171 return error("ConnectBlock() : UpdateTxIndex failed");
1174 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1177 // Update block index on disk without changing it in memory.
1178 // The memory index structure will be changed after the db commits.
1181 CDiskBlockIndex blockindexPrev(pindex->pprev);
1182 blockindexPrev.hashNext = pindex->GetBlockHash();
1183 if (!txdb.WriteBlockIndex(blockindexPrev))
1184 return error("ConnectBlock() : WriteBlockIndex failed");
1187 // Watch for transactions paying to me
1188 BOOST_FOREACH(CTransaction& tx, vtx)
1189 SyncWithWallets(tx, this, true);
1194 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1196 printf("REORGANIZE\n");
1199 CBlockIndex* pfork = pindexBest;
1200 CBlockIndex* plonger = pindexNew;
1201 while (pfork != plonger)
1203 while (plonger->nHeight > pfork->nHeight)
1204 if (!(plonger = plonger->pprev))
1205 return error("Reorganize() : plonger->pprev is null");
1206 if (pfork == plonger)
1208 if (!(pfork = pfork->pprev))
1209 return error("Reorganize() : pfork->pprev is null");
1212 // List of what to disconnect
1213 vector<CBlockIndex*> vDisconnect;
1214 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1215 vDisconnect.push_back(pindex);
1217 // List of what to connect
1218 vector<CBlockIndex*> vConnect;
1219 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1220 vConnect.push_back(pindex);
1221 reverse(vConnect.begin(), vConnect.end());
1223 // Disconnect shorter branch
1224 vector<CTransaction> vResurrect;
1225 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1228 if (!block.ReadFromDisk(pindex))
1229 return error("Reorganize() : ReadFromDisk for disconnect failed");
1230 if (!block.DisconnectBlock(txdb, pindex))
1231 return error("Reorganize() : DisconnectBlock failed");
1233 // Queue memory transactions to resurrect
1234 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1235 if (!tx.IsCoinBase())
1236 vResurrect.push_back(tx);
1239 // Connect longer branch
1240 vector<CTransaction> vDelete;
1241 for (int i = 0; i < vConnect.size(); i++)
1243 CBlockIndex* pindex = vConnect[i];
1245 if (!block.ReadFromDisk(pindex))
1246 return error("Reorganize() : ReadFromDisk for connect failed");
1247 if (!block.ConnectBlock(txdb, pindex))
1251 return error("Reorganize() : ConnectBlock failed");
1254 // Queue memory transactions to delete
1255 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1256 vDelete.push_back(tx);
1258 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1259 return error("Reorganize() : WriteHashBestChain failed");
1261 // Make sure it's successfully written to disk before changing memory structure
1262 if (!txdb.TxnCommit())
1263 return error("Reorganize() : TxnCommit failed");
1265 // Disconnect shorter branch
1266 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1268 pindex->pprev->pnext = NULL;
1270 // Connect longer branch
1271 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1273 pindex->pprev->pnext = pindex;
1275 // Resurrect memory transactions that were in the disconnected branch
1276 BOOST_FOREACH(CTransaction& tx, vResurrect)
1277 tx.AcceptToMemoryPool(txdb, false);
1279 // Delete redundant memory transactions that are in the connected branch
1280 BOOST_FOREACH(CTransaction& tx, vDelete)
1281 tx.RemoveFromMemoryPool();
1288 runCommand(std::string strCommand)
1290 int nErr = ::system(strCommand.c_str());
1292 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1295 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1297 uint256 hash = GetHash();
1300 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1302 txdb.WriteHashBestChain(hash);
1303 if (!txdb.TxnCommit())
1304 return error("SetBestChain() : TxnCommit failed");
1305 pindexGenesisBlock = pindexNew;
1307 else if (hashPrevBlock == hashBestChain)
1309 // Adding to current best branch
1310 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1313 InvalidChainFound(pindexNew);
1314 return error("SetBestChain() : ConnectBlock failed");
1316 if (!txdb.TxnCommit())
1317 return error("SetBestChain() : TxnCommit failed");
1319 // Add to current best branch
1320 pindexNew->pprev->pnext = pindexNew;
1322 // Delete redundant memory transactions
1323 BOOST_FOREACH(CTransaction& tx, vtx)
1324 tx.RemoveFromMemoryPool();
1329 if (!Reorganize(txdb, pindexNew))
1332 InvalidChainFound(pindexNew);
1333 return error("SetBestChain() : Reorganize failed");
1337 // Update best block in wallet (so we can detect restored wallets)
1338 bool fIsInitialDownload = IsInitialBlockDownload();
1339 if (!fIsInitialDownload)
1341 const CBlockLocator locator(pindexNew);
1342 ::SetBestChain(locator);
1346 hashBestChain = hash;
1347 pindexBest = pindexNew;
1348 nBestHeight = pindexBest->nHeight;
1349 bnBestChainWork = pindexNew->bnChainWork;
1350 nTimeBestReceived = GetTime();
1351 nTransactionsUpdated++;
1352 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1354 std::string strCmd = GetArg("-blocknotify", "");
1356 if (!fIsInitialDownload && !strCmd.empty())
1358 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1359 boost::thread t(runCommand, strCmd); // thread runs free
1366 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1368 // Check for duplicate
1369 uint256 hash = GetHash();
1370 if (mapBlockIndex.count(hash))
1371 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1373 // Construct new block index object
1374 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1376 return error("AddToBlockIndex() : new CBlockIndex failed");
1377 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1378 pindexNew->phashBlock = &((*mi).first);
1379 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1380 if (miPrev != mapBlockIndex.end())
1382 pindexNew->pprev = (*miPrev).second;
1383 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1385 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1389 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1390 if (!txdb.TxnCommit())
1394 if (pindexNew->bnChainWork > bnBestChainWork)
1395 if (!SetBestChain(txdb, pindexNew))
1400 if (pindexNew == pindexBest)
1402 // Notify UI to display prev block's coinbase if it was ours
1403 static uint256 hashPrevBestCoinBase;
1404 UpdatedTransaction(hashPrevBestCoinBase);
1405 hashPrevBestCoinBase = vtx[0].GetHash();
1415 bool CBlock::CheckBlock() const
1417 // These are checks that are independent of context
1418 // that can be verified before saving an orphan block.
1421 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1422 return DoS(100, error("CheckBlock() : size limits failed"));
1424 // Check proof of work matches claimed amount
1425 if (!CheckProofOfWork(GetHash(), nBits))
1426 return DoS(50, error("CheckBlock() : proof of work failed"));
1429 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1430 return error("CheckBlock() : block timestamp too far in the future");
1432 // First transaction must be coinbase, the rest must not be
1433 if (vtx.empty() || !vtx[0].IsCoinBase())
1434 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1435 for (int i = 1; i < vtx.size(); i++)
1436 if (vtx[i].IsCoinBase())
1437 return DoS(100, error("CheckBlock() : more than one coinbase"));
1439 // Check transactions
1440 BOOST_FOREACH(const CTransaction& tx, vtx)
1441 if (!tx.CheckTransaction())
1442 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1444 // This code should be removed when a compatibility-breaking block chain split has passed.
1445 // Compatibility check for old clients that counted sigops differently:
1447 BOOST_FOREACH(const CTransaction& tx, vtx)
1449 BOOST_FOREACH(const CTxIn& txin, tx.vin)
1451 nSigOps += txin.scriptSig.GetSigOpCount();
1453 BOOST_FOREACH(const CTxOut& txout, tx.vout)
1455 nSigOps += txout.scriptPubKey.GetSigOpCount();
1458 if (nSigOps > MAX_BLOCK_SIGOPS)
1459 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1462 if (hashMerkleRoot != BuildMerkleTree())
1463 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1468 bool CBlock::AcceptBlock()
1470 // Check for duplicate
1471 uint256 hash = GetHash();
1472 if (mapBlockIndex.count(hash))
1473 return error("AcceptBlock() : block already in mapBlockIndex");
1475 // Get prev block index
1476 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1477 if (mi == mapBlockIndex.end())
1478 return DoS(10, error("AcceptBlock() : prev block not found"));
1479 CBlockIndex* pindexPrev = (*mi).second;
1480 int nHeight = pindexPrev->nHeight+1;
1482 // Check proof of work
1483 if (nBits != GetNextWorkRequired(pindexPrev))
1484 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1486 // Check timestamp against prev
1487 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1488 return error("AcceptBlock() : block's timestamp is too early");
1490 // Check that all transactions are finalized
1491 BOOST_FOREACH(const CTransaction& tx, vtx)
1492 if (!tx.IsFinal(nHeight, GetBlockTime()))
1493 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1495 // Check that the block chain matches the known block chain up to a checkpoint
1496 if (!Checkpoints::CheckBlock(nHeight, hash))
1497 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1499 // Write block to history file
1500 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1501 return error("AcceptBlock() : out of disk space");
1502 unsigned int nFile = -1;
1503 unsigned int nBlockPos = 0;
1504 if (!WriteToDisk(nFile, nBlockPos))
1505 return error("AcceptBlock() : WriteToDisk failed");
1506 if (!AddToBlockIndex(nFile, nBlockPos))
1507 return error("AcceptBlock() : AddToBlockIndex failed");
1509 // Relay inventory, but don't relay old inventory during initial block download
1510 if (hashBestChain == hash)
1511 CRITICAL_BLOCK(cs_vNodes)
1512 BOOST_FOREACH(CNode* pnode, vNodes)
1513 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1514 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1519 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1521 // Check for duplicate
1522 uint256 hash = pblock->GetHash();
1523 if (mapBlockIndex.count(hash))
1524 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1525 if (mapOrphanBlocks.count(hash))
1526 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1528 // Preliminary checks
1529 if (!pblock->CheckBlock())
1530 return error("ProcessBlock() : CheckBlock FAILED");
1532 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1533 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1535 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1536 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1539 pfrom->Misbehaving(100);
1540 return error("ProcessBlock() : block with timestamp before last checkpoint");
1543 bnNewBlock.SetCompact(pblock->nBits);
1545 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1546 if (bnNewBlock > bnRequired)
1548 pfrom->Misbehaving(100);
1549 return error("ProcessBlock() : block with too little proof-of-work");
1554 // If don't already have its previous block, shunt it off to holding area until we get it
1555 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1557 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1558 CBlock* pblock2 = new CBlock(*pblock);
1559 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1560 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1562 // Ask this guy to fill in what we're missing
1564 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1569 if (!pblock->AcceptBlock())
1570 return error("ProcessBlock() : AcceptBlock FAILED");
1572 // Recursively process any orphan blocks that depended on this one
1573 vector<uint256> vWorkQueue;
1574 vWorkQueue.push_back(hash);
1575 for (int i = 0; i < vWorkQueue.size(); i++)
1577 uint256 hashPrev = vWorkQueue[i];
1578 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1579 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1582 CBlock* pblockOrphan = (*mi).second;
1583 if (pblockOrphan->AcceptBlock())
1584 vWorkQueue.push_back(pblockOrphan->GetHash());
1585 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1586 delete pblockOrphan;
1588 mapOrphanBlocksByPrev.erase(hashPrev);
1591 printf("ProcessBlock: ACCEPTED\n");
1602 bool CheckDiskSpace(uint64 nAdditionalBytes)
1604 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1606 // Check for 15MB because database could create another 10MB log file at any time
1607 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1610 string strMessage = _("Warning: Disk space is low ");
1611 strMiscWarning = strMessage;
1612 printf("*** %s\n", strMessage.c_str());
1613 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1614 CreateThread(Shutdown, NULL);
1620 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1624 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1627 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1629 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1638 static unsigned int nCurrentBlockFile = 1;
1640 FILE* AppendBlockFile(unsigned int& nFileRet)
1645 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1648 if (fseek(file, 0, SEEK_END) != 0)
1650 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1651 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1653 nFileRet = nCurrentBlockFile;
1657 nCurrentBlockFile++;
1661 bool LoadBlockIndex(bool fAllowNew)
1665 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1666 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1667 pchMessageStart[0] = 0xfa;
1668 pchMessageStart[1] = 0xbf;
1669 pchMessageStart[2] = 0xb5;
1670 pchMessageStart[3] = 0xda;
1677 if (!txdb.LoadBlockIndex())
1682 // Init with genesis block
1684 if (mapBlockIndex.empty())
1690 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1691 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1692 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1693 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1694 // vMerkleTree: 4a5e1e
1697 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1699 txNew.vin.resize(1);
1700 txNew.vout.resize(1);
1701 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1702 txNew.vout[0].nValue = 50 * COIN;
1703 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1705 block.vtx.push_back(txNew);
1706 block.hashPrevBlock = 0;
1707 block.hashMerkleRoot = block.BuildMerkleTree();
1709 block.nTime = 1231006505;
1710 block.nBits = 0x1d00ffff;
1711 block.nNonce = 2083236893;
1715 block.nTime = 1296688602;
1716 block.nBits = 0x1d07fff8;
1717 block.nNonce = 384568319;
1721 printf("%s\n", block.GetHash().ToString().c_str());
1722 printf("%s\n", hashGenesisBlock.ToString().c_str());
1723 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1724 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1726 assert(block.GetHash() == hashGenesisBlock);
1728 // Start new block file
1730 unsigned int nBlockPos;
1731 if (!block.WriteToDisk(nFile, nBlockPos))
1732 return error("LoadBlockIndex() : writing genesis block to disk failed");
1733 if (!block.AddToBlockIndex(nFile, nBlockPos))
1734 return error("LoadBlockIndex() : genesis block not accepted");
1742 void PrintBlockTree()
1744 // precompute tree structure
1745 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1746 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1748 CBlockIndex* pindex = (*mi).second;
1749 mapNext[pindex->pprev].push_back(pindex);
1751 //while (rand() % 3 == 0)
1752 // mapNext[pindex->pprev].push_back(pindex);
1755 vector<pair<int, CBlockIndex*> > vStack;
1756 vStack.push_back(make_pair(0, pindexGenesisBlock));
1759 while (!vStack.empty())
1761 int nCol = vStack.back().first;
1762 CBlockIndex* pindex = vStack.back().second;
1765 // print split or gap
1766 if (nCol > nPrevCol)
1768 for (int i = 0; i < nCol-1; i++)
1772 else if (nCol < nPrevCol)
1774 for (int i = 0; i < nCol; i++)
1781 for (int i = 0; i < nCol; i++)
1786 block.ReadFromDisk(pindex);
1787 printf("%d (%u,%u) %s %s tx %d",
1791 block.GetHash().ToString().substr(0,20).c_str(),
1792 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1795 PrintWallets(block);
1797 // put the main timechain first
1798 vector<CBlockIndex*>& vNext = mapNext[pindex];
1799 for (int i = 0; i < vNext.size(); i++)
1801 if (vNext[i]->pnext)
1803 swap(vNext[0], vNext[i]);
1809 for (int i = 0; i < vNext.size(); i++)
1810 vStack.push_back(make_pair(nCol+i, vNext[i]));
1823 //////////////////////////////////////////////////////////////////////////////
1828 map<uint256, CAlert> mapAlerts;
1829 CCriticalSection cs_mapAlerts;
1831 string GetWarnings(string strFor)
1834 string strStatusBar;
1836 if (GetBoolArg("-testsafemode"))
1839 // Misc warnings like out of disk space and clock is wrong
1840 if (strMiscWarning != "")
1843 strStatusBar = strMiscWarning;
1846 // Longer invalid proof-of-work chain
1847 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1850 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1854 CRITICAL_BLOCK(cs_mapAlerts)
1856 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1858 const CAlert& alert = item.second;
1859 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1861 nPriority = alert.nPriority;
1862 strStatusBar = alert.strStatusBar;
1867 if (strFor == "statusbar")
1868 return strStatusBar;
1869 else if (strFor == "rpc")
1871 assert(!"GetWarnings() : invalid parameter");
1875 bool CAlert::ProcessAlert()
1877 if (!CheckSignature())
1882 CRITICAL_BLOCK(cs_mapAlerts)
1884 // Cancel previous alerts
1885 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1887 const CAlert& alert = (*mi).second;
1890 printf("cancelling alert %d\n", alert.nID);
1891 mapAlerts.erase(mi++);
1893 else if (!alert.IsInEffect())
1895 printf("expiring alert %d\n", alert.nID);
1896 mapAlerts.erase(mi++);
1902 // Check if this alert has been cancelled
1903 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1905 const CAlert& alert = item.second;
1906 if (alert.Cancels(*this))
1908 printf("alert already cancelled by %d\n", alert.nID);
1914 mapAlerts.insert(make_pair(GetHash(), *this));
1917 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1929 //////////////////////////////////////////////////////////////////////////////
1935 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1939 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1940 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1942 // Don't know what it is, just say we already got one
1949 // The message start string is designed to be unlikely to occur in normal data.
1950 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1951 // a large 4-byte int at any alignment.
1952 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1955 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1957 static map<CService, vector<unsigned char> > mapReuseKey;
1958 RandAddSeedPerfmon();
1960 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1961 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1963 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1965 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1973 if (strCommand == "version")
1975 // Each connection can only send one version message
1976 if (pfrom->nVersion != 0)
1978 pfrom->Misbehaving(1);
1986 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1987 if (pfrom->nVersion == 10300)
1988 pfrom->nVersion = 300;
1989 if (pfrom->nVersion >= 106 && !vRecv.empty())
1990 vRecv >> addrFrom >> nNonce;
1991 if (pfrom->nVersion >= 106 && !vRecv.empty())
1992 vRecv >> pfrom->strSubVer;
1993 if (pfrom->nVersion >= 209 && !vRecv.empty())
1994 vRecv >> pfrom->nStartingHeight;
1996 if (pfrom->nVersion == 0)
1999 // Disconnect if we connected to ourself
2000 if (nNonce == nLocalHostNonce && nNonce > 1)
2002 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2003 pfrom->fDisconnect = true;
2007 // Be shy and don't send version until we hear
2008 if (pfrom->fInbound)
2009 pfrom->PushVersion();
2011 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2013 AddTimeData(pfrom->addr, nTime);
2016 if (pfrom->nVersion >= 209)
2017 pfrom->PushMessage("verack");
2018 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2019 if (pfrom->nVersion < 209)
2020 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2022 if (!pfrom->fInbound)
2024 // Advertise our address
2025 if (addrLocalHost.IsRoutable() && !fUseProxy)
2027 CAddress addr(addrLocalHost);
2028 addr.nTime = GetAdjustedTime();
2029 pfrom->PushAddress(addr);
2032 // Get recent addresses
2033 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2035 pfrom->PushMessage("getaddr");
2036 pfrom->fGetAddr = true;
2040 // Ask the first connected node for block updates
2041 static int nAskedForBlocks = 0;
2042 if (!pfrom->fClient &&
2043 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2044 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2047 pfrom->PushGetBlocks(pindexBest, uint256(0));
2051 CRITICAL_BLOCK(cs_mapAlerts)
2052 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2053 item.second.RelayTo(pfrom);
2055 pfrom->fSuccessfullyConnected = true;
2057 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2059 cPeerBlockCounts.input(pfrom->nStartingHeight);
2063 else if (pfrom->nVersion == 0)
2065 // Must have a version message before anything else
2066 pfrom->Misbehaving(1);
2071 else if (strCommand == "verack")
2073 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2077 else if (strCommand == "addr")
2079 vector<CAddress> vAddr;
2082 // Don't want addr from older versions unless seeding
2083 if (pfrom->nVersion < 209)
2085 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2087 if (vAddr.size() > 1000)
2089 pfrom->Misbehaving(20);
2090 return error("message addr size() = %d", vAddr.size());
2093 // Store the new addresses
2096 int64 nNow = GetAdjustedTime();
2097 int64 nSince = nNow - 10 * 60;
2098 BOOST_FOREACH(CAddress& addr, vAddr)
2102 // ignore IPv6 for now, since it isn't implemented anyway
2105 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2106 addr.nTime = nNow - 5 * 24 * 60 * 60;
2107 AddAddress(addr, 2 * 60 * 60, &addrDB);
2108 pfrom->AddAddressKnown(addr);
2109 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2111 // Relay to a limited number of other nodes
2112 CRITICAL_BLOCK(cs_vNodes)
2114 // Use deterministic randomness to send to the same nodes for 24 hours
2115 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2116 static uint256 hashSalt;
2118 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2119 int64 hashAddr = addr.GetHash();
2120 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2121 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2122 multimap<uint256, CNode*> mapMix;
2123 BOOST_FOREACH(CNode* pnode, vNodes)
2125 if (pnode->nVersion < 31402)
2127 unsigned int nPointer;
2128 memcpy(&nPointer, &pnode, sizeof(nPointer));
2129 uint256 hashKey = hashRand ^ nPointer;
2130 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2131 mapMix.insert(make_pair(hashKey, pnode));
2133 int nRelayNodes = 2;
2134 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2135 ((*mi).second)->PushAddress(addr);
2139 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2140 if (vAddr.size() < 1000)
2141 pfrom->fGetAddr = false;
2145 else if (strCommand == "inv")
2149 if (vInv.size() > 50000)
2151 pfrom->Misbehaving(20);
2152 return error("message inv size() = %d", vInv.size());
2156 BOOST_FOREACH(const CInv& inv, vInv)
2160 pfrom->AddInventoryKnown(inv);
2162 bool fAlreadyHave = AlreadyHave(txdb, inv);
2164 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2168 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2169 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2171 // Track requests for our stuff
2172 Inventory(inv.hash);
2177 else if (strCommand == "getdata")
2181 if (vInv.size() > 50000)
2183 pfrom->Misbehaving(20);
2184 return error("message getdata size() = %d", vInv.size());
2187 BOOST_FOREACH(const CInv& inv, vInv)
2191 printf("received getdata for: %s\n", inv.ToString().c_str());
2193 if (inv.type == MSG_BLOCK)
2195 // Send block from disk
2196 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2197 if (mi != mapBlockIndex.end())
2200 block.ReadFromDisk((*mi).second);
2201 pfrom->PushMessage("block", block);
2203 // Trigger them to send a getblocks request for the next batch of inventory
2204 if (inv.hash == pfrom->hashContinue)
2206 // Bypass PushInventory, this must send even if redundant,
2207 // and we want it right after the last block so they don't
2208 // wait for other stuff first.
2210 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2211 pfrom->PushMessage("inv", vInv);
2212 pfrom->hashContinue = 0;
2216 else if (inv.IsKnownType())
2218 // Send stream from relay memory
2219 CRITICAL_BLOCK(cs_mapRelay)
2221 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2222 if (mi != mapRelay.end())
2223 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2227 // Track requests for our stuff
2228 Inventory(inv.hash);
2233 else if (strCommand == "getblocks")
2235 CBlockLocator locator;
2237 vRecv >> locator >> hashStop;
2239 // Find the last block the caller has in the main chain
2240 CBlockIndex* pindex = locator.GetBlockIndex();
2242 // Send the rest of the chain
2244 pindex = pindex->pnext;
2245 int nLimit = 500 + locator.GetDistanceBack();
2246 unsigned int nBytes = 0;
2247 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2248 for (; pindex; pindex = pindex->pnext)
2250 if (pindex->GetBlockHash() == hashStop)
2252 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2255 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2257 block.ReadFromDisk(pindex, true);
2258 nBytes += block.GetSerializeSize(SER_NETWORK);
2259 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2261 // When this block is requested, we'll send an inv that'll make them
2262 // getblocks the next batch of inventory.
2263 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2264 pfrom->hashContinue = pindex->GetBlockHash();
2271 else if (strCommand == "getheaders")
2273 CBlockLocator locator;
2275 vRecv >> locator >> hashStop;
2277 CBlockIndex* pindex = NULL;
2278 if (locator.IsNull())
2280 // If locator is null, return the hashStop block
2281 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2282 if (mi == mapBlockIndex.end())
2284 pindex = (*mi).second;
2288 // Find the last block the caller has in the main chain
2289 pindex = locator.GetBlockIndex();
2291 pindex = pindex->pnext;
2294 vector<CBlock> vHeaders;
2295 int nLimit = 2000 + locator.GetDistanceBack();
2296 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2297 for (; pindex; pindex = pindex->pnext)
2299 vHeaders.push_back(pindex->GetBlockHeader());
2300 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2303 pfrom->PushMessage("headers", vHeaders);
2307 else if (strCommand == "tx")
2309 vector<uint256> vWorkQueue;
2310 CDataStream vMsg(vRecv);
2314 CInv inv(MSG_TX, tx.GetHash());
2315 pfrom->AddInventoryKnown(inv);
2317 bool fMissingInputs = false;
2318 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2320 SyncWithWallets(tx, NULL, true);
2321 RelayMessage(inv, vMsg);
2322 mapAlreadyAskedFor.erase(inv);
2323 vWorkQueue.push_back(inv.hash);
2325 // Recursively process any orphan transactions that depended on this one
2326 for (int i = 0; i < vWorkQueue.size(); i++)
2328 uint256 hashPrev = vWorkQueue[i];
2329 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2330 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2333 const CDataStream& vMsg = *((*mi).second);
2335 CDataStream(vMsg) >> tx;
2336 CInv inv(MSG_TX, tx.GetHash());
2338 if (tx.AcceptToMemoryPool(true))
2340 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2341 SyncWithWallets(tx, NULL, true);
2342 RelayMessage(inv, vMsg);
2343 mapAlreadyAskedFor.erase(inv);
2344 vWorkQueue.push_back(inv.hash);
2349 BOOST_FOREACH(uint256 hash, vWorkQueue)
2350 EraseOrphanTx(hash);
2352 else if (fMissingInputs)
2354 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2357 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2361 else if (strCommand == "block")
2366 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2369 CInv inv(MSG_BLOCK, block.GetHash());
2370 pfrom->AddInventoryKnown(inv);
2372 if (ProcessBlock(pfrom, &block))
2373 mapAlreadyAskedFor.erase(inv);
2374 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2378 else if (strCommand == "getaddr")
2380 // Nodes rebroadcast an addr every 24 hours
2381 pfrom->vAddrToSend.clear();
2382 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2383 CRITICAL_BLOCK(cs_mapAddresses)
2385 unsigned int nCount = 0;
2386 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2388 const CAddress& addr = item.second;
2389 if (addr.nTime > nSince)
2392 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2394 const CAddress& addr = item.second;
2395 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2396 pfrom->PushAddress(addr);
2402 else if (strCommand == "checkorder")
2407 if (!GetBoolArg("-allowreceivebyip"))
2409 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2416 /// we have a chance to check the order here
2418 // Keep giving the same key to the same ip until they use it
2419 if (!mapReuseKey.count(pfrom->addr))
2420 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2422 // Send back approval of order and pubkey to use
2423 CScript scriptPubKey;
2424 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2425 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2429 else if (strCommand == "reply")
2434 CRequestTracker tracker;
2435 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2437 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2438 if (mi != pfrom->mapRequests.end())
2440 tracker = (*mi).second;
2441 pfrom->mapRequests.erase(mi);
2444 if (!tracker.IsNull())
2445 tracker.fn(tracker.param1, vRecv);
2449 else if (strCommand == "ping")
2454 else if (strCommand == "alert")
2459 if (alert.ProcessAlert())
2462 pfrom->setKnown.insert(alert.GetHash());
2463 CRITICAL_BLOCK(cs_vNodes)
2464 BOOST_FOREACH(CNode* pnode, vNodes)
2465 alert.RelayTo(pnode);
2472 // Ignore unknown commands for extensibility
2476 // Update the last seen time for this node's address
2477 if (pfrom->fNetworkNode)
2478 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2479 AddressCurrentlyConnected(pfrom->addr);
2485 bool ProcessMessages(CNode* pfrom)
2487 CDataStream& vRecv = pfrom->vRecv;
2491 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2495 // (4) message start
2504 // Scan for message start
2505 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2506 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2507 if (vRecv.end() - pstart < nHeaderSize)
2509 if (vRecv.size() > nHeaderSize)
2511 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2512 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2516 if (pstart - vRecv.begin() > 0)
2517 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2518 vRecv.erase(vRecv.begin(), pstart);
2521 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2526 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2529 string strCommand = hdr.GetCommand();
2532 unsigned int nMessageSize = hdr.nMessageSize;
2533 if (nMessageSize > MAX_SIZE)
2535 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2538 if (nMessageSize > vRecv.size())
2540 // Rewind and wait for rest of message
2541 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2546 if (vRecv.GetVersion() >= 209)
2548 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2549 unsigned int nChecksum = 0;
2550 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2551 if (nChecksum != hdr.nChecksum)
2553 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2554 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2559 // Copy message to its own buffer
2560 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2561 vRecv.ignore(nMessageSize);
2567 CRITICAL_BLOCK(cs_main)
2568 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2572 catch (std::ios_base::failure& e)
2574 if (strstr(e.what(), "end of data"))
2576 // Allow exceptions from underlength message on vRecv
2577 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());
2579 else if (strstr(e.what(), "size too large"))
2581 // Allow exceptions from overlong size
2582 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2586 PrintExceptionContinue(&e, "ProcessMessage()");
2589 catch (std::exception& e) {
2590 PrintExceptionContinue(&e, "ProcessMessage()");
2592 PrintExceptionContinue(NULL, "ProcessMessage()");
2596 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2604 bool SendMessages(CNode* pto, bool fSendTrickle)
2606 CRITICAL_BLOCK(cs_main)
2608 // Don't send anything until we get their version message
2609 if (pto->nVersion == 0)
2613 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2614 pto->PushMessage("ping");
2616 // Resend wallet transactions that haven't gotten in a block yet
2617 ResendWalletTransactions();
2619 // Address refresh broadcast
2620 static int64 nLastRebroadcast;
2621 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2623 nLastRebroadcast = GetTime();
2624 CRITICAL_BLOCK(cs_vNodes)
2626 BOOST_FOREACH(CNode* pnode, vNodes)
2628 // Periodically clear setAddrKnown to allow refresh broadcasts
2629 pnode->setAddrKnown.clear();
2631 // Rebroadcast our address
2632 if (addrLocalHost.IsRoutable() && !fUseProxy)
2634 CAddress addr(addrLocalHost);
2635 addr.nTime = GetAdjustedTime();
2636 pnode->PushAddress(addr);
2642 // Clear out old addresses periodically so it's not too much work at once
2643 static int64 nLastClear;
2644 if (nLastClear == 0)
2645 nLastClear = GetTime();
2646 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2648 nLastClear = GetTime();
2649 CRITICAL_BLOCK(cs_mapAddresses)
2652 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2653 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2654 mi != mapAddresses.end();)
2656 const CAddress& addr = (*mi).second;
2657 if (addr.nTime < nSince)
2659 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2661 addrdb.EraseAddress(addr);
2662 mapAddresses.erase(mi++);
2676 vector<CAddress> vAddr;
2677 vAddr.reserve(pto->vAddrToSend.size());
2678 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2680 // returns true if wasn't already contained in the set
2681 if (pto->setAddrKnown.insert(addr).second)
2683 vAddr.push_back(addr);
2684 // receiver rejects addr messages larger than 1000
2685 if (vAddr.size() >= 1000)
2687 pto->PushMessage("addr", vAddr);
2692 pto->vAddrToSend.clear();
2694 pto->PushMessage("addr", vAddr);
2699 // Message: inventory
2702 vector<CInv> vInvWait;
2703 CRITICAL_BLOCK(pto->cs_inventory)
2705 vInv.reserve(pto->vInventoryToSend.size());
2706 vInvWait.reserve(pto->vInventoryToSend.size());
2707 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2709 if (pto->setInventoryKnown.count(inv))
2712 // trickle out tx inv to protect privacy
2713 if (inv.type == MSG_TX && !fSendTrickle)
2715 // 1/4 of tx invs blast to all immediately
2716 static uint256 hashSalt;
2718 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2719 uint256 hashRand = inv.hash ^ hashSalt;
2720 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2721 bool fTrickleWait = ((hashRand & 3) != 0);
2723 // always trickle our own transactions
2727 if (GetTransaction(inv.hash, wtx))
2729 fTrickleWait = true;
2734 vInvWait.push_back(inv);
2739 // returns true if wasn't already contained in the set
2740 if (pto->setInventoryKnown.insert(inv).second)
2742 vInv.push_back(inv);
2743 if (vInv.size() >= 1000)
2745 pto->PushMessage("inv", vInv);
2750 pto->vInventoryToSend = vInvWait;
2753 pto->PushMessage("inv", vInv);
2759 vector<CInv> vGetData;
2760 int64 nNow = GetTime() * 1000000;
2762 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2764 const CInv& inv = (*pto->mapAskFor.begin()).second;
2765 if (!AlreadyHave(txdb, inv))
2767 printf("sending getdata: %s\n", inv.ToString().c_str());
2768 vGetData.push_back(inv);
2769 if (vGetData.size() >= 1000)
2771 pto->PushMessage("getdata", vGetData);
2775 mapAlreadyAskedFor[inv] = nNow;
2776 pto->mapAskFor.erase(pto->mapAskFor.begin());
2778 if (!vGetData.empty())
2779 pto->PushMessage("getdata", vGetData);
2798 //////////////////////////////////////////////////////////////////////////////
2803 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2805 unsigned char* pdata = (unsigned char*)pbuffer;
2806 unsigned int blocks = 1 + ((len + 8) / 64);
2807 unsigned char* pend = pdata + 64 * blocks;
2808 memset(pdata + len, 0, 64 * blocks - len);
2810 unsigned int bits = len * 8;
2811 pend[-1] = (bits >> 0) & 0xff;
2812 pend[-2] = (bits >> 8) & 0xff;
2813 pend[-3] = (bits >> 16) & 0xff;
2814 pend[-4] = (bits >> 24) & 0xff;
2818 static const unsigned int pSHA256InitState[8] =
2819 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2821 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2824 unsigned char data[64];
2828 for (int i = 0; i < 16; i++)
2829 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2831 for (int i = 0; i < 8; i++)
2832 ctx.h[i] = ((uint32_t*)pinit)[i];
2834 SHA256_Update(&ctx, data, sizeof(data));
2835 for (int i = 0; i < 8; i++)
2836 ((uint32_t*)pstate)[i] = ctx.h[i];
2840 // ScanHash scans nonces looking for a hash with at least some zero bits.
2841 // It operates on big endian data. Caller does the byte reversing.
2842 // All input buffers are 16-byte aligned. nNonce is usually preserved
2843 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2844 // the block is rebuilt and nNonce starts over at zero.
2846 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2848 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2852 // Hash pdata using pmidstate as the starting state into
2853 // preformatted buffer phash1, then hash phash1 into phash
2855 SHA256Transform(phash1, pdata, pmidstate);
2856 SHA256Transform(phash, phash1, pSHA256InitState);
2858 // Return the nonce if the hash has at least some zero bits,
2859 // caller will check if it has enough to reach the target
2860 if (((unsigned short*)phash)[14] == 0)
2863 // If nothing found after trying for a while, return -1
2864 if ((nNonce & 0xffff) == 0)
2866 nHashesDone = 0xffff+1;
2872 // Some explaining would be appreciated
2877 set<uint256> setDependsOn;
2880 COrphan(CTransaction* ptxIn)
2888 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2889 BOOST_FOREACH(uint256 hash, setDependsOn)
2890 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2895 uint64 nLastBlockTx = 0;
2896 uint64 nLastBlockSize = 0;
2898 CBlock* CreateNewBlock(CReserveKey& reservekey)
2900 CBlockIndex* pindexPrev = pindexBest;
2903 auto_ptr<CBlock> pblock(new CBlock());
2907 // Create coinbase tx
2909 txNew.vin.resize(1);
2910 txNew.vin[0].prevout.SetNull();
2911 txNew.vout.resize(1);
2912 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2914 // Add our coinbase tx as first transaction
2915 pblock->vtx.push_back(txNew);
2917 // Collect memory pool transactions into the block
2919 CRITICAL_BLOCK(cs_main)
2920 CRITICAL_BLOCK(cs_mapTransactions)
2924 // Priority order to process transactions
2925 list<COrphan> vOrphan; // list memory doesn't move
2926 map<uint256, vector<COrphan*> > mapDependers;
2927 multimap<double, CTransaction*> mapPriority;
2928 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2930 CTransaction& tx = (*mi).second;
2931 if (tx.IsCoinBase() || !tx.IsFinal())
2934 COrphan* porphan = NULL;
2935 double dPriority = 0;
2936 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2938 // Read prev transaction
2939 CTransaction txPrev;
2941 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2943 // Has to wait for dependencies
2946 // Use list for automatic deletion
2947 vOrphan.push_back(COrphan(&tx));
2948 porphan = &vOrphan.back();
2950 mapDependers[txin.prevout.hash].push_back(porphan);
2951 porphan->setDependsOn.insert(txin.prevout.hash);
2954 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2956 // Read block header
2957 int nConf = txindex.GetDepthInMainChain();
2959 dPriority += (double)nValueIn * nConf;
2961 if (fDebug && GetBoolArg("-printpriority"))
2962 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2965 // Priority is sum(valuein * age) / txsize
2966 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2969 porphan->dPriority = dPriority;
2971 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2973 if (fDebug && GetBoolArg("-printpriority"))
2975 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2982 // Collect transactions into block
2983 map<uint256, CTxIndex> mapTestPool;
2984 uint64 nBlockSize = 1000;
2985 uint64 nBlockTx = 0;
2986 int nBlockSigOps = 100;
2987 while (!mapPriority.empty())
2989 // Take highest priority transaction off priority queue
2990 double dPriority = -(*mapPriority.begin()).first;
2991 CTransaction& tx = *(*mapPriority.begin()).second;
2992 mapPriority.erase(mapPriority.begin());
2995 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2996 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2999 // Transaction fee required depends on block size
3000 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3001 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3003 // Connecting shouldn't fail due to dependency on other memory pool transactions
3004 // because we're already processing them in order of dependency
3005 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3006 map<uint256, pair<CTxIndex, CTransaction> > mapInputs;
3007 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs))
3010 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nTxSigOps, nMinFee))
3012 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3014 swap(mapTestPool, mapTestPoolTmp);
3017 pblock->vtx.push_back(tx);
3018 nBlockSize += nTxSize;
3019 nBlockSigOps += nTxSigOps;
3022 // Add transactions that depend on this one to the priority queue
3023 uint256 hash = tx.GetHash();
3024 if (mapDependers.count(hash))
3026 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3028 if (!porphan->setDependsOn.empty())
3030 porphan->setDependsOn.erase(hash);
3031 if (porphan->setDependsOn.empty())
3032 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3038 nLastBlockTx = nBlockTx;
3039 nLastBlockSize = nBlockSize;
3040 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3043 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3046 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3047 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3048 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3049 pblock->nBits = GetNextWorkRequired(pindexPrev);
3052 return pblock.release();
3056 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3058 // Update nExtraNonce
3059 static uint256 hashPrevBlock;
3060 if (hashPrevBlock != pblock->hashPrevBlock)
3063 hashPrevBlock = pblock->hashPrevBlock;
3066 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3068 // Put "OP_EVAL" in the coinbase so everybody can tell when
3069 // a majority of miners support it
3070 const char* pOpEvalName = GetOpName(OP_EVAL);
3071 pblock->vtx[0].vin[0].scriptSig += CScript() << std::vector<unsigned char>(pOpEvalName, pOpEvalName+strlen(pOpEvalName));
3072 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3074 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3078 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3081 // Prebuild hash buffers
3088 uint256 hashPrevBlock;
3089 uint256 hashMerkleRoot;
3092 unsigned int nNonce;
3095 unsigned char pchPadding0[64];
3097 unsigned char pchPadding1[64];
3100 memset(&tmp, 0, sizeof(tmp));
3102 tmp.block.nVersion = pblock->nVersion;
3103 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3104 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3105 tmp.block.nTime = pblock->nTime;
3106 tmp.block.nBits = pblock->nBits;
3107 tmp.block.nNonce = pblock->nNonce;
3109 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3110 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3112 // Byte swap all the input buffer
3113 for (int i = 0; i < sizeof(tmp)/4; i++)
3114 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3116 // Precalc the first half of the first hash, which stays constant
3117 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3119 memcpy(pdata, &tmp.block, 128);
3120 memcpy(phash1, &tmp.hash1, 64);
3124 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3126 uint256 hash = pblock->GetHash();
3127 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3129 if (hash > hashTarget)
3133 printf("BitcoinMiner:\n");
3134 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3136 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3137 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3140 CRITICAL_BLOCK(cs_main)
3142 if (pblock->hashPrevBlock != hashBestChain)
3143 return error("BitcoinMiner : generated block is stale");
3145 // Remove key from key pool
3146 reservekey.KeepKey();
3148 // Track how many getdata requests this block gets
3149 CRITICAL_BLOCK(wallet.cs_wallet)
3150 wallet.mapRequestCount[pblock->GetHash()] = 0;
3152 // Process this block the same as if we had received it from another node
3153 if (!ProcessBlock(NULL, pblock))
3154 return error("BitcoinMiner : ProcessBlock, block not accepted");
3160 void static ThreadBitcoinMiner(void* parg);
3162 void static BitcoinMiner(CWallet *pwallet)
3164 printf("BitcoinMiner started\n");
3165 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3167 // Each thread has its own key and counter
3168 CReserveKey reservekey(pwallet);
3169 unsigned int nExtraNonce = 0;
3171 while (fGenerateBitcoins)
3173 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3177 while (vNodes.empty() || IsInitialBlockDownload())
3182 if (!fGenerateBitcoins)
3190 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3191 CBlockIndex* pindexPrev = pindexBest;
3193 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3196 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3198 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3202 // Prebuild hash buffers
3204 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3205 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3206 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3208 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3210 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3211 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3217 int64 nStart = GetTime();
3218 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3220 uint256& hash = *alignup<16>(hashbuf);
3223 unsigned int nHashesDone = 0;
3224 unsigned int nNonceFound;
3227 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3228 (char*)&hash, nHashesDone);
3230 // Check if something found
3231 if (nNonceFound != -1)
3233 for (int i = 0; i < sizeof(hash)/4; i++)
3234 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3236 if (hash <= hashTarget)
3239 pblock->nNonce = ByteReverse(nNonceFound);
3240 assert(hash == pblock->GetHash());
3242 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3243 CheckWork(pblock.get(), *pwalletMain, reservekey);
3244 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3250 static int64 nHashCounter;
3251 if (nHPSTimerStart == 0)
3253 nHPSTimerStart = GetTimeMillis();
3257 nHashCounter += nHashesDone;
3258 if (GetTimeMillis() - nHPSTimerStart > 4000)
3260 static CCriticalSection cs;
3263 if (GetTimeMillis() - nHPSTimerStart > 4000)
3265 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3266 nHPSTimerStart = GetTimeMillis();
3268 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3269 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3270 static int64 nLogTime;
3271 if (GetTime() - nLogTime > 30 * 60)
3273 nLogTime = GetTime();
3274 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3275 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3281 // Check for stop or if block needs to be rebuilt
3284 if (!fGenerateBitcoins)
3286 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3290 if (nBlockNonce >= 0xffff0000)
3292 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3294 if (pindexPrev != pindexBest)
3297 // Update nTime every few seconds
3298 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3299 nBlockTime = ByteReverse(pblock->nTime);
3304 void static ThreadBitcoinMiner(void* parg)
3306 CWallet* pwallet = (CWallet*)parg;
3309 vnThreadsRunning[3]++;
3310 BitcoinMiner(pwallet);
3311 vnThreadsRunning[3]--;
3313 catch (std::exception& e) {
3314 vnThreadsRunning[3]--;
3315 PrintException(&e, "ThreadBitcoinMiner()");
3317 vnThreadsRunning[3]--;
3318 PrintException(NULL, "ThreadBitcoinMiner()");
3320 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3322 if (vnThreadsRunning[3] == 0)
3324 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3328 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3330 if (fGenerateBitcoins != fGenerate)
3332 fGenerateBitcoins = fGenerate;
3333 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3336 if (fGenerateBitcoins)
3338 int nProcessors = boost::thread::hardware_concurrency();
3339 printf("%d processors\n", nProcessors);
3340 if (nProcessors < 1)
3342 if (fLimitProcessors && nProcessors > nLimitProcessors)
3343 nProcessors = nLimitProcessors;
3344 int nAddThreads = nProcessors - vnThreadsRunning[3];
3345 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3346 for (int i = 0; i < nAddThreads; i++)
3348 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3349 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");