1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "checkpoints.h"
10 #include "cryptopp/sha.h"
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
26 static map<uint256, CTransaction> mapTransactions;
27 CCriticalSection cs_mapTransactions;
28 unsigned int nTransactionsUpdated = 0;
29 map<COutPoint, CInPoint> mapNextTx;
31 map<uint256, CBlockIndex*> mapBlockIndex;
32 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 CBigNum bnBestChainWork = 0;
38 CBigNum bnBestInvalidWork = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 map<uint256, CBlock*> mapOrphanBlocks;
44 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
46 map<uint256, CDataStream*> mapOrphanTransactions;
47 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
54 int fGenerateBitcoins = false;
55 int64 nTransactionFee = 0;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
170 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
171 BOOST_FOREACH(const CTxIn& txin, tx.vin)
172 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
175 void static EraseOrphanTx(uint256 hash)
177 if (!mapOrphanTransactions.count(hash))
179 const CDataStream* pvMsg = mapOrphanTransactions[hash];
181 CDataStream(*pvMsg) >> tx;
182 BOOST_FOREACH(const CTxIn& txin, tx.vin)
184 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
185 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
187 if ((*mi).second == pvMsg)
188 mapOrphanTransactionsByPrev.erase(mi++);
194 mapOrphanTransactions.erase(hash);
197 int LimitOrphanTxSize(int nMaxOrphans)
200 while (mapOrphanTransactions.size() > nMaxOrphans)
202 // Evict a random orphan:
203 std::vector<unsigned char> randbytes(32);
204 RAND_bytes(&randbytes[0], 32);
205 uint256 randomhash(randbytes);
206 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
207 if (it == mapOrphanTransactions.end())
208 it = mapOrphanTransactions.begin();
209 EraseOrphanTx(it->first);
221 //////////////////////////////////////////////////////////////////////////////
223 // CTransaction and CTxIndex
226 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
229 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
231 if (!ReadFromDisk(txindexRet.pos))
233 if (prevout.n >= vout.size())
241 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
244 return ReadFromDisk(txdb, prevout, txindex);
247 bool CTransaction::ReadFromDisk(COutPoint prevout)
251 return ReadFromDisk(txdb, prevout, txindex);
256 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
268 // Load the block this tx is in
270 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
272 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
277 // Update the tx's hashBlock
278 hashBlock = pblock->GetHash();
280 // Locate the transaction
281 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
282 if (pblock->vtx[nIndex] == *(CTransaction*)this)
284 if (nIndex == pblock->vtx.size())
286 vMerkleBranch.clear();
288 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
292 // Fill in merkle branch
293 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
296 // Is the tx in a block that's in the main chain
297 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
298 if (mi == mapBlockIndex.end())
300 CBlockIndex* pindex = (*mi).second;
301 if (!pindex || !pindex->IsInMainChain())
304 return pindexBest->nHeight - pindex->nHeight + 1;
313 bool CTransaction::CheckTransaction() const
315 // Basic checks that don't depend on any context
317 return error("CTransaction::CheckTransaction() : vin empty");
319 return error("CTransaction::CheckTransaction() : vout empty");
321 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
322 return error("CTransaction::CheckTransaction() : size limits failed");
324 // Check for negative or overflow output values
326 BOOST_FOREACH(const CTxOut& txout, vout)
328 if (txout.nValue < 0)
329 return error("CTransaction::CheckTransaction() : txout.nValue negative");
330 if (txout.nValue > MAX_MONEY)
331 return error("CTransaction::CheckTransaction() : txout.nValue too high");
332 nValueOut += txout.nValue;
333 if (!MoneyRange(nValueOut))
334 return error("CTransaction::CheckTransaction() : txout total out of range");
337 // Check for duplicate inputs
338 set<COutPoint> vInOutPoints;
339 BOOST_FOREACH(const CTxIn& txin, vin)
341 if (vInOutPoints.count(txin.prevout))
343 vInOutPoints.insert(txin.prevout);
348 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
349 return error("CTransaction::CheckTransaction() : coinbase script size");
353 BOOST_FOREACH(const CTxIn& txin, vin)
354 if (txin.prevout.IsNull())
355 return error("CTransaction::CheckTransaction() : prevout is null");
361 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
364 *pfMissingInputs = false;
366 if (!CheckTransaction())
367 return error("AcceptToMemoryPool() : CheckTransaction failed");
369 // Coinbase is only valid in a block, not as a loose transaction
371 return error("AcceptToMemoryPool() : coinbase as individual tx");
373 // To help v0.1.5 clients who would see it as a negative number
374 if ((int64)nLockTime > INT_MAX)
375 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
378 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
379 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
380 // attacks disallow transactions with more than one SigOp per 34 bytes.
381 // 34 bytes because a TxOut is:
382 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
383 if (GetSigOpCount() > nSize / 34 || nSize < 100)
384 return error("AcceptToMemoryPool() : nonstandard transaction");
386 // Rather not work on nonstandard transactions (unless -testnet)
387 if (!fTestNet && !IsStandard())
388 return error("AcceptToMemoryPool() : nonstandard transaction type");
390 // Do we already have it?
391 uint256 hash = GetHash();
392 CRITICAL_BLOCK(cs_mapTransactions)
393 if (mapTransactions.count(hash))
396 if (txdb.ContainsTx(hash))
399 // Check for conflicts with in-memory transactions
400 CTransaction* ptxOld = NULL;
401 for (int i = 0; i < vin.size(); i++)
403 COutPoint outpoint = vin[i].prevout;
404 if (mapNextTx.count(outpoint))
406 // Disable replacement feature for now
409 // Allow replacing with a newer version of the same transaction
412 ptxOld = mapNextTx[outpoint].ptx;
413 if (ptxOld->IsFinal())
415 if (!IsNewerThan(*ptxOld))
417 for (int i = 0; i < vin.size(); i++)
419 COutPoint outpoint = vin[i].prevout;
420 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
429 // Check against previous transactions
430 map<uint256, CTxIndex> mapUnused;
432 bool fInvalid = false;
433 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false, 0, fInvalid))
436 return error("AcceptToMemoryPool() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
437 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
440 // Don't accept it if it can't get into a block
441 if (nFees < GetMinFee(1000, true, true))
442 return error("AcceptToMemoryPool() : not enough fees");
444 // Continuously rate-limit free transactions
445 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
446 // be annoying or make other's transactions take longer to confirm.
447 if (nFees < MIN_RELAY_TX_FEE)
449 static CCriticalSection cs;
450 static double dFreeCount;
451 static int64 nLastTime;
452 int64 nNow = GetTime();
456 // Use an exponentially decaying ~10-minute window:
457 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
459 // -limitfreerelay unit is thousand-bytes-per-minute
460 // At default rate it would take over a month to fill 1GB
461 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
462 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
464 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
470 // Store transaction in memory
471 CRITICAL_BLOCK(cs_mapTransactions)
475 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
476 ptxOld->RemoveFromMemoryPool();
478 AddToMemoryPoolUnchecked();
481 ///// are we sure this is ok when loading transactions or restoring block txes
482 // If updated, erase old tx from wallet
484 EraseFromWallets(ptxOld->GetHash());
486 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
490 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
493 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
496 bool CTransaction::AddToMemoryPoolUnchecked()
498 // Add to memory pool without checking anything. Don't call this directly,
499 // call AcceptToMemoryPool to properly check the transaction first.
500 CRITICAL_BLOCK(cs_mapTransactions)
502 uint256 hash = GetHash();
503 mapTransactions[hash] = *this;
504 for (int i = 0; i < vin.size(); i++)
505 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
506 nTransactionsUpdated++;
512 bool CTransaction::RemoveFromMemoryPool()
514 // Remove transaction from memory pool
515 CRITICAL_BLOCK(cs_mapTransactions)
517 BOOST_FOREACH(const CTxIn& txin, vin)
518 mapNextTx.erase(txin.prevout);
519 mapTransactions.erase(GetHash());
520 nTransactionsUpdated++;
530 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
532 if (hashBlock == 0 || nIndex == -1)
535 // Find the block it claims to be in
536 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
537 if (mi == mapBlockIndex.end())
539 CBlockIndex* pindex = (*mi).second;
540 if (!pindex || !pindex->IsInMainChain())
543 // Make sure the merkle branch connects to this block
544 if (!fMerkleVerified)
546 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
548 fMerkleVerified = true;
551 nHeightRet = pindex->nHeight;
552 return pindexBest->nHeight - pindex->nHeight + 1;
556 int CMerkleTx::GetBlocksToMaturity() const
560 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
564 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
568 if (!IsInMainChain() && !ClientConnectInputs())
570 return CTransaction::AcceptToMemoryPool(txdb, false);
574 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
578 bool CMerkleTx::AcceptToMemoryPool()
581 return AcceptToMemoryPool(txdb);
586 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
588 CRITICAL_BLOCK(cs_mapTransactions)
590 // Add previous supporting transactions first
591 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
593 if (!tx.IsCoinBase())
595 uint256 hash = tx.GetHash();
596 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
597 tx.AcceptToMemoryPool(txdb, fCheckInputs);
600 return AcceptToMemoryPool(txdb, fCheckInputs);
605 bool CWalletTx::AcceptWalletTransaction()
608 return AcceptWalletTransaction(txdb);
611 int CTxIndex::GetDepthInMainChain() const
615 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
617 // Find the block in the index
618 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
619 if (mi == mapBlockIndex.end())
621 CBlockIndex* pindex = (*mi).second;
622 if (!pindex || !pindex->IsInMainChain())
624 return 1 + nBestHeight - pindex->nHeight;
636 //////////////////////////////////////////////////////////////////////////////
638 // CBlock and CBlockIndex
641 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
643 if (!fReadTransactions)
645 *this = pindex->GetBlockHeader();
648 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
650 if (GetHash() != pindex->GetBlockHash())
651 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
655 uint256 static GetOrphanRoot(const CBlock* pblock)
657 // Work back to the first block in the orphan chain
658 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
659 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
660 return pblock->GetHash();
663 int64 static GetBlockValue(int nHeight, int64 nFees)
665 int64 nSubsidy = 50 * COIN;
667 // Subsidy is cut in half every 4 years
668 nSubsidy >>= (nHeight / 210000);
670 return nSubsidy + nFees;
673 static const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
674 static const int64 nTargetSpacing = 10 * 60;
675 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
678 // minimum amount of work that could possibly be required nTime after
679 // minimum work required was nBase
681 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
683 // Testnet has min-difficulty blocks
684 // after nTargetSpacing*2 time between blocks:
685 if (fTestNet && nTime > nTargetSpacing*2)
686 return bnProofOfWorkLimit.GetCompact();
689 bnResult.SetCompact(nBase);
690 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
692 // Maximum 400% adjustment...
694 // ... in best-case exactly 4-times-normal target time
695 nTime -= nTargetTimespan*4;
697 if (bnResult > bnProofOfWorkLimit)
698 bnResult = bnProofOfWorkLimit;
699 return bnResult.GetCompact();
702 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlock *pblock)
704 unsigned int nProofOfWorkLimit = bnProofOfWorkLimit.GetCompact();
707 if (pindexLast == NULL)
708 return nProofOfWorkLimit;
710 // Only change once per interval
711 if ((pindexLast->nHeight+1) % nInterval != 0)
713 // Special rules for testnet after 15 Feb 2012:
714 if (fTestNet && pblock->nTime > 1329264000)
716 // If the new block's timestamp is more than 2* 10 minutes
717 // then allow mining of a min-difficulty block.
718 if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2)
719 return nProofOfWorkLimit;
722 // Return the last non-special-min-difficulty-rules-block
723 const CBlockIndex* pindex = pindexLast;
724 while (pindex->pprev && pindex->nHeight % nInterval != 0 && pindex->nBits == nProofOfWorkLimit)
725 pindex = pindex->pprev;
726 return pindex->nBits;
730 return pindexLast->nBits;
733 // Go back by what we want to be 14 days worth of blocks
734 const CBlockIndex* pindexFirst = pindexLast;
735 for (int i = 0; pindexFirst && i < nInterval-1; i++)
736 pindexFirst = pindexFirst->pprev;
739 // Limit adjustment step
740 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
741 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
742 if (nActualTimespan < nTargetTimespan/4)
743 nActualTimespan = nTargetTimespan/4;
744 if (nActualTimespan > nTargetTimespan*4)
745 nActualTimespan = nTargetTimespan*4;
749 bnNew.SetCompact(pindexLast->nBits);
750 bnNew *= nActualTimespan;
751 bnNew /= nTargetTimespan;
753 if (bnNew > bnProofOfWorkLimit)
754 bnNew = bnProofOfWorkLimit;
757 printf("GetNextWorkRequired RETARGET\n");
758 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
759 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
760 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
762 return bnNew.GetCompact();
765 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
768 bnTarget.SetCompact(nBits);
771 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
772 return error("CheckProofOfWork() : nBits below minimum work");
774 // Check proof of work matches claimed amount
775 if (hash > bnTarget.getuint256())
776 return error("CheckProofOfWork() : hash doesn't match nBits");
781 bool IsInitialBlockDownload()
783 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
785 static int64 nLastUpdate;
786 static CBlockIndex* pindexLastBest;
787 if (pindexBest != pindexLastBest)
789 pindexLastBest = pindexBest;
790 nLastUpdate = GetTime();
792 return (GetTime() - nLastUpdate < 10 &&
793 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
796 void static InvalidChainFound(CBlockIndex* pindexNew)
798 if (pindexNew->bnChainWork > bnBestInvalidWork)
800 bnBestInvalidWork = pindexNew->bnChainWork;
801 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
804 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());
805 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
806 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
807 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
820 bool CTransaction::DisconnectInputs(CTxDB& txdb)
822 // Relinquish previous transactions' spent pointers
825 BOOST_FOREACH(const CTxIn& txin, vin)
827 COutPoint prevout = txin.prevout;
829 // Get prev txindex from disk
831 if (!txdb.ReadTxIndex(prevout.hash, txindex))
832 return error("DisconnectInputs() : ReadTxIndex failed");
834 if (prevout.n >= txindex.vSpent.size())
835 return error("DisconnectInputs() : prevout.n out of range");
837 // Mark outpoint as not spent
838 txindex.vSpent[prevout.n].SetNull();
841 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
842 return error("DisconnectInputs() : UpdateTxIndex failed");
846 // Remove transaction from index
847 if (!txdb.EraseTxIndex(*this))
848 return error("DisconnectInputs() : EraseTxPos failed");
854 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
855 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee,
858 // FetchInputs can return false either because we just haven't seen some inputs
859 // (in which case the transaction should be stored as an orphan)
860 // or because the transaction is malformed (in which case the transaction should
861 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
864 // Take over previous transactions' spent pointers
868 for (int i = 0; i < vin.size(); i++)
870 COutPoint prevout = vin[i].prevout;
875 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
877 // Get txindex from current proposed changes
878 txindex = mapTestPool[prevout.hash];
882 // Read txindex from txdb
883 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
885 if (!fFound && (fBlock || fMiner))
886 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());
890 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
892 // Get prev tx from single transactions in memory
893 CRITICAL_BLOCK(cs_mapTransactions)
895 if (!mapTransactions.count(prevout.hash))
896 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
897 txPrev = mapTransactions[prevout.hash];
900 txindex.vSpent.resize(txPrev.vout.size());
904 // Get prev tx from disk
905 if (!txPrev.ReadFromDisk(txindex.pos))
906 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
909 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
911 // Revisit this if/when transaction replacement is implemented and allows
914 return error("ConnectInputs() : %s prevout.n out of range %d %d %d prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str());
917 // If prev is coinbase, check that it's matured
918 if (txPrev.IsCoinBase())
919 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
920 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
921 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
924 if (!VerifySignature(txPrev, *this, i))
925 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
927 // Check for conflicts
928 if (!txindex.vSpent[prevout.n].IsNull())
929 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());
931 // Check for negative or overflow input values
932 nValueIn += txPrev.vout[prevout.n].nValue;
933 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
934 return error("ConnectInputs() : txin values out of range");
936 // Mark outpoints as spent
937 txindex.vSpent[prevout.n] = posThisTx;
940 if (fBlock || fMiner)
942 mapTestPool[prevout.hash] = txindex;
946 if (nValueIn < GetValueOut())
947 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
949 // Tally transaction fees
950 int64 nTxFee = nValueIn - GetValueOut();
952 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
953 if (nTxFee < nMinFee)
956 if (!MoneyRange(nFees))
957 return error("ConnectInputs() : nFees out of range");
962 // Add transaction to changes
963 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
967 // Add transaction to test pool
968 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
975 bool CTransaction::ClientConnectInputs()
980 // Take over previous transactions' spent pointers
981 CRITICAL_BLOCK(cs_mapTransactions)
984 for (int i = 0; i < vin.size(); i++)
986 // Get prev tx from single transactions in memory
987 COutPoint prevout = vin[i].prevout;
988 if (!mapTransactions.count(prevout.hash))
990 CTransaction& txPrev = mapTransactions[prevout.hash];
992 if (prevout.n >= txPrev.vout.size())
996 if (!VerifySignature(txPrev, *this, i))
997 return error("ConnectInputs() : VerifySignature failed");
999 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1000 ///// this has to go away now that posNext is gone
1001 // // Check for conflicts
1002 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1003 // return error("ConnectInputs() : prev tx already used");
1005 // // Flag outpoints as used
1006 // txPrev.vout[prevout.n].posNext = posThisTx;
1008 nValueIn += txPrev.vout[prevout.n].nValue;
1010 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1011 return error("ClientConnectInputs() : txin values out of range");
1013 if (GetValueOut() > nValueIn)
1023 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1025 // Disconnect in reverse order
1026 for (int i = vtx.size()-1; i >= 0; i--)
1027 if (!vtx[i].DisconnectInputs(txdb))
1030 // Update block index on disk without changing it in memory.
1031 // The memory index structure will be changed after the db commits.
1034 CDiskBlockIndex blockindexPrev(pindex->pprev);
1035 blockindexPrev.hashNext = 0;
1036 if (!txdb.WriteBlockIndex(blockindexPrev))
1037 return error("DisconnectBlock() : WriteBlockIndex failed");
1043 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1045 // Check it again in case a previous version let a bad block in
1049 //// issue here: it doesn't know the version
1050 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1052 map<uint256, CTxIndex> mapQueuedChanges;
1054 BOOST_FOREACH(CTransaction& tx, vtx)
1056 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1057 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1060 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false, 0, fInvalid))
1063 // Write queued txindex changes
1064 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1066 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1067 return error("ConnectBlock() : UpdateTxIndex failed");
1070 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1073 // Update block index on disk without changing it in memory.
1074 // The memory index structure will be changed after the db commits.
1077 CDiskBlockIndex blockindexPrev(pindex->pprev);
1078 blockindexPrev.hashNext = pindex->GetBlockHash();
1079 if (!txdb.WriteBlockIndex(blockindexPrev))
1080 return error("ConnectBlock() : WriteBlockIndex failed");
1083 // Watch for transactions paying to me
1084 BOOST_FOREACH(CTransaction& tx, vtx)
1085 SyncWithWallets(tx, this, true);
1090 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1092 printf("REORGANIZE\n");
1095 CBlockIndex* pfork = pindexBest;
1096 CBlockIndex* plonger = pindexNew;
1097 while (pfork != plonger)
1099 while (plonger->nHeight > pfork->nHeight)
1100 if (!(plonger = plonger->pprev))
1101 return error("Reorganize() : plonger->pprev is null");
1102 if (pfork == plonger)
1104 if (!(pfork = pfork->pprev))
1105 return error("Reorganize() : pfork->pprev is null");
1108 // List of what to disconnect
1109 vector<CBlockIndex*> vDisconnect;
1110 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1111 vDisconnect.push_back(pindex);
1113 // List of what to connect
1114 vector<CBlockIndex*> vConnect;
1115 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1116 vConnect.push_back(pindex);
1117 reverse(vConnect.begin(), vConnect.end());
1119 // Disconnect shorter branch
1120 vector<CTransaction> vResurrect;
1121 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1124 if (!block.ReadFromDisk(pindex))
1125 return error("Reorganize() : ReadFromDisk for disconnect failed");
1126 if (!block.DisconnectBlock(txdb, pindex))
1127 return error("Reorganize() : DisconnectBlock failed");
1129 // Queue memory transactions to resurrect
1130 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1131 if (!tx.IsCoinBase())
1132 vResurrect.push_back(tx);
1135 // Connect longer branch
1136 vector<CTransaction> vDelete;
1137 for (int i = 0; i < vConnect.size(); i++)
1139 CBlockIndex* pindex = vConnect[i];
1141 if (!block.ReadFromDisk(pindex))
1142 return error("Reorganize() : ReadFromDisk for connect failed");
1143 if (!block.ConnectBlock(txdb, pindex))
1147 return error("Reorganize() : ConnectBlock failed");
1150 // Queue memory transactions to delete
1151 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1152 vDelete.push_back(tx);
1154 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1155 return error("Reorganize() : WriteHashBestChain failed");
1157 // Make sure it's successfully written to disk before changing memory structure
1158 if (!txdb.TxnCommit())
1159 return error("Reorganize() : TxnCommit failed");
1161 // Disconnect shorter branch
1162 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1164 pindex->pprev->pnext = NULL;
1166 // Connect longer branch
1167 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1169 pindex->pprev->pnext = pindex;
1171 // Resurrect memory transactions that were in the disconnected branch
1172 BOOST_FOREACH(CTransaction& tx, vResurrect)
1173 tx.AcceptToMemoryPool(txdb, false);
1175 // Delete redundant memory transactions that are in the connected branch
1176 BOOST_FOREACH(CTransaction& tx, vDelete)
1177 tx.RemoveFromMemoryPool();
1183 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1185 uint256 hash = GetHash();
1188 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1190 txdb.WriteHashBestChain(hash);
1191 if (!txdb.TxnCommit())
1192 return error("SetBestChain() : TxnCommit failed");
1193 pindexGenesisBlock = pindexNew;
1195 else if (hashPrevBlock == hashBestChain)
1197 // Adding to current best branch
1198 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1201 InvalidChainFound(pindexNew);
1202 return error("SetBestChain() : ConnectBlock failed");
1204 if (!txdb.TxnCommit())
1205 return error("SetBestChain() : TxnCommit failed");
1207 // Add to current best branch
1208 pindexNew->pprev->pnext = pindexNew;
1210 // Delete redundant memory transactions
1211 BOOST_FOREACH(CTransaction& tx, vtx)
1212 tx.RemoveFromMemoryPool();
1217 if (!Reorganize(txdb, pindexNew))
1220 InvalidChainFound(pindexNew);
1221 return error("SetBestChain() : Reorganize failed");
1225 // Update best block in wallet (so we can detect restored wallets)
1226 if (!IsInitialBlockDownload())
1228 const CBlockLocator locator(pindexNew);
1229 ::SetBestChain(locator);
1233 hashBestChain = hash;
1234 pindexBest = pindexNew;
1235 nBestHeight = pindexBest->nHeight;
1236 bnBestChainWork = pindexNew->bnChainWork;
1237 nTimeBestReceived = GetTime();
1238 nTransactionsUpdated++;
1239 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1245 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1247 // Check for duplicate
1248 uint256 hash = GetHash();
1249 if (mapBlockIndex.count(hash))
1250 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1252 // Construct new block index object
1253 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1255 return error("AddToBlockIndex() : new CBlockIndex failed");
1256 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1257 pindexNew->phashBlock = &((*mi).first);
1258 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1259 if (miPrev != mapBlockIndex.end())
1261 pindexNew->pprev = (*miPrev).second;
1262 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1264 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1268 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1269 if (!txdb.TxnCommit())
1273 if (pindexNew->bnChainWork > bnBestChainWork)
1274 if (!SetBestChain(txdb, pindexNew))
1279 if (pindexNew == pindexBest)
1281 // Notify UI to display prev block's coinbase if it was ours
1282 static uint256 hashPrevBestCoinBase;
1283 UpdatedTransaction(hashPrevBestCoinBase);
1284 hashPrevBestCoinBase = vtx[0].GetHash();
1294 bool CBlock::CheckBlock() const
1296 // These are checks that are independent of context
1297 // that can be verified before saving an orphan block.
1300 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1301 return error("CheckBlock() : size limits failed");
1303 // Check proof of work matches claimed amount
1304 if (!CheckProofOfWork(GetHash(), nBits))
1305 return error("CheckBlock() : proof of work failed");
1308 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1309 return error("CheckBlock() : block timestamp too far in the future");
1311 // First transaction must be coinbase, the rest must not be
1312 if (vtx.empty() || !vtx[0].IsCoinBase())
1313 return error("CheckBlock() : first tx is not coinbase");
1314 for (int i = 1; i < vtx.size(); i++)
1315 if (vtx[i].IsCoinBase())
1316 return error("CheckBlock() : more than one coinbase");
1318 // Check transactions
1319 BOOST_FOREACH(const CTransaction& tx, vtx)
1320 if (!tx.CheckTransaction())
1321 return error("CheckBlock() : CheckTransaction failed");
1323 // Check that it's not full of nonstandard transactions
1324 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1325 return error("CheckBlock() : too many nonstandard transactions");
1328 if (hashMerkleRoot != BuildMerkleTree())
1329 return error("CheckBlock() : hashMerkleRoot mismatch");
1334 bool CBlock::AcceptBlock()
1336 // Check for duplicate
1337 uint256 hash = GetHash();
1338 if (mapBlockIndex.count(hash))
1339 return error("AcceptBlock() : block already in mapBlockIndex");
1341 // Get prev block index
1342 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1343 if (mi == mapBlockIndex.end())
1344 return error("AcceptBlock() : prev block not found");
1345 CBlockIndex* pindexPrev = (*mi).second;
1346 int nHeight = pindexPrev->nHeight+1;
1348 // Check proof of work
1349 if (nBits != GetNextWorkRequired(pindexPrev, this))
1350 return error("AcceptBlock() : incorrect proof of work");
1352 // Check timestamp against prev
1353 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1354 return error("AcceptBlock() : block's timestamp is too early");
1356 // Check that all transactions are finalized
1357 BOOST_FOREACH(const CTransaction& tx, vtx)
1358 if (!tx.IsFinal(nHeight, GetBlockTime()))
1359 return error("AcceptBlock() : contains a non-final transaction");
1361 // Check that the block chain matches the known block chain up to a checkpoint
1362 if (!Checkpoints::CheckBlock(nHeight, hash))
1363 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1365 // Write block to history file
1366 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1367 return error("AcceptBlock() : out of disk space");
1368 unsigned int nFile = -1;
1369 unsigned int nBlockPos = 0;
1370 if (!WriteToDisk(nFile, nBlockPos))
1371 return error("AcceptBlock() : WriteToDisk failed");
1372 if (!AddToBlockIndex(nFile, nBlockPos))
1373 return error("AcceptBlock() : AddToBlockIndex failed");
1375 // Relay inventory, but don't relay old inventory during initial block download
1376 if (hashBestChain == hash)
1377 CRITICAL_BLOCK(cs_vNodes)
1378 BOOST_FOREACH(CNode* pnode, vNodes)
1379 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1380 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1385 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1387 // Check for duplicate
1388 uint256 hash = pblock->GetHash();
1389 if (mapBlockIndex.count(hash))
1390 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1391 if (mapOrphanBlocks.count(hash))
1392 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1394 // Preliminary checks
1395 if (!pblock->CheckBlock())
1396 return error("ProcessBlock() : CheckBlock FAILED");
1398 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1399 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1401 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1402 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1405 return error("ProcessBlock() : block with timestamp before last checkpoint");
1408 bnNewBlock.SetCompact(pblock->nBits);
1410 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1411 if (bnNewBlock > bnRequired)
1413 return error("ProcessBlock() : block with too little proof-of-work");
1418 // If don't already have its previous block, shunt it off to holding area until we get it
1419 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1421 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1422 CBlock* pblock2 = new CBlock(*pblock);
1423 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1424 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1426 // Ask this guy to fill in what we're missing
1428 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1433 if (!pblock->AcceptBlock())
1434 return error("ProcessBlock() : AcceptBlock FAILED");
1436 // Recursively process any orphan blocks that depended on this one
1437 vector<uint256> vWorkQueue;
1438 vWorkQueue.push_back(hash);
1439 for (int i = 0; i < vWorkQueue.size(); i++)
1441 uint256 hashPrev = vWorkQueue[i];
1442 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1443 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1446 CBlock* pblockOrphan = (*mi).second;
1447 if (pblockOrphan->AcceptBlock())
1448 vWorkQueue.push_back(pblockOrphan->GetHash());
1449 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1450 delete pblockOrphan;
1452 mapOrphanBlocksByPrev.erase(hashPrev);
1455 printf("ProcessBlock: ACCEPTED\n");
1466 bool CheckDiskSpace(uint64 nAdditionalBytes)
1468 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1470 // Check for 15MB because database could create another 10MB log file at any time
1471 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1474 string strMessage = _("Warning: Disk space is low ");
1475 strMiscWarning = strMessage;
1476 printf("*** %s\n", strMessage.c_str());
1477 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1478 CreateThread(Shutdown, NULL);
1484 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1488 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1491 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1493 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1502 static unsigned int nCurrentBlockFile = 1;
1504 FILE* AppendBlockFile(unsigned int& nFileRet)
1509 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1512 if (fseek(file, 0, SEEK_END) != 0)
1514 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1515 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1517 nFileRet = nCurrentBlockFile;
1521 nCurrentBlockFile++;
1525 bool LoadBlockIndex(bool fAllowNew)
1529 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1530 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1531 pchMessageStart[0] = 0xfa;
1532 pchMessageStart[1] = 0xbf;
1533 pchMessageStart[2] = 0xb5;
1534 pchMessageStart[3] = 0xda;
1541 if (!txdb.LoadBlockIndex())
1546 // Init with genesis block
1548 if (mapBlockIndex.empty())
1554 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1555 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1556 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1557 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1558 // vMerkleTree: 4a5e1e
1561 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1563 txNew.vin.resize(1);
1564 txNew.vout.resize(1);
1565 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1566 txNew.vout[0].nValue = 50 * COIN;
1567 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1569 block.vtx.push_back(txNew);
1570 block.hashPrevBlock = 0;
1571 block.hashMerkleRoot = block.BuildMerkleTree();
1573 block.nTime = 1231006505;
1574 block.nBits = 0x1d00ffff;
1575 block.nNonce = 2083236893;
1579 block.nTime = 1296688602;
1580 block.nBits = 0x1d07fff8;
1581 block.nNonce = 384568319;
1585 printf("%s\n", block.GetHash().ToString().c_str());
1586 printf("%s\n", hashGenesisBlock.ToString().c_str());
1587 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1588 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1590 assert(block.GetHash() == hashGenesisBlock);
1592 // Start new block file
1594 unsigned int nBlockPos;
1595 if (!block.WriteToDisk(nFile, nBlockPos))
1596 return error("LoadBlockIndex() : writing genesis block to disk failed");
1597 if (!block.AddToBlockIndex(nFile, nBlockPos))
1598 return error("LoadBlockIndex() : genesis block not accepted");
1606 void PrintBlockTree()
1608 // precompute tree structure
1609 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1610 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1612 CBlockIndex* pindex = (*mi).second;
1613 mapNext[pindex->pprev].push_back(pindex);
1615 //while (rand() % 3 == 0)
1616 // mapNext[pindex->pprev].push_back(pindex);
1619 vector<pair<int, CBlockIndex*> > vStack;
1620 vStack.push_back(make_pair(0, pindexGenesisBlock));
1623 while (!vStack.empty())
1625 int nCol = vStack.back().first;
1626 CBlockIndex* pindex = vStack.back().second;
1629 // print split or gap
1630 if (nCol > nPrevCol)
1632 for (int i = 0; i < nCol-1; i++)
1636 else if (nCol < nPrevCol)
1638 for (int i = 0; i < nCol; i++)
1645 for (int i = 0; i < nCol; i++)
1650 block.ReadFromDisk(pindex);
1651 printf("%d (%u,%u) %s %s tx %d",
1655 block.GetHash().ToString().substr(0,20).c_str(),
1656 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1659 PrintWallets(block);
1661 // put the main timechain first
1662 vector<CBlockIndex*>& vNext = mapNext[pindex];
1663 for (int i = 0; i < vNext.size(); i++)
1665 if (vNext[i]->pnext)
1667 swap(vNext[0], vNext[i]);
1673 for (int i = 0; i < vNext.size(); i++)
1674 vStack.push_back(make_pair(nCol+i, vNext[i]));
1687 //////////////////////////////////////////////////////////////////////////////
1692 map<uint256, CAlert> mapAlerts;
1693 CCriticalSection cs_mapAlerts;
1695 string GetWarnings(string strFor)
1698 string strStatusBar;
1700 if (GetBoolArg("-testsafemode"))
1703 // Misc warnings like out of disk space and clock is wrong
1704 if (strMiscWarning != "")
1707 strStatusBar = strMiscWarning;
1710 // Longer invalid proof-of-work chain
1711 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1714 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1718 CRITICAL_BLOCK(cs_mapAlerts)
1720 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1722 const CAlert& alert = item.second;
1723 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1725 nPriority = alert.nPriority;
1726 strStatusBar = alert.strStatusBar;
1731 if (strFor == "statusbar")
1732 return strStatusBar;
1733 else if (strFor == "rpc")
1735 assert(!"GetWarnings() : invalid parameter");
1739 bool CAlert::ProcessAlert()
1741 if (!CheckSignature())
1746 CRITICAL_BLOCK(cs_mapAlerts)
1748 // Cancel previous alerts
1749 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1751 const CAlert& alert = (*mi).second;
1754 printf("cancelling alert %d\n", alert.nID);
1755 mapAlerts.erase(mi++);
1757 else if (!alert.IsInEffect())
1759 printf("expiring alert %d\n", alert.nID);
1760 mapAlerts.erase(mi++);
1766 // Check if this alert has been cancelled
1767 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1769 const CAlert& alert = item.second;
1770 if (alert.Cancels(*this))
1772 printf("alert already cancelled by %d\n", alert.nID);
1778 mapAlerts.insert(make_pair(GetHash(), *this));
1781 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1793 //////////////////////////////////////////////////////////////////////////////
1799 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1803 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1804 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1806 // Don't know what it is, just say we already got one
1813 // The message start string is designed to be unlikely to occur in normal data.
1814 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1815 // a large 4-byte int at any alignment.
1816 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1819 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1821 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1822 RandAddSeedPerfmon();
1824 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1825 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1827 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1829 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1837 if (strCommand == "version")
1839 // Each connection can only send one version message
1840 if (pfrom->nVersion != 0)
1847 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1848 if (pfrom->nVersion == 10300)
1849 pfrom->nVersion = 300;
1850 if (pfrom->nVersion >= 106 && !vRecv.empty())
1851 vRecv >> addrFrom >> nNonce;
1852 if (pfrom->nVersion >= 106 && !vRecv.empty())
1853 vRecv >> pfrom->strSubVer;
1854 if (pfrom->nVersion >= 209 && !vRecv.empty())
1855 vRecv >> pfrom->nStartingHeight;
1857 if (pfrom->nVersion == 0)
1860 // Disconnect if we connected to ourself
1861 if (nNonce == nLocalHostNonce && nNonce > 1)
1863 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1864 pfrom->fDisconnect = true;
1868 // Be shy and don't send version until we hear
1869 if (pfrom->fInbound)
1870 pfrom->PushVersion();
1872 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1874 AddTimeData(pfrom->addr.ip, nTime);
1877 if (pfrom->nVersion >= 209)
1878 pfrom->PushMessage("verack");
1879 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1880 if (pfrom->nVersion < 209)
1881 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1883 if (!pfrom->fInbound)
1885 // Advertise our address
1886 if (addrLocalHost.IsRoutable() && !fUseProxy)
1888 CAddress addr(addrLocalHost);
1889 addr.nTime = GetAdjustedTime();
1890 pfrom->PushAddress(addr);
1893 // Get recent addresses
1894 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1896 pfrom->PushMessage("getaddr");
1897 pfrom->fGetAddr = true;
1901 // Ask the first connected node for block updates
1902 static int nAskedForBlocks;
1903 if (!pfrom->fClient &&
1904 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
1905 (nAskedForBlocks < 1 || vNodes.size() <= 1))
1908 pfrom->PushGetBlocks(pindexBest, uint256(0));
1912 CRITICAL_BLOCK(cs_mapAlerts)
1913 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1914 item.second.RelayTo(pfrom);
1916 pfrom->fSuccessfullyConnected = true;
1918 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1922 else if (pfrom->nVersion == 0)
1924 // Must have a version message before anything else
1929 else if (strCommand == "verack")
1931 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1935 else if (strCommand == "addr")
1937 vector<CAddress> vAddr;
1940 // Don't want addr from older versions unless seeding
1941 if (pfrom->nVersion < 209)
1943 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1945 if (vAddr.size() > 1000)
1946 return error("message addr size() = %d", vAddr.size());
1948 // Store the new addresses
1951 int64 nNow = GetAdjustedTime();
1952 int64 nSince = nNow - 10 * 60;
1953 BOOST_FOREACH(CAddress& addr, vAddr)
1957 // ignore IPv6 for now, since it isn't implemented anyway
1960 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1961 addr.nTime = nNow - 5 * 24 * 60 * 60;
1962 AddAddress(addr, 2 * 60 * 60, &addrDB);
1963 pfrom->AddAddressKnown(addr);
1964 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1966 // Relay to a limited number of other nodes
1967 CRITICAL_BLOCK(cs_vNodes)
1969 // Use deterministic randomness to send to the same nodes for 24 hours
1970 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1971 static uint256 hashSalt;
1973 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1974 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1975 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1976 multimap<uint256, CNode*> mapMix;
1977 BOOST_FOREACH(CNode* pnode, vNodes)
1979 if (pnode->nVersion < 31402)
1981 unsigned int nPointer;
1982 memcpy(&nPointer, &pnode, sizeof(nPointer));
1983 uint256 hashKey = hashRand ^ nPointer;
1984 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1985 mapMix.insert(make_pair(hashKey, pnode));
1987 int nRelayNodes = 2;
1988 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1989 ((*mi).second)->PushAddress(addr);
1993 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
1994 if (vAddr.size() < 1000)
1995 pfrom->fGetAddr = false;
1999 else if (strCommand == "inv")
2003 if (vInv.size() > 50000)
2004 return error("message inv size() = %d", vInv.size());
2007 BOOST_FOREACH(const CInv& inv, vInv)
2011 pfrom->AddInventoryKnown(inv);
2013 bool fAlreadyHave = AlreadyHave(txdb, inv);
2015 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2019 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2020 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2022 // Track requests for our stuff
2023 Inventory(inv.hash);
2028 else if (strCommand == "getdata")
2032 if (vInv.size() > 50000)
2033 return error("message getdata size() = %d", vInv.size());
2035 BOOST_FOREACH(const CInv& inv, vInv)
2039 printf("received getdata for: %s\n", inv.ToString().c_str());
2041 if (inv.type == MSG_BLOCK)
2043 // Send block from disk
2044 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2045 if (mi != mapBlockIndex.end())
2048 block.ReadFromDisk((*mi).second);
2049 pfrom->PushMessage("block", block);
2051 // Trigger them to send a getblocks request for the next batch of inventory
2052 if (inv.hash == pfrom->hashContinue)
2054 // Bypass PushInventory, this must send even if redundant,
2055 // and we want it right after the last block so they don't
2056 // wait for other stuff first.
2058 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2059 pfrom->PushMessage("inv", vInv);
2060 pfrom->hashContinue = 0;
2064 else if (inv.IsKnownType())
2066 // Send stream from relay memory
2067 CRITICAL_BLOCK(cs_mapRelay)
2069 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2070 if (mi != mapRelay.end())
2071 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2075 // Track requests for our stuff
2076 Inventory(inv.hash);
2081 else if (strCommand == "getblocks")
2083 CBlockLocator locator;
2085 vRecv >> locator >> hashStop;
2087 // Find the last block the caller has in the main chain
2088 CBlockIndex* pindex = locator.GetBlockIndex();
2090 // Send the rest of the chain
2092 pindex = pindex->pnext;
2093 int nLimit = 500 + locator.GetDistanceBack();
2094 unsigned int nBytes = 0;
2095 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2096 for (; pindex; pindex = pindex->pnext)
2098 if (pindex->GetBlockHash() == hashStop)
2100 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2103 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2105 block.ReadFromDisk(pindex, true);
2106 nBytes += block.GetSerializeSize(SER_NETWORK);
2107 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2109 // When this block is requested, we'll send an inv that'll make them
2110 // getblocks the next batch of inventory.
2111 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2112 pfrom->hashContinue = pindex->GetBlockHash();
2119 else if (strCommand == "getheaders")
2121 CBlockLocator locator;
2123 vRecv >> locator >> hashStop;
2125 CBlockIndex* pindex = NULL;
2126 if (locator.IsNull())
2128 // If locator is null, return the hashStop block
2129 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2130 if (mi == mapBlockIndex.end())
2132 pindex = (*mi).second;
2136 // Find the last block the caller has in the main chain
2137 pindex = locator.GetBlockIndex();
2139 pindex = pindex->pnext;
2142 vector<CBlock> vHeaders;
2143 int nLimit = 2000 + locator.GetDistanceBack();
2144 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2145 for (; pindex; pindex = pindex->pnext)
2147 vHeaders.push_back(pindex->GetBlockHeader());
2148 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2151 pfrom->PushMessage("headers", vHeaders);
2155 else if (strCommand == "tx")
2157 vector<uint256> vWorkQueue;
2158 CDataStream vMsg(vRecv);
2162 CInv inv(MSG_TX, tx.GetHash());
2163 pfrom->AddInventoryKnown(inv);
2165 bool fMissingInputs = false;
2166 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2168 SyncWithWallets(tx, NULL, true);
2169 RelayMessage(inv, vMsg);
2170 mapAlreadyAskedFor.erase(inv);
2171 vWorkQueue.push_back(inv.hash);
2173 // Recursively process any orphan transactions that depended on this one
2174 for (int i = 0; i < vWorkQueue.size(); i++)
2176 uint256 hashPrev = vWorkQueue[i];
2177 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2178 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2181 const CDataStream& vMsg = *((*mi).second);
2183 CDataStream(vMsg) >> tx;
2184 CInv inv(MSG_TX, tx.GetHash());
2186 if (tx.AcceptToMemoryPool(true))
2188 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2189 SyncWithWallets(tx, NULL, true);
2190 RelayMessage(inv, vMsg);
2191 mapAlreadyAskedFor.erase(inv);
2192 vWorkQueue.push_back(inv.hash);
2197 BOOST_FOREACH(uint256 hash, vWorkQueue)
2198 EraseOrphanTx(hash);
2200 else if (fMissingInputs)
2202 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2205 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
2206 int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
2208 printf("mapOrphan overflow, removed %d tx\n", nEvicted);
2213 else if (strCommand == "block")
2218 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2221 CInv inv(MSG_BLOCK, block.GetHash());
2222 pfrom->AddInventoryKnown(inv);
2224 if (ProcessBlock(pfrom, &block))
2225 mapAlreadyAskedFor.erase(inv);
2229 else if (strCommand == "getaddr")
2231 // Nodes rebroadcast an addr every 24 hours
2232 pfrom->vAddrToSend.clear();
2233 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2234 CRITICAL_BLOCK(cs_mapAddresses)
2236 unsigned int nCount = 0;
2237 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2239 const CAddress& addr = item.second;
2240 if (addr.nTime > nSince)
2243 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2245 const CAddress& addr = item.second;
2246 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2247 pfrom->PushAddress(addr);
2253 else if (strCommand == "checkorder")
2258 if (!GetBoolArg("-allowreceivebyip"))
2260 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2267 /// we have a chance to check the order here
2269 // Keep giving the same key to the same ip until they use it
2270 if (!mapReuseKey.count(pfrom->addr.ip))
2271 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2273 // Send back approval of order and pubkey to use
2274 CScript scriptPubKey;
2275 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2276 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2280 else if (strCommand == "reply")
2285 CRequestTracker tracker;
2286 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2288 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2289 if (mi != pfrom->mapRequests.end())
2291 tracker = (*mi).second;
2292 pfrom->mapRequests.erase(mi);
2295 if (!tracker.IsNull())
2296 tracker.fn(tracker.param1, vRecv);
2300 else if (strCommand == "ping")
2305 else if (strCommand == "alert")
2310 if (alert.ProcessAlert())
2313 pfrom->setKnown.insert(alert.GetHash());
2314 CRITICAL_BLOCK(cs_vNodes)
2315 BOOST_FOREACH(CNode* pnode, vNodes)
2316 alert.RelayTo(pnode);
2323 // Ignore unknown commands for extensibility
2327 // Update the last seen time for this node's address
2328 if (pfrom->fNetworkNode)
2329 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2330 AddressCurrentlyConnected(pfrom->addr);
2336 bool ProcessMessages(CNode* pfrom)
2338 CDataStream& vRecv = pfrom->vRecv;
2342 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2346 // (4) message start
2355 // Scan for message start
2356 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2357 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2358 if (vRecv.end() - pstart < nHeaderSize)
2360 if (vRecv.size() > nHeaderSize)
2362 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2363 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2367 if (pstart - vRecv.begin() > 0)
2368 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2369 vRecv.erase(vRecv.begin(), pstart);
2372 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2377 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2380 string strCommand = hdr.GetCommand();
2383 unsigned int nMessageSize = hdr.nMessageSize;
2384 if (nMessageSize > MAX_SIZE)
2386 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2389 if (nMessageSize > vRecv.size())
2391 // Rewind and wait for rest of message
2392 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2397 if (vRecv.GetVersion() >= 209)
2399 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2400 unsigned int nChecksum = 0;
2401 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2402 if (nChecksum != hdr.nChecksum)
2404 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2405 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2410 // Copy message to its own buffer
2411 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2412 vRecv.ignore(nMessageSize);
2418 CRITICAL_BLOCK(cs_main)
2419 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2423 catch (std::ios_base::failure& e)
2425 if (strstr(e.what(), "end of data"))
2427 // Allow exceptions from underlength message on vRecv
2428 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());
2430 else if (strstr(e.what(), "size too large"))
2432 // Allow exceptions from overlong size
2433 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2437 PrintExceptionContinue(&e, "ProcessMessage()");
2440 catch (std::exception& e) {
2441 PrintExceptionContinue(&e, "ProcessMessage()");
2443 PrintExceptionContinue(NULL, "ProcessMessage()");
2447 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2455 bool SendMessages(CNode* pto, bool fSendTrickle)
2457 CRITICAL_BLOCK(cs_main)
2459 // Don't send anything until we get their version message
2460 if (pto->nVersion == 0)
2464 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2465 pto->PushMessage("ping");
2467 // Resend wallet transactions that haven't gotten in a block yet
2468 ResendWalletTransactions();
2470 // Address refresh broadcast
2471 static int64 nLastRebroadcast;
2472 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2474 nLastRebroadcast = GetTime();
2475 CRITICAL_BLOCK(cs_vNodes)
2477 BOOST_FOREACH(CNode* pnode, vNodes)
2479 // Periodically clear setAddrKnown to allow refresh broadcasts
2480 pnode->setAddrKnown.clear();
2482 // Rebroadcast our address
2483 if (addrLocalHost.IsRoutable() && !fUseProxy)
2485 CAddress addr(addrLocalHost);
2486 addr.nTime = GetAdjustedTime();
2487 pnode->PushAddress(addr);
2493 // Clear out old addresses periodically so it's not too much work at once
2494 static int64 nLastClear;
2495 if (nLastClear == 0)
2496 nLastClear = GetTime();
2497 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2499 nLastClear = GetTime();
2500 CRITICAL_BLOCK(cs_mapAddresses)
2503 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2504 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2505 mi != mapAddresses.end();)
2507 const CAddress& addr = (*mi).second;
2508 if (addr.nTime < nSince)
2510 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2512 addrdb.EraseAddress(addr);
2513 mapAddresses.erase(mi++);
2527 vector<CAddress> vAddr;
2528 vAddr.reserve(pto->vAddrToSend.size());
2529 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2531 // returns true if wasn't already contained in the set
2532 if (pto->setAddrKnown.insert(addr).second)
2534 vAddr.push_back(addr);
2535 // receiver rejects addr messages larger than 1000
2536 if (vAddr.size() >= 1000)
2538 pto->PushMessage("addr", vAddr);
2543 pto->vAddrToSend.clear();
2545 pto->PushMessage("addr", vAddr);
2550 // Message: inventory
2553 vector<CInv> vInvWait;
2554 CRITICAL_BLOCK(pto->cs_inventory)
2556 vInv.reserve(pto->vInventoryToSend.size());
2557 vInvWait.reserve(pto->vInventoryToSend.size());
2558 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2560 if (pto->setInventoryKnown.count(inv))
2563 // trickle out tx inv to protect privacy
2564 if (inv.type == MSG_TX && !fSendTrickle)
2566 // 1/4 of tx invs blast to all immediately
2567 static uint256 hashSalt;
2569 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2570 uint256 hashRand = inv.hash ^ hashSalt;
2571 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2572 bool fTrickleWait = ((hashRand & 3) != 0);
2574 // always trickle our own transactions
2578 if (GetTransaction(inv.hash, wtx))
2580 fTrickleWait = true;
2585 vInvWait.push_back(inv);
2590 // returns true if wasn't already contained in the set
2591 if (pto->setInventoryKnown.insert(inv).second)
2593 vInv.push_back(inv);
2594 if (vInv.size() >= 1000)
2596 pto->PushMessage("inv", vInv);
2601 pto->vInventoryToSend = vInvWait;
2604 pto->PushMessage("inv", vInv);
2610 vector<CInv> vGetData;
2611 int64 nNow = GetTime() * 1000000;
2613 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2615 const CInv& inv = (*pto->mapAskFor.begin()).second;
2616 if (!AlreadyHave(txdb, inv))
2618 printf("sending getdata: %s\n", inv.ToString().c_str());
2619 vGetData.push_back(inv);
2620 if (vGetData.size() >= 1000)
2622 pto->PushMessage("getdata", vGetData);
2626 mapAlreadyAskedFor[inv] = nNow;
2627 pto->mapAskFor.erase(pto->mapAskFor.begin());
2629 if (!vGetData.empty())
2630 pto->PushMessage("getdata", vGetData);
2649 //////////////////////////////////////////////////////////////////////////////
2654 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2656 unsigned char* pdata = (unsigned char*)pbuffer;
2657 unsigned int blocks = 1 + ((len + 8) / 64);
2658 unsigned char* pend = pdata + 64 * blocks;
2659 memset(pdata + len, 0, 64 * blocks - len);
2661 unsigned int bits = len * 8;
2662 pend[-1] = (bits >> 0) & 0xff;
2663 pend[-2] = (bits >> 8) & 0xff;
2664 pend[-3] = (bits >> 16) & 0xff;
2665 pend[-4] = (bits >> 24) & 0xff;
2669 using CryptoPP::ByteReverse;
2671 static const unsigned int pSHA256InitState[8] =
2672 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2674 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2676 memcpy(pstate, pinit, 32);
2677 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2681 // ScanHash scans nonces looking for a hash with at least some zero bits.
2682 // It operates on big endian data. Caller does the byte reversing.
2683 // All input buffers are 16-byte aligned. nNonce is usually preserved
2684 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2685 // the block is rebuilt and nNonce starts over at zero.
2687 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2689 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2693 // Hash pdata using pmidstate as the starting state into
2694 // preformatted buffer phash1, then hash phash1 into phash
2696 SHA256Transform(phash1, pdata, pmidstate);
2697 SHA256Transform(phash, phash1, pSHA256InitState);
2699 // Return the nonce if the hash has at least some zero bits,
2700 // caller will check if it has enough to reach the target
2701 if (((unsigned short*)phash)[14] == 0)
2704 // If nothing found after trying for a while, return -1
2705 if ((nNonce & 0xffff) == 0)
2707 nHashesDone = 0xffff+1;
2713 // Some explaining would be appreciated
2718 set<uint256> setDependsOn;
2721 COrphan(CTransaction* ptxIn)
2729 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2730 BOOST_FOREACH(uint256 hash, setDependsOn)
2731 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2736 CBlock* CreateNewBlock(CReserveKey& reservekey)
2738 CBlockIndex* pindexPrev = pindexBest;
2741 auto_ptr<CBlock> pblock(new CBlock());
2745 // Create coinbase tx
2747 txNew.vin.resize(1);
2748 txNew.vin[0].prevout.SetNull();
2749 txNew.vout.resize(1);
2750 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2752 // Add our coinbase tx as first transaction
2753 pblock->vtx.push_back(txNew);
2755 // Collect memory pool transactions into the block
2757 CRITICAL_BLOCK(cs_main)
2758 CRITICAL_BLOCK(cs_mapTransactions)
2762 // Priority order to process transactions
2763 list<COrphan> vOrphan; // list memory doesn't move
2764 map<uint256, vector<COrphan*> > mapDependers;
2765 multimap<double, CTransaction*> mapPriority;
2766 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2768 CTransaction& tx = (*mi).second;
2769 if (tx.IsCoinBase() || !tx.IsFinal())
2772 COrphan* porphan = NULL;
2773 double dPriority = 0;
2774 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2776 // Read prev transaction
2777 CTransaction txPrev;
2779 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2781 // Has to wait for dependencies
2784 // Use list for automatic deletion
2785 vOrphan.push_back(COrphan(&tx));
2786 porphan = &vOrphan.back();
2788 mapDependers[txin.prevout.hash].push_back(porphan);
2789 porphan->setDependsOn.insert(txin.prevout.hash);
2792 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2794 // Read block header
2795 int nConf = txindex.GetDepthInMainChain();
2797 dPriority += (double)nValueIn * nConf;
2799 if (fDebug && GetBoolArg("-printpriority"))
2800 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2803 // Priority is sum(valuein * age) / txsize
2804 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2807 porphan->dPriority = dPriority;
2809 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2811 if (fDebug && GetBoolArg("-printpriority"))
2813 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2820 // Collect transactions into block
2821 map<uint256, CTxIndex> mapTestPool;
2822 uint64 nBlockSize = 1000;
2823 int nBlockSigOps = 100;
2824 while (!mapPriority.empty())
2826 // Take highest priority transaction off priority queue
2827 double dPriority = -(*mapPriority.begin()).first;
2828 CTransaction& tx = *(*mapPriority.begin()).second;
2829 mapPriority.erase(mapPriority.begin());
2832 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2833 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2835 int nTxSigOps = tx.GetSigOpCount();
2836 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2839 // Transaction fee required depends on block size
2840 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2841 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
2843 // Connecting shouldn't fail due to dependency on other memory pool transactions
2844 // because we're already processing them in order of dependency
2845 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2847 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee, fInvalid))
2849 swap(mapTestPool, mapTestPoolTmp);
2852 pblock->vtx.push_back(tx);
2853 nBlockSize += nTxSize;
2854 nBlockSigOps += nTxSigOps;
2856 // Add transactions that depend on this one to the priority queue
2857 uint256 hash = tx.GetHash();
2858 if (mapDependers.count(hash))
2860 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2862 if (!porphan->setDependsOn.empty())
2864 porphan->setDependsOn.erase(hash);
2865 if (porphan->setDependsOn.empty())
2866 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2872 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2875 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2876 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2877 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2878 pblock->nBits = GetNextWorkRequired(pindexPrev, pblock.get());
2881 return pblock.release();
2885 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
2887 // Update nExtraNonce
2888 static uint256 hashPrevBlock;
2889 if (hashPrevBlock != pblock->hashPrevBlock)
2892 hashPrevBlock = pblock->hashPrevBlock;
2895 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
2896 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2900 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2903 // Prebuild hash buffers
2910 uint256 hashPrevBlock;
2911 uint256 hashMerkleRoot;
2914 unsigned int nNonce;
2917 unsigned char pchPadding0[64];
2919 unsigned char pchPadding1[64];
2922 memset(&tmp, 0, sizeof(tmp));
2924 tmp.block.nVersion = pblock->nVersion;
2925 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2926 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2927 tmp.block.nTime = pblock->nTime;
2928 tmp.block.nBits = pblock->nBits;
2929 tmp.block.nNonce = pblock->nNonce;
2931 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2932 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2934 // Byte swap all the input buffer
2935 for (int i = 0; i < sizeof(tmp)/4; i++)
2936 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2938 // Precalc the first half of the first hash, which stays constant
2939 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2941 memcpy(pdata, &tmp.block, 128);
2942 memcpy(phash1, &tmp.hash1, 64);
2946 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2948 uint256 hash = pblock->GetHash();
2949 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2951 if (hash > hashTarget)
2955 printf("BitcoinMiner:\n");
2956 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2958 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2959 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2962 CRITICAL_BLOCK(cs_main)
2964 if (pblock->hashPrevBlock != hashBestChain)
2965 return error("BitcoinMiner : generated block is stale");
2967 // Remove key from key pool
2968 reservekey.KeepKey();
2970 // Track how many getdata requests this block gets
2971 CRITICAL_BLOCK(wallet.cs_wallet)
2972 wallet.mapRequestCount[pblock->GetHash()] = 0;
2974 // Process this block the same as if we had received it from another node
2975 if (!ProcessBlock(NULL, pblock))
2976 return error("BitcoinMiner : ProcessBlock, block not accepted");
2983 void static ThreadBitcoinMiner(void* parg);
2985 void static BitcoinMiner(CWallet *pwallet)
2987 printf("BitcoinMiner started\n");
2988 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2990 // Each thread has its own key and counter
2991 CReserveKey reservekey(pwallet);
2992 unsigned int nExtraNonce = 0;
2994 while (fGenerateBitcoins)
2996 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3000 while (vNodes.empty() || IsInitialBlockDownload())
3005 if (!fGenerateBitcoins)
3013 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3014 CBlockIndex* pindexPrev = pindexBest;
3016 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3019 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3021 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3025 // Prebuild hash buffers
3027 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3028 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3029 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3031 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3033 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3034 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3040 int64 nStart = GetTime();
3041 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3043 uint256& hash = *alignup<16>(hashbuf);
3046 unsigned int nHashesDone = 0;
3047 unsigned int nNonceFound;
3050 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3051 (char*)&hash, nHashesDone);
3053 // Check if something found
3054 if (nNonceFound != -1)
3056 for (int i = 0; i < sizeof(hash)/4; i++)
3057 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3059 if (hash <= hashTarget)
3062 pblock->nNonce = ByteReverse(nNonceFound);
3063 assert(hash == pblock->GetHash());
3065 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3066 CheckWork(pblock.get(), *pwalletMain, reservekey);
3067 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3073 static int64 nHashCounter;
3074 if (nHPSTimerStart == 0)
3076 nHPSTimerStart = GetTimeMillis();
3080 nHashCounter += nHashesDone;
3081 if (GetTimeMillis() - nHPSTimerStart > 4000)
3083 static CCriticalSection cs;
3086 if (GetTimeMillis() - nHPSTimerStart > 4000)
3088 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3089 nHPSTimerStart = GetTimeMillis();
3091 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3092 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3093 static int64 nLogTime;
3094 if (GetTime() - nLogTime > 30 * 60)
3096 nLogTime = GetTime();
3097 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3098 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3104 // Check for stop or if block needs to be rebuilt
3107 if (!fGenerateBitcoins)
3109 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3113 if (nBlockNonce >= 0xffff0000)
3115 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3117 if (pindexPrev != pindexBest)
3120 // Update nTime every few seconds
3121 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3122 nBlockTime = ByteReverse(pblock->nTime);
3127 void static ThreadBitcoinMiner(void* parg)
3129 CWallet* pwallet = (CWallet*)parg;
3132 vnThreadsRunning[3]++;
3133 BitcoinMiner(pwallet);
3134 vnThreadsRunning[3]--;
3136 catch (std::exception& e) {
3137 vnThreadsRunning[3]--;
3138 PrintException(&e, "ThreadBitcoinMiner()");
3140 vnThreadsRunning[3]--;
3141 PrintException(NULL, "ThreadBitcoinMiner()");
3143 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3145 if (vnThreadsRunning[3] == 0)
3147 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3151 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3153 if (fGenerateBitcoins != fGenerate)
3155 fGenerateBitcoins = fGenerate;
3156 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3159 if (fGenerateBitcoins)
3161 int nProcessors = boost::thread::hardware_concurrency();
3162 printf("%d processors\n", nProcessors);
3163 if (nProcessors < 1)
3165 if (fLimitProcessors && nProcessors > nLimitProcessors)
3166 nProcessors = nLimitProcessors;
3167 int nAddThreads = nProcessors - vnThreadsRunning[3];
3168 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3169 for (int i = 0; i < nAddThreads; i++)
3171 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3172 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");