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 <boost/filesystem.hpp>
11 #include <boost/filesystem/fstream.hpp>
14 using namespace boost;
20 CCriticalSection cs_setpwalletRegistered;
21 set<CWallet*> setpwalletRegistered;
23 CCriticalSection cs_main;
25 static map<uint256, CTransaction> mapTransactions;
26 CCriticalSection cs_mapTransactions;
27 unsigned int nTransactionsUpdated = 0;
28 map<COutPoint, CInPoint> mapNextTx;
30 map<uint256, CBlockIndex*> mapBlockIndex;
31 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
32 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
33 const int 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 // These functions dispatch to one or all registered wallets
76 void RegisterWallet(CWallet* pwalletIn)
78 CRITICAL_BLOCK(cs_setpwalletRegistered)
80 setpwalletRegistered.insert(pwalletIn);
84 void UnregisterWallet(CWallet* pwalletIn)
86 CRITICAL_BLOCK(cs_setpwalletRegistered)
88 setpwalletRegistered.erase(pwalletIn);
92 // check whether the passed transaction is from us
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 // get the wallet transaction with the given hash (if it exists)
102 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
104 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
105 if (pwallet->GetTransaction(hashTx,wtx))
110 // erases transaction with the given hash from all wallets
111 void static EraseFromWallets(uint256 hash)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 pwallet->EraseFromWallet(hash);
117 // make sure all wallets know about the given transaction, in the given block
118 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
120 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
121 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
124 // notify wallets about a new best chain
125 void static SetBestChain(const CBlockLocator& loc)
127 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
128 pwallet->SetBestChain(loc);
131 // notify wallets about an updated transaction
132 void static UpdatedTransaction(const uint256& hashTx)
134 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
135 pwallet->UpdatedTransaction(hashTx);
139 void static PrintWallets(const CBlock& block)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->PrintWallet(block);
145 // notify wallets about an incoming inventory (for request counts)
146 void static Inventory(const uint256& hash)
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->Inventory(hash);
152 // ask wallets to resend their transactions
153 void static ResendWalletTransactions()
155 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
156 pwallet->ResendWalletTransactions();
165 //////////////////////////////////////////////////////////////////////////////
167 // mapOrphanTransactions
170 void static AddOrphanTx(const CDataStream& vMsg)
173 CDataStream(vMsg) >> tx;
174 uint256 hash = tx.GetHash();
175 if (mapOrphanTransactions.count(hash))
177 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
178 BOOST_FOREACH(const CTxIn& txin, tx.vin)
179 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
182 void static EraseOrphanTx(uint256 hash)
184 if (!mapOrphanTransactions.count(hash))
186 const CDataStream* pvMsg = mapOrphanTransactions[hash];
188 CDataStream(*pvMsg) >> tx;
189 BOOST_FOREACH(const CTxIn& txin, tx.vin)
191 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
192 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
194 if ((*mi).second == pvMsg)
195 mapOrphanTransactionsByPrev.erase(mi++);
201 mapOrphanTransactions.erase(hash);
211 //////////////////////////////////////////////////////////////////////////////
213 // CTransaction and CTxIndex
216 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
219 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
221 if (!ReadFromDisk(txindexRet.pos))
223 if (prevout.n >= vout.size())
231 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
234 return ReadFromDisk(txdb, prevout, txindex);
237 bool CTransaction::ReadFromDisk(COutPoint prevout)
241 return ReadFromDisk(txdb, prevout, txindex);
246 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
258 // Load the block this tx is in
260 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
262 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
267 // Update the tx's hashBlock
268 hashBlock = pblock->GetHash();
270 // Locate the transaction
271 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
272 if (pblock->vtx[nIndex] == *(CTransaction*)this)
274 if (nIndex == pblock->vtx.size())
276 vMerkleBranch.clear();
278 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
282 // Fill in merkle branch
283 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
286 // Is the tx in a block that's in the main chain
287 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
288 if (mi == mapBlockIndex.end())
290 CBlockIndex* pindex = (*mi).second;
291 if (!pindex || !pindex->IsInMainChain())
294 return pindexBest->nHeight - pindex->nHeight + 1;
303 bool CTransaction::CheckTransaction() const
305 // Basic checks that don't depend on any context
307 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
309 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
311 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
312 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
314 // Check for negative or overflow output values
316 BOOST_FOREACH(const CTxOut& txout, vout)
318 if (txout.nValue < 0)
319 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
320 if (txout.nValue > MAX_MONEY)
321 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
322 nValueOut += txout.nValue;
323 if (!MoneyRange(nValueOut))
324 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
327 // Check for duplicate inputs
328 set<COutPoint> vInOutPoints;
329 BOOST_FOREACH(const CTxIn& txin, vin)
331 if (vInOutPoints.count(txin.prevout))
333 vInOutPoints.insert(txin.prevout);
338 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
339 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
343 BOOST_FOREACH(const CTxIn& txin, vin)
344 if (txin.prevout.IsNull())
345 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
351 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
354 *pfMissingInputs = false;
356 if (!CheckTransaction())
357 return error("AcceptToMemoryPool() : CheckTransaction failed");
359 // Coinbase is only valid in a block, not as a loose transaction
361 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
363 // To help v0.1.5 clients who would see it as a negative number
364 if ((int64)nLockTime > INT_MAX)
365 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
368 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
369 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
370 // attacks disallow transactions with more than one SigOp per 34 bytes.
371 // 34 bytes because a TxOut is:
372 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
373 if (GetSigOpCount() > nSize / 34 || nSize < 100)
374 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
376 // Rather not work on nonstandard transactions (unless -testnet)
377 if (!fTestNet && !IsStandard())
378 return error("AcceptToMemoryPool() : nonstandard transaction type");
380 // Do we already have it?
381 uint256 hash = GetHash();
382 CRITICAL_BLOCK(cs_mapTransactions)
383 if (mapTransactions.count(hash))
386 if (txdb.ContainsTx(hash))
389 // Check for conflicts with in-memory transactions
390 CTransaction* ptxOld = NULL;
391 for (int i = 0; i < vin.size(); i++)
393 COutPoint outpoint = vin[i].prevout;
394 if (mapNextTx.count(outpoint))
396 // Disable replacement feature for now
399 // Allow replacing with a newer version of the same transaction
402 ptxOld = mapNextTx[outpoint].ptx;
403 if (ptxOld->IsFinal())
405 if (!IsNewerThan(*ptxOld))
407 for (int i = 0; i < vin.size(); i++)
409 COutPoint outpoint = vin[i].prevout;
410 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
419 // Check against previous transactions
420 map<uint256, CTxIndex> mapUnused;
422 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
425 *pfMissingInputs = true;
426 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
429 // Don't accept it if it can't get into a block
430 if (nFees < GetMinFee(1000, true, true))
431 return error("AcceptToMemoryPool() : not enough fees");
433 // Continuously rate-limit free transactions
434 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
435 // be annoying or make other's transactions take longer to confirm.
436 if (nFees < MIN_RELAY_TX_FEE)
438 static CCriticalSection cs;
439 static double dFreeCount;
440 static int64 nLastTime;
441 int64 nNow = GetTime();
445 // Use an exponentially decaying ~10-minute window:
446 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
448 // -limitfreerelay unit is thousand-bytes-per-minute
449 // At default rate it would take over a month to fill 1GB
450 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
451 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
453 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
459 // Store transaction in memory
460 CRITICAL_BLOCK(cs_mapTransactions)
464 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
465 ptxOld->RemoveFromMemoryPool();
467 AddToMemoryPoolUnchecked();
470 ///// are we sure this is ok when loading transactions or restoring block txes
471 // If updated, erase old tx from wallet
473 EraseFromWallets(ptxOld->GetHash());
475 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
479 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
482 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
485 bool CTransaction::AddToMemoryPoolUnchecked()
487 // Add to memory pool without checking anything. Don't call this directly,
488 // call AcceptToMemoryPool to properly check the transaction first.
489 CRITICAL_BLOCK(cs_mapTransactions)
491 uint256 hash = GetHash();
492 mapTransactions[hash] = *this;
493 for (int i = 0; i < vin.size(); i++)
494 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
495 nTransactionsUpdated++;
501 bool CTransaction::RemoveFromMemoryPool()
503 // Remove transaction from memory pool
504 CRITICAL_BLOCK(cs_mapTransactions)
506 BOOST_FOREACH(const CTxIn& txin, vin)
507 mapNextTx.erase(txin.prevout);
508 mapTransactions.erase(GetHash());
509 nTransactionsUpdated++;
519 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
521 if (hashBlock == 0 || nIndex == -1)
524 // Find the block it claims to be in
525 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
526 if (mi == mapBlockIndex.end())
528 CBlockIndex* pindex = (*mi).second;
529 if (!pindex || !pindex->IsInMainChain())
532 // Make sure the merkle branch connects to this block
533 if (!fMerkleVerified)
535 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
537 fMerkleVerified = true;
540 nHeightRet = pindex->nHeight;
541 return pindexBest->nHeight - pindex->nHeight + 1;
545 int CMerkleTx::GetBlocksToMaturity() const
549 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
553 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
557 if (!IsInMainChain() && !ClientConnectInputs())
559 return CTransaction::AcceptToMemoryPool(txdb, false);
563 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
567 bool CMerkleTx::AcceptToMemoryPool()
570 return AcceptToMemoryPool(txdb);
575 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
577 CRITICAL_BLOCK(cs_mapTransactions)
579 // Add previous supporting transactions first
580 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
582 if (!tx.IsCoinBase())
584 uint256 hash = tx.GetHash();
585 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
586 tx.AcceptToMemoryPool(txdb, fCheckInputs);
589 return AcceptToMemoryPool(txdb, fCheckInputs);
594 bool CWalletTx::AcceptWalletTransaction()
597 return AcceptWalletTransaction(txdb);
600 int CTxIndex::GetDepthInMainChain() const
604 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
606 // Find the block in the index
607 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
608 if (mi == mapBlockIndex.end())
610 CBlockIndex* pindex = (*mi).second;
611 if (!pindex || !pindex->IsInMainChain())
613 return 1 + nBestHeight - pindex->nHeight;
625 //////////////////////////////////////////////////////////////////////////////
627 // CBlock and CBlockIndex
630 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
632 if (!fReadTransactions)
634 *this = pindex->GetBlockHeader();
637 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
639 if (GetHash() != pindex->GetBlockHash())
640 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
644 uint256 static GetOrphanRoot(const CBlock* pblock)
646 // Work back to the first block in the orphan chain
647 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
648 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
649 return pblock->GetHash();
652 int64 static GetBlockValue(int nHeight, int64 nFees)
654 int64 nSubsidy = 50 * COIN;
656 // Subsidy is cut in half every 4 years
657 nSubsidy >>= (nHeight / 210000);
659 return nSubsidy + nFees;
662 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
663 static const int64 nTargetSpacing = 10 * 60;
664 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
667 // minimum amount of work that could possibly be required nTime after
668 // minimum work required was nBase
670 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
673 bnResult.SetCompact(nBase);
674 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
676 // Maximum 400% adjustment...
678 // ... in best-case exactly 4-times-normal target time
679 nTime -= nTargetTimespan*4;
681 if (bnResult > bnProofOfWorkLimit)
682 bnResult = bnProofOfWorkLimit;
683 return bnResult.GetCompact();
686 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
690 if (pindexLast == NULL)
691 return bnProofOfWorkLimit.GetCompact();
693 // Only change once per interval
694 if ((pindexLast->nHeight+1) % nInterval != 0)
695 return pindexLast->nBits;
697 // Go back by what we want to be 14 days worth of blocks
698 const CBlockIndex* pindexFirst = pindexLast;
699 for (int i = 0; pindexFirst && i < nInterval-1; i++)
700 pindexFirst = pindexFirst->pprev;
703 // Limit adjustment step
704 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
705 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
706 if (nActualTimespan < nTargetTimespan/4)
707 nActualTimespan = nTargetTimespan/4;
708 if (nActualTimespan > nTargetTimespan*4)
709 nActualTimespan = nTargetTimespan*4;
713 bnNew.SetCompact(pindexLast->nBits);
714 bnNew *= nActualTimespan;
715 bnNew /= nTargetTimespan;
717 if (bnNew > bnProofOfWorkLimit)
718 bnNew = bnProofOfWorkLimit;
721 printf("GetNextWorkRequired RETARGET\n");
722 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
723 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
724 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
726 return bnNew.GetCompact();
729 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
732 bnTarget.SetCompact(nBits);
735 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
736 return error("CheckProofOfWork() : nBits below minimum work");
738 // Check proof of work matches claimed amount
739 if (hash > bnTarget.getuint256())
740 return error("CheckProofOfWork() : hash doesn't match nBits");
745 // Return maximum amount of blocks that other nodes claim to have
746 int GetNumBlocksOfPeers()
748 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
751 bool IsInitialBlockDownload()
753 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
755 static int64 nLastUpdate;
756 static CBlockIndex* pindexLastBest;
757 if (pindexBest != pindexLastBest)
759 pindexLastBest = pindexBest;
760 nLastUpdate = GetTime();
762 return (GetTime() - nLastUpdate < 10 &&
763 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
766 void static InvalidChainFound(CBlockIndex* pindexNew)
768 if (pindexNew->bnChainWork > bnBestInvalidWork)
770 bnBestInvalidWork = pindexNew->bnChainWork;
771 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
774 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());
775 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
776 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
777 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
790 bool CTransaction::DisconnectInputs(CTxDB& txdb)
792 // Relinquish previous transactions' spent pointers
795 BOOST_FOREACH(const CTxIn& txin, vin)
797 COutPoint prevout = txin.prevout;
799 // Get prev txindex from disk
801 if (!txdb.ReadTxIndex(prevout.hash, txindex))
802 return error("DisconnectInputs() : ReadTxIndex failed");
804 if (prevout.n >= txindex.vSpent.size())
805 return error("DisconnectInputs() : prevout.n out of range");
807 // Mark outpoint as not spent
808 txindex.vSpent[prevout.n].SetNull();
811 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
812 return error("DisconnectInputs() : UpdateTxIndex failed");
816 // Remove transaction from index
817 if (!txdb.EraseTxIndex(*this))
818 return error("DisconnectInputs() : EraseTxPos failed");
824 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
825 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
827 // Take over previous transactions' spent pointers
828 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
829 // fMiner is true when called from the internal bitcoin miner
830 // ... both are false when called from CTransaction::AcceptToMemoryPool
834 for (int i = 0; i < vin.size(); i++)
836 COutPoint prevout = vin[i].prevout;
841 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
843 // Get txindex from current proposed changes
844 txindex = mapTestPool[prevout.hash];
848 // Read txindex from txdb
849 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
851 if (!fFound && (fBlock || fMiner))
852 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());
856 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
858 // Get prev tx from single transactions in memory
859 CRITICAL_BLOCK(cs_mapTransactions)
861 if (!mapTransactions.count(prevout.hash))
862 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
863 txPrev = mapTransactions[prevout.hash];
866 txindex.vSpent.resize(txPrev.vout.size());
870 // Get prev tx from disk
871 if (!txPrev.ReadFromDisk(txindex.pos))
872 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
875 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
876 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()));
878 // If prev is coinbase, check that it's matured
879 if (txPrev.IsCoinBase())
880 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
881 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
882 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
884 // Skip ECDSA signature verification when connecting blocks (fBlock=true) during initial download
885 // (before the last blockchain checkpoint). This is safe because block merkle hashes are
886 // still computed and checked, and any change will be caught at the next checkpoint.
887 if (!(fBlock && IsInitialBlockDownload()))
889 if (!VerifySignature(txPrev, *this, i))
890 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
892 // Check for conflicts (double-spend)
893 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
894 // for an attacker to attempt to split the network.
895 if (!txindex.vSpent[prevout.n].IsNull())
896 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());
898 // Check for negative or overflow input values
899 nValueIn += txPrev.vout[prevout.n].nValue;
900 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
901 return DoS(100, error("ConnectInputs() : txin values out of range"));
903 // Mark outpoints as spent
904 txindex.vSpent[prevout.n] = posThisTx;
907 if (fBlock || fMiner)
909 mapTestPool[prevout.hash] = txindex;
913 if (nValueIn < GetValueOut())
914 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
916 // Tally transaction fees
917 int64 nTxFee = nValueIn - GetValueOut();
919 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
920 if (nTxFee < nMinFee)
923 if (!MoneyRange(nFees))
924 return DoS(100, error("ConnectInputs() : nFees out of range"));
929 // Add transaction to changes
930 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
934 // Add transaction to test pool
935 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
942 bool CTransaction::ClientConnectInputs()
947 // Take over previous transactions' spent pointers
948 CRITICAL_BLOCK(cs_mapTransactions)
951 for (int i = 0; i < vin.size(); i++)
953 // Get prev tx from single transactions in memory
954 COutPoint prevout = vin[i].prevout;
955 if (!mapTransactions.count(prevout.hash))
957 CTransaction& txPrev = mapTransactions[prevout.hash];
959 if (prevout.n >= txPrev.vout.size())
963 if (!VerifySignature(txPrev, *this, i))
964 return error("ConnectInputs() : VerifySignature failed");
966 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
967 ///// this has to go away now that posNext is gone
968 // // Check for conflicts
969 // if (!txPrev.vout[prevout.n].posNext.IsNull())
970 // return error("ConnectInputs() : prev tx already used");
972 // // Flag outpoints as used
973 // txPrev.vout[prevout.n].posNext = posThisTx;
975 nValueIn += txPrev.vout[prevout.n].nValue;
977 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
978 return error("ClientConnectInputs() : txin values out of range");
980 if (GetValueOut() > nValueIn)
990 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
992 // Disconnect in reverse order
993 for (int i = vtx.size()-1; i >= 0; i--)
994 if (!vtx[i].DisconnectInputs(txdb))
997 // Update block index on disk without changing it in memory.
998 // The memory index structure will be changed after the db commits.
1001 CDiskBlockIndex blockindexPrev(pindex->pprev);
1002 blockindexPrev.hashNext = 0;
1003 if (!txdb.WriteBlockIndex(blockindexPrev))
1004 return error("DisconnectBlock() : WriteBlockIndex failed");
1010 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1012 // Check it again in case a previous version let a bad block in
1016 //// issue here: it doesn't know the version
1017 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1019 map<uint256, CTxIndex> mapQueuedChanges;
1021 BOOST_FOREACH(CTransaction& tx, vtx)
1023 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1024 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1026 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false))
1029 // Write queued txindex changes
1030 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1032 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1033 return error("ConnectBlock() : UpdateTxIndex failed");
1036 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1039 // Update block index on disk without changing it in memory.
1040 // The memory index structure will be changed after the db commits.
1043 CDiskBlockIndex blockindexPrev(pindex->pprev);
1044 blockindexPrev.hashNext = pindex->GetBlockHash();
1045 if (!txdb.WriteBlockIndex(blockindexPrev))
1046 return error("ConnectBlock() : WriteBlockIndex failed");
1049 // Watch for transactions paying to me
1050 BOOST_FOREACH(CTransaction& tx, vtx)
1051 SyncWithWallets(tx, this, true);
1056 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1058 printf("REORGANIZE\n");
1061 CBlockIndex* pfork = pindexBest;
1062 CBlockIndex* plonger = pindexNew;
1063 while (pfork != plonger)
1065 while (plonger->nHeight > pfork->nHeight)
1066 if (!(plonger = plonger->pprev))
1067 return error("Reorganize() : plonger->pprev is null");
1068 if (pfork == plonger)
1070 if (!(pfork = pfork->pprev))
1071 return error("Reorganize() : pfork->pprev is null");
1074 // List of what to disconnect
1075 vector<CBlockIndex*> vDisconnect;
1076 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1077 vDisconnect.push_back(pindex);
1079 // List of what to connect
1080 vector<CBlockIndex*> vConnect;
1081 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1082 vConnect.push_back(pindex);
1083 reverse(vConnect.begin(), vConnect.end());
1085 // Disconnect shorter branch
1086 vector<CTransaction> vResurrect;
1087 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1090 if (!block.ReadFromDisk(pindex))
1091 return error("Reorganize() : ReadFromDisk for disconnect failed");
1092 if (!block.DisconnectBlock(txdb, pindex))
1093 return error("Reorganize() : DisconnectBlock failed");
1095 // Queue memory transactions to resurrect
1096 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1097 if (!tx.IsCoinBase())
1098 vResurrect.push_back(tx);
1101 // Connect longer branch
1102 vector<CTransaction> vDelete;
1103 for (int i = 0; i < vConnect.size(); i++)
1105 CBlockIndex* pindex = vConnect[i];
1107 if (!block.ReadFromDisk(pindex))
1108 return error("Reorganize() : ReadFromDisk for connect failed");
1109 if (!block.ConnectBlock(txdb, pindex))
1113 return error("Reorganize() : ConnectBlock failed");
1116 // Queue memory transactions to delete
1117 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1118 vDelete.push_back(tx);
1120 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1121 return error("Reorganize() : WriteHashBestChain failed");
1123 // Make sure it's successfully written to disk before changing memory structure
1124 if (!txdb.TxnCommit())
1125 return error("Reorganize() : TxnCommit failed");
1127 // Disconnect shorter branch
1128 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1130 pindex->pprev->pnext = NULL;
1132 // Connect longer branch
1133 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1135 pindex->pprev->pnext = pindex;
1137 // Resurrect memory transactions that were in the disconnected branch
1138 BOOST_FOREACH(CTransaction& tx, vResurrect)
1139 tx.AcceptToMemoryPool(txdb, false);
1141 // Delete redundant memory transactions that are in the connected branch
1142 BOOST_FOREACH(CTransaction& tx, vDelete)
1143 tx.RemoveFromMemoryPool();
1149 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1151 uint256 hash = GetHash();
1154 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1156 txdb.WriteHashBestChain(hash);
1157 if (!txdb.TxnCommit())
1158 return error("SetBestChain() : TxnCommit failed");
1159 pindexGenesisBlock = pindexNew;
1161 else if (hashPrevBlock == hashBestChain)
1163 // Adding to current best branch
1164 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1167 InvalidChainFound(pindexNew);
1168 return error("SetBestChain() : ConnectBlock failed");
1170 if (!txdb.TxnCommit())
1171 return error("SetBestChain() : TxnCommit failed");
1173 // Add to current best branch
1174 pindexNew->pprev->pnext = pindexNew;
1176 // Delete redundant memory transactions
1177 BOOST_FOREACH(CTransaction& tx, vtx)
1178 tx.RemoveFromMemoryPool();
1183 if (!Reorganize(txdb, pindexNew))
1186 InvalidChainFound(pindexNew);
1187 return error("SetBestChain() : Reorganize failed");
1191 // Update best block in wallet (so we can detect restored wallets)
1192 if (!IsInitialBlockDownload())
1194 const CBlockLocator locator(pindexNew);
1195 ::SetBestChain(locator);
1199 hashBestChain = hash;
1200 pindexBest = pindexNew;
1201 nBestHeight = pindexBest->nHeight;
1202 bnBestChainWork = pindexNew->bnChainWork;
1203 nTimeBestReceived = GetTime();
1204 nTransactionsUpdated++;
1205 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1211 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1213 // Check for duplicate
1214 uint256 hash = GetHash();
1215 if (mapBlockIndex.count(hash))
1216 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1218 // Construct new block index object
1219 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1221 return error("AddToBlockIndex() : new CBlockIndex failed");
1222 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1223 pindexNew->phashBlock = &((*mi).first);
1224 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1225 if (miPrev != mapBlockIndex.end())
1227 pindexNew->pprev = (*miPrev).second;
1228 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1230 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1234 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1235 if (!txdb.TxnCommit())
1239 if (pindexNew->bnChainWork > bnBestChainWork)
1240 if (!SetBestChain(txdb, pindexNew))
1245 if (pindexNew == pindexBest)
1247 // Notify UI to display prev block's coinbase if it was ours
1248 static uint256 hashPrevBestCoinBase;
1249 UpdatedTransaction(hashPrevBestCoinBase);
1250 hashPrevBestCoinBase = vtx[0].GetHash();
1260 bool CBlock::CheckBlock() const
1262 // These are checks that are independent of context
1263 // that can be verified before saving an orphan block.
1266 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1267 return DoS(100, error("CheckBlock() : size limits failed"));
1269 // Check proof of work matches claimed amount
1270 if (!CheckProofOfWork(GetHash(), nBits))
1271 return DoS(50, error("CheckBlock() : proof of work failed"));
1274 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1275 return error("CheckBlock() : block timestamp too far in the future");
1277 // First transaction must be coinbase, the rest must not be
1278 if (vtx.empty() || !vtx[0].IsCoinBase())
1279 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1280 for (int i = 1; i < vtx.size(); i++)
1281 if (vtx[i].IsCoinBase())
1282 return DoS(100, error("CheckBlock() : more than one coinbase"));
1284 // Check transactions
1285 BOOST_FOREACH(const CTransaction& tx, vtx)
1286 if (!tx.CheckTransaction())
1287 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1289 // Check that it's not full of nonstandard transactions
1290 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1291 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1294 if (hashMerkleRoot != BuildMerkleTree())
1295 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1300 bool CBlock::AcceptBlock()
1302 // Check for duplicate
1303 uint256 hash = GetHash();
1304 if (mapBlockIndex.count(hash))
1305 return error("AcceptBlock() : block already in mapBlockIndex");
1307 // Get prev block index
1308 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1309 if (mi == mapBlockIndex.end())
1310 return DoS(10, error("AcceptBlock() : prev block not found"));
1311 CBlockIndex* pindexPrev = (*mi).second;
1312 int nHeight = pindexPrev->nHeight+1;
1314 // Check proof of work
1315 if (nBits != GetNextWorkRequired(pindexPrev))
1316 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1318 // Check timestamp against prev
1319 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1320 return error("AcceptBlock() : block's timestamp is too early");
1322 // Check that all transactions are finalized
1323 BOOST_FOREACH(const CTransaction& tx, vtx)
1324 if (!tx.IsFinal(nHeight, GetBlockTime()))
1325 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1327 // Check that the block chain matches the known block chain up to a checkpoint
1328 if (!Checkpoints::CheckBlock(nHeight, hash))
1329 return DoS(100, error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight));
1331 // Write block to history file
1332 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1333 return error("AcceptBlock() : out of disk space");
1334 unsigned int nFile = -1;
1335 unsigned int nBlockPos = 0;
1336 if (!WriteToDisk(nFile, nBlockPos))
1337 return error("AcceptBlock() : WriteToDisk failed");
1338 if (!AddToBlockIndex(nFile, nBlockPos))
1339 return error("AcceptBlock() : AddToBlockIndex failed");
1341 // Relay inventory, but don't relay old inventory during initial block download
1342 if (hashBestChain == hash)
1343 CRITICAL_BLOCK(cs_vNodes)
1344 BOOST_FOREACH(CNode* pnode, vNodes)
1345 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1346 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1351 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1353 // Check for duplicate
1354 uint256 hash = pblock->GetHash();
1355 if (mapBlockIndex.count(hash))
1356 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1357 if (mapOrphanBlocks.count(hash))
1358 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1360 // Preliminary checks
1361 if (!pblock->CheckBlock())
1362 return error("ProcessBlock() : CheckBlock FAILED");
1364 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1365 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1367 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1368 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1371 pfrom->Misbehaving(100);
1372 return error("ProcessBlock() : block with timestamp before last checkpoint");
1375 bnNewBlock.SetCompact(pblock->nBits);
1377 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1378 if (bnNewBlock > bnRequired)
1380 pfrom->Misbehaving(100);
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)
1810 pfrom->Misbehaving(1);
1818 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1819 if (pfrom->nVersion == 10300)
1820 pfrom->nVersion = 300;
1821 if (pfrom->nVersion >= 106 && !vRecv.empty())
1822 vRecv >> addrFrom >> nNonce;
1823 if (pfrom->nVersion >= 106 && !vRecv.empty())
1824 vRecv >> pfrom->strSubVer;
1825 if (pfrom->nVersion >= 209 && !vRecv.empty())
1826 vRecv >> pfrom->nStartingHeight;
1828 if (pfrom->nVersion == 0)
1831 // Disconnect if we connected to ourself
1832 if (nNonce == nLocalHostNonce && nNonce > 1)
1834 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1835 pfrom->fDisconnect = true;
1839 // Be shy and don't send version until we hear
1840 if (pfrom->fInbound)
1841 pfrom->PushVersion();
1843 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1845 AddTimeData(pfrom->addr.ip, nTime);
1848 if (pfrom->nVersion >= 209)
1849 pfrom->PushMessage("verack");
1850 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1851 if (pfrom->nVersion < 209)
1852 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1854 if (!pfrom->fInbound)
1856 // Advertise our address
1857 if (addrLocalHost.IsRoutable() && !fUseProxy)
1859 CAddress addr(addrLocalHost);
1860 addr.nTime = GetAdjustedTime();
1861 pfrom->PushAddress(addr);
1864 // Get recent addresses
1865 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1867 pfrom->PushMessage("getaddr");
1868 pfrom->fGetAddr = true;
1872 // Ask the first connected node for block updates
1873 static int nAskedForBlocks;
1874 if (!pfrom->fClient &&
1875 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1876 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1879 pfrom->PushGetBlocks(pindexBest, uint256(0));
1883 CRITICAL_BLOCK(cs_mapAlerts)
1884 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1885 item.second.RelayTo(pfrom);
1887 pfrom->fSuccessfullyConnected = true;
1889 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1891 cPeerBlockCounts.input(pfrom->nStartingHeight);
1895 else if (pfrom->nVersion == 0)
1897 // Must have a version message before anything else
1898 pfrom->Misbehaving(1);
1903 else if (strCommand == "verack")
1905 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1909 else if (strCommand == "addr")
1911 vector<CAddress> vAddr;
1914 // Don't want addr from older versions unless seeding
1915 if (pfrom->nVersion < 209)
1917 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1919 if (vAddr.size() > 1000)
1921 pfrom->Misbehaving(20);
1922 return error("message addr size() = %d", vAddr.size());
1925 // Store the new addresses
1928 int64 nNow = GetAdjustedTime();
1929 int64 nSince = nNow - 10 * 60;
1930 BOOST_FOREACH(CAddress& addr, vAddr)
1934 // ignore IPv6 for now, since it isn't implemented anyway
1937 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1938 addr.nTime = nNow - 5 * 24 * 60 * 60;
1939 AddAddress(addr, 2 * 60 * 60, &addrDB);
1940 pfrom->AddAddressKnown(addr);
1941 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1943 // Relay to a limited number of other nodes
1944 CRITICAL_BLOCK(cs_vNodes)
1946 // Use deterministic randomness to send to the same nodes for 24 hours
1947 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1948 static uint256 hashSalt;
1950 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1951 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1952 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1953 multimap<uint256, CNode*> mapMix;
1954 BOOST_FOREACH(CNode* pnode, vNodes)
1956 if (pnode->nVersion < 31402)
1958 unsigned int nPointer;
1959 memcpy(&nPointer, &pnode, sizeof(nPointer));
1960 uint256 hashKey = hashRand ^ nPointer;
1961 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1962 mapMix.insert(make_pair(hashKey, pnode));
1964 int nRelayNodes = 2;
1965 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1966 ((*mi).second)->PushAddress(addr);
1970 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1971 if (vAddr.size() < 1000)
1972 pfrom->fGetAddr = false;
1976 else if (strCommand == "inv")
1980 if (vInv.size() > 50000)
1982 pfrom->Misbehaving(20);
1983 return error("message inv size() = %d", vInv.size());
1987 BOOST_FOREACH(const CInv& inv, vInv)
1991 pfrom->AddInventoryKnown(inv);
1993 bool fAlreadyHave = AlreadyHave(txdb, inv);
1995 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1999 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2000 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2002 // Track requests for our stuff
2003 Inventory(inv.hash);
2008 else if (strCommand == "getdata")
2012 if (vInv.size() > 50000)
2014 pfrom->Misbehaving(20);
2015 return error("message getdata size() = %d", vInv.size());
2018 BOOST_FOREACH(const CInv& inv, vInv)
2022 printf("received getdata for: %s\n", inv.ToString().c_str());
2024 if (inv.type == MSG_BLOCK)
2026 // Send block from disk
2027 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2028 if (mi != mapBlockIndex.end())
2031 block.ReadFromDisk((*mi).second);
2032 pfrom->PushMessage("block", block);
2034 // Trigger them to send a getblocks request for the next batch of inventory
2035 if (inv.hash == pfrom->hashContinue)
2037 // Bypass PushInventory, this must send even if redundant,
2038 // and we want it right after the last block so they don't
2039 // wait for other stuff first.
2041 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2042 pfrom->PushMessage("inv", vInv);
2043 pfrom->hashContinue = 0;
2047 else if (inv.IsKnownType())
2049 // Send stream from relay memory
2050 CRITICAL_BLOCK(cs_mapRelay)
2052 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2053 if (mi != mapRelay.end())
2054 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2058 // Track requests for our stuff
2059 Inventory(inv.hash);
2064 else if (strCommand == "getblocks")
2066 CBlockLocator locator;
2068 vRecv >> locator >> hashStop;
2070 // Find the last block the caller has in the main chain
2071 CBlockIndex* pindex = locator.GetBlockIndex();
2073 // Send the rest of the chain
2075 pindex = pindex->pnext;
2076 int nLimit = 500 + locator.GetDistanceBack();
2077 unsigned int nBytes = 0;
2078 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2079 for (; pindex; pindex = pindex->pnext)
2081 if (pindex->GetBlockHash() == hashStop)
2083 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2086 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2088 block.ReadFromDisk(pindex, true);
2089 nBytes += block.GetSerializeSize(SER_NETWORK);
2090 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2092 // When this block is requested, we'll send an inv that'll make them
2093 // getblocks the next batch of inventory.
2094 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2095 pfrom->hashContinue = pindex->GetBlockHash();
2102 else if (strCommand == "getheaders")
2104 CBlockLocator locator;
2106 vRecv >> locator >> hashStop;
2108 CBlockIndex* pindex = NULL;
2109 if (locator.IsNull())
2111 // If locator is null, return the hashStop block
2112 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2113 if (mi == mapBlockIndex.end())
2115 pindex = (*mi).second;
2119 // Find the last block the caller has in the main chain
2120 pindex = locator.GetBlockIndex();
2122 pindex = pindex->pnext;
2125 vector<CBlock> vHeaders;
2126 int nLimit = 2000 + locator.GetDistanceBack();
2127 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2128 for (; pindex; pindex = pindex->pnext)
2130 vHeaders.push_back(pindex->GetBlockHeader());
2131 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2134 pfrom->PushMessage("headers", vHeaders);
2138 else if (strCommand == "tx")
2140 vector<uint256> vWorkQueue;
2141 CDataStream vMsg(vRecv);
2145 CInv inv(MSG_TX, tx.GetHash());
2146 pfrom->AddInventoryKnown(inv);
2148 bool fMissingInputs = false;
2149 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2151 SyncWithWallets(tx, NULL, true);
2152 RelayMessage(inv, vMsg);
2153 mapAlreadyAskedFor.erase(inv);
2154 vWorkQueue.push_back(inv.hash);
2156 // Recursively process any orphan transactions that depended on this one
2157 for (int i = 0; i < vWorkQueue.size(); i++)
2159 uint256 hashPrev = vWorkQueue[i];
2160 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2161 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2164 const CDataStream& vMsg = *((*mi).second);
2166 CDataStream(vMsg) >> tx;
2167 CInv inv(MSG_TX, tx.GetHash());
2169 if (tx.AcceptToMemoryPool(true))
2171 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2172 SyncWithWallets(tx, NULL, true);
2173 RelayMessage(inv, vMsg);
2174 mapAlreadyAskedFor.erase(inv);
2175 vWorkQueue.push_back(inv.hash);
2180 BOOST_FOREACH(uint256 hash, vWorkQueue)
2181 EraseOrphanTx(hash);
2183 else if (fMissingInputs)
2185 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2188 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2192 else if (strCommand == "block")
2197 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2200 CInv inv(MSG_BLOCK, block.GetHash());
2201 pfrom->AddInventoryKnown(inv);
2203 if (ProcessBlock(pfrom, &block))
2204 mapAlreadyAskedFor.erase(inv);
2205 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2209 else if (strCommand == "getaddr")
2211 // Nodes rebroadcast an addr every 24 hours
2212 pfrom->vAddrToSend.clear();
2213 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2214 CRITICAL_BLOCK(cs_mapAddresses)
2216 unsigned int nCount = 0;
2217 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2219 const CAddress& addr = item.second;
2220 if (addr.nTime > nSince)
2223 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2225 const CAddress& addr = item.second;
2226 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2227 pfrom->PushAddress(addr);
2233 else if (strCommand == "checkorder")
2238 if (!GetBoolArg("-allowreceivebyip"))
2240 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2247 /// we have a chance to check the order here
2249 // Keep giving the same key to the same ip until they use it
2250 if (!mapReuseKey.count(pfrom->addr.ip))
2251 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2253 // Send back approval of order and pubkey to use
2254 CScript scriptPubKey;
2255 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2256 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2260 else if (strCommand == "reply")
2265 CRequestTracker tracker;
2266 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2268 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2269 if (mi != pfrom->mapRequests.end())
2271 tracker = (*mi).second;
2272 pfrom->mapRequests.erase(mi);
2275 if (!tracker.IsNull())
2276 tracker.fn(tracker.param1, vRecv);
2280 else if (strCommand == "ping")
2285 else if (strCommand == "alert")
2290 if (alert.ProcessAlert())
2293 pfrom->setKnown.insert(alert.GetHash());
2294 CRITICAL_BLOCK(cs_vNodes)
2295 BOOST_FOREACH(CNode* pnode, vNodes)
2296 alert.RelayTo(pnode);
2303 // Ignore unknown commands for extensibility
2307 // Update the last seen time for this node's address
2308 if (pfrom->fNetworkNode)
2309 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2310 AddressCurrentlyConnected(pfrom->addr);
2316 bool ProcessMessages(CNode* pfrom)
2318 CDataStream& vRecv = pfrom->vRecv;
2322 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2326 // (4) message start
2335 // Scan for message start
2336 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2337 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2338 if (vRecv.end() - pstart < nHeaderSize)
2340 if (vRecv.size() > nHeaderSize)
2342 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2343 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2347 if (pstart - vRecv.begin() > 0)
2348 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2349 vRecv.erase(vRecv.begin(), pstart);
2352 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2357 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2360 string strCommand = hdr.GetCommand();
2363 unsigned int nMessageSize = hdr.nMessageSize;
2364 if (nMessageSize > MAX_SIZE)
2366 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2369 if (nMessageSize > vRecv.size())
2371 // Rewind and wait for rest of message
2372 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2377 if (vRecv.GetVersion() >= 209)
2379 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2380 unsigned int nChecksum = 0;
2381 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2382 if (nChecksum != hdr.nChecksum)
2384 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2385 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2390 // Copy message to its own buffer
2391 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2392 vRecv.ignore(nMessageSize);
2398 CRITICAL_BLOCK(cs_main)
2399 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2403 catch (std::ios_base::failure& e)
2405 if (strstr(e.what(), "end of data"))
2407 // Allow exceptions from underlength message on vRecv
2408 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());
2410 else if (strstr(e.what(), "size too large"))
2412 // Allow exceptions from overlong size
2413 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2417 PrintExceptionContinue(&e, "ProcessMessage()");
2420 catch (std::exception& e) {
2421 PrintExceptionContinue(&e, "ProcessMessage()");
2423 PrintExceptionContinue(NULL, "ProcessMessage()");
2427 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2435 bool SendMessages(CNode* pto, bool fSendTrickle)
2437 CRITICAL_BLOCK(cs_main)
2439 // Don't send anything until we get their version message
2440 if (pto->nVersion == 0)
2444 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2445 pto->PushMessage("ping");
2447 // Resend wallet transactions that haven't gotten in a block yet
2448 ResendWalletTransactions();
2450 // Address refresh broadcast
2451 static int64 nLastRebroadcast;
2452 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2454 nLastRebroadcast = GetTime();
2455 CRITICAL_BLOCK(cs_vNodes)
2457 BOOST_FOREACH(CNode* pnode, vNodes)
2459 // Periodically clear setAddrKnown to allow refresh broadcasts
2460 pnode->setAddrKnown.clear();
2462 // Rebroadcast our address
2463 if (addrLocalHost.IsRoutable() && !fUseProxy)
2465 CAddress addr(addrLocalHost);
2466 addr.nTime = GetAdjustedTime();
2467 pnode->PushAddress(addr);
2473 // Clear out old addresses periodically so it's not too much work at once
2474 static int64 nLastClear;
2475 if (nLastClear == 0)
2476 nLastClear = GetTime();
2477 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2479 nLastClear = GetTime();
2480 CRITICAL_BLOCK(cs_mapAddresses)
2483 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2484 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2485 mi != mapAddresses.end();)
2487 const CAddress& addr = (*mi).second;
2488 if (addr.nTime < nSince)
2490 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2492 addrdb.EraseAddress(addr);
2493 mapAddresses.erase(mi++);
2507 vector<CAddress> vAddr;
2508 vAddr.reserve(pto->vAddrToSend.size());
2509 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2511 // returns true if wasn't already contained in the set
2512 if (pto->setAddrKnown.insert(addr).second)
2514 vAddr.push_back(addr);
2515 // receiver rejects addr messages larger than 1000
2516 if (vAddr.size() >= 1000)
2518 pto->PushMessage("addr", vAddr);
2523 pto->vAddrToSend.clear();
2525 pto->PushMessage("addr", vAddr);
2530 // Message: inventory
2533 vector<CInv> vInvWait;
2534 CRITICAL_BLOCK(pto->cs_inventory)
2536 vInv.reserve(pto->vInventoryToSend.size());
2537 vInvWait.reserve(pto->vInventoryToSend.size());
2538 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2540 if (pto->setInventoryKnown.count(inv))
2543 // trickle out tx inv to protect privacy
2544 if (inv.type == MSG_TX && !fSendTrickle)
2546 // 1/4 of tx invs blast to all immediately
2547 static uint256 hashSalt;
2549 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2550 uint256 hashRand = inv.hash ^ hashSalt;
2551 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2552 bool fTrickleWait = ((hashRand & 3) != 0);
2554 // always trickle our own transactions
2558 if (GetTransaction(inv.hash, wtx))
2560 fTrickleWait = true;
2565 vInvWait.push_back(inv);
2570 // returns true if wasn't already contained in the set
2571 if (pto->setInventoryKnown.insert(inv).second)
2573 vInv.push_back(inv);
2574 if (vInv.size() >= 1000)
2576 pto->PushMessage("inv", vInv);
2581 pto->vInventoryToSend = vInvWait;
2584 pto->PushMessage("inv", vInv);
2590 vector<CInv> vGetData;
2591 int64 nNow = GetTime() * 1000000;
2593 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2595 const CInv& inv = (*pto->mapAskFor.begin()).second;
2596 if (!AlreadyHave(txdb, inv))
2598 printf("sending getdata: %s\n", inv.ToString().c_str());
2599 vGetData.push_back(inv);
2600 if (vGetData.size() >= 1000)
2602 pto->PushMessage("getdata", vGetData);
2606 mapAlreadyAskedFor[inv] = nNow;
2607 pto->mapAskFor.erase(pto->mapAskFor.begin());
2609 if (!vGetData.empty())
2610 pto->PushMessage("getdata", vGetData);
2629 //////////////////////////////////////////////////////////////////////////////
2634 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2636 unsigned char* pdata = (unsigned char*)pbuffer;
2637 unsigned int blocks = 1 + ((len + 8) / 64);
2638 unsigned char* pend = pdata + 64 * blocks;
2639 memset(pdata + len, 0, 64 * blocks - len);
2641 unsigned int bits = len * 8;
2642 pend[-1] = (bits >> 0) & 0xff;
2643 pend[-2] = (bits >> 8) & 0xff;
2644 pend[-3] = (bits >> 16) & 0xff;
2645 pend[-4] = (bits >> 24) & 0xff;
2649 static const unsigned int pSHA256InitState[8] =
2650 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2652 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2655 unsigned char data[64];
2659 for (int i = 0; i < 16; i++)
2660 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2662 for (int i = 0; i < 8; i++)
2663 ctx.h[i] = ((uint32_t*)pinit)[i];
2665 SHA256_Update(&ctx, data, sizeof(data));
2666 for (int i = 0; i < 8; i++)
2667 ((uint32_t*)pstate)[i] = ctx.h[i];
2671 // ScanHash scans nonces looking for a hash with at least some zero bits.
2672 // It operates on big endian data. Caller does the byte reversing.
2673 // All input buffers are 16-byte aligned. nNonce is usually preserved
2674 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2675 // the block is rebuilt and nNonce starts over at zero.
2677 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2679 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2683 // Hash pdata using pmidstate as the starting state into
2684 // preformatted buffer phash1, then hash phash1 into phash
2686 SHA256Transform(phash1, pdata, pmidstate);
2687 SHA256Transform(phash, phash1, pSHA256InitState);
2689 // Return the nonce if the hash has at least some zero bits,
2690 // caller will check if it has enough to reach the target
2691 if (((unsigned short*)phash)[14] == 0)
2694 // If nothing found after trying for a while, return -1
2695 if ((nNonce & 0xffff) == 0)
2697 nHashesDone = 0xffff+1;
2703 // Some explaining would be appreciated
2708 set<uint256> setDependsOn;
2711 COrphan(CTransaction* ptxIn)
2719 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2720 BOOST_FOREACH(uint256 hash, setDependsOn)
2721 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2726 CBlock* CreateNewBlock(CReserveKey& reservekey)
2728 CBlockIndex* pindexPrev = pindexBest;
2731 auto_ptr<CBlock> pblock(new CBlock());
2735 // Create coinbase tx
2737 txNew.vin.resize(1);
2738 txNew.vin[0].prevout.SetNull();
2739 txNew.vout.resize(1);
2740 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2742 // Add our coinbase tx as first transaction
2743 pblock->vtx.push_back(txNew);
2745 // Collect memory pool transactions into the block
2747 CRITICAL_BLOCK(cs_main)
2748 CRITICAL_BLOCK(cs_mapTransactions)
2752 // Priority order to process transactions
2753 list<COrphan> vOrphan; // list memory doesn't move
2754 map<uint256, vector<COrphan*> > mapDependers;
2755 multimap<double, CTransaction*> mapPriority;
2756 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2758 CTransaction& tx = (*mi).second;
2759 if (tx.IsCoinBase() || !tx.IsFinal())
2762 COrphan* porphan = NULL;
2763 double dPriority = 0;
2764 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2766 // Read prev transaction
2767 CTransaction txPrev;
2769 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2771 // Has to wait for dependencies
2774 // Use list for automatic deletion
2775 vOrphan.push_back(COrphan(&tx));
2776 porphan = &vOrphan.back();
2778 mapDependers[txin.prevout.hash].push_back(porphan);
2779 porphan->setDependsOn.insert(txin.prevout.hash);
2782 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2784 // Read block header
2785 int nConf = txindex.GetDepthInMainChain();
2787 dPriority += (double)nValueIn * nConf;
2789 if (fDebug && GetBoolArg("-printpriority"))
2790 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2793 // Priority is sum(valuein * age) / txsize
2794 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2797 porphan->dPriority = dPriority;
2799 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2801 if (fDebug && GetBoolArg("-printpriority"))
2803 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2810 // Collect transactions into block
2811 map<uint256, CTxIndex> mapTestPool;
2812 uint64 nBlockSize = 1000;
2813 int nBlockSigOps = 100;
2814 while (!mapPriority.empty())
2816 // Take highest priority transaction off priority queue
2817 double dPriority = -(*mapPriority.begin()).first;
2818 CTransaction& tx = *(*mapPriority.begin()).second;
2819 mapPriority.erase(mapPriority.begin());
2822 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2823 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2825 int nTxSigOps = tx.GetSigOpCount();
2826 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2829 // Transaction fee required depends on block size
2830 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2831 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2833 // Connecting shouldn't fail due to dependency on other memory pool transactions
2834 // because we're already processing them in order of dependency
2835 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2836 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2838 swap(mapTestPool, mapTestPoolTmp);
2841 pblock->vtx.push_back(tx);
2842 nBlockSize += nTxSize;
2843 nBlockSigOps += nTxSigOps;
2845 // Add transactions that depend on this one to the priority queue
2846 uint256 hash = tx.GetHash();
2847 if (mapDependers.count(hash))
2849 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2851 if (!porphan->setDependsOn.empty())
2853 porphan->setDependsOn.erase(hash);
2854 if (porphan->setDependsOn.empty())
2855 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2861 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2864 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2865 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2866 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2867 pblock->nBits = GetNextWorkRequired(pindexPrev);
2870 return pblock.release();
2874 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2876 // Update nExtraNonce
2877 static uint256 hashPrevBlock;
2878 if (hashPrevBlock != pblock->hashPrevBlock)
2881 hashPrevBlock = pblock->hashPrevBlock;
2884 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2885 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2889 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2892 // Prebuild hash buffers
2899 uint256 hashPrevBlock;
2900 uint256 hashMerkleRoot;
2903 unsigned int nNonce;
2906 unsigned char pchPadding0[64];
2908 unsigned char pchPadding1[64];
2911 memset(&tmp, 0, sizeof(tmp));
2913 tmp.block.nVersion = pblock->nVersion;
2914 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2915 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2916 tmp.block.nTime = pblock->nTime;
2917 tmp.block.nBits = pblock->nBits;
2918 tmp.block.nNonce = pblock->nNonce;
2920 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2921 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2923 // Byte swap all the input buffer
2924 for (int i = 0; i < sizeof(tmp)/4; i++)
2925 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2927 // Precalc the first half of the first hash, which stays constant
2928 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2930 memcpy(pdata, &tmp.block, 128);
2931 memcpy(phash1, &tmp.hash1, 64);
2935 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2937 uint256 hash = pblock->GetHash();
2938 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2940 if (hash > hashTarget)
2944 printf("BitcoinMiner:\n");
2945 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2947 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2948 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2951 CRITICAL_BLOCK(cs_main)
2953 if (pblock->hashPrevBlock != hashBestChain)
2954 return error("BitcoinMiner : generated block is stale");
2956 // Remove key from key pool
2957 reservekey.KeepKey();
2959 // Track how many getdata requests this block gets
2960 CRITICAL_BLOCK(wallet.cs_wallet)
2961 wallet.mapRequestCount[pblock->GetHash()] = 0;
2963 // Process this block the same as if we had received it from another node
2964 if (!ProcessBlock(NULL, pblock))
2965 return error("BitcoinMiner : ProcessBlock, block not accepted");
2971 void static ThreadBitcoinMiner(void* parg);
2973 void static BitcoinMiner(CWallet *pwallet)
2975 printf("BitcoinMiner started\n");
2976 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2978 // Each thread has its own key and counter
2979 CReserveKey reservekey(pwallet);
2980 unsigned int nExtraNonce = 0;
2982 while (fGenerateBitcoins)
2984 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2988 while (vNodes.empty() || IsInitialBlockDownload())
2993 if (!fGenerateBitcoins)
3001 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3002 CBlockIndex* pindexPrev = pindexBest;
3004 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3007 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3009 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3013 // Prebuild hash buffers
3015 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3016 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3017 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3019 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3021 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3022 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3028 int64 nStart = GetTime();
3029 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3031 uint256& hash = *alignup<16>(hashbuf);
3034 unsigned int nHashesDone = 0;
3035 unsigned int nNonceFound;
3038 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3039 (char*)&hash, nHashesDone);
3041 // Check if something found
3042 if (nNonceFound != -1)
3044 for (int i = 0; i < sizeof(hash)/4; i++)
3045 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3047 if (hash <= hashTarget)
3050 pblock->nNonce = ByteReverse(nNonceFound);
3051 assert(hash == pblock->GetHash());
3053 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3054 CheckWork(pblock.get(), *pwalletMain, reservekey);
3055 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3061 static int64 nHashCounter;
3062 if (nHPSTimerStart == 0)
3064 nHPSTimerStart = GetTimeMillis();
3068 nHashCounter += nHashesDone;
3069 if (GetTimeMillis() - nHPSTimerStart > 4000)
3071 static CCriticalSection cs;
3074 if (GetTimeMillis() - nHPSTimerStart > 4000)
3076 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3077 nHPSTimerStart = GetTimeMillis();
3079 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3080 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3081 static int64 nLogTime;
3082 if (GetTime() - nLogTime > 30 * 60)
3084 nLogTime = GetTime();
3085 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3086 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3092 // Check for stop or if block needs to be rebuilt
3095 if (!fGenerateBitcoins)
3097 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3101 if (nBlockNonce >= 0xffff0000)
3103 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3105 if (pindexPrev != pindexBest)
3108 // Update nTime every few seconds
3109 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3110 nBlockTime = ByteReverse(pblock->nTime);
3115 void static ThreadBitcoinMiner(void* parg)
3117 CWallet* pwallet = (CWallet*)parg;
3120 vnThreadsRunning[3]++;
3121 BitcoinMiner(pwallet);
3122 vnThreadsRunning[3]--;
3124 catch (std::exception& e) {
3125 vnThreadsRunning[3]--;
3126 PrintException(&e, "ThreadBitcoinMiner()");
3128 vnThreadsRunning[3]--;
3129 PrintException(NULL, "ThreadBitcoinMiner()");
3131 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3133 if (vnThreadsRunning[3] == 0)
3135 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3139 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3141 if (fGenerateBitcoins != fGenerate)
3143 fGenerateBitcoins = fGenerate;
3144 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3147 if (fGenerateBitcoins)
3149 int nProcessors = boost::thread::hardware_concurrency();
3150 printf("%d processors\n", nProcessors);
3151 if (nProcessors < 1)
3153 if (fLimitProcessors && nProcessors > nLimitProcessors)
3154 nProcessors = nLimitProcessors;
3155 int nAddThreads = nProcessors - vnThreadsRunning[3];
3156 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3157 for (int i = 0; i < nAddThreads; i++)
3159 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3160 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");