1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 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/filesystem.hpp>
11 #include <boost/filesystem/fstream.hpp>
14 using namespace boost;
20 CCriticalSection cs_setpwalletRegistered;
21 set<CWallet*> setpwalletRegistered;
23 CCriticalSection cs_main;
25 static map<uint256, CTransaction> mapTransactions;
26 CCriticalSection cs_mapTransactions;
27 unsigned int nTransactionsUpdated = 0;
28 map<COutPoint, CInPoint> mapNextTx;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 CBlockIndex* pindexGenesisBlock = NULL;
35 CBigNum bnBestChainWork = 0;
36 CBigNum bnBestInvalidWork = 0;
37 uint256 hashBestChain = 0;
38 CBlockIndex* pindexBest = NULL;
39 int64 nTimeBestReceived = 0;
41 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
54 int fGenerateBitcoins = false;
55 int64 nTransactionFee = 0;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
67 //////////////////////////////////////////////////////////////////////////////
69 // dispatching functions
72 // These functions dispatch to one or all registered wallets
75 void RegisterWallet(CWallet* pwalletIn)
77 CRITICAL_BLOCK(cs_setpwalletRegistered)
79 setpwalletRegistered.insert(pwalletIn);
83 void UnregisterWallet(CWallet* pwalletIn)
85 CRITICAL_BLOCK(cs_setpwalletRegistered)
87 setpwalletRegistered.erase(pwalletIn);
91 // check whether the passed transaction is from us
92 bool static IsFromMe(CTransaction& tx)
94 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
95 if (pwallet->IsFromMe(tx))
100 // get the wallet transaction with the given hash (if it exists)
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 // erases transaction with the given hash from all wallets
110 void static EraseFromWallets(uint256 hash)
112 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
113 pwallet->EraseFromWallet(hash);
116 // make sure all wallets know about the given transaction, in the given block
117 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
119 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
120 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
123 // notify wallets about a new best chain
124 void static SetBestChain(const CBlockLocator& loc)
126 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
127 pwallet->SetBestChain(loc);
130 // notify wallets about an updated transaction
131 void static UpdatedTransaction(const uint256& hashTx)
133 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
134 pwallet->UpdatedTransaction(hashTx);
138 void static PrintWallets(const CBlock& block)
140 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
141 pwallet->PrintWallet(block);
144 // notify wallets about an incoming inventory (for request counts)
145 void static Inventory(const uint256& hash)
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->Inventory(hash);
151 // ask wallets to resend their transactions
152 void static ResendWalletTransactions()
154 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
155 pwallet->ResendWalletTransactions();
164 //////////////////////////////////////////////////////////////////////////////
166 // mapOrphanTransactions
169 void AddOrphanTx(const CDataStream& vMsg)
172 CDataStream(vMsg) >> tx;
173 uint256 hash = tx.GetHash();
174 if (mapOrphanTransactions.count(hash))
177 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
178 BOOST_FOREACH(const CTxIn& txin, tx.vin)
179 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
182 void static EraseOrphanTx(uint256 hash)
184 if (!mapOrphanTransactions.count(hash))
186 const CDataStream* pvMsg = mapOrphanTransactions[hash];
188 CDataStream(*pvMsg) >> tx;
189 BOOST_FOREACH(const CTxIn& txin, tx.vin)
191 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
192 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
194 if ((*mi).second == pvMsg)
195 mapOrphanTransactionsByPrev.erase(mi++);
201 mapOrphanTransactions.erase(hash);
204 int LimitOrphanTxSize(int nMaxOrphans)
207 while (mapOrphanTransactions.size() > nMaxOrphans)
209 // Evict a random orphan:
210 std::vector<unsigned char> randbytes(32);
211 RAND_bytes(&randbytes[0], 32);
212 uint256 randomhash(randbytes);
213 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
214 if (it == mapOrphanTransactions.end())
215 it = mapOrphanTransactions.begin();
216 EraseOrphanTx(it->first);
228 //////////////////////////////////////////////////////////////////////////////
230 // CTransaction and CTxIndex
233 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
236 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
238 if (!ReadFromDisk(txindexRet.pos))
240 if (prevout.n >= vout.size())
248 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
251 return ReadFromDisk(txdb, prevout, txindex);
254 bool CTransaction::ReadFromDisk(COutPoint prevout)
258 return ReadFromDisk(txdb, prevout, txindex);
263 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
275 // Load the block this tx is in
277 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
279 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
284 // Update the tx's hashBlock
285 hashBlock = pblock->GetHash();
287 // Locate the transaction
288 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
289 if (pblock->vtx[nIndex] == *(CTransaction*)this)
291 if (nIndex == pblock->vtx.size())
293 vMerkleBranch.clear();
295 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
299 // Fill in merkle branch
300 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
303 // Is the tx in a block that's in the main chain
304 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
305 if (mi == mapBlockIndex.end())
307 CBlockIndex* pindex = (*mi).second;
308 if (!pindex || !pindex->IsInMainChain())
311 return pindexBest->nHeight - pindex->nHeight + 1;
320 bool CTransaction::CheckTransaction() const
322 // Basic checks that don't depend on any context
324 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
326 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
328 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
329 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
331 // Check for negative or overflow output values
333 BOOST_FOREACH(const CTxOut& txout, vout)
335 if (txout.nValue < 0)
336 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
337 if (txout.nValue > MAX_MONEY)
338 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
339 nValueOut += txout.nValue;
340 if (!MoneyRange(nValueOut))
341 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
344 // Check for duplicate inputs
345 set<COutPoint> vInOutPoints;
346 BOOST_FOREACH(const CTxIn& txin, vin)
348 if (vInOutPoints.count(txin.prevout))
350 vInOutPoints.insert(txin.prevout);
355 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
356 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
360 BOOST_FOREACH(const CTxIn& txin, vin)
361 if (txin.prevout.IsNull())
362 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
368 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
371 *pfMissingInputs = false;
373 if (!CheckTransaction())
374 return error("AcceptToMemoryPool() : CheckTransaction failed");
376 // Coinbase is only valid in a block, not as a loose transaction
378 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
380 // To help v0.1.5 clients who would see it as a negative number
381 if ((int64)nLockTime > INT_MAX)
382 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
384 // Rather not work on nonstandard transactions (unless -testnet)
385 if (!fTestNet && !IsStandard())
386 return error("AcceptToMemoryPool() : nonstandard transaction type");
388 // Do we already have it?
389 uint256 hash = GetHash();
390 CRITICAL_BLOCK(cs_mapTransactions)
391 if (mapTransactions.count(hash))
394 if (txdb.ContainsTx(hash))
397 // Check for conflicts with in-memory transactions
398 CTransaction* ptxOld = NULL;
399 for (unsigned int i = 0; i < vin.size(); i++)
401 COutPoint outpoint = vin[i].prevout;
402 if (mapNextTx.count(outpoint))
404 // Disable replacement feature for now
407 // Allow replacing with a newer version of the same transaction
410 ptxOld = mapNextTx[outpoint].ptx;
411 if (ptxOld->IsFinal())
413 if (!IsNewerThan(*ptxOld))
415 for (unsigned int i = 0; i < vin.size(); i++)
417 COutPoint outpoint = vin[i].prevout;
418 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
428 map<uint256, CTxIndex> mapUnused;
429 bool fInvalid = false;
430 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
433 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
435 *pfMissingInputs = true;
436 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
440 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
441 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
442 // attacks disallow transactions with more than one SigOp per 34 bytes.
443 // 34 bytes because a TxOut is:
444 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
445 if (GetSigOpCount() > nSize / 34 || nSize < 100)
446 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
448 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
450 // Don't accept it if it can't get into a block
451 if (nFees < GetMinFee(1000, true, true))
452 return error("AcceptToMemoryPool() : not enough fees");
454 // Continuously rate-limit free transactions
455 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
456 // be annoying or make other's transactions take longer to confirm.
457 if (nFees < MIN_RELAY_TX_FEE)
459 static CCriticalSection cs;
460 static double dFreeCount;
461 static int64 nLastTime;
462 int64 nNow = GetTime();
466 // Use an exponentially decaying ~10-minute window:
467 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
469 // -limitfreerelay unit is thousand-bytes-per-minute
470 // At default rate it would take over a month to fill 1GB
471 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
472 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
474 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
479 // Check against previous transactions
480 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
481 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
483 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
487 // Store transaction in memory
488 CRITICAL_BLOCK(cs_mapTransactions)
492 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
493 ptxOld->RemoveFromMemoryPool();
495 AddToMemoryPoolUnchecked();
498 ///// are we sure this is ok when loading transactions or restoring block txes
499 // If updated, erase old tx from wallet
501 EraseFromWallets(ptxOld->GetHash());
503 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
507 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
510 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
513 bool CTransaction::AddToMemoryPoolUnchecked()
515 // Add to memory pool without checking anything. Don't call this directly,
516 // call AcceptToMemoryPool to properly check the transaction first.
517 CRITICAL_BLOCK(cs_mapTransactions)
519 uint256 hash = GetHash();
520 mapTransactions[hash] = *this;
521 for (unsigned int i = 0; i < vin.size(); i++)
522 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
523 nTransactionsUpdated++;
529 bool CTransaction::RemoveFromMemoryPool()
531 // Remove transaction from memory pool
532 CRITICAL_BLOCK(cs_mapTransactions)
534 BOOST_FOREACH(const CTxIn& txin, vin)
535 mapNextTx.erase(txin.prevout);
536 mapTransactions.erase(GetHash());
537 nTransactionsUpdated++;
547 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
549 if (hashBlock == 0 || nIndex == -1)
552 // Find the block it claims to be in
553 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
554 if (mi == mapBlockIndex.end())
556 CBlockIndex* pindex = (*mi).second;
557 if (!pindex || !pindex->IsInMainChain())
560 // Make sure the merkle branch connects to this block
561 if (!fMerkleVerified)
563 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
565 fMerkleVerified = true;
568 nHeightRet = pindex->nHeight;
569 return pindexBest->nHeight - pindex->nHeight + 1;
573 int CMerkleTx::GetBlocksToMaturity() const
577 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
581 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
585 if (!IsInMainChain() && !ClientConnectInputs())
587 return CTransaction::AcceptToMemoryPool(txdb, false);
591 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
595 bool CMerkleTx::AcceptToMemoryPool()
598 return AcceptToMemoryPool(txdb);
603 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
605 CRITICAL_BLOCK(cs_mapTransactions)
607 // Add previous supporting transactions first
608 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
610 if (!tx.IsCoinBase())
612 uint256 hash = tx.GetHash();
613 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
614 tx.AcceptToMemoryPool(txdb, fCheckInputs);
617 return AcceptToMemoryPool(txdb, fCheckInputs);
622 bool CWalletTx::AcceptWalletTransaction()
625 return AcceptWalletTransaction(txdb);
628 int CTxIndex::GetDepthInMainChain() const
632 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
634 // Find the block in the index
635 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
636 if (mi == mapBlockIndex.end())
638 CBlockIndex* pindex = (*mi).second;
639 if (!pindex || !pindex->IsInMainChain())
641 return 1 + nBestHeight - pindex->nHeight;
653 //////////////////////////////////////////////////////////////////////////////
655 // CBlock and CBlockIndex
658 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
660 if (!fReadTransactions)
662 *this = pindex->GetBlockHeader();
665 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
667 if (GetHash() != pindex->GetBlockHash())
668 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
672 uint256 static GetOrphanRoot(const CBlock* pblock)
674 // Work back to the first block in the orphan chain
675 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
676 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
677 return pblock->GetHash();
680 int64 static GetBlockValue(int nHeight, int64 nFees)
682 int64 nSubsidy = 50 * COIN;
684 // Subsidy is cut in half every 4 years
685 nSubsidy >>= (nHeight / 210000);
687 return nSubsidy + nFees;
690 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
691 static const int64 nTargetSpacing = 10 * 60;
692 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
695 // minimum amount of work that could possibly be required nTime after
696 // minimum work required was nBase
698 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
700 // Testnet has min-difficulty blocks
701 // after nTargetSpacing*2 time between blocks:
702 if (fTestNet && nTime > nTargetSpacing*2)
703 return bnProofOfWorkLimit.GetCompact();
706 bnResult.SetCompact(nBase);
707 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
709 // Maximum 400% adjustment...
711 // ... in best-case exactly 4-times-normal target time
712 nTime -= nTargetTimespan*4;
714 if (bnResult > bnProofOfWorkLimit)
715 bnResult = bnProofOfWorkLimit;
716 return bnResult.GetCompact();
719 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
721 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
724 if (pindexLast == NULL)
725 return nProofOfWorkLimit;
727 // Only change once per interval
728 if ((pindexLast->nHeight+1) % nInterval != 0)
730 // Special rules for testnet after 15 Feb 2012:
731 if (fTestNet && pblock->nTime > 1329264000)
733 // If the new block's timestamp is more than 2* 10 minutes
734 // then allow mining of a min-difficulty block.
735 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
736 return nProofOfWorkLimit;
739 // Return the last non-special-min-difficulty-rules-block
740 const CBlockIndex* pindex = pindexLast;
741 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
742 pindex = pindex->pprev;
743 return pindex->nBits;
747 return pindexLast->nBits;
750 // Go back by what we want to be 14 days worth of blocks
751 const CBlockIndex* pindexFirst = pindexLast;
752 for (int i = 0; pindexFirst && i < nInterval-1; i++)
753 pindexFirst = pindexFirst->pprev;
756 // Limit adjustment step
757 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
758 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
759 if (nActualTimespan < nTargetTimespan/4)
760 nActualTimespan = nTargetTimespan/4;
761 if (nActualTimespan > nTargetTimespan*4)
762 nActualTimespan = nTargetTimespan*4;
766 bnNew.SetCompact(pindexLast->nBits);
767 bnNew *= nActualTimespan;
768 bnNew /= nTargetTimespan;
770 if (bnNew > bnProofOfWorkLimit)
771 bnNew = bnProofOfWorkLimit;
774 printf("GetNextWorkRequired RETARGET\n");
775 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
776 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
777 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
779 return bnNew.GetCompact();
782 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
785 bnTarget.SetCompact(nBits);
788 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
789 return error("CheckProofOfWork() : nBits below minimum work");
791 // Check proof of work matches claimed amount
792 if (hash > bnTarget.getuint256())
793 return error("CheckProofOfWork() : hash doesn't match nBits");
798 // Return maximum amount of blocks that other nodes claim to have
799 int GetNumBlocksOfPeers()
801 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
804 bool IsInitialBlockDownload()
806 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
808 static int64 nLastUpdate;
809 static CBlockIndex* pindexLastBest;
810 if (pindexBest != pindexLastBest)
812 pindexLastBest = pindexBest;
813 nLastUpdate = GetTime();
815 return (GetTime() - nLastUpdate < 10 &&
816 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
819 void static InvalidChainFound(CBlockIndex* pindexNew)
821 if (pindexNew->bnChainWork > bnBestInvalidWork)
823 bnBestInvalidWork = pindexNew->bnChainWork;
824 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
827 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());
828 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
829 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
830 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
833 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
835 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
837 // Updating time can change work required on testnet:
839 nBits = GetNextWorkRequired(pindexPrev, this);
852 bool CTransaction::DisconnectInputs(CTxDB& txdb)
854 // Relinquish previous transactions' spent pointers
857 BOOST_FOREACH(const CTxIn& txin, vin)
859 COutPoint prevout = txin.prevout;
861 // Get prev txindex from disk
863 if (!txdb.ReadTxIndex(prevout.hash, txindex))
864 return error("DisconnectInputs() : ReadTxIndex failed");
866 if (prevout.n >= txindex.vSpent.size())
867 return error("DisconnectInputs() : prevout.n out of range");
869 // Mark outpoint as not spent
870 txindex.vSpent[prevout.n].SetNull();
873 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
874 return error("DisconnectInputs() : UpdateTxIndex failed");
878 // Remove transaction from index
879 // This can fail if a duplicate of this transaction was in a chain that got
880 // reorganized away. This is only possible if this transaction was completely
881 // spent, so erasing it would be a no-op anway.
882 txdb.EraseTxIndex(*this);
888 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
889 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
891 // FetchInputs can return false either because we just haven't seen some inputs
892 // (in which case the transaction should be stored as an orphan)
893 // or because the transaction is malformed (in which case the transaction should
894 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
898 return true; // Coinbase transactions have no inputs to fetch.
900 for (unsigned int i = 0; i < vin.size(); i++)
902 COutPoint prevout = vin[i].prevout;
903 if (inputsRet.count(prevout.hash))
904 continue; // Got it already
907 CTxIndex& txindex = inputsRet[prevout.hash].first;
909 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
911 // Get txindex from current proposed changes
912 txindex = mapTestPool.find(prevout.hash)->second;
916 // Read txindex from txdb
917 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
919 if (!fFound && (fBlock || fMiner))
920 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());
923 CTransaction& txPrev = inputsRet[prevout.hash].second;
924 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
926 // Get prev tx from single transactions in memory
927 CRITICAL_BLOCK(cs_mapTransactions)
929 if (!mapTransactions.count(prevout.hash))
930 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
931 txPrev = mapTransactions[prevout.hash];
934 txindex.vSpent.resize(txPrev.vout.size());
938 // Get prev tx from disk
939 if (!txPrev.ReadFromDisk(txindex.pos))
940 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
944 // Make sure all prevout.n's are valid:
945 for (unsigned int i = 0; i < vin.size(); i++)
947 const COutPoint prevout = vin[i].prevout;
948 assert(inputsRet.count(prevout.hash) != 0);
949 const CTxIndex& txindex = inputsRet[prevout.hash].first;
950 const CTransaction& txPrev = inputsRet[prevout.hash].second;
951 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
953 // Revisit this if/when transaction replacement is implemented and allows
956 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()));
963 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
965 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
966 if (mi == inputs.end())
967 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
969 const CTransaction& txPrev = (mi->second).second;
970 if (input.prevout.n >= txPrev.vout.size())
971 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
973 return txPrev.vout[input.prevout.n];
976 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
982 for (unsigned int i = 0; i < vin.size(); i++)
984 nResult += GetOutputFor(vin[i], inputs).nValue;
990 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
996 for (unsigned int i = 0; i < vin.size(); i++)
998 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
999 if (prevout.scriptPubKey.IsPayToScriptHash())
1000 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1005 bool CTransaction::ConnectInputs(MapPrevTx inputs,
1006 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1007 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1009 // Take over previous transactions' spent pointers
1010 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1011 // fMiner is true when called from the internal bitcoin miner
1012 // ... both are false when called from CTransaction::AcceptToMemoryPool
1017 for (unsigned int i = 0; i < vin.size(); i++)
1019 COutPoint prevout = vin[i].prevout;
1020 assert(inputs.count(prevout.hash) > 0);
1021 CTxIndex& txindex = inputs[prevout.hash].first;
1022 CTransaction& txPrev = inputs[prevout.hash].second;
1024 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1025 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()));
1027 // If prev is coinbase, check that it's matured
1028 if (txPrev.IsCoinBase())
1029 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1030 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1031 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1033 // Check for conflicts (double-spend)
1034 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1035 // for an attacker to attempt to split the network.
1036 if (!txindex.vSpent[prevout.n].IsNull())
1037 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());
1039 // Check for negative or overflow input values
1040 nValueIn += txPrev.vout[prevout.n].nValue;
1041 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1042 return DoS(100, error("ConnectInputs() : txin values out of range"));
1044 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1045 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1046 // still computed and checked, and any change will be caught at the next checkpoint.
1047 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1050 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1052 // only during transition phase for P2SH: do not invoke anti-DoS code for
1053 // potentially old clients relaying bad P2SH transactions
1054 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1055 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1057 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1061 // Mark outpoints as spent
1062 txindex.vSpent[prevout.n] = posThisTx;
1065 if (fBlock || fMiner)
1067 mapTestPool[prevout.hash] = txindex;
1071 if (nValueIn < GetValueOut())
1072 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1074 // Tally transaction fees
1075 int64 nTxFee = nValueIn - GetValueOut();
1077 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1079 if (!MoneyRange(nFees))
1080 return DoS(100, error("ConnectInputs() : nFees out of range"));
1087 bool CTransaction::ClientConnectInputs()
1092 // Take over previous transactions' spent pointers
1093 CRITICAL_BLOCK(cs_mapTransactions)
1096 for (unsigned int i = 0; i < vin.size(); i++)
1098 // Get prev tx from single transactions in memory
1099 COutPoint prevout = vin[i].prevout;
1100 if (!mapTransactions.count(prevout.hash))
1102 CTransaction& txPrev = mapTransactions[prevout.hash];
1104 if (prevout.n >= txPrev.vout.size())
1108 if (!VerifySignature(txPrev, *this, i, true, 0))
1109 return error("ConnectInputs() : VerifySignature failed");
1111 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1112 ///// this has to go away now that posNext is gone
1113 // // Check for conflicts
1114 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1115 // return error("ConnectInputs() : prev tx already used");
1117 // // Flag outpoints as used
1118 // txPrev.vout[prevout.n].posNext = posThisTx;
1120 nValueIn += txPrev.vout[prevout.n].nValue;
1122 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1123 return error("ClientConnectInputs() : txin values out of range");
1125 if (GetValueOut() > nValueIn)
1135 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1137 // Disconnect in reverse order
1138 for (int i = vtx.size()-1; i >= 0; i--)
1139 if (!vtx[i].DisconnectInputs(txdb))
1142 // Update block index on disk without changing it in memory.
1143 // The memory index structure will be changed after the db commits.
1146 CDiskBlockIndex blockindexPrev(pindex->pprev);
1147 blockindexPrev.hashNext = 0;
1148 if (!txdb.WriteBlockIndex(blockindexPrev))
1149 return error("DisconnectBlock() : WriteBlockIndex failed");
1155 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1157 // Check it again in case a previous version let a bad block in
1161 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1162 // unless those are already completely spent.
1163 // If such overwrites are allowed, coinbases and transactions depending upon those
1164 // can be duplicated to remove the ability to spend the first instance -- even after
1165 // being sent to another address.
1166 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1167 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1168 // already refuses previously-known transaction id's entirely.
1169 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1170 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1171 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1173 BOOST_FOREACH(CTransaction& tx, vtx)
1175 CTxIndex txindexOld;
1176 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1178 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1185 // P2SH didn't become active until Apr 1 2012 (Feb 15 on testnet)
1186 int64 nEvalSwitchTime = fTestNet ? 1329264000 : 1333238400;
1187 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1189 //// issue here: it doesn't know the version
1190 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1192 map<uint256, CTxIndex> mapQueuedChanges;
1195 BOOST_FOREACH(CTransaction& tx, vtx)
1197 nSigOps += tx.GetSigOpCount();
1198 if (nSigOps > MAX_BLOCK_SIGOPS)
1199 return DoS(100, error("ConnectBlock() : too many sigops"));
1201 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1202 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1205 MapPrevTx mapInputs;
1206 if (!tx.IsCoinBase())
1208 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1211 if (fStrictPayToScriptHash)
1213 // Add in sigops done by pay-to-script-hash inputs;
1214 // this is to prevent a "rogue miner" from creating
1215 // an incredibly-expensive-to-validate block.
1216 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1217 if (nSigOps > MAX_BLOCK_SIGOPS)
1218 return DoS(100, error("ConnectBlock() : too many sigops"));
1221 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1223 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1227 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1230 // Write queued txindex changes
1231 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1233 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1234 return error("ConnectBlock() : UpdateTxIndex failed");
1237 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1240 // Update block index on disk without changing it in memory.
1241 // The memory index structure will be changed after the db commits.
1244 CDiskBlockIndex blockindexPrev(pindex->pprev);
1245 blockindexPrev.hashNext = pindex->GetBlockHash();
1246 if (!txdb.WriteBlockIndex(blockindexPrev))
1247 return error("ConnectBlock() : WriteBlockIndex failed");
1250 // Watch for transactions paying to me
1251 BOOST_FOREACH(CTransaction& tx, vtx)
1252 SyncWithWallets(tx, this, true);
1257 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1259 printf("REORGANIZE\n");
1262 CBlockIndex* pfork = pindexBest;
1263 CBlockIndex* plonger = pindexNew;
1264 while (pfork != plonger)
1266 while (plonger->nHeight > pfork->nHeight)
1267 if (!(plonger = plonger->pprev))
1268 return error("Reorganize() : plonger->pprev is null");
1269 if (pfork == plonger)
1271 if (!(pfork = pfork->pprev))
1272 return error("Reorganize() : pfork->pprev is null");
1275 // List of what to disconnect
1276 vector<CBlockIndex*> vDisconnect;
1277 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1278 vDisconnect.push_back(pindex);
1280 // List of what to connect
1281 vector<CBlockIndex*> vConnect;
1282 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1283 vConnect.push_back(pindex);
1284 reverse(vConnect.begin(), vConnect.end());
1286 printf("REORGANIZE: Disconnect %i blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1287 printf("REORGANIZE: Connect %i blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1289 // Disconnect shorter branch
1290 vector<CTransaction> vResurrect;
1291 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1294 if (!block.ReadFromDisk(pindex))
1295 return error("Reorganize() : ReadFromDisk for disconnect failed");
1296 if (!block.DisconnectBlock(txdb, pindex))
1297 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1299 // Queue memory transactions to resurrect
1300 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1301 if (!tx.IsCoinBase())
1302 vResurrect.push_back(tx);
1305 // Connect longer branch
1306 vector<CTransaction> vDelete;
1307 for (unsigned int i = 0; i < vConnect.size(); i++)
1309 CBlockIndex* pindex = vConnect[i];
1311 if (!block.ReadFromDisk(pindex))
1312 return error("Reorganize() : ReadFromDisk for connect failed");
1313 if (!block.ConnectBlock(txdb, pindex))
1317 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1320 // Queue memory transactions to delete
1321 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1322 vDelete.push_back(tx);
1324 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1325 return error("Reorganize() : WriteHashBestChain failed");
1327 // Make sure it's successfully written to disk before changing memory structure
1328 if (!txdb.TxnCommit())
1329 return error("Reorganize() : TxnCommit failed");
1331 // Disconnect shorter branch
1332 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1334 pindex->pprev->pnext = NULL;
1336 // Connect longer branch
1337 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1339 pindex->pprev->pnext = pindex;
1341 // Resurrect memory transactions that were in the disconnected branch
1342 BOOST_FOREACH(CTransaction& tx, vResurrect)
1343 tx.AcceptToMemoryPool(txdb, false);
1345 // Delete redundant memory transactions that are in the connected branch
1346 BOOST_FOREACH(CTransaction& tx, vDelete)
1347 tx.RemoveFromMemoryPool();
1349 printf("REORGANIZE: done\n");
1355 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1357 uint256 hash = GetHash();
1360 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1362 txdb.WriteHashBestChain(hash);
1363 if (!txdb.TxnCommit())
1364 return error("SetBestChain() : TxnCommit failed");
1365 pindexGenesisBlock = pindexNew;
1367 else if (hashPrevBlock == hashBestChain)
1369 // Adding to current best branch
1370 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1373 InvalidChainFound(pindexNew);
1374 return error("SetBestChain() : ConnectBlock failed");
1376 if (!txdb.TxnCommit())
1377 return error("SetBestChain() : TxnCommit failed");
1379 // Add to current best branch
1380 pindexNew->pprev->pnext = pindexNew;
1382 // Delete redundant memory transactions
1383 BOOST_FOREACH(CTransaction& tx, vtx)
1384 tx.RemoveFromMemoryPool();
1389 if (!Reorganize(txdb, pindexNew))
1392 InvalidChainFound(pindexNew);
1393 return error("SetBestChain() : Reorganize failed");
1397 // Update best block in wallet (so we can detect restored wallets)
1398 if (!IsInitialBlockDownload())
1400 const CBlockLocator locator(pindexNew);
1401 ::SetBestChain(locator);
1405 hashBestChain = hash;
1406 pindexBest = pindexNew;
1407 nBestHeight = pindexBest->nHeight;
1408 bnBestChainWork = pindexNew->bnChainWork;
1409 nTimeBestReceived = GetTime();
1410 nTransactionsUpdated++;
1411 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1417 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1419 // Check for duplicate
1420 uint256 hash = GetHash();
1421 if (mapBlockIndex.count(hash))
1422 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1424 // Construct new block index object
1425 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1427 return error("AddToBlockIndex() : new CBlockIndex failed");
1428 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1429 pindexNew->phashBlock = &((*mi).first);
1430 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1431 if (miPrev != mapBlockIndex.end())
1433 pindexNew->pprev = (*miPrev).second;
1434 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1436 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1440 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1441 if (!txdb.TxnCommit())
1445 if (pindexNew->bnChainWork > bnBestChainWork)
1446 if (!SetBestChain(txdb, pindexNew))
1451 if (pindexNew == pindexBest)
1453 // Notify UI to display prev block's coinbase if it was ours
1454 static uint256 hashPrevBestCoinBase;
1455 UpdatedTransaction(hashPrevBestCoinBase);
1456 hashPrevBestCoinBase = vtx[0].GetHash();
1466 bool CBlock::CheckBlock() const
1468 // These are checks that are independent of context
1469 // that can be verified before saving an orphan block.
1472 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1473 return DoS(100, error("CheckBlock() : size limits failed"));
1475 // Check proof of work matches claimed amount
1476 if (!CheckProofOfWork(GetHash(), nBits))
1477 return DoS(50, error("CheckBlock() : proof of work failed"));
1480 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1481 return error("CheckBlock() : block timestamp too far in the future");
1483 // First transaction must be coinbase, the rest must not be
1484 if (vtx.empty() || !vtx[0].IsCoinBase())
1485 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1486 for (unsigned int i = 1; i < vtx.size(); i++)
1487 if (vtx[i].IsCoinBase())
1488 return DoS(100, error("CheckBlock() : more than one coinbase"));
1490 // Check transactions
1491 BOOST_FOREACH(const CTransaction& tx, vtx)
1492 if (!tx.CheckTransaction())
1493 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1495 // Check for duplicate txids. This is caught by ConnectInputs(),
1496 // but catching it earlier avoids a potential DoS attack:
1497 set<uint256> uniqueTx;
1498 BOOST_FOREACH(const CTransaction& tx, vtx)
1500 uniqueTx.insert(tx.GetHash());
1502 if (uniqueTx.size() != vtx.size())
1503 return DoS(100, error("CheckBlock() : duplicate transaction"));
1505 // Check that it's not full of nonstandard transactions
1506 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1507 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1510 if (hashMerkleRoot != BuildMerkleTree())
1511 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1516 bool CBlock::AcceptBlock()
1518 // Check for duplicate
1519 uint256 hash = GetHash();
1520 if (mapBlockIndex.count(hash))
1521 return error("AcceptBlock() : block already in mapBlockIndex");
1523 // Get prev block index
1524 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1525 if (mi == mapBlockIndex.end())
1526 return DoS(10, error("AcceptBlock() : prev block not found"));
1527 CBlockIndex* pindexPrev = (*mi).second;
1528 int nHeight = pindexPrev->nHeight+1;
1530 // Check proof of work
1531 if (nBits != GetNextWorkRequired(pindexPrev, this))
1532 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1534 // Check timestamp against prev
1535 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1536 return error("AcceptBlock() : block's timestamp is too early");
1538 // Check that all transactions are finalized
1539 BOOST_FOREACH(const CTransaction& tx, vtx)
1540 if (!tx.IsFinal(nHeight, GetBlockTime()))
1541 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1543 // Check that the block chain matches the known block chain up to a checkpoint
1544 if (!Checkpoints::CheckBlock(nHeight, hash))
1545 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1547 // Write block to history file
1548 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1549 return error("AcceptBlock() : out of disk space");
1550 unsigned int nFile = -1;
1551 unsigned int nBlockPos = 0;
1552 if (!WriteToDisk(nFile, nBlockPos))
1553 return error("AcceptBlock() : WriteToDisk failed");
1554 if (!AddToBlockIndex(nFile, nBlockPos))
1555 return error("AcceptBlock() : AddToBlockIndex failed");
1557 // Relay inventory, but don't relay old inventory during initial block download
1558 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1559 if (hashBestChain == hash)
1560 CRITICAL_BLOCK(cs_vNodes)
1561 BOOST_FOREACH(CNode* pnode, vNodes)
1562 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1563 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1568 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1570 // Check for duplicate
1571 uint256 hash = pblock->GetHash();
1572 if (mapBlockIndex.count(hash))
1573 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1574 if (mapOrphanBlocks.count(hash))
1575 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1577 // Preliminary checks
1578 if (!pblock->CheckBlock())
1579 return error("ProcessBlock() : CheckBlock FAILED");
1581 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1582 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1584 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1585 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1589 pfrom->Misbehaving(100);
1590 return error("ProcessBlock() : block with timestamp before last checkpoint");
1593 bnNewBlock.SetCompact(pblock->nBits);
1595 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1596 if (bnNewBlock > bnRequired)
1599 pfrom->Misbehaving(100);
1600 return error("ProcessBlock() : block with too little proof-of-work");
1605 // If don't already have its previous block, shunt it off to holding area until we get it
1606 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1608 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1609 CBlock* pblock2 = new CBlock(*pblock);
1610 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1611 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1613 // Ask this guy to fill in what we're missing
1615 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1620 if (!pblock->AcceptBlock())
1621 return error("ProcessBlock() : AcceptBlock FAILED");
1623 // Recursively process any orphan blocks that depended on this one
1624 vector<uint256> vWorkQueue;
1625 vWorkQueue.push_back(hash);
1626 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
1628 uint256 hashPrev = vWorkQueue[i];
1629 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1630 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1633 CBlock* pblockOrphan = (*mi).second;
1634 if (pblockOrphan->AcceptBlock())
1635 vWorkQueue.push_back(pblockOrphan->GetHash());
1636 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1637 delete pblockOrphan;
1639 mapOrphanBlocksByPrev.erase(hashPrev);
1642 printf("ProcessBlock: ACCEPTED\n");
1653 bool CheckDiskSpace(uint64 nAdditionalBytes)
1655 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1657 // Check for 15MB because database could create another 10MB log file at any time
1658 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1661 string strMessage = _("Warning: Disk space is low ");
1662 strMiscWarning = strMessage;
1663 printf("*** %s\n", strMessage.c_str());
1664 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1665 CreateThread(Shutdown, NULL);
1671 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1675 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1678 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1680 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1689 static unsigned int nCurrentBlockFile = 1;
1691 FILE* AppendBlockFile(unsigned int& nFileRet)
1696 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1699 if (fseek(file, 0, SEEK_END) != 0)
1701 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1702 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1704 nFileRet = nCurrentBlockFile;
1708 nCurrentBlockFile++;
1712 bool LoadBlockIndex(bool fAllowNew)
1716 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1717 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1718 pchMessageStart[0] = 0xfa;
1719 pchMessageStart[1] = 0xbf;
1720 pchMessageStart[2] = 0xb5;
1721 pchMessageStart[3] = 0xda;
1728 if (!txdb.LoadBlockIndex())
1733 // Init with genesis block
1735 if (mapBlockIndex.empty())
1741 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1742 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1743 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1744 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1745 // vMerkleTree: 4a5e1e
1748 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1750 txNew.vin.resize(1);
1751 txNew.vout.resize(1);
1752 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1753 txNew.vout[0].nValue = 50 * COIN;
1754 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1756 block.vtx.push_back(txNew);
1757 block.hashPrevBlock = 0;
1758 block.hashMerkleRoot = block.BuildMerkleTree();
1760 block.nTime = 1231006505;
1761 block.nBits = 0x1d00ffff;
1762 block.nNonce = 2083236893;
1766 block.nTime = 1296688602;
1767 block.nBits = 0x1d07fff8;
1768 block.nNonce = 384568319;
1772 printf("%s\n", block.GetHash().ToString().c_str());
1773 printf("%s\n", hashGenesisBlock.ToString().c_str());
1774 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1775 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1777 assert(block.GetHash() == hashGenesisBlock);
1779 // Start new block file
1781 unsigned int nBlockPos;
1782 if (!block.WriteToDisk(nFile, nBlockPos))
1783 return error("LoadBlockIndex() : writing genesis block to disk failed");
1784 if (!block.AddToBlockIndex(nFile, nBlockPos))
1785 return error("LoadBlockIndex() : genesis block not accepted");
1793 void PrintBlockTree()
1795 // precompute tree structure
1796 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1797 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1799 CBlockIndex* pindex = (*mi).second;
1800 mapNext[pindex->pprev].push_back(pindex);
1802 //while (rand() % 3 == 0)
1803 // mapNext[pindex->pprev].push_back(pindex);
1806 vector<pair<int, CBlockIndex*> > vStack;
1807 vStack.push_back(make_pair(0, pindexGenesisBlock));
1810 while (!vStack.empty())
1812 int nCol = vStack.back().first;
1813 CBlockIndex* pindex = vStack.back().second;
1816 // print split or gap
1817 if (nCol > nPrevCol)
1819 for (int i = 0; i < nCol-1; i++)
1823 else if (nCol < nPrevCol)
1825 for (int i = 0; i < nCol; i++)
1832 for (int i = 0; i < nCol; i++)
1837 block.ReadFromDisk(pindex);
1838 printf("%d (%u,%u) %s %s tx %d",
1842 block.GetHash().ToString().substr(0,20).c_str(),
1843 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1846 PrintWallets(block);
1848 // put the main timechain first
1849 vector<CBlockIndex*>& vNext = mapNext[pindex];
1850 for (unsigned int i = 0; i < vNext.size(); i++)
1852 if (vNext[i]->pnext)
1854 swap(vNext[0], vNext[i]);
1860 for (unsigned int i = 0; i < vNext.size(); i++)
1861 vStack.push_back(make_pair(nCol+i, vNext[i]));
1874 //////////////////////////////////////////////////////////////////////////////
1879 map<uint256, CAlert> mapAlerts;
1880 CCriticalSection cs_mapAlerts;
1882 string GetWarnings(string strFor)
1885 string strStatusBar;
1887 if (GetBoolArg("-testsafemode"))
1890 // Misc warnings like out of disk space and clock is wrong
1891 if (strMiscWarning != "")
1894 strStatusBar = strMiscWarning;
1897 // Longer invalid proof-of-work chain
1898 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1901 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1905 CRITICAL_BLOCK(cs_mapAlerts)
1907 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1909 const CAlert& alert = item.second;
1910 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1912 nPriority = alert.nPriority;
1913 strStatusBar = alert.strStatusBar;
1918 if (strFor == "statusbar")
1919 return strStatusBar;
1920 else if (strFor == "rpc")
1922 assert(!"GetWarnings() : invalid parameter");
1926 bool CAlert::ProcessAlert()
1928 if (!CheckSignature())
1933 CRITICAL_BLOCK(cs_mapAlerts)
1935 // Cancel previous alerts
1936 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1938 const CAlert& alert = (*mi).second;
1941 printf("cancelling alert %d\n", alert.nID);
1942 mapAlerts.erase(mi++);
1944 else if (!alert.IsInEffect())
1946 printf("expiring alert %d\n", alert.nID);
1947 mapAlerts.erase(mi++);
1953 // Check if this alert has been cancelled
1954 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1956 const CAlert& alert = item.second;
1957 if (alert.Cancels(*this))
1959 printf("alert already cancelled by %d\n", alert.nID);
1965 mapAlerts.insert(make_pair(GetHash(), *this));
1968 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1980 //////////////////////////////////////////////////////////////////////////////
1986 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1992 bool txInMap = false;
1993 CRITICAL_BLOCK(cs_mapTransactions)
1995 txInMap = (mapTransactions.count(inv.hash) != 0);
1998 mapOrphanTransactions.count(inv.hash) ||
1999 txdb.ContainsTx(inv.hash);
2002 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2004 // Don't know what it is, just say we already got one
2011 // The message start string is designed to be unlikely to occur in normal data.
2012 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2013 // a large 4-byte int at any alignment.
2014 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2017 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2019 static map<unsigned int, vector<unsigned char> > mapReuseKey;
2020 RandAddSeedPerfmon();
2022 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2023 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2025 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2027 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2035 if (strCommand == "version")
2037 // Each connection can only send one version message
2038 if (pfrom->nVersion != 0)
2040 pfrom->Misbehaving(1);
2048 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2049 if (pfrom->nVersion == 10300)
2050 pfrom->nVersion = 300;
2051 if (pfrom->nVersion >= 106 && !vRecv.empty())
2052 vRecv >> addrFrom >> nNonce;
2053 if (pfrom->nVersion >= 106 && !vRecv.empty())
2054 vRecv >> pfrom->strSubVer;
2055 if (pfrom->nVersion >= 209 && !vRecv.empty())
2056 vRecv >> pfrom->nStartingHeight;
2058 if (pfrom->nVersion == 0)
2061 // Disconnect if we connected to ourself
2062 if (nNonce == nLocalHostNonce && nNonce > 1)
2064 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2065 pfrom->fDisconnect = true;
2069 // Be shy and don't send version until we hear
2070 if (pfrom->fInbound)
2071 pfrom->PushVersion();
2073 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2075 AddTimeData(pfrom->addr.ip, nTime);
2078 if (pfrom->nVersion >= 209)
2079 pfrom->PushMessage("verack");
2080 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2081 if (pfrom->nVersion < 209)
2082 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2084 if (!pfrom->fInbound)
2086 // Advertise our address
2087 if (addrLocalHost.IsRoutable() && !fUseProxy)
2089 CAddress addr(addrLocalHost);
2090 addr.nTime = GetAdjustedTime();
2091 pfrom->PushAddress(addr);
2094 // Get recent addresses
2095 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2097 pfrom->PushMessage("getaddr");
2098 pfrom->fGetAddr = true;
2102 // Ask the first connected node for block updates
2103 static int nAskedForBlocks = 0;
2104 if (!pfrom->fClient &&
2105 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2106 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2109 pfrom->PushGetBlocks(pindexBest, uint256(0));
2113 CRITICAL_BLOCK(cs_mapAlerts)
2114 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2115 item.second.RelayTo(pfrom);
2117 pfrom->fSuccessfullyConnected = true;
2119 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2121 cPeerBlockCounts.input(pfrom->nStartingHeight);
2125 else if (pfrom->nVersion == 0)
2127 // Must have a version message before anything else
2128 pfrom->Misbehaving(1);
2133 else if (strCommand == "verack")
2135 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2139 else if (strCommand == "addr")
2141 vector<CAddress> vAddr;
2144 // Don't want addr from older versions unless seeding
2145 if (pfrom->nVersion < 209)
2147 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2149 if (vAddr.size() > 1000)
2151 pfrom->Misbehaving(20);
2152 return error("message addr size() = %d", vAddr.size());
2155 // Store the new addresses
2158 int64 nNow = GetAdjustedTime();
2159 int64 nSince = nNow - 10 * 60;
2160 BOOST_FOREACH(CAddress& addr, vAddr)
2164 // ignore IPv6 for now, since it isn't implemented anyway
2167 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2168 addr.nTime = nNow - 5 * 24 * 60 * 60;
2169 AddAddress(addr, 2 * 60 * 60, &addrDB);
2170 pfrom->AddAddressKnown(addr);
2171 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2173 // Relay to a limited number of other nodes
2174 CRITICAL_BLOCK(cs_vNodes)
2176 // Use deterministic randomness to send to the same nodes for 24 hours
2177 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2178 static uint256 hashSalt;
2180 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2181 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2182 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2183 multimap<uint256, CNode*> mapMix;
2184 BOOST_FOREACH(CNode* pnode, vNodes)
2186 if (pnode->nVersion < 31402)
2188 unsigned int nPointer;
2189 memcpy(&nPointer, &pnode, sizeof(nPointer));
2190 uint256 hashKey = hashRand ^ nPointer;
2191 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2192 mapMix.insert(make_pair(hashKey, pnode));
2194 int nRelayNodes = 2;
2195 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2196 ((*mi).second)->PushAddress(addr);
2200 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2201 if (vAddr.size() < 1000)
2202 pfrom->fGetAddr = false;
2206 else if (strCommand == "inv")
2210 if (vInv.size() > 50000)
2212 pfrom->Misbehaving(20);
2213 return error("message inv size() = %d", vInv.size());
2217 BOOST_FOREACH(const CInv& inv, vInv)
2221 pfrom->AddInventoryKnown(inv);
2223 bool fAlreadyHave = AlreadyHave(txdb, inv);
2225 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2229 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2230 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2232 // Track requests for our stuff
2233 Inventory(inv.hash);
2238 else if (strCommand == "getdata")
2242 if (vInv.size() > 50000)
2244 pfrom->Misbehaving(20);
2245 return error("message getdata size() = %d", vInv.size());
2248 BOOST_FOREACH(const CInv& inv, vInv)
2252 printf("received getdata for: %s\n", inv.ToString().c_str());
2254 if (inv.type == MSG_BLOCK)
2256 // Send block from disk
2257 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2258 if (mi != mapBlockIndex.end())
2261 block.ReadFromDisk((*mi).second);
2262 pfrom->PushMessage("block", block);
2264 // Trigger them to send a getblocks request for the next batch of inventory
2265 if (inv.hash == pfrom->hashContinue)
2267 // Bypass PushInventory, this must send even if redundant,
2268 // and we want it right after the last block so they don't
2269 // wait for other stuff first.
2271 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2272 pfrom->PushMessage("inv", vInv);
2273 pfrom->hashContinue = 0;
2277 else if (inv.IsKnownType())
2279 // Send stream from relay memory
2280 CRITICAL_BLOCK(cs_mapRelay)
2282 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2283 if (mi != mapRelay.end())
2284 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2288 // Track requests for our stuff
2289 Inventory(inv.hash);
2294 else if (strCommand == "getblocks")
2296 CBlockLocator locator;
2298 vRecv >> locator >> hashStop;
2300 // Find the last block the caller has in the main chain
2301 CBlockIndex* pindex = locator.GetBlockIndex();
2303 // Send the rest of the chain
2305 pindex = pindex->pnext;
2306 int nLimit = 500 + locator.GetDistanceBack();
2307 unsigned int nBytes = 0;
2308 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2309 for (; pindex; pindex = pindex->pnext)
2311 if (pindex->GetBlockHash() == hashStop)
2313 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2316 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2318 block.ReadFromDisk(pindex, true);
2319 nBytes += block.GetSerializeSize(SER_NETWORK);
2320 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2322 // When this block is requested, we'll send an inv that'll make them
2323 // getblocks the next batch of inventory.
2324 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2325 pfrom->hashContinue = pindex->GetBlockHash();
2332 else if (strCommand == "getheaders")
2334 CBlockLocator locator;
2336 vRecv >> locator >> hashStop;
2338 CBlockIndex* pindex = NULL;
2339 if (locator.IsNull())
2341 // If locator is null, return the hashStop block
2342 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2343 if (mi == mapBlockIndex.end())
2345 pindex = (*mi).second;
2349 // Find the last block the caller has in the main chain
2350 pindex = locator.GetBlockIndex();
2352 pindex = pindex->pnext;
2355 vector<CBlock> vHeaders;
2356 int nLimit = 2000 + locator.GetDistanceBack();
2357 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2358 for (; pindex; pindex = pindex->pnext)
2360 vHeaders.push_back(pindex->GetBlockHeader());
2361 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2364 pfrom->PushMessage("headers", vHeaders);
2368 else if (strCommand == "tx")
2370 vector<uint256> vWorkQueue;
2371 CDataStream vMsg(vRecv);
2375 CInv inv(MSG_TX, tx.GetHash());
2376 pfrom->AddInventoryKnown(inv);
2378 bool fMissingInputs = false;
2379 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2381 SyncWithWallets(tx, NULL, true);
2382 RelayMessage(inv, vMsg);
2383 mapAlreadyAskedFor.erase(inv);
2384 vWorkQueue.push_back(inv.hash);
2386 // Recursively process any orphan transactions that depended on this one
2387 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2389 uint256 hashPrev = vWorkQueue[i];
2390 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2391 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2394 const CDataStream& vMsg = *((*mi).second);
2396 CDataStream(vMsg) >> tx;
2397 CInv inv(MSG_TX, tx.GetHash());
2399 if (tx.AcceptToMemoryPool(true))
2401 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2402 SyncWithWallets(tx, NULL, true);
2403 RelayMessage(inv, vMsg);
2404 mapAlreadyAskedFor.erase(inv);
2405 vWorkQueue.push_back(inv.hash);
2410 BOOST_FOREACH(uint256 hash, vWorkQueue)
2411 EraseOrphanTx(hash);
2413 else if (fMissingInputs)
2415 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2418 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2419 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2421 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2423 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2427 else if (strCommand == "block")
2432 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2435 CInv inv(MSG_BLOCK, block.GetHash());
2436 pfrom->AddInventoryKnown(inv);
2438 if (ProcessBlock(pfrom, &block))
2439 mapAlreadyAskedFor.erase(inv);
2440 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2444 else if (strCommand == "getaddr")
2446 // Nodes rebroadcast an addr every 24 hours
2447 pfrom->vAddrToSend.clear();
2448 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2449 CRITICAL_BLOCK(cs_mapAddresses)
2451 unsigned int nCount = 0;
2452 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2454 const CAddress& addr = item.second;
2455 if (addr.nTime > nSince)
2458 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2460 const CAddress& addr = item.second;
2461 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2462 pfrom->PushAddress(addr);
2468 else if (strCommand == "checkorder")
2473 if (!GetBoolArg("-allowreceivebyip"))
2475 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2482 /// we have a chance to check the order here
2484 // Keep giving the same key to the same ip until they use it
2485 if (!mapReuseKey.count(pfrom->addr.ip))
2486 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2488 // Send back approval of order and pubkey to use
2489 CScript scriptPubKey;
2490 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2491 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2495 else if (strCommand == "reply")
2500 CRequestTracker tracker;
2501 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2503 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2504 if (mi != pfrom->mapRequests.end())
2506 tracker = (*mi).second;
2507 pfrom->mapRequests.erase(mi);
2510 if (!tracker.IsNull())
2511 tracker.fn(tracker.param1, vRecv);
2515 else if (strCommand == "ping")
2520 else if (strCommand == "alert")
2525 if (alert.ProcessAlert())
2528 pfrom->setKnown.insert(alert.GetHash());
2529 CRITICAL_BLOCK(cs_vNodes)
2530 BOOST_FOREACH(CNode* pnode, vNodes)
2531 alert.RelayTo(pnode);
2538 // Ignore unknown commands for extensibility
2542 // Update the last seen time for this node's address
2543 if (pfrom->fNetworkNode)
2544 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2545 AddressCurrentlyConnected(pfrom->addr);
2551 bool ProcessMessages(CNode* pfrom)
2553 CDataStream& vRecv = pfrom->vRecv;
2557 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2561 // (4) message start
2570 // Scan for message start
2571 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2572 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2573 if (vRecv.end() - pstart < nHeaderSize)
2575 if (vRecv.size() > nHeaderSize)
2577 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2578 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2582 if (pstart - vRecv.begin() > 0)
2583 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2584 vRecv.erase(vRecv.begin(), pstart);
2587 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2592 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2595 string strCommand = hdr.GetCommand();
2598 unsigned int nMessageSize = hdr.nMessageSize;
2599 if (nMessageSize > MAX_SIZE)
2601 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2604 if (nMessageSize > vRecv.size())
2606 // Rewind and wait for rest of message
2607 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2612 if (vRecv.GetVersion() >= 209)
2614 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2615 unsigned int nChecksum = 0;
2616 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2617 if (nChecksum != hdr.nChecksum)
2619 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2620 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2625 // Copy message to its own buffer
2626 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2627 vRecv.ignore(nMessageSize);
2633 CRITICAL_BLOCK(cs_main)
2634 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2638 catch (std::ios_base::failure& e)
2640 if (strstr(e.what(), "end of data"))
2642 // Allow exceptions from underlength message on vRecv
2643 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());
2645 else if (strstr(e.what(), "size too large"))
2647 // Allow exceptions from overlong size
2648 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2652 PrintExceptionContinue(&e, "ProcessMessage()");
2655 catch (std::exception& e) {
2656 PrintExceptionContinue(&e, "ProcessMessage()");
2658 PrintExceptionContinue(NULL, "ProcessMessage()");
2662 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2670 bool SendMessages(CNode* pto, bool fSendTrickle)
2672 TRY_CRITICAL_BLOCK(cs_main)
2674 // Don't send anything until we get their version message
2675 if (pto->nVersion == 0)
2679 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2680 pto->PushMessage("ping");
2682 // Resend wallet transactions that haven't gotten in a block yet
2683 ResendWalletTransactions();
2685 // Address refresh broadcast
2686 static int64 nLastRebroadcast;
2687 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2689 nLastRebroadcast = GetTime();
2690 CRITICAL_BLOCK(cs_vNodes)
2692 BOOST_FOREACH(CNode* pnode, vNodes)
2694 // Periodically clear setAddrKnown to allow refresh broadcasts
2695 pnode->setAddrKnown.clear();
2697 // Rebroadcast our address
2698 if (addrLocalHost.IsRoutable() && !fUseProxy)
2700 CAddress addr(addrLocalHost);
2701 addr.nTime = GetAdjustedTime();
2702 pnode->PushAddress(addr);
2708 // Clear out old addresses periodically so it's not too much work at once
2709 static int64 nLastClear;
2710 if (nLastClear == 0)
2711 nLastClear = GetTime();
2712 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2714 nLastClear = GetTime();
2715 CRITICAL_BLOCK(cs_mapAddresses)
2718 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2719 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2720 mi != mapAddresses.end();)
2722 const CAddress& addr = (*mi).second;
2723 if (addr.nTime < nSince)
2725 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2727 addrdb.EraseAddress(addr);
2728 mapAddresses.erase(mi++);
2742 vector<CAddress> vAddr;
2743 vAddr.reserve(pto->vAddrToSend.size());
2744 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2746 // returns true if wasn't already contained in the set
2747 if (pto->setAddrKnown.insert(addr).second)
2749 vAddr.push_back(addr);
2750 // receiver rejects addr messages larger than 1000
2751 if (vAddr.size() >= 1000)
2753 pto->PushMessage("addr", vAddr);
2758 pto->vAddrToSend.clear();
2760 pto->PushMessage("addr", vAddr);
2765 // Message: inventory
2768 vector<CInv> vInvWait;
2769 CRITICAL_BLOCK(pto->cs_inventory)
2771 vInv.reserve(pto->vInventoryToSend.size());
2772 vInvWait.reserve(pto->vInventoryToSend.size());
2773 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2775 if (pto->setInventoryKnown.count(inv))
2778 // trickle out tx inv to protect privacy
2779 if (inv.type == MSG_TX && !fSendTrickle)
2781 // 1/4 of tx invs blast to all immediately
2782 static uint256 hashSalt;
2784 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2785 uint256 hashRand = inv.hash ^ hashSalt;
2786 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2787 bool fTrickleWait = ((hashRand & 3) != 0);
2789 // always trickle our own transactions
2793 if (GetTransaction(inv.hash, wtx))
2795 fTrickleWait = true;
2800 vInvWait.push_back(inv);
2805 // returns true if wasn't already contained in the set
2806 if (pto->setInventoryKnown.insert(inv).second)
2808 vInv.push_back(inv);
2809 if (vInv.size() >= 1000)
2811 pto->PushMessage("inv", vInv);
2816 pto->vInventoryToSend = vInvWait;
2819 pto->PushMessage("inv", vInv);
2825 vector<CInv> vGetData;
2826 int64 nNow = GetTime() * 1000000;
2828 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2830 const CInv& inv = (*pto->mapAskFor.begin()).second;
2831 if (!AlreadyHave(txdb, inv))
2833 printf("sending getdata: %s\n", inv.ToString().c_str());
2834 vGetData.push_back(inv);
2835 if (vGetData.size() >= 1000)
2837 pto->PushMessage("getdata", vGetData);
2841 mapAlreadyAskedFor[inv] = nNow;
2842 pto->mapAskFor.erase(pto->mapAskFor.begin());
2844 if (!vGetData.empty())
2845 pto->PushMessage("getdata", vGetData);
2864 //////////////////////////////////////////////////////////////////////////////
2869 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2871 unsigned char* pdata = (unsigned char*)pbuffer;
2872 unsigned int blocks = 1 + ((len + 8) / 64);
2873 unsigned char* pend = pdata + 64 * blocks;
2874 memset(pdata + len, 0, 64 * blocks - len);
2876 unsigned int bits = len * 8;
2877 pend[-1] = (bits >> 0) & 0xff;
2878 pend[-2] = (bits >> 8) & 0xff;
2879 pend[-3] = (bits >> 16) & 0xff;
2880 pend[-4] = (bits >> 24) & 0xff;
2884 static const unsigned int pSHA256InitState[8] =
2885 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2887 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2890 unsigned char data[64];
2894 for (int i = 0; i < 16; i++)
2895 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2897 for (int i = 0; i < 8; i++)
2898 ctx.h[i] = ((uint32_t*)pinit)[i];
2900 SHA256_Update(&ctx, data, sizeof(data));
2901 for (int i = 0; i < 8; i++)
2902 ((uint32_t*)pstate)[i] = ctx.h[i];
2906 // ScanHash scans nonces looking for a hash with at least some zero bits.
2907 // It operates on big endian data. Caller does the byte reversing.
2908 // All input buffers are 16-byte aligned. nNonce is usually preserved
2909 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2910 // the block is rebuilt and nNonce starts over at zero.
2912 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2914 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2918 // Hash pdata using pmidstate as the starting state into
2919 // preformatted buffer phash1, then hash phash1 into phash
2921 SHA256Transform(phash1, pdata, pmidstate);
2922 SHA256Transform(phash, phash1, pSHA256InitState);
2924 // Return the nonce if the hash has at least some zero bits,
2925 // caller will check if it has enough to reach the target
2926 if (((unsigned short*)phash)[14] == 0)
2929 // If nothing found after trying for a while, return -1
2930 if ((nNonce & 0xffff) == 0)
2932 nHashesDone = 0xffff+1;
2938 // Some explaining would be appreciated
2943 set<uint256> setDependsOn;
2946 COrphan(CTransaction* ptxIn)
2954 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2955 BOOST_FOREACH(uint256 hash, setDependsOn)
2956 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2961 CBlock* CreateNewBlock(CReserveKey& reservekey)
2963 CBlockIndex* pindexPrev = pindexBest;
2966 auto_ptr<CBlock> pblock(new CBlock());
2970 // Create coinbase tx
2972 txNew.vin.resize(1);
2973 txNew.vin[0].prevout.SetNull();
2974 txNew.vout.resize(1);
2975 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2977 // Add our coinbase tx as first transaction
2978 pblock->vtx.push_back(txNew);
2980 // Collect memory pool transactions into the block
2982 CRITICAL_BLOCK(cs_main)
2983 CRITICAL_BLOCK(cs_mapTransactions)
2987 // Priority order to process transactions
2988 list<COrphan> vOrphan; // list memory doesn't move
2989 map<uint256, vector<COrphan*> > mapDependers;
2990 multimap<double, CTransaction*> mapPriority;
2991 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2993 CTransaction& tx = (*mi).second;
2994 if (tx.IsCoinBase() || !tx.IsFinal())
2997 COrphan* porphan = NULL;
2998 double dPriority = 0;
2999 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3001 // Read prev transaction
3002 CTransaction txPrev;
3004 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3006 // Has to wait for dependencies
3009 // Use list for automatic deletion
3010 vOrphan.push_back(COrphan(&tx));
3011 porphan = &vOrphan.back();
3013 mapDependers[txin.prevout.hash].push_back(porphan);
3014 porphan->setDependsOn.insert(txin.prevout.hash);
3017 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3019 // Read block header
3020 int nConf = txindex.GetDepthInMainChain();
3022 dPriority += (double)nValueIn * nConf;
3024 if (fDebug && GetBoolArg("-printpriority"))
3025 printf("priority nValueIn=%-12"PRI64d" nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3028 // Priority is sum(valuein * age) / txsize
3029 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3032 porphan->dPriority = dPriority;
3034 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3036 if (fDebug && GetBoolArg("-printpriority"))
3038 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3045 // Collect transactions into block
3046 map<uint256, CTxIndex> mapTestPool;
3047 uint64 nBlockSize = 1000;
3048 int nBlockSigOps = 100;
3049 while (!mapPriority.empty())
3051 // Take highest priority transaction off priority queue
3052 double dPriority = -(*mapPriority.begin()).first;
3053 CTransaction& tx = *(*mapPriority.begin()).second;
3054 mapPriority.erase(mapPriority.begin());
3057 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3058 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3061 // Legacy limits on sigOps:
3062 int nTxSigOps = tx.GetSigOpCount();
3063 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3066 // Transaction fee required depends on block size
3067 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3068 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
3070 // Connecting shouldn't fail due to dependency on other memory pool transactions
3071 // because we're already processing them in order of dependency
3072 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3074 MapPrevTx mapInputs;
3075 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3078 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3079 if (nTxFees < nMinFee)
3082 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3083 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3086 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3088 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3089 swap(mapTestPool, mapTestPoolTmp);
3092 pblock->vtx.push_back(tx);
3093 nBlockSize += nTxSize;
3094 nBlockSigOps += nTxSigOps;
3097 // Add transactions that depend on this one to the priority queue
3098 uint256 hash = tx.GetHash();
3099 if (mapDependers.count(hash))
3101 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3103 if (!porphan->setDependsOn.empty())
3105 porphan->setDependsOn.erase(hash);
3106 if (porphan->setDependsOn.empty())
3107 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3113 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3116 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3117 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3118 pblock->UpdateTime(pindexPrev);
3119 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3122 return pblock.release();
3126 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3128 // Update nExtraNonce
3129 static uint256 hashPrevBlock;
3130 if (hashPrevBlock != pblock->hashPrevBlock)
3133 hashPrevBlock = pblock->hashPrevBlock;
3136 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3137 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3141 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3144 // Prebuild hash buffers
3151 uint256 hashPrevBlock;
3152 uint256 hashMerkleRoot;
3155 unsigned int nNonce;
3158 unsigned char pchPadding0[64];
3160 unsigned char pchPadding1[64];
3163 memset(&tmp, 0, sizeof(tmp));
3165 tmp.block.nVersion = pblock->nVersion;
3166 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3167 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3168 tmp.block.nTime = pblock->nTime;
3169 tmp.block.nBits = pblock->nBits;
3170 tmp.block.nNonce = pblock->nNonce;
3172 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3173 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3175 // Byte swap all the input buffer
3176 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
3177 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3179 // Precalc the first half of the first hash, which stays constant
3180 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3182 memcpy(pdata, &tmp.block, 128);
3183 memcpy(phash1, &tmp.hash1, 64);
3187 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3189 uint256 hash = pblock->GetHash();
3190 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3192 if (hash > hashTarget)
3196 printf("BitcoinMiner:\n");
3197 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3199 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3200 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3203 CRITICAL_BLOCK(cs_main)
3205 if (pblock->hashPrevBlock != hashBestChain)
3206 return error("BitcoinMiner : generated block is stale");
3208 // Remove key from key pool
3209 reservekey.KeepKey();
3211 // Track how many getdata requests this block gets
3212 CRITICAL_BLOCK(wallet.cs_wallet)
3213 wallet.mapRequestCount[pblock->GetHash()] = 0;
3215 // Process this block the same as if we had received it from another node
3216 if (!ProcessBlock(NULL, pblock))
3217 return error("BitcoinMiner : ProcessBlock, block not accepted");
3223 void static ThreadBitcoinMiner(void* parg);
3225 void static BitcoinMiner(CWallet *pwallet)
3227 printf("BitcoinMiner started\n");
3228 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3230 // Each thread has its own key and counter
3231 CReserveKey reservekey(pwallet);
3232 unsigned int nExtraNonce = 0;
3234 while (fGenerateBitcoins)
3236 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3240 while (vNodes.empty() || IsInitialBlockDownload())
3245 if (!fGenerateBitcoins)
3253 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3254 CBlockIndex* pindexPrev = pindexBest;
3256 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3259 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3261 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3265 // Prebuild hash buffers
3267 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3268 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3269 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3271 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3273 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3274 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3275 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3281 int64 nStart = GetTime();
3282 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3284 uint256& hash = *alignup<16>(hashbuf);
3287 unsigned int nHashesDone = 0;
3288 unsigned int nNonceFound;
3291 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3292 (char*)&hash, nHashesDone);
3294 // Check if something found
3295 if (nNonceFound != -1)
3297 for (unsigned int i = 0; i < sizeof(hash)/4; i++)
3298 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3300 if (hash <= hashTarget)
3303 pblock->nNonce = ByteReverse(nNonceFound);
3304 assert(hash == pblock->GetHash());
3306 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3307 CheckWork(pblock.get(), *pwalletMain, reservekey);
3308 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3314 static int64 nHashCounter;
3315 if (nHPSTimerStart == 0)
3317 nHPSTimerStart = GetTimeMillis();
3321 nHashCounter += nHashesDone;
3322 if (GetTimeMillis() - nHPSTimerStart > 4000)
3324 static CCriticalSection cs;
3327 if (GetTimeMillis() - nHPSTimerStart > 4000)
3329 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3330 nHPSTimerStart = GetTimeMillis();
3332 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3333 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3334 static int64 nLogTime;
3335 if (GetTime() - nLogTime > 30 * 60)
3337 nLogTime = GetTime();
3338 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3339 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3345 // Check for stop or if block needs to be rebuilt
3348 if (!fGenerateBitcoins)
3350 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3354 if (nBlockNonce >= 0xffff0000)
3356 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3358 if (pindexPrev != pindexBest)
3361 // Update nTime every few seconds
3362 pblock->UpdateTime(pindexPrev);
3363 nBlockTime = ByteReverse(pblock->nTime);
3366 // Changing pblock->nTime can change work required on testnet:
3367 nBlockBits = ByteReverse(pblock->nBits);
3368 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3374 void static ThreadBitcoinMiner(void* parg)
3376 CWallet* pwallet = (CWallet*)parg;
3379 vnThreadsRunning[3]++;
3380 BitcoinMiner(pwallet);
3381 vnThreadsRunning[3]--;
3383 catch (std::exception& e) {
3384 vnThreadsRunning[3]--;
3385 PrintException(&e, "ThreadBitcoinMiner()");
3387 vnThreadsRunning[3]--;
3388 PrintException(NULL, "ThreadBitcoinMiner()");
3390 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3392 if (vnThreadsRunning[3] == 0)
3394 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3398 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3400 if (fGenerateBitcoins != fGenerate)
3402 fGenerateBitcoins = fGenerate;
3403 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3406 if (fGenerateBitcoins)
3408 int nProcessors = boost::thread::hardware_concurrency();
3409 printf("%d processors\n", nProcessors);
3410 if (nProcessors < 1)
3412 if (fLimitProcessors && nProcessors > nLimitProcessors)
3413 nProcessors = nLimitProcessors;
3414 int nAddThreads = nProcessors - vnThreadsRunning[3];
3415 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3416 for (int i = 0; i < nAddThreads; i++)
3418 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3419 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");