1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 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 int MAX_ORPHAN_TRANSACTIONS = MAX_BLOCK_SIZE/100;
34 static const int64 COIN = 100000000;
35 static const int64 CENT = 1000000;
36 static const int64 MIN_TX_FEE = 50000;
37 static const int64 MIN_RELAY_TX_FEE = 10000;
38 static const int64 MAX_MONEY = 21000000 * COIN;
39 inline bool MoneyRange(int64 nValue) { return (nValue >= 0 && nValue <= MAX_MONEY); }
40 static const int COINBASE_MATURITY = 100;
41 // Threshold for nLockTime: below this value it is interpreted as block number, otherwise as UNIX timestamp.
42 static const int LOCKTIME_THRESHOLD = 500000000; // Tue Nov 5 00:53:20 1985 UTC
44 static const int fHaveUPnP = true;
46 static const int fHaveUPnP = false;
54 extern CCriticalSection cs_main;
55 extern std::map<uint256, CBlockIndex*> mapBlockIndex;
56 extern uint256 hashGenesisBlock;
57 extern CBlockIndex* pindexGenesisBlock;
58 extern int nBestHeight;
59 extern CBigNum bnBestChainWork;
60 extern CBigNum bnBestInvalidWork;
61 extern uint256 hashBestChain;
62 extern CBlockIndex* pindexBest;
63 extern unsigned int nTransactionsUpdated;
64 extern double dHashesPerSec;
65 extern int64 nHPSTimerStart;
66 extern int64 nTimeBestReceived;
67 extern CCriticalSection cs_setpwalletRegistered;
68 extern std::set<CWallet*> setpwalletRegistered;
71 extern int fGenerateBitcoins;
72 extern int64 nTransactionFee;
73 extern int fLimitProcessors;
74 extern int nLimitProcessors;
75 extern int fMinimizeToTray;
76 extern int fMinimizeOnClose;
87 void RegisterWallet(CWallet* pwalletIn);
88 void UnregisterWallet(CWallet* pwalletIn);
89 bool CheckDiskSpace(uint64 nAdditionalBytes=0);
90 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode="rb");
91 FILE* AppendBlockFile(unsigned int& nFileRet);
92 bool LoadBlockIndex(bool fAllowNew=true);
93 void PrintBlockTree();
94 bool ProcessMessages(CNode* pfrom);
95 bool SendMessages(CNode* pto, bool fSendTrickle);
96 void GenerateBitcoins(bool fGenerate, CWallet* pwallet);
97 CBlock* CreateNewBlock(CReserveKey& reservekey);
98 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce);
99 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1);
100 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey);
101 bool CheckProofOfWork(uint256 hash, unsigned int nBits);
102 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime);
103 bool IsInitialBlockDownload();
104 std::string GetWarnings(std::string strFor);
117 bool GetWalletFile(CWallet* pwallet, std::string &strWalletFileOut);
120 bool WriteSetting(const std::string& strKey, const T& value)
123 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
125 std::string strWalletFile;
126 if (!GetWalletFile(pwallet, strWalletFile))
128 fOk |= CWalletDB(strWalletFile).WriteSetting(strKey, value);
138 unsigned int nBlockPos;
146 CDiskTxPos(unsigned int nFileIn, unsigned int nBlockPosIn, unsigned int nTxPosIn)
149 nBlockPos = nBlockPosIn;
153 IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
154 void SetNull() { nFile = -1; nBlockPos = 0; nTxPos = 0; }
155 bool IsNull() const { return (nFile == -1); }
157 friend bool operator==(const CDiskTxPos& a, const CDiskTxPos& b)
159 return (a.nFile == b.nFile &&
160 a.nBlockPos == b.nBlockPos &&
161 a.nTxPos == b.nTxPos);
164 friend bool operator!=(const CDiskTxPos& a, const CDiskTxPos& b)
169 std::string ToString() const
172 return strprintf("null");
174 return strprintf("(nFile=%d, nBlockPos=%d, nTxPos=%d)", nFile, nBlockPos, nTxPos);
179 printf("%s", ToString().c_str());
192 CInPoint() { SetNull(); }
193 CInPoint(CTransaction* ptxIn, unsigned int nIn) { ptx = ptxIn; n = nIn; }
194 void SetNull() { ptx = NULL; n = -1; }
195 bool IsNull() const { return (ptx == NULL && n == -1); }
207 COutPoint() { SetNull(); }
208 COutPoint(uint256 hashIn, unsigned int nIn) { hash = hashIn; n = nIn; }
209 IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
210 void SetNull() { hash = 0; n = -1; }
211 bool IsNull() const { return (hash == 0 && n == -1); }
213 friend bool operator<(const COutPoint& a, const COutPoint& b)
215 return (a.hash < b.hash || (a.hash == b.hash && a.n < b.n));
218 friend bool operator==(const COutPoint& a, const COutPoint& b)
220 return (a.hash == b.hash && a.n == b.n);
223 friend bool operator!=(const COutPoint& a, const COutPoint& b)
228 std::string ToString() const
230 return strprintf("COutPoint(%s, %d)", hash.ToString().substr(0,10).c_str(), n);
235 printf("%s\n", ToString().c_str());
243 // An input of a transaction. It contains the location of the previous
244 // transaction's output that it claims and a signature that matches the
245 // output's public key.
252 unsigned int nSequence;
256 nSequence = UINT_MAX;
259 explicit CTxIn(COutPoint prevoutIn, CScript scriptSigIn=CScript(), unsigned int nSequenceIn=UINT_MAX)
262 scriptSig = scriptSigIn;
263 nSequence = nSequenceIn;
266 CTxIn(uint256 hashPrevTx, unsigned int nOut, CScript scriptSigIn=CScript(), unsigned int nSequenceIn=UINT_MAX)
268 prevout = COutPoint(hashPrevTx, nOut);
269 scriptSig = scriptSigIn;
270 nSequence = nSequenceIn;
276 READWRITE(scriptSig);
277 READWRITE(nSequence);
282 return (nSequence == UINT_MAX);
285 friend bool operator==(const CTxIn& a, const CTxIn& b)
287 return (a.prevout == b.prevout &&
288 a.scriptSig == b.scriptSig &&
289 a.nSequence == b.nSequence);
292 friend bool operator!=(const CTxIn& a, const CTxIn& b)
297 std::string ToString() const
300 str += strprintf("CTxIn(");
301 str += prevout.ToString();
302 if (prevout.IsNull())
303 str += strprintf(", coinbase %s", HexStr(scriptSig).c_str());
305 str += strprintf(", scriptSig=%s", scriptSig.ToString().substr(0,24).c_str());
306 if (nSequence != UINT_MAX)
307 str += strprintf(", nSequence=%u", nSequence);
314 printf("%s\n", ToString().c_str());
322 // An output of a transaction. It contains the public key that the next input
323 // must be able to sign with to claim it.
329 CScript scriptPubKey;
336 CTxOut(int64 nValueIn, CScript scriptPubKeyIn)
339 scriptPubKey = scriptPubKeyIn;
345 READWRITE(scriptPubKey);
351 scriptPubKey.clear();
356 return (nValue == -1);
359 uint256 GetHash() const
361 return SerializeHash(*this);
364 friend bool operator==(const CTxOut& a, const CTxOut& b)
366 return (a.nValue == b.nValue &&
367 a.scriptPubKey == b.scriptPubKey);
370 friend bool operator!=(const CTxOut& a, const CTxOut& b)
375 std::string ToString() const
377 if (scriptPubKey.size() < 6)
378 return "CTxOut(error)";
379 return strprintf("CTxOut(nValue=%"PRI64d".%08"PRI64d", scriptPubKey=%s)", nValue / COIN, nValue % COIN, scriptPubKey.ToString().substr(0,30).c_str());
384 printf("%s\n", ToString().c_str());
392 // The basic transaction that is broadcasted on the network and contained in
393 // blocks. A transaction can contain multiple inputs and outputs.
399 std::vector<CTxIn> vin;
400 std::vector<CTxOut> vout;
401 unsigned int nLockTime;
411 READWRITE(this->nVersion);
412 nVersion = this->nVersion;
415 READWRITE(nLockTime);
428 return (vin.empty() && vout.empty());
431 uint256 GetHash() const
433 return SerializeHash(*this);
436 bool IsFinal(int nBlockHeight=0, int64 nBlockTime=0) const
438 // Time based nLockTime implemented in 0.1.6
441 if (nBlockHeight == 0)
442 nBlockHeight = nBestHeight;
444 nBlockTime = GetAdjustedTime();
445 if ((int64)nLockTime < (nLockTime < LOCKTIME_THRESHOLD ? (int64)nBlockHeight : nBlockTime))
447 BOOST_FOREACH(const CTxIn& txin, vin)
453 bool IsNewerThan(const CTransaction& old) const
455 if (vin.size() != old.vin.size())
457 for (int i = 0; i < vin.size(); i++)
458 if (vin[i].prevout != old.vin[i].prevout)
462 unsigned int nLowest = UINT_MAX;
463 for (int i = 0; i < vin.size(); i++)
465 if (vin[i].nSequence != old.vin[i].nSequence)
467 if (vin[i].nSequence <= nLowest)
470 nLowest = vin[i].nSequence;
472 if (old.vin[i].nSequence < nLowest)
475 nLowest = old.vin[i].nSequence;
482 bool IsCoinBase() const
484 return (vin.size() == 1 && vin[0].prevout.IsNull());
487 int GetSigOpCount() const
490 BOOST_FOREACH(const CTxIn& txin, vin)
491 n += txin.scriptSig.GetSigOpCount();
492 BOOST_FOREACH(const CTxOut& txout, vout)
493 n += txout.scriptPubKey.GetSigOpCount();
497 bool IsStandard() const
499 BOOST_FOREACH(const CTxIn& txin, vin)
500 if (!txin.scriptSig.IsPushOnly())
501 return error("nonstandard txin: %s", txin.scriptSig.ToString().c_str());
502 BOOST_FOREACH(const CTxOut& txout, vout)
503 if (!::IsStandard(txout.scriptPubKey))
504 return error("nonstandard txout: %s", txout.scriptPubKey.ToString().c_str());
508 int64 GetValueOut() const
511 BOOST_FOREACH(const CTxOut& txout, vout)
513 nValueOut += txout.nValue;
514 if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))
515 throw std::runtime_error("CTransaction::GetValueOut() : value out of range");
520 static bool AllowFree(double dPriority)
522 // Large (in bytes) low-priority (new, small-coin) transactions
524 return dPriority > COIN * 144 / 250;
527 int64 GetMinFee(unsigned int nBlockSize=1, bool fAllowFree=true, bool fForRelay=false) const
529 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
530 int64 nBaseFee = fForRelay ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
532 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK);
533 unsigned int nNewBlockSize = nBlockSize + nBytes;
534 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
540 // Transactions under 10K are free
541 // (about 4500bc if made of 50bc inputs)
547 // Free transaction area
548 if (nNewBlockSize < 27000)
553 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
554 if (nMinFee < nBaseFee)
555 BOOST_FOREACH(const CTxOut& txout, vout)
556 if (txout.nValue < CENT)
559 // Raise the price as the block approaches full
560 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
562 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
564 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
567 if (!MoneyRange(nMinFee))
573 bool ReadFromDisk(CDiskTxPos pos, FILE** pfileRet=NULL)
575 CAutoFile filein = OpenBlockFile(pos.nFile, 0, pfileRet ? "rb+" : "rb");
577 return error("CTransaction::ReadFromDisk() : OpenBlockFile failed");
580 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
581 return error("CTransaction::ReadFromDisk() : fseek failed");
584 // Return file pointer
587 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
588 return error("CTransaction::ReadFromDisk() : second fseek failed");
589 *pfileRet = filein.release();
594 friend bool operator==(const CTransaction& a, const CTransaction& b)
596 return (a.nVersion == b.nVersion &&
599 a.nLockTime == b.nLockTime);
602 friend bool operator!=(const CTransaction& a, const CTransaction& b)
608 std::string ToString() const
611 str += strprintf("CTransaction(hash=%s, ver=%d, vin.size=%d, vout.size=%d, nLockTime=%d)\n",
612 GetHash().ToString().substr(0,10).c_str(),
617 for (int i = 0; i < vin.size(); i++)
618 str += " " + vin[i].ToString() + "\n";
619 for (int i = 0; i < vout.size(); i++)
620 str += " " + vout[i].ToString() + "\n";
626 printf("%s", ToString().c_str());
630 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet);
631 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout);
632 bool ReadFromDisk(COutPoint prevout);
633 bool DisconnectInputs(CTxDB& txdb);
634 bool ConnectInputs(CTxDB& txdb, std::map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
635 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee,
637 bool ClientConnectInputs();
638 bool CheckTransaction() const;
639 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true, bool* pfMissingInputs=NULL);
640 bool AcceptToMemoryPool(bool fCheckInputs=true, bool* pfMissingInputs=NULL);
642 bool AddToMemoryPoolUnchecked();
644 bool RemoveFromMemoryPool();
652 // A transaction with a merkle branch linking it to the block chain
654 class CMerkleTx : public CTransaction
658 std::vector<uint256> vMerkleBranch;
662 mutable char fMerkleVerified;
670 CMerkleTx(const CTransaction& txIn) : CTransaction(txIn)
679 fMerkleVerified = false;
685 nSerSize += SerReadWrite(s, *(CTransaction*)this, nType, nVersion, ser_action);
686 nVersion = this->nVersion;
687 READWRITE(hashBlock);
688 READWRITE(vMerkleBranch);
693 int SetMerkleBranch(const CBlock* pblock=NULL);
694 int GetDepthInMainChain(int& nHeightRet) const;
695 int GetDepthInMainChain() const { int nHeight; return GetDepthInMainChain(nHeight); }
696 bool IsInMainChain() const { return GetDepthInMainChain() > 0; }
697 int GetBlocksToMaturity() const;
698 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true);
699 bool AcceptToMemoryPool();
706 // A txdb record that contains the disk location of a transaction and the
707 // locations of transactions that spend its outputs. vSpent is really only
708 // used as a flag, but having the location is very helpful for debugging.
714 std::vector<CDiskTxPos> vSpent;
721 CTxIndex(const CDiskTxPos& posIn, unsigned int nOutputs)
724 vSpent.resize(nOutputs);
729 if (!(nType & SER_GETHASH))
746 friend bool operator==(const CTxIndex& a, const CTxIndex& b)
748 return (a.pos == b.pos &&
749 a.vSpent == b.vSpent);
752 friend bool operator!=(const CTxIndex& a, const CTxIndex& b)
756 int GetDepthInMainChain() const;
764 // Nodes collect new transactions into a block, hash them into a hash tree,
765 // and scan through nonce values to make the block's hash satisfy proof-of-work
766 // requirements. When they solve the proof-of-work, they broadcast the block
767 // to everyone and the block is added to the block chain. The first transaction
768 // in the block is a special one that creates a new coin owned by the creator
771 // Blocks are appended to blk0001.dat files on disk. Their location on disk
772 // is indexed by CBlockIndex objects in memory.
779 uint256 hashPrevBlock;
780 uint256 hashMerkleRoot;
786 std::vector<CTransaction> vtx;
789 mutable std::vector<uint256> vMerkleTree;
799 READWRITE(this->nVersion);
800 nVersion = this->nVersion;
801 READWRITE(hashPrevBlock);
802 READWRITE(hashMerkleRoot);
807 // ConnectBlock depends on vtx being last so it can calculate offset
808 if (!(nType & (SER_GETHASH|SER_BLOCKHEADERONLY)))
811 const_cast<CBlock*>(this)->vtx.clear();
831 uint256 GetHash() const
833 return Hash(BEGIN(nVersion), END(nNonce));
836 int64 GetBlockTime() const
841 int GetSigOpCount() const
844 BOOST_FOREACH(const CTransaction& tx, vtx)
845 n += tx.GetSigOpCount();
849 void UpdateTime(const CBlockIndex* pindexPrev);
852 uint256 BuildMerkleTree() const
855 BOOST_FOREACH(const CTransaction& tx, vtx)
856 vMerkleTree.push_back(tx.GetHash());
858 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
860 for (int i = 0; i < nSize; i += 2)
862 int i2 = std::min(i+1, nSize-1);
863 vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),
864 BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));
868 return (vMerkleTree.empty() ? 0 : vMerkleTree.back());
871 std::vector<uint256> GetMerkleBranch(int nIndex) const
873 if (vMerkleTree.empty())
875 std::vector<uint256> vMerkleBranch;
877 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
879 int i = std::min(nIndex^1, nSize-1);
880 vMerkleBranch.push_back(vMerkleTree[j+i]);
884 return vMerkleBranch;
887 static uint256 CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)
891 BOOST_FOREACH(const uint256& otherside, vMerkleBranch)
894 hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));
896 hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));
903 bool WriteToDisk(unsigned int& nFileRet, unsigned int& nBlockPosRet)
905 // Open history file to append
906 CAutoFile fileout = AppendBlockFile(nFileRet);
908 return error("CBlock::WriteToDisk() : AppendBlockFile failed");
910 // Write index header
911 unsigned int nSize = fileout.GetSerializeSize(*this);
912 fileout << FLATDATA(pchMessageStart) << nSize;
915 nBlockPosRet = ftell(fileout);
916 if (nBlockPosRet == -1)
917 return error("CBlock::WriteToDisk() : ftell failed");
920 // Flush stdio buffers and commit to disk before returning
922 if (!IsInitialBlockDownload() || (nBestHeight+1) % 500 == 0)
925 _commit(_fileno(fileout));
927 fsync(fileno(fileout));
934 bool ReadFromDisk(unsigned int nFile, unsigned int nBlockPos, bool fReadTransactions=true)
938 // Open history file to read
939 CAutoFile filein = OpenBlockFile(nFile, nBlockPos, "rb");
941 return error("CBlock::ReadFromDisk() : OpenBlockFile failed");
942 if (!fReadTransactions)
943 filein.nType |= SER_BLOCKHEADERONLY;
949 if (!CheckProofOfWork(GetHash(), nBits))
950 return error("CBlock::ReadFromDisk() : errors in block header");
959 printf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%d)\n",
960 GetHash().ToString().substr(0,20).c_str(),
962 hashPrevBlock.ToString().substr(0,20).c_str(),
963 hashMerkleRoot.ToString().substr(0,10).c_str(),
964 nTime, nBits, nNonce,
966 for (int i = 0; i < vtx.size(); i++)
971 printf(" vMerkleTree: ");
972 for (int i = 0; i < vMerkleTree.size(); i++)
973 printf("%s ", vMerkleTree[i].ToString().substr(0,10).c_str());
978 bool DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex);
979 bool ConnectBlock(CTxDB& txdb, CBlockIndex* pindex);
980 bool ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions=true);
981 bool SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew);
982 bool AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos);
983 bool CheckBlock() const;
993 // The block chain is a tree shaped structure starting with the
994 // genesis block at the root, with each block potentially having multiple
995 // candidates to be the next block. pprev and pnext link a path through the
996 // main/longest chain. A blockindex may have multiple pprev pointing back
997 // to it, but pnext will only point forward to the longest branch, or will
998 // be null if the block is not part of the longest chain.
1003 const uint256* phashBlock;
1007 unsigned int nBlockPos;
1009 CBigNum bnChainWork;
1013 uint256 hashMerkleRoot;
1016 unsigned int nNonce;
1036 CBlockIndex(unsigned int nFileIn, unsigned int nBlockPosIn, CBlock& block)
1042 nBlockPos = nBlockPosIn;
1046 nVersion = block.nVersion;
1047 hashMerkleRoot = block.hashMerkleRoot;
1048 nTime = block.nTime;
1049 nBits = block.nBits;
1050 nNonce = block.nNonce;
1053 CBlock GetBlockHeader() const
1056 block.nVersion = nVersion;
1058 block.hashPrevBlock = pprev->GetBlockHash();
1059 block.hashMerkleRoot = hashMerkleRoot;
1060 block.nTime = nTime;
1061 block.nBits = nBits;
1062 block.nNonce = nNonce;
1066 uint256 GetBlockHash() const
1071 int64 GetBlockTime() const
1073 return (int64)nTime;
1076 CBigNum GetBlockWork() const
1079 bnTarget.SetCompact(nBits);
1082 return (CBigNum(1)<<256) / (bnTarget+1);
1085 bool IsInMainChain() const
1087 return (pnext || this == pindexBest);
1090 bool CheckIndex() const
1092 return CheckProofOfWork(GetBlockHash(), nBits);
1095 bool EraseBlockFromDisk()
1097 // Open history file
1098 CAutoFile fileout = OpenBlockFile(nFile, nBlockPos, "rb+");
1102 // Overwrite with empty null block
1110 enum { nMedianTimeSpan=11 };
1112 int64 GetMedianTimePast() const
1114 int64 pmedian[nMedianTimeSpan];
1115 int64* pbegin = &pmedian[nMedianTimeSpan];
1116 int64* pend = &pmedian[nMedianTimeSpan];
1118 const CBlockIndex* pindex = this;
1119 for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
1120 *(--pbegin) = pindex->GetBlockTime();
1122 std::sort(pbegin, pend);
1123 return pbegin[(pend - pbegin)/2];
1126 int64 GetMedianTime() const
1128 const CBlockIndex* pindex = this;
1129 for (int i = 0; i < nMedianTimeSpan/2; i++)
1132 return GetBlockTime();
1133 pindex = pindex->pnext;
1135 return pindex->GetMedianTimePast();
1140 std::string ToString() const
1142 return strprintf("CBlockIndex(nprev=%08x, pnext=%08x, nFile=%d, nBlockPos=%-6d nHeight=%d, merkle=%s, hashBlock=%s)",
1143 pprev, pnext, nFile, nBlockPos, nHeight,
1144 hashMerkleRoot.ToString().substr(0,10).c_str(),
1145 GetBlockHash().ToString().substr(0,20).c_str());
1150 printf("%s\n", ToString().c_str());
1157 // Used to marshal pointers into hashes for db storage.
1159 class CDiskBlockIndex : public CBlockIndex
1171 explicit CDiskBlockIndex(CBlockIndex* pindex) : CBlockIndex(*pindex)
1173 hashPrev = (pprev ? pprev->GetBlockHash() : 0);
1174 hashNext = (pnext ? pnext->GetBlockHash() : 0);
1179 if (!(nType & SER_GETHASH))
1180 READWRITE(nVersion);
1182 READWRITE(hashNext);
1184 READWRITE(nBlockPos);
1188 READWRITE(this->nVersion);
1189 READWRITE(hashPrev);
1190 READWRITE(hashMerkleRoot);
1196 uint256 GetBlockHash() const
1199 block.nVersion = nVersion;
1200 block.hashPrevBlock = hashPrev;
1201 block.hashMerkleRoot = hashMerkleRoot;
1202 block.nTime = nTime;
1203 block.nBits = nBits;
1204 block.nNonce = nNonce;
1205 return block.GetHash();
1209 std::string ToString() const
1211 std::string str = "CDiskBlockIndex(";
1212 str += CBlockIndex::ToString();
1213 str += strprintf("\n hashBlock=%s, hashPrev=%s, hashNext=%s)",
1214 GetBlockHash().ToString().c_str(),
1215 hashPrev.ToString().substr(0,20).c_str(),
1216 hashNext.ToString().substr(0,20).c_str());
1222 printf("%s\n", ToString().c_str());
1234 // Describes a place in the block chain to another node such that if the
1235 // other node doesn't have the same branch, it can find a recent common trunk.
1236 // The further back it is, the further before the fork it may be.
1241 std::vector<uint256> vHave;
1248 explicit CBlockLocator(const CBlockIndex* pindex)
1253 explicit CBlockLocator(uint256 hashBlock)
1255 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
1256 if (mi != mapBlockIndex.end())
1262 if (!(nType & SER_GETHASH))
1263 READWRITE(nVersion);
1274 return vHave.empty();
1277 void Set(const CBlockIndex* pindex)
1283 vHave.push_back(pindex->GetBlockHash());
1285 // Exponentially larger steps back
1286 for (int i = 0; pindex && i < nStep; i++)
1287 pindex = pindex->pprev;
1288 if (vHave.size() > 10)
1291 vHave.push_back(hashGenesisBlock);
1294 int GetDistanceBack()
1296 // Retrace how far back it was in the sender's branch
1299 BOOST_FOREACH(const uint256& hash, vHave)
1301 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1302 if (mi != mapBlockIndex.end())
1304 CBlockIndex* pindex = (*mi).second;
1305 if (pindex->IsInMainChain())
1315 CBlockIndex* GetBlockIndex()
1317 // Find the first block the caller has in the main chain
1318 BOOST_FOREACH(const uint256& hash, vHave)
1320 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1321 if (mi != mapBlockIndex.end())
1323 CBlockIndex* pindex = (*mi).second;
1324 if (pindex->IsInMainChain())
1328 return pindexGenesisBlock;
1331 uint256 GetBlockHash()
1333 // Find the first block the caller has in the main chain
1334 BOOST_FOREACH(const uint256& hash, vHave)
1336 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1337 if (mi != mapBlockIndex.end())
1339 CBlockIndex* pindex = (*mi).second;
1340 if (pindex->IsInMainChain())
1344 return hashGenesisBlock;
1349 CBlockIndex* pindex = GetBlockIndex();
1352 return pindex->nHeight;
1365 // Alerts are for notifying old versions if they become too obsolete and
1366 // need to upgrade. The message is displayed in the status bar.
1367 // Alert messages are broadcast as a vector of signed data. Unserializing may
1368 // not read the entire buffer if the alert is for a newer version, but older
1369 // versions can still relay the original data.
1371 class CUnsignedAlert
1375 int64 nRelayUntil; // when newer nodes stop relaying to newer nodes
1379 std::set<int> setCancel;
1380 int nMinVer; // lowest version inclusive
1381 int nMaxVer; // highest version inclusive
1382 std::set<std::string> setSubVer; // empty matches all
1386 std::string strComment;
1387 std::string strStatusBar;
1388 std::string strReserved;
1392 READWRITE(this->nVersion);
1393 nVersion = this->nVersion;
1394 READWRITE(nRelayUntil);
1395 READWRITE(nExpiration);
1398 READWRITE(setCancel);
1401 READWRITE(setSubVer);
1402 READWRITE(nPriority);
1404 READWRITE(strComment);
1405 READWRITE(strStatusBar);
1406 READWRITE(strReserved);
1423 strStatusBar.clear();
1424 strReserved.clear();
1427 std::string ToString() const
1429 std::string strSetCancel;
1430 BOOST_FOREACH(int n, setCancel)
1431 strSetCancel += strprintf("%d ", n);
1432 std::string strSetSubVer;
1433 BOOST_FOREACH(std::string str, setSubVer)
1434 strSetSubVer += "\"" + str + "\" ";
1438 " nRelayUntil = %"PRI64d"\n"
1439 " nExpiration = %"PRI64d"\n"
1447 " strComment = \"%s\"\n"
1448 " strStatusBar = \"%s\"\n"
1455 strSetCancel.c_str(),
1458 strSetSubVer.c_str(),
1461 strStatusBar.c_str());
1466 printf("%s", ToString().c_str());
1470 class CAlert : public CUnsignedAlert
1473 std::vector<unsigned char> vchMsg;
1474 std::vector<unsigned char> vchSig;
1489 CUnsignedAlert::SetNull();
1496 return (nExpiration == 0);
1499 uint256 GetHash() const
1501 return SerializeHash(*this);
1504 bool IsInEffect() const
1506 return (GetAdjustedTime() < nExpiration);
1509 bool Cancels(const CAlert& alert) const
1512 return false; // this was a no-op before 31403
1513 return (alert.nID <= nCancel || setCancel.count(alert.nID));
1516 bool AppliesTo(int nVersion, std::string strSubVerIn) const
1518 return (IsInEffect() &&
1519 nMinVer <= nVersion && nVersion <= nMaxVer &&
1520 (setSubVer.empty() || setSubVer.count(strSubVerIn)));
1523 bool AppliesToMe() const
1525 return AppliesTo(VERSION, ::pszSubVer);
1528 bool RelayTo(CNode* pnode) const
1532 // returns true if wasn't already contained in the set
1533 if (pnode->setKnown.insert(GetHash()).second)
1535 if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||
1537 GetAdjustedTime() < nRelayUntil)
1539 pnode->PushMessage("alert", *this);
1546 bool CheckSignature()
1549 if (!key.SetPubKey(ParseHex("04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284")))
1550 return error("CAlert::CheckSignature() : SetPubKey failed");
1551 if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))
1552 return error("CAlert::CheckSignature() : verify signature failed");
1554 // Now unserialize the data
1555 CDataStream sMsg(vchMsg);
1556 sMsg >> *(CUnsignedAlert*)this;
1560 bool ProcessAlert();