1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
9 #include <boost/filesystem.hpp>
10 #include <boost/filesystem/fstream.hpp>
13 using namespace boost;
19 CCriticalSection cs_setpwalletRegistered;
20 set<CWallet*> setpwalletRegistered;
22 CCriticalSection cs_main;
24 static map<uint256, CTransaction> mapTransactions;
25 CCriticalSection cs_mapTransactions;
26 unsigned int nTransactionsUpdated = 0;
27 map<COutPoint, CInPoint> mapNextTx;
29 map<uint256, CBlockIndex*> mapBlockIndex;
30 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
31 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
32 const int nTotalBlocksEstimate = 140700; // Conservative estimate of total nr of blocks on main chain
33 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
34 CBlockIndex* pindexGenesisBlock = NULL;
36 CBigNum bnBestChainWork = 0;
37 CBigNum bnBestInvalidWork = 0;
38 uint256 hashBestChain = 0;
39 CBlockIndex* pindexBest = NULL;
40 int64 nTimeBestReceived = 0;
42 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
44 map<uint256, CBlock*> mapOrphanBlocks;
45 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
47 map<uint256, CDataStream*> mapOrphanTransactions;
48 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
55 int fGenerateBitcoins = false;
56 int64 nTransactionFee = 0;
57 int fLimitProcessors = false;
58 int nLimitProcessors = 1;
59 int fMinimizeToTray = true;
60 int fMinimizeOnClose = true;
68 //////////////////////////////////////////////////////////////////////////////
70 // dispatching functions
73 void RegisterWallet(CWallet* pwalletIn)
75 CRITICAL_BLOCK(cs_setpwalletRegistered)
77 setpwalletRegistered.insert(pwalletIn);
81 void UnregisterWallet(CWallet* pwalletIn)
83 CRITICAL_BLOCK(cs_setpwalletRegistered)
85 setpwalletRegistered.erase(pwalletIn);
89 bool static IsFromMe(CTransaction& tx)
91 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
92 if (pwallet->IsFromMe(tx))
97 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
99 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
100 if (pwallet->GetTransaction(hashTx,wtx))
105 void static EraseFromWallets(uint256 hash)
107 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
108 pwallet->EraseFromWallet(hash);
111 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
117 void static SetBestChain(const CBlockLocator& loc)
119 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
120 pwallet->SetBestChain(loc);
123 void static UpdatedTransaction(const uint256& hashTx)
125 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
126 pwallet->UpdatedTransaction(hashTx);
129 void static PrintWallets(const CBlock& block)
131 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
132 pwallet->PrintWallet(block);
135 void static Inventory(const uint256& hash)
137 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
138 pwallet->Inventory(hash);
141 void static ResendWalletTransactions()
143 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
144 pwallet->ResendWalletTransactions();
153 //////////////////////////////////////////////////////////////////////////////
155 // mapOrphanTransactions
158 void static AddOrphanTx(const CDataStream& vMsg)
161 CDataStream(vMsg) >> tx;
162 uint256 hash = tx.GetHash();
163 if (mapOrphanTransactions.count(hash))
165 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
166 BOOST_FOREACH(const CTxIn& txin, tx.vin)
167 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
170 void static EraseOrphanTx(uint256 hash)
172 if (!mapOrphanTransactions.count(hash))
174 const CDataStream* pvMsg = mapOrphanTransactions[hash];
176 CDataStream(*pvMsg) >> tx;
177 BOOST_FOREACH(const CTxIn& txin, tx.vin)
179 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
180 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
182 if ((*mi).second == pvMsg)
183 mapOrphanTransactionsByPrev.erase(mi++);
189 mapOrphanTransactions.erase(hash);
199 //////////////////////////////////////////////////////////////////////////////
201 // CTransaction and CTxIndex
204 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
207 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
209 if (!ReadFromDisk(txindexRet.pos))
211 if (prevout.n >= vout.size())
219 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
222 return ReadFromDisk(txdb, prevout, txindex);
225 bool CTransaction::ReadFromDisk(COutPoint prevout)
229 return ReadFromDisk(txdb, prevout, txindex);
234 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
246 // Load the block this tx is in
248 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
250 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
255 // Update the tx's hashBlock
256 hashBlock = pblock->GetHash();
258 // Locate the transaction
259 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
260 if (pblock->vtx[nIndex] == *(CTransaction*)this)
262 if (nIndex == pblock->vtx.size())
264 vMerkleBranch.clear();
266 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
270 // Fill in merkle branch
271 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
274 // Is the tx in a block that's in the main chain
275 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
276 if (mi == mapBlockIndex.end())
278 CBlockIndex* pindex = (*mi).second;
279 if (!pindex || !pindex->IsInMainChain())
282 return pindexBest->nHeight - pindex->nHeight + 1;
291 bool CTransaction::CheckTransaction() const
293 // Basic checks that don't depend on any context
295 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
297 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
299 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
300 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
302 // Check for negative or overflow output values
304 BOOST_FOREACH(const CTxOut& txout, vout)
306 if (txout.nValue < 0)
307 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
308 if (txout.nValue > MAX_MONEY)
309 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
310 nValueOut += txout.nValue;
311 if (!MoneyRange(nValueOut))
312 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
315 // Check for duplicate inputs
316 set<COutPoint> vInOutPoints;
317 BOOST_FOREACH(const CTxIn& txin, vin)
319 if (vInOutPoints.count(txin.prevout))
321 vInOutPoints.insert(txin.prevout);
326 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
327 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
331 BOOST_FOREACH(const CTxIn& txin, vin)
332 if (txin.prevout.IsNull())
333 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
339 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
342 *pfMissingInputs = false;
344 if (!CheckTransaction())
345 return error("AcceptToMemoryPool() : CheckTransaction failed");
347 // Coinbase is only valid in a block, not as a loose transaction
349 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
351 // To help v0.1.5 clients who would see it as a negative number
352 if ((int64)nLockTime > INT_MAX)
353 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
356 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
357 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
358 // attacks disallow transactions with more than one SigOp per 34 bytes.
359 // 34 bytes because a TxOut is:
360 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
361 if (GetSigOpCount() > nSize / 34 || nSize < 100)
362 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
364 // Rather not work on nonstandard transactions (unless -testnet)
365 if (!fTestNet && !IsStandard())
366 return error("AcceptToMemoryPool() : nonstandard transaction type");
368 // Do we already have it?
369 uint256 hash = GetHash();
370 CRITICAL_BLOCK(cs_mapTransactions)
371 if (mapTransactions.count(hash))
374 if (txdb.ContainsTx(hash))
377 // Check for conflicts with in-memory transactions
378 CTransaction* ptxOld = NULL;
379 for (int i = 0; i < vin.size(); i++)
381 COutPoint outpoint = vin[i].prevout;
382 if (mapNextTx.count(outpoint))
384 // Disable replacement feature for now
387 // Allow replacing with a newer version of the same transaction
390 ptxOld = mapNextTx[outpoint].ptx;
391 if (ptxOld->IsFinal())
393 if (!IsNewerThan(*ptxOld))
395 for (int i = 0; i < vin.size(); i++)
397 COutPoint outpoint = vin[i].prevout;
398 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
407 // Check against previous transactions
408 map<uint256, CTxIndex> mapUnused;
410 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
413 *pfMissingInputs = true;
414 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
417 // Don't accept it if it can't get into a block
418 if (nFees < GetMinFee(1000, true, true))
419 return error("AcceptToMemoryPool() : not enough fees");
421 // Continuously rate-limit free transactions
422 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
423 // be annoying or make other's transactions take longer to confirm.
424 if (nFees < MIN_RELAY_TX_FEE)
426 static CCriticalSection cs;
427 static double dFreeCount;
428 static int64 nLastTime;
429 int64 nNow = GetTime();
433 // Use an exponentially decaying ~10-minute window:
434 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
436 // -limitfreerelay unit is thousand-bytes-per-minute
437 // At default rate it would take over a month to fill 1GB
438 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
439 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
441 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
447 // Store transaction in memory
448 CRITICAL_BLOCK(cs_mapTransactions)
452 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
453 ptxOld->RemoveFromMemoryPool();
455 AddToMemoryPoolUnchecked();
458 ///// are we sure this is ok when loading transactions or restoring block txes
459 // If updated, erase old tx from wallet
461 EraseFromWallets(ptxOld->GetHash());
463 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
467 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
470 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
473 bool CTransaction::AddToMemoryPoolUnchecked()
475 // Add to memory pool without checking anything. Don't call this directly,
476 // call AcceptToMemoryPool to properly check the transaction first.
477 CRITICAL_BLOCK(cs_mapTransactions)
479 uint256 hash = GetHash();
480 mapTransactions[hash] = *this;
481 for (int i = 0; i < vin.size(); i++)
482 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
483 nTransactionsUpdated++;
489 bool CTransaction::RemoveFromMemoryPool()
491 // Remove transaction from memory pool
492 CRITICAL_BLOCK(cs_mapTransactions)
494 BOOST_FOREACH(const CTxIn& txin, vin)
495 mapNextTx.erase(txin.prevout);
496 mapTransactions.erase(GetHash());
497 nTransactionsUpdated++;
507 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
509 if (hashBlock == 0 || nIndex == -1)
512 // Find the block it claims to be in
513 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
514 if (mi == mapBlockIndex.end())
516 CBlockIndex* pindex = (*mi).second;
517 if (!pindex || !pindex->IsInMainChain())
520 // Make sure the merkle branch connects to this block
521 if (!fMerkleVerified)
523 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
525 fMerkleVerified = true;
528 nHeightRet = pindex->nHeight;
529 return pindexBest->nHeight - pindex->nHeight + 1;
533 int CMerkleTx::GetBlocksToMaturity() const
537 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
541 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
545 if (!IsInMainChain() && !ClientConnectInputs())
547 return CTransaction::AcceptToMemoryPool(txdb, false);
551 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
555 bool CMerkleTx::AcceptToMemoryPool()
558 return AcceptToMemoryPool(txdb);
563 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
565 CRITICAL_BLOCK(cs_mapTransactions)
567 // Add previous supporting transactions first
568 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
570 if (!tx.IsCoinBase())
572 uint256 hash = tx.GetHash();
573 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
574 tx.AcceptToMemoryPool(txdb, fCheckInputs);
577 return AcceptToMemoryPool(txdb, fCheckInputs);
582 bool CWalletTx::AcceptWalletTransaction()
585 return AcceptWalletTransaction(txdb);
588 int CTxIndex::GetDepthInMainChain() const
592 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
594 // Find the block in the index
595 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
596 if (mi == mapBlockIndex.end())
598 CBlockIndex* pindex = (*mi).second;
599 if (!pindex || !pindex->IsInMainChain())
601 return 1 + nBestHeight - pindex->nHeight;
613 //////////////////////////////////////////////////////////////////////////////
615 // CBlock and CBlockIndex
618 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
620 if (!fReadTransactions)
622 *this = pindex->GetBlockHeader();
625 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
627 if (GetHash() != pindex->GetBlockHash())
628 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
632 uint256 static GetOrphanRoot(const CBlock* pblock)
634 // Work back to the first block in the orphan chain
635 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
636 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
637 return pblock->GetHash();
640 int64 static GetBlockValue(int nHeight, int64 nFees)
642 int64 nSubsidy = 50 * COIN;
644 // Subsidy is cut in half every 4 years
645 nSubsidy >>= (nHeight / 210000);
647 return nSubsidy + nFees;
650 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
652 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
653 const int64 nTargetSpacing = 10 * 60;
654 const int64 nInterval = nTargetTimespan / nTargetSpacing;
657 if (pindexLast == NULL)
658 return bnProofOfWorkLimit.GetCompact();
660 // Only change once per interval
661 if ((pindexLast->nHeight+1) % nInterval != 0)
662 return pindexLast->nBits;
664 // Go back by what we want to be 14 days worth of blocks
665 const CBlockIndex* pindexFirst = pindexLast;
666 for (int i = 0; pindexFirst && i < nInterval-1; i++)
667 pindexFirst = pindexFirst->pprev;
670 // Limit adjustment step
671 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
672 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
673 if (nActualTimespan < nTargetTimespan/4)
674 nActualTimespan = nTargetTimespan/4;
675 if (nActualTimespan > nTargetTimespan*4)
676 nActualTimespan = nTargetTimespan*4;
680 bnNew.SetCompact(pindexLast->nBits);
681 bnNew *= nActualTimespan;
682 bnNew /= nTargetTimespan;
684 if (bnNew > bnProofOfWorkLimit)
685 bnNew = bnProofOfWorkLimit;
688 printf("GetNextWorkRequired RETARGET\n");
689 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
690 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
691 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
693 return bnNew.GetCompact();
696 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
699 bnTarget.SetCompact(nBits);
702 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
703 return error("CheckProofOfWork() : nBits below minimum work");
705 // Check proof of work matches claimed amount
706 if (hash > bnTarget.getuint256())
707 return error("CheckProofOfWork() : hash doesn't match nBits");
712 // Return conservative estimate of total number of blocks, 0 if unknown
713 int GetTotalBlocksEstimate()
721 return nTotalBlocksEstimate;
725 // Return maximum amount of blocks that other nodes claim to have
726 int GetNumBlocksOfPeers()
728 return std::max(cPeerBlockCounts.median(), GetTotalBlocksEstimate());
731 bool IsInitialBlockDownload()
733 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
735 static int64 nLastUpdate;
736 static CBlockIndex* pindexLastBest;
737 if (pindexBest != pindexLastBest)
739 pindexLastBest = pindexBest;
740 nLastUpdate = GetTime();
742 return (GetTime() - nLastUpdate < 10 &&
743 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
746 void static InvalidChainFound(CBlockIndex* pindexNew)
748 if (pindexNew->bnChainWork > bnBestInvalidWork)
750 bnBestInvalidWork = pindexNew->bnChainWork;
751 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
754 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());
755 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
756 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
757 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
770 bool CTransaction::DisconnectInputs(CTxDB& txdb)
772 // Relinquish previous transactions' spent pointers
775 BOOST_FOREACH(const CTxIn& txin, vin)
777 COutPoint prevout = txin.prevout;
779 // Get prev txindex from disk
781 if (!txdb.ReadTxIndex(prevout.hash, txindex))
782 return error("DisconnectInputs() : ReadTxIndex failed");
784 if (prevout.n >= txindex.vSpent.size())
785 return error("DisconnectInputs() : prevout.n out of range");
787 // Mark outpoint as not spent
788 txindex.vSpent[prevout.n].SetNull();
791 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
792 return error("DisconnectInputs() : UpdateTxIndex failed");
796 // Remove transaction from index
797 if (!txdb.EraseTxIndex(*this))
798 return error("DisconnectInputs() : EraseTxPos failed");
804 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
805 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
807 // Take over previous transactions' spent pointers
808 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
809 // fMiner is true when called from the internal bitcoin miner
810 // ... both are false when called from CTransaction::AcceptToMemoryPool
814 for (int i = 0; i < vin.size(); i++)
816 COutPoint prevout = vin[i].prevout;
821 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
823 // Get txindex from current proposed changes
824 txindex = mapTestPool[prevout.hash];
828 // Read txindex from txdb
829 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
831 if (!fFound && (fBlock || fMiner))
832 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());
836 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
838 // Get prev tx from single transactions in memory
839 CRITICAL_BLOCK(cs_mapTransactions)
841 if (!mapTransactions.count(prevout.hash))
842 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
843 txPrev = mapTransactions[prevout.hash];
846 txindex.vSpent.resize(txPrev.vout.size());
850 // Get prev tx from disk
851 if (!txPrev.ReadFromDisk(txindex.pos))
852 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
855 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
856 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
858 // If prev is coinbase, check that it's matured
859 if (txPrev.IsCoinBase())
860 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
861 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
862 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
864 // Skip ECDSA signature verification when connecting blocks (fBlock=true) during initial download
865 // (before the last blockchain checkpoint). This is safe because block merkle hashes are
866 // still computed and checked, and any change will be caught at the next checkpoint.
867 if (!(fBlock && IsInitialBlockDownload()))
869 if (!VerifySignature(txPrev, *this, i))
870 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
872 // Check for conflicts (double-spend)
873 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
874 // for an attacker to attempt to split the network.
875 if (!txindex.vSpent[prevout.n].IsNull())
876 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());
878 // Check for negative or overflow input values
879 nValueIn += txPrev.vout[prevout.n].nValue;
880 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
881 return DoS(100, error("ConnectInputs() : txin values out of range"));
883 // Mark outpoints as spent
884 txindex.vSpent[prevout.n] = posThisTx;
887 if (fBlock || fMiner)
889 mapTestPool[prevout.hash] = txindex;
893 if (nValueIn < GetValueOut())
894 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
896 // Tally transaction fees
897 int64 nTxFee = nValueIn - GetValueOut();
899 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
900 if (nTxFee < nMinFee)
903 if (!MoneyRange(nFees))
904 return DoS(100, error("ConnectInputs() : nFees out of range"));
909 // Add transaction to changes
910 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
914 // Add transaction to test pool
915 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
922 bool CTransaction::ClientConnectInputs()
927 // Take over previous transactions' spent pointers
928 CRITICAL_BLOCK(cs_mapTransactions)
931 for (int i = 0; i < vin.size(); i++)
933 // Get prev tx from single transactions in memory
934 COutPoint prevout = vin[i].prevout;
935 if (!mapTransactions.count(prevout.hash))
937 CTransaction& txPrev = mapTransactions[prevout.hash];
939 if (prevout.n >= txPrev.vout.size())
943 if (!VerifySignature(txPrev, *this, i))
944 return error("ConnectInputs() : VerifySignature failed");
946 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
947 ///// this has to go away now that posNext is gone
948 // // Check for conflicts
949 // if (!txPrev.vout[prevout.n].posNext.IsNull())
950 // return error("ConnectInputs() : prev tx already used");
952 // // Flag outpoints as used
953 // txPrev.vout[prevout.n].posNext = posThisTx;
955 nValueIn += txPrev.vout[prevout.n].nValue;
957 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
958 return error("ClientConnectInputs() : txin values out of range");
960 if (GetValueOut() > nValueIn)
970 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
972 // Disconnect in reverse order
973 for (int i = vtx.size()-1; i >= 0; i--)
974 if (!vtx[i].DisconnectInputs(txdb))
977 // Update block index on disk without changing it in memory.
978 // The memory index structure will be changed after the db commits.
981 CDiskBlockIndex blockindexPrev(pindex->pprev);
982 blockindexPrev.hashNext = 0;
983 if (!txdb.WriteBlockIndex(blockindexPrev))
984 return error("DisconnectBlock() : WriteBlockIndex failed");
990 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
992 // Check it again in case a previous version let a bad block in
996 //// issue here: it doesn't know the version
997 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
999 map<uint256, CTxIndex> mapQueuedChanges;
1001 BOOST_FOREACH(CTransaction& tx, vtx)
1003 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1004 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1006 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1009 // Write queued txindex changes
1010 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1012 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1013 return error("ConnectBlock() : UpdateTxIndex failed");
1016 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1019 // Update block index on disk without changing it in memory.
1020 // The memory index structure will be changed after the db commits.
1023 CDiskBlockIndex blockindexPrev(pindex->pprev);
1024 blockindexPrev.hashNext = pindex->GetBlockHash();
1025 if (!txdb.WriteBlockIndex(blockindexPrev))
1026 return error("ConnectBlock() : WriteBlockIndex failed");
1029 // Watch for transactions paying to me
1030 BOOST_FOREACH(CTransaction& tx, vtx)
1031 SyncWithWallets(tx, this, true);
1036 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1038 printf("REORGANIZE\n");
1041 CBlockIndex* pfork = pindexBest;
1042 CBlockIndex* plonger = pindexNew;
1043 while (pfork != plonger)
1045 while (plonger->nHeight > pfork->nHeight)
1046 if (!(plonger = plonger->pprev))
1047 return error("Reorganize() : plonger->pprev is null");
1048 if (pfork == plonger)
1050 if (!(pfork = pfork->pprev))
1051 return error("Reorganize() : pfork->pprev is null");
1054 // List of what to disconnect
1055 vector<CBlockIndex*> vDisconnect;
1056 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1057 vDisconnect.push_back(pindex);
1059 // List of what to connect
1060 vector<CBlockIndex*> vConnect;
1061 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1062 vConnect.push_back(pindex);
1063 reverse(vConnect.begin(), vConnect.end());
1065 // Disconnect shorter branch
1066 vector<CTransaction> vResurrect;
1067 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1070 if (!block.ReadFromDisk(pindex))
1071 return error("Reorganize() : ReadFromDisk for disconnect failed");
1072 if (!block.DisconnectBlock(txdb, pindex))
1073 return error("Reorganize() : DisconnectBlock failed");
1075 // Queue memory transactions to resurrect
1076 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1077 if (!tx.IsCoinBase())
1078 vResurrect.push_back(tx);
1081 // Connect longer branch
1082 vector<CTransaction> vDelete;
1083 for (int i = 0; i < vConnect.size(); i++)
1085 CBlockIndex* pindex = vConnect[i];
1087 if (!block.ReadFromDisk(pindex))
1088 return error("Reorganize() : ReadFromDisk for connect failed");
1089 if (!block.ConnectBlock(txdb, pindex))
1093 return error("Reorganize() : ConnectBlock failed");
1096 // Queue memory transactions to delete
1097 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1098 vDelete.push_back(tx);
1100 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1101 return error("Reorganize() : WriteHashBestChain failed");
1103 // Make sure it's successfully written to disk before changing memory structure
1104 if (!txdb.TxnCommit())
1105 return error("Reorganize() : TxnCommit failed");
1107 // Disconnect shorter branch
1108 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1110 pindex->pprev->pnext = NULL;
1112 // Connect longer branch
1113 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1115 pindex->pprev->pnext = pindex;
1117 // Resurrect memory transactions that were in the disconnected branch
1118 BOOST_FOREACH(CTransaction& tx, vResurrect)
1119 tx.AcceptToMemoryPool(txdb, false);
1121 // Delete redundant memory transactions that are in the connected branch
1122 BOOST_FOREACH(CTransaction& tx, vDelete)
1123 tx.RemoveFromMemoryPool();
1129 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1131 uint256 hash = GetHash();
1134 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1136 txdb.WriteHashBestChain(hash);
1137 if (!txdb.TxnCommit())
1138 return error("SetBestChain() : TxnCommit failed");
1139 pindexGenesisBlock = pindexNew;
1141 else if (hashPrevBlock == hashBestChain)
1143 // Adding to current best branch
1144 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1147 InvalidChainFound(pindexNew);
1148 return error("SetBestChain() : ConnectBlock failed");
1150 if (!txdb.TxnCommit())
1151 return error("SetBestChain() : TxnCommit failed");
1153 // Add to current best branch
1154 pindexNew->pprev->pnext = pindexNew;
1156 // Delete redundant memory transactions
1157 BOOST_FOREACH(CTransaction& tx, vtx)
1158 tx.RemoveFromMemoryPool();
1163 if (!Reorganize(txdb, pindexNew))
1166 InvalidChainFound(pindexNew);
1167 return error("SetBestChain() : Reorganize failed");
1171 // Update best block in wallet (so we can detect restored wallets)
1172 if (!IsInitialBlockDownload())
1174 const CBlockLocator locator(pindexNew);
1175 ::SetBestChain(locator);
1179 hashBestChain = hash;
1180 pindexBest = pindexNew;
1181 nBestHeight = pindexBest->nHeight;
1182 bnBestChainWork = pindexNew->bnChainWork;
1183 nTimeBestReceived = GetTime();
1184 nTransactionsUpdated++;
1185 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1191 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1193 // Check for duplicate
1194 uint256 hash = GetHash();
1195 if (mapBlockIndex.count(hash))
1196 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1198 // Construct new block index object
1199 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1201 return error("AddToBlockIndex() : new CBlockIndex failed");
1202 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1203 pindexNew->phashBlock = &((*mi).first);
1204 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1205 if (miPrev != mapBlockIndex.end())
1207 pindexNew->pprev = (*miPrev).second;
1208 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1210 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1214 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1215 if (!txdb.TxnCommit())
1219 if (pindexNew->bnChainWork > bnBestChainWork)
1220 if (!SetBestChain(txdb, pindexNew))
1225 if (pindexNew == pindexBest)
1227 // Notify UI to display prev block's coinbase if it was ours
1228 static uint256 hashPrevBestCoinBase;
1229 UpdatedTransaction(hashPrevBestCoinBase);
1230 hashPrevBestCoinBase = vtx[0].GetHash();
1240 bool CBlock::CheckBlock() const
1242 // These are checks that are independent of context
1243 // that can be verified before saving an orphan block.
1246 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1247 return DoS(100, error("CheckBlock() : size limits failed"));
1249 // Check proof of work matches claimed amount
1250 if (!CheckProofOfWork(GetHash(), nBits))
1251 return DoS(50, error("CheckBlock() : proof of work failed"));
1254 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1255 return error("CheckBlock() : block timestamp too far in the future");
1257 // First transaction must be coinbase, the rest must not be
1258 if (vtx.empty() || !vtx[0].IsCoinBase())
1259 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1260 for (int i = 1; i < vtx.size(); i++)
1261 if (vtx[i].IsCoinBase())
1262 return DoS(100, error("CheckBlock() : more than one coinbase"));
1264 // Check transactions
1265 BOOST_FOREACH(const CTransaction& tx, vtx)
1266 if (!tx.CheckTransaction())
1267 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1269 // Check that it's not full of nonstandard transactions
1270 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1271 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1274 if (hashMerkleRoot != BuildMerkleTree())
1275 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1280 bool CBlock::AcceptBlock()
1282 // Check for duplicate
1283 uint256 hash = GetHash();
1284 if (mapBlockIndex.count(hash))
1285 return error("AcceptBlock() : block already in mapBlockIndex");
1287 // Get prev block index
1288 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1289 if (mi == mapBlockIndex.end())
1290 return DoS(10, error("AcceptBlock() : prev block not found"));
1291 CBlockIndex* pindexPrev = (*mi).second;
1292 int nHeight = pindexPrev->nHeight+1;
1294 // Check proof of work
1295 if (nBits != GetNextWorkRequired(pindexPrev))
1296 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1298 // Check timestamp against prev
1299 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1300 return error("AcceptBlock() : block's timestamp is too early");
1302 // Check that all transactions are finalized
1303 BOOST_FOREACH(const CTransaction& tx, vtx)
1304 if (!tx.IsFinal(nHeight, GetBlockTime()))
1305 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1307 // Check that the block chain matches the known block chain up to a checkpoint
1309 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1310 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1311 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1312 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1313 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1314 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1315 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1316 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")) ||
1317 (nHeight == 140700 && hash != uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd")))
1318 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1320 // Write block to history file
1321 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1322 return error("AcceptBlock() : out of disk space");
1323 unsigned int nFile = -1;
1324 unsigned int nBlockPos = 0;
1325 if (!WriteToDisk(nFile, nBlockPos))
1326 return error("AcceptBlock() : WriteToDisk failed");
1327 if (!AddToBlockIndex(nFile, nBlockPos))
1328 return error("AcceptBlock() : AddToBlockIndex failed");
1330 // Relay inventory, but don't relay old inventory during initial block download
1331 if (hashBestChain == hash)
1332 CRITICAL_BLOCK(cs_vNodes)
1333 BOOST_FOREACH(CNode* pnode, vNodes)
1334 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1335 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1340 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1342 // Check for duplicate
1343 uint256 hash = pblock->GetHash();
1344 if (mapBlockIndex.count(hash))
1345 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1346 if (mapOrphanBlocks.count(hash))
1347 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1349 // Preliminary checks
1350 if (!pblock->CheckBlock())
1351 return error("ProcessBlock() : CheckBlock FAILED");
1353 // If don't already have its previous block, shunt it off to holding area until we get it
1354 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1356 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1357 CBlock* pblock2 = new CBlock(*pblock);
1358 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1359 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1361 // Ask this guy to fill in what we're missing
1363 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1368 if (!pblock->AcceptBlock())
1369 return error("ProcessBlock() : AcceptBlock FAILED");
1371 // Recursively process any orphan blocks that depended on this one
1372 vector<uint256> vWorkQueue;
1373 vWorkQueue.push_back(hash);
1374 for (int i = 0; i < vWorkQueue.size(); i++)
1376 uint256 hashPrev = vWorkQueue[i];
1377 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1378 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1381 CBlock* pblockOrphan = (*mi).second;
1382 if (pblockOrphan->AcceptBlock())
1383 vWorkQueue.push_back(pblockOrphan->GetHash());
1384 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1385 delete pblockOrphan;
1387 mapOrphanBlocksByPrev.erase(hashPrev);
1390 printf("ProcessBlock: ACCEPTED\n");
1401 bool CheckDiskSpace(uint64 nAdditionalBytes)
1403 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1405 // Check for 15MB because database could create another 10MB log file at any time
1406 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1409 string strMessage = _("Warning: Disk space is low ");
1410 strMiscWarning = strMessage;
1411 printf("*** %s\n", strMessage.c_str());
1412 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1413 CreateThread(Shutdown, NULL);
1419 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1423 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1426 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1428 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1437 static unsigned int nCurrentBlockFile = 1;
1439 FILE* AppendBlockFile(unsigned int& nFileRet)
1444 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1447 if (fseek(file, 0, SEEK_END) != 0)
1449 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1450 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1452 nFileRet = nCurrentBlockFile;
1456 nCurrentBlockFile++;
1460 bool LoadBlockIndex(bool fAllowNew)
1464 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1465 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1466 pchMessageStart[0] = 0xfa;
1467 pchMessageStart[1] = 0xbf;
1468 pchMessageStart[2] = 0xb5;
1469 pchMessageStart[3] = 0xda;
1476 if (!txdb.LoadBlockIndex())
1481 // Init with genesis block
1483 if (mapBlockIndex.empty())
1489 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1490 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1491 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1492 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1493 // vMerkleTree: 4a5e1e
1496 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1498 txNew.vin.resize(1);
1499 txNew.vout.resize(1);
1500 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1501 txNew.vout[0].nValue = 50 * COIN;
1502 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1504 block.vtx.push_back(txNew);
1505 block.hashPrevBlock = 0;
1506 block.hashMerkleRoot = block.BuildMerkleTree();
1508 block.nTime = 1231006505;
1509 block.nBits = 0x1d00ffff;
1510 block.nNonce = 2083236893;
1514 block.nTime = 1296688602;
1515 block.nBits = 0x1d07fff8;
1516 block.nNonce = 384568319;
1520 printf("%s\n", block.GetHash().ToString().c_str());
1521 printf("%s\n", hashGenesisBlock.ToString().c_str());
1522 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1523 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1525 assert(block.GetHash() == hashGenesisBlock);
1527 // Start new block file
1529 unsigned int nBlockPos;
1530 if (!block.WriteToDisk(nFile, nBlockPos))
1531 return error("LoadBlockIndex() : writing genesis block to disk failed");
1532 if (!block.AddToBlockIndex(nFile, nBlockPos))
1533 return error("LoadBlockIndex() : genesis block not accepted");
1541 void PrintBlockTree()
1543 // precompute tree structure
1544 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1545 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1547 CBlockIndex* pindex = (*mi).second;
1548 mapNext[pindex->pprev].push_back(pindex);
1550 //while (rand() % 3 == 0)
1551 // mapNext[pindex->pprev].push_back(pindex);
1554 vector<pair<int, CBlockIndex*> > vStack;
1555 vStack.push_back(make_pair(0, pindexGenesisBlock));
1558 while (!vStack.empty())
1560 int nCol = vStack.back().first;
1561 CBlockIndex* pindex = vStack.back().second;
1564 // print split or gap
1565 if (nCol > nPrevCol)
1567 for (int i = 0; i < nCol-1; i++)
1571 else if (nCol < nPrevCol)
1573 for (int i = 0; i < nCol; i++)
1580 for (int i = 0; i < nCol; i++)
1585 block.ReadFromDisk(pindex);
1586 printf("%d (%u,%u) %s %s tx %d",
1590 block.GetHash().ToString().substr(0,20).c_str(),
1591 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1594 PrintWallets(block);
1596 // put the main timechain first
1597 vector<CBlockIndex*>& vNext = mapNext[pindex];
1598 for (int i = 0; i < vNext.size(); i++)
1600 if (vNext[i]->pnext)
1602 swap(vNext[0], vNext[i]);
1608 for (int i = 0; i < vNext.size(); i++)
1609 vStack.push_back(make_pair(nCol+i, vNext[i]));
1622 //////////////////////////////////////////////////////////////////////////////
1627 map<uint256, CAlert> mapAlerts;
1628 CCriticalSection cs_mapAlerts;
1630 string GetWarnings(string strFor)
1633 string strStatusBar;
1635 if (GetBoolArg("-testsafemode"))
1638 // Misc warnings like out of disk space and clock is wrong
1639 if (strMiscWarning != "")
1642 strStatusBar = strMiscWarning;
1645 // Longer invalid proof-of-work chain
1646 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1649 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1653 CRITICAL_BLOCK(cs_mapAlerts)
1655 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1657 const CAlert& alert = item.second;
1658 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1660 nPriority = alert.nPriority;
1661 strStatusBar = alert.strStatusBar;
1666 if (strFor == "statusbar")
1667 return strStatusBar;
1668 else if (strFor == "rpc")
1670 assert(!"GetWarnings() : invalid parameter");
1674 bool CAlert::ProcessAlert()
1676 if (!CheckSignature())
1681 CRITICAL_BLOCK(cs_mapAlerts)
1683 // Cancel previous alerts
1684 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1686 const CAlert& alert = (*mi).second;
1689 printf("cancelling alert %d\n", alert.nID);
1690 mapAlerts.erase(mi++);
1692 else if (!alert.IsInEffect())
1694 printf("expiring alert %d\n", alert.nID);
1695 mapAlerts.erase(mi++);
1701 // Check if this alert has been cancelled
1702 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1704 const CAlert& alert = item.second;
1705 if (alert.Cancels(*this))
1707 printf("alert already cancelled by %d\n", alert.nID);
1713 mapAlerts.insert(make_pair(GetHash(), *this));
1716 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1728 //////////////////////////////////////////////////////////////////////////////
1734 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1738 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1739 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1741 // Don't know what it is, just say we already got one
1748 // The message start string is designed to be unlikely to occur in normal data.
1749 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1750 // a large 4-byte int at any alignment.
1751 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1754 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1756 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1757 RandAddSeedPerfmon();
1759 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1760 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1762 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1764 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1772 if (strCommand == "version")
1774 // Each connection can only send one version message
1775 if (pfrom->nVersion != 0)
1777 pfrom->Misbehaving(1);
1785 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1786 if (pfrom->nVersion == 10300)
1787 pfrom->nVersion = 300;
1788 if (pfrom->nVersion >= 106 && !vRecv.empty())
1789 vRecv >> addrFrom >> nNonce;
1790 if (pfrom->nVersion >= 106 && !vRecv.empty())
1791 vRecv >> pfrom->strSubVer;
1792 if (pfrom->nVersion >= 209 && !vRecv.empty())
1793 vRecv >> pfrom->nStartingHeight;
1795 if (pfrom->nVersion == 0)
1798 // Disconnect if we connected to ourself
1799 if (nNonce == nLocalHostNonce && nNonce > 1)
1801 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1802 pfrom->fDisconnect = true;
1806 // Be shy and don't send version until we hear
1807 if (pfrom->fInbound)
1808 pfrom->PushVersion();
1810 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1812 AddTimeData(pfrom->addr.ip, nTime);
1815 if (pfrom->nVersion >= 209)
1816 pfrom->PushMessage("verack");
1817 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1818 if (pfrom->nVersion < 209)
1819 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1821 if (!pfrom->fInbound)
1823 // Advertise our address
1824 if (addrLocalHost.IsRoutable() && !fUseProxy)
1826 CAddress addr(addrLocalHost);
1827 addr.nTime = GetAdjustedTime();
1828 pfrom->PushAddress(addr);
1831 // Get recent addresses
1832 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1834 pfrom->PushMessage("getaddr");
1835 pfrom->fGetAddr = true;
1839 // Ask the first connected node for block updates
1840 static int nAskedForBlocks;
1841 if (!pfrom->fClient &&
1842 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1843 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1846 pfrom->PushGetBlocks(pindexBest, uint256(0));
1850 CRITICAL_BLOCK(cs_mapAlerts)
1851 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1852 item.second.RelayTo(pfrom);
1854 pfrom->fSuccessfullyConnected = true;
1856 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1858 cPeerBlockCounts.input(pfrom->nStartingHeight);
1862 else if (pfrom->nVersion == 0)
1864 // Must have a version message before anything else
1865 pfrom->Misbehaving(1);
1870 else if (strCommand == "verack")
1872 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1876 else if (strCommand == "addr")
1878 vector<CAddress> vAddr;
1881 // Don't want addr from older versions unless seeding
1882 if (pfrom->nVersion < 209)
1884 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1886 if (vAddr.size() > 1000)
1888 pfrom->Misbehaving(20);
1889 return error("message addr size() = %d", vAddr.size());
1892 // Store the new addresses
1895 int64 nNow = GetAdjustedTime();
1896 int64 nSince = nNow - 10 * 60;
1897 BOOST_FOREACH(CAddress& addr, vAddr)
1901 // ignore IPv6 for now, since it isn't implemented anyway
1904 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1905 addr.nTime = nNow - 5 * 24 * 60 * 60;
1906 AddAddress(addr, 2 * 60 * 60, &addrDB);
1907 pfrom->AddAddressKnown(addr);
1908 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1910 // Relay to a limited number of other nodes
1911 CRITICAL_BLOCK(cs_vNodes)
1913 // Use deterministic randomness to send to the same nodes for 24 hours
1914 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1915 static uint256 hashSalt;
1917 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1918 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1919 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1920 multimap<uint256, CNode*> mapMix;
1921 BOOST_FOREACH(CNode* pnode, vNodes)
1923 if (pnode->nVersion < 31402)
1925 unsigned int nPointer;
1926 memcpy(&nPointer, &pnode, sizeof(nPointer));
1927 uint256 hashKey = hashRand ^ nPointer;
1928 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1929 mapMix.insert(make_pair(hashKey, pnode));
1931 int nRelayNodes = 2;
1932 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1933 ((*mi).second)->PushAddress(addr);
1937 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1938 if (vAddr.size() < 1000)
1939 pfrom->fGetAddr = false;
1943 else if (strCommand == "inv")
1947 if (vInv.size() > 50000)
1949 pfrom->Misbehaving(20);
1950 return error("message inv size() = %d", vInv.size());
1954 BOOST_FOREACH(const CInv& inv, vInv)
1958 pfrom->AddInventoryKnown(inv);
1960 bool fAlreadyHave = AlreadyHave(txdb, inv);
1962 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1966 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1967 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1969 // Track requests for our stuff
1970 Inventory(inv.hash);
1975 else if (strCommand == "getdata")
1979 if (vInv.size() > 50000)
1981 pfrom->Misbehaving(20);
1982 return error("message getdata size() = %d", vInv.size());
1985 BOOST_FOREACH(const CInv& inv, vInv)
1989 printf("received getdata for: %s\n", inv.ToString().c_str());
1991 if (inv.type == MSG_BLOCK)
1993 // Send block from disk
1994 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1995 if (mi != mapBlockIndex.end())
1998 block.ReadFromDisk((*mi).second);
1999 pfrom->PushMessage("block", block);
2001 // Trigger them to send a getblocks request for the next batch of inventory
2002 if (inv.hash == pfrom->hashContinue)
2004 // Bypass PushInventory, this must send even if redundant,
2005 // and we want it right after the last block so they don't
2006 // wait for other stuff first.
2008 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2009 pfrom->PushMessage("inv", vInv);
2010 pfrom->hashContinue = 0;
2014 else if (inv.IsKnownType())
2016 // Send stream from relay memory
2017 CRITICAL_BLOCK(cs_mapRelay)
2019 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2020 if (mi != mapRelay.end())
2021 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2025 // Track requests for our stuff
2026 Inventory(inv.hash);
2031 else if (strCommand == "getblocks")
2033 CBlockLocator locator;
2035 vRecv >> locator >> hashStop;
2037 // Find the last block the caller has in the main chain
2038 CBlockIndex* pindex = locator.GetBlockIndex();
2040 // Send the rest of the chain
2042 pindex = pindex->pnext;
2043 int nLimit = 500 + locator.GetDistanceBack();
2044 unsigned int nBytes = 0;
2045 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2046 for (; pindex; pindex = pindex->pnext)
2048 if (pindex->GetBlockHash() == hashStop)
2050 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2053 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2055 block.ReadFromDisk(pindex, true);
2056 nBytes += block.GetSerializeSize(SER_NETWORK);
2057 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2059 // When this block is requested, we'll send an inv that'll make them
2060 // getblocks the next batch of inventory.
2061 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2062 pfrom->hashContinue = pindex->GetBlockHash();
2069 else if (strCommand == "getheaders")
2071 CBlockLocator locator;
2073 vRecv >> locator >> hashStop;
2075 CBlockIndex* pindex = NULL;
2076 if (locator.IsNull())
2078 // If locator is null, return the hashStop block
2079 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2080 if (mi == mapBlockIndex.end())
2082 pindex = (*mi).second;
2086 // Find the last block the caller has in the main chain
2087 pindex = locator.GetBlockIndex();
2089 pindex = pindex->pnext;
2092 vector<CBlock> vHeaders;
2093 int nLimit = 2000 + locator.GetDistanceBack();
2094 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2095 for (; pindex; pindex = pindex->pnext)
2097 vHeaders.push_back(pindex->GetBlockHeader());
2098 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2101 pfrom->PushMessage("headers", vHeaders);
2105 else if (strCommand == "tx")
2107 vector<uint256> vWorkQueue;
2108 CDataStream vMsg(vRecv);
2112 CInv inv(MSG_TX, tx.GetHash());
2113 pfrom->AddInventoryKnown(inv);
2115 bool fMissingInputs = false;
2116 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2118 SyncWithWallets(tx, NULL, true);
2119 RelayMessage(inv, vMsg);
2120 mapAlreadyAskedFor.erase(inv);
2121 vWorkQueue.push_back(inv.hash);
2123 // Recursively process any orphan transactions that depended on this one
2124 for (int i = 0; i < vWorkQueue.size(); i++)
2126 uint256 hashPrev = vWorkQueue[i];
2127 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2128 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2131 const CDataStream& vMsg = *((*mi).second);
2133 CDataStream(vMsg) >> tx;
2134 CInv inv(MSG_TX, tx.GetHash());
2136 if (tx.AcceptToMemoryPool(true))
2138 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2139 SyncWithWallets(tx, NULL, true);
2140 RelayMessage(inv, vMsg);
2141 mapAlreadyAskedFor.erase(inv);
2142 vWorkQueue.push_back(inv.hash);
2147 BOOST_FOREACH(uint256 hash, vWorkQueue)
2148 EraseOrphanTx(hash);
2150 else if (fMissingInputs)
2152 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2155 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2159 else if (strCommand == "block")
2164 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2167 CInv inv(MSG_BLOCK, block.GetHash());
2168 pfrom->AddInventoryKnown(inv);
2170 if (ProcessBlock(pfrom, &block))
2171 mapAlreadyAskedFor.erase(inv);
2172 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2176 else if (strCommand == "getaddr")
2178 // Nodes rebroadcast an addr every 24 hours
2179 pfrom->vAddrToSend.clear();
2180 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2181 CRITICAL_BLOCK(cs_mapAddresses)
2183 unsigned int nCount = 0;
2184 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2186 const CAddress& addr = item.second;
2187 if (addr.nTime > nSince)
2190 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2192 const CAddress& addr = item.second;
2193 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2194 pfrom->PushAddress(addr);
2200 else if (strCommand == "checkorder")
2205 if (!GetBoolArg("-allowreceivebyip"))
2207 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2214 /// we have a chance to check the order here
2216 // Keep giving the same key to the same ip until they use it
2217 if (!mapReuseKey.count(pfrom->addr.ip))
2218 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2220 // Send back approval of order and pubkey to use
2221 CScript scriptPubKey;
2222 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2223 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2227 else if (strCommand == "reply")
2232 CRequestTracker tracker;
2233 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2235 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2236 if (mi != pfrom->mapRequests.end())
2238 tracker = (*mi).second;
2239 pfrom->mapRequests.erase(mi);
2242 if (!tracker.IsNull())
2243 tracker.fn(tracker.param1, vRecv);
2247 else if (strCommand == "ping")
2252 else if (strCommand == "alert")
2257 if (alert.ProcessAlert())
2260 pfrom->setKnown.insert(alert.GetHash());
2261 CRITICAL_BLOCK(cs_vNodes)
2262 BOOST_FOREACH(CNode* pnode, vNodes)
2263 alert.RelayTo(pnode);
2270 // Ignore unknown commands for extensibility
2274 // Update the last seen time for this node's address
2275 if (pfrom->fNetworkNode)
2276 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2277 AddressCurrentlyConnected(pfrom->addr);
2283 bool ProcessMessages(CNode* pfrom)
2285 CDataStream& vRecv = pfrom->vRecv;
2289 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2293 // (4) message start
2302 // Scan for message start
2303 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2304 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2305 if (vRecv.end() - pstart < nHeaderSize)
2307 if (vRecv.size() > nHeaderSize)
2309 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2310 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2314 if (pstart - vRecv.begin() > 0)
2315 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2316 vRecv.erase(vRecv.begin(), pstart);
2319 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2324 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2327 string strCommand = hdr.GetCommand();
2330 unsigned int nMessageSize = hdr.nMessageSize;
2331 if (nMessageSize > MAX_SIZE)
2333 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2336 if (nMessageSize > vRecv.size())
2338 // Rewind and wait for rest of message
2339 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2344 if (vRecv.GetVersion() >= 209)
2346 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2347 unsigned int nChecksum = 0;
2348 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2349 if (nChecksum != hdr.nChecksum)
2351 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2352 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2357 // Copy message to its own buffer
2358 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2359 vRecv.ignore(nMessageSize);
2365 CRITICAL_BLOCK(cs_main)
2366 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2370 catch (std::ios_base::failure& e)
2372 if (strstr(e.what(), "end of data"))
2374 // Allow exceptions from underlength message on vRecv
2375 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2377 else if (strstr(e.what(), "size too large"))
2379 // Allow exceptions from overlong size
2380 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2384 PrintExceptionContinue(&e, "ProcessMessage()");
2387 catch (std::exception& e) {
2388 PrintExceptionContinue(&e, "ProcessMessage()");
2390 PrintExceptionContinue(NULL, "ProcessMessage()");
2394 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2402 bool SendMessages(CNode* pto, bool fSendTrickle)
2404 CRITICAL_BLOCK(cs_main)
2406 // Don't send anything until we get their version message
2407 if (pto->nVersion == 0)
2411 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2412 pto->PushMessage("ping");
2414 // Resend wallet transactions that haven't gotten in a block yet
2415 ResendWalletTransactions();
2417 // Address refresh broadcast
2418 static int64 nLastRebroadcast;
2419 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2421 nLastRebroadcast = GetTime();
2422 CRITICAL_BLOCK(cs_vNodes)
2424 BOOST_FOREACH(CNode* pnode, vNodes)
2426 // Periodically clear setAddrKnown to allow refresh broadcasts
2427 pnode->setAddrKnown.clear();
2429 // Rebroadcast our address
2430 if (addrLocalHost.IsRoutable() && !fUseProxy)
2432 CAddress addr(addrLocalHost);
2433 addr.nTime = GetAdjustedTime();
2434 pnode->PushAddress(addr);
2440 // Clear out old addresses periodically so it's not too much work at once
2441 static int64 nLastClear;
2442 if (nLastClear == 0)
2443 nLastClear = GetTime();
2444 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2446 nLastClear = GetTime();
2447 CRITICAL_BLOCK(cs_mapAddresses)
2450 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2451 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2452 mi != mapAddresses.end();)
2454 const CAddress& addr = (*mi).second;
2455 if (addr.nTime < nSince)
2457 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2459 addrdb.EraseAddress(addr);
2460 mapAddresses.erase(mi++);
2474 vector<CAddress> vAddr;
2475 vAddr.reserve(pto->vAddrToSend.size());
2476 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2478 // returns true if wasn't already contained in the set
2479 if (pto->setAddrKnown.insert(addr).second)
2481 vAddr.push_back(addr);
2482 // receiver rejects addr messages larger than 1000
2483 if (vAddr.size() >= 1000)
2485 pto->PushMessage("addr", vAddr);
2490 pto->vAddrToSend.clear();
2492 pto->PushMessage("addr", vAddr);
2497 // Message: inventory
2500 vector<CInv> vInvWait;
2501 CRITICAL_BLOCK(pto->cs_inventory)
2503 vInv.reserve(pto->vInventoryToSend.size());
2504 vInvWait.reserve(pto->vInventoryToSend.size());
2505 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2507 if (pto->setInventoryKnown.count(inv))
2510 // trickle out tx inv to protect privacy
2511 if (inv.type == MSG_TX && !fSendTrickle)
2513 // 1/4 of tx invs blast to all immediately
2514 static uint256 hashSalt;
2516 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2517 uint256 hashRand = inv.hash ^ hashSalt;
2518 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2519 bool fTrickleWait = ((hashRand & 3) != 0);
2521 // always trickle our own transactions
2525 if (GetTransaction(inv.hash, wtx))
2527 fTrickleWait = true;
2532 vInvWait.push_back(inv);
2537 // returns true if wasn't already contained in the set
2538 if (pto->setInventoryKnown.insert(inv).second)
2540 vInv.push_back(inv);
2541 if (vInv.size() >= 1000)
2543 pto->PushMessage("inv", vInv);
2548 pto->vInventoryToSend = vInvWait;
2551 pto->PushMessage("inv", vInv);
2557 vector<CInv> vGetData;
2558 int64 nNow = GetTime() * 1000000;
2560 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2562 const CInv& inv = (*pto->mapAskFor.begin()).second;
2563 if (!AlreadyHave(txdb, inv))
2565 printf("sending getdata: %s\n", inv.ToString().c_str());
2566 vGetData.push_back(inv);
2567 if (vGetData.size() >= 1000)
2569 pto->PushMessage("getdata", vGetData);
2573 mapAlreadyAskedFor[inv] = nNow;
2574 pto->mapAskFor.erase(pto->mapAskFor.begin());
2576 if (!vGetData.empty())
2577 pto->PushMessage("getdata", vGetData);
2596 //////////////////////////////////////////////////////////////////////////////
2601 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2603 unsigned char* pdata = (unsigned char*)pbuffer;
2604 unsigned int blocks = 1 + ((len + 8) / 64);
2605 unsigned char* pend = pdata + 64 * blocks;
2606 memset(pdata + len, 0, 64 * blocks - len);
2608 unsigned int bits = len * 8;
2609 pend[-1] = (bits >> 0) & 0xff;
2610 pend[-2] = (bits >> 8) & 0xff;
2611 pend[-3] = (bits >> 16) & 0xff;
2612 pend[-4] = (bits >> 24) & 0xff;
2616 static const unsigned int pSHA256InitState[8] =
2617 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2619 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2622 unsigned char data[64];
2626 for (int i = 0; i < 16; i++)
2627 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2629 for (int i = 0; i < 8; i++)
2630 ctx.h[i] = ((uint32_t*)pinit)[i];
2632 SHA256_Update(&ctx, data, sizeof(data));
2633 for (int i = 0; i < 8; i++)
2634 ((uint32_t*)pstate)[i] = ctx.h[i];
2638 // ScanHash scans nonces looking for a hash with at least some zero bits.
2639 // It operates on big endian data. Caller does the byte reversing.
2640 // All input buffers are 16-byte aligned. nNonce is usually preserved
2641 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2642 // the block is rebuilt and nNonce starts over at zero.
2644 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2646 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2650 // Hash pdata using pmidstate as the starting state into
2651 // preformatted buffer phash1, then hash phash1 into phash
2653 SHA256Transform(phash1, pdata, pmidstate);
2654 SHA256Transform(phash, phash1, pSHA256InitState);
2656 // Return the nonce if the hash has at least some zero bits,
2657 // caller will check if it has enough to reach the target
2658 if (((unsigned short*)phash)[14] == 0)
2661 // If nothing found after trying for a while, return -1
2662 if ((nNonce & 0xffff) == 0)
2664 nHashesDone = 0xffff+1;
2670 // Some explaining would be appreciated
2675 set<uint256> setDependsOn;
2678 COrphan(CTransaction* ptxIn)
2686 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2687 BOOST_FOREACH(uint256 hash, setDependsOn)
2688 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2693 CBlock* CreateNewBlock(CReserveKey& reservekey)
2695 CBlockIndex* pindexPrev = pindexBest;
2698 auto_ptr<CBlock> pblock(new CBlock());
2702 // Create coinbase tx
2704 txNew.vin.resize(1);
2705 txNew.vin[0].prevout.SetNull();
2706 txNew.vout.resize(1);
2707 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2709 // Add our coinbase tx as first transaction
2710 pblock->vtx.push_back(txNew);
2712 // Collect memory pool transactions into the block
2714 CRITICAL_BLOCK(cs_main)
2715 CRITICAL_BLOCK(cs_mapTransactions)
2719 // Priority order to process transactions
2720 list<COrphan> vOrphan; // list memory doesn't move
2721 map<uint256, vector<COrphan*> > mapDependers;
2722 multimap<double, CTransaction*> mapPriority;
2723 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2725 CTransaction& tx = (*mi).second;
2726 if (tx.IsCoinBase() || !tx.IsFinal())
2729 COrphan* porphan = NULL;
2730 double dPriority = 0;
2731 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2733 // Read prev transaction
2734 CTransaction txPrev;
2736 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2738 // Has to wait for dependencies
2741 // Use list for automatic deletion
2742 vOrphan.push_back(COrphan(&tx));
2743 porphan = &vOrphan.back();
2745 mapDependers[txin.prevout.hash].push_back(porphan);
2746 porphan->setDependsOn.insert(txin.prevout.hash);
2749 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2751 // Read block header
2752 int nConf = txindex.GetDepthInMainChain();
2754 dPriority += (double)nValueIn * nConf;
2756 if (fDebug && GetBoolArg("-printpriority"))
2757 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2760 // Priority is sum(valuein * age) / txsize
2761 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2764 porphan->dPriority = dPriority;
2766 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2768 if (fDebug && GetBoolArg("-printpriority"))
2770 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2777 // Collect transactions into block
2778 map<uint256, CTxIndex> mapTestPool;
2779 uint64 nBlockSize = 1000;
2780 int nBlockSigOps = 100;
2781 while (!mapPriority.empty())
2783 // Take highest priority transaction off priority queue
2784 double dPriority = -(*mapPriority.begin()).first;
2785 CTransaction& tx = *(*mapPriority.begin()).second;
2786 mapPriority.erase(mapPriority.begin());
2789 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2790 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2792 int nTxSigOps = tx.GetSigOpCount();
2793 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2796 // Transaction fee required depends on block size
2797 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2798 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2800 // Connecting shouldn't fail due to dependency on other memory pool transactions
2801 // because we're already processing them in order of dependency
2802 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2803 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2805 swap(mapTestPool, mapTestPoolTmp);
2808 pblock->vtx.push_back(tx);
2809 nBlockSize += nTxSize;
2810 nBlockSigOps += nTxSigOps;
2812 // Add transactions that depend on this one to the priority queue
2813 uint256 hash = tx.GetHash();
2814 if (mapDependers.count(hash))
2816 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2818 if (!porphan->setDependsOn.empty())
2820 porphan->setDependsOn.erase(hash);
2821 if (porphan->setDependsOn.empty())
2822 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2828 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2831 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2832 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2833 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2834 pblock->nBits = GetNextWorkRequired(pindexPrev);
2837 return pblock.release();
2841 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2843 // Update nExtraNonce
2844 static uint256 hashPrevBlock;
2845 if (hashPrevBlock != pblock->hashPrevBlock)
2848 hashPrevBlock = pblock->hashPrevBlock;
2851 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2852 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2856 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2859 // Prebuild hash buffers
2866 uint256 hashPrevBlock;
2867 uint256 hashMerkleRoot;
2870 unsigned int nNonce;
2873 unsigned char pchPadding0[64];
2875 unsigned char pchPadding1[64];
2878 memset(&tmp, 0, sizeof(tmp));
2880 tmp.block.nVersion = pblock->nVersion;
2881 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2882 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2883 tmp.block.nTime = pblock->nTime;
2884 tmp.block.nBits = pblock->nBits;
2885 tmp.block.nNonce = pblock->nNonce;
2887 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2888 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2890 // Byte swap all the input buffer
2891 for (int i = 0; i < sizeof(tmp)/4; i++)
2892 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2894 // Precalc the first half of the first hash, which stays constant
2895 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2897 memcpy(pdata, &tmp.block, 128);
2898 memcpy(phash1, &tmp.hash1, 64);
2902 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2904 uint256 hash = pblock->GetHash();
2905 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2907 if (hash > hashTarget)
2911 printf("BitcoinMiner:\n");
2912 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2914 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2915 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2918 CRITICAL_BLOCK(cs_main)
2920 if (pblock->hashPrevBlock != hashBestChain)
2921 return error("BitcoinMiner : generated block is stale");
2923 // Remove key from key pool
2924 reservekey.KeepKey();
2926 // Track how many getdata requests this block gets
2927 CRITICAL_BLOCK(wallet.cs_wallet)
2928 wallet.mapRequestCount[pblock->GetHash()] = 0;
2930 // Process this block the same as if we had received it from another node
2931 if (!ProcessBlock(NULL, pblock))
2932 return error("BitcoinMiner : ProcessBlock, block not accepted");
2939 void static ThreadBitcoinMiner(void* parg);
2941 void static BitcoinMiner(CWallet *pwallet)
2943 printf("BitcoinMiner started\n");
2944 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2946 // Each thread has its own key and counter
2947 CReserveKey reservekey(pwallet);
2948 unsigned int nExtraNonce = 0;
2950 while (fGenerateBitcoins)
2952 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2956 while (vNodes.empty() || IsInitialBlockDownload())
2961 if (!fGenerateBitcoins)
2969 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2970 CBlockIndex* pindexPrev = pindexBest;
2972 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2975 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
2977 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2981 // Prebuild hash buffers
2983 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2984 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2985 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2987 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2989 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2990 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2996 int64 nStart = GetTime();
2997 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2999 uint256& hash = *alignup<16>(hashbuf);
3002 unsigned int nHashesDone = 0;
3003 unsigned int nNonceFound;
3006 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3007 (char*)&hash, nHashesDone);
3009 // Check if something found
3010 if (nNonceFound != -1)
3012 for (int i = 0; i < sizeof(hash)/4; i++)
3013 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3015 if (hash <= hashTarget)
3018 pblock->nNonce = ByteReverse(nNonceFound);
3019 assert(hash == pblock->GetHash());
3021 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3022 CheckWork(pblock.get(), *pwalletMain, reservekey);
3023 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3029 static int64 nHashCounter;
3030 if (nHPSTimerStart == 0)
3032 nHPSTimerStart = GetTimeMillis();
3036 nHashCounter += nHashesDone;
3037 if (GetTimeMillis() - nHPSTimerStart > 4000)
3039 static CCriticalSection cs;
3042 if (GetTimeMillis() - nHPSTimerStart > 4000)
3044 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3045 nHPSTimerStart = GetTimeMillis();
3047 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3048 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3049 static int64 nLogTime;
3050 if (GetTime() - nLogTime > 30 * 60)
3052 nLogTime = GetTime();
3053 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3054 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3060 // Check for stop or if block needs to be rebuilt
3063 if (!fGenerateBitcoins)
3065 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3069 if (nBlockNonce >= 0xffff0000)
3071 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3073 if (pindexPrev != pindexBest)
3076 // Update nTime every few seconds
3077 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3078 nBlockTime = ByteReverse(pblock->nTime);
3083 void static ThreadBitcoinMiner(void* parg)
3085 CWallet* pwallet = (CWallet*)parg;
3088 vnThreadsRunning[3]++;
3089 BitcoinMiner(pwallet);
3090 vnThreadsRunning[3]--;
3092 catch (std::exception& e) {
3093 vnThreadsRunning[3]--;
3094 PrintException(&e, "ThreadBitcoinMiner()");
3096 vnThreadsRunning[3]--;
3097 PrintException(NULL, "ThreadBitcoinMiner()");
3099 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3101 if (vnThreadsRunning[3] == 0)
3103 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3107 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3109 if (fGenerateBitcoins != fGenerate)
3111 fGenerateBitcoins = fGenerate;
3112 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3115 if (fGenerateBitcoins)
3117 int nProcessors = boost::thread::hardware_concurrency();
3118 printf("%d processors\n", nProcessors);
3119 if (nProcessors < 1)
3121 if (fLimitProcessors && nProcessors > nLimitProcessors)
3122 nProcessors = nLimitProcessors;
3123 int nAddThreads = nProcessors - vnThreadsRunning[3];
3124 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3125 for (int i = 0; i < nAddThreads; i++)
3127 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3128 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");