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;
29 static const int CLIENT_VERSION = 60007;
30 static const bool VERSION_IS_BETA = true;
31 extern const std::string CLIENT_NAME;
33 static const unsigned int MAX_BLOCK_SIZE = 1000000;
34 static const unsigned int MAX_BLOCK_SIZE_GEN = MAX_BLOCK_SIZE/2;
35 static const int MAX_BLOCK_SIGOPS = MAX_BLOCK_SIZE/50;
36 static const int MAX_ORPHAN_TRANSACTIONS = MAX_BLOCK_SIZE/100;
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;
53 extern CScript COINBASE_FLAGS;
60 extern CCriticalSection cs_main;
61 extern std::map<uint256, CBlockIndex*> mapBlockIndex;
62 extern uint256 hashGenesisBlock;
63 extern CBlockIndex* pindexGenesisBlock;
64 extern int nBestHeight;
65 extern CBigNum bnBestChainWork;
66 extern CBigNum bnBestInvalidWork;
67 extern uint256 hashBestChain;
68 extern CBlockIndex* pindexBest;
69 extern uint64 nPooledTx;
70 extern unsigned int nTransactionsUpdated;
71 extern uint64 nLastBlockTx;
72 extern uint64 nLastBlockSize;
73 extern const std::string strMessageMagic;
74 extern double dHashesPerSec;
75 extern int64 nHPSTimerStart;
76 extern int64 nTimeBestReceived;
77 extern CCriticalSection cs_setpwalletRegistered;
78 extern std::set<CWallet*> setpwalletRegistered;
81 extern int64 nTransactionFee;
91 void RegisterWallet(CWallet* pwalletIn);
92 void UnregisterWallet(CWallet* pwalletIn);
93 bool ProcessBlock(CNode* pfrom, CBlock* pblock);
94 bool CheckDiskSpace(uint64 nAdditionalBytes=0);
95 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode="rb");
96 FILE* AppendBlockFile(unsigned int& nFileRet);
97 bool LoadBlockIndex(bool fAllowNew=true);
98 void PrintBlockTree();
99 bool ProcessMessages(CNode* pfrom);
100 bool SendMessages(CNode* pto, bool fSendTrickle);
101 void GenerateBitcoins(bool fGenerate, CWallet* pwallet);
102 CBlock* CreateNewBlock(CReserveKey& reservekey);
103 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce);
104 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1);
105 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey);
106 bool CheckProofOfWork(uint256 hash, unsigned int nBits);
107 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime);
108 int GetNumBlocksOfPeers();
109 bool IsInitialBlockDownload();
110 std::string GetWarnings(std::string strFor);
123 bool GetWalletFile(CWallet* pwallet, std::string &strWalletFileOut);
125 /** Position on disk for a particular transaction. */
130 unsigned int nBlockPos;
138 CDiskTxPos(unsigned int nFileIn, unsigned int nBlockPosIn, unsigned int nTxPosIn)
141 nBlockPos = nBlockPosIn;
145 IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
146 void SetNull() { nFile = -1; nBlockPos = 0; nTxPos = 0; }
147 bool IsNull() const { return (nFile == -1); }
149 friend bool operator==(const CDiskTxPos& a, const CDiskTxPos& b)
151 return (a.nFile == b.nFile &&
152 a.nBlockPos == b.nBlockPos &&
153 a.nTxPos == b.nTxPos);
156 friend bool operator!=(const CDiskTxPos& a, const CDiskTxPos& b)
161 std::string ToString() const
164 return strprintf("null");
166 return strprintf("(nFile=%d, nBlockPos=%d, nTxPos=%d)", nFile, nBlockPos, nTxPos);
171 printf("%s", ToString().c_str());
177 /** An inpoint - a combination of a transaction and an index n into its vin */
184 CInPoint() { SetNull(); }
185 CInPoint(CTransaction* ptxIn, unsigned int nIn) { ptx = ptxIn; n = nIn; }
186 void SetNull() { ptx = NULL; n = -1; }
187 bool IsNull() const { return (ptx == NULL && n == -1); }
192 /** An outpoint - a combination of a transaction hash and an index n into its vout */
199 COutPoint() { SetNull(); }
200 COutPoint(uint256 hashIn, unsigned int nIn) { hash = hashIn; n = nIn; }
201 IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
202 void SetNull() { hash = 0; n = -1; }
203 bool IsNull() const { return (hash == 0 && n == -1); }
205 friend bool operator<(const COutPoint& a, const COutPoint& b)
207 return (a.hash < b.hash || (a.hash == b.hash && a.n < b.n));
210 friend bool operator==(const COutPoint& a, const COutPoint& b)
212 return (a.hash == b.hash && a.n == b.n);
215 friend bool operator!=(const COutPoint& a, const COutPoint& b)
220 std::string ToString() const
222 return strprintf("COutPoint(%s, %d)", hash.ToString().substr(0,10).c_str(), n);
227 printf("%s\n", ToString().c_str());
234 /** An input of a transaction. It contains the location of the previous
235 * transaction's output that it claims and a signature that matches the
236 * output's public key.
243 unsigned int nSequence;
247 nSequence = std::numeric_limits<unsigned int>::max();
250 explicit CTxIn(COutPoint prevoutIn, CScript scriptSigIn=CScript(), unsigned int nSequenceIn=std::numeric_limits<unsigned int>::max())
253 scriptSig = scriptSigIn;
254 nSequence = nSequenceIn;
257 CTxIn(uint256 hashPrevTx, unsigned int nOut, CScript scriptSigIn=CScript(), unsigned int nSequenceIn=std::numeric_limits<unsigned int>::max())
259 prevout = COutPoint(hashPrevTx, nOut);
260 scriptSig = scriptSigIn;
261 nSequence = nSequenceIn;
267 READWRITE(scriptSig);
268 READWRITE(nSequence);
273 return (nSequence == std::numeric_limits<unsigned int>::max());
276 friend bool operator==(const CTxIn& a, const CTxIn& b)
278 return (a.prevout == b.prevout &&
279 a.scriptSig == b.scriptSig &&
280 a.nSequence == b.nSequence);
283 friend bool operator!=(const CTxIn& a, const CTxIn& b)
288 std::string ToString() const
291 str += strprintf("CTxIn(");
292 str += prevout.ToString();
293 if (prevout.IsNull())
294 str += strprintf(", coinbase %s", HexStr(scriptSig).c_str());
296 str += strprintf(", scriptSig=%s", scriptSig.ToString().substr(0,24).c_str());
297 if (nSequence != std::numeric_limits<unsigned int>::max())
298 str += strprintf(", nSequence=%u", nSequence);
305 printf("%s\n", ToString().c_str());
312 /** An output of a transaction. It contains the public key that the next input
313 * must be able to sign with to claim it.
319 CScript scriptPubKey;
326 CTxOut(int64 nValueIn, CScript scriptPubKeyIn)
329 scriptPubKey = scriptPubKeyIn;
335 READWRITE(scriptPubKey);
341 scriptPubKey.clear();
346 return (nValue == -1);
349 uint256 GetHash() const
351 return SerializeHash(*this);
354 friend bool operator==(const CTxOut& a, const CTxOut& b)
356 return (a.nValue == b.nValue &&
357 a.scriptPubKey == b.scriptPubKey);
360 friend bool operator!=(const CTxOut& a, const CTxOut& b)
365 std::string ToString() const
367 if (scriptPubKey.size() < 6)
368 return "CTxOut(error)";
369 return strprintf("CTxOut(nValue=%"PRI64d".%08"PRI64d", scriptPubKey=%s)", nValue / COIN, nValue % COIN, scriptPubKey.ToString().substr(0,30).c_str());
374 printf("%s\n", ToString().c_str());
388 typedef std::map<uint256, std::pair<CTxIndex, CTransaction> > MapPrevTx;
390 /** The basic transaction that is broadcasted on the network and contained in
391 * blocks. A transaction can contain multiple inputs and outputs.
397 std::vector<CTxIn> vin;
398 std::vector<CTxOut> vout;
399 unsigned int nLockTime;
401 // Denial-of-service detection:
403 bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
412 READWRITE(this->nVersion);
413 nVersion = this->nVersion;
416 READWRITE(nLockTime);
425 nDoS = 0; // Denial-of-service prevention
430 return (vin.empty() && vout.empty());
433 uint256 GetHash() const
435 return SerializeHash(*this);
438 bool IsFinal(int nBlockHeight=0, int64 nBlockTime=0) const
440 // Time based nLockTime implemented in 0.1.6
443 if (nBlockHeight == 0)
444 nBlockHeight = nBestHeight;
446 nBlockTime = GetAdjustedTime();
447 if ((int64)nLockTime < (nLockTime < LOCKTIME_THRESHOLD ? (int64)nBlockHeight : nBlockTime))
449 BOOST_FOREACH(const CTxIn& txin, vin)
455 bool IsNewerThan(const CTransaction& old) const
457 if (vin.size() != old.vin.size())
459 for (unsigned int i = 0; i < vin.size(); i++)
460 if (vin[i].prevout != old.vin[i].prevout)
464 unsigned int nLowest = std::numeric_limits<unsigned int>::max();
465 for (unsigned int i = 0; i < vin.size(); i++)
467 if (vin[i].nSequence != old.vin[i].nSequence)
469 if (vin[i].nSequence <= nLowest)
472 nLowest = vin[i].nSequence;
474 if (old.vin[i].nSequence < nLowest)
477 nLowest = old.vin[i].nSequence;
484 bool IsCoinBase() const
486 return (vin.size() == 1 && vin[0].prevout.IsNull());
489 /** Check for standard transaction types
490 @return True if all outputs (scriptPubKeys) use only standard transaction forms
492 bool IsStandard() const;
494 /** Check for standard transaction types
495 @param[in] mapInputs Map of previous transactions that have outputs we're spending
496 @return True if all inputs (scriptSigs) use only standard transaction forms
497 @see CTransaction::FetchInputs
499 bool AreInputsStandard(const MapPrevTx& mapInputs) const;
501 /** Count ECDSA signature operations the old-fashioned (pre-0.6) way
502 @return number of sigops this transaction's outputs will produce when spent
503 @see CTransaction::FetchInputs
505 int GetLegacySigOpCount() const;
507 /** Count ECDSA signature operations in pay-to-script-hash inputs.
509 @param[in] mapInputs Map of previous transactions that have outputs we're spending
510 @return maximum number of sigops required to validate this transaction's inputs
511 @see CTransaction::FetchInputs
513 int GetP2SHSigOpCount(const MapPrevTx& mapInputs) const;
515 /** Amount of bitcoins spent by this transaction.
516 @return sum of all outputs (note: does not include fees)
518 int64 GetValueOut() const
521 BOOST_FOREACH(const CTxOut& txout, vout)
523 nValueOut += txout.nValue;
524 if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))
525 throw std::runtime_error("CTransaction::GetValueOut() : value out of range");
530 /** Amount of bitcoins coming in to this transaction
531 Note that lightweight clients may not know anything besides the hash of previous transactions,
532 so may not be able to calculate this.
534 @param[in] mapInputs Map of previous transactions that have outputs we're spending
535 @return Sum of value of all inputs (scriptSigs)
536 @see CTransaction::FetchInputs
538 int64 GetValueIn(const MapPrevTx& mapInputs) const;
540 static bool AllowFree(double dPriority)
542 // Large (in bytes) low-priority (new, small-coin) transactions
544 return dPriority > COIN * 144 / 250;
547 int64 GetMinFee(unsigned int nBlockSize=1, bool fAllowFree=true, enum GetMinFee_mode mode=GMF_BLOCK) const
549 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
550 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
552 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK);
553 unsigned int nNewBlockSize = nBlockSize + nBytes;
554 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
560 // Transactions under 10K are free
561 // (about 4500bc if made of 50bc inputs)
567 // Free transaction area
568 if (nNewBlockSize < 27000)
573 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
574 if (nMinFee < nBaseFee)
576 BOOST_FOREACH(const CTxOut& txout, vout)
577 if (txout.nValue < CENT)
581 // Raise the price as the block approaches full
582 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
584 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
586 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
589 if (!MoneyRange(nMinFee))
595 bool ReadFromDisk(CDiskTxPos pos, FILE** pfileRet=NULL)
597 CAutoFile filein = OpenBlockFile(pos.nFile, 0, pfileRet ? "rb+" : "rb");
599 return error("CTransaction::ReadFromDisk() : OpenBlockFile failed");
602 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
603 return error("CTransaction::ReadFromDisk() : fseek failed");
606 // Return file pointer
609 if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
610 return error("CTransaction::ReadFromDisk() : second fseek failed");
611 *pfileRet = filein.release();
616 friend bool operator==(const CTransaction& a, const CTransaction& b)
618 return (a.nVersion == b.nVersion &&
621 a.nLockTime == b.nLockTime);
624 friend bool operator!=(const CTransaction& a, const CTransaction& b)
630 std::string ToString() const
633 str += strprintf("CTransaction(hash=%s, ver=%d, vin.size=%d, vout.size=%d, nLockTime=%d)\n",
634 GetHash().ToString().substr(0,10).c_str(),
639 for (unsigned int i = 0; i < vin.size(); i++)
640 str += " " + vin[i].ToString() + "\n";
641 for (unsigned int i = 0; i < vout.size(); i++)
642 str += " " + vout[i].ToString() + "\n";
648 printf("%s", ToString().c_str());
652 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet);
653 bool ReadFromDisk(CTxDB& txdb, COutPoint prevout);
654 bool ReadFromDisk(COutPoint prevout);
655 bool DisconnectInputs(CTxDB& txdb);
657 /** Fetch from memory and/or disk. inputsRet keys are transaction hashes.
659 @param[in] txdb Transaction database
660 @param[in] mapTestPool List of pending changes to the transaction index database
661 @param[in] fBlock True if being called to add a new best-block to the chain
662 @param[in] fMiner True if being called by CreateNewBlock
663 @param[out] inputsRet Pointers to this transaction's inputs
664 @param[out] fInvalid returns true if transaction is invalid
665 @return Returns true if all inputs are in txdb or mapTestPool
667 bool FetchInputs(CTxDB& txdb, const std::map<uint256, CTxIndex>& mapTestPool,
668 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid);
670 /** Sanity check previous transactions, then, if all checks succeed,
671 mark them as spent by this transaction.
673 @param[in] inputs Previous transactions (from FetchInputs)
674 @param[out] mapTestPool Keeps track of inputs that need to be updated on disk
675 @param[in] posThisTx Position of this transaction on disk
676 @param[in] pindexBlock
677 @param[in] fBlock true if called from ConnectBlock
678 @param[in] fMiner true if called from CreateNewBlock
679 @param[in] fStrictPayToScriptHash true if fully validating p2sh transactions
680 @return Returns true if all checks succeed
682 bool ConnectInputs(MapPrevTx inputs,
683 std::map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
684 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash=true);
685 bool ClientConnectInputs();
686 bool CheckTransaction() const;
687 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true, bool* pfMissingInputs=NULL);
688 bool AcceptToMemoryPool(bool fCheckInputs=true, bool* pfMissingInputs=NULL);
691 const CTxOut& GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const;
692 bool AddToMemoryPoolUnchecked();
694 bool RemoveFromMemoryPool();
701 /** A transaction with a merkle branch linking it to the block chain. */
702 class CMerkleTx : public CTransaction
706 std::vector<uint256> vMerkleBranch;
710 mutable char fMerkleVerified;
718 CMerkleTx(const CTransaction& txIn) : CTransaction(txIn)
727 fMerkleVerified = false;
733 nSerSize += SerReadWrite(s, *(CTransaction*)this, nType, nVersion, ser_action);
734 nVersion = this->nVersion;
735 READWRITE(hashBlock);
736 READWRITE(vMerkleBranch);
741 int SetMerkleBranch(const CBlock* pblock=NULL);
742 int GetDepthInMainChain(CBlockIndex* &pindexRet) const;
743 int GetDepthInMainChain() const { CBlockIndex *pindexRet; return GetDepthInMainChain(pindexRet); }
744 bool IsInMainChain() const { return GetDepthInMainChain() > 0; }
745 int GetBlocksToMaturity() const;
746 bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true);
747 bool AcceptToMemoryPool();
753 /** A txdb record that contains the disk location of a transaction and the
754 * locations of transactions that spend its outputs. vSpent is really only
755 * used as a flag, but having the location is very helpful for debugging.
761 std::vector<CDiskTxPos> vSpent;
768 CTxIndex(const CDiskTxPos& posIn, unsigned int nOutputs)
771 vSpent.resize(nOutputs);
776 if (!(nType & SER_GETHASH))
793 friend bool operator==(const CTxIndex& a, const CTxIndex& b)
795 return (a.pos == b.pos &&
796 a.vSpent == b.vSpent);
799 friend bool operator!=(const CTxIndex& a, const CTxIndex& b)
803 int GetDepthInMainChain() const;
811 /** Nodes collect new transactions into a block, hash them into a hash tree,
812 * and scan through nonce values to make the block's hash satisfy proof-of-work
813 * requirements. When they solve the proof-of-work, they broadcast the block
814 * to everyone and the block is added to the block chain. The first transaction
815 * in the block is a special one that creates a new coin owned by the creator
818 * Blocks are appended to blk0001.dat files on disk. Their location on disk
819 * is indexed by CBlockIndex objects in memory.
826 uint256 hashPrevBlock;
827 uint256 hashMerkleRoot;
833 std::vector<CTransaction> vtx;
836 mutable std::vector<uint256> vMerkleTree;
838 // Denial-of-service detection:
840 bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
849 READWRITE(this->nVersion);
850 nVersion = this->nVersion;
851 READWRITE(hashPrevBlock);
852 READWRITE(hashMerkleRoot);
857 // ConnectBlock depends on vtx being last so it can calculate offset
858 if (!(nType & (SER_GETHASH|SER_BLOCKHEADERONLY)))
861 const_cast<CBlock*>(this)->vtx.clear();
882 uint256 GetHash() const
884 return Hash(BEGIN(nVersion), END(nNonce));
887 int64 GetBlockTime() const
892 void UpdateTime(const CBlockIndex* pindexPrev);
895 uint256 BuildMerkleTree() const
898 BOOST_FOREACH(const CTransaction& tx, vtx)
899 vMerkleTree.push_back(tx.GetHash());
901 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
903 for (int i = 0; i < nSize; i += 2)
905 int i2 = std::min(i+1, nSize-1);
906 vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),
907 BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));
911 return (vMerkleTree.empty() ? 0 : vMerkleTree.back());
914 std::vector<uint256> GetMerkleBranch(int nIndex) const
916 if (vMerkleTree.empty())
918 std::vector<uint256> vMerkleBranch;
920 for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
922 int i = std::min(nIndex^1, nSize-1);
923 vMerkleBranch.push_back(vMerkleTree[j+i]);
927 return vMerkleBranch;
930 static uint256 CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)
934 BOOST_FOREACH(const uint256& otherside, vMerkleBranch)
937 hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));
939 hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));
946 bool WriteToDisk(unsigned int& nFileRet, unsigned int& nBlockPosRet)
948 // Open history file to append
949 CAutoFile fileout = AppendBlockFile(nFileRet);
951 return error("CBlock::WriteToDisk() : AppendBlockFile failed");
953 // Write index header
954 unsigned int nSize = fileout.GetSerializeSize(*this);
955 fileout << FLATDATA(pchMessageStart) << nSize;
958 nBlockPosRet = ftell(fileout);
959 if (nBlockPosRet == -1)
960 return error("CBlock::WriteToDisk() : ftell failed");
963 // Flush stdio buffers and commit to disk before returning
965 if (!IsInitialBlockDownload() || (nBestHeight+1) % 500 == 0)
968 _commit(_fileno(fileout));
970 fsync(fileno(fileout));
977 bool ReadFromDisk(unsigned int nFile, unsigned int nBlockPos, bool fReadTransactions=true)
981 // Open history file to read
982 CAutoFile filein = OpenBlockFile(nFile, nBlockPos, "rb");
984 return error("CBlock::ReadFromDisk() : OpenBlockFile failed");
985 if (!fReadTransactions)
986 filein.nType |= SER_BLOCKHEADERONLY;
992 if (!CheckProofOfWork(GetHash(), nBits))
993 return error("CBlock::ReadFromDisk() : errors in block header");
1002 printf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%d)\n",
1003 GetHash().ToString().substr(0,20).c_str(),
1005 hashPrevBlock.ToString().substr(0,20).c_str(),
1006 hashMerkleRoot.ToString().substr(0,10).c_str(),
1007 nTime, nBits, nNonce,
1009 for (unsigned int i = 0; i < vtx.size(); i++)
1014 printf(" vMerkleTree: ");
1015 for (unsigned int i = 0; i < vMerkleTree.size(); i++)
1016 printf("%s ", vMerkleTree[i].ToString().substr(0,10).c_str());
1021 bool DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex);
1022 bool ConnectBlock(CTxDB& txdb, CBlockIndex* pindex);
1023 bool ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions=true);
1024 bool SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew);
1025 bool AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos);
1026 bool CheckBlock() const;
1030 bool SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew);
1038 /** The block chain is a tree shaped structure starting with the
1039 * genesis block at the root, with each block potentially having multiple
1040 * candidates to be the next block. pprev and pnext link a path through the
1041 * main/longest chain. A blockindex may have multiple pprev pointing back
1042 * to it, but pnext will only point forward to the longest branch, or will
1043 * be null if the block is not part of the longest chain.
1048 const uint256* phashBlock;
1052 unsigned int nBlockPos;
1054 CBigNum bnChainWork;
1058 uint256 hashMerkleRoot;
1061 unsigned int nNonce;
1081 CBlockIndex(unsigned int nFileIn, unsigned int nBlockPosIn, CBlock& block)
1087 nBlockPos = nBlockPosIn;
1091 nVersion = block.nVersion;
1092 hashMerkleRoot = block.hashMerkleRoot;
1093 nTime = block.nTime;
1094 nBits = block.nBits;
1095 nNonce = block.nNonce;
1098 CBlock GetBlockHeader() const
1101 block.nVersion = nVersion;
1103 block.hashPrevBlock = pprev->GetBlockHash();
1104 block.hashMerkleRoot = hashMerkleRoot;
1105 block.nTime = nTime;
1106 block.nBits = nBits;
1107 block.nNonce = nNonce;
1111 uint256 GetBlockHash() const
1116 int64 GetBlockTime() const
1118 return (int64)nTime;
1121 CBigNum GetBlockWork() const
1124 bnTarget.SetCompact(nBits);
1127 return (CBigNum(1)<<256) / (bnTarget+1);
1130 bool IsInMainChain() const
1132 return (pnext || this == pindexBest);
1135 bool CheckIndex() const
1137 return CheckProofOfWork(GetBlockHash(), nBits);
1140 bool EraseBlockFromDisk()
1142 // Open history file
1143 CAutoFile fileout = OpenBlockFile(nFile, nBlockPos, "rb+");
1147 // Overwrite with empty null block
1155 enum { nMedianTimeSpan=11 };
1157 int64 GetMedianTimePast() const
1159 int64 pmedian[nMedianTimeSpan];
1160 int64* pbegin = &pmedian[nMedianTimeSpan];
1161 int64* pend = &pmedian[nMedianTimeSpan];
1163 const CBlockIndex* pindex = this;
1164 for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
1165 *(--pbegin) = pindex->GetBlockTime();
1167 std::sort(pbegin, pend);
1168 return pbegin[(pend - pbegin)/2];
1171 int64 GetMedianTime() const
1173 const CBlockIndex* pindex = this;
1174 for (int i = 0; i < nMedianTimeSpan/2; i++)
1177 return GetBlockTime();
1178 pindex = pindex->pnext;
1180 return pindex->GetMedianTimePast();
1185 std::string ToString() const
1187 return strprintf("CBlockIndex(nprev=%08x, pnext=%08x, nFile=%d, nBlockPos=%-6d nHeight=%d, merkle=%s, hashBlock=%s)",
1188 pprev, pnext, nFile, nBlockPos, nHeight,
1189 hashMerkleRoot.ToString().substr(0,10).c_str(),
1190 GetBlockHash().ToString().substr(0,20).c_str());
1195 printf("%s\n", ToString().c_str());
1201 /** Used to marshal pointers into hashes for db storage. */
1202 class CDiskBlockIndex : public CBlockIndex
1214 explicit CDiskBlockIndex(CBlockIndex* pindex) : CBlockIndex(*pindex)
1216 hashPrev = (pprev ? pprev->GetBlockHash() : 0);
1217 hashNext = (pnext ? pnext->GetBlockHash() : 0);
1222 if (!(nType & SER_GETHASH))
1223 READWRITE(nVersion);
1225 READWRITE(hashNext);
1227 READWRITE(nBlockPos);
1231 READWRITE(this->nVersion);
1232 READWRITE(hashPrev);
1233 READWRITE(hashMerkleRoot);
1239 uint256 GetBlockHash() const
1242 block.nVersion = nVersion;
1243 block.hashPrevBlock = hashPrev;
1244 block.hashMerkleRoot = hashMerkleRoot;
1245 block.nTime = nTime;
1246 block.nBits = nBits;
1247 block.nNonce = nNonce;
1248 return block.GetHash();
1252 std::string ToString() const
1254 std::string str = "CDiskBlockIndex(";
1255 str += CBlockIndex::ToString();
1256 str += strprintf("\n hashBlock=%s, hashPrev=%s, hashNext=%s)",
1257 GetBlockHash().ToString().c_str(),
1258 hashPrev.ToString().substr(0,20).c_str(),
1259 hashNext.ToString().substr(0,20).c_str());
1265 printf("%s\n", ToString().c_str());
1276 /** Describes a place in the block chain to another node such that if the
1277 * other node doesn't have the same branch, it can find a recent common trunk.
1278 * The further back it is, the further before the fork it may be.
1283 std::vector<uint256> vHave;
1290 explicit CBlockLocator(const CBlockIndex* pindex)
1295 explicit CBlockLocator(uint256 hashBlock)
1297 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
1298 if (mi != mapBlockIndex.end())
1302 CBlockLocator(const std::vector<uint256>& vHaveIn)
1309 if (!(nType & SER_GETHASH))
1310 READWRITE(nVersion);
1321 return vHave.empty();
1324 void Set(const CBlockIndex* pindex)
1330 vHave.push_back(pindex->GetBlockHash());
1332 // Exponentially larger steps back
1333 for (int i = 0; pindex && i < nStep; i++)
1334 pindex = pindex->pprev;
1335 if (vHave.size() > 10)
1338 vHave.push_back(hashGenesisBlock);
1341 int GetDistanceBack()
1343 // Retrace how far back it was in the sender's branch
1346 BOOST_FOREACH(const uint256& hash, vHave)
1348 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1349 if (mi != mapBlockIndex.end())
1351 CBlockIndex* pindex = (*mi).second;
1352 if (pindex->IsInMainChain())
1362 CBlockIndex* GetBlockIndex()
1364 // Find the first block the caller has in the main chain
1365 BOOST_FOREACH(const uint256& hash, vHave)
1367 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1368 if (mi != mapBlockIndex.end())
1370 CBlockIndex* pindex = (*mi).second;
1371 if (pindex->IsInMainChain())
1375 return pindexGenesisBlock;
1378 uint256 GetBlockHash()
1380 // Find the first block the caller has in the main chain
1381 BOOST_FOREACH(const uint256& hash, vHave)
1383 std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
1384 if (mi != mapBlockIndex.end())
1386 CBlockIndex* pindex = (*mi).second;
1387 if (pindex->IsInMainChain())
1391 return hashGenesisBlock;
1396 CBlockIndex* pindex = GetBlockIndex();
1399 return pindex->nHeight;
1411 /** Alerts are for notifying old versions if they become too obsolete and
1412 * need to upgrade. The message is displayed in the status bar.
1413 * Alert messages are broadcast as a vector of signed data. Unserializing may
1414 * not read the entire buffer if the alert is for a newer version, but older
1415 * versions can still relay the original data.
1417 class CUnsignedAlert
1421 int64 nRelayUntil; // when newer nodes stop relaying to newer nodes
1425 std::set<int> setCancel;
1426 int nMinVer; // lowest version inclusive
1427 int nMaxVer; // highest version inclusive
1428 std::set<std::string> setSubVer; // empty matches all
1432 std::string strComment;
1433 std::string strStatusBar;
1434 std::string strReserved;
1438 READWRITE(this->nVersion);
1439 nVersion = this->nVersion;
1440 READWRITE(nRelayUntil);
1441 READWRITE(nExpiration);
1444 READWRITE(setCancel);
1447 READWRITE(setSubVer);
1448 READWRITE(nPriority);
1450 READWRITE(strComment);
1451 READWRITE(strStatusBar);
1452 READWRITE(strReserved);
1469 strStatusBar.clear();
1470 strReserved.clear();
1473 std::string ToString() const
1475 std::string strSetCancel;
1476 BOOST_FOREACH(int n, setCancel)
1477 strSetCancel += strprintf("%d ", n);
1478 std::string strSetSubVer;
1479 BOOST_FOREACH(std::string str, setSubVer)
1480 strSetSubVer += "\"" + str + "\" ";
1484 " nRelayUntil = %"PRI64d"\n"
1485 " nExpiration = %"PRI64d"\n"
1493 " strComment = \"%s\"\n"
1494 " strStatusBar = \"%s\"\n"
1501 strSetCancel.c_str(),
1504 strSetSubVer.c_str(),
1507 strStatusBar.c_str());
1512 printf("%s", ToString().c_str());
1516 /** An alert is a combination of a serialized CUnsignedAlert and a signature. */
1517 class CAlert : public CUnsignedAlert
1520 std::vector<unsigned char> vchMsg;
1521 std::vector<unsigned char> vchSig;
1536 CUnsignedAlert::SetNull();
1543 return (nExpiration == 0);
1546 uint256 GetHash() const
1548 return SerializeHash(*this);
1551 bool IsInEffect() const
1553 return (GetAdjustedTime() < nExpiration);
1556 bool Cancels(const CAlert& alert) const
1559 return false; // this was a no-op before 31403
1560 return (alert.nID <= nCancel || setCancel.count(alert.nID));
1563 bool AppliesTo(int nVersion, std::string strSubVerIn) const
1565 // TODO: rework for client-version-embedded-in-strSubVer ?
1566 return (IsInEffect() &&
1567 nMinVer <= nVersion && nVersion <= nMaxVer &&
1568 (setSubVer.empty() || setSubVer.count(strSubVerIn)));
1571 bool AppliesToMe() const
1573 return AppliesTo(PROTOCOL_VERSION, FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, std::vector<std::string>()));
1576 bool RelayTo(CNode* pnode) const
1580 // returns true if wasn't already contained in the set
1581 if (pnode->setKnown.insert(GetHash()).second)
1583 if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||
1585 GetAdjustedTime() < nRelayUntil)
1587 pnode->PushMessage("alert", *this);
1594 bool CheckSignature()
1597 if (!key.SetPubKey(ParseHex("04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284")))
1598 return error("CAlert::CheckSignature() : SetPubKey failed");
1599 if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))
1600 return error("CAlert::CheckSignature() : verify signature failed");
1602 // Now unserialize the data
1603 CDataStream sMsg(vchMsg);
1604 sMsg >> *(CUnsignedAlert*)this;
1608 bool ProcessAlert();