1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Distributed under the MIT/X11 software license, see the accompanying
3 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
8 #include "cryptopp/sha.h"
9 #include <boost/filesystem.hpp>
10 #include <boost/filesystem/fstream.hpp>
13 using namespace boost;
19 CCriticalSection cs_setpwalletRegistered;
20 set<CWallet*> setpwalletRegistered;
22 CCriticalSection cs_main;
24 CCriticalSection cs_mapPubKeys;
25 map<uint160, vector<unsigned char> > mapPubKeys;
27 map<uint256, CTransaction> mapTransactions;
28 CCriticalSection cs_mapTransactions;
29 unsigned int nTransactionsUpdated = 0;
30 map<COutPoint, CInPoint> mapNextTx;
32 map<uint256, CBlockIndex*> mapBlockIndex;
33 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
34 CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
35 const int nTotalBlocksEstimate = 134444; // Conservative estimate of total nr of blocks on main chain
36 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
37 CBlockIndex* pindexGenesisBlock = NULL;
39 CBigNum bnBestChainWork = 0;
40 CBigNum bnBestInvalidWork = 0;
41 uint256 hashBestChain = 0;
42 CBlockIndex* pindexBest = NULL;
43 int64 nTimeBestReceived = 0;
45 map<uint256, CBlock*> mapOrphanBlocks;
46 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
48 map<uint256, CDataStream*> mapOrphanTransactions;
49 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
56 int fGenerateBitcoins = false;
57 int64 nTransactionFee = 0;
58 int fLimitProcessors = false;
59 int nLimitProcessors = 1;
60 int fMinimizeToTray = true;
61 int fMinimizeOnClose = true;
74 //////////////////////////////////////////////////////////////////////////////
76 // dispatching functions
79 void RegisterWallet(CWallet* pwalletIn)
81 CRITICAL_BLOCK(cs_setpwalletRegistered)
83 setpwalletRegistered.insert(pwalletIn);
87 void UnregisterWallet(CWallet* pwalletIn)
89 CRITICAL_BLOCK(cs_setpwalletRegistered)
91 setpwalletRegistered.erase(pwalletIn);
95 bool static IsFromMe(CTransaction& tx)
97 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
98 if (pwallet->IsFromMe(tx))
103 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
105 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
106 if (pwallet->GetTransaction(hashTx,wtx))
111 void static EraseFromWallets(uint256 hash)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 pwallet->EraseFromWallet(hash);
117 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
119 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
120 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
123 void static SetBestChain(const CBlockLocator& loc)
125 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
126 pwallet->SetBestChain(loc);
129 void static UpdatedTransaction(const uint256& hashTx)
131 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
132 pwallet->UpdatedTransaction(hashTx);
135 void static PrintWallets(const CBlock& block)
137 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
138 pwallet->PrintWallet(block);
141 void static Inventory(const uint256& hash)
143 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
144 pwallet->Inventory(hash);
147 void static ResendWalletTransactions()
149 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
150 pwallet->ResendWalletTransactions();
159 //////////////////////////////////////////////////////////////////////////////
161 // mapOrphanTransactions
164 void static AddOrphanTx(const CDataStream& vMsg)
167 CDataStream(vMsg) >> tx;
168 uint256 hash = tx.GetHash();
169 if (mapOrphanTransactions.count(hash))
171 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
172 BOOST_FOREACH(const CTxIn& txin, tx.vin)
173 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
176 void static EraseOrphanTx(uint256 hash)
178 if (!mapOrphanTransactions.count(hash))
180 const CDataStream* pvMsg = mapOrphanTransactions[hash];
182 CDataStream(*pvMsg) >> tx;
183 BOOST_FOREACH(const CTxIn& txin, tx.vin)
185 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
186 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
188 if ((*mi).second == pvMsg)
189 mapOrphanTransactionsByPrev.erase(mi++);
195 mapOrphanTransactions.erase(hash);
205 //////////////////////////////////////////////////////////////////////////////
207 // CTransaction and CTxIndex
210 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
213 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
215 if (!ReadFromDisk(txindexRet.pos))
217 if (prevout.n >= vout.size())
225 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
228 return ReadFromDisk(txdb, prevout, txindex);
231 bool CTransaction::ReadFromDisk(COutPoint prevout)
235 return ReadFromDisk(txdb, prevout, txindex);
240 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
252 // Load the block this tx is in
254 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
256 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
261 // Update the tx's hashBlock
262 hashBlock = pblock->GetHash();
264 // Locate the transaction
265 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
266 if (pblock->vtx[nIndex] == *(CTransaction*)this)
268 if (nIndex == pblock->vtx.size())
270 vMerkleBranch.clear();
272 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
276 // Fill in merkle branch
277 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
280 // Is the tx in a block that's in the main chain
281 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
282 if (mi == mapBlockIndex.end())
284 CBlockIndex* pindex = (*mi).second;
285 if (!pindex || !pindex->IsInMainChain())
288 return pindexBest->nHeight - pindex->nHeight + 1;
297 bool CTransaction::CheckTransaction() const
299 // Basic checks that don't depend on any context
300 if (vin.empty() || vout.empty())
301 return error("CTransaction::CheckTransaction() : vin or vout empty");
304 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
305 return error("CTransaction::CheckTransaction() : size limits failed");
307 // Check for negative or overflow output values
309 BOOST_FOREACH(const CTxOut& txout, vout)
311 if (txout.nValue < 0)
312 return error("CTransaction::CheckTransaction() : txout.nValue negative");
313 if (txout.nValue > MAX_MONEY)
314 return error("CTransaction::CheckTransaction() : txout.nValue too high");
315 nValueOut += txout.nValue;
316 if (!MoneyRange(nValueOut))
317 return error("CTransaction::CheckTransaction() : txout total out of range");
322 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
323 return error("CTransaction::CheckTransaction() : coinbase script size");
327 BOOST_FOREACH(const CTxIn& txin, vin)
328 if (txin.prevout.IsNull())
329 return error("CTransaction::CheckTransaction() : prevout is null");
335 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
338 *pfMissingInputs = false;
340 if (!CheckTransaction())
341 return error("AcceptToMemoryPool() : CheckTransaction failed");
343 // Coinbase is only valid in a block, not as a loose transaction
345 return error("AcceptToMemoryPool() : coinbase as individual tx");
347 // To help v0.1.5 clients who would see it as a negative number
348 if ((int64)nLockTime > INT_MAX)
349 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
352 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
353 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
354 // attacks disallow transactions with more than one SigOp per 34 bytes.
355 // 34 bytes because a TxOut is:
356 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
357 if (GetSigOpCount() > nSize / 34 || nSize < 100)
358 return error("AcceptToMemoryPool() : nonstandard transaction");
360 // Rather not work on nonstandard transactions (unless -testnet)
361 if (!fTestNet && !IsStandard())
362 return error("AcceptToMemoryPool() : nonstandard transaction type");
364 // Do we already have it?
365 uint256 hash = GetHash();
366 CRITICAL_BLOCK(cs_mapTransactions)
367 if (mapTransactions.count(hash))
370 if (txdb.ContainsTx(hash))
373 // Check for conflicts with in-memory transactions
374 CTransaction* ptxOld = NULL;
375 for (int i = 0; i < vin.size(); i++)
377 COutPoint outpoint = vin[i].prevout;
378 if (mapNextTx.count(outpoint))
380 // Disable replacement feature for now
383 // Allow replacing with a newer version of the same transaction
386 ptxOld = mapNextTx[outpoint].ptx;
387 if (ptxOld->IsFinal())
389 if (!IsNewerThan(*ptxOld))
391 for (int i = 0; i < vin.size(); i++)
393 COutPoint outpoint = vin[i].prevout;
394 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
403 // Check against previous transactions
404 map<uint256, CTxIndex> mapUnused;
406 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
409 *pfMissingInputs = true;
410 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
413 // Don't accept it if it can't get into a block
414 if (nFees < GetMinFee(1000, true, true))
415 return error("AcceptToMemoryPool() : not enough fees");
417 // Continuously rate-limit free transactions
418 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
419 // be annoying or make other's transactions take longer to confirm.
420 if (nFees < MIN_RELAY_TX_FEE)
422 static CCriticalSection cs;
423 static double dFreeCount;
424 static int64 nLastTime;
425 int64 nNow = GetTime();
429 // Use an exponentially decaying ~10-minute window:
430 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
432 // -limitfreerelay unit is thousand-bytes-per-minute
433 // At default rate it would take over a month to fill 1GB
434 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
435 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
437 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
443 // Store transaction in memory
444 CRITICAL_BLOCK(cs_mapTransactions)
448 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
449 ptxOld->RemoveFromMemoryPool();
451 AddToMemoryPoolUnchecked();
454 ///// are we sure this is ok when loading transactions or restoring block txes
455 // If updated, erase old tx from wallet
457 EraseFromWallets(ptxOld->GetHash());
459 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
463 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
466 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
469 bool CTransaction::AddToMemoryPoolUnchecked()
471 // Add to memory pool without checking anything. Don't call this directly,
472 // call AcceptToMemoryPool to properly check the transaction first.
473 CRITICAL_BLOCK(cs_mapTransactions)
475 uint256 hash = GetHash();
476 mapTransactions[hash] = *this;
477 for (int i = 0; i < vin.size(); i++)
478 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
479 nTransactionsUpdated++;
485 bool CTransaction::RemoveFromMemoryPool()
487 // Remove transaction from memory pool
488 CRITICAL_BLOCK(cs_mapTransactions)
490 BOOST_FOREACH(const CTxIn& txin, vin)
491 mapNextTx.erase(txin.prevout);
492 mapTransactions.erase(GetHash());
493 nTransactionsUpdated++;
503 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
505 if (hashBlock == 0 || nIndex == -1)
508 // Find the block it claims to be in
509 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
510 if (mi == mapBlockIndex.end())
512 CBlockIndex* pindex = (*mi).second;
513 if (!pindex || !pindex->IsInMainChain())
516 // Make sure the merkle branch connects to this block
517 if (!fMerkleVerified)
519 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
521 fMerkleVerified = true;
524 nHeightRet = pindex->nHeight;
525 return pindexBest->nHeight - pindex->nHeight + 1;
529 int CMerkleTx::GetBlocksToMaturity() const
533 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
537 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
541 if (!IsInMainChain() && !ClientConnectInputs())
543 return CTransaction::AcceptToMemoryPool(txdb, false);
547 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
551 bool CMerkleTx::AcceptToMemoryPool()
554 return AcceptToMemoryPool(txdb);
559 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
561 CRITICAL_BLOCK(cs_mapTransactions)
563 // Add previous supporting transactions first
564 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
566 if (!tx.IsCoinBase())
568 uint256 hash = tx.GetHash();
569 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
570 tx.AcceptToMemoryPool(txdb, fCheckInputs);
573 return AcceptToMemoryPool(txdb, fCheckInputs);
578 bool CWalletTx::AcceptWalletTransaction()
581 return AcceptWalletTransaction(txdb);
584 int CTxIndex::GetDepthInMainChain() const
588 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
590 // Find the block in the index
591 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
592 if (mi == mapBlockIndex.end())
594 CBlockIndex* pindex = (*mi).second;
595 if (!pindex || !pindex->IsInMainChain())
597 return 1 + nBestHeight - pindex->nHeight;
609 //////////////////////////////////////////////////////////////////////////////
611 // CBlock and CBlockIndex
614 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
616 if (!fReadTransactions)
618 *this = pindex->GetBlockHeader();
621 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
623 if (GetHash() != pindex->GetBlockHash())
624 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
628 uint256 static GetOrphanRoot(const CBlock* pblock)
630 // Work back to the first block in the orphan chain
631 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
632 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
633 return pblock->GetHash();
636 int64 static GetBlockValue(int nHeight, int64 nFees)
638 int64 nSubsidy = 50 * COIN;
640 // Subsidy is cut in half every 4 years
641 nSubsidy >>= (nHeight / 210000);
643 return nSubsidy + nFees;
646 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
648 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
649 const int64 nTargetSpacing = 10 * 60;
650 const int64 nInterval = nTargetTimespan / nTargetSpacing;
653 if (pindexLast == NULL)
654 return bnProofOfWorkLimit.GetCompact();
656 // Only change once per interval
657 if ((pindexLast->nHeight+1) % nInterval != 0)
658 return pindexLast->nBits;
660 // Go back by what we want to be 14 days worth of blocks
661 const CBlockIndex* pindexFirst = pindexLast;
662 for (int i = 0; pindexFirst && i < nInterval-1; i++)
663 pindexFirst = pindexFirst->pprev;
666 // Limit adjustment step
667 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
668 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
669 if (nActualTimespan < nTargetTimespan/4)
670 nActualTimespan = nTargetTimespan/4;
671 if (nActualTimespan > nTargetTimespan*4)
672 nActualTimespan = nTargetTimespan*4;
676 bnNew.SetCompact(pindexLast->nBits);
677 bnNew *= nActualTimespan;
678 bnNew /= nTargetTimespan;
680 if (bnNew > bnProofOfWorkLimit)
681 bnNew = bnProofOfWorkLimit;
684 printf("GetNextWorkRequired RETARGET\n");
685 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
686 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
687 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
689 return bnNew.GetCompact();
692 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
695 bnTarget.SetCompact(nBits);
698 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
699 return error("CheckProofOfWork() : nBits below minimum work");
701 // Check proof of work matches claimed amount
702 if (hash > bnTarget.getuint256())
703 return error("CheckProofOfWork() : hash doesn't match nBits");
708 // Return conservative estimate of total number of blocks, 0 if unknown
709 int GetTotalBlocksEstimate()
717 return nTotalBlocksEstimate;
721 bool IsInitialBlockDownload()
723 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
725 static int64 nLastUpdate;
726 static CBlockIndex* pindexLastBest;
727 if (pindexBest != pindexLastBest)
729 pindexLastBest = pindexBest;
730 nLastUpdate = GetTime();
732 return (GetTime() - nLastUpdate < 10 &&
733 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
736 void static InvalidChainFound(CBlockIndex* pindexNew)
738 if (pindexNew->bnChainWork > bnBestInvalidWork)
740 bnBestInvalidWork = pindexNew->bnChainWork;
741 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
744 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());
745 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
746 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
747 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
760 bool CTransaction::DisconnectInputs(CTxDB& txdb)
762 // Relinquish previous transactions' spent pointers
765 BOOST_FOREACH(const CTxIn& txin, vin)
767 COutPoint prevout = txin.prevout;
769 // Get prev txindex from disk
771 if (!txdb.ReadTxIndex(prevout.hash, txindex))
772 return error("DisconnectInputs() : ReadTxIndex failed");
774 if (prevout.n >= txindex.vSpent.size())
775 return error("DisconnectInputs() : prevout.n out of range");
777 // Mark outpoint as not spent
778 txindex.vSpent[prevout.n].SetNull();
781 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
782 return error("DisconnectInputs() : UpdateTxIndex failed");
786 // Remove transaction from index
787 if (!txdb.EraseTxIndex(*this))
788 return error("DisconnectInputs() : EraseTxPos failed");
794 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
795 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
797 // Take over previous transactions' spent pointers
801 for (int i = 0; i < vin.size(); i++)
803 COutPoint prevout = vin[i].prevout;
808 if (fMiner && mapTestPool.count(prevout.hash))
810 // Get txindex from current proposed changes
811 txindex = mapTestPool[prevout.hash];
815 // Read txindex from txdb
816 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
818 if (!fFound && (fBlock || fMiner))
819 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());
823 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
825 // Get prev tx from single transactions in memory
826 CRITICAL_BLOCK(cs_mapTransactions)
828 if (!mapTransactions.count(prevout.hash))
829 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
830 txPrev = mapTransactions[prevout.hash];
833 txindex.vSpent.resize(txPrev.vout.size());
837 // Get prev tx from disk
838 if (!txPrev.ReadFromDisk(txindex.pos))
839 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
842 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
843 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());
845 // If prev is coinbase, check that it's matured
846 if (txPrev.IsCoinBase())
847 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
848 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
849 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
852 if (!VerifySignature(txPrev, *this, i))
853 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
855 // Check for conflicts
856 if (!txindex.vSpent[prevout.n].IsNull())
857 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());
859 // Check for negative or overflow input values
860 nValueIn += txPrev.vout[prevout.n].nValue;
861 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
862 return error("ConnectInputs() : txin values out of range");
864 // Mark outpoints as spent
865 txindex.vSpent[prevout.n] = posThisTx;
870 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
871 return error("ConnectInputs() : UpdateTxIndex failed");
875 mapTestPool[prevout.hash] = txindex;
879 if (nValueIn < GetValueOut())
880 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
882 // Tally transaction fees
883 int64 nTxFee = nValueIn - GetValueOut();
885 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
886 if (nTxFee < nMinFee)
889 if (!MoneyRange(nFees))
890 return error("ConnectInputs() : nFees out of range");
895 // Add transaction to disk index
896 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
897 return error("ConnectInputs() : AddTxPos failed");
901 // Add transaction to test pool
902 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
909 bool CTransaction::ClientConnectInputs()
914 // Take over previous transactions' spent pointers
915 CRITICAL_BLOCK(cs_mapTransactions)
918 for (int i = 0; i < vin.size(); i++)
920 // Get prev tx from single transactions in memory
921 COutPoint prevout = vin[i].prevout;
922 if (!mapTransactions.count(prevout.hash))
924 CTransaction& txPrev = mapTransactions[prevout.hash];
926 if (prevout.n >= txPrev.vout.size())
930 if (!VerifySignature(txPrev, *this, i))
931 return error("ConnectInputs() : VerifySignature failed");
933 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
934 ///// this has to go away now that posNext is gone
935 // // Check for conflicts
936 // if (!txPrev.vout[prevout.n].posNext.IsNull())
937 // return error("ConnectInputs() : prev tx already used");
939 // // Flag outpoints as used
940 // txPrev.vout[prevout.n].posNext = posThisTx;
942 nValueIn += txPrev.vout[prevout.n].nValue;
944 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
945 return error("ClientConnectInputs() : txin values out of range");
947 if (GetValueOut() > nValueIn)
957 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
959 // Disconnect in reverse order
960 for (int i = vtx.size()-1; i >= 0; i--)
961 if (!vtx[i].DisconnectInputs(txdb))
964 // Update block index on disk without changing it in memory.
965 // The memory index structure will be changed after the db commits.
968 CDiskBlockIndex blockindexPrev(pindex->pprev);
969 blockindexPrev.hashNext = 0;
970 if (!txdb.WriteBlockIndex(blockindexPrev))
971 return error("DisconnectBlock() : WriteBlockIndex failed");
977 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
979 // Check it again in case a previous version let a bad block in
983 //// issue here: it doesn't know the version
984 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
986 map<uint256, CTxIndex> mapUnused;
988 BOOST_FOREACH(CTransaction& tx, vtx)
990 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
991 nTxPos += ::GetSerializeSize(tx, SER_DISK);
993 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
997 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1000 // Update block index on disk without changing it in memory.
1001 // The memory index structure will be changed after the db commits.
1004 CDiskBlockIndex blockindexPrev(pindex->pprev);
1005 blockindexPrev.hashNext = pindex->GetBlockHash();
1006 if (!txdb.WriteBlockIndex(blockindexPrev))
1007 return error("ConnectBlock() : WriteBlockIndex failed");
1010 // Watch for transactions paying to me
1011 BOOST_FOREACH(CTransaction& tx, vtx)
1012 SyncWithWallets(tx, this, true);
1017 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1019 printf("REORGANIZE\n");
1022 CBlockIndex* pfork = pindexBest;
1023 CBlockIndex* plonger = pindexNew;
1024 while (pfork != plonger)
1026 while (plonger->nHeight > pfork->nHeight)
1027 if (!(plonger = plonger->pprev))
1028 return error("Reorganize() : plonger->pprev is null");
1029 if (pfork == plonger)
1031 if (!(pfork = pfork->pprev))
1032 return error("Reorganize() : pfork->pprev is null");
1035 // List of what to disconnect
1036 vector<CBlockIndex*> vDisconnect;
1037 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1038 vDisconnect.push_back(pindex);
1040 // List of what to connect
1041 vector<CBlockIndex*> vConnect;
1042 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1043 vConnect.push_back(pindex);
1044 reverse(vConnect.begin(), vConnect.end());
1046 // Disconnect shorter branch
1047 vector<CTransaction> vResurrect;
1048 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1051 if (!block.ReadFromDisk(pindex))
1052 return error("Reorganize() : ReadFromDisk for disconnect failed");
1053 if (!block.DisconnectBlock(txdb, pindex))
1054 return error("Reorganize() : DisconnectBlock failed");
1056 // Queue memory transactions to resurrect
1057 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1058 if (!tx.IsCoinBase())
1059 vResurrect.push_back(tx);
1062 // Connect longer branch
1063 vector<CTransaction> vDelete;
1064 for (int i = 0; i < vConnect.size(); i++)
1066 CBlockIndex* pindex = vConnect[i];
1068 if (!block.ReadFromDisk(pindex))
1069 return error("Reorganize() : ReadFromDisk for connect failed");
1070 if (!block.ConnectBlock(txdb, pindex))
1074 return error("Reorganize() : ConnectBlock failed");
1077 // Queue memory transactions to delete
1078 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1079 vDelete.push_back(tx);
1081 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1082 return error("Reorganize() : WriteHashBestChain failed");
1084 // Make sure it's successfully written to disk before changing memory structure
1085 if (!txdb.TxnCommit())
1086 return error("Reorganize() : TxnCommit failed");
1088 // Disconnect shorter branch
1089 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1091 pindex->pprev->pnext = NULL;
1093 // Connect longer branch
1094 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1096 pindex->pprev->pnext = pindex;
1098 // Resurrect memory transactions that were in the disconnected branch
1099 BOOST_FOREACH(CTransaction& tx, vResurrect)
1100 tx.AcceptToMemoryPool(txdb, false);
1102 // Delete redundant memory transactions that are in the connected branch
1103 BOOST_FOREACH(CTransaction& tx, vDelete)
1104 tx.RemoveFromMemoryPool();
1110 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1112 uint256 hash = GetHash();
1115 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1117 txdb.WriteHashBestChain(hash);
1118 if (!txdb.TxnCommit())
1119 return error("SetBestChain() : TxnCommit failed");
1120 pindexGenesisBlock = pindexNew;
1122 else if (hashPrevBlock == hashBestChain)
1124 // Adding to current best branch
1125 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1128 InvalidChainFound(pindexNew);
1129 return error("SetBestChain() : ConnectBlock failed");
1131 if (!txdb.TxnCommit())
1132 return error("SetBestChain() : TxnCommit failed");
1134 // Add to current best branch
1135 pindexNew->pprev->pnext = pindexNew;
1137 // Delete redundant memory transactions
1138 BOOST_FOREACH(CTransaction& tx, vtx)
1139 tx.RemoveFromMemoryPool();
1144 if (!Reorganize(txdb, pindexNew))
1147 InvalidChainFound(pindexNew);
1148 return error("SetBestChain() : Reorganize failed");
1152 // Update best block in wallet (so we can detect restored wallets)
1153 if (!IsInitialBlockDownload())
1155 const CBlockLocator locator(pindexNew);
1156 ::SetBestChain(locator);
1160 hashBestChain = hash;
1161 pindexBest = pindexNew;
1162 nBestHeight = pindexBest->nHeight;
1163 bnBestChainWork = pindexNew->bnChainWork;
1164 nTimeBestReceived = GetTime();
1165 nTransactionsUpdated++;
1166 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1172 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1174 // Check for duplicate
1175 uint256 hash = GetHash();
1176 if (mapBlockIndex.count(hash))
1177 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1179 // Construct new block index object
1180 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1182 return error("AddToBlockIndex() : new CBlockIndex failed");
1183 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1184 pindexNew->phashBlock = &((*mi).first);
1185 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1186 if (miPrev != mapBlockIndex.end())
1188 pindexNew->pprev = (*miPrev).second;
1189 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1191 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1195 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1196 if (!txdb.TxnCommit())
1200 if (pindexNew->bnChainWork > bnBestChainWork)
1201 if (!SetBestChain(txdb, pindexNew))
1206 if (pindexNew == pindexBest)
1208 // Notify UI to display prev block's coinbase if it was ours
1209 static uint256 hashPrevBestCoinBase;
1210 UpdatedTransaction(hashPrevBestCoinBase);
1211 hashPrevBestCoinBase = vtx[0].GetHash();
1221 bool CBlock::CheckBlock() const
1223 // These are checks that are independent of context
1224 // that can be verified before saving an orphan block.
1227 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1228 return error("CheckBlock() : size limits failed");
1230 // Check proof of work matches claimed amount
1231 if (!CheckProofOfWork(GetHash(), nBits))
1232 return error("CheckBlock() : proof of work failed");
1235 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1236 return error("CheckBlock() : block timestamp too far in the future");
1238 // First transaction must be coinbase, the rest must not be
1239 if (vtx.empty() || !vtx[0].IsCoinBase())
1240 return error("CheckBlock() : first tx is not coinbase");
1241 for (int i = 1; i < vtx.size(); i++)
1242 if (vtx[i].IsCoinBase())
1243 return error("CheckBlock() : more than one coinbase");
1245 // Check transactions
1246 BOOST_FOREACH(const CTransaction& tx, vtx)
1247 if (!tx.CheckTransaction())
1248 return error("CheckBlock() : CheckTransaction failed");
1250 // Check that it's not full of nonstandard transactions
1251 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1252 return error("CheckBlock() : too many nonstandard transactions");
1255 if (hashMerkleRoot != BuildMerkleTree())
1256 return error("CheckBlock() : hashMerkleRoot mismatch");
1261 bool CBlock::AcceptBlock()
1263 // Check for duplicate
1264 uint256 hash = GetHash();
1265 if (mapBlockIndex.count(hash))
1266 return error("AcceptBlock() : block already in mapBlockIndex");
1268 // Get prev block index
1269 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1270 if (mi == mapBlockIndex.end())
1271 return error("AcceptBlock() : prev block not found");
1272 CBlockIndex* pindexPrev = (*mi).second;
1273 int nHeight = pindexPrev->nHeight+1;
1275 // Check proof of work
1276 if (nBits != GetNextWorkRequired(pindexPrev))
1277 return error("AcceptBlock() : incorrect proof of work");
1279 // Check timestamp against prev
1280 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1281 return error("AcceptBlock() : block's timestamp is too early");
1283 // Check that all transactions are finalized
1284 BOOST_FOREACH(const CTransaction& tx, vtx)
1285 if (!tx.IsFinal(nHeight, GetBlockTime()))
1286 return error("AcceptBlock() : contains a non-final transaction");
1288 // Check that the block chain matches the known block chain up to a checkpoint
1290 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1291 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1292 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1293 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1294 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1295 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1296 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) ||
1297 (nHeight == 134444 && hash != uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")))
1298 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1300 // Write block to history file
1301 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1302 return error("AcceptBlock() : out of disk space");
1303 unsigned int nFile = -1;
1304 unsigned int nBlockPos = 0;
1305 if (!WriteToDisk(nFile, nBlockPos))
1306 return error("AcceptBlock() : WriteToDisk failed");
1307 if (!AddToBlockIndex(nFile, nBlockPos))
1308 return error("AcceptBlock() : AddToBlockIndex failed");
1310 // Relay inventory, but don't relay old inventory during initial block download
1311 if (hashBestChain == hash)
1312 CRITICAL_BLOCK(cs_vNodes)
1313 BOOST_FOREACH(CNode* pnode, vNodes)
1314 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 134444))
1315 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1320 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1322 // Check for duplicate
1323 uint256 hash = pblock->GetHash();
1324 if (mapBlockIndex.count(hash))
1325 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1326 if (mapOrphanBlocks.count(hash))
1327 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1329 // Preliminary checks
1330 if (!pblock->CheckBlock())
1331 return error("ProcessBlock() : CheckBlock FAILED");
1333 // If don't already have its previous block, shunt it off to holding area until we get it
1334 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1336 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1337 CBlock* pblock2 = new CBlock(*pblock);
1338 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1339 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1341 // Ask this guy to fill in what we're missing
1343 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1348 if (!pblock->AcceptBlock())
1349 return error("ProcessBlock() : AcceptBlock FAILED");
1351 // Recursively process any orphan blocks that depended on this one
1352 vector<uint256> vWorkQueue;
1353 vWorkQueue.push_back(hash);
1354 for (int i = 0; i < vWorkQueue.size(); i++)
1356 uint256 hashPrev = vWorkQueue[i];
1357 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1358 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1361 CBlock* pblockOrphan = (*mi).second;
1362 if (pblockOrphan->AcceptBlock())
1363 vWorkQueue.push_back(pblockOrphan->GetHash());
1364 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1365 delete pblockOrphan;
1367 mapOrphanBlocksByPrev.erase(hashPrev);
1370 printf("ProcessBlock: ACCEPTED\n");
1381 template<typename Stream>
1382 bool static ScanMessageStart(Stream& s)
1384 // Scan ahead to the next pchMessageStart, which should normally be immediately
1385 // at the file pointer. Leaves file pointer at end of pchMessageStart.
1387 short prevmask = s.exceptions(0);
1388 const char* p = BEGIN(pchMessageStart);
1398 s.exceptions(prevmask);
1402 p = BEGIN(pchMessageStart);
1405 if (++p == END(pchMessageStart))
1408 s.exceptions(prevmask);
1417 s.exceptions(prevmask);
1422 bool CheckDiskSpace(uint64 nAdditionalBytes)
1424 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1426 // Check for 15MB because database could create another 10MB log file at any time
1427 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1430 string strMessage = _("Warning: Disk space is low ");
1431 strMiscWarning = strMessage;
1432 printf("*** %s\n", strMessage.c_str());
1433 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1434 CreateThread(Shutdown, NULL);
1440 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1444 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1447 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1449 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1458 static unsigned int nCurrentBlockFile = 1;
1460 FILE* AppendBlockFile(unsigned int& nFileRet)
1465 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1468 if (fseek(file, 0, SEEK_END) != 0)
1470 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1471 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1473 nFileRet = nCurrentBlockFile;
1477 nCurrentBlockFile++;
1481 bool LoadBlockIndex(bool fAllowNew)
1485 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1486 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1487 pchMessageStart[0] = 0xfa;
1488 pchMessageStart[1] = 0xbf;
1489 pchMessageStart[2] = 0xb5;
1490 pchMessageStart[3] = 0xda;
1497 if (!txdb.LoadBlockIndex())
1502 // Init with genesis block
1504 if (mapBlockIndex.empty())
1510 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1511 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1512 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1513 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1514 // vMerkleTree: 4a5e1e
1517 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1519 txNew.vin.resize(1);
1520 txNew.vout.resize(1);
1521 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1522 txNew.vout[0].nValue = 50 * COIN;
1523 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1525 block.vtx.push_back(txNew);
1526 block.hashPrevBlock = 0;
1527 block.hashMerkleRoot = block.BuildMerkleTree();
1529 block.nTime = 1231006505;
1530 block.nBits = 0x1d00ffff;
1531 block.nNonce = 2083236893;
1535 block.nTime = 1296688602;
1536 block.nBits = 0x1d07fff8;
1537 block.nNonce = 384568319;
1541 printf("%s\n", block.GetHash().ToString().c_str());
1542 printf("%s\n", hashGenesisBlock.ToString().c_str());
1543 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1544 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1546 assert(block.GetHash() == hashGenesisBlock);
1548 // Start new block file
1550 unsigned int nBlockPos;
1551 if (!block.WriteToDisk(nFile, nBlockPos))
1552 return error("LoadBlockIndex() : writing genesis block to disk failed");
1553 if (!block.AddToBlockIndex(nFile, nBlockPos))
1554 return error("LoadBlockIndex() : genesis block not accepted");
1562 void PrintBlockTree()
1564 // precompute tree structure
1565 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1566 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1568 CBlockIndex* pindex = (*mi).second;
1569 mapNext[pindex->pprev].push_back(pindex);
1571 //while (rand() % 3 == 0)
1572 // mapNext[pindex->pprev].push_back(pindex);
1575 vector<pair<int, CBlockIndex*> > vStack;
1576 vStack.push_back(make_pair(0, pindexGenesisBlock));
1579 while (!vStack.empty())
1581 int nCol = vStack.back().first;
1582 CBlockIndex* pindex = vStack.back().second;
1585 // print split or gap
1586 if (nCol > nPrevCol)
1588 for (int i = 0; i < nCol-1; i++)
1592 else if (nCol < nPrevCol)
1594 for (int i = 0; i < nCol; i++)
1601 for (int i = 0; i < nCol; i++)
1606 block.ReadFromDisk(pindex);
1607 printf("%d (%u,%u) %s %s tx %d",
1611 block.GetHash().ToString().substr(0,20).c_str(),
1612 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1615 PrintWallets(block);
1617 // put the main timechain first
1618 vector<CBlockIndex*>& vNext = mapNext[pindex];
1619 for (int i = 0; i < vNext.size(); i++)
1621 if (vNext[i]->pnext)
1623 swap(vNext[0], vNext[i]);
1629 for (int i = 0; i < vNext.size(); i++)
1630 vStack.push_back(make_pair(nCol+i, vNext[i]));
1643 //////////////////////////////////////////////////////////////////////////////
1648 map<uint256, CAlert> mapAlerts;
1649 CCriticalSection cs_mapAlerts;
1651 string GetWarnings(string strFor)
1654 string strStatusBar;
1656 if (GetBoolArg("-testsafemode"))
1659 // Misc warnings like out of disk space and clock is wrong
1660 if (strMiscWarning != "")
1663 strStatusBar = strMiscWarning;
1666 // Longer invalid proof-of-work chain
1667 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1670 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1674 CRITICAL_BLOCK(cs_mapAlerts)
1676 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1678 const CAlert& alert = item.second;
1679 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1681 nPriority = alert.nPriority;
1682 strStatusBar = alert.strStatusBar;
1687 if (strFor == "statusbar")
1688 return strStatusBar;
1689 else if (strFor == "rpc")
1691 assert(!"GetWarnings() : invalid parameter");
1695 bool CAlert::ProcessAlert()
1697 if (!CheckSignature())
1702 CRITICAL_BLOCK(cs_mapAlerts)
1704 // Cancel previous alerts
1705 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1707 const CAlert& alert = (*mi).second;
1710 printf("cancelling alert %d\n", alert.nID);
1711 mapAlerts.erase(mi++);
1713 else if (!alert.IsInEffect())
1715 printf("expiring alert %d\n", alert.nID);
1716 mapAlerts.erase(mi++);
1722 // Check if this alert has been cancelled
1723 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1725 const CAlert& alert = item.second;
1726 if (alert.Cancels(*this))
1728 printf("alert already cancelled by %d\n", alert.nID);
1734 mapAlerts.insert(make_pair(GetHash(), *this));
1737 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1749 //////////////////////////////////////////////////////////////////////////////
1755 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1759 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1760 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1762 // Don't know what it is, just say we already got one
1769 // The message start string is designed to be unlikely to occur in normal data.
1770 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1771 // a large 4-byte int at any alignment.
1772 char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1775 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1777 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1778 RandAddSeedPerfmon();
1780 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1781 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1782 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1784 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1792 if (strCommand == "version")
1794 // Each connection can only send one version message
1795 if (pfrom->nVersion != 0)
1802 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1803 if (pfrom->nVersion == 10300)
1804 pfrom->nVersion = 300;
1805 if (pfrom->nVersion >= 106 && !vRecv.empty())
1806 vRecv >> addrFrom >> nNonce;
1807 if (pfrom->nVersion >= 106 && !vRecv.empty())
1808 vRecv >> pfrom->strSubVer;
1809 if (pfrom->nVersion >= 209 && !vRecv.empty())
1810 vRecv >> pfrom->nStartingHeight;
1812 if (pfrom->nVersion == 0)
1815 // Disconnect if we connected to ourself
1816 if (nNonce == nLocalHostNonce && nNonce > 1)
1818 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1819 pfrom->fDisconnect = true;
1823 // Be shy and don't send version until we hear
1824 if (pfrom->fInbound)
1825 pfrom->PushVersion();
1827 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1829 AddTimeData(pfrom->addr.ip, nTime);
1832 if (pfrom->nVersion >= 209)
1833 pfrom->PushMessage("verack");
1834 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1835 if (pfrom->nVersion < 209)
1836 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1838 if (!pfrom->fInbound)
1840 // Advertise our address
1841 if (addrLocalHost.IsRoutable() && !fUseProxy)
1843 CAddress addr(addrLocalHost);
1844 addr.nTime = GetAdjustedTime();
1845 pfrom->PushAddress(addr);
1848 // Get recent addresses
1849 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1851 pfrom->PushMessage("getaddr");
1852 pfrom->fGetAddr = true;
1856 // Ask the first connected node for block updates
1857 static int nAskedForBlocks;
1858 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
1861 pfrom->PushGetBlocks(pindexBest, uint256(0));
1865 CRITICAL_BLOCK(cs_mapAlerts)
1866 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1867 item.second.RelayTo(pfrom);
1869 pfrom->fSuccessfullyConnected = true;
1871 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1875 else if (pfrom->nVersion == 0)
1877 // Must have a version message before anything else
1882 else if (strCommand == "verack")
1884 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1888 else if (strCommand == "addr")
1890 vector<CAddress> vAddr;
1893 // Don't want addr from older versions unless seeding
1894 if (pfrom->nVersion < 209)
1896 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1898 if (vAddr.size() > 1000)
1899 return error("message addr size() = %d", vAddr.size());
1901 // Store the new addresses
1902 int64 nNow = GetAdjustedTime();
1903 int64 nSince = nNow - 10 * 60;
1904 BOOST_FOREACH(CAddress& addr, vAddr)
1908 // ignore IPv6 for now, since it isn't implemented anyway
1911 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1912 addr.nTime = nNow - 5 * 24 * 60 * 60;
1913 AddAddress(addr, 2 * 60 * 60);
1914 pfrom->AddAddressKnown(addr);
1915 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1917 // Relay to a limited number of other nodes
1918 CRITICAL_BLOCK(cs_vNodes)
1920 // Use deterministic randomness to send to the same nodes for 24 hours
1921 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1922 static uint256 hashSalt;
1924 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1925 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1926 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1927 multimap<uint256, CNode*> mapMix;
1928 BOOST_FOREACH(CNode* pnode, vNodes)
1930 if (pnode->nVersion < 31402)
1932 unsigned int nPointer;
1933 memcpy(&nPointer, &pnode, sizeof(nPointer));
1934 uint256 hashKey = hashRand ^ nPointer;
1935 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1936 mapMix.insert(make_pair(hashKey, pnode));
1938 int nRelayNodes = 2;
1939 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1940 ((*mi).second)->PushAddress(addr);
1944 if (vAddr.size() < 1000)
1945 pfrom->fGetAddr = false;
1949 else if (strCommand == "inv")
1953 if (vInv.size() > 50000)
1954 return error("message inv size() = %d", vInv.size());
1957 BOOST_FOREACH(const CInv& inv, vInv)
1961 pfrom->AddInventoryKnown(inv);
1963 bool fAlreadyHave = AlreadyHave(txdb, inv);
1964 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1968 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1969 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1971 // Track requests for our stuff
1972 Inventory(inv.hash);
1977 else if (strCommand == "getdata")
1981 if (vInv.size() > 50000)
1982 return error("message getdata size() = %d", vInv.size());
1984 BOOST_FOREACH(const CInv& inv, vInv)
1988 printf("received getdata for: %s\n", inv.ToString().c_str());
1990 if (inv.type == MSG_BLOCK)
1992 // Send block from disk
1993 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1994 if (mi != mapBlockIndex.end())
1997 block.ReadFromDisk((*mi).second);
1998 pfrom->PushMessage("block", block);
2000 // Trigger them to send a getblocks request for the next batch of inventory
2001 if (inv.hash == pfrom->hashContinue)
2003 // Bypass PushInventory, this must send even if redundant,
2004 // and we want it right after the last block so they don't
2005 // wait for other stuff first.
2007 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2008 pfrom->PushMessage("inv", vInv);
2009 pfrom->hashContinue = 0;
2013 else if (inv.IsKnownType())
2015 // Send stream from relay memory
2016 CRITICAL_BLOCK(cs_mapRelay)
2018 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2019 if (mi != mapRelay.end())
2020 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2024 // Track requests for our stuff
2025 Inventory(inv.hash);
2030 else if (strCommand == "getblocks")
2032 CBlockLocator locator;
2034 vRecv >> locator >> hashStop;
2036 // Find the last block the caller has in the main chain
2037 CBlockIndex* pindex = locator.GetBlockIndex();
2039 // Send the rest of the chain
2041 pindex = pindex->pnext;
2042 int nLimit = 500 + locator.GetDistanceBack();
2043 unsigned int nBytes = 0;
2044 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2045 for (; pindex; pindex = pindex->pnext)
2047 if (pindex->GetBlockHash() == hashStop)
2049 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2052 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2054 block.ReadFromDisk(pindex, true);
2055 nBytes += block.GetSerializeSize(SER_NETWORK);
2056 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2058 // When this block is requested, we'll send an inv that'll make them
2059 // getblocks the next batch of inventory.
2060 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2061 pfrom->hashContinue = pindex->GetBlockHash();
2068 else if (strCommand == "getheaders")
2070 CBlockLocator locator;
2072 vRecv >> locator >> hashStop;
2074 CBlockIndex* pindex = NULL;
2075 if (locator.IsNull())
2077 // If locator is null, return the hashStop block
2078 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2079 if (mi == mapBlockIndex.end())
2081 pindex = (*mi).second;
2085 // Find the last block the caller has in the main chain
2086 pindex = locator.GetBlockIndex();
2088 pindex = pindex->pnext;
2091 vector<CBlock> vHeaders;
2092 int nLimit = 2000 + locator.GetDistanceBack();
2093 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2094 for (; pindex; pindex = pindex->pnext)
2096 vHeaders.push_back(pindex->GetBlockHeader());
2097 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2100 pfrom->PushMessage("headers", vHeaders);
2104 else if (strCommand == "tx")
2106 vector<uint256> vWorkQueue;
2107 CDataStream vMsg(vRecv);
2111 CInv inv(MSG_TX, tx.GetHash());
2112 pfrom->AddInventoryKnown(inv);
2114 bool fMissingInputs = false;
2115 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2117 SyncWithWallets(tx, NULL, true);
2118 RelayMessage(inv, vMsg);
2119 mapAlreadyAskedFor.erase(inv);
2120 vWorkQueue.push_back(inv.hash);
2122 // Recursively process any orphan transactions that depended on this one
2123 for (int i = 0; i < vWorkQueue.size(); i++)
2125 uint256 hashPrev = vWorkQueue[i];
2126 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2127 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2130 const CDataStream& vMsg = *((*mi).second);
2132 CDataStream(vMsg) >> tx;
2133 CInv inv(MSG_TX, tx.GetHash());
2135 if (tx.AcceptToMemoryPool(true))
2137 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2138 SyncWithWallets(tx, NULL, true);
2139 RelayMessage(inv, vMsg);
2140 mapAlreadyAskedFor.erase(inv);
2141 vWorkQueue.push_back(inv.hash);
2146 BOOST_FOREACH(uint256 hash, vWorkQueue)
2147 EraseOrphanTx(hash);
2149 else if (fMissingInputs)
2151 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2157 else if (strCommand == "block")
2162 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2165 CInv inv(MSG_BLOCK, block.GetHash());
2166 pfrom->AddInventoryKnown(inv);
2168 if (ProcessBlock(pfrom, &block))
2169 mapAlreadyAskedFor.erase(inv);
2173 else if (strCommand == "getaddr")
2175 // Nodes rebroadcast an addr every 24 hours
2176 pfrom->vAddrToSend.clear();
2177 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2178 CRITICAL_BLOCK(cs_mapAddresses)
2180 unsigned int nCount = 0;
2181 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2183 const CAddress& addr = item.second;
2184 if (addr.nTime > nSince)
2187 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2189 const CAddress& addr = item.second;
2190 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2191 pfrom->PushAddress(addr);
2197 else if (strCommand == "checkorder")
2202 if (!GetBoolArg("-allowreceivebyip"))
2204 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2211 /// we have a chance to check the order here
2213 // Keep giving the same key to the same ip until they use it
2214 if (!mapReuseKey.count(pfrom->addr.ip))
2215 mapReuseKey[pfrom->addr.ip] = pwalletMain->GetOrReuseKeyFromPool();
2217 // Send back approval of order and pubkey to use
2218 CScript scriptPubKey;
2219 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2220 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2224 else if (strCommand == "reply")
2229 CRequestTracker tracker;
2230 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2232 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2233 if (mi != pfrom->mapRequests.end())
2235 tracker = (*mi).second;
2236 pfrom->mapRequests.erase(mi);
2239 if (!tracker.IsNull())
2240 tracker.fn(tracker.param1, vRecv);
2244 else if (strCommand == "ping")
2249 else if (strCommand == "alert")
2254 if (alert.ProcessAlert())
2257 pfrom->setKnown.insert(alert.GetHash());
2258 CRITICAL_BLOCK(cs_vNodes)
2259 BOOST_FOREACH(CNode* pnode, vNodes)
2260 alert.RelayTo(pnode);
2267 // Ignore unknown commands for extensibility
2271 // Update the last seen time for this node's address
2272 if (pfrom->fNetworkNode)
2273 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2274 AddressCurrentlyConnected(pfrom->addr);
2280 bool ProcessMessages(CNode* pfrom)
2282 CDataStream& vRecv = pfrom->vRecv;
2286 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2290 // (4) message start
2299 // Scan for message start
2300 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2301 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2302 if (vRecv.end() - pstart < nHeaderSize)
2304 if (vRecv.size() > nHeaderSize)
2306 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2307 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2311 if (pstart - vRecv.begin() > 0)
2312 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2313 vRecv.erase(vRecv.begin(), pstart);
2316 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2321 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2324 string strCommand = hdr.GetCommand();
2327 unsigned int nMessageSize = hdr.nMessageSize;
2328 if (nMessageSize > MAX_SIZE)
2330 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2333 if (nMessageSize > vRecv.size())
2335 // Rewind and wait for rest of message
2336 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2341 if (vRecv.GetVersion() >= 209)
2343 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2344 unsigned int nChecksum = 0;
2345 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2346 if (nChecksum != hdr.nChecksum)
2348 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2349 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2354 // Copy message to its own buffer
2355 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2356 vRecv.ignore(nMessageSize);
2362 CRITICAL_BLOCK(cs_main)
2363 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2367 catch (std::ios_base::failure& e)
2369 if (strstr(e.what(), "end of data"))
2371 // Allow exceptions from underlength message on vRecv
2372 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());
2374 else if (strstr(e.what(), "size too large"))
2376 // Allow exceptions from overlong size
2377 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2381 PrintExceptionContinue(&e, "ProcessMessage()");
2384 catch (std::exception& e) {
2385 PrintExceptionContinue(&e, "ProcessMessage()");
2387 PrintExceptionContinue(NULL, "ProcessMessage()");
2391 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2399 bool SendMessages(CNode* pto, bool fSendTrickle)
2401 CRITICAL_BLOCK(cs_main)
2403 // Don't send anything until we get their version message
2404 if (pto->nVersion == 0)
2408 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2409 pto->PushMessage("ping");
2411 // Resend wallet transactions that haven't gotten in a block yet
2412 ResendWalletTransactions();
2414 // Address refresh broadcast
2415 static int64 nLastRebroadcast;
2416 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2418 nLastRebroadcast = GetTime();
2419 CRITICAL_BLOCK(cs_vNodes)
2421 BOOST_FOREACH(CNode* pnode, vNodes)
2423 // Periodically clear setAddrKnown to allow refresh broadcasts
2424 pnode->setAddrKnown.clear();
2426 // Rebroadcast our address
2427 if (addrLocalHost.IsRoutable() && !fUseProxy)
2429 CAddress addr(addrLocalHost);
2430 addr.nTime = GetAdjustedTime();
2431 pnode->PushAddress(addr);
2437 // Clear out old addresses periodically so it's not too much work at once
2438 static int64 nLastClear;
2439 if (nLastClear == 0)
2440 nLastClear = GetTime();
2441 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2443 nLastClear = GetTime();
2444 CRITICAL_BLOCK(cs_mapAddresses)
2447 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2448 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2449 mi != mapAddresses.end();)
2451 const CAddress& addr = (*mi).second;
2452 if (addr.nTime < nSince)
2454 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2456 addrdb.EraseAddress(addr);
2457 mapAddresses.erase(mi++);
2471 vector<CAddress> vAddr;
2472 vAddr.reserve(pto->vAddrToSend.size());
2473 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2475 // returns true if wasn't already contained in the set
2476 if (pto->setAddrKnown.insert(addr).second)
2478 vAddr.push_back(addr);
2479 // receiver rejects addr messages larger than 1000
2480 if (vAddr.size() >= 1000)
2482 pto->PushMessage("addr", vAddr);
2487 pto->vAddrToSend.clear();
2489 pto->PushMessage("addr", vAddr);
2494 // Message: inventory
2497 vector<CInv> vInvWait;
2498 CRITICAL_BLOCK(pto->cs_inventory)
2500 vInv.reserve(pto->vInventoryToSend.size());
2501 vInvWait.reserve(pto->vInventoryToSend.size());
2502 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2504 if (pto->setInventoryKnown.count(inv))
2507 // trickle out tx inv to protect privacy
2508 if (inv.type == MSG_TX && !fSendTrickle)
2510 // 1/4 of tx invs blast to all immediately
2511 static uint256 hashSalt;
2513 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2514 uint256 hashRand = inv.hash ^ hashSalt;
2515 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2516 bool fTrickleWait = ((hashRand & 3) != 0);
2518 // always trickle our own transactions
2522 if (GetTransaction(inv.hash, wtx))
2524 fTrickleWait = true;
2529 vInvWait.push_back(inv);
2534 // returns true if wasn't already contained in the set
2535 if (pto->setInventoryKnown.insert(inv).second)
2537 vInv.push_back(inv);
2538 if (vInv.size() >= 1000)
2540 pto->PushMessage("inv", vInv);
2545 pto->vInventoryToSend = vInvWait;
2548 pto->PushMessage("inv", vInv);
2554 vector<CInv> vGetData;
2555 int64 nNow = GetTime() * 1000000;
2557 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2559 const CInv& inv = (*pto->mapAskFor.begin()).second;
2560 if (!AlreadyHave(txdb, inv))
2562 printf("sending getdata: %s\n", inv.ToString().c_str());
2563 vGetData.push_back(inv);
2564 if (vGetData.size() >= 1000)
2566 pto->PushMessage("getdata", vGetData);
2570 pto->mapAskFor.erase(pto->mapAskFor.begin());
2572 if (!vGetData.empty())
2573 pto->PushMessage("getdata", vGetData);
2592 //////////////////////////////////////////////////////////////////////////////
2597 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2599 unsigned char* pdata = (unsigned char*)pbuffer;
2600 unsigned int blocks = 1 + ((len + 8) / 64);
2601 unsigned char* pend = pdata + 64 * blocks;
2602 memset(pdata + len, 0, 64 * blocks - len);
2604 unsigned int bits = len * 8;
2605 pend[-1] = (bits >> 0) & 0xff;
2606 pend[-2] = (bits >> 8) & 0xff;
2607 pend[-3] = (bits >> 16) & 0xff;
2608 pend[-4] = (bits >> 24) & 0xff;
2612 using CryptoPP::ByteReverse;
2614 static const unsigned int pSHA256InitState[8] =
2615 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2617 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2619 memcpy(pstate, pinit, 32);
2620 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2624 // ScanHash scans nonces looking for a hash with at least some zero bits.
2625 // It operates on big endian data. Caller does the byte reversing.
2626 // All input buffers are 16-byte aligned. nNonce is usually preserved
2627 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2628 // the block is rebuilt and nNonce starts over at zero.
2630 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2632 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2636 // Hash pdata using pmidstate as the starting state into
2637 // preformatted buffer phash1, then hash phash1 into phash
2639 SHA256Transform(phash1, pdata, pmidstate);
2640 SHA256Transform(phash, phash1, pSHA256InitState);
2642 // Return the nonce if the hash has at least some zero bits,
2643 // caller will check if it has enough to reach the target
2644 if (((unsigned short*)phash)[14] == 0)
2647 // If nothing found after trying for a while, return -1
2648 if ((nNonce & 0xffff) == 0)
2650 nHashesDone = 0xffff+1;
2661 set<uint256> setDependsOn;
2664 COrphan(CTransaction* ptxIn)
2672 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2673 BOOST_FOREACH(uint256 hash, setDependsOn)
2674 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2679 CBlock* CreateNewBlock(CReserveKey& reservekey)
2681 CBlockIndex* pindexPrev = pindexBest;
2684 auto_ptr<CBlock> pblock(new CBlock());
2688 // Create coinbase tx
2690 txNew.vin.resize(1);
2691 txNew.vin[0].prevout.SetNull();
2692 txNew.vout.resize(1);
2693 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2695 // Add our coinbase tx as first transaction
2696 pblock->vtx.push_back(txNew);
2698 // Collect memory pool transactions into the block
2700 CRITICAL_BLOCK(cs_main)
2701 CRITICAL_BLOCK(cs_mapTransactions)
2705 // Priority order to process transactions
2706 list<COrphan> vOrphan; // list memory doesn't move
2707 map<uint256, vector<COrphan*> > mapDependers;
2708 multimap<double, CTransaction*> mapPriority;
2709 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2711 CTransaction& tx = (*mi).second;
2712 if (tx.IsCoinBase() || !tx.IsFinal())
2715 COrphan* porphan = NULL;
2716 double dPriority = 0;
2717 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2719 // Read prev transaction
2720 CTransaction txPrev;
2722 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2724 // Has to wait for dependencies
2727 // Use list for automatic deletion
2728 vOrphan.push_back(COrphan(&tx));
2729 porphan = &vOrphan.back();
2731 mapDependers[txin.prevout.hash].push_back(porphan);
2732 porphan->setDependsOn.insert(txin.prevout.hash);
2735 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2737 // Read block header
2738 int nConf = txindex.GetDepthInMainChain();
2740 dPriority += (double)nValueIn * nConf;
2742 if (fDebug && GetBoolArg("-printpriority"))
2743 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2746 // Priority is sum(valuein * age) / txsize
2747 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2750 porphan->dPriority = dPriority;
2752 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2754 if (fDebug && GetBoolArg("-printpriority"))
2756 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2763 // Collect transactions into block
2764 map<uint256, CTxIndex> mapTestPool;
2765 uint64 nBlockSize = 1000;
2766 int nBlockSigOps = 100;
2767 while (!mapPriority.empty())
2769 // Take highest priority transaction off priority queue
2770 double dPriority = -(*mapPriority.begin()).first;
2771 CTransaction& tx = *(*mapPriority.begin()).second;
2772 mapPriority.erase(mapPriority.begin());
2775 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2776 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2778 int nTxSigOps = tx.GetSigOpCount();
2779 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2782 // Transaction fee required depends on block size
2783 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2784 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2786 // Connecting shouldn't fail due to dependency on other memory pool transactions
2787 // because we're already processing them in order of dependency
2788 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2789 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2791 swap(mapTestPool, mapTestPoolTmp);
2794 pblock->vtx.push_back(tx);
2795 nBlockSize += nTxSize;
2796 nBlockSigOps += nTxSigOps;
2798 // Add transactions that depend on this one to the priority queue
2799 uint256 hash = tx.GetHash();
2800 if (mapDependers.count(hash))
2802 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2804 if (!porphan->setDependsOn.empty())
2806 porphan->setDependsOn.erase(hash);
2807 if (porphan->setDependsOn.empty())
2808 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2814 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2817 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2818 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2819 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2820 pblock->nBits = GetNextWorkRequired(pindexPrev);
2823 return pblock.release();
2827 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
2829 // Update nExtraNonce
2830 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2831 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
2836 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
2837 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2841 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2844 // Prebuild hash buffers
2851 uint256 hashPrevBlock;
2852 uint256 hashMerkleRoot;
2855 unsigned int nNonce;
2858 unsigned char pchPadding0[64];
2860 unsigned char pchPadding1[64];
2863 memset(&tmp, 0, sizeof(tmp));
2865 tmp.block.nVersion = pblock->nVersion;
2866 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2867 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2868 tmp.block.nTime = pblock->nTime;
2869 tmp.block.nBits = pblock->nBits;
2870 tmp.block.nNonce = pblock->nNonce;
2872 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2873 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2875 // Byte swap all the input buffer
2876 for (int i = 0; i < sizeof(tmp)/4; i++)
2877 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2879 // Precalc the first half of the first hash, which stays constant
2880 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2882 memcpy(pdata, &tmp.block, 128);
2883 memcpy(phash1, &tmp.hash1, 64);
2887 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2889 uint256 hash = pblock->GetHash();
2890 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2892 if (hash > hashTarget)
2896 printf("BitcoinMiner:\n");
2897 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2899 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2900 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2903 CRITICAL_BLOCK(cs_main)
2905 if (pblock->hashPrevBlock != hashBestChain)
2906 return error("BitcoinMiner : generated block is stale");
2908 // Remove key from key pool
2909 reservekey.KeepKey();
2911 // Track how many getdata requests this block gets
2912 CRITICAL_BLOCK(wallet.cs_mapRequestCount)
2913 wallet.mapRequestCount[pblock->GetHash()] = 0;
2915 // Process this block the same as if we had received it from another node
2916 if (!ProcessBlock(NULL, pblock))
2917 return error("BitcoinMiner : ProcessBlock, block not accepted");
2924 void static ThreadBitcoinMiner(void* parg);
2926 void static BitcoinMiner(CWallet *pwallet)
2928 printf("BitcoinMiner started\n");
2929 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2931 // Each thread has its own key and counter
2932 CReserveKey reservekey(pwallet);
2933 unsigned int nExtraNonce = 0;
2934 int64 nPrevTime = 0;
2936 while (fGenerateBitcoins)
2938 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2942 while (vNodes.empty() || IsInitialBlockDownload())
2947 if (!fGenerateBitcoins)
2955 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2956 CBlockIndex* pindexPrev = pindexBest;
2958 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2961 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
2963 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2967 // Prebuild hash buffers
2969 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2970 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2971 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2973 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2975 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2976 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2982 int64 nStart = GetTime();
2983 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2985 uint256& hash = *alignup<16>(hashbuf);
2988 unsigned int nHashesDone = 0;
2989 unsigned int nNonceFound;
2992 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2993 (char*)&hash, nHashesDone);
2995 // Check if something found
2996 if (nNonceFound != -1)
2998 for (int i = 0; i < sizeof(hash)/4; i++)
2999 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3001 if (hash <= hashTarget)
3004 pblock->nNonce = ByteReverse(nNonceFound);
3005 assert(hash == pblock->GetHash());
3007 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3008 CheckWork(pblock.get(), *pwalletMain, reservekey);
3009 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3015 static int64 nHashCounter;
3016 if (nHPSTimerStart == 0)
3018 nHPSTimerStart = GetTimeMillis();
3022 nHashCounter += nHashesDone;
3023 if (GetTimeMillis() - nHPSTimerStart > 4000)
3025 static CCriticalSection cs;
3028 if (GetTimeMillis() - nHPSTimerStart > 4000)
3030 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3031 nHPSTimerStart = GetTimeMillis();
3033 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3034 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3035 static int64 nLogTime;
3036 if (GetTime() - nLogTime > 30 * 60)
3038 nLogTime = GetTime();
3039 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3040 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3046 // Check for stop or if block needs to be rebuilt
3049 if (!fGenerateBitcoins)
3051 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3055 if (nBlockNonce >= 0xffff0000)
3057 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3059 if (pindexPrev != pindexBest)
3062 // Update nTime every few seconds
3063 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3064 nBlockTime = ByteReverse(pblock->nTime);
3069 void static ThreadBitcoinMiner(void* parg)
3071 CWallet* pwallet = (CWallet*)parg;
3074 vnThreadsRunning[3]++;
3075 BitcoinMiner(pwallet);
3076 vnThreadsRunning[3]--;
3078 catch (std::exception& e) {
3079 vnThreadsRunning[3]--;
3080 PrintException(&e, "ThreadBitcoinMiner()");
3082 vnThreadsRunning[3]--;
3083 PrintException(NULL, "ThreadBitcoinMiner()");
3085 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3087 if (vnThreadsRunning[3] == 0)
3089 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3093 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3095 if (fGenerateBitcoins != fGenerate)
3097 fGenerateBitcoins = fGenerate;
3098 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3101 if (fGenerateBitcoins)
3103 int nProcessors = boost::thread::hardware_concurrency();
3104 printf("%d processors\n", nProcessors);
3105 if (nProcessors < 1)
3107 if (fLimitProcessors && nProcessors > nLimitProcessors)
3108 nProcessors = nLimitProcessors;
3109 int nAddThreads = nProcessors - vnThreadsRunning[3];
3110 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3111 for (int i = 0; i < nAddThreads; i++)
3113 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3114 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");