You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

main.h 21KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478
  1. // Copyright (c) 2009-2010 Satoshi Nakamoto
  2. // Copyright (c) 2009-2014 The Bitcoin Core developers
  3. // Distributed under the MIT software license, see the accompanying
  4. // file COPYING or http://www.opensource.org/licenses/mit-license.php.
  5. #ifndef BITCOIN_MAIN_H
  6. #define BITCOIN_MAIN_H
  7. #if defined(HAVE_CONFIG_H)
  8. #include "config/bitcoin-config.h"
  9. #endif
  10. #include "amount.h"
  11. #include "chain.h"
  12. #include "coins.h"
  13. #include "net.h"
  14. #include "script/script_error.h"
  15. #include "sync.h"
  16. #include <algorithm>
  17. #include <exception>
  18. #include <map>
  19. #include <set>
  20. #include <stdint.h>
  21. #include <string>
  22. #include <utility>
  23. #include <vector>
  24. #include <boost/unordered_map.hpp>
  25. class CBlockIndex;
  26. class CBlockTreeDB;
  27. class CBloomFilter;
  28. class CInv;
  29. class CScriptCheck;
  30. class CTxMemPool;
  31. class CValidationInterface;
  32. class CValidationState;
  33. struct CNodeStateStats;
  34. /** Default for accepting alerts from the P2P network. */
  35. static const bool DEFAULT_ALERTS = true;
  36. /** Default for -maxorphantx, maximum number of orphan transactions kept in memory */
  37. static const unsigned int DEFAULT_MAX_ORPHAN_TRANSACTIONS = 100;
  38. /** Default for -limitancestorcount, max number of in-mempool ancestors */
  39. static const unsigned int DEFAULT_ANCESTOR_LIMIT = 100;
  40. /** Default for -limitancestorsize, maximum kilobytes of tx + all in-mempool ancestors */
  41. static const unsigned int DEFAULT_ANCESTOR_SIZE_LIMIT = 900;
  42. /** Default for -limitdescendantcount, max number of in-mempool descendants */
  43. static const unsigned int DEFAULT_DESCENDANT_LIMIT = 1000;
  44. /** Default for -limitdescendantsize, maximum kilobytes of in-mempool descendants */
  45. static const unsigned int DEFAULT_DESCENDANT_SIZE_LIMIT = 2500;
  46. /** The maximum size of a blk?????.dat file (since 0.8) */
  47. static const unsigned int MAX_BLOCKFILE_SIZE = 0x8000000; // 128 MiB
  48. /** The pre-allocation chunk size for blk?????.dat files (since 0.8) */
  49. static const unsigned int BLOCKFILE_CHUNK_SIZE = 0x1000000; // 16 MiB
  50. /** The pre-allocation chunk size for rev?????.dat files (since 0.8) */
  51. static const unsigned int UNDOFILE_CHUNK_SIZE = 0x100000; // 1 MiB
  52. /** Maximum number of script-checking threads allowed */
  53. static const int MAX_SCRIPTCHECK_THREADS = 16;
  54. /** -par default (number of script-checking threads, 0 = auto) */
  55. static const int DEFAULT_SCRIPTCHECK_THREADS = 0;
  56. /** Number of blocks that can be requested at any given time from a single peer. */
  57. static const int MAX_BLOCKS_IN_TRANSIT_PER_PEER = 16;
  58. /** Timeout in seconds during which a peer must stall block download progress before being disconnected. */
  59. static const unsigned int BLOCK_STALLING_TIMEOUT = 2;
  60. /** Number of headers sent in one getheaders result. We rely on the assumption that if a peer sends
  61. * less than this number, we reached its tip. Changing this value is a protocol upgrade. */
  62. static const unsigned int MAX_HEADERS_RESULTS = 2000;
  63. /** Size of the "block download window": how far ahead of our current height do we fetch?
  64. * Larger windows tolerate larger download speed differences between peer, but increase the potential
  65. * degree of disordering of blocks on disk (which make reindexing and in the future perhaps pruning
  66. * harder). We'll probably want to make this a per-peer adaptive value at some point. */
  67. static const unsigned int BLOCK_DOWNLOAD_WINDOW = 1024;
  68. /** Time to wait (in seconds) between writing blocks/block index to disk. */
  69. static const unsigned int DATABASE_WRITE_INTERVAL = 60 * 60;
  70. /** Time to wait (in seconds) between flushing chainstate to disk. */
  71. static const unsigned int DATABASE_FLUSH_INTERVAL = 24 * 60 * 60;
  72. /** Maximum length of reject messages. */
  73. static const unsigned int MAX_REJECT_MESSAGE_LENGTH = 111;
  74. struct BlockHasher
  75. {
  76. size_t operator()(const uint256& hash) const { return hash.GetCheapHash(); }
  77. };
  78. extern CScript COINBASE_FLAGS;
  79. extern CCriticalSection cs_main;
  80. extern CTxMemPool mempool;
  81. typedef boost::unordered_map<uint256, CBlockIndex*, BlockHasher> BlockMap;
  82. extern BlockMap mapBlockIndex;
  83. extern uint64_t nLastBlockTx;
  84. extern uint64_t nLastBlockSize;
  85. extern const std::string strMessageMagic;
  86. extern CWaitableCriticalSection csBestBlock;
  87. extern CConditionVariable cvBlockChange;
  88. extern bool fImporting;
  89. extern bool fReindex;
  90. extern int nScriptCheckThreads;
  91. extern bool fTxIndex;
  92. extern bool fIsBareMultisigStd;
  93. extern bool fRequireStandard;
  94. extern bool fCheckBlockIndex;
  95. extern bool fCheckpointsEnabled;
  96. extern size_t nCoinCacheUsage;
  97. extern CFeeRate minRelayTxFee;
  98. extern bool fAlerts;
  99. /** Best header we've seen so far (used for getheaders queries' starting points). */
  100. extern CBlockIndex *pindexBestHeader;
  101. /** Minimum disk space required - used in CheckDiskSpace() */
  102. static const uint64_t nMinDiskSpace = 52428800;
  103. /** Pruning-related variables and constants */
  104. /** True if any block files have ever been pruned. */
  105. extern bool fHavePruned;
  106. /** True if we're running in -prune mode. */
  107. extern bool fPruneMode;
  108. /** Number of MiB of block files that we're trying to stay below. */
  109. extern uint64_t nPruneTarget;
  110. /** Block files containing a block-height within MIN_BLOCKS_TO_KEEP of chainActive.Tip() will not be pruned. */
  111. static const unsigned int MIN_BLOCKS_TO_KEEP = 288;
  112. // Require that user allocate at least 550MB for block & undo files (blk???.dat and rev???.dat)
  113. // At 1MB per block, 288 blocks = 288MB.
  114. // Add 15% for Undo data = 331MB
  115. // Add 20% for Orphan block rate = 397MB
  116. // We want the low water mark after pruning to be at least 397 MB and since we prune in
  117. // full block file chunks, we need the high water mark which triggers the prune to be
  118. // one 128MB block file + added 15% undo data = 147MB greater for a total of 545MB
  119. // Setting the target to > than 550MB will make it likely we can respect the target.
  120. static const uint64_t MIN_DISK_SPACE_FOR_BLOCK_FILES = 550 * 1024 * 1024;
  121. /** Register with a network node to receive its signals */
  122. void RegisterNodeSignals(CNodeSignals& nodeSignals);
  123. /** Unregister a network node */
  124. void UnregisterNodeSignals(CNodeSignals& nodeSignals);
  125. /**
  126. * Process an incoming block. This only returns after the best known valid
  127. * block is made active. Note that it does not, however, guarantee that the
  128. * specific block passed to it has been checked for validity!
  129. *
  130. * @param[out] state This may be set to an Error state if any error occurred processing it, including during validation/connection/etc of otherwise unrelated blocks during reorganisation; or it may be set to an Invalid state if pblock is itself invalid (but this is not guaranteed even when the block is checked). If you want to *possibly* get feedback on whether pblock is valid, you must also install a CValidationInterface (see validationinterface.h) - this will have its BlockChecked method called whenever *any* block completes validation.
  131. * @param[in] pfrom The node which we are receiving the block from; it is added to mapBlockSource and may be penalised if the block is invalid.
  132. * @param[in] pblock The block we want to process.
  133. * @param[in] fForceProcessing Process this block even if unrequested; used for non-network block sources and whitelisted peers.
  134. * @param[out] dbp If pblock is stored to disk (or already there), this will be set to its location.
  135. * @return True if state.IsValid()
  136. */
  137. bool ProcessNewBlock(CValidationState &state, const CNode* pfrom, const CBlock* pblock, bool fForceProcessing, CDiskBlockPos *dbp);
  138. /** Check whether enough disk space is available for an incoming block */
  139. bool CheckDiskSpace(uint64_t nAdditionalBytes = 0);
  140. /** Open a block file (blk?????.dat) */
  141. FILE* OpenBlockFile(const CDiskBlockPos &pos, bool fReadOnly = false);
  142. /** Open an undo file (rev?????.dat) */
  143. FILE* OpenUndoFile(const CDiskBlockPos &pos, bool fReadOnly = false);
  144. /** Translation to a filesystem path */
  145. boost::filesystem::path GetBlockPosFilename(const CDiskBlockPos &pos, const char *prefix);
  146. /** Import blocks from an external file */
  147. bool LoadExternalBlockFile(FILE* fileIn, CDiskBlockPos *dbp = NULL);
  148. /** Initialize a new block tree database + block data on disk */
  149. bool InitBlockIndex();
  150. /** Load the block tree and coins database from disk */
  151. bool LoadBlockIndex();
  152. /** Unload database information */
  153. void UnloadBlockIndex();
  154. /** Process protocol messages received from a given node */
  155. bool ProcessMessages(CNode* pfrom);
  156. /**
  157. * Send queued protocol messages to be sent to a give node.
  158. *
  159. * @param[in] pto The node which we are sending messages to.
  160. * @param[in] fSendTrickle When true send the trickled data, otherwise trickle the data until true.
  161. */
  162. bool SendMessages(CNode* pto, bool fSendTrickle);
  163. /** Run an instance of the script checking thread */
  164. void ThreadScriptCheck();
  165. /** Try to detect Partition (network isolation) attacks against us */
  166. void PartitionCheck(bool (*initialDownloadCheck)(), CCriticalSection& cs, const CBlockIndex *const &bestHeader, int64_t nPowTargetSpacing);
  167. /** Check whether we are doing an initial block download (synchronizing from disk or network) */
  168. bool IsInitialBlockDownload();
  169. /** Format a string that describes several potential problems detected by the core */
  170. std::string GetWarnings(const std::string& strFor);
  171. /** Retrieve a transaction (from memory pool, or from disk, if possible) */
  172. bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock, bool fAllowSlow = false);
  173. /** Find the best known block, and make it the tip of the block chain */
  174. bool ActivateBestChain(CValidationState &state, const CBlock *pblock = NULL);
  175. CAmount GetBlockSubsidy(int nHeight, const Consensus::Params& consensusParams);
  176. /**
  177. * Prune block and undo files (blk???.dat and undo???.dat) so that the disk space used is less than a user-defined target.
  178. * The user sets the target (in MB) on the command line or in config file. This will be run on startup and whenever new
  179. * space is allocated in a block or undo file, staying below the target. Changing back to unpruned requires a reindex
  180. * (which in this case means the blockchain must be re-downloaded.)
  181. *
  182. * Pruning functions are called from FlushStateToDisk when the global fCheckForPruning flag has been set.
  183. * Block and undo files are deleted in lock-step (when blk00003.dat is deleted, so is rev00003.dat.)
  184. * Pruning cannot take place until the longest chain is at least a certain length (100000 on mainnet, 1000 on testnet, 10 on regtest).
  185. * Pruning will never delete a block within a defined distance (currently 288) from the active chain's tip.
  186. * The block index is updated by unsetting HAVE_DATA and HAVE_UNDO for any blocks that were stored in the deleted files.
  187. * A db flag records the fact that at least some block files have been pruned.
  188. *
  189. * @param[out] setFilesToPrune The set of file indices that can be unlinked will be returned
  190. */
  191. void FindFilesToPrune(std::set<int>& setFilesToPrune);
  192. /**
  193. * Actually unlink the specified files
  194. */
  195. void UnlinkPrunedFiles(std::set<int>& setFilesToPrune);
  196. /** Create a new block index entry for a given block hash */
  197. CBlockIndex * InsertBlockIndex(uint256 hash);
  198. /** Get statistics from node state */
  199. bool GetNodeStateStats(NodeId nodeid, CNodeStateStats &stats);
  200. /** Increase a node's misbehavior score. */
  201. void Misbehaving(NodeId nodeid, int howmuch);
  202. /** Flush all state, indexes and buffers to disk. */
  203. void FlushStateToDisk();
  204. /** Prune block files and flush state to disk. */
  205. void PruneAndFlush();
  206. /** (try to) add transaction to memory pool **/
  207. bool AcceptToMemoryPool(CTxMemPool& pool, CValidationState &state, const CTransaction &tx, bool fLimitFree,
  208. bool* pfMissingInputs, bool fRejectAbsurdFee=false);
  209. struct CNodeStateStats {
  210. int nMisbehavior;
  211. int nSyncHeight;
  212. int nCommonHeight;
  213. std::vector<int> vHeightInFlight;
  214. };
  215. struct CDiskTxPos : public CDiskBlockPos
  216. {
  217. unsigned int nTxOffset; // after header
  218. ADD_SERIALIZE_METHODS;
  219. template <typename Stream, typename Operation>
  220. inline void SerializationOp(Stream& s, Operation ser_action, int nType, int nVersion) {
  221. READWRITE(*(CDiskBlockPos*)this);
  222. READWRITE(VARINT(nTxOffset));
  223. }
  224. CDiskTxPos(const CDiskBlockPos &blockIn, unsigned int nTxOffsetIn) : CDiskBlockPos(blockIn.nFile, blockIn.nPos), nTxOffset(nTxOffsetIn) {
  225. }
  226. CDiskTxPos() {
  227. SetNull();
  228. }
  229. void SetNull() {
  230. CDiskBlockPos::SetNull();
  231. nTxOffset = 0;
  232. }
  233. };
  234. CAmount GetMinRelayFee(const CTransaction& tx, unsigned int nBytes, bool fAllowFree);
  235. /**
  236. * Count ECDSA signature operations the old-fashioned (pre-0.6) way
  237. * @return number of sigops this transaction's outputs will produce when spent
  238. * @see CTransaction::FetchInputs
  239. */
  240. unsigned int GetLegacySigOpCount(const CTransaction& tx);
  241. /**
  242. * Count ECDSA signature operations in pay-to-script-hash inputs.
  243. *
  244. * @param[in] mapInputs Map of previous transactions that have outputs we're spending
  245. * @return maximum number of sigops required to validate this transaction's inputs
  246. * @see CTransaction::FetchInputs
  247. */
  248. unsigned int GetP2SHSigOpCount(const CTransaction& tx, const CCoinsViewCache& mapInputs);
  249. /**
  250. * Check whether all inputs of this transaction are valid (no double spends, scripts & sigs, amounts)
  251. * This does not modify the UTXO set. If pvChecks is not NULL, script checks are pushed onto it
  252. * instead of being performed inline.
  253. */
  254. bool CheckInputs(const CTransaction& tx, CValidationState &state, const CCoinsViewCache &view, bool fScriptChecks,
  255. unsigned int flags, bool cacheStore, std::vector<CScriptCheck> *pvChecks = NULL);
  256. /** Apply the effects of this transaction on the UTXO set represented by view */
  257. void UpdateCoins(const CTransaction& tx, CValidationState &state, CCoinsViewCache &inputs, int nHeight);
  258. /** Context-independent validity checks */
  259. bool CheckTransaction(const CTransaction& tx, CValidationState& state);
  260. /**
  261. * Check if transaction is final and can be included in a block with the
  262. * specified height and time. Consensus critical.
  263. */
  264. bool IsFinalTx(const CTransaction &tx, int nBlockHeight, int64_t nBlockTime);
  265. /**
  266. * Check if transaction will be final in the next block to be created.
  267. *
  268. * Calls IsFinalTx() with current block height and appropriate block time.
  269. */
  270. bool CheckFinalTx(const CTransaction &tx);
  271. /**
  272. * Closure representing one script verification
  273. * Note that this stores references to the spending transaction
  274. */
  275. class CScriptCheck
  276. {
  277. private:
  278. CScript scriptPubKey;
  279. const CTransaction *ptxTo;
  280. unsigned int nIn;
  281. unsigned int nFlags;
  282. bool cacheStore;
  283. ScriptError error;
  284. public:
  285. CScriptCheck(): ptxTo(0), nIn(0), nFlags(0), cacheStore(false), error(SCRIPT_ERR_UNKNOWN_ERROR) {}
  286. CScriptCheck(const CCoins& txFromIn, const CTransaction& txToIn, unsigned int nInIn, unsigned int nFlagsIn, bool cacheIn) :
  287. scriptPubKey(txFromIn.vout[txToIn.vin[nInIn].prevout.n].scriptPubKey),
  288. ptxTo(&txToIn), nIn(nInIn), nFlags(nFlagsIn), cacheStore(cacheIn), error(SCRIPT_ERR_UNKNOWN_ERROR) { }
  289. bool operator()();
  290. void swap(CScriptCheck &check) {
  291. scriptPubKey.swap(check.scriptPubKey);
  292. std::swap(ptxTo, check.ptxTo);
  293. std::swap(nIn, check.nIn);
  294. std::swap(nFlags, check.nFlags);
  295. std::swap(cacheStore, check.cacheStore);
  296. std::swap(error, check.error);
  297. }
  298. ScriptError GetScriptError() const { return error; }
  299. };
  300. /** Functions for disk access for blocks */
  301. bool WriteBlockToDisk(const CBlock& block, CDiskBlockPos& pos, const CMessageHeader::MessageStartChars& messageStart);
  302. bool ReadBlockFromDisk(CBlock& block, const CDiskBlockPos& pos);
  303. bool ReadBlockFromDisk(CBlock& block, const CBlockIndex* pindex);
  304. /** Functions for validating blocks and updating the block tree */
  305. /** Undo the effects of this block (with given index) on the UTXO set represented by coins.
  306. * In case pfClean is provided, operation will try to be tolerant about errors, and *pfClean
  307. * will be true if no problems were found. Otherwise, the return value will be false in case
  308. * of problems. Note that in any case, coins may be modified. */
  309. bool DisconnectBlock(const CBlock& block, CValidationState& state, const CBlockIndex* pindex, CCoinsViewCache& coins, bool* pfClean = NULL);
  310. /** Apply the effects of this block (with given index) on the UTXO set represented by coins */
  311. bool ConnectBlock(const CBlock& block, CValidationState& state, CBlockIndex* pindex, CCoinsViewCache& coins, bool fJustCheck = false);
  312. /** Context-independent validity checks */
  313. bool CheckBlockHeader(const CBlockHeader& block, CValidationState& state, bool fCheckPOW = true);
  314. bool CheckBlock(const CBlock& block, CValidationState& state, bool fCheckPOW = true, bool fCheckMerkleRoot = true);
  315. /** Context-dependent validity checks */
  316. bool ContextualCheckBlockHeader(const CBlockHeader& block, CValidationState& state, CBlockIndex *pindexPrev);
  317. bool ContextualCheckBlock(const CBlock& block, CValidationState& state, CBlockIndex *pindexPrev);
  318. /** Check a block is completely valid from start to finish (only works on top of our current best block, with cs_main held) */
  319. bool TestBlockValidity(CValidationState &state, const CBlock& block, CBlockIndex *pindexPrev, bool fCheckPOW = true, bool fCheckMerkleRoot = true);
  320. /** Store block on disk. If dbp is non-NULL, the file is known to already reside on disk */
  321. bool AcceptBlock(const CBlock& block, CValidationState& state, CBlockIndex **pindex, bool fRequested, CDiskBlockPos* dbp);
  322. bool AcceptBlockHeader(const CBlockHeader& block, CValidationState& state, CBlockIndex **ppindex= NULL);
  323. class CBlockFileInfo
  324. {
  325. public:
  326. unsigned int nBlocks; //! number of blocks stored in file
  327. unsigned int nSize; //! number of used bytes of block file
  328. unsigned int nUndoSize; //! number of used bytes in the undo file
  329. unsigned int nHeightFirst; //! lowest height of block in file
  330. unsigned int nHeightLast; //! highest height of block in file
  331. uint64_t nTimeFirst; //! earliest time of block in file
  332. uint64_t nTimeLast; //! latest time of block in file
  333. ADD_SERIALIZE_METHODS;
  334. template <typename Stream, typename Operation>
  335. inline void SerializationOp(Stream& s, Operation ser_action, int nType, int nVersion) {
  336. READWRITE(VARINT(nBlocks));
  337. READWRITE(VARINT(nSize));
  338. READWRITE(VARINT(nUndoSize));
  339. READWRITE(VARINT(nHeightFirst));
  340. READWRITE(VARINT(nHeightLast));
  341. READWRITE(VARINT(nTimeFirst));
  342. READWRITE(VARINT(nTimeLast));
  343. }
  344. void SetNull() {
  345. nBlocks = 0;
  346. nSize = 0;
  347. nUndoSize = 0;
  348. nHeightFirst = 0;
  349. nHeightLast = 0;
  350. nTimeFirst = 0;
  351. nTimeLast = 0;
  352. }
  353. CBlockFileInfo() {
  354. SetNull();
  355. }
  356. std::string ToString() const;
  357. /** update statistics (does not update nSize) */
  358. void AddBlock(unsigned int nHeightIn, uint64_t nTimeIn) {
  359. if (nBlocks==0 || nHeightFirst > nHeightIn)
  360. nHeightFirst = nHeightIn;
  361. if (nBlocks==0 || nTimeFirst > nTimeIn)
  362. nTimeFirst = nTimeIn;
  363. nBlocks++;
  364. if (nHeightIn > nHeightLast)
  365. nHeightLast = nHeightIn;
  366. if (nTimeIn > nTimeLast)
  367. nTimeLast = nTimeIn;
  368. }
  369. };
  370. /** RAII wrapper for VerifyDB: Verify consistency of the block and coin databases */
  371. class CVerifyDB {
  372. public:
  373. CVerifyDB();
  374. ~CVerifyDB();
  375. bool VerifyDB(CCoinsView *coinsview, int nCheckLevel, int nCheckDepth);
  376. };
  377. /** Find the last common block between the parameter chain and a locator. */
  378. CBlockIndex* FindForkInGlobalIndex(const CChain& chain, const CBlockLocator& locator);
  379. /** Mark a block as invalid. */
  380. bool InvalidateBlock(CValidationState& state, CBlockIndex *pindex);
  381. /** Remove invalidity status from a block and its descendants. */
  382. bool ReconsiderBlock(CValidationState& state, CBlockIndex *pindex);
  383. /** The currently-connected chain of blocks. */
  384. extern CChain chainActive;
  385. /** Global variable that points to the active CCoinsView (protected by cs_main) */
  386. extern CCoinsViewCache *pcoinsTip;
  387. /** Global variable that points to the active block tree (protected by cs_main) */
  388. extern CBlockTreeDB *pblocktree;
  389. /**
  390. * Return the spend height, which is one more than the inputs.GetBestBlock().
  391. * While checking, GetBestBlock() refers to the parent block. (protected by cs_main)
  392. * This is also true for mempool checks.
  393. */
  394. int GetSpendHeight(const CCoinsViewCache& inputs);
  395. /** Reject codes greater or equal to this can be returned by AcceptToMemPool
  396. * for transactions, to signal internal conditions. They cannot and should not
  397. * be sent over the P2P network.
  398. */
  399. static const unsigned int REJECT_INTERNAL = 0x100;
  400. /** Too high fee. Can not be triggered by P2P transactions */
  401. static const unsigned int REJECT_HIGHFEE = 0x100;
  402. /** Transaction is already known (either in mempool or blockchain) */
  403. static const unsigned int REJECT_ALREADY_KNOWN = 0x101;
  404. /** Transaction conflicts with a transaction already known */
  405. static const unsigned int REJECT_CONFLICT = 0x102;
  406. #endif // BITCOIN_MAIN_H