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 static map<uint256, CTransaction> mapTransactions;
26 CCriticalSection cs_mapTransactions;
27 unsigned int nTransactionsUpdated = 0;
28 map<COutPoint, CInPoint> mapNextTx;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 const int nTotalBlocksEstimate = 140700; // 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 int nMaxBlocksOfPeers = 0; // Amount of blocks that other nodes claim to have
36 CBlockIndex* pindexGenesisBlock = NULL;
38 CBigNum bnBestChainWork = 0;
39 CBigNum bnBestInvalidWork = 0;
40 uint256 hashBestChain = 0;
41 CBlockIndex* pindexBest = NULL;
42 int64 nTimeBestReceived = 0;
44 map<uint256, CBlock*> mapOrphanBlocks;
45 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
47 map<uint256, CDataStream*> mapOrphanTransactions;
48 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
55 int fGenerateBitcoins = false;
56 int64 nTransactionFee = 0;
57 int fLimitProcessors = false;
58 int nLimitProcessors = 1;
59 int fMinimizeToTray = true;
60 int fMinimizeOnClose = true;
73 //////////////////////////////////////////////////////////////////////////////
75 // dispatching functions
78 void RegisterWallet(CWallet* pwalletIn)
80 CRITICAL_BLOCK(cs_setpwalletRegistered)
82 setpwalletRegistered.insert(pwalletIn);
86 void UnregisterWallet(CWallet* pwalletIn)
88 CRITICAL_BLOCK(cs_setpwalletRegistered)
90 setpwalletRegistered.erase(pwalletIn);
94 bool static IsFromMe(CTransaction& tx)
96 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
97 if (pwallet->IsFromMe(tx))
102 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
104 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
105 if (pwallet->GetTransaction(hashTx,wtx))
110 void static EraseFromWallets(uint256 hash)
112 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
113 pwallet->EraseFromWallet(hash);
116 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
118 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
119 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
122 void static SetBestChain(const CBlockLocator& loc)
124 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
125 pwallet->SetBestChain(loc);
128 void static UpdatedTransaction(const uint256& hashTx)
130 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
131 pwallet->UpdatedTransaction(hashTx);
134 void static PrintWallets(const CBlock& block)
136 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
137 pwallet->PrintWallet(block);
140 void static Inventory(const uint256& hash)
142 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
143 pwallet->Inventory(hash);
146 void static ResendWalletTransactions()
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->ResendWalletTransactions();
158 //////////////////////////////////////////////////////////////////////////////
160 // mapOrphanTransactions
163 void static AddOrphanTx(const CDataStream& vMsg)
166 CDataStream(vMsg) >> tx;
167 uint256 hash = tx.GetHash();
168 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);
204 //////////////////////////////////////////////////////////////////////////////
206 // CTransaction and CTxIndex
209 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
212 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
214 if (!ReadFromDisk(txindexRet.pos))
216 if (prevout.n >= vout.size())
224 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
227 return ReadFromDisk(txdb, prevout, txindex);
230 bool CTransaction::ReadFromDisk(COutPoint prevout)
234 return ReadFromDisk(txdb, prevout, txindex);
239 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
251 // Load the block this tx is in
253 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
255 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
260 // Update the tx's hashBlock
261 hashBlock = pblock->GetHash();
263 // Locate the transaction
264 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
265 if (pblock->vtx[nIndex] == *(CTransaction*)this)
267 if (nIndex == pblock->vtx.size())
269 vMerkleBranch.clear();
271 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
275 // Fill in merkle branch
276 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
279 // Is the tx in a block that's in the main chain
280 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
281 if (mi == mapBlockIndex.end())
283 CBlockIndex* pindex = (*mi).second;
284 if (!pindex || !pindex->IsInMainChain())
287 return pindexBest->nHeight - pindex->nHeight + 1;
296 bool CTransaction::CheckTransaction() const
298 // Basic checks that don't depend on any context
300 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
302 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
304 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
305 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
307 // Check for negative or overflow output values
309 BOOST_FOREACH(const CTxOut& txout, vout)
311 if (txout.nValue < 0)
312 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
313 if (txout.nValue > MAX_MONEY)
314 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
315 nValueOut += txout.nValue;
316 if (!MoneyRange(nValueOut))
317 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
320 // Check for duplicate inputs
321 set<COutPoint> vInOutPoints;
322 BOOST_FOREACH(const CTxIn& txin, vin)
324 if (vInOutPoints.count(txin.prevout))
326 vInOutPoints.insert(txin.prevout);
331 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
332 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
336 BOOST_FOREACH(const CTxIn& txin, vin)
337 if (txin.prevout.IsNull())
338 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
344 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
347 *pfMissingInputs = false;
349 if (!CheckTransaction())
350 return error("AcceptToMemoryPool() : CheckTransaction failed");
352 // Coinbase is only valid in a block, not as a loose transaction
354 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
356 // To help v0.1.5 clients who would see it as a negative number
357 if ((int64)nLockTime > INT_MAX)
358 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
361 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
362 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
363 // attacks disallow transactions with more than one SigOp per 34 bytes.
364 // 34 bytes because a TxOut is:
365 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
366 if (GetSigOpCount() > nSize / 34 || nSize < 100)
367 return DoS(10, error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount"));
369 // Rather not work on nonstandard transactions (unless -testnet)
370 if (!fTestNet && !IsStandard())
371 return error("AcceptToMemoryPool() : nonstandard transaction type");
373 // Do we already have it?
374 uint256 hash = GetHash();
375 CRITICAL_BLOCK(cs_mapTransactions)
376 if (mapTransactions.count(hash))
379 if (txdb.ContainsTx(hash))
382 // Check for conflicts with in-memory transactions
383 CTransaction* ptxOld = NULL;
384 for (int i = 0; i < vin.size(); i++)
386 COutPoint outpoint = vin[i].prevout;
387 if (mapNextTx.count(outpoint))
389 // Disable replacement feature for now
392 // Allow replacing with a newer version of the same transaction
395 ptxOld = mapNextTx[outpoint].ptx;
396 if (ptxOld->IsFinal())
398 if (!IsNewerThan(*ptxOld))
400 for (int i = 0; i < vin.size(); i++)
402 COutPoint outpoint = vin[i].prevout;
403 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
412 // Check against previous transactions
413 map<uint256, CTxIndex> mapUnused;
415 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
418 *pfMissingInputs = true;
419 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
422 // Don't accept it if it can't get into a block
423 if (nFees < GetMinFee(1000, true, true))
424 return error("AcceptToMemoryPool() : not enough fees");
426 // Continuously rate-limit free transactions
427 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
428 // be annoying or make other's transactions take longer to confirm.
429 if (nFees < MIN_RELAY_TX_FEE)
431 static CCriticalSection cs;
432 static double dFreeCount;
433 static int64 nLastTime;
434 int64 nNow = GetTime();
438 // Use an exponentially decaying ~10-minute window:
439 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
441 // -limitfreerelay unit is thousand-bytes-per-minute
442 // At default rate it would take over a month to fill 1GB
443 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
444 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
446 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
452 // Store transaction in memory
453 CRITICAL_BLOCK(cs_mapTransactions)
457 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
458 ptxOld->RemoveFromMemoryPool();
460 AddToMemoryPoolUnchecked();
463 ///// are we sure this is ok when loading transactions or restoring block txes
464 // If updated, erase old tx from wallet
466 EraseFromWallets(ptxOld->GetHash());
468 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
472 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
475 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
478 bool CTransaction::AddToMemoryPoolUnchecked()
480 // Add to memory pool without checking anything. Don't call this directly,
481 // call AcceptToMemoryPool to properly check the transaction first.
482 CRITICAL_BLOCK(cs_mapTransactions)
484 uint256 hash = GetHash();
485 mapTransactions[hash] = *this;
486 for (int i = 0; i < vin.size(); i++)
487 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
488 nTransactionsUpdated++;
494 bool CTransaction::RemoveFromMemoryPool()
496 // Remove transaction from memory pool
497 CRITICAL_BLOCK(cs_mapTransactions)
499 BOOST_FOREACH(const CTxIn& txin, vin)
500 mapNextTx.erase(txin.prevout);
501 mapTransactions.erase(GetHash());
502 nTransactionsUpdated++;
512 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
514 if (hashBlock == 0 || nIndex == -1)
517 // Find the block it claims to be in
518 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
519 if (mi == mapBlockIndex.end())
521 CBlockIndex* pindex = (*mi).second;
522 if (!pindex || !pindex->IsInMainChain())
525 // Make sure the merkle branch connects to this block
526 if (!fMerkleVerified)
528 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
530 fMerkleVerified = true;
533 nHeightRet = pindex->nHeight;
534 return pindexBest->nHeight - pindex->nHeight + 1;
538 int CMerkleTx::GetBlocksToMaturity() const
542 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
546 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
550 if (!IsInMainChain() && !ClientConnectInputs())
552 return CTransaction::AcceptToMemoryPool(txdb, false);
556 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
560 bool CMerkleTx::AcceptToMemoryPool()
563 return AcceptToMemoryPool(txdb);
568 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
570 CRITICAL_BLOCK(cs_mapTransactions)
572 // Add previous supporting transactions first
573 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
575 if (!tx.IsCoinBase())
577 uint256 hash = tx.GetHash();
578 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
579 tx.AcceptToMemoryPool(txdb, fCheckInputs);
582 return AcceptToMemoryPool(txdb, fCheckInputs);
587 bool CWalletTx::AcceptWalletTransaction()
590 return AcceptWalletTransaction(txdb);
593 int CTxIndex::GetDepthInMainChain() const
597 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
599 // Find the block in the index
600 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
601 if (mi == mapBlockIndex.end())
603 CBlockIndex* pindex = (*mi).second;
604 if (!pindex || !pindex->IsInMainChain())
606 return 1 + nBestHeight - pindex->nHeight;
618 //////////////////////////////////////////////////////////////////////////////
620 // CBlock and CBlockIndex
623 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
625 if (!fReadTransactions)
627 *this = pindex->GetBlockHeader();
630 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
632 if (GetHash() != pindex->GetBlockHash())
633 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
637 uint256 static GetOrphanRoot(const CBlock* pblock)
639 // Work back to the first block in the orphan chain
640 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
641 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
642 return pblock->GetHash();
645 int64 static GetBlockValue(int nHeight, int64 nFees)
647 int64 nSubsidy = 50 * COIN;
649 // Subsidy is cut in half every 4 years
650 nSubsidy >>= (nHeight / 210000);
652 return nSubsidy + nFees;
655 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
657 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
658 const int64 nTargetSpacing = 10 * 60;
659 const int64 nInterval = nTargetTimespan / nTargetSpacing;
662 if (pindexLast == NULL)
663 return bnProofOfWorkLimit.GetCompact();
665 // Only change once per interval
666 if ((pindexLast->nHeight+1) % nInterval != 0)
667 return pindexLast->nBits;
669 // Go back by what we want to be 14 days worth of blocks
670 const CBlockIndex* pindexFirst = pindexLast;
671 for (int i = 0; pindexFirst && i < nInterval-1; i++)
672 pindexFirst = pindexFirst->pprev;
675 // Limit adjustment step
676 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
677 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
678 if (nActualTimespan < nTargetTimespan/4)
679 nActualTimespan = nTargetTimespan/4;
680 if (nActualTimespan > nTargetTimespan*4)
681 nActualTimespan = nTargetTimespan*4;
685 bnNew.SetCompact(pindexLast->nBits);
686 bnNew *= nActualTimespan;
687 bnNew /= nTargetTimespan;
689 if (bnNew > bnProofOfWorkLimit)
690 bnNew = bnProofOfWorkLimit;
693 printf("GetNextWorkRequired RETARGET\n");
694 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
695 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
696 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
698 return bnNew.GetCompact();
701 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
704 bnTarget.SetCompact(nBits);
707 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
708 return error("CheckProofOfWork() : nBits below minimum work");
710 // Check proof of work matches claimed amount
711 if (hash > bnTarget.getuint256())
712 return error("CheckProofOfWork() : hash doesn't match nBits");
717 // Return conservative estimate of total number of blocks, 0 if unknown
718 int GetTotalBlocksEstimate()
726 return nTotalBlocksEstimate;
730 // Return maximum amount of blocks that other nodes claim to have
731 int GetNumBlocksOfPeers()
733 return std::max(nMaxBlocksOfPeers, GetTotalBlocksEstimate());
736 bool IsInitialBlockDownload()
738 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
740 static int64 nLastUpdate;
741 static CBlockIndex* pindexLastBest;
742 if (pindexBest != pindexLastBest)
744 pindexLastBest = pindexBest;
745 nLastUpdate = GetTime();
747 return (GetTime() - nLastUpdate < 10 &&
748 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
751 void static InvalidChainFound(CBlockIndex* pindexNew)
753 if (pindexNew->bnChainWork > bnBestInvalidWork)
755 bnBestInvalidWork = pindexNew->bnChainWork;
756 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
759 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());
760 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
761 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
762 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
775 bool CTransaction::DisconnectInputs(CTxDB& txdb)
777 // Relinquish previous transactions' spent pointers
780 BOOST_FOREACH(const CTxIn& txin, vin)
782 COutPoint prevout = txin.prevout;
784 // Get prev txindex from disk
786 if (!txdb.ReadTxIndex(prevout.hash, txindex))
787 return error("DisconnectInputs() : ReadTxIndex failed");
789 if (prevout.n >= txindex.vSpent.size())
790 return error("DisconnectInputs() : prevout.n out of range");
792 // Mark outpoint as not spent
793 txindex.vSpent[prevout.n].SetNull();
796 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
797 return error("DisconnectInputs() : UpdateTxIndex failed");
801 // Remove transaction from index
802 if (!txdb.EraseTxIndex(*this))
803 return error("DisconnectInputs() : EraseTxPos failed");
809 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
810 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
812 // Take over previous transactions' spent pointers
816 for (int i = 0; i < vin.size(); i++)
818 COutPoint prevout = vin[i].prevout;
823 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
825 // Get txindex from current proposed changes
826 txindex = mapTestPool[prevout.hash];
830 // Read txindex from txdb
831 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
833 if (!fFound && (fBlock || fMiner))
834 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());
838 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
840 // Get prev tx from single transactions in memory
841 CRITICAL_BLOCK(cs_mapTransactions)
843 if (!mapTransactions.count(prevout.hash))
844 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
845 txPrev = mapTransactions[prevout.hash];
848 txindex.vSpent.resize(txPrev.vout.size());
852 // Get prev tx from disk
853 if (!txPrev.ReadFromDisk(txindex.pos))
854 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
857 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
858 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
860 // If prev is coinbase, check that it's matured
861 if (txPrev.IsCoinBase())
862 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
863 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
864 return DoS(10, error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight));
867 if (!VerifySignature(txPrev, *this, i))
868 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
870 // Check for conflicts (double-spend)
871 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
872 // for an attacker to attempt to split the network.
873 if (!txindex.vSpent[prevout.n].IsNull())
874 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());
876 // Check for negative or overflow input values
877 nValueIn += txPrev.vout[prevout.n].nValue;
878 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
879 return DoS(100, error("ConnectInputs() : txin values out of range"));
881 // Mark outpoints as spent
882 txindex.vSpent[prevout.n] = posThisTx;
885 if (fBlock || fMiner)
887 mapTestPool[prevout.hash] = txindex;
891 if (nValueIn < GetValueOut())
892 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
894 // Tally transaction fees
895 int64 nTxFee = nValueIn - GetValueOut();
897 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
898 if (nTxFee < nMinFee)
901 if (!MoneyRange(nFees))
902 return DoS(100, error("ConnectInputs() : nFees out of range"));
907 // Add transaction to changes
908 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
912 // Add transaction to test pool
913 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
920 bool CTransaction::ClientConnectInputs()
925 // Take over previous transactions' spent pointers
926 CRITICAL_BLOCK(cs_mapTransactions)
929 for (int i = 0; i < vin.size(); i++)
931 // Get prev tx from single transactions in memory
932 COutPoint prevout = vin[i].prevout;
933 if (!mapTransactions.count(prevout.hash))
935 CTransaction& txPrev = mapTransactions[prevout.hash];
937 if (prevout.n >= txPrev.vout.size())
941 if (!VerifySignature(txPrev, *this, i))
942 return error("ConnectInputs() : VerifySignature failed");
944 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
945 ///// this has to go away now that posNext is gone
946 // // Check for conflicts
947 // if (!txPrev.vout[prevout.n].posNext.IsNull())
948 // return error("ConnectInputs() : prev tx already used");
950 // // Flag outpoints as used
951 // txPrev.vout[prevout.n].posNext = posThisTx;
953 nValueIn += txPrev.vout[prevout.n].nValue;
955 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
956 return error("ClientConnectInputs() : txin values out of range");
958 if (GetValueOut() > nValueIn)
968 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
970 // Disconnect in reverse order
971 for (int i = vtx.size()-1; i >= 0; i--)
972 if (!vtx[i].DisconnectInputs(txdb))
975 // Update block index on disk without changing it in memory.
976 // The memory index structure will be changed after the db commits.
979 CDiskBlockIndex blockindexPrev(pindex->pprev);
980 blockindexPrev.hashNext = 0;
981 if (!txdb.WriteBlockIndex(blockindexPrev))
982 return error("DisconnectBlock() : WriteBlockIndex failed");
988 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
990 // Check it again in case a previous version let a bad block in
994 //// issue here: it doesn't know the version
995 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
997 map<uint256, CTxIndex> mapQueuedChanges;
999 BOOST_FOREACH(CTransaction& tx, vtx)
1001 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1002 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1004 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1007 // Write queued txindex changes
1008 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1010 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1011 return error("ConnectBlock() : UpdateTxIndex failed");
1014 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1017 // Update block index on disk without changing it in memory.
1018 // The memory index structure will be changed after the db commits.
1021 CDiskBlockIndex blockindexPrev(pindex->pprev);
1022 blockindexPrev.hashNext = pindex->GetBlockHash();
1023 if (!txdb.WriteBlockIndex(blockindexPrev))
1024 return error("ConnectBlock() : WriteBlockIndex failed");
1027 // Watch for transactions paying to me
1028 BOOST_FOREACH(CTransaction& tx, vtx)
1029 SyncWithWallets(tx, this, true);
1034 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1036 printf("REORGANIZE\n");
1039 CBlockIndex* pfork = pindexBest;
1040 CBlockIndex* plonger = pindexNew;
1041 while (pfork != plonger)
1043 while (plonger->nHeight > pfork->nHeight)
1044 if (!(plonger = plonger->pprev))
1045 return error("Reorganize() : plonger->pprev is null");
1046 if (pfork == plonger)
1048 if (!(pfork = pfork->pprev))
1049 return error("Reorganize() : pfork->pprev is null");
1052 // List of what to disconnect
1053 vector<CBlockIndex*> vDisconnect;
1054 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1055 vDisconnect.push_back(pindex);
1057 // List of what to connect
1058 vector<CBlockIndex*> vConnect;
1059 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1060 vConnect.push_back(pindex);
1061 reverse(vConnect.begin(), vConnect.end());
1063 // Disconnect shorter branch
1064 vector<CTransaction> vResurrect;
1065 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1068 if (!block.ReadFromDisk(pindex))
1069 return error("Reorganize() : ReadFromDisk for disconnect failed");
1070 if (!block.DisconnectBlock(txdb, pindex))
1071 return error("Reorganize() : DisconnectBlock failed");
1073 // Queue memory transactions to resurrect
1074 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1075 if (!tx.IsCoinBase())
1076 vResurrect.push_back(tx);
1079 // Connect longer branch
1080 vector<CTransaction> vDelete;
1081 for (int i = 0; i < vConnect.size(); i++)
1083 CBlockIndex* pindex = vConnect[i];
1085 if (!block.ReadFromDisk(pindex))
1086 return error("Reorganize() : ReadFromDisk for connect failed");
1087 if (!block.ConnectBlock(txdb, pindex))
1091 return error("Reorganize() : ConnectBlock failed");
1094 // Queue memory transactions to delete
1095 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1096 vDelete.push_back(tx);
1098 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1099 return error("Reorganize() : WriteHashBestChain failed");
1101 // Make sure it's successfully written to disk before changing memory structure
1102 if (!txdb.TxnCommit())
1103 return error("Reorganize() : TxnCommit failed");
1105 // Disconnect shorter branch
1106 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1108 pindex->pprev->pnext = NULL;
1110 // Connect longer branch
1111 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1113 pindex->pprev->pnext = pindex;
1115 // Resurrect memory transactions that were in the disconnected branch
1116 BOOST_FOREACH(CTransaction& tx, vResurrect)
1117 tx.AcceptToMemoryPool(txdb, false);
1119 // Delete redundant memory transactions that are in the connected branch
1120 BOOST_FOREACH(CTransaction& tx, vDelete)
1121 tx.RemoveFromMemoryPool();
1127 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1129 uint256 hash = GetHash();
1132 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1134 txdb.WriteHashBestChain(hash);
1135 if (!txdb.TxnCommit())
1136 return error("SetBestChain() : TxnCommit failed");
1137 pindexGenesisBlock = pindexNew;
1139 else if (hashPrevBlock == hashBestChain)
1141 // Adding to current best branch
1142 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1145 InvalidChainFound(pindexNew);
1146 return error("SetBestChain() : ConnectBlock failed");
1148 if (!txdb.TxnCommit())
1149 return error("SetBestChain() : TxnCommit failed");
1151 // Add to current best branch
1152 pindexNew->pprev->pnext = pindexNew;
1154 // Delete redundant memory transactions
1155 BOOST_FOREACH(CTransaction& tx, vtx)
1156 tx.RemoveFromMemoryPool();
1161 if (!Reorganize(txdb, pindexNew))
1164 InvalidChainFound(pindexNew);
1165 return error("SetBestChain() : Reorganize failed");
1169 // Update best block in wallet (so we can detect restored wallets)
1170 if (!IsInitialBlockDownload())
1172 const CBlockLocator locator(pindexNew);
1173 ::SetBestChain(locator);
1177 hashBestChain = hash;
1178 pindexBest = pindexNew;
1179 nBestHeight = pindexBest->nHeight;
1180 bnBestChainWork = pindexNew->bnChainWork;
1181 nTimeBestReceived = GetTime();
1182 nTransactionsUpdated++;
1183 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1189 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1191 // Check for duplicate
1192 uint256 hash = GetHash();
1193 if (mapBlockIndex.count(hash))
1194 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1196 // Construct new block index object
1197 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1199 return error("AddToBlockIndex() : new CBlockIndex failed");
1200 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1201 pindexNew->phashBlock = &((*mi).first);
1202 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1203 if (miPrev != mapBlockIndex.end())
1205 pindexNew->pprev = (*miPrev).second;
1206 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1208 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1212 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1213 if (!txdb.TxnCommit())
1217 if (pindexNew->bnChainWork > bnBestChainWork)
1218 if (!SetBestChain(txdb, pindexNew))
1223 if (pindexNew == pindexBest)
1225 // Notify UI to display prev block's coinbase if it was ours
1226 static uint256 hashPrevBestCoinBase;
1227 UpdatedTransaction(hashPrevBestCoinBase);
1228 hashPrevBestCoinBase = vtx[0].GetHash();
1238 bool CBlock::CheckBlock() const
1240 // These are checks that are independent of context
1241 // that can be verified before saving an orphan block.
1244 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1245 return DoS(100, error("CheckBlock() : size limits failed"));
1247 // Check proof of work matches claimed amount
1248 if (!CheckProofOfWork(GetHash(), nBits))
1249 return DoS(50, error("CheckBlock() : proof of work failed"));
1252 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1253 return error("CheckBlock() : block timestamp too far in the future");
1255 // First transaction must be coinbase, the rest must not be
1256 if (vtx.empty() || !vtx[0].IsCoinBase())
1257 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1258 for (int i = 1; i < vtx.size(); i++)
1259 if (vtx[i].IsCoinBase())
1260 return DoS(100, error("CheckBlock() : more than one coinbase"));
1262 // Check transactions
1263 BOOST_FOREACH(const CTransaction& tx, vtx)
1264 if (!tx.CheckTransaction())
1265 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1267 // Check that it's not full of nonstandard transactions
1268 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1269 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1272 if (hashMerkleRoot != BuildMerkleTree())
1273 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1278 bool CBlock::AcceptBlock()
1280 // Check for duplicate
1281 uint256 hash = GetHash();
1282 if (mapBlockIndex.count(hash))
1283 return error("AcceptBlock() : block already in mapBlockIndex");
1285 // Get prev block index
1286 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1287 if (mi == mapBlockIndex.end())
1288 return DoS(10, error("AcceptBlock() : prev block not found"));
1289 CBlockIndex* pindexPrev = (*mi).second;
1290 int nHeight = pindexPrev->nHeight+1;
1292 // Check proof of work
1293 if (nBits != GetNextWorkRequired(pindexPrev))
1294 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1296 // Check timestamp against prev
1297 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1298 return error("AcceptBlock() : block's timestamp is too early");
1300 // Check that all transactions are finalized
1301 BOOST_FOREACH(const CTransaction& tx, vtx)
1302 if (!tx.IsFinal(nHeight, GetBlockTime()))
1303 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1305 // Check that the block chain matches the known block chain up to a checkpoint
1307 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1308 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1309 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1310 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1311 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1312 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1313 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1314 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")) ||
1315 (nHeight == 140700 && hash != uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd")))
1316 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1318 // Write block to history file
1319 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1320 return error("AcceptBlock() : out of disk space");
1321 unsigned int nFile = -1;
1322 unsigned int nBlockPos = 0;
1323 if (!WriteToDisk(nFile, nBlockPos))
1324 return error("AcceptBlock() : WriteToDisk failed");
1325 if (!AddToBlockIndex(nFile, nBlockPos))
1326 return error("AcceptBlock() : AddToBlockIndex failed");
1328 // Relay inventory, but don't relay old inventory during initial block download
1329 if (hashBestChain == hash)
1330 CRITICAL_BLOCK(cs_vNodes)
1331 BOOST_FOREACH(CNode* pnode, vNodes)
1332 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1333 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1338 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1340 // Check for duplicate
1341 uint256 hash = pblock->GetHash();
1342 if (mapBlockIndex.count(hash))
1343 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1344 if (mapOrphanBlocks.count(hash))
1345 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1347 // Preliminary checks
1348 if (!pblock->CheckBlock())
1349 return error("ProcessBlock() : CheckBlock FAILED");
1351 // If don't already have its previous block, shunt it off to holding area until we get it
1352 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1354 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1355 CBlock* pblock2 = new CBlock(*pblock);
1356 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1357 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1359 // Ask this guy to fill in what we're missing
1361 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1366 if (!pblock->AcceptBlock())
1367 return error("ProcessBlock() : AcceptBlock FAILED");
1369 // Recursively process any orphan blocks that depended on this one
1370 vector<uint256> vWorkQueue;
1371 vWorkQueue.push_back(hash);
1372 for (int i = 0; i < vWorkQueue.size(); i++)
1374 uint256 hashPrev = vWorkQueue[i];
1375 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1376 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1379 CBlock* pblockOrphan = (*mi).second;
1380 if (pblockOrphan->AcceptBlock())
1381 vWorkQueue.push_back(pblockOrphan->GetHash());
1382 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1383 delete pblockOrphan;
1385 mapOrphanBlocksByPrev.erase(hashPrev);
1388 printf("ProcessBlock: ACCEPTED\n");
1399 bool CheckDiskSpace(uint64 nAdditionalBytes)
1401 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1403 // Check for 15MB because database could create another 10MB log file at any time
1404 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1407 string strMessage = _("Warning: Disk space is low ");
1408 strMiscWarning = strMessage;
1409 printf("*** %s\n", strMessage.c_str());
1410 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1411 CreateThread(Shutdown, NULL);
1417 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1421 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1424 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1426 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1435 static unsigned int nCurrentBlockFile = 1;
1437 FILE* AppendBlockFile(unsigned int& nFileRet)
1442 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1445 if (fseek(file, 0, SEEK_END) != 0)
1447 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1448 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1450 nFileRet = nCurrentBlockFile;
1454 nCurrentBlockFile++;
1458 bool LoadBlockIndex(bool fAllowNew)
1462 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1463 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1464 pchMessageStart[0] = 0xfa;
1465 pchMessageStart[1] = 0xbf;
1466 pchMessageStart[2] = 0xb5;
1467 pchMessageStart[3] = 0xda;
1474 if (!txdb.LoadBlockIndex())
1479 // Init with genesis block
1481 if (mapBlockIndex.empty())
1487 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1488 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1489 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1490 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1491 // vMerkleTree: 4a5e1e
1494 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1496 txNew.vin.resize(1);
1497 txNew.vout.resize(1);
1498 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1499 txNew.vout[0].nValue = 50 * COIN;
1500 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1502 block.vtx.push_back(txNew);
1503 block.hashPrevBlock = 0;
1504 block.hashMerkleRoot = block.BuildMerkleTree();
1506 block.nTime = 1231006505;
1507 block.nBits = 0x1d00ffff;
1508 block.nNonce = 2083236893;
1512 block.nTime = 1296688602;
1513 block.nBits = 0x1d07fff8;
1514 block.nNonce = 384568319;
1518 printf("%s\n", block.GetHash().ToString().c_str());
1519 printf("%s\n", hashGenesisBlock.ToString().c_str());
1520 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1521 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1523 assert(block.GetHash() == hashGenesisBlock);
1525 // Start new block file
1527 unsigned int nBlockPos;
1528 if (!block.WriteToDisk(nFile, nBlockPos))
1529 return error("LoadBlockIndex() : writing genesis block to disk failed");
1530 if (!block.AddToBlockIndex(nFile, nBlockPos))
1531 return error("LoadBlockIndex() : genesis block not accepted");
1539 void PrintBlockTree()
1541 // precompute tree structure
1542 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1543 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1545 CBlockIndex* pindex = (*mi).second;
1546 mapNext[pindex->pprev].push_back(pindex);
1548 //while (rand() % 3 == 0)
1549 // mapNext[pindex->pprev].push_back(pindex);
1552 vector<pair<int, CBlockIndex*> > vStack;
1553 vStack.push_back(make_pair(0, pindexGenesisBlock));
1556 while (!vStack.empty())
1558 int nCol = vStack.back().first;
1559 CBlockIndex* pindex = vStack.back().second;
1562 // print split or gap
1563 if (nCol > nPrevCol)
1565 for (int i = 0; i < nCol-1; i++)
1569 else if (nCol < nPrevCol)
1571 for (int i = 0; i < nCol; i++)
1578 for (int i = 0; i < nCol; i++)
1583 block.ReadFromDisk(pindex);
1584 printf("%d (%u,%u) %s %s tx %d",
1588 block.GetHash().ToString().substr(0,20).c_str(),
1589 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1592 PrintWallets(block);
1594 // put the main timechain first
1595 vector<CBlockIndex*>& vNext = mapNext[pindex];
1596 for (int i = 0; i < vNext.size(); i++)
1598 if (vNext[i]->pnext)
1600 swap(vNext[0], vNext[i]);
1606 for (int i = 0; i < vNext.size(); i++)
1607 vStack.push_back(make_pair(nCol+i, vNext[i]));
1620 //////////////////////////////////////////////////////////////////////////////
1625 map<uint256, CAlert> mapAlerts;
1626 CCriticalSection cs_mapAlerts;
1628 string GetWarnings(string strFor)
1631 string strStatusBar;
1633 if (GetBoolArg("-testsafemode"))
1636 // Misc warnings like out of disk space and clock is wrong
1637 if (strMiscWarning != "")
1640 strStatusBar = strMiscWarning;
1643 // Longer invalid proof-of-work chain
1644 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1647 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1651 CRITICAL_BLOCK(cs_mapAlerts)
1653 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1655 const CAlert& alert = item.second;
1656 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1658 nPriority = alert.nPriority;
1659 strStatusBar = alert.strStatusBar;
1664 if (strFor == "statusbar")
1665 return strStatusBar;
1666 else if (strFor == "rpc")
1668 assert(!"GetWarnings() : invalid parameter");
1672 bool CAlert::ProcessAlert()
1674 if (!CheckSignature())
1679 CRITICAL_BLOCK(cs_mapAlerts)
1681 // Cancel previous alerts
1682 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1684 const CAlert& alert = (*mi).second;
1687 printf("cancelling alert %d\n", alert.nID);
1688 mapAlerts.erase(mi++);
1690 else if (!alert.IsInEffect())
1692 printf("expiring alert %d\n", alert.nID);
1693 mapAlerts.erase(mi++);
1699 // Check if this alert has been cancelled
1700 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1702 const CAlert& alert = item.second;
1703 if (alert.Cancels(*this))
1705 printf("alert already cancelled by %d\n", alert.nID);
1711 mapAlerts.insert(make_pair(GetHash(), *this));
1714 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1726 //////////////////////////////////////////////////////////////////////////////
1732 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1736 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1737 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1739 // Don't know what it is, just say we already got one
1746 // The message start string is designed to be unlikely to occur in normal data.
1747 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1748 // a large 4-byte int at any alignment.
1749 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1752 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1754 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1755 RandAddSeedPerfmon();
1757 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1758 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1760 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1762 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1770 if (strCommand == "version")
1772 // Each connection can only send one version message
1773 if (pfrom->nVersion != 0)
1775 pfrom->Misbehaving(1);
1783 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1784 if (pfrom->nVersion == 10300)
1785 pfrom->nVersion = 300;
1786 if (pfrom->nVersion >= 106 && !vRecv.empty())
1787 vRecv >> addrFrom >> nNonce;
1788 if (pfrom->nVersion >= 106 && !vRecv.empty())
1789 vRecv >> pfrom->strSubVer;
1790 if (pfrom->nVersion >= 209 && !vRecv.empty())
1791 vRecv >> pfrom->nStartingHeight;
1793 if (pfrom->nVersion == 0)
1796 // Disconnect if we connected to ourself
1797 if (nNonce == nLocalHostNonce && nNonce > 1)
1799 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1800 pfrom->fDisconnect = true;
1804 // Be shy and don't send version until we hear
1805 if (pfrom->fInbound)
1806 pfrom->PushVersion();
1808 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1810 AddTimeData(pfrom->addr.ip, nTime);
1813 if (pfrom->nVersion >= 209)
1814 pfrom->PushMessage("verack");
1815 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1816 if (pfrom->nVersion < 209)
1817 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1819 if (!pfrom->fInbound)
1821 // Advertise our address
1822 if (addrLocalHost.IsRoutable() && !fUseProxy)
1824 CAddress addr(addrLocalHost);
1825 addr.nTime = GetAdjustedTime();
1826 pfrom->PushAddress(addr);
1829 // Get recent addresses
1830 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1832 pfrom->PushMessage("getaddr");
1833 pfrom->fGetAddr = true;
1837 // Ask the first connected node for block updates
1838 static int nAskedForBlocks;
1839 if (!pfrom->fClient &&
1840 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1841 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1844 pfrom->PushGetBlocks(pindexBest, uint256(0));
1848 CRITICAL_BLOCK(cs_mapAlerts)
1849 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1850 item.second.RelayTo(pfrom);
1852 pfrom->fSuccessfullyConnected = true;
1854 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1855 if(pfrom->nStartingHeight > nMaxBlocksOfPeers)
1857 nMaxBlocksOfPeers = pfrom->nStartingHeight;
1862 else if (pfrom->nVersion == 0)
1864 // Must have a version message before anything else
1865 pfrom->Misbehaving(1);
1870 else if (strCommand == "verack")
1872 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1876 else if (strCommand == "addr")
1878 vector<CAddress> vAddr;
1881 // Don't want addr from older versions unless seeding
1882 if (pfrom->nVersion < 209)
1884 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1886 if (vAddr.size() > 1000)
1888 pfrom->Misbehaving(20);
1889 return error("message addr size() = %d", vAddr.size());
1892 // Store the new addresses
1895 int64 nNow = GetAdjustedTime();
1896 int64 nSince = nNow - 10 * 60;
1897 BOOST_FOREACH(CAddress& addr, vAddr)
1901 // ignore IPv6 for now, since it isn't implemented anyway
1904 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1905 addr.nTime = nNow - 5 * 24 * 60 * 60;
1906 AddAddress(addr, 2 * 60 * 60, &addrDB);
1907 pfrom->AddAddressKnown(addr);
1908 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1910 // Relay to a limited number of other nodes
1911 CRITICAL_BLOCK(cs_vNodes)
1913 // Use deterministic randomness to send to the same nodes for 24 hours
1914 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1915 static uint256 hashSalt;
1917 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1918 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1919 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1920 multimap<uint256, CNode*> mapMix;
1921 BOOST_FOREACH(CNode* pnode, vNodes)
1923 if (pnode->nVersion < 31402)
1925 unsigned int nPointer;
1926 memcpy(&nPointer, &pnode, sizeof(nPointer));
1927 uint256 hashKey = hashRand ^ nPointer;
1928 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1929 mapMix.insert(make_pair(hashKey, pnode));
1931 int nRelayNodes = 2;
1932 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1933 ((*mi).second)->PushAddress(addr);
1937 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1938 if (vAddr.size() < 1000)
1939 pfrom->fGetAddr = false;
1943 else if (strCommand == "inv")
1947 if (vInv.size() > 50000)
1949 pfrom->Misbehaving(20);
1950 return error("message inv size() = %d", vInv.size());
1954 BOOST_FOREACH(const CInv& inv, vInv)
1958 pfrom->AddInventoryKnown(inv);
1960 bool fAlreadyHave = AlreadyHave(txdb, inv);
1962 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1966 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1967 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1969 // Track requests for our stuff
1970 Inventory(inv.hash);
1975 else if (strCommand == "getdata")
1979 if (vInv.size() > 50000)
1981 pfrom->Misbehaving(20);
1982 return error("message getdata size() = %d", vInv.size());
1985 BOOST_FOREACH(const CInv& inv, vInv)
1989 printf("received getdata for: %s\n", inv.ToString().c_str());
1991 if (inv.type == MSG_BLOCK)
1993 // Send block from disk
1994 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1995 if (mi != mapBlockIndex.end())
1998 block.ReadFromDisk((*mi).second);
1999 pfrom->PushMessage("block", block);
2001 // Trigger them to send a getblocks request for the next batch of inventory
2002 if (inv.hash == pfrom->hashContinue)
2004 // Bypass PushInventory, this must send even if redundant,
2005 // and we want it right after the last block so they don't
2006 // wait for other stuff first.
2008 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2009 pfrom->PushMessage("inv", vInv);
2010 pfrom->hashContinue = 0;
2014 else if (inv.IsKnownType())
2016 // Send stream from relay memory
2017 CRITICAL_BLOCK(cs_mapRelay)
2019 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2020 if (mi != mapRelay.end())
2021 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2025 // Track requests for our stuff
2026 Inventory(inv.hash);
2031 else if (strCommand == "getblocks")
2033 CBlockLocator locator;
2035 vRecv >> locator >> hashStop;
2037 // Find the last block the caller has in the main chain
2038 CBlockIndex* pindex = locator.GetBlockIndex();
2040 // Send the rest of the chain
2042 pindex = pindex->pnext;
2043 int nLimit = 500 + locator.GetDistanceBack();
2044 unsigned int nBytes = 0;
2045 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2046 for (; pindex; pindex = pindex->pnext)
2048 if (pindex->GetBlockHash() == hashStop)
2050 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2053 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2055 block.ReadFromDisk(pindex, true);
2056 nBytes += block.GetSerializeSize(SER_NETWORK);
2057 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2059 // When this block is requested, we'll send an inv that'll make them
2060 // getblocks the next batch of inventory.
2061 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2062 pfrom->hashContinue = pindex->GetBlockHash();
2069 else if (strCommand == "getheaders")
2071 CBlockLocator locator;
2073 vRecv >> locator >> hashStop;
2075 CBlockIndex* pindex = NULL;
2076 if (locator.IsNull())
2078 // If locator is null, return the hashStop block
2079 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2080 if (mi == mapBlockIndex.end())
2082 pindex = (*mi).second;
2086 // Find the last block the caller has in the main chain
2087 pindex = locator.GetBlockIndex();
2089 pindex = pindex->pnext;
2092 vector<CBlock> vHeaders;
2093 int nLimit = 2000 + locator.GetDistanceBack();
2094 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2095 for (; pindex; pindex = pindex->pnext)
2097 vHeaders.push_back(pindex->GetBlockHeader());
2098 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2101 pfrom->PushMessage("headers", vHeaders);
2105 else if (strCommand == "tx")
2107 vector<uint256> vWorkQueue;
2108 CDataStream vMsg(vRecv);
2112 CInv inv(MSG_TX, tx.GetHash());
2113 pfrom->AddInventoryKnown(inv);
2115 bool fMissingInputs = false;
2116 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2118 SyncWithWallets(tx, NULL, true);
2119 RelayMessage(inv, vMsg);
2120 mapAlreadyAskedFor.erase(inv);
2121 vWorkQueue.push_back(inv.hash);
2123 // Recursively process any orphan transactions that depended on this one
2124 for (int i = 0; i < vWorkQueue.size(); i++)
2126 uint256 hashPrev = vWorkQueue[i];
2127 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2128 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2131 const CDataStream& vMsg = *((*mi).second);
2133 CDataStream(vMsg) >> tx;
2134 CInv inv(MSG_TX, tx.GetHash());
2136 if (tx.AcceptToMemoryPool(true))
2138 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2139 SyncWithWallets(tx, NULL, true);
2140 RelayMessage(inv, vMsg);
2141 mapAlreadyAskedFor.erase(inv);
2142 vWorkQueue.push_back(inv.hash);
2147 BOOST_FOREACH(uint256 hash, vWorkQueue)
2148 EraseOrphanTx(hash);
2150 else if (fMissingInputs)
2152 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2155 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2159 else if (strCommand == "block")
2164 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2167 CInv inv(MSG_BLOCK, block.GetHash());
2168 pfrom->AddInventoryKnown(inv);
2170 if (ProcessBlock(pfrom, &block))
2171 mapAlreadyAskedFor.erase(inv);
2172 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2176 else if (strCommand == "getaddr")
2178 // Nodes rebroadcast an addr every 24 hours
2179 pfrom->vAddrToSend.clear();
2180 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2181 CRITICAL_BLOCK(cs_mapAddresses)
2183 unsigned int nCount = 0;
2184 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2186 const CAddress& addr = item.second;
2187 if (addr.nTime > nSince)
2190 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2192 const CAddress& addr = item.second;
2193 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2194 pfrom->PushAddress(addr);
2200 else if (strCommand == "checkorder")
2205 if (!GetBoolArg("-allowreceivebyip"))
2207 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2214 /// we have a chance to check the order here
2216 // Keep giving the same key to the same ip until they use it
2217 if (!mapReuseKey.count(pfrom->addr.ip))
2218 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2220 // Send back approval of order and pubkey to use
2221 CScript scriptPubKey;
2222 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2223 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2227 else if (strCommand == "reply")
2232 CRequestTracker tracker;
2233 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2235 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2236 if (mi != pfrom->mapRequests.end())
2238 tracker = (*mi).second;
2239 pfrom->mapRequests.erase(mi);
2242 if (!tracker.IsNull())
2243 tracker.fn(tracker.param1, vRecv);
2247 else if (strCommand == "ping")
2252 else if (strCommand == "alert")
2257 if (alert.ProcessAlert())
2260 pfrom->setKnown.insert(alert.GetHash());
2261 CRITICAL_BLOCK(cs_vNodes)
2262 BOOST_FOREACH(CNode* pnode, vNodes)
2263 alert.RelayTo(pnode);
2270 // Ignore unknown commands for extensibility
2274 // Update the last seen time for this node's address
2275 if (pfrom->fNetworkNode)
2276 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2277 AddressCurrentlyConnected(pfrom->addr);
2283 bool ProcessMessages(CNode* pfrom)
2285 CDataStream& vRecv = pfrom->vRecv;
2289 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2293 // (4) message start
2302 // Scan for message start
2303 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2304 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2305 if (vRecv.end() - pstart < nHeaderSize)
2307 if (vRecv.size() > nHeaderSize)
2309 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2310 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2314 if (pstart - vRecv.begin() > 0)
2315 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2316 vRecv.erase(vRecv.begin(), pstart);
2319 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2324 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2327 string strCommand = hdr.GetCommand();
2330 unsigned int nMessageSize = hdr.nMessageSize;
2331 if (nMessageSize > MAX_SIZE)
2333 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2336 if (nMessageSize > vRecv.size())
2338 // Rewind and wait for rest of message
2339 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2344 if (vRecv.GetVersion() >= 209)
2346 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2347 unsigned int nChecksum = 0;
2348 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2349 if (nChecksum != hdr.nChecksum)
2351 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2352 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2357 // Copy message to its own buffer
2358 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2359 vRecv.ignore(nMessageSize);
2365 CRITICAL_BLOCK(cs_main)
2366 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2370 catch (std::ios_base::failure& e)
2372 if (strstr(e.what(), "end of data"))
2374 // Allow exceptions from underlength message on vRecv
2375 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());
2377 else if (strstr(e.what(), "size too large"))
2379 // Allow exceptions from overlong size
2380 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2384 PrintExceptionContinue(&e, "ProcessMessage()");
2387 catch (std::exception& e) {
2388 PrintExceptionContinue(&e, "ProcessMessage()");
2390 PrintExceptionContinue(NULL, "ProcessMessage()");
2394 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2402 bool SendMessages(CNode* pto, bool fSendTrickle)
2404 CRITICAL_BLOCK(cs_main)
2406 // Don't send anything until we get their version message
2407 if (pto->nVersion == 0)
2411 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2412 pto->PushMessage("ping");
2414 // Resend wallet transactions that haven't gotten in a block yet
2415 ResendWalletTransactions();
2417 // Address refresh broadcast
2418 static int64 nLastRebroadcast;
2419 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2421 nLastRebroadcast = GetTime();
2422 CRITICAL_BLOCK(cs_vNodes)
2424 BOOST_FOREACH(CNode* pnode, vNodes)
2426 // Periodically clear setAddrKnown to allow refresh broadcasts
2427 pnode->setAddrKnown.clear();
2429 // Rebroadcast our address
2430 if (addrLocalHost.IsRoutable() && !fUseProxy)
2432 CAddress addr(addrLocalHost);
2433 addr.nTime = GetAdjustedTime();
2434 pnode->PushAddress(addr);
2440 // Clear out old addresses periodically so it's not too much work at once
2441 static int64 nLastClear;
2442 if (nLastClear == 0)
2443 nLastClear = GetTime();
2444 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2446 nLastClear = GetTime();
2447 CRITICAL_BLOCK(cs_mapAddresses)
2450 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2451 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2452 mi != mapAddresses.end();)
2454 const CAddress& addr = (*mi).second;
2455 if (addr.nTime < nSince)
2457 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2459 addrdb.EraseAddress(addr);
2460 mapAddresses.erase(mi++);
2474 vector<CAddress> vAddr;
2475 vAddr.reserve(pto->vAddrToSend.size());
2476 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2478 // returns true if wasn't already contained in the set
2479 if (pto->setAddrKnown.insert(addr).second)
2481 vAddr.push_back(addr);
2482 // receiver rejects addr messages larger than 1000
2483 if (vAddr.size() >= 1000)
2485 pto->PushMessage("addr", vAddr);
2490 pto->vAddrToSend.clear();
2492 pto->PushMessage("addr", vAddr);
2497 // Message: inventory
2500 vector<CInv> vInvWait;
2501 CRITICAL_BLOCK(pto->cs_inventory)
2503 vInv.reserve(pto->vInventoryToSend.size());
2504 vInvWait.reserve(pto->vInventoryToSend.size());
2505 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2507 if (pto->setInventoryKnown.count(inv))
2510 // trickle out tx inv to protect privacy
2511 if (inv.type == MSG_TX && !fSendTrickle)
2513 // 1/4 of tx invs blast to all immediately
2514 static uint256 hashSalt;
2516 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2517 uint256 hashRand = inv.hash ^ hashSalt;
2518 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2519 bool fTrickleWait = ((hashRand & 3) != 0);
2521 // always trickle our own transactions
2525 if (GetTransaction(inv.hash, wtx))
2527 fTrickleWait = true;
2532 vInvWait.push_back(inv);
2537 // returns true if wasn't already contained in the set
2538 if (pto->setInventoryKnown.insert(inv).second)
2540 vInv.push_back(inv);
2541 if (vInv.size() >= 1000)
2543 pto->PushMessage("inv", vInv);
2548 pto->vInventoryToSend = vInvWait;
2551 pto->PushMessage("inv", vInv);
2557 vector<CInv> vGetData;
2558 int64 nNow = GetTime() * 1000000;
2560 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2562 const CInv& inv = (*pto->mapAskFor.begin()).second;
2563 if (!AlreadyHave(txdb, inv))
2565 printf("sending getdata: %s\n", inv.ToString().c_str());
2566 vGetData.push_back(inv);
2567 if (vGetData.size() >= 1000)
2569 pto->PushMessage("getdata", vGetData);
2573 mapAlreadyAskedFor[inv] = nNow;
2574 pto->mapAskFor.erase(pto->mapAskFor.begin());
2576 if (!vGetData.empty())
2577 pto->PushMessage("getdata", vGetData);
2596 //////////////////////////////////////////////////////////////////////////////
2601 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2603 unsigned char* pdata = (unsigned char*)pbuffer;
2604 unsigned int blocks = 1 + ((len + 8) / 64);
2605 unsigned char* pend = pdata + 64 * blocks;
2606 memset(pdata + len, 0, 64 * blocks - len);
2608 unsigned int bits = len * 8;
2609 pend[-1] = (bits >> 0) & 0xff;
2610 pend[-2] = (bits >> 8) & 0xff;
2611 pend[-3] = (bits >> 16) & 0xff;
2612 pend[-4] = (bits >> 24) & 0xff;
2616 using CryptoPP::ByteReverse;
2618 static const unsigned int pSHA256InitState[8] =
2619 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2621 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2623 memcpy(pstate, pinit, 32);
2624 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2628 // ScanHash scans nonces looking for a hash with at least some zero bits.
2629 // It operates on big endian data. Caller does the byte reversing.
2630 // All input buffers are 16-byte aligned. nNonce is usually preserved
2631 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2632 // the block is rebuilt and nNonce starts over at zero.
2634 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2636 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2640 // Hash pdata using pmidstate as the starting state into
2641 // preformatted buffer phash1, then hash phash1 into phash
2643 SHA256Transform(phash1, pdata, pmidstate);
2644 SHA256Transform(phash, phash1, pSHA256InitState);
2646 // Return the nonce if the hash has at least some zero bits,
2647 // caller will check if it has enough to reach the target
2648 if (((unsigned short*)phash)[14] == 0)
2651 // If nothing found after trying for a while, return -1
2652 if ((nNonce & 0xffff) == 0)
2654 nHashesDone = 0xffff+1;
2660 // Some explaining would be appreciated
2665 set<uint256> setDependsOn;
2668 COrphan(CTransaction* ptxIn)
2676 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2677 BOOST_FOREACH(uint256 hash, setDependsOn)
2678 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2683 CBlock* CreateNewBlock(CReserveKey& reservekey)
2685 CBlockIndex* pindexPrev = pindexBest;
2688 auto_ptr<CBlock> pblock(new CBlock());
2692 // Create coinbase tx
2694 txNew.vin.resize(1);
2695 txNew.vin[0].prevout.SetNull();
2696 txNew.vout.resize(1);
2697 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2699 // Add our coinbase tx as first transaction
2700 pblock->vtx.push_back(txNew);
2702 // Collect memory pool transactions into the block
2704 CRITICAL_BLOCK(cs_main)
2705 CRITICAL_BLOCK(cs_mapTransactions)
2709 // Priority order to process transactions
2710 list<COrphan> vOrphan; // list memory doesn't move
2711 map<uint256, vector<COrphan*> > mapDependers;
2712 multimap<double, CTransaction*> mapPriority;
2713 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2715 CTransaction& tx = (*mi).second;
2716 if (tx.IsCoinBase() || !tx.IsFinal())
2719 COrphan* porphan = NULL;
2720 double dPriority = 0;
2721 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2723 // Read prev transaction
2724 CTransaction txPrev;
2726 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2728 // Has to wait for dependencies
2731 // Use list for automatic deletion
2732 vOrphan.push_back(COrphan(&tx));
2733 porphan = &vOrphan.back();
2735 mapDependers[txin.prevout.hash].push_back(porphan);
2736 porphan->setDependsOn.insert(txin.prevout.hash);
2739 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2741 // Read block header
2742 int nConf = txindex.GetDepthInMainChain();
2744 dPriority += (double)nValueIn * nConf;
2746 if (fDebug && GetBoolArg("-printpriority"))
2747 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2750 // Priority is sum(valuein * age) / txsize
2751 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2754 porphan->dPriority = dPriority;
2756 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2758 if (fDebug && GetBoolArg("-printpriority"))
2760 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2767 // Collect transactions into block
2768 map<uint256, CTxIndex> mapTestPool;
2769 uint64 nBlockSize = 1000;
2770 int nBlockSigOps = 100;
2771 while (!mapPriority.empty())
2773 // Take highest priority transaction off priority queue
2774 double dPriority = -(*mapPriority.begin()).first;
2775 CTransaction& tx = *(*mapPriority.begin()).second;
2776 mapPriority.erase(mapPriority.begin());
2779 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2780 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2782 int nTxSigOps = tx.GetSigOpCount();
2783 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2786 // Transaction fee required depends on block size
2787 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2788 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2790 // Connecting shouldn't fail due to dependency on other memory pool transactions
2791 // because we're already processing them in order of dependency
2792 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2793 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2795 swap(mapTestPool, mapTestPoolTmp);
2798 pblock->vtx.push_back(tx);
2799 nBlockSize += nTxSize;
2800 nBlockSigOps += nTxSigOps;
2802 // Add transactions that depend on this one to the priority queue
2803 uint256 hash = tx.GetHash();
2804 if (mapDependers.count(hash))
2806 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2808 if (!porphan->setDependsOn.empty())
2810 porphan->setDependsOn.erase(hash);
2811 if (porphan->setDependsOn.empty())
2812 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2818 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2821 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2822 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2823 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2824 pblock->nBits = GetNextWorkRequired(pindexPrev);
2827 return pblock.release();
2831 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2833 // Update nExtraNonce
2834 static uint256 hashPrevBlock;
2835 if (hashPrevBlock != pblock->hashPrevBlock)
2838 hashPrevBlock = pblock->hashPrevBlock;
2841 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2842 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2846 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2849 // Prebuild hash buffers
2856 uint256 hashPrevBlock;
2857 uint256 hashMerkleRoot;
2860 unsigned int nNonce;
2863 unsigned char pchPadding0[64];
2865 unsigned char pchPadding1[64];
2868 memset(&tmp, 0, sizeof(tmp));
2870 tmp.block.nVersion = pblock->nVersion;
2871 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2872 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2873 tmp.block.nTime = pblock->nTime;
2874 tmp.block.nBits = pblock->nBits;
2875 tmp.block.nNonce = pblock->nNonce;
2877 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2878 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2880 // Byte swap all the input buffer
2881 for (int i = 0; i < sizeof(tmp)/4; i++)
2882 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2884 // Precalc the first half of the first hash, which stays constant
2885 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2887 memcpy(pdata, &tmp.block, 128);
2888 memcpy(phash1, &tmp.hash1, 64);
2892 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2894 uint256 hash = pblock->GetHash();
2895 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2897 if (hash > hashTarget)
2901 printf("BitcoinMiner:\n");
2902 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2904 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2905 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2908 CRITICAL_BLOCK(cs_main)
2910 if (pblock->hashPrevBlock != hashBestChain)
2911 return error("BitcoinMiner : generated block is stale");
2913 // Remove key from key pool
2914 reservekey.KeepKey();
2916 // Track how many getdata requests this block gets
2917 CRITICAL_BLOCK(wallet.cs_wallet)
2918 wallet.mapRequestCount[pblock->GetHash()] = 0;
2920 // Process this block the same as if we had received it from another node
2921 if (!ProcessBlock(NULL, pblock))
2922 return error("BitcoinMiner : ProcessBlock, block not accepted");
2929 void static ThreadBitcoinMiner(void* parg);
2931 void static BitcoinMiner(CWallet *pwallet)
2933 printf("BitcoinMiner started\n");
2934 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2936 // Each thread has its own key and counter
2937 CReserveKey reservekey(pwallet);
2938 unsigned int nExtraNonce = 0;
2940 while (fGenerateBitcoins)
2942 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2946 while (vNodes.empty() || IsInitialBlockDownload())
2951 if (!fGenerateBitcoins)
2959 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2960 CBlockIndex* pindexPrev = pindexBest;
2962 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2965 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2967 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2971 // Prebuild hash buffers
2973 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2974 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2975 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2977 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2979 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2980 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2986 int64 nStart = GetTime();
2987 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2989 uint256& hash = *alignup<16>(hashbuf);
2992 unsigned int nHashesDone = 0;
2993 unsigned int nNonceFound;
2996 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2997 (char*)&hash, nHashesDone);
2999 // Check if something found
3000 if (nNonceFound != -1)
3002 for (int i = 0; i < sizeof(hash)/4; i++)
3003 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3005 if (hash <= hashTarget)
3008 pblock->nNonce = ByteReverse(nNonceFound);
3009 assert(hash == pblock->GetHash());
3011 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3012 CheckWork(pblock.get(), *pwalletMain, reservekey);
3013 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3019 static int64 nHashCounter;
3020 if (nHPSTimerStart == 0)
3022 nHPSTimerStart = GetTimeMillis();
3026 nHashCounter += nHashesDone;
3027 if (GetTimeMillis() - nHPSTimerStart > 4000)
3029 static CCriticalSection cs;
3032 if (GetTimeMillis() - nHPSTimerStart > 4000)
3034 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3035 nHPSTimerStart = GetTimeMillis();
3037 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3038 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3039 static int64 nLogTime;
3040 if (GetTime() - nLogTime > 30 * 60)
3042 nLogTime = GetTime();
3043 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3044 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3050 // Check for stop or if block needs to be rebuilt
3053 if (!fGenerateBitcoins)
3055 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3059 if (nBlockNonce >= 0xffff0000)
3061 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3063 if (pindexPrev != pindexBest)
3066 // Update nTime every few seconds
3067 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3068 nBlockTime = ByteReverse(pblock->nTime);
3073 void static ThreadBitcoinMiner(void* parg)
3075 CWallet* pwallet = (CWallet*)parg;
3078 vnThreadsRunning[3]++;
3079 BitcoinMiner(pwallet);
3080 vnThreadsRunning[3]--;
3082 catch (std::exception& e) {
3083 vnThreadsRunning[3]--;
3084 PrintException(&e, "ThreadBitcoinMiner()");
3086 vnThreadsRunning[3]--;
3087 PrintException(NULL, "ThreadBitcoinMiner()");
3089 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3091 if (vnThreadsRunning[3] == 0)
3093 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3097 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3099 if (fGenerateBitcoins != fGenerate)
3101 fGenerateBitcoins = fGenerate;
3102 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3105 if (fGenerateBitcoins)
3107 int nProcessors = boost::thread::hardware_concurrency();
3108 printf("%d processors\n", nProcessors);
3109 if (nProcessors < 1)
3111 if (fLimitProcessors && nProcessors > nLimitProcessors)
3112 nProcessors = nLimitProcessors;
3113 int nAddThreads = nProcessors - vnThreadsRunning[3];
3114 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3115 for (int i = 0; i < nAddThreads; i++)
3117 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3118 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");