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/fstream.hpp>
12 using namespace boost;
18 CCriticalSection cs_setpwalletRegistered;
19 set<CWallet*> setpwalletRegistered;
21 CCriticalSection cs_main;
23 CCriticalSection cs_mapPubKeys;
24 map<uint160, vector<unsigned char> > mapPubKeys;
26 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 CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 CBlockIndex* pindexGenesisBlock = NULL;
36 CBigNum bnBestChainWork = 0;
37 CBigNum bnBestInvalidWork = 0;
38 uint256 hashBestChain = 0;
39 CBlockIndex* pindexBest = NULL;
40 int64 nTimeBestReceived = 0;
42 map<uint256, CBlock*> mapOrphanBlocks;
43 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
45 map<uint256, CDataStream*> mapOrphanTransactions;
46 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
53 int fGenerateBitcoins = false;
54 int64 nTransactionFee = 0;
55 CAddress addrIncoming;
56 int fLimitProcessors = false;
57 int nLimitProcessors = 1;
58 int fMinimizeToTray = true;
59 int fMinimizeOnClose = true;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 bool static IsFromMe(CTransaction& tx)
95 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
96 if (pwallet->IsFromMe(tx))
101 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
103 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
104 if (pwallet->GetTransaction(hashTx,wtx))
109 void static EraseFromWallets(uint256 hash)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 pwallet->EraseFromWallet(hash);
115 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
121 void static SetBestChain(const CBlockLocator& loc)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 pwallet->SetBestChain(loc);
127 void static UpdatedTransaction(const uint256& hashTx)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->UpdatedTransaction(hashTx);
133 void static PrintWallets(const CBlock& block)
135 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
136 pwallet->PrintWallet(block);
139 void static Inventory(const uint256& hash)
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 pwallet->Inventory(hash);
145 void static ResendWalletTransactions()
147 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
148 pwallet->ResendWalletTransactions();
157 //////////////////////////////////////////////////////////////////////////////
159 // mapOrphanTransactions
162 void static AddOrphanTx(const CDataStream& vMsg)
165 CDataStream(vMsg) >> tx;
166 uint256 hash = tx.GetHash();
167 if (mapOrphanTransactions.count(hash))
169 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
170 BOOST_FOREACH(const CTxIn& txin, tx.vin)
171 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
174 void static EraseOrphanTx(uint256 hash)
176 if (!mapOrphanTransactions.count(hash))
178 const CDataStream* pvMsg = mapOrphanTransactions[hash];
180 CDataStream(*pvMsg) >> tx;
181 BOOST_FOREACH(const CTxIn& txin, tx.vin)
183 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
184 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
186 if ((*mi).second == pvMsg)
187 mapOrphanTransactionsByPrev.erase(mi++);
193 mapOrphanTransactions.erase(hash);
203 //////////////////////////////////////////////////////////////////////////////
205 // CTransaction and CTxIndex
208 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
211 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
213 if (!ReadFromDisk(txindexRet.pos))
215 if (prevout.n >= vout.size())
223 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
226 return ReadFromDisk(txdb, prevout, txindex);
229 bool CTransaction::ReadFromDisk(COutPoint prevout)
233 return ReadFromDisk(txdb, prevout, txindex);
238 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
250 // Load the block this tx is in
252 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
254 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
259 // Update the tx's hashBlock
260 hashBlock = pblock->GetHash();
262 // Locate the transaction
263 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
264 if (pblock->vtx[nIndex] == *(CTransaction*)this)
266 if (nIndex == pblock->vtx.size())
268 vMerkleBranch.clear();
270 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
274 // Fill in merkle branch
275 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
278 // Is the tx in a block that's in the main chain
279 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
280 if (mi == mapBlockIndex.end())
282 CBlockIndex* pindex = (*mi).second;
283 if (!pindex || !pindex->IsInMainChain())
286 return pindexBest->nHeight - pindex->nHeight + 1;
295 bool CTransaction::CheckTransaction() const
297 // Basic checks that don't depend on any context
298 if (vin.empty() || vout.empty())
299 return error("CTransaction::CheckTransaction() : vin or vout empty");
302 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
303 return error("CTransaction::CheckTransaction() : size limits failed");
305 // Check for negative or overflow output values
307 BOOST_FOREACH(const CTxOut& txout, vout)
309 if (txout.nValue < 0)
310 return error("CTransaction::CheckTransaction() : txout.nValue negative");
311 if (txout.nValue > MAX_MONEY)
312 return error("CTransaction::CheckTransaction() : txout.nValue too high");
313 nValueOut += txout.nValue;
314 if (!MoneyRange(nValueOut))
315 return error("CTransaction::CheckTransaction() : txout total out of range");
320 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
321 return error("CTransaction::CheckTransaction() : coinbase script size");
325 BOOST_FOREACH(const CTxIn& txin, vin)
326 if (txin.prevout.IsNull())
327 return error("CTransaction::CheckTransaction() : prevout is null");
333 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
336 *pfMissingInputs = false;
338 if (!CheckTransaction())
339 return error("AcceptToMemoryPool() : CheckTransaction failed");
341 // Coinbase is only valid in a block, not as a loose transaction
343 return error("AcceptToMemoryPool() : coinbase as individual tx");
345 // To help v0.1.5 clients who would see it as a negative number
346 if ((int64)nLockTime > INT_MAX)
347 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
350 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
351 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
352 // attacks disallow transactions with more than one SigOp per 34 bytes.
353 // 34 bytes because a TxOut is:
354 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
355 if (GetSigOpCount() > nSize / 34 || nSize < 100)
356 return error("AcceptToMemoryPool() : nonstandard transaction");
358 // Rather not work on nonstandard transactions (unless -testnet)
359 if (!fTestNet && !IsStandard())
360 return error("AcceptToMemoryPool() : nonstandard transaction type");
362 // Do we already have it?
363 uint256 hash = GetHash();
364 CRITICAL_BLOCK(cs_mapTransactions)
365 if (mapTransactions.count(hash))
368 if (txdb.ContainsTx(hash))
371 // Check for conflicts with in-memory transactions
372 CTransaction* ptxOld = NULL;
373 for (int i = 0; i < vin.size(); i++)
375 COutPoint outpoint = vin[i].prevout;
376 if (mapNextTx.count(outpoint))
378 // Disable replacement feature for now
381 // Allow replacing with a newer version of the same transaction
384 ptxOld = mapNextTx[outpoint].ptx;
385 if (ptxOld->IsFinal())
387 if (!IsNewerThan(*ptxOld))
389 for (int i = 0; i < vin.size(); i++)
391 COutPoint outpoint = vin[i].prevout;
392 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
401 // Check against previous transactions
402 map<uint256, CTxIndex> mapUnused;
404 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
407 *pfMissingInputs = true;
408 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
411 // Don't accept it if it can't get into a block
412 if (nFees < GetMinFee(1000, true, true))
413 return error("AcceptToMemoryPool() : not enough fees");
415 // Continuously rate-limit free transactions
416 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
417 // be annoying or make other's transactions take longer to confirm.
418 if (nFees < MIN_RELAY_TX_FEE)
420 static CCriticalSection cs;
421 static double dFreeCount;
422 static int64 nLastTime;
423 int64 nNow = GetTime();
427 // Use an exponentially decaying ~10-minute window:
428 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
430 // -limitfreerelay unit is thousand-bytes-per-minute
431 // At default rate it would take over a month to fill 1GB
432 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
433 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
435 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
441 // Store transaction in memory
442 CRITICAL_BLOCK(cs_mapTransactions)
446 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
447 ptxOld->RemoveFromMemoryPool();
449 AddToMemoryPoolUnchecked();
452 ///// are we sure this is ok when loading transactions or restoring block txes
453 // If updated, erase old tx from wallet
455 EraseFromWallets(ptxOld->GetHash());
457 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
461 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
464 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
467 bool CTransaction::AddToMemoryPoolUnchecked()
469 // Add to memory pool without checking anything. Don't call this directly,
470 // call AcceptToMemoryPool to properly check the transaction first.
471 CRITICAL_BLOCK(cs_mapTransactions)
473 uint256 hash = GetHash();
474 mapTransactions[hash] = *this;
475 for (int i = 0; i < vin.size(); i++)
476 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
477 nTransactionsUpdated++;
483 bool CTransaction::RemoveFromMemoryPool()
485 // Remove transaction from memory pool
486 CRITICAL_BLOCK(cs_mapTransactions)
488 BOOST_FOREACH(const CTxIn& txin, vin)
489 mapNextTx.erase(txin.prevout);
490 mapTransactions.erase(GetHash());
491 nTransactionsUpdated++;
501 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
503 if (hashBlock == 0 || nIndex == -1)
506 // Find the block it claims to be in
507 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
508 if (mi == mapBlockIndex.end())
510 CBlockIndex* pindex = (*mi).second;
511 if (!pindex || !pindex->IsInMainChain())
514 // Make sure the merkle branch connects to this block
515 if (!fMerkleVerified)
517 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
519 fMerkleVerified = true;
522 nHeightRet = pindex->nHeight;
523 return pindexBest->nHeight - pindex->nHeight + 1;
527 int CMerkleTx::GetBlocksToMaturity() const
531 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
535 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
539 if (!IsInMainChain() && !ClientConnectInputs())
541 return CTransaction::AcceptToMemoryPool(txdb, false);
545 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
549 bool CMerkleTx::AcceptToMemoryPool()
552 return AcceptToMemoryPool(txdb);
557 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
559 CRITICAL_BLOCK(cs_mapTransactions)
561 // Add previous supporting transactions first
562 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
564 if (!tx.IsCoinBase())
566 uint256 hash = tx.GetHash();
567 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
568 tx.AcceptToMemoryPool(txdb, fCheckInputs);
571 return AcceptToMemoryPool(txdb, fCheckInputs);
576 bool CWalletTx::AcceptWalletTransaction()
579 return AcceptWalletTransaction(txdb);
582 int CTxIndex::GetDepthInMainChain() const
586 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
588 // Find the block in the index
589 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
590 if (mi == mapBlockIndex.end())
592 CBlockIndex* pindex = (*mi).second;
593 if (!pindex || !pindex->IsInMainChain())
595 return 1 + nBestHeight - pindex->nHeight;
607 //////////////////////////////////////////////////////////////////////////////
609 // CBlock and CBlockIndex
612 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
614 if (!fReadTransactions)
616 *this = pindex->GetBlockHeader();
619 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
621 if (GetHash() != pindex->GetBlockHash())
622 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
626 uint256 static GetOrphanRoot(const CBlock* pblock)
628 // Work back to the first block in the orphan chain
629 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
630 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
631 return pblock->GetHash();
634 int64 static GetBlockValue(int nHeight, int64 nFees)
636 int64 nSubsidy = 50 * COIN;
638 // Subsidy is cut in half every 4 years
639 nSubsidy >>= (nHeight / 210000);
641 return nSubsidy + nFees;
644 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
646 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
647 const int64 nTargetSpacing = 10 * 60;
648 const int64 nInterval = nTargetTimespan / nTargetSpacing;
651 if (pindexLast == NULL)
652 return bnProofOfWorkLimit.GetCompact();
654 // Only change once per interval
655 if ((pindexLast->nHeight+1) % nInterval != 0)
656 return pindexLast->nBits;
658 // Go back by what we want to be 14 days worth of blocks
659 const CBlockIndex* pindexFirst = pindexLast;
660 for (int i = 0; pindexFirst && i < nInterval-1; i++)
661 pindexFirst = pindexFirst->pprev;
664 // Limit adjustment step
665 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
666 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
667 if (nActualTimespan < nTargetTimespan/4)
668 nActualTimespan = nTargetTimespan/4;
669 if (nActualTimespan > nTargetTimespan*4)
670 nActualTimespan = nTargetTimespan*4;
674 bnNew.SetCompact(pindexLast->nBits);
675 bnNew *= nActualTimespan;
676 bnNew /= nTargetTimespan;
678 if (bnNew > bnProofOfWorkLimit)
679 bnNew = bnProofOfWorkLimit;
682 printf("GetNextWorkRequired RETARGET\n");
683 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
684 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
685 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
687 return bnNew.GetCompact();
690 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
693 bnTarget.SetCompact(nBits);
696 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
697 return error("CheckProofOfWork() : nBits below minimum work");
699 // Check proof of work matches claimed amount
700 if (hash > bnTarget.getuint256())
701 return error("CheckProofOfWork() : hash doesn't match nBits");
706 bool IsInitialBlockDownload()
708 if (pindexBest == NULL || (!fTestNet && nBestHeight < 118000))
710 static int64 nLastUpdate;
711 static CBlockIndex* pindexLastBest;
712 if (pindexBest != pindexLastBest)
714 pindexLastBest = pindexBest;
715 nLastUpdate = GetTime();
717 return (GetTime() - nLastUpdate < 10 &&
718 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
721 void static InvalidChainFound(CBlockIndex* pindexNew)
723 if (pindexNew->bnChainWork > bnBestInvalidWork)
725 bnBestInvalidWork = pindexNew->bnChainWork;
726 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
729 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());
730 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
731 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
732 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
745 bool CTransaction::DisconnectInputs(CTxDB& txdb)
747 // Relinquish previous transactions' spent pointers
750 BOOST_FOREACH(const CTxIn& txin, vin)
752 COutPoint prevout = txin.prevout;
754 // Get prev txindex from disk
756 if (!txdb.ReadTxIndex(prevout.hash, txindex))
757 return error("DisconnectInputs() : ReadTxIndex failed");
759 if (prevout.n >= txindex.vSpent.size())
760 return error("DisconnectInputs() : prevout.n out of range");
762 // Mark outpoint as not spent
763 txindex.vSpent[prevout.n].SetNull();
766 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
767 return error("DisconnectInputs() : UpdateTxIndex failed");
771 // Remove transaction from index
772 if (!txdb.EraseTxIndex(*this))
773 return error("DisconnectInputs() : EraseTxPos failed");
779 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
780 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
782 // Take over previous transactions' spent pointers
786 for (int i = 0; i < vin.size(); i++)
788 COutPoint prevout = vin[i].prevout;
793 if (fMiner && mapTestPool.count(prevout.hash))
795 // Get txindex from current proposed changes
796 txindex = mapTestPool[prevout.hash];
800 // Read txindex from txdb
801 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
803 if (!fFound && (fBlock || fMiner))
804 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());
808 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
810 // Get prev tx from single transactions in memory
811 CRITICAL_BLOCK(cs_mapTransactions)
813 if (!mapTransactions.count(prevout.hash))
814 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
815 txPrev = mapTransactions[prevout.hash];
818 txindex.vSpent.resize(txPrev.vout.size());
822 // Get prev tx from disk
823 if (!txPrev.ReadFromDisk(txindex.pos))
824 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
827 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
828 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());
830 // If prev is coinbase, check that it's matured
831 if (txPrev.IsCoinBase())
832 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
833 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
834 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
837 if (!VerifySignature(txPrev, *this, i))
838 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
840 // Check for conflicts
841 if (!txindex.vSpent[prevout.n].IsNull())
842 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());
844 // Check for negative or overflow input values
845 nValueIn += txPrev.vout[prevout.n].nValue;
846 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
847 return error("ConnectInputs() : txin values out of range");
849 // Mark outpoints as spent
850 txindex.vSpent[prevout.n] = posThisTx;
855 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
856 return error("ConnectInputs() : UpdateTxIndex failed");
860 mapTestPool[prevout.hash] = txindex;
864 if (nValueIn < GetValueOut())
865 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
867 // Tally transaction fees
868 int64 nTxFee = nValueIn - GetValueOut();
870 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
871 if (nTxFee < nMinFee)
874 if (!MoneyRange(nFees))
875 return error("ConnectInputs() : nFees out of range");
880 // Add transaction to disk index
881 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
882 return error("ConnectInputs() : AddTxPos failed");
886 // Add transaction to test pool
887 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
894 bool CTransaction::ClientConnectInputs()
899 // Take over previous transactions' spent pointers
900 CRITICAL_BLOCK(cs_mapTransactions)
903 for (int i = 0; i < vin.size(); i++)
905 // Get prev tx from single transactions in memory
906 COutPoint prevout = vin[i].prevout;
907 if (!mapTransactions.count(prevout.hash))
909 CTransaction& txPrev = mapTransactions[prevout.hash];
911 if (prevout.n >= txPrev.vout.size())
915 if (!VerifySignature(txPrev, *this, i))
916 return error("ConnectInputs() : VerifySignature failed");
918 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
919 ///// this has to go away now that posNext is gone
920 // // Check for conflicts
921 // if (!txPrev.vout[prevout.n].posNext.IsNull())
922 // return error("ConnectInputs() : prev tx already used");
924 // // Flag outpoints as used
925 // txPrev.vout[prevout.n].posNext = posThisTx;
927 nValueIn += txPrev.vout[prevout.n].nValue;
929 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
930 return error("ClientConnectInputs() : txin values out of range");
932 if (GetValueOut() > nValueIn)
942 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
944 // Disconnect in reverse order
945 for (int i = vtx.size()-1; i >= 0; i--)
946 if (!vtx[i].DisconnectInputs(txdb))
949 // Update block index on disk without changing it in memory.
950 // The memory index structure will be changed after the db commits.
953 CDiskBlockIndex blockindexPrev(pindex->pprev);
954 blockindexPrev.hashNext = 0;
955 if (!txdb.WriteBlockIndex(blockindexPrev))
956 return error("DisconnectBlock() : WriteBlockIndex failed");
962 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
964 // Check it again in case a previous version let a bad block in
968 //// issue here: it doesn't know the version
969 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
971 map<uint256, CTxIndex> mapUnused;
973 BOOST_FOREACH(CTransaction& tx, vtx)
975 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
976 nTxPos += ::GetSerializeSize(tx, SER_DISK);
978 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
982 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
985 // Update block index on disk without changing it in memory.
986 // The memory index structure will be changed after the db commits.
989 CDiskBlockIndex blockindexPrev(pindex->pprev);
990 blockindexPrev.hashNext = pindex->GetBlockHash();
991 if (!txdb.WriteBlockIndex(blockindexPrev))
992 return error("ConnectBlock() : WriteBlockIndex failed");
995 // Watch for transactions paying to me
996 BOOST_FOREACH(CTransaction& tx, vtx)
997 SyncWithWallets(tx, this, true);
1002 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1004 printf("REORGANIZE\n");
1007 CBlockIndex* pfork = pindexBest;
1008 CBlockIndex* plonger = pindexNew;
1009 while (pfork != plonger)
1011 while (plonger->nHeight > pfork->nHeight)
1012 if (!(plonger = plonger->pprev))
1013 return error("Reorganize() : plonger->pprev is null");
1014 if (pfork == plonger)
1016 if (!(pfork = pfork->pprev))
1017 return error("Reorganize() : pfork->pprev is null");
1020 // List of what to disconnect
1021 vector<CBlockIndex*> vDisconnect;
1022 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1023 vDisconnect.push_back(pindex);
1025 // List of what to connect
1026 vector<CBlockIndex*> vConnect;
1027 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1028 vConnect.push_back(pindex);
1029 reverse(vConnect.begin(), vConnect.end());
1031 // Disconnect shorter branch
1032 vector<CTransaction> vResurrect;
1033 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1036 if (!block.ReadFromDisk(pindex))
1037 return error("Reorganize() : ReadFromDisk for disconnect failed");
1038 if (!block.DisconnectBlock(txdb, pindex))
1039 return error("Reorganize() : DisconnectBlock failed");
1041 // Queue memory transactions to resurrect
1042 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1043 if (!tx.IsCoinBase())
1044 vResurrect.push_back(tx);
1047 // Connect longer branch
1048 vector<CTransaction> vDelete;
1049 for (int i = 0; i < vConnect.size(); i++)
1051 CBlockIndex* pindex = vConnect[i];
1053 if (!block.ReadFromDisk(pindex))
1054 return error("Reorganize() : ReadFromDisk for connect failed");
1055 if (!block.ConnectBlock(txdb, pindex))
1059 return error("Reorganize() : ConnectBlock failed");
1062 // Queue memory transactions to delete
1063 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1064 vDelete.push_back(tx);
1066 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1067 return error("Reorganize() : WriteHashBestChain failed");
1069 // Make sure it's successfully written to disk before changing memory structure
1070 if (!txdb.TxnCommit())
1071 return error("Reorganize() : TxnCommit failed");
1073 // Disconnect shorter branch
1074 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1076 pindex->pprev->pnext = NULL;
1078 // Connect longer branch
1079 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1081 pindex->pprev->pnext = pindex;
1083 // Resurrect memory transactions that were in the disconnected branch
1084 BOOST_FOREACH(CTransaction& tx, vResurrect)
1085 tx.AcceptToMemoryPool(txdb, false);
1087 // Delete redundant memory transactions that are in the connected branch
1088 BOOST_FOREACH(CTransaction& tx, vDelete)
1089 tx.RemoveFromMemoryPool();
1095 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1097 uint256 hash = GetHash();
1100 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1102 txdb.WriteHashBestChain(hash);
1103 if (!txdb.TxnCommit())
1104 return error("SetBestChain() : TxnCommit failed");
1105 pindexGenesisBlock = pindexNew;
1107 else if (hashPrevBlock == hashBestChain)
1109 // Adding to current best branch
1110 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1113 InvalidChainFound(pindexNew);
1114 return error("SetBestChain() : ConnectBlock failed");
1116 if (!txdb.TxnCommit())
1117 return error("SetBestChain() : TxnCommit failed");
1119 // Add to current best branch
1120 pindexNew->pprev->pnext = pindexNew;
1122 // Delete redundant memory transactions
1123 BOOST_FOREACH(CTransaction& tx, vtx)
1124 tx.RemoveFromMemoryPool();
1129 if (!Reorganize(txdb, pindexNew))
1132 InvalidChainFound(pindexNew);
1133 return error("SetBestChain() : Reorganize failed");
1137 // Update best block in wallet (so we can detect restored wallets)
1138 if (!IsInitialBlockDownload())
1140 const CBlockLocator locator(pindexNew);
1141 ::SetBestChain(locator);
1145 hashBestChain = hash;
1146 pindexBest = pindexNew;
1147 nBestHeight = pindexBest->nHeight;
1148 bnBestChainWork = pindexNew->bnChainWork;
1149 nTimeBestReceived = GetTime();
1150 nTransactionsUpdated++;
1151 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1157 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1159 // Check for duplicate
1160 uint256 hash = GetHash();
1161 if (mapBlockIndex.count(hash))
1162 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1164 // Construct new block index object
1165 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1167 return error("AddToBlockIndex() : new CBlockIndex failed");
1168 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1169 pindexNew->phashBlock = &((*mi).first);
1170 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1171 if (miPrev != mapBlockIndex.end())
1173 pindexNew->pprev = (*miPrev).second;
1174 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1176 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1180 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1181 if (!txdb.TxnCommit())
1185 if (pindexNew->bnChainWork > bnBestChainWork)
1186 if (!SetBestChain(txdb, pindexNew))
1191 if (pindexNew == pindexBest)
1193 // Notify UI to display prev block's coinbase if it was ours
1194 static uint256 hashPrevBestCoinBase;
1195 UpdatedTransaction(hashPrevBestCoinBase);
1196 hashPrevBestCoinBase = vtx[0].GetHash();
1206 bool CBlock::CheckBlock() const
1208 // These are checks that are independent of context
1209 // that can be verified before saving an orphan block.
1212 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1213 return error("CheckBlock() : size limits failed");
1215 // Check proof of work matches claimed amount
1216 if (!CheckProofOfWork(GetHash(), nBits))
1217 return error("CheckBlock() : proof of work failed");
1220 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1221 return error("CheckBlock() : block timestamp too far in the future");
1223 // First transaction must be coinbase, the rest must not be
1224 if (vtx.empty() || !vtx[0].IsCoinBase())
1225 return error("CheckBlock() : first tx is not coinbase");
1226 for (int i = 1; i < vtx.size(); i++)
1227 if (vtx[i].IsCoinBase())
1228 return error("CheckBlock() : more than one coinbase");
1230 // Check transactions
1231 BOOST_FOREACH(const CTransaction& tx, vtx)
1232 if (!tx.CheckTransaction())
1233 return error("CheckBlock() : CheckTransaction failed");
1235 // Check that it's not full of nonstandard transactions
1236 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1237 return error("CheckBlock() : too many nonstandard transactions");
1240 if (hashMerkleRoot != BuildMerkleTree())
1241 return error("CheckBlock() : hashMerkleRoot mismatch");
1246 bool CBlock::AcceptBlock()
1248 // Check for duplicate
1249 uint256 hash = GetHash();
1250 if (mapBlockIndex.count(hash))
1251 return error("AcceptBlock() : block already in mapBlockIndex");
1253 // Get prev block index
1254 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1255 if (mi == mapBlockIndex.end())
1256 return error("AcceptBlock() : prev block not found");
1257 CBlockIndex* pindexPrev = (*mi).second;
1258 int nHeight = pindexPrev->nHeight+1;
1260 // Check proof of work
1261 if (nBits != GetNextWorkRequired(pindexPrev))
1262 return error("AcceptBlock() : incorrect proof of work");
1264 // Check timestamp against prev
1265 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1266 return error("AcceptBlock() : block's timestamp is too early");
1268 // Check that all transactions are finalized
1269 BOOST_FOREACH(const CTransaction& tx, vtx)
1270 if (!tx.IsFinal(nHeight, GetBlockTime()))
1271 return error("AcceptBlock() : contains a non-final transaction");
1273 // Check that the block chain matches the known block chain up to a checkpoint
1275 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1276 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1277 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1278 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1279 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1280 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1281 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")))
1282 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1284 // Write block to history file
1285 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1286 return error("AcceptBlock() : out of disk space");
1287 unsigned int nFile = -1;
1288 unsigned int nBlockPos = 0;
1289 if (!WriteToDisk(nFile, nBlockPos))
1290 return error("AcceptBlock() : WriteToDisk failed");
1291 if (!AddToBlockIndex(nFile, nBlockPos))
1292 return error("AcceptBlock() : AddToBlockIndex failed");
1294 // Relay inventory, but don't relay old inventory during initial block download
1295 if (hashBestChain == hash)
1296 CRITICAL_BLOCK(cs_vNodes)
1297 BOOST_FOREACH(CNode* pnode, vNodes)
1298 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 118000))
1299 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1304 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1306 // Check for duplicate
1307 uint256 hash = pblock->GetHash();
1308 if (mapBlockIndex.count(hash))
1309 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1310 if (mapOrphanBlocks.count(hash))
1311 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1313 // Preliminary checks
1314 if (!pblock->CheckBlock())
1315 return error("ProcessBlock() : CheckBlock FAILED");
1317 // If don't already have its previous block, shunt it off to holding area until we get it
1318 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1320 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1321 CBlock* pblock2 = new CBlock(*pblock);
1322 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1323 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1325 // Ask this guy to fill in what we're missing
1327 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1332 if (!pblock->AcceptBlock())
1333 return error("ProcessBlock() : AcceptBlock FAILED");
1335 // Recursively process any orphan blocks that depended on this one
1336 vector<uint256> vWorkQueue;
1337 vWorkQueue.push_back(hash);
1338 for (int i = 0; i < vWorkQueue.size(); i++)
1340 uint256 hashPrev = vWorkQueue[i];
1341 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1342 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1345 CBlock* pblockOrphan = (*mi).second;
1346 if (pblockOrphan->AcceptBlock())
1347 vWorkQueue.push_back(pblockOrphan->GetHash());
1348 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1349 delete pblockOrphan;
1351 mapOrphanBlocksByPrev.erase(hashPrev);
1354 printf("ProcessBlock: ACCEPTED\n");
1365 template<typename Stream>
1366 bool static ScanMessageStart(Stream& s)
1368 // Scan ahead to the next pchMessageStart, which should normally be immediately
1369 // at the file pointer. Leaves file pointer at end of pchMessageStart.
1371 short prevmask = s.exceptions(0);
1372 const char* p = BEGIN(pchMessageStart);
1382 s.exceptions(prevmask);
1386 p = BEGIN(pchMessageStart);
1389 if (++p == END(pchMessageStart))
1392 s.exceptions(prevmask);
1401 s.exceptions(prevmask);
1406 bool CheckDiskSpace(uint64 nAdditionalBytes)
1408 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1410 // Check for 15MB because database could create another 10MB log file at any time
1411 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1414 string strMessage = _("Warning: Disk space is low ");
1415 strMiscWarning = strMessage;
1416 printf("*** %s\n", strMessage.c_str());
1417 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1418 CreateThread(Shutdown, NULL);
1424 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1428 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1431 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1433 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1442 static unsigned int nCurrentBlockFile = 1;
1444 FILE* AppendBlockFile(unsigned int& nFileRet)
1449 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1452 if (fseek(file, 0, SEEK_END) != 0)
1454 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1455 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1457 nFileRet = nCurrentBlockFile;
1461 nCurrentBlockFile++;
1465 bool LoadBlockIndex(bool fAllowNew)
1469 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1470 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1471 pchMessageStart[0] = 0xfa;
1472 pchMessageStart[1] = 0xbf;
1473 pchMessageStart[2] = 0xb5;
1474 pchMessageStart[3] = 0xda;
1481 if (!txdb.LoadBlockIndex())
1486 // Init with genesis block
1488 if (mapBlockIndex.empty())
1494 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1495 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1496 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1497 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1498 // vMerkleTree: 4a5e1e
1501 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1503 txNew.vin.resize(1);
1504 txNew.vout.resize(1);
1505 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1506 txNew.vout[0].nValue = 50 * COIN;
1507 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1509 block.vtx.push_back(txNew);
1510 block.hashPrevBlock = 0;
1511 block.hashMerkleRoot = block.BuildMerkleTree();
1513 block.nTime = 1231006505;
1514 block.nBits = 0x1d00ffff;
1515 block.nNonce = 2083236893;
1519 block.nTime = 1296688602;
1520 block.nBits = 0x1d07fff8;
1521 block.nNonce = 384568319;
1525 printf("%s\n", block.GetHash().ToString().c_str());
1526 printf("%s\n", hashGenesisBlock.ToString().c_str());
1527 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1528 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1530 assert(block.GetHash() == hashGenesisBlock);
1532 // Start new block file
1534 unsigned int nBlockPos;
1535 if (!block.WriteToDisk(nFile, nBlockPos))
1536 return error("LoadBlockIndex() : writing genesis block to disk failed");
1537 if (!block.AddToBlockIndex(nFile, nBlockPos))
1538 return error("LoadBlockIndex() : genesis block not accepted");
1546 void PrintBlockTree()
1548 // precompute tree structure
1549 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1550 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1552 CBlockIndex* pindex = (*mi).second;
1553 mapNext[pindex->pprev].push_back(pindex);
1555 //while (rand() % 3 == 0)
1556 // mapNext[pindex->pprev].push_back(pindex);
1559 vector<pair<int, CBlockIndex*> > vStack;
1560 vStack.push_back(make_pair(0, pindexGenesisBlock));
1563 while (!vStack.empty())
1565 int nCol = vStack.back().first;
1566 CBlockIndex* pindex = vStack.back().second;
1569 // print split or gap
1570 if (nCol > nPrevCol)
1572 for (int i = 0; i < nCol-1; i++)
1576 else if (nCol < nPrevCol)
1578 for (int i = 0; i < nCol; i++)
1585 for (int i = 0; i < nCol; i++)
1590 block.ReadFromDisk(pindex);
1591 printf("%d (%u,%u) %s %s tx %d",
1595 block.GetHash().ToString().substr(0,20).c_str(),
1596 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1599 PrintWallets(block);
1601 // put the main timechain first
1602 vector<CBlockIndex*>& vNext = mapNext[pindex];
1603 for (int i = 0; i < vNext.size(); i++)
1605 if (vNext[i]->pnext)
1607 swap(vNext[0], vNext[i]);
1613 for (int i = 0; i < vNext.size(); i++)
1614 vStack.push_back(make_pair(nCol+i, vNext[i]));
1627 //////////////////////////////////////////////////////////////////////////////
1632 map<uint256, CAlert> mapAlerts;
1633 CCriticalSection cs_mapAlerts;
1635 string GetWarnings(string strFor)
1638 string strStatusBar;
1640 if (GetBoolArg("-testsafemode"))
1643 // Misc warnings like out of disk space and clock is wrong
1644 if (strMiscWarning != "")
1647 strStatusBar = strMiscWarning;
1650 // Longer invalid proof-of-work chain
1651 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1654 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1658 CRITICAL_BLOCK(cs_mapAlerts)
1660 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1662 const CAlert& alert = item.second;
1663 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1665 nPriority = alert.nPriority;
1666 strStatusBar = alert.strStatusBar;
1671 if (strFor == "statusbar")
1672 return strStatusBar;
1673 else if (strFor == "rpc")
1675 assert(("GetWarnings() : invalid parameter", false));
1679 bool CAlert::ProcessAlert()
1681 if (!CheckSignature())
1686 CRITICAL_BLOCK(cs_mapAlerts)
1688 // Cancel previous alerts
1689 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1691 const CAlert& alert = (*mi).second;
1694 printf("cancelling alert %d\n", alert.nID);
1695 mapAlerts.erase(mi++);
1697 else if (!alert.IsInEffect())
1699 printf("expiring alert %d\n", alert.nID);
1700 mapAlerts.erase(mi++);
1706 // Check if this alert has been cancelled
1707 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1709 const CAlert& alert = item.second;
1710 if (alert.Cancels(*this))
1712 printf("alert already cancelled by %d\n", alert.nID);
1718 mapAlerts.insert(make_pair(GetHash(), *this));
1721 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1733 //////////////////////////////////////////////////////////////////////////////
1739 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1743 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1744 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1746 // Don't know what it is, just say we already got one
1753 // The message start string is designed to be unlikely to occur in normal data.
1754 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1755 // a large 4-byte int at any alignment.
1756 char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1759 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1761 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1762 RandAddSeedPerfmon();
1764 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1765 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1766 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1768 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1776 if (strCommand == "version")
1778 // Each connection can only send one version message
1779 if (pfrom->nVersion != 0)
1786 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1787 if (pfrom->nVersion == 10300)
1788 pfrom->nVersion = 300;
1789 if (pfrom->nVersion >= 106 && !vRecv.empty())
1790 vRecv >> addrFrom >> nNonce;
1791 if (pfrom->nVersion >= 106 && !vRecv.empty())
1792 vRecv >> pfrom->strSubVer;
1793 if (pfrom->nVersion >= 209 && !vRecv.empty())
1794 vRecv >> pfrom->nStartingHeight;
1796 if (pfrom->nVersion == 0)
1799 // Disconnect if we connected to ourself
1800 if (nNonce == nLocalHostNonce && nNonce > 1)
1802 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1803 pfrom->fDisconnect = true;
1807 // Be shy and don't send version until we hear
1808 if (pfrom->fInbound)
1809 pfrom->PushVersion();
1811 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1813 AddTimeData(pfrom->addr.ip, nTime);
1816 if (pfrom->nVersion >= 209)
1817 pfrom->PushMessage("verack");
1818 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1819 if (pfrom->nVersion < 209)
1820 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1822 if (!pfrom->fInbound)
1824 // Advertise our address
1825 if (addrLocalHost.IsRoutable() && !fUseProxy)
1827 CAddress addr(addrLocalHost);
1828 addr.nTime = GetAdjustedTime();
1829 pfrom->PushAddress(addr);
1832 // Get recent addresses
1833 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1835 pfrom->PushMessage("getaddr");
1836 pfrom->fGetAddr = true;
1840 // Ask the first connected node for block updates
1841 static int nAskedForBlocks;
1842 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
1845 pfrom->PushGetBlocks(pindexBest, uint256(0));
1849 CRITICAL_BLOCK(cs_mapAlerts)
1850 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1851 item.second.RelayTo(pfrom);
1853 pfrom->fSuccessfullyConnected = true;
1855 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1859 else if (pfrom->nVersion == 0)
1861 // Must have a version message before anything else
1866 else if (strCommand == "verack")
1868 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1872 else if (strCommand == "addr")
1874 vector<CAddress> vAddr;
1877 // Don't want addr from older versions unless seeding
1878 if (pfrom->nVersion < 209)
1880 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1882 if (vAddr.size() > 1000)
1883 return error("message addr size() = %d", vAddr.size());
1885 // Store the new addresses
1886 int64 nNow = GetAdjustedTime();
1887 int64 nSince = nNow - 10 * 60;
1888 BOOST_FOREACH(CAddress& addr, vAddr)
1892 // ignore IPv6 for now, since it isn't implemented anyway
1895 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1896 addr.nTime = nNow - 5 * 24 * 60 * 60;
1897 AddAddress(addr, 2 * 60 * 60);
1898 pfrom->AddAddressKnown(addr);
1899 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1901 // Relay to a limited number of other nodes
1902 CRITICAL_BLOCK(cs_vNodes)
1904 // Use deterministic randomness to send to the same nodes for 24 hours
1905 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1906 static uint256 hashSalt;
1908 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1909 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1910 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1911 multimap<uint256, CNode*> mapMix;
1912 BOOST_FOREACH(CNode* pnode, vNodes)
1914 if (pnode->nVersion < 31402)
1916 unsigned int nPointer;
1917 memcpy(&nPointer, &pnode, sizeof(nPointer));
1918 uint256 hashKey = hashRand ^ nPointer;
1919 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1920 mapMix.insert(make_pair(hashKey, pnode));
1922 int nRelayNodes = 2;
1923 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1924 ((*mi).second)->PushAddress(addr);
1928 if (vAddr.size() < 1000)
1929 pfrom->fGetAddr = false;
1933 else if (strCommand == "inv")
1937 if (vInv.size() > 50000)
1938 return error("message inv size() = %d", vInv.size());
1941 BOOST_FOREACH(const CInv& inv, vInv)
1945 pfrom->AddInventoryKnown(inv);
1947 bool fAlreadyHave = AlreadyHave(txdb, inv);
1948 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1952 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1953 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1955 // Track requests for our stuff
1956 Inventory(inv.hash);
1961 else if (strCommand == "getdata")
1965 if (vInv.size() > 50000)
1966 return error("message getdata size() = %d", vInv.size());
1968 BOOST_FOREACH(const CInv& inv, vInv)
1972 printf("received getdata for: %s\n", inv.ToString().c_str());
1974 if (inv.type == MSG_BLOCK)
1976 // Send block from disk
1977 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1978 if (mi != mapBlockIndex.end())
1981 block.ReadFromDisk((*mi).second);
1982 pfrom->PushMessage("block", block);
1984 // Trigger them to send a getblocks request for the next batch of inventory
1985 if (inv.hash == pfrom->hashContinue)
1987 // Bypass PushInventory, this must send even if redundant,
1988 // and we want it right after the last block so they don't
1989 // wait for other stuff first.
1991 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
1992 pfrom->PushMessage("inv", vInv);
1993 pfrom->hashContinue = 0;
1997 else if (inv.IsKnownType())
1999 // Send stream from relay memory
2000 CRITICAL_BLOCK(cs_mapRelay)
2002 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2003 if (mi != mapRelay.end())
2004 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2008 // Track requests for our stuff
2009 Inventory(inv.hash);
2014 else if (strCommand == "getblocks")
2016 CBlockLocator locator;
2018 vRecv >> locator >> hashStop;
2020 // Find the last block the caller has in the main chain
2021 CBlockIndex* pindex = locator.GetBlockIndex();
2023 // Send the rest of the chain
2025 pindex = pindex->pnext;
2026 int nLimit = 500 + locator.GetDistanceBack();
2027 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2028 for (; pindex; pindex = pindex->pnext)
2030 if (pindex->GetBlockHash() == hashStop)
2032 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2035 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2038 // When this block is requested, we'll send an inv that'll make them
2039 // getblocks the next batch of inventory.
2040 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2041 pfrom->hashContinue = pindex->GetBlockHash();
2048 else if (strCommand == "getheaders")
2050 CBlockLocator locator;
2052 vRecv >> locator >> hashStop;
2054 CBlockIndex* pindex = NULL;
2055 if (locator.IsNull())
2057 // If locator is null, return the hashStop block
2058 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2059 if (mi == mapBlockIndex.end())
2061 pindex = (*mi).second;
2065 // Find the last block the caller has in the main chain
2066 pindex = locator.GetBlockIndex();
2068 pindex = pindex->pnext;
2071 vector<CBlock> vHeaders;
2072 int nLimit = 2000 + locator.GetDistanceBack();
2073 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2074 for (; pindex; pindex = pindex->pnext)
2076 vHeaders.push_back(pindex->GetBlockHeader());
2077 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2080 pfrom->PushMessage("headers", vHeaders);
2084 else if (strCommand == "tx")
2086 vector<uint256> vWorkQueue;
2087 CDataStream vMsg(vRecv);
2091 CInv inv(MSG_TX, tx.GetHash());
2092 pfrom->AddInventoryKnown(inv);
2094 bool fMissingInputs = false;
2095 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2097 SyncWithWallets(tx, NULL, true);
2098 RelayMessage(inv, vMsg);
2099 mapAlreadyAskedFor.erase(inv);
2100 vWorkQueue.push_back(inv.hash);
2102 // Recursively process any orphan transactions that depended on this one
2103 for (int i = 0; i < vWorkQueue.size(); i++)
2105 uint256 hashPrev = vWorkQueue[i];
2106 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2107 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2110 const CDataStream& vMsg = *((*mi).second);
2112 CDataStream(vMsg) >> tx;
2113 CInv inv(MSG_TX, tx.GetHash());
2115 if (tx.AcceptToMemoryPool(true))
2117 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2118 SyncWithWallets(tx, NULL, true);
2119 RelayMessage(inv, vMsg);
2120 mapAlreadyAskedFor.erase(inv);
2121 vWorkQueue.push_back(inv.hash);
2126 BOOST_FOREACH(uint256 hash, vWorkQueue)
2127 EraseOrphanTx(hash);
2129 else if (fMissingInputs)
2131 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2137 else if (strCommand == "block")
2142 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2145 CInv inv(MSG_BLOCK, block.GetHash());
2146 pfrom->AddInventoryKnown(inv);
2148 if (ProcessBlock(pfrom, &block))
2149 mapAlreadyAskedFor.erase(inv);
2153 else if (strCommand == "getaddr")
2155 // Nodes rebroadcast an addr every 24 hours
2156 pfrom->vAddrToSend.clear();
2157 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2158 CRITICAL_BLOCK(cs_mapAddresses)
2160 unsigned int nCount = 0;
2161 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2163 const CAddress& addr = item.second;
2164 if (addr.nTime > nSince)
2167 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2169 const CAddress& addr = item.second;
2170 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2171 pfrom->PushAddress(addr);
2177 else if (strCommand == "checkorder")
2182 if (!GetBoolArg("-allowreceivebyip"))
2184 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2191 /// we have a chance to check the order here
2193 // Keep giving the same key to the same ip until they use it
2194 if (!mapReuseKey.count(pfrom->addr.ip))
2195 mapReuseKey[pfrom->addr.ip] = pwalletMain->GetKeyFromKeyPool();
2197 // Send back approval of order and pubkey to use
2198 CScript scriptPubKey;
2199 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2200 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2204 else if (strCommand == "reply")
2209 CRequestTracker tracker;
2210 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2212 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2213 if (mi != pfrom->mapRequests.end())
2215 tracker = (*mi).second;
2216 pfrom->mapRequests.erase(mi);
2219 if (!tracker.IsNull())
2220 tracker.fn(tracker.param1, vRecv);
2224 else if (strCommand == "ping")
2229 else if (strCommand == "alert")
2234 if (alert.ProcessAlert())
2237 pfrom->setKnown.insert(alert.GetHash());
2238 CRITICAL_BLOCK(cs_vNodes)
2239 BOOST_FOREACH(CNode* pnode, vNodes)
2240 alert.RelayTo(pnode);
2247 // Ignore unknown commands for extensibility
2251 // Update the last seen time for this node's address
2252 if (pfrom->fNetworkNode)
2253 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2254 AddressCurrentlyConnected(pfrom->addr);
2260 bool ProcessMessages(CNode* pfrom)
2262 CDataStream& vRecv = pfrom->vRecv;
2266 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2270 // (4) message start
2279 // Scan for message start
2280 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2281 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2282 if (vRecv.end() - pstart < nHeaderSize)
2284 if (vRecv.size() > nHeaderSize)
2286 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2287 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2291 if (pstart - vRecv.begin() > 0)
2292 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2293 vRecv.erase(vRecv.begin(), pstart);
2296 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2301 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2304 string strCommand = hdr.GetCommand();
2307 unsigned int nMessageSize = hdr.nMessageSize;
2308 if (nMessageSize > MAX_SIZE)
2310 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2313 if (nMessageSize > vRecv.size())
2315 // Rewind and wait for rest of message
2316 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2321 if (vRecv.GetVersion() >= 209)
2323 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2324 unsigned int nChecksum = 0;
2325 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2326 if (nChecksum != hdr.nChecksum)
2328 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2329 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2334 // Copy message to its own buffer
2335 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2336 vRecv.ignore(nMessageSize);
2342 CRITICAL_BLOCK(cs_main)
2343 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2347 catch (std::ios_base::failure& e)
2349 if (strstr(e.what(), "end of data"))
2351 // Allow exceptions from underlength message on vRecv
2352 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());
2354 else if (strstr(e.what(), "size too large"))
2356 // Allow exceptions from overlong size
2357 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2361 PrintExceptionContinue(&e, "ProcessMessage()");
2364 catch (std::exception& e) {
2365 PrintExceptionContinue(&e, "ProcessMessage()");
2367 PrintExceptionContinue(NULL, "ProcessMessage()");
2371 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2379 bool SendMessages(CNode* pto, bool fSendTrickle)
2381 CRITICAL_BLOCK(cs_main)
2383 // Don't send anything until we get their version message
2384 if (pto->nVersion == 0)
2388 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2389 pto->PushMessage("ping");
2391 // Resend wallet transactions that haven't gotten in a block yet
2392 ResendWalletTransactions();
2394 // Address refresh broadcast
2395 static int64 nLastRebroadcast;
2396 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2398 nLastRebroadcast = GetTime();
2399 CRITICAL_BLOCK(cs_vNodes)
2401 BOOST_FOREACH(CNode* pnode, vNodes)
2403 // Periodically clear setAddrKnown to allow refresh broadcasts
2404 pnode->setAddrKnown.clear();
2406 // Rebroadcast our address
2407 if (addrLocalHost.IsRoutable() && !fUseProxy)
2409 CAddress addr(addrLocalHost);
2410 addr.nTime = GetAdjustedTime();
2411 pnode->PushAddress(addr);
2417 // Clear out old addresses periodically so it's not too much work at once
2418 static int64 nLastClear;
2419 if (nLastClear == 0)
2420 nLastClear = GetTime();
2421 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2423 nLastClear = GetTime();
2424 CRITICAL_BLOCK(cs_mapAddresses)
2427 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2428 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2429 mi != mapAddresses.end();)
2431 const CAddress& addr = (*mi).second;
2432 if (addr.nTime < nSince)
2434 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2436 addrdb.EraseAddress(addr);
2437 mapAddresses.erase(mi++);
2451 vector<CAddress> vAddr;
2452 vAddr.reserve(pto->vAddrToSend.size());
2453 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2455 // returns true if wasn't already contained in the set
2456 if (pto->setAddrKnown.insert(addr).second)
2458 vAddr.push_back(addr);
2459 // receiver rejects addr messages larger than 1000
2460 if (vAddr.size() >= 1000)
2462 pto->PushMessage("addr", vAddr);
2467 pto->vAddrToSend.clear();
2469 pto->PushMessage("addr", vAddr);
2474 // Message: inventory
2477 vector<CInv> vInvWait;
2478 CRITICAL_BLOCK(pto->cs_inventory)
2480 vInv.reserve(pto->vInventoryToSend.size());
2481 vInvWait.reserve(pto->vInventoryToSend.size());
2482 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2484 if (pto->setInventoryKnown.count(inv))
2487 // trickle out tx inv to protect privacy
2488 if (inv.type == MSG_TX && !fSendTrickle)
2490 // 1/4 of tx invs blast to all immediately
2491 static uint256 hashSalt;
2493 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2494 uint256 hashRand = inv.hash ^ hashSalt;
2495 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2496 bool fTrickleWait = ((hashRand & 3) != 0);
2498 // always trickle our own transactions
2502 if (GetTransaction(inv.hash, wtx))
2504 fTrickleWait = true;
2509 vInvWait.push_back(inv);
2514 // returns true if wasn't already contained in the set
2515 if (pto->setInventoryKnown.insert(inv).second)
2517 vInv.push_back(inv);
2518 if (vInv.size() >= 1000)
2520 pto->PushMessage("inv", vInv);
2525 pto->vInventoryToSend = vInvWait;
2528 pto->PushMessage("inv", vInv);
2534 vector<CInv> vGetData;
2535 int64 nNow = GetTime() * 1000000;
2537 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2539 const CInv& inv = (*pto->mapAskFor.begin()).second;
2540 if (!AlreadyHave(txdb, inv))
2542 printf("sending getdata: %s\n", inv.ToString().c_str());
2543 vGetData.push_back(inv);
2544 if (vGetData.size() >= 1000)
2546 pto->PushMessage("getdata", vGetData);
2550 pto->mapAskFor.erase(pto->mapAskFor.begin());
2552 if (!vGetData.empty())
2553 pto->PushMessage("getdata", vGetData);
2572 //////////////////////////////////////////////////////////////////////////////
2577 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2579 unsigned char* pdata = (unsigned char*)pbuffer;
2580 unsigned int blocks = 1 + ((len + 8) / 64);
2581 unsigned char* pend = pdata + 64 * blocks;
2582 memset(pdata + len, 0, 64 * blocks - len);
2584 unsigned int bits = len * 8;
2585 pend[-1] = (bits >> 0) & 0xff;
2586 pend[-2] = (bits >> 8) & 0xff;
2587 pend[-3] = (bits >> 16) & 0xff;
2588 pend[-4] = (bits >> 24) & 0xff;
2592 using CryptoPP::ByteReverse;
2594 static const unsigned int pSHA256InitState[8] =
2595 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2597 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2599 memcpy(pstate, pinit, 32);
2600 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2604 // ScanHash scans nonces looking for a hash with at least some zero bits.
2605 // It operates on big endian data. Caller does the byte reversing.
2606 // All input buffers are 16-byte aligned. nNonce is usually preserved
2607 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2608 // the block is rebuilt and nNonce starts over at zero.
2610 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2612 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2616 // Hash pdata using pmidstate as the starting state into
2617 // preformatted buffer phash1, then hash phash1 into phash
2619 SHA256Transform(phash1, pdata, pmidstate);
2620 SHA256Transform(phash, phash1, pSHA256InitState);
2622 // Return the nonce if the hash has at least some zero bits,
2623 // caller will check if it has enough to reach the target
2624 if (((unsigned short*)phash)[14] == 0)
2627 // If nothing found after trying for a while, return -1
2628 if ((nNonce & 0xffff) == 0)
2630 nHashesDone = 0xffff+1;
2641 set<uint256> setDependsOn;
2644 COrphan(CTransaction* ptxIn)
2652 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2653 BOOST_FOREACH(uint256 hash, setDependsOn)
2654 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2659 CBlock* CreateNewBlock(CReserveKey& reservekey)
2661 CBlockIndex* pindexPrev = pindexBest;
2664 auto_ptr<CBlock> pblock(new CBlock());
2668 // Create coinbase tx
2670 txNew.vin.resize(1);
2671 txNew.vin[0].prevout.SetNull();
2672 txNew.vout.resize(1);
2673 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2675 // Add our coinbase tx as first transaction
2676 pblock->vtx.push_back(txNew);
2678 // Collect memory pool transactions into the block
2680 CRITICAL_BLOCK(cs_main)
2681 CRITICAL_BLOCK(cs_mapTransactions)
2685 // Priority order to process transactions
2686 list<COrphan> vOrphan; // list memory doesn't move
2687 map<uint256, vector<COrphan*> > mapDependers;
2688 multimap<double, CTransaction*> mapPriority;
2689 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2691 CTransaction& tx = (*mi).second;
2692 if (tx.IsCoinBase() || !tx.IsFinal())
2695 COrphan* porphan = NULL;
2696 double dPriority = 0;
2697 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2699 // Read prev transaction
2700 CTransaction txPrev;
2702 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2704 // Has to wait for dependencies
2707 // Use list for automatic deletion
2708 vOrphan.push_back(COrphan(&tx));
2709 porphan = &vOrphan.back();
2711 mapDependers[txin.prevout.hash].push_back(porphan);
2712 porphan->setDependsOn.insert(txin.prevout.hash);
2715 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2717 // Read block header
2718 int nConf = txindex.GetDepthInMainChain();
2720 dPriority += (double)nValueIn * nConf;
2722 if (fDebug && GetBoolArg("-printpriority"))
2723 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2726 // Priority is sum(valuein * age) / txsize
2727 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2730 porphan->dPriority = dPriority;
2732 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2734 if (fDebug && GetBoolArg("-printpriority"))
2736 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2743 // Collect transactions into block
2744 map<uint256, CTxIndex> mapTestPool;
2745 uint64 nBlockSize = 1000;
2746 int nBlockSigOps = 100;
2747 while (!mapPriority.empty())
2749 // Take highest priority transaction off priority queue
2750 double dPriority = -(*mapPriority.begin()).first;
2751 CTransaction& tx = *(*mapPriority.begin()).second;
2752 mapPriority.erase(mapPriority.begin());
2755 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2756 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2758 int nTxSigOps = tx.GetSigOpCount();
2759 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2762 // Transaction fee required depends on block size
2763 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2764 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2766 // Connecting shouldn't fail due to dependency on other memory pool transactions
2767 // because we're already processing them in order of dependency
2768 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2769 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2771 swap(mapTestPool, mapTestPoolTmp);
2774 pblock->vtx.push_back(tx);
2775 nBlockSize += nTxSize;
2776 nBlockSigOps += nTxSigOps;
2778 // Add transactions that depend on this one to the priority queue
2779 uint256 hash = tx.GetHash();
2780 if (mapDependers.count(hash))
2782 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2784 if (!porphan->setDependsOn.empty())
2786 porphan->setDependsOn.erase(hash);
2787 if (porphan->setDependsOn.empty())
2788 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2794 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2797 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2798 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2799 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2800 pblock->nBits = GetNextWorkRequired(pindexPrev);
2803 return pblock.release();
2807 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
2809 // Update nExtraNonce
2810 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2811 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
2816 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
2817 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2821 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2824 // Prebuild hash buffers
2831 uint256 hashPrevBlock;
2832 uint256 hashMerkleRoot;
2835 unsigned int nNonce;
2838 unsigned char pchPadding0[64];
2840 unsigned char pchPadding1[64];
2843 memset(&tmp, 0, sizeof(tmp));
2845 tmp.block.nVersion = pblock->nVersion;
2846 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2847 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2848 tmp.block.nTime = pblock->nTime;
2849 tmp.block.nBits = pblock->nBits;
2850 tmp.block.nNonce = pblock->nNonce;
2852 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2853 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2855 // Byte swap all the input buffer
2856 for (int i = 0; i < sizeof(tmp)/4; i++)
2857 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2859 // Precalc the first half of the first hash, which stays constant
2860 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2862 memcpy(pdata, &tmp.block, 128);
2863 memcpy(phash1, &tmp.hash1, 64);
2867 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2869 uint256 hash = pblock->GetHash();
2870 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2872 if (hash > hashTarget)
2876 printf("BitcoinMiner:\n");
2877 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2879 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2880 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2883 CRITICAL_BLOCK(cs_main)
2885 if (pblock->hashPrevBlock != hashBestChain)
2886 return error("BitcoinMiner : generated block is stale");
2888 // Remove key from key pool
2889 reservekey.KeepKey();
2891 // Track how many getdata requests this block gets
2892 CRITICAL_BLOCK(wallet.cs_mapRequestCount)
2893 wallet.mapRequestCount[pblock->GetHash()] = 0;
2895 // Process this block the same as if we had received it from another node
2896 if (!ProcessBlock(NULL, pblock))
2897 return error("BitcoinMiner : ProcessBlock, block not accepted");
2904 void static ThreadBitcoinMiner(void* parg);
2906 void static BitcoinMiner(CWallet *pwallet)
2908 printf("BitcoinMiner started\n");
2909 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2911 // Each thread has its own key and counter
2912 CReserveKey reservekey(pwallet);
2913 unsigned int nExtraNonce = 0;
2914 int64 nPrevTime = 0;
2916 while (fGenerateBitcoins)
2918 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2922 while (vNodes.empty() || IsInitialBlockDownload())
2927 if (!fGenerateBitcoins)
2935 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2936 CBlockIndex* pindexPrev = pindexBest;
2938 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2941 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
2943 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2947 // Prebuild hash buffers
2949 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2950 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2951 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2953 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2955 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2956 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2962 int64 nStart = GetTime();
2963 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2965 uint256& hash = *alignup<16>(hashbuf);
2968 unsigned int nHashesDone = 0;
2969 unsigned int nNonceFound;
2972 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2973 (char*)&hash, nHashesDone);
2975 // Check if something found
2976 if (nNonceFound != -1)
2978 for (int i = 0; i < sizeof(hash)/4; i++)
2979 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2981 if (hash <= hashTarget)
2984 pblock->nNonce = ByteReverse(nNonceFound);
2985 assert(hash == pblock->GetHash());
2987 SetThreadPriority(THREAD_PRIORITY_NORMAL);
2988 CheckWork(pblock.get(), *pwalletMain, reservekey);
2989 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2995 static int64 nHashCounter;
2996 if (nHPSTimerStart == 0)
2998 nHPSTimerStart = GetTimeMillis();
3002 nHashCounter += nHashesDone;
3003 if (GetTimeMillis() - nHPSTimerStart > 4000)
3005 static CCriticalSection cs;
3008 if (GetTimeMillis() - nHPSTimerStart > 4000)
3010 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3011 nHPSTimerStart = GetTimeMillis();
3013 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3014 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3015 static int64 nLogTime;
3016 if (GetTime() - nLogTime > 30 * 60)
3018 nLogTime = GetTime();
3019 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3020 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3026 // Check for stop or if block needs to be rebuilt
3029 if (!fGenerateBitcoins)
3031 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3035 if (nBlockNonce >= 0xffff0000)
3037 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3039 if (pindexPrev != pindexBest)
3042 // Update nTime every few seconds
3043 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3044 nBlockTime = ByteReverse(pblock->nTime);
3049 void static ThreadBitcoinMiner(void* parg)
3051 CWallet* pwallet = (CWallet*)parg;
3054 vnThreadsRunning[3]++;
3055 BitcoinMiner(pwallet);
3056 vnThreadsRunning[3]--;
3058 catch (std::exception& e) {
3059 vnThreadsRunning[3]--;
3060 PrintException(&e, "ThreadBitcoinMiner()");
3062 vnThreadsRunning[3]--;
3063 PrintException(NULL, "ThreadBitcoinMiner()");
3065 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3067 if (vnThreadsRunning[3] == 0)
3069 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3073 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3075 if (fGenerateBitcoins != fGenerate)
3077 fGenerateBitcoins = fGenerate;
3078 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3081 if (fGenerateBitcoins)
3083 int nProcessors = boost::thread::hardware_concurrency();
3084 printf("%d processors\n", nProcessors);
3085 if (nProcessors < 1)
3087 if (fLimitProcessors && nProcessors > nLimitProcessors)
3088 nProcessors = nLimitProcessors;
3089 int nAddThreads = nProcessors - vnThreadsRunning[3];
3090 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3091 for (int i = 0; i < nAddThreads; i++)
3093 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3094 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");