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.
6 #include "checkpoints.h"
10 #include "cryptopp/sha.h"
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
26 static map<uint256, CTransaction> mapTransactions;
27 CCriticalSection cs_mapTransactions;
28 unsigned int nTransactionsUpdated = 0;
29 map<COutPoint, CInPoint> mapNextTx;
31 map<uint256, CBlockIndex*> mapBlockIndex;
32 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 CBigNum bnBestChainWork = 0;
38 CBigNum bnBestInvalidWork = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
54 int fGenerateBitcoins = false;
55 int64 nTransactionFee = 0;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void static AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
169 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
170 BOOST_FOREACH(const CTxIn& txin, tx.vin)
171 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
174 void static EraseOrphanTx(uint256 hash)
176 if (!mapOrphanTransactions.count(hash))
178 const CDataStream* pvMsg = mapOrphanTransactions[hash];
180 CDataStream(*pvMsg) >> tx;
181 BOOST_FOREACH(const CTxIn& txin, tx.vin)
183 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
184 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
186 if ((*mi).second == pvMsg)
187 mapOrphanTransactionsByPrev.erase(mi++);
193 mapOrphanTransactions.erase(hash);
203 //////////////////////////////////////////////////////////////////////////////
205 // CTransaction and CTxIndex
208 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
211 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
213 if (!ReadFromDisk(txindexRet.pos))
215 if (prevout.n >= vout.size())
223 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
226 return ReadFromDisk(txdb, prevout, txindex);
229 bool CTransaction::ReadFromDisk(COutPoint prevout)
233 return ReadFromDisk(txdb, prevout, txindex);
238 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
250 // Load the block this tx is in
252 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
254 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
259 // Update the tx's hashBlock
260 hashBlock = pblock->GetHash();
262 // Locate the transaction
263 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
264 if (pblock->vtx[nIndex] == *(CTransaction*)this)
266 if (nIndex == pblock->vtx.size())
268 vMerkleBranch.clear();
270 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
274 // Fill in merkle branch
275 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
278 // Is the tx in a block that's in the main chain
279 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
280 if (mi == mapBlockIndex.end())
282 CBlockIndex* pindex = (*mi).second;
283 if (!pindex || !pindex->IsInMainChain())
286 return pindexBest->nHeight - pindex->nHeight + 1;
295 bool CTransaction::CheckTransaction() const
297 // Basic checks that don't depend on any context
299 return error("CTransaction::CheckTransaction() : vin empty");
301 return error("CTransaction::CheckTransaction() : vout empty");
303 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
304 return error("CTransaction::CheckTransaction() : size limits failed");
306 // Check for negative or overflow output values
308 BOOST_FOREACH(const CTxOut& txout, vout)
310 if (txout.nValue < 0)
311 return error("CTransaction::CheckTransaction() : txout.nValue negative");
312 if (txout.nValue > MAX_MONEY)
313 return error("CTransaction::CheckTransaction() : txout.nValue too high");
314 nValueOut += txout.nValue;
315 if (!MoneyRange(nValueOut))
316 return error("CTransaction::CheckTransaction() : txout total out of range");
319 // Check for duplicate inputs
320 set<COutPoint> vInOutPoints;
321 BOOST_FOREACH(const CTxIn& txin, vin)
323 if (vInOutPoints.count(txin.prevout))
325 vInOutPoints.insert(txin.prevout);
330 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
331 return error("CTransaction::CheckTransaction() : coinbase script size");
335 BOOST_FOREACH(const CTxIn& txin, vin)
336 if (txin.prevout.IsNull())
337 return error("CTransaction::CheckTransaction() : prevout is null");
343 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
346 *pfMissingInputs = false;
348 if (!CheckTransaction())
349 return error("AcceptToMemoryPool() : CheckTransaction failed");
351 // Coinbase is only valid in a block, not as a loose transaction
353 return error("AcceptToMemoryPool() : coinbase as individual tx");
355 // To help v0.1.5 clients who would see it as a negative number
356 if ((int64)nLockTime > INT_MAX)
357 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
360 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
361 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
362 // attacks disallow transactions with more than one SigOp per 34 bytes.
363 // 34 bytes because a TxOut is:
364 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
365 if (GetSigOpCount() > nSize / 34 || nSize < 100)
366 return error("AcceptToMemoryPool() : nonstandard transaction");
368 // Rather not work on nonstandard transactions (unless -testnet)
369 if (!fTestNet && !IsStandard())
370 return error("AcceptToMemoryPool() : nonstandard transaction type");
372 // Do we already have it?
373 uint256 hash = GetHash();
374 CRITICAL_BLOCK(cs_mapTransactions)
375 if (mapTransactions.count(hash))
378 if (txdb.ContainsTx(hash))
381 // Check for conflicts with in-memory transactions
382 CTransaction* ptxOld = NULL;
383 for (int i = 0; i < vin.size(); i++)
385 COutPoint outpoint = vin[i].prevout;
386 if (mapNextTx.count(outpoint))
388 // Disable replacement feature for now
391 // Allow replacing with a newer version of the same transaction
394 ptxOld = mapNextTx[outpoint].ptx;
395 if (ptxOld->IsFinal())
397 if (!IsNewerThan(*ptxOld))
399 for (int i = 0; i < vin.size(); i++)
401 COutPoint outpoint = vin[i].prevout;
402 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
411 // Check against previous transactions
412 map<uint256, CTxIndex> mapUnused;
414 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
417 *pfMissingInputs = true;
418 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
421 // Don't accept it if it can't get into a block
422 if (nFees < GetMinFee(1000, true, true))
423 return error("AcceptToMemoryPool() : not enough fees");
425 // Continuously rate-limit free transactions
426 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
427 // be annoying or make other's transactions take longer to confirm.
428 if (nFees < MIN_RELAY_TX_FEE)
430 static CCriticalSection cs;
431 static double dFreeCount;
432 static int64 nLastTime;
433 int64 nNow = GetTime();
437 // Use an exponentially decaying ~10-minute window:
438 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
440 // -limitfreerelay unit is thousand-bytes-per-minute
441 // At default rate it would take over a month to fill 1GB
442 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
443 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
445 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
451 // Store transaction in memory
452 CRITICAL_BLOCK(cs_mapTransactions)
456 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
457 ptxOld->RemoveFromMemoryPool();
459 AddToMemoryPoolUnchecked();
462 ///// are we sure this is ok when loading transactions or restoring block txes
463 // If updated, erase old tx from wallet
465 EraseFromWallets(ptxOld->GetHash());
467 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
471 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
474 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
477 bool CTransaction::AddToMemoryPoolUnchecked()
479 // Add to memory pool without checking anything. Don't call this directly,
480 // call AcceptToMemoryPool to properly check the transaction first.
481 CRITICAL_BLOCK(cs_mapTransactions)
483 uint256 hash = GetHash();
484 mapTransactions[hash] = *this;
485 for (int i = 0; i < vin.size(); i++)
486 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
487 nTransactionsUpdated++;
493 bool CTransaction::RemoveFromMemoryPool()
495 // Remove transaction from memory pool
496 CRITICAL_BLOCK(cs_mapTransactions)
498 BOOST_FOREACH(const CTxIn& txin, vin)
499 mapNextTx.erase(txin.prevout);
500 mapTransactions.erase(GetHash());
501 nTransactionsUpdated++;
511 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
513 if (hashBlock == 0 || nIndex == -1)
516 // Find the block it claims to be in
517 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
518 if (mi == mapBlockIndex.end())
520 CBlockIndex* pindex = (*mi).second;
521 if (!pindex || !pindex->IsInMainChain())
524 // Make sure the merkle branch connects to this block
525 if (!fMerkleVerified)
527 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
529 fMerkleVerified = true;
532 nHeightRet = pindex->nHeight;
533 return pindexBest->nHeight - pindex->nHeight + 1;
537 int CMerkleTx::GetBlocksToMaturity() const
541 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
545 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
549 if (!IsInMainChain() && !ClientConnectInputs())
551 return CTransaction::AcceptToMemoryPool(txdb, false);
555 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
559 bool CMerkleTx::AcceptToMemoryPool()
562 return AcceptToMemoryPool(txdb);
567 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
569 CRITICAL_BLOCK(cs_mapTransactions)
571 // Add previous supporting transactions first
572 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
574 if (!tx.IsCoinBase())
576 uint256 hash = tx.GetHash();
577 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
578 tx.AcceptToMemoryPool(txdb, fCheckInputs);
581 return AcceptToMemoryPool(txdb, fCheckInputs);
586 bool CWalletTx::AcceptWalletTransaction()
589 return AcceptWalletTransaction(txdb);
592 int CTxIndex::GetDepthInMainChain() const
596 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
598 // Find the block in the index
599 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
600 if (mi == mapBlockIndex.end())
602 CBlockIndex* pindex = (*mi).second;
603 if (!pindex || !pindex->IsInMainChain())
605 return 1 + nBestHeight - pindex->nHeight;
617 //////////////////////////////////////////////////////////////////////////////
619 // CBlock and CBlockIndex
622 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
624 if (!fReadTransactions)
626 *this = pindex->GetBlockHeader();
629 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
631 if (GetHash() != pindex->GetBlockHash())
632 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
636 uint256 static GetOrphanRoot(const CBlock* pblock)
638 // Work back to the first block in the orphan chain
639 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
640 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
641 return pblock->GetHash();
644 int64 static GetBlockValue(int nHeight, int64 nFees)
646 int64 nSubsidy = 50 * COIN;
648 // Subsidy is cut in half every 4 years
649 nSubsidy >>= (nHeight / 210000);
651 return nSubsidy + nFees;
654 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
655 static const int64 nTargetSpacing = 10 * 60;
656 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
659 // minimum amount of work that could possibly be required nTime after
660 // minimum work required was nBase
662 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
665 bnResult.SetCompact(nBase);
666 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
668 // Maximum 400% adjustment...
670 // ... in best-case exactly 4-times-normal target time
671 nTime -= nTargetTimespan*4;
673 if (bnResult > bnProofOfWorkLimit)
674 bnResult = bnProofOfWorkLimit;
675 return bnResult.GetCompact();
678 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
682 if (pindexLast == NULL)
683 return bnProofOfWorkLimit.GetCompact();
685 // Only change once per interval
686 if ((pindexLast->nHeight+1) % nInterval != 0)
687 return pindexLast->nBits;
689 // Go back by what we want to be 14 days worth of blocks
690 const CBlockIndex* pindexFirst = pindexLast;
691 for (int i = 0; pindexFirst && i < nInterval-1; i++)
692 pindexFirst = pindexFirst->pprev;
695 // Limit adjustment step
696 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
697 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
698 if (nActualTimespan < nTargetTimespan/4)
699 nActualTimespan = nTargetTimespan/4;
700 if (nActualTimespan > nTargetTimespan*4)
701 nActualTimespan = nTargetTimespan*4;
705 bnNew.SetCompact(pindexLast->nBits);
706 bnNew *= nActualTimespan;
707 bnNew /= nTargetTimespan;
709 if (bnNew > bnProofOfWorkLimit)
710 bnNew = bnProofOfWorkLimit;
713 printf("GetNextWorkRequired RETARGET\n");
714 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
715 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
716 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
718 return bnNew.GetCompact();
721 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
724 bnTarget.SetCompact(nBits);
727 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
728 return error("CheckProofOfWork() : nBits below minimum work");
730 // Check proof of work matches claimed amount
731 if (hash > bnTarget.getuint256())
732 return error("CheckProofOfWork() : hash doesn't match nBits");
737 bool IsInitialBlockDownload()
739 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
741 static int64 nLastUpdate;
742 static CBlockIndex* pindexLastBest;
743 if (pindexBest != pindexLastBest)
745 pindexLastBest = pindexBest;
746 nLastUpdate = GetTime();
748 return (GetTime() - nLastUpdate < 10 &&
749 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
752 void static InvalidChainFound(CBlockIndex* pindexNew)
754 if (pindexNew->bnChainWork > bnBestInvalidWork)
756 bnBestInvalidWork = pindexNew->bnChainWork;
757 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
760 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());
761 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
762 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
763 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
776 bool CTransaction::DisconnectInputs(CTxDB& txdb)
778 // Relinquish previous transactions' spent pointers
781 BOOST_FOREACH(const CTxIn& txin, vin)
783 COutPoint prevout = txin.prevout;
785 // Get prev txindex from disk
787 if (!txdb.ReadTxIndex(prevout.hash, txindex))
788 return error("DisconnectInputs() : ReadTxIndex failed");
790 if (prevout.n >= txindex.vSpent.size())
791 return error("DisconnectInputs() : prevout.n out of range");
793 // Mark outpoint as not spent
794 txindex.vSpent[prevout.n].SetNull();
797 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
798 return error("DisconnectInputs() : UpdateTxIndex failed");
802 // Remove transaction from index
803 if (!txdb.EraseTxIndex(*this))
804 return error("DisconnectInputs() : EraseTxPos failed");
810 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
811 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
813 // Take over previous transactions' spent pointers
817 for (int i = 0; i < vin.size(); i++)
819 COutPoint prevout = vin[i].prevout;
824 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
826 // Get txindex from current proposed changes
827 txindex = mapTestPool[prevout.hash];
831 // Read txindex from txdb
832 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
834 if (!fFound && (fBlock || fMiner))
835 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());
839 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
841 // Get prev tx from single transactions in memory
842 CRITICAL_BLOCK(cs_mapTransactions)
844 if (!mapTransactions.count(prevout.hash))
845 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
846 txPrev = mapTransactions[prevout.hash];
849 txindex.vSpent.resize(txPrev.vout.size());
853 // Get prev tx from disk
854 if (!txPrev.ReadFromDisk(txindex.pos))
855 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
858 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
859 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());
861 // If prev is coinbase, check that it's matured
862 if (txPrev.IsCoinBase())
863 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
864 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
865 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
868 if (!VerifySignature(txPrev, *this, i))
869 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
871 // Check for conflicts
872 if (!txindex.vSpent[prevout.n].IsNull())
873 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());
875 // Check for negative or overflow input values
876 nValueIn += txPrev.vout[prevout.n].nValue;
877 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
878 return error("ConnectInputs() : txin values out of range");
880 // Mark outpoints as spent
881 txindex.vSpent[prevout.n] = posThisTx;
884 if (fBlock || fMiner)
886 mapTestPool[prevout.hash] = txindex;
890 if (nValueIn < GetValueOut())
891 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
893 // Tally transaction fees
894 int64 nTxFee = nValueIn - GetValueOut();
896 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
897 if (nTxFee < nMinFee)
900 if (!MoneyRange(nFees))
901 return error("ConnectInputs() : nFees out of range");
906 // Add transaction to changes
907 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
911 // Add transaction to test pool
912 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
919 bool CTransaction::ClientConnectInputs()
924 // Take over previous transactions' spent pointers
925 CRITICAL_BLOCK(cs_mapTransactions)
928 for (int i = 0; i < vin.size(); i++)
930 // Get prev tx from single transactions in memory
931 COutPoint prevout = vin[i].prevout;
932 if (!mapTransactions.count(prevout.hash))
934 CTransaction& txPrev = mapTransactions[prevout.hash];
936 if (prevout.n >= txPrev.vout.size())
940 if (!VerifySignature(txPrev, *this, i))
941 return error("ConnectInputs() : VerifySignature failed");
943 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
944 ///// this has to go away now that posNext is gone
945 // // Check for conflicts
946 // if (!txPrev.vout[prevout.n].posNext.IsNull())
947 // return error("ConnectInputs() : prev tx already used");
949 // // Flag outpoints as used
950 // txPrev.vout[prevout.n].posNext = posThisTx;
952 nValueIn += txPrev.vout[prevout.n].nValue;
954 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
955 return error("ClientConnectInputs() : txin values out of range");
957 if (GetValueOut() > nValueIn)
967 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
969 // Disconnect in reverse order
970 for (int i = vtx.size()-1; i >= 0; i--)
971 if (!vtx[i].DisconnectInputs(txdb))
974 // Update block index on disk without changing it in memory.
975 // The memory index structure will be changed after the db commits.
978 CDiskBlockIndex blockindexPrev(pindex->pprev);
979 blockindexPrev.hashNext = 0;
980 if (!txdb.WriteBlockIndex(blockindexPrev))
981 return error("DisconnectBlock() : WriteBlockIndex failed");
987 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
989 // Check it again in case a previous version let a bad block in
993 //// issue here: it doesn't know the version
994 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
996 map<uint256, CTxIndex> mapQueuedChanges;
998 BOOST_FOREACH(CTransaction& tx, vtx)
1000 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1001 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1003 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1006 // Write queued txindex changes
1007 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1009 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1010 return error("ConnectBlock() : UpdateTxIndex failed");
1013 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1016 // Update block index on disk without changing it in memory.
1017 // The memory index structure will be changed after the db commits.
1020 CDiskBlockIndex blockindexPrev(pindex->pprev);
1021 blockindexPrev.hashNext = pindex->GetBlockHash();
1022 if (!txdb.WriteBlockIndex(blockindexPrev))
1023 return error("ConnectBlock() : WriteBlockIndex failed");
1026 // Watch for transactions paying to me
1027 BOOST_FOREACH(CTransaction& tx, vtx)
1028 SyncWithWallets(tx, this, true);
1033 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1035 printf("REORGANIZE\n");
1038 CBlockIndex* pfork = pindexBest;
1039 CBlockIndex* plonger = pindexNew;
1040 while (pfork != plonger)
1042 while (plonger->nHeight > pfork->nHeight)
1043 if (!(plonger = plonger->pprev))
1044 return error("Reorganize() : plonger->pprev is null");
1045 if (pfork == plonger)
1047 if (!(pfork = pfork->pprev))
1048 return error("Reorganize() : pfork->pprev is null");
1051 // List of what to disconnect
1052 vector<CBlockIndex*> vDisconnect;
1053 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1054 vDisconnect.push_back(pindex);
1056 // List of what to connect
1057 vector<CBlockIndex*> vConnect;
1058 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1059 vConnect.push_back(pindex);
1060 reverse(vConnect.begin(), vConnect.end());
1062 // Disconnect shorter branch
1063 vector<CTransaction> vResurrect;
1064 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1067 if (!block.ReadFromDisk(pindex))
1068 return error("Reorganize() : ReadFromDisk for disconnect failed");
1069 if (!block.DisconnectBlock(txdb, pindex))
1070 return error("Reorganize() : DisconnectBlock failed");
1072 // Queue memory transactions to resurrect
1073 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1074 if (!tx.IsCoinBase())
1075 vResurrect.push_back(tx);
1078 // Connect longer branch
1079 vector<CTransaction> vDelete;
1080 for (int i = 0; i < vConnect.size(); i++)
1082 CBlockIndex* pindex = vConnect[i];
1084 if (!block.ReadFromDisk(pindex))
1085 return error("Reorganize() : ReadFromDisk for connect failed");
1086 if (!block.ConnectBlock(txdb, pindex))
1090 return error("Reorganize() : ConnectBlock failed");
1093 // Queue memory transactions to delete
1094 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1095 vDelete.push_back(tx);
1097 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1098 return error("Reorganize() : WriteHashBestChain failed");
1100 // Make sure it's successfully written to disk before changing memory structure
1101 if (!txdb.TxnCommit())
1102 return error("Reorganize() : TxnCommit failed");
1104 // Disconnect shorter branch
1105 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1107 pindex->pprev->pnext = NULL;
1109 // Connect longer branch
1110 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1112 pindex->pprev->pnext = pindex;
1114 // Resurrect memory transactions that were in the disconnected branch
1115 BOOST_FOREACH(CTransaction& tx, vResurrect)
1116 tx.AcceptToMemoryPool(txdb, false);
1118 // Delete redundant memory transactions that are in the connected branch
1119 BOOST_FOREACH(CTransaction& tx, vDelete)
1120 tx.RemoveFromMemoryPool();
1126 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1128 uint256 hash = GetHash();
1131 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1133 txdb.WriteHashBestChain(hash);
1134 if (!txdb.TxnCommit())
1135 return error("SetBestChain() : TxnCommit failed");
1136 pindexGenesisBlock = pindexNew;
1138 else if (hashPrevBlock == hashBestChain)
1140 // Adding to current best branch
1141 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1144 InvalidChainFound(pindexNew);
1145 return error("SetBestChain() : ConnectBlock failed");
1147 if (!txdb.TxnCommit())
1148 return error("SetBestChain() : TxnCommit failed");
1150 // Add to current best branch
1151 pindexNew->pprev->pnext = pindexNew;
1153 // Delete redundant memory transactions
1154 BOOST_FOREACH(CTransaction& tx, vtx)
1155 tx.RemoveFromMemoryPool();
1160 if (!Reorganize(txdb, pindexNew))
1163 InvalidChainFound(pindexNew);
1164 return error("SetBestChain() : Reorganize failed");
1168 // Update best block in wallet (so we can detect restored wallets)
1169 if (!IsInitialBlockDownload())
1171 const CBlockLocator locator(pindexNew);
1172 ::SetBestChain(locator);
1176 hashBestChain = hash;
1177 pindexBest = pindexNew;
1178 nBestHeight = pindexBest->nHeight;
1179 bnBestChainWork = pindexNew->bnChainWork;
1180 nTimeBestReceived = GetTime();
1181 nTransactionsUpdated++;
1182 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1188 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1190 // Check for duplicate
1191 uint256 hash = GetHash();
1192 if (mapBlockIndex.count(hash))
1193 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1195 // Construct new block index object
1196 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1198 return error("AddToBlockIndex() : new CBlockIndex failed");
1199 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1200 pindexNew->phashBlock = &((*mi).first);
1201 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1202 if (miPrev != mapBlockIndex.end())
1204 pindexNew->pprev = (*miPrev).second;
1205 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1207 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1211 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1212 if (!txdb.TxnCommit())
1216 if (pindexNew->bnChainWork > bnBestChainWork)
1217 if (!SetBestChain(txdb, pindexNew))
1222 if (pindexNew == pindexBest)
1224 // Notify UI to display prev block's coinbase if it was ours
1225 static uint256 hashPrevBestCoinBase;
1226 UpdatedTransaction(hashPrevBestCoinBase);
1227 hashPrevBestCoinBase = vtx[0].GetHash();
1237 bool CBlock::CheckBlock() const
1239 // These are checks that are independent of context
1240 // that can be verified before saving an orphan block.
1243 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1244 return error("CheckBlock() : size limits failed");
1246 // Check proof of work matches claimed amount
1247 if (!CheckProofOfWork(GetHash(), nBits))
1248 return error("CheckBlock() : proof of work failed");
1251 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1252 return error("CheckBlock() : block timestamp too far in the future");
1254 // First transaction must be coinbase, the rest must not be
1255 if (vtx.empty() || !vtx[0].IsCoinBase())
1256 return error("CheckBlock() : first tx is not coinbase");
1257 for (int i = 1; i < vtx.size(); i++)
1258 if (vtx[i].IsCoinBase())
1259 return error("CheckBlock() : more than one coinbase");
1261 // Check transactions
1262 BOOST_FOREACH(const CTransaction& tx, vtx)
1263 if (!tx.CheckTransaction())
1264 return error("CheckBlock() : CheckTransaction failed");
1266 // Check that it's not full of nonstandard transactions
1267 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1268 return error("CheckBlock() : too many nonstandard transactions");
1271 if (hashMerkleRoot != BuildMerkleTree())
1272 return error("CheckBlock() : hashMerkleRoot mismatch");
1277 bool CBlock::AcceptBlock()
1279 // Check for duplicate
1280 uint256 hash = GetHash();
1281 if (mapBlockIndex.count(hash))
1282 return error("AcceptBlock() : block already in mapBlockIndex");
1284 // Get prev block index
1285 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1286 if (mi == mapBlockIndex.end())
1287 return error("AcceptBlock() : prev block not found");
1288 CBlockIndex* pindexPrev = (*mi).second;
1289 int nHeight = pindexPrev->nHeight+1;
1291 // Check proof of work
1292 if (nBits != GetNextWorkRequired(pindexPrev))
1293 return error("AcceptBlock() : incorrect proof of work");
1295 // Check timestamp against prev
1296 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1297 return error("AcceptBlock() : block's timestamp is too early");
1299 // Check that all transactions are finalized
1300 BOOST_FOREACH(const CTransaction& tx, vtx)
1301 if (!tx.IsFinal(nHeight, GetBlockTime()))
1302 return error("AcceptBlock() : contains a non-final transaction");
1304 // Check that the block chain matches the known block chain up to a checkpoint
1305 if (!Checkpoints::CheckBlock(nHeight, hash))
1306 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1308 // Write block to history file
1309 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1310 return error("AcceptBlock() : out of disk space");
1311 unsigned int nFile = -1;
1312 unsigned int nBlockPos = 0;
1313 if (!WriteToDisk(nFile, nBlockPos))
1314 return error("AcceptBlock() : WriteToDisk failed");
1315 if (!AddToBlockIndex(nFile, nBlockPos))
1316 return error("AcceptBlock() : AddToBlockIndex failed");
1318 // Relay inventory, but don't relay old inventory during initial block download
1319 if (hashBestChain == hash)
1320 CRITICAL_BLOCK(cs_vNodes)
1321 BOOST_FOREACH(CNode* pnode, vNodes)
1322 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1323 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1328 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1330 // Check for duplicate
1331 uint256 hash = pblock->GetHash();
1332 if (mapBlockIndex.count(hash))
1333 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1334 if (mapOrphanBlocks.count(hash))
1335 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1337 // Preliminary checks
1338 if (!pblock->CheckBlock())
1339 return error("ProcessBlock() : CheckBlock FAILED");
1341 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1342 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1344 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1345 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1348 return error("ProcessBlock() : block with timestamp before last checkpoint");
1351 bnNewBlock.SetCompact(pblock->nBits);
1353 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1354 if (bnNewBlock > bnRequired)
1356 return error("ProcessBlock() : block with too little proof-of-work");
1361 // If don't already have its previous block, shunt it off to holding area until we get it
1362 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1364 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1365 CBlock* pblock2 = new CBlock(*pblock);
1366 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1367 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1369 // Ask this guy to fill in what we're missing
1371 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1376 if (!pblock->AcceptBlock())
1377 return error("ProcessBlock() : AcceptBlock FAILED");
1379 // Recursively process any orphan blocks that depended on this one
1380 vector<uint256> vWorkQueue;
1381 vWorkQueue.push_back(hash);
1382 for (int i = 0; i < vWorkQueue.size(); i++)
1384 uint256 hashPrev = vWorkQueue[i];
1385 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1386 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1389 CBlock* pblockOrphan = (*mi).second;
1390 if (pblockOrphan->AcceptBlock())
1391 vWorkQueue.push_back(pblockOrphan->GetHash());
1392 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1393 delete pblockOrphan;
1395 mapOrphanBlocksByPrev.erase(hashPrev);
1398 printf("ProcessBlock: ACCEPTED\n");
1409 bool CheckDiskSpace(uint64 nAdditionalBytes)
1411 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1413 // Check for 15MB because database could create another 10MB log file at any time
1414 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1417 string strMessage = _("Warning: Disk space is low ");
1418 strMiscWarning = strMessage;
1419 printf("*** %s\n", strMessage.c_str());
1420 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1421 CreateThread(Shutdown, NULL);
1427 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1431 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1434 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1436 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1445 static unsigned int nCurrentBlockFile = 1;
1447 FILE* AppendBlockFile(unsigned int& nFileRet)
1452 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1455 if (fseek(file, 0, SEEK_END) != 0)
1457 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1458 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1460 nFileRet = nCurrentBlockFile;
1464 nCurrentBlockFile++;
1468 bool LoadBlockIndex(bool fAllowNew)
1472 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1473 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1474 pchMessageStart[0] = 0xfa;
1475 pchMessageStart[1] = 0xbf;
1476 pchMessageStart[2] = 0xb5;
1477 pchMessageStart[3] = 0xda;
1484 if (!txdb.LoadBlockIndex())
1489 // Init with genesis block
1491 if (mapBlockIndex.empty())
1497 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1498 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1499 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1500 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1501 // vMerkleTree: 4a5e1e
1504 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1506 txNew.vin.resize(1);
1507 txNew.vout.resize(1);
1508 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1509 txNew.vout[0].nValue = 50 * COIN;
1510 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1512 block.vtx.push_back(txNew);
1513 block.hashPrevBlock = 0;
1514 block.hashMerkleRoot = block.BuildMerkleTree();
1516 block.nTime = 1231006505;
1517 block.nBits = 0x1d00ffff;
1518 block.nNonce = 2083236893;
1522 block.nTime = 1296688602;
1523 block.nBits = 0x1d07fff8;
1524 block.nNonce = 384568319;
1528 printf("%s\n", block.GetHash().ToString().c_str());
1529 printf("%s\n", hashGenesisBlock.ToString().c_str());
1530 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1531 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1533 assert(block.GetHash() == hashGenesisBlock);
1535 // Start new block file
1537 unsigned int nBlockPos;
1538 if (!block.WriteToDisk(nFile, nBlockPos))
1539 return error("LoadBlockIndex() : writing genesis block to disk failed");
1540 if (!block.AddToBlockIndex(nFile, nBlockPos))
1541 return error("LoadBlockIndex() : genesis block not accepted");
1549 void PrintBlockTree()
1551 // precompute tree structure
1552 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1553 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1555 CBlockIndex* pindex = (*mi).second;
1556 mapNext[pindex->pprev].push_back(pindex);
1558 //while (rand() % 3 == 0)
1559 // mapNext[pindex->pprev].push_back(pindex);
1562 vector<pair<int, CBlockIndex*> > vStack;
1563 vStack.push_back(make_pair(0, pindexGenesisBlock));
1566 while (!vStack.empty())
1568 int nCol = vStack.back().first;
1569 CBlockIndex* pindex = vStack.back().second;
1572 // print split or gap
1573 if (nCol > nPrevCol)
1575 for (int i = 0; i < nCol-1; i++)
1579 else if (nCol < nPrevCol)
1581 for (int i = 0; i < nCol; i++)
1588 for (int i = 0; i < nCol; i++)
1593 block.ReadFromDisk(pindex);
1594 printf("%d (%u,%u) %s %s tx %d",
1598 block.GetHash().ToString().substr(0,20).c_str(),
1599 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1602 PrintWallets(block);
1604 // put the main timechain first
1605 vector<CBlockIndex*>& vNext = mapNext[pindex];
1606 for (int i = 0; i < vNext.size(); i++)
1608 if (vNext[i]->pnext)
1610 swap(vNext[0], vNext[i]);
1616 for (int i = 0; i < vNext.size(); i++)
1617 vStack.push_back(make_pair(nCol+i, vNext[i]));
1630 //////////////////////////////////////////////////////////////////////////////
1635 map<uint256, CAlert> mapAlerts;
1636 CCriticalSection cs_mapAlerts;
1638 string GetWarnings(string strFor)
1641 string strStatusBar;
1643 if (GetBoolArg("-testsafemode"))
1646 // Misc warnings like out of disk space and clock is wrong
1647 if (strMiscWarning != "")
1650 strStatusBar = strMiscWarning;
1653 // Longer invalid proof-of-work chain
1654 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1657 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1661 CRITICAL_BLOCK(cs_mapAlerts)
1663 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1665 const CAlert& alert = item.second;
1666 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1668 nPriority = alert.nPriority;
1669 strStatusBar = alert.strStatusBar;
1674 if (strFor == "statusbar")
1675 return strStatusBar;
1676 else if (strFor == "rpc")
1678 assert(!"GetWarnings() : invalid parameter");
1682 bool CAlert::ProcessAlert()
1684 if (!CheckSignature())
1689 CRITICAL_BLOCK(cs_mapAlerts)
1691 // Cancel previous alerts
1692 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1694 const CAlert& alert = (*mi).second;
1697 printf("cancelling alert %d\n", alert.nID);
1698 mapAlerts.erase(mi++);
1700 else if (!alert.IsInEffect())
1702 printf("expiring alert %d\n", alert.nID);
1703 mapAlerts.erase(mi++);
1709 // Check if this alert has been cancelled
1710 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1712 const CAlert& alert = item.second;
1713 if (alert.Cancels(*this))
1715 printf("alert already cancelled by %d\n", alert.nID);
1721 mapAlerts.insert(make_pair(GetHash(), *this));
1724 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1736 //////////////////////////////////////////////////////////////////////////////
1742 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1746 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1747 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1749 // Don't know what it is, just say we already got one
1756 // The message start string is designed to be unlikely to occur in normal data.
1757 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1758 // a large 4-byte int at any alignment.
1759 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1762 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1764 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1765 RandAddSeedPerfmon();
1767 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1768 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1770 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1772 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1780 if (strCommand == "version")
1782 // Each connection can only send one version message
1783 if (pfrom->nVersion != 0)
1790 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1791 if (pfrom->nVersion == 10300)
1792 pfrom->nVersion = 300;
1793 if (pfrom->nVersion >= 106 && !vRecv.empty())
1794 vRecv >> addrFrom >> nNonce;
1795 if (pfrom->nVersion >= 106 && !vRecv.empty())
1796 vRecv >> pfrom->strSubVer;
1797 if (pfrom->nVersion >= 209 && !vRecv.empty())
1798 vRecv >> pfrom->nStartingHeight;
1800 if (pfrom->nVersion == 0)
1803 // Disconnect if we connected to ourself
1804 if (nNonce == nLocalHostNonce && nNonce > 1)
1806 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1807 pfrom->fDisconnect = true;
1811 // Be shy and don't send version until we hear
1812 if (pfrom->fInbound)
1813 pfrom->PushVersion();
1815 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1817 AddTimeData(pfrom->addr.ip, nTime);
1820 if (pfrom->nVersion >= 209)
1821 pfrom->PushMessage("verack");
1822 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1823 if (pfrom->nVersion < 209)
1824 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1826 if (!pfrom->fInbound)
1828 // Advertise our address
1829 if (addrLocalHost.IsRoutable() && !fUseProxy)
1831 CAddress addr(addrLocalHost);
1832 addr.nTime = GetAdjustedTime();
1833 pfrom->PushAddress(addr);
1836 // Get recent addresses
1837 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1839 pfrom->PushMessage("getaddr");
1840 pfrom->fGetAddr = true;
1844 // Ask the first connected node for block updates
1845 static int nAskedForBlocks;
1846 if (!pfrom->fClient &&
1847 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1848 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1851 pfrom->PushGetBlocks(pindexBest, uint256(0));
1855 CRITICAL_BLOCK(cs_mapAlerts)
1856 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1857 item.second.RelayTo(pfrom);
1859 pfrom->fSuccessfullyConnected = true;
1861 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1865 else if (pfrom->nVersion == 0)
1867 // Must have a version message before anything else
1872 else if (strCommand == "verack")
1874 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1878 else if (strCommand == "addr")
1880 vector<CAddress> vAddr;
1883 // Don't want addr from older versions unless seeding
1884 if (pfrom->nVersion < 209)
1886 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1888 if (vAddr.size() > 1000)
1889 return error("message addr size() = %d", vAddr.size());
1891 // Store the new addresses
1894 int64 nNow = GetAdjustedTime();
1895 int64 nSince = nNow - 10 * 60;
1896 BOOST_FOREACH(CAddress& addr, vAddr)
1900 // ignore IPv6 for now, since it isn't implemented anyway
1903 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1904 addr.nTime = nNow - 5 * 24 * 60 * 60;
1905 AddAddress(addr, 2 * 60 * 60, &addrDB);
1906 pfrom->AddAddressKnown(addr);
1907 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1909 // Relay to a limited number of other nodes
1910 CRITICAL_BLOCK(cs_vNodes)
1912 // Use deterministic randomness to send to the same nodes for 24 hours
1913 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1914 static uint256 hashSalt;
1916 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1917 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1918 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1919 multimap<uint256, CNode*> mapMix;
1920 BOOST_FOREACH(CNode* pnode, vNodes)
1922 if (pnode->nVersion < 31402)
1924 unsigned int nPointer;
1925 memcpy(&nPointer, &pnode, sizeof(nPointer));
1926 uint256 hashKey = hashRand ^ nPointer;
1927 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1928 mapMix.insert(make_pair(hashKey, pnode));
1930 int nRelayNodes = 2;
1931 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1932 ((*mi).second)->PushAddress(addr);
1936 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1937 if (vAddr.size() < 1000)
1938 pfrom->fGetAddr = false;
1942 else if (strCommand == "inv")
1946 if (vInv.size() > 50000)
1947 return error("message inv size() = %d", vInv.size());
1950 BOOST_FOREACH(const CInv& inv, vInv)
1954 pfrom->AddInventoryKnown(inv);
1956 bool fAlreadyHave = AlreadyHave(txdb, inv);
1958 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1962 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1963 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1965 // Track requests for our stuff
1966 Inventory(inv.hash);
1971 else if (strCommand == "getdata")
1975 if (vInv.size() > 50000)
1976 return error("message getdata size() = %d", vInv.size());
1978 BOOST_FOREACH(const CInv& inv, vInv)
1982 printf("received getdata for: %s\n", inv.ToString().c_str());
1984 if (inv.type == MSG_BLOCK)
1986 // Send block from disk
1987 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1988 if (mi != mapBlockIndex.end())
1991 block.ReadFromDisk((*mi).second);
1992 pfrom->PushMessage("block", block);
1994 // Trigger them to send a getblocks request for the next batch of inventory
1995 if (inv.hash == pfrom->hashContinue)
1997 // Bypass PushInventory, this must send even if redundant,
1998 // and we want it right after the last block so they don't
1999 // wait for other stuff first.
2001 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2002 pfrom->PushMessage("inv", vInv);
2003 pfrom->hashContinue = 0;
2007 else if (inv.IsKnownType())
2009 // Send stream from relay memory
2010 CRITICAL_BLOCK(cs_mapRelay)
2012 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2013 if (mi != mapRelay.end())
2014 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2018 // Track requests for our stuff
2019 Inventory(inv.hash);
2024 else if (strCommand == "getblocks")
2026 CBlockLocator locator;
2028 vRecv >> locator >> hashStop;
2030 // Find the last block the caller has in the main chain
2031 CBlockIndex* pindex = locator.GetBlockIndex();
2033 // Send the rest of the chain
2035 pindex = pindex->pnext;
2036 int nLimit = 500 + locator.GetDistanceBack();
2037 unsigned int nBytes = 0;
2038 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2039 for (; pindex; pindex = pindex->pnext)
2041 if (pindex->GetBlockHash() == hashStop)
2043 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2046 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2048 block.ReadFromDisk(pindex, true);
2049 nBytes += block.GetSerializeSize(SER_NETWORK);
2050 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2052 // When this block is requested, we'll send an inv that'll make them
2053 // getblocks the next batch of inventory.
2054 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2055 pfrom->hashContinue = pindex->GetBlockHash();
2062 else if (strCommand == "getheaders")
2064 CBlockLocator locator;
2066 vRecv >> locator >> hashStop;
2068 CBlockIndex* pindex = NULL;
2069 if (locator.IsNull())
2071 // If locator is null, return the hashStop block
2072 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2073 if (mi == mapBlockIndex.end())
2075 pindex = (*mi).second;
2079 // Find the last block the caller has in the main chain
2080 pindex = locator.GetBlockIndex();
2082 pindex = pindex->pnext;
2085 vector<CBlock> vHeaders;
2086 int nLimit = 2000 + locator.GetDistanceBack();
2087 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2088 for (; pindex; pindex = pindex->pnext)
2090 vHeaders.push_back(pindex->GetBlockHeader());
2091 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2094 pfrom->PushMessage("headers", vHeaders);
2098 else if (strCommand == "tx")
2100 vector<uint256> vWorkQueue;
2101 CDataStream vMsg(vRecv);
2105 CInv inv(MSG_TX, tx.GetHash());
2106 pfrom->AddInventoryKnown(inv);
2108 bool fMissingInputs = false;
2109 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2111 SyncWithWallets(tx, NULL, true);
2112 RelayMessage(inv, vMsg);
2113 mapAlreadyAskedFor.erase(inv);
2114 vWorkQueue.push_back(inv.hash);
2116 // Recursively process any orphan transactions that depended on this one
2117 for (int i = 0; i < vWorkQueue.size(); i++)
2119 uint256 hashPrev = vWorkQueue[i];
2120 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2121 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2124 const CDataStream& vMsg = *((*mi).second);
2126 CDataStream(vMsg) >> tx;
2127 CInv inv(MSG_TX, tx.GetHash());
2129 if (tx.AcceptToMemoryPool(true))
2131 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2132 SyncWithWallets(tx, NULL, true);
2133 RelayMessage(inv, vMsg);
2134 mapAlreadyAskedFor.erase(inv);
2135 vWorkQueue.push_back(inv.hash);
2140 BOOST_FOREACH(uint256 hash, vWorkQueue)
2141 EraseOrphanTx(hash);
2143 else if (fMissingInputs)
2145 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2151 else if (strCommand == "block")
2156 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2159 CInv inv(MSG_BLOCK, block.GetHash());
2160 pfrom->AddInventoryKnown(inv);
2162 if (ProcessBlock(pfrom, &block))
2163 mapAlreadyAskedFor.erase(inv);
2167 else if (strCommand == "getaddr")
2169 // Nodes rebroadcast an addr every 24 hours
2170 pfrom->vAddrToSend.clear();
2171 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2172 CRITICAL_BLOCK(cs_mapAddresses)
2174 unsigned int nCount = 0;
2175 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2177 const CAddress& addr = item.second;
2178 if (addr.nTime > nSince)
2181 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2183 const CAddress& addr = item.second;
2184 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2185 pfrom->PushAddress(addr);
2191 else if (strCommand == "checkorder")
2196 if (!GetBoolArg("-allowreceivebyip"))
2198 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2205 /// we have a chance to check the order here
2207 // Keep giving the same key to the same ip until they use it
2208 if (!mapReuseKey.count(pfrom->addr.ip))
2209 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2211 // Send back approval of order and pubkey to use
2212 CScript scriptPubKey;
2213 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2214 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2218 else if (strCommand == "reply")
2223 CRequestTracker tracker;
2224 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2226 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2227 if (mi != pfrom->mapRequests.end())
2229 tracker = (*mi).second;
2230 pfrom->mapRequests.erase(mi);
2233 if (!tracker.IsNull())
2234 tracker.fn(tracker.param1, vRecv);
2238 else if (strCommand == "ping")
2243 else if (strCommand == "alert")
2248 if (alert.ProcessAlert())
2251 pfrom->setKnown.insert(alert.GetHash());
2252 CRITICAL_BLOCK(cs_vNodes)
2253 BOOST_FOREACH(CNode* pnode, vNodes)
2254 alert.RelayTo(pnode);
2261 // Ignore unknown commands for extensibility
2265 // Update the last seen time for this node's address
2266 if (pfrom->fNetworkNode)
2267 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2268 AddressCurrentlyConnected(pfrom->addr);
2274 bool ProcessMessages(CNode* pfrom)
2276 CDataStream& vRecv = pfrom->vRecv;
2280 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2284 // (4) message start
2293 // Scan for message start
2294 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2295 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2296 if (vRecv.end() - pstart < nHeaderSize)
2298 if (vRecv.size() > nHeaderSize)
2300 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2301 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2305 if (pstart - vRecv.begin() > 0)
2306 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2307 vRecv.erase(vRecv.begin(), pstart);
2310 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2315 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2318 string strCommand = hdr.GetCommand();
2321 unsigned int nMessageSize = hdr.nMessageSize;
2322 if (nMessageSize > MAX_SIZE)
2324 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2327 if (nMessageSize > vRecv.size())
2329 // Rewind and wait for rest of message
2330 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2335 if (vRecv.GetVersion() >= 209)
2337 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2338 unsigned int nChecksum = 0;
2339 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2340 if (nChecksum != hdr.nChecksum)
2342 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2343 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2348 // Copy message to its own buffer
2349 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2350 vRecv.ignore(nMessageSize);
2356 CRITICAL_BLOCK(cs_main)
2357 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2361 catch (std::ios_base::failure& e)
2363 if (strstr(e.what(), "end of data"))
2365 // Allow exceptions from underlength message on vRecv
2366 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());
2368 else if (strstr(e.what(), "size too large"))
2370 // Allow exceptions from overlong size
2371 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2375 PrintExceptionContinue(&e, "ProcessMessage()");
2378 catch (std::exception& e) {
2379 PrintExceptionContinue(&e, "ProcessMessage()");
2381 PrintExceptionContinue(NULL, "ProcessMessage()");
2385 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2393 bool SendMessages(CNode* pto, bool fSendTrickle)
2395 CRITICAL_BLOCK(cs_main)
2397 // Don't send anything until we get their version message
2398 if (pto->nVersion == 0)
2402 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2403 pto->PushMessage("ping");
2405 // Resend wallet transactions that haven't gotten in a block yet
2406 ResendWalletTransactions();
2408 // Address refresh broadcast
2409 static int64 nLastRebroadcast;
2410 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2412 nLastRebroadcast = GetTime();
2413 CRITICAL_BLOCK(cs_vNodes)
2415 BOOST_FOREACH(CNode* pnode, vNodes)
2417 // Periodically clear setAddrKnown to allow refresh broadcasts
2418 pnode->setAddrKnown.clear();
2420 // Rebroadcast our address
2421 if (addrLocalHost.IsRoutable() && !fUseProxy)
2423 CAddress addr(addrLocalHost);
2424 addr.nTime = GetAdjustedTime();
2425 pnode->PushAddress(addr);
2431 // Clear out old addresses periodically so it's not too much work at once
2432 static int64 nLastClear;
2433 if (nLastClear == 0)
2434 nLastClear = GetTime();
2435 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2437 nLastClear = GetTime();
2438 CRITICAL_BLOCK(cs_mapAddresses)
2441 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2442 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2443 mi != mapAddresses.end();)
2445 const CAddress& addr = (*mi).second;
2446 if (addr.nTime < nSince)
2448 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2450 addrdb.EraseAddress(addr);
2451 mapAddresses.erase(mi++);
2465 vector<CAddress> vAddr;
2466 vAddr.reserve(pto->vAddrToSend.size());
2467 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2469 // returns true if wasn't already contained in the set
2470 if (pto->setAddrKnown.insert(addr).second)
2472 vAddr.push_back(addr);
2473 // receiver rejects addr messages larger than 1000
2474 if (vAddr.size() >= 1000)
2476 pto->PushMessage("addr", vAddr);
2481 pto->vAddrToSend.clear();
2483 pto->PushMessage("addr", vAddr);
2488 // Message: inventory
2491 vector<CInv> vInvWait;
2492 CRITICAL_BLOCK(pto->cs_inventory)
2494 vInv.reserve(pto->vInventoryToSend.size());
2495 vInvWait.reserve(pto->vInventoryToSend.size());
2496 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2498 if (pto->setInventoryKnown.count(inv))
2501 // trickle out tx inv to protect privacy
2502 if (inv.type == MSG_TX && !fSendTrickle)
2504 // 1/4 of tx invs blast to all immediately
2505 static uint256 hashSalt;
2507 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2508 uint256 hashRand = inv.hash ^ hashSalt;
2509 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2510 bool fTrickleWait = ((hashRand & 3) != 0);
2512 // always trickle our own transactions
2516 if (GetTransaction(inv.hash, wtx))
2518 fTrickleWait = true;
2523 vInvWait.push_back(inv);
2528 // returns true if wasn't already contained in the set
2529 if (pto->setInventoryKnown.insert(inv).second)
2531 vInv.push_back(inv);
2532 if (vInv.size() >= 1000)
2534 pto->PushMessage("inv", vInv);
2539 pto->vInventoryToSend = vInvWait;
2542 pto->PushMessage("inv", vInv);
2548 vector<CInv> vGetData;
2549 int64 nNow = GetTime() * 1000000;
2551 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2553 const CInv& inv = (*pto->mapAskFor.begin()).second;
2554 if (!AlreadyHave(txdb, inv))
2556 printf("sending getdata: %s\n", inv.ToString().c_str());
2557 vGetData.push_back(inv);
2558 if (vGetData.size() >= 1000)
2560 pto->PushMessage("getdata", vGetData);
2564 mapAlreadyAskedFor[inv] = nNow;
2565 pto->mapAskFor.erase(pto->mapAskFor.begin());
2567 if (!vGetData.empty())
2568 pto->PushMessage("getdata", vGetData);
2587 //////////////////////////////////////////////////////////////////////////////
2592 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2594 unsigned char* pdata = (unsigned char*)pbuffer;
2595 unsigned int blocks = 1 + ((len + 8) / 64);
2596 unsigned char* pend = pdata + 64 * blocks;
2597 memset(pdata + len, 0, 64 * blocks - len);
2599 unsigned int bits = len * 8;
2600 pend[-1] = (bits >> 0) & 0xff;
2601 pend[-2] = (bits >> 8) & 0xff;
2602 pend[-3] = (bits >> 16) & 0xff;
2603 pend[-4] = (bits >> 24) & 0xff;
2607 using CryptoPP::ByteReverse;
2609 static const unsigned int pSHA256InitState[8] =
2610 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2612 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2614 memcpy(pstate, pinit, 32);
2615 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2619 // ScanHash scans nonces looking for a hash with at least some zero bits.
2620 // It operates on big endian data. Caller does the byte reversing.
2621 // All input buffers are 16-byte aligned. nNonce is usually preserved
2622 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2623 // the block is rebuilt and nNonce starts over at zero.
2625 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2627 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2631 // Hash pdata using pmidstate as the starting state into
2632 // preformatted buffer phash1, then hash phash1 into phash
2634 SHA256Transform(phash1, pdata, pmidstate);
2635 SHA256Transform(phash, phash1, pSHA256InitState);
2637 // Return the nonce if the hash has at least some zero bits,
2638 // caller will check if it has enough to reach the target
2639 if (((unsigned short*)phash)[14] == 0)
2642 // If nothing found after trying for a while, return -1
2643 if ((nNonce & 0xffff) == 0)
2645 nHashesDone = 0xffff+1;
2651 // Some explaining would be appreciated
2656 set<uint256> setDependsOn;
2659 COrphan(CTransaction* ptxIn)
2667 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2668 BOOST_FOREACH(uint256 hash, setDependsOn)
2669 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2674 CBlock* CreateNewBlock(CReserveKey& reservekey)
2676 CBlockIndex* pindexPrev = pindexBest;
2679 auto_ptr<CBlock> pblock(new CBlock());
2683 // Create coinbase tx
2685 txNew.vin.resize(1);
2686 txNew.vin[0].prevout.SetNull();
2687 txNew.vout.resize(1);
2688 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2690 // Add our coinbase tx as first transaction
2691 pblock->vtx.push_back(txNew);
2693 // Collect memory pool transactions into the block
2695 CRITICAL_BLOCK(cs_main)
2696 CRITICAL_BLOCK(cs_mapTransactions)
2700 // Priority order to process transactions
2701 list<COrphan> vOrphan; // list memory doesn't move
2702 map<uint256, vector<COrphan*> > mapDependers;
2703 multimap<double, CTransaction*> mapPriority;
2704 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2706 CTransaction& tx = (*mi).second;
2707 if (tx.IsCoinBase() || !tx.IsFinal())
2710 COrphan* porphan = NULL;
2711 double dPriority = 0;
2712 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2714 // Read prev transaction
2715 CTransaction txPrev;
2717 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2719 // Has to wait for dependencies
2722 // Use list for automatic deletion
2723 vOrphan.push_back(COrphan(&tx));
2724 porphan = &vOrphan.back();
2726 mapDependers[txin.prevout.hash].push_back(porphan);
2727 porphan->setDependsOn.insert(txin.prevout.hash);
2730 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2732 // Read block header
2733 int nConf = txindex.GetDepthInMainChain();
2735 dPriority += (double)nValueIn * nConf;
2737 if (fDebug && GetBoolArg("-printpriority"))
2738 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2741 // Priority is sum(valuein * age) / txsize
2742 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2745 porphan->dPriority = dPriority;
2747 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2749 if (fDebug && GetBoolArg("-printpriority"))
2751 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2758 // Collect transactions into block
2759 map<uint256, CTxIndex> mapTestPool;
2760 uint64 nBlockSize = 1000;
2761 int nBlockSigOps = 100;
2762 while (!mapPriority.empty())
2764 // Take highest priority transaction off priority queue
2765 double dPriority = -(*mapPriority.begin()).first;
2766 CTransaction& tx = *(*mapPriority.begin()).second;
2767 mapPriority.erase(mapPriority.begin());
2770 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2771 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2773 int nTxSigOps = tx.GetSigOpCount();
2774 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2777 // Transaction fee required depends on block size
2778 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2779 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2781 // Connecting shouldn't fail due to dependency on other memory pool transactions
2782 // because we're already processing them in order of dependency
2783 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2784 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2786 swap(mapTestPool, mapTestPoolTmp);
2789 pblock->vtx.push_back(tx);
2790 nBlockSize += nTxSize;
2791 nBlockSigOps += nTxSigOps;
2793 // Add transactions that depend on this one to the priority queue
2794 uint256 hash = tx.GetHash();
2795 if (mapDependers.count(hash))
2797 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2799 if (!porphan->setDependsOn.empty())
2801 porphan->setDependsOn.erase(hash);
2802 if (porphan->setDependsOn.empty())
2803 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2809 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2812 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2813 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2814 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2815 pblock->nBits = GetNextWorkRequired(pindexPrev);
2818 return pblock.release();
2822 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2824 // Update nExtraNonce
2825 static uint256 hashPrevBlock;
2826 if (hashPrevBlock != pblock->hashPrevBlock)
2829 hashPrevBlock = pblock->hashPrevBlock;
2832 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2833 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2837 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2840 // Prebuild hash buffers
2847 uint256 hashPrevBlock;
2848 uint256 hashMerkleRoot;
2851 unsigned int nNonce;
2854 unsigned char pchPadding0[64];
2856 unsigned char pchPadding1[64];
2859 memset(&tmp, 0, sizeof(tmp));
2861 tmp.block.nVersion = pblock->nVersion;
2862 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2863 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2864 tmp.block.nTime = pblock->nTime;
2865 tmp.block.nBits = pblock->nBits;
2866 tmp.block.nNonce = pblock->nNonce;
2868 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2869 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2871 // Byte swap all the input buffer
2872 for (int i = 0; i < sizeof(tmp)/4; i++)
2873 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2875 // Precalc the first half of the first hash, which stays constant
2876 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2878 memcpy(pdata, &tmp.block, 128);
2879 memcpy(phash1, &tmp.hash1, 64);
2883 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2885 uint256 hash = pblock->GetHash();
2886 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2888 if (hash > hashTarget)
2892 printf("BitcoinMiner:\n");
2893 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2895 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2896 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2899 CRITICAL_BLOCK(cs_main)
2901 if (pblock->hashPrevBlock != hashBestChain)
2902 return error("BitcoinMiner : generated block is stale");
2904 // Remove key from key pool
2905 reservekey.KeepKey();
2907 // Track how many getdata requests this block gets
2908 CRITICAL_BLOCK(wallet.cs_wallet)
2909 wallet.mapRequestCount[pblock->GetHash()] = 0;
2911 // Process this block the same as if we had received it from another node
2912 if (!ProcessBlock(NULL, pblock))
2913 return error("BitcoinMiner : ProcessBlock, block not accepted");
2920 void static ThreadBitcoinMiner(void* parg);
2922 void static BitcoinMiner(CWallet *pwallet)
2924 printf("BitcoinMiner started\n");
2925 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2927 // Each thread has its own key and counter
2928 CReserveKey reservekey(pwallet);
2929 unsigned int nExtraNonce = 0;
2931 while (fGenerateBitcoins)
2933 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2937 while (vNodes.empty() || IsInitialBlockDownload())
2942 if (!fGenerateBitcoins)
2950 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2951 CBlockIndex* pindexPrev = pindexBest;
2953 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2956 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2958 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2962 // Prebuild hash buffers
2964 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2965 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2966 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2968 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2970 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2971 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2977 int64 nStart = GetTime();
2978 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2980 uint256& hash = *alignup<16>(hashbuf);
2983 unsigned int nHashesDone = 0;
2984 unsigned int nNonceFound;
2987 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2988 (char*)&hash, nHashesDone);
2990 // Check if something found
2991 if (nNonceFound != -1)
2993 for (int i = 0; i < sizeof(hash)/4; i++)
2994 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2996 if (hash <= hashTarget)
2999 pblock->nNonce = ByteReverse(nNonceFound);
3000 assert(hash == pblock->GetHash());
3002 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3003 CheckWork(pblock.get(), *pwalletMain, reservekey);
3004 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3010 static int64 nHashCounter;
3011 if (nHPSTimerStart == 0)
3013 nHPSTimerStart = GetTimeMillis();
3017 nHashCounter += nHashesDone;
3018 if (GetTimeMillis() - nHPSTimerStart > 4000)
3020 static CCriticalSection cs;
3023 if (GetTimeMillis() - nHPSTimerStart > 4000)
3025 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3026 nHPSTimerStart = GetTimeMillis();
3028 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3029 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3030 static int64 nLogTime;
3031 if (GetTime() - nLogTime > 30 * 60)
3033 nLogTime = GetTime();
3034 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3035 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3041 // Check for stop or if block needs to be rebuilt
3044 if (!fGenerateBitcoins)
3046 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3050 if (nBlockNonce >= 0xffff0000)
3052 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3054 if (pindexPrev != pindexBest)
3057 // Update nTime every few seconds
3058 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3059 nBlockTime = ByteReverse(pblock->nTime);
3064 void static ThreadBitcoinMiner(void* parg)
3066 CWallet* pwallet = (CWallet*)parg;
3069 vnThreadsRunning[3]++;
3070 BitcoinMiner(pwallet);
3071 vnThreadsRunning[3]--;
3073 catch (std::exception& e) {
3074 vnThreadsRunning[3]--;
3075 PrintException(&e, "ThreadBitcoinMiner()");
3077 vnThreadsRunning[3]--;
3078 PrintException(NULL, "ThreadBitcoinMiner()");
3080 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3082 if (vnThreadsRunning[3] == 0)
3084 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3088 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3090 if (fGenerateBitcoins != fGenerate)
3092 fGenerateBitcoins = fGenerate;
3093 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3096 if (fGenerateBitcoins)
3098 int nProcessors = boost::thread::hardware_concurrency();
3099 printf("%d processors\n", nProcessors);
3100 if (nProcessors < 1)
3102 if (fLimitProcessors && nProcessors > nLimitProcessors)
3103 nProcessors = nLimitProcessors;
3104 int nAddThreads = nProcessors - vnThreadsRunning[3];
3105 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3106 for (int i = 0; i < nAddThreads; i++)
3108 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3109 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");