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());
398 // The basic transaction that is broadcasted on the network and contained in
399 // blocks. A transaction can contain multiple inputs and outputs.
405 std::vector<CTxIn> vin;
406 std::vector<CTxOut> vout;
407 unsigned int nLockTime;
417 READWRITE(this->nVersion);
418 nVersion = this->nVersion;
421 READWRITE(nLockTime);
434 return (vin.empty() && vout.empty());
437 uint256 GetHash() const
439 return SerializeHash(*this);
442 bool IsFinal(int nBlockHeight=0, int64 nBlockTime=0) const
444 // Time based nLockTime implemented in 0.1.6
447 if (nBlockHeight == 0)
448 nBlockHeight = nBestHeight;
450 nBlockTime = GetAdjustedTime();
451 if ((int64)nLockTime < (nLockTime < LOCKTIME_THRESHOLD ? (int64)nBlockHeight : nBlockTime))
453 BOOST_FOREACH(const CTxIn& txin, vin)
459 bool IsNewerThan(const CTransaction& old) const
461 if (vin.size() != old.vin.size())
463 for (int i = 0; i < vin.size(); i++)
464 if (vin[i].prevout != old.vin[i].prevout)
468 unsigned int nLowest = UINT_MAX;
469 for (int i = 0; i < vin.size(); i++)
471 if (vin[i].nSequence != old.vin[i].nSequence)
473 if (vin[i].nSequence <= nLowest)
476 nLowest = vin[i].nSequence;
478 if (old.vin[i].nSequence < nLowest)
481 nLowest = old.vin[i].nSequence;
488 bool IsCoinBase() const
490 return (vin.size() == 1 && vin[0].prevout.IsNull());
493 int GetSigOpCount() const
496 BOOST_FOREACH(const CTxIn& txin, vin)
497 n += txin.scriptSig.GetSigOpCount();
498 BOOST_FOREACH(const CTxOut& txout, vout)
499 n += txout.scriptPubKey.GetSigOpCount();
503 bool IsStandard() const
505 BOOST_FOREACH(const CTxIn& txin, vin)
506 if (!txin.scriptSig.IsPushOnly())
507 return error("nonstandard txin: %s", txin.scriptSig.ToString().c_str());
508 BOOST_FOREACH(const CTxOut& txout, vout)
509 if (!::IsStandard(txout.scriptPubKey))
510 return error("nonstandard txout: %s", txout.scriptPubKey.ToString().c_str());
514 int64 GetValueOut() const
517 BOOST_FOREACH(const CTxOut& txout, vout)
519 nValueOut += txout.nValue;
520 if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))
521 throw std::runtime_error("CTransaction::GetValueOut() : value out of range");
526 static bool AllowFree(double dPriority)
528 // Large (in bytes) low-priority (new, small-coin) transactions
530 return dPriority > COIN * 144 / 250;
533 int64 GetMinFee(unsigned int nBlockSize=1, bool fAllowFree=true, enum GetMinFee_mode mode=GMF_BLOCK) const
535 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
536 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
538 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK);
539 unsigned int nNewBlockSize = nBlockSize + nBytes;
540 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
546 // Transactions under 10K are free
547 // (about 4500bc if made of 50bc inputs)
553 // Free transaction area
554 if (nNewBlockSize < 27000)
559 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
560 if (nMinFee < nBaseFee)
561 BOOST_FOREACH(const CTxOut& txout, vout)
562 if (txout.nValue < CENT)
565 // Raise the price as the block approaches full
566 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
568 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
570 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
573 if (!MoneyRange(nMinFee))
579 bool ReadFromDisk(CDiskTxPos pos, FILE** pfileRet=NULL)
581 CAutoFile filein = OpenBlockFile(pos.nFile, 0, pfileRet ? "rb+" : "rb");
583 return error("CTransaction::ReadFromDisk() : OpenBlockFile failed");
586 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
587 return error("CTransaction::ReadFromDisk() : fseek failed");
590 // Return file pointer
593 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
594 return error("CTransaction::ReadFromDisk() : second fseek failed");
595 *pfileRet = filein.release();
600 friend bool operator==(const CTransaction& a, const CTransaction& b)
602 return (a.nVersion == b.nVersion &&
605 a.nLockTime == b.nLockTime);
608 friend bool operator!=(const CTransaction& a, const CTransaction& b)
614 std::string ToString() const
617 str += strprintf("CTransaction(hash=%s, ver=%d, vin.size=%d, vout.size=%d, nLockTime=%d)\n",
618 GetHash().ToString().substr(0,10).c_str(),
623 for (int i = 0; i < vin.size(); i++)
624 str += " " + vin[i].ToString() + "\n";
625 for (int i = 0; i < vout.size(); i++)
626 str += " " + vout[i].ToString() + "\n";
632 printf("%s", ToString().c_str());
636 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet);
637 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout);
638 bool ReadFromDisk(COutPoint prevout);
639 bool DisconnectInputs(CTxDB& txdb);
640 bool ConnectInputs(CTxDB& txdb, std::map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
641 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee=0);
642 bool ClientConnectInputs();
643 bool CheckTransaction() const;
644 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true, bool* pfMissingInputs=NULL);
645 bool AcceptToMemoryPool(bool fCheckInputs=true, bool* pfMissingInputs=NULL);
647 bool AddToMemoryPoolUnchecked();
649 bool RemoveFromMemoryPool();
657 // A transaction with a merkle branch linking it to the block chain
659 class CMerkleTx : public CTransaction
663 std::vector<uint256> vMerkleBranch;
667 mutable char fMerkleVerified;
675 CMerkleTx(const CTransaction& txIn) : CTransaction(txIn)
684 fMerkleVerified = false;
690 nSerSize += SerReadWrite(s, *(CTransaction*)this, nType, nVersion, ser_action);
691 nVersion = this->nVersion;
692 READWRITE(hashBlock);
693 READWRITE(vMerkleBranch);
698 int SetMerkleBranch(const CBlock* pblock=NULL);
699 int GetDepthInMainChain(int& nHeightRet) const;
700 int GetDepthInMainChain() const { int nHeight; return GetDepthInMainChain(nHeight); }
701 bool IsInMainChain() const { return GetDepthInMainChain() > 0; }
702 int GetBlocksToMaturity() const;
703 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true);
704 bool AcceptToMemoryPool();
711 // A txdb record that contains the disk location of a transaction and the
712 // locations of transactions that spend its outputs. vSpent is really only
713 // used as a flag, but having the location is very helpful for debugging.
719 std::vector<CDiskTxPos> vSpent;
726 CTxIndex(const CDiskTxPos& posIn, unsigned int nOutputs)
729 vSpent.resize(nOutputs);
734 if (!(nType & SER_GETHASH))
751 friend bool operator==(const CTxIndex& a, const CTxIndex& b)
753 return (a.pos == b.pos &&
754 a.vSpent == b.vSpent);
757 friend bool operator!=(const CTxIndex& a, const CTxIndex& b)
761 int GetDepthInMainChain() const;
769 // Nodes collect new transactions into a block, hash them into a hash tree,
770 // and scan through nonce values to make the block's hash satisfy proof-of-work
771 // requirements. When they solve the proof-of-work, they broadcast the block
772 // to everyone and the block is added to the block chain. The first transaction
773 // in the block is a special one that creates a new coin owned by the creator
776 // Blocks are appended to blk0001.dat files on disk. Their location on disk
777 // is indexed by CBlockIndex objects in memory.
784 uint256 hashPrevBlock;
785 uint256 hashMerkleRoot;
791 std::vector<CTransaction> vtx;
794 mutable std::vector<uint256> vMerkleTree;
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();
836 uint256 GetHash() const
838 return Hash(BEGIN(nVersion), END(nNonce));
841 int64 GetBlockTime() const
846 int GetSigOpCount() const
849 BOOST_FOREACH(const CTransaction& tx, vtx)
850 n += tx.GetSigOpCount();
855 uint256 BuildMerkleTree() const
858 BOOST_FOREACH(const CTransaction& tx, vtx)
859 vMerkleTree.push_back(tx.GetHash());
861 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
863 for (int i = 0; i < nSize; i += 2)
865 int i2 = std::min(i+1, nSize-1);
866 vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),
867 BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));
871 return (vMerkleTree.empty() ? 0 : vMerkleTree.back());
874 std::vector<uint256> GetMerkleBranch(int nIndex) const
876 if (vMerkleTree.empty())
878 std::vector<uint256> vMerkleBranch;
880 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
882 int i = std::min(nIndex^1, nSize-1);
883 vMerkleBranch.push_back(vMerkleTree[j+i]);
887 return vMerkleBranch;
890 static uint256 CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)
894 BOOST_FOREACH(const uint256& otherside, vMerkleBranch)
897 hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));
899 hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));
906 bool WriteToDisk(unsigned int& nFileRet, unsigned int& nBlockPosRet)
908 // Open history file to append
909 CAutoFile fileout = AppendBlockFile(nFileRet);
911 return error("CBlock::WriteToDisk() : AppendBlockFile failed");
913 // Write index header
914 unsigned int nSize = fileout.GetSerializeSize(*this);
915 fileout << FLATDATA(pchMessageStart) << nSize;
918 nBlockPosRet = ftell(fileout);
919 if (nBlockPosRet == -1)
920 return error("CBlock::WriteToDisk() : ftell failed");
923 // Flush stdio buffers and commit to disk before returning
925 if (!IsInitialBlockDownload() || (nBestHeight+1) % 500 == 0)
928 _commit(_fileno(fileout));
930 fsync(fileno(fileout));
937 bool ReadFromDisk(unsigned int nFile, unsigned int nBlockPos, bool fReadTransactions=true)
941 // Open history file to read
942 CAutoFile filein = OpenBlockFile(nFile, nBlockPos, "rb");
944 return error("CBlock::ReadFromDisk() : OpenBlockFile failed");
945 if (!fReadTransactions)
946 filein.nType |= SER_BLOCKHEADERONLY;
952 if (!CheckProofOfWork(GetHash(), nBits))
953 return error("CBlock::ReadFromDisk() : errors in block header");
962 printf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%d)\n",
963 GetHash().ToString().substr(0,20).c_str(),
965 hashPrevBlock.ToString().substr(0,20).c_str(),
966 hashMerkleRoot.ToString().substr(0,10).c_str(),
967 nTime, nBits, nNonce,
969 for (int i = 0; i < vtx.size(); i++)
974 printf(" vMerkleTree: ");
975 for (int i = 0; i < vMerkleTree.size(); i++)
976 printf("%s ", vMerkleTree[i].ToString().substr(0,10).c_str());
981 bool DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex);
982 bool ConnectBlock(CTxDB& txdb, CBlockIndex* pindex);
983 bool ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions=true);
984 bool SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew);
985 bool AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos);
986 bool CheckBlock() const;
996 // The block chain is a tree shaped structure starting with the
997 // genesis block at the root, with each block potentially having multiple
998 // candidates to be the next block. pprev and pnext link a path through the
999 // main/longest chain. A blockindex may have multiple pprev pointing back
1000 // to it, but pnext will only point forward to the longest branch, or will
1001 // be null if the block is not part of the longest chain.
1006 const uint256* phashBlock;
1010 unsigned int nBlockPos;
1012 CBigNum bnChainWork;
1016 uint256 hashMerkleRoot;
1019 unsigned int nNonce;
1039 CBlockIndex(unsigned int nFileIn, unsigned int nBlockPosIn, CBlock& block)
1045 nBlockPos = nBlockPosIn;
1049 nVersion = block.nVersion;
1050 hashMerkleRoot = block.hashMerkleRoot;
1051 nTime = block.nTime;
1052 nBits = block.nBits;
1053 nNonce = block.nNonce;
1056 CBlock GetBlockHeader() const
1059 block.nVersion = nVersion;
1061 block.hashPrevBlock = pprev->GetBlockHash();
1062 block.hashMerkleRoot = hashMerkleRoot;
1063 block.nTime = nTime;
1064 block.nBits = nBits;
1065 block.nNonce = nNonce;
1069 uint256 GetBlockHash() const
1074 int64 GetBlockTime() const
1076 return (int64)nTime;
1079 CBigNum GetBlockWork() const
1082 bnTarget.SetCompact(nBits);
1085 return (CBigNum(1)<<256) / (bnTarget+1);
1088 bool IsInMainChain() const
1090 return (pnext || this == pindexBest);
1093 bool CheckIndex() const
1095 return CheckProofOfWork(GetBlockHash(), nBits);
1098 bool EraseBlockFromDisk()
1100 // Open history file
1101 CAutoFile fileout = OpenBlockFile(nFile, nBlockPos, "rb+");
1105 // Overwrite with empty null block
1113 enum { nMedianTimeSpan=11 };
1115 int64 GetMedianTimePast() const
1117 int64 pmedian[nMedianTimeSpan];
1118 int64* pbegin = &pmedian[nMedianTimeSpan];
1119 int64* pend = &pmedian[nMedianTimeSpan];
1121 const CBlockIndex* pindex = this;
1122 for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
1123 *(--pbegin) = pindex->GetBlockTime();
1125 std::sort(pbegin, pend);
1126 return pbegin[(pend - pbegin)/2];
1129 int64 GetMedianTime() const
1131 const CBlockIndex* pindex = this;
1132 for (int i = 0; i < nMedianTimeSpan/2; i++)
1135 return GetBlockTime();
1136 pindex = pindex->pnext;
1138 return pindex->GetMedianTimePast();
1143 std::string ToString() const
1145 return strprintf("CBlockIndex(nprev=%08x, pnext=%08x, nFile=%d, nBlockPos=%-6d nHeight=%d, merkle=%s, hashBlock=%s)",
1146 pprev, pnext, nFile, nBlockPos, nHeight,
1147 hashMerkleRoot.ToString().substr(0,10).c_str(),
1148 GetBlockHash().ToString().substr(0,20).c_str());
1153 printf("%s\n", ToString().c_str());
1160 // Used to marshal pointers into hashes for db storage.
1162 class CDiskBlockIndex : public CBlockIndex
1174 explicit CDiskBlockIndex(CBlockIndex* pindex) : CBlockIndex(*pindex)
1176 hashPrev = (pprev ? pprev->GetBlockHash() : 0);
1177 hashNext = (pnext ? pnext->GetBlockHash() : 0);
1182 if (!(nType & SER_GETHASH))
1183 READWRITE(nVersion);
1185 READWRITE(hashNext);
1187 READWRITE(nBlockPos);
1191 READWRITE(this->nVersion);
1192 READWRITE(hashPrev);
1193 READWRITE(hashMerkleRoot);
1199 uint256 GetBlockHash() const
1202 block.nVersion = nVersion;
1203 block.hashPrevBlock = hashPrev;
1204 block.hashMerkleRoot = hashMerkleRoot;
1205 block.nTime = nTime;
1206 block.nBits = nBits;
1207 block.nNonce = nNonce;
1208 return block.GetHash();
1212 std::string ToString() const
1214 std::string str = "CDiskBlockIndex(";
1215 str += CBlockIndex::ToString();
1216 str += strprintf("\n hashBlock=%s, hashPrev=%s, hashNext=%s)",
1217 GetBlockHash().ToString().c_str(),
1218 hashPrev.ToString().substr(0,20).c_str(),
1219 hashNext.ToString().substr(0,20).c_str());
1225 printf("%s\n", ToString().c_str());
1237 // Describes a place in the block chain to another node such that if the
1238 // other node doesn't have the same branch, it can find a recent common trunk.
1239 // The further back it is, the further before the fork it may be.
1244 std::vector<uint256> vHave;
1251 explicit CBlockLocator(const CBlockIndex* pindex)
1256 explicit CBlockLocator(uint256 hashBlock)
1258 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
1259 if (mi != mapBlockIndex.end())
1265 if (!(nType & SER_GETHASH))
1266 READWRITE(nVersion);
1277 return vHave.empty();
1280 void Set(const CBlockIndex* pindex)
1286 vHave.push_back(pindex->GetBlockHash());
1288 // Exponentially larger steps back
1289 for (int i = 0; pindex && i < nStep; i++)
1290 pindex = pindex->pprev;
1291 if (vHave.size() > 10)
1294 vHave.push_back(hashGenesisBlock);
1297 int GetDistanceBack()
1299 // Retrace how far back it was in the sender's branch
1302 BOOST_FOREACH(const uint256& hash, vHave)
1304 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1305 if (mi != mapBlockIndex.end())
1307 CBlockIndex* pindex = (*mi).second;
1308 if (pindex->IsInMainChain())
1318 CBlockIndex* GetBlockIndex()
1320 // Find the first block the caller has in the main chain
1321 BOOST_FOREACH(const uint256& hash, vHave)
1323 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1324 if (mi != mapBlockIndex.end())
1326 CBlockIndex* pindex = (*mi).second;
1327 if (pindex->IsInMainChain())
1331 return pindexGenesisBlock;
1334 uint256 GetBlockHash()
1336 // Find the first block the caller has in the main chain
1337 BOOST_FOREACH(const uint256& hash, vHave)
1339 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1340 if (mi != mapBlockIndex.end())
1342 CBlockIndex* pindex = (*mi).second;
1343 if (pindex->IsInMainChain())
1347 return hashGenesisBlock;
1352 CBlockIndex* pindex = GetBlockIndex();
1355 return pindex->nHeight;
1368 // Alerts are for notifying old versions if they become too obsolete and
1369 // need to upgrade. The message is displayed in the status bar.
1370 // Alert messages are broadcast as a vector of signed data. Unserializing may
1371 // not read the entire buffer if the alert is for a newer version, but older
1372 // versions can still relay the original data.
1374 class CUnsignedAlert
1378 int64 nRelayUntil; // when newer nodes stop relaying to newer nodes
1382 std::set<int> setCancel;
1383 int nMinVer; // lowest version inclusive
1384 int nMaxVer; // highest version inclusive
1385 std::set<std::string> setSubVer; // empty matches all
1389 std::string strComment;
1390 std::string strStatusBar;
1391 std::string strReserved;
1395 READWRITE(this->nVersion);
1396 nVersion = this->nVersion;
1397 READWRITE(nRelayUntil);
1398 READWRITE(nExpiration);
1401 READWRITE(setCancel);
1404 READWRITE(setSubVer);
1405 READWRITE(nPriority);
1407 READWRITE(strComment);
1408 READWRITE(strStatusBar);
1409 READWRITE(strReserved);
1426 strStatusBar.clear();
1427 strReserved.clear();
1430 std::string ToString() const
1432 std::string strSetCancel;
1433 BOOST_FOREACH(int n, setCancel)
1434 strSetCancel += strprintf("%d ", n);
1435 std::string strSetSubVer;
1436 BOOST_FOREACH(std::string str, setSubVer)
1437 strSetSubVer += "\"" + str + "\" ";
1441 " nRelayUntil = %"PRI64d"\n"
1442 " nExpiration = %"PRI64d"\n"
1450 " strComment = \"%s\"\n"
1451 " strStatusBar = \"%s\"\n"
1458 strSetCancel.c_str(),
1461 strSetSubVer.c_str(),
1464 strStatusBar.c_str());
1469 printf("%s", ToString().c_str());
1473 class CAlert : public CUnsignedAlert
1476 std::vector<unsigned char> vchMsg;
1477 std::vector<unsigned char> vchSig;
1492 CUnsignedAlert::SetNull();
1499 return (nExpiration == 0);
1502 uint256 GetHash() const
1504 return SerializeHash(*this);
1507 bool IsInEffect() const
1509 return (GetAdjustedTime() < nExpiration);
1512 bool Cancels(const CAlert& alert) const
1515 return false; // this was a no-op before 31403
1516 return (alert.nID <= nCancel || setCancel.count(alert.nID));
1519 bool AppliesTo(int nVersion, std::string strSubVerIn) const
1521 return (IsInEffect() &&
1522 nMinVer <= nVersion && nVersion <= nMaxVer &&
1523 (setSubVer.empty() || setSubVer.count(strSubVerIn)));
1526 bool AppliesToMe() const
1528 return AppliesTo(VERSION, ::pszSubVer);
1531 bool RelayTo(CNode* pnode) const
1535 // returns true if wasn't already contained in the set
1536 if (pnode->setKnown.insert(GetHash()).second)
1538 if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||
1540 GetAdjustedTime() < nRelayUntil)
1542 pnode->PushMessage("alert", *this);
1549 bool CheckSignature()
1552 if (!key.SetPubKey(ParseHex("04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284")))
1553 return error("CAlert::CheckSignature() : SetPubKey failed");
1554 if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))
1555 return error("CAlert::CheckSignature() : verify signature failed");
1557 // Now unserialize the data
1558 CDataStream sMsg(vchMsg);
1559 sMsg >> *(CUnsignedAlert*)this;
1563 bool ProcessAlert();