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"));
1116 // Add transaction to changes
1117 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
1121 // Add transaction to test pool
1122 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
1129 bool CTransaction::ClientConnectInputs()
1134 // Take over previous transactions' spent pointers
1135 CRITICAL_BLOCK(cs_mapTransactions)
1138 for (int i = 0; i < vin.size(); i++)
1140 // Get prev tx from single transactions in memory
1141 COutPoint prevout = vin[i].prevout;
1142 if (!mapTransactions.count(prevout.hash))
1144 CTransaction& txPrev = mapTransactions[prevout.hash];
1146 if (prevout.n >= txPrev.vout.size())
1150 if (!VerifySignature(txPrev, *this, i, true, 0))
1151 return error("ConnectInputs() : VerifySignature failed");
1153 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1154 ///// this has to go away now that posNext is gone
1155 // // Check for conflicts
1156 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1157 // return error("ConnectInputs() : prev tx already used");
1159 // // Flag outpoints as used
1160 // txPrev.vout[prevout.n].posNext = posThisTx;
1162 nValueIn += txPrev.vout[prevout.n].nValue;
1164 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1165 return error("ClientConnectInputs() : txin values out of range");
1167 if (GetValueOut() > nValueIn)
1177 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1179 // Disconnect in reverse order
1180 for (int i = vtx.size()-1; i >= 0; i--)
1181 if (!vtx[i].DisconnectInputs(txdb))
1184 // Update block index on disk without changing it in memory.
1185 // The memory index structure will be changed after the db commits.
1188 CDiskBlockIndex blockindexPrev(pindex->pprev);
1189 blockindexPrev.hashNext = 0;
1190 if (!txdb.WriteBlockIndex(blockindexPrev))
1191 return error("DisconnectBlock() : WriteBlockIndex failed");
1197 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1199 // Check it again in case a previous version let a bad block in
1203 //// issue here: it doesn't know the version
1204 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1206 map<uint256, CTxIndex> mapQueuedChanges;
1209 BOOST_FOREACH(CTransaction& tx, vtx)
1211 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1212 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1214 MapPrevTx mapInputs;
1215 if (!tx.IsCoinBase())
1217 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs))
1220 int nTxOps = tx.GetSigOpCount(mapInputs);
1222 if (nSigOps > MAX_BLOCK_SIGOPS)
1223 return DoS(100, error("ConnectBlock() : too many sigops"));
1224 // There is a different MAX_BLOCK_SIGOPS check in AcceptBlock();
1225 // a block must satisfy both to make it into the best-chain
1226 // (AcceptBlock() is always called before ConnectBlock())
1228 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1231 // It seems wrong that ConnectInputs must be called on the coinbase transaction
1232 // (which has no inputs) : TODO: refactor the code at the end of ConnectInputs out...
1233 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false))
1237 // Write queued txindex changes
1238 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1240 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1241 return error("ConnectBlock() : UpdateTxIndex failed");
1244 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1247 // Update block index on disk without changing it in memory.
1248 // The memory index structure will be changed after the db commits.
1251 CDiskBlockIndex blockindexPrev(pindex->pprev);
1252 blockindexPrev.hashNext = pindex->GetBlockHash();
1253 if (!txdb.WriteBlockIndex(blockindexPrev))
1254 return error("ConnectBlock() : WriteBlockIndex failed");
1257 // Watch for transactions paying to me
1258 BOOST_FOREACH(CTransaction& tx, vtx)
1259 SyncWithWallets(tx, this, true);
1264 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1266 printf("REORGANIZE\n");
1269 CBlockIndex* pfork = pindexBest;
1270 CBlockIndex* plonger = pindexNew;
1271 while (pfork != plonger)
1273 while (plonger->nHeight > pfork->nHeight)
1274 if (!(plonger = plonger->pprev))
1275 return error("Reorganize() : plonger->pprev is null");
1276 if (pfork == plonger)
1278 if (!(pfork = pfork->pprev))
1279 return error("Reorganize() : pfork->pprev is null");
1282 // List of what to disconnect
1283 vector<CBlockIndex*> vDisconnect;
1284 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1285 vDisconnect.push_back(pindex);
1287 // List of what to connect
1288 vector<CBlockIndex*> vConnect;
1289 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1290 vConnect.push_back(pindex);
1291 reverse(vConnect.begin(), vConnect.end());
1293 // Disconnect shorter branch
1294 vector<CTransaction> vResurrect;
1295 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1298 if (!block.ReadFromDisk(pindex))
1299 return error("Reorganize() : ReadFromDisk for disconnect failed");
1300 if (!block.DisconnectBlock(txdb, pindex))
1301 return error("Reorganize() : DisconnectBlock failed");
1303 // Queue memory transactions to resurrect
1304 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1305 if (!tx.IsCoinBase())
1306 vResurrect.push_back(tx);
1309 // Connect longer branch
1310 vector<CTransaction> vDelete;
1311 for (int i = 0; i < vConnect.size(); i++)
1313 CBlockIndex* pindex = vConnect[i];
1315 if (!block.ReadFromDisk(pindex))
1316 return error("Reorganize() : ReadFromDisk for connect failed");
1317 if (!block.ConnectBlock(txdb, pindex))
1321 return error("Reorganize() : ConnectBlock failed");
1324 // Queue memory transactions to delete
1325 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1326 vDelete.push_back(tx);
1328 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1329 return error("Reorganize() : WriteHashBestChain failed");
1331 // Make sure it's successfully written to disk before changing memory structure
1332 if (!txdb.TxnCommit())
1333 return error("Reorganize() : TxnCommit failed");
1335 // Disconnect shorter branch
1336 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1338 pindex->pprev->pnext = NULL;
1340 // Connect longer branch
1341 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1343 pindex->pprev->pnext = pindex;
1345 // Resurrect memory transactions that were in the disconnected branch
1346 BOOST_FOREACH(CTransaction& tx, vResurrect)
1347 tx.AcceptToMemoryPool(txdb, false);
1349 // Delete redundant memory transactions that are in the connected branch
1350 BOOST_FOREACH(CTransaction& tx, vDelete)
1351 tx.RemoveFromMemoryPool();
1358 runCommand(std::string strCommand)
1360 int nErr = ::system(strCommand.c_str());
1362 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1365 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1367 uint256 hash = GetHash();
1370 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1372 txdb.WriteHashBestChain(hash);
1373 if (!txdb.TxnCommit())
1374 return error("SetBestChain() : TxnCommit failed");
1375 pindexGenesisBlock = pindexNew;
1377 else if (hashPrevBlock == hashBestChain)
1379 // Adding to current best branch
1380 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1383 InvalidChainFound(pindexNew);
1384 return error("SetBestChain() : ConnectBlock failed");
1386 if (!txdb.TxnCommit())
1387 return error("SetBestChain() : TxnCommit failed");
1389 // Add to current best branch
1390 pindexNew->pprev->pnext = pindexNew;
1392 // Delete redundant memory transactions
1393 BOOST_FOREACH(CTransaction& tx, vtx)
1394 tx.RemoveFromMemoryPool();
1399 if (!Reorganize(txdb, pindexNew))
1402 InvalidChainFound(pindexNew);
1403 return error("SetBestChain() : Reorganize failed");
1407 // Update best block in wallet (so we can detect restored wallets)
1408 bool fIsInitialDownload = IsInitialBlockDownload();
1409 if (!fIsInitialDownload)
1411 const CBlockLocator locator(pindexNew);
1412 ::SetBestChain(locator);
1416 hashBestChain = hash;
1417 pindexBest = pindexNew;
1418 nBestHeight = pindexBest->nHeight;
1419 bnBestChainWork = pindexNew->bnChainWork;
1420 nTimeBestReceived = GetTime();
1421 nTransactionsUpdated++;
1422 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1424 std::string strCmd = GetArg("-blocknotify", "");
1426 if (!fIsInitialDownload && !strCmd.empty())
1428 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1429 boost::thread t(runCommand, strCmd); // thread runs free
1436 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1438 // Check for duplicate
1439 uint256 hash = GetHash();
1440 if (mapBlockIndex.count(hash))
1441 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1443 // Construct new block index object
1444 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1446 return error("AddToBlockIndex() : new CBlockIndex failed");
1447 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1448 pindexNew->phashBlock = &((*mi).first);
1449 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1450 if (miPrev != mapBlockIndex.end())
1452 pindexNew->pprev = (*miPrev).second;
1453 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1455 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1459 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1460 if (!txdb.TxnCommit())
1464 if (pindexNew->bnChainWork > bnBestChainWork)
1465 if (!SetBestChain(txdb, pindexNew))
1470 if (pindexNew == pindexBest)
1472 // Notify UI to display prev block's coinbase if it was ours
1473 static uint256 hashPrevBestCoinBase;
1474 UpdatedTransaction(hashPrevBestCoinBase);
1475 hashPrevBestCoinBase = vtx[0].GetHash();
1485 bool CBlock::CheckBlock() const
1487 // These are checks that are independent of context
1488 // that can be verified before saving an orphan block.
1491 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1492 return DoS(100, error("CheckBlock() : size limits failed"));
1494 // Check proof of work matches claimed amount
1495 if (!CheckProofOfWork(GetHash(), nBits))
1496 return DoS(50, error("CheckBlock() : proof of work failed"));
1499 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1500 return error("CheckBlock() : block timestamp too far in the future");
1502 // First transaction must be coinbase, the rest must not be
1503 if (vtx.empty() || !vtx[0].IsCoinBase())
1504 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1505 for (int i = 1; i < vtx.size(); i++)
1506 if (vtx[i].IsCoinBase())
1507 return DoS(100, error("CheckBlock() : more than one coinbase"));
1509 // Check transactions
1510 BOOST_FOREACH(const CTransaction& tx, vtx)
1511 if (!tx.CheckTransaction())
1512 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1514 // Pre-pay-to-script-hash (before version 0.6), this is how sigops
1515 // were counted; there is another check in ConnectBlock when
1516 // transaction inputs are fetched to count pay-to-script-hash sigops:
1518 BOOST_FOREACH(const CTransaction& tx, vtx)
1520 nSigOps += tx.GetLegacySigOpCount();
1522 if (nSigOps > MAX_BLOCK_SIGOPS)
1523 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1526 if (hashMerkleRoot != BuildMerkleTree())
1527 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1532 bool CBlock::AcceptBlock()
1534 // Check for duplicate
1535 uint256 hash = GetHash();
1536 if (mapBlockIndex.count(hash))
1537 return error("AcceptBlock() : block already in mapBlockIndex");
1539 // Get prev block index
1540 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1541 if (mi == mapBlockIndex.end())
1542 return DoS(10, error("AcceptBlock() : prev block not found"));
1543 CBlockIndex* pindexPrev = (*mi).second;
1544 int nHeight = pindexPrev->nHeight+1;
1546 // Check proof of work
1547 if (nBits != GetNextWorkRequired(pindexPrev))
1548 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1550 // Check timestamp against prev
1551 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1552 return error("AcceptBlock() : block's timestamp is too early");
1554 // Check that all transactions are finalized
1555 BOOST_FOREACH(const CTransaction& tx, vtx)
1556 if (!tx.IsFinal(nHeight, GetBlockTime()))
1557 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1559 // Check that the block chain matches the known block chain up to a checkpoint
1560 if (!Checkpoints::CheckBlock(nHeight, hash))
1561 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1563 // Write block to history file
1564 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1565 return error("AcceptBlock() : out of disk space");
1566 unsigned int nFile = -1;
1567 unsigned int nBlockPos = 0;
1568 if (!WriteToDisk(nFile, nBlockPos))
1569 return error("AcceptBlock() : WriteToDisk failed");
1570 if (!AddToBlockIndex(nFile, nBlockPos))
1571 return error("AcceptBlock() : AddToBlockIndex failed");
1573 // Relay inventory, but don't relay old inventory during initial block download
1574 if (hashBestChain == hash)
1575 CRITICAL_BLOCK(cs_vNodes)
1576 BOOST_FOREACH(CNode* pnode, vNodes)
1577 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1578 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1583 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1585 // Check for duplicate
1586 uint256 hash = pblock->GetHash();
1587 if (mapBlockIndex.count(hash))
1588 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1589 if (mapOrphanBlocks.count(hash))
1590 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1592 // Preliminary checks
1593 if (!pblock->CheckBlock())
1594 return error("ProcessBlock() : CheckBlock FAILED");
1596 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1597 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1599 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1600 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1603 pfrom->Misbehaving(100);
1604 return error("ProcessBlock() : block with timestamp before last checkpoint");
1607 bnNewBlock.SetCompact(pblock->nBits);
1609 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1610 if (bnNewBlock > bnRequired)
1612 pfrom->Misbehaving(100);
1613 return error("ProcessBlock() : block with too little proof-of-work");
1618 // If don't already have its previous block, shunt it off to holding area until we get it
1619 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1621 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1622 CBlock* pblock2 = new CBlock(*pblock);
1623 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1624 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1626 // Ask this guy to fill in what we're missing
1628 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1633 if (!pblock->AcceptBlock())
1634 return error("ProcessBlock() : AcceptBlock FAILED");
1636 // Recursively process any orphan blocks that depended on this one
1637 vector<uint256> vWorkQueue;
1638 vWorkQueue.push_back(hash);
1639 for (int i = 0; i < vWorkQueue.size(); i++)
1641 uint256 hashPrev = vWorkQueue[i];
1642 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1643 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1646 CBlock* pblockOrphan = (*mi).second;
1647 if (pblockOrphan->AcceptBlock())
1648 vWorkQueue.push_back(pblockOrphan->GetHash());
1649 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1650 delete pblockOrphan;
1652 mapOrphanBlocksByPrev.erase(hashPrev);
1655 printf("ProcessBlock: ACCEPTED\n");
1666 bool CheckDiskSpace(uint64 nAdditionalBytes)
1668 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1670 // Check for 15MB because database could create another 10MB log file at any time
1671 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1674 string strMessage = _("Warning: Disk space is low ");
1675 strMiscWarning = strMessage;
1676 printf("*** %s\n", strMessage.c_str());
1677 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1678 CreateThread(Shutdown, NULL);
1684 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1688 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1691 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1693 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1702 static unsigned int nCurrentBlockFile = 1;
1704 FILE* AppendBlockFile(unsigned int& nFileRet)
1709 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1712 if (fseek(file, 0, SEEK_END) != 0)
1714 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1715 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1717 nFileRet = nCurrentBlockFile;
1721 nCurrentBlockFile++;
1725 bool LoadBlockIndex(bool fAllowNew)
1729 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1730 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1731 pchMessageStart[0] = 0xfa;
1732 pchMessageStart[1] = 0xbf;
1733 pchMessageStart[2] = 0xb5;
1734 pchMessageStart[3] = 0xda;
1741 if (!txdb.LoadBlockIndex())
1746 // Init with genesis block
1748 if (mapBlockIndex.empty())
1754 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1755 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1756 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1757 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1758 // vMerkleTree: 4a5e1e
1761 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1763 txNew.vin.resize(1);
1764 txNew.vout.resize(1);
1765 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1766 txNew.vout[0].nValue = 50 * COIN;
1767 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1769 block.vtx.push_back(txNew);
1770 block.hashPrevBlock = 0;
1771 block.hashMerkleRoot = block.BuildMerkleTree();
1773 block.nTime = 1231006505;
1774 block.nBits = 0x1d00ffff;
1775 block.nNonce = 2083236893;
1779 block.nTime = 1296688602;
1780 block.nBits = 0x1d07fff8;
1781 block.nNonce = 384568319;
1785 printf("%s\n", block.GetHash().ToString().c_str());
1786 printf("%s\n", hashGenesisBlock.ToString().c_str());
1787 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1788 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1790 assert(block.GetHash() == hashGenesisBlock);
1792 // Start new block file
1794 unsigned int nBlockPos;
1795 if (!block.WriteToDisk(nFile, nBlockPos))
1796 return error("LoadBlockIndex() : writing genesis block to disk failed");
1797 if (!block.AddToBlockIndex(nFile, nBlockPos))
1798 return error("LoadBlockIndex() : genesis block not accepted");
1806 void PrintBlockTree()
1808 // precompute tree structure
1809 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1810 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1812 CBlockIndex* pindex = (*mi).second;
1813 mapNext[pindex->pprev].push_back(pindex);
1815 //while (rand() % 3 == 0)
1816 // mapNext[pindex->pprev].push_back(pindex);
1819 vector<pair<int, CBlockIndex*> > vStack;
1820 vStack.push_back(make_pair(0, pindexGenesisBlock));
1823 while (!vStack.empty())
1825 int nCol = vStack.back().first;
1826 CBlockIndex* pindex = vStack.back().second;
1829 // print split or gap
1830 if (nCol > nPrevCol)
1832 for (int i = 0; i < nCol-1; i++)
1836 else if (nCol < nPrevCol)
1838 for (int i = 0; i < nCol; i++)
1845 for (int i = 0; i < nCol; i++)
1850 block.ReadFromDisk(pindex);
1851 printf("%d (%u,%u) %s %s tx %d",
1855 block.GetHash().ToString().substr(0,20).c_str(),
1856 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1859 PrintWallets(block);
1861 // put the main timechain first
1862 vector<CBlockIndex*>& vNext = mapNext[pindex];
1863 for (int i = 0; i < vNext.size(); i++)
1865 if (vNext[i]->pnext)
1867 swap(vNext[0], vNext[i]);
1873 for (int i = 0; i < vNext.size(); i++)
1874 vStack.push_back(make_pair(nCol+i, vNext[i]));
1887 //////////////////////////////////////////////////////////////////////////////
1892 map<uint256, CAlert> mapAlerts;
1893 CCriticalSection cs_mapAlerts;
1895 string GetWarnings(string strFor)
1898 string strStatusBar;
1900 if (GetBoolArg("-testsafemode"))
1903 // Misc warnings like out of disk space and clock is wrong
1904 if (strMiscWarning != "")
1907 strStatusBar = strMiscWarning;
1910 // Longer invalid proof-of-work chain
1911 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1914 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1918 CRITICAL_BLOCK(cs_mapAlerts)
1920 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1922 const CAlert& alert = item.second;
1923 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1925 nPriority = alert.nPriority;
1926 strStatusBar = alert.strStatusBar;
1931 if (strFor == "statusbar")
1932 return strStatusBar;
1933 else if (strFor == "rpc")
1935 assert(!"GetWarnings() : invalid parameter");
1939 bool CAlert::ProcessAlert()
1941 if (!CheckSignature())
1946 CRITICAL_BLOCK(cs_mapAlerts)
1948 // Cancel previous alerts
1949 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1951 const CAlert& alert = (*mi).second;
1954 printf("cancelling alert %d\n", alert.nID);
1955 mapAlerts.erase(mi++);
1957 else if (!alert.IsInEffect())
1959 printf("expiring alert %d\n", alert.nID);
1960 mapAlerts.erase(mi++);
1966 // Check if this alert has been cancelled
1967 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1969 const CAlert& alert = item.second;
1970 if (alert.Cancels(*this))
1972 printf("alert already cancelled by %d\n", alert.nID);
1978 mapAlerts.insert(make_pair(GetHash(), *this));
1981 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1993 //////////////////////////////////////////////////////////////////////////////
1999 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2003 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2004 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2006 // Don't know what it is, just say we already got one
2013 // The message start string is designed to be unlikely to occur in normal data.
2014 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2015 // a large 4-byte int at any alignment.
2016 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2019 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2021 static map<CService, vector<unsigned char> > mapReuseKey;
2022 RandAddSeedPerfmon();
2024 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2025 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2027 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2029 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2037 if (strCommand == "version")
2039 // Each connection can only send one version message
2040 if (pfrom->nVersion != 0)
2042 pfrom->Misbehaving(1);
2050 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2051 if (pfrom->nVersion == 10300)
2052 pfrom->nVersion = 300;
2053 if (pfrom->nVersion >= 106 && !vRecv.empty())
2054 vRecv >> addrFrom >> nNonce;
2055 if (pfrom->nVersion >= 106 && !vRecv.empty())
2056 vRecv >> pfrom->strSubVer;
2057 if (pfrom->nVersion >= 209 && !vRecv.empty())
2058 vRecv >> pfrom->nStartingHeight;
2060 if (pfrom->nVersion == 0)
2063 // Disconnect if we connected to ourself
2064 if (nNonce == nLocalHostNonce && nNonce > 1)
2066 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2067 pfrom->fDisconnect = true;
2071 // Be shy and don't send version until we hear
2072 if (pfrom->fInbound)
2073 pfrom->PushVersion();
2075 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2077 AddTimeData(pfrom->addr, nTime);
2080 if (pfrom->nVersion >= 209)
2081 pfrom->PushMessage("verack");
2082 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2083 if (pfrom->nVersion < 209)
2084 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2086 if (!pfrom->fInbound)
2088 // Advertise our address
2089 if (addrLocalHost.IsRoutable() && !fUseProxy)
2091 CAddress addr(addrLocalHost);
2092 addr.nTime = GetAdjustedTime();
2093 pfrom->PushAddress(addr);
2096 // Get recent addresses
2097 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2099 pfrom->PushMessage("getaddr");
2100 pfrom->fGetAddr = true;
2104 // Ask the first connected node for block updates
2105 static int nAskedForBlocks = 0;
2106 if (!pfrom->fClient &&
2107 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2108 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2111 pfrom->PushGetBlocks(pindexBest, uint256(0));
2115 CRITICAL_BLOCK(cs_mapAlerts)
2116 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2117 item.second.RelayTo(pfrom);
2119 pfrom->fSuccessfullyConnected = true;
2121 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2123 cPeerBlockCounts.input(pfrom->nStartingHeight);
2127 else if (pfrom->nVersion == 0)
2129 // Must have a version message before anything else
2130 pfrom->Misbehaving(1);
2135 else if (strCommand == "verack")
2137 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2141 else if (strCommand == "addr")
2143 vector<CAddress> vAddr;
2146 // Don't want addr from older versions unless seeding
2147 if (pfrom->nVersion < 209)
2149 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2151 if (vAddr.size() > 1000)
2153 pfrom->Misbehaving(20);
2154 return error("message addr size() = %d", vAddr.size());
2157 // Store the new addresses
2160 int64 nNow = GetAdjustedTime();
2161 int64 nSince = nNow - 10 * 60;
2162 BOOST_FOREACH(CAddress& addr, vAddr)
2166 // ignore IPv6 for now, since it isn't implemented anyway
2169 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2170 addr.nTime = nNow - 5 * 24 * 60 * 60;
2171 AddAddress(addr, 2 * 60 * 60, &addrDB);
2172 pfrom->AddAddressKnown(addr);
2173 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2175 // Relay to a limited number of other nodes
2176 CRITICAL_BLOCK(cs_vNodes)
2178 // Use deterministic randomness to send to the same nodes for 24 hours
2179 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2180 static uint256 hashSalt;
2182 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2183 int64 hashAddr = addr.GetHash();
2184 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2185 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2186 multimap<uint256, CNode*> mapMix;
2187 BOOST_FOREACH(CNode* pnode, vNodes)
2189 if (pnode->nVersion < 31402)
2191 unsigned int nPointer;
2192 memcpy(&nPointer, &pnode, sizeof(nPointer));
2193 uint256 hashKey = hashRand ^ nPointer;
2194 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2195 mapMix.insert(make_pair(hashKey, pnode));
2197 int nRelayNodes = 2;
2198 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2199 ((*mi).second)->PushAddress(addr);
2203 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2204 if (vAddr.size() < 1000)
2205 pfrom->fGetAddr = false;
2209 else if (strCommand == "inv")
2213 if (vInv.size() > 50000)
2215 pfrom->Misbehaving(20);
2216 return error("message inv size() = %d", vInv.size());
2220 BOOST_FOREACH(const CInv& inv, vInv)
2224 pfrom->AddInventoryKnown(inv);
2226 bool fAlreadyHave = AlreadyHave(txdb, inv);
2228 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2232 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2233 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2235 // Track requests for our stuff
2236 Inventory(inv.hash);
2241 else if (strCommand == "getdata")
2245 if (vInv.size() > 50000)
2247 pfrom->Misbehaving(20);
2248 return error("message getdata size() = %d", vInv.size());
2251 BOOST_FOREACH(const CInv& inv, vInv)
2255 printf("received getdata for: %s\n", inv.ToString().c_str());
2257 if (inv.type == MSG_BLOCK)
2259 // Send block from disk
2260 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2261 if (mi != mapBlockIndex.end())
2264 block.ReadFromDisk((*mi).second);
2265 pfrom->PushMessage("block", block);
2267 // Trigger them to send a getblocks request for the next batch of inventory
2268 if (inv.hash == pfrom->hashContinue)
2270 // Bypass PushInventory, this must send even if redundant,
2271 // and we want it right after the last block so they don't
2272 // wait for other stuff first.
2274 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2275 pfrom->PushMessage("inv", vInv);
2276 pfrom->hashContinue = 0;
2280 else if (inv.IsKnownType())
2282 // Send stream from relay memory
2283 CRITICAL_BLOCK(cs_mapRelay)
2285 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2286 if (mi != mapRelay.end())
2287 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2291 // Track requests for our stuff
2292 Inventory(inv.hash);
2297 else if (strCommand == "getblocks")
2299 CBlockLocator locator;
2301 vRecv >> locator >> hashStop;
2303 // Find the last block the caller has in the main chain
2304 CBlockIndex* pindex = locator.GetBlockIndex();
2306 // Send the rest of the chain
2308 pindex = pindex->pnext;
2309 int nLimit = 500 + locator.GetDistanceBack();
2310 unsigned int nBytes = 0;
2311 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2312 for (; pindex; pindex = pindex->pnext)
2314 if (pindex->GetBlockHash() == hashStop)
2316 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2319 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2321 block.ReadFromDisk(pindex, true);
2322 nBytes += block.GetSerializeSize(SER_NETWORK);
2323 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2325 // When this block is requested, we'll send an inv that'll make them
2326 // getblocks the next batch of inventory.
2327 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2328 pfrom->hashContinue = pindex->GetBlockHash();
2335 else if (strCommand == "getheaders")
2337 CBlockLocator locator;
2339 vRecv >> locator >> hashStop;
2341 CBlockIndex* pindex = NULL;
2342 if (locator.IsNull())
2344 // If locator is null, return the hashStop block
2345 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2346 if (mi == mapBlockIndex.end())
2348 pindex = (*mi).second;
2352 // Find the last block the caller has in the main chain
2353 pindex = locator.GetBlockIndex();
2355 pindex = pindex->pnext;
2358 vector<CBlock> vHeaders;
2359 int nLimit = 2000 + locator.GetDistanceBack();
2360 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2361 for (; pindex; pindex = pindex->pnext)
2363 vHeaders.push_back(pindex->GetBlockHeader());
2364 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2367 pfrom->PushMessage("headers", vHeaders);
2371 else if (strCommand == "tx")
2373 vector<uint256> vWorkQueue;
2374 CDataStream vMsg(vRecv);
2378 CInv inv(MSG_TX, tx.GetHash());
2379 pfrom->AddInventoryKnown(inv);
2381 bool fMissingInputs = false;
2382 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2384 SyncWithWallets(tx, NULL, true);
2385 RelayMessage(inv, vMsg);
2386 mapAlreadyAskedFor.erase(inv);
2387 vWorkQueue.push_back(inv.hash);
2389 // Recursively process any orphan transactions that depended on this one
2390 for (int i = 0; i < vWorkQueue.size(); i++)
2392 uint256 hashPrev = vWorkQueue[i];
2393 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2394 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2397 const CDataStream& vMsg = *((*mi).second);
2399 CDataStream(vMsg) >> tx;
2400 CInv inv(MSG_TX, tx.GetHash());
2402 if (tx.AcceptToMemoryPool(true))
2404 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2405 SyncWithWallets(tx, NULL, true);
2406 RelayMessage(inv, vMsg);
2407 mapAlreadyAskedFor.erase(inv);
2408 vWorkQueue.push_back(inv.hash);
2413 BOOST_FOREACH(uint256 hash, vWorkQueue)
2414 EraseOrphanTx(hash);
2416 else if (fMissingInputs)
2418 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2421 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2425 else if (strCommand == "block")
2430 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2433 CInv inv(MSG_BLOCK, block.GetHash());
2434 pfrom->AddInventoryKnown(inv);
2436 if (ProcessBlock(pfrom, &block))
2437 mapAlreadyAskedFor.erase(inv);
2438 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2442 else if (strCommand == "getaddr")
2444 // Nodes rebroadcast an addr every 24 hours
2445 pfrom->vAddrToSend.clear();
2446 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2447 CRITICAL_BLOCK(cs_mapAddresses)
2449 unsigned int nCount = 0;
2450 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2452 const CAddress& addr = item.second;
2453 if (addr.nTime > nSince)
2456 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2458 const CAddress& addr = item.second;
2459 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2460 pfrom->PushAddress(addr);
2466 else if (strCommand == "checkorder")
2471 if (!GetBoolArg("-allowreceivebyip"))
2473 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2480 /// we have a chance to check the order here
2482 // Keep giving the same key to the same ip until they use it
2483 if (!mapReuseKey.count(pfrom->addr))
2484 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2486 // Send back approval of order and pubkey to use
2487 CScript scriptPubKey;
2488 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2489 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2493 else if (strCommand == "reply")
2498 CRequestTracker tracker;
2499 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2501 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2502 if (mi != pfrom->mapRequests.end())
2504 tracker = (*mi).second;
2505 pfrom->mapRequests.erase(mi);
2508 if (!tracker.IsNull())
2509 tracker.fn(tracker.param1, vRecv);
2513 else if (strCommand == "ping")
2518 else if (strCommand == "alert")
2523 if (alert.ProcessAlert())
2526 pfrom->setKnown.insert(alert.GetHash());
2527 CRITICAL_BLOCK(cs_vNodes)
2528 BOOST_FOREACH(CNode* pnode, vNodes)
2529 alert.RelayTo(pnode);
2536 // Ignore unknown commands for extensibility
2540 // Update the last seen time for this node's address
2541 if (pfrom->fNetworkNode)
2542 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2543 AddressCurrentlyConnected(pfrom->addr);
2549 bool ProcessMessages(CNode* pfrom)
2551 CDataStream& vRecv = pfrom->vRecv;
2555 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2559 // (4) message start
2568 // Scan for message start
2569 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2570 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2571 if (vRecv.end() - pstart < nHeaderSize)
2573 if (vRecv.size() > nHeaderSize)
2575 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2576 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2580 if (pstart - vRecv.begin() > 0)
2581 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2582 vRecv.erase(vRecv.begin(), pstart);
2585 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2590 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2593 string strCommand = hdr.GetCommand();
2596 unsigned int nMessageSize = hdr.nMessageSize;
2597 if (nMessageSize > MAX_SIZE)
2599 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2602 if (nMessageSize > vRecv.size())
2604 // Rewind and wait for rest of message
2605 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2610 if (vRecv.GetVersion() >= 209)
2612 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2613 unsigned int nChecksum = 0;
2614 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2615 if (nChecksum != hdr.nChecksum)
2617 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2618 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2623 // Copy message to its own buffer
2624 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2625 vRecv.ignore(nMessageSize);
2631 CRITICAL_BLOCK(cs_main)
2632 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2636 catch (std::ios_base::failure& e)
2638 if (strstr(e.what(), "end of data"))
2640 // Allow exceptions from underlength message on vRecv
2641 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());
2643 else if (strstr(e.what(), "size too large"))
2645 // Allow exceptions from overlong size
2646 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2650 PrintExceptionContinue(&e, "ProcessMessage()");
2653 catch (std::exception& e) {
2654 PrintExceptionContinue(&e, "ProcessMessage()");
2656 PrintExceptionContinue(NULL, "ProcessMessage()");
2660 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2668 bool SendMessages(CNode* pto, bool fSendTrickle)
2670 CRITICAL_BLOCK(cs_main)
2672 // Don't send anything until we get their version message
2673 if (pto->nVersion == 0)
2677 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2678 pto->PushMessage("ping");
2680 // Resend wallet transactions that haven't gotten in a block yet
2681 ResendWalletTransactions();
2683 // Address refresh broadcast
2684 static int64 nLastRebroadcast;
2685 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2687 nLastRebroadcast = GetTime();
2688 CRITICAL_BLOCK(cs_vNodes)
2690 BOOST_FOREACH(CNode* pnode, vNodes)
2692 // Periodically clear setAddrKnown to allow refresh broadcasts
2693 pnode->setAddrKnown.clear();
2695 // Rebroadcast our address
2696 if (addrLocalHost.IsRoutable() && !fUseProxy)
2698 CAddress addr(addrLocalHost);
2699 addr.nTime = GetAdjustedTime();
2700 pnode->PushAddress(addr);
2706 // Clear out old addresses periodically so it's not too much work at once
2707 static int64 nLastClear;
2708 if (nLastClear == 0)
2709 nLastClear = GetTime();
2710 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2712 nLastClear = GetTime();
2713 CRITICAL_BLOCK(cs_mapAddresses)
2716 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2717 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2718 mi != mapAddresses.end();)
2720 const CAddress& addr = (*mi).second;
2721 if (addr.nTime < nSince)
2723 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2725 addrdb.EraseAddress(addr);
2726 mapAddresses.erase(mi++);
2740 vector<CAddress> vAddr;
2741 vAddr.reserve(pto->vAddrToSend.size());
2742 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2744 // returns true if wasn't already contained in the set
2745 if (pto->setAddrKnown.insert(addr).second)
2747 vAddr.push_back(addr);
2748 // receiver rejects addr messages larger than 1000
2749 if (vAddr.size() >= 1000)
2751 pto->PushMessage("addr", vAddr);
2756 pto->vAddrToSend.clear();
2758 pto->PushMessage("addr", vAddr);
2763 // Message: inventory
2766 vector<CInv> vInvWait;
2767 CRITICAL_BLOCK(pto->cs_inventory)
2769 vInv.reserve(pto->vInventoryToSend.size());
2770 vInvWait.reserve(pto->vInventoryToSend.size());
2771 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2773 if (pto->setInventoryKnown.count(inv))
2776 // trickle out tx inv to protect privacy
2777 if (inv.type == MSG_TX && !fSendTrickle)
2779 // 1/4 of tx invs blast to all immediately
2780 static uint256 hashSalt;
2782 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2783 uint256 hashRand = inv.hash ^ hashSalt;
2784 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2785 bool fTrickleWait = ((hashRand & 3) != 0);
2787 // always trickle our own transactions
2791 if (GetTransaction(inv.hash, wtx))
2793 fTrickleWait = true;
2798 vInvWait.push_back(inv);
2803 // returns true if wasn't already contained in the set
2804 if (pto->setInventoryKnown.insert(inv).second)
2806 vInv.push_back(inv);
2807 if (vInv.size() >= 1000)
2809 pto->PushMessage("inv", vInv);
2814 pto->vInventoryToSend = vInvWait;
2817 pto->PushMessage("inv", vInv);
2823 vector<CInv> vGetData;
2824 int64 nNow = GetTime() * 1000000;
2826 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2828 const CInv& inv = (*pto->mapAskFor.begin()).second;
2829 if (!AlreadyHave(txdb, inv))
2831 printf("sending getdata: %s\n", inv.ToString().c_str());
2832 vGetData.push_back(inv);
2833 if (vGetData.size() >= 1000)
2835 pto->PushMessage("getdata", vGetData);
2839 mapAlreadyAskedFor[inv] = nNow;
2840 pto->mapAskFor.erase(pto->mapAskFor.begin());
2842 if (!vGetData.empty())
2843 pto->PushMessage("getdata", vGetData);
2862 //////////////////////////////////////////////////////////////////////////////
2867 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2869 unsigned char* pdata = (unsigned char*)pbuffer;
2870 unsigned int blocks = 1 + ((len + 8) / 64);
2871 unsigned char* pend = pdata + 64 * blocks;
2872 memset(pdata + len, 0, 64 * blocks - len);
2874 unsigned int bits = len * 8;
2875 pend[-1] = (bits >> 0) & 0xff;
2876 pend[-2] = (bits >> 8) & 0xff;
2877 pend[-3] = (bits >> 16) & 0xff;
2878 pend[-4] = (bits >> 24) & 0xff;
2882 static const unsigned int pSHA256InitState[8] =
2883 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2885 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2888 unsigned char data[64];
2892 for (int i = 0; i < 16; i++)
2893 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2895 for (int i = 0; i < 8; i++)
2896 ctx.h[i] = ((uint32_t*)pinit)[i];
2898 SHA256_Update(&ctx, data, sizeof(data));
2899 for (int i = 0; i < 8; i++)
2900 ((uint32_t*)pstate)[i] = ctx.h[i];
2904 // ScanHash scans nonces looking for a hash with at least some zero bits.
2905 // It operates on big endian data. Caller does the byte reversing.
2906 // All input buffers are 16-byte aligned. nNonce is usually preserved
2907 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2908 // the block is rebuilt and nNonce starts over at zero.
2910 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2912 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2916 // Hash pdata using pmidstate as the starting state into
2917 // preformatted buffer phash1, then hash phash1 into phash
2919 SHA256Transform(phash1, pdata, pmidstate);
2920 SHA256Transform(phash, phash1, pSHA256InitState);
2922 // Return the nonce if the hash has at least some zero bits,
2923 // caller will check if it has enough to reach the target
2924 if (((unsigned short*)phash)[14] == 0)
2927 // If nothing found after trying for a while, return -1
2928 if ((nNonce & 0xffff) == 0)
2930 nHashesDone = 0xffff+1;
2936 // Some explaining would be appreciated
2941 set<uint256> setDependsOn;
2944 COrphan(CTransaction* ptxIn)
2952 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2953 BOOST_FOREACH(uint256 hash, setDependsOn)
2954 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2959 uint64 nLastBlockTx = 0;
2960 uint64 nLastBlockSize = 0;
2962 CBlock* CreateNewBlock(CReserveKey& reservekey)
2964 CBlockIndex* pindexPrev = pindexBest;
2967 auto_ptr<CBlock> pblock(new CBlock());
2971 // Create coinbase tx
2973 txNew.vin.resize(1);
2974 txNew.vin[0].prevout.SetNull();
2975 txNew.vout.resize(1);
2976 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2978 // Add our coinbase tx as first transaction
2979 pblock->vtx.push_back(txNew);
2981 // Collect memory pool transactions into the block
2983 CRITICAL_BLOCK(cs_main)
2984 CRITICAL_BLOCK(cs_mapTransactions)
2988 // Priority order to process transactions
2989 list<COrphan> vOrphan; // list memory doesn't move
2990 map<uint256, vector<COrphan*> > mapDependers;
2991 multimap<double, CTransaction*> mapPriority;
2992 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2994 CTransaction& tx = (*mi).second;
2995 if (tx.IsCoinBase() || !tx.IsFinal())
2998 COrphan* porphan = NULL;
2999 double dPriority = 0;
3000 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3002 // Read prev transaction
3003 CTransaction txPrev;
3005 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3007 // Has to wait for dependencies
3010 // Use list for automatic deletion
3011 vOrphan.push_back(COrphan(&tx));
3012 porphan = &vOrphan.back();
3014 mapDependers[txin.prevout.hash].push_back(porphan);
3015 porphan->setDependsOn.insert(txin.prevout.hash);
3018 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3020 // Read block header
3021 int nConf = txindex.GetDepthInMainChain();
3023 dPriority += (double)nValueIn * nConf;
3025 if (fDebug && GetBoolArg("-printpriority"))
3026 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3029 // Priority is sum(valuein * age) / txsize
3030 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3033 porphan->dPriority = dPriority;
3035 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3037 if (fDebug && GetBoolArg("-printpriority"))
3039 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3046 // Collect transactions into block
3047 map<uint256, CTxIndex> mapTestPool;
3048 uint64 nBlockSize = 1000;
3049 uint64 nBlockTx = 0;
3050 int nBlockSigOps1 = 100; // pre-0.6 count of sigOps
3051 int nBlockSigOps2 = 100; // post-0.6 count of sigOps
3052 while (!mapPriority.empty())
3054 // Take highest priority transaction off priority queue
3055 double dPriority = -(*mapPriority.begin()).first;
3056 CTransaction& tx = *(*mapPriority.begin()).second;
3057 mapPriority.erase(mapPriority.begin());
3060 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3061 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3064 // Legacy limits on sigOps:
3065 int nTxSigOps1 = tx.GetLegacySigOpCount();
3066 if (nBlockSigOps1 + nTxSigOps1 >= MAX_BLOCK_SIGOPS)
3069 // Transaction fee required depends on block size
3070 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3071 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3073 // Connecting shouldn't fail due to dependency on other memory pool transactions
3074 // because we're already processing them in order of dependency
3075 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3076 MapPrevTx mapInputs;
3077 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs))
3080 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3081 if (nFees < nMinFee)
3084 int nTxSigOps2 = tx.GetSigOpCount(mapInputs);
3085 if (nBlockSigOps2 + nTxSigOps2 >= MAX_BLOCK_SIGOPS)
3088 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3090 swap(mapTestPool, mapTestPoolTmp);
3093 pblock->vtx.push_back(tx);
3094 nBlockSize += nTxSize;
3096 nBlockSigOps1 += nTxSigOps1;
3097 nBlockSigOps2 += nTxSigOps2;
3099 // Add transactions that depend on this one to the priority queue
3100 uint256 hash = tx.GetHash();
3101 if (mapDependers.count(hash))
3103 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3105 if (!porphan->setDependsOn.empty())
3107 porphan->setDependsOn.erase(hash);
3108 if (porphan->setDependsOn.empty())
3109 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3115 nLastBlockTx = nBlockTx;
3116 nLastBlockSize = nBlockSize;
3117 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3120 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3123 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3124 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3125 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3126 pblock->nBits = GetNextWorkRequired(pindexPrev);
3129 return pblock.release();
3133 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3135 // Update nExtraNonce
3136 static uint256 hashPrevBlock;
3137 if (hashPrevBlock != pblock->hashPrevBlock)
3140 hashPrevBlock = pblock->hashPrevBlock;
3143 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3145 // Put "/P2SH/" in the coinbase so everybody can tell when
3146 // a majority of miners support it
3147 const char* pszP2SH = "/P2SH/";
3148 pblock->vtx[0].vin[0].scriptSig += CScript() << std::vector<unsigned char>(pszP2SH, pszP2SH+strlen(pszP2SH));
3149 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3151 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3155 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3158 // Prebuild hash buffers
3165 uint256 hashPrevBlock;
3166 uint256 hashMerkleRoot;
3169 unsigned int nNonce;
3172 unsigned char pchPadding0[64];
3174 unsigned char pchPadding1[64];
3177 memset(&tmp, 0, sizeof(tmp));
3179 tmp.block.nVersion = pblock->nVersion;
3180 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3181 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3182 tmp.block.nTime = pblock->nTime;
3183 tmp.block.nBits = pblock->nBits;
3184 tmp.block.nNonce = pblock->nNonce;
3186 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3187 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3189 // Byte swap all the input buffer
3190 for (int i = 0; i < sizeof(tmp)/4; i++)
3191 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3193 // Precalc the first half of the first hash, which stays constant
3194 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3196 memcpy(pdata, &tmp.block, 128);
3197 memcpy(phash1, &tmp.hash1, 64);
3201 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3203 uint256 hash = pblock->GetHash();
3204 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3206 if (hash > hashTarget)
3210 printf("BitcoinMiner:\n");
3211 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3213 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3214 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3217 CRITICAL_BLOCK(cs_main)
3219 if (pblock->hashPrevBlock != hashBestChain)
3220 return error("BitcoinMiner : generated block is stale");
3222 // Remove key from key pool
3223 reservekey.KeepKey();
3225 // Track how many getdata requests this block gets
3226 CRITICAL_BLOCK(wallet.cs_wallet)
3227 wallet.mapRequestCount[pblock->GetHash()] = 0;
3229 // Process this block the same as if we had received it from another node
3230 if (!ProcessBlock(NULL, pblock))
3231 return error("BitcoinMiner : ProcessBlock, block not accepted");
3237 void static ThreadBitcoinMiner(void* parg);
3239 void static BitcoinMiner(CWallet *pwallet)
3241 printf("BitcoinMiner started\n");
3242 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3244 // Each thread has its own key and counter
3245 CReserveKey reservekey(pwallet);
3246 unsigned int nExtraNonce = 0;
3248 while (fGenerateBitcoins)
3250 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3254 while (vNodes.empty() || IsInitialBlockDownload())
3259 if (!fGenerateBitcoins)
3267 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3268 CBlockIndex* pindexPrev = pindexBest;
3270 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3273 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3275 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3279 // Prebuild hash buffers
3281 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3282 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3283 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3285 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3287 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3288 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3294 int64 nStart = GetTime();
3295 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3297 uint256& hash = *alignup<16>(hashbuf);
3300 unsigned int nHashesDone = 0;
3301 unsigned int nNonceFound;
3304 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3305 (char*)&hash, nHashesDone);
3307 // Check if something found
3308 if (nNonceFound != -1)
3310 for (int i = 0; i < sizeof(hash)/4; i++)
3311 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3313 if (hash <= hashTarget)
3316 pblock->nNonce = ByteReverse(nNonceFound);
3317 assert(hash == pblock->GetHash());
3319 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3320 CheckWork(pblock.get(), *pwalletMain, reservekey);
3321 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3327 static int64 nHashCounter;
3328 if (nHPSTimerStart == 0)
3330 nHPSTimerStart = GetTimeMillis();
3334 nHashCounter += nHashesDone;
3335 if (GetTimeMillis() - nHPSTimerStart > 4000)
3337 static CCriticalSection cs;
3340 if (GetTimeMillis() - nHPSTimerStart > 4000)
3342 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3343 nHPSTimerStart = GetTimeMillis();
3345 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3346 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3347 static int64 nLogTime;
3348 if (GetTime() - nLogTime > 30 * 60)
3350 nLogTime = GetTime();
3351 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3352 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3358 // Check for stop or if block needs to be rebuilt
3361 if (!fGenerateBitcoins)
3363 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3367 if (nBlockNonce >= 0xffff0000)
3369 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3371 if (pindexPrev != pindexBest)
3374 // Update nTime every few seconds
3375 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3376 nBlockTime = ByteReverse(pblock->nTime);
3381 void static ThreadBitcoinMiner(void* parg)
3383 CWallet* pwallet = (CWallet*)parg;
3386 vnThreadsRunning[3]++;
3387 BitcoinMiner(pwallet);
3388 vnThreadsRunning[3]--;
3390 catch (std::exception& e) {
3391 vnThreadsRunning[3]--;
3392 PrintException(&e, "ThreadBitcoinMiner()");
3394 vnThreadsRunning[3]--;
3395 PrintException(NULL, "ThreadBitcoinMiner()");
3397 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3399 if (vnThreadsRunning[3] == 0)
3401 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3405 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3407 if (fGenerateBitcoins != fGenerate)
3409 fGenerateBitcoins = fGenerate;
3410 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3413 if (fGenerateBitcoins)
3415 int nProcessors = boost::thread::hardware_concurrency();
3416 printf("%d processors\n", nProcessors);
3417 if (nProcessors < 1)
3419 if (fLimitProcessors && nProcessors > nLimitProcessors)
3420 nProcessors = nLimitProcessors;
3421 int nAddThreads = nProcessors - vnThreadsRunning[3];
3422 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3423 for (int i = 0; i < nAddThreads; i++)
3425 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3426 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");