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 "cryptopp/sha.h"
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
26 static map<uint256, CTransaction> mapTransactions;
27 CCriticalSection cs_mapTransactions;
28 unsigned int nTransactionsUpdated = 0;
29 map<COutPoint, CInPoint> mapNextTx;
31 map<uint256, CBlockIndex*> mapBlockIndex;
32 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 CBigNum bnBestChainWork = 0;
38 CBigNum bnBestInvalidWork = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
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;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
170 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
171 BOOST_FOREACH(const CTxIn& txin, tx.vin)
172 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
175 void static EraseOrphanTx(uint256 hash)
177 if (!mapOrphanTransactions.count(hash))
179 const CDataStream* pvMsg = mapOrphanTransactions[hash];
181 CDataStream(*pvMsg) >> tx;
182 BOOST_FOREACH(const CTxIn& txin, tx.vin)
184 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
185 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
187 if ((*mi).second == pvMsg)
188 mapOrphanTransactionsByPrev.erase(mi++);
194 mapOrphanTransactions.erase(hash);
197 int LimitOrphanTxSize(int nMaxOrphans)
200 while (mapOrphanTransactions.size() > nMaxOrphans)
202 // Evict a random orphan:
203 std::vector<unsigned char> randbytes(32);
204 RAND_bytes(&randbytes[0], 32);
205 uint256 randomhash(randbytes);
206 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
207 if (it == mapOrphanTransactions.end())
208 it = mapOrphanTransactions.begin();
209 EraseOrphanTx(it->first);
221 //////////////////////////////////////////////////////////////////////////////
223 // CTransaction and CTxIndex
226 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
229 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
231 if (!ReadFromDisk(txindexRet.pos))
233 if (prevout.n >= vout.size())
241 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
244 return ReadFromDisk(txdb, prevout, txindex);
247 bool CTransaction::ReadFromDisk(COutPoint prevout)
251 return ReadFromDisk(txdb, prevout, txindex);
256 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
268 // Load the block this tx is in
270 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
272 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
277 // Update the tx's hashBlock
278 hashBlock = pblock->GetHash();
280 // Locate the transaction
281 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
282 if (pblock->vtx[nIndex] == *(CTransaction*)this)
284 if (nIndex == pblock->vtx.size())
286 vMerkleBranch.clear();
288 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
292 // Fill in merkle branch
293 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
296 // Is the tx in a block that's in the main chain
297 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
298 if (mi == mapBlockIndex.end())
300 CBlockIndex* pindex = (*mi).second;
301 if (!pindex || !pindex->IsInMainChain())
304 return pindexBest->nHeight - pindex->nHeight + 1;
313 bool CTransaction::CheckTransaction() const
315 // Basic checks that don't depend on any context
317 return error("CTransaction::CheckTransaction() : vin empty");
319 return error("CTransaction::CheckTransaction() : vout empty");
321 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
322 return error("CTransaction::CheckTransaction() : size limits failed");
324 // Check for negative or overflow output values
326 BOOST_FOREACH(const CTxOut& txout, vout)
328 if (txout.nValue < 0)
329 return error("CTransaction::CheckTransaction() : txout.nValue negative");
330 if (txout.nValue > MAX_MONEY)
331 return error("CTransaction::CheckTransaction() : txout.nValue too high");
332 nValueOut += txout.nValue;
333 if (!MoneyRange(nValueOut))
334 return error("CTransaction::CheckTransaction() : txout total out of range");
337 // Check for duplicate inputs
338 set<COutPoint> vInOutPoints;
339 BOOST_FOREACH(const CTxIn& txin, vin)
341 if (vInOutPoints.count(txin.prevout))
343 vInOutPoints.insert(txin.prevout);
348 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
349 return error("CTransaction::CheckTransaction() : coinbase script size");
353 BOOST_FOREACH(const CTxIn& txin, vin)
354 if (txin.prevout.IsNull())
355 return error("CTransaction::CheckTransaction() : prevout is null");
361 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
364 *pfMissingInputs = false;
366 if (!CheckTransaction())
367 return error("AcceptToMemoryPool() : CheckTransaction failed");
369 // Coinbase is only valid in a block, not as a loose transaction
371 return error("AcceptToMemoryPool() : coinbase as individual tx");
373 // To help v0.1.5 clients who would see it as a negative number
374 if ((int64)nLockTime > INT_MAX)
375 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
377 // Rather not work on nonstandard transactions (unless -testnet)
378 if (!fTestNet && !IsStandard())
379 return error("AcceptToMemoryPool() : nonstandard transaction type");
381 // Do we already have it?
382 uint256 hash = GetHash();
383 CRITICAL_BLOCK(cs_mapTransactions)
384 if (mapTransactions.count(hash))
387 if (txdb.ContainsTx(hash))
390 // Check for conflicts with in-memory transactions
391 CTransaction* ptxOld = NULL;
392 for (int i = 0; i < vin.size(); i++)
394 COutPoint outpoint = vin[i].prevout;
395 if (mapNextTx.count(outpoint))
397 // Disable replacement feature for now
400 // Allow replacing with a newer version of the same transaction
403 ptxOld = mapNextTx[outpoint].ptx;
404 if (ptxOld->IsFinal())
406 if (!IsNewerThan(*ptxOld))
408 for (int i = 0; i < vin.size(); i++)
410 COutPoint outpoint = vin[i].prevout;
411 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
421 map<uint256, CTxIndex> mapUnused;
422 bool fInvalid = false;
423 if (!FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
426 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
428 *pfMissingInputs = true;
429 return error("AcceptToMemoryPool() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
433 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
434 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
435 // attacks disallow transactions with more than one SigOp per 34 bytes.
436 // 34 bytes because a TxOut is:
437 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
438 if (GetSigOpCount() > nSize / 34 || nSize < 100)
439 return error("AcceptToMemoryPool() : nonstandard transaction");
441 int64 nFees = GetValueIn(mapInputs)-GetValueOut();
443 // Don't accept it if it can't get into a block
444 if (nFees < GetMinFee(1000, true, true))
445 return error("AcceptToMemoryPool() : not enough fees");
447 // Continuously rate-limit free transactions
448 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
449 // be annoying or make other's transactions take longer to confirm.
450 if (nFees < MIN_RELAY_TX_FEE)
452 static CCriticalSection cs;
453 static double dFreeCount;
454 static int64 nLastTime;
455 int64 nNow = GetTime();
459 // Use an exponentially decaying ~10-minute window:
460 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
462 // -limitfreerelay unit is thousand-bytes-per-minute
463 // At default rate it would take over a month to fill 1GB
464 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
465 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
467 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
472 // Check against previous transactions
473 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
474 if (!ConnectInputs(mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
476 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
480 // Store transaction in memory
481 CRITICAL_BLOCK(cs_mapTransactions)
485 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
486 ptxOld->RemoveFromMemoryPool();
488 AddToMemoryPoolUnchecked();
491 ///// are we sure this is ok when loading transactions or restoring block txes
492 // If updated, erase old tx from wallet
494 EraseFromWallets(ptxOld->GetHash());
496 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
500 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
503 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
506 bool CTransaction::AddToMemoryPoolUnchecked()
508 // Add to memory pool without checking anything. Don't call this directly,
509 // call AcceptToMemoryPool to properly check the transaction first.
510 CRITICAL_BLOCK(cs_mapTransactions)
512 uint256 hash = GetHash();
513 mapTransactions[hash] = *this;
514 for (int i = 0; i < vin.size(); i++)
515 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
516 nTransactionsUpdated++;
522 bool CTransaction::RemoveFromMemoryPool()
524 // Remove transaction from memory pool
525 CRITICAL_BLOCK(cs_mapTransactions)
527 BOOST_FOREACH(const CTxIn& txin, vin)
528 mapNextTx.erase(txin.prevout);
529 mapTransactions.erase(GetHash());
530 nTransactionsUpdated++;
540 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
542 if (hashBlock == 0 || nIndex == -1)
545 // Find the block it claims to be in
546 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
547 if (mi == mapBlockIndex.end())
549 CBlockIndex* pindex = (*mi).second;
550 if (!pindex || !pindex->IsInMainChain())
553 // Make sure the merkle branch connects to this block
554 if (!fMerkleVerified)
556 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
558 fMerkleVerified = true;
561 nHeightRet = pindex->nHeight;
562 return pindexBest->nHeight - pindex->nHeight + 1;
566 int CMerkleTx::GetBlocksToMaturity() const
570 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
574 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
578 if (!IsInMainChain() && !ClientConnectInputs())
580 return CTransaction::AcceptToMemoryPool(txdb, false);
584 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
588 bool CMerkleTx::AcceptToMemoryPool()
591 return AcceptToMemoryPool(txdb);
596 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
598 CRITICAL_BLOCK(cs_mapTransactions)
600 // Add previous supporting transactions first
601 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
603 if (!tx.IsCoinBase())
605 uint256 hash = tx.GetHash();
606 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
607 tx.AcceptToMemoryPool(txdb, fCheckInputs);
610 return AcceptToMemoryPool(txdb, fCheckInputs);
615 bool CWalletTx::AcceptWalletTransaction()
618 return AcceptWalletTransaction(txdb);
621 int CTxIndex::GetDepthInMainChain() const
625 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
627 // Find the block in the index
628 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
629 if (mi == mapBlockIndex.end())
631 CBlockIndex* pindex = (*mi).second;
632 if (!pindex || !pindex->IsInMainChain())
634 return 1 + nBestHeight - pindex->nHeight;
646 //////////////////////////////////////////////////////////////////////////////
648 // CBlock and CBlockIndex
651 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
653 if (!fReadTransactions)
655 *this = pindex->GetBlockHeader();
658 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
660 if (GetHash() != pindex->GetBlockHash())
661 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
665 uint256 static GetOrphanRoot(const CBlock* pblock)
667 // Work back to the first block in the orphan chain
668 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
669 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
670 return pblock->GetHash();
673 int64 static GetBlockValue(int nHeight, int64 nFees)
675 int64 nSubsidy = 50 * COIN;
677 // Subsidy is cut in half every 4 years
678 nSubsidy >>= (nHeight / 210000);
680 return nSubsidy + nFees;
683 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
684 static const int64 nTargetSpacing = 10 * 60;
685 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
688 // minimum amount of work that could possibly be required nTime after
689 // minimum work required was nBase
691 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
693 // Testnet has min-difficulty blocks
694 // after nTargetSpacing*2 time between blocks:
695 if (fTestNet && nTime > nTargetSpacing*2)
696 return bnProofOfWorkLimit.GetCompact();
699 bnResult.SetCompact(nBase);
700 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
702 // Maximum 400% adjustment...
704 // ... in best-case exactly 4-times-normal target time
705 nTime -= nTargetTimespan*4;
707 if (bnResult > bnProofOfWorkLimit)
708 bnResult = bnProofOfWorkLimit;
709 return bnResult.GetCompact();
712 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
714 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
717 if (pindexLast == NULL)
718 return nProofOfWorkLimit;
720 // Only change once per interval
721 if ((pindexLast->nHeight+1) % nInterval != 0)
723 // Special rules for testnet after 15 Feb 2012:
724 if (fTestNet && pblock->nTime > 1329264000)
726 // If the new block's timestamp is more than 2* 10 minutes
727 // then allow mining of a min-difficulty block.
728 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
729 return nProofOfWorkLimit;
732 // Return the last non-special-min-difficulty-rules-block
733 const CBlockIndex* pindex = pindexLast;
734 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
735 pindex = pindex->pprev;
736 return pindex->nBits;
740 return pindexLast->nBits;
743 // Go back by what we want to be 14 days worth of blocks
744 const CBlockIndex* pindexFirst = pindexLast;
745 for (int i = 0; pindexFirst && i < nInterval-1; i++)
746 pindexFirst = pindexFirst->pprev;
749 // Limit adjustment step
750 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
751 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
752 if (nActualTimespan < nTargetTimespan/4)
753 nActualTimespan = nTargetTimespan/4;
754 if (nActualTimespan > nTargetTimespan*4)
755 nActualTimespan = nTargetTimespan*4;
759 bnNew.SetCompact(pindexLast->nBits);
760 bnNew *= nActualTimespan;
761 bnNew /= nTargetTimespan;
763 if (bnNew > bnProofOfWorkLimit)
764 bnNew = bnProofOfWorkLimit;
767 printf("GetNextWorkRequired RETARGET\n");
768 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
769 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
770 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
772 return bnNew.GetCompact();
775 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
778 bnTarget.SetCompact(nBits);
781 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
782 return error("CheckProofOfWork() : nBits below minimum work");
784 // Check proof of work matches claimed amount
785 if (hash > bnTarget.getuint256())
786 return error("CheckProofOfWork() : hash doesn't match nBits");
791 bool IsInitialBlockDownload()
793 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
795 static int64 nLastUpdate;
796 static CBlockIndex* pindexLastBest;
797 if (pindexBest != pindexLastBest)
799 pindexLastBest = pindexBest;
800 nLastUpdate = GetTime();
802 return (GetTime() - nLastUpdate < 10 &&
803 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
806 void static InvalidChainFound(CBlockIndex* pindexNew)
808 if (pindexNew->bnChainWork > bnBestInvalidWork)
810 bnBestInvalidWork = pindexNew->bnChainWork;
811 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
814 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());
815 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
816 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
817 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
820 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
822 nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
824 // Updating time can change work required on testnet:
826 nBits = GetNextWorkRequired(pindexPrev, this);
839 bool CTransaction::DisconnectInputs(CTxDB& txdb)
841 // Relinquish previous transactions' spent pointers
844 BOOST_FOREACH(const CTxIn& txin, vin)
846 COutPoint prevout = txin.prevout;
848 // Get prev txindex from disk
850 if (!txdb.ReadTxIndex(prevout.hash, txindex))
851 return error("DisconnectInputs() : ReadTxIndex failed");
853 if (prevout.n >= txindex.vSpent.size())
854 return error("DisconnectInputs() : prevout.n out of range");
856 // Mark outpoint as not spent
857 txindex.vSpent[prevout.n].SetNull();
860 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
861 return error("DisconnectInputs() : UpdateTxIndex failed");
865 // Remove transaction from index
866 // This can fail if a duplicate of this transaction was in a chain that got
867 // reorganized away. This is only possible if this transaction was completely
868 // spent, so erasing it would be a no-op anway.
869 txdb.EraseTxIndex(*this);
875 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
876 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
878 // FetchInputs can return false either because we just haven't seen some inputs
879 // (in which case the transaction should be stored as an orphan)
880 // or because the transaction is malformed (in which case the transaction should
881 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
885 return true; // Coinbase transactions have no inputs to fetch.
887 for (int i = 0; i < vin.size(); i++)
889 COutPoint prevout = vin[i].prevout;
890 if (inputsRet.count(prevout.hash))
891 continue; // Got it already
894 CTxIndex& txindex = inputsRet[prevout.hash].first;
896 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
898 // Get txindex from current proposed changes
899 txindex = mapTestPool.find(prevout.hash)->second;
903 // Read txindex from txdb
904 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
906 if (!fFound && (fBlock || fMiner))
907 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());
910 CTransaction& txPrev = inputsRet[prevout.hash].second;
911 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
913 // Get prev tx from single transactions in memory
914 CRITICAL_BLOCK(cs_mapTransactions)
916 if (!mapTransactions.count(prevout.hash))
917 return error("FetchInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
918 txPrev = mapTransactions[prevout.hash];
921 txindex.vSpent.resize(txPrev.vout.size());
925 // Get prev tx from disk
926 if (!txPrev.ReadFromDisk(txindex.pos))
927 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
931 // Make sure all prevout.n's are valid:
932 for (int i = 0; i < vin.size(); i++)
934 const COutPoint prevout = vin[i].prevout;
935 assert(inputsRet.count(prevout.hash) != 0);
936 const CTxIndex& txindex = inputsRet[prevout.hash].first;
937 const CTransaction& txPrev = inputsRet[prevout.hash].second;
938 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
940 // Revisit this if/when transaction replacement is implemented and allows
943 return 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());
950 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
952 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
953 if (mi == inputs.end())
954 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
956 const CTransaction& txPrev = (mi->second).second;
957 if (input.prevout.n >= txPrev.vout.size())
958 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
960 return txPrev.vout[input.prevout.n];
963 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
969 for (int i = 0; i < vin.size(); i++)
971 nResult += GetOutputFor(vin[i], inputs).nValue;
977 int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
983 for (int i = 0; i < vin.size(); i++)
985 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
986 if (prevout.scriptPubKey.IsPayToScriptHash())
987 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
992 bool CTransaction::ConnectInputs(MapPrevTx inputs,
993 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
994 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
996 // Take over previous transactions' spent pointers
997 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
998 // fMiner is true when called from the internal bitcoin miner
999 // ... both are false when called from CTransaction::AcceptToMemoryPool
1004 for (int i = 0; i < vin.size(); i++)
1006 COutPoint prevout = vin[i].prevout;
1007 assert(inputs.count(prevout.hash) > 0);
1008 CTxIndex& txindex = inputs[prevout.hash].first;
1009 CTransaction& txPrev = inputs[prevout.hash].second;
1011 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1012 return 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());
1014 // If prev is coinbase, check that it's matured
1015 if (txPrev.IsCoinBase())
1016 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1017 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1018 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1020 // Check for conflicts (double-spend)
1021 if (!txindex.vSpent[prevout.n].IsNull())
1022 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());
1024 // Check for negative or overflow input values
1025 nValueIn += txPrev.vout[prevout.n].nValue;
1026 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1027 return error("ConnectInputs() : txin values out of range");
1030 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1032 // only during transition phase for P2SH: do not invoke (external)
1033 // anti-DoS code for potentially old clients relaying bad P2SH
1035 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1036 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1038 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1041 // Mark outpoints as spent
1042 txindex.vSpent[prevout.n] = posThisTx;
1045 if (fBlock || fMiner)
1047 mapTestPool[prevout.hash] = txindex;
1051 if (nValueIn < GetValueOut())
1052 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
1054 // Tally transaction fees
1055 int64 nTxFee = nValueIn - GetValueOut();
1057 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
1059 if (!MoneyRange(nFees))
1060 return error("ConnectInputs() : nFees out of range");
1067 bool CTransaction::ClientConnectInputs()
1072 // Take over previous transactions' spent pointers
1073 CRITICAL_BLOCK(cs_mapTransactions)
1076 for (int i = 0; i < vin.size(); i++)
1078 // Get prev tx from single transactions in memory
1079 COutPoint prevout = vin[i].prevout;
1080 if (!mapTransactions.count(prevout.hash))
1082 CTransaction& txPrev = mapTransactions[prevout.hash];
1084 if (prevout.n >= txPrev.vout.size())
1088 if (!VerifySignature(txPrev, *this, i, true, 0))
1089 return error("ConnectInputs() : VerifySignature failed");
1091 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1092 ///// this has to go away now that posNext is gone
1093 // // Check for conflicts
1094 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1095 // return error("ConnectInputs() : prev tx already used");
1097 // // Flag outpoints as used
1098 // txPrev.vout[prevout.n].posNext = posThisTx;
1100 nValueIn += txPrev.vout[prevout.n].nValue;
1102 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1103 return error("ClientConnectInputs() : txin values out of range");
1105 if (GetValueOut() > nValueIn)
1115 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1117 // Disconnect in reverse order
1118 for (int i = vtx.size()-1; i >= 0; i--)
1119 if (!vtx[i].DisconnectInputs(txdb))
1122 // Update block index on disk without changing it in memory.
1123 // The memory index structure will be changed after the db commits.
1126 CDiskBlockIndex blockindexPrev(pindex->pprev);
1127 blockindexPrev.hashNext = 0;
1128 if (!txdb.WriteBlockIndex(blockindexPrev))
1129 return error("DisconnectBlock() : WriteBlockIndex failed");
1135 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1137 // Check it again in case a previous version let a bad block in
1141 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1142 // unless those are already completely spent.
1143 // If such overwrites are allowed, coinbases and transactions depending upon those
1144 // can be duplicated to remove the ability to spend the first instance -- even after
1145 // being sent to another address.
1146 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1147 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1148 // already refuses previously-known transaction id's entirely.
1149 // This rule applies to all blocks whose timestamp is after March 15, 2012, 0:00 UTC.
1150 // On testnet it is enabled as of februari 20, 2012, 0:00 UTC.
1151 if (pindex->nTime > 1331769600 || (fTestNet && pindex->nTime > 1329696000))
1152 BOOST_FOREACH(CTransaction& tx, vtx)
1154 CTxIndex txindexOld;
1155 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1156 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1161 // P2SH didn't become active until Apr 1 2012 (Feb 15 on testnet)
1162 int64 nEvalSwitchTime = fTestNet ? 1329264000 : 1333238400;
1163 bool fStrictPayToScriptHash = (pindex->nTime >= nEvalSwitchTime);
1165 //// issue here: it doesn't know the version
1166 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1168 map<uint256, CTxIndex> mapQueuedChanges;
1171 BOOST_FOREACH(CTransaction& tx, vtx)
1173 nSigOps += tx.GetSigOpCount();
1174 if (nSigOps > MAX_BLOCK_SIGOPS)
1175 return error("ConnectBlock() : too many sigops");
1177 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1178 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1181 MapPrevTx mapInputs;
1182 if (!tx.IsCoinBase())
1184 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1187 if (fStrictPayToScriptHash)
1189 // Add in sigops done by pay-to-script-hash inputs;
1190 // this is to prevent a "rogue miner" from creating
1191 // an incredibly-expensive-to-validate block.
1192 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1193 if (nSigOps > MAX_BLOCK_SIGOPS)
1194 return error("ConnectBlock() : too many sigops");
1197 nFees += tx.GetValueIn(mapInputs)-tx.GetValueOut();
1199 if (!tx.ConnectInputs(mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1203 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1206 // Write queued txindex changes
1207 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1209 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1210 return error("ConnectBlock() : UpdateTxIndex failed");
1213 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1216 // Update block index on disk without changing it in memory.
1217 // The memory index structure will be changed after the db commits.
1220 CDiskBlockIndex blockindexPrev(pindex->pprev);
1221 blockindexPrev.hashNext = pindex->GetBlockHash();
1222 if (!txdb.WriteBlockIndex(blockindexPrev))
1223 return error("ConnectBlock() : WriteBlockIndex failed");
1226 // Watch for transactions paying to me
1227 BOOST_FOREACH(CTransaction& tx, vtx)
1228 SyncWithWallets(tx, this, true);
1233 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1235 printf("REORGANIZE\n");
1238 CBlockIndex* pfork = pindexBest;
1239 CBlockIndex* plonger = pindexNew;
1240 while (pfork != plonger)
1242 while (plonger->nHeight > pfork->nHeight)
1243 if (!(plonger = plonger->pprev))
1244 return error("Reorganize() : plonger->pprev is null");
1245 if (pfork == plonger)
1247 if (!(pfork = pfork->pprev))
1248 return error("Reorganize() : pfork->pprev is null");
1251 // List of what to disconnect
1252 vector<CBlockIndex*> vDisconnect;
1253 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1254 vDisconnect.push_back(pindex);
1256 // List of what to connect
1257 vector<CBlockIndex*> vConnect;
1258 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1259 vConnect.push_back(pindex);
1260 reverse(vConnect.begin(), vConnect.end());
1262 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());
1263 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());
1265 // Disconnect shorter branch
1266 vector<CTransaction> vResurrect;
1267 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1270 if (!block.ReadFromDisk(pindex))
1271 return error("Reorganize() : ReadFromDisk for disconnect failed");
1272 if (!block.DisconnectBlock(txdb, pindex))
1273 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1275 // Queue memory transactions to resurrect
1276 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1277 if (!tx.IsCoinBase())
1278 vResurrect.push_back(tx);
1281 // Connect longer branch
1282 vector<CTransaction> vDelete;
1283 for (int i = 0; i < vConnect.size(); i++)
1285 CBlockIndex* pindex = vConnect[i];
1287 if (!block.ReadFromDisk(pindex))
1288 return error("Reorganize() : ReadFromDisk for connect failed");
1289 if (!block.ConnectBlock(txdb, pindex))
1293 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1296 // Queue memory transactions to delete
1297 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1298 vDelete.push_back(tx);
1300 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1301 return error("Reorganize() : WriteHashBestChain failed");
1303 // Make sure it's successfully written to disk before changing memory structure
1304 if (!txdb.TxnCommit())
1305 return error("Reorganize() : TxnCommit failed");
1307 // Disconnect shorter branch
1308 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1310 pindex->pprev->pnext = NULL;
1312 // Connect longer branch
1313 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1315 pindex->pprev->pnext = pindex;
1317 // Resurrect memory transactions that were in the disconnected branch
1318 BOOST_FOREACH(CTransaction& tx, vResurrect)
1319 tx.AcceptToMemoryPool(txdb, false);
1321 // Delete redundant memory transactions that are in the connected branch
1322 BOOST_FOREACH(CTransaction& tx, vDelete)
1323 tx.RemoveFromMemoryPool();
1325 printf("REORGANIZE: done\n");
1331 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1333 uint256 hash = GetHash();
1336 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1338 txdb.WriteHashBestChain(hash);
1339 if (!txdb.TxnCommit())
1340 return error("SetBestChain() : TxnCommit failed");
1341 pindexGenesisBlock = pindexNew;
1343 else if (hashPrevBlock == hashBestChain)
1345 // Adding to current best branch
1346 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1349 InvalidChainFound(pindexNew);
1350 return error("SetBestChain() : ConnectBlock failed");
1352 if (!txdb.TxnCommit())
1353 return error("SetBestChain() : TxnCommit failed");
1355 // Add to current best branch
1356 pindexNew->pprev->pnext = pindexNew;
1358 // Delete redundant memory transactions
1359 BOOST_FOREACH(CTransaction& tx, vtx)
1360 tx.RemoveFromMemoryPool();
1365 if (!Reorganize(txdb, pindexNew))
1368 InvalidChainFound(pindexNew);
1369 return error("SetBestChain() : Reorganize failed");
1373 // Update best block in wallet (so we can detect restored wallets)
1374 if (!IsInitialBlockDownload())
1376 const CBlockLocator locator(pindexNew);
1377 ::SetBestChain(locator);
1381 hashBestChain = hash;
1382 pindexBest = pindexNew;
1383 nBestHeight = pindexBest->nHeight;
1384 bnBestChainWork = pindexNew->bnChainWork;
1385 nTimeBestReceived = GetTime();
1386 nTransactionsUpdated++;
1387 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1393 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1395 // Check for duplicate
1396 uint256 hash = GetHash();
1397 if (mapBlockIndex.count(hash))
1398 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1400 // Construct new block index object
1401 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1403 return error("AddToBlockIndex() : new CBlockIndex failed");
1404 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1405 pindexNew->phashBlock = &((*mi).first);
1406 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1407 if (miPrev != mapBlockIndex.end())
1409 pindexNew->pprev = (*miPrev).second;
1410 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1412 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1416 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1417 if (!txdb.TxnCommit())
1421 if (pindexNew->bnChainWork > bnBestChainWork)
1422 if (!SetBestChain(txdb, pindexNew))
1427 if (pindexNew == pindexBest)
1429 // Notify UI to display prev block's coinbase if it was ours
1430 static uint256 hashPrevBestCoinBase;
1431 UpdatedTransaction(hashPrevBestCoinBase);
1432 hashPrevBestCoinBase = vtx[0].GetHash();
1442 bool CBlock::CheckBlock() const
1444 // These are checks that are independent of context
1445 // that can be verified before saving an orphan block.
1448 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1449 return error("CheckBlock() : size limits failed");
1451 // Check proof of work matches claimed amount
1452 if (!CheckProofOfWork(GetHash(), nBits))
1453 return error("CheckBlock() : proof of work failed");
1456 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1457 return error("CheckBlock() : block timestamp too far in the future");
1459 // First transaction must be coinbase, the rest must not be
1460 if (vtx.empty() || !vtx[0].IsCoinBase())
1461 return error("CheckBlock() : first tx is not coinbase");
1462 for (int i = 1; i < vtx.size(); i++)
1463 if (vtx[i].IsCoinBase())
1464 return error("CheckBlock() : more than one coinbase");
1466 // Check transactions
1467 BOOST_FOREACH(const CTransaction& tx, vtx)
1468 if (!tx.CheckTransaction())
1469 return error("CheckBlock() : CheckTransaction failed");
1471 // Check that it's not full of nonstandard transactions
1472 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1473 return error("CheckBlock() : out-of-bounds SigOpCount");
1476 if (hashMerkleRoot != BuildMerkleTree())
1477 return error("CheckBlock() : hashMerkleRoot mismatch");
1482 bool CBlock::AcceptBlock()
1484 // Check for duplicate
1485 uint256 hash = GetHash();
1486 if (mapBlockIndex.count(hash))
1487 return error("AcceptBlock() : block already in mapBlockIndex");
1489 // Get prev block index
1490 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1491 if (mi == mapBlockIndex.end())
1492 return error("AcceptBlock() : prev block not found");
1493 CBlockIndex* pindexPrev = (*mi).second;
1494 int nHeight = pindexPrev->nHeight+1;
1496 // Check proof of work
1497 if (nBits != GetNextWorkRequired(pindexPrev, this))
1498 return error("AcceptBlock() : incorrect proof of work");
1500 // Check timestamp against prev
1501 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1502 return error("AcceptBlock() : block's timestamp is too early");
1504 // Check that all transactions are finalized
1505 BOOST_FOREACH(const CTransaction& tx, vtx)
1506 if (!tx.IsFinal(nHeight, GetBlockTime()))
1507 return error("AcceptBlock() : contains a non-final transaction");
1509 // Check that the block chain matches the known block chain up to a checkpoint
1510 if (!Checkpoints::CheckBlock(nHeight, hash))
1511 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1513 // Write block to history file
1514 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1515 return error("AcceptBlock() : out of disk space");
1516 unsigned int nFile = -1;
1517 unsigned int nBlockPos = 0;
1518 if (!WriteToDisk(nFile, nBlockPos))
1519 return error("AcceptBlock() : WriteToDisk failed");
1520 if (!AddToBlockIndex(nFile, nBlockPos))
1521 return error("AcceptBlock() : AddToBlockIndex failed");
1523 // Relay inventory, but don't relay old inventory during initial block download
1524 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1525 if (hashBestChain == hash)
1526 CRITICAL_BLOCK(cs_vNodes)
1527 BOOST_FOREACH(CNode* pnode, vNodes)
1528 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1529 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1534 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1536 // Check for duplicate
1537 uint256 hash = pblock->GetHash();
1538 if (mapBlockIndex.count(hash))
1539 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1540 if (mapOrphanBlocks.count(hash))
1541 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1543 // Preliminary checks
1544 if (!pblock->CheckBlock())
1545 return error("ProcessBlock() : CheckBlock FAILED");
1547 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1548 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1550 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1551 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1554 return error("ProcessBlock() : block with timestamp before last checkpoint");
1557 bnNewBlock.SetCompact(pblock->nBits);
1559 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1560 if (bnNewBlock > bnRequired)
1562 return error("ProcessBlock() : block with too little proof-of-work");
1567 // If don't already have its previous block, shunt it off to holding area until we get it
1568 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1570 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1571 CBlock* pblock2 = new CBlock(*pblock);
1572 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1573 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1575 // Ask this guy to fill in what we're missing
1577 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1582 if (!pblock->AcceptBlock())
1583 return error("ProcessBlock() : AcceptBlock FAILED");
1585 // Recursively process any orphan blocks that depended on this one
1586 vector<uint256> vWorkQueue;
1587 vWorkQueue.push_back(hash);
1588 for (int i = 0; i < vWorkQueue.size(); i++)
1590 uint256 hashPrev = vWorkQueue[i];
1591 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1592 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1595 CBlock* pblockOrphan = (*mi).second;
1596 if (pblockOrphan->AcceptBlock())
1597 vWorkQueue.push_back(pblockOrphan->GetHash());
1598 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1599 delete pblockOrphan;
1601 mapOrphanBlocksByPrev.erase(hashPrev);
1604 printf("ProcessBlock: ACCEPTED\n");
1615 bool CheckDiskSpace(uint64 nAdditionalBytes)
1617 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1619 // Check for 15MB because database could create another 10MB log file at any time
1620 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1623 string strMessage = _("Warning: Disk space is low ");
1624 strMiscWarning = strMessage;
1625 printf("*** %s\n", strMessage.c_str());
1626 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1627 CreateThread(Shutdown, NULL);
1633 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1637 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1640 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1642 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1651 static unsigned int nCurrentBlockFile = 1;
1653 FILE* AppendBlockFile(unsigned int& nFileRet)
1658 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1661 if (fseek(file, 0, SEEK_END) != 0)
1663 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1664 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1666 nFileRet = nCurrentBlockFile;
1670 nCurrentBlockFile++;
1674 bool LoadBlockIndex(bool fAllowNew)
1678 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1679 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1680 pchMessageStart[0] = 0xfa;
1681 pchMessageStart[1] = 0xbf;
1682 pchMessageStart[2] = 0xb5;
1683 pchMessageStart[3] = 0xda;
1690 if (!txdb.LoadBlockIndex())
1695 // Init with genesis block
1697 if (mapBlockIndex.empty())
1703 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1704 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1705 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1706 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1707 // vMerkleTree: 4a5e1e
1710 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1712 txNew.vin.resize(1);
1713 txNew.vout.resize(1);
1714 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1715 txNew.vout[0].nValue = 50 * COIN;
1716 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1718 block.vtx.push_back(txNew);
1719 block.hashPrevBlock = 0;
1720 block.hashMerkleRoot = block.BuildMerkleTree();
1722 block.nTime = 1231006505;
1723 block.nBits = 0x1d00ffff;
1724 block.nNonce = 2083236893;
1728 block.nTime = 1296688602;
1729 block.nBits = 0x1d07fff8;
1730 block.nNonce = 384568319;
1734 printf("%s\n", block.GetHash().ToString().c_str());
1735 printf("%s\n", hashGenesisBlock.ToString().c_str());
1736 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1737 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1739 assert(block.GetHash() == hashGenesisBlock);
1741 // Start new block file
1743 unsigned int nBlockPos;
1744 if (!block.WriteToDisk(nFile, nBlockPos))
1745 return error("LoadBlockIndex() : writing genesis block to disk failed");
1746 if (!block.AddToBlockIndex(nFile, nBlockPos))
1747 return error("LoadBlockIndex() : genesis block not accepted");
1755 void PrintBlockTree()
1757 // precompute tree structure
1758 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1759 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1761 CBlockIndex* pindex = (*mi).second;
1762 mapNext[pindex->pprev].push_back(pindex);
1764 //while (rand() % 3 == 0)
1765 // mapNext[pindex->pprev].push_back(pindex);
1768 vector<pair<int, CBlockIndex*> > vStack;
1769 vStack.push_back(make_pair(0, pindexGenesisBlock));
1772 while (!vStack.empty())
1774 int nCol = vStack.back().first;
1775 CBlockIndex* pindex = vStack.back().second;
1778 // print split or gap
1779 if (nCol > nPrevCol)
1781 for (int i = 0; i < nCol-1; i++)
1785 else if (nCol < nPrevCol)
1787 for (int i = 0; i < nCol; i++)
1794 for (int i = 0; i < nCol; i++)
1799 block.ReadFromDisk(pindex);
1800 printf("%d (%u,%u) %s %s tx %d",
1804 block.GetHash().ToString().substr(0,20).c_str(),
1805 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1808 PrintWallets(block);
1810 // put the main timechain first
1811 vector<CBlockIndex*>& vNext = mapNext[pindex];
1812 for (int i = 0; i < vNext.size(); i++)
1814 if (vNext[i]->pnext)
1816 swap(vNext[0], vNext[i]);
1822 for (int i = 0; i < vNext.size(); i++)
1823 vStack.push_back(make_pair(nCol+i, vNext[i]));
1836 //////////////////////////////////////////////////////////////////////////////
1841 map<uint256, CAlert> mapAlerts;
1842 CCriticalSection cs_mapAlerts;
1844 string GetWarnings(string strFor)
1847 string strStatusBar;
1849 if (GetBoolArg("-testsafemode"))
1852 // Misc warnings like out of disk space and clock is wrong
1853 if (strMiscWarning != "")
1856 strStatusBar = strMiscWarning;
1859 // Longer invalid proof-of-work chain
1860 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1863 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1867 CRITICAL_BLOCK(cs_mapAlerts)
1869 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1871 const CAlert& alert = item.second;
1872 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1874 nPriority = alert.nPriority;
1875 strStatusBar = alert.strStatusBar;
1880 if (strFor == "statusbar")
1881 return strStatusBar;
1882 else if (strFor == "rpc")
1884 assert(!"GetWarnings() : invalid parameter");
1888 bool CAlert::ProcessAlert()
1890 if (!CheckSignature())
1895 CRITICAL_BLOCK(cs_mapAlerts)
1897 // Cancel previous alerts
1898 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1900 const CAlert& alert = (*mi).second;
1903 printf("cancelling alert %d\n", alert.nID);
1904 mapAlerts.erase(mi++);
1906 else if (!alert.IsInEffect())
1908 printf("expiring alert %d\n", alert.nID);
1909 mapAlerts.erase(mi++);
1915 // Check if this alert has been cancelled
1916 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1918 const CAlert& alert = item.second;
1919 if (alert.Cancels(*this))
1921 printf("alert already cancelled by %d\n", alert.nID);
1927 mapAlerts.insert(make_pair(GetHash(), *this));
1930 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1942 //////////////////////////////////////////////////////////////////////////////
1948 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1952 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1953 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1955 // Don't know what it is, just say we already got one
1962 // The message start string is designed to be unlikely to occur in normal data.
1963 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1964 // a large 4-byte int at any alignment.
1965 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1968 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1970 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1971 RandAddSeedPerfmon();
1973 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1974 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1976 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1978 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1986 if (strCommand == "version")
1988 // Each connection can only send one version message
1989 if (pfrom->nVersion != 0)
1996 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1997 if (pfrom->nVersion == 10300)
1998 pfrom->nVersion = 300;
1999 if (pfrom->nVersion >= 106 && !vRecv.empty())
2000 vRecv >> addrFrom >> nNonce;
2001 if (pfrom->nVersion >= 106 && !vRecv.empty())
2002 vRecv >> pfrom->strSubVer;
2003 if (pfrom->nVersion >= 209 && !vRecv.empty())
2004 vRecv >> pfrom->nStartingHeight;
2006 if (pfrom->nVersion == 0)
2009 // Disconnect if we connected to ourself
2010 if (nNonce == nLocalHostNonce && nNonce > 1)
2012 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2013 pfrom->fDisconnect = true;
2017 // Be shy and don't send version until we hear
2018 if (pfrom->fInbound)
2019 pfrom->PushVersion();
2021 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2023 AddTimeData(pfrom->addr.ip, nTime);
2026 if (pfrom->nVersion >= 209)
2027 pfrom->PushMessage("verack");
2028 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2029 if (pfrom->nVersion < 209)
2030 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2032 if (!pfrom->fInbound)
2034 // Advertise our address
2035 if (addrLocalHost.IsRoutable() && !fUseProxy)
2037 CAddress addr(addrLocalHost);
2038 addr.nTime = GetAdjustedTime();
2039 pfrom->PushAddress(addr);
2042 // Get recent addresses
2043 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2045 pfrom->PushMessage("getaddr");
2046 pfrom->fGetAddr = true;
2050 // Ask the first connected node for block updates
2051 static int nAskedForBlocks = 0;
2052 if (!pfrom->fClient &&
2053 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2054 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2057 pfrom->PushGetBlocks(pindexBest, uint256(0));
2061 CRITICAL_BLOCK(cs_mapAlerts)
2062 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2063 item.second.RelayTo(pfrom);
2065 pfrom->fSuccessfullyConnected = true;
2067 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2071 else if (pfrom->nVersion == 0)
2073 // Must have a version message before anything else
2078 else if (strCommand == "verack")
2080 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2084 else if (strCommand == "addr")
2086 vector<CAddress> vAddr;
2089 // Don't want addr from older versions unless seeding
2090 if (pfrom->nVersion < 209)
2092 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2094 if (vAddr.size() > 1000)
2095 return error("message addr size() = %d", vAddr.size());
2097 // Store the new addresses
2100 int64 nNow = GetAdjustedTime();
2101 int64 nSince = nNow - 10 * 60;
2102 BOOST_FOREACH(CAddress& addr, vAddr)
2106 // ignore IPv6 for now, since it isn't implemented anyway
2109 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2110 addr.nTime = nNow - 5 * 24 * 60 * 60;
2111 AddAddress(addr, 2 * 60 * 60, &addrDB);
2112 pfrom->AddAddressKnown(addr);
2113 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2115 // Relay to a limited number of other nodes
2116 CRITICAL_BLOCK(cs_vNodes)
2118 // Use deterministic randomness to send to the same nodes for 24 hours
2119 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2120 static uint256 hashSalt;
2122 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2123 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2124 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2125 multimap<uint256, CNode*> mapMix;
2126 BOOST_FOREACH(CNode* pnode, vNodes)
2128 if (pnode->nVersion < 31402)
2130 unsigned int nPointer;
2131 memcpy(&nPointer, &pnode, sizeof(nPointer));
2132 uint256 hashKey = hashRand ^ nPointer;
2133 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2134 mapMix.insert(make_pair(hashKey, pnode));
2136 int nRelayNodes = 2;
2137 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2138 ((*mi).second)->PushAddress(addr);
2142 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2143 if (vAddr.size() < 1000)
2144 pfrom->fGetAddr = false;
2148 else if (strCommand == "inv")
2152 if (vInv.size() > 50000)
2153 return error("message inv size() = %d", vInv.size());
2156 BOOST_FOREACH(const CInv& inv, vInv)
2160 pfrom->AddInventoryKnown(inv);
2162 bool fAlreadyHave = AlreadyHave(txdb, inv);
2164 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2168 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2169 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2171 // Track requests for our stuff
2172 Inventory(inv.hash);
2177 else if (strCommand == "getdata")
2181 if (vInv.size() > 50000)
2182 return error("message getdata size() = %d", vInv.size());
2184 BOOST_FOREACH(const CInv& inv, vInv)
2188 printf("received getdata for: %s\n", inv.ToString().c_str());
2190 if (inv.type == MSG_BLOCK)
2192 // Send block from disk
2193 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2194 if (mi != mapBlockIndex.end())
2197 block.ReadFromDisk((*mi).second);
2198 pfrom->PushMessage("block", block);
2200 // Trigger them to send a getblocks request for the next batch of inventory
2201 if (inv.hash == pfrom->hashContinue)
2203 // Bypass PushInventory, this must send even if redundant,
2204 // and we want it right after the last block so they don't
2205 // wait for other stuff first.
2207 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2208 pfrom->PushMessage("inv", vInv);
2209 pfrom->hashContinue = 0;
2213 else if (inv.IsKnownType())
2215 // Send stream from relay memory
2216 CRITICAL_BLOCK(cs_mapRelay)
2218 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2219 if (mi != mapRelay.end())
2220 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2224 // Track requests for our stuff
2225 Inventory(inv.hash);
2230 else if (strCommand == "getblocks")
2232 CBlockLocator locator;
2234 vRecv >> locator >> hashStop;
2236 // Find the last block the caller has in the main chain
2237 CBlockIndex* pindex = locator.GetBlockIndex();
2239 // Send the rest of the chain
2241 pindex = pindex->pnext;
2242 int nLimit = 500 + locator.GetDistanceBack();
2243 unsigned int nBytes = 0;
2244 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2245 for (; pindex; pindex = pindex->pnext)
2247 if (pindex->GetBlockHash() == hashStop)
2249 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2252 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2254 block.ReadFromDisk(pindex, true);
2255 nBytes += block.GetSerializeSize(SER_NETWORK);
2256 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2258 // When this block is requested, we'll send an inv that'll make them
2259 // getblocks the next batch of inventory.
2260 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2261 pfrom->hashContinue = pindex->GetBlockHash();
2268 else if (strCommand == "getheaders")
2270 CBlockLocator locator;
2272 vRecv >> locator >> hashStop;
2274 CBlockIndex* pindex = NULL;
2275 if (locator.IsNull())
2277 // If locator is null, return the hashStop block
2278 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2279 if (mi == mapBlockIndex.end())
2281 pindex = (*mi).second;
2285 // Find the last block the caller has in the main chain
2286 pindex = locator.GetBlockIndex();
2288 pindex = pindex->pnext;
2291 vector<CBlock> vHeaders;
2292 int nLimit = 2000 + locator.GetDistanceBack();
2293 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2294 for (; pindex; pindex = pindex->pnext)
2296 vHeaders.push_back(pindex->GetBlockHeader());
2297 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2300 pfrom->PushMessage("headers", vHeaders);
2304 else if (strCommand == "tx")
2306 vector<uint256> vWorkQueue;
2307 CDataStream vMsg(vRecv);
2311 CInv inv(MSG_TX, tx.GetHash());
2312 pfrom->AddInventoryKnown(inv);
2314 bool fMissingInputs = false;
2315 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2317 SyncWithWallets(tx, NULL, true);
2318 RelayMessage(inv, vMsg);
2319 mapAlreadyAskedFor.erase(inv);
2320 vWorkQueue.push_back(inv.hash);
2322 // Recursively process any orphan transactions that depended on this one
2323 for (int i = 0; i < vWorkQueue.size(); i++)
2325 uint256 hashPrev = vWorkQueue[i];
2326 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2327 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2330 const CDataStream& vMsg = *((*mi).second);
2332 CDataStream(vMsg) >> tx;
2333 CInv inv(MSG_TX, tx.GetHash());
2335 if (tx.AcceptToMemoryPool(true))
2337 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2338 SyncWithWallets(tx, NULL, true);
2339 RelayMessage(inv, vMsg);
2340 mapAlreadyAskedFor.erase(inv);
2341 vWorkQueue.push_back(inv.hash);
2346 BOOST_FOREACH(uint256 hash, vWorkQueue)
2347 EraseOrphanTx(hash);
2349 else if (fMissingInputs)
2351 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2354 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2355 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2357 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2362 else if (strCommand == "block")
2367 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2370 CInv inv(MSG_BLOCK, block.GetHash());
2371 pfrom->AddInventoryKnown(inv);
2373 if (ProcessBlock(pfrom, &block))
2374 mapAlreadyAskedFor.erase(inv);
2378 else if (strCommand == "getaddr")
2380 // Nodes rebroadcast an addr every 24 hours
2381 pfrom->vAddrToSend.clear();
2382 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2383 CRITICAL_BLOCK(cs_mapAddresses)
2385 unsigned int nCount = 0;
2386 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2388 const CAddress& addr = item.second;
2389 if (addr.nTime > nSince)
2392 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2394 const CAddress& addr = item.second;
2395 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2396 pfrom->PushAddress(addr);
2402 else if (strCommand == "checkorder")
2407 if (!GetBoolArg("-allowreceivebyip"))
2409 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2416 /// we have a chance to check the order here
2418 // Keep giving the same key to the same ip until they use it
2419 if (!mapReuseKey.count(pfrom->addr.ip))
2420 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2422 // Send back approval of order and pubkey to use
2423 CScript scriptPubKey;
2424 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2425 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2429 else if (strCommand == "reply")
2434 CRequestTracker tracker;
2435 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2437 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2438 if (mi != pfrom->mapRequests.end())
2440 tracker = (*mi).second;
2441 pfrom->mapRequests.erase(mi);
2444 if (!tracker.IsNull())
2445 tracker.fn(tracker.param1, vRecv);
2449 else if (strCommand == "ping")
2454 else if (strCommand == "alert")
2459 if (alert.ProcessAlert())
2462 pfrom->setKnown.insert(alert.GetHash());
2463 CRITICAL_BLOCK(cs_vNodes)
2464 BOOST_FOREACH(CNode* pnode, vNodes)
2465 alert.RelayTo(pnode);
2472 // Ignore unknown commands for extensibility
2476 // Update the last seen time for this node's address
2477 if (pfrom->fNetworkNode)
2478 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2479 AddressCurrentlyConnected(pfrom->addr);
2485 bool ProcessMessages(CNode* pfrom)
2487 CDataStream& vRecv = pfrom->vRecv;
2491 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2495 // (4) message start
2504 // Scan for message start
2505 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2506 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2507 if (vRecv.end() - pstart < nHeaderSize)
2509 if (vRecv.size() > nHeaderSize)
2511 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2512 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2516 if (pstart - vRecv.begin() > 0)
2517 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2518 vRecv.erase(vRecv.begin(), pstart);
2521 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2526 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2529 string strCommand = hdr.GetCommand();
2532 unsigned int nMessageSize = hdr.nMessageSize;
2533 if (nMessageSize > MAX_SIZE)
2535 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2538 if (nMessageSize > vRecv.size())
2540 // Rewind and wait for rest of message
2541 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2546 if (vRecv.GetVersion() >= 209)
2548 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2549 unsigned int nChecksum = 0;
2550 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2551 if (nChecksum != hdr.nChecksum)
2553 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2554 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2559 // Copy message to its own buffer
2560 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2561 vRecv.ignore(nMessageSize);
2567 CRITICAL_BLOCK(cs_main)
2568 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2572 catch (std::ios_base::failure& e)
2574 if (strstr(e.what(), "end of data"))
2576 // Allow exceptions from underlength message on vRecv
2577 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());
2579 else if (strstr(e.what(), "size too large"))
2581 // Allow exceptions from overlong size
2582 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2586 PrintExceptionContinue(&e, "ProcessMessage()");
2589 catch (std::exception& e) {
2590 PrintExceptionContinue(&e, "ProcessMessage()");
2592 PrintExceptionContinue(NULL, "ProcessMessage()");
2596 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2604 bool SendMessages(CNode* pto, bool fSendTrickle)
2606 CRITICAL_BLOCK(cs_main)
2608 // Don't send anything until we get their version message
2609 if (pto->nVersion == 0)
2613 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2614 pto->PushMessage("ping");
2616 // Resend wallet transactions that haven't gotten in a block yet
2617 ResendWalletTransactions();
2619 // Address refresh broadcast
2620 static int64 nLastRebroadcast;
2621 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2623 nLastRebroadcast = GetTime();
2624 CRITICAL_BLOCK(cs_vNodes)
2626 BOOST_FOREACH(CNode* pnode, vNodes)
2628 // Periodically clear setAddrKnown to allow refresh broadcasts
2629 pnode->setAddrKnown.clear();
2631 // Rebroadcast our address
2632 if (addrLocalHost.IsRoutable() && !fUseProxy)
2634 CAddress addr(addrLocalHost);
2635 addr.nTime = GetAdjustedTime();
2636 pnode->PushAddress(addr);
2642 // Clear out old addresses periodically so it's not too much work at once
2643 static int64 nLastClear;
2644 if (nLastClear == 0)
2645 nLastClear = GetTime();
2646 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2648 nLastClear = GetTime();
2649 CRITICAL_BLOCK(cs_mapAddresses)
2652 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2653 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2654 mi != mapAddresses.end();)
2656 const CAddress& addr = (*mi).second;
2657 if (addr.nTime < nSince)
2659 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2661 addrdb.EraseAddress(addr);
2662 mapAddresses.erase(mi++);
2676 vector<CAddress> vAddr;
2677 vAddr.reserve(pto->vAddrToSend.size());
2678 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2680 // returns true if wasn't already contained in the set
2681 if (pto->setAddrKnown.insert(addr).second)
2683 vAddr.push_back(addr);
2684 // receiver rejects addr messages larger than 1000
2685 if (vAddr.size() >= 1000)
2687 pto->PushMessage("addr", vAddr);
2692 pto->vAddrToSend.clear();
2694 pto->PushMessage("addr", vAddr);
2699 // Message: inventory
2702 vector<CInv> vInvWait;
2703 CRITICAL_BLOCK(pto->cs_inventory)
2705 vInv.reserve(pto->vInventoryToSend.size());
2706 vInvWait.reserve(pto->vInventoryToSend.size());
2707 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2709 if (pto->setInventoryKnown.count(inv))
2712 // trickle out tx inv to protect privacy
2713 if (inv.type == MSG_TX && !fSendTrickle)
2715 // 1/4 of tx invs blast to all immediately
2716 static uint256 hashSalt;
2718 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2719 uint256 hashRand = inv.hash ^ hashSalt;
2720 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2721 bool fTrickleWait = ((hashRand & 3) != 0);
2723 // always trickle our own transactions
2727 if (GetTransaction(inv.hash, wtx))
2729 fTrickleWait = true;
2734 vInvWait.push_back(inv);
2739 // returns true if wasn't already contained in the set
2740 if (pto->setInventoryKnown.insert(inv).second)
2742 vInv.push_back(inv);
2743 if (vInv.size() >= 1000)
2745 pto->PushMessage("inv", vInv);
2750 pto->vInventoryToSend = vInvWait;
2753 pto->PushMessage("inv", vInv);
2759 vector<CInv> vGetData;
2760 int64 nNow = GetTime() * 1000000;
2762 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2764 const CInv& inv = (*pto->mapAskFor.begin()).second;
2765 if (!AlreadyHave(txdb, inv))
2767 printf("sending getdata: %s\n", inv.ToString().c_str());
2768 vGetData.push_back(inv);
2769 if (vGetData.size() >= 1000)
2771 pto->PushMessage("getdata", vGetData);
2775 mapAlreadyAskedFor[inv] = nNow;
2776 pto->mapAskFor.erase(pto->mapAskFor.begin());
2778 if (!vGetData.empty())
2779 pto->PushMessage("getdata", vGetData);
2798 //////////////////////////////////////////////////////////////////////////////
2803 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2805 unsigned char* pdata = (unsigned char*)pbuffer;
2806 unsigned int blocks = 1 + ((len + 8) / 64);
2807 unsigned char* pend = pdata + 64 * blocks;
2808 memset(pdata + len, 0, 64 * blocks - len);
2810 unsigned int bits = len * 8;
2811 pend[-1] = (bits >> 0) & 0xff;
2812 pend[-2] = (bits >> 8) & 0xff;
2813 pend[-3] = (bits >> 16) & 0xff;
2814 pend[-4] = (bits >> 24) & 0xff;
2818 using CryptoPP::ByteReverse;
2820 static const unsigned int pSHA256InitState[8] =
2821 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2823 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2825 memcpy(pstate, pinit, 32);
2826 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2830 // ScanHash scans nonces looking for a hash with at least some zero bits.
2831 // It operates on big endian data. Caller does the byte reversing.
2832 // All input buffers are 16-byte aligned. nNonce is usually preserved
2833 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2834 // the block is rebuilt and nNonce starts over at zero.
2836 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2838 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2842 // Hash pdata using pmidstate as the starting state into
2843 // preformatted buffer phash1, then hash phash1 into phash
2845 SHA256Transform(phash1, pdata, pmidstate);
2846 SHA256Transform(phash, phash1, pSHA256InitState);
2848 // Return the nonce if the hash has at least some zero bits,
2849 // caller will check if it has enough to reach the target
2850 if (((unsigned short*)phash)[14] == 0)
2853 // If nothing found after trying for a while, return -1
2854 if ((nNonce & 0xffff) == 0)
2856 nHashesDone = 0xffff+1;
2862 // Some explaining would be appreciated
2867 set<uint256> setDependsOn;
2870 COrphan(CTransaction* ptxIn)
2878 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2879 BOOST_FOREACH(uint256 hash, setDependsOn)
2880 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2885 CBlock* CreateNewBlock(CReserveKey& reservekey)
2887 CBlockIndex* pindexPrev = pindexBest;
2890 auto_ptr<CBlock> pblock(new CBlock());
2894 // Create coinbase tx
2896 txNew.vin.resize(1);
2897 txNew.vin[0].prevout.SetNull();
2898 txNew.vout.resize(1);
2899 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2901 // Add our coinbase tx as first transaction
2902 pblock->vtx.push_back(txNew);
2904 // Collect memory pool transactions into the block
2906 CRITICAL_BLOCK(cs_main)
2907 CRITICAL_BLOCK(cs_mapTransactions)
2911 // Priority order to process transactions
2912 list<COrphan> vOrphan; // list memory doesn't move
2913 map<uint256, vector<COrphan*> > mapDependers;
2914 multimap<double, CTransaction*> mapPriority;
2915 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2917 CTransaction& tx = (*mi).second;
2918 if (tx.IsCoinBase() || !tx.IsFinal())
2921 COrphan* porphan = NULL;
2922 double dPriority = 0;
2923 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2925 // Read prev transaction
2926 CTransaction txPrev;
2928 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2930 // Has to wait for dependencies
2933 // Use list for automatic deletion
2934 vOrphan.push_back(COrphan(&tx));
2935 porphan = &vOrphan.back();
2937 mapDependers[txin.prevout.hash].push_back(porphan);
2938 porphan->setDependsOn.insert(txin.prevout.hash);
2941 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2943 // Read block header
2944 int nConf = txindex.GetDepthInMainChain();
2946 dPriority += (double)nValueIn * nConf;
2948 if (fDebug && GetBoolArg("-printpriority"))
2949 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2952 // Priority is sum(valuein * age) / txsize
2953 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2956 porphan->dPriority = dPriority;
2958 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2960 if (fDebug && GetBoolArg("-printpriority"))
2962 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2969 // Collect transactions into block
2970 map<uint256, CTxIndex> mapTestPool;
2971 uint64 nBlockSize = 1000;
2972 int nBlockSigOps = 100;
2973 while (!mapPriority.empty())
2975 // Take highest priority transaction off priority queue
2976 double dPriority = -(*mapPriority.begin()).first;
2977 CTransaction& tx = *(*mapPriority.begin()).second;
2978 mapPriority.erase(mapPriority.begin());
2981 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2982 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2985 // Legacy limits on sigOps:
2986 int nTxSigOps = tx.GetSigOpCount();
2987 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2990 // Transaction fee required depends on block size
2991 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2992 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2994 // Connecting shouldn't fail due to dependency on other memory pool transactions
2995 // because we're already processing them in order of dependency
2996 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2998 MapPrevTx mapInputs;
2999 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3002 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3003 if (nTxFees < nMinFee)
3006 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3007 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3010 if (!tx.ConnectInputs(mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3012 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3013 swap(mapTestPool, mapTestPoolTmp);
3016 pblock->vtx.push_back(tx);
3017 nBlockSize += nTxSize;
3018 nBlockSigOps += nTxSigOps;
3021 // Add transactions that depend on this one to the priority queue
3022 uint256 hash = tx.GetHash();
3023 if (mapDependers.count(hash))
3025 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3027 if (!porphan->setDependsOn.empty())
3029 porphan->setDependsOn.erase(hash);
3030 if (porphan->setDependsOn.empty())
3031 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3037 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3040 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3041 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3042 pblock->UpdateTime(pindexPrev);
3043 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
3046 return pblock.release();
3050 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3052 // Update nExtraNonce
3053 static uint256 hashPrevBlock;
3054 if (hashPrevBlock != pblock->hashPrevBlock)
3057 hashPrevBlock = pblock->hashPrevBlock;
3060 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3061 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3065 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3068 // Prebuild hash buffers
3075 uint256 hashPrevBlock;
3076 uint256 hashMerkleRoot;
3079 unsigned int nNonce;
3082 unsigned char pchPadding0[64];
3084 unsigned char pchPadding1[64];
3087 memset(&tmp, 0, sizeof(tmp));
3089 tmp.block.nVersion = pblock->nVersion;
3090 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3091 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3092 tmp.block.nTime = pblock->nTime;
3093 tmp.block.nBits = pblock->nBits;
3094 tmp.block.nNonce = pblock->nNonce;
3096 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3097 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3099 // Byte swap all the input buffer
3100 for (int i = 0; i < sizeof(tmp)/4; i++)
3101 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3103 // Precalc the first half of the first hash, which stays constant
3104 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3106 memcpy(pdata, &tmp.block, 128);
3107 memcpy(phash1, &tmp.hash1, 64);
3111 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3113 uint256 hash = pblock->GetHash();
3114 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3116 if (hash > hashTarget)
3120 printf("BitcoinMiner:\n");
3121 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3123 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3124 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3127 CRITICAL_BLOCK(cs_main)
3129 if (pblock->hashPrevBlock != hashBestChain)
3130 return error("BitcoinMiner : generated block is stale");
3132 // Remove key from key pool
3133 reservekey.KeepKey();
3135 // Track how many getdata requests this block gets
3136 CRITICAL_BLOCK(wallet.cs_wallet)
3137 wallet.mapRequestCount[pblock->GetHash()] = 0;
3139 // Process this block the same as if we had received it from another node
3140 if (!ProcessBlock(NULL, pblock))
3141 return error("BitcoinMiner : ProcessBlock, block not accepted");
3148 void static ThreadBitcoinMiner(void* parg);
3150 void static BitcoinMiner(CWallet *pwallet)
3152 printf("BitcoinMiner started\n");
3153 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3155 // Each thread has its own key and counter
3156 CReserveKey reservekey(pwallet);
3157 unsigned int nExtraNonce = 0;
3159 while (fGenerateBitcoins)
3161 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3165 while (vNodes.empty() || IsInitialBlockDownload())
3170 if (!fGenerateBitcoins)
3178 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3179 CBlockIndex* pindexPrev = pindexBest;
3181 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3184 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3186 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3190 // Prebuild hash buffers
3192 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3193 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3194 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3196 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3198 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3199 unsigned int& nBlockBits = *(unsigned int*)(pdata + 64 + 8);
3200 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3206 int64 nStart = GetTime();
3207 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3209 uint256& hash = *alignup<16>(hashbuf);
3212 unsigned int nHashesDone = 0;
3213 unsigned int nNonceFound;
3216 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3217 (char*)&hash, nHashesDone);
3219 // Check if something found
3220 if (nNonceFound != -1)
3222 for (int i = 0; i < sizeof(hash)/4; i++)
3223 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3225 if (hash <= hashTarget)
3228 pblock->nNonce = ByteReverse(nNonceFound);
3229 assert(hash == pblock->GetHash());
3231 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3232 CheckWork(pblock.get(), *pwalletMain, reservekey);
3233 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3239 static int64 nHashCounter;
3240 if (nHPSTimerStart == 0)
3242 nHPSTimerStart = GetTimeMillis();
3246 nHashCounter += nHashesDone;
3247 if (GetTimeMillis() - nHPSTimerStart > 4000)
3249 static CCriticalSection cs;
3252 if (GetTimeMillis() - nHPSTimerStart > 4000)
3254 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3255 nHPSTimerStart = GetTimeMillis();
3257 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3258 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3259 static int64 nLogTime;
3260 if (GetTime() - nLogTime > 30 * 60)
3262 nLogTime = GetTime();
3263 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3264 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3270 // Check for stop or if block needs to be rebuilt
3273 if (!fGenerateBitcoins)
3275 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3279 if (nBlockNonce >= 0xffff0000)
3281 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3283 if (pindexPrev != pindexBest)
3286 // Update nTime every few seconds
3287 pblock->UpdateTime(pindexPrev);
3288 nBlockTime = ByteReverse(pblock->nTime);
3291 // Changing pblock->nTime can change work required on testnet:
3292 nBlockBits = ByteReverse(pblock->nBits);
3293 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3299 void static ThreadBitcoinMiner(void* parg)
3301 CWallet* pwallet = (CWallet*)parg;
3304 vnThreadsRunning[3]++;
3305 BitcoinMiner(pwallet);
3306 vnThreadsRunning[3]--;
3308 catch (std::exception& e) {
3309 vnThreadsRunning[3]--;
3310 PrintException(&e, "ThreadBitcoinMiner()");
3312 vnThreadsRunning[3]--;
3313 PrintException(NULL, "ThreadBitcoinMiner()");
3315 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3317 if (vnThreadsRunning[3] == 0)
3319 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3323 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3325 if (fGenerateBitcoins != fGenerate)
3327 fGenerateBitcoins = fGenerate;
3328 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3331 if (fGenerateBitcoins)
3333 int nProcessors = boost::thread::hardware_concurrency();
3334 printf("%d processors\n", nProcessors);
3335 if (nProcessors < 1)
3337 if (fLimitProcessors && nProcessors > nLimitProcessors)
3338 nProcessors = nLimitProcessors;
3339 int nAddThreads = nProcessors - vnThreadsRunning[3];
3340 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3341 for (int i = 0; i < nAddThreads; i++)
3343 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3344 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");