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)
664 // Testnet has min-difficulty blocks
665 // after nTargetSpacing*2 time between blocks:
666 if (fTestNet && nTime > nTargetSpacing*2)
667 return bnProofOfWorkLimit.GetCompact();
670 bnResult.SetCompact(nBase);
671 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
673 // Maximum 400% adjustment...
675 // ... in best-case exactly 4-times-normal target time
676 nTime -= nTargetTimespan*4;
678 if (bnResult > bnProofOfWorkLimit)
679 bnResult = bnProofOfWorkLimit;
680 return bnResult.GetCompact();
683 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
685 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
688 if (pindexLast == NULL)
689 return nProofOfWorkLimit;
691 // Only change once per interval
692 if ((pindexLast->nHeight+1) % nInterval != 0)
694 // Special rules for testnet after 15 Feb 2012:
695 if (fTestNet && pblock->nTime > 1329264000)
697 // If the new block's timestamp is more than 2* 10 minutes
698 // then allow mining of a min-difficulty block.
699 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
700 return nProofOfWorkLimit;
703 // Return the last non-special-min-difficulty-rules-block
704 const CBlockIndex* pindex = pindexLast;
705 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
706 pindex = pindex->pprev;
707 return pindex->nBits;
711 return pindexLast->nBits;
714 // Go back by what we want to be 14 days worth of blocks
715 const CBlockIndex* pindexFirst = pindexLast;
716 for (int i = 0; pindexFirst && i < nInterval-1; i++)
717 pindexFirst = pindexFirst->pprev;
720 // Limit adjustment step
721 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
722 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
723 if (nActualTimespan < nTargetTimespan/4)
724 nActualTimespan = nTargetTimespan/4;
725 if (nActualTimespan > nTargetTimespan*4)
726 nActualTimespan = nTargetTimespan*4;
730 bnNew.SetCompact(pindexLast->nBits);
731 bnNew *= nActualTimespan;
732 bnNew /= nTargetTimespan;
734 if (bnNew > bnProofOfWorkLimit)
735 bnNew = bnProofOfWorkLimit;
738 printf("GetNextWorkRequired RETARGET\n");
739 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
740 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
741 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
743 return bnNew.GetCompact();
746 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
749 bnTarget.SetCompact(nBits);
752 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
753 return error("CheckProofOfWork() : nBits below minimum work");
755 // Check proof of work matches claimed amount
756 if (hash > bnTarget.getuint256())
757 return error("CheckProofOfWork() : hash doesn't match nBits");
762 bool IsInitialBlockDownload()
764 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
766 static int64 nLastUpdate;
767 static CBlockIndex* pindexLastBest;
768 if (pindexBest != pindexLastBest)
770 pindexLastBest = pindexBest;
771 nLastUpdate = GetTime();
773 return (GetTime() - nLastUpdate < 10 &&
774 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
777 void static InvalidChainFound(CBlockIndex* pindexNew)
779 if (pindexNew->bnChainWork > bnBestInvalidWork)
781 bnBestInvalidWork = pindexNew->bnChainWork;
782 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
785 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());
786 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
787 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
788 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
801 bool CTransaction::DisconnectInputs(CTxDB& txdb)
803 // Relinquish previous transactions' spent pointers
806 BOOST_FOREACH(const CTxIn& txin, vin)
808 COutPoint prevout = txin.prevout;
810 // Get prev txindex from disk
812 if (!txdb.ReadTxIndex(prevout.hash, txindex))
813 return error("DisconnectInputs() : ReadTxIndex failed");
815 if (prevout.n >= txindex.vSpent.size())
816 return error("DisconnectInputs() : prevout.n out of range");
818 // Mark outpoint as not spent
819 txindex.vSpent[prevout.n].SetNull();
822 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
823 return error("DisconnectInputs() : UpdateTxIndex failed");
827 // Remove transaction from index
828 if (!txdb.EraseTxIndex(*this))
829 return error("DisconnectInputs() : EraseTxPos failed");
835 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
836 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
838 // Take over previous transactions' spent pointers
842 for (int i = 0; i < vin.size(); i++)
844 COutPoint prevout = vin[i].prevout;
849 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
851 // Get txindex from current proposed changes
852 txindex = mapTestPool[prevout.hash];
856 // Read txindex from txdb
857 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
859 if (!fFound && (fBlock || fMiner))
860 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());
864 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
866 // Get prev tx from single transactions in memory
867 CRITICAL_BLOCK(cs_mapTransactions)
869 if (!mapTransactions.count(prevout.hash))
870 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
871 txPrev = mapTransactions[prevout.hash];
874 txindex.vSpent.resize(txPrev.vout.size());
878 // Get prev tx from disk
879 if (!txPrev.ReadFromDisk(txindex.pos))
880 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
883 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
884 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());
886 // If prev is coinbase, check that it's matured
887 if (txPrev.IsCoinBase())
888 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
889 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
890 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
893 if (!VerifySignature(txPrev, *this, i))
894 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
896 // Check for conflicts
897 if (!txindex.vSpent[prevout.n].IsNull())
898 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());
900 // Check for negative or overflow input values
901 nValueIn += txPrev.vout[prevout.n].nValue;
902 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
903 return error("ConnectInputs() : txin values out of range");
905 // Mark outpoints as spent
906 txindex.vSpent[prevout.n] = posThisTx;
909 if (fBlock || fMiner)
911 mapTestPool[prevout.hash] = txindex;
915 if (nValueIn < GetValueOut())
916 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
918 // Tally transaction fees
919 int64 nTxFee = nValueIn - GetValueOut();
921 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
922 if (nTxFee < nMinFee)
925 if (!MoneyRange(nFees))
926 return error("ConnectInputs() : nFees out of range");
931 // Add transaction to changes
932 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
936 // Add transaction to test pool
937 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
944 bool CTransaction::ClientConnectInputs()
949 // Take over previous transactions' spent pointers
950 CRITICAL_BLOCK(cs_mapTransactions)
953 for (int i = 0; i < vin.size(); i++)
955 // Get prev tx from single transactions in memory
956 COutPoint prevout = vin[i].prevout;
957 if (!mapTransactions.count(prevout.hash))
959 CTransaction& txPrev = mapTransactions[prevout.hash];
961 if (prevout.n >= txPrev.vout.size())
965 if (!VerifySignature(txPrev, *this, i))
966 return error("ConnectInputs() : VerifySignature failed");
968 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
969 ///// this has to go away now that posNext is gone
970 // // Check for conflicts
971 // if (!txPrev.vout[prevout.n].posNext.IsNull())
972 // return error("ConnectInputs() : prev tx already used");
974 // // Flag outpoints as used
975 // txPrev.vout[prevout.n].posNext = posThisTx;
977 nValueIn += txPrev.vout[prevout.n].nValue;
979 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
980 return error("ClientConnectInputs() : txin values out of range");
982 if (GetValueOut() > nValueIn)
992 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
994 // Disconnect in reverse order
995 for (int i = vtx.size()-1; i >= 0; i--)
996 if (!vtx[i].DisconnectInputs(txdb))
999 // Update block index on disk without changing it in memory.
1000 // The memory index structure will be changed after the db commits.
1003 CDiskBlockIndex blockindexPrev(pindex->pprev);
1004 blockindexPrev.hashNext = 0;
1005 if (!txdb.WriteBlockIndex(blockindexPrev))
1006 return error("DisconnectBlock() : WriteBlockIndex failed");
1012 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1014 // Check it again in case a previous version let a bad block in
1018 //// issue here: it doesn't know the version
1019 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1021 map<uint256, CTxIndex> mapQueuedChanges;
1023 BOOST_FOREACH(CTransaction& tx, vtx)
1025 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1026 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1028 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1031 // Write queued txindex changes
1032 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1034 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1035 return error("ConnectBlock() : UpdateTxIndex failed");
1038 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1041 // Update block index on disk without changing it in memory.
1042 // The memory index structure will be changed after the db commits.
1045 CDiskBlockIndex blockindexPrev(pindex->pprev);
1046 blockindexPrev.hashNext = pindex->GetBlockHash();
1047 if (!txdb.WriteBlockIndex(blockindexPrev))
1048 return error("ConnectBlock() : WriteBlockIndex failed");
1051 // Watch for transactions paying to me
1052 BOOST_FOREACH(CTransaction& tx, vtx)
1053 SyncWithWallets(tx, this, true);
1058 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1060 printf("REORGANIZE\n");
1063 CBlockIndex* pfork = pindexBest;
1064 CBlockIndex* plonger = pindexNew;
1065 while (pfork != plonger)
1067 while (plonger->nHeight > pfork->nHeight)
1068 if (!(plonger = plonger->pprev))
1069 return error("Reorganize() : plonger->pprev is null");
1070 if (pfork == plonger)
1072 if (!(pfork = pfork->pprev))
1073 return error("Reorganize() : pfork->pprev is null");
1076 // List of what to disconnect
1077 vector<CBlockIndex*> vDisconnect;
1078 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1079 vDisconnect.push_back(pindex);
1081 // List of what to connect
1082 vector<CBlockIndex*> vConnect;
1083 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1084 vConnect.push_back(pindex);
1085 reverse(vConnect.begin(), vConnect.end());
1087 // Disconnect shorter branch
1088 vector<CTransaction> vResurrect;
1089 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1092 if (!block.ReadFromDisk(pindex))
1093 return error("Reorganize() : ReadFromDisk for disconnect failed");
1094 if (!block.DisconnectBlock(txdb, pindex))
1095 return error("Reorganize() : DisconnectBlock failed");
1097 // Queue memory transactions to resurrect
1098 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1099 if (!tx.IsCoinBase())
1100 vResurrect.push_back(tx);
1103 // Connect longer branch
1104 vector<CTransaction> vDelete;
1105 for (int i = 0; i < vConnect.size(); i++)
1107 CBlockIndex* pindex = vConnect[i];
1109 if (!block.ReadFromDisk(pindex))
1110 return error("Reorganize() : ReadFromDisk for connect failed");
1111 if (!block.ConnectBlock(txdb, pindex))
1115 return error("Reorganize() : ConnectBlock failed");
1118 // Queue memory transactions to delete
1119 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1120 vDelete.push_back(tx);
1122 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1123 return error("Reorganize() : WriteHashBestChain failed");
1125 // Make sure it's successfully written to disk before changing memory structure
1126 if (!txdb.TxnCommit())
1127 return error("Reorganize() : TxnCommit failed");
1129 // Disconnect shorter branch
1130 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1132 pindex->pprev->pnext = NULL;
1134 // Connect longer branch
1135 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1137 pindex->pprev->pnext = pindex;
1139 // Resurrect memory transactions that were in the disconnected branch
1140 BOOST_FOREACH(CTransaction& tx, vResurrect)
1141 tx.AcceptToMemoryPool(txdb, false);
1143 // Delete redundant memory transactions that are in the connected branch
1144 BOOST_FOREACH(CTransaction& tx, vDelete)
1145 tx.RemoveFromMemoryPool();
1151 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1153 uint256 hash = GetHash();
1156 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1158 txdb.WriteHashBestChain(hash);
1159 if (!txdb.TxnCommit())
1160 return error("SetBestChain() : TxnCommit failed");
1161 pindexGenesisBlock = pindexNew;
1163 else if (hashPrevBlock == hashBestChain)
1165 // Adding to current best branch
1166 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1169 InvalidChainFound(pindexNew);
1170 return error("SetBestChain() : ConnectBlock failed");
1172 if (!txdb.TxnCommit())
1173 return error("SetBestChain() : TxnCommit failed");
1175 // Add to current best branch
1176 pindexNew->pprev->pnext = pindexNew;
1178 // Delete redundant memory transactions
1179 BOOST_FOREACH(CTransaction& tx, vtx)
1180 tx.RemoveFromMemoryPool();
1185 if (!Reorganize(txdb, pindexNew))
1188 InvalidChainFound(pindexNew);
1189 return error("SetBestChain() : Reorganize failed");
1193 // Update best block in wallet (so we can detect restored wallets)
1194 if (!IsInitialBlockDownload())
1196 const CBlockLocator locator(pindexNew);
1197 ::SetBestChain(locator);
1201 hashBestChain = hash;
1202 pindexBest = pindexNew;
1203 nBestHeight = pindexBest->nHeight;
1204 bnBestChainWork = pindexNew->bnChainWork;
1205 nTimeBestReceived = GetTime();
1206 nTransactionsUpdated++;
1207 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1213 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1215 // Check for duplicate
1216 uint256 hash = GetHash();
1217 if (mapBlockIndex.count(hash))
1218 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1220 // Construct new block index object
1221 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1223 return error("AddToBlockIndex() : new CBlockIndex failed");
1224 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1225 pindexNew->phashBlock = &((*mi).first);
1226 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1227 if (miPrev != mapBlockIndex.end())
1229 pindexNew->pprev = (*miPrev).second;
1230 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1232 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1236 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1237 if (!txdb.TxnCommit())
1241 if (pindexNew->bnChainWork > bnBestChainWork)
1242 if (!SetBestChain(txdb, pindexNew))
1247 if (pindexNew == pindexBest)
1249 // Notify UI to display prev block's coinbase if it was ours
1250 static uint256 hashPrevBestCoinBase;
1251 UpdatedTransaction(hashPrevBestCoinBase);
1252 hashPrevBestCoinBase = vtx[0].GetHash();
1262 bool CBlock::CheckBlock() const
1264 // These are checks that are independent of context
1265 // that can be verified before saving an orphan block.
1268 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1269 return error("CheckBlock() : size limits failed");
1271 // Check proof of work matches claimed amount
1272 if (!CheckProofOfWork(GetHash(), nBits))
1273 return error("CheckBlock() : proof of work failed");
1276 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1277 return error("CheckBlock() : block timestamp too far in the future");
1279 // First transaction must be coinbase, the rest must not be
1280 if (vtx.empty() || !vtx[0].IsCoinBase())
1281 return error("CheckBlock() : first tx is not coinbase");
1282 for (int i = 1; i < vtx.size(); i++)
1283 if (vtx[i].IsCoinBase())
1284 return error("CheckBlock() : more than one coinbase");
1286 // Check transactions
1287 BOOST_FOREACH(const CTransaction& tx, vtx)
1288 if (!tx.CheckTransaction())
1289 return error("CheckBlock() : CheckTransaction failed");
1291 // Check that it's not full of nonstandard transactions
1292 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1293 return error("CheckBlock() : too many nonstandard transactions");
1296 if (hashMerkleRoot != BuildMerkleTree())
1297 return error("CheckBlock() : hashMerkleRoot mismatch");
1302 bool CBlock::AcceptBlock()
1304 // Check for duplicate
1305 uint256 hash = GetHash();
1306 if (mapBlockIndex.count(hash))
1307 return error("AcceptBlock() : block already in mapBlockIndex");
1309 // Get prev block index
1310 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1311 if (mi == mapBlockIndex.end())
1312 return error("AcceptBlock() : prev block not found");
1313 CBlockIndex* pindexPrev = (*mi).second;
1314 int nHeight = pindexPrev->nHeight+1;
1316 // Check proof of work
1317 if (nBits != GetNextWorkRequired(pindexPrev, this))
1318 return error("AcceptBlock() : incorrect proof of work");
1320 // Check timestamp against prev
1321 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1322 return error("AcceptBlock() : block's timestamp is too early");
1324 // Check that all transactions are finalized
1325 BOOST_FOREACH(const CTransaction& tx, vtx)
1326 if (!tx.IsFinal(nHeight, GetBlockTime()))
1327 return error("AcceptBlock() : contains a non-final transaction");
1329 // Check that the block chain matches the known block chain up to a checkpoint
1330 if (!Checkpoints::CheckBlock(nHeight, hash))
1331 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1333 // Write block to history file
1334 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1335 return error("AcceptBlock() : out of disk space");
1336 unsigned int nFile = -1;
1337 unsigned int nBlockPos = 0;
1338 if (!WriteToDisk(nFile, nBlockPos))
1339 return error("AcceptBlock() : WriteToDisk failed");
1340 if (!AddToBlockIndex(nFile, nBlockPos))
1341 return error("AcceptBlock() : AddToBlockIndex failed");
1343 // Relay inventory, but don't relay old inventory during initial block download
1344 if (hashBestChain == hash)
1345 CRITICAL_BLOCK(cs_vNodes)
1346 BOOST_FOREACH(CNode* pnode, vNodes)
1347 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1348 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1353 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1355 // Check for duplicate
1356 uint256 hash = pblock->GetHash();
1357 if (mapBlockIndex.count(hash))
1358 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1359 if (mapOrphanBlocks.count(hash))
1360 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1362 // Preliminary checks
1363 if (!pblock->CheckBlock())
1364 return error("ProcessBlock() : CheckBlock FAILED");
1366 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1367 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1369 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1370 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1373 return error("ProcessBlock() : block with timestamp before last checkpoint");
1376 bnNewBlock.SetCompact(pblock->nBits);
1378 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1379 if (bnNewBlock > bnRequired)
1381 return error("ProcessBlock() : block with too little proof-of-work");
1386 // If don't already have its previous block, shunt it off to holding area until we get it
1387 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1389 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1390 CBlock* pblock2 = new CBlock(*pblock);
1391 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1392 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1394 // Ask this guy to fill in what we're missing
1396 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1401 if (!pblock->AcceptBlock())
1402 return error("ProcessBlock() : AcceptBlock FAILED");
1404 // Recursively process any orphan blocks that depended on this one
1405 vector<uint256> vWorkQueue;
1406 vWorkQueue.push_back(hash);
1407 for (int i = 0; i < vWorkQueue.size(); i++)
1409 uint256 hashPrev = vWorkQueue[i];
1410 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1411 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1414 CBlock* pblockOrphan = (*mi).second;
1415 if (pblockOrphan->AcceptBlock())
1416 vWorkQueue.push_back(pblockOrphan->GetHash());
1417 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1418 delete pblockOrphan;
1420 mapOrphanBlocksByPrev.erase(hashPrev);
1423 printf("ProcessBlock: ACCEPTED\n");
1434 bool CheckDiskSpace(uint64 nAdditionalBytes)
1436 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1438 // Check for 15MB because database could create another 10MB log file at any time
1439 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1442 string strMessage = _("Warning: Disk space is low ");
1443 strMiscWarning = strMessage;
1444 printf("*** %s\n", strMessage.c_str());
1445 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1446 CreateThread(Shutdown, NULL);
1452 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1456 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1459 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1461 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1470 static unsigned int nCurrentBlockFile = 1;
1472 FILE* AppendBlockFile(unsigned int& nFileRet)
1477 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1480 if (fseek(file, 0, SEEK_END) != 0)
1482 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1483 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1485 nFileRet = nCurrentBlockFile;
1489 nCurrentBlockFile++;
1493 bool LoadBlockIndex(bool fAllowNew)
1497 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1498 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1499 pchMessageStart[0] = 0xfa;
1500 pchMessageStart[1] = 0xbf;
1501 pchMessageStart[2] = 0xb5;
1502 pchMessageStart[3] = 0xda;
1509 if (!txdb.LoadBlockIndex())
1514 // Init with genesis block
1516 if (mapBlockIndex.empty())
1522 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1523 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1524 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1525 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1526 // vMerkleTree: 4a5e1e
1529 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1531 txNew.vin.resize(1);
1532 txNew.vout.resize(1);
1533 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1534 txNew.vout[0].nValue = 50 * COIN;
1535 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1537 block.vtx.push_back(txNew);
1538 block.hashPrevBlock = 0;
1539 block.hashMerkleRoot = block.BuildMerkleTree();
1541 block.nTime = 1231006505;
1542 block.nBits = 0x1d00ffff;
1543 block.nNonce = 2083236893;
1547 block.nTime = 1296688602;
1548 block.nBits = 0x1d07fff8;
1549 block.nNonce = 384568319;
1553 printf("%s\n", block.GetHash().ToString().c_str());
1554 printf("%s\n", hashGenesisBlock.ToString().c_str());
1555 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1556 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1558 assert(block.GetHash() == hashGenesisBlock);
1560 // Start new block file
1562 unsigned int nBlockPos;
1563 if (!block.WriteToDisk(nFile, nBlockPos))
1564 return error("LoadBlockIndex() : writing genesis block to disk failed");
1565 if (!block.AddToBlockIndex(nFile, nBlockPos))
1566 return error("LoadBlockIndex() : genesis block not accepted");
1574 void PrintBlockTree()
1576 // precompute tree structure
1577 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1578 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1580 CBlockIndex* pindex = (*mi).second;
1581 mapNext[pindex->pprev].push_back(pindex);
1583 //while (rand() % 3 == 0)
1584 // mapNext[pindex->pprev].push_back(pindex);
1587 vector<pair<int, CBlockIndex*> > vStack;
1588 vStack.push_back(make_pair(0, pindexGenesisBlock));
1591 while (!vStack.empty())
1593 int nCol = vStack.back().first;
1594 CBlockIndex* pindex = vStack.back().second;
1597 // print split or gap
1598 if (nCol > nPrevCol)
1600 for (int i = 0; i < nCol-1; i++)
1604 else if (nCol < nPrevCol)
1606 for (int i = 0; i < nCol; i++)
1613 for (int i = 0; i < nCol; i++)
1618 block.ReadFromDisk(pindex);
1619 printf("%d (%u,%u) %s %s tx %d",
1623 block.GetHash().ToString().substr(0,20).c_str(),
1624 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1627 PrintWallets(block);
1629 // put the main timechain first
1630 vector<CBlockIndex*>& vNext = mapNext[pindex];
1631 for (int i = 0; i < vNext.size(); i++)
1633 if (vNext[i]->pnext)
1635 swap(vNext[0], vNext[i]);
1641 for (int i = 0; i < vNext.size(); i++)
1642 vStack.push_back(make_pair(nCol+i, vNext[i]));
1655 //////////////////////////////////////////////////////////////////////////////
1660 map<uint256, CAlert> mapAlerts;
1661 CCriticalSection cs_mapAlerts;
1663 string GetWarnings(string strFor)
1666 string strStatusBar;
1668 if (GetBoolArg("-testsafemode"))
1671 // Misc warnings like out of disk space and clock is wrong
1672 if (strMiscWarning != "")
1675 strStatusBar = strMiscWarning;
1678 // Longer invalid proof-of-work chain
1679 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1682 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1686 CRITICAL_BLOCK(cs_mapAlerts)
1688 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1690 const CAlert& alert = item.second;
1691 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1693 nPriority = alert.nPriority;
1694 strStatusBar = alert.strStatusBar;
1699 if (strFor == "statusbar")
1700 return strStatusBar;
1701 else if (strFor == "rpc")
1703 assert(!"GetWarnings() : invalid parameter");
1707 bool CAlert::ProcessAlert()
1709 if (!CheckSignature())
1714 CRITICAL_BLOCK(cs_mapAlerts)
1716 // Cancel previous alerts
1717 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1719 const CAlert& alert = (*mi).second;
1722 printf("cancelling alert %d\n", alert.nID);
1723 mapAlerts.erase(mi++);
1725 else if (!alert.IsInEffect())
1727 printf("expiring alert %d\n", alert.nID);
1728 mapAlerts.erase(mi++);
1734 // Check if this alert has been cancelled
1735 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1737 const CAlert& alert = item.second;
1738 if (alert.Cancels(*this))
1740 printf("alert already cancelled by %d\n", alert.nID);
1746 mapAlerts.insert(make_pair(GetHash(), *this));
1749 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1761 //////////////////////////////////////////////////////////////////////////////
1767 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1771 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1772 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1774 // Don't know what it is, just say we already got one
1781 // The message start string is designed to be unlikely to occur in normal data.
1782 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1783 // a large 4-byte int at any alignment.
1784 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1787 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1789 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1790 RandAddSeedPerfmon();
1792 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1793 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1795 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1797 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1805 if (strCommand == "version")
1807 // Each connection can only send one version message
1808 if (pfrom->nVersion != 0)
1815 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1816 if (pfrom->nVersion == 10300)
1817 pfrom->nVersion = 300;
1818 if (pfrom->nVersion >= 106 && !vRecv.empty())
1819 vRecv >> addrFrom >> nNonce;
1820 if (pfrom->nVersion >= 106 && !vRecv.empty())
1821 vRecv >> pfrom->strSubVer;
1822 if (pfrom->nVersion >= 209 && !vRecv.empty())
1823 vRecv >> pfrom->nStartingHeight;
1825 if (pfrom->nVersion == 0)
1828 // Disconnect if we connected to ourself
1829 if (nNonce == nLocalHostNonce && nNonce > 1)
1831 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1832 pfrom->fDisconnect = true;
1836 // Be shy and don't send version until we hear
1837 if (pfrom->fInbound)
1838 pfrom->PushVersion();
1840 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1842 AddTimeData(pfrom->addr.ip, nTime);
1845 if (pfrom->nVersion >= 209)
1846 pfrom->PushMessage("verack");
1847 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1848 if (pfrom->nVersion < 209)
1849 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1851 if (!pfrom->fInbound)
1853 // Advertise our address
1854 if (addrLocalHost.IsRoutable() && !fUseProxy)
1856 CAddress addr(addrLocalHost);
1857 addr.nTime = GetAdjustedTime();
1858 pfrom->PushAddress(addr);
1861 // Get recent addresses
1862 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1864 pfrom->PushMessage("getaddr");
1865 pfrom->fGetAddr = true;
1869 // Ask the first connected node for block updates
1870 static int nAskedForBlocks;
1871 if (!pfrom->fClient &&
1872 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1873 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1876 pfrom->PushGetBlocks(pindexBest, uint256(0));
1880 CRITICAL_BLOCK(cs_mapAlerts)
1881 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1882 item.second.RelayTo(pfrom);
1884 pfrom->fSuccessfullyConnected = true;
1886 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1890 else if (pfrom->nVersion == 0)
1892 // Must have a version message before anything else
1897 else if (strCommand == "verack")
1899 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1903 else if (strCommand == "addr")
1905 vector<CAddress> vAddr;
1908 // Don't want addr from older versions unless seeding
1909 if (pfrom->nVersion < 209)
1911 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1913 if (vAddr.size() > 1000)
1914 return error("message addr size() = %d", vAddr.size());
1916 // Store the new addresses
1919 int64 nNow = GetAdjustedTime();
1920 int64 nSince = nNow - 10 * 60;
1921 BOOST_FOREACH(CAddress& addr, vAddr)
1925 // ignore IPv6 for now, since it isn't implemented anyway
1928 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1929 addr.nTime = nNow - 5 * 24 * 60 * 60;
1930 AddAddress(addr, 2 * 60 * 60, &addrDB);
1931 pfrom->AddAddressKnown(addr);
1932 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1934 // Relay to a limited number of other nodes
1935 CRITICAL_BLOCK(cs_vNodes)
1937 // Use deterministic randomness to send to the same nodes for 24 hours
1938 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1939 static uint256 hashSalt;
1941 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1942 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1943 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1944 multimap<uint256, CNode*> mapMix;
1945 BOOST_FOREACH(CNode* pnode, vNodes)
1947 if (pnode->nVersion < 31402)
1949 unsigned int nPointer;
1950 memcpy(&nPointer, &pnode, sizeof(nPointer));
1951 uint256 hashKey = hashRand ^ nPointer;
1952 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1953 mapMix.insert(make_pair(hashKey, pnode));
1955 int nRelayNodes = 2;
1956 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1957 ((*mi).second)->PushAddress(addr);
1961 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1962 if (vAddr.size() < 1000)
1963 pfrom->fGetAddr = false;
1967 else if (strCommand == "inv")
1971 if (vInv.size() > 50000)
1972 return error("message inv size() = %d", vInv.size());
1975 BOOST_FOREACH(const CInv& inv, vInv)
1979 pfrom->AddInventoryKnown(inv);
1981 bool fAlreadyHave = AlreadyHave(txdb, inv);
1983 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1987 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1988 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1990 // Track requests for our stuff
1991 Inventory(inv.hash);
1996 else if (strCommand == "getdata")
2000 if (vInv.size() > 50000)
2001 return error("message getdata size() = %d", vInv.size());
2003 BOOST_FOREACH(const CInv& inv, vInv)
2007 printf("received getdata for: %s\n", inv.ToString().c_str());
2009 if (inv.type == MSG_BLOCK)
2011 // Send block from disk
2012 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2013 if (mi != mapBlockIndex.end())
2016 block.ReadFromDisk((*mi).second);
2017 pfrom->PushMessage("block", block);
2019 // Trigger them to send a getblocks request for the next batch of inventory
2020 if (inv.hash == pfrom->hashContinue)
2022 // Bypass PushInventory, this must send even if redundant,
2023 // and we want it right after the last block so they don't
2024 // wait for other stuff first.
2026 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2027 pfrom->PushMessage("inv", vInv);
2028 pfrom->hashContinue = 0;
2032 else if (inv.IsKnownType())
2034 // Send stream from relay memory
2035 CRITICAL_BLOCK(cs_mapRelay)
2037 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2038 if (mi != mapRelay.end())
2039 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2043 // Track requests for our stuff
2044 Inventory(inv.hash);
2049 else if (strCommand == "getblocks")
2051 CBlockLocator locator;
2053 vRecv >> locator >> hashStop;
2055 // Find the last block the caller has in the main chain
2056 CBlockIndex* pindex = locator.GetBlockIndex();
2058 // Send the rest of the chain
2060 pindex = pindex->pnext;
2061 int nLimit = 500 + locator.GetDistanceBack();
2062 unsigned int nBytes = 0;
2063 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2064 for (; pindex; pindex = pindex->pnext)
2066 if (pindex->GetBlockHash() == hashStop)
2068 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2071 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2073 block.ReadFromDisk(pindex, true);
2074 nBytes += block.GetSerializeSize(SER_NETWORK);
2075 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2077 // When this block is requested, we'll send an inv that'll make them
2078 // getblocks the next batch of inventory.
2079 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2080 pfrom->hashContinue = pindex->GetBlockHash();
2087 else if (strCommand == "getheaders")
2089 CBlockLocator locator;
2091 vRecv >> locator >> hashStop;
2093 CBlockIndex* pindex = NULL;
2094 if (locator.IsNull())
2096 // If locator is null, return the hashStop block
2097 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2098 if (mi == mapBlockIndex.end())
2100 pindex = (*mi).second;
2104 // Find the last block the caller has in the main chain
2105 pindex = locator.GetBlockIndex();
2107 pindex = pindex->pnext;
2110 vector<CBlock> vHeaders;
2111 int nLimit = 2000 + locator.GetDistanceBack();
2112 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2113 for (; pindex; pindex = pindex->pnext)
2115 vHeaders.push_back(pindex->GetBlockHeader());
2116 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2119 pfrom->PushMessage("headers", vHeaders);
2123 else if (strCommand == "tx")
2125 vector<uint256> vWorkQueue;
2126 CDataStream vMsg(vRecv);
2130 CInv inv(MSG_TX, tx.GetHash());
2131 pfrom->AddInventoryKnown(inv);
2133 bool fMissingInputs = false;
2134 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2136 SyncWithWallets(tx, NULL, true);
2137 RelayMessage(inv, vMsg);
2138 mapAlreadyAskedFor.erase(inv);
2139 vWorkQueue.push_back(inv.hash);
2141 // Recursively process any orphan transactions that depended on this one
2142 for (int i = 0; i < vWorkQueue.size(); i++)
2144 uint256 hashPrev = vWorkQueue[i];
2145 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2146 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2149 const CDataStream& vMsg = *((*mi).second);
2151 CDataStream(vMsg) >> tx;
2152 CInv inv(MSG_TX, tx.GetHash());
2154 if (tx.AcceptToMemoryPool(true))
2156 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2157 SyncWithWallets(tx, NULL, true);
2158 RelayMessage(inv, vMsg);
2159 mapAlreadyAskedFor.erase(inv);
2160 vWorkQueue.push_back(inv.hash);
2165 BOOST_FOREACH(uint256 hash, vWorkQueue)
2166 EraseOrphanTx(hash);
2168 else if (fMissingInputs)
2170 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2176 else if (strCommand == "block")
2181 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2184 CInv inv(MSG_BLOCK, block.GetHash());
2185 pfrom->AddInventoryKnown(inv);
2187 if (ProcessBlock(pfrom, &block))
2188 mapAlreadyAskedFor.erase(inv);
2192 else if (strCommand == "getaddr")
2194 // Nodes rebroadcast an addr every 24 hours
2195 pfrom->vAddrToSend.clear();
2196 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2197 CRITICAL_BLOCK(cs_mapAddresses)
2199 unsigned int nCount = 0;
2200 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2202 const CAddress& addr = item.second;
2203 if (addr.nTime > nSince)
2206 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2208 const CAddress& addr = item.second;
2209 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2210 pfrom->PushAddress(addr);
2216 else if (strCommand == "checkorder")
2221 if (!GetBoolArg("-allowreceivebyip"))
2223 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2230 /// we have a chance to check the order here
2232 // Keep giving the same key to the same ip until they use it
2233 if (!mapReuseKey.count(pfrom->addr.ip))
2234 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2236 // Send back approval of order and pubkey to use
2237 CScript scriptPubKey;
2238 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2239 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2243 else if (strCommand == "reply")
2248 CRequestTracker tracker;
2249 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2251 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2252 if (mi != pfrom->mapRequests.end())
2254 tracker = (*mi).second;
2255 pfrom->mapRequests.erase(mi);
2258 if (!tracker.IsNull())
2259 tracker.fn(tracker.param1, vRecv);
2263 else if (strCommand == "ping")
2268 else if (strCommand == "alert")
2273 if (alert.ProcessAlert())
2276 pfrom->setKnown.insert(alert.GetHash());
2277 CRITICAL_BLOCK(cs_vNodes)
2278 BOOST_FOREACH(CNode* pnode, vNodes)
2279 alert.RelayTo(pnode);
2286 // Ignore unknown commands for extensibility
2290 // Update the last seen time for this node's address
2291 if (pfrom->fNetworkNode)
2292 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2293 AddressCurrentlyConnected(pfrom->addr);
2299 bool ProcessMessages(CNode* pfrom)
2301 CDataStream& vRecv = pfrom->vRecv;
2305 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2309 // (4) message start
2318 // Scan for message start
2319 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2320 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2321 if (vRecv.end() - pstart < nHeaderSize)
2323 if (vRecv.size() > nHeaderSize)
2325 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2326 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2330 if (pstart - vRecv.begin() > 0)
2331 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2332 vRecv.erase(vRecv.begin(), pstart);
2335 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2340 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2343 string strCommand = hdr.GetCommand();
2346 unsigned int nMessageSize = hdr.nMessageSize;
2347 if (nMessageSize > MAX_SIZE)
2349 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2352 if (nMessageSize > vRecv.size())
2354 // Rewind and wait for rest of message
2355 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2360 if (vRecv.GetVersion() >= 209)
2362 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2363 unsigned int nChecksum = 0;
2364 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2365 if (nChecksum != hdr.nChecksum)
2367 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2368 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2373 // Copy message to its own buffer
2374 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2375 vRecv.ignore(nMessageSize);
2381 CRITICAL_BLOCK(cs_main)
2382 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2386 catch (std::ios_base::failure& e)
2388 if (strstr(e.what(), "end of data"))
2390 // Allow exceptions from underlength message on vRecv
2391 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());
2393 else if (strstr(e.what(), "size too large"))
2395 // Allow exceptions from overlong size
2396 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2400 PrintExceptionContinue(&e, "ProcessMessage()");
2403 catch (std::exception& e) {
2404 PrintExceptionContinue(&e, "ProcessMessage()");
2406 PrintExceptionContinue(NULL, "ProcessMessage()");
2410 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2418 bool SendMessages(CNode* pto, bool fSendTrickle)
2420 CRITICAL_BLOCK(cs_main)
2422 // Don't send anything until we get their version message
2423 if (pto->nVersion == 0)
2427 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2428 pto->PushMessage("ping");
2430 // Resend wallet transactions that haven't gotten in a block yet
2431 ResendWalletTransactions();
2433 // Address refresh broadcast
2434 static int64 nLastRebroadcast;
2435 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2437 nLastRebroadcast = GetTime();
2438 CRITICAL_BLOCK(cs_vNodes)
2440 BOOST_FOREACH(CNode* pnode, vNodes)
2442 // Periodically clear setAddrKnown to allow refresh broadcasts
2443 pnode->setAddrKnown.clear();
2445 // Rebroadcast our address
2446 if (addrLocalHost.IsRoutable() && !fUseProxy)
2448 CAddress addr(addrLocalHost);
2449 addr.nTime = GetAdjustedTime();
2450 pnode->PushAddress(addr);
2456 // Clear out old addresses periodically so it's not too much work at once
2457 static int64 nLastClear;
2458 if (nLastClear == 0)
2459 nLastClear = GetTime();
2460 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2462 nLastClear = GetTime();
2463 CRITICAL_BLOCK(cs_mapAddresses)
2466 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2467 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2468 mi != mapAddresses.end();)
2470 const CAddress& addr = (*mi).second;
2471 if (addr.nTime < nSince)
2473 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2475 addrdb.EraseAddress(addr);
2476 mapAddresses.erase(mi++);
2490 vector<CAddress> vAddr;
2491 vAddr.reserve(pto->vAddrToSend.size());
2492 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2494 // returns true if wasn't already contained in the set
2495 if (pto->setAddrKnown.insert(addr).second)
2497 vAddr.push_back(addr);
2498 // receiver rejects addr messages larger than 1000
2499 if (vAddr.size() >= 1000)
2501 pto->PushMessage("addr", vAddr);
2506 pto->vAddrToSend.clear();
2508 pto->PushMessage("addr", vAddr);
2513 // Message: inventory
2516 vector<CInv> vInvWait;
2517 CRITICAL_BLOCK(pto->cs_inventory)
2519 vInv.reserve(pto->vInventoryToSend.size());
2520 vInvWait.reserve(pto->vInventoryToSend.size());
2521 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2523 if (pto->setInventoryKnown.count(inv))
2526 // trickle out tx inv to protect privacy
2527 if (inv.type == MSG_TX && !fSendTrickle)
2529 // 1/4 of tx invs blast to all immediately
2530 static uint256 hashSalt;
2532 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2533 uint256 hashRand = inv.hash ^ hashSalt;
2534 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2535 bool fTrickleWait = ((hashRand & 3) != 0);
2537 // always trickle our own transactions
2541 if (GetTransaction(inv.hash, wtx))
2543 fTrickleWait = true;
2548 vInvWait.push_back(inv);
2553 // returns true if wasn't already contained in the set
2554 if (pto->setInventoryKnown.insert(inv).second)
2556 vInv.push_back(inv);
2557 if (vInv.size() >= 1000)
2559 pto->PushMessage("inv", vInv);
2564 pto->vInventoryToSend = vInvWait;
2567 pto->PushMessage("inv", vInv);
2573 vector<CInv> vGetData;
2574 int64 nNow = GetTime() * 1000000;
2576 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2578 const CInv& inv = (*pto->mapAskFor.begin()).second;
2579 if (!AlreadyHave(txdb, inv))
2581 printf("sending getdata: %s\n", inv.ToString().c_str());
2582 vGetData.push_back(inv);
2583 if (vGetData.size() >= 1000)
2585 pto->PushMessage("getdata", vGetData);
2589 mapAlreadyAskedFor[inv] = nNow;
2590 pto->mapAskFor.erase(pto->mapAskFor.begin());
2592 if (!vGetData.empty())
2593 pto->PushMessage("getdata", vGetData);
2612 //////////////////////////////////////////////////////////////////////////////
2617 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2619 unsigned char* pdata = (unsigned char*)pbuffer;
2620 unsigned int blocks = 1 + ((len + 8) / 64);
2621 unsigned char* pend = pdata + 64 * blocks;
2622 memset(pdata + len, 0, 64 * blocks - len);
2624 unsigned int bits = len * 8;
2625 pend[-1] = (bits >> 0) & 0xff;
2626 pend[-2] = (bits >> 8) & 0xff;
2627 pend[-3] = (bits >> 16) & 0xff;
2628 pend[-4] = (bits >> 24) & 0xff;
2632 using CryptoPP::ByteReverse;
2634 static const unsigned int pSHA256InitState[8] =
2635 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2637 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2639 memcpy(pstate, pinit, 32);
2640 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2644 // ScanHash scans nonces looking for a hash with at least some zero bits.
2645 // It operates on big endian data. Caller does the byte reversing.
2646 // All input buffers are 16-byte aligned. nNonce is usually preserved
2647 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2648 // the block is rebuilt and nNonce starts over at zero.
2650 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2652 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2656 // Hash pdata using pmidstate as the starting state into
2657 // preformatted buffer phash1, then hash phash1 into phash
2659 SHA256Transform(phash1, pdata, pmidstate);
2660 SHA256Transform(phash, phash1, pSHA256InitState);
2662 // Return the nonce if the hash has at least some zero bits,
2663 // caller will check if it has enough to reach the target
2664 if (((unsigned short*)phash)[14] == 0)
2667 // If nothing found after trying for a while, return -1
2668 if ((nNonce & 0xffff) == 0)
2670 nHashesDone = 0xffff+1;
2676 // Some explaining would be appreciated
2681 set<uint256> setDependsOn;
2684 COrphan(CTransaction* ptxIn)
2692 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2693 BOOST_FOREACH(uint256 hash, setDependsOn)
2694 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2699 CBlock* CreateNewBlock(CReserveKey& reservekey)
2701 CBlockIndex* pindexPrev = pindexBest;
2704 auto_ptr<CBlock> pblock(new CBlock());
2708 // Create coinbase tx
2710 txNew.vin.resize(1);
2711 txNew.vin[0].prevout.SetNull();
2712 txNew.vout.resize(1);
2713 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2715 // Add our coinbase tx as first transaction
2716 pblock->vtx.push_back(txNew);
2718 // Collect memory pool transactions into the block
2720 CRITICAL_BLOCK(cs_main)
2721 CRITICAL_BLOCK(cs_mapTransactions)
2725 // Priority order to process transactions
2726 list<COrphan> vOrphan; // list memory doesn't move
2727 map<uint256, vector<COrphan*> > mapDependers;
2728 multimap<double, CTransaction*> mapPriority;
2729 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2731 CTransaction& tx = (*mi).second;
2732 if (tx.IsCoinBase() || !tx.IsFinal())
2735 COrphan* porphan = NULL;
2736 double dPriority = 0;
2737 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2739 // Read prev transaction
2740 CTransaction txPrev;
2742 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2744 // Has to wait for dependencies
2747 // Use list for automatic deletion
2748 vOrphan.push_back(COrphan(&tx));
2749 porphan = &vOrphan.back();
2751 mapDependers[txin.prevout.hash].push_back(porphan);
2752 porphan->setDependsOn.insert(txin.prevout.hash);
2755 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2757 // Read block header
2758 int nConf = txindex.GetDepthInMainChain();
2760 dPriority += (double)nValueIn * nConf;
2762 if (fDebug && GetBoolArg("-printpriority"))
2763 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2766 // Priority is sum(valuein * age) / txsize
2767 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2770 porphan->dPriority = dPriority;
2772 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2774 if (fDebug && GetBoolArg("-printpriority"))
2776 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2783 // Collect transactions into block
2784 map<uint256, CTxIndex> mapTestPool;
2785 uint64 nBlockSize = 1000;
2786 int nBlockSigOps = 100;
2787 while (!mapPriority.empty())
2789 // Take highest priority transaction off priority queue
2790 double dPriority = -(*mapPriority.begin()).first;
2791 CTransaction& tx = *(*mapPriority.begin()).second;
2792 mapPriority.erase(mapPriority.begin());
2795 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2796 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2798 int nTxSigOps = tx.GetSigOpCount();
2799 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2802 // Transaction fee required depends on block size
2803 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2804 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2806 // Connecting shouldn't fail due to dependency on other memory pool transactions
2807 // because we're already processing them in order of dependency
2808 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2809 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2811 swap(mapTestPool, mapTestPoolTmp);
2814 pblock->vtx.push_back(tx);
2815 nBlockSize += nTxSize;
2816 nBlockSigOps += nTxSigOps;
2818 // Add transactions that depend on this one to the priority queue
2819 uint256 hash = tx.GetHash();
2820 if (mapDependers.count(hash))
2822 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2824 if (!porphan->setDependsOn.empty())
2826 porphan->setDependsOn.erase(hash);
2827 if (porphan->setDependsOn.empty())
2828 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2834 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2837 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2838 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2839 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2840 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
2843 return pblock.release();
2847 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2849 // Update nExtraNonce
2850 static uint256 hashPrevBlock;
2851 if (hashPrevBlock != pblock->hashPrevBlock)
2854 hashPrevBlock = pblock->hashPrevBlock;
2857 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2858 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2862 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2865 // Prebuild hash buffers
2872 uint256 hashPrevBlock;
2873 uint256 hashMerkleRoot;
2876 unsigned int nNonce;
2879 unsigned char pchPadding0[64];
2881 unsigned char pchPadding1[64];
2884 memset(&tmp, 0, sizeof(tmp));
2886 tmp.block.nVersion = pblock->nVersion;
2887 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2888 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2889 tmp.block.nTime = pblock->nTime;
2890 tmp.block.nBits = pblock->nBits;
2891 tmp.block.nNonce = pblock->nNonce;
2893 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2894 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2896 // Byte swap all the input buffer
2897 for (int i = 0; i < sizeof(tmp)/4; i++)
2898 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2900 // Precalc the first half of the first hash, which stays constant
2901 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2903 memcpy(pdata, &tmp.block, 128);
2904 memcpy(phash1, &tmp.hash1, 64);
2908 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2910 uint256 hash = pblock->GetHash();
2911 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2913 if (hash > hashTarget)
2917 printf("BitcoinMiner:\n");
2918 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2920 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2921 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2924 CRITICAL_BLOCK(cs_main)
2926 if (pblock->hashPrevBlock != hashBestChain)
2927 return error("BitcoinMiner : generated block is stale");
2929 // Remove key from key pool
2930 reservekey.KeepKey();
2932 // Track how many getdata requests this block gets
2933 CRITICAL_BLOCK(wallet.cs_wallet)
2934 wallet.mapRequestCount[pblock->GetHash()] = 0;
2936 // Process this block the same as if we had received it from another node
2937 if (!ProcessBlock(NULL, pblock))
2938 return error("BitcoinMiner : ProcessBlock, block not accepted");
2945 void static ThreadBitcoinMiner(void* parg);
2947 void static BitcoinMiner(CWallet *pwallet)
2949 printf("BitcoinMiner started\n");
2950 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2952 // Each thread has its own key and counter
2953 CReserveKey reservekey(pwallet);
2954 unsigned int nExtraNonce = 0;
2956 while (fGenerateBitcoins)
2958 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2962 while (vNodes.empty() || IsInitialBlockDownload())
2967 if (!fGenerateBitcoins)
2975 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2976 CBlockIndex* pindexPrev = pindexBest;
2978 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2981 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2983 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2987 // Prebuild hash buffers
2989 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2990 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2991 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2993 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2995 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2996 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3002 int64 nStart = GetTime();
3003 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3005 uint256& hash = *alignup<16>(hashbuf);
3008 unsigned int nHashesDone = 0;
3009 unsigned int nNonceFound;
3012 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3013 (char*)&hash, nHashesDone);
3015 // Check if something found
3016 if (nNonceFound != -1)
3018 for (int i = 0; i < sizeof(hash)/4; i++)
3019 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3021 if (hash <= hashTarget)
3024 pblock->nNonce = ByteReverse(nNonceFound);
3025 assert(hash == pblock->GetHash());
3027 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3028 CheckWork(pblock.get(), *pwalletMain, reservekey);
3029 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3035 static int64 nHashCounter;
3036 if (nHPSTimerStart == 0)
3038 nHPSTimerStart = GetTimeMillis();
3042 nHashCounter += nHashesDone;
3043 if (GetTimeMillis() - nHPSTimerStart > 4000)
3045 static CCriticalSection cs;
3048 if (GetTimeMillis() - nHPSTimerStart > 4000)
3050 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3051 nHPSTimerStart = GetTimeMillis();
3053 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3054 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3055 static int64 nLogTime;
3056 if (GetTime() - nLogTime > 30 * 60)
3058 nLogTime = GetTime();
3059 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3060 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3066 // Check for stop or if block needs to be rebuilt
3069 if (!fGenerateBitcoins)
3071 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3075 if (nBlockNonce >= 0xffff0000)
3077 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3079 if (pindexPrev != pindexBest)
3082 // Update nTime every few seconds
3083 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3084 nBlockTime = ByteReverse(pblock->nTime);
3089 void static ThreadBitcoinMiner(void* parg)
3091 CWallet* pwallet = (CWallet*)parg;
3094 vnThreadsRunning[3]++;
3095 BitcoinMiner(pwallet);
3096 vnThreadsRunning[3]--;
3098 catch (std::exception& e) {
3099 vnThreadsRunning[3]--;
3100 PrintException(&e, "ThreadBitcoinMiner()");
3102 vnThreadsRunning[3]--;
3103 PrintException(NULL, "ThreadBitcoinMiner()");
3105 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3107 if (vnThreadsRunning[3] == 0)
3109 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3113 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3115 if (fGenerateBitcoins != fGenerate)
3117 fGenerateBitcoins = fGenerate;
3118 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3121 if (fGenerateBitcoins)
3123 int nProcessors = boost::thread::hardware_concurrency();
3124 printf("%d processors\n", nProcessors);
3125 if (nProcessors < 1)
3127 if (fLimitProcessors && nProcessors > nLimitProcessors)
3128 nProcessors = nLimitProcessors;
3129 int nAddThreads = nProcessors - vnThreadsRunning[3];
3130 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3131 for (int i = 0; i < nAddThreads; i++)
3133 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3134 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");