1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include <boost/algorithm/string/replace.hpp>
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 // Name of client reported in the 'version' message. Report the same name
22 // for both bitcoind and bitcoin-qt, to make it harder for attackers to
23 // target servers or GUI users specifically.
24 const std::string CLIENT_NAME("bitcoin-qt");
26 CCriticalSection cs_setpwalletRegistered;
27 set<CWallet*> setpwalletRegistered;
29 CCriticalSection cs_main;
31 static map<uint256, CTransaction> mapTransactions;
32 CCriticalSection cs_mapTransactions;
33 unsigned int nTransactionsUpdated = 0;
34 map<COutPoint, CInPoint> mapNextTx;
36 map<uint256, CBlockIndex*> mapBlockIndex;
37 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
38 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
39 CBlockIndex* pindexGenesisBlock = NULL;
41 CBigNum bnBestChainWork = 0;
42 CBigNum bnBestInvalidWork = 0;
43 uint256 hashBestChain = 0;
44 CBlockIndex* pindexBest = NULL;
45 int64 nTimeBestReceived = 0;
47 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
49 map<uint256, CBlock*> mapOrphanBlocks;
50 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
52 map<uint256, CDataStream*> mapOrphanTransactions;
53 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
60 int fGenerateBitcoins = false;
61 int64 nTransactionFee = 0;
62 int fLimitProcessors = false;
63 int nLimitProcessors = 1;
64 int fMinimizeToTray = true;
65 int fMinimizeOnClose = true;
73 //////////////////////////////////////////////////////////////////////////////
75 // dispatching functions
78 // These functions dispatch to one or all registered wallets
81 void RegisterWallet(CWallet* pwalletIn)
83 CRITICAL_BLOCK(cs_setpwalletRegistered)
85 setpwalletRegistered.insert(pwalletIn);
89 void UnregisterWallet(CWallet* pwalletIn)
91 CRITICAL_BLOCK(cs_setpwalletRegistered)
93 setpwalletRegistered.erase(pwalletIn);
97 // check whether the passed transaction is from us
98 bool static IsFromMe(CTransaction& tx)
100 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
101 if (pwallet->IsFromMe(tx))
106 // get the wallet transaction with the given hash (if it exists)
107 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
109 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
110 if (pwallet->GetTransaction(hashTx,wtx))
115 // erases transaction with the given hash from all wallets
116 void static EraseFromWallets(uint256 hash)
118 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
119 pwallet->EraseFromWallet(hash);
122 // make sure all wallets know about the given transaction, in the given block
123 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
125 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
126 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
129 // notify wallets about a new best chain
130 void static SetBestChain(const CBlockLocator& loc)
132 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
133 pwallet->SetBestChain(loc);
136 // notify wallets about an updated transaction
137 void static UpdatedTransaction(const uint256& hashTx)
139 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
140 pwallet->UpdatedTransaction(hashTx);
144 void static PrintWallets(const CBlock& block)
146 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
147 pwallet->PrintWallet(block);
150 // notify wallets about an incoming inventory (for request counts)
151 void static Inventory(const uint256& hash)
153 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
154 pwallet->Inventory(hash);
157 // ask wallets to resend their transactions
158 void static ResendWalletTransactions()
160 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
161 pwallet->ResendWalletTransactions();
170 //////////////////////////////////////////////////////////////////////////////
172 // mapOrphanTransactions
175 void static AddOrphanTx(const CDataStream& vMsg)
178 CDataStream(vMsg) >> tx;
179 uint256 hash = tx.GetHash();
180 if (mapOrphanTransactions.count(hash))
182 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
183 BOOST_FOREACH(const CTxIn& txin, tx.vin)
184 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
187 void static EraseOrphanTx(uint256 hash)
189 if (!mapOrphanTransactions.count(hash))
191 const CDataStream* pvMsg = mapOrphanTransactions[hash];
193 CDataStream(*pvMsg) >> tx;
194 BOOST_FOREACH(const CTxIn& txin, tx.vin)
196 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
197 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
199 if ((*mi).second == pvMsg)
200 mapOrphanTransactionsByPrev.erase(mi++);
206 mapOrphanTransactions.erase(hash);
216 //////////////////////////////////////////////////////////////////////////////
218 // CTransaction and CTxIndex
221 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
224 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
226 if (!ReadFromDisk(txindexRet.pos))
228 if (prevout.n >= vout.size())
236 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
239 return ReadFromDisk(txdb, prevout, txindex);
242 bool CTransaction::ReadFromDisk(COutPoint prevout)
246 return ReadFromDisk(txdb, prevout, txindex);
249 bool CTransaction::IsStandard() const
251 BOOST_FOREACH(const CTxIn& txin, vin)
253 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
254 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
255 // ~65-byte public keys, plus a few script ops.
256 if (txin.scriptSig.size() > 500)
258 if (!txin.scriptSig.IsPushOnly())
261 BOOST_FOREACH(const CTxOut& txout, vout)
262 if (!::IsStandard(txout.scriptPubKey))
268 // Check transaction inputs, and make sure any
269 // pay-to-script-hash transactions are evaluating IsStandard scripts
271 // Why bother? To avoid denial-of-service attacks; an attacker
272 // can submit a standard HASH... OP_EQUAL transaction,
273 // which will get accepted into blocks. The redemption
274 // script can be anything; an attacker could use a very
275 // expensive-to-check-upon-redemption script like:
276 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
278 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
281 return true; // Allow non-standard on testnet
284 return true; // Coinbases are allowed to have any input
286 for (int i = 0; i < vin.size(); i++)
288 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
290 vector<vector<unsigned char> > vSolutions;
291 txnouttype whichType;
292 // get the scriptPubKey corresponding to this input:
293 const CScript& prevScript = prev.scriptPubKey;
294 if (!Solver(prevScript, whichType, vSolutions))
296 if (whichType == TX_SCRIPTHASH)
298 vector<vector<unsigned char> > stack;
300 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
304 CScript subscript(stack.back().begin(), stack.back().end());
305 if (!::IsStandard(subscript))
314 CTransaction::GetLegacySigOpCount() const
317 BOOST_FOREACH(const CTxIn& txin, vin)
319 nSigOps += txin.scriptSig.GetSigOpCount(false);
321 BOOST_FOREACH(const CTxOut& txout, vout)
323 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
329 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
341 // Load the block this tx is in
343 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
345 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
350 // Update the tx's hashBlock
351 hashBlock = pblock->GetHash();
353 // Locate the transaction
354 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
355 if (pblock->vtx[nIndex] == *(CTransaction*)this)
357 if (nIndex == pblock->vtx.size())
359 vMerkleBranch.clear();
361 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
365 // Fill in merkle branch
366 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
369 // Is the tx in a block that's in the main chain
370 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
371 if (mi == mapBlockIndex.end())
373 CBlockIndex* pindex = (*mi).second;
374 if (!pindex || !pindex->IsInMainChain())
377 return pindexBest->nHeight - pindex->nHeight + 1;
386 bool CTransaction::CheckTransaction() const
388 // Basic checks that don't depend on any context
390 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
392 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
394 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
395 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
397 // Check for negative or overflow output values
399 BOOST_FOREACH(const CTxOut& txout, vout)
401 if (txout.nValue < 0)
402 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
403 if (txout.nValue > MAX_MONEY)
404 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
405 nValueOut += txout.nValue;
406 if (!MoneyRange(nValueOut))
407 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
410 // Check for duplicate inputs
411 set<COutPoint> vInOutPoints;
412 BOOST_FOREACH(const CTxIn& txin, vin)
414 if (vInOutPoints.count(txin.prevout))
416 vInOutPoints.insert(txin.prevout);
421 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
422 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
426 BOOST_FOREACH(const CTxIn& txin, vin)
427 if (txin.prevout.IsNull())
428 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
434 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
437 *pfMissingInputs = false;
439 if (!CheckTransaction())
440 return error("AcceptToMemoryPool() : CheckTransaction failed");
442 // Coinbase is only valid in a block, not as a loose transaction
444 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
446 // To help v0.1.5 clients who would see it as a negative number
447 if ((int64)nLockTime > std::numeric_limits<int>::max())
448 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
450 // Rather not work on nonstandard transactions (unless -testnet)
451 if (!fTestNet && !IsStandard())
452 return error("AcceptToMemoryPool() : nonstandard transaction type");
454 // Do we already have it?
455 uint256 hash = GetHash();
456 CRITICAL_BLOCK(cs_mapTransactions)
457 if (mapTransactions.count(hash))
460 if (txdb.ContainsTx(hash))
463 // Check for conflicts with in-memory transactions
464 CTransaction* ptxOld = NULL;
465 for (int i = 0; i < vin.size(); i++)
467 COutPoint outpoint = vin[i].prevout;
468 if (mapNextTx.count(outpoint))
470 // Disable replacement feature for now
473 // Allow replacing with a newer version of the same transaction
476 ptxOld = mapNextTx[outpoint].ptx;
477 if (ptxOld->IsFinal())
479 if (!IsNewerThan(*ptxOld))
481 for (int i = 0; i < vin.size(); i++)
483 COutPoint outpoint = vin[i].prevout;
484 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
494 map<uint256, CTxIndex> mapUnused;
495 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs))
498 *pfMissingInputs = true;
499 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
502 // Check for non-standard pay-to-script-hash in inputs
503 if (!AreInputsStandard(mapInputs))
504 return error("AcceptToMemoryPool() : nonstandard transaction input");
506 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
507 int nSigOps = GetSigOpCount(mapInputs);
508 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
510 // Don't accept it if it can't get into a block
511 if (nFees < GetMinFee(1000, true, GMF_RELAY))
512 return error("AcceptToMemoryPool() : not enough fees");
514 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
515 // attacks disallow transactions with more than one SigOp per 65 bytes.
516 // 65 bytes because that is the minimum size of an ECDSA signature
517 if (nSigOps > nSize / 65 || nSize < 100)
518 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
520 // Continuously rate-limit free transactions
521 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
522 // be annoying or make other's transactions take longer to confirm.
523 if (nFees < MIN_RELAY_TX_FEE)
525 static CCriticalSection cs;
526 static double dFreeCount;
527 static int64 nLastTime;
528 int64 nNow = GetTime();
532 // Use an exponentially decaying ~10-minute window:
533 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
535 // -limitfreerelay unit is thousand-bytes-per-minute
536 // At default rate it would take over a month to fill 1GB
537 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
538 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
540 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
545 // Check against previous transactions
546 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
547 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
550 *pfMissingInputs = true;
551 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
555 // Store transaction in memory
556 CRITICAL_BLOCK(cs_mapTransactions)
560 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
561 ptxOld->RemoveFromMemoryPool();
563 AddToMemoryPoolUnchecked();
566 ///// are we sure this is ok when loading transactions or restoring block txes
567 // If updated, erase old tx from wallet
569 EraseFromWallets(ptxOld->GetHash());
571 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
575 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
578 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
581 uint64 nPooledTx = 0;
583 bool CTransaction::AddToMemoryPoolUnchecked()
585 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
586 // Add to memory pool without checking anything. Don't call this directly,
587 // call AcceptToMemoryPool to properly check the transaction first.
588 CRITICAL_BLOCK(cs_mapTransactions)
590 uint256 hash = GetHash();
591 mapTransactions[hash] = *this;
592 for (int i = 0; i < vin.size(); i++)
593 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
594 nTransactionsUpdated++;
601 bool CTransaction::RemoveFromMemoryPool()
603 // Remove transaction from memory pool
604 CRITICAL_BLOCK(cs_mapTransactions)
606 BOOST_FOREACH(const CTxIn& txin, vin)
607 mapNextTx.erase(txin.prevout);
608 mapTransactions.erase(GetHash());
609 nTransactionsUpdated++;
620 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
622 if (hashBlock == 0 || nIndex == -1)
625 // Find the block it claims to be in
626 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
627 if (mi == mapBlockIndex.end())
629 CBlockIndex* pindex = (*mi).second;
630 if (!pindex || !pindex->IsInMainChain())
633 // Make sure the merkle branch connects to this block
634 if (!fMerkleVerified)
636 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
638 fMerkleVerified = true;
642 return pindexBest->nHeight - pindex->nHeight + 1;
646 int CMerkleTx::GetBlocksToMaturity() const
650 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
654 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
658 if (!IsInMainChain() && !ClientConnectInputs())
660 return CTransaction::AcceptToMemoryPool(txdb, false);
664 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
668 bool CMerkleTx::AcceptToMemoryPool()
671 return AcceptToMemoryPool(txdb);
676 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
678 CRITICAL_BLOCK(cs_mapTransactions)
680 // Add previous supporting transactions first
681 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
683 if (!tx.IsCoinBase())
685 uint256 hash = tx.GetHash();
686 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
687 tx.AcceptToMemoryPool(txdb, fCheckInputs);
690 return AcceptToMemoryPool(txdb, fCheckInputs);
695 bool CWalletTx::AcceptWalletTransaction()
698 return AcceptWalletTransaction(txdb);
701 int CTxIndex::GetDepthInMainChain() const
705 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
707 // Find the block in the index
708 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
709 if (mi == mapBlockIndex.end())
711 CBlockIndex* pindex = (*mi).second;
712 if (!pindex || !pindex->IsInMainChain())
714 return 1 + nBestHeight - pindex->nHeight;
726 //////////////////////////////////////////////////////////////////////////////
728 // CBlock and CBlockIndex
731 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
733 if (!fReadTransactions)
735 *this = pindex->GetBlockHeader();
738 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
740 if (GetHash() != pindex->GetBlockHash())
741 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
745 uint256 static GetOrphanRoot(const CBlock* pblock)
747 // Work back to the first block in the orphan chain
748 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
749 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
750 return pblock->GetHash();
753 int64 static GetBlockValue(int nHeight, int64 nFees)
755 int64 nSubsidy = 50 * COIN;
757 // Subsidy is cut in half every 4 years
758 nSubsidy >>= (nHeight / 210000);
760 return nSubsidy + nFees;
763 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
764 static const int64 nTargetSpacing = 10 * 60;
765 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
768 // minimum amount of work that could possibly be required nTime after
769 // minimum work required was nBase
771 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
774 bnResult.SetCompact(nBase);
775 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
777 // Maximum 400% adjustment...
779 // ... in best-case exactly 4-times-normal target time
780 nTime -= nTargetTimespan*4;
782 if (bnResult > bnProofOfWorkLimit)
783 bnResult = bnProofOfWorkLimit;
784 return bnResult.GetCompact();
787 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
791 if (pindexLast == NULL)
792 return bnProofOfWorkLimit.GetCompact();
794 // Only change once per interval
795 if ((pindexLast->nHeight+1) % nInterval != 0)
796 return pindexLast->nBits;
798 // Go back by what we want to be 14 days worth of blocks
799 const CBlockIndex* pindexFirst = pindexLast;
800 for (int i = 0; pindexFirst && i < nInterval-1; i++)
801 pindexFirst = pindexFirst->pprev;
804 // Limit adjustment step
805 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
806 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
807 if (nActualTimespan < nTargetTimespan/4)
808 nActualTimespan = nTargetTimespan/4;
809 if (nActualTimespan > nTargetTimespan*4)
810 nActualTimespan = nTargetTimespan*4;
814 bnNew.SetCompact(pindexLast->nBits);
815 bnNew *= nActualTimespan;
816 bnNew /= nTargetTimespan;
818 if (bnNew > bnProofOfWorkLimit)
819 bnNew = bnProofOfWorkLimit;
822 printf("GetNextWorkRequired RETARGET\n");
823 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
824 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
825 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
827 return bnNew.GetCompact();
830 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
833 bnTarget.SetCompact(nBits);
836 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
837 return error("CheckProofOfWork() : nBits below minimum work");
839 // Check proof of work matches claimed amount
840 if (hash > bnTarget.getuint256())
841 return error("CheckProofOfWork() : hash doesn't match nBits");
846 // Return maximum amount of blocks that other nodes claim to have
847 int GetNumBlocksOfPeers()
849 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
852 bool IsInitialBlockDownload()
854 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
856 static int64 nLastUpdate;
857 static CBlockIndex* pindexLastBest;
858 if (pindexBest != pindexLastBest)
860 pindexLastBest = pindexBest;
861 nLastUpdate = GetTime();
863 return (GetTime() - nLastUpdate < 10 &&
864 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
867 void static InvalidChainFound(CBlockIndex* pindexNew)
869 if (pindexNew->bnChainWork > bnBestInvalidWork)
871 bnBestInvalidWork = pindexNew->bnChainWork;
872 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
875 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());
876 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
877 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
878 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
891 bool CTransaction::DisconnectInputs(CTxDB& txdb)
893 // Relinquish previous transactions' spent pointers
896 BOOST_FOREACH(const CTxIn& txin, vin)
898 COutPoint prevout = txin.prevout;
900 // Get prev txindex from disk
902 if (!txdb.ReadTxIndex(prevout.hash, txindex))
903 return error("DisconnectInputs() : ReadTxIndex failed");
905 if (prevout.n >= txindex.vSpent.size())
906 return error("DisconnectInputs() : prevout.n out of range");
908 // Mark outpoint as not spent
909 txindex.vSpent[prevout.n].SetNull();
912 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
913 return error("DisconnectInputs() : UpdateTxIndex failed");
917 // Remove transaction from index
918 if (!txdb.EraseTxIndex(*this))
919 return error("DisconnectInputs() : EraseTxPos failed");
925 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
926 bool fBlock, bool fMiner, MapPrevTx& inputsRet)
929 return true; // Coinbase transactions have no inputs to fetch.
931 for (int i = 0; i < vin.size(); i++)
933 COutPoint prevout = vin[i].prevout;
934 if (inputsRet.count(prevout.hash))
935 continue; // Got it already
938 CTxIndex& txindex = inputsRet[prevout.hash].first;
940 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
942 // Get txindex from current proposed changes
943 txindex = mapTestPool.find(prevout.hash)->second;
947 // Read txindex from txdb
948 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
950 if (!fFound && (fBlock || fMiner))
951 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());
954 CTransaction& txPrev = inputsRet[prevout.hash].second;
955 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
957 // Get prev tx from single transactions in memory
958 CRITICAL_BLOCK(cs_mapTransactions)
960 if (!mapTransactions.count(prevout.hash))
961 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
962 txPrev = mapTransactions[prevout.hash];
965 txindex.vSpent.resize(txPrev.vout.size());
969 // Get prev tx from disk
970 if (!txPrev.ReadFromDisk(txindex.pos))
971 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
975 // Make sure all prevout.n's are valid:
976 for (int i = 0; i < vin.size(); i++)
978 const COutPoint prevout = vin[i].prevout;
979 assert(inputsRet.count(prevout.hash) != 0);
980 const CTxIndex& txindex = inputsRet[prevout.hash].first;
981 const CTransaction& txPrev = inputsRet[prevout.hash].second;
982 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
983 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()));
989 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
991 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
992 if (mi == inputs.end())
993 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
995 const CTransaction& txPrev = (mi->second).second;
996 if (input.prevout.n >= txPrev.vout.size())
997 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
999 return txPrev.vout[input.prevout.n];
1002 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1008 for (int i = 0; i < vin.size(); i++)
1010 nResult += GetOutputFor(vin[i], inputs).nValue;
1016 int CTransaction::GetSigOpCount(const MapPrevTx& inputs) const
1022 for (int i = 0; i < vin.size(); i++)
1024 nSigOps += GetOutputFor(vin[i], inputs).scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1029 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1030 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1031 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner)
1033 // Take over previous transactions' spent pointers
1034 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1035 // fMiner is true when called from the internal bitcoin miner
1036 // ... both are false when called from CTransaction::AcceptToMemoryPool
1041 for (int i = 0; i < vin.size(); i++)
1043 COutPoint prevout = vin[i].prevout;
1044 assert(inputs.count(prevout.hash) > 0);
1045 CTxIndex& txindex = inputs[prevout.hash].first;
1046 CTransaction& txPrev = inputs[prevout.hash].second;
1048 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1049 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()));
1051 // If prev is coinbase, check that it's matured
1052 if (txPrev.IsCoinBase())
1053 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1054 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1055 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1057 // Check for conflicts (double-spend)
1058 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1059 // for an attacker to attempt to split the network.
1060 if (!txindex.vSpent[prevout.n].IsNull())
1061 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());
1063 // Check for negative or overflow input values
1064 nValueIn += txPrev.vout[prevout.n].nValue;
1065 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1066 return DoS(100, error("ConnectInputs() : txin values out of range"));
1068 bool fStrictPayToScriptHash = true;
1071 // To avoid being on the short end of a block-chain split,
1072 // don't do secondary validation of pay-to-script-hash transactions
1073 // until blocks with timestamps after paytoscripthashtime:
1074 int64 nEvalSwitchTime = GetArg("paytoscripthashtime", 1329264000); // Feb 15, 2012
1075 fStrictPayToScriptHash = (pindexBlock->nTime >= nEvalSwitchTime);
1077 // if !fBlock, then always be strict-- don't accept
1078 // invalid-under-new-rules pay-to-script-hash transactions into
1079 // our memory pool (don't relay them, don't include them
1080 // in blocks we mine).
1082 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1083 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1084 // still computed and checked, and any change will be caught at the next checkpoint.
1085 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1088 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1089 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1092 // Mark outpoints as spent
1093 txindex.vSpent[prevout.n] = posThisTx;
1096 if (fBlock || fMiner)
1098 mapTestPool[prevout.hash] = txindex;
1102 if (nValueIn < GetValueOut())
1103 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1105 // Tally transaction fees
1106 int64 nTxFee = nValueIn - GetValueOut();
1108 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1110 if (!MoneyRange(nFees))
1111 return DoS(100, error("ConnectInputs() : nFees out of range"));
1118 bool CTransaction::ClientConnectInputs()
1123 // Take over previous transactions' spent pointers
1124 CRITICAL_BLOCK(cs_mapTransactions)
1127 for (int i = 0; i < vin.size(); i++)
1129 // Get prev tx from single transactions in memory
1130 COutPoint prevout = vin[i].prevout;
1131 if (!mapTransactions.count(prevout.hash))
1133 CTransaction& txPrev = mapTransactions[prevout.hash];
1135 if (prevout.n >= txPrev.vout.size())
1139 if (!VerifySignature(txPrev, *this, i, true, 0))
1140 return error("ConnectInputs() : VerifySignature failed");
1142 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1143 ///// this has to go away now that posNext is gone
1144 // // Check for conflicts
1145 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1146 // return error("ConnectInputs() : prev tx already used");
1148 // // Flag outpoints as used
1149 // txPrev.vout[prevout.n].posNext = posThisTx;
1151 nValueIn += txPrev.vout[prevout.n].nValue;
1153 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1154 return error("ClientConnectInputs() : txin values out of range");
1156 if (GetValueOut() > nValueIn)
1166 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1168 // Disconnect in reverse order
1169 for (int i = vtx.size()-1; i >= 0; i--)
1170 if (!vtx[i].DisconnectInputs(txdb))
1173 // Update block index on disk without changing it in memory.
1174 // The memory index structure will be changed after the db commits.
1177 CDiskBlockIndex blockindexPrev(pindex->pprev);
1178 blockindexPrev.hashNext = 0;
1179 if (!txdb.WriteBlockIndex(blockindexPrev))
1180 return error("DisconnectBlock() : WriteBlockIndex failed");
1186 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1188 // Check it again in case a previous version let a bad block in
1192 //// issue here: it doesn't know the version
1193 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1195 map<uint256, CTxIndex> mapQueuedChanges;
1198 BOOST_FOREACH(CTransaction& tx, vtx)
1200 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1201 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1203 MapPrevTx mapInputs;
1204 if (!tx.IsCoinBase())
1206 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs))
1209 int nTxOps = tx.GetSigOpCount(mapInputs);
1211 if (nSigOps > MAX_BLOCK_SIGOPS)
1212 return DoS(100, error("ConnectBlock() : too many sigops"));
1213 // There is a different MAX_BLOCK_SIGOPS check in AcceptBlock();
1214 // a block must satisfy both to make it into the best-chain
1215 // (AcceptBlock() is always called before ConnectBlock())
1217 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1219 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false))
1223 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1226 // Write queued txindex changes
1227 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1229 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1230 return error("ConnectBlock() : UpdateTxIndex failed");
1233 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1236 // Update block index on disk without changing it in memory.
1237 // The memory index structure will be changed after the db commits.
1240 CDiskBlockIndex blockindexPrev(pindex->pprev);
1241 blockindexPrev.hashNext = pindex->GetBlockHash();
1242 if (!txdb.WriteBlockIndex(blockindexPrev))
1243 return error("ConnectBlock() : WriteBlockIndex failed");
1246 // Watch for transactions paying to me
1247 BOOST_FOREACH(CTransaction& tx, vtx)
1248 SyncWithWallets(tx, this, true);
1253 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1255 printf("REORGANIZE\n");
1258 CBlockIndex* pfork = pindexBest;
1259 CBlockIndex* plonger = pindexNew;
1260 while (pfork != plonger)
1262 while (plonger->nHeight > pfork->nHeight)
1263 if (!(plonger = plonger->pprev))
1264 return error("Reorganize() : plonger->pprev is null");
1265 if (pfork == plonger)
1267 if (!(pfork = pfork->pprev))
1268 return error("Reorganize() : pfork->pprev is null");
1271 // List of what to disconnect
1272 vector<CBlockIndex*> vDisconnect;
1273 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1274 vDisconnect.push_back(pindex);
1276 // List of what to connect
1277 vector<CBlockIndex*> vConnect;
1278 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1279 vConnect.push_back(pindex);
1280 reverse(vConnect.begin(), vConnect.end());
1282 // Disconnect shorter branch
1283 vector<CTransaction> vResurrect;
1284 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1287 if (!block.ReadFromDisk(pindex))
1288 return error("Reorganize() : ReadFromDisk for disconnect failed");
1289 if (!block.DisconnectBlock(txdb, pindex))
1290 return error("Reorganize() : DisconnectBlock failed");
1292 // Queue memory transactions to resurrect
1293 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1294 if (!tx.IsCoinBase())
1295 vResurrect.push_back(tx);
1298 // Connect longer branch
1299 vector<CTransaction> vDelete;
1300 for (int i = 0; i < vConnect.size(); i++)
1302 CBlockIndex* pindex = vConnect[i];
1304 if (!block.ReadFromDisk(pindex))
1305 return error("Reorganize() : ReadFromDisk for connect failed");
1306 if (!block.ConnectBlock(txdb, pindex))
1310 return error("Reorganize() : ConnectBlock failed");
1313 // Queue memory transactions to delete
1314 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1315 vDelete.push_back(tx);
1317 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1318 return error("Reorganize() : WriteHashBestChain failed");
1320 // Make sure it's successfully written to disk before changing memory structure
1321 if (!txdb.TxnCommit())
1322 return error("Reorganize() : TxnCommit failed");
1324 // Disconnect shorter branch
1325 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1327 pindex->pprev->pnext = NULL;
1329 // Connect longer branch
1330 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1332 pindex->pprev->pnext = pindex;
1334 // Resurrect memory transactions that were in the disconnected branch
1335 BOOST_FOREACH(CTransaction& tx, vResurrect)
1336 tx.AcceptToMemoryPool(txdb, false);
1338 // Delete redundant memory transactions that are in the connected branch
1339 BOOST_FOREACH(CTransaction& tx, vDelete)
1340 tx.RemoveFromMemoryPool();
1347 runCommand(std::string strCommand)
1349 int nErr = ::system(strCommand.c_str());
1351 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1354 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1356 uint256 hash = GetHash();
1359 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1361 txdb.WriteHashBestChain(hash);
1362 if (!txdb.TxnCommit())
1363 return error("SetBestChain() : TxnCommit failed");
1364 pindexGenesisBlock = pindexNew;
1366 else if (hashPrevBlock == hashBestChain)
1368 // Adding to current best branch
1369 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1372 InvalidChainFound(pindexNew);
1373 return error("SetBestChain() : ConnectBlock failed");
1375 if (!txdb.TxnCommit())
1376 return error("SetBestChain() : TxnCommit failed");
1378 // Add to current best branch
1379 pindexNew->pprev->pnext = pindexNew;
1381 // Delete redundant memory transactions
1382 BOOST_FOREACH(CTransaction& tx, vtx)
1383 tx.RemoveFromMemoryPool();
1388 if (!Reorganize(txdb, pindexNew))
1391 InvalidChainFound(pindexNew);
1392 return error("SetBestChain() : Reorganize failed");
1396 // Update best block in wallet (so we can detect restored wallets)
1397 bool fIsInitialDownload = IsInitialBlockDownload();
1398 if (!fIsInitialDownload)
1400 const CBlockLocator locator(pindexNew);
1401 ::SetBestChain(locator);
1405 hashBestChain = hash;
1406 pindexBest = pindexNew;
1407 nBestHeight = pindexBest->nHeight;
1408 bnBestChainWork = pindexNew->bnChainWork;
1409 nTimeBestReceived = GetTime();
1410 nTransactionsUpdated++;
1411 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1413 std::string strCmd = GetArg("-blocknotify", "");
1415 if (!fIsInitialDownload && !strCmd.empty())
1417 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1418 boost::thread t(runCommand, strCmd); // thread runs free
1425 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1427 // Check for duplicate
1428 uint256 hash = GetHash();
1429 if (mapBlockIndex.count(hash))
1430 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1432 // Construct new block index object
1433 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1435 return error("AddToBlockIndex() : new CBlockIndex failed");
1436 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1437 pindexNew->phashBlock = &((*mi).first);
1438 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1439 if (miPrev != mapBlockIndex.end())
1441 pindexNew->pprev = (*miPrev).second;
1442 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1444 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1448 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1449 if (!txdb.TxnCommit())
1453 if (pindexNew->bnChainWork > bnBestChainWork)
1454 if (!SetBestChain(txdb, pindexNew))
1459 if (pindexNew == pindexBest)
1461 // Notify UI to display prev block's coinbase if it was ours
1462 static uint256 hashPrevBestCoinBase;
1463 UpdatedTransaction(hashPrevBestCoinBase);
1464 hashPrevBestCoinBase = vtx[0].GetHash();
1474 bool CBlock::CheckBlock() const
1476 // These are checks that are independent of context
1477 // that can be verified before saving an orphan block.
1480 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1481 return DoS(100, error("CheckBlock() : size limits failed"));
1483 // Check proof of work matches claimed amount
1484 if (!CheckProofOfWork(GetHash(), nBits))
1485 return DoS(50, error("CheckBlock() : proof of work failed"));
1488 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1489 return error("CheckBlock() : block timestamp too far in the future");
1491 // First transaction must be coinbase, the rest must not be
1492 if (vtx.empty() || !vtx[0].IsCoinBase())
1493 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1494 for (int i = 1; i < vtx.size(); i++)
1495 if (vtx[i].IsCoinBase())
1496 return DoS(100, error("CheckBlock() : more than one coinbase"));
1498 // Check transactions
1499 BOOST_FOREACH(const CTransaction& tx, vtx)
1500 if (!tx.CheckTransaction())
1501 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1503 // Pre-pay-to-script-hash (before version 0.6), this is how sigops
1504 // were counted; there is another check in ConnectBlock when
1505 // transaction inputs are fetched to count pay-to-script-hash sigops:
1507 BOOST_FOREACH(const CTransaction& tx, vtx)
1509 nSigOps += tx.GetLegacySigOpCount();
1511 if (nSigOps > MAX_BLOCK_SIGOPS)
1512 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1515 if (hashMerkleRoot != BuildMerkleTree())
1516 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1521 bool CBlock::AcceptBlock()
1523 // Check for duplicate
1524 uint256 hash = GetHash();
1525 if (mapBlockIndex.count(hash))
1526 return error("AcceptBlock() : block already in mapBlockIndex");
1528 // Get prev block index
1529 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1530 if (mi == mapBlockIndex.end())
1531 return DoS(10, error("AcceptBlock() : prev block not found"));
1532 CBlockIndex* pindexPrev = (*mi).second;
1533 int nHeight = pindexPrev->nHeight+1;
1535 // Check proof of work
1536 if (nBits != GetNextWorkRequired(pindexPrev))
1537 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1539 // Check timestamp against prev
1540 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1541 return error("AcceptBlock() : block's timestamp is too early");
1543 // Check that all transactions are finalized
1544 BOOST_FOREACH(const CTransaction& tx, vtx)
1545 if (!tx.IsFinal(nHeight, GetBlockTime()))
1546 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1548 // Check that the block chain matches the known block chain up to a checkpoint
1549 if (!Checkpoints::CheckBlock(nHeight, hash))
1550 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1552 // Write block to history file
1553 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1554 return error("AcceptBlock() : out of disk space");
1555 unsigned int nFile = -1;
1556 unsigned int nBlockPos = 0;
1557 if (!WriteToDisk(nFile, nBlockPos))
1558 return error("AcceptBlock() : WriteToDisk failed");
1559 if (!AddToBlockIndex(nFile, nBlockPos))
1560 return error("AcceptBlock() : AddToBlockIndex failed");
1562 // Relay inventory, but don't relay old inventory during initial block download
1563 if (hashBestChain == hash)
1564 CRITICAL_BLOCK(cs_vNodes)
1565 BOOST_FOREACH(CNode* pnode, vNodes)
1566 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1567 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1572 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1574 // Check for duplicate
1575 uint256 hash = pblock->GetHash();
1576 if (mapBlockIndex.count(hash))
1577 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1578 if (mapOrphanBlocks.count(hash))
1579 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1581 // Preliminary checks
1582 if (!pblock->CheckBlock())
1583 return error("ProcessBlock() : CheckBlock FAILED");
1585 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1586 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1588 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1589 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1592 pfrom->Misbehaving(100);
1593 return error("ProcessBlock() : block with timestamp before last checkpoint");
1596 bnNewBlock.SetCompact(pblock->nBits);
1598 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1599 if (bnNewBlock > bnRequired)
1601 pfrom->Misbehaving(100);
1602 return error("ProcessBlock() : block with too little proof-of-work");
1607 // If don't already have its previous block, shunt it off to holding area until we get it
1608 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1610 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1611 CBlock* pblock2 = new CBlock(*pblock);
1612 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1613 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1615 // Ask this guy to fill in what we're missing
1617 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1622 if (!pblock->AcceptBlock())
1623 return error("ProcessBlock() : AcceptBlock FAILED");
1625 // Recursively process any orphan blocks that depended on this one
1626 vector<uint256> vWorkQueue;
1627 vWorkQueue.push_back(hash);
1628 for (int i = 0; i < vWorkQueue.size(); i++)
1630 uint256 hashPrev = vWorkQueue[i];
1631 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1632 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1635 CBlock* pblockOrphan = (*mi).second;
1636 if (pblockOrphan->AcceptBlock())
1637 vWorkQueue.push_back(pblockOrphan->GetHash());
1638 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1639 delete pblockOrphan;
1641 mapOrphanBlocksByPrev.erase(hashPrev);
1644 printf("ProcessBlock: ACCEPTED\n");
1655 bool CheckDiskSpace(uint64 nAdditionalBytes)
1657 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1659 // Check for 15MB because database could create another 10MB log file at any time
1660 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1663 string strMessage = _("Warning: Disk space is low ");
1664 strMiscWarning = strMessage;
1665 printf("*** %s\n", strMessage.c_str());
1666 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1667 CreateThread(Shutdown, NULL);
1673 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1677 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1680 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1682 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1691 static unsigned int nCurrentBlockFile = 1;
1693 FILE* AppendBlockFile(unsigned int& nFileRet)
1698 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1701 if (fseek(file, 0, SEEK_END) != 0)
1703 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1704 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1706 nFileRet = nCurrentBlockFile;
1710 nCurrentBlockFile++;
1714 bool LoadBlockIndex(bool fAllowNew)
1718 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1719 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1720 pchMessageStart[0] = 0xfa;
1721 pchMessageStart[1] = 0xbf;
1722 pchMessageStart[2] = 0xb5;
1723 pchMessageStart[3] = 0xda;
1730 if (!txdb.LoadBlockIndex())
1735 // Init with genesis block
1737 if (mapBlockIndex.empty())
1743 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1744 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1745 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1746 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1747 // vMerkleTree: 4a5e1e
1750 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1752 txNew.vin.resize(1);
1753 txNew.vout.resize(1);
1754 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1755 txNew.vout[0].nValue = 50 * COIN;
1756 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1758 block.vtx.push_back(txNew);
1759 block.hashPrevBlock = 0;
1760 block.hashMerkleRoot = block.BuildMerkleTree();
1762 block.nTime = 1231006505;
1763 block.nBits = 0x1d00ffff;
1764 block.nNonce = 2083236893;
1768 block.nTime = 1296688602;
1769 block.nBits = 0x1d07fff8;
1770 block.nNonce = 384568319;
1774 printf("%s\n", block.GetHash().ToString().c_str());
1775 printf("%s\n", hashGenesisBlock.ToString().c_str());
1776 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1777 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1779 assert(block.GetHash() == hashGenesisBlock);
1781 // Start new block file
1783 unsigned int nBlockPos;
1784 if (!block.WriteToDisk(nFile, nBlockPos))
1785 return error("LoadBlockIndex() : writing genesis block to disk failed");
1786 if (!block.AddToBlockIndex(nFile, nBlockPos))
1787 return error("LoadBlockIndex() : genesis block not accepted");
1795 void PrintBlockTree()
1797 // precompute tree structure
1798 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1799 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1801 CBlockIndex* pindex = (*mi).second;
1802 mapNext[pindex->pprev].push_back(pindex);
1804 //while (rand() % 3 == 0)
1805 // mapNext[pindex->pprev].push_back(pindex);
1808 vector<pair<int, CBlockIndex*> > vStack;
1809 vStack.push_back(make_pair(0, pindexGenesisBlock));
1812 while (!vStack.empty())
1814 int nCol = vStack.back().first;
1815 CBlockIndex* pindex = vStack.back().second;
1818 // print split or gap
1819 if (nCol > nPrevCol)
1821 for (int i = 0; i < nCol-1; i++)
1825 else if (nCol < nPrevCol)
1827 for (int i = 0; i < nCol; i++)
1834 for (int i = 0; i < nCol; i++)
1839 block.ReadFromDisk(pindex);
1840 printf("%d (%u,%u) %s %s tx %d",
1844 block.GetHash().ToString().substr(0,20).c_str(),
1845 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1848 PrintWallets(block);
1850 // put the main timechain first
1851 vector<CBlockIndex*>& vNext = mapNext[pindex];
1852 for (int i = 0; i < vNext.size(); i++)
1854 if (vNext[i]->pnext)
1856 swap(vNext[0], vNext[i]);
1862 for (int i = 0; i < vNext.size(); i++)
1863 vStack.push_back(make_pair(nCol+i, vNext[i]));
1876 //////////////////////////////////////////////////////////////////////////////
1881 map<uint256, CAlert> mapAlerts;
1882 CCriticalSection cs_mapAlerts;
1884 string GetWarnings(string strFor)
1887 string strStatusBar;
1889 if (GetBoolArg("-testsafemode"))
1892 // Misc warnings like out of disk space and clock is wrong
1893 if (strMiscWarning != "")
1896 strStatusBar = strMiscWarning;
1899 // Longer invalid proof-of-work chain
1900 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1903 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1907 CRITICAL_BLOCK(cs_mapAlerts)
1909 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1911 const CAlert& alert = item.second;
1912 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1914 nPriority = alert.nPriority;
1915 strStatusBar = alert.strStatusBar;
1920 if (strFor == "statusbar")
1921 return strStatusBar;
1922 else if (strFor == "rpc")
1924 assert(!"GetWarnings() : invalid parameter");
1928 bool CAlert::ProcessAlert()
1930 if (!CheckSignature())
1935 CRITICAL_BLOCK(cs_mapAlerts)
1937 // Cancel previous alerts
1938 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1940 const CAlert& alert = (*mi).second;
1943 printf("cancelling alert %d\n", alert.nID);
1944 mapAlerts.erase(mi++);
1946 else if (!alert.IsInEffect())
1948 printf("expiring alert %d\n", alert.nID);
1949 mapAlerts.erase(mi++);
1955 // Check if this alert has been cancelled
1956 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1958 const CAlert& alert = item.second;
1959 if (alert.Cancels(*this))
1961 printf("alert already cancelled by %d\n", alert.nID);
1967 mapAlerts.insert(make_pair(GetHash(), *this));
1970 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1982 //////////////////////////////////////////////////////////////////////////////
1988 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1992 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1993 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1995 // Don't know what it is, just say we already got one
2002 // The message start string is designed to be unlikely to occur in normal data.
2003 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2004 // a large 4-byte int at any alignment.
2005 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2008 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2010 static map<CService, vector<unsigned char> > mapReuseKey;
2011 RandAddSeedPerfmon();
2013 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2014 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2016 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2018 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2026 if (strCommand == "version")
2028 // Each connection can only send one version message
2029 if (pfrom->nVersion != 0)
2031 pfrom->Misbehaving(1);
2039 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2040 if (pfrom->nVersion == 10300)
2041 pfrom->nVersion = 300;
2042 if (pfrom->nVersion >= 106 && !vRecv.empty())
2043 vRecv >> addrFrom >> nNonce;
2044 if (pfrom->nVersion >= 106 && !vRecv.empty())
2045 vRecv >> pfrom->strSubVer;
2046 if (pfrom->nVersion >= 209 && !vRecv.empty())
2047 vRecv >> pfrom->nStartingHeight;
2049 if (pfrom->nVersion == 0)
2052 // Disconnect if we connected to ourself
2053 if (nNonce == nLocalHostNonce && nNonce > 1)
2055 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2056 pfrom->fDisconnect = true;
2060 // Be shy and don't send version until we hear
2061 if (pfrom->fInbound)
2062 pfrom->PushVersion();
2064 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2066 AddTimeData(pfrom->addr, nTime);
2069 if (pfrom->nVersion >= 209)
2070 pfrom->PushMessage("verack");
2071 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2072 if (pfrom->nVersion < 209)
2073 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2075 if (!pfrom->fInbound)
2077 // Advertise our address
2078 if (addrLocalHost.IsRoutable() && !fUseProxy)
2080 CAddress addr(addrLocalHost);
2081 addr.nTime = GetAdjustedTime();
2082 pfrom->PushAddress(addr);
2085 // Get recent addresses
2086 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2088 pfrom->PushMessage("getaddr");
2089 pfrom->fGetAddr = true;
2093 // Ask the first connected node for block updates
2094 static int nAskedForBlocks = 0;
2095 if (!pfrom->fClient &&
2096 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2097 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2100 pfrom->PushGetBlocks(pindexBest, uint256(0));
2104 CRITICAL_BLOCK(cs_mapAlerts)
2105 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2106 item.second.RelayTo(pfrom);
2108 pfrom->fSuccessfullyConnected = true;
2110 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2112 cPeerBlockCounts.input(pfrom->nStartingHeight);
2116 else if (pfrom->nVersion == 0)
2118 // Must have a version message before anything else
2119 pfrom->Misbehaving(1);
2124 else if (strCommand == "verack")
2126 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2130 else if (strCommand == "addr")
2132 vector<CAddress> vAddr;
2135 // Don't want addr from older versions unless seeding
2136 if (pfrom->nVersion < 209)
2138 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2140 if (vAddr.size() > 1000)
2142 pfrom->Misbehaving(20);
2143 return error("message addr size() = %d", vAddr.size());
2146 // Store the new addresses
2149 int64 nNow = GetAdjustedTime();
2150 int64 nSince = nNow - 10 * 60;
2151 BOOST_FOREACH(CAddress& addr, vAddr)
2155 // ignore IPv6 for now, since it isn't implemented anyway
2158 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2159 addr.nTime = nNow - 5 * 24 * 60 * 60;
2160 AddAddress(addr, 2 * 60 * 60, &addrDB);
2161 pfrom->AddAddressKnown(addr);
2162 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2164 // Relay to a limited number of other nodes
2165 CRITICAL_BLOCK(cs_vNodes)
2167 // Use deterministic randomness to send to the same nodes for 24 hours
2168 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2169 static uint256 hashSalt;
2171 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2172 int64 hashAddr = addr.GetHash();
2173 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2174 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2175 multimap<uint256, CNode*> mapMix;
2176 BOOST_FOREACH(CNode* pnode, vNodes)
2178 if (pnode->nVersion < 31402)
2180 unsigned int nPointer;
2181 memcpy(&nPointer, &pnode, sizeof(nPointer));
2182 uint256 hashKey = hashRand ^ nPointer;
2183 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2184 mapMix.insert(make_pair(hashKey, pnode));
2186 int nRelayNodes = 2;
2187 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2188 ((*mi).second)->PushAddress(addr);
2192 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2193 if (vAddr.size() < 1000)
2194 pfrom->fGetAddr = false;
2198 else if (strCommand == "inv")
2202 if (vInv.size() > 50000)
2204 pfrom->Misbehaving(20);
2205 return error("message inv size() = %d", vInv.size());
2209 BOOST_FOREACH(const CInv& inv, vInv)
2213 pfrom->AddInventoryKnown(inv);
2215 bool fAlreadyHave = AlreadyHave(txdb, inv);
2217 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2221 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2222 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2224 // Track requests for our stuff
2225 Inventory(inv.hash);
2230 else if (strCommand == "getdata")
2234 if (vInv.size() > 50000)
2236 pfrom->Misbehaving(20);
2237 return error("message getdata size() = %d", vInv.size());
2240 BOOST_FOREACH(const CInv& inv, vInv)
2244 printf("received getdata for: %s\n", inv.ToString().c_str());
2246 if (inv.type == MSG_BLOCK)
2248 // Send block from disk
2249 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2250 if (mi != mapBlockIndex.end())
2253 block.ReadFromDisk((*mi).second);
2254 pfrom->PushMessage("block", block);
2256 // Trigger them to send a getblocks request for the next batch of inventory
2257 if (inv.hash == pfrom->hashContinue)
2259 // Bypass PushInventory, this must send even if redundant,
2260 // and we want it right after the last block so they don't
2261 // wait for other stuff first.
2263 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2264 pfrom->PushMessage("inv", vInv);
2265 pfrom->hashContinue = 0;
2269 else if (inv.IsKnownType())
2271 // Send stream from relay memory
2272 CRITICAL_BLOCK(cs_mapRelay)
2274 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2275 if (mi != mapRelay.end())
2276 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2280 // Track requests for our stuff
2281 Inventory(inv.hash);
2286 else if (strCommand == "getblocks")
2288 CBlockLocator locator;
2290 vRecv >> locator >> hashStop;
2292 // Find the last block the caller has in the main chain
2293 CBlockIndex* pindex = locator.GetBlockIndex();
2295 // Send the rest of the chain
2297 pindex = pindex->pnext;
2298 int nLimit = 500 + locator.GetDistanceBack();
2299 unsigned int nBytes = 0;
2300 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2301 for (; pindex; pindex = pindex->pnext)
2303 if (pindex->GetBlockHash() == hashStop)
2305 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2308 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2310 block.ReadFromDisk(pindex, true);
2311 nBytes += block.GetSerializeSize(SER_NETWORK);
2312 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2314 // When this block is requested, we'll send an inv that'll make them
2315 // getblocks the next batch of inventory.
2316 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2317 pfrom->hashContinue = pindex->GetBlockHash();
2324 else if (strCommand == "getheaders")
2326 CBlockLocator locator;
2328 vRecv >> locator >> hashStop;
2330 CBlockIndex* pindex = NULL;
2331 if (locator.IsNull())
2333 // If locator is null, return the hashStop block
2334 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2335 if (mi == mapBlockIndex.end())
2337 pindex = (*mi).second;
2341 // Find the last block the caller has in the main chain
2342 pindex = locator.GetBlockIndex();
2344 pindex = pindex->pnext;
2347 vector<CBlock> vHeaders;
2348 int nLimit = 2000 + locator.GetDistanceBack();
2349 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2350 for (; pindex; pindex = pindex->pnext)
2352 vHeaders.push_back(pindex->GetBlockHeader());
2353 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2356 pfrom->PushMessage("headers", vHeaders);
2360 else if (strCommand == "tx")
2362 vector<uint256> vWorkQueue;
2363 CDataStream vMsg(vRecv);
2367 CInv inv(MSG_TX, tx.GetHash());
2368 pfrom->AddInventoryKnown(inv);
2370 bool fMissingInputs = false;
2371 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2373 SyncWithWallets(tx, NULL, true);
2374 RelayMessage(inv, vMsg);
2375 mapAlreadyAskedFor.erase(inv);
2376 vWorkQueue.push_back(inv.hash);
2378 // Recursively process any orphan transactions that depended on this one
2379 for (int i = 0; i < vWorkQueue.size(); i++)
2381 uint256 hashPrev = vWorkQueue[i];
2382 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2383 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2386 const CDataStream& vMsg = *((*mi).second);
2388 CDataStream(vMsg) >> tx;
2389 CInv inv(MSG_TX, tx.GetHash());
2391 if (tx.AcceptToMemoryPool(true))
2393 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2394 SyncWithWallets(tx, NULL, true);
2395 RelayMessage(inv, vMsg);
2396 mapAlreadyAskedFor.erase(inv);
2397 vWorkQueue.push_back(inv.hash);
2402 BOOST_FOREACH(uint256 hash, vWorkQueue)
2403 EraseOrphanTx(hash);
2405 else if (fMissingInputs)
2407 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2410 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2414 else if (strCommand == "block")
2419 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2422 CInv inv(MSG_BLOCK, block.GetHash());
2423 pfrom->AddInventoryKnown(inv);
2425 if (ProcessBlock(pfrom, &block))
2426 mapAlreadyAskedFor.erase(inv);
2427 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2431 else if (strCommand == "getaddr")
2433 // Nodes rebroadcast an addr every 24 hours
2434 pfrom->vAddrToSend.clear();
2435 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2436 CRITICAL_BLOCK(cs_mapAddresses)
2438 unsigned int nCount = 0;
2439 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2441 const CAddress& addr = item.second;
2442 if (addr.nTime > nSince)
2445 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2447 const CAddress& addr = item.second;
2448 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2449 pfrom->PushAddress(addr);
2455 else if (strCommand == "checkorder")
2460 if (!GetBoolArg("-allowreceivebyip"))
2462 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2469 /// we have a chance to check the order here
2471 // Keep giving the same key to the same ip until they use it
2472 if (!mapReuseKey.count(pfrom->addr))
2473 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2475 // Send back approval of order and pubkey to use
2476 CScript scriptPubKey;
2477 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2478 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2482 else if (strCommand == "reply")
2487 CRequestTracker tracker;
2488 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2490 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2491 if (mi != pfrom->mapRequests.end())
2493 tracker = (*mi).second;
2494 pfrom->mapRequests.erase(mi);
2497 if (!tracker.IsNull())
2498 tracker.fn(tracker.param1, vRecv);
2502 else if (strCommand == "ping")
2507 else if (strCommand == "alert")
2512 if (alert.ProcessAlert())
2515 pfrom->setKnown.insert(alert.GetHash());
2516 CRITICAL_BLOCK(cs_vNodes)
2517 BOOST_FOREACH(CNode* pnode, vNodes)
2518 alert.RelayTo(pnode);
2525 // Ignore unknown commands for extensibility
2529 // Update the last seen time for this node's address
2530 if (pfrom->fNetworkNode)
2531 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2532 AddressCurrentlyConnected(pfrom->addr);
2538 bool ProcessMessages(CNode* pfrom)
2540 CDataStream& vRecv = pfrom->vRecv;
2544 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2548 // (4) message start
2557 // Scan for message start
2558 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2559 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2560 if (vRecv.end() - pstart < nHeaderSize)
2562 if (vRecv.size() > nHeaderSize)
2564 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2565 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2569 if (pstart - vRecv.begin() > 0)
2570 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2571 vRecv.erase(vRecv.begin(), pstart);
2574 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2579 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2582 string strCommand = hdr.GetCommand();
2585 unsigned int nMessageSize = hdr.nMessageSize;
2586 if (nMessageSize > MAX_SIZE)
2588 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2591 if (nMessageSize > vRecv.size())
2593 // Rewind and wait for rest of message
2594 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2599 if (vRecv.GetVersion() >= 209)
2601 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2602 unsigned int nChecksum = 0;
2603 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2604 if (nChecksum != hdr.nChecksum)
2606 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2607 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2612 // Copy message to its own buffer
2613 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2614 vRecv.ignore(nMessageSize);
2620 CRITICAL_BLOCK(cs_main)
2621 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2625 catch (std::ios_base::failure& e)
2627 if (strstr(e.what(), "end of data"))
2629 // Allow exceptions from underlength message on vRecv
2630 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());
2632 else if (strstr(e.what(), "size too large"))
2634 // Allow exceptions from overlong size
2635 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2639 PrintExceptionContinue(&e, "ProcessMessage()");
2642 catch (std::exception& e) {
2643 PrintExceptionContinue(&e, "ProcessMessage()");
2645 PrintExceptionContinue(NULL, "ProcessMessage()");
2649 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2657 bool SendMessages(CNode* pto, bool fSendTrickle)
2659 CRITICAL_BLOCK(cs_main)
2661 // Don't send anything until we get their version message
2662 if (pto->nVersion == 0)
2666 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2667 pto->PushMessage("ping");
2669 // Resend wallet transactions that haven't gotten in a block yet
2670 ResendWalletTransactions();
2672 // Address refresh broadcast
2673 static int64 nLastRebroadcast;
2674 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2676 nLastRebroadcast = GetTime();
2677 CRITICAL_BLOCK(cs_vNodes)
2679 BOOST_FOREACH(CNode* pnode, vNodes)
2681 // Periodically clear setAddrKnown to allow refresh broadcasts
2682 pnode->setAddrKnown.clear();
2684 // Rebroadcast our address
2685 if (addrLocalHost.IsRoutable() && !fUseProxy)
2687 CAddress addr(addrLocalHost);
2688 addr.nTime = GetAdjustedTime();
2689 pnode->PushAddress(addr);
2695 // Clear out old addresses periodically so it's not too much work at once
2696 static int64 nLastClear;
2697 if (nLastClear == 0)
2698 nLastClear = GetTime();
2699 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2701 nLastClear = GetTime();
2702 CRITICAL_BLOCK(cs_mapAddresses)
2705 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2706 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2707 mi != mapAddresses.end();)
2709 const CAddress& addr = (*mi).second;
2710 if (addr.nTime < nSince)
2712 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2714 addrdb.EraseAddress(addr);
2715 mapAddresses.erase(mi++);
2729 vector<CAddress> vAddr;
2730 vAddr.reserve(pto->vAddrToSend.size());
2731 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2733 // returns true if wasn't already contained in the set
2734 if (pto->setAddrKnown.insert(addr).second)
2736 vAddr.push_back(addr);
2737 // receiver rejects addr messages larger than 1000
2738 if (vAddr.size() >= 1000)
2740 pto->PushMessage("addr", vAddr);
2745 pto->vAddrToSend.clear();
2747 pto->PushMessage("addr", vAddr);
2752 // Message: inventory
2755 vector<CInv> vInvWait;
2756 CRITICAL_BLOCK(pto->cs_inventory)
2758 vInv.reserve(pto->vInventoryToSend.size());
2759 vInvWait.reserve(pto->vInventoryToSend.size());
2760 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2762 if (pto->setInventoryKnown.count(inv))
2765 // trickle out tx inv to protect privacy
2766 if (inv.type == MSG_TX && !fSendTrickle)
2768 // 1/4 of tx invs blast to all immediately
2769 static uint256 hashSalt;
2771 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2772 uint256 hashRand = inv.hash ^ hashSalt;
2773 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2774 bool fTrickleWait = ((hashRand & 3) != 0);
2776 // always trickle our own transactions
2780 if (GetTransaction(inv.hash, wtx))
2782 fTrickleWait = true;
2787 vInvWait.push_back(inv);
2792 // returns true if wasn't already contained in the set
2793 if (pto->setInventoryKnown.insert(inv).second)
2795 vInv.push_back(inv);
2796 if (vInv.size() >= 1000)
2798 pto->PushMessage("inv", vInv);
2803 pto->vInventoryToSend = vInvWait;
2806 pto->PushMessage("inv", vInv);
2812 vector<CInv> vGetData;
2813 int64 nNow = GetTime() * 1000000;
2815 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2817 const CInv& inv = (*pto->mapAskFor.begin()).second;
2818 if (!AlreadyHave(txdb, inv))
2820 printf("sending getdata: %s\n", inv.ToString().c_str());
2821 vGetData.push_back(inv);
2822 if (vGetData.size() >= 1000)
2824 pto->PushMessage("getdata", vGetData);
2828 mapAlreadyAskedFor[inv] = nNow;
2829 pto->mapAskFor.erase(pto->mapAskFor.begin());
2831 if (!vGetData.empty())
2832 pto->PushMessage("getdata", vGetData);
2851 //////////////////////////////////////////////////////////////////////////////
2856 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2858 unsigned char* pdata = (unsigned char*)pbuffer;
2859 unsigned int blocks = 1 + ((len + 8) / 64);
2860 unsigned char* pend = pdata + 64 * blocks;
2861 memset(pdata + len, 0, 64 * blocks - len);
2863 unsigned int bits = len * 8;
2864 pend[-1] = (bits >> 0) & 0xff;
2865 pend[-2] = (bits >> 8) & 0xff;
2866 pend[-3] = (bits >> 16) & 0xff;
2867 pend[-4] = (bits >> 24) & 0xff;
2871 static const unsigned int pSHA256InitState[8] =
2872 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2874 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2877 unsigned char data[64];
2881 for (int i = 0; i < 16; i++)
2882 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2884 for (int i = 0; i < 8; i++)
2885 ctx.h[i] = ((uint32_t*)pinit)[i];
2887 SHA256_Update(&ctx, data, sizeof(data));
2888 for (int i = 0; i < 8; i++)
2889 ((uint32_t*)pstate)[i] = ctx.h[i];
2893 // ScanHash scans nonces looking for a hash with at least some zero bits.
2894 // It operates on big endian data. Caller does the byte reversing.
2895 // All input buffers are 16-byte aligned. nNonce is usually preserved
2896 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2897 // the block is rebuilt and nNonce starts over at zero.
2899 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2901 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2905 // Hash pdata using pmidstate as the starting state into
2906 // preformatted buffer phash1, then hash phash1 into phash
2908 SHA256Transform(phash1, pdata, pmidstate);
2909 SHA256Transform(phash, phash1, pSHA256InitState);
2911 // Return the nonce if the hash has at least some zero bits,
2912 // caller will check if it has enough to reach the target
2913 if (((unsigned short*)phash)[14] == 0)
2916 // If nothing found after trying for a while, return -1
2917 if ((nNonce & 0xffff) == 0)
2919 nHashesDone = 0xffff+1;
2925 // Some explaining would be appreciated
2930 set<uint256> setDependsOn;
2933 COrphan(CTransaction* ptxIn)
2941 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2942 BOOST_FOREACH(uint256 hash, setDependsOn)
2943 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2948 uint64 nLastBlockTx = 0;
2949 uint64 nLastBlockSize = 0;
2951 CBlock* CreateNewBlock(CReserveKey& reservekey)
2953 CBlockIndex* pindexPrev = pindexBest;
2956 auto_ptr<CBlock> pblock(new CBlock());
2960 // Create coinbase tx
2962 txNew.vin.resize(1);
2963 txNew.vin[0].prevout.SetNull();
2964 txNew.vout.resize(1);
2965 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2967 // Add our coinbase tx as first transaction
2968 pblock->vtx.push_back(txNew);
2970 // Collect memory pool transactions into the block
2972 CRITICAL_BLOCK(cs_main)
2973 CRITICAL_BLOCK(cs_mapTransactions)
2977 // Priority order to process transactions
2978 list<COrphan> vOrphan; // list memory doesn't move
2979 map<uint256, vector<COrphan*> > mapDependers;
2980 multimap<double, CTransaction*> mapPriority;
2981 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2983 CTransaction& tx = (*mi).second;
2984 if (tx.IsCoinBase() || !tx.IsFinal())
2987 COrphan* porphan = NULL;
2988 double dPriority = 0;
2989 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2991 // Read prev transaction
2992 CTransaction txPrev;
2994 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2996 // Has to wait for dependencies
2999 // Use list for automatic deletion
3000 vOrphan.push_back(COrphan(&tx));
3001 porphan = &vOrphan.back();
3003 mapDependers[txin.prevout.hash].push_back(porphan);
3004 porphan->setDependsOn.insert(txin.prevout.hash);
3007 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3009 // Read block header
3010 int nConf = txindex.GetDepthInMainChain();
3012 dPriority += (double)nValueIn * nConf;
3014 if (fDebug && GetBoolArg("-printpriority"))
3015 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3018 // Priority is sum(valuein * age) / txsize
3019 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3022 porphan->dPriority = dPriority;
3024 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3026 if (fDebug && GetBoolArg("-printpriority"))
3028 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3035 // Collect transactions into block
3036 map<uint256, CTxIndex> mapTestPool;
3037 uint64 nBlockSize = 1000;
3038 uint64 nBlockTx = 0;
3039 int nBlockSigOps1 = 100; // pre-0.6 count of sigOps
3040 int nBlockSigOps2 = 100; // post-0.6 count of sigOps
3041 while (!mapPriority.empty())
3043 // Take highest priority transaction off priority queue
3044 double dPriority = -(*mapPriority.begin()).first;
3045 CTransaction& tx = *(*mapPriority.begin()).second;
3046 mapPriority.erase(mapPriority.begin());
3049 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3050 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3053 // Legacy limits on sigOps:
3054 int nTxSigOps1 = tx.GetLegacySigOpCount();
3055 if (nBlockSigOps1 + nTxSigOps1 >= MAX_BLOCK_SIGOPS)
3058 // Transaction fee required depends on block size
3059 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3060 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3062 // Connecting shouldn't fail due to dependency on other memory pool transactions
3063 // because we're already processing them in order of dependency
3064 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3065 MapPrevTx mapInputs;
3066 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs))
3069 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3070 if (nFees < nMinFee)
3073 int nTxSigOps2 = tx.GetSigOpCount(mapInputs);
3074 if (nBlockSigOps2 + nTxSigOps2 >= MAX_BLOCK_SIGOPS)
3077 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3079 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3080 swap(mapTestPool, mapTestPoolTmp);
3083 pblock->vtx.push_back(tx);
3084 nBlockSize += nTxSize;
3086 nBlockSigOps1 += nTxSigOps1;
3087 nBlockSigOps2 += nTxSigOps2;
3089 // Add transactions that depend on this one to the priority queue
3090 uint256 hash = tx.GetHash();
3091 if (mapDependers.count(hash))
3093 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3095 if (!porphan->setDependsOn.empty())
3097 porphan->setDependsOn.erase(hash);
3098 if (porphan->setDependsOn.empty())
3099 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3105 nLastBlockTx = nBlockTx;
3106 nLastBlockSize = nBlockSize;
3107 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3110 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3113 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3114 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3115 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3116 pblock->nBits = GetNextWorkRequired(pindexPrev);
3119 return pblock.release();
3123 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3125 // Update nExtraNonce
3126 static uint256 hashPrevBlock;
3127 if (hashPrevBlock != pblock->hashPrevBlock)
3130 hashPrevBlock = pblock->hashPrevBlock;
3133 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3134 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3136 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3140 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3143 // Prebuild hash buffers
3150 uint256 hashPrevBlock;
3151 uint256 hashMerkleRoot;
3154 unsigned int nNonce;
3157 unsigned char pchPadding0[64];
3159 unsigned char pchPadding1[64];
3162 memset(&tmp, 0, sizeof(tmp));
3164 tmp.block.nVersion = pblock->nVersion;
3165 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3166 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3167 tmp.block.nTime = pblock->nTime;
3168 tmp.block.nBits = pblock->nBits;
3169 tmp.block.nNonce = pblock->nNonce;
3171 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3172 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3174 // Byte swap all the input buffer
3175 for (int i = 0; i < sizeof(tmp)/4; i++)
3176 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3178 // Precalc the first half of the first hash, which stays constant
3179 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3181 memcpy(pdata, &tmp.block, 128);
3182 memcpy(phash1, &tmp.hash1, 64);
3186 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3188 uint256 hash = pblock->GetHash();
3189 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3191 if (hash > hashTarget)
3195 printf("BitcoinMiner:\n");
3196 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3198 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3199 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3202 CRITICAL_BLOCK(cs_main)
3204 if (pblock->hashPrevBlock != hashBestChain)
3205 return error("BitcoinMiner : generated block is stale");
3207 // Remove key from key pool
3208 reservekey.KeepKey();
3210 // Track how many getdata requests this block gets
3211 CRITICAL_BLOCK(wallet.cs_wallet)
3212 wallet.mapRequestCount[pblock->GetHash()] = 0;
3214 // Process this block the same as if we had received it from another node
3215 if (!ProcessBlock(NULL, pblock))
3216 return error("BitcoinMiner : ProcessBlock, block not accepted");
3222 void static ThreadBitcoinMiner(void* parg);
3224 void static BitcoinMiner(CWallet *pwallet)
3226 printf("BitcoinMiner started\n");
3227 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3229 // Each thread has its own key and counter
3230 CReserveKey reservekey(pwallet);
3231 unsigned int nExtraNonce = 0;
3233 while (fGenerateBitcoins)
3235 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3239 while (vNodes.empty() || IsInitialBlockDownload())
3244 if (!fGenerateBitcoins)
3252 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3253 CBlockIndex* pindexPrev = pindexBest;
3255 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3258 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3260 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3264 // Prebuild hash buffers
3266 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3267 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3268 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3270 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3272 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3273 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3279 int64 nStart = GetTime();
3280 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3282 uint256& hash = *alignup<16>(hashbuf);
3285 unsigned int nHashesDone = 0;
3286 unsigned int nNonceFound;
3289 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3290 (char*)&hash, nHashesDone);
3292 // Check if something found
3293 if (nNonceFound != -1)
3295 for (int i = 0; i < sizeof(hash)/4; i++)
3296 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3298 if (hash <= hashTarget)
3301 pblock->nNonce = ByteReverse(nNonceFound);
3302 assert(hash == pblock->GetHash());
3304 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3305 CheckWork(pblock.get(), *pwalletMain, reservekey);
3306 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3312 static int64 nHashCounter;
3313 if (nHPSTimerStart == 0)
3315 nHPSTimerStart = GetTimeMillis();
3319 nHashCounter += nHashesDone;
3320 if (GetTimeMillis() - nHPSTimerStart > 4000)
3322 static CCriticalSection cs;
3325 if (GetTimeMillis() - nHPSTimerStart > 4000)
3327 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3328 nHPSTimerStart = GetTimeMillis();
3330 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3331 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3332 static int64 nLogTime;
3333 if (GetTime() - nLogTime > 30 * 60)
3335 nLogTime = GetTime();
3336 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3337 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3343 // Check for stop or if block needs to be rebuilt
3346 if (!fGenerateBitcoins)
3348 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3352 if (nBlockNonce >= 0xffff0000)
3354 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3356 if (pindexPrev != pindexBest)
3359 // Update nTime every few seconds
3360 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3361 nBlockTime = ByteReverse(pblock->nTime);
3366 void static ThreadBitcoinMiner(void* parg)
3368 CWallet* pwallet = (CWallet*)parg;
3371 vnThreadsRunning[3]++;
3372 BitcoinMiner(pwallet);
3373 vnThreadsRunning[3]--;
3375 catch (std::exception& e) {
3376 vnThreadsRunning[3]--;
3377 PrintException(&e, "ThreadBitcoinMiner()");
3379 vnThreadsRunning[3]--;
3380 PrintException(NULL, "ThreadBitcoinMiner()");
3382 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3384 if (vnThreadsRunning[3] == 0)
3386 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3390 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3392 if (fGenerateBitcoins != fGenerate)
3394 fGenerateBitcoins = fGenerate;
3395 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3398 if (fGenerateBitcoins)
3400 int nProcessors = boost::thread::hardware_concurrency();
3401 printf("%d processors\n", nProcessors);
3402 if (nProcessors < 1)
3404 if (fLimitProcessors && nProcessors > nLimitProcessors)
3405 nProcessors = nLimitProcessors;
3406 int nAddThreads = nProcessors - vnThreadsRunning[3];
3407 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3408 for (int i = 0; i < nAddThreads; i++)
3410 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3411 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");