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 unsigned int MAX_BLOCK_SIZE = 1000000;
31 static const unsigned int MAX_BLOCK_SIZE_GEN = MAX_BLOCK_SIZE/2;
32 static const int MAX_BLOCK_SIGOPS = MAX_BLOCK_SIZE/50;
33 static const int64 COIN = 100000000;
34 static const int64 CENT = 1000000;
35 static const int64 MIN_TX_FEE = 50000;
36 static const int64 MIN_RELAY_TX_FEE = 10000;
37 static const int64 MAX_MONEY = 21000000 * COIN;
38 inline bool MoneyRange(int64 nValue) { return (nValue >= 0 && nValue <= MAX_MONEY); }
39 static const int COINBASE_MATURITY = 100;
40 // Threshold for nLockTime: below this value it is interpreted as block number, otherwise as UNIX timestamp.
41 static const int LOCKTIME_THRESHOLD = 500000000; // Tue Nov 5 00:53:20 1985 UTC
43 static const int fHaveUPnP = true;
45 static const int fHaveUPnP = false;
53 extern CCriticalSection cs_main;
54 extern std::map<uint256, CBlockIndex*> mapBlockIndex;
55 extern uint256 hashGenesisBlock;
56 extern CBlockIndex* pindexGenesisBlock;
57 extern int nBestHeight;
58 extern CBigNum bnBestChainWork;
59 extern CBigNum bnBestInvalidWork;
60 extern uint256 hashBestChain;
61 extern CBlockIndex* pindexBest;
62 extern unsigned int nTransactionsUpdated;
63 extern double dHashesPerSec;
64 extern int64 nHPSTimerStart;
65 extern int64 nTimeBestReceived;
66 extern CCriticalSection cs_setpwalletRegistered;
67 extern std::set<CWallet*> setpwalletRegistered;
70 extern int fGenerateBitcoins;
71 extern int64 nTransactionFee;
72 extern int fLimitProcessors;
73 extern int nLimitProcessors;
74 extern int fMinimizeToTray;
75 extern int fMinimizeOnClose;
86 void RegisterWallet(CWallet* pwalletIn);
87 void UnregisterWallet(CWallet* pwalletIn);
88 bool CheckDiskSpace(uint64 nAdditionalBytes=0);
89 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode="rb");
90 FILE* AppendBlockFile(unsigned int& nFileRet);
91 bool LoadBlockIndex(bool fAllowNew=true);
92 void PrintBlockTree();
93 bool ProcessMessages(CNode* pfrom);
94 bool SendMessages(CNode* pto, bool fSendTrickle);
95 void GenerateBitcoins(bool fGenerate, CWallet* pwallet);
96 CBlock* CreateNewBlock(CReserveKey& reservekey);
97 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce);
98 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1);
99 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey);
100 bool CheckProofOfWork(uint256 hash, unsigned int nBits);
101 int GetTotalBlocksEstimate();
102 bool IsInitialBlockDownload();
103 std::string GetWarnings(std::string strFor);
116 bool GetWalletFile(CWallet* pwallet, std::string &strWalletFileOut);
119 bool WriteSetting(const std::string& strKey, const T& value)
122 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
124 std::string strWalletFile;
125 if (!GetWalletFile(pwallet, strWalletFile))
127 fOk |= CWalletDB(strWalletFile).WriteSetting(strKey, value);
137 unsigned int nBlockPos;
145 CDiskTxPos(unsigned int nFileIn, unsigned int nBlockPosIn, unsigned int nTxPosIn)
148 nBlockPos = nBlockPosIn;
152 IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
153 void SetNull() { nFile = -1; nBlockPos = 0; nTxPos = 0; }
154 bool IsNull() const { return (nFile == -1); }
156 friend bool operator==(const CDiskTxPos& a, const CDiskTxPos& b)
158 return (a.nFile == b.nFile &&
159 a.nBlockPos == b.nBlockPos &&
160 a.nTxPos == b.nTxPos);
163 friend bool operator!=(const CDiskTxPos& a, const CDiskTxPos& b)
168 std::string ToString() const
171 return strprintf("null");
173 return strprintf("(nFile=%d, nBlockPos=%d, nTxPos=%d)", nFile, nBlockPos, nTxPos);
178 printf("%s", ToString().c_str());
191 CInPoint() { SetNull(); }
192 CInPoint(CTransaction* ptxIn, unsigned int nIn) { ptx = ptxIn; n = nIn; }
193 void SetNull() { ptx = NULL; n = -1; }
194 bool IsNull() const { return (ptx == NULL && n == -1); }
206 COutPoint() { SetNull(); }
207 COutPoint(uint256 hashIn, unsigned int nIn) { hash = hashIn; n = nIn; }
208 IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
209 void SetNull() { hash = 0; n = -1; }
210 bool IsNull() const { return (hash == 0 && n == -1); }
212 friend bool operator<(const COutPoint& a, const COutPoint& b)
214 return (a.hash < b.hash || (a.hash == b.hash && a.n < b.n));
217 friend bool operator==(const COutPoint& a, const COutPoint& b)
219 return (a.hash == b.hash && a.n == b.n);
222 friend bool operator!=(const COutPoint& a, const COutPoint& b)
227 std::string ToString() const
229 return strprintf("COutPoint(%s, %d)", hash.ToString().substr(0,10).c_str(), n);
234 printf("%s\n", ToString().c_str());
242 // An input of a transaction. It contains the location of the previous
243 // transaction's output that it claims and a signature that matches the
244 // output's public key.
251 unsigned int nSequence;
255 nSequence = UINT_MAX;
258 explicit CTxIn(COutPoint prevoutIn, CScript scriptSigIn=CScript(), unsigned int nSequenceIn=UINT_MAX)
261 scriptSig = scriptSigIn;
262 nSequence = nSequenceIn;
265 CTxIn(uint256 hashPrevTx, unsigned int nOut, CScript scriptSigIn=CScript(), unsigned int nSequenceIn=UINT_MAX)
267 prevout = COutPoint(hashPrevTx, nOut);
268 scriptSig = scriptSigIn;
269 nSequence = nSequenceIn;
275 READWRITE(scriptSig);
276 READWRITE(nSequence);
281 return (nSequence == UINT_MAX);
284 friend bool operator==(const CTxIn& a, const CTxIn& b)
286 return (a.prevout == b.prevout &&
287 a.scriptSig == b.scriptSig &&
288 a.nSequence == b.nSequence);
291 friend bool operator!=(const CTxIn& a, const CTxIn& b)
296 std::string ToString() const
299 str += strprintf("CTxIn(");
300 str += prevout.ToString();
301 if (prevout.IsNull())
302 str += strprintf(", coinbase %s", HexStr(scriptSig).c_str());
304 str += strprintf(", scriptSig=%s", scriptSig.ToString().substr(0,24).c_str());
305 if (nSequence != UINT_MAX)
306 str += strprintf(", nSequence=%u", nSequence);
313 printf("%s\n", ToString().c_str());
321 // An output of a transaction. It contains the public key that the next input
322 // must be able to sign with to claim it.
328 CScript scriptPubKey;
335 CTxOut(int64 nValueIn, CScript scriptPubKeyIn)
338 scriptPubKey = scriptPubKeyIn;
344 READWRITE(scriptPubKey);
350 scriptPubKey.clear();
355 return (nValue == -1);
358 uint256 GetHash() const
360 return SerializeHash(*this);
363 friend bool operator==(const CTxOut& a, const CTxOut& b)
365 return (a.nValue == b.nValue &&
366 a.scriptPubKey == b.scriptPubKey);
369 friend bool operator!=(const CTxOut& a, const CTxOut& b)
374 std::string ToString() const
376 if (scriptPubKey.size() < 6)
377 return "CTxOut(error)";
378 return strprintf("CTxOut(nValue=%"PRI64d".%08"PRI64d", scriptPubKey=%s)", nValue / COIN, nValue % COIN, scriptPubKey.ToString().substr(0,30).c_str());
383 printf("%s\n", ToString().c_str());
391 // The basic transaction that is broadcasted on the network and contained in
392 // blocks. A transaction can contain multiple inputs and outputs.
398 std::vector<CTxIn> vin;
399 std::vector<CTxOut> vout;
400 unsigned int nLockTime;
402 // Denial-of-service detection:
404 bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
413 READWRITE(this->nVersion);
414 nVersion = this->nVersion;
417 READWRITE(nLockTime);
426 nDoS = 0; // Denial-of-service prevention
431 return (vin.empty() && vout.empty());
434 uint256 GetHash() const
436 return SerializeHash(*this);
439 bool IsFinal(int nBlockHeight=0, int64 nBlockTime=0) const
441 // Time based nLockTime implemented in 0.1.6
444 if (nBlockHeight == 0)
445 nBlockHeight = nBestHeight;
447 nBlockTime = GetAdjustedTime();
448 if ((int64)nLockTime < (nLockTime < LOCKTIME_THRESHOLD ? (int64)nBlockHeight : nBlockTime))
450 BOOST_FOREACH(const CTxIn& txin, vin)
456 bool IsNewerThan(const CTransaction& old) const
458 if (vin.size() != old.vin.size())
460 for (int i = 0; i < vin.size(); i++)
461 if (vin[i].prevout != old.vin[i].prevout)
465 unsigned int nLowest = UINT_MAX;
466 for (int i = 0; i < vin.size(); i++)
468 if (vin[i].nSequence != old.vin[i].nSequence)
470 if (vin[i].nSequence <= nLowest)
473 nLowest = vin[i].nSequence;
475 if (old.vin[i].nSequence < nLowest)
478 nLowest = old.vin[i].nSequence;
485 bool IsCoinBase() const
487 return (vin.size() == 1 && vin[0].prevout.IsNull());
490 int GetSigOpCount() const
493 BOOST_FOREACH(const CTxIn& txin, vin)
494 n += txin.scriptSig.GetSigOpCount();
495 BOOST_FOREACH(const CTxOut& txout, vout)
496 n += txout.scriptPubKey.GetSigOpCount();
500 bool IsStandard() const
502 BOOST_FOREACH(const CTxIn& txin, vin)
503 if (!txin.scriptSig.IsPushOnly())
504 return error("nonstandard txin: %s", txin.scriptSig.ToString().c_str());
505 BOOST_FOREACH(const CTxOut& txout, vout)
506 if (!::IsStandard(txout.scriptPubKey))
507 return error("nonstandard txout: %s", txout.scriptPubKey.ToString().c_str());
511 int64 GetValueOut() const
514 BOOST_FOREACH(const CTxOut& txout, vout)
516 nValueOut += txout.nValue;
517 if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))
518 throw std::runtime_error("CTransaction::GetValueOut() : value out of range");
523 static bool AllowFree(double dPriority)
525 // Large (in bytes) low-priority (new, small-coin) transactions
527 return dPriority > COIN * 144 / 250;
530 int64 GetMinFee(unsigned int nBlockSize=1, bool fAllowFree=true, bool fForRelay=false) const
532 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
533 int64 nBaseFee = fForRelay ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
535 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK);
536 unsigned int nNewBlockSize = nBlockSize + nBytes;
537 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
543 // Transactions under 10K are free
544 // (about 4500bc if made of 50bc inputs)
550 // Free transaction area
551 if (nNewBlockSize < 27000)
556 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
557 if (nMinFee < nBaseFee)
558 BOOST_FOREACH(const CTxOut& txout, vout)
559 if (txout.nValue < CENT)
562 // Raise the price as the block approaches full
563 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
565 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
567 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
570 if (!MoneyRange(nMinFee))
576 bool ReadFromDisk(CDiskTxPos pos, FILE** pfileRet=NULL)
578 CAutoFile filein = OpenBlockFile(pos.nFile, 0, pfileRet ? "rb+" : "rb");
580 return error("CTransaction::ReadFromDisk() : OpenBlockFile failed");
583 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
584 return error("CTransaction::ReadFromDisk() : fseek failed");
587 // Return file pointer
590 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
591 return error("CTransaction::ReadFromDisk() : second fseek failed");
592 *pfileRet = filein.release();
597 friend bool operator==(const CTransaction& a, const CTransaction& b)
599 return (a.nVersion == b.nVersion &&
602 a.nLockTime == b.nLockTime);
605 friend bool operator!=(const CTransaction& a, const CTransaction& b)
611 std::string ToString() const
614 str += strprintf("CTransaction(hash=%s, ver=%d, vin.size=%d, vout.size=%d, nLockTime=%d)\n",
615 GetHash().ToString().substr(0,10).c_str(),
620 for (int i = 0; i < vin.size(); i++)
621 str += " " + vin[i].ToString() + "\n";
622 for (int i = 0; i < vout.size(); i++)
623 str += " " + vout[i].ToString() + "\n";
629 printf("%s", ToString().c_str());
633 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet);
634 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout);
635 bool ReadFromDisk(COutPoint prevout);
636 bool DisconnectInputs(CTxDB& txdb);
637 bool ConnectInputs(CTxDB& txdb, std::map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
638 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee=0);
639 bool ClientConnectInputs();
640 bool CheckTransaction() const;
641 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true, bool* pfMissingInputs=NULL);
642 bool AcceptToMemoryPool(bool fCheckInputs=true, bool* pfMissingInputs=NULL);
644 bool AddToMemoryPoolUnchecked();
646 bool RemoveFromMemoryPool();
654 // A transaction with a merkle branch linking it to the block chain
656 class CMerkleTx : public CTransaction
660 std::vector<uint256> vMerkleBranch;
664 mutable char fMerkleVerified;
672 CMerkleTx(const CTransaction& txIn) : CTransaction(txIn)
681 fMerkleVerified = false;
687 nSerSize += SerReadWrite(s, *(CTransaction*)this, nType, nVersion, ser_action);
688 nVersion = this->nVersion;
689 READWRITE(hashBlock);
690 READWRITE(vMerkleBranch);
695 int SetMerkleBranch(const CBlock* pblock=NULL);
696 int GetDepthInMainChain(int& nHeightRet) const;
697 int GetDepthInMainChain() const { int nHeight; return GetDepthInMainChain(nHeight); }
698 bool IsInMainChain() const { return GetDepthInMainChain() > 0; }
699 int GetBlocksToMaturity() const;
700 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true);
701 bool AcceptToMemoryPool();
708 // A txdb record that contains the disk location of a transaction and the
709 // locations of transactions that spend its outputs. vSpent is really only
710 // used as a flag, but having the location is very helpful for debugging.
716 std::vector<CDiskTxPos> vSpent;
723 CTxIndex(const CDiskTxPos& posIn, unsigned int nOutputs)
726 vSpent.resize(nOutputs);
731 if (!(nType & SER_GETHASH))
748 friend bool operator==(const CTxIndex& a, const CTxIndex& b)
750 return (a.pos == b.pos &&
751 a.vSpent == b.vSpent);
754 friend bool operator!=(const CTxIndex& a, const CTxIndex& b)
758 int GetDepthInMainChain() const;
766 // Nodes collect new transactions into a block, hash them into a hash tree,
767 // and scan through nonce values to make the block's hash satisfy proof-of-work
768 // requirements. When they solve the proof-of-work, they broadcast the block
769 // to everyone and the block is added to the block chain. The first transaction
770 // in the block is a special one that creates a new coin owned by the creator
773 // Blocks are appended to blk0001.dat files on disk. Their location on disk
774 // is indexed by CBlockIndex objects in memory.
781 uint256 hashPrevBlock;
782 uint256 hashMerkleRoot;
788 std::vector<CTransaction> vtx;
791 mutable std::vector<uint256> vMerkleTree;
793 // Denial-of-service detection:
795 bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
804 READWRITE(this->nVersion);
805 nVersion = this->nVersion;
806 READWRITE(hashPrevBlock);
807 READWRITE(hashMerkleRoot);
812 // ConnectBlock depends on vtx being last so it can calculate offset
813 if (!(nType & (SER_GETHASH|SER_BLOCKHEADERONLY)))
816 const_cast<CBlock*>(this)->vtx.clear();
837 uint256 GetHash() const
839 return Hash(BEGIN(nVersion), END(nNonce));
842 int64 GetBlockTime() const
847 int GetSigOpCount() const
850 BOOST_FOREACH(const CTransaction& tx, vtx)
851 n += tx.GetSigOpCount();
856 uint256 BuildMerkleTree() const
859 BOOST_FOREACH(const CTransaction& tx, vtx)
860 vMerkleTree.push_back(tx.GetHash());
862 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
864 for (int i = 0; i < nSize; i += 2)
866 int i2 = std::min(i+1, nSize-1);
867 vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),
868 BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));
872 return (vMerkleTree.empty() ? 0 : vMerkleTree.back());
875 std::vector<uint256> GetMerkleBranch(int nIndex) const
877 if (vMerkleTree.empty())
879 std::vector<uint256> vMerkleBranch;
881 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
883 int i = std::min(nIndex^1, nSize-1);
884 vMerkleBranch.push_back(vMerkleTree[j+i]);
888 return vMerkleBranch;
891 static uint256 CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)
895 BOOST_FOREACH(const uint256& otherside, vMerkleBranch)
898 hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));
900 hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));
907 bool WriteToDisk(unsigned int& nFileRet, unsigned int& nBlockPosRet)
909 // Open history file to append
910 CAutoFile fileout = AppendBlockFile(nFileRet);
912 return error("CBlock::WriteToDisk() : AppendBlockFile failed");
914 // Write index header
915 unsigned int nSize = fileout.GetSerializeSize(*this);
916 fileout << FLATDATA(pchMessageStart) << nSize;
919 nBlockPosRet = ftell(fileout);
920 if (nBlockPosRet == -1)
921 return error("CBlock::WriteToDisk() : ftell failed");
924 // Flush stdio buffers and commit to disk before returning
926 if (!IsInitialBlockDownload() || (nBestHeight+1) % 500 == 0)
929 _commit(_fileno(fileout));
931 fsync(fileno(fileout));
938 bool ReadFromDisk(unsigned int nFile, unsigned int nBlockPos, bool fReadTransactions=true)
942 // Open history file to read
943 CAutoFile filein = OpenBlockFile(nFile, nBlockPos, "rb");
945 return error("CBlock::ReadFromDisk() : OpenBlockFile failed");
946 if (!fReadTransactions)
947 filein.nType |= SER_BLOCKHEADERONLY;
953 if (!CheckProofOfWork(GetHash(), nBits))
954 return error("CBlock::ReadFromDisk() : errors in block header");
963 printf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%d)\n",
964 GetHash().ToString().substr(0,20).c_str(),
966 hashPrevBlock.ToString().substr(0,20).c_str(),
967 hashMerkleRoot.ToString().substr(0,10).c_str(),
968 nTime, nBits, nNonce,
970 for (int i = 0; i < vtx.size(); i++)
975 printf(" vMerkleTree: ");
976 for (int i = 0; i < vMerkleTree.size(); i++)
977 printf("%s ", vMerkleTree[i].ToString().substr(0,10).c_str());
982 bool DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex);
983 bool ConnectBlock(CTxDB& txdb, CBlockIndex* pindex);
984 bool ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions=true);
985 bool SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew);
986 bool AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos);
987 bool CheckBlock() const;
997 // The block chain is a tree shaped structure starting with the
998 // genesis block at the root, with each block potentially having multiple
999 // candidates to be the next block. pprev and pnext link a path through the
1000 // main/longest chain. A blockindex may have multiple pprev pointing back
1001 // to it, but pnext will only point forward to the longest branch, or will
1002 // be null if the block is not part of the longest chain.
1007 const uint256* phashBlock;
1011 unsigned int nBlockPos;
1013 CBigNum bnChainWork;
1017 uint256 hashMerkleRoot;
1020 unsigned int nNonce;
1040 CBlockIndex(unsigned int nFileIn, unsigned int nBlockPosIn, CBlock& block)
1046 nBlockPos = nBlockPosIn;
1050 nVersion = block.nVersion;
1051 hashMerkleRoot = block.hashMerkleRoot;
1052 nTime = block.nTime;
1053 nBits = block.nBits;
1054 nNonce = block.nNonce;
1057 CBlock GetBlockHeader() const
1060 block.nVersion = nVersion;
1062 block.hashPrevBlock = pprev->GetBlockHash();
1063 block.hashMerkleRoot = hashMerkleRoot;
1064 block.nTime = nTime;
1065 block.nBits = nBits;
1066 block.nNonce = nNonce;
1070 uint256 GetBlockHash() const
1075 int64 GetBlockTime() const
1077 return (int64)nTime;
1080 CBigNum GetBlockWork() const
1083 bnTarget.SetCompact(nBits);
1086 return (CBigNum(1)<<256) / (bnTarget+1);
1089 bool IsInMainChain() const
1091 return (pnext || this == pindexBest);
1094 bool CheckIndex() const
1096 return CheckProofOfWork(GetBlockHash(), nBits);
1099 bool EraseBlockFromDisk()
1101 // Open history file
1102 CAutoFile fileout = OpenBlockFile(nFile, nBlockPos, "rb+");
1106 // Overwrite with empty null block
1114 enum { nMedianTimeSpan=11 };
1116 int64 GetMedianTimePast() const
1118 int64 pmedian[nMedianTimeSpan];
1119 int64* pbegin = &pmedian[nMedianTimeSpan];
1120 int64* pend = &pmedian[nMedianTimeSpan];
1122 const CBlockIndex* pindex = this;
1123 for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
1124 *(--pbegin) = pindex->GetBlockTime();
1126 std::sort(pbegin, pend);
1127 return pbegin[(pend - pbegin)/2];
1130 int64 GetMedianTime() const
1132 const CBlockIndex* pindex = this;
1133 for (int i = 0; i < nMedianTimeSpan/2; i++)
1136 return GetBlockTime();
1137 pindex = pindex->pnext;
1139 return pindex->GetMedianTimePast();
1144 std::string ToString() const
1146 return strprintf("CBlockIndex(nprev=%08x, pnext=%08x, nFile=%d, nBlockPos=%-6d nHeight=%d, merkle=%s, hashBlock=%s)",
1147 pprev, pnext, nFile, nBlockPos, nHeight,
1148 hashMerkleRoot.ToString().substr(0,10).c_str(),
1149 GetBlockHash().ToString().substr(0,20).c_str());
1154 printf("%s\n", ToString().c_str());
1161 // Used to marshal pointers into hashes for db storage.
1163 class CDiskBlockIndex : public CBlockIndex
1175 explicit CDiskBlockIndex(CBlockIndex* pindex) : CBlockIndex(*pindex)
1177 hashPrev = (pprev ? pprev->GetBlockHash() : 0);
1178 hashNext = (pnext ? pnext->GetBlockHash() : 0);
1183 if (!(nType & SER_GETHASH))
1184 READWRITE(nVersion);
1186 READWRITE(hashNext);
1188 READWRITE(nBlockPos);
1192 READWRITE(this->nVersion);
1193 READWRITE(hashPrev);
1194 READWRITE(hashMerkleRoot);
1200 uint256 GetBlockHash() const
1203 block.nVersion = nVersion;
1204 block.hashPrevBlock = hashPrev;
1205 block.hashMerkleRoot = hashMerkleRoot;
1206 block.nTime = nTime;
1207 block.nBits = nBits;
1208 block.nNonce = nNonce;
1209 return block.GetHash();
1213 std::string ToString() const
1215 std::string str = "CDiskBlockIndex(";
1216 str += CBlockIndex::ToString();
1217 str += strprintf("\n hashBlock=%s, hashPrev=%s, hashNext=%s)",
1218 GetBlockHash().ToString().c_str(),
1219 hashPrev.ToString().substr(0,20).c_str(),
1220 hashNext.ToString().substr(0,20).c_str());
1226 printf("%s\n", ToString().c_str());
1238 // Describes a place in the block chain to another node such that if the
1239 // other node doesn't have the same branch, it can find a recent common trunk.
1240 // The further back it is, the further before the fork it may be.
1245 std::vector<uint256> vHave;
1252 explicit CBlockLocator(const CBlockIndex* pindex)
1257 explicit CBlockLocator(uint256 hashBlock)
1259 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
1260 if (mi != mapBlockIndex.end())
1266 if (!(nType & SER_GETHASH))
1267 READWRITE(nVersion);
1278 return vHave.empty();
1281 void Set(const CBlockIndex* pindex)
1287 vHave.push_back(pindex->GetBlockHash());
1289 // Exponentially larger steps back
1290 for (int i = 0; pindex && i < nStep; i++)
1291 pindex = pindex->pprev;
1292 if (vHave.size() > 10)
1295 vHave.push_back(hashGenesisBlock);
1298 int GetDistanceBack()
1300 // Retrace how far back it was in the sender's branch
1303 BOOST_FOREACH(const uint256& hash, vHave)
1305 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1306 if (mi != mapBlockIndex.end())
1308 CBlockIndex* pindex = (*mi).second;
1309 if (pindex->IsInMainChain())
1319 CBlockIndex* GetBlockIndex()
1321 // Find the first block the caller has in the main chain
1322 BOOST_FOREACH(const uint256& hash, vHave)
1324 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1325 if (mi != mapBlockIndex.end())
1327 CBlockIndex* pindex = (*mi).second;
1328 if (pindex->IsInMainChain())
1332 return pindexGenesisBlock;
1335 uint256 GetBlockHash()
1337 // Find the first block the caller has in the main chain
1338 BOOST_FOREACH(const uint256& hash, vHave)
1340 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1341 if (mi != mapBlockIndex.end())
1343 CBlockIndex* pindex = (*mi).second;
1344 if (pindex->IsInMainChain())
1348 return hashGenesisBlock;
1353 CBlockIndex* pindex = GetBlockIndex();
1356 return pindex->nHeight;
1369 // Alerts are for notifying old versions if they become too obsolete and
1370 // need to upgrade. The message is displayed in the status bar.
1371 // Alert messages are broadcast as a vector of signed data. Unserializing may
1372 // not read the entire buffer if the alert is for a newer version, but older
1373 // versions can still relay the original data.
1375 class CUnsignedAlert
1379 int64 nRelayUntil; // when newer nodes stop relaying to newer nodes
1383 std::set<int> setCancel;
1384 int nMinVer; // lowest version inclusive
1385 int nMaxVer; // highest version inclusive
1386 std::set<std::string> setSubVer; // empty matches all
1390 std::string strComment;
1391 std::string strStatusBar;
1392 std::string strReserved;
1396 READWRITE(this->nVersion);
1397 nVersion = this->nVersion;
1398 READWRITE(nRelayUntil);
1399 READWRITE(nExpiration);
1402 READWRITE(setCancel);
1405 READWRITE(setSubVer);
1406 READWRITE(nPriority);
1408 READWRITE(strComment);
1409 READWRITE(strStatusBar);
1410 READWRITE(strReserved);
1427 strStatusBar.clear();
1428 strReserved.clear();
1431 std::string ToString() const
1433 std::string strSetCancel;
1434 BOOST_FOREACH(int n, setCancel)
1435 strSetCancel += strprintf("%d ", n);
1436 std::string strSetSubVer;
1437 BOOST_FOREACH(std::string str, setSubVer)
1438 strSetSubVer += "\"" + str + "\" ";
1442 " nRelayUntil = %"PRI64d"\n"
1443 " nExpiration = %"PRI64d"\n"
1451 " strComment = \"%s\"\n"
1452 " strStatusBar = \"%s\"\n"
1459 strSetCancel.c_str(),
1462 strSetSubVer.c_str(),
1465 strStatusBar.c_str());
1470 printf("%s", ToString().c_str());
1474 class CAlert : public CUnsignedAlert
1477 std::vector<unsigned char> vchMsg;
1478 std::vector<unsigned char> vchSig;
1493 CUnsignedAlert::SetNull();
1500 return (nExpiration == 0);
1503 uint256 GetHash() const
1505 return SerializeHash(*this);
1508 bool IsInEffect() const
1510 return (GetAdjustedTime() < nExpiration);
1513 bool Cancels(const CAlert& alert) const
1516 return false; // this was a no-op before 31403
1517 return (alert.nID <= nCancel || setCancel.count(alert.nID));
1520 bool AppliesTo(int nVersion, std::string strSubVerIn) const
1522 return (IsInEffect() &&
1523 nMinVer <= nVersion && nVersion <= nMaxVer &&
1524 (setSubVer.empty() || setSubVer.count(strSubVerIn)));
1527 bool AppliesToMe() const
1529 return AppliesTo(VERSION, ::pszSubVer);
1532 bool RelayTo(CNode* pnode) const
1536 // returns true if wasn't already contained in the set
1537 if (pnode->setKnown.insert(GetHash()).second)
1539 if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||
1541 GetAdjustedTime() < nRelayUntil)
1543 pnode->PushMessage("alert", *this);
1550 bool CheckSignature()
1553 if (!key.SetPubKey(ParseHex("04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284")))
1554 return error("CAlert::CheckSignature() : SetPubKey failed");
1555 if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))
1556 return error("CAlert::CheckSignature() : verify signature failed");
1558 // Now unserialize the data
1559 CDataStream sMsg(vchMsg);
1560 sMsg >> *(CUnsignedAlert*)this;
1564 bool ProcessAlert();