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;
56 const string strMessageMagic = "Bitcoin Signed Message:\n";
63 int fGenerateBitcoins = false;
64 int64 nTransactionFee = 0;
65 int fLimitProcessors = false;
66 int nLimitProcessors = 1;
67 int fMinimizeToTray = true;
68 int fMinimizeOnClose = true;
76 //////////////////////////////////////////////////////////////////////////////
78 // dispatching functions
81 // These functions dispatch to one or all registered wallets
84 void RegisterWallet(CWallet* pwalletIn)
86 CRITICAL_BLOCK(cs_setpwalletRegistered)
88 setpwalletRegistered.insert(pwalletIn);
92 void UnregisterWallet(CWallet* pwalletIn)
94 CRITICAL_BLOCK(cs_setpwalletRegistered)
96 setpwalletRegistered.erase(pwalletIn);
100 // check whether the passed transaction is from us
101 bool static IsFromMe(CTransaction& tx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->IsFromMe(tx))
109 // get the wallet transaction with the given hash (if it exists)
110 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
112 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
113 if (pwallet->GetTransaction(hashTx,wtx))
118 // erases transaction with the given hash from all wallets
119 void static EraseFromWallets(uint256 hash)
121 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
122 pwallet->EraseFromWallet(hash);
125 // make sure all wallets know about the given transaction, in the given block
126 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
128 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
129 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
132 // notify wallets about a new best chain
133 void static SetBestChain(const CBlockLocator& loc)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->SetBestChain(loc);
139 // notify wallets about an updated transaction
140 void static UpdatedTransaction(const uint256& hashTx)
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 pwallet->UpdatedTransaction(hashTx);
147 void static PrintWallets(const CBlock& block)
149 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
150 pwallet->PrintWallet(block);
153 // notify wallets about an incoming inventory (for request counts)
154 void static Inventory(const uint256& hash)
156 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
157 pwallet->Inventory(hash);
160 // ask wallets to resend their transactions
161 void static ResendWalletTransactions()
163 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
164 pwallet->ResendWalletTransactions();
173 //////////////////////////////////////////////////////////////////////////////
175 // mapOrphanTransactions
178 void static AddOrphanTx(const CDataStream& vMsg)
181 CDataStream(vMsg) >> tx;
182 uint256 hash = tx.GetHash();
183 if (mapOrphanTransactions.count(hash))
185 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
186 BOOST_FOREACH(const CTxIn& txin, tx.vin)
187 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
190 void static EraseOrphanTx(uint256 hash)
192 if (!mapOrphanTransactions.count(hash))
194 const CDataStream* pvMsg = mapOrphanTransactions[hash];
196 CDataStream(*pvMsg) >> tx;
197 BOOST_FOREACH(const CTxIn& txin, tx.vin)
199 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
200 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
202 if ((*mi).second == pvMsg)
203 mapOrphanTransactionsByPrev.erase(mi++);
209 mapOrphanTransactions.erase(hash);
219 //////////////////////////////////////////////////////////////////////////////
221 // CTransaction and CTxIndex
224 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
227 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
229 if (!ReadFromDisk(txindexRet.pos))
231 if (prevout.n >= vout.size())
239 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
242 return ReadFromDisk(txdb, prevout, txindex);
245 bool CTransaction::ReadFromDisk(COutPoint prevout)
249 return ReadFromDisk(txdb, prevout, txindex);
252 bool CTransaction::IsStandard() const
254 BOOST_FOREACH(const CTxIn& txin, vin)
256 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
257 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
258 // ~65-byte public keys, plus a few script ops.
259 if (txin.scriptSig.size() > 500)
261 if (!txin.scriptSig.IsPushOnly())
264 BOOST_FOREACH(const CTxOut& txout, vout)
265 if (!::IsStandard(txout.scriptPubKey))
271 // Check transaction inputs, and make sure any
272 // pay-to-script-hash transactions are evaluating IsStandard scripts
274 // Why bother? To avoid denial-of-service attacks; an attacker
275 // can submit a standard HASH... OP_EQUAL transaction,
276 // which will get accepted into blocks. The redemption
277 // script can be anything; an attacker could use a very
278 // expensive-to-check-upon-redemption script like:
279 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
281 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
284 return true; // Coinbases don't use vin normally
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 bool fInvalid = false;
496 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
499 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
501 *pfMissingInputs = true;
502 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
505 // Check for non-standard pay-to-script-hash in inputs
506 if (!AreInputsStandard(mapInputs) && !fTestNet)
507 return error("AcceptToMemoryPool() : nonstandard transaction input");
509 // Note: if you modify this code to accept non-standard transactions, then
510 // you should add code here to check that the transaction does a
511 // reasonable number of ECDSA signature verifications.
513 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
514 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
516 // Don't accept it if it can't get into a block
517 if (nFees < GetMinFee(1000, true, GMF_RELAY))
518 return error("AcceptToMemoryPool() : not enough fees");
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))
549 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
553 // Store transaction in memory
554 CRITICAL_BLOCK(cs_mapTransactions)
558 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
559 ptxOld->RemoveFromMemoryPool();
561 AddToMemoryPoolUnchecked();
564 ///// are we sure this is ok when loading transactions or restoring block txes
565 // If updated, erase old tx from wallet
567 EraseFromWallets(ptxOld->GetHash());
569 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
573 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
576 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
579 uint64 nPooledTx = 0;
581 bool CTransaction::AddToMemoryPoolUnchecked()
583 printf("AcceptToMemoryPoolUnchecked(): size %lu\n", mapTransactions.size());
584 // Add to memory pool without checking anything. Don't call this directly,
585 // call AcceptToMemoryPool to properly check the transaction first.
586 CRITICAL_BLOCK(cs_mapTransactions)
588 uint256 hash = GetHash();
589 mapTransactions[hash] = *this;
590 for (int i = 0; i < vin.size(); i++)
591 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
592 nTransactionsUpdated++;
599 bool CTransaction::RemoveFromMemoryPool()
601 // Remove transaction from memory pool
602 CRITICAL_BLOCK(cs_mapTransactions)
604 BOOST_FOREACH(const CTxIn& txin, vin)
605 mapNextTx.erase(txin.prevout);
606 mapTransactions.erase(GetHash());
607 nTransactionsUpdated++;
618 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
620 if (hashBlock == 0 || nIndex == -1)
623 // Find the block it claims to be in
624 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
625 if (mi == mapBlockIndex.end())
627 CBlockIndex* pindex = (*mi).second;
628 if (!pindex || !pindex->IsInMainChain())
631 // Make sure the merkle branch connects to this block
632 if (!fMerkleVerified)
634 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
636 fMerkleVerified = true;
640 return pindexBest->nHeight - pindex->nHeight + 1;
644 int CMerkleTx::GetBlocksToMaturity() const
648 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
652 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
656 if (!IsInMainChain() && !ClientConnectInputs())
658 return CTransaction::AcceptToMemoryPool(txdb, false);
662 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
666 bool CMerkleTx::AcceptToMemoryPool()
669 return AcceptToMemoryPool(txdb);
674 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
676 CRITICAL_BLOCK(cs_mapTransactions)
678 // Add previous supporting transactions first
679 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
681 if (!tx.IsCoinBase())
683 uint256 hash = tx.GetHash();
684 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
685 tx.AcceptToMemoryPool(txdb, fCheckInputs);
688 return AcceptToMemoryPool(txdb, fCheckInputs);
693 bool CWalletTx::AcceptWalletTransaction()
696 return AcceptWalletTransaction(txdb);
699 int CTxIndex::GetDepthInMainChain() const
703 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
705 // Find the block in the index
706 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
707 if (mi == mapBlockIndex.end())
709 CBlockIndex* pindex = (*mi).second;
710 if (!pindex || !pindex->IsInMainChain())
712 return 1 + nBestHeight - pindex->nHeight;
724 //////////////////////////////////////////////////////////////////////////////
726 // CBlock and CBlockIndex
729 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
731 if (!fReadTransactions)
733 *this = pindex->GetBlockHeader();
736 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
738 if (GetHash() != pindex->GetBlockHash())
739 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
743 uint256 static GetOrphanRoot(const CBlock* pblock)
745 // Work back to the first block in the orphan chain
746 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
747 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
748 return pblock->GetHash();
751 int64 static GetBlockValue(int nHeight, int64 nFees)
753 int64 nSubsidy = 50 * COIN;
755 // Subsidy is cut in half every 4 years
756 nSubsidy >>= (nHeight / 210000);
758 return nSubsidy + nFees;
761 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
762 static const int64 nTargetSpacing = 10 * 60;
763 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
766 // minimum amount of work that could possibly be required nTime after
767 // minimum work required was nBase
769 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
772 bnResult.SetCompact(nBase);
773 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
775 // Maximum 400% adjustment...
777 // ... in best-case exactly 4-times-normal target time
778 nTime -= nTargetTimespan*4;
780 if (bnResult > bnProofOfWorkLimit)
781 bnResult = bnProofOfWorkLimit;
782 return bnResult.GetCompact();
785 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
789 if (pindexLast == NULL)
790 return bnProofOfWorkLimit.GetCompact();
792 // Only change once per interval
793 if ((pindexLast->nHeight+1) % nInterval != 0)
794 return pindexLast->nBits;
796 // Go back by what we want to be 14 days worth of blocks
797 const CBlockIndex* pindexFirst = pindexLast;
798 for (int i = 0; pindexFirst && i < nInterval-1; i++)
799 pindexFirst = pindexFirst->pprev;
802 // Limit adjustment step
803 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
804 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
805 if (nActualTimespan < nTargetTimespan/4)
806 nActualTimespan = nTargetTimespan/4;
807 if (nActualTimespan > nTargetTimespan*4)
808 nActualTimespan = nTargetTimespan*4;
812 bnNew.SetCompact(pindexLast->nBits);
813 bnNew *= nActualTimespan;
814 bnNew /= nTargetTimespan;
816 if (bnNew > bnProofOfWorkLimit)
817 bnNew = bnProofOfWorkLimit;
820 printf("GetNextWorkRequired RETARGET\n");
821 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
822 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
823 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
825 return bnNew.GetCompact();
828 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
831 bnTarget.SetCompact(nBits);
834 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
835 return error("CheckProofOfWork() : nBits below minimum work");
837 // Check proof of work matches claimed amount
838 if (hash > bnTarget.getuint256())
839 return error("CheckProofOfWork() : hash doesn't match nBits");
844 // Return maximum amount of blocks that other nodes claim to have
845 int GetNumBlocksOfPeers()
847 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
850 bool IsInitialBlockDownload()
852 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
854 static int64 nLastUpdate;
855 static CBlockIndex* pindexLastBest;
856 if (pindexBest != pindexLastBest)
858 pindexLastBest = pindexBest;
859 nLastUpdate = GetTime();
861 return (GetTime() - nLastUpdate < 10 &&
862 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
865 void static InvalidChainFound(CBlockIndex* pindexNew)
867 if (pindexNew->bnChainWork > bnBestInvalidWork)
869 bnBestInvalidWork = pindexNew->bnChainWork;
870 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
873 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());
874 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
875 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
876 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
889 bool CTransaction::DisconnectInputs(CTxDB& txdb)
891 // Relinquish previous transactions' spent pointers
894 BOOST_FOREACH(const CTxIn& txin, vin)
896 COutPoint prevout = txin.prevout;
898 // Get prev txindex from disk
900 if (!txdb.ReadTxIndex(prevout.hash, txindex))
901 return error("DisconnectInputs() : ReadTxIndex failed");
903 if (prevout.n >= txindex.vSpent.size())
904 return error("DisconnectInputs() : prevout.n out of range");
906 // Mark outpoint as not spent
907 txindex.vSpent[prevout.n].SetNull();
910 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
911 return error("DisconnectInputs() : UpdateTxIndex failed");
915 // Remove transaction from index
916 if (!txdb.EraseTxIndex(*this))
917 return error("DisconnectInputs() : EraseTxPos failed");
923 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
924 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
926 // FetchInputs can return false either because we just haven't seen some inputs
927 // (in which case the transaction should be stored as an orphan)
928 // or because the transaction is malformed (in which case the transaction should
929 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
933 return true; // Coinbase transactions have no inputs to fetch.
935 for (int i = 0; i < vin.size(); i++)
937 COutPoint prevout = vin[i].prevout;
938 if (inputsRet.count(prevout.hash))
939 continue; // Got it already
942 CTxIndex& txindex = inputsRet[prevout.hash].first;
944 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
946 // Get txindex from current proposed changes
947 txindex = mapTestPool.find(prevout.hash)->second;
951 // Read txindex from txdb
952 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
954 if (!fFound && (fBlock || fMiner))
955 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());
958 CTransaction& txPrev = inputsRet[prevout.hash].second;
959 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
961 // Get prev tx from single transactions in memory
962 CRITICAL_BLOCK(cs_mapTransactions)
964 if (!mapTransactions.count(prevout.hash))
965 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
966 txPrev = mapTransactions[prevout.hash];
969 txindex.vSpent.resize(txPrev.vout.size());
973 // Get prev tx from disk
974 if (!txPrev.ReadFromDisk(txindex.pos))
975 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
979 // Make sure all prevout.n's are valid:
980 for (int i = 0; i < vin.size(); i++)
982 const COutPoint prevout = vin[i].prevout;
983 assert(inputsRet.count(prevout.hash) != 0);
984 const CTxIndex& txindex = inputsRet[prevout.hash].first;
985 const CTransaction& txPrev = inputsRet[prevout.hash].second;
986 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
988 // Revisit this if/when transaction replacement is implemented and allows
991 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()));
998 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1000 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1001 if (mi == inputs.end())
1002 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1004 const CTransaction& txPrev = (mi->second).second;
1005 if (input.prevout.n >= txPrev.vout.size())
1006 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1008 return txPrev.vout[input.prevout.n];
1011 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1017 for (int i = 0; i < vin.size(); i++)
1019 nResult += GetOutputFor(vin[i], inputs).nValue;
1025 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1031 for (int i = 0; i < vin.size(); i++)
1033 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1034 if (prevout.scriptPubKey.IsPayToScriptHash())
1035 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1040 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1041 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1042 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1044 // Take over previous transactions' spent pointers
1045 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1046 // fMiner is true when called from the internal bitcoin miner
1047 // ... both are false when called from CTransaction::AcceptToMemoryPool
1052 for (int i = 0; i < vin.size(); i++)
1054 COutPoint prevout = vin[i].prevout;
1055 assert(inputs.count(prevout.hash) > 0);
1056 CTxIndex& txindex = inputs[prevout.hash].first;
1057 CTransaction& txPrev = inputs[prevout.hash].second;
1059 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1060 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()));
1062 // If prev is coinbase, check that it's matured
1063 if (txPrev.IsCoinBase())
1064 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1065 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1066 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1068 // Check for conflicts (double-spend)
1069 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1070 // for an attacker to attempt to split the network.
1071 if (!txindex.vSpent[prevout.n].IsNull())
1072 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());
1074 // Check for negative or overflow input values
1075 nValueIn += txPrev.vout[prevout.n].nValue;
1076 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1077 return DoS(100, error("ConnectInputs() : txin values out of range"));
1079 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1080 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1081 // still computed and checked, and any change will be caught at the next checkpoint.
1082 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1085 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1086 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1089 // Mark outpoints as spent
1090 txindex.vSpent[prevout.n] = posThisTx;
1093 if (fBlock || fMiner)
1095 mapTestPool[prevout.hash] = txindex;
1099 if (nValueIn < GetValueOut())
1100 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1102 // Tally transaction fees
1103 int64 nTxFee = nValueIn - GetValueOut();
1105 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1107 if (!MoneyRange(nFees))
1108 return DoS(100, error("ConnectInputs() : nFees out of range"));
1115 bool CTransaction::ClientConnectInputs()
1120 // Take over previous transactions' spent pointers
1121 CRITICAL_BLOCK(cs_mapTransactions)
1124 for (int i = 0; i < vin.size(); i++)
1126 // Get prev tx from single transactions in memory
1127 COutPoint prevout = vin[i].prevout;
1128 if (!mapTransactions.count(prevout.hash))
1130 CTransaction& txPrev = mapTransactions[prevout.hash];
1132 if (prevout.n >= txPrev.vout.size())
1136 if (!VerifySignature(txPrev, *this, i, true, 0))
1137 return error("ConnectInputs() : VerifySignature failed");
1139 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1140 ///// this has to go away now that posNext is gone
1141 // // Check for conflicts
1142 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1143 // return error("ConnectInputs() : prev tx already used");
1145 // // Flag outpoints as used
1146 // txPrev.vout[prevout.n].posNext = posThisTx;
1148 nValueIn += txPrev.vout[prevout.n].nValue;
1150 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1151 return error("ClientConnectInputs() : txin values out of range");
1153 if (GetValueOut() > nValueIn)
1163 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1165 // Disconnect in reverse order
1166 for (int i = vtx.size()-1; i >= 0; i--)
1167 if (!vtx[i].DisconnectInputs(txdb))
1170 // Update block index on disk without changing it in memory.
1171 // The memory index structure will be changed after the db commits.
1174 CDiskBlockIndex blockindexPrev(pindex->pprev);
1175 blockindexPrev.hashNext = 0;
1176 if (!txdb.WriteBlockIndex(blockindexPrev))
1177 return error("DisconnectBlock() : WriteBlockIndex failed");
1183 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1185 // Check it again in case a previous version let a bad block in
1189 // To avoid being on the short end of a block-chain split,
1190 // don't do secondary validation of pay-to-script-hash transactions
1191 // until blocks with timestamps after paytoscripthashtime:
1192 int64 nEvalSwitchTime = GetArg("-paytoscripthashtime", 1329264000); // Feb 15, 2012
1193 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1195 //// issue here: it doesn't know the version
1196 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1198 map<uint256, CTxIndex> mapQueuedChanges;
1201 BOOST_FOREACH(CTransaction& tx, vtx)
1203 nSigOps += tx.GetLegacySigOpCount();
1204 if (nSigOps > MAX_BLOCK_SIGOPS)
1205 return DoS(100, error("ConnectBlock() : too many sigops"));
1207 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1208 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1210 MapPrevTx mapInputs;
1211 if (!tx.IsCoinBase())
1214 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1217 if (fStrictPayToScriptHash)
1219 // Add in sigops done by pay-to-script-hash inputs;
1220 // this is to prevent a "rogue miner" from creating
1221 // an incredibly-expensive-to-validate block.
1222 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1223 if (nSigOps > MAX_BLOCK_SIGOPS)
1224 return DoS(100, error("ConnectBlock() : too many sigops"));
1227 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1229 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1233 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1236 // Write queued txindex changes
1237 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1239 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1240 return error("ConnectBlock() : UpdateTxIndex failed");
1243 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1246 // Update block index on disk without changing it in memory.
1247 // The memory index structure will be changed after the db commits.
1250 CDiskBlockIndex blockindexPrev(pindex->pprev);
1251 blockindexPrev.hashNext = pindex->GetBlockHash();
1252 if (!txdb.WriteBlockIndex(blockindexPrev))
1253 return error("ConnectBlock() : WriteBlockIndex failed");
1256 // Watch for transactions paying to me
1257 BOOST_FOREACH(CTransaction& tx, vtx)
1258 SyncWithWallets(tx, this, true);
1263 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1265 printf("REORGANIZE\n");
1268 CBlockIndex* pfork = pindexBest;
1269 CBlockIndex* plonger = pindexNew;
1270 while (pfork != plonger)
1272 while (plonger->nHeight > pfork->nHeight)
1273 if (!(plonger = plonger->pprev))
1274 return error("Reorganize() : plonger->pprev is null");
1275 if (pfork == plonger)
1277 if (!(pfork = pfork->pprev))
1278 return error("Reorganize() : pfork->pprev is null");
1281 // List of what to disconnect
1282 vector<CBlockIndex*> vDisconnect;
1283 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1284 vDisconnect.push_back(pindex);
1286 // List of what to connect
1287 vector<CBlockIndex*> vConnect;
1288 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1289 vConnect.push_back(pindex);
1290 reverse(vConnect.begin(), vConnect.end());
1292 // Disconnect shorter branch
1293 vector<CTransaction> vResurrect;
1294 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1297 if (!block.ReadFromDisk(pindex))
1298 return error("Reorganize() : ReadFromDisk for disconnect failed");
1299 if (!block.DisconnectBlock(txdb, pindex))
1300 return error("Reorganize() : DisconnectBlock failed");
1302 // Queue memory transactions to resurrect
1303 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1304 if (!tx.IsCoinBase())
1305 vResurrect.push_back(tx);
1308 // Connect longer branch
1309 vector<CTransaction> vDelete;
1310 for (int i = 0; i < vConnect.size(); i++)
1312 CBlockIndex* pindex = vConnect[i];
1314 if (!block.ReadFromDisk(pindex))
1315 return error("Reorganize() : ReadFromDisk for connect failed");
1316 if (!block.ConnectBlock(txdb, pindex))
1320 return error("Reorganize() : ConnectBlock failed");
1323 // Queue memory transactions to delete
1324 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1325 vDelete.push_back(tx);
1327 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1328 return error("Reorganize() : WriteHashBestChain failed");
1330 // Make sure it's successfully written to disk before changing memory structure
1331 if (!txdb.TxnCommit())
1332 return error("Reorganize() : TxnCommit failed");
1334 // Disconnect shorter branch
1335 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1337 pindex->pprev->pnext = NULL;
1339 // Connect longer branch
1340 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1342 pindex->pprev->pnext = pindex;
1344 // Resurrect memory transactions that were in the disconnected branch
1345 BOOST_FOREACH(CTransaction& tx, vResurrect)
1346 tx.AcceptToMemoryPool(txdb, false);
1348 // Delete redundant memory transactions that are in the connected branch
1349 BOOST_FOREACH(CTransaction& tx, vDelete)
1350 tx.RemoveFromMemoryPool();
1357 runCommand(std::string strCommand)
1359 int nErr = ::system(strCommand.c_str());
1361 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1364 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1366 uint256 hash = GetHash();
1369 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1371 txdb.WriteHashBestChain(hash);
1372 if (!txdb.TxnCommit())
1373 return error("SetBestChain() : TxnCommit failed");
1374 pindexGenesisBlock = pindexNew;
1376 else if (hashPrevBlock == hashBestChain)
1378 // Adding to current best branch
1379 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1382 InvalidChainFound(pindexNew);
1383 return error("SetBestChain() : ConnectBlock failed");
1385 if (!txdb.TxnCommit())
1386 return error("SetBestChain() : TxnCommit failed");
1388 // Add to current best branch
1389 pindexNew->pprev->pnext = pindexNew;
1391 // Delete redundant memory transactions
1392 BOOST_FOREACH(CTransaction& tx, vtx)
1393 tx.RemoveFromMemoryPool();
1398 if (!Reorganize(txdb, pindexNew))
1401 InvalidChainFound(pindexNew);
1402 return error("SetBestChain() : Reorganize failed");
1406 // Update best block in wallet (so we can detect restored wallets)
1407 bool fIsInitialDownload = IsInitialBlockDownload();
1408 if (!fIsInitialDownload)
1410 const CBlockLocator locator(pindexNew);
1411 ::SetBestChain(locator);
1415 hashBestChain = hash;
1416 pindexBest = pindexNew;
1417 nBestHeight = pindexBest->nHeight;
1418 bnBestChainWork = pindexNew->bnChainWork;
1419 nTimeBestReceived = GetTime();
1420 nTransactionsUpdated++;
1421 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1423 std::string strCmd = GetArg("-blocknotify", "");
1425 if (!fIsInitialDownload && !strCmd.empty())
1427 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1428 boost::thread t(runCommand, strCmd); // thread runs free
1435 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1437 // Check for duplicate
1438 uint256 hash = GetHash();
1439 if (mapBlockIndex.count(hash))
1440 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1442 // Construct new block index object
1443 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1445 return error("AddToBlockIndex() : new CBlockIndex failed");
1446 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1447 pindexNew->phashBlock = &((*mi).first);
1448 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1449 if (miPrev != mapBlockIndex.end())
1451 pindexNew->pprev = (*miPrev).second;
1452 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1454 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1458 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1459 if (!txdb.TxnCommit())
1463 if (pindexNew->bnChainWork > bnBestChainWork)
1464 if (!SetBestChain(txdb, pindexNew))
1469 if (pindexNew == pindexBest)
1471 // Notify UI to display prev block's coinbase if it was ours
1472 static uint256 hashPrevBestCoinBase;
1473 UpdatedTransaction(hashPrevBestCoinBase);
1474 hashPrevBestCoinBase = vtx[0].GetHash();
1484 bool CBlock::CheckBlock() const
1486 // These are checks that are independent of context
1487 // that can be verified before saving an orphan block.
1490 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1491 return DoS(100, error("CheckBlock() : size limits failed"));
1493 // Check proof of work matches claimed amount
1494 if (!CheckProofOfWork(GetHash(), nBits))
1495 return DoS(50, error("CheckBlock() : proof of work failed"));
1498 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1499 return error("CheckBlock() : block timestamp too far in the future");
1501 // First transaction must be coinbase, the rest must not be
1502 if (vtx.empty() || !vtx[0].IsCoinBase())
1503 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1504 for (int i = 1; i < vtx.size(); i++)
1505 if (vtx[i].IsCoinBase())
1506 return DoS(100, error("CheckBlock() : more than one coinbase"));
1508 // Check transactions
1509 BOOST_FOREACH(const CTransaction& tx, vtx)
1510 if (!tx.CheckTransaction())
1511 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1514 BOOST_FOREACH(const CTransaction& tx, vtx)
1516 nSigOps += tx.GetLegacySigOpCount();
1518 if (nSigOps > MAX_BLOCK_SIGOPS)
1519 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1522 if (hashMerkleRoot != BuildMerkleTree())
1523 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1528 bool CBlock::AcceptBlock()
1530 // Check for duplicate
1531 uint256 hash = GetHash();
1532 if (mapBlockIndex.count(hash))
1533 return error("AcceptBlock() : block already in mapBlockIndex");
1535 // Get prev block index
1536 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1537 if (mi == mapBlockIndex.end())
1538 return DoS(10, error("AcceptBlock() : prev block not found"));
1539 CBlockIndex* pindexPrev = (*mi).second;
1540 int nHeight = pindexPrev->nHeight+1;
1542 // Check proof of work
1543 if (nBits != GetNextWorkRequired(pindexPrev))
1544 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1546 // Check timestamp against prev
1547 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1548 return error("AcceptBlock() : block's timestamp is too early");
1550 // Check that all transactions are finalized
1551 BOOST_FOREACH(const CTransaction& tx, vtx)
1552 if (!tx.IsFinal(nHeight, GetBlockTime()))
1553 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1555 // Check that the block chain matches the known block chain up to a checkpoint
1556 if (!Checkpoints::CheckBlock(nHeight, hash))
1557 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1559 // Write block to history file
1560 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1561 return error("AcceptBlock() : out of disk space");
1562 unsigned int nFile = -1;
1563 unsigned int nBlockPos = 0;
1564 if (!WriteToDisk(nFile, nBlockPos))
1565 return error("AcceptBlock() : WriteToDisk failed");
1566 if (!AddToBlockIndex(nFile, nBlockPos))
1567 return error("AcceptBlock() : AddToBlockIndex failed");
1569 // Relay inventory, but don't relay old inventory during initial block download
1570 if (hashBestChain == hash)
1571 CRITICAL_BLOCK(cs_vNodes)
1572 BOOST_FOREACH(CNode* pnode, vNodes)
1573 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1574 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1579 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1581 // Check for duplicate
1582 uint256 hash = pblock->GetHash();
1583 if (mapBlockIndex.count(hash))
1584 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1585 if (mapOrphanBlocks.count(hash))
1586 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1588 // Preliminary checks
1589 if (!pblock->CheckBlock())
1590 return error("ProcessBlock() : CheckBlock FAILED");
1592 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1593 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1595 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1596 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1599 pfrom->Misbehaving(100);
1600 return error("ProcessBlock() : block with timestamp before last checkpoint");
1603 bnNewBlock.SetCompact(pblock->nBits);
1605 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1606 if (bnNewBlock > bnRequired)
1608 pfrom->Misbehaving(100);
1609 return error("ProcessBlock() : block with too little proof-of-work");
1614 // If don't already have its previous block, shunt it off to holding area until we get it
1615 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1617 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1618 CBlock* pblock2 = new CBlock(*pblock);
1619 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1620 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1622 // Ask this guy to fill in what we're missing
1624 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1629 if (!pblock->AcceptBlock())
1630 return error("ProcessBlock() : AcceptBlock FAILED");
1632 // Recursively process any orphan blocks that depended on this one
1633 vector<uint256> vWorkQueue;
1634 vWorkQueue.push_back(hash);
1635 for (int i = 0; i < vWorkQueue.size(); i++)
1637 uint256 hashPrev = vWorkQueue[i];
1638 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1639 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1642 CBlock* pblockOrphan = (*mi).second;
1643 if (pblockOrphan->AcceptBlock())
1644 vWorkQueue.push_back(pblockOrphan->GetHash());
1645 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1646 delete pblockOrphan;
1648 mapOrphanBlocksByPrev.erase(hashPrev);
1651 printf("ProcessBlock: ACCEPTED\n");
1662 bool CheckDiskSpace(uint64 nAdditionalBytes)
1664 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1666 // Check for 15MB because database could create another 10MB log file at any time
1667 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1670 string strMessage = _("Warning: Disk space is low ");
1671 strMiscWarning = strMessage;
1672 printf("*** %s\n", strMessage.c_str());
1673 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1674 CreateThread(Shutdown, NULL);
1680 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1684 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1687 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1689 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1698 static unsigned int nCurrentBlockFile = 1;
1700 FILE* AppendBlockFile(unsigned int& nFileRet)
1705 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1708 if (fseek(file, 0, SEEK_END) != 0)
1710 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1711 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1713 nFileRet = nCurrentBlockFile;
1717 nCurrentBlockFile++;
1721 bool LoadBlockIndex(bool fAllowNew)
1725 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1726 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1727 pchMessageStart[0] = 0xfa;
1728 pchMessageStart[1] = 0xbf;
1729 pchMessageStart[2] = 0xb5;
1730 pchMessageStart[3] = 0xda;
1737 if (!txdb.LoadBlockIndex())
1742 // Init with genesis block
1744 if (mapBlockIndex.empty())
1750 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1751 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1752 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1753 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1754 // vMerkleTree: 4a5e1e
1757 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1759 txNew.vin.resize(1);
1760 txNew.vout.resize(1);
1761 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1762 txNew.vout[0].nValue = 50 * COIN;
1763 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1765 block.vtx.push_back(txNew);
1766 block.hashPrevBlock = 0;
1767 block.hashMerkleRoot = block.BuildMerkleTree();
1769 block.nTime = 1231006505;
1770 block.nBits = 0x1d00ffff;
1771 block.nNonce = 2083236893;
1775 block.nTime = 1296688602;
1776 block.nBits = 0x1d07fff8;
1777 block.nNonce = 384568319;
1781 printf("%s\n", block.GetHash().ToString().c_str());
1782 printf("%s\n", hashGenesisBlock.ToString().c_str());
1783 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1784 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1786 assert(block.GetHash() == hashGenesisBlock);
1788 // Start new block file
1790 unsigned int nBlockPos;
1791 if (!block.WriteToDisk(nFile, nBlockPos))
1792 return error("LoadBlockIndex() : writing genesis block to disk failed");
1793 if (!block.AddToBlockIndex(nFile, nBlockPos))
1794 return error("LoadBlockIndex() : genesis block not accepted");
1802 void PrintBlockTree()
1804 // precompute tree structure
1805 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1806 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1808 CBlockIndex* pindex = (*mi).second;
1809 mapNext[pindex->pprev].push_back(pindex);
1811 //while (rand() % 3 == 0)
1812 // mapNext[pindex->pprev].push_back(pindex);
1815 vector<pair<int, CBlockIndex*> > vStack;
1816 vStack.push_back(make_pair(0, pindexGenesisBlock));
1819 while (!vStack.empty())
1821 int nCol = vStack.back().first;
1822 CBlockIndex* pindex = vStack.back().second;
1825 // print split or gap
1826 if (nCol > nPrevCol)
1828 for (int i = 0; i < nCol-1; i++)
1832 else if (nCol < nPrevCol)
1834 for (int i = 0; i < nCol; i++)
1841 for (int i = 0; i < nCol; i++)
1846 block.ReadFromDisk(pindex);
1847 printf("%d (%u,%u) %s %s tx %d",
1851 block.GetHash().ToString().substr(0,20).c_str(),
1852 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1855 PrintWallets(block);
1857 // put the main timechain first
1858 vector<CBlockIndex*>& vNext = mapNext[pindex];
1859 for (int i = 0; i < vNext.size(); i++)
1861 if (vNext[i]->pnext)
1863 swap(vNext[0], vNext[i]);
1869 for (int i = 0; i < vNext.size(); i++)
1870 vStack.push_back(make_pair(nCol+i, vNext[i]));
1883 //////////////////////////////////////////////////////////////////////////////
1888 map<uint256, CAlert> mapAlerts;
1889 CCriticalSection cs_mapAlerts;
1891 string GetWarnings(string strFor)
1894 string strStatusBar;
1896 if (GetBoolArg("-testsafemode"))
1899 // Misc warnings like out of disk space and clock is wrong
1900 if (strMiscWarning != "")
1903 strStatusBar = strMiscWarning;
1906 // Longer invalid proof-of-work chain
1907 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1910 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1914 CRITICAL_BLOCK(cs_mapAlerts)
1916 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1918 const CAlert& alert = item.second;
1919 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1921 nPriority = alert.nPriority;
1922 strStatusBar = alert.strStatusBar;
1927 if (strFor == "statusbar")
1928 return strStatusBar;
1929 else if (strFor == "rpc")
1931 assert(!"GetWarnings() : invalid parameter");
1935 bool CAlert::ProcessAlert()
1937 if (!CheckSignature())
1942 CRITICAL_BLOCK(cs_mapAlerts)
1944 // Cancel previous alerts
1945 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1947 const CAlert& alert = (*mi).second;
1950 printf("cancelling alert %d\n", alert.nID);
1951 mapAlerts.erase(mi++);
1953 else if (!alert.IsInEffect())
1955 printf("expiring alert %d\n", alert.nID);
1956 mapAlerts.erase(mi++);
1962 // Check if this alert has been cancelled
1963 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1965 const CAlert& alert = item.second;
1966 if (alert.Cancels(*this))
1968 printf("alert already cancelled by %d\n", alert.nID);
1974 mapAlerts.insert(make_pair(GetHash(), *this));
1977 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1989 //////////////////////////////////////////////////////////////////////////////
1995 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1999 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2000 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2002 // Don't know what it is, just say we already got one
2009 // The message start string is designed to be unlikely to occur in normal data.
2010 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2011 // a large 4-byte int at any alignment.
2012 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2015 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2017 static map<CService, vector<unsigned char> > mapReuseKey;
2018 RandAddSeedPerfmon();
2020 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2021 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2023 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2025 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2033 if (strCommand == "version")
2035 // Each connection can only send one version message
2036 if (pfrom->nVersion != 0)
2038 pfrom->Misbehaving(1);
2046 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2047 if (pfrom->nVersion == 10300)
2048 pfrom->nVersion = 300;
2049 if (pfrom->nVersion >= 106 && !vRecv.empty())
2050 vRecv >> addrFrom >> nNonce;
2051 if (pfrom->nVersion >= 106 && !vRecv.empty())
2052 vRecv >> pfrom->strSubVer;
2053 if (pfrom->nVersion >= 209 && !vRecv.empty())
2054 vRecv >> pfrom->nStartingHeight;
2056 if (pfrom->nVersion == 0)
2059 // Disconnect if we connected to ourself
2060 if (nNonce == nLocalHostNonce && nNonce > 1)
2062 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2063 pfrom->fDisconnect = true;
2067 // Be shy and don't send version until we hear
2068 if (pfrom->fInbound)
2069 pfrom->PushVersion();
2071 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2073 AddTimeData(pfrom->addr, nTime);
2076 if (pfrom->nVersion >= 209)
2077 pfrom->PushMessage("verack");
2078 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2079 if (pfrom->nVersion < 209)
2080 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2082 if (!pfrom->fInbound)
2084 // Advertise our address
2085 if (addrLocalHost.IsRoutable() && !fUseProxy)
2087 CAddress addr(addrLocalHost);
2088 addr.nTime = GetAdjustedTime();
2089 pfrom->PushAddress(addr);
2092 // Get recent addresses
2093 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2095 pfrom->PushMessage("getaddr");
2096 pfrom->fGetAddr = true;
2100 // Ask the first connected node for block updates
2101 static int nAskedForBlocks = 0;
2102 if (!pfrom->fClient &&
2103 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2104 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2107 pfrom->PushGetBlocks(pindexBest, uint256(0));
2111 CRITICAL_BLOCK(cs_mapAlerts)
2112 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2113 item.second.RelayTo(pfrom);
2115 pfrom->fSuccessfullyConnected = true;
2117 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2119 cPeerBlockCounts.input(pfrom->nStartingHeight);
2123 else if (pfrom->nVersion == 0)
2125 // Must have a version message before anything else
2126 pfrom->Misbehaving(1);
2131 else if (strCommand == "verack")
2133 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2137 else if (strCommand == "addr")
2139 vector<CAddress> vAddr;
2142 // Don't want addr from older versions unless seeding
2143 if (pfrom->nVersion < 209)
2145 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2147 if (vAddr.size() > 1000)
2149 pfrom->Misbehaving(20);
2150 return error("message addr size() = %d", vAddr.size());
2153 // Store the new addresses
2156 int64 nNow = GetAdjustedTime();
2157 int64 nSince = nNow - 10 * 60;
2158 BOOST_FOREACH(CAddress& addr, vAddr)
2162 // ignore IPv6 for now, since it isn't implemented anyway
2165 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2166 addr.nTime = nNow - 5 * 24 * 60 * 60;
2167 AddAddress(addr, 2 * 60 * 60, &addrDB);
2168 pfrom->AddAddressKnown(addr);
2169 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2171 // Relay to a limited number of other nodes
2172 CRITICAL_BLOCK(cs_vNodes)
2174 // Use deterministic randomness to send to the same nodes for 24 hours
2175 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2176 static uint256 hashSalt;
2178 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2179 int64 hashAddr = addr.GetHash();
2180 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2181 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2182 multimap<uint256, CNode*> mapMix;
2183 BOOST_FOREACH(CNode* pnode, vNodes)
2185 if (pnode->nVersion < 31402)
2187 unsigned int nPointer;
2188 memcpy(&nPointer, &pnode, sizeof(nPointer));
2189 uint256 hashKey = hashRand ^ nPointer;
2190 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2191 mapMix.insert(make_pair(hashKey, pnode));
2193 int nRelayNodes = 2;
2194 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2195 ((*mi).second)->PushAddress(addr);
2199 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2200 if (vAddr.size() < 1000)
2201 pfrom->fGetAddr = false;
2205 else if (strCommand == "inv")
2209 if (vInv.size() > 50000)
2211 pfrom->Misbehaving(20);
2212 return error("message inv size() = %d", vInv.size());
2216 BOOST_FOREACH(const CInv& inv, vInv)
2220 pfrom->AddInventoryKnown(inv);
2222 bool fAlreadyHave = AlreadyHave(txdb, inv);
2224 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2228 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2229 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2231 // Track requests for our stuff
2232 Inventory(inv.hash);
2237 else if (strCommand == "getdata")
2241 if (vInv.size() > 50000)
2243 pfrom->Misbehaving(20);
2244 return error("message getdata size() = %d", vInv.size());
2247 BOOST_FOREACH(const CInv& inv, vInv)
2251 printf("received getdata for: %s\n", inv.ToString().c_str());
2253 if (inv.type == MSG_BLOCK)
2255 // Send block from disk
2256 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2257 if (mi != mapBlockIndex.end())
2260 block.ReadFromDisk((*mi).second);
2261 pfrom->PushMessage("block", block);
2263 // Trigger them to send a getblocks request for the next batch of inventory
2264 if (inv.hash == pfrom->hashContinue)
2266 // Bypass PushInventory, this must send even if redundant,
2267 // and we want it right after the last block so they don't
2268 // wait for other stuff first.
2270 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2271 pfrom->PushMessage("inv", vInv);
2272 pfrom->hashContinue = 0;
2276 else if (inv.IsKnownType())
2278 // Send stream from relay memory
2279 CRITICAL_BLOCK(cs_mapRelay)
2281 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2282 if (mi != mapRelay.end())
2283 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2287 // Track requests for our stuff
2288 Inventory(inv.hash);
2293 else if (strCommand == "getblocks")
2295 CBlockLocator locator;
2297 vRecv >> locator >> hashStop;
2299 // Find the last block the caller has in the main chain
2300 CBlockIndex* pindex = locator.GetBlockIndex();
2302 // Send the rest of the chain
2304 pindex = pindex->pnext;
2305 int nLimit = 500 + locator.GetDistanceBack();
2306 unsigned int nBytes = 0;
2307 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2308 for (; pindex; pindex = pindex->pnext)
2310 if (pindex->GetBlockHash() == hashStop)
2312 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2315 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2317 block.ReadFromDisk(pindex, true);
2318 nBytes += block.GetSerializeSize(SER_NETWORK);
2319 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2321 // When this block is requested, we'll send an inv that'll make them
2322 // getblocks the next batch of inventory.
2323 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2324 pfrom->hashContinue = pindex->GetBlockHash();
2331 else if (strCommand == "getheaders")
2333 CBlockLocator locator;
2335 vRecv >> locator >> hashStop;
2337 CBlockIndex* pindex = NULL;
2338 if (locator.IsNull())
2340 // If locator is null, return the hashStop block
2341 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2342 if (mi == mapBlockIndex.end())
2344 pindex = (*mi).second;
2348 // Find the last block the caller has in the main chain
2349 pindex = locator.GetBlockIndex();
2351 pindex = pindex->pnext;
2354 vector<CBlock> vHeaders;
2355 int nLimit = 2000 + locator.GetDistanceBack();
2356 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2357 for (; pindex; pindex = pindex->pnext)
2359 vHeaders.push_back(pindex->GetBlockHeader());
2360 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2363 pfrom->PushMessage("headers", vHeaders);
2367 else if (strCommand == "tx")
2369 vector<uint256> vWorkQueue;
2370 CDataStream vMsg(vRecv);
2374 CInv inv(MSG_TX, tx.GetHash());
2375 pfrom->AddInventoryKnown(inv);
2377 bool fMissingInputs = false;
2378 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2380 SyncWithWallets(tx, NULL, true);
2381 RelayMessage(inv, vMsg);
2382 mapAlreadyAskedFor.erase(inv);
2383 vWorkQueue.push_back(inv.hash);
2385 // Recursively process any orphan transactions that depended on this one
2386 for (int i = 0; i < vWorkQueue.size(); i++)
2388 uint256 hashPrev = vWorkQueue[i];
2389 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2390 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2393 const CDataStream& vMsg = *((*mi).second);
2395 CDataStream(vMsg) >> tx;
2396 CInv inv(MSG_TX, tx.GetHash());
2398 if (tx.AcceptToMemoryPool(true))
2400 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2401 SyncWithWallets(tx, NULL, true);
2402 RelayMessage(inv, vMsg);
2403 mapAlreadyAskedFor.erase(inv);
2404 vWorkQueue.push_back(inv.hash);
2409 BOOST_FOREACH(uint256 hash, vWorkQueue)
2410 EraseOrphanTx(hash);
2412 else if (fMissingInputs)
2414 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2417 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2421 else if (strCommand == "block")
2426 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2429 CInv inv(MSG_BLOCK, block.GetHash());
2430 pfrom->AddInventoryKnown(inv);
2432 if (ProcessBlock(pfrom, &block))
2433 mapAlreadyAskedFor.erase(inv);
2434 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2438 else if (strCommand == "getaddr")
2440 // Nodes rebroadcast an addr every 24 hours
2441 pfrom->vAddrToSend.clear();
2442 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2443 CRITICAL_BLOCK(cs_mapAddresses)
2445 unsigned int nCount = 0;
2446 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2448 const CAddress& addr = item.second;
2449 if (addr.nTime > nSince)
2452 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2454 const CAddress& addr = item.second;
2455 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2456 pfrom->PushAddress(addr);
2462 else if (strCommand == "checkorder")
2467 if (!GetBoolArg("-allowreceivebyip"))
2469 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2476 /// we have a chance to check the order here
2478 // Keep giving the same key to the same ip until they use it
2479 if (!mapReuseKey.count(pfrom->addr))
2480 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2482 // Send back approval of order and pubkey to use
2483 CScript scriptPubKey;
2484 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2485 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2489 else if (strCommand == "reply")
2494 CRequestTracker tracker;
2495 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2497 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2498 if (mi != pfrom->mapRequests.end())
2500 tracker = (*mi).second;
2501 pfrom->mapRequests.erase(mi);
2504 if (!tracker.IsNull())
2505 tracker.fn(tracker.param1, vRecv);
2509 else if (strCommand == "ping")
2514 else if (strCommand == "alert")
2519 if (alert.ProcessAlert())
2522 pfrom->setKnown.insert(alert.GetHash());
2523 CRITICAL_BLOCK(cs_vNodes)
2524 BOOST_FOREACH(CNode* pnode, vNodes)
2525 alert.RelayTo(pnode);
2532 // Ignore unknown commands for extensibility
2536 // Update the last seen time for this node's address
2537 if (pfrom->fNetworkNode)
2538 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2539 AddressCurrentlyConnected(pfrom->addr);
2545 bool ProcessMessages(CNode* pfrom)
2547 CDataStream& vRecv = pfrom->vRecv;
2551 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2555 // (4) message start
2564 // Scan for message start
2565 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2566 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2567 if (vRecv.end() - pstart < nHeaderSize)
2569 if (vRecv.size() > nHeaderSize)
2571 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2572 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2576 if (pstart - vRecv.begin() > 0)
2577 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2578 vRecv.erase(vRecv.begin(), pstart);
2581 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2586 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2589 string strCommand = hdr.GetCommand();
2592 unsigned int nMessageSize = hdr.nMessageSize;
2593 if (nMessageSize > MAX_SIZE)
2595 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2598 if (nMessageSize > vRecv.size())
2600 // Rewind and wait for rest of message
2601 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2606 if (vRecv.GetVersion() >= 209)
2608 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2609 unsigned int nChecksum = 0;
2610 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2611 if (nChecksum != hdr.nChecksum)
2613 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2614 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2619 // Copy message to its own buffer
2620 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2621 vRecv.ignore(nMessageSize);
2627 CRITICAL_BLOCK(cs_main)
2628 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2632 catch (std::ios_base::failure& e)
2634 if (strstr(e.what(), "end of data"))
2636 // Allow exceptions from underlength message on vRecv
2637 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());
2639 else if (strstr(e.what(), "size too large"))
2641 // Allow exceptions from overlong size
2642 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2646 PrintExceptionContinue(&e, "ProcessMessage()");
2649 catch (std::exception& e) {
2650 PrintExceptionContinue(&e, "ProcessMessage()");
2652 PrintExceptionContinue(NULL, "ProcessMessage()");
2656 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2664 bool SendMessages(CNode* pto, bool fSendTrickle)
2666 CRITICAL_BLOCK(cs_main)
2668 // Don't send anything until we get their version message
2669 if (pto->nVersion == 0)
2673 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2674 pto->PushMessage("ping");
2676 // Resend wallet transactions that haven't gotten in a block yet
2677 ResendWalletTransactions();
2679 // Address refresh broadcast
2680 static int64 nLastRebroadcast;
2681 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2683 nLastRebroadcast = GetTime();
2684 CRITICAL_BLOCK(cs_vNodes)
2686 BOOST_FOREACH(CNode* pnode, vNodes)
2688 // Periodically clear setAddrKnown to allow refresh broadcasts
2689 pnode->setAddrKnown.clear();
2691 // Rebroadcast our address
2692 if (addrLocalHost.IsRoutable() && !fUseProxy)
2694 CAddress addr(addrLocalHost);
2695 addr.nTime = GetAdjustedTime();
2696 pnode->PushAddress(addr);
2702 // Clear out old addresses periodically so it's not too much work at once
2703 static int64 nLastClear;
2704 if (nLastClear == 0)
2705 nLastClear = GetTime();
2706 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2708 nLastClear = GetTime();
2709 CRITICAL_BLOCK(cs_mapAddresses)
2712 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2713 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2714 mi != mapAddresses.end();)
2716 const CAddress& addr = (*mi).second;
2717 if (addr.nTime < nSince)
2719 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2721 addrdb.EraseAddress(addr);
2722 mapAddresses.erase(mi++);
2736 vector<CAddress> vAddr;
2737 vAddr.reserve(pto->vAddrToSend.size());
2738 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2740 // returns true if wasn't already contained in the set
2741 if (pto->setAddrKnown.insert(addr).second)
2743 vAddr.push_back(addr);
2744 // receiver rejects addr messages larger than 1000
2745 if (vAddr.size() >= 1000)
2747 pto->PushMessage("addr", vAddr);
2752 pto->vAddrToSend.clear();
2754 pto->PushMessage("addr", vAddr);
2759 // Message: inventory
2762 vector<CInv> vInvWait;
2763 CRITICAL_BLOCK(pto->cs_inventory)
2765 vInv.reserve(pto->vInventoryToSend.size());
2766 vInvWait.reserve(pto->vInventoryToSend.size());
2767 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2769 if (pto->setInventoryKnown.count(inv))
2772 // trickle out tx inv to protect privacy
2773 if (inv.type == MSG_TX && !fSendTrickle)
2775 // 1/4 of tx invs blast to all immediately
2776 static uint256 hashSalt;
2778 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2779 uint256 hashRand = inv.hash ^ hashSalt;
2780 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2781 bool fTrickleWait = ((hashRand & 3) != 0);
2783 // always trickle our own transactions
2787 if (GetTransaction(inv.hash, wtx))
2789 fTrickleWait = true;
2794 vInvWait.push_back(inv);
2799 // returns true if wasn't already contained in the set
2800 if (pto->setInventoryKnown.insert(inv).second)
2802 vInv.push_back(inv);
2803 if (vInv.size() >= 1000)
2805 pto->PushMessage("inv", vInv);
2810 pto->vInventoryToSend = vInvWait;
2813 pto->PushMessage("inv", vInv);
2819 vector<CInv> vGetData;
2820 int64 nNow = GetTime() * 1000000;
2822 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2824 const CInv& inv = (*pto->mapAskFor.begin()).second;
2825 if (!AlreadyHave(txdb, inv))
2827 printf("sending getdata: %s\n", inv.ToString().c_str());
2828 vGetData.push_back(inv);
2829 if (vGetData.size() >= 1000)
2831 pto->PushMessage("getdata", vGetData);
2835 mapAlreadyAskedFor[inv] = nNow;
2836 pto->mapAskFor.erase(pto->mapAskFor.begin());
2838 if (!vGetData.empty())
2839 pto->PushMessage("getdata", vGetData);
2858 //////////////////////////////////////////////////////////////////////////////
2863 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2865 unsigned char* pdata = (unsigned char*)pbuffer;
2866 unsigned int blocks = 1 + ((len + 8) / 64);
2867 unsigned char* pend = pdata + 64 * blocks;
2868 memset(pdata + len, 0, 64 * blocks - len);
2870 unsigned int bits = len * 8;
2871 pend[-1] = (bits >> 0) & 0xff;
2872 pend[-2] = (bits >> 8) & 0xff;
2873 pend[-3] = (bits >> 16) & 0xff;
2874 pend[-4] = (bits >> 24) & 0xff;
2878 static const unsigned int pSHA256InitState[8] =
2879 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2881 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2884 unsigned char data[64];
2888 for (int i = 0; i < 16; i++)
2889 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2891 for (int i = 0; i < 8; i++)
2892 ctx.h[i] = ((uint32_t*)pinit)[i];
2894 SHA256_Update(&ctx, data, sizeof(data));
2895 for (int i = 0; i < 8; i++)
2896 ((uint32_t*)pstate)[i] = ctx.h[i];
2900 // ScanHash scans nonces looking for a hash with at least some zero bits.
2901 // It operates on big endian data. Caller does the byte reversing.
2902 // All input buffers are 16-byte aligned. nNonce is usually preserved
2903 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2904 // the block is rebuilt and nNonce starts over at zero.
2906 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2908 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2912 // Hash pdata using pmidstate as the starting state into
2913 // preformatted buffer phash1, then hash phash1 into phash
2915 SHA256Transform(phash1, pdata, pmidstate);
2916 SHA256Transform(phash, phash1, pSHA256InitState);
2918 // Return the nonce if the hash has at least some zero bits,
2919 // caller will check if it has enough to reach the target
2920 if (((unsigned short*)phash)[14] == 0)
2923 // If nothing found after trying for a while, return -1
2924 if ((nNonce & 0xffff) == 0)
2926 nHashesDone = 0xffff+1;
2932 // Some explaining would be appreciated
2937 set<uint256> setDependsOn;
2940 COrphan(CTransaction* ptxIn)
2948 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2949 BOOST_FOREACH(uint256 hash, setDependsOn)
2950 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2955 uint64 nLastBlockTx = 0;
2956 uint64 nLastBlockSize = 0;
2958 CBlock* CreateNewBlock(CReserveKey& reservekey)
2960 CBlockIndex* pindexPrev = pindexBest;
2963 auto_ptr<CBlock> pblock(new CBlock());
2967 // Create coinbase tx
2969 txNew.vin.resize(1);
2970 txNew.vin[0].prevout.SetNull();
2971 txNew.vout.resize(1);
2972 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2974 // Add our coinbase tx as first transaction
2975 pblock->vtx.push_back(txNew);
2977 // Collect memory pool transactions into the block
2979 CRITICAL_BLOCK(cs_main)
2980 CRITICAL_BLOCK(cs_mapTransactions)
2984 // Priority order to process transactions
2985 list<COrphan> vOrphan; // list memory doesn't move
2986 map<uint256, vector<COrphan*> > mapDependers;
2987 multimap<double, CTransaction*> mapPriority;
2988 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2990 CTransaction& tx = (*mi).second;
2991 if (tx.IsCoinBase() || !tx.IsFinal())
2994 COrphan* porphan = NULL;
2995 double dPriority = 0;
2996 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2998 // Read prev transaction
2999 CTransaction txPrev;
3001 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3003 // Has to wait for dependencies
3006 // Use list for automatic deletion
3007 vOrphan.push_back(COrphan(&tx));
3008 porphan = &vOrphan.back();
3010 mapDependers[txin.prevout.hash].push_back(porphan);
3011 porphan->setDependsOn.insert(txin.prevout.hash);
3014 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3016 // Read block header
3017 int nConf = txindex.GetDepthInMainChain();
3019 dPriority += (double)nValueIn * nConf;
3021 if (fDebug && GetBoolArg("-printpriority"))
3022 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3025 // Priority is sum(valuein * age) / txsize
3026 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3029 porphan->dPriority = dPriority;
3031 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3033 if (fDebug && GetBoolArg("-printpriority"))
3035 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3042 // Collect transactions into block
3043 map<uint256, CTxIndex> mapTestPool;
3044 uint64 nBlockSize = 1000;
3045 uint64 nBlockTx = 0;
3046 int nBlockSigOps = 100;
3047 while (!mapPriority.empty())
3049 // Take highest priority transaction off priority queue
3050 double dPriority = -(*mapPriority.begin()).first;
3051 CTransaction& tx = *(*mapPriority.begin()).second;
3052 mapPriority.erase(mapPriority.begin());
3055 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3056 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3059 // Legacy limits on sigOps:
3060 int nTxSigOps = tx.GetLegacySigOpCount();
3061 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3064 // Transaction fee required depends on block size
3065 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3066 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3068 // Connecting shouldn't fail due to dependency on other memory pool transactions
3069 // because we're already processing them in order of dependency
3070 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3071 MapPrevTx mapInputs;
3073 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3076 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3077 if (nFees < nMinFee)
3080 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3081 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3084 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3086 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3087 swap(mapTestPool, mapTestPoolTmp);
3090 pblock->vtx.push_back(tx);
3091 nBlockSize += nTxSize;
3093 nBlockSigOps += nTxSigOps;
3095 // Add transactions that depend on this one to the priority queue
3096 uint256 hash = tx.GetHash();
3097 if (mapDependers.count(hash))
3099 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3101 if (!porphan->setDependsOn.empty())
3103 porphan->setDependsOn.erase(hash);
3104 if (porphan->setDependsOn.empty())
3105 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3111 nLastBlockTx = nBlockTx;
3112 nLastBlockSize = nBlockSize;
3113 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3116 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3119 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3120 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3121 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3122 pblock->nBits = GetNextWorkRequired(pindexPrev);
3125 return pblock.release();
3129 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3131 // Update nExtraNonce
3132 static uint256 hashPrevBlock;
3133 if (hashPrevBlock != pblock->hashPrevBlock)
3136 hashPrevBlock = pblock->hashPrevBlock;
3139 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3140 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3142 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3146 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3149 // Prebuild hash buffers
3156 uint256 hashPrevBlock;
3157 uint256 hashMerkleRoot;
3160 unsigned int nNonce;
3163 unsigned char pchPadding0[64];
3165 unsigned char pchPadding1[64];
3168 memset(&tmp, 0, sizeof(tmp));
3170 tmp.block.nVersion = pblock->nVersion;
3171 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3172 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3173 tmp.block.nTime = pblock->nTime;
3174 tmp.block.nBits = pblock->nBits;
3175 tmp.block.nNonce = pblock->nNonce;
3177 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3178 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3180 // Byte swap all the input buffer
3181 for (int i = 0; i < sizeof(tmp)/4; i++)
3182 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3184 // Precalc the first half of the first hash, which stays constant
3185 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3187 memcpy(pdata, &tmp.block, 128);
3188 memcpy(phash1, &tmp.hash1, 64);
3192 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3194 uint256 hash = pblock->GetHash();
3195 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3197 if (hash > hashTarget)
3201 printf("BitcoinMiner:\n");
3202 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3204 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3205 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3208 CRITICAL_BLOCK(cs_main)
3210 if (pblock->hashPrevBlock != hashBestChain)
3211 return error("BitcoinMiner : generated block is stale");
3213 // Remove key from key pool
3214 reservekey.KeepKey();
3216 // Track how many getdata requests this block gets
3217 CRITICAL_BLOCK(wallet.cs_wallet)
3218 wallet.mapRequestCount[pblock->GetHash()] = 0;
3220 // Process this block the same as if we had received it from another node
3221 if (!ProcessBlock(NULL, pblock))
3222 return error("BitcoinMiner : ProcessBlock, block not accepted");
3228 void static ThreadBitcoinMiner(void* parg);
3230 void static BitcoinMiner(CWallet *pwallet)
3232 printf("BitcoinMiner started\n");
3233 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3235 // Each thread has its own key and counter
3236 CReserveKey reservekey(pwallet);
3237 unsigned int nExtraNonce = 0;
3239 while (fGenerateBitcoins)
3241 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3245 while (vNodes.empty() || IsInitialBlockDownload())
3250 if (!fGenerateBitcoins)
3258 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3259 CBlockIndex* pindexPrev = pindexBest;
3261 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3264 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3266 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3270 // Prebuild hash buffers
3272 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3273 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3274 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3276 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3278 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3279 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3285 int64 nStart = GetTime();
3286 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3288 uint256& hash = *alignup<16>(hashbuf);
3291 unsigned int nHashesDone = 0;
3292 unsigned int nNonceFound;
3295 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3296 (char*)&hash, nHashesDone);
3298 // Check if something found
3299 if (nNonceFound != -1)
3301 for (int i = 0; i < sizeof(hash)/4; i++)
3302 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3304 if (hash <= hashTarget)
3307 pblock->nNonce = ByteReverse(nNonceFound);
3308 assert(hash == pblock->GetHash());
3310 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3311 CheckWork(pblock.get(), *pwalletMain, reservekey);
3312 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3318 static int64 nHashCounter;
3319 if (nHPSTimerStart == 0)
3321 nHPSTimerStart = GetTimeMillis();
3325 nHashCounter += nHashesDone;
3326 if (GetTimeMillis() - nHPSTimerStart > 4000)
3328 static CCriticalSection cs;
3331 if (GetTimeMillis() - nHPSTimerStart > 4000)
3333 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3334 nHPSTimerStart = GetTimeMillis();
3336 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3337 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3338 static int64 nLogTime;
3339 if (GetTime() - nLogTime > 30 * 60)
3341 nLogTime = GetTime();
3342 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3343 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3349 // Check for stop or if block needs to be rebuilt
3352 if (!fGenerateBitcoins)
3354 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3358 if (nBlockNonce >= 0xffff0000)
3360 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3362 if (pindexPrev != pindexBest)
3365 // Update nTime every few seconds
3366 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3367 nBlockTime = ByteReverse(pblock->nTime);
3372 void static ThreadBitcoinMiner(void* parg)
3374 CWallet* pwallet = (CWallet*)parg;
3377 vnThreadsRunning[3]++;
3378 BitcoinMiner(pwallet);
3379 vnThreadsRunning[3]--;
3381 catch (std::exception& e) {
3382 vnThreadsRunning[3]--;
3383 PrintException(&e, "ThreadBitcoinMiner()");
3385 vnThreadsRunning[3]--;
3386 PrintException(NULL, "ThreadBitcoinMiner()");
3388 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3390 if (vnThreadsRunning[3] == 0)
3392 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3396 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3398 if (fGenerateBitcoins != fGenerate)
3400 fGenerateBitcoins = fGenerate;
3401 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3404 if (fGenerateBitcoins)
3406 int nProcessors = boost::thread::hardware_concurrency();
3407 printf("%d processors\n", nProcessors);
3408 if (nProcessors < 1)
3410 if (fLimitProcessors && nProcessors > nLimitProcessors)
3411 nProcessors = nLimitProcessors;
3412 int nAddThreads = nProcessors - vnThreadsRunning[3];
3413 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3414 for (int i = 0; i < nAddThreads; i++)
3416 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3417 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");