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 bool CTransaction::AddToMemoryPoolUnchecked()
564 // Add to memory pool without checking anything. Don't call this directly,
565 // call AcceptToMemoryPool to properly check the transaction first.
566 CRITICAL_BLOCK(cs_mapTransactions)
568 uint256 hash = GetHash();
569 mapTransactions[hash] = *this;
570 for (int i = 0; i < vin.size(); i++)
571 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
572 nTransactionsUpdated++;
578 bool CTransaction::RemoveFromMemoryPool()
580 // Remove transaction from memory pool
581 CRITICAL_BLOCK(cs_mapTransactions)
583 BOOST_FOREACH(const CTxIn& txin, vin)
584 mapNextTx.erase(txin.prevout);
585 mapTransactions.erase(GetHash());
586 nTransactionsUpdated++;
596 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
598 if (hashBlock == 0 || nIndex == -1)
601 // Find the block it claims to be in
602 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
603 if (mi == mapBlockIndex.end())
605 CBlockIndex* pindex = (*mi).second;
606 if (!pindex || !pindex->IsInMainChain())
609 // Make sure the merkle branch connects to this block
610 if (!fMerkleVerified)
612 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
614 fMerkleVerified = true;
618 return pindexBest->nHeight - pindex->nHeight + 1;
622 int CMerkleTx::GetBlocksToMaturity() const
626 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
630 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
634 if (!IsInMainChain() && !ClientConnectInputs())
636 return CTransaction::AcceptToMemoryPool(txdb, false);
640 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
644 bool CMerkleTx::AcceptToMemoryPool()
647 return AcceptToMemoryPool(txdb);
652 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
654 CRITICAL_BLOCK(cs_mapTransactions)
656 // Add previous supporting transactions first
657 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
659 if (!tx.IsCoinBase())
661 uint256 hash = tx.GetHash();
662 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
663 tx.AcceptToMemoryPool(txdb, fCheckInputs);
666 return AcceptToMemoryPool(txdb, fCheckInputs);
671 bool CWalletTx::AcceptWalletTransaction()
674 return AcceptWalletTransaction(txdb);
677 int CTxIndex::GetDepthInMainChain() const
681 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
683 // Find the block in the index
684 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
685 if (mi == mapBlockIndex.end())
687 CBlockIndex* pindex = (*mi).second;
688 if (!pindex || !pindex->IsInMainChain())
690 return 1 + nBestHeight - pindex->nHeight;
702 //////////////////////////////////////////////////////////////////////////////
704 // CBlock and CBlockIndex
707 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
709 if (!fReadTransactions)
711 *this = pindex->GetBlockHeader();
714 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
716 if (GetHash() != pindex->GetBlockHash())
717 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
721 uint256 static GetOrphanRoot(const CBlock* pblock)
723 // Work back to the first block in the orphan chain
724 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
725 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
726 return pblock->GetHash();
729 int64 static GetBlockValue(int nHeight, int64 nFees)
731 int64 nSubsidy = 50 * COIN;
733 // Subsidy is cut in half every 4 years
734 nSubsidy >>= (nHeight / 210000);
736 return nSubsidy + nFees;
739 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
740 static const int64 nTargetSpacing = 10 * 60;
741 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
744 // minimum amount of work that could possibly be required nTime after
745 // minimum work required was nBase
747 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
750 bnResult.SetCompact(nBase);
751 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
753 // Maximum 400% adjustment...
755 // ... in best-case exactly 4-times-normal target time
756 nTime -= nTargetTimespan*4;
758 if (bnResult > bnProofOfWorkLimit)
759 bnResult = bnProofOfWorkLimit;
760 return bnResult.GetCompact();
763 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
767 if (pindexLast == NULL)
768 return bnProofOfWorkLimit.GetCompact();
770 // Only change once per interval
771 if ((pindexLast->nHeight+1) % nInterval != 0)
772 return pindexLast->nBits;
774 // Go back by what we want to be 14 days worth of blocks
775 const CBlockIndex* pindexFirst = pindexLast;
776 for (int i = 0; pindexFirst && i < nInterval-1; i++)
777 pindexFirst = pindexFirst->pprev;
780 // Limit adjustment step
781 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
782 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
783 if (nActualTimespan < nTargetTimespan/4)
784 nActualTimespan = nTargetTimespan/4;
785 if (nActualTimespan > nTargetTimespan*4)
786 nActualTimespan = nTargetTimespan*4;
790 bnNew.SetCompact(pindexLast->nBits);
791 bnNew *= nActualTimespan;
792 bnNew /= nTargetTimespan;
794 if (bnNew > bnProofOfWorkLimit)
795 bnNew = bnProofOfWorkLimit;
798 printf("GetNextWorkRequired RETARGET\n");
799 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
800 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
801 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
803 return bnNew.GetCompact();
806 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
809 bnTarget.SetCompact(nBits);
812 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
813 return error("CheckProofOfWork() : nBits below minimum work");
815 // Check proof of work matches claimed amount
816 if (hash > bnTarget.getuint256())
817 return error("CheckProofOfWork() : hash doesn't match nBits");
822 // Return maximum amount of blocks that other nodes claim to have
823 int GetNumBlocksOfPeers()
825 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
828 bool IsInitialBlockDownload()
830 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
832 static int64 nLastUpdate;
833 static CBlockIndex* pindexLastBest;
834 if (pindexBest != pindexLastBest)
836 pindexLastBest = pindexBest;
837 nLastUpdate = GetTime();
839 return (GetTime() - nLastUpdate < 10 &&
840 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
843 void static InvalidChainFound(CBlockIndex* pindexNew)
845 if (pindexNew->bnChainWork > bnBestInvalidWork)
847 bnBestInvalidWork = pindexNew->bnChainWork;
848 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
851 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());
852 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
853 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
854 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
867 bool CTransaction::DisconnectInputs(CTxDB& txdb)
869 // Relinquish previous transactions' spent pointers
872 BOOST_FOREACH(const CTxIn& txin, vin)
874 COutPoint prevout = txin.prevout;
876 // Get prev txindex from disk
878 if (!txdb.ReadTxIndex(prevout.hash, txindex))
879 return error("DisconnectInputs() : ReadTxIndex failed");
881 if (prevout.n >= txindex.vSpent.size())
882 return error("DisconnectInputs() : prevout.n out of range");
884 // Mark outpoint as not spent
885 txindex.vSpent[prevout.n].SetNull();
888 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
889 return error("DisconnectInputs() : UpdateTxIndex failed");
893 // Remove transaction from index
894 if (!txdb.EraseTxIndex(*this))
895 return error("DisconnectInputs() : EraseTxPos failed");
901 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
902 bool fBlock, bool fMiner, map<uint256, pair<CTxIndex, CTransaction> >& inputsRet)
905 return true; // Coinbase transactions have no inputs to fetch.
907 for (int i = 0; i < vin.size(); i++)
909 COutPoint prevout = vin[i].prevout;
910 if (inputsRet.count(prevout.hash))
911 continue; // Got it already
914 CTxIndex& txindex = inputsRet[prevout.hash].first;
916 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
918 // Get txindex from current proposed changes
919 txindex = mapTestPool.find(prevout.hash)->second;
923 // Read txindex from txdb
924 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
926 if (!fFound && (fBlock || fMiner))
927 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());
930 CTransaction& txPrev = inputsRet[prevout.hash].second;
931 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
933 // Get prev tx from single transactions in memory
934 CRITICAL_BLOCK(cs_mapTransactions)
936 if (!mapTransactions.count(prevout.hash))
937 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
938 txPrev = mapTransactions[prevout.hash];
941 txindex.vSpent.resize(txPrev.vout.size());
945 // Get prev tx from disk
946 if (!txPrev.ReadFromDisk(txindex.pos))
947 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
951 // Make sure all prevout.n's are valid:
952 for (int i = 0; i < vin.size(); i++)
954 const COutPoint prevout = vin[i].prevout;
955 const CTxIndex& txindex = inputsRet[prevout.hash].first;
956 const CTransaction& txPrev = inputsRet[prevout.hash].second;
957 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
958 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()));
964 bool CTransaction::ConnectInputs(map<uint256, pair<CTxIndex, CTransaction> > inputs,
965 map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
966 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int& nSigOpsRet, int64 nMinFee)
968 // Take over previous transactions' spent pointers
969 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
970 // fMiner is true when called from the internal bitcoin miner
971 // ... both are false when called from CTransaction::AcceptToMemoryPool
975 for (int i = 0; i < vin.size(); i++)
977 COutPoint prevout = vin[i].prevout;
978 assert(inputs.count(prevout.hash) > 0);
979 CTxIndex& txindex = inputs[prevout.hash].first;
980 CTransaction& txPrev = inputs[prevout.hash].second;
982 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
983 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()));
985 // If prev is coinbase, check that it's matured
986 if (txPrev.IsCoinBase())
987 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
988 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
989 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
991 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
992 // before the last blockchain checkpoint. This is safe because block merkle hashes are
993 // still computed and checked, and any change will be caught at the next checkpoint.
994 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
996 bool fStrictOpEval = true;
997 // This code should be removed when OP_EVAL has
998 // a majority of hashing power on the network.
1001 // To avoid being on the short end of a block-chain split,
1002 // interpret OP_EVAL as a NO_OP until blocks with timestamps
1003 // after opevaltime:
1004 int64 nEvalSwitchTime = GetArg("opevaltime", 1328054400); // Feb 1, 2012
1005 fStrictOpEval = (pindexBlock->nTime >= nEvalSwitchTime);
1007 // if !fBlock, then always be strict-- don't accept
1008 // invalid-under-new-rules OP_EVAL transactions into
1009 // our memory pool (don't relay them, don't include them
1010 // in blocks we mine).
1013 if (!VerifySignature(txPrev, *this, i, nSigOpsRet, fStrictOpEval))
1014 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1017 // Check for conflicts (double-spend)
1018 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1019 // for an attacker to attempt to split the network.
1020 if (!txindex.vSpent[prevout.n].IsNull())
1021 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());
1023 // Check for negative or overflow input values
1024 nValueIn += txPrev.vout[prevout.n].nValue;
1025 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1026 return DoS(100, error("ConnectInputs() : txin values out of range"));
1028 // Mark outpoints as spent
1029 txindex.vSpent[prevout.n] = posThisTx;
1032 if (fBlock || fMiner)
1034 mapTestPool[prevout.hash] = txindex;
1038 if (nValueIn < GetValueOut())
1039 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1041 // Tally transaction fees
1042 int64 nTxFee = nValueIn - GetValueOut();
1044 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1045 if (nTxFee < nMinFee)
1048 if (!MoneyRange(nFees))
1049 return DoS(100, error("ConnectInputs() : nFees out of range"));
1054 // Add transaction to changes
1055 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
1059 // Add transaction to test pool
1060 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
1067 bool CTransaction::ClientConnectInputs()
1072 // Take over previous transactions' spent pointers
1073 CRITICAL_BLOCK(cs_mapTransactions)
1076 for (int i = 0; i < vin.size(); i++)
1078 // Get prev tx from single transactions in memory
1079 COutPoint prevout = vin[i].prevout;
1080 if (!mapTransactions.count(prevout.hash))
1082 CTransaction& txPrev = mapTransactions[prevout.hash];
1084 if (prevout.n >= txPrev.vout.size())
1089 if (!VerifySignature(txPrev, *this, i, nUnused, false))
1090 return error("ConnectInputs() : VerifySignature failed");
1092 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1093 ///// this has to go away now that posNext is gone
1094 // // Check for conflicts
1095 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1096 // return error("ConnectInputs() : prev tx already used");
1098 // // Flag outpoints as used
1099 // txPrev.vout[prevout.n].posNext = posThisTx;
1101 nValueIn += txPrev.vout[prevout.n].nValue;
1103 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1104 return error("ClientConnectInputs() : txin values out of range");
1106 if (GetValueOut() > nValueIn)
1116 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1118 // Disconnect in reverse order
1119 for (int i = vtx.size()-1; i >= 0; i--)
1120 if (!vtx[i].DisconnectInputs(txdb))
1123 // Update block index on disk without changing it in memory.
1124 // The memory index structure will be changed after the db commits.
1127 CDiskBlockIndex blockindexPrev(pindex->pprev);
1128 blockindexPrev.hashNext = 0;
1129 if (!txdb.WriteBlockIndex(blockindexPrev))
1130 return error("DisconnectBlock() : WriteBlockIndex failed");
1136 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1138 // Check it again in case a previous version let a bad block in
1142 //// issue here: it doesn't know the version
1143 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1145 map<uint256, CTxIndex> mapQueuedChanges;
1148 BOOST_FOREACH(CTransaction& tx, vtx)
1150 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1151 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1153 map<uint256, pair<CTxIndex, CTransaction> > mapInputs;
1154 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs))
1156 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, nFees, true, false, nSigOps))
1158 if (nSigOps > MAX_BLOCK_SIGOPS)
1159 return DoS(100, error("ConnectBlock() : too many sigops"));
1162 // Write queued txindex changes
1163 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1165 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1166 return error("ConnectBlock() : UpdateTxIndex failed");
1169 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1172 // Update block index on disk without changing it in memory.
1173 // The memory index structure will be changed after the db commits.
1176 CDiskBlockIndex blockindexPrev(pindex->pprev);
1177 blockindexPrev.hashNext = pindex->GetBlockHash();
1178 if (!txdb.WriteBlockIndex(blockindexPrev))
1179 return error("ConnectBlock() : WriteBlockIndex failed");
1182 // Watch for transactions paying to me
1183 BOOST_FOREACH(CTransaction& tx, vtx)
1184 SyncWithWallets(tx, this, true);
1189 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1191 printf("REORGANIZE\n");
1194 CBlockIndex* pfork = pindexBest;
1195 CBlockIndex* plonger = pindexNew;
1196 while (pfork != plonger)
1198 while (plonger->nHeight > pfork->nHeight)
1199 if (!(plonger = plonger->pprev))
1200 return error("Reorganize() : plonger->pprev is null");
1201 if (pfork == plonger)
1203 if (!(pfork = pfork->pprev))
1204 return error("Reorganize() : pfork->pprev is null");
1207 // List of what to disconnect
1208 vector<CBlockIndex*> vDisconnect;
1209 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1210 vDisconnect.push_back(pindex);
1212 // List of what to connect
1213 vector<CBlockIndex*> vConnect;
1214 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1215 vConnect.push_back(pindex);
1216 reverse(vConnect.begin(), vConnect.end());
1218 // Disconnect shorter branch
1219 vector<CTransaction> vResurrect;
1220 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1223 if (!block.ReadFromDisk(pindex))
1224 return error("Reorganize() : ReadFromDisk for disconnect failed");
1225 if (!block.DisconnectBlock(txdb, pindex))
1226 return error("Reorganize() : DisconnectBlock failed");
1228 // Queue memory transactions to resurrect
1229 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1230 if (!tx.IsCoinBase())
1231 vResurrect.push_back(tx);
1234 // Connect longer branch
1235 vector<CTransaction> vDelete;
1236 for (int i = 0; i < vConnect.size(); i++)
1238 CBlockIndex* pindex = vConnect[i];
1240 if (!block.ReadFromDisk(pindex))
1241 return error("Reorganize() : ReadFromDisk for connect failed");
1242 if (!block.ConnectBlock(txdb, pindex))
1246 return error("Reorganize() : ConnectBlock failed");
1249 // Queue memory transactions to delete
1250 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1251 vDelete.push_back(tx);
1253 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1254 return error("Reorganize() : WriteHashBestChain failed");
1256 // Make sure it's successfully written to disk before changing memory structure
1257 if (!txdb.TxnCommit())
1258 return error("Reorganize() : TxnCommit failed");
1260 // Disconnect shorter branch
1261 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1263 pindex->pprev->pnext = NULL;
1265 // Connect longer branch
1266 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1268 pindex->pprev->pnext = pindex;
1270 // Resurrect memory transactions that were in the disconnected branch
1271 BOOST_FOREACH(CTransaction& tx, vResurrect)
1272 tx.AcceptToMemoryPool(txdb, false);
1274 // Delete redundant memory transactions that are in the connected branch
1275 BOOST_FOREACH(CTransaction& tx, vDelete)
1276 tx.RemoveFromMemoryPool();
1283 runCommand(std::string strCommand)
1285 int nErr = ::system(strCommand.c_str());
1287 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1290 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1292 uint256 hash = GetHash();
1295 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1297 txdb.WriteHashBestChain(hash);
1298 if (!txdb.TxnCommit())
1299 return error("SetBestChain() : TxnCommit failed");
1300 pindexGenesisBlock = pindexNew;
1302 else if (hashPrevBlock == hashBestChain)
1304 // Adding to current best branch
1305 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1308 InvalidChainFound(pindexNew);
1309 return error("SetBestChain() : ConnectBlock failed");
1311 if (!txdb.TxnCommit())
1312 return error("SetBestChain() : TxnCommit failed");
1314 // Add to current best branch
1315 pindexNew->pprev->pnext = pindexNew;
1317 // Delete redundant memory transactions
1318 BOOST_FOREACH(CTransaction& tx, vtx)
1319 tx.RemoveFromMemoryPool();
1324 if (!Reorganize(txdb, pindexNew))
1327 InvalidChainFound(pindexNew);
1328 return error("SetBestChain() : Reorganize failed");
1332 // Update best block in wallet (so we can detect restored wallets)
1333 bool fIsInitialDownload = IsInitialBlockDownload();
1334 if (!fIsInitialDownload)
1336 const CBlockLocator locator(pindexNew);
1337 ::SetBestChain(locator);
1341 hashBestChain = hash;
1342 pindexBest = pindexNew;
1343 nBestHeight = pindexBest->nHeight;
1344 bnBestChainWork = pindexNew->bnChainWork;
1345 nTimeBestReceived = GetTime();
1346 nTransactionsUpdated++;
1347 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1349 std::string strCmd = GetArg("-blocknotify", "");
1351 if (!fIsInitialDownload && !strCmd.empty())
1353 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1354 boost::thread t(runCommand, strCmd); // thread runs free
1361 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1363 // Check for duplicate
1364 uint256 hash = GetHash();
1365 if (mapBlockIndex.count(hash))
1366 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1368 // Construct new block index object
1369 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1371 return error("AddToBlockIndex() : new CBlockIndex failed");
1372 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1373 pindexNew->phashBlock = &((*mi).first);
1374 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1375 if (miPrev != mapBlockIndex.end())
1377 pindexNew->pprev = (*miPrev).second;
1378 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1380 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1384 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1385 if (!txdb.TxnCommit())
1389 if (pindexNew->bnChainWork > bnBestChainWork)
1390 if (!SetBestChain(txdb, pindexNew))
1395 if (pindexNew == pindexBest)
1397 // Notify UI to display prev block's coinbase if it was ours
1398 static uint256 hashPrevBestCoinBase;
1399 UpdatedTransaction(hashPrevBestCoinBase);
1400 hashPrevBestCoinBase = vtx[0].GetHash();
1410 bool CBlock::CheckBlock() const
1412 // These are checks that are independent of context
1413 // that can be verified before saving an orphan block.
1416 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1417 return DoS(100, error("CheckBlock() : size limits failed"));
1419 // Check proof of work matches claimed amount
1420 if (!CheckProofOfWork(GetHash(), nBits))
1421 return DoS(50, error("CheckBlock() : proof of work failed"));
1424 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1425 return error("CheckBlock() : block timestamp too far in the future");
1427 // First transaction must be coinbase, the rest must not be
1428 if (vtx.empty() || !vtx[0].IsCoinBase())
1429 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1430 for (int i = 1; i < vtx.size(); i++)
1431 if (vtx[i].IsCoinBase())
1432 return DoS(100, error("CheckBlock() : more than one coinbase"));
1434 // Check transactions
1435 BOOST_FOREACH(const CTransaction& tx, vtx)
1436 if (!tx.CheckTransaction())
1437 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1439 // This code should be removed when a compatibility-breaking block chain split has passed.
1440 // Compatibility check for old clients that counted sigops differently:
1442 BOOST_FOREACH(const CTransaction& tx, vtx)
1444 BOOST_FOREACH(const CTxIn& txin, tx.vin)
1446 nSigOps += txin.scriptSig.GetSigOpCount();
1448 BOOST_FOREACH(const CTxOut& txout, tx.vout)
1450 nSigOps += txout.scriptPubKey.GetSigOpCount();
1453 if (nSigOps > MAX_BLOCK_SIGOPS)
1454 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1457 if (hashMerkleRoot != BuildMerkleTree())
1458 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1463 bool CBlock::AcceptBlock()
1465 // Check for duplicate
1466 uint256 hash = GetHash();
1467 if (mapBlockIndex.count(hash))
1468 return error("AcceptBlock() : block already in mapBlockIndex");
1470 // Get prev block index
1471 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1472 if (mi == mapBlockIndex.end())
1473 return DoS(10, error("AcceptBlock() : prev block not found"));
1474 CBlockIndex* pindexPrev = (*mi).second;
1475 int nHeight = pindexPrev->nHeight+1;
1477 // Check proof of work
1478 if (nBits != GetNextWorkRequired(pindexPrev))
1479 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1481 // Check timestamp against prev
1482 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1483 return error("AcceptBlock() : block's timestamp is too early");
1485 // Check that all transactions are finalized
1486 BOOST_FOREACH(const CTransaction& tx, vtx)
1487 if (!tx.IsFinal(nHeight, GetBlockTime()))
1488 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1490 // Check that the block chain matches the known block chain up to a checkpoint
1491 if (!Checkpoints::CheckBlock(nHeight, hash))
1492 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1494 // Write block to history file
1495 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1496 return error("AcceptBlock() : out of disk space");
1497 unsigned int nFile = -1;
1498 unsigned int nBlockPos = 0;
1499 if (!WriteToDisk(nFile, nBlockPos))
1500 return error("AcceptBlock() : WriteToDisk failed");
1501 if (!AddToBlockIndex(nFile, nBlockPos))
1502 return error("AcceptBlock() : AddToBlockIndex failed");
1504 // Relay inventory, but don't relay old inventory during initial block download
1505 if (hashBestChain == hash)
1506 CRITICAL_BLOCK(cs_vNodes)
1507 BOOST_FOREACH(CNode* pnode, vNodes)
1508 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1509 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1514 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1516 // Check for duplicate
1517 uint256 hash = pblock->GetHash();
1518 if (mapBlockIndex.count(hash))
1519 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1520 if (mapOrphanBlocks.count(hash))
1521 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1523 // Preliminary checks
1524 if (!pblock->CheckBlock())
1525 return error("ProcessBlock() : CheckBlock FAILED");
1527 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1528 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1530 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1531 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1534 pfrom->Misbehaving(100);
1535 return error("ProcessBlock() : block with timestamp before last checkpoint");
1538 bnNewBlock.SetCompact(pblock->nBits);
1540 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1541 if (bnNewBlock > bnRequired)
1543 pfrom->Misbehaving(100);
1544 return error("ProcessBlock() : block with too little proof-of-work");
1549 // If don't already have its previous block, shunt it off to holding area until we get it
1550 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1552 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1553 CBlock* pblock2 = new CBlock(*pblock);
1554 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1555 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1557 // Ask this guy to fill in what we're missing
1559 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1564 if (!pblock->AcceptBlock())
1565 return error("ProcessBlock() : AcceptBlock FAILED");
1567 // Recursively process any orphan blocks that depended on this one
1568 vector<uint256> vWorkQueue;
1569 vWorkQueue.push_back(hash);
1570 for (int i = 0; i < vWorkQueue.size(); i++)
1572 uint256 hashPrev = vWorkQueue[i];
1573 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1574 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1577 CBlock* pblockOrphan = (*mi).second;
1578 if (pblockOrphan->AcceptBlock())
1579 vWorkQueue.push_back(pblockOrphan->GetHash());
1580 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1581 delete pblockOrphan;
1583 mapOrphanBlocksByPrev.erase(hashPrev);
1586 printf("ProcessBlock: ACCEPTED\n");
1597 bool CheckDiskSpace(uint64 nAdditionalBytes)
1599 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1601 // Check for 15MB because database could create another 10MB log file at any time
1602 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1605 string strMessage = _("Warning: Disk space is low ");
1606 strMiscWarning = strMessage;
1607 printf("*** %s\n", strMessage.c_str());
1608 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1609 CreateThread(Shutdown, NULL);
1615 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1619 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1622 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1624 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1633 static unsigned int nCurrentBlockFile = 1;
1635 FILE* AppendBlockFile(unsigned int& nFileRet)
1640 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1643 if (fseek(file, 0, SEEK_END) != 0)
1645 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1646 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1648 nFileRet = nCurrentBlockFile;
1652 nCurrentBlockFile++;
1656 bool LoadBlockIndex(bool fAllowNew)
1660 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1661 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1662 pchMessageStart[0] = 0xfa;
1663 pchMessageStart[1] = 0xbf;
1664 pchMessageStart[2] = 0xb5;
1665 pchMessageStart[3] = 0xda;
1672 if (!txdb.LoadBlockIndex())
1677 // Init with genesis block
1679 if (mapBlockIndex.empty())
1685 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1686 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1687 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1688 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1689 // vMerkleTree: 4a5e1e
1692 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1694 txNew.vin.resize(1);
1695 txNew.vout.resize(1);
1696 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1697 txNew.vout[0].nValue = 50 * COIN;
1698 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1700 block.vtx.push_back(txNew);
1701 block.hashPrevBlock = 0;
1702 block.hashMerkleRoot = block.BuildMerkleTree();
1704 block.nTime = 1231006505;
1705 block.nBits = 0x1d00ffff;
1706 block.nNonce = 2083236893;
1710 block.nTime = 1296688602;
1711 block.nBits = 0x1d07fff8;
1712 block.nNonce = 384568319;
1716 printf("%s\n", block.GetHash().ToString().c_str());
1717 printf("%s\n", hashGenesisBlock.ToString().c_str());
1718 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1719 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1721 assert(block.GetHash() == hashGenesisBlock);
1723 // Start new block file
1725 unsigned int nBlockPos;
1726 if (!block.WriteToDisk(nFile, nBlockPos))
1727 return error("LoadBlockIndex() : writing genesis block to disk failed");
1728 if (!block.AddToBlockIndex(nFile, nBlockPos))
1729 return error("LoadBlockIndex() : genesis block not accepted");
1737 void PrintBlockTree()
1739 // precompute tree structure
1740 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1741 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1743 CBlockIndex* pindex = (*mi).second;
1744 mapNext[pindex->pprev].push_back(pindex);
1746 //while (rand() % 3 == 0)
1747 // mapNext[pindex->pprev].push_back(pindex);
1750 vector<pair<int, CBlockIndex*> > vStack;
1751 vStack.push_back(make_pair(0, pindexGenesisBlock));
1754 while (!vStack.empty())
1756 int nCol = vStack.back().first;
1757 CBlockIndex* pindex = vStack.back().second;
1760 // print split or gap
1761 if (nCol > nPrevCol)
1763 for (int i = 0; i < nCol-1; i++)
1767 else if (nCol < nPrevCol)
1769 for (int i = 0; i < nCol; i++)
1776 for (int i = 0; i < nCol; i++)
1781 block.ReadFromDisk(pindex);
1782 printf("%d (%u,%u) %s %s tx %d",
1786 block.GetHash().ToString().substr(0,20).c_str(),
1787 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1790 PrintWallets(block);
1792 // put the main timechain first
1793 vector<CBlockIndex*>& vNext = mapNext[pindex];
1794 for (int i = 0; i < vNext.size(); i++)
1796 if (vNext[i]->pnext)
1798 swap(vNext[0], vNext[i]);
1804 for (int i = 0; i < vNext.size(); i++)
1805 vStack.push_back(make_pair(nCol+i, vNext[i]));
1818 //////////////////////////////////////////////////////////////////////////////
1823 map<uint256, CAlert> mapAlerts;
1824 CCriticalSection cs_mapAlerts;
1826 string GetWarnings(string strFor)
1829 string strStatusBar;
1831 if (GetBoolArg("-testsafemode"))
1834 // Misc warnings like out of disk space and clock is wrong
1835 if (strMiscWarning != "")
1838 strStatusBar = strMiscWarning;
1841 // Longer invalid proof-of-work chain
1842 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1845 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1849 CRITICAL_BLOCK(cs_mapAlerts)
1851 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1853 const CAlert& alert = item.second;
1854 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1856 nPriority = alert.nPriority;
1857 strStatusBar = alert.strStatusBar;
1862 if (strFor == "statusbar")
1863 return strStatusBar;
1864 else if (strFor == "rpc")
1866 assert(!"GetWarnings() : invalid parameter");
1870 bool CAlert::ProcessAlert()
1872 if (!CheckSignature())
1877 CRITICAL_BLOCK(cs_mapAlerts)
1879 // Cancel previous alerts
1880 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1882 const CAlert& alert = (*mi).second;
1885 printf("cancelling alert %d\n", alert.nID);
1886 mapAlerts.erase(mi++);
1888 else if (!alert.IsInEffect())
1890 printf("expiring alert %d\n", alert.nID);
1891 mapAlerts.erase(mi++);
1897 // Check if this alert has been cancelled
1898 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1900 const CAlert& alert = item.second;
1901 if (alert.Cancels(*this))
1903 printf("alert already cancelled by %d\n", alert.nID);
1909 mapAlerts.insert(make_pair(GetHash(), *this));
1912 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1924 //////////////////////////////////////////////////////////////////////////////
1930 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1934 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1935 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1937 // Don't know what it is, just say we already got one
1944 // The message start string is designed to be unlikely to occur in normal data.
1945 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1946 // a large 4-byte int at any alignment.
1947 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1950 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1952 static map<CService, vector<unsigned char> > mapReuseKey;
1953 RandAddSeedPerfmon();
1955 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1956 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1958 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1960 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1968 if (strCommand == "version")
1970 // Each connection can only send one version message
1971 if (pfrom->nVersion != 0)
1973 pfrom->Misbehaving(1);
1981 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1982 if (pfrom->nVersion == 10300)
1983 pfrom->nVersion = 300;
1984 if (pfrom->nVersion >= 106 && !vRecv.empty())
1985 vRecv >> addrFrom >> nNonce;
1986 if (pfrom->nVersion >= 106 && !vRecv.empty())
1987 vRecv >> pfrom->strSubVer;
1988 if (pfrom->nVersion >= 209 && !vRecv.empty())
1989 vRecv >> pfrom->nStartingHeight;
1991 if (pfrom->nVersion == 0)
1994 // Disconnect if we connected to ourself
1995 if (nNonce == nLocalHostNonce && nNonce > 1)
1997 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1998 pfrom->fDisconnect = true;
2002 // Be shy and don't send version until we hear
2003 if (pfrom->fInbound)
2004 pfrom->PushVersion();
2006 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2008 AddTimeData(pfrom->addr, nTime);
2011 if (pfrom->nVersion >= 209)
2012 pfrom->PushMessage("verack");
2013 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2014 if (pfrom->nVersion < 209)
2015 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2017 if (!pfrom->fInbound)
2019 // Advertise our address
2020 if (addrLocalHost.IsRoutable() && !fUseProxy)
2022 CAddress addr(addrLocalHost);
2023 addr.nTime = GetAdjustedTime();
2024 pfrom->PushAddress(addr);
2027 // Get recent addresses
2028 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2030 pfrom->PushMessage("getaddr");
2031 pfrom->fGetAddr = true;
2035 // Ask the first connected node for block updates
2036 static int nAskedForBlocks = 0;
2037 if (!pfrom->fClient &&
2038 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2039 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2042 pfrom->PushGetBlocks(pindexBest, uint256(0));
2046 CRITICAL_BLOCK(cs_mapAlerts)
2047 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2048 item.second.RelayTo(pfrom);
2050 pfrom->fSuccessfullyConnected = true;
2052 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2054 cPeerBlockCounts.input(pfrom->nStartingHeight);
2058 else if (pfrom->nVersion == 0)
2060 // Must have a version message before anything else
2061 pfrom->Misbehaving(1);
2066 else if (strCommand == "verack")
2068 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2072 else if (strCommand == "addr")
2074 vector<CAddress> vAddr;
2077 // Don't want addr from older versions unless seeding
2078 if (pfrom->nVersion < 209)
2080 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2082 if (vAddr.size() > 1000)
2084 pfrom->Misbehaving(20);
2085 return error("message addr size() = %d", vAddr.size());
2088 // Store the new addresses
2091 int64 nNow = GetAdjustedTime();
2092 int64 nSince = nNow - 10 * 60;
2093 BOOST_FOREACH(CAddress& addr, vAddr)
2097 // ignore IPv6 for now, since it isn't implemented anyway
2100 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2101 addr.nTime = nNow - 5 * 24 * 60 * 60;
2102 AddAddress(addr, 2 * 60 * 60, &addrDB);
2103 pfrom->AddAddressKnown(addr);
2104 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2106 // Relay to a limited number of other nodes
2107 CRITICAL_BLOCK(cs_vNodes)
2109 // Use deterministic randomness to send to the same nodes for 24 hours
2110 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2111 static uint256 hashSalt;
2113 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2114 int64 hashAddr = addr.GetHash();
2115 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2116 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2117 multimap<uint256, CNode*> mapMix;
2118 BOOST_FOREACH(CNode* pnode, vNodes)
2120 if (pnode->nVersion < 31402)
2122 unsigned int nPointer;
2123 memcpy(&nPointer, &pnode, sizeof(nPointer));
2124 uint256 hashKey = hashRand ^ nPointer;
2125 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2126 mapMix.insert(make_pair(hashKey, pnode));
2128 int nRelayNodes = 2;
2129 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2130 ((*mi).second)->PushAddress(addr);
2134 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2135 if (vAddr.size() < 1000)
2136 pfrom->fGetAddr = false;
2140 else if (strCommand == "inv")
2144 if (vInv.size() > 50000)
2146 pfrom->Misbehaving(20);
2147 return error("message inv size() = %d", vInv.size());
2151 BOOST_FOREACH(const CInv& inv, vInv)
2155 pfrom->AddInventoryKnown(inv);
2157 bool fAlreadyHave = AlreadyHave(txdb, inv);
2159 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2163 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2164 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2166 // Track requests for our stuff
2167 Inventory(inv.hash);
2172 else if (strCommand == "getdata")
2176 if (vInv.size() > 50000)
2178 pfrom->Misbehaving(20);
2179 return error("message getdata size() = %d", vInv.size());
2182 BOOST_FOREACH(const CInv& inv, vInv)
2186 printf("received getdata for: %s\n", inv.ToString().c_str());
2188 if (inv.type == MSG_BLOCK)
2190 // Send block from disk
2191 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2192 if (mi != mapBlockIndex.end())
2195 block.ReadFromDisk((*mi).second);
2196 pfrom->PushMessage("block", block);
2198 // Trigger them to send a getblocks request for the next batch of inventory
2199 if (inv.hash == pfrom->hashContinue)
2201 // Bypass PushInventory, this must send even if redundant,
2202 // and we want it right after the last block so they don't
2203 // wait for other stuff first.
2205 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2206 pfrom->PushMessage("inv", vInv);
2207 pfrom->hashContinue = 0;
2211 else if (inv.IsKnownType())
2213 // Send stream from relay memory
2214 CRITICAL_BLOCK(cs_mapRelay)
2216 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2217 if (mi != mapRelay.end())
2218 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2222 // Track requests for our stuff
2223 Inventory(inv.hash);
2228 else if (strCommand == "getblocks")
2230 CBlockLocator locator;
2232 vRecv >> locator >> hashStop;
2234 // Find the last block the caller has in the main chain
2235 CBlockIndex* pindex = locator.GetBlockIndex();
2237 // Send the rest of the chain
2239 pindex = pindex->pnext;
2240 int nLimit = 500 + locator.GetDistanceBack();
2241 unsigned int nBytes = 0;
2242 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2243 for (; pindex; pindex = pindex->pnext)
2245 if (pindex->GetBlockHash() == hashStop)
2247 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2250 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2252 block.ReadFromDisk(pindex, true);
2253 nBytes += block.GetSerializeSize(SER_NETWORK);
2254 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2256 // When this block is requested, we'll send an inv that'll make them
2257 // getblocks the next batch of inventory.
2258 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2259 pfrom->hashContinue = pindex->GetBlockHash();
2266 else if (strCommand == "getheaders")
2268 CBlockLocator locator;
2270 vRecv >> locator >> hashStop;
2272 CBlockIndex* pindex = NULL;
2273 if (locator.IsNull())
2275 // If locator is null, return the hashStop block
2276 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2277 if (mi == mapBlockIndex.end())
2279 pindex = (*mi).second;
2283 // Find the last block the caller has in the main chain
2284 pindex = locator.GetBlockIndex();
2286 pindex = pindex->pnext;
2289 vector<CBlock> vHeaders;
2290 int nLimit = 2000 + locator.GetDistanceBack();
2291 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2292 for (; pindex; pindex = pindex->pnext)
2294 vHeaders.push_back(pindex->GetBlockHeader());
2295 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2298 pfrom->PushMessage("headers", vHeaders);
2302 else if (strCommand == "tx")
2304 vector<uint256> vWorkQueue;
2305 CDataStream vMsg(vRecv);
2309 CInv inv(MSG_TX, tx.GetHash());
2310 pfrom->AddInventoryKnown(inv);
2312 bool fMissingInputs = false;
2313 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2315 SyncWithWallets(tx, NULL, true);
2316 RelayMessage(inv, vMsg);
2317 mapAlreadyAskedFor.erase(inv);
2318 vWorkQueue.push_back(inv.hash);
2320 // Recursively process any orphan transactions that depended on this one
2321 for (int i = 0; i < vWorkQueue.size(); i++)
2323 uint256 hashPrev = vWorkQueue[i];
2324 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2325 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2328 const CDataStream& vMsg = *((*mi).second);
2330 CDataStream(vMsg) >> tx;
2331 CInv inv(MSG_TX, tx.GetHash());
2333 if (tx.AcceptToMemoryPool(true))
2335 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2336 SyncWithWallets(tx, NULL, true);
2337 RelayMessage(inv, vMsg);
2338 mapAlreadyAskedFor.erase(inv);
2339 vWorkQueue.push_back(inv.hash);
2344 BOOST_FOREACH(uint256 hash, vWorkQueue)
2345 EraseOrphanTx(hash);
2347 else if (fMissingInputs)
2349 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2352 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2356 else if (strCommand == "block")
2361 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2364 CInv inv(MSG_BLOCK, block.GetHash());
2365 pfrom->AddInventoryKnown(inv);
2367 if (ProcessBlock(pfrom, &block))
2368 mapAlreadyAskedFor.erase(inv);
2369 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2373 else if (strCommand == "getaddr")
2375 // Nodes rebroadcast an addr every 24 hours
2376 pfrom->vAddrToSend.clear();
2377 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2378 CRITICAL_BLOCK(cs_mapAddresses)
2380 unsigned int nCount = 0;
2381 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2383 const CAddress& addr = item.second;
2384 if (addr.nTime > nSince)
2387 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2389 const CAddress& addr = item.second;
2390 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2391 pfrom->PushAddress(addr);
2397 else if (strCommand == "checkorder")
2402 if (!GetBoolArg("-allowreceivebyip"))
2404 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2411 /// we have a chance to check the order here
2413 // Keep giving the same key to the same ip until they use it
2414 if (!mapReuseKey.count(pfrom->addr))
2415 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2417 // Send back approval of order and pubkey to use
2418 CScript scriptPubKey;
2419 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2420 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2424 else if (strCommand == "reply")
2429 CRequestTracker tracker;
2430 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2432 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2433 if (mi != pfrom->mapRequests.end())
2435 tracker = (*mi).second;
2436 pfrom->mapRequests.erase(mi);
2439 if (!tracker.IsNull())
2440 tracker.fn(tracker.param1, vRecv);
2444 else if (strCommand == "ping")
2449 else if (strCommand == "alert")
2454 if (alert.ProcessAlert())
2457 pfrom->setKnown.insert(alert.GetHash());
2458 CRITICAL_BLOCK(cs_vNodes)
2459 BOOST_FOREACH(CNode* pnode, vNodes)
2460 alert.RelayTo(pnode);
2467 // Ignore unknown commands for extensibility
2471 // Update the last seen time for this node's address
2472 if (pfrom->fNetworkNode)
2473 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2474 AddressCurrentlyConnected(pfrom->addr);
2480 bool ProcessMessages(CNode* pfrom)
2482 CDataStream& vRecv = pfrom->vRecv;
2486 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2490 // (4) message start
2499 // Scan for message start
2500 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2501 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2502 if (vRecv.end() - pstart < nHeaderSize)
2504 if (vRecv.size() > nHeaderSize)
2506 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2507 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2511 if (pstart - vRecv.begin() > 0)
2512 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2513 vRecv.erase(vRecv.begin(), pstart);
2516 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2521 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2524 string strCommand = hdr.GetCommand();
2527 unsigned int nMessageSize = hdr.nMessageSize;
2528 if (nMessageSize > MAX_SIZE)
2530 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2533 if (nMessageSize > vRecv.size())
2535 // Rewind and wait for rest of message
2536 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2541 if (vRecv.GetVersion() >= 209)
2543 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2544 unsigned int nChecksum = 0;
2545 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2546 if (nChecksum != hdr.nChecksum)
2548 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2549 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2554 // Copy message to its own buffer
2555 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2556 vRecv.ignore(nMessageSize);
2562 CRITICAL_BLOCK(cs_main)
2563 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2567 catch (std::ios_base::failure& e)
2569 if (strstr(e.what(), "end of data"))
2571 // Allow exceptions from underlength message on vRecv
2572 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());
2574 else if (strstr(e.what(), "size too large"))
2576 // Allow exceptions from overlong size
2577 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2581 PrintExceptionContinue(&e, "ProcessMessage()");
2584 catch (std::exception& e) {
2585 PrintExceptionContinue(&e, "ProcessMessage()");
2587 PrintExceptionContinue(NULL, "ProcessMessage()");
2591 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2599 bool SendMessages(CNode* pto, bool fSendTrickle)
2601 CRITICAL_BLOCK(cs_main)
2603 // Don't send anything until we get their version message
2604 if (pto->nVersion == 0)
2608 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2609 pto->PushMessage("ping");
2611 // Resend wallet transactions that haven't gotten in a block yet
2612 ResendWalletTransactions();
2614 // Address refresh broadcast
2615 static int64 nLastRebroadcast;
2616 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2618 nLastRebroadcast = GetTime();
2619 CRITICAL_BLOCK(cs_vNodes)
2621 BOOST_FOREACH(CNode* pnode, vNodes)
2623 // Periodically clear setAddrKnown to allow refresh broadcasts
2624 pnode->setAddrKnown.clear();
2626 // Rebroadcast our address
2627 if (addrLocalHost.IsRoutable() && !fUseProxy)
2629 CAddress addr(addrLocalHost);
2630 addr.nTime = GetAdjustedTime();
2631 pnode->PushAddress(addr);
2637 // Clear out old addresses periodically so it's not too much work at once
2638 static int64 nLastClear;
2639 if (nLastClear == 0)
2640 nLastClear = GetTime();
2641 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2643 nLastClear = GetTime();
2644 CRITICAL_BLOCK(cs_mapAddresses)
2647 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2648 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2649 mi != mapAddresses.end();)
2651 const CAddress& addr = (*mi).second;
2652 if (addr.nTime < nSince)
2654 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2656 addrdb.EraseAddress(addr);
2657 mapAddresses.erase(mi++);
2671 vector<CAddress> vAddr;
2672 vAddr.reserve(pto->vAddrToSend.size());
2673 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2675 // returns true if wasn't already contained in the set
2676 if (pto->setAddrKnown.insert(addr).second)
2678 vAddr.push_back(addr);
2679 // receiver rejects addr messages larger than 1000
2680 if (vAddr.size() >= 1000)
2682 pto->PushMessage("addr", vAddr);
2687 pto->vAddrToSend.clear();
2689 pto->PushMessage("addr", vAddr);
2694 // Message: inventory
2697 vector<CInv> vInvWait;
2698 CRITICAL_BLOCK(pto->cs_inventory)
2700 vInv.reserve(pto->vInventoryToSend.size());
2701 vInvWait.reserve(pto->vInventoryToSend.size());
2702 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2704 if (pto->setInventoryKnown.count(inv))
2707 // trickle out tx inv to protect privacy
2708 if (inv.type == MSG_TX && !fSendTrickle)
2710 // 1/4 of tx invs blast to all immediately
2711 static uint256 hashSalt;
2713 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2714 uint256 hashRand = inv.hash ^ hashSalt;
2715 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2716 bool fTrickleWait = ((hashRand & 3) != 0);
2718 // always trickle our own transactions
2722 if (GetTransaction(inv.hash, wtx))
2724 fTrickleWait = true;
2729 vInvWait.push_back(inv);
2734 // returns true if wasn't already contained in the set
2735 if (pto->setInventoryKnown.insert(inv).second)
2737 vInv.push_back(inv);
2738 if (vInv.size() >= 1000)
2740 pto->PushMessage("inv", vInv);
2745 pto->vInventoryToSend = vInvWait;
2748 pto->PushMessage("inv", vInv);
2754 vector<CInv> vGetData;
2755 int64 nNow = GetTime() * 1000000;
2757 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2759 const CInv& inv = (*pto->mapAskFor.begin()).second;
2760 if (!AlreadyHave(txdb, inv))
2762 printf("sending getdata: %s\n", inv.ToString().c_str());
2763 vGetData.push_back(inv);
2764 if (vGetData.size() >= 1000)
2766 pto->PushMessage("getdata", vGetData);
2770 mapAlreadyAskedFor[inv] = nNow;
2771 pto->mapAskFor.erase(pto->mapAskFor.begin());
2773 if (!vGetData.empty())
2774 pto->PushMessage("getdata", vGetData);
2793 //////////////////////////////////////////////////////////////////////////////
2798 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2800 unsigned char* pdata = (unsigned char*)pbuffer;
2801 unsigned int blocks = 1 + ((len + 8) / 64);
2802 unsigned char* pend = pdata + 64 * blocks;
2803 memset(pdata + len, 0, 64 * blocks - len);
2805 unsigned int bits = len * 8;
2806 pend[-1] = (bits >> 0) & 0xff;
2807 pend[-2] = (bits >> 8) & 0xff;
2808 pend[-3] = (bits >> 16) & 0xff;
2809 pend[-4] = (bits >> 24) & 0xff;
2813 static const unsigned int pSHA256InitState[8] =
2814 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2816 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2819 unsigned char data[64];
2823 for (int i = 0; i < 16; i++)
2824 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2826 for (int i = 0; i < 8; i++)
2827 ctx.h[i] = ((uint32_t*)pinit)[i];
2829 SHA256_Update(&ctx, data, sizeof(data));
2830 for (int i = 0; i < 8; i++)
2831 ((uint32_t*)pstate)[i] = ctx.h[i];
2835 // ScanHash scans nonces looking for a hash with at least some zero bits.
2836 // It operates on big endian data. Caller does the byte reversing.
2837 // All input buffers are 16-byte aligned. nNonce is usually preserved
2838 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2839 // the block is rebuilt and nNonce starts over at zero.
2841 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2843 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2847 // Hash pdata using pmidstate as the starting state into
2848 // preformatted buffer phash1, then hash phash1 into phash
2850 SHA256Transform(phash1, pdata, pmidstate);
2851 SHA256Transform(phash, phash1, pSHA256InitState);
2853 // Return the nonce if the hash has at least some zero bits,
2854 // caller will check if it has enough to reach the target
2855 if (((unsigned short*)phash)[14] == 0)
2858 // If nothing found after trying for a while, return -1
2859 if ((nNonce & 0xffff) == 0)
2861 nHashesDone = 0xffff+1;
2867 // Some explaining would be appreciated
2872 set<uint256> setDependsOn;
2875 COrphan(CTransaction* ptxIn)
2883 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2884 BOOST_FOREACH(uint256 hash, setDependsOn)
2885 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2890 CBlock* CreateNewBlock(CReserveKey& reservekey)
2892 CBlockIndex* pindexPrev = pindexBest;
2895 auto_ptr<CBlock> pblock(new CBlock());
2899 // Create coinbase tx
2901 txNew.vin.resize(1);
2902 txNew.vin[0].prevout.SetNull();
2903 txNew.vout.resize(1);
2904 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2906 // Add our coinbase tx as first transaction
2907 pblock->vtx.push_back(txNew);
2909 // Collect memory pool transactions into the block
2911 CRITICAL_BLOCK(cs_main)
2912 CRITICAL_BLOCK(cs_mapTransactions)
2916 // Priority order to process transactions
2917 list<COrphan> vOrphan; // list memory doesn't move
2918 map<uint256, vector<COrphan*> > mapDependers;
2919 multimap<double, CTransaction*> mapPriority;
2920 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2922 CTransaction& tx = (*mi).second;
2923 if (tx.IsCoinBase() || !tx.IsFinal())
2926 COrphan* porphan = NULL;
2927 double dPriority = 0;
2928 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2930 // Read prev transaction
2931 CTransaction txPrev;
2933 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2935 // Has to wait for dependencies
2938 // Use list for automatic deletion
2939 vOrphan.push_back(COrphan(&tx));
2940 porphan = &vOrphan.back();
2942 mapDependers[txin.prevout.hash].push_back(porphan);
2943 porphan->setDependsOn.insert(txin.prevout.hash);
2946 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2948 // Read block header
2949 int nConf = txindex.GetDepthInMainChain();
2951 dPriority += (double)nValueIn * nConf;
2953 if (fDebug && GetBoolArg("-printpriority"))
2954 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2957 // Priority is sum(valuein * age) / txsize
2958 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2961 porphan->dPriority = dPriority;
2963 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2965 if (fDebug && GetBoolArg("-printpriority"))
2967 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2974 // Collect transactions into block
2975 map<uint256, CTxIndex> mapTestPool;
2976 uint64 nBlockSize = 1000;
2977 int nBlockSigOps = 100;
2978 while (!mapPriority.empty())
2980 // Take highest priority transaction off priority queue
2981 double dPriority = -(*mapPriority.begin()).first;
2982 CTransaction& tx = *(*mapPriority.begin()).second;
2983 mapPriority.erase(mapPriority.begin());
2986 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2987 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2990 // Transaction fee required depends on block size
2991 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2992 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
2994 // Connecting shouldn't fail due to dependency on other memory pool transactions
2995 // because we're already processing them in order of dependency
2996 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2997 map<uint256, pair<CTxIndex, CTransaction> > mapInputs;
2998 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs))
3001 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nTxSigOps, nMinFee))
3003 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3005 swap(mapTestPool, mapTestPoolTmp);
3008 pblock->vtx.push_back(tx);
3009 nBlockSize += nTxSize;
3010 nBlockSigOps += nTxSigOps;
3012 // Add transactions that depend on this one to the priority queue
3013 uint256 hash = tx.GetHash();
3014 if (mapDependers.count(hash))
3016 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3018 if (!porphan->setDependsOn.empty())
3020 porphan->setDependsOn.erase(hash);
3021 if (porphan->setDependsOn.empty())
3022 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3028 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3031 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3032 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3033 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3034 pblock->nBits = GetNextWorkRequired(pindexPrev);
3037 return pblock.release();
3041 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3043 // Update nExtraNonce
3044 static uint256 hashPrevBlock;
3045 if (hashPrevBlock != pblock->hashPrevBlock)
3048 hashPrevBlock = pblock->hashPrevBlock;
3051 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3053 // Put "OP_EVAL" in the coinbase so everybody can tell when
3054 // a majority of miners support it
3055 const char* pOpEvalName = GetOpName(OP_EVAL);
3056 pblock->vtx[0].vin[0].scriptSig += CScript() << std::vector<unsigned char>(pOpEvalName, pOpEvalName+strlen(pOpEvalName));
3057 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3059 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3063 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3066 // Prebuild hash buffers
3073 uint256 hashPrevBlock;
3074 uint256 hashMerkleRoot;
3077 unsigned int nNonce;
3080 unsigned char pchPadding0[64];
3082 unsigned char pchPadding1[64];
3085 memset(&tmp, 0, sizeof(tmp));
3087 tmp.block.nVersion = pblock->nVersion;
3088 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3089 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3090 tmp.block.nTime = pblock->nTime;
3091 tmp.block.nBits = pblock->nBits;
3092 tmp.block.nNonce = pblock->nNonce;
3094 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3095 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3097 // Byte swap all the input buffer
3098 for (int i = 0; i < sizeof(tmp)/4; i++)
3099 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3101 // Precalc the first half of the first hash, which stays constant
3102 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3104 memcpy(pdata, &tmp.block, 128);
3105 memcpy(phash1, &tmp.hash1, 64);
3109 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3111 uint256 hash = pblock->GetHash();
3112 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3114 if (hash > hashTarget)
3118 printf("BitcoinMiner:\n");
3119 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3121 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3122 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3125 CRITICAL_BLOCK(cs_main)
3127 if (pblock->hashPrevBlock != hashBestChain)
3128 return error("BitcoinMiner : generated block is stale");
3130 // Remove key from key pool
3131 reservekey.KeepKey();
3133 // Track how many getdata requests this block gets
3134 CRITICAL_BLOCK(wallet.cs_wallet)
3135 wallet.mapRequestCount[pblock->GetHash()] = 0;
3137 // Process this block the same as if we had received it from another node
3138 if (!ProcessBlock(NULL, pblock))
3139 return error("BitcoinMiner : ProcessBlock, block not accepted");
3145 void static ThreadBitcoinMiner(void* parg);
3147 void static BitcoinMiner(CWallet *pwallet)
3149 printf("BitcoinMiner started\n");
3150 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3152 // Each thread has its own key and counter
3153 CReserveKey reservekey(pwallet);
3154 unsigned int nExtraNonce = 0;
3156 while (fGenerateBitcoins)
3158 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3162 while (vNodes.empty() || IsInitialBlockDownload())
3167 if (!fGenerateBitcoins)
3175 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3176 CBlockIndex* pindexPrev = pindexBest;
3178 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3181 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3183 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3187 // Prebuild hash buffers
3189 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3190 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3191 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3193 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3195 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3196 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3202 int64 nStart = GetTime();
3203 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3205 uint256& hash = *alignup<16>(hashbuf);
3208 unsigned int nHashesDone = 0;
3209 unsigned int nNonceFound;
3212 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3213 (char*)&hash, nHashesDone);
3215 // Check if something found
3216 if (nNonceFound != -1)
3218 for (int i = 0; i < sizeof(hash)/4; i++)
3219 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3221 if (hash <= hashTarget)
3224 pblock->nNonce = ByteReverse(nNonceFound);
3225 assert(hash == pblock->GetHash());
3227 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3228 CheckWork(pblock.get(), *pwalletMain, reservekey);
3229 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3235 static int64 nHashCounter;
3236 if (nHPSTimerStart == 0)
3238 nHPSTimerStart = GetTimeMillis();
3242 nHashCounter += nHashesDone;
3243 if (GetTimeMillis() - nHPSTimerStart > 4000)
3245 static CCriticalSection cs;
3248 if (GetTimeMillis() - nHPSTimerStart > 4000)
3250 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3251 nHPSTimerStart = GetTimeMillis();
3253 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3254 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3255 static int64 nLogTime;
3256 if (GetTime() - nLogTime > 30 * 60)
3258 nLogTime = GetTime();
3259 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3260 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3266 // Check for stop or if block needs to be rebuilt
3269 if (!fGenerateBitcoins)
3271 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3275 if (nBlockNonce >= 0xffff0000)
3277 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3279 if (pindexPrev != pindexBest)
3282 // Update nTime every few seconds
3283 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3284 nBlockTime = ByteReverse(pblock->nTime);
3289 void static ThreadBitcoinMiner(void* parg)
3291 CWallet* pwallet = (CWallet*)parg;
3294 vnThreadsRunning[3]++;
3295 BitcoinMiner(pwallet);
3296 vnThreadsRunning[3]--;
3298 catch (std::exception& e) {
3299 vnThreadsRunning[3]--;
3300 PrintException(&e, "ThreadBitcoinMiner()");
3302 vnThreadsRunning[3]--;
3303 PrintException(NULL, "ThreadBitcoinMiner()");
3305 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3307 if (vnThreadsRunning[3] == 0)
3309 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3313 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3315 if (fGenerateBitcoins != fGenerate)
3317 fGenerateBitcoins = fGenerate;
3318 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3321 if (fGenerateBitcoins)
3323 int nProcessors = boost::thread::hardware_concurrency();
3324 printf("%d processors\n", nProcessors);
3325 if (nProcessors < 1)
3327 if (fLimitProcessors && nProcessors > nLimitProcessors)
3328 nProcessors = nLimitProcessors;
3329 int nAddThreads = nProcessors - vnThreadsRunning[3];
3330 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3331 for (int i = 0; i < nAddThreads; i++)
3333 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3334 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");