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;
55 // Constant stuff for coinbase transactions we create:
56 CScript COINBASE_FLAGS;
58 const string strMessageMagic = "Bitcoin Signed Message:\n";
65 int fGenerateBitcoins = false;
66 int64 nTransactionFee = 0;
67 int fLimitProcessors = false;
68 int nLimitProcessors = 1;
69 int fMinimizeToTray = true;
70 int fMinimizeOnClose = true;
78 //////////////////////////////////////////////////////////////////////////////
80 // dispatching functions
83 // These functions dispatch to one or all registered wallets
86 void RegisterWallet(CWallet* pwalletIn)
88 CRITICAL_BLOCK(cs_setpwalletRegistered)
90 setpwalletRegistered.insert(pwalletIn);
94 void UnregisterWallet(CWallet* pwalletIn)
96 CRITICAL_BLOCK(cs_setpwalletRegistered)
98 setpwalletRegistered.erase(pwalletIn);
102 // check whether the passed transaction is from us
103 bool static IsFromMe(CTransaction& tx)
105 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
106 if (pwallet->IsFromMe(tx))
111 // get the wallet transaction with the given hash (if it exists)
112 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
114 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
115 if (pwallet->GetTransaction(hashTx,wtx))
120 // erases transaction with the given hash from all wallets
121 void static EraseFromWallets(uint256 hash)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->EraseFromWallet(hash);
127 // make sure all wallets know about the given transaction, in the given block
128 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
130 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
131 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
134 // notify wallets about a new best chain
135 void static SetBestChain(const CBlockLocator& loc)
137 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
138 pwallet->SetBestChain(loc);
141 // notify wallets about an updated transaction
142 void static UpdatedTransaction(const uint256& hashTx)
144 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
145 pwallet->UpdatedTransaction(hashTx);
149 void static PrintWallets(const CBlock& block)
151 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
152 pwallet->PrintWallet(block);
155 // notify wallets about an incoming inventory (for request counts)
156 void static Inventory(const uint256& hash)
158 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
159 pwallet->Inventory(hash);
162 // ask wallets to resend their transactions
163 void static ResendWalletTransactions()
165 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
166 pwallet->ResendWalletTransactions();
175 //////////////////////////////////////////////////////////////////////////////
177 // mapOrphanTransactions
180 void static AddOrphanTx(const CDataStream& vMsg)
183 CDataStream(vMsg) >> tx;
184 uint256 hash = tx.GetHash();
185 if (mapOrphanTransactions.count(hash))
187 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
188 BOOST_FOREACH(const CTxIn& txin, tx.vin)
189 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
192 void static EraseOrphanTx(uint256 hash)
194 if (!mapOrphanTransactions.count(hash))
196 const CDataStream* pvMsg = mapOrphanTransactions[hash];
198 CDataStream(*pvMsg) >> tx;
199 BOOST_FOREACH(const CTxIn& txin, tx.vin)
201 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
202 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
204 if ((*mi).second == pvMsg)
205 mapOrphanTransactionsByPrev.erase(mi++);
211 mapOrphanTransactions.erase(hash);
221 //////////////////////////////////////////////////////////////////////////////
223 // CTransaction and CTxIndex
226 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
229 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
231 if (!ReadFromDisk(txindexRet.pos))
233 if (prevout.n >= vout.size())
241 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
244 return ReadFromDisk(txdb, prevout, txindex);
247 bool CTransaction::ReadFromDisk(COutPoint prevout)
251 return ReadFromDisk(txdb, prevout, txindex);
254 bool CTransaction::IsStandard() const
256 BOOST_FOREACH(const CTxIn& txin, vin)
258 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
259 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
260 // ~65-byte public keys, plus a few script ops.
261 if (txin.scriptSig.size() > 500)
263 if (!txin.scriptSig.IsPushOnly())
266 BOOST_FOREACH(const CTxOut& txout, vout)
267 if (!::IsStandard(txout.scriptPubKey))
273 // Check transaction inputs, and make sure any
274 // pay-to-script-hash transactions are evaluating IsStandard scripts
276 // Why bother? To avoid denial-of-service attacks; an attacker
277 // can submit a standard HASH... OP_EQUAL transaction,
278 // which will get accepted into blocks. The redemption
279 // script can be anything; an attacker could use a very
280 // expensive-to-check-upon-redemption script like:
281 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
283 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
286 return true; // Coinbases don't use vin normally
288 for (int i = 0; i < vin.size(); i++)
290 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
292 vector<vector<unsigned char> > vSolutions;
293 txnouttype whichType;
294 // get the scriptPubKey corresponding to this input:
295 const CScript& prevScript = prev.scriptPubKey;
296 if (!Solver(prevScript, whichType, vSolutions))
298 if (whichType == TX_SCRIPTHASH)
300 vector<vector<unsigned char> > stack;
302 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
306 CScript subscript(stack.back().begin(), stack.back().end());
307 if (!::IsStandard(subscript))
316 CTransaction::GetLegacySigOpCount() const
319 BOOST_FOREACH(const CTxIn& txin, vin)
321 nSigOps += txin.scriptSig.GetSigOpCount(false);
323 BOOST_FOREACH(const CTxOut& txout, vout)
325 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
331 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
343 // Load the block this tx is in
345 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
347 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
352 // Update the tx's hashBlock
353 hashBlock = pblock->GetHash();
355 // Locate the transaction
356 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
357 if (pblock->vtx[nIndex] == *(CTransaction*)this)
359 if (nIndex == pblock->vtx.size())
361 vMerkleBranch.clear();
363 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
367 // Fill in merkle branch
368 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
371 // Is the tx in a block that's in the main chain
372 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
373 if (mi == mapBlockIndex.end())
375 CBlockIndex* pindex = (*mi).second;
376 if (!pindex || !pindex->IsInMainChain())
379 return pindexBest->nHeight - pindex->nHeight + 1;
388 bool CTransaction::CheckTransaction() const
390 // Basic checks that don't depend on any context
392 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
394 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
396 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
397 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
399 // Check for negative or overflow output values
401 BOOST_FOREACH(const CTxOut& txout, vout)
403 if (txout.nValue < 0)
404 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
405 if (txout.nValue > MAX_MONEY)
406 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
407 nValueOut += txout.nValue;
408 if (!MoneyRange(nValueOut))
409 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
412 // Check for duplicate inputs
413 set<COutPoint> vInOutPoints;
414 BOOST_FOREACH(const CTxIn& txin, vin)
416 if (vInOutPoints.count(txin.prevout))
418 vInOutPoints.insert(txin.prevout);
423 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
424 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
428 BOOST_FOREACH(const CTxIn& txin, vin)
429 if (txin.prevout.IsNull())
430 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
436 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
439 *pfMissingInputs = false;
441 if (!CheckTransaction())
442 return error("AcceptToMemoryPool() : CheckTransaction failed");
444 // Coinbase is only valid in a block, not as a loose transaction
446 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
448 // To help v0.1.5 clients who would see it as a negative number
449 if ((int64)nLockTime > std::numeric_limits<int>::max())
450 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
452 // Rather not work on nonstandard transactions (unless -testnet)
453 if (!fTestNet && !IsStandard())
454 return error("AcceptToMemoryPool() : nonstandard transaction type");
456 // Do we already have it?
457 uint256 hash = GetHash();
458 CRITICAL_BLOCK(cs_mapTransactions)
459 if (mapTransactions.count(hash))
462 if (txdb.ContainsTx(hash))
465 // Check for conflicts with in-memory transactions
466 CTransaction* ptxOld = NULL;
467 for (int i = 0; i < vin.size(); i++)
469 COutPoint outpoint = vin[i].prevout;
470 if (mapNextTx.count(outpoint))
472 // Disable replacement feature for now
475 // Allow replacing with a newer version of the same transaction
478 ptxOld = mapNextTx[outpoint].ptx;
479 if (ptxOld->IsFinal())
481 if (!IsNewerThan(*ptxOld))
483 for (int i = 0; i < vin.size(); i++)
485 COutPoint outpoint = vin[i].prevout;
486 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
496 map<uint256, CTxIndex> mapUnused;
497 bool fInvalid = false;
498 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
501 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
503 *pfMissingInputs = true;
504 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
507 // Check for non-standard pay-to-script-hash in inputs
508 if (!AreInputsStandard(mapInputs) && !fTestNet)
509 return error("AcceptToMemoryPool() : nonstandard transaction input");
511 // Note: if you modify this code to accept non-standard transactions, then
512 // you should add code here to check that the transaction does a
513 // reasonable number of ECDSA signature verifications.
515 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
516 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
518 // Don't accept it if it can't get into a block
519 if (nFees < GetMinFee(1000, true, GMF_RELAY))
520 return error("AcceptToMemoryPool() : not enough fees");
522 // Continuously rate-limit free transactions
523 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
524 // be annoying or make other's transactions take longer to confirm.
525 if (nFees < MIN_RELAY_TX_FEE)
527 static CCriticalSection cs;
528 static double dFreeCount;
529 static int64 nLastTime;
530 int64 nNow = GetTime();
534 // Use an exponentially decaying ~10-minute window:
535 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
537 // -limitfreerelay unit is thousand-bytes-per-minute
538 // At default rate it would take over a month to fill 1GB
539 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
540 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
542 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
547 // Check against previous transactions
548 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
549 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
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)
773 // Testnet has min-difficulty blocks
774 // after nTargetSpacing*2 time between blocks:
775 if (fTestNet && nTime > nTargetSpacing*2)
776 return bnProofOfWorkLimit.GetCompact();
779 bnResult.SetCompact(nBase);
780 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
782 // Maximum 400% adjustment...
784 // ... in best-case exactly 4-times-normal target time
785 nTime -= nTargetTimespan*4;
787 if (bnResult > bnProofOfWorkLimit)
788 bnResult = bnProofOfWorkLimit;
789 return bnResult.GetCompact();
792 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
794 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
797 if (pindexLast == NULL)
798 return nProofOfWorkLimit;
800 // Only change once per interval
801 if ((pindexLast->nHeight+1) % nInterval != 0)
803 // Special rules for testnet after 15 Feb 2012:
804 if (fTestNet && pblock->nTime > 1329264000)
806 // If the new block's timestamp is more than 2* 10 minutes
807 // then allow mining of a min-difficulty block.
808 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
809 return nProofOfWorkLimit;
812 // Return the last non-special-min-difficulty-rules-block
813 const CBlockIndex* pindex = pindexLast;
814 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
815 pindex = pindex->pprev;
816 return pindex->nBits;
820 return pindexLast->nBits;
823 // Go back by what we want to be 14 days worth of blocks
824 const CBlockIndex* pindexFirst = pindexLast;
825 for (int i = 0; pindexFirst && i < nInterval-1; i++)
826 pindexFirst = pindexFirst->pprev;
829 // Limit adjustment step
830 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
831 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
832 if (nActualTimespan < nTargetTimespan/4)
833 nActualTimespan = nTargetTimespan/4;
834 if (nActualTimespan > nTargetTimespan*4)
835 nActualTimespan = nTargetTimespan*4;
839 bnNew.SetCompact(pindexLast->nBits);
840 bnNew *= nActualTimespan;
841 bnNew /= nTargetTimespan;
843 if (bnNew > bnProofOfWorkLimit)
844 bnNew = bnProofOfWorkLimit;
847 printf("GetNextWorkRequired RETARGET\n");
848 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
849 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
850 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
852 return bnNew.GetCompact();
855 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
858 bnTarget.SetCompact(nBits);
861 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
862 return error("CheckProofOfWork() : nBits below minimum work");
864 // Check proof of work matches claimed amount
865 if (hash > bnTarget.getuint256())
866 return error("CheckProofOfWork() : hash doesn't match nBits");
871 // Return maximum amount of blocks that other nodes claim to have
872 int GetNumBlocksOfPeers()
874 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
877 bool IsInitialBlockDownload()
879 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
881 static int64 nLastUpdate;
882 static CBlockIndex* pindexLastBest;
883 if (pindexBest != pindexLastBest)
885 pindexLastBest = pindexBest;
886 nLastUpdate = GetTime();
888 return (GetTime() - nLastUpdate < 10 &&
889 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
892 void static InvalidChainFound(CBlockIndex* pindexNew)
894 if (pindexNew->bnChainWork > bnBestInvalidWork)
896 bnBestInvalidWork = pindexNew->bnChainWork;
897 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
900 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());
901 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
902 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
903 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
916 bool CTransaction::DisconnectInputs(CTxDB& txdb)
918 // Relinquish previous transactions' spent pointers
921 BOOST_FOREACH(const CTxIn& txin, vin)
923 COutPoint prevout = txin.prevout;
925 // Get prev txindex from disk
927 if (!txdb.ReadTxIndex(prevout.hash, txindex))
928 return error("DisconnectInputs() : ReadTxIndex failed");
930 if (prevout.n >= txindex.vSpent.size())
931 return error("DisconnectInputs() : prevout.n out of range");
933 // Mark outpoint as not spent
934 txindex.vSpent[prevout.n].SetNull();
937 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
938 return error("DisconnectInputs() : UpdateTxIndex failed");
942 // Remove transaction from index
943 if (!txdb.EraseTxIndex(*this))
944 return error("DisconnectInputs() : EraseTxPos failed");
950 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
951 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
953 // FetchInputs can return false either because we just haven't seen some inputs
954 // (in which case the transaction should be stored as an orphan)
955 // or because the transaction is malformed (in which case the transaction should
956 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
960 return true; // Coinbase transactions have no inputs to fetch.
962 for (int i = 0; i < vin.size(); i++)
964 COutPoint prevout = vin[i].prevout;
965 if (inputsRet.count(prevout.hash))
966 continue; // Got it already
969 CTxIndex& txindex = inputsRet[prevout.hash].first;
971 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
973 // Get txindex from current proposed changes
974 txindex = mapTestPool.find(prevout.hash)->second;
978 // Read txindex from txdb
979 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
981 if (!fFound && (fBlock || fMiner))
982 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());
985 CTransaction& txPrev = inputsRet[prevout.hash].second;
986 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
988 // Get prev tx from single transactions in memory
989 CRITICAL_BLOCK(cs_mapTransactions)
991 if (!mapTransactions.count(prevout.hash))
992 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
993 txPrev = mapTransactions[prevout.hash];
996 txindex.vSpent.resize(txPrev.vout.size());
1000 // Get prev tx from disk
1001 if (!txPrev.ReadFromDisk(txindex.pos))
1002 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1006 // Make sure all prevout.n's are valid:
1007 for (int i = 0; i < vin.size(); i++)
1009 const COutPoint prevout = vin[i].prevout;
1010 assert(inputsRet.count(prevout.hash) != 0);
1011 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1012 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1013 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1015 // Revisit this if/when transaction replacement is implemented and allows
1018 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()));
1025 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1027 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1028 if (mi == inputs.end())
1029 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1031 const CTransaction& txPrev = (mi->second).second;
1032 if (input.prevout.n >= txPrev.vout.size())
1033 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1035 return txPrev.vout[input.prevout.n];
1038 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1044 for (int i = 0; i < vin.size(); i++)
1046 nResult += GetOutputFor(vin[i], inputs).nValue;
1052 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1058 for (int i = 0; i < vin.size(); i++)
1060 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1061 if (prevout.scriptPubKey.IsPayToScriptHash())
1062 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1067 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1068 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1069 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1071 // Take over previous transactions' spent pointers
1072 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1073 // fMiner is true when called from the internal bitcoin miner
1074 // ... both are false when called from CTransaction::AcceptToMemoryPool
1079 for (int i = 0; i < vin.size(); i++)
1081 COutPoint prevout = vin[i].prevout;
1082 assert(inputs.count(prevout.hash) > 0);
1083 CTxIndex& txindex = inputs[prevout.hash].first;
1084 CTransaction& txPrev = inputs[prevout.hash].second;
1086 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1087 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()));
1089 // If prev is coinbase, check that it's matured
1090 if (txPrev.IsCoinBase())
1091 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1092 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1093 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1095 // Check for conflicts (double-spend)
1096 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1097 // for an attacker to attempt to split the network.
1098 if (!txindex.vSpent[prevout.n].IsNull())
1099 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());
1101 // Check for negative or overflow input values
1102 nValueIn += txPrev.vout[prevout.n].nValue;
1103 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1104 return DoS(100, error("ConnectInputs() : txin values out of range"));
1106 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1107 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1108 // still computed and checked, and any change will be caught at the next checkpoint.
1109 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1112 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1113 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1116 // Mark outpoints as spent
1117 txindex.vSpent[prevout.n] = posThisTx;
1120 if (fBlock || fMiner)
1122 mapTestPool[prevout.hash] = txindex;
1126 if (nValueIn < GetValueOut())
1127 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1129 // Tally transaction fees
1130 int64 nTxFee = nValueIn - GetValueOut();
1132 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1134 if (!MoneyRange(nFees))
1135 return DoS(100, error("ConnectInputs() : nFees out of range"));
1142 bool CTransaction::ClientConnectInputs()
1147 // Take over previous transactions' spent pointers
1148 CRITICAL_BLOCK(cs_mapTransactions)
1151 for (int i = 0; i < vin.size(); i++)
1153 // Get prev tx from single transactions in memory
1154 COutPoint prevout = vin[i].prevout;
1155 if (!mapTransactions.count(prevout.hash))
1157 CTransaction& txPrev = mapTransactions[prevout.hash];
1159 if (prevout.n >= txPrev.vout.size())
1163 if (!VerifySignature(txPrev, *this, i, true, 0))
1164 return error("ConnectInputs() : VerifySignature failed");
1166 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1167 ///// this has to go away now that posNext is gone
1168 // // Check for conflicts
1169 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1170 // return error("ConnectInputs() : prev tx already used");
1172 // // Flag outpoints as used
1173 // txPrev.vout[prevout.n].posNext = posThisTx;
1175 nValueIn += txPrev.vout[prevout.n].nValue;
1177 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1178 return error("ClientConnectInputs() : txin values out of range");
1180 if (GetValueOut() > nValueIn)
1190 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1192 // Disconnect in reverse order
1193 for (int i = vtx.size()-1; i >= 0; i--)
1194 if (!vtx[i].DisconnectInputs(txdb))
1197 // Update block index on disk without changing it in memory.
1198 // The memory index structure will be changed after the db commits.
1201 CDiskBlockIndex blockindexPrev(pindex->pprev);
1202 blockindexPrev.hashNext = 0;
1203 if (!txdb.WriteBlockIndex(blockindexPrev))
1204 return error("DisconnectBlock() : WriteBlockIndex failed");
1210 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1212 // Check it again in case a previous version let a bad block in
1216 // To avoid being on the short end of a block-chain split,
1217 // don't do secondary validation of pay-to-script-hash transactions
1218 // until blocks with timestamps after paytoscripthashtime (see init.cpp for default).
1219 // This code can be removed once a super-majority of the network has upgraded.
1220 int64 nEvalSwitchTime = GetArg("-paytoscripthashtime", std::numeric_limits<int64_t>::max());
1221 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1223 //// issue here: it doesn't know the version
1224 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1226 map<uint256, CTxIndex> mapQueuedChanges;
1229 BOOST_FOREACH(CTransaction& tx, vtx)
1231 nSigOps += tx.GetLegacySigOpCount();
1232 if (nSigOps > MAX_BLOCK_SIGOPS)
1233 return DoS(100, error("ConnectBlock() : too many sigops"));
1235 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1236 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1238 MapPrevTx mapInputs;
1239 if (!tx.IsCoinBase())
1242 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1245 if (fStrictPayToScriptHash)
1247 // Add in sigops done by pay-to-script-hash inputs;
1248 // this is to prevent a "rogue miner" from creating
1249 // an incredibly-expensive-to-validate block.
1250 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1251 if (nSigOps > MAX_BLOCK_SIGOPS)
1252 return DoS(100, error("ConnectBlock() : too many sigops"));
1255 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1257 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1261 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1264 // Write queued txindex changes
1265 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1267 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1268 return error("ConnectBlock() : UpdateTxIndex failed");
1271 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1274 // Update block index on disk without changing it in memory.
1275 // The memory index structure will be changed after the db commits.
1278 CDiskBlockIndex blockindexPrev(pindex->pprev);
1279 blockindexPrev.hashNext = pindex->GetBlockHash();
1280 if (!txdb.WriteBlockIndex(blockindexPrev))
1281 return error("ConnectBlock() : WriteBlockIndex failed");
1284 // Watch for transactions paying to me
1285 BOOST_FOREACH(CTransaction& tx, vtx)
1286 SyncWithWallets(tx, this, true);
1291 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1293 printf("REORGANIZE\n");
1296 CBlockIndex* pfork = pindexBest;
1297 CBlockIndex* plonger = pindexNew;
1298 while (pfork != plonger)
1300 while (plonger->nHeight > pfork->nHeight)
1301 if (!(plonger = plonger->pprev))
1302 return error("Reorganize() : plonger->pprev is null");
1303 if (pfork == plonger)
1305 if (!(pfork = pfork->pprev))
1306 return error("Reorganize() : pfork->pprev is null");
1309 // List of what to disconnect
1310 vector<CBlockIndex*> vDisconnect;
1311 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1312 vDisconnect.push_back(pindex);
1314 // List of what to connect
1315 vector<CBlockIndex*> vConnect;
1316 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1317 vConnect.push_back(pindex);
1318 reverse(vConnect.begin(), vConnect.end());
1320 // Disconnect shorter branch
1321 vector<CTransaction> vResurrect;
1322 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1325 if (!block.ReadFromDisk(pindex))
1326 return error("Reorganize() : ReadFromDisk for disconnect failed");
1327 if (!block.DisconnectBlock(txdb, pindex))
1328 return error("Reorganize() : DisconnectBlock failed");
1330 // Queue memory transactions to resurrect
1331 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1332 if (!tx.IsCoinBase())
1333 vResurrect.push_back(tx);
1336 // Connect longer branch
1337 vector<CTransaction> vDelete;
1338 for (int i = 0; i < vConnect.size(); i++)
1340 CBlockIndex* pindex = vConnect[i];
1342 if (!block.ReadFromDisk(pindex))
1343 return error("Reorganize() : ReadFromDisk for connect failed");
1344 if (!block.ConnectBlock(txdb, pindex))
1348 return error("Reorganize() : ConnectBlock failed");
1351 // Queue memory transactions to delete
1352 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1353 vDelete.push_back(tx);
1355 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1356 return error("Reorganize() : WriteHashBestChain failed");
1358 // Make sure it's successfully written to disk before changing memory structure
1359 if (!txdb.TxnCommit())
1360 return error("Reorganize() : TxnCommit failed");
1362 // Disconnect shorter branch
1363 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1365 pindex->pprev->pnext = NULL;
1367 // Connect longer branch
1368 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1370 pindex->pprev->pnext = pindex;
1372 // Resurrect memory transactions that were in the disconnected branch
1373 BOOST_FOREACH(CTransaction& tx, vResurrect)
1374 tx.AcceptToMemoryPool(txdb, false);
1376 // Delete redundant memory transactions that are in the connected branch
1377 BOOST_FOREACH(CTransaction& tx, vDelete)
1378 tx.RemoveFromMemoryPool();
1385 runCommand(std::string strCommand)
1387 int nErr = ::system(strCommand.c_str());
1389 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1392 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1394 uint256 hash = GetHash();
1397 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1399 txdb.WriteHashBestChain(hash);
1400 if (!txdb.TxnCommit())
1401 return error("SetBestChain() : TxnCommit failed");
1402 pindexGenesisBlock = pindexNew;
1404 else if (hashPrevBlock == hashBestChain)
1406 // Adding to current best branch
1407 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1410 InvalidChainFound(pindexNew);
1411 return error("SetBestChain() : ConnectBlock failed");
1413 if (!txdb.TxnCommit())
1414 return error("SetBestChain() : TxnCommit failed");
1416 // Add to current best branch
1417 pindexNew->pprev->pnext = pindexNew;
1419 // Delete redundant memory transactions
1420 BOOST_FOREACH(CTransaction& tx, vtx)
1421 tx.RemoveFromMemoryPool();
1426 if (!Reorganize(txdb, pindexNew))
1429 InvalidChainFound(pindexNew);
1430 return error("SetBestChain() : Reorganize failed");
1434 // Update best block in wallet (so we can detect restored wallets)
1435 bool fIsInitialDownload = IsInitialBlockDownload();
1436 if (!fIsInitialDownload)
1438 const CBlockLocator locator(pindexNew);
1439 ::SetBestChain(locator);
1443 hashBestChain = hash;
1444 pindexBest = pindexNew;
1445 nBestHeight = pindexBest->nHeight;
1446 bnBestChainWork = pindexNew->bnChainWork;
1447 nTimeBestReceived = GetTime();
1448 nTransactionsUpdated++;
1449 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1451 std::string strCmd = GetArg("-blocknotify", "");
1453 if (!fIsInitialDownload && !strCmd.empty())
1455 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1456 boost::thread t(runCommand, strCmd); // thread runs free
1463 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1465 // Check for duplicate
1466 uint256 hash = GetHash();
1467 if (mapBlockIndex.count(hash))
1468 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1470 // Construct new block index object
1471 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1473 return error("AddToBlockIndex() : new CBlockIndex failed");
1474 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1475 pindexNew->phashBlock = &((*mi).first);
1476 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1477 if (miPrev != mapBlockIndex.end())
1479 pindexNew->pprev = (*miPrev).second;
1480 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1482 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1486 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1487 if (!txdb.TxnCommit())
1491 if (pindexNew->bnChainWork > bnBestChainWork)
1492 if (!SetBestChain(txdb, pindexNew))
1497 if (pindexNew == pindexBest)
1499 // Notify UI to display prev block's coinbase if it was ours
1500 static uint256 hashPrevBestCoinBase;
1501 UpdatedTransaction(hashPrevBestCoinBase);
1502 hashPrevBestCoinBase = vtx[0].GetHash();
1512 bool CBlock::CheckBlock() const
1514 // These are checks that are independent of context
1515 // that can be verified before saving an orphan block.
1518 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1519 return DoS(100, error("CheckBlock() : size limits failed"));
1521 // Check proof of work matches claimed amount
1522 if (!CheckProofOfWork(GetHash(), nBits))
1523 return DoS(50, error("CheckBlock() : proof of work failed"));
1526 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1527 return error("CheckBlock() : block timestamp too far in the future");
1529 // First transaction must be coinbase, the rest must not be
1530 if (vtx.empty() || !vtx[0].IsCoinBase())
1531 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1532 for (int i = 1; i < vtx.size(); i++)
1533 if (vtx[i].IsCoinBase())
1534 return DoS(100, error("CheckBlock() : more than one coinbase"));
1536 // Check transactions
1537 BOOST_FOREACH(const CTransaction& tx, vtx)
1538 if (!tx.CheckTransaction())
1539 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1542 BOOST_FOREACH(const CTransaction& tx, vtx)
1544 nSigOps += tx.GetLegacySigOpCount();
1546 if (nSigOps > MAX_BLOCK_SIGOPS)
1547 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1550 if (hashMerkleRoot != BuildMerkleTree())
1551 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1556 bool CBlock::AcceptBlock()
1558 // Check for duplicate
1559 uint256 hash = GetHash();
1560 if (mapBlockIndex.count(hash))
1561 return error("AcceptBlock() : block already in mapBlockIndex");
1563 // Get prev block index
1564 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1565 if (mi == mapBlockIndex.end())
1566 return DoS(10, error("AcceptBlock() : prev block not found"));
1567 CBlockIndex* pindexPrev = (*mi).second;
1568 int nHeight = pindexPrev->nHeight+1;
1570 // Check proof of work
1571 if (nBits != GetNextWorkRequired(pindexPrev, this))
1572 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1574 // Check timestamp against prev
1575 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1576 return error("AcceptBlock() : block's timestamp is too early");
1578 // Check that all transactions are finalized
1579 BOOST_FOREACH(const CTransaction& tx, vtx)
1580 if (!tx.IsFinal(nHeight, GetBlockTime()))
1581 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1583 // Check that the block chain matches the known block chain up to a checkpoint
1584 if (!Checkpoints::CheckBlock(nHeight, hash))
1585 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1587 // Write block to history file
1588 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1589 return error("AcceptBlock() : out of disk space");
1590 unsigned int nFile = -1;
1591 unsigned int nBlockPos = 0;
1592 if (!WriteToDisk(nFile, nBlockPos))
1593 return error("AcceptBlock() : WriteToDisk failed");
1594 if (!AddToBlockIndex(nFile, nBlockPos))
1595 return error("AcceptBlock() : AddToBlockIndex failed");
1597 // Relay inventory, but don't relay old inventory during initial block download
1598 if (hashBestChain == hash)
1599 CRITICAL_BLOCK(cs_vNodes)
1600 BOOST_FOREACH(CNode* pnode, vNodes)
1601 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1602 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1607 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1609 // Check for duplicate
1610 uint256 hash = pblock->GetHash();
1611 if (mapBlockIndex.count(hash))
1612 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1613 if (mapOrphanBlocks.count(hash))
1614 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1616 // Preliminary checks
1617 if (!pblock->CheckBlock())
1618 return error("ProcessBlock() : CheckBlock FAILED");
1620 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1621 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1623 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1624 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1627 pfrom->Misbehaving(100);
1628 return error("ProcessBlock() : block with timestamp before last checkpoint");
1631 bnNewBlock.SetCompact(pblock->nBits);
1633 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1634 if (bnNewBlock > bnRequired)
1636 pfrom->Misbehaving(100);
1637 return error("ProcessBlock() : block with too little proof-of-work");
1642 // If don't already have its previous block, shunt it off to holding area until we get it
1643 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1645 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1646 CBlock* pblock2 = new CBlock(*pblock);
1647 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1648 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1650 // Ask this guy to fill in what we're missing
1652 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1657 if (!pblock->AcceptBlock())
1658 return error("ProcessBlock() : AcceptBlock FAILED");
1660 // Recursively process any orphan blocks that depended on this one
1661 vector<uint256> vWorkQueue;
1662 vWorkQueue.push_back(hash);
1663 for (int i = 0; i < vWorkQueue.size(); i++)
1665 uint256 hashPrev = vWorkQueue[i];
1666 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1667 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1670 CBlock* pblockOrphan = (*mi).second;
1671 if (pblockOrphan->AcceptBlock())
1672 vWorkQueue.push_back(pblockOrphan->GetHash());
1673 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1674 delete pblockOrphan;
1676 mapOrphanBlocksByPrev.erase(hashPrev);
1679 printf("ProcessBlock: ACCEPTED\n");
1690 bool CheckDiskSpace(uint64 nAdditionalBytes)
1692 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1694 // Check for 15MB because database could create another 10MB log file at any time
1695 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1698 string strMessage = _("Warning: Disk space is low ");
1699 strMiscWarning = strMessage;
1700 printf("*** %s\n", strMessage.c_str());
1701 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1702 CreateThread(Shutdown, NULL);
1708 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1712 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1715 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1717 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1726 static unsigned int nCurrentBlockFile = 1;
1728 FILE* AppendBlockFile(unsigned int& nFileRet)
1733 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1736 if (fseek(file, 0, SEEK_END) != 0)
1738 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1739 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1741 nFileRet = nCurrentBlockFile;
1745 nCurrentBlockFile++;
1749 bool LoadBlockIndex(bool fAllowNew)
1753 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1754 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1755 pchMessageStart[0] = 0xfa;
1756 pchMessageStart[1] = 0xbf;
1757 pchMessageStart[2] = 0xb5;
1758 pchMessageStart[3] = 0xda;
1765 if (!txdb.LoadBlockIndex())
1770 // Init with genesis block
1772 if (mapBlockIndex.empty())
1778 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1779 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1780 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1781 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1782 // vMerkleTree: 4a5e1e
1785 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1787 txNew.vin.resize(1);
1788 txNew.vout.resize(1);
1789 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1790 txNew.vout[0].nValue = 50 * COIN;
1791 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1793 block.vtx.push_back(txNew);
1794 block.hashPrevBlock = 0;
1795 block.hashMerkleRoot = block.BuildMerkleTree();
1797 block.nTime = 1231006505;
1798 block.nBits = 0x1d00ffff;
1799 block.nNonce = 2083236893;
1803 block.nTime = 1296688602;
1804 block.nBits = 0x1d07fff8;
1805 block.nNonce = 384568319;
1809 printf("%s\n", block.GetHash().ToString().c_str());
1810 printf("%s\n", hashGenesisBlock.ToString().c_str());
1811 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1812 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1814 assert(block.GetHash() == hashGenesisBlock);
1816 // Start new block file
1818 unsigned int nBlockPos;
1819 if (!block.WriteToDisk(nFile, nBlockPos))
1820 return error("LoadBlockIndex() : writing genesis block to disk failed");
1821 if (!block.AddToBlockIndex(nFile, nBlockPos))
1822 return error("LoadBlockIndex() : genesis block not accepted");
1830 void PrintBlockTree()
1832 // precompute tree structure
1833 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1834 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1836 CBlockIndex* pindex = (*mi).second;
1837 mapNext[pindex->pprev].push_back(pindex);
1839 //while (rand() % 3 == 0)
1840 // mapNext[pindex->pprev].push_back(pindex);
1843 vector<pair<int, CBlockIndex*> > vStack;
1844 vStack.push_back(make_pair(0, pindexGenesisBlock));
1847 while (!vStack.empty())
1849 int nCol = vStack.back().first;
1850 CBlockIndex* pindex = vStack.back().second;
1853 // print split or gap
1854 if (nCol > nPrevCol)
1856 for (int i = 0; i < nCol-1; i++)
1860 else if (nCol < nPrevCol)
1862 for (int i = 0; i < nCol; i++)
1869 for (int i = 0; i < nCol; i++)
1874 block.ReadFromDisk(pindex);
1875 printf("%d (%u,%u) %s %s tx %d",
1879 block.GetHash().ToString().substr(0,20).c_str(),
1880 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1883 PrintWallets(block);
1885 // put the main timechain first
1886 vector<CBlockIndex*>& vNext = mapNext[pindex];
1887 for (int i = 0; i < vNext.size(); i++)
1889 if (vNext[i]->pnext)
1891 swap(vNext[0], vNext[i]);
1897 for (int i = 0; i < vNext.size(); i++)
1898 vStack.push_back(make_pair(nCol+i, vNext[i]));
1911 //////////////////////////////////////////////////////////////////////////////
1916 map<uint256, CAlert> mapAlerts;
1917 CCriticalSection cs_mapAlerts;
1919 string GetWarnings(string strFor)
1922 string strStatusBar;
1924 if (GetBoolArg("-testsafemode"))
1927 // Misc warnings like out of disk space and clock is wrong
1928 if (strMiscWarning != "")
1931 strStatusBar = strMiscWarning;
1934 // Longer invalid proof-of-work chain
1935 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1938 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1942 CRITICAL_BLOCK(cs_mapAlerts)
1944 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1946 const CAlert& alert = item.second;
1947 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1949 nPriority = alert.nPriority;
1950 strStatusBar = alert.strStatusBar;
1955 if (strFor == "statusbar")
1956 return strStatusBar;
1957 else if (strFor == "rpc")
1959 assert(!"GetWarnings() : invalid parameter");
1963 bool CAlert::ProcessAlert()
1965 if (!CheckSignature())
1970 CRITICAL_BLOCK(cs_mapAlerts)
1972 // Cancel previous alerts
1973 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1975 const CAlert& alert = (*mi).second;
1978 printf("cancelling alert %d\n", alert.nID);
1979 mapAlerts.erase(mi++);
1981 else if (!alert.IsInEffect())
1983 printf("expiring alert %d\n", alert.nID);
1984 mapAlerts.erase(mi++);
1990 // Check if this alert has been cancelled
1991 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1993 const CAlert& alert = item.second;
1994 if (alert.Cancels(*this))
1996 printf("alert already cancelled by %d\n", alert.nID);
2002 mapAlerts.insert(make_pair(GetHash(), *this));
2005 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2017 //////////////////////////////////////////////////////////////////////////////
2023 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2027 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2028 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2030 // Don't know what it is, just say we already got one
2037 // The message start string is designed to be unlikely to occur in normal data.
2038 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2039 // a large 4-byte int at any alignment.
2040 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2043 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2045 static map<CService, vector<unsigned char> > mapReuseKey;
2046 RandAddSeedPerfmon();
2048 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2049 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2051 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2053 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2061 if (strCommand == "version")
2063 // Each connection can only send one version message
2064 if (pfrom->nVersion != 0)
2066 pfrom->Misbehaving(1);
2074 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2075 if (pfrom->nVersion == 10300)
2076 pfrom->nVersion = 300;
2077 if (pfrom->nVersion >= 106 && !vRecv.empty())
2078 vRecv >> addrFrom >> nNonce;
2079 if (pfrom->nVersion >= 106 && !vRecv.empty())
2080 vRecv >> pfrom->strSubVer;
2081 if (pfrom->nVersion >= 209 && !vRecv.empty())
2082 vRecv >> pfrom->nStartingHeight;
2084 if (pfrom->nVersion == 0)
2087 // Disconnect if we connected to ourself
2088 if (nNonce == nLocalHostNonce && nNonce > 1)
2090 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2091 pfrom->fDisconnect = true;
2095 // Be shy and don't send version until we hear
2096 if (pfrom->fInbound)
2097 pfrom->PushVersion();
2099 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2101 AddTimeData(pfrom->addr, nTime);
2104 if (pfrom->nVersion >= 209)
2105 pfrom->PushMessage("verack");
2106 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2107 if (pfrom->nVersion < 209)
2108 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2110 if (!pfrom->fInbound)
2112 // Advertise our address
2113 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2114 !IsInitialBlockDownload())
2116 CAddress addr(addrLocalHost);
2117 addr.nTime = GetAdjustedTime();
2118 pfrom->PushAddress(addr);
2121 // Get recent addresses
2122 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2124 pfrom->PushMessage("getaddr");
2125 pfrom->fGetAddr = true;
2129 // Ask the first connected node for block updates
2130 static int nAskedForBlocks = 0;
2131 if (!pfrom->fClient &&
2132 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2133 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2136 pfrom->PushGetBlocks(pindexBest, uint256(0));
2140 CRITICAL_BLOCK(cs_mapAlerts)
2141 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2142 item.second.RelayTo(pfrom);
2144 pfrom->fSuccessfullyConnected = true;
2146 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2148 cPeerBlockCounts.input(pfrom->nStartingHeight);
2152 else if (pfrom->nVersion == 0)
2154 // Must have a version message before anything else
2155 pfrom->Misbehaving(1);
2160 else if (strCommand == "verack")
2162 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2166 else if (strCommand == "addr")
2168 vector<CAddress> vAddr;
2171 // Don't want addr from older versions unless seeding
2172 if (pfrom->nVersion < 209)
2174 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2176 if (vAddr.size() > 1000)
2178 pfrom->Misbehaving(20);
2179 return error("message addr size() = %d", vAddr.size());
2182 // Store the new addresses
2185 int64 nNow = GetAdjustedTime();
2186 int64 nSince = nNow - 10 * 60;
2187 BOOST_FOREACH(CAddress& addr, vAddr)
2191 // ignore IPv6 for now, since it isn't implemented anyway
2194 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2195 addr.nTime = nNow - 5 * 24 * 60 * 60;
2196 AddAddress(addr, 2 * 60 * 60, &addrDB);
2197 pfrom->AddAddressKnown(addr);
2198 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2200 // Relay to a limited number of other nodes
2201 CRITICAL_BLOCK(cs_vNodes)
2203 // Use deterministic randomness to send to the same nodes for 24 hours
2204 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2205 static uint256 hashSalt;
2207 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2208 int64 hashAddr = addr.GetHash();
2209 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2210 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2211 multimap<uint256, CNode*> mapMix;
2212 BOOST_FOREACH(CNode* pnode, vNodes)
2214 if (pnode->nVersion < 31402)
2216 unsigned int nPointer;
2217 memcpy(&nPointer, &pnode, sizeof(nPointer));
2218 uint256 hashKey = hashRand ^ nPointer;
2219 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2220 mapMix.insert(make_pair(hashKey, pnode));
2222 int nRelayNodes = 2;
2223 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2224 ((*mi).second)->PushAddress(addr);
2228 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2229 if (vAddr.size() < 1000)
2230 pfrom->fGetAddr = false;
2234 else if (strCommand == "inv")
2238 if (vInv.size() > 50000)
2240 pfrom->Misbehaving(20);
2241 return error("message inv size() = %d", vInv.size());
2245 BOOST_FOREACH(const CInv& inv, vInv)
2249 pfrom->AddInventoryKnown(inv);
2251 bool fAlreadyHave = AlreadyHave(txdb, inv);
2253 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2257 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2258 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2260 // Track requests for our stuff
2261 Inventory(inv.hash);
2266 else if (strCommand == "getdata")
2270 if (vInv.size() > 50000)
2272 pfrom->Misbehaving(20);
2273 return error("message getdata size() = %d", vInv.size());
2276 BOOST_FOREACH(const CInv& inv, vInv)
2280 printf("received getdata for: %s\n", inv.ToString().c_str());
2282 if (inv.type == MSG_BLOCK)
2284 // Send block from disk
2285 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2286 if (mi != mapBlockIndex.end())
2289 block.ReadFromDisk((*mi).second);
2290 pfrom->PushMessage("block", block);
2292 // Trigger them to send a getblocks request for the next batch of inventory
2293 if (inv.hash == pfrom->hashContinue)
2295 // Bypass PushInventory, this must send even if redundant,
2296 // and we want it right after the last block so they don't
2297 // wait for other stuff first.
2299 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2300 pfrom->PushMessage("inv", vInv);
2301 pfrom->hashContinue = 0;
2305 else if (inv.IsKnownType())
2307 // Send stream from relay memory
2308 CRITICAL_BLOCK(cs_mapRelay)
2310 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2311 if (mi != mapRelay.end())
2312 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2316 // Track requests for our stuff
2317 Inventory(inv.hash);
2322 else if (strCommand == "getblocks")
2324 CBlockLocator locator;
2326 vRecv >> locator >> hashStop;
2328 // Find the last block the caller has in the main chain
2329 CBlockIndex* pindex = locator.GetBlockIndex();
2331 // Send the rest of the chain
2333 pindex = pindex->pnext;
2334 int nLimit = 500 + locator.GetDistanceBack();
2335 unsigned int nBytes = 0;
2336 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2337 for (; pindex; pindex = pindex->pnext)
2339 if (pindex->GetBlockHash() == hashStop)
2341 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2344 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2346 block.ReadFromDisk(pindex, true);
2347 nBytes += block.GetSerializeSize(SER_NETWORK);
2348 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2350 // When this block is requested, we'll send an inv that'll make them
2351 // getblocks the next batch of inventory.
2352 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2353 pfrom->hashContinue = pindex->GetBlockHash();
2360 else if (strCommand == "getheaders")
2362 CBlockLocator locator;
2364 vRecv >> locator >> hashStop;
2366 CBlockIndex* pindex = NULL;
2367 if (locator.IsNull())
2369 // If locator is null, return the hashStop block
2370 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2371 if (mi == mapBlockIndex.end())
2373 pindex = (*mi).second;
2377 // Find the last block the caller has in the main chain
2378 pindex = locator.GetBlockIndex();
2380 pindex = pindex->pnext;
2383 vector<CBlock> vHeaders;
2384 int nLimit = 2000 + locator.GetDistanceBack();
2385 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2386 for (; pindex; pindex = pindex->pnext)
2388 vHeaders.push_back(pindex->GetBlockHeader());
2389 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2392 pfrom->PushMessage("headers", vHeaders);
2396 else if (strCommand == "tx")
2398 vector<uint256> vWorkQueue;
2399 CDataStream vMsg(vRecv);
2403 CInv inv(MSG_TX, tx.GetHash());
2404 pfrom->AddInventoryKnown(inv);
2406 bool fMissingInputs = false;
2407 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2409 SyncWithWallets(tx, NULL, true);
2410 RelayMessage(inv, vMsg);
2411 mapAlreadyAskedFor.erase(inv);
2412 vWorkQueue.push_back(inv.hash);
2414 // Recursively process any orphan transactions that depended on this one
2415 for (int i = 0; i < vWorkQueue.size(); i++)
2417 uint256 hashPrev = vWorkQueue[i];
2418 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2419 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2422 const CDataStream& vMsg = *((*mi).second);
2424 CDataStream(vMsg) >> tx;
2425 CInv inv(MSG_TX, tx.GetHash());
2427 if (tx.AcceptToMemoryPool(true))
2429 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2430 SyncWithWallets(tx, NULL, true);
2431 RelayMessage(inv, vMsg);
2432 mapAlreadyAskedFor.erase(inv);
2433 vWorkQueue.push_back(inv.hash);
2438 BOOST_FOREACH(uint256 hash, vWorkQueue)
2439 EraseOrphanTx(hash);
2441 else if (fMissingInputs)
2443 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2446 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2450 else if (strCommand == "block")
2455 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2458 CInv inv(MSG_BLOCK, block.GetHash());
2459 pfrom->AddInventoryKnown(inv);
2461 if (ProcessBlock(pfrom, &block))
2462 mapAlreadyAskedFor.erase(inv);
2463 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2467 else if (strCommand == "getaddr")
2469 // Nodes rebroadcast an addr every 24 hours
2470 pfrom->vAddrToSend.clear();
2471 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2472 CRITICAL_BLOCK(cs_mapAddresses)
2474 unsigned int nCount = 0;
2475 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2477 const CAddress& addr = item.second;
2478 if (addr.nTime > nSince)
2481 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2483 const CAddress& addr = item.second;
2484 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2485 pfrom->PushAddress(addr);
2491 else if (strCommand == "checkorder")
2496 if (!GetBoolArg("-allowreceivebyip"))
2498 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2505 /// we have a chance to check the order here
2507 // Keep giving the same key to the same ip until they use it
2508 if (!mapReuseKey.count(pfrom->addr))
2509 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
2511 // Send back approval of order and pubkey to use
2512 CScript scriptPubKey;
2513 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
2514 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2518 else if (strCommand == "reply")
2523 CRequestTracker tracker;
2524 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2526 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2527 if (mi != pfrom->mapRequests.end())
2529 tracker = (*mi).second;
2530 pfrom->mapRequests.erase(mi);
2533 if (!tracker.IsNull())
2534 tracker.fn(tracker.param1, vRecv);
2538 else if (strCommand == "ping")
2543 else if (strCommand == "alert")
2548 if (alert.ProcessAlert())
2551 pfrom->setKnown.insert(alert.GetHash());
2552 CRITICAL_BLOCK(cs_vNodes)
2553 BOOST_FOREACH(CNode* pnode, vNodes)
2554 alert.RelayTo(pnode);
2561 // Ignore unknown commands for extensibility
2565 // Update the last seen time for this node's address
2566 if (pfrom->fNetworkNode)
2567 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2568 AddressCurrentlyConnected(pfrom->addr);
2574 bool ProcessMessages(CNode* pfrom)
2576 CDataStream& vRecv = pfrom->vRecv;
2580 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2584 // (4) message start
2593 // Scan for message start
2594 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2595 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2596 if (vRecv.end() - pstart < nHeaderSize)
2598 if (vRecv.size() > nHeaderSize)
2600 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2601 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2605 if (pstart - vRecv.begin() > 0)
2606 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2607 vRecv.erase(vRecv.begin(), pstart);
2610 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2615 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2618 string strCommand = hdr.GetCommand();
2621 unsigned int nMessageSize = hdr.nMessageSize;
2622 if (nMessageSize > MAX_SIZE)
2624 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2627 if (nMessageSize > vRecv.size())
2629 // Rewind and wait for rest of message
2630 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2635 if (vRecv.GetVersion() >= 209)
2637 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2638 unsigned int nChecksum = 0;
2639 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2640 if (nChecksum != hdr.nChecksum)
2642 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2643 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2648 // Copy message to its own buffer
2649 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2650 vRecv.ignore(nMessageSize);
2656 CRITICAL_BLOCK(cs_main)
2657 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2661 catch (std::ios_base::failure& e)
2663 if (strstr(e.what(), "end of data"))
2665 // Allow exceptions from underlength message on vRecv
2666 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());
2668 else if (strstr(e.what(), "size too large"))
2670 // Allow exceptions from overlong size
2671 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2675 PrintExceptionContinue(&e, "ProcessMessage()");
2678 catch (std::exception& e) {
2679 PrintExceptionContinue(&e, "ProcessMessage()");
2681 PrintExceptionContinue(NULL, "ProcessMessage()");
2685 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2693 bool SendMessages(CNode* pto, bool fSendTrickle)
2695 CRITICAL_BLOCK(cs_main)
2697 // Don't send anything until we get their version message
2698 if (pto->nVersion == 0)
2702 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2703 pto->PushMessage("ping");
2705 // Resend wallet transactions that haven't gotten in a block yet
2706 ResendWalletTransactions();
2708 // Address refresh broadcast
2709 static int64 nLastRebroadcast;
2710 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
2712 CRITICAL_BLOCK(cs_vNodes)
2714 BOOST_FOREACH(CNode* pnode, vNodes)
2716 // Periodically clear setAddrKnown to allow refresh broadcasts
2717 if (nLastRebroadcast)
2718 pnode->setAddrKnown.clear();
2720 // Rebroadcast our address
2721 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
2723 CAddress addr(addrLocalHost);
2724 addr.nTime = GetAdjustedTime();
2725 pnode->PushAddress(addr);
2729 nLastRebroadcast = GetTime();
2732 // Clear out old addresses periodically so it's not too much work at once
2733 static int64 nLastClear;
2734 if (nLastClear == 0)
2735 nLastClear = GetTime();
2736 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2738 nLastClear = GetTime();
2739 CRITICAL_BLOCK(cs_mapAddresses)
2742 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2743 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2744 mi != mapAddresses.end();)
2746 const CAddress& addr = (*mi).second;
2747 if (addr.nTime < nSince)
2749 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2751 addrdb.EraseAddress(addr);
2752 mapAddresses.erase(mi++);
2766 vector<CAddress> vAddr;
2767 vAddr.reserve(pto->vAddrToSend.size());
2768 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2770 // returns true if wasn't already contained in the set
2771 if (pto->setAddrKnown.insert(addr).second)
2773 vAddr.push_back(addr);
2774 // receiver rejects addr messages larger than 1000
2775 if (vAddr.size() >= 1000)
2777 pto->PushMessage("addr", vAddr);
2782 pto->vAddrToSend.clear();
2784 pto->PushMessage("addr", vAddr);
2789 // Message: inventory
2792 vector<CInv> vInvWait;
2793 CRITICAL_BLOCK(pto->cs_inventory)
2795 vInv.reserve(pto->vInventoryToSend.size());
2796 vInvWait.reserve(pto->vInventoryToSend.size());
2797 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2799 if (pto->setInventoryKnown.count(inv))
2802 // trickle out tx inv to protect privacy
2803 if (inv.type == MSG_TX && !fSendTrickle)
2805 // 1/4 of tx invs blast to all immediately
2806 static uint256 hashSalt;
2808 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2809 uint256 hashRand = inv.hash ^ hashSalt;
2810 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2811 bool fTrickleWait = ((hashRand & 3) != 0);
2813 // always trickle our own transactions
2817 if (GetTransaction(inv.hash, wtx))
2819 fTrickleWait = true;
2824 vInvWait.push_back(inv);
2829 // returns true if wasn't already contained in the set
2830 if (pto->setInventoryKnown.insert(inv).second)
2832 vInv.push_back(inv);
2833 if (vInv.size() >= 1000)
2835 pto->PushMessage("inv", vInv);
2840 pto->vInventoryToSend = vInvWait;
2843 pto->PushMessage("inv", vInv);
2849 vector<CInv> vGetData;
2850 int64 nNow = GetTime() * 1000000;
2852 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2854 const CInv& inv = (*pto->mapAskFor.begin()).second;
2855 if (!AlreadyHave(txdb, inv))
2857 printf("sending getdata: %s\n", inv.ToString().c_str());
2858 vGetData.push_back(inv);
2859 if (vGetData.size() >= 1000)
2861 pto->PushMessage("getdata", vGetData);
2865 mapAlreadyAskedFor[inv] = nNow;
2866 pto->mapAskFor.erase(pto->mapAskFor.begin());
2868 if (!vGetData.empty())
2869 pto->PushMessage("getdata", vGetData);
2888 //////////////////////////////////////////////////////////////////////////////
2893 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2895 unsigned char* pdata = (unsigned char*)pbuffer;
2896 unsigned int blocks = 1 + ((len + 8) / 64);
2897 unsigned char* pend = pdata + 64 * blocks;
2898 memset(pdata + len, 0, 64 * blocks - len);
2900 unsigned int bits = len * 8;
2901 pend[-1] = (bits >> 0) & 0xff;
2902 pend[-2] = (bits >> 8) & 0xff;
2903 pend[-3] = (bits >> 16) & 0xff;
2904 pend[-4] = (bits >> 24) & 0xff;
2908 static const unsigned int pSHA256InitState[8] =
2909 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2911 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2914 unsigned char data[64];
2918 for (int i = 0; i < 16; i++)
2919 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2921 for (int i = 0; i < 8; i++)
2922 ctx.h[i] = ((uint32_t*)pinit)[i];
2924 SHA256_Update(&ctx, data, sizeof(data));
2925 for (int i = 0; i < 8; i++)
2926 ((uint32_t*)pstate)[i] = ctx.h[i];
2930 // ScanHash scans nonces looking for a hash with at least some zero bits.
2931 // It operates on big endian data. Caller does the byte reversing.
2932 // All input buffers are 16-byte aligned. nNonce is usually preserved
2933 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2934 // the block is rebuilt and nNonce starts over at zero.
2936 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2938 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2942 // Hash pdata using pmidstate as the starting state into
2943 // preformatted buffer phash1, then hash phash1 into phash
2945 SHA256Transform(phash1, pdata, pmidstate);
2946 SHA256Transform(phash, phash1, pSHA256InitState);
2948 // Return the nonce if the hash has at least some zero bits,
2949 // caller will check if it has enough to reach the target
2950 if (((unsigned short*)phash)[14] == 0)
2953 // If nothing found after trying for a while, return -1
2954 if ((nNonce & 0xffff) == 0)
2956 nHashesDone = 0xffff+1;
2962 // Some explaining would be appreciated
2967 set<uint256> setDependsOn;
2970 COrphan(CTransaction* ptxIn)
2978 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2979 BOOST_FOREACH(uint256 hash, setDependsOn)
2980 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2985 uint64 nLastBlockTx = 0;
2986 uint64 nLastBlockSize = 0;
2988 CBlock* CreateNewBlock(CReserveKey& reservekey)
2990 CBlockIndex* pindexPrev = pindexBest;
2993 auto_ptr<CBlock> pblock(new CBlock());
2997 // Create coinbase tx
2999 txNew.vin.resize(1);
3000 txNew.vin[0].prevout.SetNull();
3001 txNew.vout.resize(1);
3002 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3004 // Add our coinbase tx as first transaction
3005 pblock->vtx.push_back(txNew);
3007 // Collect memory pool transactions into the block
3009 CRITICAL_BLOCK(cs_main)
3010 CRITICAL_BLOCK(cs_mapTransactions)
3014 // Priority order to process transactions
3015 list<COrphan> vOrphan; // list memory doesn't move
3016 map<uint256, vector<COrphan*> > mapDependers;
3017 multimap<double, CTransaction*> mapPriority;
3018 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3020 CTransaction& tx = (*mi).second;
3021 if (tx.IsCoinBase() || !tx.IsFinal())
3024 COrphan* porphan = NULL;
3025 double dPriority = 0;
3026 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3028 // Read prev transaction
3029 CTransaction txPrev;
3031 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3033 // Has to wait for dependencies
3036 // Use list for automatic deletion
3037 vOrphan.push_back(COrphan(&tx));
3038 porphan = &vOrphan.back();
3040 mapDependers[txin.prevout.hash].push_back(porphan);
3041 porphan->setDependsOn.insert(txin.prevout.hash);
3044 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3046 // Read block header
3047 int nConf = txindex.GetDepthInMainChain();
3049 dPriority += (double)nValueIn * nConf;
3051 if (fDebug && GetBoolArg("-printpriority"))
3052 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3055 // Priority is sum(valuein * age) / txsize
3056 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3059 porphan->dPriority = dPriority;
3061 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3063 if (fDebug && GetBoolArg("-printpriority"))
3065 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3072 // Collect transactions into block
3073 map<uint256, CTxIndex> mapTestPool;
3074 uint64 nBlockSize = 1000;
3075 uint64 nBlockTx = 0;
3076 int nBlockSigOps = 100;
3077 while (!mapPriority.empty())
3079 // Take highest priority transaction off priority queue
3080 double dPriority = -(*mapPriority.begin()).first;
3081 CTransaction& tx = *(*mapPriority.begin()).second;
3082 mapPriority.erase(mapPriority.begin());
3085 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3086 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3089 // Legacy limits on sigOps:
3090 int nTxSigOps = tx.GetLegacySigOpCount();
3091 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3094 // Transaction fee required depends on block size
3095 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3096 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, GMF_BLOCK);
3098 // Connecting shouldn't fail due to dependency on other memory pool transactions
3099 // because we're already processing them in order of dependency
3100 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3101 MapPrevTx mapInputs;
3103 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3106 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3107 if (nTxFees < nMinFee)
3110 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3111 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3114 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3116 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3117 swap(mapTestPool, mapTestPoolTmp);
3120 pblock->vtx.push_back(tx);
3121 nBlockSize += nTxSize;
3123 nBlockSigOps += nTxSigOps;
3126 // Add transactions that depend on this one to the priority queue
3127 uint256 hash = tx.GetHash();
3128 if (mapDependers.count(hash))
3130 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3132 if (!porphan->setDependsOn.empty())
3134 porphan->setDependsOn.erase(hash);
3135 if (porphan->setDependsOn.empty())
3136 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3142 nLastBlockTx = nBlockTx;
3143 nLastBlockSize = nBlockSize;
3144 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3147 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3150 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3151 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3152 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3153 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3156 return pblock.release();
3160 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3162 // Update nExtraNonce
3163 static uint256 hashPrevBlock;
3164 if (hashPrevBlock != pblock->hashPrevBlock)
3167 hashPrevBlock = pblock->hashPrevBlock;
3170 pblock->vtx[0].vin[0].scriptSig = (CScript() << pblock->nTime << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3171 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3173 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3177 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3180 // Prebuild hash buffers
3187 uint256 hashPrevBlock;
3188 uint256 hashMerkleRoot;
3191 unsigned int nNonce;
3194 unsigned char pchPadding0[64];
3196 unsigned char pchPadding1[64];
3199 memset(&tmp, 0, sizeof(tmp));
3201 tmp.block.nVersion = pblock->nVersion;
3202 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3203 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3204 tmp.block.nTime = pblock->nTime;
3205 tmp.block.nBits = pblock->nBits;
3206 tmp.block.nNonce = pblock->nNonce;
3208 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3209 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3211 // Byte swap all the input buffer
3212 for (int i = 0; i < sizeof(tmp)/4; i++)
3213 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3215 // Precalc the first half of the first hash, which stays constant
3216 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3218 memcpy(pdata, &tmp.block, 128);
3219 memcpy(phash1, &tmp.hash1, 64);
3223 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3225 uint256 hash = pblock->GetHash();
3226 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3228 if (hash > hashTarget)
3232 printf("BitcoinMiner:\n");
3233 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3235 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3236 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3239 CRITICAL_BLOCK(cs_main)
3241 if (pblock->hashPrevBlock != hashBestChain)
3242 return error("BitcoinMiner : generated block is stale");
3244 // Remove key from key pool
3245 reservekey.KeepKey();
3247 // Track how many getdata requests this block gets
3248 CRITICAL_BLOCK(wallet.cs_wallet)
3249 wallet.mapRequestCount[pblock->GetHash()] = 0;
3251 // Process this block the same as if we had received it from another node
3252 if (!ProcessBlock(NULL, pblock))
3253 return error("BitcoinMiner : ProcessBlock, block not accepted");
3259 void static ThreadBitcoinMiner(void* parg);
3261 void static BitcoinMiner(CWallet *pwallet)
3263 printf("BitcoinMiner started\n");
3264 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3266 // Each thread has its own key and counter
3267 CReserveKey reservekey(pwallet);
3268 unsigned int nExtraNonce = 0;
3270 while (fGenerateBitcoins)
3272 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3276 while (vNodes.empty() || IsInitialBlockDownload())
3281 if (!fGenerateBitcoins)
3289 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3290 CBlockIndex* pindexPrev = pindexBest;
3292 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3295 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3297 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3301 // Prebuild hash buffers
3303 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3304 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3305 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3307 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3309 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3310 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3316 int64 nStart = GetTime();
3317 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3319 uint256& hash = *alignup<16>(hashbuf);
3322 unsigned int nHashesDone = 0;
3323 unsigned int nNonceFound;
3326 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3327 (char*)&hash, nHashesDone);
3329 // Check if something found
3330 if (nNonceFound != -1)
3332 for (int i = 0; i < sizeof(hash)/4; i++)
3333 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3335 if (hash <= hashTarget)
3338 pblock->nNonce = ByteReverse(nNonceFound);
3339 assert(hash == pblock->GetHash());
3341 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3342 CheckWork(pblock.get(), *pwalletMain, reservekey);
3343 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3349 static int64 nHashCounter;
3350 if (nHPSTimerStart == 0)
3352 nHPSTimerStart = GetTimeMillis();
3356 nHashCounter += nHashesDone;
3357 if (GetTimeMillis() - nHPSTimerStart > 4000)
3359 static CCriticalSection cs;
3362 if (GetTimeMillis() - nHPSTimerStart > 4000)
3364 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3365 nHPSTimerStart = GetTimeMillis();
3367 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3368 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3369 static int64 nLogTime;
3370 if (GetTime() - nLogTime > 30 * 60)
3372 nLogTime = GetTime();
3373 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3374 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3380 // Check for stop or if block needs to be rebuilt
3383 if (!fGenerateBitcoins)
3385 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3389 if (nBlockNonce >= 0xffff0000)
3391 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3393 if (pindexPrev != pindexBest)
3396 // Update nTime every few seconds
3397 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3398 nBlockTime = ByteReverse(pblock->nTime);
3403 void static ThreadBitcoinMiner(void* parg)
3405 CWallet* pwallet = (CWallet*)parg;
3408 vnThreadsRunning[3]++;
3409 BitcoinMiner(pwallet);
3410 vnThreadsRunning[3]--;
3412 catch (std::exception& e) {
3413 vnThreadsRunning[3]--;
3414 PrintException(&e, "ThreadBitcoinMiner()");
3416 vnThreadsRunning[3]--;
3417 PrintException(NULL, "ThreadBitcoinMiner()");
3419 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3421 if (vnThreadsRunning[3] == 0)
3423 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3427 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3429 if (fGenerateBitcoins != fGenerate)
3431 fGenerateBitcoins = fGenerate;
3432 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3435 if (fGenerateBitcoins)
3437 int nProcessors = boost::thread::hardware_concurrency();
3438 printf("%d processors\n", nProcessors);
3439 if (nProcessors < 1)
3441 if (fLimitProcessors && nProcessors > nLimitProcessors)
3442 nProcessors = nLimitProcessors;
3443 int nAddThreads = nProcessors - vnThreadsRunning[3];
3444 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3445 for (int i = 0; i < nAddThreads; i++)
3447 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3448 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");