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 error("CTransaction::CheckTransaction() : vin empty");
302 return error("CTransaction::CheckTransaction() : vout empty");
304 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
305 return 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 error("CTransaction::CheckTransaction() : txout.nValue negative");
313 if (txout.nValue > MAX_MONEY)
314 return error("CTransaction::CheckTransaction() : txout.nValue too high");
315 nValueOut += txout.nValue;
316 if (!MoneyRange(nValueOut))
317 return 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 error("CTransaction::CheckTransaction() : coinbase script size");
336 BOOST_FOREACH(const CTxIn& txin, vin)
337 if (txin.prevout.IsNull())
338 return 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 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 error("AcceptToMemoryPool() : nonstandard transaction");
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 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 error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
867 if (!VerifySignature(txPrev, *this, i))
868 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
870 // Check for conflicts
871 if (!txindex.vSpent[prevout.n].IsNull())
872 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());
874 // Check for negative or overflow input values
875 nValueIn += txPrev.vout[prevout.n].nValue;
876 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
877 return error("ConnectInputs() : txin values out of range");
879 // Mark outpoints as spent
880 txindex.vSpent[prevout.n] = posThisTx;
883 if (fBlock || fMiner)
885 mapTestPool[prevout.hash] = txindex;
889 if (nValueIn < GetValueOut())
890 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
892 // Tally transaction fees
893 int64 nTxFee = nValueIn - GetValueOut();
895 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
896 if (nTxFee < nMinFee)
899 if (!MoneyRange(nFees))
900 return error("ConnectInputs() : nFees out of range");
905 // Add transaction to changes
906 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
910 // Add transaction to test pool
911 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
918 bool CTransaction::ClientConnectInputs()
923 // Take over previous transactions' spent pointers
924 CRITICAL_BLOCK(cs_mapTransactions)
927 for (int i = 0; i < vin.size(); i++)
929 // Get prev tx from single transactions in memory
930 COutPoint prevout = vin[i].prevout;
931 if (!mapTransactions.count(prevout.hash))
933 CTransaction& txPrev = mapTransactions[prevout.hash];
935 if (prevout.n >= txPrev.vout.size())
939 if (!VerifySignature(txPrev, *this, i))
940 return error("ConnectInputs() : VerifySignature failed");
942 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
943 ///// this has to go away now that posNext is gone
944 // // Check for conflicts
945 // if (!txPrev.vout[prevout.n].posNext.IsNull())
946 // return error("ConnectInputs() : prev tx already used");
948 // // Flag outpoints as used
949 // txPrev.vout[prevout.n].posNext = posThisTx;
951 nValueIn += txPrev.vout[prevout.n].nValue;
953 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
954 return error("ClientConnectInputs() : txin values out of range");
956 if (GetValueOut() > nValueIn)
966 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
968 // Disconnect in reverse order
969 for (int i = vtx.size()-1; i >= 0; i--)
970 if (!vtx[i].DisconnectInputs(txdb))
973 // Update block index on disk without changing it in memory.
974 // The memory index structure will be changed after the db commits.
977 CDiskBlockIndex blockindexPrev(pindex->pprev);
978 blockindexPrev.hashNext = 0;
979 if (!txdb.WriteBlockIndex(blockindexPrev))
980 return error("DisconnectBlock() : WriteBlockIndex failed");
986 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
988 // Check it again in case a previous version let a bad block in
992 //// issue here: it doesn't know the version
993 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
995 map<uint256, CTxIndex> mapQueuedChanges;
997 BOOST_FOREACH(CTransaction& tx, vtx)
999 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1000 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1002 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1005 // Write queued txindex changes
1006 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1008 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1009 return error("ConnectBlock() : UpdateTxIndex failed");
1012 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1015 // Update block index on disk without changing it in memory.
1016 // The memory index structure will be changed after the db commits.
1019 CDiskBlockIndex blockindexPrev(pindex->pprev);
1020 blockindexPrev.hashNext = pindex->GetBlockHash();
1021 if (!txdb.WriteBlockIndex(blockindexPrev))
1022 return error("ConnectBlock() : WriteBlockIndex failed");
1025 // Watch for transactions paying to me
1026 BOOST_FOREACH(CTransaction& tx, vtx)
1027 SyncWithWallets(tx, this, true);
1032 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1034 printf("REORGANIZE\n");
1037 CBlockIndex* pfork = pindexBest;
1038 CBlockIndex* plonger = pindexNew;
1039 while (pfork != plonger)
1041 while (plonger->nHeight > pfork->nHeight)
1042 if (!(plonger = plonger->pprev))
1043 return error("Reorganize() : plonger->pprev is null");
1044 if (pfork == plonger)
1046 if (!(pfork = pfork->pprev))
1047 return error("Reorganize() : pfork->pprev is null");
1050 // List of what to disconnect
1051 vector<CBlockIndex*> vDisconnect;
1052 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1053 vDisconnect.push_back(pindex);
1055 // List of what to connect
1056 vector<CBlockIndex*> vConnect;
1057 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1058 vConnect.push_back(pindex);
1059 reverse(vConnect.begin(), vConnect.end());
1061 // Disconnect shorter branch
1062 vector<CTransaction> vResurrect;
1063 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1066 if (!block.ReadFromDisk(pindex))
1067 return error("Reorganize() : ReadFromDisk for disconnect failed");
1068 if (!block.DisconnectBlock(txdb, pindex))
1069 return error("Reorganize() : DisconnectBlock failed");
1071 // Queue memory transactions to resurrect
1072 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1073 if (!tx.IsCoinBase())
1074 vResurrect.push_back(tx);
1077 // Connect longer branch
1078 vector<CTransaction> vDelete;
1079 for (int i = 0; i < vConnect.size(); i++)
1081 CBlockIndex* pindex = vConnect[i];
1083 if (!block.ReadFromDisk(pindex))
1084 return error("Reorganize() : ReadFromDisk for connect failed");
1085 if (!block.ConnectBlock(txdb, pindex))
1089 return error("Reorganize() : ConnectBlock failed");
1092 // Queue memory transactions to delete
1093 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1094 vDelete.push_back(tx);
1096 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1097 return error("Reorganize() : WriteHashBestChain failed");
1099 // Make sure it's successfully written to disk before changing memory structure
1100 if (!txdb.TxnCommit())
1101 return error("Reorganize() : TxnCommit failed");
1103 // Disconnect shorter branch
1104 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1106 pindex->pprev->pnext = NULL;
1108 // Connect longer branch
1109 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1111 pindex->pprev->pnext = pindex;
1113 // Resurrect memory transactions that were in the disconnected branch
1114 BOOST_FOREACH(CTransaction& tx, vResurrect)
1115 tx.AcceptToMemoryPool(txdb, false);
1117 // Delete redundant memory transactions that are in the connected branch
1118 BOOST_FOREACH(CTransaction& tx, vDelete)
1119 tx.RemoveFromMemoryPool();
1125 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1127 uint256 hash = GetHash();
1130 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1132 txdb.WriteHashBestChain(hash);
1133 if (!txdb.TxnCommit())
1134 return error("SetBestChain() : TxnCommit failed");
1135 pindexGenesisBlock = pindexNew;
1137 else if (hashPrevBlock == hashBestChain)
1139 // Adding to current best branch
1140 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1143 InvalidChainFound(pindexNew);
1144 return error("SetBestChain() : ConnectBlock failed");
1146 if (!txdb.TxnCommit())
1147 return error("SetBestChain() : TxnCommit failed");
1149 // Add to current best branch
1150 pindexNew->pprev->pnext = pindexNew;
1152 // Delete redundant memory transactions
1153 BOOST_FOREACH(CTransaction& tx, vtx)
1154 tx.RemoveFromMemoryPool();
1159 if (!Reorganize(txdb, pindexNew))
1162 InvalidChainFound(pindexNew);
1163 return error("SetBestChain() : Reorganize failed");
1167 // Update best block in wallet (so we can detect restored wallets)
1168 if (!IsInitialBlockDownload())
1170 const CBlockLocator locator(pindexNew);
1171 ::SetBestChain(locator);
1175 hashBestChain = hash;
1176 pindexBest = pindexNew;
1177 nBestHeight = pindexBest->nHeight;
1178 bnBestChainWork = pindexNew->bnChainWork;
1179 nTimeBestReceived = GetTime();
1180 nTransactionsUpdated++;
1181 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1187 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1189 // Check for duplicate
1190 uint256 hash = GetHash();
1191 if (mapBlockIndex.count(hash))
1192 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1194 // Construct new block index object
1195 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1197 return error("AddToBlockIndex() : new CBlockIndex failed");
1198 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1199 pindexNew->phashBlock = &((*mi).first);
1200 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1201 if (miPrev != mapBlockIndex.end())
1203 pindexNew->pprev = (*miPrev).second;
1204 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1206 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1210 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1211 if (!txdb.TxnCommit())
1215 if (pindexNew->bnChainWork > bnBestChainWork)
1216 if (!SetBestChain(txdb, pindexNew))
1221 if (pindexNew == pindexBest)
1223 // Notify UI to display prev block's coinbase if it was ours
1224 static uint256 hashPrevBestCoinBase;
1225 UpdatedTransaction(hashPrevBestCoinBase);
1226 hashPrevBestCoinBase = vtx[0].GetHash();
1236 bool CBlock::CheckBlock() const
1238 // These are checks that are independent of context
1239 // that can be verified before saving an orphan block.
1242 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1243 return error("CheckBlock() : size limits failed");
1245 // Check proof of work matches claimed amount
1246 if (!CheckProofOfWork(GetHash(), nBits))
1247 return error("CheckBlock() : proof of work failed");
1250 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1251 return error("CheckBlock() : block timestamp too far in the future");
1253 // First transaction must be coinbase, the rest must not be
1254 if (vtx.empty() || !vtx[0].IsCoinBase())
1255 return error("CheckBlock() : first tx is not coinbase");
1256 for (int i = 1; i < vtx.size(); i++)
1257 if (vtx[i].IsCoinBase())
1258 return error("CheckBlock() : more than one coinbase");
1260 // Check transactions
1261 BOOST_FOREACH(const CTransaction& tx, vtx)
1262 if (!tx.CheckTransaction())
1263 return error("CheckBlock() : CheckTransaction failed");
1265 // Check that it's not full of nonstandard transactions
1266 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1267 return error("CheckBlock() : too many nonstandard transactions");
1270 if (hashMerkleRoot != BuildMerkleTree())
1271 return error("CheckBlock() : hashMerkleRoot mismatch");
1276 bool CBlock::AcceptBlock()
1278 // Check for duplicate
1279 uint256 hash = GetHash();
1280 if (mapBlockIndex.count(hash))
1281 return error("AcceptBlock() : block already in mapBlockIndex");
1283 // Get prev block index
1284 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1285 if (mi == mapBlockIndex.end())
1286 return error("AcceptBlock() : prev block not found");
1287 CBlockIndex* pindexPrev = (*mi).second;
1288 int nHeight = pindexPrev->nHeight+1;
1290 // Check proof of work
1291 if (nBits != GetNextWorkRequired(pindexPrev))
1292 return error("AcceptBlock() : incorrect proof of work");
1294 // Check timestamp against prev
1295 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1296 return error("AcceptBlock() : block's timestamp is too early");
1298 // Check that all transactions are finalized
1299 BOOST_FOREACH(const CTransaction& tx, vtx)
1300 if (!tx.IsFinal(nHeight, GetBlockTime()))
1301 return error("AcceptBlock() : contains a non-final transaction");
1303 // Check that the block chain matches the known block chain up to a checkpoint
1305 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1306 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1307 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1308 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1309 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1310 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1311 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1312 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")) ||
1313 (nHeight == 140700 && hash != uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd")))
1314 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1316 // Write block to history file
1317 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1318 return error("AcceptBlock() : out of disk space");
1319 unsigned int nFile = -1;
1320 unsigned int nBlockPos = 0;
1321 if (!WriteToDisk(nFile, nBlockPos))
1322 return error("AcceptBlock() : WriteToDisk failed");
1323 if (!AddToBlockIndex(nFile, nBlockPos))
1324 return error("AcceptBlock() : AddToBlockIndex failed");
1326 // Relay inventory, but don't relay old inventory during initial block download
1327 if (hashBestChain == hash)
1328 CRITICAL_BLOCK(cs_vNodes)
1329 BOOST_FOREACH(CNode* pnode, vNodes)
1330 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1331 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1336 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1338 // Check for duplicate
1339 uint256 hash = pblock->GetHash();
1340 if (mapBlockIndex.count(hash))
1341 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1342 if (mapOrphanBlocks.count(hash))
1343 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1345 // Preliminary checks
1346 if (!pblock->CheckBlock())
1347 return error("ProcessBlock() : CheckBlock FAILED");
1349 // If don't already have its previous block, shunt it off to holding area until we get it
1350 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1352 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1353 CBlock* pblock2 = new CBlock(*pblock);
1354 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1355 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1357 // Ask this guy to fill in what we're missing
1359 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1364 if (!pblock->AcceptBlock())
1365 return error("ProcessBlock() : AcceptBlock FAILED");
1367 // Recursively process any orphan blocks that depended on this one
1368 vector<uint256> vWorkQueue;
1369 vWorkQueue.push_back(hash);
1370 for (int i = 0; i < vWorkQueue.size(); i++)
1372 uint256 hashPrev = vWorkQueue[i];
1373 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1374 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1377 CBlock* pblockOrphan = (*mi).second;
1378 if (pblockOrphan->AcceptBlock())
1379 vWorkQueue.push_back(pblockOrphan->GetHash());
1380 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1381 delete pblockOrphan;
1383 mapOrphanBlocksByPrev.erase(hashPrev);
1386 printf("ProcessBlock: ACCEPTED\n");
1397 bool CheckDiskSpace(uint64 nAdditionalBytes)
1399 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1401 // Check for 15MB because database could create another 10MB log file at any time
1402 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1405 string strMessage = _("Warning: Disk space is low ");
1406 strMiscWarning = strMessage;
1407 printf("*** %s\n", strMessage.c_str());
1408 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1409 CreateThread(Shutdown, NULL);
1415 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1419 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1422 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1424 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1433 static unsigned int nCurrentBlockFile = 1;
1435 FILE* AppendBlockFile(unsigned int& nFileRet)
1440 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1443 if (fseek(file, 0, SEEK_END) != 0)
1445 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1446 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1448 nFileRet = nCurrentBlockFile;
1452 nCurrentBlockFile++;
1456 bool LoadBlockIndex(bool fAllowNew)
1460 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1461 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1462 pchMessageStart[0] = 0xfa;
1463 pchMessageStart[1] = 0xbf;
1464 pchMessageStart[2] = 0xb5;
1465 pchMessageStart[3] = 0xda;
1472 if (!txdb.LoadBlockIndex())
1477 // Init with genesis block
1479 if (mapBlockIndex.empty())
1485 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1486 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1487 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1488 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1489 // vMerkleTree: 4a5e1e
1492 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1494 txNew.vin.resize(1);
1495 txNew.vout.resize(1);
1496 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1497 txNew.vout[0].nValue = 50 * COIN;
1498 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1500 block.vtx.push_back(txNew);
1501 block.hashPrevBlock = 0;
1502 block.hashMerkleRoot = block.BuildMerkleTree();
1504 block.nTime = 1231006505;
1505 block.nBits = 0x1d00ffff;
1506 block.nNonce = 2083236893;
1510 block.nTime = 1296688602;
1511 block.nBits = 0x1d07fff8;
1512 block.nNonce = 384568319;
1516 printf("%s\n", block.GetHash().ToString().c_str());
1517 printf("%s\n", hashGenesisBlock.ToString().c_str());
1518 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1519 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1521 assert(block.GetHash() == hashGenesisBlock);
1523 // Start new block file
1525 unsigned int nBlockPos;
1526 if (!block.WriteToDisk(nFile, nBlockPos))
1527 return error("LoadBlockIndex() : writing genesis block to disk failed");
1528 if (!block.AddToBlockIndex(nFile, nBlockPos))
1529 return error("LoadBlockIndex() : genesis block not accepted");
1537 void PrintBlockTree()
1539 // precompute tree structure
1540 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1541 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1543 CBlockIndex* pindex = (*mi).second;
1544 mapNext[pindex->pprev].push_back(pindex);
1546 //while (rand() % 3 == 0)
1547 // mapNext[pindex->pprev].push_back(pindex);
1550 vector<pair<int, CBlockIndex*> > vStack;
1551 vStack.push_back(make_pair(0, pindexGenesisBlock));
1554 while (!vStack.empty())
1556 int nCol = vStack.back().first;
1557 CBlockIndex* pindex = vStack.back().second;
1560 // print split or gap
1561 if (nCol > nPrevCol)
1563 for (int i = 0; i < nCol-1; i++)
1567 else if (nCol < nPrevCol)
1569 for (int i = 0; i < nCol; i++)
1576 for (int i = 0; i < nCol; i++)
1581 block.ReadFromDisk(pindex);
1582 printf("%d (%u,%u) %s %s tx %d",
1586 block.GetHash().ToString().substr(0,20).c_str(),
1587 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1590 PrintWallets(block);
1592 // put the main timechain first
1593 vector<CBlockIndex*>& vNext = mapNext[pindex];
1594 for (int i = 0; i < vNext.size(); i++)
1596 if (vNext[i]->pnext)
1598 swap(vNext[0], vNext[i]);
1604 for (int i = 0; i < vNext.size(); i++)
1605 vStack.push_back(make_pair(nCol+i, vNext[i]));
1618 //////////////////////////////////////////////////////////////////////////////
1623 map<uint256, CAlert> mapAlerts;
1624 CCriticalSection cs_mapAlerts;
1626 string GetWarnings(string strFor)
1629 string strStatusBar;
1631 if (GetBoolArg("-testsafemode"))
1634 // Misc warnings like out of disk space and clock is wrong
1635 if (strMiscWarning != "")
1638 strStatusBar = strMiscWarning;
1641 // Longer invalid proof-of-work chain
1642 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1645 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1649 CRITICAL_BLOCK(cs_mapAlerts)
1651 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1653 const CAlert& alert = item.second;
1654 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1656 nPriority = alert.nPriority;
1657 strStatusBar = alert.strStatusBar;
1662 if (strFor == "statusbar")
1663 return strStatusBar;
1664 else if (strFor == "rpc")
1666 assert(!"GetWarnings() : invalid parameter");
1670 bool CAlert::ProcessAlert()
1672 if (!CheckSignature())
1677 CRITICAL_BLOCK(cs_mapAlerts)
1679 // Cancel previous alerts
1680 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1682 const CAlert& alert = (*mi).second;
1685 printf("cancelling alert %d\n", alert.nID);
1686 mapAlerts.erase(mi++);
1688 else if (!alert.IsInEffect())
1690 printf("expiring alert %d\n", alert.nID);
1691 mapAlerts.erase(mi++);
1697 // Check if this alert has been cancelled
1698 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1700 const CAlert& alert = item.second;
1701 if (alert.Cancels(*this))
1703 printf("alert already cancelled by %d\n", alert.nID);
1709 mapAlerts.insert(make_pair(GetHash(), *this));
1712 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1724 //////////////////////////////////////////////////////////////////////////////
1730 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1734 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1735 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1737 // Don't know what it is, just say we already got one
1744 // The message start string is designed to be unlikely to occur in normal data.
1745 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1746 // a large 4-byte int at any alignment.
1747 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1750 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1752 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1753 RandAddSeedPerfmon();
1755 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1756 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1757 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1759 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1767 if (strCommand == "version")
1769 // Each connection can only send one version message
1770 if (pfrom->nVersion != 0)
1777 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1778 if (pfrom->nVersion == 10300)
1779 pfrom->nVersion = 300;
1780 if (pfrom->nVersion >= 106 && !vRecv.empty())
1781 vRecv >> addrFrom >> nNonce;
1782 if (pfrom->nVersion >= 106 && !vRecv.empty())
1783 vRecv >> pfrom->strSubVer;
1784 if (pfrom->nVersion >= 209 && !vRecv.empty())
1785 vRecv >> pfrom->nStartingHeight;
1787 if (pfrom->nVersion == 0)
1790 // Disconnect if we connected to ourself
1791 if (nNonce == nLocalHostNonce && nNonce > 1)
1793 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1794 pfrom->fDisconnect = true;
1798 // Be shy and don't send version until we hear
1799 if (pfrom->fInbound)
1800 pfrom->PushVersion();
1802 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1804 AddTimeData(pfrom->addr.ip, nTime);
1807 if (pfrom->nVersion >= 209)
1808 pfrom->PushMessage("verack");
1809 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1810 if (pfrom->nVersion < 209)
1811 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1813 if (!pfrom->fInbound)
1815 // Advertise our address
1816 if (addrLocalHost.IsRoutable() && !fUseProxy)
1818 CAddress addr(addrLocalHost);
1819 addr.nTime = GetAdjustedTime();
1820 pfrom->PushAddress(addr);
1823 // Get recent addresses
1824 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1826 pfrom->PushMessage("getaddr");
1827 pfrom->fGetAddr = true;
1831 // Ask the first connected node for block updates
1832 static int nAskedForBlocks;
1833 if (!pfrom->fClient &&
1834 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1835 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1838 pfrom->PushGetBlocks(pindexBest, uint256(0));
1842 CRITICAL_BLOCK(cs_mapAlerts)
1843 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1844 item.second.RelayTo(pfrom);
1846 pfrom->fSuccessfullyConnected = true;
1848 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1849 if(pfrom->nStartingHeight > nMaxBlocksOfPeers)
1851 nMaxBlocksOfPeers = pfrom->nStartingHeight;
1856 else if (pfrom->nVersion == 0)
1858 // Must have a version message before anything else
1863 else if (strCommand == "verack")
1865 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1869 else if (strCommand == "addr")
1871 vector<CAddress> vAddr;
1874 // Don't want addr from older versions unless seeding
1875 if (pfrom->nVersion < 209)
1877 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1879 if (vAddr.size() > 1000)
1880 return error("message addr size() = %d", vAddr.size());
1882 // Store the new addresses
1885 int64 nNow = GetAdjustedTime();
1886 int64 nSince = nNow - 10 * 60;
1887 BOOST_FOREACH(CAddress& addr, vAddr)
1891 // ignore IPv6 for now, since it isn't implemented anyway
1894 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1895 addr.nTime = nNow - 5 * 24 * 60 * 60;
1896 AddAddress(addr, 2 * 60 * 60, &addrDB);
1897 pfrom->AddAddressKnown(addr);
1898 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1900 // Relay to a limited number of other nodes
1901 CRITICAL_BLOCK(cs_vNodes)
1903 // Use deterministic randomness to send to the same nodes for 24 hours
1904 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1905 static uint256 hashSalt;
1907 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1908 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1909 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1910 multimap<uint256, CNode*> mapMix;
1911 BOOST_FOREACH(CNode* pnode, vNodes)
1913 if (pnode->nVersion < 31402)
1915 unsigned int nPointer;
1916 memcpy(&nPointer, &pnode, sizeof(nPointer));
1917 uint256 hashKey = hashRand ^ nPointer;
1918 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1919 mapMix.insert(make_pair(hashKey, pnode));
1921 int nRelayNodes = 2;
1922 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1923 ((*mi).second)->PushAddress(addr);
1927 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1928 if (vAddr.size() < 1000)
1929 pfrom->fGetAddr = false;
1933 else if (strCommand == "inv")
1937 if (vInv.size() > 50000)
1938 return error("message inv size() = %d", vInv.size());
1941 BOOST_FOREACH(const CInv& inv, vInv)
1945 pfrom->AddInventoryKnown(inv);
1947 bool fAlreadyHave = AlreadyHave(txdb, inv);
1948 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1952 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1953 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1955 // Track requests for our stuff
1956 Inventory(inv.hash);
1961 else if (strCommand == "getdata")
1965 if (vInv.size() > 50000)
1966 return error("message getdata size() = %d", vInv.size());
1968 BOOST_FOREACH(const CInv& inv, vInv)
1972 printf("received getdata for: %s\n", inv.ToString().c_str());
1974 if (inv.type == MSG_BLOCK)
1976 // Send block from disk
1977 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1978 if (mi != mapBlockIndex.end())
1981 block.ReadFromDisk((*mi).second);
1982 pfrom->PushMessage("block", block);
1984 // Trigger them to send a getblocks request for the next batch of inventory
1985 if (inv.hash == pfrom->hashContinue)
1987 // Bypass PushInventory, this must send even if redundant,
1988 // and we want it right after the last block so they don't
1989 // wait for other stuff first.
1991 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
1992 pfrom->PushMessage("inv", vInv);
1993 pfrom->hashContinue = 0;
1997 else if (inv.IsKnownType())
1999 // Send stream from relay memory
2000 CRITICAL_BLOCK(cs_mapRelay)
2002 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2003 if (mi != mapRelay.end())
2004 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2008 // Track requests for our stuff
2009 Inventory(inv.hash);
2014 else if (strCommand == "getblocks")
2016 CBlockLocator locator;
2018 vRecv >> locator >> hashStop;
2020 // Find the last block the caller has in the main chain
2021 CBlockIndex* pindex = locator.GetBlockIndex();
2023 // Send the rest of the chain
2025 pindex = pindex->pnext;
2026 int nLimit = 500 + locator.GetDistanceBack();
2027 unsigned int nBytes = 0;
2028 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2029 for (; pindex; pindex = pindex->pnext)
2031 if (pindex->GetBlockHash() == hashStop)
2033 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2036 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2038 block.ReadFromDisk(pindex, true);
2039 nBytes += block.GetSerializeSize(SER_NETWORK);
2040 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2042 // When this block is requested, we'll send an inv that'll make them
2043 // getblocks the next batch of inventory.
2044 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2045 pfrom->hashContinue = pindex->GetBlockHash();
2052 else if (strCommand == "getheaders")
2054 CBlockLocator locator;
2056 vRecv >> locator >> hashStop;
2058 CBlockIndex* pindex = NULL;
2059 if (locator.IsNull())
2061 // If locator is null, return the hashStop block
2062 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2063 if (mi == mapBlockIndex.end())
2065 pindex = (*mi).second;
2069 // Find the last block the caller has in the main chain
2070 pindex = locator.GetBlockIndex();
2072 pindex = pindex->pnext;
2075 vector<CBlock> vHeaders;
2076 int nLimit = 2000 + locator.GetDistanceBack();
2077 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2078 for (; pindex; pindex = pindex->pnext)
2080 vHeaders.push_back(pindex->GetBlockHeader());
2081 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2084 pfrom->PushMessage("headers", vHeaders);
2088 else if (strCommand == "tx")
2090 vector<uint256> vWorkQueue;
2091 CDataStream vMsg(vRecv);
2095 CInv inv(MSG_TX, tx.GetHash());
2096 pfrom->AddInventoryKnown(inv);
2098 bool fMissingInputs = false;
2099 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2101 SyncWithWallets(tx, NULL, true);
2102 RelayMessage(inv, vMsg);
2103 mapAlreadyAskedFor.erase(inv);
2104 vWorkQueue.push_back(inv.hash);
2106 // Recursively process any orphan transactions that depended on this one
2107 for (int i = 0; i < vWorkQueue.size(); i++)
2109 uint256 hashPrev = vWorkQueue[i];
2110 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2111 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2114 const CDataStream& vMsg = *((*mi).second);
2116 CDataStream(vMsg) >> tx;
2117 CInv inv(MSG_TX, tx.GetHash());
2119 if (tx.AcceptToMemoryPool(true))
2121 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2122 SyncWithWallets(tx, NULL, true);
2123 RelayMessage(inv, vMsg);
2124 mapAlreadyAskedFor.erase(inv);
2125 vWorkQueue.push_back(inv.hash);
2130 BOOST_FOREACH(uint256 hash, vWorkQueue)
2131 EraseOrphanTx(hash);
2133 else if (fMissingInputs)
2135 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2141 else if (strCommand == "block")
2146 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2149 CInv inv(MSG_BLOCK, block.GetHash());
2150 pfrom->AddInventoryKnown(inv);
2152 if (ProcessBlock(pfrom, &block))
2153 mapAlreadyAskedFor.erase(inv);
2157 else if (strCommand == "getaddr")
2159 // Nodes rebroadcast an addr every 24 hours
2160 pfrom->vAddrToSend.clear();
2161 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2162 CRITICAL_BLOCK(cs_mapAddresses)
2164 unsigned int nCount = 0;
2165 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2167 const CAddress& addr = item.second;
2168 if (addr.nTime > nSince)
2171 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2173 const CAddress& addr = item.second;
2174 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2175 pfrom->PushAddress(addr);
2181 else if (strCommand == "checkorder")
2186 if (!GetBoolArg("-allowreceivebyip"))
2188 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2195 /// we have a chance to check the order here
2197 // Keep giving the same key to the same ip until they use it
2198 if (!mapReuseKey.count(pfrom->addr.ip))
2199 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2201 // Send back approval of order and pubkey to use
2202 CScript scriptPubKey;
2203 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2204 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2208 else if (strCommand == "reply")
2213 CRequestTracker tracker;
2214 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2216 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2217 if (mi != pfrom->mapRequests.end())
2219 tracker = (*mi).second;
2220 pfrom->mapRequests.erase(mi);
2223 if (!tracker.IsNull())
2224 tracker.fn(tracker.param1, vRecv);
2228 else if (strCommand == "ping")
2233 else if (strCommand == "alert")
2238 if (alert.ProcessAlert())
2241 pfrom->setKnown.insert(alert.GetHash());
2242 CRITICAL_BLOCK(cs_vNodes)
2243 BOOST_FOREACH(CNode* pnode, vNodes)
2244 alert.RelayTo(pnode);
2251 // Ignore unknown commands for extensibility
2255 // Update the last seen time for this node's address
2256 if (pfrom->fNetworkNode)
2257 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2258 AddressCurrentlyConnected(pfrom->addr);
2264 bool ProcessMessages(CNode* pfrom)
2266 CDataStream& vRecv = pfrom->vRecv;
2270 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2274 // (4) message start
2283 // Scan for message start
2284 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2285 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2286 if (vRecv.end() - pstart < nHeaderSize)
2288 if (vRecv.size() > nHeaderSize)
2290 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2291 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2295 if (pstart - vRecv.begin() > 0)
2296 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2297 vRecv.erase(vRecv.begin(), pstart);
2300 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2305 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2308 string strCommand = hdr.GetCommand();
2311 unsigned int nMessageSize = hdr.nMessageSize;
2312 if (nMessageSize > MAX_SIZE)
2314 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2317 if (nMessageSize > vRecv.size())
2319 // Rewind and wait for rest of message
2320 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2325 if (vRecv.GetVersion() >= 209)
2327 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2328 unsigned int nChecksum = 0;
2329 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2330 if (nChecksum != hdr.nChecksum)
2332 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2333 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2338 // Copy message to its own buffer
2339 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2340 vRecv.ignore(nMessageSize);
2346 CRITICAL_BLOCK(cs_main)
2347 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2351 catch (std::ios_base::failure& e)
2353 if (strstr(e.what(), "end of data"))
2355 // Allow exceptions from underlength message on vRecv
2356 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());
2358 else if (strstr(e.what(), "size too large"))
2360 // Allow exceptions from overlong size
2361 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2365 PrintExceptionContinue(&e, "ProcessMessage()");
2368 catch (std::exception& e) {
2369 PrintExceptionContinue(&e, "ProcessMessage()");
2371 PrintExceptionContinue(NULL, "ProcessMessage()");
2375 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2383 bool SendMessages(CNode* pto, bool fSendTrickle)
2385 CRITICAL_BLOCK(cs_main)
2387 // Don't send anything until we get their version message
2388 if (pto->nVersion == 0)
2392 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2393 pto->PushMessage("ping");
2395 // Resend wallet transactions that haven't gotten in a block yet
2396 ResendWalletTransactions();
2398 // Address refresh broadcast
2399 static int64 nLastRebroadcast;
2400 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2402 nLastRebroadcast = GetTime();
2403 CRITICAL_BLOCK(cs_vNodes)
2405 BOOST_FOREACH(CNode* pnode, vNodes)
2407 // Periodically clear setAddrKnown to allow refresh broadcasts
2408 pnode->setAddrKnown.clear();
2410 // Rebroadcast our address
2411 if (addrLocalHost.IsRoutable() && !fUseProxy)
2413 CAddress addr(addrLocalHost);
2414 addr.nTime = GetAdjustedTime();
2415 pnode->PushAddress(addr);
2421 // Clear out old addresses periodically so it's not too much work at once
2422 static int64 nLastClear;
2423 if (nLastClear == 0)
2424 nLastClear = GetTime();
2425 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2427 nLastClear = GetTime();
2428 CRITICAL_BLOCK(cs_mapAddresses)
2431 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2432 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2433 mi != mapAddresses.end();)
2435 const CAddress& addr = (*mi).second;
2436 if (addr.nTime < nSince)
2438 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2440 addrdb.EraseAddress(addr);
2441 mapAddresses.erase(mi++);
2455 vector<CAddress> vAddr;
2456 vAddr.reserve(pto->vAddrToSend.size());
2457 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2459 // returns true if wasn't already contained in the set
2460 if (pto->setAddrKnown.insert(addr).second)
2462 vAddr.push_back(addr);
2463 // receiver rejects addr messages larger than 1000
2464 if (vAddr.size() >= 1000)
2466 pto->PushMessage("addr", vAddr);
2471 pto->vAddrToSend.clear();
2473 pto->PushMessage("addr", vAddr);
2478 // Message: inventory
2481 vector<CInv> vInvWait;
2482 CRITICAL_BLOCK(pto->cs_inventory)
2484 vInv.reserve(pto->vInventoryToSend.size());
2485 vInvWait.reserve(pto->vInventoryToSend.size());
2486 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2488 if (pto->setInventoryKnown.count(inv))
2491 // trickle out tx inv to protect privacy
2492 if (inv.type == MSG_TX && !fSendTrickle)
2494 // 1/4 of tx invs blast to all immediately
2495 static uint256 hashSalt;
2497 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2498 uint256 hashRand = inv.hash ^ hashSalt;
2499 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2500 bool fTrickleWait = ((hashRand & 3) != 0);
2502 // always trickle our own transactions
2506 if (GetTransaction(inv.hash, wtx))
2508 fTrickleWait = true;
2513 vInvWait.push_back(inv);
2518 // returns true if wasn't already contained in the set
2519 if (pto->setInventoryKnown.insert(inv).second)
2521 vInv.push_back(inv);
2522 if (vInv.size() >= 1000)
2524 pto->PushMessage("inv", vInv);
2529 pto->vInventoryToSend = vInvWait;
2532 pto->PushMessage("inv", vInv);
2538 vector<CInv> vGetData;
2539 int64 nNow = GetTime() * 1000000;
2541 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2543 const CInv& inv = (*pto->mapAskFor.begin()).second;
2544 if (!AlreadyHave(txdb, inv))
2546 printf("sending getdata: %s\n", inv.ToString().c_str());
2547 vGetData.push_back(inv);
2548 if (vGetData.size() >= 1000)
2550 pto->PushMessage("getdata", vGetData);
2554 mapAlreadyAskedFor[inv] = nNow;
2555 pto->mapAskFor.erase(pto->mapAskFor.begin());
2557 if (!vGetData.empty())
2558 pto->PushMessage("getdata", vGetData);
2577 //////////////////////////////////////////////////////////////////////////////
2582 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2584 unsigned char* pdata = (unsigned char*)pbuffer;
2585 unsigned int blocks = 1 + ((len + 8) / 64);
2586 unsigned char* pend = pdata + 64 * blocks;
2587 memset(pdata + len, 0, 64 * blocks - len);
2589 unsigned int bits = len * 8;
2590 pend[-1] = (bits >> 0) & 0xff;
2591 pend[-2] = (bits >> 8) & 0xff;
2592 pend[-3] = (bits >> 16) & 0xff;
2593 pend[-4] = (bits >> 24) & 0xff;
2597 using CryptoPP::ByteReverse;
2599 static const unsigned int pSHA256InitState[8] =
2600 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2602 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2604 memcpy(pstate, pinit, 32);
2605 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2609 // ScanHash scans nonces looking for a hash with at least some zero bits.
2610 // It operates on big endian data. Caller does the byte reversing.
2611 // All input buffers are 16-byte aligned. nNonce is usually preserved
2612 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2613 // the block is rebuilt and nNonce starts over at zero.
2615 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2617 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2621 // Hash pdata using pmidstate as the starting state into
2622 // preformatted buffer phash1, then hash phash1 into phash
2624 SHA256Transform(phash1, pdata, pmidstate);
2625 SHA256Transform(phash, phash1, pSHA256InitState);
2627 // Return the nonce if the hash has at least some zero bits,
2628 // caller will check if it has enough to reach the target
2629 if (((unsigned short*)phash)[14] == 0)
2632 // If nothing found after trying for a while, return -1
2633 if ((nNonce & 0xffff) == 0)
2635 nHashesDone = 0xffff+1;
2641 // Some explaining would be appreciated
2646 set<uint256> setDependsOn;
2649 COrphan(CTransaction* ptxIn)
2657 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2658 BOOST_FOREACH(uint256 hash, setDependsOn)
2659 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2664 CBlock* CreateNewBlock(CReserveKey& reservekey)
2666 CBlockIndex* pindexPrev = pindexBest;
2669 auto_ptr<CBlock> pblock(new CBlock());
2673 // Create coinbase tx
2675 txNew.vin.resize(1);
2676 txNew.vin[0].prevout.SetNull();
2677 txNew.vout.resize(1);
2678 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2680 // Add our coinbase tx as first transaction
2681 pblock->vtx.push_back(txNew);
2683 // Collect memory pool transactions into the block
2685 CRITICAL_BLOCK(cs_main)
2686 CRITICAL_BLOCK(cs_mapTransactions)
2690 // Priority order to process transactions
2691 list<COrphan> vOrphan; // list memory doesn't move
2692 map<uint256, vector<COrphan*> > mapDependers;
2693 multimap<double, CTransaction*> mapPriority;
2694 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2696 CTransaction& tx = (*mi).second;
2697 if (tx.IsCoinBase() || !tx.IsFinal())
2700 COrphan* porphan = NULL;
2701 double dPriority = 0;
2702 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2704 // Read prev transaction
2705 CTransaction txPrev;
2707 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2709 // Has to wait for dependencies
2712 // Use list for automatic deletion
2713 vOrphan.push_back(COrphan(&tx));
2714 porphan = &vOrphan.back();
2716 mapDependers[txin.prevout.hash].push_back(porphan);
2717 porphan->setDependsOn.insert(txin.prevout.hash);
2720 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2722 // Read block header
2723 int nConf = txindex.GetDepthInMainChain();
2725 dPriority += (double)nValueIn * nConf;
2727 if (fDebug && GetBoolArg("-printpriority"))
2728 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2731 // Priority is sum(valuein * age) / txsize
2732 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2735 porphan->dPriority = dPriority;
2737 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2739 if (fDebug && GetBoolArg("-printpriority"))
2741 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2748 // Collect transactions into block
2749 map<uint256, CTxIndex> mapTestPool;
2750 uint64 nBlockSize = 1000;
2751 int nBlockSigOps = 100;
2752 while (!mapPriority.empty())
2754 // Take highest priority transaction off priority queue
2755 double dPriority = -(*mapPriority.begin()).first;
2756 CTransaction& tx = *(*mapPriority.begin()).second;
2757 mapPriority.erase(mapPriority.begin());
2760 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2761 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2763 int nTxSigOps = tx.GetSigOpCount();
2764 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2767 // Transaction fee required depends on block size
2768 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2769 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2771 // Connecting shouldn't fail due to dependency on other memory pool transactions
2772 // because we're already processing them in order of dependency
2773 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2774 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2776 swap(mapTestPool, mapTestPoolTmp);
2779 pblock->vtx.push_back(tx);
2780 nBlockSize += nTxSize;
2781 nBlockSigOps += nTxSigOps;
2783 // Add transactions that depend on this one to the priority queue
2784 uint256 hash = tx.GetHash();
2785 if (mapDependers.count(hash))
2787 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2789 if (!porphan->setDependsOn.empty())
2791 porphan->setDependsOn.erase(hash);
2792 if (porphan->setDependsOn.empty())
2793 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2799 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2802 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2803 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2804 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2805 pblock->nBits = GetNextWorkRequired(pindexPrev);
2808 return pblock.release();
2812 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
2814 // Update nExtraNonce
2815 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2816 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
2821 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
2822 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2826 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2829 // Prebuild hash buffers
2836 uint256 hashPrevBlock;
2837 uint256 hashMerkleRoot;
2840 unsigned int nNonce;
2843 unsigned char pchPadding0[64];
2845 unsigned char pchPadding1[64];
2848 memset(&tmp, 0, sizeof(tmp));
2850 tmp.block.nVersion = pblock->nVersion;
2851 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2852 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2853 tmp.block.nTime = pblock->nTime;
2854 tmp.block.nBits = pblock->nBits;
2855 tmp.block.nNonce = pblock->nNonce;
2857 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2858 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2860 // Byte swap all the input buffer
2861 for (int i = 0; i < sizeof(tmp)/4; i++)
2862 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2864 // Precalc the first half of the first hash, which stays constant
2865 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2867 memcpy(pdata, &tmp.block, 128);
2868 memcpy(phash1, &tmp.hash1, 64);
2872 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2874 uint256 hash = pblock->GetHash();
2875 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2877 if (hash > hashTarget)
2881 printf("BitcoinMiner:\n");
2882 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2884 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2885 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2888 CRITICAL_BLOCK(cs_main)
2890 if (pblock->hashPrevBlock != hashBestChain)
2891 return error("BitcoinMiner : generated block is stale");
2893 // Remove key from key pool
2894 reservekey.KeepKey();
2896 // Track how many getdata requests this block gets
2897 CRITICAL_BLOCK(wallet.cs_wallet)
2898 wallet.mapRequestCount[pblock->GetHash()] = 0;
2900 // Process this block the same as if we had received it from another node
2901 if (!ProcessBlock(NULL, pblock))
2902 return error("BitcoinMiner : ProcessBlock, block not accepted");
2909 void static ThreadBitcoinMiner(void* parg);
2911 void static BitcoinMiner(CWallet *pwallet)
2913 printf("BitcoinMiner started\n");
2914 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2916 // Each thread has its own key and counter
2917 CReserveKey reservekey(pwallet);
2918 unsigned int nExtraNonce = 0;
2919 int64 nPrevTime = 0;
2921 while (fGenerateBitcoins)
2923 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2927 while (vNodes.empty() || IsInitialBlockDownload())
2932 if (!fGenerateBitcoins)
2940 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2941 CBlockIndex* pindexPrev = pindexBest;
2943 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2946 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
2948 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2952 // Prebuild hash buffers
2954 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2955 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2956 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2958 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2960 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2961 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2967 int64 nStart = GetTime();
2968 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2970 uint256& hash = *alignup<16>(hashbuf);
2973 unsigned int nHashesDone = 0;
2974 unsigned int nNonceFound;
2977 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2978 (char*)&hash, nHashesDone);
2980 // Check if something found
2981 if (nNonceFound != -1)
2983 for (int i = 0; i < sizeof(hash)/4; i++)
2984 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2986 if (hash <= hashTarget)
2989 pblock->nNonce = ByteReverse(nNonceFound);
2990 assert(hash == pblock->GetHash());
2992 SetThreadPriority(THREAD_PRIORITY_NORMAL);
2993 CheckWork(pblock.get(), *pwalletMain, reservekey);
2994 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3000 static int64 nHashCounter;
3001 if (nHPSTimerStart == 0)
3003 nHPSTimerStart = GetTimeMillis();
3007 nHashCounter += nHashesDone;
3008 if (GetTimeMillis() - nHPSTimerStart > 4000)
3010 static CCriticalSection cs;
3013 if (GetTimeMillis() - nHPSTimerStart > 4000)
3015 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3016 nHPSTimerStart = GetTimeMillis();
3018 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3019 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3020 static int64 nLogTime;
3021 if (GetTime() - nLogTime > 30 * 60)
3023 nLogTime = GetTime();
3024 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3025 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3031 // Check for stop or if block needs to be rebuilt
3034 if (!fGenerateBitcoins)
3036 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3040 if (nBlockNonce >= 0xffff0000)
3042 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3044 if (pindexPrev != pindexBest)
3047 // Update nTime every few seconds
3048 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3049 nBlockTime = ByteReverse(pblock->nTime);
3054 void static ThreadBitcoinMiner(void* parg)
3056 CWallet* pwallet = (CWallet*)parg;
3059 vnThreadsRunning[3]++;
3060 BitcoinMiner(pwallet);
3061 vnThreadsRunning[3]--;
3063 catch (std::exception& e) {
3064 vnThreadsRunning[3]--;
3065 PrintException(&e, "ThreadBitcoinMiner()");
3067 vnThreadsRunning[3]--;
3068 PrintException(NULL, "ThreadBitcoinMiner()");
3070 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3072 if (vnThreadsRunning[3] == 0)
3074 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3078 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3080 if (fGenerateBitcoins != fGenerate)
3082 fGenerateBitcoins = fGenerate;
3083 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3086 if (fGenerateBitcoins)
3088 int nProcessors = boost::thread::hardware_concurrency();
3089 printf("%d processors\n", nProcessors);
3090 if (nProcessors < 1)
3092 if (fLimitProcessors && nProcessors > nLimitProcessors)
3093 nProcessors = nLimitProcessors;
3094 int nAddThreads = nProcessors - vnThreadsRunning[3];
3095 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3096 for (int i = 0; i < nAddThreads; i++)
3098 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3099 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");