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 (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 (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 (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 (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 (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 (int i = 0; i < vin.size(); i++)
984 nResult += GetOutputFor(vin[i], inputs).nValue;
990 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
996 for (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 (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 (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))
1172 BOOST_FOREACH(CTransaction& tx, vtx)
1174 CTxIndex txindexOld;
1175 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1176 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1181 // P2SH didn't become active until Apr 1 2012 (Feb 15 on testnet)
1182 int64 nEvalSwitchTime = fTestNet ? 1329264000 : 1333238400;
1183 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1185 //// issue here: it doesn't know the version
1186 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1188 map<uint256, CTxIndex> mapQueuedChanges;
1191 BOOST_FOREACH(CTransaction& tx, vtx)
1193 nSigOps += tx.GetSigOpCount();
1194 if (nSigOps > MAX_BLOCK_SIGOPS)
1195 return DoS(100, error("ConnectBlock() : too many sigops"));
1197 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1198 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1201 MapPrevTx mapInputs;
1202 if (!tx.IsCoinBase())
1204 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1207 if (fStrictPayToScriptHash)
1209 // Add in sigops done by pay-to-script-hash inputs;
1210 // this is to prevent a "rogue miner" from creating
1211 // an incredibly-expensive-to-validate block.
1212 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1213 if (nSigOps > MAX_BLOCK_SIGOPS)
1214 return DoS(100, error("ConnectBlock() : too many sigops"));
1217 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1219 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1223 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1226 // Write queued txindex changes
1227 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1229 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1230 return error("ConnectBlock() : UpdateTxIndex failed");
1233 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1236 // Update block index on disk without changing it in memory.
1237 // The memory index structure will be changed after the db commits.
1240 CDiskBlockIndex blockindexPrev(pindex->pprev);
1241 blockindexPrev.hashNext = pindex->GetBlockHash();
1242 if (!txdb.WriteBlockIndex(blockindexPrev))
1243 return error("ConnectBlock() : WriteBlockIndex failed");
1246 // Watch for transactions paying to me
1247 BOOST_FOREACH(CTransaction& tx, vtx)
1248 SyncWithWallets(tx, this, true);
1253 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1255 printf("REORGANIZE\n");
1258 CBlockIndex* pfork = pindexBest;
1259 CBlockIndex* plonger = pindexNew;
1260 while (pfork != plonger)
1262 while (plonger->nHeight > pfork->nHeight)
1263 if (!(plonger = plonger->pprev))
1264 return error("Reorganize() : plonger->pprev is null");
1265 if (pfork == plonger)
1267 if (!(pfork = pfork->pprev))
1268 return error("Reorganize() : pfork->pprev is null");
1271 // List of what to disconnect
1272 vector<CBlockIndex*> vDisconnect;
1273 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1274 vDisconnect.push_back(pindex);
1276 // List of what to connect
1277 vector<CBlockIndex*> vConnect;
1278 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1279 vConnect.push_back(pindex);
1280 reverse(vConnect.begin(), vConnect.end());
1282 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());
1283 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());
1285 // Disconnect shorter branch
1286 vector<CTransaction> vResurrect;
1287 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1290 if (!block.ReadFromDisk(pindex))
1291 return error("Reorganize() : ReadFromDisk for disconnect failed");
1292 if (!block.DisconnectBlock(txdb, pindex))
1293 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1295 // Queue memory transactions to resurrect
1296 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1297 if (!tx.IsCoinBase())
1298 vResurrect.push_back(tx);
1301 // Connect longer branch
1302 vector<CTransaction> vDelete;
1303 for (int i = 0; i < vConnect.size(); i++)
1305 CBlockIndex* pindex = vConnect[i];
1307 if (!block.ReadFromDisk(pindex))
1308 return error("Reorganize() : ReadFromDisk for connect failed");
1309 if (!block.ConnectBlock(txdb, pindex))
1313 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1316 // Queue memory transactions to delete
1317 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1318 vDelete.push_back(tx);
1320 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1321 return error("Reorganize() : WriteHashBestChain failed");
1323 // Make sure it's successfully written to disk before changing memory structure
1324 if (!txdb.TxnCommit())
1325 return error("Reorganize() : TxnCommit failed");
1327 // Disconnect shorter branch
1328 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1330 pindex->pprev->pnext = NULL;
1332 // Connect longer branch
1333 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1335 pindex->pprev->pnext = pindex;
1337 // Resurrect memory transactions that were in the disconnected branch
1338 BOOST_FOREACH(CTransaction& tx, vResurrect)
1339 tx.AcceptToMemoryPool(txdb, false);
1341 // Delete redundant memory transactions that are in the connected branch
1342 BOOST_FOREACH(CTransaction& tx, vDelete)
1343 tx.RemoveFromMemoryPool();
1345 printf("REORGANIZE: done\n");
1351 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1353 uint256 hash = GetHash();
1356 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1358 txdb.WriteHashBestChain(hash);
1359 if (!txdb.TxnCommit())
1360 return error("SetBestChain() : TxnCommit failed");
1361 pindexGenesisBlock = pindexNew;
1363 else if (hashPrevBlock == hashBestChain)
1365 // Adding to current best branch
1366 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1369 InvalidChainFound(pindexNew);
1370 return error("SetBestChain() : ConnectBlock failed");
1372 if (!txdb.TxnCommit())
1373 return error("SetBestChain() : TxnCommit failed");
1375 // Add to current best branch
1376 pindexNew->pprev->pnext = pindexNew;
1378 // Delete redundant memory transactions
1379 BOOST_FOREACH(CTransaction& tx, vtx)
1380 tx.RemoveFromMemoryPool();
1385 if (!Reorganize(txdb, pindexNew))
1388 InvalidChainFound(pindexNew);
1389 return error("SetBestChain() : Reorganize failed");
1393 // Update best block in wallet (so we can detect restored wallets)
1394 if (!IsInitialBlockDownload())
1396 const CBlockLocator locator(pindexNew);
1397 ::SetBestChain(locator);
1401 hashBestChain = hash;
1402 pindexBest = pindexNew;
1403 nBestHeight = pindexBest->nHeight;
1404 bnBestChainWork = pindexNew->bnChainWork;
1405 nTimeBestReceived = GetTime();
1406 nTransactionsUpdated++;
1407 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1413 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1415 // Check for duplicate
1416 uint256 hash = GetHash();
1417 if (mapBlockIndex.count(hash))
1418 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1420 // Construct new block index object
1421 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1423 return error("AddToBlockIndex() : new CBlockIndex failed");
1424 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1425 pindexNew->phashBlock = &((*mi).first);
1426 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1427 if (miPrev != mapBlockIndex.end())
1429 pindexNew->pprev = (*miPrev).second;
1430 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1432 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1436 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1437 if (!txdb.TxnCommit())
1441 if (pindexNew->bnChainWork > bnBestChainWork)
1442 if (!SetBestChain(txdb, pindexNew))
1447 if (pindexNew == pindexBest)
1449 // Notify UI to display prev block's coinbase if it was ours
1450 static uint256 hashPrevBestCoinBase;
1451 UpdatedTransaction(hashPrevBestCoinBase);
1452 hashPrevBestCoinBase = vtx[0].GetHash();
1462 bool CBlock::CheckBlock() const
1464 // These are checks that are independent of context
1465 // that can be verified before saving an orphan block.
1468 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1469 return DoS(100, error("CheckBlock() : size limits failed"));
1471 // Check proof of work matches claimed amount
1472 if (!CheckProofOfWork(GetHash(), nBits))
1473 return DoS(50, error("CheckBlock() : proof of work failed"));
1476 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1477 return error("CheckBlock() : block timestamp too far in the future");
1479 // First transaction must be coinbase, the rest must not be
1480 if (vtx.empty() || !vtx[0].IsCoinBase())
1481 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1482 for (int i = 1; i < vtx.size(); i++)
1483 if (vtx[i].IsCoinBase())
1484 return DoS(100, error("CheckBlock() : more than one coinbase"));
1486 // Check transactions
1487 BOOST_FOREACH(const CTransaction& tx, vtx)
1488 if (!tx.CheckTransaction())
1489 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1491 // Check that it's not full of nonstandard transactions
1492 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1493 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1496 if (hashMerkleRoot != BuildMerkleTree())
1497 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1502 bool CBlock::AcceptBlock()
1504 // Check for duplicate
1505 uint256 hash = GetHash();
1506 if (mapBlockIndex.count(hash))
1507 return error("AcceptBlock() : block already in mapBlockIndex");
1509 // Get prev block index
1510 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1511 if (mi == mapBlockIndex.end())
1512 return DoS(10, error("AcceptBlock() : prev block not found"));
1513 CBlockIndex* pindexPrev = (*mi).second;
1514 int nHeight = pindexPrev->nHeight+1;
1516 // Check proof of work
1517 if (nBits != GetNextWorkRequired(pindexPrev, this))
1518 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1520 // Check timestamp against prev
1521 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1522 return error("AcceptBlock() : block's timestamp is too early");
1524 // Check that all transactions are finalized
1525 BOOST_FOREACH(const CTransaction& tx, vtx)
1526 if (!tx.IsFinal(nHeight, GetBlockTime()))
1527 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1529 // Check that the block chain matches the known block chain up to a checkpoint
1530 if (!Checkpoints::CheckBlock(nHeight, hash))
1531 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1533 // Write block to history file
1534 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1535 return error("AcceptBlock() : out of disk space");
1536 unsigned int nFile = -1;
1537 unsigned int nBlockPos = 0;
1538 if (!WriteToDisk(nFile, nBlockPos))
1539 return error("AcceptBlock() : WriteToDisk failed");
1540 if (!AddToBlockIndex(nFile, nBlockPos))
1541 return error("AcceptBlock() : AddToBlockIndex failed");
1543 // Relay inventory, but don't relay old inventory during initial block download
1544 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1545 if (hashBestChain == hash)
1546 CRITICAL_BLOCK(cs_vNodes)
1547 BOOST_FOREACH(CNode* pnode, vNodes)
1548 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1549 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1554 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1556 // Check for duplicate
1557 uint256 hash = pblock->GetHash();
1558 if (mapBlockIndex.count(hash))
1559 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1560 if (mapOrphanBlocks.count(hash))
1561 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1563 // Preliminary checks
1564 if (!pblock->CheckBlock())
1565 return error("ProcessBlock() : CheckBlock FAILED");
1567 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1568 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1570 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1571 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1575 pfrom->Misbehaving(100);
1576 return error("ProcessBlock() : block with timestamp before last checkpoint");
1579 bnNewBlock.SetCompact(pblock->nBits);
1581 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1582 if (bnNewBlock > bnRequired)
1585 pfrom->Misbehaving(100);
1586 return error("ProcessBlock() : block with too little proof-of-work");
1591 // If don't already have its previous block, shunt it off to holding area until we get it
1592 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1594 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1595 CBlock* pblock2 = new CBlock(*pblock);
1596 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1597 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1599 // Ask this guy to fill in what we're missing
1601 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1606 if (!pblock->AcceptBlock())
1607 return error("ProcessBlock() : AcceptBlock FAILED");
1609 // Recursively process any orphan blocks that depended on this one
1610 vector<uint256> vWorkQueue;
1611 vWorkQueue.push_back(hash);
1612 for (int i = 0; i < vWorkQueue.size(); i++)
1614 uint256 hashPrev = vWorkQueue[i];
1615 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1616 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1619 CBlock* pblockOrphan = (*mi).second;
1620 if (pblockOrphan->AcceptBlock())
1621 vWorkQueue.push_back(pblockOrphan->GetHash());
1622 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1623 delete pblockOrphan;
1625 mapOrphanBlocksByPrev.erase(hashPrev);
1628 printf("ProcessBlock: ACCEPTED\n");
1639 bool CheckDiskSpace(uint64 nAdditionalBytes)
1641 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1643 // Check for 15MB because database could create another 10MB log file at any time
1644 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1647 string strMessage = _("Warning: Disk space is low ");
1648 strMiscWarning = strMessage;
1649 printf("*** %s\n", strMessage.c_str());
1650 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1651 CreateThread(Shutdown, NULL);
1657 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1661 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1664 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1666 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1675 static unsigned int nCurrentBlockFile = 1;
1677 FILE* AppendBlockFile(unsigned int& nFileRet)
1682 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1685 if (fseek(file, 0, SEEK_END) != 0)
1687 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1688 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1690 nFileRet = nCurrentBlockFile;
1694 nCurrentBlockFile++;
1698 bool LoadBlockIndex(bool fAllowNew)
1702 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1703 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1704 pchMessageStart[0] = 0xfa;
1705 pchMessageStart[1] = 0xbf;
1706 pchMessageStart[2] = 0xb5;
1707 pchMessageStart[3] = 0xda;
1714 if (!txdb.LoadBlockIndex())
1719 // Init with genesis block
1721 if (mapBlockIndex.empty())
1727 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1728 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1729 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1730 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1731 // vMerkleTree: 4a5e1e
1734 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1736 txNew.vin.resize(1);
1737 txNew.vout.resize(1);
1738 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1739 txNew.vout[0].nValue = 50 * COIN;
1740 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1742 block.vtx.push_back(txNew);
1743 block.hashPrevBlock = 0;
1744 block.hashMerkleRoot = block.BuildMerkleTree();
1746 block.nTime = 1231006505;
1747 block.nBits = 0x1d00ffff;
1748 block.nNonce = 2083236893;
1752 block.nTime = 1296688602;
1753 block.nBits = 0x1d07fff8;
1754 block.nNonce = 384568319;
1758 printf("%s\n", block.GetHash().ToString().c_str());
1759 printf("%s\n", hashGenesisBlock.ToString().c_str());
1760 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1761 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1763 assert(block.GetHash() == hashGenesisBlock);
1765 // Start new block file
1767 unsigned int nBlockPos;
1768 if (!block.WriteToDisk(nFile, nBlockPos))
1769 return error("LoadBlockIndex() : writing genesis block to disk failed");
1770 if (!block.AddToBlockIndex(nFile, nBlockPos))
1771 return error("LoadBlockIndex() : genesis block not accepted");
1779 void PrintBlockTree()
1781 // precompute tree structure
1782 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1783 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1785 CBlockIndex* pindex = (*mi).second;
1786 mapNext[pindex->pprev].push_back(pindex);
1788 //while (rand() % 3 == 0)
1789 // mapNext[pindex->pprev].push_back(pindex);
1792 vector<pair<int, CBlockIndex*> > vStack;
1793 vStack.push_back(make_pair(0, pindexGenesisBlock));
1796 while (!vStack.empty())
1798 int nCol = vStack.back().first;
1799 CBlockIndex* pindex = vStack.back().second;
1802 // print split or gap
1803 if (nCol > nPrevCol)
1805 for (int i = 0; i < nCol-1; i++)
1809 else if (nCol < nPrevCol)
1811 for (int i = 0; i < nCol; i++)
1818 for (int i = 0; i < nCol; i++)
1823 block.ReadFromDisk(pindex);
1824 printf("%d (%u,%u) %s %s tx %d",
1828 block.GetHash().ToString().substr(0,20).c_str(),
1829 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1832 PrintWallets(block);
1834 // put the main timechain first
1835 vector<CBlockIndex*>& vNext = mapNext[pindex];
1836 for (int i = 0; i < vNext.size(); i++)
1838 if (vNext[i]->pnext)
1840 swap(vNext[0], vNext[i]);
1846 for (int i = 0; i < vNext.size(); i++)
1847 vStack.push_back(make_pair(nCol+i, vNext[i]));
1860 //////////////////////////////////////////////////////////////////////////////
1865 map<uint256, CAlert> mapAlerts;
1866 CCriticalSection cs_mapAlerts;
1868 string GetWarnings(string strFor)
1871 string strStatusBar;
1873 if (GetBoolArg("-testsafemode"))
1876 // Misc warnings like out of disk space and clock is wrong
1877 if (strMiscWarning != "")
1880 strStatusBar = strMiscWarning;
1883 // Longer invalid proof-of-work chain
1884 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1887 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1891 CRITICAL_BLOCK(cs_mapAlerts)
1893 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1895 const CAlert& alert = item.second;
1896 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1898 nPriority = alert.nPriority;
1899 strStatusBar = alert.strStatusBar;
1904 if (strFor == "statusbar")
1905 return strStatusBar;
1906 else if (strFor == "rpc")
1908 assert(!"GetWarnings() : invalid parameter");
1912 bool CAlert::ProcessAlert()
1914 if (!CheckSignature())
1919 CRITICAL_BLOCK(cs_mapAlerts)
1921 // Cancel previous alerts
1922 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1924 const CAlert& alert = (*mi).second;
1927 printf("cancelling alert %d\n", alert.nID);
1928 mapAlerts.erase(mi++);
1930 else if (!alert.IsInEffect())
1932 printf("expiring alert %d\n", alert.nID);
1933 mapAlerts.erase(mi++);
1939 // Check if this alert has been cancelled
1940 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1942 const CAlert& alert = item.second;
1943 if (alert.Cancels(*this))
1945 printf("alert already cancelled by %d\n", alert.nID);
1951 mapAlerts.insert(make_pair(GetHash(), *this));
1954 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1966 //////////////////////////////////////////////////////////////////////////////
1972 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1976 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1977 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1979 // Don't know what it is, just say we already got one
1986 // The message start string is designed to be unlikely to occur in normal data.
1987 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1988 // a large 4-byte int at any alignment.
1989 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1992 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1994 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1995 RandAddSeedPerfmon();
1997 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1998 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2000 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2002 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2010 if (strCommand == "version")
2012 // Each connection can only send one version message
2013 if (pfrom->nVersion != 0)
2015 pfrom->Misbehaving(1);
2023 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2024 if (pfrom->nVersion == 10300)
2025 pfrom->nVersion = 300;
2026 if (pfrom->nVersion >= 106 && !vRecv.empty())
2027 vRecv >> addrFrom >> nNonce;
2028 if (pfrom->nVersion >= 106 && !vRecv.empty())
2029 vRecv >> pfrom->strSubVer;
2030 if (pfrom->nVersion >= 209 && !vRecv.empty())
2031 vRecv >> pfrom->nStartingHeight;
2033 if (pfrom->nVersion == 0)
2036 // Disconnect if we connected to ourself
2037 if (nNonce == nLocalHostNonce && nNonce > 1)
2039 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2040 pfrom->fDisconnect = true;
2044 // Be shy and don't send version until we hear
2045 if (pfrom->fInbound)
2046 pfrom->PushVersion();
2048 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2050 AddTimeData(pfrom->addr.ip, nTime);
2053 if (pfrom->nVersion >= 209)
2054 pfrom->PushMessage("verack");
2055 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2056 if (pfrom->nVersion < 209)
2057 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2059 if (!pfrom->fInbound)
2061 // Advertise our address
2062 if (addrLocalHost.IsRoutable() && !fUseProxy)
2064 CAddress addr(addrLocalHost);
2065 addr.nTime = GetAdjustedTime();
2066 pfrom->PushAddress(addr);
2069 // Get recent addresses
2070 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2072 pfrom->PushMessage("getaddr");
2073 pfrom->fGetAddr = true;
2077 // Ask the first connected node for block updates
2078 static int nAskedForBlocks = 0;
2079 if (!pfrom->fClient &&
2080 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2081 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2084 pfrom->PushGetBlocks(pindexBest, uint256(0));
2088 CRITICAL_BLOCK(cs_mapAlerts)
2089 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2090 item.second.RelayTo(pfrom);
2092 pfrom->fSuccessfullyConnected = true;
2094 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2096 cPeerBlockCounts.input(pfrom->nStartingHeight);
2100 else if (pfrom->nVersion == 0)
2102 // Must have a version message before anything else
2103 pfrom->Misbehaving(1);
2108 else if (strCommand == "verack")
2110 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2114 else if (strCommand == "addr")
2116 vector<CAddress> vAddr;
2119 // Don't want addr from older versions unless seeding
2120 if (pfrom->nVersion < 209)
2122 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2124 if (vAddr.size() > 1000)
2126 pfrom->Misbehaving(20);
2127 return error("message addr size() = %d", vAddr.size());
2130 // Store the new addresses
2133 int64 nNow = GetAdjustedTime();
2134 int64 nSince = nNow - 10 * 60;
2135 BOOST_FOREACH(CAddress& addr, vAddr)
2139 // ignore IPv6 for now, since it isn't implemented anyway
2142 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2143 addr.nTime = nNow - 5 * 24 * 60 * 60;
2144 AddAddress(addr, 2 * 60 * 60, &addrDB);
2145 pfrom->AddAddressKnown(addr);
2146 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2148 // Relay to a limited number of other nodes
2149 CRITICAL_BLOCK(cs_vNodes)
2151 // Use deterministic randomness to send to the same nodes for 24 hours
2152 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2153 static uint256 hashSalt;
2155 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2156 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2157 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2158 multimap<uint256, CNode*> mapMix;
2159 BOOST_FOREACH(CNode* pnode, vNodes)
2161 if (pnode->nVersion < 31402)
2163 unsigned int nPointer;
2164 memcpy(&nPointer, &pnode, sizeof(nPointer));
2165 uint256 hashKey = hashRand ^ nPointer;
2166 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2167 mapMix.insert(make_pair(hashKey, pnode));
2169 int nRelayNodes = 2;
2170 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2171 ((*mi).second)->PushAddress(addr);
2175 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2176 if (vAddr.size() < 1000)
2177 pfrom->fGetAddr = false;
2181 else if (strCommand == "inv")
2185 if (vInv.size() > 50000)
2187 pfrom->Misbehaving(20);
2188 return error("message inv size() = %d", vInv.size());
2192 BOOST_FOREACH(const CInv& inv, vInv)
2196 pfrom->AddInventoryKnown(inv);
2198 bool fAlreadyHave = AlreadyHave(txdb, inv);
2200 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2204 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2205 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2207 // Track requests for our stuff
2208 Inventory(inv.hash);
2213 else if (strCommand == "getdata")
2217 if (vInv.size() > 50000)
2219 pfrom->Misbehaving(20);
2220 return error("message getdata size() = %d", vInv.size());
2223 BOOST_FOREACH(const CInv& inv, vInv)
2227 printf("received getdata for: %s\n", inv.ToString().c_str());
2229 if (inv.type == MSG_BLOCK)
2231 // Send block from disk
2232 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2233 if (mi != mapBlockIndex.end())
2236 block.ReadFromDisk((*mi).second);
2237 pfrom->PushMessage("block", block);
2239 // Trigger them to send a getblocks request for the next batch of inventory
2240 if (inv.hash == pfrom->hashContinue)
2242 // Bypass PushInventory, this must send even if redundant,
2243 // and we want it right after the last block so they don't
2244 // wait for other stuff first.
2246 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2247 pfrom->PushMessage("inv", vInv);
2248 pfrom->hashContinue = 0;
2252 else if (inv.IsKnownType())
2254 // Send stream from relay memory
2255 CRITICAL_BLOCK(cs_mapRelay)
2257 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2258 if (mi != mapRelay.end())
2259 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2263 // Track requests for our stuff
2264 Inventory(inv.hash);
2269 else if (strCommand == "getblocks")
2271 CBlockLocator locator;
2273 vRecv >> locator >> hashStop;
2275 // Find the last block the caller has in the main chain
2276 CBlockIndex* pindex = locator.GetBlockIndex();
2278 // Send the rest of the chain
2280 pindex = pindex->pnext;
2281 int nLimit = 500 + locator.GetDistanceBack();
2282 unsigned int nBytes = 0;
2283 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2284 for (; pindex; pindex = pindex->pnext)
2286 if (pindex->GetBlockHash() == hashStop)
2288 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2291 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2293 block.ReadFromDisk(pindex, true);
2294 nBytes += block.GetSerializeSize(SER_NETWORK);
2295 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2297 // When this block is requested, we'll send an inv that'll make them
2298 // getblocks the next batch of inventory.
2299 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2300 pfrom->hashContinue = pindex->GetBlockHash();
2307 else if (strCommand == "getheaders")
2309 CBlockLocator locator;
2311 vRecv >> locator >> hashStop;
2313 CBlockIndex* pindex = NULL;
2314 if (locator.IsNull())
2316 // If locator is null, return the hashStop block
2317 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2318 if (mi == mapBlockIndex.end())
2320 pindex = (*mi).second;
2324 // Find the last block the caller has in the main chain
2325 pindex = locator.GetBlockIndex();
2327 pindex = pindex->pnext;
2330 vector<CBlock> vHeaders;
2331 int nLimit = 2000 + locator.GetDistanceBack();
2332 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2333 for (; pindex; pindex = pindex->pnext)
2335 vHeaders.push_back(pindex->GetBlockHeader());
2336 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2339 pfrom->PushMessage("headers", vHeaders);
2343 else if (strCommand == "tx")
2345 vector<uint256> vWorkQueue;
2346 CDataStream vMsg(vRecv);
2350 CInv inv(MSG_TX, tx.GetHash());
2351 pfrom->AddInventoryKnown(inv);
2353 bool fMissingInputs = false;
2354 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2356 SyncWithWallets(tx, NULL, true);
2357 RelayMessage(inv, vMsg);
2358 mapAlreadyAskedFor.erase(inv);
2359 vWorkQueue.push_back(inv.hash);
2361 // Recursively process any orphan transactions that depended on this one
2362 for (int i = 0; i < vWorkQueue.size(); i++)
2364 uint256 hashPrev = vWorkQueue[i];
2365 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2366 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2369 const CDataStream& vMsg = *((*mi).second);
2371 CDataStream(vMsg) >> tx;
2372 CInv inv(MSG_TX, tx.GetHash());
2374 if (tx.AcceptToMemoryPool(true))
2376 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2377 SyncWithWallets(tx, NULL, true);
2378 RelayMessage(inv, vMsg);
2379 mapAlreadyAskedFor.erase(inv);
2380 vWorkQueue.push_back(inv.hash);
2385 BOOST_FOREACH(uint256 hash, vWorkQueue)
2386 EraseOrphanTx(hash);
2388 else if (fMissingInputs)
2390 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2393 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2394 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2396 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2398 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2402 else if (strCommand == "block")
2407 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2410 CInv inv(MSG_BLOCK, block.GetHash());
2411 pfrom->AddInventoryKnown(inv);
2413 if (ProcessBlock(pfrom, &block))
2414 mapAlreadyAskedFor.erase(inv);
2415 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2419 else if (strCommand == "getaddr")
2421 // Nodes rebroadcast an addr every 24 hours
2422 pfrom->vAddrToSend.clear();
2423 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2424 CRITICAL_BLOCK(cs_mapAddresses)
2426 unsigned int nCount = 0;
2427 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2429 const CAddress& addr = item.second;
2430 if (addr.nTime > nSince)
2433 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2435 const CAddress& addr = item.second;
2436 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2437 pfrom->PushAddress(addr);
2443 else if (strCommand == "checkorder")
2448 if (!GetBoolArg("-allowreceivebyip"))
2450 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2457 /// we have a chance to check the order here
2459 // Keep giving the same key to the same ip until they use it
2460 if (!mapReuseKey.count(pfrom->addr.ip))
2461 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2463 // Send back approval of order and pubkey to use
2464 CScript scriptPubKey;
2465 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2466 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2470 else if (strCommand == "reply")
2475 CRequestTracker tracker;
2476 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2478 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2479 if (mi != pfrom->mapRequests.end())
2481 tracker = (*mi).second;
2482 pfrom->mapRequests.erase(mi);
2485 if (!tracker.IsNull())
2486 tracker.fn(tracker.param1, vRecv);
2490 else if (strCommand == "ping")
2495 else if (strCommand == "alert")
2500 if (alert.ProcessAlert())
2503 pfrom->setKnown.insert(alert.GetHash());
2504 CRITICAL_BLOCK(cs_vNodes)
2505 BOOST_FOREACH(CNode* pnode, vNodes)
2506 alert.RelayTo(pnode);
2513 // Ignore unknown commands for extensibility
2517 // Update the last seen time for this node's address
2518 if (pfrom->fNetworkNode)
2519 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2520 AddressCurrentlyConnected(pfrom->addr);
2526 bool ProcessMessages(CNode* pfrom)
2528 CDataStream& vRecv = pfrom->vRecv;
2532 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2536 // (4) message start
2545 // Scan for message start
2546 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2547 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2548 if (vRecv.end() - pstart < nHeaderSize)
2550 if (vRecv.size() > nHeaderSize)
2552 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2553 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2557 if (pstart - vRecv.begin() > 0)
2558 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2559 vRecv.erase(vRecv.begin(), pstart);
2562 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2567 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2570 string strCommand = hdr.GetCommand();
2573 unsigned int nMessageSize = hdr.nMessageSize;
2574 if (nMessageSize > MAX_SIZE)
2576 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2579 if (nMessageSize > vRecv.size())
2581 // Rewind and wait for rest of message
2582 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2587 if (vRecv.GetVersion() >= 209)
2589 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2590 unsigned int nChecksum = 0;
2591 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2592 if (nChecksum != hdr.nChecksum)
2594 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2595 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2600 // Copy message to its own buffer
2601 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2602 vRecv.ignore(nMessageSize);
2608 CRITICAL_BLOCK(cs_main)
2609 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2613 catch (std::ios_base::failure& e)
2615 if (strstr(e.what(), "end of data"))
2617 // Allow exceptions from underlength message on vRecv
2618 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());
2620 else if (strstr(e.what(), "size too large"))
2622 // Allow exceptions from overlong size
2623 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2627 PrintExceptionContinue(&e, "ProcessMessage()");
2630 catch (std::exception& e) {
2631 PrintExceptionContinue(&e, "ProcessMessage()");
2633 PrintExceptionContinue(NULL, "ProcessMessage()");
2637 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2645 bool SendMessages(CNode* pto, bool fSendTrickle)
2647 CRITICAL_BLOCK(cs_main)
2649 // Don't send anything until we get their version message
2650 if (pto->nVersion == 0)
2654 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2655 pto->PushMessage("ping");
2657 // Resend wallet transactions that haven't gotten in a block yet
2658 ResendWalletTransactions();
2660 // Address refresh broadcast
2661 static int64 nLastRebroadcast;
2662 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2664 nLastRebroadcast = GetTime();
2665 CRITICAL_BLOCK(cs_vNodes)
2667 BOOST_FOREACH(CNode* pnode, vNodes)
2669 // Periodically clear setAddrKnown to allow refresh broadcasts
2670 pnode->setAddrKnown.clear();
2672 // Rebroadcast our address
2673 if (addrLocalHost.IsRoutable() && !fUseProxy)
2675 CAddress addr(addrLocalHost);
2676 addr.nTime = GetAdjustedTime();
2677 pnode->PushAddress(addr);
2683 // Clear out old addresses periodically so it's not too much work at once
2684 static int64 nLastClear;
2685 if (nLastClear == 0)
2686 nLastClear = GetTime();
2687 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2689 nLastClear = GetTime();
2690 CRITICAL_BLOCK(cs_mapAddresses)
2693 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2694 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2695 mi != mapAddresses.end();)
2697 const CAddress& addr = (*mi).second;
2698 if (addr.nTime < nSince)
2700 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2702 addrdb.EraseAddress(addr);
2703 mapAddresses.erase(mi++);
2717 vector<CAddress> vAddr;
2718 vAddr.reserve(pto->vAddrToSend.size());
2719 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2721 // returns true if wasn't already contained in the set
2722 if (pto->setAddrKnown.insert(addr).second)
2724 vAddr.push_back(addr);
2725 // receiver rejects addr messages larger than 1000
2726 if (vAddr.size() >= 1000)
2728 pto->PushMessage("addr", vAddr);
2733 pto->vAddrToSend.clear();
2735 pto->PushMessage("addr", vAddr);
2740 // Message: inventory
2743 vector<CInv> vInvWait;
2744 CRITICAL_BLOCK(pto->cs_inventory)
2746 vInv.reserve(pto->vInventoryToSend.size());
2747 vInvWait.reserve(pto->vInventoryToSend.size());
2748 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2750 if (pto->setInventoryKnown.count(inv))
2753 // trickle out tx inv to protect privacy
2754 if (inv.type == MSG_TX && !fSendTrickle)
2756 // 1/4 of tx invs blast to all immediately
2757 static uint256 hashSalt;
2759 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2760 uint256 hashRand = inv.hash ^ hashSalt;
2761 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2762 bool fTrickleWait = ((hashRand & 3) != 0);
2764 // always trickle our own transactions
2768 if (GetTransaction(inv.hash, wtx))
2770 fTrickleWait = true;
2775 vInvWait.push_back(inv);
2780 // returns true if wasn't already contained in the set
2781 if (pto->setInventoryKnown.insert(inv).second)
2783 vInv.push_back(inv);
2784 if (vInv.size() >= 1000)
2786 pto->PushMessage("inv", vInv);
2791 pto->vInventoryToSend = vInvWait;
2794 pto->PushMessage("inv", vInv);
2800 vector<CInv> vGetData;
2801 int64 nNow = GetTime() * 1000000;
2803 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2805 const CInv& inv = (*pto->mapAskFor.begin()).second;
2806 if (!AlreadyHave(txdb, inv))
2808 printf("sending getdata: %s\n", inv.ToString().c_str());
2809 vGetData.push_back(inv);
2810 if (vGetData.size() >= 1000)
2812 pto->PushMessage("getdata", vGetData);
2816 mapAlreadyAskedFor[inv] = nNow;
2817 pto->mapAskFor.erase(pto->mapAskFor.begin());
2819 if (!vGetData.empty())
2820 pto->PushMessage("getdata", vGetData);
2839 //////////////////////////////////////////////////////////////////////////////
2844 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2846 unsigned char* pdata = (unsigned char*)pbuffer;
2847 unsigned int blocks = 1 + ((len + 8) / 64);
2848 unsigned char* pend = pdata + 64 * blocks;
2849 memset(pdata + len, 0, 64 * blocks - len);
2851 unsigned int bits = len * 8;
2852 pend[-1] = (bits >> 0) & 0xff;
2853 pend[-2] = (bits >> 8) & 0xff;
2854 pend[-3] = (bits >> 16) & 0xff;
2855 pend[-4] = (bits >> 24) & 0xff;
2859 static const unsigned int pSHA256InitState[8] =
2860 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2862 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2865 unsigned char data[64];
2869 for (int i = 0; i < 16; i++)
2870 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2872 for (int i = 0; i < 8; i++)
2873 ctx.h[i] = ((uint32_t*)pinit)[i];
2875 SHA256_Update(&ctx, data, sizeof(data));
2876 for (int i = 0; i < 8; i++)
2877 ((uint32_t*)pstate)[i] = ctx.h[i];
2881 // ScanHash scans nonces looking for a hash with at least some zero bits.
2882 // It operates on big endian data. Caller does the byte reversing.
2883 // All input buffers are 16-byte aligned. nNonce is usually preserved
2884 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2885 // the block is rebuilt and nNonce starts over at zero.
2887 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2889 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2893 // Hash pdata using pmidstate as the starting state into
2894 // preformatted buffer phash1, then hash phash1 into phash
2896 SHA256Transform(phash1, pdata, pmidstate);
2897 SHA256Transform(phash, phash1, pSHA256InitState);
2899 // Return the nonce if the hash has at least some zero bits,
2900 // caller will check if it has enough to reach the target
2901 if (((unsigned short*)phash)[14] == 0)
2904 // If nothing found after trying for a while, return -1
2905 if ((nNonce & 0xffff) == 0)
2907 nHashesDone = 0xffff+1;
2913 // Some explaining would be appreciated
2918 set<uint256> setDependsOn;
2921 COrphan(CTransaction* ptxIn)
2929 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2930 BOOST_FOREACH(uint256 hash, setDependsOn)
2931 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2936 CBlock* CreateNewBlock(CReserveKey& reservekey)
2938 CBlockIndex* pindexPrev = pindexBest;
2941 auto_ptr<CBlock> pblock(new CBlock());
2945 // Create coinbase tx
2947 txNew.vin.resize(1);
2948 txNew.vin[0].prevout.SetNull();
2949 txNew.vout.resize(1);
2950 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2952 // Add our coinbase tx as first transaction
2953 pblock->vtx.push_back(txNew);
2955 // Collect memory pool transactions into the block
2957 CRITICAL_BLOCK(cs_main)
2958 CRITICAL_BLOCK(cs_mapTransactions)
2962 // Priority order to process transactions
2963 list<COrphan> vOrphan; // list memory doesn't move
2964 map<uint256, vector<COrphan*> > mapDependers;
2965 multimap<double, CTransaction*> mapPriority;
2966 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2968 CTransaction& tx = (*mi).second;
2969 if (tx.IsCoinBase() || !tx.IsFinal())
2972 COrphan* porphan = NULL;
2973 double dPriority = 0;
2974 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2976 // Read prev transaction
2977 CTransaction txPrev;
2979 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2981 // Has to wait for dependencies
2984 // Use list for automatic deletion
2985 vOrphan.push_back(COrphan(&tx));
2986 porphan = &vOrphan.back();
2988 mapDependers[txin.prevout.hash].push_back(porphan);
2989 porphan->setDependsOn.insert(txin.prevout.hash);
2992 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2994 // Read block header
2995 int nConf = txindex.GetDepthInMainChain();
2997 dPriority += (double)nValueIn * nConf;
2999 if (fDebug && GetBoolArg("-printpriority"))
3000 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3003 // Priority is sum(valuein * age) / txsize
3004 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3007 porphan->dPriority = dPriority;
3009 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3011 if (fDebug && GetBoolArg("-printpriority"))
3013 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3020 // Collect transactions into block
3021 map<uint256, CTxIndex> mapTestPool;
3022 uint64 nBlockSize = 1000;
3023 int nBlockSigOps = 100;
3024 while (!mapPriority.empty())
3026 // Take highest priority transaction off priority queue
3027 double dPriority = -(*mapPriority.begin()).first;
3028 CTransaction& tx = *(*mapPriority.begin()).second;
3029 mapPriority.erase(mapPriority.begin());
3032 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3033 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3036 // Legacy limits on sigOps:
3037 int nTxSigOps = tx.GetSigOpCount();
3038 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3041 // Transaction fee required depends on block size
3042 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3043 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
3045 // Connecting shouldn't fail due to dependency on other memory pool transactions
3046 // because we're already processing them in order of dependency
3047 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3049 MapPrevTx mapInputs;
3050 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3053 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3054 if (nTxFees < nMinFee)
3057 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3058 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3061 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3063 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3064 swap(mapTestPool, mapTestPoolTmp);
3067 pblock->vtx.push_back(tx);
3068 nBlockSize += nTxSize;
3069 nBlockSigOps += nTxSigOps;
3072 // Add transactions that depend on this one to the priority queue
3073 uint256 hash = tx.GetHash();
3074 if (mapDependers.count(hash))
3076 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3078 if (!porphan->setDependsOn.empty())
3080 porphan->setDependsOn.erase(hash);
3081 if (porphan->setDependsOn.empty())
3082 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3088 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3091 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3092 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3093 pblock->UpdateTime(pindexPrev);
3094 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3097 return pblock.release();
3101 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3103 // Update nExtraNonce
3104 static uint256 hashPrevBlock;
3105 if (hashPrevBlock != pblock->hashPrevBlock)
3108 hashPrevBlock = pblock->hashPrevBlock;
3111 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3112 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3116 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3119 // Prebuild hash buffers
3126 uint256 hashPrevBlock;
3127 uint256 hashMerkleRoot;
3130 unsigned int nNonce;
3133 unsigned char pchPadding0[64];
3135 unsigned char pchPadding1[64];
3138 memset(&tmp, 0, sizeof(tmp));
3140 tmp.block.nVersion = pblock->nVersion;
3141 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3142 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3143 tmp.block.nTime = pblock->nTime;
3144 tmp.block.nBits = pblock->nBits;
3145 tmp.block.nNonce = pblock->nNonce;
3147 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3148 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3150 // Byte swap all the input buffer
3151 for (int i = 0; i < sizeof(tmp)/4; i++)
3152 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3154 // Precalc the first half of the first hash, which stays constant
3155 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3157 memcpy(pdata, &tmp.block, 128);
3158 memcpy(phash1, &tmp.hash1, 64);
3162 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3164 uint256 hash = pblock->GetHash();
3165 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3167 if (hash > hashTarget)
3171 printf("BitcoinMiner:\n");
3172 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3174 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3175 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3178 CRITICAL_BLOCK(cs_main)
3180 if (pblock->hashPrevBlock != hashBestChain)
3181 return error("BitcoinMiner : generated block is stale");
3183 // Remove key from key pool
3184 reservekey.KeepKey();
3186 // Track how many getdata requests this block gets
3187 CRITICAL_BLOCK(wallet.cs_wallet)
3188 wallet.mapRequestCount[pblock->GetHash()] = 0;
3190 // Process this block the same as if we had received it from another node
3191 if (!ProcessBlock(NULL, pblock))
3192 return error("BitcoinMiner : ProcessBlock, block not accepted");
3198 void static ThreadBitcoinMiner(void* parg);
3200 void static BitcoinMiner(CWallet *pwallet)
3202 printf("BitcoinMiner started\n");
3203 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3205 // Each thread has its own key and counter
3206 CReserveKey reservekey(pwallet);
3207 unsigned int nExtraNonce = 0;
3209 while (fGenerateBitcoins)
3211 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3215 while (vNodes.empty() || IsInitialBlockDownload())
3220 if (!fGenerateBitcoins)
3228 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3229 CBlockIndex* pindexPrev = pindexBest;
3231 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3234 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3236 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3240 // Prebuild hash buffers
3242 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3243 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3244 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3246 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3248 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3249 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3250 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3256 int64 nStart = GetTime();
3257 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3259 uint256& hash = *alignup<16>(hashbuf);
3262 unsigned int nHashesDone = 0;
3263 unsigned int nNonceFound;
3266 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3267 (char*)&hash, nHashesDone);
3269 // Check if something found
3270 if (nNonceFound != -1)
3272 for (int i = 0; i < sizeof(hash)/4; i++)
3273 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3275 if (hash <= hashTarget)
3278 pblock->nNonce = ByteReverse(nNonceFound);
3279 assert(hash == pblock->GetHash());
3281 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3282 CheckWork(pblock.get(), *pwalletMain, reservekey);
3283 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3289 static int64 nHashCounter;
3290 if (nHPSTimerStart == 0)
3292 nHPSTimerStart = GetTimeMillis();
3296 nHashCounter += nHashesDone;
3297 if (GetTimeMillis() - nHPSTimerStart > 4000)
3299 static CCriticalSection cs;
3302 if (GetTimeMillis() - nHPSTimerStart > 4000)
3304 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3305 nHPSTimerStart = GetTimeMillis();
3307 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3308 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3309 static int64 nLogTime;
3310 if (GetTime() - nLogTime > 30 * 60)
3312 nLogTime = GetTime();
3313 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3314 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3320 // Check for stop or if block needs to be rebuilt
3323 if (!fGenerateBitcoins)
3325 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3329 if (nBlockNonce >= 0xffff0000)
3331 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3333 if (pindexPrev != pindexBest)
3336 // Update nTime every few seconds
3337 pblock->UpdateTime(pindexPrev);
3338 nBlockTime = ByteReverse(pblock->nTime);
3341 // Changing pblock->nTime can change work required on testnet:
3342 nBlockBits = ByteReverse(pblock->nBits);
3343 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3349 void static ThreadBitcoinMiner(void* parg)
3351 CWallet* pwallet = (CWallet*)parg;
3354 vnThreadsRunning[3]++;
3355 BitcoinMiner(pwallet);
3356 vnThreadsRunning[3]--;
3358 catch (std::exception& e) {
3359 vnThreadsRunning[3]--;
3360 PrintException(&e, "ThreadBitcoinMiner()");
3362 vnThreadsRunning[3]--;
3363 PrintException(NULL, "ThreadBitcoinMiner()");
3365 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3367 if (vnThreadsRunning[3] == 0)
3369 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3373 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3375 if (fGenerateBitcoins != fGenerate)
3377 fGenerateBitcoins = fGenerate;
3378 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3381 if (fGenerateBitcoins)
3383 int nProcessors = boost::thread::hardware_concurrency();
3384 printf("%d processors\n", nProcessors);
3385 if (nProcessors < 1)
3387 if (fLimitProcessors && nProcessors > nLimitProcessors)
3388 nProcessors = nLimitProcessors;
3389 int nAddThreads = nProcessors - vnThreadsRunning[3];
3390 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3391 for (int i = 0; i < nAddThreads; i++)
3393 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3394 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");