1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The PPCoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
9 #include "cryptopp/sha.h"
10 #include <boost/filesystem.hpp>
11 #include <boost/filesystem/fstream.hpp>
14 using namespace boost;
20 CCriticalSection cs_setpwalletRegistered;
21 set<CWallet*> setpwalletRegistered;
23 CCriticalSection cs_main;
25 CCriticalSection cs_mapPubKeys;
26 map<uint160, vector<unsigned char> > mapPubKeys;
28 map<uint256, CTransaction> mapTransactions;
29 CCriticalSection cs_mapTransactions;
30 unsigned int nTransactionsUpdated = 0;
31 map<COutPoint, CInPoint> mapNextTx;
33 map<uint256, CBlockIndex*> mapBlockIndex;
34 uint256 hashGenesisBlock("0x0000000088ddd1db81553a3908a2980587924d434938371aaa57d0e1e03e54dc");
35 CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
36 const int nTotalBlocksEstimate = 134444; // Conservative estimate of total nr of blocks on main chain
37 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
38 CBlockIndex* pindexGenesisBlock = NULL;
40 CBigNum bnBestChainWork = 0;
41 CBigNum bnBestInvalidWork = 0;
42 uint256 hashBestChain = 0;
43 CBlockIndex* pindexBest = NULL;
44 int64 nTimeBestReceived = 0;
46 map<uint256, CBlock*> mapOrphanBlocks;
47 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
49 map<uint256, CDataStream*> mapOrphanTransactions;
50 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
57 int fGenerateBitcoins = false;
58 int64 nTransactionFee = 0;
59 CAddress addrIncoming;
60 int fLimitProcessors = false;
61 int nLimitProcessors = 1;
62 int fMinimizeToTray = true;
63 int fMinimizeOnClose = true;
76 //////////////////////////////////////////////////////////////////////////////
78 // dispatching functions
81 void RegisterWallet(CWallet* pwalletIn)
83 CRITICAL_BLOCK(cs_setpwalletRegistered)
85 setpwalletRegistered.insert(pwalletIn);
89 void UnregisterWallet(CWallet* pwalletIn)
91 CRITICAL_BLOCK(cs_setpwalletRegistered)
93 setpwalletRegistered.erase(pwalletIn);
97 bool static IsFromMe(CTransaction& tx)
99 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
100 if (pwallet->IsFromMe(tx))
105 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
107 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
108 if (pwallet->GetTransaction(hashTx,wtx))
113 void static EraseFromWallets(uint256 hash)
115 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
116 pwallet->EraseFromWallet(hash);
119 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false)
121 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
122 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
125 void static SetBestChain(const CBlockLocator& loc)
127 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
128 pwallet->SetBestChain(loc);
131 void static UpdatedTransaction(const uint256& hashTx)
133 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
134 pwallet->UpdatedTransaction(hashTx);
137 void static PrintWallets(const CBlock& block)
139 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
140 pwallet->PrintWallet(block);
143 void static Inventory(const uint256& hash)
145 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
146 pwallet->Inventory(hash);
149 void static ResendWalletTransactions()
151 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
152 pwallet->ResendWalletTransactions();
161 //////////////////////////////////////////////////////////////////////////////
163 // mapOrphanTransactions
166 void static AddOrphanTx(const CDataStream& vMsg)
169 CDataStream(vMsg) >> tx;
170 uint256 hash = tx.GetHash();
171 if (mapOrphanTransactions.count(hash))
173 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
174 BOOST_FOREACH(const CTxIn& txin, tx.vin)
175 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
178 void static EraseOrphanTx(uint256 hash)
180 if (!mapOrphanTransactions.count(hash))
182 const CDataStream* pvMsg = mapOrphanTransactions[hash];
184 CDataStream(*pvMsg) >> tx;
185 BOOST_FOREACH(const CTxIn& txin, tx.vin)
187 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
188 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
190 if ((*mi).second == pvMsg)
191 mapOrphanTransactionsByPrev.erase(mi++);
197 mapOrphanTransactions.erase(hash);
207 //////////////////////////////////////////////////////////////////////////////
209 // CTransaction and CTxIndex
212 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
215 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
217 if (!ReadFromDisk(txindexRet.pos))
219 if (prevout.n >= vout.size())
227 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
230 return ReadFromDisk(txdb, prevout, txindex);
233 bool CTransaction::ReadFromDisk(COutPoint prevout)
237 return ReadFromDisk(txdb, prevout, txindex);
242 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
254 // Load the block this tx is in
256 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
258 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
263 // Update the tx's hashBlock
264 hashBlock = pblock->GetHash();
266 // Locate the transaction
267 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
268 if (pblock->vtx[nIndex] == *(CTransaction*)this)
270 if (nIndex == pblock->vtx.size())
272 vMerkleBranch.clear();
274 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
278 // Fill in merkle branch
279 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
282 // Is the tx in a block that's in the main chain
283 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
284 if (mi == mapBlockIndex.end())
286 CBlockIndex* pindex = (*mi).second;
287 if (!pindex || !pindex->IsInMainChain())
290 return pindexBest->nHeight - pindex->nHeight + 1;
299 bool CTransaction::CheckTransaction() const
301 // Basic checks that don't depend on any context
302 if (vin.empty() || vout.empty())
303 return error("CTransaction::CheckTransaction() : vin or vout empty");
306 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
307 return error("CTransaction::CheckTransaction() : size limits failed");
309 // Check for negative or overflow output values
311 BOOST_FOREACH(const CTxOut& txout, vout)
313 if (txout.nValue < 0)
314 return error("CTransaction::CheckTransaction() : txout.nValue negative");
315 if (txout.nValue > MAX_MONEY)
316 return error("CTransaction::CheckTransaction() : txout.nValue too high");
317 nValueOut += txout.nValue;
318 if (!MoneyRange(nValueOut))
319 return error("CTransaction::CheckTransaction() : txout total out of range");
324 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
325 return error("CTransaction::CheckTransaction() : coinbase script size");
329 BOOST_FOREACH(const CTxIn& txin, vin)
330 if (txin.prevout.IsNull())
331 return error("CTransaction::CheckTransaction() : prevout is null");
337 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
340 *pfMissingInputs = false;
342 if (!CheckTransaction())
343 return error("AcceptToMemoryPool() : CheckTransaction failed");
345 // Coinbase is only valid in a block, not as a loose transaction
347 return error("AcceptToMemoryPool() : coinbase as individual tx");
349 // To help v0.1.5 clients who would see it as a negative number
350 if ((int64)nLockTime > INT_MAX)
351 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
354 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
355 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
356 // attacks disallow transactions with more than one SigOp per 34 bytes.
357 // 34 bytes because a TxOut is:
358 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
359 if (GetSigOpCount() > nSize / 34 || nSize < 100)
360 return error("AcceptToMemoryPool() : nonstandard transaction");
362 // Rather not work on nonstandard transactions (unless -testnet)
363 if (!fTestNet && !IsStandard())
364 return error("AcceptToMemoryPool() : nonstandard transaction type");
366 // Do we already have it?
367 uint256 hash = GetHash();
368 CRITICAL_BLOCK(cs_mapTransactions)
369 if (mapTransactions.count(hash))
372 if (txdb.ContainsTx(hash))
375 // Check for conflicts with in-memory transactions
376 CTransaction* ptxOld = NULL;
377 for (int i = 0; i < vin.size(); i++)
379 COutPoint outpoint = vin[i].prevout;
380 if (mapNextTx.count(outpoint))
382 // Disable replacement feature for now
385 // Allow replacing with a newer version of the same transaction
388 ptxOld = mapNextTx[outpoint].ptx;
389 if (ptxOld->IsFinal())
391 if (!IsNewerThan(*ptxOld))
393 for (int i = 0; i < vin.size(); i++)
395 COutPoint outpoint = vin[i].prevout;
396 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
405 // Check against previous transactions
406 map<uint256, CTxIndex> mapUnused;
408 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
411 *pfMissingInputs = true;
412 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
415 // Don't accept it if it can't get into a block
416 if (nFees < GetMinFee(1000, true, true))
417 return error("AcceptToMemoryPool() : not enough fees");
419 // Continuously rate-limit free transactions
420 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
421 // be annoying or make other's transactions take longer to confirm.
422 if (nFees < MIN_RELAY_TX_FEE)
424 static CCriticalSection cs;
425 static double dFreeCount;
426 static int64 nLastTime;
427 int64 nNow = GetTime();
431 // Use an exponentially decaying ~10-minute window:
432 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
434 // -limitfreerelay unit is thousand-bytes-per-minute
435 // At default rate it would take over a month to fill 1GB
436 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
437 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
439 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
445 // Store transaction in memory
446 CRITICAL_BLOCK(cs_mapTransactions)
450 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
451 ptxOld->RemoveFromMemoryPool();
453 AddToMemoryPoolUnchecked();
456 ///// are we sure this is ok when loading transactions or restoring block txes
457 // If updated, erase old tx from wallet
459 EraseFromWallets(ptxOld->GetHash());
461 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
465 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
468 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
471 bool CTransaction::AddToMemoryPoolUnchecked()
473 // Add to memory pool without checking anything. Don't call this directly,
474 // call AcceptToMemoryPool to properly check the transaction first.
475 CRITICAL_BLOCK(cs_mapTransactions)
477 uint256 hash = GetHash();
478 mapTransactions[hash] = *this;
479 for (int i = 0; i < vin.size(); i++)
480 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
481 nTransactionsUpdated++;
487 bool CTransaction::RemoveFromMemoryPool()
489 // Remove transaction from memory pool
490 CRITICAL_BLOCK(cs_mapTransactions)
492 BOOST_FOREACH(const CTxIn& txin, vin)
493 mapNextTx.erase(txin.prevout);
494 mapTransactions.erase(GetHash());
495 nTransactionsUpdated++;
505 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
507 if (hashBlock == 0 || nIndex == -1)
510 // Find the block it claims to be in
511 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
512 if (mi == mapBlockIndex.end())
514 CBlockIndex* pindex = (*mi).second;
515 if (!pindex || !pindex->IsInMainChain())
518 // Make sure the merkle branch connects to this block
519 if (!fMerkleVerified)
521 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
523 fMerkleVerified = true;
526 nHeightRet = pindex->nHeight;
527 return pindexBest->nHeight - pindex->nHeight + 1;
531 int CMerkleTx::GetBlocksToMaturity() const
535 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
539 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
543 if (!IsInMainChain() && !ClientConnectInputs())
545 return CTransaction::AcceptToMemoryPool(txdb, false);
549 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
553 bool CMerkleTx::AcceptToMemoryPool()
556 return AcceptToMemoryPool(txdb);
561 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
563 CRITICAL_BLOCK(cs_mapTransactions)
565 // Add previous supporting transactions first
566 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
568 if (!tx.IsCoinBase())
570 uint256 hash = tx.GetHash();
571 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
572 tx.AcceptToMemoryPool(txdb, fCheckInputs);
575 return AcceptToMemoryPool(txdb, fCheckInputs);
580 bool CWalletTx::AcceptWalletTransaction()
583 return AcceptWalletTransaction(txdb);
586 int CTxIndex::GetDepthInMainChain() const
590 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
592 // Find the block in the index
593 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
594 if (mi == mapBlockIndex.end())
596 CBlockIndex* pindex = (*mi).second;
597 if (!pindex || !pindex->IsInMainChain())
599 return 1 + nBestHeight - pindex->nHeight;
611 //////////////////////////////////////////////////////////////////////////////
613 // CBlock and CBlockIndex
616 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
618 if (!fReadTransactions)
620 *this = pindex->GetBlockHeader();
623 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
625 if (GetHash() != pindex->GetBlockHash())
626 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
630 uint256 static GetOrphanRoot(const CBlock* pblock)
632 // Work back to the first block in the orphan chain
633 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
634 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
635 return pblock->GetHash();
638 int64 static GetBlockValue(int nHeight, int64 nFees)
640 int64 nSubsidy = 50 * COIN;
642 // Subsidy is cut in half every 4 years
643 nSubsidy >>= (nHeight / 210000);
645 return nSubsidy + nFees;
648 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
650 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
651 const int64 nTargetSpacing = 10 * 60;
652 const int64 nInterval = nTargetTimespan / nTargetSpacing;
655 if (pindexLast == NULL)
656 return bnProofOfWorkLimit.GetCompact();
658 // Only change once per interval
659 if ((pindexLast->nHeight+1) % nInterval != 0)
660 return pindexLast->nBits;
662 // Go back by what we want to be 14 days worth of blocks
663 const CBlockIndex* pindexFirst = pindexLast;
664 for (int i = 0; pindexFirst && i < nInterval-1; i++)
665 pindexFirst = pindexFirst->pprev;
668 // Limit adjustment step
669 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
670 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
671 if (nActualTimespan < nTargetTimespan/4)
672 nActualTimespan = nTargetTimespan/4;
673 if (nActualTimespan > nTargetTimespan*4)
674 nActualTimespan = nTargetTimespan*4;
678 bnNew.SetCompact(pindexLast->nBits);
679 bnNew *= nActualTimespan;
680 bnNew /= nTargetTimespan;
682 if (bnNew > bnProofOfWorkLimit)
683 bnNew = bnProofOfWorkLimit;
686 printf("GetNextWorkRequired RETARGET\n");
687 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
688 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
689 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
691 return bnNew.GetCompact();
694 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
697 bnTarget.SetCompact(nBits);
700 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
701 return error("CheckProofOfWork() : nBits below minimum work");
703 // Check proof of work matches claimed amount
704 if (hash > bnTarget.getuint256())
705 return error("CheckProofOfWork() : hash doesn't match nBits");
710 // Return conservative estimate of total number of blocks, 0 if unknown
711 int GetTotalBlocksEstimate()
719 return nTotalBlocksEstimate;
723 bool IsInitialBlockDownload()
725 if (pindexBest == NULL || nBestHeight < (GetTotalBlocksEstimate()-nInitialBlockThreshold))
727 static int64 nLastUpdate;
728 static CBlockIndex* pindexLastBest;
729 if (pindexBest != pindexLastBest)
731 pindexLastBest = pindexBest;
732 nLastUpdate = GetTime();
734 return (GetTime() - nLastUpdate < 10 &&
735 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
738 void static InvalidChainFound(CBlockIndex* pindexNew)
740 if (pindexNew->bnChainWork > bnBestInvalidWork)
742 bnBestInvalidWork = pindexNew->bnChainWork;
743 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
746 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());
747 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
748 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
749 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
762 bool CTransaction::DisconnectInputs(CTxDB& txdb)
764 // Relinquish previous transactions' spent pointers
767 BOOST_FOREACH(const CTxIn& txin, vin)
769 COutPoint prevout = txin.prevout;
771 // Get prev txindex from disk
773 if (!txdb.ReadTxIndex(prevout.hash, txindex))
774 return error("DisconnectInputs() : ReadTxIndex failed");
776 if (prevout.n >= txindex.vSpent.size())
777 return error("DisconnectInputs() : prevout.n out of range");
779 // Mark outpoint as not spent
780 txindex.vSpent[prevout.n].SetNull();
783 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
784 return error("DisconnectInputs() : UpdateTxIndex failed");
788 // Remove transaction from index
789 if (!txdb.EraseTxIndex(*this))
790 return error("DisconnectInputs() : EraseTxPos failed");
796 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
797 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
799 // Take over previous transactions' spent pointers
803 for (int i = 0; i < vin.size(); i++)
805 COutPoint prevout = vin[i].prevout;
810 if (fMiner && mapTestPool.count(prevout.hash))
812 // Get txindex from current proposed changes
813 txindex = mapTestPool[prevout.hash];
817 // Read txindex from txdb
818 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
820 if (!fFound && (fBlock || fMiner))
821 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());
825 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
827 // Get prev tx from single transactions in memory
828 CRITICAL_BLOCK(cs_mapTransactions)
830 if (!mapTransactions.count(prevout.hash))
831 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
832 txPrev = mapTransactions[prevout.hash];
835 txindex.vSpent.resize(txPrev.vout.size());
839 // Get prev tx from disk
840 if (!txPrev.ReadFromDisk(txindex.pos))
841 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
844 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
845 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());
847 // If prev is coinbase, check that it's matured
848 if (txPrev.IsCoinBase())
849 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
850 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
851 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
854 if (!VerifySignature(txPrev, *this, i))
855 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
857 // Check for conflicts
858 if (!txindex.vSpent[prevout.n].IsNull())
859 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());
861 // Check for negative or overflow input values
862 nValueIn += txPrev.vout[prevout.n].nValue;
863 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
864 return error("ConnectInputs() : txin values out of range");
866 // Mark outpoints as spent
867 txindex.vSpent[prevout.n] = posThisTx;
872 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
873 return error("ConnectInputs() : UpdateTxIndex failed");
877 mapTestPool[prevout.hash] = txindex;
881 if (nValueIn < GetValueOut())
882 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
884 // Tally transaction fees
885 int64 nTxFee = nValueIn - GetValueOut();
887 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
888 if (nTxFee < nMinFee)
891 if (!MoneyRange(nFees))
892 return error("ConnectInputs() : nFees out of range");
897 // Add transaction to disk index
898 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
899 return error("ConnectInputs() : AddTxPos failed");
903 // Add transaction to test pool
904 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
911 bool CTransaction::ClientConnectInputs()
916 // Take over previous transactions' spent pointers
917 CRITICAL_BLOCK(cs_mapTransactions)
920 for (int i = 0; i < vin.size(); i++)
922 // Get prev tx from single transactions in memory
923 COutPoint prevout = vin[i].prevout;
924 if (!mapTransactions.count(prevout.hash))
926 CTransaction& txPrev = mapTransactions[prevout.hash];
928 if (prevout.n >= txPrev.vout.size())
932 if (!VerifySignature(txPrev, *this, i))
933 return error("ConnectInputs() : VerifySignature failed");
935 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
936 ///// this has to go away now that posNext is gone
937 // // Check for conflicts
938 // if (!txPrev.vout[prevout.n].posNext.IsNull())
939 // return error("ConnectInputs() : prev tx already used");
941 // // Flag outpoints as used
942 // txPrev.vout[prevout.n].posNext = posThisTx;
944 nValueIn += txPrev.vout[prevout.n].nValue;
946 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
947 return error("ClientConnectInputs() : txin values out of range");
949 if (GetValueOut() > nValueIn)
959 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
961 // Disconnect in reverse order
962 for (int i = vtx.size()-1; i >= 0; i--)
963 if (!vtx[i].DisconnectInputs(txdb))
966 // Update block index on disk without changing it in memory.
967 // The memory index structure will be changed after the db commits.
970 CDiskBlockIndex blockindexPrev(pindex->pprev);
971 blockindexPrev.hashNext = 0;
972 if (!txdb.WriteBlockIndex(blockindexPrev))
973 return error("DisconnectBlock() : WriteBlockIndex failed");
979 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
981 // Check it again in case a previous version let a bad block in
985 //// issue here: it doesn't know the version
986 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
988 map<uint256, CTxIndex> mapUnused;
990 BOOST_FOREACH(CTransaction& tx, vtx)
992 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
993 nTxPos += ::GetSerializeSize(tx, SER_DISK);
995 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
999 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1002 // Update block index on disk without changing it in memory.
1003 // The memory index structure will be changed after the db commits.
1006 CDiskBlockIndex blockindexPrev(pindex->pprev);
1007 blockindexPrev.hashNext = pindex->GetBlockHash();
1008 if (!txdb.WriteBlockIndex(blockindexPrev))
1009 return error("ConnectBlock() : WriteBlockIndex failed");
1012 // Watch for transactions paying to me
1013 BOOST_FOREACH(CTransaction& tx, vtx)
1014 SyncWithWallets(tx, this, true);
1019 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1021 printf("REORGANIZE\n");
1024 CBlockIndex* pfork = pindexBest;
1025 CBlockIndex* plonger = pindexNew;
1026 while (pfork != plonger)
1028 while (plonger->nHeight > pfork->nHeight)
1029 if (!(plonger = plonger->pprev))
1030 return error("Reorganize() : plonger->pprev is null");
1031 if (pfork == plonger)
1033 if (!(pfork = pfork->pprev))
1034 return error("Reorganize() : pfork->pprev is null");
1037 // List of what to disconnect
1038 vector<CBlockIndex*> vDisconnect;
1039 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1040 vDisconnect.push_back(pindex);
1042 // List of what to connect
1043 vector<CBlockIndex*> vConnect;
1044 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1045 vConnect.push_back(pindex);
1046 reverse(vConnect.begin(), vConnect.end());
1048 // Disconnect shorter branch
1049 vector<CTransaction> vResurrect;
1050 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1053 if (!block.ReadFromDisk(pindex))
1054 return error("Reorganize() : ReadFromDisk for disconnect failed");
1055 if (!block.DisconnectBlock(txdb, pindex))
1056 return error("Reorganize() : DisconnectBlock failed");
1058 // Queue memory transactions to resurrect
1059 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1060 if (!tx.IsCoinBase())
1061 vResurrect.push_back(tx);
1064 // Connect longer branch
1065 vector<CTransaction> vDelete;
1066 for (int i = 0; i < vConnect.size(); i++)
1068 CBlockIndex* pindex = vConnect[i];
1070 if (!block.ReadFromDisk(pindex))
1071 return error("Reorganize() : ReadFromDisk for connect failed");
1072 if (!block.ConnectBlock(txdb, pindex))
1076 return error("Reorganize() : ConnectBlock failed");
1079 // Queue memory transactions to delete
1080 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1081 vDelete.push_back(tx);
1083 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1084 return error("Reorganize() : WriteHashBestChain failed");
1086 // Make sure it's successfully written to disk before changing memory structure
1087 if (!txdb.TxnCommit())
1088 return error("Reorganize() : TxnCommit failed");
1090 // Disconnect shorter branch
1091 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1093 pindex->pprev->pnext = NULL;
1095 // Connect longer branch
1096 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1098 pindex->pprev->pnext = pindex;
1100 // Resurrect memory transactions that were in the disconnected branch
1101 BOOST_FOREACH(CTransaction& tx, vResurrect)
1102 tx.AcceptToMemoryPool(txdb, false);
1104 // Delete redundant memory transactions that are in the connected branch
1105 BOOST_FOREACH(CTransaction& tx, vDelete)
1106 tx.RemoveFromMemoryPool();
1112 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1114 uint256 hash = GetHash();
1117 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1119 txdb.WriteHashBestChain(hash);
1120 if (!txdb.TxnCommit())
1121 return error("SetBestChain() : TxnCommit failed");
1122 pindexGenesisBlock = pindexNew;
1124 else if (hashPrevBlock == hashBestChain)
1126 // Adding to current best branch
1127 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1130 InvalidChainFound(pindexNew);
1131 return error("SetBestChain() : ConnectBlock failed");
1133 if (!txdb.TxnCommit())
1134 return error("SetBestChain() : TxnCommit failed");
1136 // Add to current best branch
1137 pindexNew->pprev->pnext = pindexNew;
1139 // Delete redundant memory transactions
1140 BOOST_FOREACH(CTransaction& tx, vtx)
1141 tx.RemoveFromMemoryPool();
1146 if (!Reorganize(txdb, pindexNew))
1149 InvalidChainFound(pindexNew);
1150 return error("SetBestChain() : Reorganize failed");
1154 // Update best block in wallet (so we can detect restored wallets)
1155 if (!IsInitialBlockDownload())
1157 const CBlockLocator locator(pindexNew);
1158 ::SetBestChain(locator);
1162 hashBestChain = hash;
1163 pindexBest = pindexNew;
1164 nBestHeight = pindexBest->nHeight;
1165 bnBestChainWork = pindexNew->bnChainWork;
1166 nTimeBestReceived = GetTime();
1167 nTransactionsUpdated++;
1168 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1174 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1176 // Check for duplicate
1177 uint256 hash = GetHash();
1178 if (mapBlockIndex.count(hash))
1179 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1181 // Construct new block index object
1182 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1184 return error("AddToBlockIndex() : new CBlockIndex failed");
1185 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1186 pindexNew->phashBlock = &((*mi).first);
1187 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1188 if (miPrev != mapBlockIndex.end())
1190 pindexNew->pprev = (*miPrev).second;
1191 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1193 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1197 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1198 if (!txdb.TxnCommit())
1202 if (pindexNew->bnChainWork > bnBestChainWork)
1203 if (!SetBestChain(txdb, pindexNew))
1208 if (pindexNew == pindexBest)
1210 // Notify UI to display prev block's coinbase if it was ours
1211 static uint256 hashPrevBestCoinBase;
1212 UpdatedTransaction(hashPrevBestCoinBase);
1213 hashPrevBestCoinBase = vtx[0].GetHash();
1223 bool CBlock::CheckBlock() const
1225 // These are checks that are independent of context
1226 // that can be verified before saving an orphan block.
1229 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1230 return error("CheckBlock() : size limits failed");
1232 // Check proof of work matches claimed amount
1233 if (!CheckProofOfWork(GetHash(), nBits))
1234 return error("CheckBlock() : proof of work failed");
1237 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1238 return error("CheckBlock() : block timestamp too far in the future");
1240 // First transaction must be coinbase, the rest must not be
1241 if (vtx.empty() || !vtx[0].IsCoinBase())
1242 return error("CheckBlock() : first tx is not coinbase");
1243 for (int i = 1; i < vtx.size(); i++)
1244 if (vtx[i].IsCoinBase())
1245 return error("CheckBlock() : more than one coinbase");
1247 // Check transactions
1248 BOOST_FOREACH(const CTransaction& tx, vtx)
1249 if (!tx.CheckTransaction())
1250 return error("CheckBlock() : CheckTransaction failed");
1252 // Check that it's not full of nonstandard transactions
1253 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1254 return error("CheckBlock() : too many nonstandard transactions");
1257 if (hashMerkleRoot != BuildMerkleTree())
1258 return error("CheckBlock() : hashMerkleRoot mismatch");
1263 bool CBlock::AcceptBlock()
1265 // Check for duplicate
1266 uint256 hash = GetHash();
1267 if (mapBlockIndex.count(hash))
1268 return error("AcceptBlock() : block already in mapBlockIndex");
1270 // Get prev block index
1271 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1272 if (mi == mapBlockIndex.end())
1273 return error("AcceptBlock() : prev block not found");
1274 CBlockIndex* pindexPrev = (*mi).second;
1275 int nHeight = pindexPrev->nHeight+1;
1277 // Check proof of work
1278 if (nBits != GetNextWorkRequired(pindexPrev))
1279 return error("AcceptBlock() : incorrect proof of work");
1281 // Check timestamp against prev
1282 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1283 return error("AcceptBlock() : block's timestamp is too early");
1285 // Check that all transactions are finalized
1286 BOOST_FOREACH(const CTransaction& tx, vtx)
1287 if (!tx.IsFinal(nHeight, GetBlockTime()))
1288 return error("AcceptBlock() : contains a non-final transaction");
1290 // Check that the block chain matches the known block chain up to a checkpoint
1292 // ppcoin: no checkpoint yet; to be created after beta
1293 if ((nHeight == -1 && hash != uint256("0x83f760b87b13d7002eaccc4a5a154aaea0f861e52b6eb481d30a344f55605c01")))
1294 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1296 // Write block to history file
1297 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1298 return error("AcceptBlock() : out of disk space");
1299 unsigned int nFile = -1;
1300 unsigned int nBlockPos = 0;
1301 if (!WriteToDisk(nFile, nBlockPos))
1302 return error("AcceptBlock() : WriteToDisk failed");
1303 if (!AddToBlockIndex(nFile, nBlockPos))
1304 return error("AcceptBlock() : AddToBlockIndex failed");
1306 // Relay inventory, but don't relay old inventory during initial block download
1307 if (hashBestChain == hash)
1308 CRITICAL_BLOCK(cs_vNodes)
1309 BOOST_FOREACH(CNode* pnode, vNodes)
1310 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 134444))
1311 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1316 bool static ProcessBlock(CNode* pfrom, CBlock* pblock)
1318 // Check for duplicate
1319 uint256 hash = pblock->GetHash();
1320 if (mapBlockIndex.count(hash))
1321 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1322 if (mapOrphanBlocks.count(hash))
1323 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1325 // Preliminary checks
1326 if (!pblock->CheckBlock())
1327 return error("ProcessBlock() : CheckBlock FAILED");
1329 // If don't already have its previous block, shunt it off to holding area until we get it
1330 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1332 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1333 CBlock* pblock2 = new CBlock(*pblock);
1334 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1335 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1337 // Ask this guy to fill in what we're missing
1339 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1344 if (!pblock->AcceptBlock())
1345 return error("ProcessBlock() : AcceptBlock FAILED");
1347 // Recursively process any orphan blocks that depended on this one
1348 vector<uint256> vWorkQueue;
1349 vWorkQueue.push_back(hash);
1350 for (int i = 0; i < vWorkQueue.size(); i++)
1352 uint256 hashPrev = vWorkQueue[i];
1353 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1354 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1357 CBlock* pblockOrphan = (*mi).second;
1358 if (pblockOrphan->AcceptBlock())
1359 vWorkQueue.push_back(pblockOrphan->GetHash());
1360 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1361 delete pblockOrphan;
1363 mapOrphanBlocksByPrev.erase(hashPrev);
1366 printf("ProcessBlock: ACCEPTED\n");
1377 template<typename Stream>
1378 bool static ScanMessageStart(Stream& s)
1380 // Scan ahead to the next pchMessageStart, which should normally be immediately
1381 // at the file pointer. Leaves file pointer at end of pchMessageStart.
1383 short prevmask = s.exceptions(0);
1384 const char* p = BEGIN(pchMessageStart);
1394 s.exceptions(prevmask);
1398 p = BEGIN(pchMessageStart);
1401 if (++p == END(pchMessageStart))
1404 s.exceptions(prevmask);
1413 s.exceptions(prevmask);
1418 bool CheckDiskSpace(uint64 nAdditionalBytes)
1420 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1422 // Check for 15MB because database could create another 10MB log file at any time
1423 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1426 string strMessage = _("Warning: Disk space is low ");
1427 strMiscWarning = strMessage;
1428 printf("*** %s\n", strMessage.c_str());
1429 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1430 CreateThread(Shutdown, NULL);
1436 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1440 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1443 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1445 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1454 static unsigned int nCurrentBlockFile = 1;
1456 FILE* AppendBlockFile(unsigned int& nFileRet)
1461 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1464 if (fseek(file, 0, SEEK_END) != 0)
1466 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1467 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1469 nFileRet = nCurrentBlockFile;
1473 nCurrentBlockFile++;
1477 bool LoadBlockIndex(bool fAllowNew)
1481 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1482 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1483 pchMessageStart[0] = 0xfa;
1484 pchMessageStart[1] = 0xbf;
1485 pchMessageStart[2] = 0xb5;
1486 pchMessageStart[3] = 0xda;
1493 if (!txdb.LoadBlockIndex())
1498 // Init with genesis block
1500 if (mapBlockIndex.empty())
1506 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1507 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1508 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1509 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1510 // vMerkleTree: 4a5e1e
1513 const char* pszTimestamp = "MarketWatch 07/Nov/2011 Gold tops $1,790 to end at over six-week high";
1515 txNew.vin.resize(1);
1516 txNew.vout.resize(1);
1517 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1518 txNew.vout[0].nValue = 50 * COIN;
1519 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1521 block.vtx.push_back(txNew);
1522 block.hashPrevBlock = 0;
1523 block.hashMerkleRoot = block.BuildMerkleTree();
1525 block.nTime = 1320807728;
1526 block.nBits = 0x1d00ffff;
1527 block.nNonce = 319190438;
1531 block.nTime = 1296688602;
1532 block.nBits = 0x1d07fff8;
1533 block.nNonce = 384568319;
1537 printf("%s\n", block.GetHash().ToString().c_str());
1538 printf("%s\n", hashGenesisBlock.ToString().c_str());
1539 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1540 assert(block.hashMerkleRoot == uint256("0x4b9b3b5ebff8f552ba5c29e7eaa571ff16b63f50f6425865b280b3a7f670a2c4"));
1542 assert(block.GetHash() == hashGenesisBlock);
1544 // Start new block file
1546 unsigned int nBlockPos;
1547 if (!block.WriteToDisk(nFile, nBlockPos))
1548 return error("LoadBlockIndex() : writing genesis block to disk failed");
1549 if (!block.AddToBlockIndex(nFile, nBlockPos))
1550 return error("LoadBlockIndex() : genesis block not accepted");
1558 void PrintBlockTree()
1560 // precompute tree structure
1561 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1562 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1564 CBlockIndex* pindex = (*mi).second;
1565 mapNext[pindex->pprev].push_back(pindex);
1567 //while (rand() % 3 == 0)
1568 // mapNext[pindex->pprev].push_back(pindex);
1571 vector<pair<int, CBlockIndex*> > vStack;
1572 vStack.push_back(make_pair(0, pindexGenesisBlock));
1575 while (!vStack.empty())
1577 int nCol = vStack.back().first;
1578 CBlockIndex* pindex = vStack.back().second;
1581 // print split or gap
1582 if (nCol > nPrevCol)
1584 for (int i = 0; i < nCol-1; i++)
1588 else if (nCol < nPrevCol)
1590 for (int i = 0; i < nCol; i++)
1597 for (int i = 0; i < nCol; i++)
1602 block.ReadFromDisk(pindex);
1603 printf("%d (%u,%u) %s %s tx %d",
1607 block.GetHash().ToString().substr(0,20).c_str(),
1608 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1611 PrintWallets(block);
1613 // put the main timechain first
1614 vector<CBlockIndex*>& vNext = mapNext[pindex];
1615 for (int i = 0; i < vNext.size(); i++)
1617 if (vNext[i]->pnext)
1619 swap(vNext[0], vNext[i]);
1625 for (int i = 0; i < vNext.size(); i++)
1626 vStack.push_back(make_pair(nCol+i, vNext[i]));
1639 //////////////////////////////////////////////////////////////////////////////
1644 map<uint256, CAlert> mapAlerts;
1645 CCriticalSection cs_mapAlerts;
1647 string GetWarnings(string strFor)
1650 string strStatusBar;
1652 if (GetBoolArg("-testsafemode"))
1655 // Misc warnings like out of disk space and clock is wrong
1656 if (strMiscWarning != "")
1659 strStatusBar = strMiscWarning;
1662 // Longer invalid proof-of-work chain
1663 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1666 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1670 CRITICAL_BLOCK(cs_mapAlerts)
1672 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1674 const CAlert& alert = item.second;
1675 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1677 nPriority = alert.nPriority;
1678 strStatusBar = alert.strStatusBar;
1683 if (strFor == "statusbar")
1684 return strStatusBar;
1685 else if (strFor == "rpc")
1687 assert(("GetWarnings() : invalid parameter", false));
1691 bool CAlert::ProcessAlert()
1693 if (!CheckSignature())
1698 CRITICAL_BLOCK(cs_mapAlerts)
1700 // Cancel previous alerts
1701 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1703 const CAlert& alert = (*mi).second;
1706 printf("cancelling alert %d\n", alert.nID);
1707 mapAlerts.erase(mi++);
1709 else if (!alert.IsInEffect())
1711 printf("expiring alert %d\n", alert.nID);
1712 mapAlerts.erase(mi++);
1718 // Check if this alert has been cancelled
1719 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1721 const CAlert& alert = item.second;
1722 if (alert.Cancels(*this))
1724 printf("alert already cancelled by %d\n", alert.nID);
1730 mapAlerts.insert(make_pair(GetHash(), *this));
1733 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1745 //////////////////////////////////////////////////////////////////////////////
1751 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1755 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1756 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1758 // Don't know what it is, just say we already got one
1765 // The message start string is designed to be unlikely to occur in normal data.
1766 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1767 // a large 4-byte int at any alignment.
1768 char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1771 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1773 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1774 RandAddSeedPerfmon();
1776 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1777 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1778 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1780 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1788 if (strCommand == "version")
1790 // Each connection can only send one version message
1791 if (pfrom->nVersion != 0)
1798 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1799 if (pfrom->nVersion == 10300)
1800 pfrom->nVersion = 300;
1801 if (pfrom->nVersion >= 106 && !vRecv.empty())
1802 vRecv >> addrFrom >> nNonce;
1803 if (pfrom->nVersion >= 106 && !vRecv.empty())
1804 vRecv >> pfrom->strSubVer;
1805 if (pfrom->nVersion >= 209 && !vRecv.empty())
1806 vRecv >> pfrom->nStartingHeight;
1808 if (pfrom->nVersion == 0)
1811 // Disconnect if we connected to ourself
1812 if (nNonce == nLocalHostNonce && nNonce > 1)
1814 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
1815 pfrom->fDisconnect = true;
1819 // Be shy and don't send version until we hear
1820 if (pfrom->fInbound)
1821 pfrom->PushVersion();
1823 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
1825 AddTimeData(pfrom->addr.ip, nTime);
1828 if (pfrom->nVersion >= 209)
1829 pfrom->PushMessage("verack");
1830 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
1831 if (pfrom->nVersion < 209)
1832 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1834 if (!pfrom->fInbound)
1836 // Advertise our address
1837 if (addrLocalHost.IsRoutable() && !fUseProxy)
1839 CAddress addr(addrLocalHost);
1840 addr.nTime = GetAdjustedTime();
1841 pfrom->PushAddress(addr);
1844 // Get recent addresses
1845 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
1847 pfrom->PushMessage("getaddr");
1848 pfrom->fGetAddr = true;
1852 // Ask the first connected node for block updates
1853 static int nAskedForBlocks;
1854 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
1857 pfrom->PushGetBlocks(pindexBest, uint256(0));
1861 CRITICAL_BLOCK(cs_mapAlerts)
1862 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1863 item.second.RelayTo(pfrom);
1865 pfrom->fSuccessfullyConnected = true;
1867 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
1871 else if (pfrom->nVersion == 0)
1873 // Must have a version message before anything else
1878 else if (strCommand == "verack")
1880 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
1884 else if (strCommand == "addr")
1886 vector<CAddress> vAddr;
1889 // Don't want addr from older versions unless seeding
1890 if (pfrom->nVersion < 209)
1892 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
1894 if (vAddr.size() > 1000)
1895 return error("message addr size() = %d", vAddr.size());
1897 // Store the new addresses
1898 int64 nNow = GetAdjustedTime();
1899 int64 nSince = nNow - 10 * 60;
1900 BOOST_FOREACH(CAddress& addr, vAddr)
1904 // ignore IPv6 for now, since it isn't implemented anyway
1907 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
1908 addr.nTime = nNow - 5 * 24 * 60 * 60;
1909 AddAddress(addr, 2 * 60 * 60);
1910 pfrom->AddAddressKnown(addr);
1911 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
1913 // Relay to a limited number of other nodes
1914 CRITICAL_BLOCK(cs_vNodes)
1916 // Use deterministic randomness to send to the same nodes for 24 hours
1917 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
1918 static uint256 hashSalt;
1920 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
1921 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
1922 hashRand = Hash(BEGIN(hashRand), END(hashRand));
1923 multimap<uint256, CNode*> mapMix;
1924 BOOST_FOREACH(CNode* pnode, vNodes)
1926 if (pnode->nVersion < 31402)
1928 unsigned int nPointer;
1929 memcpy(&nPointer, &pnode, sizeof(nPointer));
1930 uint256 hashKey = hashRand ^ nPointer;
1931 hashKey = Hash(BEGIN(hashKey), END(hashKey));
1932 mapMix.insert(make_pair(hashKey, pnode));
1934 int nRelayNodes = 2;
1935 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
1936 ((*mi).second)->PushAddress(addr);
1940 if (vAddr.size() < 1000)
1941 pfrom->fGetAddr = false;
1945 else if (strCommand == "inv")
1949 if (vInv.size() > 50000)
1950 return error("message inv size() = %d", vInv.size());
1953 BOOST_FOREACH(const CInv& inv, vInv)
1957 pfrom->AddInventoryKnown(inv);
1959 bool fAlreadyHave = AlreadyHave(txdb, inv);
1960 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
1964 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
1965 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
1967 // Track requests for our stuff
1968 Inventory(inv.hash);
1973 else if (strCommand == "getdata")
1977 if (vInv.size() > 50000)
1978 return error("message getdata size() = %d", vInv.size());
1980 BOOST_FOREACH(const CInv& inv, vInv)
1984 printf("received getdata for: %s\n", inv.ToString().c_str());
1986 if (inv.type == MSG_BLOCK)
1988 // Send block from disk
1989 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
1990 if (mi != mapBlockIndex.end())
1993 block.ReadFromDisk((*mi).second);
1994 pfrom->PushMessage("block", block);
1996 // Trigger them to send a getblocks request for the next batch of inventory
1997 if (inv.hash == pfrom->hashContinue)
1999 // Bypass PushInventory, this must send even if redundant,
2000 // and we want it right after the last block so they don't
2001 // wait for other stuff first.
2003 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2004 pfrom->PushMessage("inv", vInv);
2005 pfrom->hashContinue = 0;
2009 else if (inv.IsKnownType())
2011 // Send stream from relay memory
2012 CRITICAL_BLOCK(cs_mapRelay)
2014 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2015 if (mi != mapRelay.end())
2016 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2020 // Track requests for our stuff
2021 Inventory(inv.hash);
2026 else if (strCommand == "getblocks")
2028 CBlockLocator locator;
2030 vRecv >> locator >> hashStop;
2032 // Find the last block the caller has in the main chain
2033 CBlockIndex* pindex = locator.GetBlockIndex();
2035 // Send the rest of the chain
2037 pindex = pindex->pnext;
2038 int nLimit = 500 + locator.GetDistanceBack();
2039 unsigned int nBytes = 0;
2040 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2041 for (; pindex; pindex = pindex->pnext)
2043 if (pindex->GetBlockHash() == hashStop)
2045 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2048 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2050 block.ReadFromDisk(pindex, true);
2051 nBytes += block.GetSerializeSize(SER_NETWORK);
2052 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2054 // When this block is requested, we'll send an inv that'll make them
2055 // getblocks the next batch of inventory.
2056 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2057 pfrom->hashContinue = pindex->GetBlockHash();
2064 else if (strCommand == "getheaders")
2066 CBlockLocator locator;
2068 vRecv >> locator >> hashStop;
2070 CBlockIndex* pindex = NULL;
2071 if (locator.IsNull())
2073 // If locator is null, return the hashStop block
2074 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2075 if (mi == mapBlockIndex.end())
2077 pindex = (*mi).second;
2081 // Find the last block the caller has in the main chain
2082 pindex = locator.GetBlockIndex();
2084 pindex = pindex->pnext;
2087 vector<CBlock> vHeaders;
2088 int nLimit = 2000 + locator.GetDistanceBack();
2089 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2090 for (; pindex; pindex = pindex->pnext)
2092 vHeaders.push_back(pindex->GetBlockHeader());
2093 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2096 pfrom->PushMessage("headers", vHeaders);
2100 else if (strCommand == "tx")
2102 vector<uint256> vWorkQueue;
2103 CDataStream vMsg(vRecv);
2107 CInv inv(MSG_TX, tx.GetHash());
2108 pfrom->AddInventoryKnown(inv);
2110 bool fMissingInputs = false;
2111 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2113 SyncWithWallets(tx, NULL, true);
2114 RelayMessage(inv, vMsg);
2115 mapAlreadyAskedFor.erase(inv);
2116 vWorkQueue.push_back(inv.hash);
2118 // Recursively process any orphan transactions that depended on this one
2119 for (int i = 0; i < vWorkQueue.size(); i++)
2121 uint256 hashPrev = vWorkQueue[i];
2122 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2123 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2126 const CDataStream& vMsg = *((*mi).second);
2128 CDataStream(vMsg) >> tx;
2129 CInv inv(MSG_TX, tx.GetHash());
2131 if (tx.AcceptToMemoryPool(true))
2133 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2134 SyncWithWallets(tx, NULL, true);
2135 RelayMessage(inv, vMsg);
2136 mapAlreadyAskedFor.erase(inv);
2137 vWorkQueue.push_back(inv.hash);
2142 BOOST_FOREACH(uint256 hash, vWorkQueue)
2143 EraseOrphanTx(hash);
2145 else if (fMissingInputs)
2147 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2153 else if (strCommand == "block")
2158 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2161 CInv inv(MSG_BLOCK, block.GetHash());
2162 pfrom->AddInventoryKnown(inv);
2164 if (ProcessBlock(pfrom, &block))
2165 mapAlreadyAskedFor.erase(inv);
2169 else if (strCommand == "getaddr")
2171 // Nodes rebroadcast an addr every 24 hours
2172 pfrom->vAddrToSend.clear();
2173 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2174 CRITICAL_BLOCK(cs_mapAddresses)
2176 unsigned int nCount = 0;
2177 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2179 const CAddress& addr = item.second;
2180 if (addr.nTime > nSince)
2183 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2185 const CAddress& addr = item.second;
2186 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2187 pfrom->PushAddress(addr);
2193 else if (strCommand == "checkorder")
2198 if (!GetBoolArg("-allowreceivebyip"))
2200 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2207 /// we have a chance to check the order here
2209 // Keep giving the same key to the same ip until they use it
2210 if (!mapReuseKey.count(pfrom->addr.ip))
2211 mapReuseKey[pfrom->addr.ip] = pwalletMain->GetKeyFromKeyPool();
2213 // Send back approval of order and pubkey to use
2214 CScript scriptPubKey;
2215 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2216 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2220 else if (strCommand == "reply")
2225 CRequestTracker tracker;
2226 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2228 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2229 if (mi != pfrom->mapRequests.end())
2231 tracker = (*mi).second;
2232 pfrom->mapRequests.erase(mi);
2235 if (!tracker.IsNull())
2236 tracker.fn(tracker.param1, vRecv);
2240 else if (strCommand == "ping")
2245 else if (strCommand == "alert")
2250 if (alert.ProcessAlert())
2253 pfrom->setKnown.insert(alert.GetHash());
2254 CRITICAL_BLOCK(cs_vNodes)
2255 BOOST_FOREACH(CNode* pnode, vNodes)
2256 alert.RelayTo(pnode);
2263 // Ignore unknown commands for extensibility
2267 // Update the last seen time for this node's address
2268 if (pfrom->fNetworkNode)
2269 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2270 AddressCurrentlyConnected(pfrom->addr);
2276 bool ProcessMessages(CNode* pfrom)
2278 CDataStream& vRecv = pfrom->vRecv;
2282 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2286 // (4) message start
2295 // Scan for message start
2296 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2297 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2298 if (vRecv.end() - pstart < nHeaderSize)
2300 if (vRecv.size() > nHeaderSize)
2302 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2303 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2307 if (pstart - vRecv.begin() > 0)
2308 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2309 vRecv.erase(vRecv.begin(), pstart);
2312 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2317 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2320 string strCommand = hdr.GetCommand();
2323 unsigned int nMessageSize = hdr.nMessageSize;
2324 if (nMessageSize > MAX_SIZE)
2326 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2329 if (nMessageSize > vRecv.size())
2331 // Rewind and wait for rest of message
2332 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2337 if (vRecv.GetVersion() >= 209)
2339 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2340 unsigned int nChecksum = 0;
2341 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2342 if (nChecksum != hdr.nChecksum)
2344 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2345 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2350 // Copy message to its own buffer
2351 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2352 vRecv.ignore(nMessageSize);
2358 CRITICAL_BLOCK(cs_main)
2359 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2363 catch (std::ios_base::failure& e)
2365 if (strstr(e.what(), "end of data"))
2367 // Allow exceptions from underlength message on vRecv
2368 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());
2370 else if (strstr(e.what(), "size too large"))
2372 // Allow exceptions from overlong size
2373 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2377 PrintExceptionContinue(&e, "ProcessMessage()");
2380 catch (std::exception& e) {
2381 PrintExceptionContinue(&e, "ProcessMessage()");
2383 PrintExceptionContinue(NULL, "ProcessMessage()");
2387 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2395 bool SendMessages(CNode* pto, bool fSendTrickle)
2397 CRITICAL_BLOCK(cs_main)
2399 // Don't send anything until we get their version message
2400 if (pto->nVersion == 0)
2404 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2405 pto->PushMessage("ping");
2407 // Resend wallet transactions that haven't gotten in a block yet
2408 ResendWalletTransactions();
2410 // Address refresh broadcast
2411 static int64 nLastRebroadcast;
2412 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2414 nLastRebroadcast = GetTime();
2415 CRITICAL_BLOCK(cs_vNodes)
2417 BOOST_FOREACH(CNode* pnode, vNodes)
2419 // Periodically clear setAddrKnown to allow refresh broadcasts
2420 pnode->setAddrKnown.clear();
2422 // Rebroadcast our address
2423 if (addrLocalHost.IsRoutable() && !fUseProxy)
2425 CAddress addr(addrLocalHost);
2426 addr.nTime = GetAdjustedTime();
2427 pnode->PushAddress(addr);
2433 // Clear out old addresses periodically so it's not too much work at once
2434 static int64 nLastClear;
2435 if (nLastClear == 0)
2436 nLastClear = GetTime();
2437 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2439 nLastClear = GetTime();
2440 CRITICAL_BLOCK(cs_mapAddresses)
2443 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2444 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2445 mi != mapAddresses.end();)
2447 const CAddress& addr = (*mi).second;
2448 if (addr.nTime < nSince)
2450 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2452 addrdb.EraseAddress(addr);
2453 mapAddresses.erase(mi++);
2467 vector<CAddress> vAddr;
2468 vAddr.reserve(pto->vAddrToSend.size());
2469 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2471 // returns true if wasn't already contained in the set
2472 if (pto->setAddrKnown.insert(addr).second)
2474 vAddr.push_back(addr);
2475 // receiver rejects addr messages larger than 1000
2476 if (vAddr.size() >= 1000)
2478 pto->PushMessage("addr", vAddr);
2483 pto->vAddrToSend.clear();
2485 pto->PushMessage("addr", vAddr);
2490 // Message: inventory
2493 vector<CInv> vInvWait;
2494 CRITICAL_BLOCK(pto->cs_inventory)
2496 vInv.reserve(pto->vInventoryToSend.size());
2497 vInvWait.reserve(pto->vInventoryToSend.size());
2498 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2500 if (pto->setInventoryKnown.count(inv))
2503 // trickle out tx inv to protect privacy
2504 if (inv.type == MSG_TX && !fSendTrickle)
2506 // 1/4 of tx invs blast to all immediately
2507 static uint256 hashSalt;
2509 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2510 uint256 hashRand = inv.hash ^ hashSalt;
2511 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2512 bool fTrickleWait = ((hashRand & 3) != 0);
2514 // always trickle our own transactions
2518 if (GetTransaction(inv.hash, wtx))
2520 fTrickleWait = true;
2525 vInvWait.push_back(inv);
2530 // returns true if wasn't already contained in the set
2531 if (pto->setInventoryKnown.insert(inv).second)
2533 vInv.push_back(inv);
2534 if (vInv.size() >= 1000)
2536 pto->PushMessage("inv", vInv);
2541 pto->vInventoryToSend = vInvWait;
2544 pto->PushMessage("inv", vInv);
2550 vector<CInv> vGetData;
2551 int64 nNow = GetTime() * 1000000;
2553 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2555 const CInv& inv = (*pto->mapAskFor.begin()).second;
2556 if (!AlreadyHave(txdb, inv))
2558 printf("sending getdata: %s\n", inv.ToString().c_str());
2559 vGetData.push_back(inv);
2560 if (vGetData.size() >= 1000)
2562 pto->PushMessage("getdata", vGetData);
2566 pto->mapAskFor.erase(pto->mapAskFor.begin());
2568 if (!vGetData.empty())
2569 pto->PushMessage("getdata", vGetData);
2588 //////////////////////////////////////////////////////////////////////////////
2593 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2595 unsigned char* pdata = (unsigned char*)pbuffer;
2596 unsigned int blocks = 1 + ((len + 8) / 64);
2597 unsigned char* pend = pdata + 64 * blocks;
2598 memset(pdata + len, 0, 64 * blocks - len);
2600 unsigned int bits = len * 8;
2601 pend[-1] = (bits >> 0) & 0xff;
2602 pend[-2] = (bits >> 8) & 0xff;
2603 pend[-3] = (bits >> 16) & 0xff;
2604 pend[-4] = (bits >> 24) & 0xff;
2608 using CryptoPP::ByteReverse;
2610 static const unsigned int pSHA256InitState[8] =
2611 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2613 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2615 memcpy(pstate, pinit, 32);
2616 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
2620 // ScanHash scans nonces looking for a hash with at least some zero bits.
2621 // It operates on big endian data. Caller does the byte reversing.
2622 // All input buffers are 16-byte aligned. nNonce is usually preserved
2623 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2624 // the block is rebuilt and nNonce starts over at zero.
2626 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2628 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2632 // Hash pdata using pmidstate as the starting state into
2633 // preformatted buffer phash1, then hash phash1 into phash
2635 SHA256Transform(phash1, pdata, pmidstate);
2636 SHA256Transform(phash, phash1, pSHA256InitState);
2638 // Return the nonce if the hash has at least some zero bits,
2639 // caller will check if it has enough to reach the target
2640 if (((unsigned short*)phash)[14] == 0)
2643 // If nothing found after trying for a while, return -1
2644 if ((nNonce & 0xffff) == 0)
2646 nHashesDone = 0xffff+1;
2657 set<uint256> setDependsOn;
2660 COrphan(CTransaction* ptxIn)
2668 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2669 BOOST_FOREACH(uint256 hash, setDependsOn)
2670 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2675 CBlock* CreateNewBlock(CReserveKey& reservekey)
2677 CBlockIndex* pindexPrev = pindexBest;
2680 auto_ptr<CBlock> pblock(new CBlock());
2684 // Create coinbase tx
2686 txNew.vin.resize(1);
2687 txNew.vin[0].prevout.SetNull();
2688 txNew.vout.resize(1);
2689 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2691 // Add our coinbase tx as first transaction
2692 pblock->vtx.push_back(txNew);
2694 // Collect memory pool transactions into the block
2696 CRITICAL_BLOCK(cs_main)
2697 CRITICAL_BLOCK(cs_mapTransactions)
2701 // Priority order to process transactions
2702 list<COrphan> vOrphan; // list memory doesn't move
2703 map<uint256, vector<COrphan*> > mapDependers;
2704 multimap<double, CTransaction*> mapPriority;
2705 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2707 CTransaction& tx = (*mi).second;
2708 if (tx.IsCoinBase() || !tx.IsFinal())
2711 COrphan* porphan = NULL;
2712 double dPriority = 0;
2713 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2715 // Read prev transaction
2716 CTransaction txPrev;
2718 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2720 // Has to wait for dependencies
2723 // Use list for automatic deletion
2724 vOrphan.push_back(COrphan(&tx));
2725 porphan = &vOrphan.back();
2727 mapDependers[txin.prevout.hash].push_back(porphan);
2728 porphan->setDependsOn.insert(txin.prevout.hash);
2731 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2733 // Read block header
2734 int nConf = txindex.GetDepthInMainChain();
2736 dPriority += (double)nValueIn * nConf;
2738 if (fDebug && GetBoolArg("-printpriority"))
2739 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2742 // Priority is sum(valuein * age) / txsize
2743 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2746 porphan->dPriority = dPriority;
2748 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2750 if (fDebug && GetBoolArg("-printpriority"))
2752 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2759 // Collect transactions into block
2760 map<uint256, CTxIndex> mapTestPool;
2761 uint64 nBlockSize = 1000;
2762 int nBlockSigOps = 100;
2763 while (!mapPriority.empty())
2765 // Take highest priority transaction off priority queue
2766 double dPriority = -(*mapPriority.begin()).first;
2767 CTransaction& tx = *(*mapPriority.begin()).second;
2768 mapPriority.erase(mapPriority.begin());
2771 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2772 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
2774 int nTxSigOps = tx.GetSigOpCount();
2775 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
2778 // Transaction fee required depends on block size
2779 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
2780 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true);
2782 // Connecting shouldn't fail due to dependency on other memory pool transactions
2783 // because we're already processing them in order of dependency
2784 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
2785 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
2787 swap(mapTestPool, mapTestPoolTmp);
2790 pblock->vtx.push_back(tx);
2791 nBlockSize += nTxSize;
2792 nBlockSigOps += nTxSigOps;
2794 // Add transactions that depend on this one to the priority queue
2795 uint256 hash = tx.GetHash();
2796 if (mapDependers.count(hash))
2798 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
2800 if (!porphan->setDependsOn.empty())
2802 porphan->setDependsOn.erase(hash);
2803 if (porphan->setDependsOn.empty())
2804 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
2810 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
2813 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
2814 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2815 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2816 pblock->nBits = GetNextWorkRequired(pindexPrev);
2819 return pblock.release();
2823 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
2825 // Update nExtraNonce
2826 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
2827 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
2832 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
2833 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
2837 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
2840 // Prebuild hash buffers
2847 uint256 hashPrevBlock;
2848 uint256 hashMerkleRoot;
2851 unsigned int nNonce;
2854 unsigned char pchPadding0[64];
2856 unsigned char pchPadding1[64];
2859 memset(&tmp, 0, sizeof(tmp));
2861 tmp.block.nVersion = pblock->nVersion;
2862 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
2863 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
2864 tmp.block.nTime = pblock->nTime;
2865 tmp.block.nBits = pblock->nBits;
2866 tmp.block.nNonce = pblock->nNonce;
2868 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
2869 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
2871 // Byte swap all the input buffer
2872 for (int i = 0; i < sizeof(tmp)/4; i++)
2873 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
2875 // Precalc the first half of the first hash, which stays constant
2876 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
2878 memcpy(pdata, &tmp.block, 128);
2879 memcpy(phash1, &tmp.hash1, 64);
2883 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
2885 uint256 hash = pblock->GetHash();
2886 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2888 if (hash > hashTarget)
2892 printf("BitcoinMiner:\n");
2893 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
2895 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
2896 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
2899 CRITICAL_BLOCK(cs_main)
2901 if (pblock->hashPrevBlock != hashBestChain)
2902 return error("BitcoinMiner : generated block is stale");
2904 // Remove key from key pool
2905 reservekey.KeepKey();
2907 // Track how many getdata requests this block gets
2908 CRITICAL_BLOCK(wallet.cs_mapRequestCount)
2909 wallet.mapRequestCount[pblock->GetHash()] = 0;
2911 // Process this block the same as if we had received it from another node
2912 if (!ProcessBlock(NULL, pblock))
2913 return error("BitcoinMiner : ProcessBlock, block not accepted");
2920 void static ThreadBitcoinMiner(void* parg);
2922 void static BitcoinMiner(CWallet *pwallet)
2924 printf("BitcoinMiner started\n");
2925 SetThreadPriority(THREAD_PRIORITY_LOWEST);
2927 // Each thread has its own key and counter
2928 CReserveKey reservekey(pwallet);
2929 unsigned int nExtraNonce = 0;
2930 int64 nPrevTime = 0;
2932 while (fGenerateBitcoins)
2934 if (AffinityBugWorkaround(ThreadBitcoinMiner))
2938 while (vNodes.empty() || IsInitialBlockDownload())
2943 if (!fGenerateBitcoins)
2951 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
2952 CBlockIndex* pindexPrev = pindexBest;
2954 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
2957 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
2959 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
2963 // Prebuild hash buffers
2965 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
2966 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
2967 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
2969 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
2971 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
2972 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
2978 int64 nStart = GetTime();
2979 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
2981 uint256& hash = *alignup<16>(hashbuf);
2984 unsigned int nHashesDone = 0;
2985 unsigned int nNonceFound;
2988 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
2989 (char*)&hash, nHashesDone);
2991 // Check if something found
2992 if (nNonceFound != -1)
2994 for (int i = 0; i < sizeof(hash)/4; i++)
2995 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
2997 if (hash <= hashTarget)
3000 pblock->nNonce = ByteReverse(nNonceFound);
3001 assert(hash == pblock->GetHash());
3003 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3004 CheckWork(pblock.get(), *pwalletMain, reservekey);
3005 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3011 static int64 nHashCounter;
3012 if (nHPSTimerStart == 0)
3014 nHPSTimerStart = GetTimeMillis();
3018 nHashCounter += nHashesDone;
3019 if (GetTimeMillis() - nHPSTimerStart > 4000)
3021 static CCriticalSection cs;
3024 if (GetTimeMillis() - nHPSTimerStart > 4000)
3026 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3027 nHPSTimerStart = GetTimeMillis();
3029 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3030 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3031 static int64 nLogTime;
3032 if (GetTime() - nLogTime > 30 * 60)
3034 nLogTime = GetTime();
3035 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3036 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3042 // Check for stop or if block needs to be rebuilt
3045 if (!fGenerateBitcoins)
3047 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3051 if (nBlockNonce >= 0xffff0000)
3053 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3055 if (pindexPrev != pindexBest)
3058 // Update nTime every few seconds
3059 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3060 nBlockTime = ByteReverse(pblock->nTime);
3065 void static ThreadBitcoinMiner(void* parg)
3067 CWallet* pwallet = (CWallet*)parg;
3070 vnThreadsRunning[3]++;
3071 BitcoinMiner(pwallet);
3072 vnThreadsRunning[3]--;
3074 catch (std::exception& e) {
3075 vnThreadsRunning[3]--;
3076 PrintException(&e, "ThreadBitcoinMiner()");
3078 vnThreadsRunning[3]--;
3079 PrintException(NULL, "ThreadBitcoinMiner()");
3081 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3083 if (vnThreadsRunning[3] == 0)
3085 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3089 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3091 if (fGenerateBitcoins != fGenerate)
3093 fGenerateBitcoins = fGenerate;
3094 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3097 if (fGenerateBitcoins)
3099 int nProcessors = boost::thread::hardware_concurrency();
3100 printf("%d processors\n", nProcessors);
3101 if (nProcessors < 1)
3103 if (fLimitProcessors && nProcessors > nLimitProcessors)
3104 nProcessors = nLimitProcessors;
3105 int nAddThreads = nProcessors - vnThreadsRunning[3];
3106 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3107 for (int i = 0; i < nAddThreads; i++)
3109 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3110 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");