1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
9 #include "cryptopp/sha.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 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 CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 int nTotalBlocksEstimate = 134444; // Conservative estimate of total nr of blocks on main chain
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 static AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
169 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
170 BOOST_FOREACH(const CTxIn& txin, tx.vin)
171 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
174 void static EraseOrphanTx(uint256 hash)
176 if (!mapOrphanTransactions.count(hash))
178 const CDataStream* pvMsg = mapOrphanTransactions[hash];
180 CDataStream(*pvMsg) >> tx;
181 BOOST_FOREACH(const CTxIn& txin, tx.vin)
183 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
184 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
186 if ((*mi).second == pvMsg)
187 mapOrphanTransactionsByPrev.erase(mi++);
193 mapOrphanTransactions.erase(hash);
203 //////////////////////////////////////////////////////////////////////////////
205 // CTransaction and CTxIndex
208 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
211 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
213 if (!ReadFromDisk(txindexRet.pos))
215 if (prevout.n >= vout.size())
223 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
226 return ReadFromDisk(txdb, prevout, txindex);
229 bool CTransaction::ReadFromDisk(COutPoint prevout)
233 return ReadFromDisk(txdb, prevout, txindex);
238 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
250 // Load the block this tx is in
252 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
254 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
259 // Update the tx's hashBlock
260 hashBlock = pblock->GetHash();
262 // Locate the transaction
263 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
264 if (pblock->vtx[nIndex] == *(CTransaction*)this)
266 if (nIndex == pblock->vtx.size())
268 vMerkleBranch.clear();
270 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
274 // Fill in merkle branch
275 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
278 // Is the tx in a block that's in the main chain
279 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
280 if (mi == mapBlockIndex.end())
282 CBlockIndex* pindex = (*mi).second;
283 if (!pindex || !pindex->IsInMainChain())
286 return pindexBest->nHeight - pindex->nHeight + 1;
295 bool CTransaction::CheckTransaction() const
297 // Basic checks that don't depend on any context
298 if (vin.empty() || vout.empty())
299 return error("CTransaction::CheckTransaction() : vin or vout empty");
302 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
303 return error("CTransaction::CheckTransaction() : size limits failed");
305 // Check for negative or overflow output values
307 BOOST_FOREACH(const CTxOut& txout, vout)
309 if (txout.nValue < 0)
310 return error("CTransaction::CheckTransaction() : txout.nValue negative");
311 if (txout.nValue > MAX_MONEY)
312 return error("CTransaction::CheckTransaction() : txout.nValue too high");
313 nValueOut += txout.nValue;
314 if (!MoneyRange(nValueOut))
315 return error("CTransaction::CheckTransaction() : txout total out of range");
318 // Check for duplicate inputs
319 set<COutPoint> vInOutPoints;
320 BOOST_FOREACH(const CTxIn& txin, vin)
322 if (vInOutPoints.count(txin.prevout))
324 vInOutPoints.insert(txin.prevout);
329 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
330 return error("CTransaction::CheckTransaction() : coinbase script size");
334 BOOST_FOREACH(const CTxIn& txin, vin)
335 if (txin.prevout.IsNull())
336 return error("CTransaction::CheckTransaction() : prevout is null");
342 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
345 *pfMissingInputs = false;
347 if (!CheckTransaction())
348 return error("AcceptToMemoryPool() : CheckTransaction failed");
350 // Coinbase is only valid in a block, not as a loose transaction
352 return error("AcceptToMemoryPool() : coinbase as individual tx");
354 // To help v0.1.5 clients who would see it as a negative number
355 if ((int64)nLockTime > INT_MAX)
356 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
359 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
360 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
361 // attacks disallow transactions with more than one SigOp per 34 bytes.
362 // 34 bytes because a TxOut is:
363 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
364 if (GetSigOpCount() > nSize / 34 || nSize < 100)
365 return error("AcceptToMemoryPool() : nonstandard transaction");
367 // Rather not work on nonstandard transactions (unless -testnet)
368 if (!fTestNet && !IsStandard())
369 return error("AcceptToMemoryPool() : nonstandard transaction type");
371 // Do we already have it?
372 uint256 hash = GetHash();
373 CRITICAL_BLOCK(cs_mapTransactions)
374 if (mapTransactions.count(hash))
377 if (txdb.ContainsTx(hash))
380 // Check for conflicts with in-memory transactions
381 CTransaction* ptxOld = NULL;
382 for (int i = 0; i < vin.size(); i++)
384 COutPoint outpoint = vin[i].prevout;
385 if (mapNextTx.count(outpoint))
387 // Disable replacement feature for now
390 // Allow replacing with a newer version of the same transaction
393 ptxOld = mapNextTx[outpoint].ptx;
394 if (ptxOld->IsFinal())
396 if (!IsNewerThan(*ptxOld))
398 for (int i = 0; i < vin.size(); i++)
400 COutPoint outpoint = vin[i].prevout;
401 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
410 // Check against previous transactions
411 map<uint256, CTxIndex> mapUnused;
413 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
416 *pfMissingInputs = true;
417 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
420 // Don't accept it if it can't get into a block
421 if (nFees < GetMinFee(1000, true, true))
422 return error("AcceptToMemoryPool() : not enough fees");
424 // Continuously rate-limit free transactions
425 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
426 // be annoying or make other's transactions take longer to confirm.
427 if (nFees < MIN_RELAY_TX_FEE)
429 static CCriticalSection cs;
430 static double dFreeCount;
431 static int64 nLastTime;
432 int64 nNow = GetTime();
436 // Use an exponentially decaying ~10-minute window:
437 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
439 // -limitfreerelay unit is thousand-bytes-per-minute
440 // At default rate it would take over a month to fill 1GB
441 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
442 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
444 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
450 // Store transaction in memory
451 CRITICAL_BLOCK(cs_mapTransactions)
455 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
456 ptxOld->RemoveFromMemoryPool();
458 AddToMemoryPoolUnchecked();
461 ///// are we sure this is ok when loading transactions or restoring block txes
462 // If updated, erase old tx from wallet
464 EraseFromWallets(ptxOld->GetHash());
466 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
470 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
473 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
476 bool CTransaction::AddToMemoryPoolUnchecked()
478 // Add to memory pool without checking anything. Don't call this directly,
479 // call AcceptToMemoryPool to properly check the transaction first.
480 CRITICAL_BLOCK(cs_mapTransactions)
482 uint256 hash = GetHash();
483 mapTransactions[hash] = *this;
484 for (int i = 0; i < vin.size(); i++)
485 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
486 nTransactionsUpdated++;
492 bool CTransaction::RemoveFromMemoryPool()
494 // Remove transaction from memory pool
495 CRITICAL_BLOCK(cs_mapTransactions)
497 BOOST_FOREACH(const CTxIn& txin, vin)
498 mapNextTx.erase(txin.prevout);
499 mapTransactions.erase(GetHash());
500 nTransactionsUpdated++;
510 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
512 if (hashBlock == 0 || nIndex == -1)
515 // Find the block it claims to be in
516 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
517 if (mi == mapBlockIndex.end())
519 CBlockIndex* pindex = (*mi).second;
520 if (!pindex || !pindex->IsInMainChain())
523 // Make sure the merkle branch connects to this block
524 if (!fMerkleVerified)
526 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
528 fMerkleVerified = true;
531 nHeightRet = pindex->nHeight;
532 return pindexBest->nHeight - pindex->nHeight + 1;
536 int CMerkleTx::GetBlocksToMaturity() const
540 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
544 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
548 if (!IsInMainChain() && !ClientConnectInputs())
550 return CTransaction::AcceptToMemoryPool(txdb, false);
554 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
558 bool CMerkleTx::AcceptToMemoryPool()
561 return AcceptToMemoryPool(txdb);
566 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
568 CRITICAL_BLOCK(cs_mapTransactions)
570 // Add previous supporting transactions first
571 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
573 if (!tx.IsCoinBase())
575 uint256 hash = tx.GetHash();
576 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
577 tx.AcceptToMemoryPool(txdb, fCheckInputs);
580 return AcceptToMemoryPool(txdb, fCheckInputs);
585 bool CWalletTx::AcceptWalletTransaction()
588 return AcceptWalletTransaction(txdb);
591 int CTxIndex::GetDepthInMainChain() const
595 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
597 // Find the block in the index
598 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
599 if (mi == mapBlockIndex.end())
601 CBlockIndex* pindex = (*mi).second;
602 if (!pindex || !pindex->IsInMainChain())
604 return 1 + nBestHeight - pindex->nHeight;
616 //////////////////////////////////////////////////////////////////////////////
618 // CBlock and CBlockIndex
621 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
623 if (!fReadTransactions)
625 *this = pindex->GetBlockHeader();
628 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
630 if (GetHash() != pindex->GetBlockHash())
631 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
635 uint256 static GetOrphanRoot(const CBlock* pblock)
637 // Work back to the first block in the orphan chain
638 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
639 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
640 return pblock->GetHash();
643 int64 static GetBlockValue(int nHeight, int64 nFees)
645 int64 nSubsidy = 50 * COIN;
647 // Subsidy is cut in half every 4 years
648 nSubsidy >>= (nHeight / 210000);
650 return nSubsidy + nFees;
653 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
655 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
656 const int64 nTargetSpacing = 10 * 60;
657 const int64 nInterval = nTargetTimespan / nTargetSpacing;
660 if (pindexLast == NULL)
661 return bnProofOfWorkLimit.GetCompact();
663 // Only change once per interval
664 if ((pindexLast->nHeight+1) % nInterval != 0)
665 return pindexLast->nBits;
667 // Go back by what we want to be 14 days worth of blocks
668 const CBlockIndex* pindexFirst = pindexLast;
669 for (int i = 0; pindexFirst && i < nInterval-1; i++)
670 pindexFirst = pindexFirst->pprev;
673 // Limit adjustment step
674 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
675 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
676 if (nActualTimespan < nTargetTimespan/4)
677 nActualTimespan = nTargetTimespan/4;
678 if (nActualTimespan > nTargetTimespan*4)
679 nActualTimespan = nTargetTimespan*4;
683 bnNew.SetCompact(pindexLast->nBits);
684 bnNew *= nActualTimespan;
685 bnNew /= nTargetTimespan;
687 if (bnNew > bnProofOfWorkLimit)
688 bnNew = bnProofOfWorkLimit;
691 printf("GetNextWorkRequired RETARGET\n");
692 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
693 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
694 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
696 return bnNew.GetCompact();
699 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
702 bnTarget.SetCompact(nBits);
705 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
706 return error("CheckProofOfWork() : nBits below minimum work");
708 // Check proof of work matches claimed amount
709 if (hash > bnTarget.getuint256())
710 return error("CheckProofOfWork() : hash doesn't match nBits");
715 // Return conservative estimate of total number of blocks, 0 if unknown
716 int GetTotalBlocksEstimate()
724 return nTotalBlocksEstimate;
728 bool IsInitialBlockDownload()
730 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
732 static int64 nLastUpdate;
733 static CBlockIndex* pindexLastBest;
734 if (pindexBest != pindexLastBest)
736 pindexLastBest = pindexBest;
737 nLastUpdate = GetTime();
739 return (GetTime() - nLastUpdate < 10 &&
740 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
743 void static InvalidChainFound(CBlockIndex* pindexNew)
745 if (pindexNew->bnChainWork > bnBestInvalidWork)
747 bnBestInvalidWork = pindexNew->bnChainWork;
748 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
751 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());
752 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
753 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
754 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
767 bool CTransaction::DisconnectInputs(CTxDB& txdb)
769 // Relinquish previous transactions' spent pointers
772 BOOST_FOREACH(const CTxIn& txin, vin)
774 COutPoint prevout = txin.prevout;
776 // Get prev txindex from disk
778 if (!txdb.ReadTxIndex(prevout.hash, txindex))
779 return error("DisconnectInputs() : ReadTxIndex failed");
781 if (prevout.n >= txindex.vSpent.size())
782 return error("DisconnectInputs() : prevout.n out of range");
784 // Mark outpoint as not spent
785 txindex.vSpent[prevout.n].SetNull();
788 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
789 return error("DisconnectInputs() : UpdateTxIndex failed");
793 // Remove transaction from index
794 if (!txdb.EraseTxIndex(*this))
795 return error("DisconnectInputs() : EraseTxPos failed");
801 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
802 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
804 // Take over previous transactions' spent pointers
808 for (int i = 0; i < vin.size(); i++)
810 COutPoint prevout = vin[i].prevout;
815 if (fMiner && mapTestPool.count(prevout.hash))
817 // Get txindex from current proposed changes
818 txindex = mapTestPool[prevout.hash];
822 // Read txindex from txdb
823 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
825 if (!fFound && (fBlock || fMiner))
826 return fMiner ? false : error("ConnectInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
830 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
832 // Get prev tx from single transactions in memory
833 CRITICAL_BLOCK(cs_mapTransactions)
835 if (!mapTransactions.count(prevout.hash))
836 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
837 txPrev = mapTransactions[prevout.hash];
840 txindex.vSpent.resize(txPrev.vout.size());
844 // Get prev tx from disk
845 if (!txPrev.ReadFromDisk(txindex.pos))
846 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
849 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
850 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());
852 // If prev is coinbase, check that it's matured
853 if (txPrev.IsCoinBase())
854 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
855 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
856 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
859 if (!VerifySignature(txPrev, *this, i))
860 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
862 // Check for conflicts
863 if (!txindex.vSpent[prevout.n].IsNull())
864 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());
866 // Check for negative or overflow input values
867 nValueIn += txPrev.vout[prevout.n].nValue;
868 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
869 return error("ConnectInputs() : txin values out of range");
871 // Mark outpoints as spent
872 txindex.vSpent[prevout.n] = posThisTx;
877 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
878 return error("ConnectInputs() : UpdateTxIndex failed");
882 mapTestPool[prevout.hash] = txindex;
886 if (nValueIn < GetValueOut())
887 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
889 // Tally transaction fees
890 int64 nTxFee = nValueIn - GetValueOut();
892 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
893 if (nTxFee < nMinFee)
896 if (!MoneyRange(nFees))
897 return error("ConnectInputs() : nFees out of range");
902 // Add transaction to disk index
903 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
904 return error("ConnectInputs() : AddTxPos failed");
908 // Add transaction to test pool
909 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
916 bool CTransaction::ClientConnectInputs()
921 // Take over previous transactions' spent pointers
922 CRITICAL_BLOCK(cs_mapTransactions)
925 for (int i = 0; i < vin.size(); i++)
927 // Get prev tx from single transactions in memory
928 COutPoint prevout = vin[i].prevout;
929 if (!mapTransactions.count(prevout.hash))
931 CTransaction& txPrev = mapTransactions[prevout.hash];
933 if (prevout.n >= txPrev.vout.size())
937 if (!VerifySignature(txPrev, *this, i))
938 return error("ConnectInputs() : VerifySignature failed");
940 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
941 ///// this has to go away now that posNext is gone
942 // // Check for conflicts
943 // if (!txPrev.vout[prevout.n].posNext.IsNull())
944 // return error("ConnectInputs() : prev tx already used");
946 // // Flag outpoints as used
947 // txPrev.vout[prevout.n].posNext = posThisTx;
949 nValueIn += txPrev.vout[prevout.n].nValue;
951 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
952 return error("ClientConnectInputs() : txin values out of range");
954 if (GetValueOut() > nValueIn)
964 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
966 // Disconnect in reverse order
967 for (int i = vtx.size()-1; i >= 0; i--)
968 if (!vtx[i].DisconnectInputs(txdb))
971 // Update block index on disk without changing it in memory.
972 // The memory index structure will be changed after the db commits.
975 CDiskBlockIndex blockindexPrev(pindex->pprev);
976 blockindexPrev.hashNext = 0;
977 if (!txdb.WriteBlockIndex(blockindexPrev))
978 return error("DisconnectBlock() : WriteBlockIndex failed");
984 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
986 // Check it again in case a previous version let a bad block in
990 //// issue here: it doesn't know the version
991 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
993 map<uint256, CTxIndex> mapUnused;
995 BOOST_FOREACH(CTransaction& tx, vtx)
997 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
998 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1000 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
1004 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1007 // Update block index on disk without changing it in memory.
1008 // The memory index structure will be changed after the db commits.
1011 CDiskBlockIndex blockindexPrev(pindex->pprev);
1012 blockindexPrev.hashNext = pindex->GetBlockHash();
1013 if (!txdb.WriteBlockIndex(blockindexPrev))
1014 return error("ConnectBlock() : WriteBlockIndex failed");
1017 // Watch for transactions paying to me
1018 BOOST_FOREACH(CTransaction& tx, vtx)
1019 SyncWithWallets(tx, this, true);
1024 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1026 printf("REORGANIZE\n");
1029 CBlockIndex* pfork = pindexBest;
1030 CBlockIndex* plonger = pindexNew;
1031 while (pfork != plonger)
1033 while (plonger->nHeight > pfork->nHeight)
1034 if (!(plonger = plonger->pprev))
1035 return error("Reorganize() : plonger->pprev is null");
1036 if (pfork == plonger)
1038 if (!(pfork = pfork->pprev))
1039 return error("Reorganize() : pfork->pprev is null");
1042 // List of what to disconnect
1043 vector<CBlockIndex*> vDisconnect;
1044 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1045 vDisconnect.push_back(pindex);
1047 // List of what to connect
1048 vector<CBlockIndex*> vConnect;
1049 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1050 vConnect.push_back(pindex);
1051 reverse(vConnect.begin(), vConnect.end());
1053 // Disconnect shorter branch
1054 vector<CTransaction> vResurrect;
1055 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1058 if (!block.ReadFromDisk(pindex))
1059 return error("Reorganize() : ReadFromDisk for disconnect failed");
1060 if (!block.DisconnectBlock(txdb, pindex))
1061 return error("Reorganize() : DisconnectBlock failed");
1063 // Queue memory transactions to resurrect
1064 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1065 if (!tx.IsCoinBase())
1066 vResurrect.push_back(tx);
1069 // Connect longer branch
1070 vector<CTransaction> vDelete;
1071 for (int i = 0; i < vConnect.size(); i++)
1073 CBlockIndex* pindex = vConnect[i];
1075 if (!block.ReadFromDisk(pindex))
1076 return error("Reorganize() : ReadFromDisk for connect failed");
1077 if (!block.ConnectBlock(txdb, pindex))
1081 return error("Reorganize() : ConnectBlock failed");
1084 // Queue memory transactions to delete
1085 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1086 vDelete.push_back(tx);
1088 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1089 return error("Reorganize() : WriteHashBestChain failed");
1091 // Make sure it's successfully written to disk before changing memory structure
1092 if (!txdb.TxnCommit())
1093 return error("Reorganize() : TxnCommit failed");
1095 // Disconnect shorter branch
1096 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1098 pindex->pprev->pnext = NULL;
1100 // Connect longer branch
1101 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1103 pindex->pprev->pnext = pindex;
1105 // Resurrect memory transactions that were in the disconnected branch
1106 BOOST_FOREACH(CTransaction& tx, vResurrect)
1107 tx.AcceptToMemoryPool(txdb, false);
1109 // Delete redundant memory transactions that are in the connected branch
1110 BOOST_FOREACH(CTransaction& tx, vDelete)
1111 tx.RemoveFromMemoryPool();
1117 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1119 uint256 hash = GetHash();
1122 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1124 txdb.WriteHashBestChain(hash);
1125 if (!txdb.TxnCommit())
1126 return error("SetBestChain() : TxnCommit failed");
1127 pindexGenesisBlock = pindexNew;
1129 else if (hashPrevBlock == hashBestChain)
1131 // Adding to current best branch
1132 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1135 InvalidChainFound(pindexNew);
1136 return error("SetBestChain() : ConnectBlock failed");
1138 if (!txdb.TxnCommit())
1139 return error("SetBestChain() : TxnCommit failed");
1141 // Add to current best branch
1142 pindexNew->pprev->pnext = pindexNew;
1144 // Delete redundant memory transactions
1145 BOOST_FOREACH(CTransaction& tx, vtx)
1146 tx.RemoveFromMemoryPool();
1151 if (!Reorganize(txdb, pindexNew))
1154 InvalidChainFound(pindexNew);
1155 return error("SetBestChain() : Reorganize failed");
1159 // Update best block in wallet (so we can detect restored wallets)
1160 if (!IsInitialBlockDownload())
1162 const CBlockLocator locator(pindexNew);
1163 ::SetBestChain(locator);
1167 hashBestChain = hash;
1168 pindexBest = pindexNew;
1169 nBestHeight = pindexBest->nHeight;
1170 bnBestChainWork = pindexNew->bnChainWork;
1171 nTimeBestReceived = GetTime();
1172 nTransactionsUpdated++;
1173 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1179 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1181 // Check for duplicate
1182 uint256 hash = GetHash();
1183 if (mapBlockIndex.count(hash))
1184 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1186 // Construct new block index object
1187 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1189 return error("AddToBlockIndex() : new CBlockIndex failed");
1190 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1191 pindexNew->phashBlock = &((*mi).first);
1192 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1193 if (miPrev != mapBlockIndex.end())
1195 pindexNew->pprev = (*miPrev).second;
1196 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1198 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1202 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1203 if (!txdb.TxnCommit())
1207 if (pindexNew->bnChainWork > bnBestChainWork)
1208 if (!SetBestChain(txdb, pindexNew))
1213 if (pindexNew == pindexBest)
1215 // Notify UI to display prev block's coinbase if it was ours
1216 static uint256 hashPrevBestCoinBase;
1217 UpdatedTransaction(hashPrevBestCoinBase);
1218 hashPrevBestCoinBase = vtx[0].GetHash();
1228 bool CBlock::CheckBlock() const
1230 // These are checks that are independent of context
1231 // that can be verified before saving an orphan block.
1234 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1235 return error("CheckBlock() : size limits failed");
1237 // Check proof of work matches claimed amount
1238 if (!CheckProofOfWork(GetHash(), nBits))
1239 return error("CheckBlock() : proof of work failed");
1242 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1243 return error("CheckBlock() : block timestamp too far in the future");
1245 // First transaction must be coinbase, the rest must not be
1246 if (vtx.empty() || !vtx[0].IsCoinBase())
1247 return error("CheckBlock() : first tx is not coinbase");
1248 for (int i = 1; i < vtx.size(); i++)
1249 if (vtx[i].IsCoinBase())
1250 return error("CheckBlock() : more than one coinbase");
1252 // Check transactions
1253 BOOST_FOREACH(const CTransaction& tx, vtx)
1254 if (!tx.CheckTransaction())
1255 return error("CheckBlock() : CheckTransaction failed");
1257 // Check that it's not full of nonstandard transactions
1258 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1259 return error("CheckBlock() : too many nonstandard transactions");
1262 if (hashMerkleRoot != BuildMerkleTree())
1263 return error("CheckBlock() : hashMerkleRoot mismatch");
1268 bool CBlock::AcceptBlock()
1270 // Check for duplicate
1271 uint256 hash = GetHash();
1272 if (mapBlockIndex.count(hash))
1273 return error("AcceptBlock() : block already in mapBlockIndex");
1275 // Get prev block index
1276 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1277 if (mi == mapBlockIndex.end())
1278 return error("AcceptBlock() : prev block not found");
1279 CBlockIndex* pindexPrev = (*mi).second;
1280 int nHeight = pindexPrev->nHeight+1;
1282 // Check proof of work
1283 if (nBits != GetNextWorkRequired(pindexPrev))
1284 return error("AcceptBlock() : incorrect proof of work");
1286 // Check timestamp against prev
1287 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1288 return error("AcceptBlock() : block's timestamp is too early");
1290 // Check that all transactions are finalized
1291 BOOST_FOREACH(const CTransaction& tx, vtx)
1292 if (!tx.IsFinal(nHeight, GetBlockTime()))
1293 return error("AcceptBlock() : contains a non-final transaction");
1295 // Check that the block chain matches the known block chain up to a checkpoint
1297 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1298 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1299 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1300 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1301 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1302 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1303 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1304 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")))
1305 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1307 // Write block to history file
1308 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1309 return error("AcceptBlock() : out of disk space");
1310 unsigned int nFile = -1;
1311 unsigned int nBlockPos = 0;
1312 if (!WriteToDisk(nFile, nBlockPos))
1313 return error("AcceptBlock() : WriteToDisk failed");
1314 if (!AddToBlockIndex(nFile, nBlockPos))
1315 return error("AcceptBlock() : AddToBlockIndex failed");
1317 // Relay inventory, but don't relay old inventory during initial block download
1318 if (hashBestChain == hash)
1319 CRITICAL_BLOCK(cs_vNodes)
1320 BOOST_FOREACH(CNode* pnode, vNodes)
1321 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 134444))
1322 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1327 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1329 // Check for duplicate
1330 uint256 hash = pblock->GetHash();
1331 if (mapBlockIndex.count(hash))
1332 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1333 if (mapOrphanBlocks.count(hash))
1334 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1336 // Preliminary checks
1337 if (!pblock->CheckBlock())
1338 return error("ProcessBlock() : CheckBlock FAILED");
1340 // If don't already have its previous block, shunt it off to holding area until we get it
1341 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1343 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1344 CBlock* pblock2 = new CBlock(*pblock);
1345 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1346 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1348 // Ask this guy to fill in what we're missing
1350 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1355 if (!pblock->AcceptBlock())
1356 return error("ProcessBlock() : AcceptBlock FAILED");
1358 // Recursively process any orphan blocks that depended on this one
1359 vector<uint256> vWorkQueue;
1360 vWorkQueue.push_back(hash);
1361 for (int i = 0; i < vWorkQueue.size(); i++)
1363 uint256 hashPrev = vWorkQueue[i];
1364 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1365 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1368 CBlock* pblockOrphan = (*mi).second;
1369 if (pblockOrphan->AcceptBlock())
1370 vWorkQueue.push_back(pblockOrphan->GetHash());
1371 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1372 delete pblockOrphan;
1374 mapOrphanBlocksByPrev.erase(hashPrev);
1377 printf("ProcessBlock: ACCEPTED\n");
1388 bool CheckDiskSpace(uint64 nAdditionalBytes)
1390 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1392 // Check for 15MB because database could create another 10MB log file at any time
1393 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1396 string strMessage = _("Warning: Disk space is low ");
1397 strMiscWarning = strMessage;
1398 printf("*** %s\n", strMessage.c_str());
1399 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1400 CreateThread(Shutdown, NULL);
1406 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1410 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1413 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1415 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1424 static unsigned int nCurrentBlockFile = 1;
1426 FILE* AppendBlockFile(unsigned int& nFileRet)
1431 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1434 if (fseek(file, 0, SEEK_END) != 0)
1436 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1437 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1439 nFileRet = nCurrentBlockFile;
1443 nCurrentBlockFile++;
1447 bool LoadBlockIndex(bool fAllowNew)
1451 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1452 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1453 pchMessageStart[0] = 0xfa;
1454 pchMessageStart[1] = 0xbf;
1455 pchMessageStart[2] = 0xb5;
1456 pchMessageStart[3] = 0xda;
1463 if (!txdb.LoadBlockIndex())
1468 // Init with genesis block
1470 if (mapBlockIndex.empty())
1476 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1477 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1478 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1479 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1480 // vMerkleTree: 4a5e1e
1483 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1485 txNew.vin.resize(1);
1486 txNew.vout.resize(1);
1487 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1488 txNew.vout[0].nValue = 50 * COIN;
1489 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1491 block.vtx.push_back(txNew);
1492 block.hashPrevBlock = 0;
1493 block.hashMerkleRoot = block.BuildMerkleTree();
1495 block.nTime = 1231006505;
1496 block.nBits = 0x1d00ffff;
1497 block.nNonce = 2083236893;
1501 block.nTime = 1296688602;
1502 block.nBits = 0x1d07fff8;
1503 block.nNonce = 384568319;
1507 printf("%s\n", block.GetHash().ToString().c_str());
1508 printf("%s\n", hashGenesisBlock.ToString().c_str());
1509 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1510 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1512 assert(block.GetHash() == hashGenesisBlock);
1514 // Start new block file
1516 unsigned int nBlockPos;
1517 if (!block.WriteToDisk(nFile, nBlockPos))
1518 return error("LoadBlockIndex() : writing genesis block to disk failed");
1519 if (!block.AddToBlockIndex(nFile, nBlockPos))
1520 return error("LoadBlockIndex() : genesis block not accepted");
1528 void PrintBlockTree()
1530 // precompute tree structure
1531 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1532 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1534 CBlockIndex* pindex = (*mi).second;
1535 mapNext[pindex->pprev].push_back(pindex);
1537 //while (rand() % 3 == 0)
1538 // mapNext[pindex->pprev].push_back(pindex);
1541 vector<pair<int, CBlockIndex*> > vStack;
1542 vStack.push_back(make_pair(0, pindexGenesisBlock));
1545 while (!vStack.empty())
1547 int nCol = vStack.back().first;
1548 CBlockIndex* pindex = vStack.back().second;
1551 // print split or gap
1552 if (nCol > nPrevCol)
1554 for (int i = 0; i < nCol-1; i++)
1558 else if (nCol < nPrevCol)
1560 for (int i = 0; i < nCol; i++)
1567 for (int i = 0; i < nCol; i++)
1572 block.ReadFromDisk(pindex);
1573 printf("%d (%u,%u) %s %s tx %d",
1577 block.GetHash().ToString().substr(0,20).c_str(),
1578 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1581 PrintWallets(block);
1583 // put the main timechain first
1584 vector<CBlockIndex*>& vNext = mapNext[pindex];
1585 for (int i = 0; i < vNext.size(); i++)
1587 if (vNext[i]->pnext)
1589 swap(vNext[0], vNext[i]);
1595 for (int i = 0; i < vNext.size(); i++)
1596 vStack.push_back(make_pair(nCol+i, vNext[i]));
1609 //////////////////////////////////////////////////////////////////////////////
1614 map<uint256, CAlert> mapAlerts;
1615 CCriticalSection cs_mapAlerts;
1617 string GetWarnings(string strFor)
1620 string strStatusBar;
1622 if (GetBoolArg("-testsafemode"))
1625 // Misc warnings like out of disk space and clock is wrong
1626 if (strMiscWarning != "")
1629 strStatusBar = strMiscWarning;
1632 // Longer invalid proof-of-work chain
1633 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1636 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1640 CRITICAL_BLOCK(cs_mapAlerts)
1642 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1644 const CAlert& alert = item.second;
1645 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1647 nPriority = alert.nPriority;
1648 strStatusBar = alert.strStatusBar;
1653 if (strFor == "statusbar")
1654 return strStatusBar;
1655 else if (strFor == "rpc")
1657 assert(!"GetWarnings() : invalid parameter");
1661 bool CAlert::ProcessAlert()
1663 if (!CheckSignature())
1668 CRITICAL_BLOCK(cs_mapAlerts)
1670 // Cancel previous alerts
1671 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1673 const CAlert& alert = (*mi).second;
1676 printf("cancelling alert %d\n", alert.nID);
1677 mapAlerts.erase(mi++);
1679 else if (!alert.IsInEffect())
1681 printf("expiring alert %d\n", alert.nID);
1682 mapAlerts.erase(mi++);
1688 // Check if this alert has been cancelled
1689 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1691 const CAlert& alert = item.second;
1692 if (alert.Cancels(*this))
1694 printf("alert already cancelled by %d\n", alert.nID);
1700 mapAlerts.insert(make_pair(GetHash(), *this));
1703 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1715 //////////////////////////////////////////////////////////////////////////////
1721 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1725 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1726 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1728 // Don't know what it is, just say we already got one
1735 // The message start string is designed to be unlikely to occur in normal data.
1736 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1737 // a large 4-byte int at any alignment.
1738 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1741 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1743 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1744 RandAddSeedPerfmon();
1746 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1747 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1748 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1750 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1758 if (strCommand == "version")
1760 // Each connection can only send one version message
1761 if (pfrom->nVersion != 0)
1768 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1769 if (pfrom->nVersion == 10300)
1770 pfrom->nVersion = 300;
1771 if (pfrom->nVersion >= 106 && !vRecv.empty())
1772 vRecv >> addrFrom >> nNonce;
1773 if (pfrom->nVersion >= 106 && !vRecv.empty())
1774 vRecv >> pfrom->strSubVer;
1775 if (pfrom->nVersion >= 209 && !vRecv.empty())
1776 vRecv >> pfrom->nStartingHeight;
1778 if (pfrom->nVersion == 0)
1781 // Disconnect if we connected to ourself
1782 if (nNonce == nLocalHostNonce && nNonce > 1)
1784 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1785 pfrom->fDisconnect = true;
1789 // Be shy and don't send version until we hear
1790 if (pfrom->fInbound)
1791 pfrom->PushVersion();
1793 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1795 AddTimeData(pfrom->addr.ip, nTime);
1798 if (pfrom->nVersion >= 209)
1799 pfrom->PushMessage("verack");
1800 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1801 if (pfrom->nVersion < 209)
1802 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1804 if (!pfrom->fInbound)
1806 // Advertise our address
1807 if (addrLocalHost.IsRoutable() && !fUseProxy)
1809 CAddress addr(addrLocalHost);
1810 addr.nTime = GetAdjustedTime();
1811 pfrom->PushAddress(addr);
1814 // Get recent addresses
1815 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1817 pfrom->PushMessage("getaddr");
1818 pfrom->fGetAddr = true;
1822 // Ask the first connected node for block updates
1823 static int nAskedForBlocks;
1824 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
1827 pfrom->PushGetBlocks(pindexBest, uint256(0));
1831 CRITICAL_BLOCK(cs_mapAlerts)
1832 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1833 item.second.RelayTo(pfrom);
1835 pfrom->fSuccessfullyConnected = true;
1837 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1838 if(pfrom->nStartingHeight > nTotalBlocksEstimate)
1840 nTotalBlocksEstimate = pfrom->nStartingHeight;
1845 else if (pfrom->nVersion == 0)
1847 // Must have a version message before anything else
1852 else if (strCommand == "verack")
1854 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1858 else if (strCommand == "addr")
1860 vector<CAddress> vAddr;
1863 // Don't want addr from older versions unless seeding
1864 if (pfrom->nVersion < 209)
1866 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1868 if (vAddr.size() > 1000)
1869 return error("message addr size() = %d", vAddr.size());
1871 // Store the new addresses
1874 int64 nNow = GetAdjustedTime();
1875 int64 nSince = nNow - 10 * 60;
1876 BOOST_FOREACH(CAddress& addr, vAddr)
1880 // ignore IPv6 for now, since it isn't implemented anyway
1883 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1884 addr.nTime = nNow - 5 * 24 * 60 * 60;
1885 AddAddress(addr, 2 * 60 * 60, &addrDB);
1886 pfrom->AddAddressKnown(addr);
1887 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1889 // Relay to a limited number of other nodes
1890 CRITICAL_BLOCK(cs_vNodes)
1892 // Use deterministic randomness to send to the same nodes for 24 hours
1893 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1894 static uint256 hashSalt;
1896 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1897 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1898 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1899 multimap<uint256, CNode*> mapMix;
1900 BOOST_FOREACH(CNode* pnode, vNodes)
1902 if (pnode->nVersion < 31402)
1904 unsigned int nPointer;
1905 memcpy(&nPointer, &pnode, sizeof(nPointer));
1906 uint256 hashKey = hashRand ^ nPointer;
1907 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1908 mapMix.insert(make_pair(hashKey, pnode));
1910 int nRelayNodes = 2;
1911 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1912 ((*mi).second)->PushAddress(addr);
1916 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1917 if (vAddr.size() < 1000)
1918 pfrom->fGetAddr = false;
1922 else if (strCommand == "inv")
1926 if (vInv.size() > 50000)
1927 return error("message inv size() = %d", vInv.size());
1930 BOOST_FOREACH(const CInv& inv, vInv)
1934 pfrom->AddInventoryKnown(inv);
1936 bool fAlreadyHave = AlreadyHave(txdb, inv);
1937 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1941 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1942 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1944 // Track requests for our stuff
1945 Inventory(inv.hash);
1950 else if (strCommand == "getdata")
1954 if (vInv.size() > 50000)
1955 return error("message getdata size() = %d", vInv.size());
1957 BOOST_FOREACH(const CInv& inv, vInv)
1961 printf("received getdata for: %s\n", inv.ToString().c_str());
1963 if (inv.type == MSG_BLOCK)
1965 // Send block from disk
1966 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1967 if (mi != mapBlockIndex.end())
1970 block.ReadFromDisk((*mi).second);
1971 pfrom->PushMessage("block", block);
1973 // Trigger them to send a getblocks request for the next batch of inventory
1974 if (inv.hash == pfrom->hashContinue)
1976 // Bypass PushInventory, this must send even if redundant,
1977 // and we want it right after the last block so they don't
1978 // wait for other stuff first.
1980 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
1981 pfrom->PushMessage("inv", vInv);
1982 pfrom->hashContinue = 0;
1986 else if (inv.IsKnownType())
1988 // Send stream from relay memory
1989 CRITICAL_BLOCK(cs_mapRelay)
1991 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
1992 if (mi != mapRelay.end())
1993 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
1997 // Track requests for our stuff
1998 Inventory(inv.hash);
2003 else if (strCommand == "getblocks")
2005 CBlockLocator locator;
2007 vRecv >> locator >> hashStop;
2009 // Find the last block the caller has in the main chain
2010 CBlockIndex* pindex = locator.GetBlockIndex();
2012 // Send the rest of the chain
2014 pindex = pindex->pnext;
2015 int nLimit = 500 + locator.GetDistanceBack();
2016 unsigned int nBytes = 0;
2017 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2018 for (; pindex; pindex = pindex->pnext)
2020 if (pindex->GetBlockHash() == hashStop)
2022 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2025 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2027 block.ReadFromDisk(pindex, true);
2028 nBytes += block.GetSerializeSize(SER_NETWORK);
2029 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2031 // When this block is requested, we'll send an inv that'll make them
2032 // getblocks the next batch of inventory.
2033 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2034 pfrom->hashContinue = pindex->GetBlockHash();
2041 else if (strCommand == "getheaders")
2043 CBlockLocator locator;
2045 vRecv >> locator >> hashStop;
2047 CBlockIndex* pindex = NULL;
2048 if (locator.IsNull())
2050 // If locator is null, return the hashStop block
2051 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2052 if (mi == mapBlockIndex.end())
2054 pindex = (*mi).second;
2058 // Find the last block the caller has in the main chain
2059 pindex = locator.GetBlockIndex();
2061 pindex = pindex->pnext;
2064 vector<CBlock> vHeaders;
2065 int nLimit = 2000 + locator.GetDistanceBack();
2066 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2067 for (; pindex; pindex = pindex->pnext)
2069 vHeaders.push_back(pindex->GetBlockHeader());
2070 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2073 pfrom->PushMessage("headers", vHeaders);
2077 else if (strCommand == "tx")
2079 vector<uint256> vWorkQueue;
2080 CDataStream vMsg(vRecv);
2084 CInv inv(MSG_TX, tx.GetHash());
2085 pfrom->AddInventoryKnown(inv);
2087 bool fMissingInputs = false;
2088 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2090 SyncWithWallets(tx, NULL, true);
2091 RelayMessage(inv, vMsg);
2092 mapAlreadyAskedFor.erase(inv);
2093 vWorkQueue.push_back(inv.hash);
2095 // Recursively process any orphan transactions that depended on this one
2096 for (int i = 0; i < vWorkQueue.size(); i++)
2098 uint256 hashPrev = vWorkQueue[i];
2099 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2100 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2103 const CDataStream& vMsg = *((*mi).second);
2105 CDataStream(vMsg) >> tx;
2106 CInv inv(MSG_TX, tx.GetHash());
2108 if (tx.AcceptToMemoryPool(true))
2110 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2111 SyncWithWallets(tx, NULL, true);
2112 RelayMessage(inv, vMsg);
2113 mapAlreadyAskedFor.erase(inv);
2114 vWorkQueue.push_back(inv.hash);
2119 BOOST_FOREACH(uint256 hash, vWorkQueue)
2120 EraseOrphanTx(hash);
2122 else if (fMissingInputs)
2124 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2130 else if (strCommand == "block")
2135 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2138 CInv inv(MSG_BLOCK, block.GetHash());
2139 pfrom->AddInventoryKnown(inv);
2141 if (ProcessBlock(pfrom, &block))
2142 mapAlreadyAskedFor.erase(inv);
2146 else if (strCommand == "getaddr")
2148 // Nodes rebroadcast an addr every 24 hours
2149 pfrom->vAddrToSend.clear();
2150 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2151 CRITICAL_BLOCK(cs_mapAddresses)
2153 unsigned int nCount = 0;
2154 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2156 const CAddress& addr = item.second;
2157 if (addr.nTime > nSince)
2160 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2162 const CAddress& addr = item.second;
2163 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2164 pfrom->PushAddress(addr);
2170 else if (strCommand == "checkorder")
2175 if (!GetBoolArg("-allowreceivebyip"))
2177 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2184 /// we have a chance to check the order here
2186 // Keep giving the same key to the same ip until they use it
2187 if (!mapReuseKey.count(pfrom->addr.ip))
2188 mapReuseKey[pfrom->addr.ip] = pwalletMain->GetOrReuseKeyFromPool();
2190 // Send back approval of order and pubkey to use
2191 CScript scriptPubKey;
2192 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2193 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2197 else if (strCommand == "reply")
2202 CRequestTracker tracker;
2203 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2205 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2206 if (mi != pfrom->mapRequests.end())
2208 tracker = (*mi).second;
2209 pfrom->mapRequests.erase(mi);
2212 if (!tracker.IsNull())
2213 tracker.fn(tracker.param1, vRecv);
2217 else if (strCommand == "ping")
2222 else if (strCommand == "alert")
2227 if (alert.ProcessAlert())
2230 pfrom->setKnown.insert(alert.GetHash());
2231 CRITICAL_BLOCK(cs_vNodes)
2232 BOOST_FOREACH(CNode* pnode, vNodes)
2233 alert.RelayTo(pnode);
2240 // Ignore unknown commands for extensibility
2244 // Update the last seen time for this node's address
2245 if (pfrom->fNetworkNode)
2246 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2247 AddressCurrentlyConnected(pfrom->addr);
2253 bool ProcessMessages(CNode* pfrom)
2255 CDataStream& vRecv = pfrom->vRecv;
2259 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2263 // (4) message start
2272 // Scan for message start
2273 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2274 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2275 if (vRecv.end() - pstart < nHeaderSize)
2277 if (vRecv.size() > nHeaderSize)
2279 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2280 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2284 if (pstart - vRecv.begin() > 0)
2285 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2286 vRecv.erase(vRecv.begin(), pstart);
2289 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2294 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2297 string strCommand = hdr.GetCommand();
2300 unsigned int nMessageSize = hdr.nMessageSize;
2301 if (nMessageSize > MAX_SIZE)
2303 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2306 if (nMessageSize > vRecv.size())
2308 // Rewind and wait for rest of message
2309 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2314 if (vRecv.GetVersion() >= 209)
2316 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2317 unsigned int nChecksum = 0;
2318 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2319 if (nChecksum != hdr.nChecksum)
2321 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2322 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2327 // Copy message to its own buffer
2328 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2329 vRecv.ignore(nMessageSize);
2335 CRITICAL_BLOCK(cs_main)
2336 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2340 catch (std::ios_base::failure& e)
2342 if (strstr(e.what(), "end of data"))
2344 // Allow exceptions from underlength message on vRecv
2345 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());
2347 else if (strstr(e.what(), "size too large"))
2349 // Allow exceptions from overlong size
2350 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2354 PrintExceptionContinue(&e, "ProcessMessage()");
2357 catch (std::exception& e) {
2358 PrintExceptionContinue(&e, "ProcessMessage()");
2360 PrintExceptionContinue(NULL, "ProcessMessage()");
2364 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2372 bool SendMessages(CNode* pto, bool fSendTrickle)
2374 CRITICAL_BLOCK(cs_main)
2376 // Don't send anything until we get their version message
2377 if (pto->nVersion == 0)
2381 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2382 pto->PushMessage("ping");
2384 // Resend wallet transactions that haven't gotten in a block yet
2385 ResendWalletTransactions();
2387 // Address refresh broadcast
2388 static int64 nLastRebroadcast;
2389 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2391 nLastRebroadcast = GetTime();
2392 CRITICAL_BLOCK(cs_vNodes)
2394 BOOST_FOREACH(CNode* pnode, vNodes)
2396 // Periodically clear setAddrKnown to allow refresh broadcasts
2397 pnode->setAddrKnown.clear();
2399 // Rebroadcast our address
2400 if (addrLocalHost.IsRoutable() && !fUseProxy)
2402 CAddress addr(addrLocalHost);
2403 addr.nTime = GetAdjustedTime();
2404 pnode->PushAddress(addr);
2410 // Clear out old addresses periodically so it's not too much work at once
2411 static int64 nLastClear;
2412 if (nLastClear == 0)
2413 nLastClear = GetTime();
2414 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2416 nLastClear = GetTime();
2417 CRITICAL_BLOCK(cs_mapAddresses)
2420 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2421 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2422 mi != mapAddresses.end();)
2424 const CAddress& addr = (*mi).second;
2425 if (addr.nTime < nSince)
2427 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2429 addrdb.EraseAddress(addr);
2430 mapAddresses.erase(mi++);
2444 vector<CAddress> vAddr;
2445 vAddr.reserve(pto->vAddrToSend.size());
2446 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2448 // returns true if wasn't already contained in the set
2449 if (pto->setAddrKnown.insert(addr).second)
2451 vAddr.push_back(addr);
2452 // receiver rejects addr messages larger than 1000
2453 if (vAddr.size() >= 1000)
2455 pto->PushMessage("addr", vAddr);
2460 pto->vAddrToSend.clear();
2462 pto->PushMessage("addr", vAddr);
2467 // Message: inventory
2470 vector<CInv> vInvWait;
2471 CRITICAL_BLOCK(pto->cs_inventory)
2473 vInv.reserve(pto->vInventoryToSend.size());
2474 vInvWait.reserve(pto->vInventoryToSend.size());
2475 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2477 if (pto->setInventoryKnown.count(inv))
2480 // trickle out tx inv to protect privacy
2481 if (inv.type == MSG_TX && !fSendTrickle)
2483 // 1/4 of tx invs blast to all immediately
2484 static uint256 hashSalt;
2486 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2487 uint256 hashRand = inv.hash ^ hashSalt;
2488 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2489 bool fTrickleWait = ((hashRand & 3) != 0);
2491 // always trickle our own transactions
2495 if (GetTransaction(inv.hash, wtx))
2497 fTrickleWait = true;
2502 vInvWait.push_back(inv);
2507 // returns true if wasn't already contained in the set
2508 if (pto->setInventoryKnown.insert(inv).second)
2510 vInv.push_back(inv);
2511 if (vInv.size() >= 1000)
2513 pto->PushMessage("inv", vInv);
2518 pto->vInventoryToSend = vInvWait;
2521 pto->PushMessage("inv", vInv);
2527 vector<CInv> vGetData;
2528 int64 nNow = GetTime() * 1000000;
2530 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2532 const CInv& inv = (*pto->mapAskFor.begin()).second;
2533 if (!AlreadyHave(txdb, inv))
2535 printf("sending getdata: %s\n", inv.ToString().c_str());
2536 vGetData.push_back(inv);
2537 if (vGetData.size() >= 1000)
2539 pto->PushMessage("getdata", vGetData);
2543 mapAlreadyAskedFor[inv] = nNow;
2544 pto->mapAskFor.erase(pto->mapAskFor.begin());
2546 if (!vGetData.empty())
2547 pto->PushMessage("getdata", vGetData);
2566 //////////////////////////////////////////////////////////////////////////////
2571 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2573 unsigned char* pdata = (unsigned char*)pbuffer;
2574 unsigned int blocks = 1 + ((len + 8) / 64);
2575 unsigned char* pend = pdata + 64 * blocks;
2576 memset(pdata + len, 0, 64 * blocks - len);
2578 unsigned int bits = len * 8;
2579 pend[-1] = (bits >> 0) & 0xff;
2580 pend[-2] = (bits >> 8) & 0xff;
2581 pend[-3] = (bits >> 16) & 0xff;
2582 pend[-4] = (bits >> 24) & 0xff;
2586 using CryptoPP::ByteReverse;
2588 static const unsigned int pSHA256InitState[8] =
2589 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2591 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2593 memcpy(pstate, pinit, 32);
2594 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2598 // ScanHash scans nonces looking for a hash with at least some zero bits.
2599 // It operates on big endian data. Caller does the byte reversing.
2600 // All input buffers are 16-byte aligned. nNonce is usually preserved
2601 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2602 // the block is rebuilt and nNonce starts over at zero.
2604 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2606 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2610 // Hash pdata using pmidstate as the starting state into
2611 // preformatted buffer phash1, then hash phash1 into phash
2613 SHA256Transform(phash1, pdata, pmidstate);
2614 SHA256Transform(phash, phash1, pSHA256InitState);
2616 // Return the nonce if the hash has at least some zero bits,
2617 // caller will check if it has enough to reach the target
2618 if (((unsigned short*)phash)[14] == 0)
2621 // If nothing found after trying for a while, return -1
2622 if ((nNonce & 0xffff) == 0)
2624 nHashesDone = 0xffff+1;
2635 set<uint256> setDependsOn;
2638 COrphan(CTransaction* ptxIn)
2646 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2647 BOOST_FOREACH(uint256 hash, setDependsOn)
2648 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2653 CBlock* CreateNewBlock(CReserveKey& reservekey)
2655 CBlockIndex* pindexPrev = pindexBest;
2658 auto_ptr<CBlock> pblock(new CBlock());
2662 // Create coinbase tx
2664 txNew.vin.resize(1);
2665 txNew.vin[0].prevout.SetNull();
2666 txNew.vout.resize(1);
2667 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2669 // Add our coinbase tx as first transaction
2670 pblock->vtx.push_back(txNew);
2672 // Collect memory pool transactions into the block
2674 CRITICAL_BLOCK(cs_main)
2675 CRITICAL_BLOCK(cs_mapTransactions)
2679 // Priority order to process transactions
2680 list<COrphan> vOrphan; // list memory doesn't move
2681 map<uint256, vector<COrphan*> > mapDependers;
2682 multimap<double, CTransaction*> mapPriority;
2683 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2685 CTransaction& tx = (*mi).second;
2686 if (tx.IsCoinBase() || !tx.IsFinal())
2689 COrphan* porphan = NULL;
2690 double dPriority = 0;
2691 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2693 // Read prev transaction
2694 CTransaction txPrev;
2696 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2698 // Has to wait for dependencies
2701 // Use list for automatic deletion
2702 vOrphan.push_back(COrphan(&tx));
2703 porphan = &vOrphan.back();
2705 mapDependers[txin.prevout.hash].push_back(porphan);
2706 porphan->setDependsOn.insert(txin.prevout.hash);
2709 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2711 // Read block header
2712 int nConf = txindex.GetDepthInMainChain();
2714 dPriority += (double)nValueIn * nConf;
2716 if (fDebug && GetBoolArg("-printpriority"))
2717 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2720 // Priority is sum(valuein * age) / txsize
2721 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2724 porphan->dPriority = dPriority;
2726 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2728 if (fDebug && GetBoolArg("-printpriority"))
2730 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2737 // Collect transactions into block
2738 map<uint256, CTxIndex> mapTestPool;
2739 uint64 nBlockSize = 1000;
2740 int nBlockSigOps = 100;
2741 while (!mapPriority.empty())
2743 // Take highest priority transaction off priority queue
2744 double dPriority = -(*mapPriority.begin()).first;
2745 CTransaction& tx = *(*mapPriority.begin()).second;
2746 mapPriority.erase(mapPriority.begin());
2749 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2750 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2752 int nTxSigOps = tx.GetSigOpCount();
2753 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2756 // Transaction fee required depends on block size
2757 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2758 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2760 // Connecting shouldn't fail due to dependency on other memory pool transactions
2761 // because we're already processing them in order of dependency
2762 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2763 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2765 swap(mapTestPool, mapTestPoolTmp);
2768 pblock->vtx.push_back(tx);
2769 nBlockSize += nTxSize;
2770 nBlockSigOps += nTxSigOps;
2772 // Add transactions that depend on this one to the priority queue
2773 uint256 hash = tx.GetHash();
2774 if (mapDependers.count(hash))
2776 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2778 if (!porphan->setDependsOn.empty())
2780 porphan->setDependsOn.erase(hash);
2781 if (porphan->setDependsOn.empty())
2782 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2788 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2791 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2792 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2793 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2794 pblock->nBits = GetNextWorkRequired(pindexPrev);
2797 return pblock.release();
2801 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
2803 // Update nExtraNonce
2804 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2805 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
2810 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
2811 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2815 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2818 // Prebuild hash buffers
2825 uint256 hashPrevBlock;
2826 uint256 hashMerkleRoot;
2829 unsigned int nNonce;
2832 unsigned char pchPadding0[64];
2834 unsigned char pchPadding1[64];
2837 memset(&tmp, 0, sizeof(tmp));
2839 tmp.block.nVersion = pblock->nVersion;
2840 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2841 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2842 tmp.block.nTime = pblock->nTime;
2843 tmp.block.nBits = pblock->nBits;
2844 tmp.block.nNonce = pblock->nNonce;
2846 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2847 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2849 // Byte swap all the input buffer
2850 for (int i = 0; i < sizeof(tmp)/4; i++)
2851 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2853 // Precalc the first half of the first hash, which stays constant
2854 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2856 memcpy(pdata, &tmp.block, 128);
2857 memcpy(phash1, &tmp.hash1, 64);
2861 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2863 uint256 hash = pblock->GetHash();
2864 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2866 if (hash > hashTarget)
2870 printf("BitcoinMiner:\n");
2871 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2873 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2874 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2877 CRITICAL_BLOCK(cs_main)
2879 if (pblock->hashPrevBlock != hashBestChain)
2880 return error("BitcoinMiner : generated block is stale");
2882 // Remove key from key pool
2883 reservekey.KeepKey();
2885 // Track how many getdata requests this block gets
2886 CRITICAL_BLOCK(wallet.cs_mapRequestCount)
2887 wallet.mapRequestCount[pblock->GetHash()] = 0;
2889 // Process this block the same as if we had received it from another node
2890 if (!ProcessBlock(NULL, pblock))
2891 return error("BitcoinMiner : ProcessBlock, block not accepted");
2898 void static ThreadBitcoinMiner(void* parg);
2900 void static BitcoinMiner(CWallet *pwallet)
2902 printf("BitcoinMiner started\n");
2903 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2905 // Each thread has its own key and counter
2906 CReserveKey reservekey(pwallet);
2907 unsigned int nExtraNonce = 0;
2908 int64 nPrevTime = 0;
2910 while (fGenerateBitcoins)
2912 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2916 while (vNodes.empty() || IsInitialBlockDownload())
2921 if (!fGenerateBitcoins)
2929 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2930 CBlockIndex* pindexPrev = pindexBest;
2932 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2935 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
2937 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2941 // Prebuild hash buffers
2943 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2944 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2945 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2947 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2949 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2950 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2956 int64 nStart = GetTime();
2957 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2959 uint256& hash = *alignup<16>(hashbuf);
2962 unsigned int nHashesDone = 0;
2963 unsigned int nNonceFound;
2966 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2967 (char*)&hash, nHashesDone);
2969 // Check if something found
2970 if (nNonceFound != -1)
2972 for (int i = 0; i < sizeof(hash)/4; i++)
2973 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2975 if (hash <= hashTarget)
2978 pblock->nNonce = ByteReverse(nNonceFound);
2979 assert(hash == pblock->GetHash());
2981 SetThreadPriority(THREAD_PRIORITY_NORMAL);
2982 CheckWork(pblock.get(), *pwalletMain, reservekey);
2983 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2989 static int64 nHashCounter;
2990 if (nHPSTimerStart == 0)
2992 nHPSTimerStart = GetTimeMillis();
2996 nHashCounter += nHashesDone;
2997 if (GetTimeMillis() - nHPSTimerStart > 4000)
2999 static CCriticalSection cs;
3002 if (GetTimeMillis() - nHPSTimerStart > 4000)
3004 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3005 nHPSTimerStart = GetTimeMillis();
3007 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3008 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3009 static int64 nLogTime;
3010 if (GetTime() - nLogTime > 30 * 60)
3012 nLogTime = GetTime();
3013 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3014 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3020 // Check for stop or if block needs to be rebuilt
3023 if (!fGenerateBitcoins)
3025 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3029 if (nBlockNonce >= 0xffff0000)
3031 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3033 if (pindexPrev != pindexBest)
3036 // Update nTime every few seconds
3037 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3038 nBlockTime = ByteReverse(pblock->nTime);
3043 void static ThreadBitcoinMiner(void* parg)
3045 CWallet* pwallet = (CWallet*)parg;
3048 vnThreadsRunning[3]++;
3049 BitcoinMiner(pwallet);
3050 vnThreadsRunning[3]--;
3052 catch (std::exception& e) {
3053 vnThreadsRunning[3]--;
3054 PrintException(&e, "ThreadBitcoinMiner()");
3056 vnThreadsRunning[3]--;
3057 PrintException(NULL, "ThreadBitcoinMiner()");
3059 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3061 if (vnThreadsRunning[3] == 0)
3063 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3067 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3069 if (fGenerateBitcoins != fGenerate)
3071 fGenerateBitcoins = fGenerate;
3072 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3075 if (fGenerateBitcoins)
3077 int nProcessors = boost::thread::hardware_concurrency();
3078 printf("%d processors\n", nProcessors);
3079 if (nProcessors < 1)
3081 if (fLimitProcessors && nProcessors > nLimitProcessors)
3082 nProcessors = nLimitProcessors;
3083 int nAddThreads = nProcessors - vnThreadsRunning[3];
3084 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3085 for (int i = 0; i < nAddThreads; i++)
3087 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3088 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");