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 int GetSigOpCount() const
499 BOOST_FOREACH(const CTxIn& txin, vin)
500 n += txin.scriptSig.GetSigOpCount();
501 BOOST_FOREACH(const CTxOut& txout, vout)
502 n += txout.scriptPubKey.GetSigOpCount();
506 bool IsStandard() const
508 BOOST_FOREACH(const CTxIn& txin, vin)
509 if (!txin.scriptSig.IsPushOnly())
510 return error("nonstandard txin: %s", txin.scriptSig.ToString().c_str());
511 BOOST_FOREACH(const CTxOut& txout, vout)
512 if (!::IsStandard(txout.scriptPubKey))
513 return error("nonstandard txout: %s", txout.scriptPubKey.ToString().c_str());
517 int64 GetValueOut() const
520 BOOST_FOREACH(const CTxOut& txout, vout)
522 nValueOut += txout.nValue;
523 if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))
524 throw std::runtime_error("CTransaction::GetValueOut() : value out of range");
529 static bool AllowFree(double dPriority)
531 // Large (in bytes) low-priority (new, small-coin) transactions
533 return dPriority > COIN * 144 / 250;
536 int64 GetMinFee(unsigned int nBlockSize=1, bool fAllowFree=true, bool fForRelay=false) const
538 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
539 int64 nBaseFee = fForRelay ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
541 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK);
542 unsigned int nNewBlockSize = nBlockSize + nBytes;
543 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
549 // Transactions under 10K are free
550 // (about 4500bc if made of 50bc inputs)
556 // Free transaction area
557 if (nNewBlockSize < 27000)
562 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
563 if (nMinFee < nBaseFee)
564 BOOST_FOREACH(const CTxOut& txout, vout)
565 if (txout.nValue < CENT)
568 // Raise the price as the block approaches full
569 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
571 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
573 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
576 if (!MoneyRange(nMinFee))
582 bool ReadFromDisk(CDiskTxPos pos, FILE** pfileRet=NULL)
584 CAutoFile filein = OpenBlockFile(pos.nFile, 0, pfileRet ? "rb+" : "rb");
586 return error("CTransaction::ReadFromDisk() : OpenBlockFile failed");
589 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
590 return error("CTransaction::ReadFromDisk() : fseek failed");
593 // Return file pointer
596 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
597 return error("CTransaction::ReadFromDisk() : second fseek failed");
598 *pfileRet = filein.release();
603 friend bool operator==(const CTransaction& a, const CTransaction& b)
605 return (a.nVersion == b.nVersion &&
608 a.nLockTime == b.nLockTime);
611 friend bool operator!=(const CTransaction& a, const CTransaction& b)
617 std::string ToString() const
620 str += strprintf("CTransaction(hash=%s, ver=%d, vin.size=%d, vout.size=%d, nLockTime=%d)\n",
621 GetHash().ToString().substr(0,10).c_str(),
626 for (int i = 0; i < vin.size(); i++)
627 str += " " + vin[i].ToString() + "\n";
628 for (int i = 0; i < vout.size(); i++)
629 str += " " + vout[i].ToString() + "\n";
635 printf("%s", ToString().c_str());
639 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet);
640 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout);
641 bool ReadFromDisk(COutPoint prevout);
642 bool DisconnectInputs(CTxDB& txdb);
643 bool ConnectInputs(CTxDB& txdb, std::map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
644 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee=0);
645 bool ClientConnectInputs();
646 bool CheckTransaction() const;
647 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true, bool* pfMissingInputs=NULL);
648 bool AcceptToMemoryPool(bool fCheckInputs=true, bool* pfMissingInputs=NULL);
650 bool AddToMemoryPoolUnchecked();
652 bool RemoveFromMemoryPool();
660 // A transaction with a merkle branch linking it to the block chain
662 class CMerkleTx : public CTransaction
666 std::vector<uint256> vMerkleBranch;
670 mutable char fMerkleVerified;
678 CMerkleTx(const CTransaction& txIn) : CTransaction(txIn)
687 fMerkleVerified = false;
693 nSerSize += SerReadWrite(s, *(CTransaction*)this, nType, nVersion, ser_action);
694 nVersion = this->nVersion;
695 READWRITE(hashBlock);
696 READWRITE(vMerkleBranch);
701 int SetMerkleBranch(const CBlock* pblock=NULL);
702 int GetDepthInMainChain(int& nHeightRet) const;
703 int GetDepthInMainChain() const { int nHeight; return GetDepthInMainChain(nHeight); }
704 bool IsInMainChain() const { return GetDepthInMainChain() > 0; }
705 int GetBlocksToMaturity() const;
706 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true);
707 bool AcceptToMemoryPool();
714 // A txdb record that contains the disk location of a transaction and the
715 // locations of transactions that spend its outputs. vSpent is really only
716 // used as a flag, but having the location is very helpful for debugging.
722 std::vector<CDiskTxPos> vSpent;
729 CTxIndex(const CDiskTxPos& posIn, unsigned int nOutputs)
732 vSpent.resize(nOutputs);
737 if (!(nType & SER_GETHASH))
754 friend bool operator==(const CTxIndex& a, const CTxIndex& b)
756 return (a.pos == b.pos &&
757 a.vSpent == b.vSpent);
760 friend bool operator!=(const CTxIndex& a, const CTxIndex& b)
764 int GetDepthInMainChain() const;
772 // Nodes collect new transactions into a block, hash them into a hash tree,
773 // and scan through nonce values to make the block's hash satisfy proof-of-work
774 // requirements. When they solve the proof-of-work, they broadcast the block
775 // to everyone and the block is added to the block chain. The first transaction
776 // in the block is a special one that creates a new coin owned by the creator
779 // Blocks are appended to blk0001.dat files on disk. Their location on disk
780 // is indexed by CBlockIndex objects in memory.
787 uint256 hashPrevBlock;
788 uint256 hashMerkleRoot;
794 std::vector<CTransaction> vtx;
797 mutable std::vector<uint256> vMerkleTree;
799 // Denial-of-service detection:
801 bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
810 READWRITE(this->nVersion);
811 nVersion = this->nVersion;
812 READWRITE(hashPrevBlock);
813 READWRITE(hashMerkleRoot);
818 // ConnectBlock depends on vtx being last so it can calculate offset
819 if (!(nType & (SER_GETHASH|SER_BLOCKHEADERONLY)))
822 const_cast<CBlock*>(this)->vtx.clear();
843 uint256 GetHash() const
845 return Hash(BEGIN(nVersion), END(nNonce));
848 int64 GetBlockTime() const
853 int GetSigOpCount() const
856 BOOST_FOREACH(const CTransaction& tx, vtx)
857 n += tx.GetSigOpCount();
862 uint256 BuildMerkleTree() const
865 BOOST_FOREACH(const CTransaction& tx, vtx)
866 vMerkleTree.push_back(tx.GetHash());
868 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
870 for (int i = 0; i < nSize; i += 2)
872 int i2 = std::min(i+1, nSize-1);
873 vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),
874 BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));
878 return (vMerkleTree.empty() ? 0 : vMerkleTree.back());
881 std::vector<uint256> GetMerkleBranch(int nIndex) const
883 if (vMerkleTree.empty())
885 std::vector<uint256> vMerkleBranch;
887 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
889 int i = std::min(nIndex^1, nSize-1);
890 vMerkleBranch.push_back(vMerkleTree[j+i]);
894 return vMerkleBranch;
897 static uint256 CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)
901 BOOST_FOREACH(const uint256& otherside, vMerkleBranch)
904 hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));
906 hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));
913 bool WriteToDisk(unsigned int& nFileRet, unsigned int& nBlockPosRet)
915 // Open history file to append
916 CAutoFile fileout = AppendBlockFile(nFileRet);
918 return error("CBlock::WriteToDisk() : AppendBlockFile failed");
920 // Write index header
921 unsigned int nSize = fileout.GetSerializeSize(*this);
922 fileout << FLATDATA(pchMessageStart) << nSize;
925 nBlockPosRet = ftell(fileout);
926 if (nBlockPosRet == -1)
927 return error("CBlock::WriteToDisk() : ftell failed");
930 // Flush stdio buffers and commit to disk before returning
932 if (!IsInitialBlockDownload() || (nBestHeight+1) % 500 == 0)
935 _commit(_fileno(fileout));
937 fsync(fileno(fileout));
944 bool ReadFromDisk(unsigned int nFile, unsigned int nBlockPos, bool fReadTransactions=true)
948 // Open history file to read
949 CAutoFile filein = OpenBlockFile(nFile, nBlockPos, "rb");
951 return error("CBlock::ReadFromDisk() : OpenBlockFile failed");
952 if (!fReadTransactions)
953 filein.nType |= SER_BLOCKHEADERONLY;
959 if (!CheckProofOfWork(GetHash(), nBits))
960 return error("CBlock::ReadFromDisk() : errors in block header");
969 printf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%d)\n",
970 GetHash().ToString().substr(0,20).c_str(),
972 hashPrevBlock.ToString().substr(0,20).c_str(),
973 hashMerkleRoot.ToString().substr(0,10).c_str(),
974 nTime, nBits, nNonce,
976 for (int i = 0; i < vtx.size(); i++)
981 printf(" vMerkleTree: ");
982 for (int i = 0; i < vMerkleTree.size(); i++)
983 printf("%s ", vMerkleTree[i].ToString().substr(0,10).c_str());
988 bool DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex);
989 bool ConnectBlock(CTxDB& txdb, CBlockIndex* pindex);
990 bool ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions=true);
991 bool SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew);
992 bool AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos);
993 bool CheckBlock() const;
1003 // The block chain is a tree shaped structure starting with the
1004 // genesis block at the root, with each block potentially having multiple
1005 // candidates to be the next block. pprev and pnext link a path through the
1006 // main/longest chain. A blockindex may have multiple pprev pointing back
1007 // to it, but pnext will only point forward to the longest branch, or will
1008 // be null if the block is not part of the longest chain.
1013 const uint256* phashBlock;
1017 unsigned int nBlockPos;
1019 CBigNum bnChainWork;
1023 uint256 hashMerkleRoot;
1026 unsigned int nNonce;
1046 CBlockIndex(unsigned int nFileIn, unsigned int nBlockPosIn, CBlock& block)
1052 nBlockPos = nBlockPosIn;
1056 nVersion = block.nVersion;
1057 hashMerkleRoot = block.hashMerkleRoot;
1058 nTime = block.nTime;
1059 nBits = block.nBits;
1060 nNonce = block.nNonce;
1063 CBlock GetBlockHeader() const
1066 block.nVersion = nVersion;
1068 block.hashPrevBlock = pprev->GetBlockHash();
1069 block.hashMerkleRoot = hashMerkleRoot;
1070 block.nTime = nTime;
1071 block.nBits = nBits;
1072 block.nNonce = nNonce;
1076 uint256 GetBlockHash() const
1081 int64 GetBlockTime() const
1083 return (int64)nTime;
1086 CBigNum GetBlockWork() const
1089 bnTarget.SetCompact(nBits);
1092 return (CBigNum(1)<<256) / (bnTarget+1);
1095 bool IsInMainChain() const
1097 return (pnext || this == pindexBest);
1100 bool CheckIndex() const
1102 return CheckProofOfWork(GetBlockHash(), nBits);
1105 bool EraseBlockFromDisk()
1107 // Open history file
1108 CAutoFile fileout = OpenBlockFile(nFile, nBlockPos, "rb+");
1112 // Overwrite with empty null block
1120 enum { nMedianTimeSpan=11 };
1122 int64 GetMedianTimePast() const
1124 int64 pmedian[nMedianTimeSpan];
1125 int64* pbegin = &pmedian[nMedianTimeSpan];
1126 int64* pend = &pmedian[nMedianTimeSpan];
1128 const CBlockIndex* pindex = this;
1129 for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
1130 *(--pbegin) = pindex->GetBlockTime();
1132 std::sort(pbegin, pend);
1133 return pbegin[(pend - pbegin)/2];
1136 int64 GetMedianTime() const
1138 const CBlockIndex* pindex = this;
1139 for (int i = 0; i < nMedianTimeSpan/2; i++)
1142 return GetBlockTime();
1143 pindex = pindex->pnext;
1145 return pindex->GetMedianTimePast();
1150 std::string ToString() const
1152 return strprintf("CBlockIndex(nprev=%08x, pnext=%08x, nFile=%d, nBlockPos=%-6d nHeight=%d, merkle=%s, hashBlock=%s)",
1153 pprev, pnext, nFile, nBlockPos, nHeight,
1154 hashMerkleRoot.ToString().substr(0,10).c_str(),
1155 GetBlockHash().ToString().substr(0,20).c_str());
1160 printf("%s\n", ToString().c_str());
1167 // Used to marshal pointers into hashes for db storage.
1169 class CDiskBlockIndex : public CBlockIndex
1181 explicit CDiskBlockIndex(CBlockIndex* pindex) : CBlockIndex(*pindex)
1183 hashPrev = (pprev ? pprev->GetBlockHash() : 0);
1184 hashNext = (pnext ? pnext->GetBlockHash() : 0);
1189 if (!(nType & SER_GETHASH))
1190 READWRITE(nVersion);
1192 READWRITE(hashNext);
1194 READWRITE(nBlockPos);
1198 READWRITE(this->nVersion);
1199 READWRITE(hashPrev);
1200 READWRITE(hashMerkleRoot);
1206 uint256 GetBlockHash() const
1209 block.nVersion = nVersion;
1210 block.hashPrevBlock = hashPrev;
1211 block.hashMerkleRoot = hashMerkleRoot;
1212 block.nTime = nTime;
1213 block.nBits = nBits;
1214 block.nNonce = nNonce;
1215 return block.GetHash();
1219 std::string ToString() const
1221 std::string str = "CDiskBlockIndex(";
1222 str += CBlockIndex::ToString();
1223 str += strprintf("\n hashBlock=%s, hashPrev=%s, hashNext=%s)",
1224 GetBlockHash().ToString().c_str(),
1225 hashPrev.ToString().substr(0,20).c_str(),
1226 hashNext.ToString().substr(0,20).c_str());
1232 printf("%s\n", ToString().c_str());
1244 // Describes a place in the block chain to another node such that if the
1245 // other node doesn't have the same branch, it can find a recent common trunk.
1246 // The further back it is, the further before the fork it may be.
1251 std::vector<uint256> vHave;
1258 explicit CBlockLocator(const CBlockIndex* pindex)
1263 explicit CBlockLocator(uint256 hashBlock)
1265 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
1266 if (mi != mapBlockIndex.end())
1272 if (!(nType & SER_GETHASH))
1273 READWRITE(nVersion);
1284 return vHave.empty();
1287 void Set(const CBlockIndex* pindex)
1293 vHave.push_back(pindex->GetBlockHash());
1295 // Exponentially larger steps back
1296 for (int i = 0; pindex && i < nStep; i++)
1297 pindex = pindex->pprev;
1298 if (vHave.size() > 10)
1301 vHave.push_back(hashGenesisBlock);
1304 int GetDistanceBack()
1306 // Retrace how far back it was in the sender's branch
1309 BOOST_FOREACH(const uint256& hash, vHave)
1311 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1312 if (mi != mapBlockIndex.end())
1314 CBlockIndex* pindex = (*mi).second;
1315 if (pindex->IsInMainChain())
1325 CBlockIndex* GetBlockIndex()
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 pindexGenesisBlock;
1341 uint256 GetBlockHash()
1343 // Find the first block the caller has in the main chain
1344 BOOST_FOREACH(const uint256& hash, vHave)
1346 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1347 if (mi != mapBlockIndex.end())
1349 CBlockIndex* pindex = (*mi).second;
1350 if (pindex->IsInMainChain())
1354 return hashGenesisBlock;
1359 CBlockIndex* pindex = GetBlockIndex();
1362 return pindex->nHeight;
1375 // Alerts are for notifying old versions if they become too obsolete and
1376 // need to upgrade. The message is displayed in the status bar.
1377 // Alert messages are broadcast as a vector of signed data. Unserializing may
1378 // not read the entire buffer if the alert is for a newer version, but older
1379 // versions can still relay the original data.
1381 class CUnsignedAlert
1385 int64 nRelayUntil; // when newer nodes stop relaying to newer nodes
1389 std::set<int> setCancel;
1390 int nMinVer; // lowest version inclusive
1391 int nMaxVer; // highest version inclusive
1392 std::set<std::string> setSubVer; // empty matches all
1396 std::string strComment;
1397 std::string strStatusBar;
1398 std::string strReserved;
1402 READWRITE(this->nVersion);
1403 nVersion = this->nVersion;
1404 READWRITE(nRelayUntil);
1405 READWRITE(nExpiration);
1408 READWRITE(setCancel);
1411 READWRITE(setSubVer);
1412 READWRITE(nPriority);
1414 READWRITE(strComment);
1415 READWRITE(strStatusBar);
1416 READWRITE(strReserved);
1433 strStatusBar.clear();
1434 strReserved.clear();
1437 std::string ToString() const
1439 std::string strSetCancel;
1440 BOOST_FOREACH(int n, setCancel)
1441 strSetCancel += strprintf("%d ", n);
1442 std::string strSetSubVer;
1443 BOOST_FOREACH(std::string str, setSubVer)
1444 strSetSubVer += "\"" + str + "\" ";
1448 " nRelayUntil = %"PRI64d"\n"
1449 " nExpiration = %"PRI64d"\n"
1457 " strComment = \"%s\"\n"
1458 " strStatusBar = \"%s\"\n"
1465 strSetCancel.c_str(),
1468 strSetSubVer.c_str(),
1471 strStatusBar.c_str());
1476 printf("%s", ToString().c_str());
1480 class CAlert : public CUnsignedAlert
1483 std::vector<unsigned char> vchMsg;
1484 std::vector<unsigned char> vchSig;
1499 CUnsignedAlert::SetNull();
1506 return (nExpiration == 0);
1509 uint256 GetHash() const
1511 return SerializeHash(*this);
1514 bool IsInEffect() const
1516 return (GetAdjustedTime() < nExpiration);
1519 bool Cancels(const CAlert& alert) const
1522 return false; // this was a no-op before 31403
1523 return (alert.nID <= nCancel || setCancel.count(alert.nID));
1526 bool AppliesTo(int nVersion, std::string strSubVerIn) const
1528 // TODO: rework for client-version-embedded-in-strSubVer ?
1529 return (IsInEffect() &&
1530 nMinVer <= nVersion && nVersion <= nMaxVer &&
1531 (setSubVer.empty() || setSubVer.count(strSubVerIn)));
1534 bool AppliesToMe() const
1536 return AppliesTo(PROTOCOL_VERSION, FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, std::vector<std::string>()));
1539 bool RelayTo(CNode* pnode) const
1543 // returns true if wasn't already contained in the set
1544 if (pnode->setKnown.insert(GetHash()).second)
1546 if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||
1548 GetAdjustedTime() < nRelayUntil)
1550 pnode->PushMessage("alert", *this);
1557 bool CheckSignature()
1560 if (!key.SetPubKey(ParseHex("04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284")))
1561 return error("CAlert::CheckSignature() : SetPubKey failed");
1562 if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))
1563 return error("CAlert::CheckSignature() : verify signature failed");
1565 // Now unserialize the data
1566 CDataStream sMsg(vchMsg);
1567 sMsg >> *(CUnsignedAlert*)this;
1571 bool ProcessAlert();