1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
26 class CRequestTracker;
30 static const int CLIENT_VERSION = 59900;
31 static const bool VERSION_IS_BETA = true;
32 extern const std::string CLIENT_NAME;
34 static const unsigned int MAX_BLOCK_SIZE = 1000000;
35 static const unsigned int MAX_BLOCK_SIZE_GEN = MAX_BLOCK_SIZE/2;
36 static const int MAX_BLOCK_SIGOPS = MAX_BLOCK_SIZE/50;
37 static const int64 COIN = 100000000;
38 static const int64 CENT = 1000000;
39 static const int64 MIN_TX_FEE = 50000;
40 static const int64 MIN_RELAY_TX_FEE = 10000;
41 static const int64 MAX_MONEY = 21000000 * COIN;
42 inline bool MoneyRange(int64 nValue) { return (nValue >= 0 && nValue <= MAX_MONEY); }
43 static const int COINBASE_MATURITY = 100;
44 // Threshold for nLockTime: below this value it is interpreted as block number, otherwise as UNIX timestamp.
45 static const int LOCKTIME_THRESHOLD = 500000000; // Tue Nov 5 00:53:20 1985 UTC
47 static const int fHaveUPnP = true;
49 static const int fHaveUPnP = false;
57 extern CCriticalSection cs_main;
58 extern std::map<uint256, CBlockIndex*> mapBlockIndex;
59 extern uint256 hashGenesisBlock;
60 extern CBlockIndex* pindexGenesisBlock;
61 extern int nBestHeight;
62 extern CBigNum bnBestChainWork;
63 extern CBigNum bnBestInvalidWork;
64 extern uint256 hashBestChain;
65 extern CBlockIndex* pindexBest;
66 extern unsigned int nTransactionsUpdated;
67 extern double dHashesPerSec;
68 extern int64 nHPSTimerStart;
69 extern int64 nTimeBestReceived;
70 extern CCriticalSection cs_setpwalletRegistered;
71 extern std::set<CWallet*> setpwalletRegistered;
74 extern int fGenerateBitcoins;
75 extern int64 nTransactionFee;
76 extern int fLimitProcessors;
77 extern int nLimitProcessors;
78 extern int fMinimizeToTray;
79 extern int fMinimizeOnClose;
90 void RegisterWallet(CWallet* pwalletIn);
91 void UnregisterWallet(CWallet* pwalletIn);
92 bool ProcessBlock(CNode* pfrom, CBlock* pblock);
93 bool CheckDiskSpace(uint64 nAdditionalBytes=0);
94 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode="rb");
95 FILE* AppendBlockFile(unsigned int& nFileRet);
96 bool LoadBlockIndex(bool fAllowNew=true);
97 void PrintBlockTree();
98 bool ProcessMessages(CNode* pfrom);
99 bool SendMessages(CNode* pto, bool fSendTrickle);
100 void GenerateBitcoins(bool fGenerate, CWallet* pwallet);
101 CBlock* CreateNewBlock(CReserveKey& reservekey);
102 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce);
103 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1);
104 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey);
105 bool CheckProofOfWork(uint256 hash, unsigned int nBits);
106 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime);
107 int GetNumBlocksOfPeers();
108 bool IsInitialBlockDownload();
109 std::string GetWarnings(std::string strFor);
122 bool GetWalletFile(CWallet* pwallet, std::string &strWalletFileOut);
125 bool WriteSetting(const std::string& strKey, const T& value)
128 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 std::string strWalletFile;
131 if (!GetWalletFile(pwallet, strWalletFile))
133 fOk |= CWalletDB(strWalletFile).WriteSetting(strKey, value);
143 unsigned int nBlockPos;
151 CDiskTxPos(unsigned int nFileIn, unsigned int nBlockPosIn, unsigned int nTxPosIn)
154 nBlockPos = nBlockPosIn;
158 IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
159 void SetNull() { nFile = -1; nBlockPos = 0; nTxPos = 0; }
160 bool IsNull() const { return (nFile == -1); }
162 friend bool operator==(const CDiskTxPos& a, const CDiskTxPos& b)
164 return (a.nFile == b.nFile &&
165 a.nBlockPos == b.nBlockPos &&
166 a.nTxPos == b.nTxPos);
169 friend bool operator!=(const CDiskTxPos& a, const CDiskTxPos& b)
174 std::string ToString() const
177 return strprintf("null");
179 return strprintf("(nFile=%d, nBlockPos=%d, nTxPos=%d)", nFile, nBlockPos, nTxPos);
184 printf("%s", ToString().c_str());
197 CInPoint() { SetNull(); }
198 CInPoint(CTransaction* ptxIn, unsigned int nIn) { ptx = ptxIn; n = nIn; }
199 void SetNull() { ptx = NULL; n = -1; }
200 bool IsNull() const { return (ptx == NULL && n == -1); }
212 COutPoint() { SetNull(); }
213 COutPoint(uint256 hashIn, unsigned int nIn) { hash = hashIn; n = nIn; }
214 IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
215 void SetNull() { hash = 0; n = -1; }
216 bool IsNull() const { return (hash == 0 && n == -1); }
218 friend bool operator<(const COutPoint& a, const COutPoint& b)
220 return (a.hash < b.hash || (a.hash == b.hash && a.n < b.n));
223 friend bool operator==(const COutPoint& a, const COutPoint& b)
225 return (a.hash == b.hash && a.n == b.n);
228 friend bool operator!=(const COutPoint& a, const COutPoint& b)
233 std::string ToString() const
235 return strprintf("COutPoint(%s, %d)", hash.ToString().substr(0,10).c_str(), n);
240 printf("%s\n", ToString().c_str());
248 // An input of a transaction. It contains the location of the previous
249 // transaction's output that it claims and a signature that matches the
250 // output's public key.
257 unsigned int nSequence;
261 nSequence = UINT_MAX;
264 explicit CTxIn(COutPoint prevoutIn, CScript scriptSigIn=CScript(), unsigned int nSequenceIn=UINT_MAX)
267 scriptSig = scriptSigIn;
268 nSequence = nSequenceIn;
271 CTxIn(uint256 hashPrevTx, unsigned int nOut, CScript scriptSigIn=CScript(), unsigned int nSequenceIn=UINT_MAX)
273 prevout = COutPoint(hashPrevTx, nOut);
274 scriptSig = scriptSigIn;
275 nSequence = nSequenceIn;
281 READWRITE(scriptSig);
282 READWRITE(nSequence);
287 return (nSequence == UINT_MAX);
290 friend bool operator==(const CTxIn& a, const CTxIn& b)
292 return (a.prevout == b.prevout &&
293 a.scriptSig == b.scriptSig &&
294 a.nSequence == b.nSequence);
297 friend bool operator!=(const CTxIn& a, const CTxIn& b)
302 std::string ToString() const
305 str += strprintf("CTxIn(");
306 str += prevout.ToString();
307 if (prevout.IsNull())
308 str += strprintf(", coinbase %s", HexStr(scriptSig).c_str());
310 str += strprintf(", scriptSig=%s", scriptSig.ToString().substr(0,24).c_str());
311 if (nSequence != UINT_MAX)
312 str += strprintf(", nSequence=%u", nSequence);
319 printf("%s\n", ToString().c_str());
327 // An output of a transaction. It contains the public key that the next input
328 // must be able to sign with to claim it.
334 CScript scriptPubKey;
341 CTxOut(int64 nValueIn, CScript scriptPubKeyIn)
344 scriptPubKey = scriptPubKeyIn;
350 READWRITE(scriptPubKey);
356 scriptPubKey.clear();
361 return (nValue == -1);
364 uint256 GetHash() const
366 return SerializeHash(*this);
369 friend bool operator==(const CTxOut& a, const CTxOut& b)
371 return (a.nValue == b.nValue &&
372 a.scriptPubKey == b.scriptPubKey);
375 friend bool operator!=(const CTxOut& a, const CTxOut& b)
380 std::string ToString() const
382 if (scriptPubKey.size() < 6)
383 return "CTxOut(error)";
384 return strprintf("CTxOut(nValue=%"PRI64d".%08"PRI64d", scriptPubKey=%s)", nValue / COIN, nValue % COIN, scriptPubKey.ToString().substr(0,30).c_str());
389 printf("%s\n", ToString().c_str());
397 // The basic transaction that is broadcasted on the network and contained in
398 // blocks. A transaction can contain multiple inputs and outputs.
404 std::vector<CTxIn> vin;
405 std::vector<CTxOut> vout;
406 unsigned int nLockTime;
408 // Denial-of-service detection:
410 bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
419 READWRITE(this->nVersion);
420 nVersion = this->nVersion;
423 READWRITE(nLockTime);
432 nDoS = 0; // Denial-of-service prevention
437 return (vin.empty() && vout.empty());
440 uint256 GetHash() const
442 return SerializeHash(*this);
445 bool IsFinal(int nBlockHeight=0, int64 nBlockTime=0) const
447 // Time based nLockTime implemented in 0.1.6
450 if (nBlockHeight == 0)
451 nBlockHeight = nBestHeight;
453 nBlockTime = GetAdjustedTime();
454 if ((int64)nLockTime < (nLockTime < LOCKTIME_THRESHOLD ? (int64)nBlockHeight : nBlockTime))
456 BOOST_FOREACH(const CTxIn& txin, vin)
462 bool IsNewerThan(const CTransaction& old) const
464 if (vin.size() != old.vin.size())
466 for (int i = 0; i < vin.size(); i++)
467 if (vin[i].prevout != old.vin[i].prevout)
471 unsigned int nLowest = UINT_MAX;
472 for (int i = 0; i < vin.size(); i++)
474 if (vin[i].nSequence != old.vin[i].nSequence)
476 if (vin[i].nSequence <= nLowest)
479 nLowest = vin[i].nSequence;
481 if (old.vin[i].nSequence < nLowest)
484 nLowest = old.vin[i].nSequence;
491 bool IsCoinBase() const
493 return (vin.size() == 1 && vin[0].prevout.IsNull());
496 bool IsStandard() const;
497 bool IsStandardInputs(std::map<uint256, std::pair<CTxIndex, CTransaction> > mapInputs) const;
499 int64 GetValueOut() const
502 BOOST_FOREACH(const CTxOut& txout, vout)
504 nValueOut += txout.nValue;
505 if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))
506 throw std::runtime_error("CTransaction::GetValueOut() : value out of range");
511 static bool AllowFree(double dPriority)
513 // Large (in bytes) low-priority (new, small-coin) transactions
515 return dPriority > COIN * 144 / 250;
518 int64 GetMinFee(unsigned int nBlockSize=1, bool fAllowFree=true, bool fForRelay=false) const
520 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
521 int64 nBaseFee = fForRelay ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
523 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK);
524 unsigned int nNewBlockSize = nBlockSize + nBytes;
525 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
531 // Transactions under 10K are free
532 // (about 4500bc if made of 50bc inputs)
538 // Free transaction area
539 if (nNewBlockSize < 27000)
544 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
545 if (nMinFee < nBaseFee)
546 BOOST_FOREACH(const CTxOut& txout, vout)
547 if (txout.nValue < CENT)
550 // Raise the price as the block approaches full
551 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
553 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
555 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
558 if (!MoneyRange(nMinFee))
564 bool ReadFromDisk(CDiskTxPos pos, FILE** pfileRet=NULL)
566 CAutoFile filein = OpenBlockFile(pos.nFile, 0, pfileRet ? "rb+" : "rb");
568 return error("CTransaction::ReadFromDisk() : OpenBlockFile failed");
571 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
572 return error("CTransaction::ReadFromDisk() : fseek failed");
575 // Return file pointer
578 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
579 return error("CTransaction::ReadFromDisk() : second fseek failed");
580 *pfileRet = filein.release();
585 friend bool operator==(const CTransaction& a, const CTransaction& b)
587 return (a.nVersion == b.nVersion &&
590 a.nLockTime == b.nLockTime);
593 friend bool operator!=(const CTransaction& a, const CTransaction& b)
599 std::string ToString() const
602 str += strprintf("CTransaction(hash=%s, ver=%d, vin.size=%d, vout.size=%d, nLockTime=%d)\n",
603 GetHash().ToString().substr(0,10).c_str(),
608 for (int i = 0; i < vin.size(); i++)
609 str += " " + vin[i].ToString() + "\n";
610 for (int i = 0; i < vout.size(); i++)
611 str += " " + vout[i].ToString() + "\n";
617 printf("%s", ToString().c_str());
621 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet);
622 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout);
623 bool ReadFromDisk(COutPoint prevout);
624 bool DisconnectInputs(CTxDB& txdb);
625 bool FetchInputs(CTxDB& txdb, const std::map<uint256, CTxIndex>& mapTestPool,
626 bool fBlock, bool fMiner, std::map<uint256, std::pair<CTxIndex, CTransaction> >& inputsRet);
627 bool ConnectInputs(std::map<uint256, std::pair<CTxIndex, CTransaction> > inputs,
628 std::map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
629 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int& nSigOpsRet, int64 nMinFee=0);
630 bool ClientConnectInputs();
631 bool CheckTransaction() const;
632 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true, bool* pfMissingInputs=NULL);
633 bool AcceptToMemoryPool(bool fCheckInputs=true, bool* pfMissingInputs=NULL);
635 bool AddToMemoryPoolUnchecked();
637 bool RemoveFromMemoryPool();
645 // A transaction with a merkle branch linking it to the block chain
647 class CMerkleTx : public CTransaction
651 std::vector<uint256> vMerkleBranch;
655 mutable char fMerkleVerified;
663 CMerkleTx(const CTransaction& txIn) : CTransaction(txIn)
672 fMerkleVerified = false;
678 nSerSize += SerReadWrite(s, *(CTransaction*)this, nType, nVersion, ser_action);
679 nVersion = this->nVersion;
680 READWRITE(hashBlock);
681 READWRITE(vMerkleBranch);
686 int SetMerkleBranch(const CBlock* pblock=NULL);
687 int GetDepthInMainChain(CBlockIndex* &pindexRet) const;
688 int GetDepthInMainChain() const { CBlockIndex *pindexRet; return GetDepthInMainChain(pindexRet); }
689 bool IsInMainChain() const { return GetDepthInMainChain() > 0; }
690 int GetBlocksToMaturity() const;
691 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true);
692 bool AcceptToMemoryPool();
699 // A txdb record that contains the disk location of a transaction and the
700 // locations of transactions that spend its outputs. vSpent is really only
701 // used as a flag, but having the location is very helpful for debugging.
707 std::vector<CDiskTxPos> vSpent;
714 CTxIndex(const CDiskTxPos& posIn, unsigned int nOutputs)
717 vSpent.resize(nOutputs);
722 if (!(nType & SER_GETHASH))
739 friend bool operator==(const CTxIndex& a, const CTxIndex& b)
741 return (a.pos == b.pos &&
742 a.vSpent == b.vSpent);
745 friend bool operator!=(const CTxIndex& a, const CTxIndex& b)
749 int GetDepthInMainChain() const;
758 // Nodes collect new transactions into a block, hash them into a hash tree,
759 // and scan through nonce values to make the block's hash satisfy proof-of-work
760 // requirements. When they solve the proof-of-work, they broadcast the block
761 // to everyone and the block is added to the block chain. The first transaction
762 // in the block is a special one that creates a new coin owned by the creator
765 // Blocks are appended to blk0001.dat files on disk. Their location on disk
766 // is indexed by CBlockIndex objects in memory.
773 uint256 hashPrevBlock;
774 uint256 hashMerkleRoot;
780 std::vector<CTransaction> vtx;
783 mutable std::vector<uint256> vMerkleTree;
785 // Denial-of-service detection:
787 bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
796 READWRITE(this->nVersion);
797 nVersion = this->nVersion;
798 READWRITE(hashPrevBlock);
799 READWRITE(hashMerkleRoot);
804 // ConnectBlock depends on vtx being last so it can calculate offset
805 if (!(nType & (SER_GETHASH|SER_BLOCKHEADERONLY)))
808 const_cast<CBlock*>(this)->vtx.clear();
829 uint256 GetHash() const
831 return Hash(BEGIN(nVersion), END(nNonce));
834 int64 GetBlockTime() const
841 uint256 BuildMerkleTree() const
844 BOOST_FOREACH(const CTransaction& tx, vtx)
845 vMerkleTree.push_back(tx.GetHash());
847 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
849 for (int i = 0; i < nSize; i += 2)
851 int i2 = std::min(i+1, nSize-1);
852 vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),
853 BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));
857 return (vMerkleTree.empty() ? 0 : vMerkleTree.back());
860 std::vector<uint256> GetMerkleBranch(int nIndex) const
862 if (vMerkleTree.empty())
864 std::vector<uint256> vMerkleBranch;
866 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
868 int i = std::min(nIndex^1, nSize-1);
869 vMerkleBranch.push_back(vMerkleTree[j+i]);
873 return vMerkleBranch;
876 static uint256 CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)
880 BOOST_FOREACH(const uint256& otherside, vMerkleBranch)
883 hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));
885 hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));
892 bool WriteToDisk(unsigned int& nFileRet, unsigned int& nBlockPosRet)
894 // Open history file to append
895 CAutoFile fileout = AppendBlockFile(nFileRet);
897 return error("CBlock::WriteToDisk() : AppendBlockFile failed");
899 // Write index header
900 unsigned int nSize = fileout.GetSerializeSize(*this);
901 fileout << FLATDATA(pchMessageStart) << nSize;
904 nBlockPosRet = ftell(fileout);
905 if (nBlockPosRet == -1)
906 return error("CBlock::WriteToDisk() : ftell failed");
909 // Flush stdio buffers and commit to disk before returning
911 if (!IsInitialBlockDownload() || (nBestHeight+1) % 500 == 0)
914 _commit(_fileno(fileout));
916 fsync(fileno(fileout));
923 bool ReadFromDisk(unsigned int nFile, unsigned int nBlockPos, bool fReadTransactions=true)
927 // Open history file to read
928 CAutoFile filein = OpenBlockFile(nFile, nBlockPos, "rb");
930 return error("CBlock::ReadFromDisk() : OpenBlockFile failed");
931 if (!fReadTransactions)
932 filein.nType |= SER_BLOCKHEADERONLY;
938 if (!CheckProofOfWork(GetHash(), nBits))
939 return error("CBlock::ReadFromDisk() : errors in block header");
948 printf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%d)\n",
949 GetHash().ToString().substr(0,20).c_str(),
951 hashPrevBlock.ToString().substr(0,20).c_str(),
952 hashMerkleRoot.ToString().substr(0,10).c_str(),
953 nTime, nBits, nNonce,
955 for (int i = 0; i < vtx.size(); i++)
960 printf(" vMerkleTree: ");
961 for (int i = 0; i < vMerkleTree.size(); i++)
962 printf("%s ", vMerkleTree[i].ToString().substr(0,10).c_str());
967 bool DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex);
968 bool ConnectBlock(CTxDB& txdb, CBlockIndex* pindex);
969 bool ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions=true);
970 bool SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew);
971 bool AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos);
972 bool CheckBlock() const;
982 // The block chain is a tree shaped structure starting with the
983 // genesis block at the root, with each block potentially having multiple
984 // candidates to be the next block. pprev and pnext link a path through the
985 // main/longest chain. A blockindex may have multiple pprev pointing back
986 // to it, but pnext will only point forward to the longest branch, or will
987 // be null if the block is not part of the longest chain.
992 const uint256* phashBlock;
996 unsigned int nBlockPos;
1002 uint256 hashMerkleRoot;
1005 unsigned int nNonce;
1025 CBlockIndex(unsigned int nFileIn, unsigned int nBlockPosIn, CBlock& block)
1031 nBlockPos = nBlockPosIn;
1035 nVersion = block.nVersion;
1036 hashMerkleRoot = block.hashMerkleRoot;
1037 nTime = block.nTime;
1038 nBits = block.nBits;
1039 nNonce = block.nNonce;
1042 CBlock GetBlockHeader() const
1045 block.nVersion = nVersion;
1047 block.hashPrevBlock = pprev->GetBlockHash();
1048 block.hashMerkleRoot = hashMerkleRoot;
1049 block.nTime = nTime;
1050 block.nBits = nBits;
1051 block.nNonce = nNonce;
1055 uint256 GetBlockHash() const
1060 int64 GetBlockTime() const
1062 return (int64)nTime;
1065 CBigNum GetBlockWork() const
1068 bnTarget.SetCompact(nBits);
1071 return (CBigNum(1)<<256) / (bnTarget+1);
1074 bool IsInMainChain() const
1076 return (pnext || this == pindexBest);
1079 bool CheckIndex() const
1081 return CheckProofOfWork(GetBlockHash(), nBits);
1084 bool EraseBlockFromDisk()
1086 // Open history file
1087 CAutoFile fileout = OpenBlockFile(nFile, nBlockPos, "rb+");
1091 // Overwrite with empty null block
1099 enum { nMedianTimeSpan=11 };
1101 int64 GetMedianTimePast() const
1103 int64 pmedian[nMedianTimeSpan];
1104 int64* pbegin = &pmedian[nMedianTimeSpan];
1105 int64* pend = &pmedian[nMedianTimeSpan];
1107 const CBlockIndex* pindex = this;
1108 for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
1109 *(--pbegin) = pindex->GetBlockTime();
1111 std::sort(pbegin, pend);
1112 return pbegin[(pend - pbegin)/2];
1115 int64 GetMedianTime() const
1117 const CBlockIndex* pindex = this;
1118 for (int i = 0; i < nMedianTimeSpan/2; i++)
1121 return GetBlockTime();
1122 pindex = pindex->pnext;
1124 return pindex->GetMedianTimePast();
1129 std::string ToString() const
1131 return strprintf("CBlockIndex(nprev=%08x, pnext=%08x, nFile=%d, nBlockPos=%-6d nHeight=%d, merkle=%s, hashBlock=%s)",
1132 pprev, pnext, nFile, nBlockPos, nHeight,
1133 hashMerkleRoot.ToString().substr(0,10).c_str(),
1134 GetBlockHash().ToString().substr(0,20).c_str());
1139 printf("%s\n", ToString().c_str());
1146 // Used to marshal pointers into hashes for db storage.
1148 class CDiskBlockIndex : public CBlockIndex
1160 explicit CDiskBlockIndex(CBlockIndex* pindex) : CBlockIndex(*pindex)
1162 hashPrev = (pprev ? pprev->GetBlockHash() : 0);
1163 hashNext = (pnext ? pnext->GetBlockHash() : 0);
1168 if (!(nType & SER_GETHASH))
1169 READWRITE(nVersion);
1171 READWRITE(hashNext);
1173 READWRITE(nBlockPos);
1177 READWRITE(this->nVersion);
1178 READWRITE(hashPrev);
1179 READWRITE(hashMerkleRoot);
1185 uint256 GetBlockHash() const
1188 block.nVersion = nVersion;
1189 block.hashPrevBlock = hashPrev;
1190 block.hashMerkleRoot = hashMerkleRoot;
1191 block.nTime = nTime;
1192 block.nBits = nBits;
1193 block.nNonce = nNonce;
1194 return block.GetHash();
1198 std::string ToString() const
1200 std::string str = "CDiskBlockIndex(";
1201 str += CBlockIndex::ToString();
1202 str += strprintf("\n hashBlock=%s, hashPrev=%s, hashNext=%s)",
1203 GetBlockHash().ToString().c_str(),
1204 hashPrev.ToString().substr(0,20).c_str(),
1205 hashNext.ToString().substr(0,20).c_str());
1211 printf("%s\n", ToString().c_str());
1223 // Describes a place in the block chain to another node such that if the
1224 // other node doesn't have the same branch, it can find a recent common trunk.
1225 // The further back it is, the further before the fork it may be.
1230 std::vector<uint256> vHave;
1237 explicit CBlockLocator(const CBlockIndex* pindex)
1242 explicit CBlockLocator(uint256 hashBlock)
1244 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
1245 if (mi != mapBlockIndex.end())
1249 CBlockLocator(const std::vector<uint256>& vHaveIn)
1256 if (!(nType & SER_GETHASH))
1257 READWRITE(nVersion);
1268 return vHave.empty();
1271 void Set(const CBlockIndex* pindex)
1277 vHave.push_back(pindex->GetBlockHash());
1279 // Exponentially larger steps back
1280 for (int i = 0; pindex && i < nStep; i++)
1281 pindex = pindex->pprev;
1282 if (vHave.size() > 10)
1285 vHave.push_back(hashGenesisBlock);
1288 int GetDistanceBack()
1290 // Retrace how far back it was in the sender's branch
1293 BOOST_FOREACH(const uint256& hash, vHave)
1295 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1296 if (mi != mapBlockIndex.end())
1298 CBlockIndex* pindex = (*mi).second;
1299 if (pindex->IsInMainChain())
1309 CBlockIndex* GetBlockIndex()
1311 // Find the first block the caller has in the main chain
1312 BOOST_FOREACH(const uint256& hash, vHave)
1314 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1315 if (mi != mapBlockIndex.end())
1317 CBlockIndex* pindex = (*mi).second;
1318 if (pindex->IsInMainChain())
1322 return pindexGenesisBlock;
1325 uint256 GetBlockHash()
1327 // Find the first block the caller has in the main chain
1328 BOOST_FOREACH(const uint256& hash, vHave)
1330 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1331 if (mi != mapBlockIndex.end())
1333 CBlockIndex* pindex = (*mi).second;
1334 if (pindex->IsInMainChain())
1338 return hashGenesisBlock;
1343 CBlockIndex* pindex = GetBlockIndex();
1346 return pindex->nHeight;
1359 // Alerts are for notifying old versions if they become too obsolete and
1360 // need to upgrade. The message is displayed in the status bar.
1361 // Alert messages are broadcast as a vector of signed data. Unserializing may
1362 // not read the entire buffer if the alert is for a newer version, but older
1363 // versions can still relay the original data.
1365 class CUnsignedAlert
1369 int64 nRelayUntil; // when newer nodes stop relaying to newer nodes
1373 std::set<int> setCancel;
1374 int nMinVer; // lowest version inclusive
1375 int nMaxVer; // highest version inclusive
1376 std::set<std::string> setSubVer; // empty matches all
1380 std::string strComment;
1381 std::string strStatusBar;
1382 std::string strReserved;
1386 READWRITE(this->nVersion);
1387 nVersion = this->nVersion;
1388 READWRITE(nRelayUntil);
1389 READWRITE(nExpiration);
1392 READWRITE(setCancel);
1395 READWRITE(setSubVer);
1396 READWRITE(nPriority);
1398 READWRITE(strComment);
1399 READWRITE(strStatusBar);
1400 READWRITE(strReserved);
1417 strStatusBar.clear();
1418 strReserved.clear();
1421 std::string ToString() const
1423 std::string strSetCancel;
1424 BOOST_FOREACH(int n, setCancel)
1425 strSetCancel += strprintf("%d ", n);
1426 std::string strSetSubVer;
1427 BOOST_FOREACH(std::string str, setSubVer)
1428 strSetSubVer += "\"" + str + "\" ";
1432 " nRelayUntil = %"PRI64d"\n"
1433 " nExpiration = %"PRI64d"\n"
1441 " strComment = \"%s\"\n"
1442 " strStatusBar = \"%s\"\n"
1449 strSetCancel.c_str(),
1452 strSetSubVer.c_str(),
1455 strStatusBar.c_str());
1460 printf("%s", ToString().c_str());
1464 class CAlert : public CUnsignedAlert
1467 std::vector<unsigned char> vchMsg;
1468 std::vector<unsigned char> vchSig;
1483 CUnsignedAlert::SetNull();
1490 return (nExpiration == 0);
1493 uint256 GetHash() const
1495 return SerializeHash(*this);
1498 bool IsInEffect() const
1500 return (GetAdjustedTime() < nExpiration);
1503 bool Cancels(const CAlert& alert) const
1506 return false; // this was a no-op before 31403
1507 return (alert.nID <= nCancel || setCancel.count(alert.nID));
1510 bool AppliesTo(int nVersion, std::string strSubVerIn) const
1512 // TODO: rework for client-version-embedded-in-strSubVer ?
1513 return (IsInEffect() &&
1514 nMinVer <= nVersion && nVersion <= nMaxVer &&
1515 (setSubVer.empty() || setSubVer.count(strSubVerIn)));
1518 bool AppliesToMe() const
1520 return AppliesTo(PROTOCOL_VERSION, FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, std::vector<std::string>()));
1523 bool RelayTo(CNode* pnode) const
1527 // returns true if wasn't already contained in the set
1528 if (pnode->setKnown.insert(GetHash()).second)
1530 if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||
1532 GetAdjustedTime() < nRelayUntil)
1534 pnode->PushMessage("alert", *this);
1541 bool CheckSignature()
1544 if (!key.SetPubKey(ParseHex("04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284")))
1545 return error("CAlert::CheckSignature() : SetPubKey failed");
1546 if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))
1547 return error("CAlert::CheckSignature() : verify signature failed");
1549 // Now unserialize the data
1550 CDataStream sMsg(vchMsg);
1551 sMsg >> *(CUnsignedAlert*)this;
1555 bool ProcessAlert();