No OneTemporary
Actions

Size

498 KB

Subscribers

None

View Options

This file is larger than 256 KB, so syntax highlighting was skipped.

	diff --git a/src/init.cpp b/src/init.cpp
	index ab031fc95..e94be67d8 100644
	--- a/src/init.cpp
	+++ b/src/init.cpp
	@@ -1,2952 +1,2952 @@
	// Copyright (c) 2009-2010 Satoshi Nakamoto
	// Copyright (c) 2009-2018 The Bitcoin Core developers
	// Distributed under the MIT software license, see the accompanying
	// file COPYING or http://www.opensource.org/licenses/mit-license.php.

	#if defined(HAVE_CONFIG_H)
	#include <config/bitcoin-config.h>
	#endif

	#include <init.h>

	#include <addrman.h>
	#include <avalanche/avalanche.h>
	#include <avalanche/processor.h>
	#include <avalanche/proof.h> // For AVALANCHE_LEGACY_PROOF_DEFAULT
	#include <avalanche/validation.h>
	#include <avalanche/voterecord.h> // For AVALANCHE_VOTE_STALE_*
	#include <banman.h>
	#include <blockfilter.h>
	#include <chain.h>
	#include <chainparams.h>
	#include <compat/sanity.h>
	#include <config.h>
	#include <consensus/amount.h>
	#include <currencyunit.h>
	#include <flatfile.h>
	#include <fs.h>
	#include <hash.h>
	#include <httprpc.h>
	#include <httpserver.h>
	#include <index/blockfilterindex.h>
	#include <index/coinstatsindex.h>
	#include <index/txindex.h>
	#include <init/common.h>
	#include <interfaces/chain.h>
	#include <interfaces/node.h>
	#include <mapport.h>
	#include <mempool_args.h>
	#include <net.h>
	#include <net_permissions.h>
	#include <net_processing.h>
	#include <netbase.h>
	#include <node/blockstorage.h>
	#include <node/caches.h>
	#include <node/chainstate.h>
	#include <node/context.h>
	#include <node/mempool_persist_args.h>
	#include <node/miner.h>
	#include <node/ui_interface.h>
	#include <policy/policy.h>
	#include <policy/settings.h>
	#include <rpc/blockchain.h>
	#include <rpc/register.h>
	#include <rpc/server.h>
	#include <rpc/util.h>
	#include <scheduler.h>
	#include <script/scriptcache.h>
	#include <script/sigcache.h>
	#include <script/standard.h>
	#include <shutdown.h>
	#include <sync.h>
	#include <timedata.h>
	#include <torcontrol.h>
	#include <txdb.h>
	#include <txmempool.h>
	#include <txorphanage.h>
	#include <util/asmap.h>
	#include <util/check.h>
	#include <util/moneystr.h>
	#include <util/string.h>
	#include <util/thread.h>
	#include <util/threadnames.h>
	#include <util/translation.h>
	#include <validation.h>
	#include <validationinterface.h>
	#include <walletinitinterface.h>

	#include <boost/signals2/signal.hpp>

	#if ENABLE_CHRONIK
	#include <chronik-cpp/chronik.h>
	#endif

	#if ENABLE_ZMQ
	#include <zmq/zmqabstractnotifier.h>
	#include <zmq/zmqnotificationinterface.h>
	#include <zmq/zmqrpc.h>
	#endif

	#ifndef WIN32
	#include <cerrno>
	#include <csignal>
	#include <sys/stat.h>
	#endif
	#include <algorithm>
	#include <condition_variable>
	#include <cstdint>
	#include <cstdio>
	#include <fstream>
	#include <functional>
	#include <set>
	#include <string>
	#include <thread>
	#include <vector>

	using node::CacheSizes;
	using node::CalculateCacheSizes;
	using node::CleanupBlockRevFiles;
	using node::DEFAULT_STOPAFTERBLOCKIMPORT;
	using node::fPruneMode;
	using node::fReindex;
	using node::LoadChainstate;
	using node::MempoolPath;
	using node::NodeContext;
	using node::nPruneTarget;
	using node::ShouldPersistMempool;
	using node::ThreadImport;
	using node::VerifyLoadedChainstate;

	static const bool DEFAULT_PROXYRANDOMIZE = true;
	static const bool DEFAULT_REST_ENABLE = false;
	static constexpr bool DEFAULT_CHRONIK = false;

	#ifdef WIN32
	// Win32 LevelDB doesn't use filedescriptors, and the ones used for accessing
	// block files don't count towards the fd_set size limit anyway.
	#define MIN_CORE_FILEDESCRIPTORS 0
	#else
	#define MIN_CORE_FILEDESCRIPTORS 150
	#endif

	static const char *DEFAULT_ASMAP_FILENAME = "ip_asn.map";

	/**
	* The PID file facilities.
	*/
	static const char *BITCOIN_PID_FILENAME = "bitcoind.pid";

	static fs::path GetPidFile(const ArgsManager &args) {
	return AbsPathForConfigVal(args.GetPathArg("-pid", BITCOIN_PID_FILENAME));
	}

	[[nodiscard]] static bool CreatePidFile(const ArgsManager &args) {
	std::ofstream file{GetPidFile(args)};
	if (file) {
	#ifdef WIN32
	tfm::format(file, "%d\n", GetCurrentProcessId());
	#else
	tfm::format(file, "%d\n", getpid());
	#endif
	return true;
	} else {
	return InitError(strprintf(_("Unable to create the PID file '%s': %s"),
	fs::PathToString(GetPidFile(args)),
	std::strerror(errno)));
	}
	}

	//////////////////////////////////////////////////////////////////////////////
	//
	// Shutdown
	//

	//
	// Thread management and startup/shutdown:
	//
	// The network-processing threads are all part of a thread group created by
	// AppInit() or the Qt main() function.
	//
	// A clean exit happens when StartShutdown() or the SIGTERM signal handler sets
	// fRequestShutdown, which makes main thread's WaitForShutdown() interrupts the
	// thread group.
	// And then, WaitForShutdown() makes all other on-going threads in the thread
	// group join the main thread.
	// Shutdown() is then called to clean up database connections, and stop other
	// threads that should only be stopped after the main network-processing threads
	// have exited.
	//
	// Shutdown for Qt is very similar, only it uses a QTimer to detect
	// ShutdownRequested() getting set, and then does the normal Qt shutdown thing.
	//

	void Interrupt(NodeContext &node) {
	InterruptHTTPServer();
	InterruptHTTPRPC();
	InterruptRPC();
	InterruptREST();
	InterruptTorControl();
	InterruptMapPort();
	if (g_avalanche) {
	// Avalanche needs to be stopped before we interrupt the thread group as
	// the scheduler will stop working then.
	g_avalanche->stopEventLoop();
	}
	if (node.connman) {
	node.connman->Interrupt();
	}
	if (g_txindex) {
	g_txindex->Interrupt();
	}
	ForEachBlockFilterIndex([](BlockFilterIndex &index) { index.Interrupt(); });
	if (g_coin_stats_index) {
	g_coin_stats_index->Interrupt();
	}
	}

	void Shutdown(NodeContext &node) {
	static Mutex g_shutdown_mutex;
	TRY_LOCK(g_shutdown_mutex, lock_shutdown);
	if (!lock_shutdown) {
	return;
	}
	LogPrintf("%s: In progress...\n", __func__);
	Assert(node.args);

	/// Note: Shutdown() must be able to handle cases in which initialization
	/// failed part of the way, for example if the data directory was found to
	/// be locked. Be sure that anything that writes files or flushes caches
	/// only does this if the respective module was initialized.
	util::ThreadRename("shutoff");
	if (node.mempool) {
	node.mempool->AddTransactionsUpdated(1);
	}

	StopHTTPRPC();
	StopREST();
	StopRPC();
	StopHTTPServer();
	for (const auto &client : node.chain_clients) {
	client->flush();
	}
	StopMapPort();

	// Because avalanche and the network depend on each other, it is important
	// to shut them down in this order:
	// 1. Stop avalanche event loop.
	// 2. Shutdown network processing.
	// 3. Destroy avalanche::Processor.
	// 4. Destroy CConnman
	if (g_avalanche) {
	g_avalanche->stopEventLoop();
	}

	// Because these depend on each-other, we make sure that neither can be
	// using the other before destroying them.
	if (node.peerman) {
	UnregisterValidationInterface(node.peerman.get());
	}
	if (node.connman) {
	node.connman->Stop();
	}

	StopTorControl();

	// After everything has been shut down, but before things get flushed, stop
	// the CScheduler/checkqueue, scheduler and load block thread.
	if (node.scheduler) {
	node.scheduler->stop();
	}
	if (node.chainman && node.chainman->m_load_block.joinable()) {
	node.chainman->m_load_block.join();
	}
	StopScriptCheckWorkerThreads();

	// After the threads that potentially access these pointers have been
	// stopped, destruct and reset all to nullptr.
	node.peerman.reset();

	// Destroy various global instances
	g_avalanche.reset();
	node.connman.reset();
	node.banman.reset();
	node.addrman.reset();

	- if (node.mempool && node.mempool->IsLoaded() &&
	+ if (node.mempool && node.mempool->GetLoadTried() &&
	ShouldPersistMempool(*node.args)) {
	DumpMempool(node.mempool, MempoolPath(node.args));
	}

	// FlushStateToDisk generates a ChainStateFlushed callback, which we should
	// avoid missing
	if (node.chainman) {
	LOCK(cs_main);
	for (Chainstate *chainstate : node.chainman->GetAll()) {
	if (chainstate->CanFlushToDisk()) {
	chainstate->ForceFlushStateToDisk();
	}
	}
	}

	// After there are no more peers/RPC left to give us new data which may
	// generate CValidationInterface callbacks, flush them...
	GetMainSignals().FlushBackgroundCallbacks();

	#if ENABLE_CHRONIK
	chronik::Stop();
	#endif

	// Stop and delete all indexes only after flushing background callbacks.
	if (g_txindex) {
	g_txindex->Stop();
	g_txindex.reset();
	}
	if (g_coin_stats_index) {
	g_coin_stats_index->Stop();
	g_coin_stats_index.reset();
	}
	ForEachBlockFilterIndex([](BlockFilterIndex &index) { index.Stop(); });
	DestroyAllBlockFilterIndexes();

	// Any future callbacks will be dropped. This should absolutely be safe - if
	// missing a callback results in an unrecoverable situation, unclean
	// shutdown would too. The only reason to do the above flushes is to let the
	// wallet catch up with our current chain to avoid any strange pruning edge
	// cases and make next startup faster by avoiding rescan.

	if (node.chainman) {
	LOCK(cs_main);
	for (Chainstate *chainstate : node.chainman->GetAll()) {
	if (chainstate->CanFlushToDisk()) {
	chainstate->ForceFlushStateToDisk();
	chainstate->ResetCoinsViews();
	}
	}
	}
	for (const auto &client : node.chain_clients) {
	client->stop();
	}

	#if ENABLE_ZMQ
	if (g_zmq_notification_interface) {
	UnregisterValidationInterface(g_zmq_notification_interface);
	delete g_zmq_notification_interface;
	g_zmq_notification_interface = nullptr;
	}
	#endif

	node.chain_clients.clear();
	UnregisterAllValidationInterfaces();
	GetMainSignals().UnregisterBackgroundSignalScheduler();
	init::UnsetGlobals();
	node.mempool.reset();
	node.chainman.reset();
	node.scheduler.reset();

	try {
	if (!fs::remove(GetPidFile(*node.args))) {
	LogPrintf("%s: Unable to remove PID file: File does not exist\n",
	__func__);
	}
	} catch (const fs::filesystem_error &e) {
	LogPrintf("%s: Unable to remove PID file: %s\n", __func__,
	fsbridge::get_filesystem_error_message(e));
	}

	LogPrintf("%s: done\n", __func__);
	}

	/**
	* Signal handlers are very limited in what they are allowed to do.
	* The execution context the handler is invoked in is not guaranteed,
	* so we restrict handler operations to just touching variables:
	*/
	#ifndef WIN32
	static void HandleSIGTERM(int) {
	StartShutdown();
	}

	static void HandleSIGHUP(int) {
	LogInstance().m_reopen_file = true;
	}
	#else
	static BOOL WINAPI consoleCtrlHandler(DWORD dwCtrlType) {
	StartShutdown();
	Sleep(INFINITE);
	return true;
	}
	#endif

	#ifndef WIN32
	static void registerSignalHandler(int signal, void (*handler)(int)) {
	struct sigaction sa;
	sa.sa_handler = handler;
	sigemptyset(&sa.sa_mask);
	sa.sa_flags = 0;
	sigaction(signal, &sa, NULL);
	}
	#endif

	static boost::signals2::connection rpc_notify_block_change_connection;
	static void OnRPCStarted() {
	rpc_notify_block_change_connection = uiInterface.NotifyBlockTip_connect(
	std::bind(RPCNotifyBlockChange, std::placeholders::_2));
	}

	static void OnRPCStopped() {
	rpc_notify_block_change_connection.disconnect();
	RPCNotifyBlockChange(nullptr);
	g_best_block_cv.notify_all();
	LogPrint(BCLog::RPC, "RPC stopped.\n");
	}

	void SetupServerArgs(NodeContext &node) {
	assert(!node.args);
	node.args = &gArgs;
	ArgsManager &argsman = *node.args;

	SetupHelpOptions(argsman);
	SetupCurrencyUnitOptions(argsman);
	// server-only for now
	argsman.AddArg("-help-debug",
	"Print help message with debugging options and exit", false,
	OptionsCategory::DEBUG_TEST);

	init::AddLoggingArgs(argsman);

	const auto defaultBaseParams =
	CreateBaseChainParams(CBaseChainParams::MAIN);
	const auto testnetBaseParams =
	CreateBaseChainParams(CBaseChainParams::TESTNET);
	const auto regtestBaseParams =
	CreateBaseChainParams(CBaseChainParams::REGTEST);
	const auto defaultChainParams = CreateChainParams(CBaseChainParams::MAIN);
	const auto testnetChainParams =
	CreateChainParams(CBaseChainParams::TESTNET);
	const auto regtestChainParams =
	CreateChainParams(CBaseChainParams::REGTEST);

	// Hidden Options
	std::vector<std::string> hidden_args = {
	"-dbcrashratio",
	"-forcecompactdb",
	"-maxaddrtosend",
	"-parkdeepreorg",
	"-automaticunparking",
	"-replayprotectionactivationtime",
	"-enableminerfund",
	"-chronikallowpause",
	// GUI args. These will be overwritten by SetupUIArgs for the GUI
	"-allowselfsignedrootcertificates",
	"-choosedatadir",
	"-lang=<lang>",
	"-min",
	"-resetguisettings",
	"-rootcertificates=<file>",
	"-splash",
	"-uiplatform",
	// TODO remove after the May. 2024 upgrade
	"-leekuanyewactivationtime",
	};

	// Set all of the args and their help
	// When adding new options to the categories, please keep and ensure
	// alphabetical ordering. Do not translate _(...) -help-debug options, Many
	// technical terms, and only a very small audience, so is unnecessary stress
	// to translators.
	argsman.AddArg("-version", "Print version and exit", ArgsManager::ALLOW_ANY,
	OptionsCategory::OPTIONS);
	#if defined(HAVE_SYSTEM)
	argsman.AddArg(
	"-alertnotify=<cmd>",
	"Execute command when a relevant alert is received or we see "
	"a really long fork (%s in cmd is replaced by message)",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	#endif
	argsman.AddArg(
	"-assumevalid=<hex>",
	strprintf(
	"If this block is in the chain assume that it and its ancestors "
	"are valid and potentially skip their script verification (0 to "
	"verify all, default: %s, testnet: %s)",
	defaultChainParams->GetConsensus().defaultAssumeValid.GetHex(),
	testnetChainParams->GetConsensus().defaultAssumeValid.GetHex()),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-blocksdir=<dir>",
	"Specify directory to hold blocks subdirectory for *.dat "
	"files (default: <datadir>)",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-fastprune",
	"Use smaller block files and lower minimum prune height for "
	"testing purposes",
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	#if defined(HAVE_SYSTEM)
	argsman.AddArg("-blocknotify=<cmd>",
	"Execute command when the best block changes (%s in cmd is "
	"replaced by block hash)",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	#endif
	argsman.AddArg("-blockreconstructionextratxn=<n>",
	strprintf("Extra transactions to keep in memory for compact "
	"block reconstructions (default: %u)",
	DEFAULT_BLOCK_RECONSTRUCTION_EXTRA_TXN),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-blocksonly",
	strprintf("Whether to reject transactions from network peers. "
	"Automatic broadcast and rebroadcast of any transactions "
	"from inbound peers is disabled, unless the peer has the "
	"'forcerelay' permission. RPC transactions are"
	" not affected. (default: %u)",
	DEFAULT_BLOCKSONLY),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-coinstatsindex",
	strprintf("Maintain coinstats index used by the "
	"gettxoutsetinfo RPC (default: %u)",
	DEFAULT_COINSTATSINDEX),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-conf=<file>",
	strprintf("Specify path to read-only configuration file. Relative "
	"paths will be prefixed by datadir location. (default: %s)",
	BITCOIN_CONF_FILENAME),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-datadir=<dir>", "Specify data directory",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-dbbatchsize",
	strprintf("Maximum database write batch size in bytes (default: %u)",
	DEFAULT_DB_BATCH_SIZE),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-dbcache=<n>",
	strprintf("Set database cache size in MiB (%d to %d, default: %d)",
	MIN_DB_CACHE_MB, MAX_DB_CACHE_MB, DEFAULT_DB_CACHE_MB),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-includeconf=<file>",
	"Specify additional configuration file, relative to the -datadir path "
	"(only useable from configuration file, not command line)",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-loadblock=<file>",
	"Imports blocks from external file on startup",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-maxmempool=<n>",
	strprintf("Keep the transaction memory pool below <n> "
	"megabytes (default: %u)",
	DEFAULT_MAX_MEMPOOL_SIZE_MB),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-maxorphantx=<n>",
	strprintf("Keep at most <n> unconnectable transactions in "
	"memory (default: %u)",
	DEFAULT_MAX_ORPHAN_TRANSACTIONS),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-mempoolexpiry=<n>",
	strprintf("Do not keep transactions in the mempool longer "
	"than <n> hours (default: %u)",
	DEFAULT_MEMPOOL_EXPIRY_HOURS),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-minimumchainwork=<hex>",
	strprintf(
	"Minimum work assumed to exist on a valid chain in hex "
	"(default: %s, testnet: %s)",
	defaultChainParams->GetConsensus().nMinimumChainWork.GetHex(),
	testnetChainParams->GetConsensus().nMinimumChainWork.GetHex()),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-par=<n>",
	strprintf("Set the number of script verification threads (%u to %d, 0 "
	"= auto, <0 = leave that many cores free, default: %d)",
	-GetNumCores(), MAX_SCRIPTCHECK_THREADS,
	DEFAULT_SCRIPTCHECK_THREADS),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg("-persistmempool",
	strprintf("Whether to save the mempool on shutdown and load "
	"on restart (default: %u)",
	DEFAULT_PERSIST_MEMPOOL),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-pid=<file>",
	strprintf("Specify pid file. Relative paths will be prefixed "
	"by a net-specific datadir location. (default: %s)",
	BITCOIN_PID_FILENAME),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-prune=<n>",
	strprintf("Reduce storage requirements by enabling pruning (deleting) "
	"of old blocks. This allows the pruneblockchain RPC to be "
	"called to delete specific blocks, and enables automatic "
	"pruning of old blocks if a target size in MiB is provided. "
	"This mode is incompatible with -txindex, -coinstatsindex "
	"and -rescan. Warning: Reverting this setting requires "
	"re-downloading the entire blockchain. (default: 0 = disable "
	"pruning blocks, 1 = allow manual pruning via RPC, >=%u = "
	"automatically prune block files to stay under the specified "
	"target size in MiB)",
	MIN_DISK_SPACE_FOR_BLOCK_FILES / 1024 / 1024),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-reindex-chainstate",
	"Rebuild chain state from the currently indexed blocks. When "
	"in pruning mode or if blocks on disk might be corrupted, use "
	"full -reindex instead.",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-reindex",
	"Rebuild chain state and block index from the blk*.dat files on disk",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-settings=<file>",
	strprintf(
	"Specify path to dynamic settings data file. Can be disabled with "
	"-nosettings. File is written at runtime and not meant to be "
	"edited by users (use %s instead for custom settings). Relative "
	"paths will be prefixed by datadir location. (default: %s)",
	BITCOIN_CONF_FILENAME, BITCOIN_SETTINGS_FILENAME),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	#if HAVE_SYSTEM
	argsman.AddArg("-startupnotify=<cmd>", "Execute command on startup.",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	#endif
	#ifndef WIN32
	argsman.AddArg(
	"-sysperms",
	"Create new files with system default permissions, instead of umask "
	"077 (only effective with disabled wallet functionality)",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	#else
	hidden_args.emplace_back("-sysperms");
	#endif
	argsman.AddArg("-txindex",
	strprintf("Maintain a full transaction index, used by the "
	"getrawtransaction rpc call (default: %d)",
	DEFAULT_TXINDEX),
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	#if ENABLE_CHRONIK
	argsman.AddArg(
	"-chronik",
	strprintf("Enable the Chronik indexer, which can be read via a "
	"dedicated HTTP/Protobuf interface (default: %d)",
	DEFAULT_CHRONIK),
	ArgsManager::ALLOW_BOOL, OptionsCategory::CHRONIK);
	argsman.AddArg(
	"-chronikbind=<addr>[:port]",
	strprintf(
	"Bind the Chronik indexer to the given address to listen for "
	"HTTP/Protobuf connections to access the index. Unlike the "
	"JSON-RPC, it's ok to have this publicly exposed on the internet. "
	"This option can be specified multiple times (default: %s; default "
	"port: %u, testnet: %u, regtest: %u)",
	Join(chronik::DEFAULT_BINDS, ", "),
	defaultBaseParams->ChronikPort(), testnetBaseParams->ChronikPort(),
	regtestBaseParams->ChronikPort()),
	ArgsManager::ALLOW_STRING \| ArgsManager::NETWORK_ONLY,
	OptionsCategory::CHRONIK);
	argsman.AddArg("-chroniktokenindex",
	"Enable token indexing in Chronik (default: 1)",
	ArgsManager::ALLOW_BOOL, OptionsCategory::CHRONIK);
	argsman.AddArg("-chronikreindex",
	"Reindex the Chronik indexer from genesis, but leave the "
	"other indexes untouched",
	ArgsManager::ALLOW_BOOL, OptionsCategory::CHRONIK);
	argsman.AddArg(
	"-chroniktxnumcachebuckets",
	strprintf(
	"Tuning param of the TxNumCache, specifies how many buckets "
	"to use on the belt. Caution against setting this too high, "
	"it may slow down indexing. Set to 0 to disable. (default: %d)",
	chronik::DEFAULT_TX_NUM_CACHE_BUCKETS),
	ArgsManager::ALLOW_INT, OptionsCategory::CHRONIK);
	argsman.AddArg(
	"-chroniktxnumcachebucketsize",
	strprintf(
	"Tuning param of the TxNumCache, specifies the size of each bucket "
	"on the belt. Unlike the number of buckets, this may be increased "
	"without much danger of slowing the indexer down. The total cache "
	"size will be `num_buckets * bucket_size * 40B`, so by default the "
	"cache will require %dkB of memory. (default: %d)",
	chronik::DEFAULT_TX_NUM_CACHE_BUCKETS *
	chronik::DEFAULT_TX_NUM_CACHE_BUCKET_SIZE * 40 / 1000,
	chronik::DEFAULT_TX_NUM_CACHE_BUCKET_SIZE),
	ArgsManager::ALLOW_INT, OptionsCategory::CHRONIK);
	argsman.AddArg("-chronikperfstats",
	"Output some performance statistics (e.g. num cache hits, "
	"seconds spent) into a <datadir>/perf folder. (default: 0)",
	ArgsManager::ALLOW_BOOL, OptionsCategory::CHRONIK);
	#endif
	argsman.AddArg(
	"-blockfilterindex=<type>",
	strprintf("Maintain an index of compact filters by block "
	"(default: %s, values: %s).",
	DEFAULT_BLOCKFILTERINDEX, ListBlockFilterTypes()) +
	" If <type> is not supplied or if <type> = 1, indexes for "
	"all known types are enabled.",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);
	argsman.AddArg(
	"-usecashaddr",
	"Use Cash Address for destination encoding instead of base58 "
	"(activate by default on Jan, 14)",
	ArgsManager::ALLOW_ANY, OptionsCategory::OPTIONS);

	argsman.AddArg(
	"-addnode=<ip>",
	"Add a node to connect to and attempt to keep the connection "
	"open (see the `addnode` RPC command help for more info)",
	ArgsManager::ALLOW_ANY \| ArgsManager::NETWORK_ONLY,
	OptionsCategory::CONNECTION);
	argsman.AddArg("-asmap=<file>",
	strprintf("Specify asn mapping used for bucketing of the "
	"peers (default: %s). Relative paths will be "
	"prefixed by the net-specific datadir location.",
	DEFAULT_ASMAP_FILENAME),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-bantime=<n>",
	strprintf("Default duration (in seconds) of manually "
	"configured bans (default: %u)",
	DEFAULT_MISBEHAVING_BANTIME),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-bind=<addr>[:<port>][=onion]",
	strprintf("Bind to given address and always listen on it (default: "
	"0.0.0.0). Use [host]:port notation for IPv6. Append =onion "
	"to tag any incoming connections to that address and port as "
	"incoming Tor connections (default: 127.0.0.1:%u=onion, "
	"testnet: 127.0.0.1:%u=onion, regtest: 127.0.0.1:%u=onion)",
	defaultBaseParams->OnionServiceTargetPort(),
	testnetBaseParams->OnionServiceTargetPort(),
	regtestBaseParams->OnionServiceTargetPort()),
	ArgsManager::ALLOW_ANY \| ArgsManager::NETWORK_ONLY,
	OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-connect=<ip>",
	"Connect only to the specified node(s); -connect=0 disables automatic "
	"connections (the rules for this peer are the same as for -addnode)",
	ArgsManager::ALLOW_ANY \| ArgsManager::NETWORK_ONLY,
	OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-discover",
	"Discover own IP addresses (default: 1 when listening and no "
	"-externalip or -proxy)",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-dns",
	strprintf("Allow DNS lookups for -addnode, -seednode and "
	"-connect (default: %d)",
	DEFAULT_NAME_LOOKUP),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-dnsseed",
	strprintf(
	"Query for peer addresses via DNS lookup, if low on addresses "
	"(default: %u unless -connect used)",
	DEFAULT_DNSSEED),
	ArgsManager::ALLOW_BOOL, OptionsCategory::CONNECTION);
	argsman.AddArg("-externalip=<ip>", "Specify your own public address",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-fixedseeds",
	strprintf(
	"Allow fixed seeds if DNS seeds don't provide peers (default: %u)",
	DEFAULT_FIXEDSEEDS),
	ArgsManager::ALLOW_BOOL, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-forcednsseed",
	strprintf(
	"Always query for peer addresses via DNS lookup (default: %d)",
	DEFAULT_FORCEDNSSEED),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-overridednsseed",
	"If set, only use the specified DNS seed when "
	"querying for peer addresses via DNS lookup.",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-listen",
	"Accept connections from outside (default: 1 if no -proxy or -connect)",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-listenonion",
	strprintf("Automatically create Tor onion service (default: %d)",
	DEFAULT_LISTEN_ONION),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-maxconnections=<n>",
	strprintf("Maintain at most <n> connections to peers. The effective "
	"limit depends on system limitations and might be lower than "
	"the specified value (default: %u)",
	DEFAULT_MAX_PEER_CONNECTIONS),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-maxreceivebuffer=<n>",
	strprintf("Maximum per-connection receive buffer, <n>*1000 "
	"bytes (default: %u)",
	DEFAULT_MAXRECEIVEBUFFER),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-maxsendbuffer=<n>",
	strprintf(
	"Maximum per-connection send buffer, <n>*1000 bytes (default: %u)",
	DEFAULT_MAXSENDBUFFER),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-maxtimeadjustment",
	strprintf("Maximum allowed median peer time offset adjustment. Local "
	"perspective of time may be influenced by peers forward or "
	"backward by this amount. (default: %u seconds)",
	DEFAULT_MAX_TIME_ADJUSTMENT),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-onion=<ip:port>",
	strprintf("Use separate SOCKS5 proxy to reach peers via Tor "
	"onion services (default: %s)",
	"-proxy"),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-i2psam=<ip:port>",
	"I2P SAM proxy to reach I2P peers and accept I2P "
	"connections (default: none)",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-i2pacceptincoming",
	"If set and -i2psam is also set then incoming I2P connections are "
	"accepted via the SAM proxy. If this is not set but -i2psam is set "
	"then only outgoing connections will be made to the I2P network. "
	"Ignored if -i2psam is not set. Listening for incoming I2P connections "
	"is done through the SAM proxy, not by binding to a local address and "
	"port (default: 1)",
	ArgsManager::ALLOW_BOOL, OptionsCategory::CONNECTION);

	argsman.AddArg(
	"-onlynet=<net>",
	"Make outgoing connections only through network <net> (" +
	Join(GetNetworkNames(), ", ") +
	"). Incoming connections are not affected by this option. This "
	"option can be specified multiple times to allow multiple "
	"networks. Warning: if it is used with non-onion networks "
	"and the -onion or -proxy option is set, then outbound onion "
	"connections will still be made; use -noonion or -onion=0 to "
	"disable outbound onion connections in this case",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-peerbloomfilters",
	strprintf("Support filtering of blocks and transaction with "
	"bloom filters (default: %d)",
	DEFAULT_PEERBLOOMFILTERS),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-peerblockfilters",
	strprintf(
	"Serve compact block filters to peers per BIP 157 (default: %u)",
	DEFAULT_PEERBLOCKFILTERS),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-permitbaremultisig",
	strprintf("Relay non-P2SH multisig (default: %d)",
	DEFAULT_PERMIT_BAREMULTISIG),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	// TODO: remove the sentence "Nodes not using ... incoming connections."
	// once the changes from https://github.com/bitcoin/bitcoin/pull/23542 have
	// become widespread.
	argsman.AddArg("-port=<port>",
	strprintf("Listen for connections on <port>. Nodes not "
	"using the default ports (default: %u, "
	"testnet: %u, regtest: %u) are unlikely to get "
	"incoming connections. Not relevant for I2P (see "
	"doc/i2p.md).",
	defaultChainParams->GetDefaultPort(),
	testnetChainParams->GetDefaultPort(),
	regtestChainParams->GetDefaultPort()),
	ArgsManager::ALLOW_ANY \| ArgsManager::NETWORK_ONLY,
	OptionsCategory::CONNECTION);
	argsman.AddArg("-proxy=<ip:port>", "Connect through SOCKS5 proxy",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-proxyrandomize",
	strprintf("Randomize credentials for every proxy connection. "
	"This enables Tor stream isolation (default: %d)",
	DEFAULT_PROXYRANDOMIZE),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-seednode=<ip>",
	"Connect to a node to retrieve peer addresses, and disconnect",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-networkactive",
	"Enable all P2P network activity (default: 1). Can be changed "
	"by the setnetworkactive RPC command",
	ArgsManager::ALLOW_BOOL, OptionsCategory::CONNECTION);
	argsman.AddArg("-timeout=<n>",
	strprintf("Specify connection timeout in milliseconds "
	"(minimum: 1, default: %d)",
	DEFAULT_CONNECT_TIMEOUT),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-peertimeout=<n>",
	strprintf("Specify p2p connection timeout in seconds. This option "
	"determines the amount of time a peer may be inactive before "
	"the connection to it is dropped. (minimum: 1, default: %d)",
	DEFAULT_PEER_CONNECT_TIMEOUT),
	true, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-torcontrol=<ip>:<port>",
	strprintf(
	"Tor control port to use if onion listening enabled (default: %s)",
	DEFAULT_TOR_CONTROL),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg("-torpassword=<pass>",
	"Tor control port password (default: empty)",
	ArgsManager::ALLOW_ANY \| ArgsManager::SENSITIVE,
	OptionsCategory::CONNECTION);
	#ifdef USE_UPNP
	#if USE_UPNP
	argsman.AddArg("-upnp",
	"Use UPnP to map the listening port (default: 1 when "
	"listening and no -proxy)",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	#else
	argsman.AddArg(
	"-upnp",
	strprintf("Use UPnP to map the listening port (default: %u)", 0),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	#endif
	#else
	hidden_args.emplace_back("-upnp");
	#endif
	#ifdef USE_NATPMP
	argsman.AddArg(
	"-natpmp",
	strprintf("Use NAT-PMP to map the listening port (default: %s)",
	DEFAULT_NATPMP ? "1 when listening and no -proxy" : "0"),
	ArgsManager::ALLOW_BOOL, OptionsCategory::CONNECTION);
	#else
	hidden_args.emplace_back("-natpmp");
	#endif // USE_NATPMP
	argsman.AddArg(
	"-whitebind=<[permissions@]addr>",
	"Bind to the given address and add permission flags to the peers "
	"connecting to it."
	"Use [host]:port notation for IPv6. Allowed permissions: " +
	Join(NET_PERMISSIONS_DOC, ", ") +
	". "
	"Specify multiple permissions separated by commas (default: "
	"download,noban,mempool,relay). Can be specified multiple times.",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);

	argsman.AddArg("-whitelist=<[permissions@]IP address or network>",
	"Add permission flags to the peers connecting from the "
	"given IP address (e.g. 1.2.3.4) or CIDR-notated network "
	"(e.g. 1.2.3.0/24). "
	"Uses the same permissions as -whitebind. Can be specified "
	"multiple times.",
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);
	argsman.AddArg(
	"-maxuploadtarget=<n>",
	strprintf("Tries to keep outbound traffic under the given target (in "
	"MiB per 24h). Limit does not apply to peers with 'download' "
	"permission. 0 = no limit (default: %d)",
	DEFAULT_MAX_UPLOAD_TARGET),
	ArgsManager::ALLOW_ANY, OptionsCategory::CONNECTION);

	g_wallet_init_interface.AddWalletOptions(argsman);

	#if ENABLE_ZMQ
	argsman.AddArg("-zmqpubhashblock=<address>",
	"Enable publish hash block in <address>",
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	argsman.AddArg("-zmqpubhashtx=<address>",
	"Enable publish hash transaction in <address>",
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	argsman.AddArg("-zmqpubrawblock=<address>",
	"Enable publish raw block in <address>",
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	argsman.AddArg("-zmqpubrawtx=<address>",
	"Enable publish raw transaction in <address>",
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	argsman.AddArg("-zmqpubsequence=<address>",
	"Enable publish hash block and tx sequence in <address>",
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	argsman.AddArg(
	"-zmqpubhashblockhwm=<n>",
	strprintf("Set publish hash block outbound message high water "
	"mark (default: %d)",
	CZMQAbstractNotifier::DEFAULT_ZMQ_SNDHWM),
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	argsman.AddArg(
	"-zmqpubhashtxhwm=<n>",
	strprintf("Set publish hash transaction outbound message high "
	"water mark (default: %d)",
	CZMQAbstractNotifier::DEFAULT_ZMQ_SNDHWM),
	false, OptionsCategory::ZMQ);
	argsman.AddArg(
	"-zmqpubrawblockhwm=<n>",
	strprintf("Set publish raw block outbound message high water "
	"mark (default: %d)",
	CZMQAbstractNotifier::DEFAULT_ZMQ_SNDHWM),
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	argsman.AddArg(
	"-zmqpubrawtxhwm=<n>",
	strprintf("Set publish raw transaction outbound message high "
	"water mark (default: %d)",
	CZMQAbstractNotifier::DEFAULT_ZMQ_SNDHWM),
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	argsman.AddArg("-zmqpubsequencehwm=<n>",
	strprintf("Set publish hash sequence message high water mark"
	" (default: %d)",
	CZMQAbstractNotifier::DEFAULT_ZMQ_SNDHWM),
	ArgsManager::ALLOW_ANY, OptionsCategory::ZMQ);
	#else
	hidden_args.emplace_back("-zmqpubhashblock=<address>");
	hidden_args.emplace_back("-zmqpubhashtx=<address>");
	hidden_args.emplace_back("-zmqpubrawblock=<address>");
	hidden_args.emplace_back("-zmqpubrawtx=<address>");
	hidden_args.emplace_back("-zmqpubsequence=<n>");
	hidden_args.emplace_back("-zmqpubhashblockhwm=<n>");
	hidden_args.emplace_back("-zmqpubhashtxhwm=<n>");
	hidden_args.emplace_back("-zmqpubrawblockhwm=<n>");
	hidden_args.emplace_back("-zmqpubrawtxhwm=<n>");
	hidden_args.emplace_back("-zmqpubsequencehwm=<n>");
	#endif

	argsman.AddArg(
	"-checkblocks=<n>",
	strprintf("How many blocks to check at startup (default: %u, 0 = all)",
	DEFAULT_CHECKBLOCKS),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-checklevel=<n>",
	strprintf("How thorough the block verification of "
	"-checkblocks is: %s (0-4, default: %u)",
	Join(CHECKLEVEL_DOC, ", "), DEFAULT_CHECKLEVEL),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-checkblockindex",
	strprintf("Do a consistency check for the block tree, "
	"chainstate, and other validation data structures "
	"occasionally. (default: %u, regtest: %u)",
	defaultChainParams->DefaultConsistencyChecks(),
	regtestChainParams->DefaultConsistencyChecks()),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-checkaddrman=<n>",
	strprintf("Run addrman consistency checks every <n> "
	"operations. Use 0 to disable. (default: %u)",
	DEFAULT_ADDRMAN_CONSISTENCY_CHECKS),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg(
	"-checkmempool=<n>",
	strprintf("Run mempool consistency checks every <n> transactions. Use "
	"0 to disable. (default: %u, regtest: %u)",
	defaultChainParams->DefaultConsistencyChecks(),
	regtestChainParams->DefaultConsistencyChecks()),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-checkpoints",
	strprintf("Only accept block chain matching built-in "
	"checkpoints (default: %d)",
	DEFAULT_CHECKPOINTS_ENABLED),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-deprecatedrpc=<method>",
	"Allows deprecated RPC method(s) to be used",
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg(
	"-stopafterblockimport",
	strprintf("Stop running after importing blocks from disk (default: %d)",
	DEFAULT_STOPAFTERBLOCKIMPORT),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-stopatheight",
	strprintf("Stop running after reaching the given height in "
	"the main chain (default: %u)",
	DEFAULT_STOPATHEIGHT),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-addrmantest", "Allows to test address relay on localhost",
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-capturemessages", "Capture all P2P messages to disk",
	ArgsManager::ALLOW_BOOL \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-mocktime=<n>",
	"Replace actual time with " + UNIX_EPOCH_TIME +
	" (default: 0)",
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg(
	"-maxsigcachesize=<n>",
	strprintf("Limit size of signature cache to <n> MiB (default: %u)",
	DEFAULT_MAX_SIG_CACHE_SIZE),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg(
	"-maxscriptcachesize=<n>",
	strprintf("Limit size of script cache to <n> MiB (default: %u)",
	DEFAULT_MAX_SCRIPT_CACHE_SIZE),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-maxtipage=<n>",
	strprintf("Maximum tip age in seconds to consider node in "
	"initial block download (default: %u)",
	DEFAULT_MAX_TIP_AGE),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::DEBUG_TEST);

	argsman.AddArg("-uacomment=<cmt>",
	"Append comment to the user agent string",
	ArgsManager::ALLOW_ANY, OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-uaclientname=<clientname>", "Set user agent client name",
	ArgsManager::ALLOW_ANY, OptionsCategory::DEBUG_TEST);
	argsman.AddArg("-uaclientversion=<clientversion>",
	"Set user agent client version", ArgsManager::ALLOW_ANY,
	OptionsCategory::DEBUG_TEST);

	SetupChainParamsBaseOptions(argsman);

	argsman.AddArg(
	"-acceptnonstdtxn",
	strprintf(
	"Relay and mine \"non-standard\" transactions (%sdefault: %u)",
	"testnet/regtest only; ", defaultChainParams->RequireStandard()),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::NODE_RELAY);
	argsman.AddArg("-excessiveblocksize=<n>",
	strprintf("Do not accept blocks larger than this limit, in "
	"bytes (default: %d)",
	DEFAULT_MAX_BLOCK_SIZE),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::NODE_RELAY);
	const auto &ticker = Currency::get().ticker;
	argsman.AddArg(
	"-dustrelayfee=<amt>",
	strprintf("Fee rate (in %s/kB) used to define dust, the value of an "
	"output such that it will cost about 1/3 of its value in "
	"fees at this fee rate to spend it. (default: %s)",
	ticker, FormatMoney(DUST_RELAY_TX_FEE)),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::NODE_RELAY);

	argsman.AddArg(
	"-bytespersigcheck",
	strprintf("Equivalent bytes per sigCheck in transactions for relay and "
	"mining (default: %u).",
	DEFAULT_BYTES_PER_SIGCHECK),
	ArgsManager::ALLOW_ANY, OptionsCategory::NODE_RELAY);
	argsman.AddArg(
	"-bytespersigop",
	strprintf("DEPRECATED: Equivalent bytes per sigCheck in transactions "
	"for relay and mining (default: %u). This has been "
	"deprecated since v0.26.8 and will be removed in the future, "
	"please use -bytespersigcheck instead.",
	DEFAULT_BYTES_PER_SIGCHECK),
	ArgsManager::ALLOW_ANY, OptionsCategory::NODE_RELAY);
	argsman.AddArg(
	"-datacarrier",
	strprintf("Relay and mine data carrier transactions (default: %d)",
	DEFAULT_ACCEPT_DATACARRIER),
	ArgsManager::ALLOW_ANY, OptionsCategory::NODE_RELAY);
	argsman.AddArg(
	"-datacarriersize",
	strprintf("Maximum size of data in data carrier transactions "
	"we relay and mine (default: %u)",
	MAX_OP_RETURN_RELAY),
	ArgsManager::ALLOW_ANY, OptionsCategory::NODE_RELAY);
	argsman.AddArg(
	"-minrelaytxfee=<amt>",
	strprintf("Fees (in %s/kB) smaller than this are rejected for "
	"relaying, mining and transaction creation (default: %s)",
	ticker, FormatMoney(DEFAULT_MIN_RELAY_TX_FEE_PER_KB)),
	ArgsManager::ALLOW_ANY, OptionsCategory::NODE_RELAY);
	argsman.AddArg(
	"-whitelistrelay",
	strprintf("Add 'relay' permission to whitelisted inbound peers "
	"with default permissions. This will accept relayed "
	"transactions even when not relaying transactions "
	"(default: %d)",
	DEFAULT_WHITELISTRELAY),
	ArgsManager::ALLOW_ANY, OptionsCategory::NODE_RELAY);
	argsman.AddArg(
	"-whitelistforcerelay",
	strprintf("Add 'forcerelay' permission to whitelisted inbound peers"
	" with default permissions. This will relay transactions "
	"even if the transactions were already in the mempool "
	"(default: %d)",
	DEFAULT_WHITELISTFORCERELAY),
	ArgsManager::ALLOW_ANY, OptionsCategory::NODE_RELAY);

	argsman.AddArg("-blockmaxsize=<n>",
	strprintf("Set maximum block size in bytes (default: %d)",
	DEFAULT_MAX_GENERATED_BLOCK_SIZE),
	ArgsManager::ALLOW_ANY, OptionsCategory::BLOCK_CREATION);
	argsman.AddArg(
	"-blockmintxfee=<amt>",
	strprintf("Set lowest fee rate (in %s/kB) for transactions to "
	"be included in block creation. (default: %s)",
	ticker, FormatMoney(DEFAULT_BLOCK_MIN_TX_FEE_PER_KB)),
	ArgsManager::ALLOW_ANY, OptionsCategory::BLOCK_CREATION);

	argsman.AddArg("-blockversion=<n>",
	"Override block version to test forking scenarios",
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::BLOCK_CREATION);

	argsman.AddArg("-server", "Accept command line and JSON-RPC commands",
	ArgsManager::ALLOW_ANY, OptionsCategory::RPC);
	argsman.AddArg("-rest",
	strprintf("Accept public REST requests (default: %d)",
	DEFAULT_REST_ENABLE),
	ArgsManager::ALLOW_ANY, OptionsCategory::RPC);
	argsman.AddArg(
	"-rpcbind=<addr>[:port]",
	"Bind to given address to listen for JSON-RPC connections. Do not "
	"expose the RPC server to untrusted networks such as the public "
	"internet! This option is ignored unless -rpcallowip is also passed. "
	"Port is optional and overrides -rpcport. Use [host]:port notation "
	"for IPv6. This option can be specified multiple times (default: "
	"127.0.0.1 and ::1 i.e., localhost)",
	ArgsManager::ALLOW_ANY \| ArgsManager::NETWORK_ONLY \|
	ArgsManager::SENSITIVE,
	OptionsCategory::RPC);
	argsman.AddArg(
	"-rpccookiefile=<loc>",
	"Location of the auth cookie. Relative paths will be prefixed "
	"by a net-specific datadir location. (default: data dir)",
	ArgsManager::ALLOW_ANY, OptionsCategory::RPC);
	argsman.AddArg("-rpcuser=<user>", "Username for JSON-RPC connections",
	ArgsManager::ALLOW_ANY \| ArgsManager::SENSITIVE,
	OptionsCategory::RPC);
	argsman.AddArg("-rpcpassword=<pw>", "Password for JSON-RPC connections",
	ArgsManager::ALLOW_ANY \| ArgsManager::SENSITIVE,
	OptionsCategory::RPC);
	argsman.AddArg(
	"-rpcwhitelist=<whitelist>",
	"Set a whitelist to filter incoming RPC calls for a specific user. The "
	"field <whitelist> comes in the format: <USERNAME>:<rpc 1>,<rpc "
	"2>,...,<rpc n>. If multiple whitelists are set for a given user, they "
	"are set-intersected. See -rpcwhitelistdefault documentation for "
	"information on default whitelist behavior.",
	ArgsManager::ALLOW_ANY, OptionsCategory::RPC);
	argsman.AddArg(
	"-rpcwhitelistdefault",
	"Sets default behavior for rpc whitelisting. Unless "
	"rpcwhitelistdefault is set to 0, if any -rpcwhitelist is set, the rpc "
	"server acts as if all rpc users are subject to "
	"empty-unless-otherwise-specified whitelists. If rpcwhitelistdefault "
	"is set to 1 and no -rpcwhitelist is set, rpc server acts as if all "
	"rpc users are subject to empty whitelists.",
	ArgsManager::ALLOW_BOOL, OptionsCategory::RPC);
	argsman.AddArg(
	"-rpcauth=<userpw>",
	"Username and HMAC-SHA-256 hashed password for JSON-RPC connections. "
	"The field <userpw> comes in the format: <USERNAME>:<SALT>$<HASH>. A "
	"canonical python script is included in share/rpcauth. The client then "
	"connects normally using the rpcuser=<USERNAME>/rpcpassword=<PASSWORD> "
	"pair of arguments. This option can be specified multiple times",
	ArgsManager::ALLOW_ANY \| ArgsManager::SENSITIVE, OptionsCategory::RPC);
	argsman.AddArg("-rpcport=<port>",
	strprintf("Listen for JSON-RPC connections on <port> "
	"(default: %u, testnet: %u, regtest: %u)",
	defaultBaseParams->RPCPort(),
	testnetBaseParams->RPCPort(),
	regtestBaseParams->RPCPort()),
	ArgsManager::ALLOW_ANY \| ArgsManager::NETWORK_ONLY,
	OptionsCategory::RPC);
	argsman.AddArg(
	"-rpcallowip=<ip>",
	"Allow JSON-RPC connections from specified source. Valid for "
	"<ip> are a single IP (e.g. 1.2.3.4), a network/netmask (e.g. "
	"1.2.3.4/255.255.255.0) or a network/CIDR (e.g. 1.2.3.4/24). "
	"This option can be specified multiple times",
	ArgsManager::ALLOW_ANY, OptionsCategory::RPC);
	argsman.AddArg(
	"-rpcthreads=<n>",
	strprintf(
	"Set the number of threads to service RPC calls (default: %d)",
	DEFAULT_HTTP_THREADS),
	ArgsManager::ALLOW_ANY, OptionsCategory::RPC);
	argsman.AddArg(
	"-rpccorsdomain=value",
	"Domain from which to accept cross origin requests (browser enforced)",
	ArgsManager::ALLOW_ANY, OptionsCategory::RPC);

	argsman.AddArg("-rpcworkqueue=<n>",
	strprintf("Set the depth of the work queue to service RPC "
	"calls (default: %d)",
	DEFAULT_HTTP_WORKQUEUE),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::RPC);
	argsman.AddArg("-rpcservertimeout=<n>",
	strprintf("Timeout during HTTP requests (default: %d)",
	DEFAULT_HTTP_SERVER_TIMEOUT),
	ArgsManager::ALLOW_ANY \| ArgsManager::DEBUG_ONLY,
	OptionsCategory::RPC);

	#if HAVE_DECL_FORK
	argsman.AddArg("-daemon",
	strprintf("Run in the background as a daemon and accept "
	"commands (default: %d)",
	DEFAULT_DAEMON),
	ArgsManager::ALLOW_BOOL, OptionsCategory::OPTIONS);
	argsman.AddArg("-daemonwait",
	strprintf("Wait for initialization to be finished before "
	"exiting. This implies -daemon (default: %d)",
	DEFAULT_DAEMONWAIT),
	ArgsManager::ALLOW_BOOL, OptionsCategory::OPTIONS);
	#else
	hidden_args.emplace_back("-daemon");
	hidden_args.emplace_back("-daemonwait");
	#endif

	// Avalanche options.
	argsman.AddArg("-avalanche",
	strprintf("Enable the avalanche feature (default: %u)",
	AVALANCHE_DEFAULT_ENABLED),
	ArgsManager::ALLOW_ANY, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avalanchestakingrewards",
	strprintf("Enable the avalanche staking rewards feature (default: %u, "
	"testnet: %u, regtest: %u)",
	defaultChainParams->GetConsensus().enableStakingRewards,
	testnetChainParams->GetConsensus().enableStakingRewards,
	regtestChainParams->GetConsensus().enableStakingRewards),
	ArgsManager::ALLOW_BOOL, OptionsCategory::AVALANCHE);
	argsman.AddArg("-avalancheconflictingproofcooldown",
	strprintf("Mandatory cooldown before a proof conflicting "
	"with an already registered one can be considered "
	"in seconds (default: %u)",
	AVALANCHE_DEFAULT_CONFLICTING_PROOF_COOLDOWN),
	ArgsManager::ALLOW_INT, OptionsCategory::AVALANCHE);
	argsman.AddArg("-avalanchepeerreplacementcooldown",
	strprintf("Mandatory cooldown before a peer can be replaced "
	"in seconds (default: %u)",
	AVALANCHE_DEFAULT_PEER_REPLACEMENT_COOLDOWN),
	ArgsManager::ALLOW_INT, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avaminquorumstake",
	strprintf(
	"Minimum amount of known stake for a usable quorum (default: %s)",
	FormatMoney(AVALANCHE_DEFAULT_MIN_QUORUM_STAKE)),
	ArgsManager::ALLOW_ANY, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avaminquorumconnectedstakeratio",
	strprintf("Minimum proportion of known stake we"
	" need nodes for to have a usable quorum (default: %s)",
	AVALANCHE_DEFAULT_MIN_QUORUM_CONNECTED_STAKE_RATIO),
	ArgsManager::ALLOW_STRING, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avaminavaproofsnodecount",
	strprintf("Minimum number of node that needs to send us an avaproofs"
	" message before we consider we have a usable quorum"
	" (default: %s)",
	AVALANCHE_DEFAULT_MIN_AVAPROOFS_NODE_COUNT),
	ArgsManager::ALLOW_INT, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avastalevotethreshold",
	strprintf("Number of avalanche votes before a voted item goes stale "
	"when voting confidence is low (default: %u)",
	AVALANCHE_VOTE_STALE_THRESHOLD),
	ArgsManager::ALLOW_INT, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avastalevotefactor",
	strprintf(
	"Factor affecting the number of avalanche votes before a voted "
	"item goes stale when voting confidence is high (default: %u)",
	AVALANCHE_VOTE_STALE_FACTOR),
	ArgsManager::ALLOW_INT, OptionsCategory::AVALANCHE);
	argsman.AddArg("-avacooldown",
	strprintf("Mandatory cooldown between two avapoll in "
	"milliseconds (default: %u)",
	AVALANCHE_DEFAULT_COOLDOWN),
	ArgsManager::ALLOW_ANY, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avatimeout",
	strprintf("Avalanche query timeout in milliseconds (default: %u)",
	AVALANCHE_DEFAULT_QUERY_TIMEOUT.count()),
	ArgsManager::ALLOW_ANY, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avadelegation",
	"Avalanche proof delegation to the master key used by this node "
	"(default: none). Should be used in conjunction with -avaproof and "
	"-avamasterkey",
	ArgsManager::ALLOW_ANY, OptionsCategory::AVALANCHE);
	argsman.AddArg("-avaproof",
	"Avalanche proof to be used by this node (default: none)",
	ArgsManager::ALLOW_ANY, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-avaproofstakeutxoconfirmations",
	strprintf(
	"Minimum number of confirmations before a stake utxo is mature"
	" enough to be included into a proof. Utxos in the mempool are not "
	"accepted (i.e this value must be greater than 0) (default: %s)",
	AVALANCHE_DEFAULT_STAKE_UTXO_CONFIRMATIONS),
	ArgsManager::ALLOW_INT, OptionsCategory::HIDDEN);
	argsman.AddArg("-avaproofstakeutxodustthreshold",
	strprintf("Minimum value each stake utxo must have to be "
	"considered valid (default: %s)",
	avalanche::PROOF_DUST_THRESHOLD),
	ArgsManager::ALLOW_ANY, OptionsCategory::HIDDEN);
	argsman.AddArg("-avamasterkey",
	"Master key associated with the proof. If a proof is "
	"required, this is mandatory.",
	ArgsManager::ALLOW_ANY \| ArgsManager::SENSITIVE,
	OptionsCategory::AVALANCHE);
	argsman.AddArg("-avasessionkey", "Avalanche session key (default: random)",
	ArgsManager::ALLOW_ANY \| ArgsManager::SENSITIVE,
	OptionsCategory::HIDDEN);
	argsman.AddArg(
	"-maxavalancheoutbound",
	strprintf(
	"Set the maximum number of avalanche outbound peers to connect to. "
	"Note that this option takes precedence over the -maxconnections "
	"option (default: %u).",
	DEFAULT_MAX_AVALANCHE_OUTBOUND_CONNECTIONS),
	ArgsManager::ALLOW_INT, OptionsCategory::AVALANCHE);
	argsman.AddArg(
	"-persistavapeers",
	strprintf("Whether to save the avalanche peers upon shutdown and load "
	"them upon startup (default: %u).",
	DEFAULT_PERSIST_AVAPEERS),
	ArgsManager::ALLOW_BOOL, OptionsCategory::AVALANCHE);

	hidden_args.emplace_back("-avalanchepreconsensus");

	// Add the hidden options
	argsman.AddHiddenArgs(hidden_args);
	}

	std::string LicenseInfo() {
	const std::string URL_SOURCE_CODE =
	"<https://github.com/Bitcoin-ABC/bitcoin-abc>";
	const std::string URL_WEBSITE = "<https://www.bitcoinabc.org>";

	return CopyrightHolders(strprintf(_("Copyright (C) %i-%i").translated, 2009,
	COPYRIGHT_YEAR) +
	" ") +
	"\n" + "\n" +
	strprintf(_("Please contribute if you find %s useful. "
	"Visit %s for further information about the software.")
	.translated,
	PACKAGE_NAME, URL_WEBSITE) +
	"\n" +
	strprintf(_("The source code is available from %s.").translated,
	URL_SOURCE_CODE) +
	"\n" + "\n" + _("This is experimental software.").translated + "\n" +
	strprintf(_("Distributed under the MIT software license, see the "
	"accompanying file %s or %s")
	.translated,
	"COPYING", "<https://opensource.org/licenses/MIT>") +
	"\n" + "\n" +
	strprintf(_("This product includes software developed by the "
	"OpenSSL Project for use in the OpenSSL Toolkit %s and "
	"cryptographic software written by Eric Young and UPnP "
	"software written by Thomas Bernard.")
	.translated,
	"<https://www.openssl.org>") +
	"\n";
	}

	static bool fHaveGenesis = false;
	static GlobalMutex g_genesis_wait_mutex;
	static std::condition_variable g_genesis_wait_cv;

	static void BlockNotifyGenesisWait(const CBlockIndex *pBlockIndex) {
	if (pBlockIndex != nullptr) {
	{
	LOCK(g_genesis_wait_mutex);
	fHaveGenesis = true;
	}
	g_genesis_wait_cv.notify_all();
	}
	}

	#if HAVE_SYSTEM
	static void StartupNotify(const ArgsManager &args) {
	std::string cmd = args.GetArg("-startupnotify", "");
	if (!cmd.empty()) {
	std::thread t(runCommand, cmd);
	// thread runs free
	t.detach();
	}
	}
	#endif

	static bool AppInitServers(Config &config,
	HTTPRPCRequestProcessor &httpRPCRequestProcessor,
	NodeContext &node) {
	const ArgsManager &args = *Assert(node.args);
	RPCServerSignals::OnStarted(&OnRPCStarted);
	RPCServerSignals::OnStopped(&OnRPCStopped);
	if (!InitHTTPServer(config)) {
	return false;
	}

	StartRPC();
	node.rpc_interruption_point = RpcInterruptionPoint;

	if (!StartHTTPRPC(httpRPCRequestProcessor)) {
	return false;
	}
	if (args.GetBoolArg("-rest", DEFAULT_REST_ENABLE)) {
	StartREST(&node);
	}

	StartHTTPServer();
	return true;
	}

	// Parameter interaction based on rules
	void InitParameterInteraction(ArgsManager &args) {
	// when specifying an explicit binding address, you want to listen on it
	// even when -connect or -proxy is specified.
	if (args.IsArgSet("-bind")) {
	if (args.SoftSetBoolArg("-listen", true)) {
	LogPrintf(
	"%s: parameter interaction: -bind set -> setting -listen=1\n",
	__func__);
	}
	}
	if (args.IsArgSet("-whitebind")) {
	if (args.SoftSetBoolArg("-listen", true)) {
	LogPrintf("%s: parameter interaction: -whitebind set -> setting "
	"-listen=1\n",
	__func__);
	}
	}

	if (args.IsArgSet("-connect")) {
	// when only connecting to trusted nodes, do not seed via DNS, or listen
	// by default.
	if (args.SoftSetBoolArg("-dnsseed", false)) {
	LogPrintf("%s: parameter interaction: -connect set -> setting "
	"-dnsseed=0\n",
	__func__);
	}
	if (args.SoftSetBoolArg("-listen", false)) {
	LogPrintf("%s: parameter interaction: -connect set -> setting "
	"-listen=0\n",
	__func__);
	}
	}

	if (args.IsArgSet("-proxy")) {
	// to protect privacy, do not listen by default if a default proxy
	// server is specified.
	if (args.SoftSetBoolArg("-listen", false)) {
	LogPrintf(
	"%s: parameter interaction: -proxy set -> setting -listen=0\n",
	__func__);
	}
	// to protect privacy, do not map ports when a proxy is set. The user
	// may still specify -listen=1 to listen locally, so don't rely on this
	// happening through -listen below.
	if (args.SoftSetBoolArg("-upnp", false)) {
	LogPrintf(
	"%s: parameter interaction: -proxy set -> setting -upnp=0\n",
	__func__);
	}
	if (args.SoftSetBoolArg("-natpmp", false)) {
	LogPrintf(
	"%s: parameter interaction: -proxy set -> setting -natpmp=0\n",
	__func__);
	}
	// to protect privacy, do not discover addresses by default
	if (args.SoftSetBoolArg("-discover", false)) {
	LogPrintf("%s: parameter interaction: -proxy set -> setting "
	"-discover=0\n",
	__func__);
	}
	}

	if (!args.GetBoolArg("-listen", DEFAULT_LISTEN)) {
	// do not map ports or try to retrieve public IP when not listening
	// (pointless)
	if (args.SoftSetBoolArg("-upnp", false)) {
	LogPrintf(
	"%s: parameter interaction: -listen=0 -> setting -upnp=0\n",
	__func__);
	}
	if (args.SoftSetBoolArg("-natpmp", false)) {
	LogPrintf(
	"%s: parameter interaction: -listen=0 -> setting -natpmp=0\n",
	__func__);
	}
	if (args.SoftSetBoolArg("-discover", false)) {
	LogPrintf(
	"%s: parameter interaction: -listen=0 -> setting -discover=0\n",
	__func__);
	}
	if (args.SoftSetBoolArg("-listenonion", false)) {
	LogPrintf("%s: parameter interaction: -listen=0 -> setting "
	"-listenonion=0\n",
	__func__);
	}
	if (args.SoftSetBoolArg("-i2pacceptincoming", false)) {
	LogPrintf("%s: parameter interaction: -listen=0 -> setting "
	"-i2pacceptincoming=0\n",
	__func__);
	}
	}

	if (args.IsArgSet("-externalip")) {
	// if an explicit public IP is specified, do not try to find others
	if (args.SoftSetBoolArg("-discover", false)) {
	LogPrintf("%s: parameter interaction: -externalip set -> setting "
	"-discover=0\n",
	__func__);
	}
	}

	// disable whitelistrelay in blocksonly mode
	if (args.GetBoolArg("-blocksonly", DEFAULT_BLOCKSONLY)) {
	if (args.SoftSetBoolArg("-whitelistrelay", false)) {
	LogPrintf("%s: parameter interaction: -blocksonly=1 -> setting "
	"-whitelistrelay=0\n",
	__func__);
	}
	}

	// Forcing relay from whitelisted hosts implies we will accept relays from
	// them in the first place.
	if (args.GetBoolArg("-whitelistforcerelay", DEFAULT_WHITELISTFORCERELAY)) {
	if (args.SoftSetBoolArg("-whitelistrelay", true)) {
	LogPrintf("%s: parameter interaction: -whitelistforcerelay=1 -> "
	"setting -whitelistrelay=1\n",
	__func__);
	}
	}

	// If avalanche is set, soft set all the feature flags accordingly.
	if (args.IsArgSet("-avalanche")) {
	const bool fAvalanche =
	args.GetBoolArg("-avalanche", AVALANCHE_DEFAULT_ENABLED);
	args.SoftSetBoolArg("-automaticunparking", !fAvalanche);
	}
	}

	/**
	* Initialize global loggers.
	*
	* Note that this is called very early in the process lifetime, so you should be
	* careful about what global state you rely on here.
	*/
	void InitLogging(const ArgsManager &args) {
	init::SetLoggingOptions(args);
	init::LogPackageVersion();
	}

	namespace { // Variables internal to initialization process only

	int nMaxConnections;
	int nUserMaxConnections;
	int nFD;
	ServiceFlags nLocalServices = ServiceFlags(NODE_NETWORK \| NODE_NETWORK_LIMITED);
	int64_t peer_connect_timeout;
	std::set<BlockFilterType> g_enabled_filter_types;

	} // namespace

	[[noreturn]] static void new_handler_terminate() {
	// Rather than throwing std::bad-alloc if allocation fails, terminate
	// immediately to (try to) avoid chain corruption. Since LogPrintf may
	// itself allocate memory, set the handler directly to terminate first.
	std::set_new_handler(std::terminate);
	LogPrintf("Error: Out of memory. Terminating.\n");

	// The log was successful, terminate now.
	std::terminate();
	};

	bool AppInitBasicSetup(const ArgsManager &args) {
	// Step 1: setup
	#ifdef _MSC_VER
	// Turn off Microsoft heap dump noise
	_CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);
	_CrtSetReportFile(_CRT_WARN, CreateFileA("NUL", GENERIC_WRITE, 0, nullptr,
	OPEN_EXISTING, 0, 0));
	// Disable confusing "helpful" text message on abort, Ctrl-C
	_set_abort_behavior(0, _WRITE_ABORT_MSG \| _CALL_REPORTFAULT);
	#endif
	#ifdef WIN32
	// Enable Data Execution Prevention (DEP)
	SetProcessDEPPolicy(PROCESS_DEP_ENABLE);
	#endif
	if (!InitShutdownState()) {
	return InitError(
	Untranslated("Initializing wait-for-shutdown state failed."));
	}

	if (!SetupNetworking()) {
	return InitError(Untranslated("Initializing networking failed"));
	}

	#ifndef WIN32
	if (!args.GetBoolArg("-sysperms", false)) {
	umask(077);
	}

	// Clean shutdown on SIGTERM
	registerSignalHandler(SIGTERM, HandleSIGTERM);
	registerSignalHandler(SIGINT, HandleSIGTERM);

	// Reopen debug.log on SIGHUP
	registerSignalHandler(SIGHUP, HandleSIGHUP);

	// Ignore SIGPIPE, otherwise it will bring the daemon down if the client
	// closes unexpectedly
	signal(SIGPIPE, SIG_IGN);
	#else
	SetConsoleCtrlHandler(consoleCtrlHandler, true);
	#endif

	std::set_new_handler(new_handler_terminate);

	return true;
	}

	bool AppInitParameterInteraction(Config &config, const ArgsManager &args) {
	const CChainParams &chainparams = config.GetChainParams();
	// Step 2: parameter interactions

	// also see: InitParameterInteraction()

	// Error if network-specific options (-addnode, -connect, etc) are
	// specified in default section of config file, but not overridden
	// on the command line or in this network's section of the config file.
	std::string network = args.GetChainName();
	bilingual_str errors;
	for (const auto &arg : args.GetUnsuitableSectionOnlyArgs()) {
	errors += strprintf(_("Config setting for %s only applied on %s "
	"network when in [%s] section.") +
	Untranslated("\n"),
	arg, network, network);
	}

	if (!errors.empty()) {
	return InitError(errors);
	}

	// Warn if unrecognized section name are present in the config file.
	bilingual_str warnings;
	for (const auto &section : args.GetUnrecognizedSections()) {
	warnings += strprintf(Untranslated("%s:%i ") +
	_("Section [%s] is not recognized.") +
	Untranslated("\n"),
	section.m_file, section.m_line, section.m_name);
	}

	if (!warnings.empty()) {
	InitWarning(warnings);
	}

	if (!fs::is_directory(args.GetBlocksDirPath())) {
	return InitError(
	strprintf(_("Specified blocks directory \"%s\" does not exist."),
	args.GetArg("-blocksdir", "")));
	}

	// parse and validate enabled filter types
	std::string blockfilterindex_value =
	args.GetArg("-blockfilterindex", DEFAULT_BLOCKFILTERINDEX);
	if (blockfilterindex_value == "" \|\| blockfilterindex_value == "1") {
	g_enabled_filter_types = AllBlockFilterTypes();
	} else if (blockfilterindex_value != "0") {
	const std::vector<std::string> names =
	args.GetArgs("-blockfilterindex");
	for (const auto &name : names) {
	BlockFilterType filter_type;
	if (!BlockFilterTypeByName(name, filter_type)) {
	return InitError(
	strprintf(_("Unknown -blockfilterindex value %s."), name));
	}
	g_enabled_filter_types.insert(filter_type);
	}
	}

	// Signal NODE_COMPACT_FILTERS if peerblockfilters and basic filters index
	// are both enabled.
	if (args.GetBoolArg("-peerblockfilters", DEFAULT_PEERBLOCKFILTERS)) {
	if (g_enabled_filter_types.count(BlockFilterType::BASIC) != 1) {
	return InitError(
	_("Cannot set -peerblockfilters without -blockfilterindex."));
	}

	nLocalServices = ServiceFlags(nLocalServices \| NODE_COMPACT_FILTERS);
	}

	// if using block pruning, then disallow txindex, coinstatsindex and chronik
	if (args.GetIntArg("-prune", 0)) {
	if (args.GetBoolArg("-txindex", DEFAULT_TXINDEX)) {
	return InitError(_("Prune mode is incompatible with -txindex."));
	}
	if (args.GetBoolArg("-coinstatsindex", DEFAULT_COINSTATSINDEX)) {
	return InitError(
	_("Prune mode is incompatible with -coinstatsindex."));
	}
	if (args.GetBoolArg("-chronik", DEFAULT_CHRONIK)) {
	return InitError(_("Prune mode is incompatible with -chronik."));
	}
	}

	// -bind and -whitebind can't be set when not listening
	size_t nUserBind =
	args.GetArgs("-bind").size() + args.GetArgs("-whitebind").size();
	if (nUserBind != 0 && !args.GetBoolArg("-listen", DEFAULT_LISTEN)) {
	return InitError(Untranslated(
	"Cannot set -bind or -whitebind together with -listen=0"));
	}

	// Make sure enough file descriptors are available
	int nBind = std::max(nUserBind, size_t(1));
	nUserMaxConnections =
	args.GetIntArg("-maxconnections", DEFAULT_MAX_PEER_CONNECTIONS);
	nMaxConnections = std::max(nUserMaxConnections, 0);

	// -maxavalancheoutbound takes precedence over -maxconnections
	const int maxAvalancheOutbound = args.GetIntArg(
	"-maxavalancheoutbound", DEFAULT_MAX_AVALANCHE_OUTBOUND_CONNECTIONS);
	if (isAvalancheEnabled(args) && maxAvalancheOutbound > nMaxConnections) {
	nMaxConnections = std::max(maxAvalancheOutbound, nMaxConnections);
	// Indicate the value set by the user
	LogPrintf("Increasing -maxconnections from %d to %d to comply with "
	"-maxavalancheoutbound\n",
	nUserMaxConnections, nMaxConnections);
	}

	// Trim requested connection counts, to fit into system limitations
	// <int> in std::min<int>(...) to work around FreeBSD compilation issue
	// described in #2695
	nFD = RaiseFileDescriptorLimit(
	nMaxConnections + nBind + MIN_CORE_FILEDESCRIPTORS +
	MAX_ADDNODE_CONNECTIONS + NUM_FDS_MESSAGE_CAPTURE);
	#ifdef USE_POLL
	int fd_max = nFD;
	#else
	int fd_max = FD_SETSIZE;
	#endif
	nMaxConnections = std::max(
	std::min<int>(nMaxConnections,
	fd_max - nBind - MIN_CORE_FILEDESCRIPTORS -
	MAX_ADDNODE_CONNECTIONS - NUM_FDS_MESSAGE_CAPTURE),
	0);
	if (nFD < MIN_CORE_FILEDESCRIPTORS) {
	return InitError(_("Not enough file descriptors available."));
	}
	nMaxConnections =
	std::min(nFD - MIN_CORE_FILEDESCRIPTORS - MAX_ADDNODE_CONNECTIONS,
	nMaxConnections);

	if (nMaxConnections < nUserMaxConnections) {
	// Not categorizing as "Warning" because this is the normal behavior for
	// platforms using the select() interface for which FD_SETSIZE is
	// usually 1024.
	LogPrintf("Reducing -maxconnections from %d to %d, because of system "
	"limitations.\n",
	nUserMaxConnections, nMaxConnections);
	}

	// Step 3: parameter-to-internal-flags
	init::SetLoggingCategories(args);

	fCheckBlockIndex = args.GetBoolArg("-checkblockindex",
	chainparams.DefaultConsistencyChecks());
	fCheckpointsEnabled =
	args.GetBoolArg("-checkpoints", DEFAULT_CHECKPOINTS_ENABLED);
	if (fCheckpointsEnabled) {
	LogPrintf("Checkpoints will be verified.\n");
	} else {
	LogPrintf("Skipping checkpoint verification.\n");
	}

	hashAssumeValid = BlockHash::fromHex(
	args.GetArg("-assumevalid",
	chainparams.GetConsensus().defaultAssumeValid.GetHex()));

	if (args.IsArgSet("-minimumchainwork")) {
	const std::string minChainWorkStr =
	args.GetArg("-minimumchainwork", "");
	if (!IsHexNumber(minChainWorkStr)) {
	return InitError(strprintf(
	Untranslated(
	"Invalid non-hex (%s) minimum chain work value specified"),
	minChainWorkStr));
	}
	nMinimumChainWork = UintToArith256(uint256S(minChainWorkStr));
	} else {
	nMinimumChainWork =
	UintToArith256(chainparams.GetConsensus().nMinimumChainWork);
	}

	// Configure excessive block size.
	const int64_t nProposedExcessiveBlockSize =
	args.GetIntArg("-excessiveblocksize", DEFAULT_MAX_BLOCK_SIZE);
	if (nProposedExcessiveBlockSize <= 0 \|\|
	!config.SetMaxBlockSize(nProposedExcessiveBlockSize)) {
	return InitError(
	_("Excessive block size must be > 1,000,000 bytes (1MB)"));
	}

	// Check blockmaxsize does not exceed maximum accepted block size.
	const int64_t nProposedMaxGeneratedBlockSize =
	args.GetIntArg("-blockmaxsize", DEFAULT_MAX_GENERATED_BLOCK_SIZE);
	if (nProposedMaxGeneratedBlockSize <= 0) {
	return InitError(_("Max generated block size must be greater than 0"));
	}
	if (uint64_t(nProposedMaxGeneratedBlockSize) > config.GetMaxBlockSize()) {
	return InitError(_("Max generated block size (blockmaxsize) cannot "
	"exceed the excessive block size "
	"(excessiveblocksize)"));
	}

	// block pruning; get the amount of disk space (in MiB) to allot for block &
	// undo files
	int64_t nPruneArg = args.GetIntArg("-prune", 0);
	if (nPruneArg < 0) {
	return InitError(
	_("Prune cannot be configured with a negative value."));
	}
	nPruneTarget = (uint64_t)nPruneArg * 1024 * 1024;
	if (nPruneArg == 1) {
	// manual pruning: -prune=1
	nPruneTarget = std::numeric_limits<uint64_t>::max();
	fPruneMode = true;
	} else if (nPruneTarget) {
	if (nPruneTarget < MIN_DISK_SPACE_FOR_BLOCK_FILES) {
	return InitError(
	strprintf(_("Prune configured below the minimum of %d MiB. "
	"Please use a higher number."),
	MIN_DISK_SPACE_FOR_BLOCK_FILES / 1024 / 1024));
	}
	fPruneMode = true;
	}

	nConnectTimeout = args.GetIntArg("-timeout", DEFAULT_CONNECT_TIMEOUT);
	if (nConnectTimeout <= 0) {
	nConnectTimeout = DEFAULT_CONNECT_TIMEOUT;
	}

	peer_connect_timeout =
	args.GetIntArg("-peertimeout", DEFAULT_PEER_CONNECT_TIMEOUT);
	if (peer_connect_timeout <= 0) {
	return InitError(Untranslated(
	"peertimeout cannot be configured with a negative value."));
	}

	if (args.IsArgSet("-minrelaytxfee")) {
	Amount n = Amount::zero();
	auto parsed = ParseMoney(args.GetArg("-minrelaytxfee", ""), n);
	if (!parsed \|\| n == Amount::zero()) {
	return InitError(AmountErrMsg("minrelaytxfee",
	args.GetArg("-minrelaytxfee", "")));
	}
	// High fee check is done afterward in CWallet::Create()
	::minRelayTxFee = CFeeRate(n);
	}

	// Sanity check argument for min fee for including tx in block
	// TODO: Harmonize which arguments need sanity checking and where that
	// happens.
	if (args.IsArgSet("-blockmintxfee")) {
	Amount n = Amount::zero();
	if (!ParseMoney(args.GetArg("-blockmintxfee", ""), n)) {
	return InitError(AmountErrMsg("blockmintxfee",
	args.GetArg("-blockmintxfee", "")));
	}
	}

	// Feerate used to define dust. Shouldn't be changed lightly as old
	// implementations may inadvertently create non-standard transactions.
	if (args.IsArgSet("-dustrelayfee")) {
	Amount n = Amount::zero();
	auto parsed = ParseMoney(args.GetArg("-dustrelayfee", ""), n);
	if (!parsed \|\| Amount::zero() == n) {
	return InitError(
	AmountErrMsg("dustrelayfee", args.GetArg("-dustrelayfee", "")));
	}
	dustRelayFee = CFeeRate(n);
	}

	fRequireStandard =
	!args.GetBoolArg("-acceptnonstdtxn", !chainparams.RequireStandard());
	if (!chainparams.IsTestChain() && !fRequireStandard) {
	return InitError(strprintf(
	Untranslated(
	"acceptnonstdtxn is not currently supported for %s chain"),
	chainparams.NetworkIDString()));
	}
	nBytesPerSigCheck =
	args.IsArgSet("-bytespersigcheck")
	? args.GetIntArg("-bytespersigcheck", nBytesPerSigCheck)
	: args.GetIntArg("-bytespersigop", nBytesPerSigCheck);

	if (!g_wallet_init_interface.ParameterInteraction()) {
	return false;
	}

	fIsBareMultisigStd =
	args.GetBoolArg("-permitbaremultisig", DEFAULT_PERMIT_BAREMULTISIG);
	fAcceptDatacarrier =
	args.GetBoolArg("-datacarrier", DEFAULT_ACCEPT_DATACARRIER);

	// Option to startup with mocktime set (used for regression testing):
	SetMockTime(args.GetIntArg("-mocktime", 0)); // SetMockTime(0) is a no-op

	if (args.GetBoolArg("-peerbloomfilters", DEFAULT_PEERBLOOMFILTERS)) {
	nLocalServices = ServiceFlags(nLocalServices \| NODE_BLOOM);
	}

	nMaxTipAge = args.GetIntArg("-maxtipage", DEFAULT_MAX_TIP_AGE);

	if (args.IsArgSet("-proxy") && args.GetArg("-proxy", "").empty()) {
	return InitError(_(
	"No proxy server specified. Use -proxy=<ip> or -proxy=<ip:port>."));
	}

	// Avalanche parameters
	const int64_t stakeUtxoMinConfirmations =
	args.GetIntArg("-avaproofstakeutxoconfirmations",
	AVALANCHE_DEFAULT_STAKE_UTXO_CONFIRMATIONS);

	if (!chainparams.IsTestChain() &&
	stakeUtxoMinConfirmations !=
	AVALANCHE_DEFAULT_STAKE_UTXO_CONFIRMATIONS) {
	return InitError(_("Avalanche stake UTXO minimum confirmations can "
	"only be set on test chains."));
	}

	if (stakeUtxoMinConfirmations <= 0) {
	return InitError(_("Avalanche stake UTXO minimum confirmations must be "
	"a positive integer."));
	}

	if (args.IsArgSet("-avaproofstakeutxodustthreshold")) {
	Amount amount = Amount::zero();
	auto parsed = ParseMoney(
	args.GetArg("-avaproofstakeutxodustthreshold", ""), amount);
	if (!parsed \|\| Amount::zero() == amount) {
	return InitError(AmountErrMsg(
	"avaproofstakeutxodustthreshold",
	args.GetArg("-avaproofstakeutxodustthreshold", "")));
	}

	if (!chainparams.IsTestChain() &&
	amount != avalanche::PROOF_DUST_THRESHOLD) {
	return InitError(_("Avalanche stake UTXO dust threshold can "
	"only be set on test chains."));
	}
	}

	// This is a staking node
	if (isAvalancheEnabled(args) && args.IsArgSet("-avaproof")) {
	if (!args.GetBoolArg("-listen", true)) {
	return InitError(_("Running a staking node requires accepting "
	"inbound connections. Please enable -listen."));
	}
	if (args.IsArgSet("-proxy")) {
	return InitError(_("Running a staking node behind a proxy is not "
	"supported. Please disable -proxy."));
	}
	if (args.IsArgSet("-i2psam")) {
	return InitError(_("Running a staking node behind I2P is not "
	"supported. Please disable -i2psam."));
	}
	if (args.IsArgSet("-onlynet")) {
	return InitError(
	_("Restricting the outbound network is not supported when "
	"running a staking node. Please disable -onlynet."));
	}
	}

	return true;
	}

	static bool LockDataDirectory(bool probeOnly) {
	// Make sure only a single Bitcoin process is using the data directory.
	fs::path datadir = gArgs.GetDataDirNet();
	if (!DirIsWritable(datadir)) {
	return InitError(strprintf(
	_("Cannot write to data directory '%s'; check permissions."),
	fs::PathToString(datadir)));
	}
	if (!LockDirectory(datadir, ".lock", probeOnly)) {
	return InitError(strprintf(_("Cannot obtain a lock on data directory "
	"%s. %s is probably already running."),
	fs::PathToString(datadir), PACKAGE_NAME));
	}
	return true;
	}

	bool AppInitSanityChecks() {
	// Step 4: sanity checks

	init::SetGlobals();

	// Sanity check
	if (!init::SanityChecks()) {
	return InitError(strprintf(
	_("Initialization sanity check failed. %s is shutting down."),
	PACKAGE_NAME));
	}

	// Probe the data directory lock to give an early error message, if possible
	// We cannot hold the data directory lock here, as the forking for daemon()
	// hasn't yet happened, and a fork will cause weird behavior to it.
	return LockDataDirectory(true);
	}

	bool AppInitLockDataDirectory() {
	// After daemonization get the data directory lock again and hold on to it
	// until exit. This creates a slight window for a race condition to happen,
	// however this condition is harmless: it will at most make us exit without
	// printing a message to console.
	if (!LockDataDirectory(false)) {
	// Detailed error printed inside LockDataDirectory
	return false;
	}
	return true;
	}

	bool AppInitInterfaces(NodeContext &node) {
	node.chain = interfaces::MakeChain(node, Params());
	// Create client interfaces for wallets that are supposed to be loaded
	// according to -wallet and -disablewallet options. This only constructs
	// the interfaces, it doesn't load wallet data. Wallets actually get loaded
	// when load() and start() interface methods are called below.
	g_wallet_init_interface.Construct(node);
	return true;
	}

	bool AppInitMain(Config &config, RPCServer &rpcServer,
	HTTPRPCRequestProcessor &httpRPCRequestProcessor,
	NodeContext &node,
	interfaces::BlockAndHeaderTipInfo *tip_info) {
	// Step 4a: application initialization
	const ArgsManager &args = *Assert(node.args);
	const CChainParams &chainparams = config.GetChainParams();

	if (!CreatePidFile(args)) {
	// Detailed error printed inside CreatePidFile().
	return false;
	}
	if (!init::StartLogging(args)) {
	// Detailed error printed inside StartLogging().
	return false;
	}

	LogPrintf("Using at most %i automatic connections (%i file descriptors "
	"available)\n",
	nMaxConnections, nFD);

	// Warn about relative -datadir path.
	if (args.IsArgSet("-datadir") &&
	!args.GetPathArg("-datadir").is_absolute()) {
	LogPrintf("Warning: relative datadir option '%s' specified, which will "
	"be interpreted relative to the current working directory "
	"'%s'. This is fragile, because if bitcoin is started in the "
	"future from a different location, it will be unable to "
	"locate the current data files. There could also be data "
	"loss if bitcoin is started while in a temporary "
	"directory.\n",
	args.GetArg("-datadir", ""),
	fs::PathToString(fs::current_path()));
	}

	InitSignatureCache();
	InitScriptExecutionCache();

	int script_threads = args.GetIntArg("-par", DEFAULT_SCRIPTCHECK_THREADS);
	if (script_threads <= 0) {
	// -par=0 means autodetect (number of cores - 1 script threads)
	// -par=-n means "leave n cores free" (number of cores - n - 1 script
	// threads)
	script_threads += GetNumCores();
	}

	// Subtract 1 because the main thread counts towards the par threads
	script_threads = std::max(script_threads - 1, 0);

	// Number of script-checking threads <= MAX_SCRIPTCHECK_THREADS
	script_threads = std::min(script_threads, MAX_SCRIPTCHECK_THREADS);

	LogPrintf("Script verification uses %d additional threads\n",
	script_threads);
	if (script_threads >= 1) {
	StartScriptCheckWorkerThreads(script_threads);
	}

	assert(!node.scheduler);
	node.scheduler = std::make_unique<CScheduler>();

	// Start the lightweight task scheduler thread
	node.scheduler->m_service_thread =
	std::thread(&util::TraceThread, "scheduler",
	[&] { node.scheduler->serviceQueue(); });

	// Gather some entropy once per minute.
	node.scheduler->scheduleEvery(
	[] {
	RandAddPeriodic();
	return true;
	},
	std::chrono::minutes{1});

	GetMainSignals().RegisterBackgroundSignalScheduler(*node.scheduler);

	/**
	* Register RPC commands regardless of -server setting so they will be
	* available in the GUI RPC console even if external calls are disabled.
	*/
	RegisterAllRPCCommands(config, rpcServer, tableRPC);
	for (const auto &client : node.chain_clients) {
	client->registerRpcs();
	}
	#if ENABLE_ZMQ
	RegisterZMQRPCCommands(tableRPC);
	#endif

	/**
	* Start the RPC server. It will be started in "warmup" mode and not
	* process calls yet (but it will verify that the server is there and will
	* be ready later). Warmup mode will be completed when initialisation is
	* finished.
	*/
	if (args.GetBoolArg("-server", false)) {
	uiInterface.InitMessage_connect(SetRPCWarmupStatus);
	if (!AppInitServers(config, httpRPCRequestProcessor, node)) {
	return InitError(
	_("Unable to start HTTP server. See debug log for details."));
	}
	}

	// Step 5: verify wallet database integrity
	for (const auto &client : node.chain_clients) {
	if (!client->verify()) {
	return false;
	}
	}

	// Step 6: network initialization

	// Note that we absolutely cannot open any actual connections
	// until the very end ("start node") as the UTXO/block state
	// is not yet setup and may end up being set up twice if we
	// need to reindex later.

	fListen = args.GetBoolArg("-listen", DEFAULT_LISTEN);
	fDiscover = args.GetBoolArg("-discover", true);

	{
	// Initialize addrman
	assert(!node.addrman);

	// Read asmap file if configured
	std::vector<bool> asmap;
	if (args.IsArgSet("-asmap")) {
	fs::path asmap_path =
	args.GetPathArg("-asmap", DEFAULT_ASMAP_FILENAME);
	if (!asmap_path.is_absolute()) {
	asmap_path = args.GetDataDirNet() / asmap_path;
	}
	if (!fs::exists(asmap_path)) {
	InitError(strprintf(_("Could not find asmap file %s"),
	fs::quoted(fs::PathToString(asmap_path))));
	return false;
	}
	asmap = DecodeAsmap(asmap_path);
	if (asmap.size() == 0) {
	InitError(strprintf(_("Could not parse asmap file %s"),
	fs::quoted(fs::PathToString(asmap_path))));
	return false;
	}
	const uint256 asmap_version = SerializeHash(asmap);
	LogPrintf("Using asmap version %s for IP bucketing\n",
	asmap_version.ToString());
	} else {
	LogPrintf("Using /16 prefix for IP bucketing\n");
	}

	uiInterface.InitMessage(_("Loading P2P addresses...").translated);
	auto addrman{LoadAddrman(chainparams, asmap, args)};
	if (!addrman) {
	return InitError(util::ErrorString(addrman));
	}
	node.addrman = std::move(*addrman);
	}

	assert(!node.banman);
	node.banman = std::make_unique<BanMan>(
	args.GetDataDirNet() / "banlist.dat", config.GetChainParams(),
	&uiInterface, args.GetIntArg("-bantime", DEFAULT_MISBEHAVING_BANTIME));
	assert(!node.connman);
	node.connman = std::make_unique<CConnman>(
	config, GetRand<uint64_t>(), GetRand<uint64_t>(), *node.addrman,
	args.GetBoolArg("-networkactive", true));

	// sanitize comments per BIP-0014, format user agent and check total size
	std::vector<std::string> uacomments;
	for (const std::string &cmt : args.GetArgs("-uacomment")) {
	if (cmt != SanitizeString(cmt, SAFE_CHARS_UA_COMMENT)) {
	return InitError(strprintf(
	_("User Agent comment (%s) contains unsafe characters."), cmt));
	}
	uacomments.push_back(cmt);
	}
	const std::string client_name = args.GetArg("-uaclientname", CLIENT_NAME);
	const std::string client_version =
	args.GetArg("-uaclientversion", FormatVersion(CLIENT_VERSION));
	if (client_name != SanitizeString(client_name, SAFE_CHARS_UA_COMMENT)) {
	return InitError(strprintf(
	_("-uaclientname (%s) contains invalid characters."), client_name));
	}
	if (client_version !=
	SanitizeString(client_version, SAFE_CHARS_UA_COMMENT)) {
	return InitError(
	strprintf(_("-uaclientversion (%s) contains invalid characters."),
	client_version));
	}
	const std::string strSubVersion =
	FormatUserAgent(client_name, client_version, uacomments);
	if (strSubVersion.size() > MAX_SUBVERSION_LENGTH) {
	return InitError(strprintf(
	_("Total length of network version string (%i) exceeds maximum "
	"length (%i). Reduce the number or size of uacomments."),
	strSubVersion.size(), MAX_SUBVERSION_LENGTH));
	}

	if (args.IsArgSet("-onlynet")) {
	std::set<enum Network> nets;
	for (const std::string &snet : args.GetArgs("-onlynet")) {
	enum Network net = ParseNetwork(snet);
	if (net == NET_UNROUTABLE) {
	return InitError(strprintf(
	_("Unknown network specified in -onlynet: '%s'"), snet));
	}
	nets.insert(net);
	}
	for (int n = 0; n < NET_MAX; n++) {
	enum Network net = (enum Network)n;
	if (!nets.count(net)) {
	SetReachable(net, false);
	}
	}
	}

	// Check for host lookup allowed before parsing any network related
	// parameters
	fNameLookup = args.GetBoolArg("-dns", DEFAULT_NAME_LOOKUP);

	bool proxyRandomize =
	args.GetBoolArg("-proxyrandomize", DEFAULT_PROXYRANDOMIZE);
	// -proxy sets a proxy for all outgoing network traffic
	// -noproxy (or -proxy=0) as well as the empty string can be used to not set
	// a proxy, this is the default
	std::string proxyArg = args.GetArg("-proxy", "");
	SetReachable(NET_ONION, false);
	if (proxyArg != "" && proxyArg != "0") {
	CService proxyAddr;
	if (!Lookup(proxyArg, proxyAddr, 9050, fNameLookup)) {
	return InitError(strprintf(
	_("Invalid -proxy address or hostname: '%s'"), proxyArg));
	}

	proxyType addrProxy = proxyType(proxyAddr, proxyRandomize);
	if (!addrProxy.IsValid()) {
	return InitError(strprintf(
	_("Invalid -proxy address or hostname: '%s'"), proxyArg));
	}

	SetProxy(NET_IPV4, addrProxy);
	SetProxy(NET_IPV6, addrProxy);
	SetProxy(NET_ONION, addrProxy);
	SetNameProxy(addrProxy);
	// by default, -proxy sets onion as reachable, unless -noonion later
	SetReachable(NET_ONION, true);
	}

	// -onion can be used to set only a proxy for .onion, or override normal
	// proxy for .onion addresses.
	// -noonion (or -onion=0) disables connecting to .onion entirely. An empty
	// string is used to not override the onion proxy (in which case it defaults
	// to -proxy set above, or none)
	std::string onionArg = args.GetArg("-onion", "");
	if (onionArg != "") {
	if (onionArg == "0") {
	// Handle -noonion/-onion=0
	SetReachable(NET_ONION, false);
	} else {
	CService onionProxy;
	if (!Lookup(onionArg, onionProxy, 9050, fNameLookup)) {
	return InitError(strprintf(
	_("Invalid -onion address or hostname: '%s'"), onionArg));
	}
	proxyType addrOnion = proxyType(onionProxy, proxyRandomize);
	if (!addrOnion.IsValid()) {
	return InitError(strprintf(
	_("Invalid -onion address or hostname: '%s'"), onionArg));
	}
	SetProxy(NET_ONION, addrOnion);
	SetReachable(NET_ONION, true);
	}
	}

	for (const std::string &strAddr : args.GetArgs("-externalip")) {
	CService addrLocal;
	if (Lookup(strAddr, addrLocal, GetListenPort(), fNameLookup) &&
	addrLocal.IsValid()) {
	AddLocal(addrLocal, LOCAL_MANUAL);
	} else {
	return InitError(ResolveErrMsg("externalip", strAddr));
	}
	}

	#if ENABLE_ZMQ
	g_zmq_notification_interface = CZMQNotificationInterface::Create();

	if (g_zmq_notification_interface) {
	RegisterValidationInterface(g_zmq_notification_interface);
	}
	#endif

	// Step 7: load block chain

	fReindex = args.GetBoolArg("-reindex", false);
	bool fReindexChainState = args.GetBoolArg("-reindex-chainstate", false);

	// cache size calculations
	CacheSizes cache_sizes =
	CalculateCacheSizes(args, g_enabled_filter_types.size());

	LogPrintf("Cache configuration:\n");
	LogPrintf("* Using %.1f MiB for block index database\n",
	cache_sizes.block_tree_db * (1.0 / 1024 / 1024));
	if (args.GetBoolArg("-txindex", DEFAULT_TXINDEX)) {
	LogPrintf("* Using %.1f MiB for transaction index database\n",
	cache_sizes.tx_index * (1.0 / 1024 / 1024));
	}
	for (BlockFilterType filter_type : g_enabled_filter_types) {
	LogPrintf("* Using %.1f MiB for %s block filter index database\n",
	cache_sizes.filter_index * (1.0 / 1024 / 1024),
	BlockFilterTypeName(filter_type));
	}
	LogPrintf("* Using %.1f MiB for chain state database\n",
	cache_sizes.coins_db * (1.0 / 1024 / 1024));

	assert(!node.mempool);
	assert(!node.chainman);

	CTxMemPool::Options mempool_opts{
	.check_ratio = chainparams.DefaultConsistencyChecks() ? 1 : 0,
	};
	ApplyArgsManOptions(args, mempool_opts);
	mempool_opts.check_ratio =
	std::clamp<int>(mempool_opts.check_ratio, 0, 1'000'000);

	// FIXME: this legacy limit comes from the DEFAULT_DESCENDANT_SIZE_LIMIT
	// (101) that was enforced before the wellington activation. While it's
	// still a good idea to have some minimum mempool size, using this value as
	// a threshold is no longer relevant.
	int64_t nMempoolSizeMin = 101 * 1000 * 40;
	if (mempool_opts.max_size_bytes < 0 \|\|
	(!chainparams.IsTestChain() &&
	mempool_opts.max_size_bytes < nMempoolSizeMin)) {
	return InitError(strprintf(_("-maxmempool must be at least %d MB"),
	std::ceil(nMempoolSizeMin / 1000000.0)));
	}
	LogPrintf("* Using %.1f MiB for in-memory UTXO set (plus up to %.1f MiB of "
	"unused mempool space)\n",
	cache_sizes.coins * (1.0 / 1024 / 1024),
	mempool_opts.max_size_bytes * (1.0 / 1024 / 1024));

	for (bool fLoaded = false; !fLoaded && !ShutdownRequested();) {
	node.mempool = std::make_unique<CTxMemPool>(mempool_opts);

	const ChainstateManager::Options chainman_opts{
	.config = config,
	.adjusted_time_callback = GetAdjustedTime,
	};
	node.chainman = std::make_unique<ChainstateManager>(chainman_opts);
	ChainstateManager &chainman = *node.chainman;

	node::ChainstateLoadOptions options;
	options.mempool = Assert(node.mempool.get());
	options.reindex = node::fReindex;
	options.reindex_chainstate = fReindexChainState;
	options.prune = chainman.m_blockman.IsPruneMode();
	options.check_blocks =
	args.GetIntArg("-checkblocks", DEFAULT_CHECKBLOCKS);
	options.check_level = args.GetIntArg("-checklevel", DEFAULT_CHECKLEVEL);
	options.require_full_verification =
	args.IsArgSet("-checkblocks") \|\| args.IsArgSet("-checklevel");
	options.check_interrupt = ShutdownRequested;
	options.coins_error_cb = [] {
	uiInterface.ThreadSafeMessageBox(
	_("Error reading from database, shutting down."), "",
	CClientUIInterface::MSG_ERROR);
	};

	uiInterface.InitMessage(_("Loading block index...").translated);

	const int64_t load_block_index_start_time = GetTimeMillis();
	auto catch_exceptions = [](auto &&f) {
	try {
	return f();
	} catch (const std::exception &e) {
	LogPrintf("%s\n", e.what());
	return std::make_tuple(node::ChainstateLoadStatus::FAILURE,
	_("Error opening block database"));
	}
	};
	auto [status, error] = catch_exceptions(
	[&] { return LoadChainstate(chainman, cache_sizes, options); });
	if (status == node::ChainstateLoadStatus::SUCCESS) {
	uiInterface.InitMessage(_("Verifying blocks...").translated);
	if (chainman.m_blockman.m_have_pruned &&
	options.check_blocks > MIN_BLOCKS_TO_KEEP) {
	LogPrintf("Prune: pruned datadir may not have more than %d "
	"blocks; only checking available blocks\n",
	MIN_BLOCKS_TO_KEEP);
	}
	std::tie(status, error) = catch_exceptions([&] {
	return VerifyLoadedChainstate(chainman, options, config);
	});
	if (status == node::ChainstateLoadStatus::SUCCESS) {
	fLoaded = true;
	LogPrintf(" block index %15dms\n",
	GetTimeMillis() - load_block_index_start_time);
	}
	}

	if (status == node::ChainstateLoadStatus::FAILURE_INCOMPATIBLE_DB \|\|
	status ==
	node::ChainstateLoadStatus::FAILURE_INSUFFICIENT_DBCACHE) {
	return InitError(error);
	}

	if (!fLoaded && !ShutdownRequested()) {
	// first suggest a reindex
	if (!options.reindex) {
	bool fRet = uiInterface.ThreadSafeQuestion(
	error + Untranslated(".\n\n") +
	_("Do you want to rebuild the block database now?"),
	error.original + ".\nPlease restart with -reindex or "
	"-reindex-chainstate to recover.",
	"",
	CClientUIInterface::MSG_ERROR \|
	CClientUIInterface::BTN_ABORT);
	if (fRet) {
	fReindex = true;
	AbortShutdown();
	} else {
	LogPrintf("Aborted block database rebuild. Exiting.\n");
	return false;
	}
	} else {
	return InitError(error);
	}
	}
	}

	// As LoadBlockIndex can take several minutes, it's possible the user
	// requested to kill the GUI during the last operation. If so, exit.
	// As the program has not fully started yet, Shutdown() is possibly
	// overkill.
	if (ShutdownRequested()) {
	LogPrintf("Shutdown requested. Exiting.\n");
	return false;
	}

	ChainstateManager &chainman = *Assert(node.chainman);

	assert(!node.peerman);
	node.peerman = PeerManager::make(
	node.connman, node.addrman, node.banman.get(), chainman,
	*node.mempool, args.GetBoolArg("-blocksonly", DEFAULT_BLOCKSONLY));
	RegisterValidationInterface(node.peerman.get());

	// Encoded addresses using cashaddr instead of base58.
	// We do this by default to avoid confusion with BTC addresses.
	config.SetCashAddrEncoding(args.GetBoolArg("-usecashaddr", true));

	// Step 7.5 (I guess ?): Initialize Avalanche.
	bilingual_str avalancheError;
	g_avalanche = avalanche::Processor::MakeProcessor(
	args, *node.chain, node.connman.get(), chainman, node.mempool.get(),
	*node.scheduler, avalancheError);
	if (!g_avalanche) {
	InitError(avalancheError);
	return false;
	}

	if (isAvalancheEnabled(args) &&
	g_avalanche->isAvalancheServiceAvailable()) {
	nLocalServices = ServiceFlags(nLocalServices \| NODE_AVALANCHE);
	}

	// Step 8: load indexers
	if (args.GetBoolArg("-txindex", DEFAULT_TXINDEX)) {
	auto result{
	WITH_LOCK(cs_main, return CheckLegacyTxindex(*Assert(
	chainman.m_blockman.m_block_tree_db)))};
	if (!result) {
	return InitError(util::ErrorString(result));
	}

	g_txindex =
	std::make_unique<TxIndex>(cache_sizes.tx_index, false, fReindex);
	if (!g_txindex->Start(chainman.ActiveChainstate())) {
	return false;
	}
	}

	for (const auto &filter_type : g_enabled_filter_types) {
	InitBlockFilterIndex(filter_type, cache_sizes.filter_index, false,
	fReindex);
	if (!GetBlockFilterIndex(filter_type)
	->Start(chainman.ActiveChainstate())) {
	return false;
	}
	}

	if (args.GetBoolArg("-coinstatsindex", DEFAULT_COINSTATSINDEX)) {
	g_coin_stats_index = std::make_unique<CoinStatsIndex>(
	/* cache size */ 0, false, fReindex);
	if (!g_coin_stats_index->Start(chainman.ActiveChainstate())) {
	return false;
	}
	}

	#if ENABLE_CHRONIK
	if (args.GetBoolArg("-chronik", DEFAULT_CHRONIK)) {
	const bool fReindexChronik =
	fReindex \|\| args.GetBoolArg("-chronikreindex", false);
	if (!chronik::Start(config, node, fReindexChronik)) {
	return false;
	}
	}
	#endif

	// Step 9: load wallet
	for (const auto &client : node.chain_clients) {
	if (!client->load()) {
	return false;
	}
	}

	// Step 10: data directory maintenance

	// if pruning, unset the service bit and perform the initial blockstore
	// prune after any wallet rescanning has taken place.
	if (chainman.m_blockman.IsPruneMode()) {
	LogPrintf("Unsetting NODE_NETWORK on prune mode\n");
	nLocalServices = ServiceFlags(nLocalServices & ~NODE_NETWORK);
	if (!fReindex) {
	LOCK(cs_main);
	for (Chainstate *chainstate : chainman.GetAll()) {
	uiInterface.InitMessage(_("Pruning blockstore...").translated);
	chainstate->PruneAndFlush();
	}
	}
	}

	// Step 11: import blocks
	if (!CheckDiskSpace(args.GetDataDirNet())) {
	InitError(
	strprintf(_("Error: Disk space is low for %s"),
	fs::quoted(fs::PathToString(args.GetDataDirNet()))));
	return false;
	}
	if (!CheckDiskSpace(args.GetBlocksDirPath())) {
	InitError(
	strprintf(_("Error: Disk space is low for %s"),
	fs::quoted(fs::PathToString(args.GetBlocksDirPath()))));
	return false;
	}

	// Either install a handler to notify us when genesis activates, or set
	// fHaveGenesis directly.
	// No locking, as this happens before any background thread is started.
	boost::signals2::connection block_notify_genesis_wait_connection;
	if (WITH_LOCK(chainman.GetMutex(),
	return chainman.ActiveChain().Tip() == nullptr)) {
	block_notify_genesis_wait_connection =
	uiInterface.NotifyBlockTip_connect(
	std::bind(BlockNotifyGenesisWait, std::placeholders::_2));
	} else {
	fHaveGenesis = true;
	}

	#if defined(HAVE_SYSTEM)
	const std::string block_notify = args.GetArg("-blocknotify", "");
	if (!block_notify.empty()) {
	uiInterface.NotifyBlockTip_connect([block_notify](
	SynchronizationState sync_state,
	const CBlockIndex *pBlockIndex) {
	if (sync_state != SynchronizationState::POST_INIT \|\| !pBlockIndex) {
	return;
	}
	std::string command = block_notify;
	ReplaceAll(command, "%s", pBlockIndex->GetBlockHash().GetHex());
	std::thread t(runCommand, command);
	// thread runs free
	t.detach();
	});
	}
	#endif

	std::vector<fs::path> vImportFiles;
	for (const std::string &strFile : args.GetArgs("-loadblock")) {
	vImportFiles.push_back(fs::PathFromString(strFile));
	}

	chainman.m_load_block = std::thread(
	&util::TraceThread, "loadblk", [=, &config, &chainman, &args] {
	ThreadImport(config, chainman, vImportFiles, args);
	});

	// Wait for genesis block to be processed
	{
	WAIT_LOCK(g_genesis_wait_mutex, lock);
	// We previously could hang here if StartShutdown() is called prior to
	// ThreadImport getting started, so instead we just wait on a timer to
	// check ShutdownRequested() regularly.
	while (!fHaveGenesis && !ShutdownRequested()) {
	g_genesis_wait_cv.wait_for(lock, std::chrono::milliseconds(500));
	}
	block_notify_genesis_wait_connection.disconnect();
	}

	if (ShutdownRequested()) {
	return false;
	}

	// Step 12: start node

	int chain_active_height;

	//// debug print
	{
	LOCK(cs_main);
	LogPrintf("block tree size = %u\n", chainman.BlockIndex().size());
	chain_active_height = chainman.ActiveChain().Height();
	if (tip_info) {
	tip_info->block_height = chain_active_height;
	tip_info->block_time =
	chainman.ActiveChain().Tip()
	? chainman.ActiveChain().Tip()->GetBlockTime()
	: chainman.GetParams().GenesisBlock().GetBlockTime();
	tip_info->verification_progress = GuessVerificationProgress(
	chainman.GetParams().TxData(), chainman.ActiveChain().Tip());
	}
	if (tip_info && chainman.m_best_header) {
	tip_info->header_height = chainman.m_best_header->nHeight;
	tip_info->header_time = chainman.m_best_header->GetBlockTime();
	}
	}
	LogPrintf("nBestHeight = %d\n", chain_active_height);
	if (node.peerman) {
	node.peerman->SetBestHeight(chain_active_height);
	}

	// Map ports with UPnP or NAT-PMP.
	StartMapPort(args.GetBoolArg("-upnp", DEFAULT_UPNP),
	args.GetBoolArg("-natpmp", DEFAULT_NATPMP));

	CConnman::Options connOptions;
	connOptions.nLocalServices = nLocalServices;
	connOptions.nMaxConnections = nMaxConnections;
	connOptions.m_max_avalanche_outbound =
	g_avalanche && isAvalancheEnabled(args)
	? args.GetIntArg("-maxavalancheoutbound",
	DEFAULT_MAX_AVALANCHE_OUTBOUND_CONNECTIONS)
	: 0;
	connOptions.m_max_outbound_full_relay = std::min(
	MAX_OUTBOUND_FULL_RELAY_CONNECTIONS,
	connOptions.nMaxConnections - connOptions.m_max_avalanche_outbound);
	connOptions.m_max_outbound_block_relay = std::min(
	MAX_BLOCK_RELAY_ONLY_CONNECTIONS,
	connOptions.nMaxConnections - connOptions.m_max_avalanche_outbound -
	connOptions.m_max_outbound_full_relay);
	connOptions.nMaxAddnode = MAX_ADDNODE_CONNECTIONS;
	connOptions.nMaxFeeler = MAX_FEELER_CONNECTIONS;
	connOptions.uiInterface = &uiInterface;
	connOptions.m_banman = node.banman.get();
	connOptions.m_msgproc.push_back(node.peerman.get());
	if (g_avalanche) {
	connOptions.m_msgproc.push_back(g_avalanche.get());
	}
	connOptions.nSendBufferMaxSize =
	1000 * args.GetIntArg("-maxsendbuffer", DEFAULT_MAXSENDBUFFER);
	connOptions.nReceiveFloodSize =
	1000 * args.GetIntArg("-maxreceivebuffer", DEFAULT_MAXRECEIVEBUFFER);
	connOptions.m_added_nodes = args.GetArgs("-addnode");

	connOptions.nMaxOutboundLimit =
	1024 * 1024 *
	args.GetIntArg("-maxuploadtarget", DEFAULT_MAX_UPLOAD_TARGET);
	connOptions.m_peer_connect_timeout = peer_connect_timeout;

	// Port to bind to if `-bind=addr` is provided without a `:port` suffix.
	const uint16_t default_bind_port = static_cast<uint16_t>(
	args.GetIntArg("-port", config.GetChainParams().GetDefaultPort()));

	const auto BadPortWarning = [](const char *prefix, uint16_t port) {
	return strprintf(_("%s request to listen on port %u. This port is "
	"considered \"bad\" and "
	"thus it is unlikely that any Bitcoin ABC peers "
	"connect to it. See "
	"doc/p2p-bad-ports.md for details and a full list."),
	prefix, port);
	};

	for (const std::string &bind_arg : args.GetArgs("-bind")) {
	CService bind_addr;
	const size_t index = bind_arg.rfind('=');
	if (index == std::string::npos) {
	if (Lookup(bind_arg, bind_addr, default_bind_port,
	/fAllowLookup=/false)) {
	connOptions.vBinds.push_back(bind_addr);
	if (IsBadPort(bind_addr.GetPort())) {
	InitWarning(BadPortWarning("-bind", bind_addr.GetPort()));
	}
	continue;
	}
	} else {
	const std::string network_type = bind_arg.substr(index + 1);
	if (network_type == "onion") {
	const std::string truncated_bind_arg =
	bind_arg.substr(0, index);
	if (Lookup(truncated_bind_arg, bind_addr,
	BaseParams().OnionServiceTargetPort(), false)) {
	connOptions.onion_binds.push_back(bind_addr);
	continue;
	}
	}
	}
	return InitError(ResolveErrMsg("bind", bind_arg));
	}

	for (const std::string &strBind : args.GetArgs("-whitebind")) {
	NetWhitebindPermissions whitebind;
	bilingual_str error;
	if (!NetWhitebindPermissions::TryParse(strBind, whitebind, error)) {
	return InitError(error);
	}
	connOptions.vWhiteBinds.push_back(whitebind);
	}

	// If the user did not specify -bind= or -whitebind= then we bind
	// on any address - 0.0.0.0 (IPv4) and :: (IPv6).
	connOptions.bind_on_any =
	args.GetArgs("-bind").empty() && args.GetArgs("-whitebind").empty();

	// Emit a warning if a bad port is given to -port= but only if -bind and
	// -whitebind are not given, because if they are, then -port= is ignored.
	if (connOptions.bind_on_any && args.IsArgSet("-port")) {
	const uint16_t port_arg = args.GetIntArg("-port", 0);
	if (IsBadPort(port_arg)) {
	InitWarning(BadPortWarning("-port", port_arg));
	}
	}

	CService onion_service_target;
	if (!connOptions.onion_binds.empty()) {
	onion_service_target = connOptions.onion_binds.front();
	} else {
	onion_service_target = DefaultOnionServiceTarget();
	connOptions.onion_binds.push_back(onion_service_target);
	}

	if (args.GetBoolArg("-listenonion", DEFAULT_LISTEN_ONION)) {
	if (connOptions.onion_binds.size() > 1) {
	InitWarning(strprintf(
	_("More than one onion bind address is provided. Using %s "
	"for the automatically created Tor onion service."),
	onion_service_target.ToStringIPPort()));
	}
	StartTorControl(onion_service_target);
	}

	if (connOptions.bind_on_any) {
	// Only add all IP addresses of the machine if we would be listening on
	// any address - 0.0.0.0 (IPv4) and :: (IPv6).
	Discover();
	}

	for (const auto &net : args.GetArgs("-whitelist")) {
	NetWhitelistPermissions subnet;
	bilingual_str error;
	if (!NetWhitelistPermissions::TryParse(net, subnet, error)) {
	return InitError(error);
	}
	connOptions.vWhitelistedRange.push_back(subnet);
	}

	connOptions.vSeedNodes = args.GetArgs("-seednode");

	// Initiate outbound connections unless connect=0
	connOptions.m_use_addrman_outgoing = !args.IsArgSet("-connect");
	if (!connOptions.m_use_addrman_outgoing) {
	const auto connect = args.GetArgs("-connect");
	if (connect.size() != 1 \|\| connect[0] != "0") {
	connOptions.m_specified_outgoing = connect;
	}
	}

	const std::string &i2psam_arg = args.GetArg("-i2psam", "");
	if (!i2psam_arg.empty()) {
	CService addr;
	if (!Lookup(i2psam_arg, addr, 7656, fNameLookup) \|\| !addr.IsValid()) {
	return InitError(strprintf(
	_("Invalid -i2psam address or hostname: '%s'"), i2psam_arg));
	}
	SetReachable(NET_I2P, true);
	SetProxy(NET_I2P, proxyType{addr});
	} else {
	SetReachable(NET_I2P, false);
	}

	connOptions.m_i2p_accept_incoming =
	args.GetBoolArg("-i2pacceptincoming", true);

	if (!node.connman->Start(*node.scheduler, connOptions)) {
	return false;
	}

	// Step 13: finished

	// At this point, the RPC is "started", but still in warmup, which means it
	// cannot yet be called. Before we make it callable, we need to make sure
	// that the RPC's view of the best block is valid and consistent with
	// ChainstateManager's active tip.
	//
	// If we do not do this, RPC's view of the best block will be height=0 and
	// hash=0x0. This will lead to erroroneous responses for things like
	// waitforblockheight.
	RPCNotifyBlockChange(
	WITH_LOCK(chainman.GetMutex(), return chainman.ActiveTip()));
	SetRPCWarmupFinished();

	uiInterface.InitMessage(_("Done loading").translated);

	for (const auto &client : node.chain_clients) {
	client->start(*node.scheduler);
	}

	BanMan *banman = node.banman.get();
	node.scheduler->scheduleEvery(
	[banman] {
	banman->DumpBanlist();
	return true;
	},
	DUMP_BANS_INTERVAL);

	if (node.peerman) {
	node.peerman->StartScheduledTasks(*node.scheduler);
	}

	// Start Avalanche's event loop.
	g_avalanche->startEventLoop(*node.scheduler);

	#if HAVE_SYSTEM
	StartupNotify(args);
	#endif

	return true;
	}
	diff --git a/src/rpc/mempool.cpp b/src/rpc/mempool.cpp
	index 21e1b54a0..dfab6d833 100644
	--- a/src/rpc/mempool.cpp
	+++ b/src/rpc/mempool.cpp
	@@ -1,496 +1,496 @@
	// Copyright (c) 2010 Satoshi Nakamoto
	// Copyright (c) 2009-2022 The Bitcoin Core developers
	// Distributed under the MIT software license, see the accompanying
	// file COPYING or http://www.opensource.org/licenses/mit-license.php.

	#include <core_io.h>
	#include <fs.h>
	#include <node/context.h>
	#include <node/mempool_persist_args.h>
	#include <policy/settings.h>
	#include <primitives/transaction.h>
	#include <rpc/server.h>
	#include <rpc/server_util.h>
	#include <rpc/util.h>
	#include <txmempool.h>
	#include <univalue.h>
	#include <validation.h>

	using node::MempoolPath;
	using node::NodeContext;
	using node::ShouldPersistMempool;

	static std::vector<RPCResult> MempoolEntryDescription() {
	const auto &ticker = Currency::get().ticker;
	return {
	RPCResult{RPCResult::Type::NUM, "size", "transaction size."},
	RPCResult{RPCResult::Type::NUM_TIME, "time",
	"local time transaction entered pool in seconds since 1 Jan "
	"1970 GMT"},
	RPCResult{RPCResult::Type::NUM, "height",
	"block height when transaction entered pool"},
	RPCResult{RPCResult::Type::OBJ,
	"fees",
	"",
	{{
	RPCResult{RPCResult::Type::STR_AMOUNT, "base",
	"transaction fee in " + ticker},
	RPCResult{RPCResult::Type::STR_AMOUNT, "modified",
	"transaction fee with fee deltas used for "
	"mining priority in " +
	ticker},
	}}},
	RPCResult{
	RPCResult::Type::ARR,
	"depends",
	"unconfirmed transactions used as inputs for this transaction",
	{RPCResult{RPCResult::Type::STR_HEX, "transactionid",
	"parent transaction id"}}},
	RPCResult{
	RPCResult::Type::ARR,
	"spentby",
	"unconfirmed transactions spending outputs from this transaction",
	{RPCResult{RPCResult::Type::STR_HEX, "transactionid",
	"child transaction id"}}},
	RPCResult{RPCResult::Type::BOOL, "unbroadcast",
	"Whether this transaction is currently unbroadcast (initial "
	"broadcast not yet acknowledged by any peers)"},
	};
	}

	static void entryToJSON(const CTxMemPool &pool, UniValue &info,
	const CTxMemPoolEntryRef &e)
	EXCLUSIVE_LOCKS_REQUIRED(pool.cs) {
	AssertLockHeld(pool.cs);

	UniValue fees(UniValue::VOBJ);
	fees.pushKV("base", e->GetFee());
	fees.pushKV("modified", e->GetModifiedFee());
	info.pushKV("fees", fees);

	info.pushKV("size", (int)e->GetTxSize());
	info.pushKV("time", count_seconds(e->GetTime()));
	info.pushKV("height", (int)e->GetHeight());
	const CTransaction &tx = e->GetTx();
	std::set<std::string> setDepends;
	for (const CTxIn &txin : tx.vin) {
	if (pool.exists(txin.prevout.GetTxId())) {
	setDepends.insert(txin.prevout.GetTxId().ToString());
	}
	}

	UniValue depends(UniValue::VARR);
	for (const std::string &dep : setDepends) {
	depends.push_back(dep);
	}

	info.pushKV("depends", depends);

	UniValue spent(UniValue::VARR);
	for (const auto &child : e->GetMemPoolChildrenConst()) {
	spent.push_back(child.get()->GetTx().GetId().ToString());
	}

	info.pushKV("spentby", spent);
	info.pushKV("unbroadcast", pool.IsUnbroadcastTx(tx.GetId()));
	}

	UniValue MempoolToJSON(const CTxMemPool &pool, bool verbose,
	bool include_mempool_sequence) {
	if (verbose) {
	if (include_mempool_sequence) {
	throw JSONRPCError(
	RPC_INVALID_PARAMETER,
	"Verbose results cannot contain mempool sequence values.");
	}
	LOCK(pool.cs);
	UniValue o(UniValue::VOBJ);
	for (const CTxMemPoolEntryRef &e : pool.mapTx) {
	const TxId &txid = e->GetTx().GetId();
	UniValue info(UniValue::VOBJ);
	entryToJSON(pool, info, e);
	// Mempool has unique entries so there is no advantage in using
	// UniValue::pushKV, which checks if the key already exists in O(N).
	// UniValue::__pushKV is used instead which currently is O(1).
	o.__pushKV(txid.ToString(), info);
	}
	return o;
	} else {
	uint64_t mempool_sequence;
	std::vector<TxId> vtxids;
	{
	LOCK(pool.cs);
	pool.getAllTxIds(vtxids);
	mempool_sequence = pool.GetSequence();
	}
	UniValue a(UniValue::VARR);
	for (const TxId &txid : vtxids) {
	a.push_back(txid.ToString());
	}

	if (!include_mempool_sequence) {
	return a;
	} else {
	UniValue o(UniValue::VOBJ);
	o.pushKV("txids", a);
	o.pushKV("mempool_sequence", mempool_sequence);
	return o;
	}
	}
	}

	RPCHelpMan getrawmempool() {
	return RPCHelpMan{
	"getrawmempool",
	"Returns all transaction ids in memory pool as a json array of "
	"string transaction ids.\n"
	"\nHint: use getmempoolentry to fetch a specific transaction from the "
	"mempool.\n",
	{
	{"verbose", RPCArg::Type::BOOL, RPCArg::Default{false},
	"True for a json object, false for array of transaction ids"},
	{"mempool_sequence", RPCArg::Type::BOOL, RPCArg::Default{false},
	"If verbose=false, returns a json object with transaction list "
	"and mempool sequence number attached."},
	},
	{
	RPCResult{"for verbose = false",
	RPCResult::Type::ARR,
	"",
	"",
	{
	{RPCResult::Type::STR_HEX, "", "The transaction id"},
	}},
	RPCResult{"for verbose = true",
	RPCResult::Type::OBJ_DYN,
	"",
	"",
	{
	{RPCResult::Type::OBJ, "transactionid", "",
	MempoolEntryDescription()},
	}},
	RPCResult{
	"for verbose = false and mempool_sequence = true",
	RPCResult::Type::OBJ,
	"",
	"",
	{
	{RPCResult::Type::ARR,
	"txids",
	"",
	{
	{RPCResult::Type::STR_HEX, "", "The transaction id"},
	}},
	{RPCResult::Type::NUM, "mempool_sequence",
	"The mempool sequence value."},
	}},
	},
	RPCExamples{HelpExampleCli("getrawmempool", "true") +
	HelpExampleRpc("getrawmempool", "true")},
	[&](const RPCHelpMan &self, const Config &config,
	const JSONRPCRequest &request) -> UniValue {
	bool fVerbose = false;
	if (!request.params[0].isNull()) {
	fVerbose = request.params[0].get_bool();
	}

	bool include_mempool_sequence = false;
	if (!request.params[1].isNull()) {
	include_mempool_sequence = request.params[1].get_bool();
	}

	return MempoolToJSON(EnsureAnyMemPool(request.context), fVerbose,
	include_mempool_sequence);
	},
	};
	}

	RPCHelpMan getmempoolancestors() {
	return RPCHelpMan{
	"getmempoolancestors",
	"If txid is in the mempool, returns all in-mempool ancestors.\n",
	{
	{"txid", RPCArg::Type::STR_HEX, RPCArg::Optional::NO,
	"The transaction id (must be in mempool)"},
	{"verbose", RPCArg::Type::BOOL, RPCArg::Default{false},
	"True for a json object, false for array of transaction ids"},
	},
	{
	RPCResult{
	"for verbose = false",
	RPCResult::Type::ARR,
	"",
	"",
	{{RPCResult::Type::STR_HEX, "",
	"The transaction id of an in-mempool ancestor transaction"}}},
	RPCResult{"for verbose = true",
	RPCResult::Type::OBJ_DYN,
	"",
	"",
	{
	{RPCResult::Type::OBJ, "transactionid", "",
	MempoolEntryDescription()},
	}},
	},
	RPCExamples{HelpExampleCli("getmempoolancestors", "\"mytxid\"") +
	HelpExampleRpc("getmempoolancestors", "\"mytxid\"")},
	[&](const RPCHelpMan &self, const Config &config,
	const JSONRPCRequest &request) -> UniValue {
	bool fVerbose = false;
	if (!request.params[1].isNull()) {
	fVerbose = request.params[1].get_bool();
	}

	TxId txid(ParseHashV(request.params[0], "parameter 1"));

	const CTxMemPool &mempool = EnsureAnyMemPool(request.context);
	LOCK(mempool.cs);

	CTxMemPool::txiter it = mempool.mapTx.find(txid);
	if (it == mempool.mapTx.end()) {
	throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,
	"Transaction not in mempool");
	}

	CTxMemPool::setEntries setAncestors;
	mempool.CalculateMemPoolAncestors(*it, setAncestors, false);

	if (!fVerbose) {
	UniValue o(UniValue::VARR);
	for (CTxMemPool::txiter ancestorIt : setAncestors) {
	o.push_back((*ancestorIt)->GetTx().GetId().ToString());
	}
	return o;
	} else {
	UniValue o(UniValue::VOBJ);
	for (CTxMemPool::txiter ancestorIt : setAncestors) {
	const CTxMemPoolEntryRef &e = *ancestorIt;
	const TxId &_txid = e->GetTx().GetId();
	UniValue info(UniValue::VOBJ);
	entryToJSON(mempool, info, e);
	o.pushKV(_txid.ToString(), info);
	}
	return o;
	}
	},
	};
	}

	RPCHelpMan getmempooldescendants() {
	return RPCHelpMan{
	"getmempooldescendants",
	"If txid is in the mempool, returns all in-mempool descendants.\n",
	{
	{"txid", RPCArg::Type::STR_HEX, RPCArg::Optional::NO,
	"The transaction id (must be in mempool)"},
	{"verbose", RPCArg::Type::BOOL, RPCArg::Default{false},
	"True for a json object, false for array of transaction ids"},
	},
	{
	RPCResult{"for verbose = false",
	RPCResult::Type::ARR,
	"",
	"",
	{{RPCResult::Type::STR_HEX, "",
	"The transaction id of an in-mempool descendant "
	"transaction"}}},
	RPCResult{"for verbose = true",
	RPCResult::Type::OBJ_DYN,
	"",
	"",
	{
	{RPCResult::Type::OBJ, "transactionid", "",
	MempoolEntryDescription()},
	}},
	},
	RPCExamples{HelpExampleCli("getmempooldescendants", "\"mytxid\"") +
	HelpExampleRpc("getmempooldescendants", "\"mytxid\"")},
	[&](const RPCHelpMan &self, const Config &config,
	const JSONRPCRequest &request) -> UniValue {
	bool fVerbose = false;
	if (!request.params[1].isNull()) {
	fVerbose = request.params[1].get_bool();
	}

	TxId txid(ParseHashV(request.params[0], "parameter 1"));

	const CTxMemPool &mempool = EnsureAnyMemPool(request.context);
	LOCK(mempool.cs);

	CTxMemPool::txiter it = mempool.mapTx.find(txid);
	if (it == mempool.mapTx.end()) {
	throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,
	"Transaction not in mempool");
	}

	CTxMemPool::setEntries setDescendants;
	mempool.CalculateDescendants(it, setDescendants);
	// CTxMemPool::CalculateDescendants will include the given tx
	setDescendants.erase(it);

	if (!fVerbose) {
	UniValue o(UniValue::VARR);
	for (CTxMemPool::txiter descendantIt : setDescendants) {
	o.push_back((*descendantIt)->GetTx().GetId().ToString());
	}

	return o;
	} else {
	UniValue o(UniValue::VOBJ);
	for (CTxMemPool::txiter descendantIt : setDescendants) {
	const CTxMemPoolEntryRef &e = *descendantIt;
	const TxId &_txid = e->GetTx().GetId();
	UniValue info(UniValue::VOBJ);
	entryToJSON(mempool, info, e);
	o.pushKV(_txid.ToString(), info);
	}
	return o;
	}
	},
	};
	}

	RPCHelpMan getmempoolentry() {
	return RPCHelpMan{
	"getmempoolentry",
	"Returns mempool data for given transaction\n",
	{
	{"txid", RPCArg::Type::STR_HEX, RPCArg::Optional::NO,
	"The transaction id (must be in mempool)"},
	},
	RPCResult{RPCResult::Type::OBJ, "", "", MempoolEntryDescription()},
	RPCExamples{HelpExampleCli("getmempoolentry", "\"mytxid\"") +
	HelpExampleRpc("getmempoolentry", "\"mytxid\"")},
	[&](const RPCHelpMan &self, const Config &config,
	const JSONRPCRequest &request) -> UniValue {
	TxId txid(ParseHashV(request.params[0], "parameter 1"));

	const CTxMemPool &mempool = EnsureAnyMemPool(request.context);
	LOCK(mempool.cs);

	CTxMemPool::txiter it = mempool.mapTx.find(txid);
	if (it == mempool.mapTx.end()) {
	throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,
	"Transaction not in mempool");
	}

	UniValue info(UniValue::VOBJ);
	entryToJSON(mempool, info, *it);
	return info;
	},
	};
	}

	UniValue MempoolInfoToJSON(const CTxMemPool &pool) {
	// Make sure this call is atomic in the pool.
	LOCK(pool.cs);
	UniValue ret(UniValue::VOBJ);
	- ret.pushKV("loaded", pool.IsLoaded());
	+ ret.pushKV("loaded", pool.GetLoadTried());
	ret.pushKV("size", (int64_t)pool.size());
	ret.pushKV("bytes", (int64_t)pool.GetTotalTxSize());
	ret.pushKV("usage", (int64_t)pool.DynamicMemoryUsage());
	ret.pushKV("total_fee", pool.GetTotalFee());
	ret.pushKV("maxmempool", pool.m_max_size_bytes);
	ret.pushKV("mempoolminfee",
	std::max(pool.GetMinFee(), ::minRelayTxFee).GetFeePerK());
	ret.pushKV("minrelaytxfee", ::minRelayTxFee.GetFeePerK());
	ret.pushKV("unbroadcastcount", uint64_t{pool.GetUnbroadcastTxs().size()});
	return ret;
	}

	RPCHelpMan getmempoolinfo() {
	const auto &ticker = Currency::get().ticker;
	return RPCHelpMan{
	"getmempoolinfo",
	"Returns details on the active state of the TX memory pool.\n",
	{},
	RPCResult{
	RPCResult::Type::OBJ,
	"",
	"",
	{
	{RPCResult::Type::BOOL, "loaded",
	"True if the mempool is fully loaded"},
	{RPCResult::Type::NUM, "size", "Current tx count"},
	{RPCResult::Type::NUM, "bytes", "Sum of all transaction sizes"},
	{RPCResult::Type::NUM, "usage",
	"Total memory usage for the mempool"},
	{RPCResult::Type::NUM, "maxmempool",
	"Maximum memory usage for the mempool"},
	{RPCResult::Type::STR_AMOUNT, "total_fee",
	"Total fees for the mempool in " + ticker +
	", ignoring modified fees through prioritizetransaction"},
	{RPCResult::Type::STR_AMOUNT, "mempoolminfee",
	"Minimum fee rate in " + ticker +
	"/kB for tx to be accepted. Is the maximum of "
	"minrelaytxfee and minimum mempool fee"},
	{RPCResult::Type::STR_AMOUNT, "minrelaytxfee",
	"Current minimum relay fee for transactions"},
	{RPCResult::Type::NUM, "unbroadcastcount",
	"Current number of transactions that haven't passed initial "
	"broadcast yet"},
	}},
	RPCExamples{HelpExampleCli("getmempoolinfo", "") +
	HelpExampleRpc("getmempoolinfo", "")},
	[&](const RPCHelpMan &self, const Config &config,
	const JSONRPCRequest &request) -> UniValue {
	return MempoolInfoToJSON(EnsureAnyMemPool(request.context));
	},
	};
	}

	RPCHelpMan savemempool() {
	return RPCHelpMan{
	"savemempool",
	"Dumps the mempool to disk. It will fail until the previous dump is "
	"fully loaded.\n",
	{},
	RPCResult{RPCResult::Type::OBJ,
	"",
	"",
	{
	{RPCResult::Type::STR, "filename",
	"the directory and file where the mempool was saved"},
	}},
	RPCExamples{HelpExampleCli("savemempool", "") +
	HelpExampleRpc("savemempool", "")},
	[&](const RPCHelpMan &self, const Config &config,
	const JSONRPCRequest &request) -> UniValue {
	const ArgsManager &args{EnsureAnyArgsman(request.context)};
	const CTxMemPool &mempool = EnsureAnyMemPool(request.context);

	- if (!mempool.IsLoaded()) {
	+ if (!mempool.GetLoadTried()) {
	throw JSONRPCError(RPC_MISC_ERROR,
	"The mempool was not loaded yet");
	}

	const fs::path &dump_path = MempoolPath(args);

	if (!DumpMempool(mempool, dump_path)) {
	throw JSONRPCError(RPC_MISC_ERROR,
	"Unable to dump mempool to disk");
	}

	UniValue ret(UniValue::VOBJ);
	ret.pushKV("filename", dump_path.u8string());

	return ret;
	},
	};
	}

	void RegisterMempoolRPCCommands(CRPCTable &t) {
	static const CRPCCommand commands[]{
	// category actor (function)
	// -------- ----------------
	{"blockchain", getmempoolancestors},
	{"blockchain", getmempooldescendants},
	{"blockchain", getmempoolentry},
	{"blockchain", getmempoolinfo},
	{"blockchain", getrawmempool},
	{"blockchain", savemempool},
	};
	for (const auto &c : commands) {
	t.appendCommand(c.name, &c);
	}
	}
	diff --git a/src/txmempool.cpp b/src/txmempool.cpp
	index e34137fc6..23d225240 100644
	--- a/src/txmempool.cpp
	+++ b/src/txmempool.cpp
	@@ -1,1038 +1,1038 @@
	// Copyright (c) 2009-2010 Satoshi Nakamoto
	// Copyright (c) 2009-2016 The Bitcoin Core developers
	// Distributed under the MIT software license, see the accompanying
	// file COPYING or http://www.opensource.org/licenses/mit-license.php.

	#include <txmempool.h>

	#include <avalanche/avalanche.h>
	#include <avalanche/processor.h>
	#include <chain.h>
	#include <chainparams.h> // for GetConsensus.
	#include <clientversion.h>
	#include <coins.h>
	#include <config.h>
	#include <consensus/consensus.h>
	#include <consensus/tx_verify.h>
	#include <consensus/validation.h>
	#include <policy/fees.h>
	#include <policy/policy.h>
	#include <policy/settings.h>
	#include <reverse_iterator.h>
	#include <undo.h>
	#include <util/moneystr.h>
	#include <util/system.h>
	#include <util/time.h>
	#include <validation.h>
	#include <validationinterface.h>
	#include <version.h>

	#include <algorithm>
	#include <cmath>
	#include <limits>

	bool TestLockPointValidity(const CChain &active_chain, const LockPoints &lp) {
	AssertLockHeld(cs_main);
	// If there are relative lock times then the maxInputBlock will be set
	// If there are no relative lock times, the LockPoints don't depend on the
	// chain
	if (lp.maxInputBlock) {
	// Check whether active_chain is an extension of the block at which the
	// LockPoints calculation was valid. If not LockPoints are no longer
	// valid
	if (!active_chain.Contains(lp.maxInputBlock)) {
	return false;
	}
	}

	// LockPoints still valid
	return true;
	}

	CTxMemPoolEntry::CTxMemPoolEntry(const CTransactionRef &_tx, const Amount fee,
	int64_t time, unsigned int entry_height,
	bool spends_coinbase, int64_t _sigChecks,
	LockPoints lp)
	: tx{_tx}, nFee{fee},
	nTxSize(tx->GetTotalSize()), nUsageSize{RecursiveDynamicUsage(tx)},
	nTime(time), entryHeight{entry_height}, spendsCoinbase(spends_coinbase),
	sigChecks(_sigChecks), lockPoints(lp) {}

	size_t CTxMemPoolEntry::GetTxVirtualSize() const {
	return GetVirtualTransactionSize(nTxSize, sigChecks);
	}

	void CTxMemPoolEntry::UpdateFeeDelta(Amount newFeeDelta) {
	feeDelta = newFeeDelta;
	}

	void CTxMemPoolEntry::UpdateLockPoints(const LockPoints &lp) {
	lockPoints = lp;
	}

	bool CTxMemPool::CalculateAncestors(
	setEntries &setAncestors,
	CTxMemPoolEntry::Parents &staged_ancestors) const {
	while (!staged_ancestors.empty()) {
	const auto stage = staged_ancestors.begin()->get();

	txiter stageit = mapTx.find(stage->GetTx().GetId());
	assert(stageit != mapTx.end());
	setAncestors.insert(stageit);
	staged_ancestors.erase(staged_ancestors.begin());

	const CTxMemPoolEntry::Parents &parents =
	(*stageit)->GetMemPoolParentsConst();
	for (const auto &parent : parents) {
	txiter parent_it = mapTx.find(parent.get()->GetTx().GetId());
	assert(parent_it != mapTx.end());

	// If this is a new ancestor, add it.
	if (setAncestors.count(parent_it) == 0) {
	staged_ancestors.insert(parent);
	}
	}
	}

	return true;
	}

	bool CTxMemPool::CalculateMemPoolAncestors(
	const CTxMemPoolEntryRef &entry, setEntries &setAncestors,
	bool fSearchForParents /* = true */) const {
	CTxMemPoolEntry::Parents staged_ancestors;
	const CTransaction &tx = entry->GetTx();

	if (fSearchForParents) {
	// Get parents of this transaction that are in the mempool
	// GetMemPoolParents() is only valid for entries in the mempool, so we
	// iterate mapTx to find parents.
	for (const CTxIn &in : tx.vin) {
	std::optional<txiter> piter = GetIter(in.prevout.GetTxId());
	if (!piter) {
	continue;
	}
	staged_ancestors.insert(**piter);
	}
	} else {
	// If we're not searching for parents, we require this to be an entry in
	// the mempool already.
	staged_ancestors = entry->GetMemPoolParentsConst();
	}

	return CalculateAncestors(setAncestors, staged_ancestors);
	}

	void CTxMemPool::UpdateParentsOf(bool add, txiter it) {
	// add or remove this tx as a child of each parent
	for (const auto &parent : (*it)->GetMemPoolParentsConst()) {
	auto parent_it = mapTx.find(parent.get()->GetTx().GetId());
	assert(parent_it != mapTx.end());
	UpdateChild(parent_it, it, add);
	}
	}

	void CTxMemPool::UpdateChildrenForRemoval(txiter it) {
	const CTxMemPoolEntry::Children &children =
	(*it)->GetMemPoolChildrenConst();
	for (const auto &child : children) {
	auto updateIt = mapTx.find(child.get()->GetTx().GetId());
	assert(updateIt != mapTx.end());
	UpdateParent(updateIt, it, false);
	}
	}

	void CTxMemPool::UpdateForRemoveFromMempool(const setEntries &entriesToRemove) {
	for (txiter removeIt : entriesToRemove) {
	// Note that UpdateParentsOf severs the child links that point to
	// removeIt in the entries for the parents of removeIt.
	UpdateParentsOf(false, removeIt);
	}

	// After updating all the parent links, we can now sever the link between
	// each transaction being removed and any mempool children (ie, update
	// CTxMemPoolEntry::m_parents for each direct child of a transaction being
	// removed).
	for (txiter removeIt : entriesToRemove) {
	UpdateChildrenForRemoval(removeIt);
	}
	}

	CTxMemPool::CTxMemPool(const Options &opts)
	: m_check_ratio(opts.check_ratio),
	m_max_size_bytes{opts.max_size_bytes}, m_expiry{opts.expiry} {
	// lock free clear
	_clear();
	}

	CTxMemPool::~CTxMemPool() {}

	bool CTxMemPool::isSpent(const COutPoint &outpoint) const {
	LOCK(cs);
	return mapNextTx.count(outpoint);
	}

	unsigned int CTxMemPool::GetTransactionsUpdated() const {
	return nTransactionsUpdated;
	}

	void CTxMemPool::AddTransactionsUpdated(unsigned int n) {
	nTransactionsUpdated += n;
	}

	void CTxMemPool::addUnchecked(CTxMemPoolEntryRef entry) {
	// get a guaranteed unique id (in case tests re-use the same object)
	entry->SetEntryId(nextEntryId++);

	// Update transaction for any feeDelta created by PrioritiseTransaction
	{
	Amount feeDelta = Amount::zero();
	ApplyDelta(entry->GetTx().GetId(), feeDelta);
	entry->UpdateFeeDelta(feeDelta);
	}

	// Add to memory pool without checking anything.
	// Used by AcceptToMemoryPool(), which DOES do all the appropriate checks.
	auto [newit, inserted] = mapTx.insert(entry);
	// Sanity check: It is a programming error if insertion fails (uniqueness
	// invariants in mapTx are violated, etc)
	assert(inserted);
	// Sanity check: We should always end up inserting at the end of the
	// entry_id index
	assert(&mapTx.get<entry_id>().rbegin() == &newit);

	// Update cachedInnerUsage to include contained transaction's usage.
	// (When we update the entry for in-mempool parents, memory usage will be
	// further updated.)
	cachedInnerUsage += entry->DynamicMemoryUsage();

	const CTransaction &tx = entry->GetTx();
	std::set<TxId> setParentTransactions;
	for (const CTxIn &in : tx.vin) {
	mapNextTx.insert(std::make_pair(&in.prevout, &tx));
	setParentTransactions.insert(in.prevout.GetTxId());
	}
	// Don't bother worrying about child transactions of this one. It is
	// guaranteed that a new transaction arriving will not have any children,
	// because such children would be orphans.

	// Update ancestors with information about this tx
	for (const auto &pit : GetIterSet(setParentTransactions)) {
	UpdateParent(newit, pit, true);
	}

	UpdateParentsOf(true, newit);

	nTransactionsUpdated++;
	totalTxSize += entry->GetTxSize();
	m_total_fee += entry->GetFee();
	}

	void CTxMemPool::removeUnchecked(txiter it, MemPoolRemovalReason reason) {
	// We increment mempool sequence value no matter removal reason
	// even if not directly reported below.
	uint64_t mempool_sequence = GetAndIncrementSequence();

	if (reason != MemPoolRemovalReason::BLOCK) {
	// Notify clients that a transaction has been removed from the mempool
	// for any reason except being included in a block. Clients interested
	// in transactions included in blocks can subscribe to the
	// BlockConnected notification.
	GetMainSignals().TransactionRemovedFromMempool(
	(*it)->GetSharedTx(), reason, mempool_sequence);
	}

	for (const CTxIn &txin : (*it)->GetTx().vin) {
	mapNextTx.erase(txin.prevout);
	}

	/* add logging because unchecked */
	const TxId &txid = (*it)->GetTx().GetId();
	RemoveUnbroadcastTx(txid, true);

	finalizedTxs.remove(txid);

	totalTxSize -= (*it)->GetTxSize();
	m_total_fee -= (*it)->GetFee();
	cachedInnerUsage -= (*it)->DynamicMemoryUsage();
	cachedInnerUsage -=
	memusage::DynamicUsage((*it)->GetMemPoolParentsConst()) +
	memusage::DynamicUsage((*it)->GetMemPoolChildrenConst());
	mapTx.erase(it);
	nTransactionsUpdated++;
	}

	// Calculates descendants of entry that are not already in setDescendants, and
	// adds to setDescendants. Assumes entryit is already a tx in the mempool and
	// CTxMemPoolEntry::m_children is correct for tx and all descendants. Also
	// assumes that if an entry is in setDescendants already, then all in-mempool
	// descendants of it are already in setDescendants as well, so that we can save
	// time by not iterating over those entries.
	void CTxMemPool::CalculateDescendants(txiter entryit,
	setEntries &setDescendants) const {
	setEntries stage;
	if (setDescendants.count(entryit) == 0) {
	stage.insert(entryit);
	}
	// Traverse down the children of entry, only adding children that are not
	// accounted for in setDescendants already (because those children have
	// either already been walked, or will be walked in this iteration).
	while (!stage.empty()) {
	txiter it = *stage.begin();
	setDescendants.insert(it);
	stage.erase(stage.begin());

	const CTxMemPoolEntry::Children &children =
	(*it)->GetMemPoolChildrenConst();
	for (const auto &child : children) {
	txiter childiter = mapTx.find(child.get()->GetTx().GetId());
	assert(childiter != mapTx.end());

	if (!setDescendants.count(childiter)) {
	stage.insert(childiter);
	}
	}
	}
	}

	void CTxMemPool::removeRecursive(const CTransaction &origTx,
	MemPoolRemovalReason reason) {
	// Remove transaction from memory pool.
	AssertLockHeld(cs);
	setEntries txToRemove;
	txiter origit = mapTx.find(origTx.GetId());
	if (origit != mapTx.end()) {
	txToRemove.insert(origit);
	} else {
	// When recursively removing but origTx isn't in the mempool be sure to
	// remove any children that are in the pool. This can happen during
	// chain re-orgs if origTx isn't re-accepted into the mempool for any
	// reason.
	auto it = mapNextTx.lower_bound(COutPoint(origTx.GetId(), 0));
	while (it != mapNextTx.end() &&
	it->first->GetTxId() == origTx.GetId()) {
	txiter nextit = mapTx.find(it->second->GetId());
	assert(nextit != mapTx.end());
	txToRemove.insert(nextit);
	++it;
	}
	}

	setEntries setAllRemoves;
	for (txiter it : txToRemove) {
	CalculateDescendants(it, setAllRemoves);
	}

	RemoveStaged(setAllRemoves, reason);
	}

	void CTxMemPool::removeConflicts(const CTransaction &tx) {
	// Remove transactions which depend on inputs of tx, recursively
	AssertLockHeld(cs);
	for (const CTxIn &txin : tx.vin) {
	auto it = mapNextTx.find(txin.prevout);
	if (it != mapNextTx.end()) {
	const CTransaction &txConflict = *it->second;
	if (txConflict != tx) {
	ClearPrioritisation(txConflict.GetId());
	removeRecursive(txConflict, MemPoolRemovalReason::CONFLICT);
	}
	}
	}
	}

	/**
	* Called when a block is connected. Removes from mempool and updates the miner
	* fee estimator.
	*/
	void CTxMemPool::removeForBlock(const std::vector<CTransactionRef> &vtx) {
	AssertLockHeld(cs);

	if (mapTx.empty() && mapDeltas.empty()) {
	// fast-path for IBD and/or when mempool is empty; there is no need to
	// do any of the set-up work below which eats precious cycles.
	// Note that this also skips updating the rolling fee udpate, which is
	// fine: it is only recomputed when the mempool has to be trimmed down
	// because it is full which is contradictory with this condition.
	return;
	}

	DisconnectedBlockTransactions disconnectpool;
	disconnectpool.addForBlock(vtx, *this);

	for (const CTransactionRef &tx :
	reverse_iterate(disconnectpool.GetQueuedTx().get<insertion_order>())) {
	txiter it = mapTx.find(tx->GetId());
	if (it != mapTx.end()) {
	setEntries stage;
	stage.insert(it);
	RemoveStaged(stage, MemPoolRemovalReason::BLOCK);
	} else {
	// Conflicting txs can only exist if the tx was not in the mempool
	removeConflicts(*tx);
	}
	ClearPrioritisation(tx->GetId());
	}

	disconnectpool.clear();

	lastRollingFeeUpdate = GetTime();
	blockSinceLastRollingFeeBump = true;
	}

	void CTxMemPool::_clear() {
	mapTx.clear();
	mapNextTx.clear();
	totalTxSize = 0;
	m_total_fee = Amount::zero();
	cachedInnerUsage = 0;
	lastRollingFeeUpdate = GetTime();
	blockSinceLastRollingFeeBump = false;
	rollingMinimumFeeRate = 0;
	++nTransactionsUpdated;
	}

	void CTxMemPool::clear() {
	LOCK(cs);
	_clear();
	}

	void CTxMemPool::check(const CCoinsViewCache &active_coins_tip,
	int64_t spendheight) const {
	if (m_check_ratio == 0) {
	return;
	}

	if (GetRand(m_check_ratio) >= 1) {
	return;
	}

	AssertLockHeld(::cs_main);
	LOCK(cs);
	LogPrint(BCLog::MEMPOOL,
	"Checking mempool with %u transactions and %u inputs\n",
	(unsigned int)mapTx.size(), (unsigned int)mapNextTx.size());

	uint64_t checkTotal = 0;
	Amount check_total_fee{Amount::zero()};
	uint64_t innerUsage = 0;

	CCoinsViewCache mempoolDuplicate(
	const_cast<CCoinsViewCache *>(&active_coins_tip));

	for (const CTxMemPoolEntryRef &entry : mapTx.get<entry_id>()) {
	checkTotal += entry->GetTxSize();
	check_total_fee += entry->GetFee();
	innerUsage += entry->DynamicMemoryUsage();
	const CTransaction &tx = entry->GetTx();
	innerUsage += memusage::DynamicUsage(entry->GetMemPoolParentsConst()) +
	memusage::DynamicUsage(entry->GetMemPoolChildrenConst());

	CTxMemPoolEntry::Parents setParentCheck;
	for (const CTxIn &txin : tx.vin) {
	// Check that every mempool transaction's inputs refer to available
	// coins, or other mempool tx's.
	txiter parentIt = mapTx.find(txin.prevout.GetTxId());
	if (parentIt != mapTx.end()) {
	const CTransaction &parentTx = (*parentIt)->GetTx();
	assert(parentTx.vout.size() > txin.prevout.GetN() &&
	!parentTx.vout[txin.prevout.GetN()].IsNull());
	setParentCheck.insert(*parentIt);
	// also check that parents have a topological ordering before
	// their children
	assert((*parentIt)->GetEntryId() < entry->GetEntryId());
	}
	// We are iterating through the mempool entries sorted
	// topologically.
	// All parents must have been checked before their children and
	// their coins added to the mempoolDuplicate coins cache.
	assert(mempoolDuplicate.HaveCoin(txin.prevout));
	// Check whether its inputs are marked in mapNextTx.
	auto prevoutNextIt = mapNextTx.find(txin.prevout);
	assert(prevoutNextIt != mapNextTx.end());
	assert(prevoutNextIt->first == &txin.prevout);
	assert(prevoutNextIt->second == &tx);
	}
	auto comp = [](const auto &a, const auto &b) -> bool {
	return a.get()->GetTx().GetId() == b.get()->GetTx().GetId();
	};
	assert(setParentCheck.size() == entry->GetMemPoolParentsConst().size());
	assert(std::equal(setParentCheck.begin(), setParentCheck.end(),
	entry->GetMemPoolParentsConst().begin(), comp));

	// Verify ancestor state is correct.
	setEntries setAncestors;
	std::string dummy;

	const bool ok = CalculateMemPoolAncestors(entry, setAncestors);
	assert(ok);

	// all ancestors should have entryId < this tx's entryId
	for (const auto &ancestor : setAncestors) {
	assert((*ancestor)->GetEntryId() < entry->GetEntryId());
	}

	// Check children against mapNextTx
	CTxMemPoolEntry::Children setChildrenCheck;
	auto iter = mapNextTx.lower_bound(COutPoint(entry->GetTx().GetId(), 0));
	for (; iter != mapNextTx.end() &&
	iter->first->GetTxId() == entry->GetTx().GetId();
	++iter) {
	txiter childIt = mapTx.find(iter->second->GetId());
	// mapNextTx points to in-mempool transactions
	assert(childIt != mapTx.end());
	setChildrenCheck.insert(*childIt);
	}
	assert(setChildrenCheck.size() ==
	entry->GetMemPoolChildrenConst().size());
	assert(std::equal(setChildrenCheck.begin(), setChildrenCheck.end(),
	entry->GetMemPoolChildrenConst().begin(), comp));

	// Not used. CheckTxInputs() should always pass
	TxValidationState dummy_state;
	Amount txfee{Amount::zero()};
	assert(!tx.IsCoinBase());
	assert(Consensus::CheckTxInputs(tx, dummy_state, mempoolDuplicate,
	spendheight, txfee));
	for (const auto &input : tx.vin) {
	mempoolDuplicate.SpendCoin(input.prevout);
	}
	AddCoins(mempoolDuplicate, tx, std::numeric_limits<int>::max());
	}

	for (auto &[_, nextTx] : mapNextTx) {
	txiter it = mapTx.find(nextTx->GetId());
	assert(it != mapTx.end());
	assert(&(*it)->GetTx() == nextTx);
	}

	assert(totalTxSize == checkTotal);
	assert(m_total_fee == check_total_fee);
	assert(innerUsage == cachedInnerUsage);
	}

	bool CTxMemPool::CompareTopologically(const TxId &txida,
	const TxId &txidb) const {
	LOCK(cs);
	auto it1 = mapTx.find(txida);
	if (it1 == mapTx.end()) {
	return false;
	}
	auto it2 = mapTx.find(txidb);
	if (it2 == mapTx.end()) {
	return true;
	}
	return (it1)->GetEntryId() < (it2)->GetEntryId();
	}

	void CTxMemPool::getAllTxIds(std::vector<TxId> &vtxid) const {
	LOCK(cs);

	vtxid.clear();
	vtxid.reserve(mapTx.size());

	for (const auto &entry : mapTx.get<entry_id>()) {
	vtxid.push_back(entry->GetTx().GetId());
	}
	}

	static TxMempoolInfo
	GetInfo(CTxMemPool::indexed_transaction_set::const_iterator it) {
	return TxMempoolInfo{(it)->GetSharedTx(), (it)->GetTime(),
	(it)->GetFee(), (it)->GetTxSize(),
	(it)->GetModifiedFee() - (it)->GetFee()};
	}

	std::vector<TxMempoolInfo> CTxMemPool::infoAll() const {
	LOCK(cs);

	std::vector<TxMempoolInfo> ret;
	ret.reserve(mapTx.size());

	const auto &index = mapTx.get<entry_id>();
	for (auto it = index.begin(); it != index.end(); ++it) {
	ret.push_back(GetInfo(mapTx.project<0>(it)));
	}

	return ret;
	}

	CTransactionRef CTxMemPool::get(const TxId &txid) const {
	LOCK(cs);
	indexed_transaction_set::const_iterator i = mapTx.find(txid);
	if (i == mapTx.end()) {
	return nullptr;
	}

	return (*i)->GetSharedTx();
	}

	TxMempoolInfo CTxMemPool::info(const TxId &txid) const {
	LOCK(cs);
	indexed_transaction_set::const_iterator i = mapTx.find(txid);
	if (i == mapTx.end()) {
	return TxMempoolInfo();
	}

	return GetInfo(i);
	}

	CFeeRate CTxMemPool::estimateFee() const {
	LOCK(cs);

	// minerPolicy uses recent blocks to figure out a reasonable fee. This
	// may disagree with the rollingMinimumFeerate under certain scenarios
	// where the mempool increases rapidly, or blocks are being mined which
	// do not contain propagated transactions.
	return std::max(::minRelayTxFee, GetMinFee());
	}

	void CTxMemPool::PrioritiseTransaction(const TxId &txid,
	const Amount nFeeDelta) {
	{
	LOCK(cs);
	Amount &delta = mapDeltas[txid];
	delta += nFeeDelta;
	txiter it = mapTx.find(txid);
	if (it != mapTx.end()) {
	mapTx.modify(it, [&delta](CTxMemPoolEntryRef &e) {
	e->UpdateFeeDelta(delta);
	});
	++nTransactionsUpdated;
	}
	}
	LogPrintf("PrioritiseTransaction: %s fee += %s\n", txid.ToString(),
	FormatMoney(nFeeDelta));
	}

	void CTxMemPool::ApplyDelta(const TxId &txid, Amount &nFeeDelta) const {
	AssertLockHeld(cs);
	std::map<TxId, Amount>::const_iterator pos = mapDeltas.find(txid);
	if (pos == mapDeltas.end()) {
	return;
	}

	nFeeDelta += pos->second;
	}

	void CTxMemPool::ClearPrioritisation(const TxId &txid) {
	AssertLockHeld(cs);
	mapDeltas.erase(txid);
	}

	const CTransaction *CTxMemPool::GetConflictTx(const COutPoint &prevout) const {
	const auto it = mapNextTx.find(prevout);
	return it == mapNextTx.end() ? nullptr : it->second;
	}

	std::optional<CTxMemPool::txiter> CTxMemPool::GetIter(const TxId &txid) const {
	auto it = mapTx.find(txid);
	if (it != mapTx.end()) {
	return it;
	}
	return std::nullopt;
	}

	CTxMemPool::setEntries
	CTxMemPool::GetIterSet(const std::set<TxId> &txids) const {
	CTxMemPool::setEntries ret;
	for (const auto &txid : txids) {
	const auto mi = GetIter(txid);
	if (mi) {
	ret.insert(*mi);
	}
	}
	return ret;
	}

	bool CTxMemPool::HasNoInputsOf(const CTransaction &tx) const {
	for (const CTxIn &in : tx.vin) {
	if (exists(in.prevout.GetTxId())) {
	return false;
	}
	}

	return true;
	}

	CCoinsViewMemPool::CCoinsViewMemPool(CCoinsView *baseIn,
	const CTxMemPool &mempoolIn)
	: CCoinsViewBacked(baseIn), mempool(mempoolIn) {}

	bool CCoinsViewMemPool::GetCoin(const COutPoint &outpoint, Coin &coin) const {
	// Check to see if the inputs are made available by another tx in the
	// package. These Coins would not be available in the underlying CoinsView.
	if (auto it = m_temp_added.find(outpoint); it != m_temp_added.end()) {
	coin = it->second;
	return true;
	}

	// If an entry in the mempool exists, always return that one, as it's
	// guaranteed to never conflict with the underlying cache, and it cannot
	// have pruned entries (as it contains full) transactions. First checking
	// the underlying cache risks returning a pruned entry instead.
	CTransactionRef ptx = mempool.get(outpoint.GetTxId());
	if (ptx) {
	if (outpoint.GetN() < ptx->vout.size()) {
	coin = Coin(ptx->vout[outpoint.GetN()], MEMPOOL_HEIGHT, false);
	return true;
	}
	return false;
	}
	return base->GetCoin(outpoint, coin);
	}

	void CCoinsViewMemPool::PackageAddTransaction(const CTransactionRef &tx) {
	for (uint32_t n = 0; n < tx->vout.size(); ++n) {
	m_temp_added.emplace(COutPoint(tx->GetId(), n),
	Coin(tx->vout[n], MEMPOOL_HEIGHT, false));
	}
	}

	size_t CTxMemPool::DynamicMemoryUsage() const {
	LOCK(cs);
	// Estimate the overhead of mapTx to be 12 pointers + an allocation, as no
	// exact formula for boost::multi_index_contained is implemented.
	return memusage::MallocUsage(sizeof(CTxMemPoolEntry) +
	12 * sizeof(void ))
	mapTx.size() +
	memusage::DynamicUsage(mapNextTx) +
	memusage::DynamicUsage(mapDeltas) + cachedInnerUsage;
	}

	void CTxMemPool::RemoveUnbroadcastTx(const TxId &txid, const bool unchecked) {
	LOCK(cs);

	if (m_unbroadcast_txids.erase(txid)) {
	LogPrint(
	BCLog::MEMPOOL, "Removed %i from set of unbroadcast txns%s\n",
	txid.GetHex(),
	(unchecked ? " before confirmation that txn was sent out" : ""));
	}
	}

	void CTxMemPool::RemoveStaged(const setEntries &stage,
	MemPoolRemovalReason reason) {
	AssertLockHeld(cs);
	UpdateForRemoveFromMempool(stage);

	// Remove txs in reverse-topological order
	const setRevTopoEntries stageRevTopo(stage.begin(), stage.end());
	for (txiter it : stageRevTopo) {
	removeUnchecked(it, reason);
	}
	}

	int CTxMemPool::Expire(std::chrono::seconds time) {
	AssertLockHeld(cs);
	indexed_transaction_set::index<entry_time>::type::iterator it =
	mapTx.get<entry_time>().begin();
	setEntries toremove;
	while (it != mapTx.get<entry_time>().end() && (*it)->GetTime() < time) {
	toremove.insert(mapTx.project<0>(it));
	it++;
	}

	setEntries stage;
	for (txiter removeit : toremove) {
	CalculateDescendants(removeit, stage);
	}

	RemoveStaged(stage, MemPoolRemovalReason::EXPIRY);
	return stage.size();
	}

	void CTxMemPool::LimitSize(CCoinsViewCache &coins_cache) {
	AssertLockHeld(::cs_main);
	AssertLockHeld(cs);
	int expired = Expire(GetTime<std::chrono::seconds>() - m_expiry);
	if (expired != 0) {
	LogPrint(BCLog::MEMPOOL,
	"Expired %i transactions from the memory pool\n", expired);
	}

	std::vector<COutPoint> vNoSpendsRemaining;
	TrimToSize(m_max_size_bytes, &vNoSpendsRemaining);
	for (const COutPoint &removed : vNoSpendsRemaining) {
	coins_cache.Uncache(removed);
	}
	}

	void CTxMemPool::UpdateChild(txiter entry, txiter child, bool add) {
	AssertLockHeld(cs);
	CTxMemPoolEntry::Children s;
	if (add && (entry)->GetMemPoolChildren().insert(child).second) {
	cachedInnerUsage += memusage::IncrementalDynamicUsage(s);
	} else if (!add && (entry)->GetMemPoolChildren().erase(child)) {
	cachedInnerUsage -= memusage::IncrementalDynamicUsage(s);
	}
	}

	void CTxMemPool::UpdateParent(txiter entry, txiter parent, bool add) {
	AssertLockHeld(cs);
	CTxMemPoolEntry::Parents s;
	if (add && (entry)->GetMemPoolParents().insert(parent).second) {
	cachedInnerUsage += memusage::IncrementalDynamicUsage(s);
	} else if (!add && (entry)->GetMemPoolParents().erase(parent)) {
	cachedInnerUsage -= memusage::IncrementalDynamicUsage(s);
	}
	}

	CFeeRate CTxMemPool::GetMinFee(size_t sizelimit) const {
	LOCK(cs);
	if (!blockSinceLastRollingFeeBump \|\| rollingMinimumFeeRate == 0) {
	return CFeeRate(int64_t(ceill(rollingMinimumFeeRate)) * SATOSHI);
	}

	int64_t time = GetTime();
	if (time > lastRollingFeeUpdate + 10) {
	double halflife = ROLLING_FEE_HALFLIFE;
	if (DynamicMemoryUsage() < sizelimit / 4) {
	halflife /= 4;
	} else if (DynamicMemoryUsage() < sizelimit / 2) {
	halflife /= 2;
	}

	rollingMinimumFeeRate =
	rollingMinimumFeeRate /
	pow(2.0, (time - lastRollingFeeUpdate) / halflife);
	lastRollingFeeUpdate = time;
	}
	return CFeeRate(int64_t(ceill(rollingMinimumFeeRate)) * SATOSHI);
	}

	void CTxMemPool::trackPackageRemoved(const CFeeRate &rate) {
	AssertLockHeld(cs);
	if ((rate.GetFeePerK() / SATOSHI) > rollingMinimumFeeRate) {
	rollingMinimumFeeRate = rate.GetFeePerK() / SATOSHI;
	blockSinceLastRollingFeeBump = false;
	}
	}

	void CTxMemPool::TrimToSize(size_t sizelimit,
	std::vector<COutPoint> *pvNoSpendsRemaining) {
	AssertLockHeld(cs);

	unsigned nTxnRemoved = 0;
	CFeeRate maxFeeRateRemoved(Amount::zero());
	while (!mapTx.empty() && DynamicMemoryUsage() > sizelimit) {
	auto it = mapTx.get<modified_feerate>().end();
	--it;

	// We set the new mempool min fee to the feerate of the removed
	// transaction, plus the "minimum reasonable fee rate" (ie some value
	// under which we consider txn to have 0 fee). This way, we don't allow
	// txn to enter mempool with feerate equal to txn which were removed
	// with no block in between.
	CFeeRate removed = (*it)->GetModifiedFeeRate();
	removed += MEMPOOL_FULL_FEE_INCREMENT;

	trackPackageRemoved(removed);
	maxFeeRateRemoved = std::max(maxFeeRateRemoved, removed);

	setEntries stage;
	CalculateDescendants(mapTx.project<0>(it), stage);
	nTxnRemoved += stage.size();

	if (pvNoSpendsRemaining) {
	for (const txiter &iter : stage) {
	for (const CTxIn &txin : (*iter)->GetTx().vin) {
	if (!exists(txin.prevout.GetTxId())) {
	pvNoSpendsRemaining->push_back(txin.prevout);
	}
	}
	}
	}

	RemoveStaged(stage, MemPoolRemovalReason::SIZELIMIT);
	}

	if (maxFeeRateRemoved > CFeeRate(Amount::zero())) {
	LogPrint(BCLog::MEMPOOL,
	"Removed %u txn, rolling minimum fee bumped to %s\n",
	nTxnRemoved, maxFeeRateRemoved.ToString());
	}
	}

	-bool CTxMemPool::IsLoaded() const {
	+bool CTxMemPool::GetLoadTried() const {
	LOCK(cs);
	- return m_is_loaded;
	+ return m_load_tried;
	}

	-void CTxMemPool::SetIsLoaded(bool loaded) {
	+void CTxMemPool::SetLoadTried(bool load_tried) {
	LOCK(cs);
	- m_is_loaded = loaded;
	+ m_load_tried = load_tried;
	}

	/** Maximum bytes for transactions to store for processing during reorg */
	static const size_t MAX_DISCONNECTED_TX_POOL_SIZE = 20 * DEFAULT_MAX_BLOCK_SIZE;

	void DisconnectedBlockTransactions::addForBlock(
	const std::vector<CTransactionRef> &vtx, CTxMemPool &pool) {
	AssertLockHeld(pool.cs);
	for (const auto &tx : reverse_iterate(vtx)) {
	// If we already added it, just skip.
	auto it = queuedTx.find(tx->GetId());
	if (it != queuedTx.end()) {
	continue;
	}

	// Insert the transaction into the pool.
	addTransaction(tx);

	// Fill in the set of parents.
	std::unordered_set<TxId, SaltedTxIdHasher> parents;
	for (const CTxIn &in : tx->vin) {
	parents.insert(in.prevout.GetTxId());
	}

	// In order to make sure we keep things in topological order, we check
	// if we already know of the parent of the current transaction. If so,
	// we remove them from the set and then add them back.
	while (parents.size() > 0) {
	std::unordered_set<TxId, SaltedTxIdHasher> worklist(
	std::move(parents));
	parents.clear();

	for (const TxId &txid : worklist) {
	// If we do not have that txid in the set, nothing needs to be
	// done.
	auto pit = queuedTx.find(txid);
	if (pit == queuedTx.end()) {
	continue;
	}

	// We have parent in our set, we reinsert them at the right
	// position.
	const CTransactionRef ptx = *pit;
	queuedTx.erase(pit);
	queuedTx.insert(ptx);

	// And we make sure ancestors are covered.
	for (const CTxIn &in : ptx->vin) {
	parents.insert(in.prevout.GetTxId());
	}
	}
	}
	}

	// Keep the size under control.
	while (DynamicMemoryUsage() > MAX_DISCONNECTED_TX_POOL_SIZE) {
	// Drop the earliest entry, and remove its children from the
	// mempool.
	auto it = queuedTx.get<insertion_order>().begin();
	pool.removeRecursive(**it, MemPoolRemovalReason::REORG);
	removeEntry(it);
	}
	}

	void DisconnectedBlockTransactions::importMempool(CTxMemPool &pool) {
	AssertLockHeld(pool.cs);
	// addForBlock's algorithm sorts a vector of transactions back into
	// topological order. We use it in a separate object to create a valid
	// ordering of all mempool transactions, which we then splice in front of
	// the current queuedTx. This results in a valid sequence of transactions to
	// be reprocessed in updateMempoolForReorg.

	// We create vtx in order of the entry_id index to facilitate for
	// addForBlocks (which iterates in reverse order), as vtx probably end in
	// the correct ordering for queuedTx.
	std::vector<CTransactionRef> vtx;

	vtx.reserve(pool.mapTx.size());
	txInfo.reserve(pool.mapTx.size());
	for (const CTxMemPoolEntryRef &e : pool.mapTx.get<entry_id>()) {
	vtx.push_back(e->GetSharedTx());
	// save entry time, feeDelta, and height for use in
	// updateMempoolForReorg()
	txInfo.try_emplace(e->GetTx().GetId(), e->GetTime(),
	e->GetModifiedFee() - e->GetFee(), e->GetHeight());
	}
	for (const CTxMemPoolEntryRef &e :
	reverse_iterate(pool.mapTx.get<entry_id>())) {
	// Notify all observers of this (possibly temporary) removal. This is
	// necessary for tracking the transactions that are removed from the
	// mempool during a reorg and can't be added back due to missing parent.
	// Transactions that are added back to the mempool will trigger another
	// notification. Make sure to notify in reverse topological order,
	// children first.
	GetMainSignals().TransactionRemovedFromMempool(
	e->GetSharedTx(), MemPoolRemovalReason::REORG,
	pool.GetAndIncrementSequence());
	}
	pool.clear();

	// Use addForBlocks to sort the transactions and then splice them in front
	// of queuedTx
	DisconnectedBlockTransactions orderedTxnPool;
	orderedTxnPool.addForBlock(vtx, pool);
	cachedInnerUsage += orderedTxnPool.cachedInnerUsage;
	queuedTx.get<insertion_order>().splice(
	queuedTx.get<insertion_order>().begin(),
	orderedTxnPool.queuedTx.get<insertion_order>());

	// We limit memory usage because we can't know if more blocks will be
	// disconnected
	while (DynamicMemoryUsage() > MAX_DISCONNECTED_TX_POOL_SIZE) {
	// Drop the earliest entry which, by definition, has no children
	removeEntry(queuedTx.get<insertion_order>().begin());
	}
	}

	auto DisconnectedBlockTransactions::getTxInfo(const CTransactionRef &tx) const
	-> const TxInfo * {
	if (auto it = txInfo.find(tx->GetId()); it != txInfo.end()) {
	return &it->second;
	}

	return nullptr;
	}

	void DisconnectedBlockTransactions::updateMempoolForReorg(
	const Config &config, Chainstate &active_chainstate, bool fAddToMempool,
	CTxMemPool &pool) {
	AssertLockHeld(cs_main);
	AssertLockHeld(pool.cs);

	if (fAddToMempool) {
	// disconnectpool's insertion_order index sorts the entries from oldest
	// to newest, but the oldest entry will be the last tx from the latest
	// mined block that was disconnected.
	// Iterate disconnectpool in reverse, so that we add transactions back
	// to the mempool starting with the earliest transaction that had been
	// previously seen in a block.
	for (const CTransactionRef &tx :
	reverse_iterate(queuedTx.get<insertion_order>())) {
	if (tx->IsCoinBase()) {
	continue;
	}
	// restore saved PrioritiseTransaction state and nAcceptTime
	const auto ptxInfo = getTxInfo(tx);
	bool hasFeeDelta = false;
	if (ptxInfo && ptxInfo->feeDelta != Amount::zero()) {
	// manipulate mapDeltas directly (faster than calling
	// PrioritiseTransaction)
	pool.mapDeltas[tx->GetId()] = ptxInfo->feeDelta;
	hasFeeDelta = true;
	}
	// ignore validation errors in resurrected transactions
	auto result = AcceptToMemoryPool(
	config, active_chainstate, tx,
	/accept_time=/ptxInfo ? ptxInfo->time.count() : GetTime(),
	/bypass_limits=/true, /test_accept=/false,
	/heightOverride=/ptxInfo ? ptxInfo->height : 0);
	if (result.m_result_type !=
	MempoolAcceptResult::ResultType::VALID &&
	hasFeeDelta) {
	// tx not accepted: undo mapDelta insertion from above
	pool.mapDeltas.erase(tx->GetId());
	}
	}
	}

	queuedTx.clear();
	txInfo.clear();

	// Re-limit mempool size, in case we added any transactions
	pool.LimitSize(active_chainstate.CoinsTip());
	}
	diff --git a/src/txmempool.h b/src/txmempool.h
	index 98d9fd9f1..037ee618f 100644
	--- a/src/txmempool.h
	+++ b/src/txmempool.h
	@@ -1,895 +1,901 @@
	// Copyright (c) 2009-2010 Satoshi Nakamoto
	// Copyright (c) 2009-2016 The Bitcoin Core developers
	// Distributed under the MIT software license, see the accompanying
	// file COPYING or http://www.opensource.org/licenses/mit-license.php.

	#ifndef BITCOIN_TXMEMPOOL_H
	#define BITCOIN_TXMEMPOOL_H

	#include <coins.h>
	#include <consensus/amount.h>
	#include <core_memusage.h>
	#include <indirectmap.h>
	#include <kernel/mempool_options.h>
	#include <policy/packages.h>
	#include <primitives/transaction.h>
	#include <radix.h>
	#include <rcu.h>
	#include <sync.h>
	#include <uint256radixkey.h>
	#include <util/hasher.h>

	#include <boost/multi_index/hashed_index.hpp>
	#include <boost/multi_index/ordered_index.hpp>
	#include <boost/multi_index/sequenced_index.hpp>
	#include <boost/multi_index_container.hpp>

	#include <atomic>
	#include <map>
	#include <optional>
	#include <set>
	#include <string>
	#include <unordered_map>
	#include <utility>
	#include <vector>

	class CBlockIndex;
	class CChain;
	class Chainstate;
	class Config;

	extern RecursiveMutex cs_main;

	/**
	* Fake height value used in Coins to signify they are only in the memory
	* pool(since 0.8)
	*/
	static const uint32_t MEMPOOL_HEIGHT = 0x7FFFFFFF;

	struct LockPoints {
	// Will be set to the blockchain height and median time past values that
	// would be necessary to satisfy all relative locktime constraints (BIP68)
	// of this tx given our view of block chain history
	int height{0};
	int64_t time{0};
	// As long as the current chain descends from the highest height block
	// containing one of the inputs used in the calculation, then the cached
	// values are still valid even after a reorg.
	CBlockIndex *maxInputBlock{nullptr};
	};

	/**
	* Test whether the LockPoints height and time are still valid on the current
	* chain.
	*/
	bool TestLockPointValidity(const CChain &active_chain, const LockPoints &lp)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main);

	struct CompareIteratorById {
	// SFINAE for T where T is either a std::reference_wrapper<T> (e.g. a
	// CTxMemPoolEntryRef) or an iterator to a pointer type (e.g., a txiter)
	template <typename T>
	bool operator()(const std::reference_wrapper<T> &a,
	const std::reference_wrapper<T> &b) const {
	return a.get()->GetTx().GetId() < b.get()->GetTx().GetId();
	}
	template <typename T> bool operator()(const T &a, const T &b) const {
	return (a)->GetTx().GetId() < (b)->GetTx().GetId();
	}
	};
	/** Iterate txs in reverse-topological order */
	struct CompareIteratorByRevEntryId {
	template <typename T>
	bool operator()(const std::reference_wrapper<T> &a,
	const std::reference_wrapper<T> &b) const {
	return a.get()->GetEntryId() > b.get()->GetEntryId();
	}

	template <typename T> bool operator()(const T &a, const T &b) const {
	return (a)->GetEntryId() > (b)->GetEntryId();
	}
	};

	class CTxMemPoolEntry;
	using CTxMemPoolEntryRef = RCUPtr<CTxMemPoolEntry>;

	/** \class CTxMemPoolEntry
	*
	* CTxMemPoolEntry stores data about the corresponding transaction, as well as
	* data about all in-mempool transactions that depend on the transaction
	* ("descendant" transactions).
	*/

	class CTxMemPoolEntry {
	public:
	// two aliases, should the types ever diverge
	typedef std::set<std::reference_wrapper<const CTxMemPoolEntryRef>,
	CompareIteratorById>
	Parents;
	typedef std::set<std::reference_wrapper<const CTxMemPoolEntryRef>,
	CompareIteratorById>
	Children;

	private:
	//! Unique identifier -- used for topological sorting
	uint64_t entryId = 0;

	const CTransactionRef tx;
	mutable Parents m_parents;
	mutable Children m_children;
	//! Cached to avoid expensive parent-transaction lookups
	const Amount nFee;
	//! ... and avoid recomputing tx size
	const size_t nTxSize;
	//! ... and total memory usage
	const size_t nUsageSize;
	//! Local time when entering the mempool
	const int64_t nTime;
	//! Chain height when entering the mempool
	const unsigned int entryHeight;
	//! keep track of transactions that spend a coinbase
	const bool spendsCoinbase;
	//! Total sigChecks
	const int64_t sigChecks;
	//! Used for determining the priority of the transaction for mining in a
	//! block
	Amount feeDelta{Amount::zero()};
	//! Track the height and time at which tx was final
	LockPoints lockPoints;

	IMPLEMENT_RCU_REFCOUNT(uint64_t);

	public:
	CTxMemPoolEntry(const CTransactionRef &_tx, const Amount fee, int64_t time,
	unsigned int entry_height, bool spends_coinbase,
	int64_t sigchecks, LockPoints lp);

	CTxMemPoolEntry(const CTxMemPoolEntry &other) = delete;
	CTxMemPoolEntry(CTxMemPoolEntry &&other)
	: entryId(other.entryId), tx(std::move(other.tx)),
	m_parents(std::move(other.m_parents)),
	m_children(std::move(other.m_children)), nFee(other.nFee),
	nTxSize(other.nTxSize), nUsageSize(other.nUsageSize),
	nTime(other.nTime), entryHeight(other.entryHeight),
	spendsCoinbase(other.spendsCoinbase), sigChecks(other.sigChecks),
	feeDelta(other.feeDelta), lockPoints(std::move(other.lockPoints)),
	refcount(other.refcount.load()){};

	uint64_t GetEntryId() const { return entryId; }
	//! This should only be set by addUnchecked() before entry insertion into
	//! mempool
	void SetEntryId(uint64_t eid) { entryId = eid; }

	const CTransaction &GetTx() const { return *this->tx; }
	CTransactionRef GetSharedTx() const { return this->tx; }
	Amount GetFee() const { return nFee; }
	size_t GetTxSize() const { return nTxSize; }
	size_t GetTxVirtualSize() const;

	std::chrono::seconds GetTime() const { return std::chrono::seconds{nTime}; }
	unsigned int GetHeight() const { return entryHeight; }
	int64_t GetSigChecks() const { return sigChecks; }
	Amount GetModifiedFee() const { return nFee + feeDelta; }
	CFeeRate GetModifiedFeeRate() const {
	return CFeeRate(GetModifiedFee(), GetTxVirtualSize());
	}
	size_t DynamicMemoryUsage() const { return nUsageSize; }
	const LockPoints &GetLockPoints() const { return lockPoints; }

	// Updates the fee delta used for mining priority score
	void UpdateFeeDelta(Amount feeDelta);
	// Update the LockPoints after a reorg
	void UpdateLockPoints(const LockPoints &lp);

	bool GetSpendsCoinbase() const { return spendsCoinbase; }

	const Parents &GetMemPoolParentsConst() const { return m_parents; }
	const Children &GetMemPoolChildrenConst() const { return m_children; }
	Parents &GetMemPoolParents() const { return m_parents; }
	Children &GetMemPoolChildren() const { return m_children; }
	};

	// extracts a transaction id from CTxMemPoolEntry or CTransactionRef
	struct mempoolentry_txid {
	typedef TxId result_type;

	result_type operator()(const CTxMemPoolEntryRef &entry) const {
	return entry->GetTx().GetId();
	}

	result_type operator()(const CTransactionRef &tx) const {
	return tx->GetId();
	}
	};

	/**
	* Radix tree adapter for storing a CTxMemPoolEntry as a tree element.
	*/
	struct MemPoolEntryRadixTreeAdapter {
	Uint256RadixKey getId(const CTxMemPoolEntry &entry) const {
	return entry.GetSharedTx()->GetId();
	}
	};

	// used by the entry_time index
	struct CompareTxMemPoolEntryByEntryTime {
	bool operator()(const CTxMemPoolEntryRef &a,
	const CTxMemPoolEntryRef &b) const {
	return a->GetTime() < b->GetTime();
	}
	};

	// used by the entry_id index
	struct CompareTxMemPoolEntryByEntryId {
	bool operator()(const CTxMemPoolEntryRef &a,
	const CTxMemPoolEntryRef &b) const {
	return a->GetEntryId() < b->GetEntryId();
	}
	};

	/**
	* \class CompareTxMemPoolEntryByModifiedFeeRate
	*
	* Sort by feerate of entry (modfee/vsize) in descending order.
	* This is used by the block assembler (mining).
	*/
	struct CompareTxMemPoolEntryByModifiedFeeRate {
	// Used in tests
	bool operator()(const CTxMemPoolEntry &a, const CTxMemPoolEntry &b) const {
	const CFeeRate frA = a.GetModifiedFeeRate();
	const CFeeRate frB = b.GetModifiedFeeRate();

	// Sort by modified fee rate first
	if (frA != frB) {
	return frA > frB;
	}

	// Ties are broken by whichever is topologically earlier
	// (this helps mining code avoid some backtracking).
	if (a.GetEntryId() != b.GetEntryId()) {
	return a.GetEntryId() < b.GetEntryId();
	}

	// If nothing else, sort by txid (this should never happen as entryID is
	// expected to be unique).
	return a.GetSharedTx()->GetId() < b.GetSharedTx()->GetId();
	}

	bool operator()(const CTxMemPoolEntryRef &a,
	const CTxMemPoolEntryRef &b) const {
	return operator()(a, b);
	}
	};

	// Multi_index tag names
	struct entry_time {};
	struct modified_feerate {};
	struct entry_id {};

	/**
	* Information about a mempool transaction.
	*/
	struct TxMempoolInfo {
	/** The transaction itself */
	CTransactionRef tx;

	/** Time the transaction entered the mempool. */
	std::chrono::seconds m_time;

	/** Fee of the transaction. */
	Amount fee;

	/** Virtual size of the transaction. */
	size_t vsize;

	/** The fee delta. */
	Amount nFeeDelta;
	};

	/**
	* Reason why a transaction was removed from the mempool, this is passed to the
	* notification signal.
	*/
	enum class MemPoolRemovalReason {
	//! Expired from mempool
	EXPIRY,
	//! Removed in size limiting
	SIZELIMIT,
	//! Removed for reorganization
	REORG,
	//! Removed for block
	BLOCK,
	//! Removed for conflict with in-block transaction
	CONFLICT,
	//! Removed for replacement
	REPLACED,
	//! Removed by avalanche vote
	AVALANCHE,
	};

	/**
	* CTxMemPool stores valid-according-to-the-current-best-chain transactions that
	* may be included in the next block.
	*
	* Transactions are added when they are seen on the network (or created by the
	* local node), but not all transactions seen are added to the pool. For
	* example, the following new transactions will not be added to the mempool:
	* - a transaction which doesn't meet the minimum fee requirements.
	* - a new transaction that double-spends an input of a transaction already in
	* the pool.
	* - a non-standard transaction.
	*
	* CTxMemPool::mapTx, and CTxMemPoolEntry bookkeeping:
	*
	* mapTx is a boost::multi_index that sorts the mempool on 3 criteria:
	* - transaction hash
	* - time in mempool
	* - entry id (this is a topological index)
	*
	* Note: the term "descendant" refers to in-mempool transactions that depend on
	* this one, while "ancestor" refers to in-mempool transactions that a given
	* transaction depends on.
	*
	* When a new transaction is added to the mempool, it has no in-mempool children
	* (because any such children would be an orphan). So in addUnchecked(), we:
	* - update a new entry's setMemPoolParents to include all in-mempool parents
	* - update the new entry's direct parents to include the new tx as a child
	*
	* When a transaction is removed from the mempool, we must:
	* - update all in-mempool parents to not track the tx in setMemPoolChildren
	* - update all in-mempool children to not include it as a parent
	*
	* These happen in UpdateForRemoveFromMempool(). (Note that when removing a
	* transaction along with its descendants, we must calculate that set of
	* transactions to be removed before doing the removal, or else the mempool can
	* be in an inconsistent state where it's impossible to walk the ancestors of a
	* transaction.)
	*
	* In the event of a reorg, the invariant that all newly-added tx's have no
	* in-mempool children must be maintained. On top of this, we use a topological
	* index (GetEntryId). As such, we always dump mempool tx's into a disconnect
	* pool on reorg, and simply add them one by one, along with tx's from
	* disconnected blocks, when the reorg is complete.
	*/
	class CTxMemPool {
	private:
	//! Value n means that 1 times in n we check.
	const int m_check_ratio;
	//! Used by getblocktemplate to trigger CreateNewBlock() invocation
	std::atomic<uint32_t> nTransactionsUpdated{0};

	//! sum of all mempool tx's sizes.
	uint64_t totalTxSize GUARDED_BY(cs);
	//! sum of all mempool tx's fees (NOT modified fee)
	Amount m_total_fee GUARDED_BY(cs);
	//! sum of dynamic memory usage of all the map elements (NOT the maps
	//! themselves)
	uint64_t cachedInnerUsage GUARDED_BY(cs);

	mutable int64_t lastRollingFeeUpdate GUARDED_BY(cs);
	mutable bool blockSinceLastRollingFeeBump GUARDED_BY(cs);
	//! minimum fee to get into the pool, decreases exponentially
	mutable double rollingMinimumFeeRate GUARDED_BY(cs);

	// In-memory counter for external mempool tracking purposes.
	// This number is incremented once every time a transaction
	// is added or removed from the mempool for any reason.
	mutable uint64_t m_sequence_number GUARDED_BY(cs){1};

	void trackPackageRemoved(const CFeeRate &rate) EXCLUSIVE_LOCKS_REQUIRED(cs);

	- bool m_is_loaded GUARDED_BY(cs){false};
	+ bool m_load_tried GUARDED_BY(cs){false};

	//! Used by addUnchecked to generate ever-increasing
	//! CTxMemPoolEntry::entryId's
	uint64_t nextEntryId GUARDED_BY(cs) = 1;

	public:
	// public only for testing
	static const int ROLLING_FEE_HALFLIFE = 60 * 60 * 12;

	typedef boost::multi_index_container<
	CTxMemPoolEntryRef,
	boost::multi_index::indexed_by<
	// indexed by txid
	boost::multi_index::hashed_unique<mempoolentry_txid,
	SaltedTxIdHasher>,
	// sorted by fee rate
	boost::multi_index::ordered_non_unique<
	boost::multi_index::tag<modified_feerate>,
	boost::multi_index::identity<CTxMemPoolEntryRef>,
	CompareTxMemPoolEntryByModifiedFeeRate>,
	// sorted by entry time
	boost::multi_index::ordered_non_unique<
	boost::multi_index::tag<entry_time>,
	boost::multi_index::identity<CTxMemPoolEntryRef>,
	CompareTxMemPoolEntryByEntryTime>,
	// sorted topologically (insertion order)
	boost::multi_index::ordered_unique<
	boost::multi_index::tag<entry_id>,
	boost::multi_index::identity<CTxMemPoolEntryRef>,
	CompareTxMemPoolEntryByEntryId>>>
	indexed_transaction_set;

	/**
	* This mutex needs to be locked when accessing `mapTx` or other members
	* that are guarded by it.
	*
	* @par Consistency guarantees
	*
	* By design, it is guaranteed that:
	*
	* 1. Locking both `cs_main` and `mempool.cs` will give a view of mempool
	* that is consistent with current chain tip (`ActiveChain()` and
	* `CoinsTip()`) and is fully populated. Fully populated means that if
	* the current active chain is missing transactions that were present in
	* a previously active chain, all the missing transactions will have been
	* re-added to the mempool and should be present if they meet size and
	* consistency constraints.
	*
	* 2. Locking `mempool.cs` without `cs_main` will give a view of a mempool
	* consistent with some chain that was active since `cs_main` was last
	* locked, and that is fully populated as described above. It is ok for
	* code that only needs to query or remove transactions from the mempool
	* to lock just `mempool.cs` without `cs_main`.
	*
	* To provide these guarantees, it is necessary to lock both `cs_main` and
	* `mempool.cs` whenever adding transactions to the mempool and whenever
	* changing the chain tip. It's necessary to keep both mutexes locked until
	* the mempool is consistent with the new chain tip and fully populated.
	*/
	mutable RecursiveMutex cs;
	indexed_transaction_set mapTx GUARDED_BY(cs);

	using txiter = indexed_transaction_set::nth_index<0>::type::const_iterator;
	typedef std::set<txiter, CompareIteratorById> setEntries;
	typedef std::set<txiter, CompareIteratorByRevEntryId> setRevTopoEntries;

	RadixTree<CTxMemPoolEntry, MemPoolEntryRadixTreeAdapter> finalizedTxs;

	private:
	void UpdateParent(txiter entry, txiter parent, bool add)
	EXCLUSIVE_LOCKS_REQUIRED(cs);
	void UpdateChild(txiter entry, txiter child, bool add)
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* Track locally submitted transactions to periodically retry initial
	* broadcast
	*/
	std::set<TxId> m_unbroadcast_txids GUARDED_BY(cs);

	/**
	* Helper function to calculate all in-mempool ancestors of staged_ancestors
	* param@[in] staged_ancestors Should contain entries in the mempool.
	* param@[out] setAncestors Will be populated with all mempool
	* ancestors.
	*/
	bool CalculateAncestors(setEntries &setAncestors,
	CTxMemPoolEntry::Parents &staged_ancestors) const
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	public:
	indirectmap<COutPoint, const CTransaction *> mapNextTx GUARDED_BY(cs);
	std::map<TxId, Amount> mapDeltas GUARDED_BY(cs);

	using Options = kernel::MemPoolOptions;

	const int64_t m_max_size_bytes;
	const std::chrono::seconds m_expiry;

	/**
	* Create a new CTxMemPool.
	* Sanity checks will be off by default for performance, because otherwise
	* accepting transactions becomes O(N^2) where N is the number of
	* transactions in the pool.
	*/
	CTxMemPool(const Options &opts);
	~CTxMemPool();

	/**
	* If sanity-checking is turned on, check makes sure the pool is consistent
	* (does not contain two transactions that spend the same inputs, all inputs
	* are in the mapNextTx array). If sanity-checking is turned off, check does
	* nothing.
	*/
	void check(const CCoinsViewCache &active_coins_tip,
	int64_t spendheight) const EXCLUSIVE_LOCKS_REQUIRED(::cs_main);

	// addUnchecked must update state for all parents of a given transaction,
	// updating child links as necessary.
	void addUnchecked(CTxMemPoolEntryRef entry)
	EXCLUSIVE_LOCKS_REQUIRED(cs, cs_main);

	void removeRecursive(const CTransaction &tx, MemPoolRemovalReason reason)
	EXCLUSIVE_LOCKS_REQUIRED(cs);
	void removeConflicts(const CTransaction &tx) EXCLUSIVE_LOCKS_REQUIRED(cs);
	void removeForBlock(const std::vector<CTransactionRef> &vtx)
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	void clear();
	// lock free
	void _clear() EXCLUSIVE_LOCKS_REQUIRED(cs);
	bool CompareTopologically(const TxId &txida, const TxId &txidb) const;
	void getAllTxIds(std::vector<TxId> &vtxid) const;
	bool isSpent(const COutPoint &outpoint) const;
	unsigned int GetTransactionsUpdated() const;
	void AddTransactionsUpdated(unsigned int n);
	/**
	* Check that none of this transactions inputs are in the mempool, and thus
	* the tx is not dependent on other mempool transactions to be included in a
	* block.
	*/
	bool HasNoInputsOf(const CTransaction &tx) const
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/** Affect CreateNewBlock prioritisation of transactions */
	void PrioritiseTransaction(const TxId &txid, const Amount nFeeDelta);
	void ApplyDelta(const TxId &txid, Amount &nFeeDelta) const
	EXCLUSIVE_LOCKS_REQUIRED(cs);
	void ClearPrioritisation(const TxId &txid) EXCLUSIVE_LOCKS_REQUIRED(cs);

	/** Get the transaction in the pool that spends the same prevout */
	const CTransaction *GetConflictTx(const COutPoint &prevout) const
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/** Returns an iterator to the given txid, if found */
	std::optional<txiter> GetIter(const TxId &txid) const
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* Translate a set of txids into a set of pool iterators to avoid repeated
	* lookups.
	*/
	setEntries GetIterSet(const std::set<TxId> &txids) const
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* Remove a set of transactions from the mempool. If a transaction is in
	* this set, then all in-mempool descendants must also be in the set, unless
	* this transaction is being removed for being in a block.
	*/
	void RemoveStaged(const setEntries &stage, MemPoolRemovalReason reason)
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* Try to calculate all in-mempool ancestors of entry.
	* (these are all calculated including the tx itself)
	* fSearchForParents = whether to search a tx's vin for in-mempool parents,
	* or look up parents from m_parents. Must be true for entries not in the
	* mempool
	*/
	bool CalculateMemPoolAncestors(const CTxMemPoolEntryRef &entry,
	setEntries &setAncestors,
	bool fSearchForParents = true) const
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* Populate setDescendants with all in-mempool descendants of hash.
	* Assumes that setDescendants includes all in-mempool descendants of
	* anything already in it.
	*/
	void CalculateDescendants(txiter it, setEntries &setDescendants) const
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* The minimum fee to get into the mempool, which may itself not be enough
	* for larger-sized transactions. The incrementalRelayFee policy variable is
	* used to bound the time it takes the fee rate to go back down all the way
	* to 0. When the feerate would otherwise be half of this, it is set to 0
	* instead.
	*/
	CFeeRate GetMinFee() const { return GetMinFee(m_max_size_bytes); }
	CFeeRate GetMinFee(size_t sizelimit) const;

	/**
	* Remove transactions from the mempool until its dynamic size is <=
	* sizelimit. pvNoSpendsRemaining, if set, will be populated with the list
	* of outpoints which are not in mempool which no longer have any spends in
	* this mempool.
	*/
	void TrimToSize(size_t sizelimit,
	std::vector<COutPoint> *pvNoSpendsRemaining = nullptr)
	EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* Expire all transaction (and their dependencies) in the mempool older than
	* time. Return the number of removed transactions.
	*/
	int Expire(std::chrono::seconds time) EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* Reduce the size of the mempool by expiring and then trimming the mempool.
	*/
	void LimitSize(CCoinsViewCache &coins_cache)
	EXCLUSIVE_LOCKS_REQUIRED(cs, ::cs_main);

	- /** @returns true if the mempool is fully loaded */
	- bool IsLoaded() const;
	+ /**
	+ * @returns true if we've made an attempt to load the mempool regardless of
	+ * whether the attempt was successful or not
	+ */
	+ bool GetLoadTried() const;

	- /** Sets the current loaded state */
	- void SetIsLoaded(bool loaded);
	+ /**
	+ * Set whether or not we've made an attempt to load the mempool (regardless
	+ * of whether the attempt was successful or not)
	+ */
	+ void SetLoadTried(bool load_tried);

	unsigned long size() const {
	LOCK(cs);
	return mapTx.size();
	}

	uint64_t GetTotalTxSize() const EXCLUSIVE_LOCKS_REQUIRED(cs) {
	AssertLockHeld(cs);
	return totalTxSize;
	}

	Amount GetTotalFee() const EXCLUSIVE_LOCKS_REQUIRED(cs) {
	AssertLockHeld(cs);
	return m_total_fee;
	}

	bool exists(const TxId &txid) const {
	LOCK(cs);
	return mapTx.count(txid) != 0;
	}

	bool setAvalancheFinalized(const CTxMemPoolEntryRef &tx)
	EXCLUSIVE_LOCKS_REQUIRED(cs) {
	return finalizedTxs.insert(tx);
	}

	bool isAvalancheFinalized(const TxId &txid) const {
	LOCK(cs);
	return finalizedTxs.get(txid) != nullptr;
	}

	CTransactionRef get(const TxId &txid) const;
	TxMempoolInfo info(const TxId &txid) const;
	std::vector<TxMempoolInfo> infoAll() const;

	CFeeRate estimateFee() const;

	size_t DynamicMemoryUsage() const;

	/** Adds a transaction to the unbroadcast set */
	void AddUnbroadcastTx(const TxId &txid) {
	LOCK(cs);
	// Sanity check the transaction is in the mempool & insert into
	// unbroadcast set.
	if (exists(txid)) {
	m_unbroadcast_txids.insert(txid);
	}
	}

	/** Removes a transaction from the unbroadcast set */
	void RemoveUnbroadcastTx(const TxId &txid, const bool unchecked = false);

	/** Returns transactions in unbroadcast set */
	std::set<TxId> GetUnbroadcastTxs() const {
	LOCK(cs);
	return m_unbroadcast_txids;
	}

	/** Returns whether a txid is in the unbroadcast set */
	bool IsUnbroadcastTx(const TxId &txid) const EXCLUSIVE_LOCKS_REQUIRED(cs) {
	AssertLockHeld(cs);
	return (m_unbroadcast_txids.count(txid) != 0);
	}

	/** Guards this internal counter for external reporting */
	uint64_t GetAndIncrementSequence() const EXCLUSIVE_LOCKS_REQUIRED(cs) {
	return m_sequence_number++;
	}

	uint64_t GetSequence() const EXCLUSIVE_LOCKS_REQUIRED(cs) {
	return m_sequence_number;
	}

	private:
	/** Set ancestor state for an entry */
	void UpdateEntryForAncestors(txiter it, const setEntries *setAncestors)
	EXCLUSIVE_LOCKS_REQUIRED(cs);
	/**
	* Update parents of `it` to add/remove it as a child transaction.
	*/
	void UpdateParentsOf(bool add, txiter it) EXCLUSIVE_LOCKS_REQUIRED(cs);
	/**
	* For each transaction being removed, update ancestors and any direct
	* children.
	*/
	void UpdateForRemoveFromMempool(const setEntries &entriesToRemove)
	EXCLUSIVE_LOCKS_REQUIRED(cs);
	/** Sever link between specified transaction and direct children. */
	void UpdateChildrenForRemoval(txiter entry) EXCLUSIVE_LOCKS_REQUIRED(cs);

	/**
	* Before calling removeUnchecked for a given transaction,
	* UpdateForRemoveFromMempool must be called on the entire (dependent) set
	* of transactions being removed at the same time. We use each
	* CTxMemPoolEntry's setMemPoolParents in order to walk ancestors of a given
	* transaction that is removed, so we can't remove intermediate transactions
	* in a chain before we've updated all the state for the removal.
	*/
	void removeUnchecked(txiter entry, MemPoolRemovalReason reason)
	EXCLUSIVE_LOCKS_REQUIRED(cs);
	};

	/**
	* CCoinsView that brings transactions from a mempool into view.
	* It does not check for spendings by memory pool transactions.
	* Instead, it provides access to all Coins which are either unspent in the
	* base CCoinsView, are outputs from any mempool transaction, or are
	* tracked temporarily to allow transaction dependencies in package validation.
	* This allows transaction replacement to work as expected, as you want to
	* have all inputs "available" to check signatures, and any cycles in the
	* dependency graph are checked directly in AcceptToMemoryPool.
	* It also allows you to sign a double-spend directly in
	* signrawtransactionwithkey and signrawtransactionwithwallet,
	* as long as the conflicting transaction is not yet confirmed.
	*/
	class CCoinsViewMemPool : public CCoinsViewBacked {
	/**
	* Coins made available by transactions being validated. Tracking these
	* allows for package validation, since we can access transaction outputs
	* without submitting them to mempool.
	*/
	std::unordered_map<COutPoint, Coin, SaltedOutpointHasher> m_temp_added;

	protected:
	const CTxMemPool &mempool;

	public:
	CCoinsViewMemPool(CCoinsView *baseIn, const CTxMemPool &mempoolIn);
	bool GetCoin(const COutPoint &outpoint, Coin &coin) const override;
	/**
	* Add the coins created by this transaction. These coins are only
	* temporarily stored in m_temp_added and cannot be flushed to the back end.
	* Only used for package validation.
	*/
	void PackageAddTransaction(const CTransactionRef &tx);
	};

	/**
	* DisconnectedBlockTransactions
	*
	* During the reorg, it's desirable to re-add previously confirmed transactions
	* to the mempool, so that anything not re-confirmed in the new chain is
	* available to be mined. However, it's more efficient to wait until the reorg
	* is complete and process all still-unconfirmed transactions at that time,
	* since we expect most confirmed transactions to (typically) still be
	* confirmed in the new chain, and re-accepting to the memory pool is expensive
	* (and therefore better to not do in the middle of reorg-processing).
	* Instead, store the disconnected transactions (in order!) as we go, remove any
	* that are included in blocks in the new chain, and then process the remaining
	* still-unconfirmed transactions at the end.
	*
	* It also enables efficient reprocessing of current mempool entries, useful
	* when (de)activating forks that result in in-mempool transactions becoming
	* invalid
	*/
	// multi_index tag names
	struct txid_index {};
	struct insertion_order {};

	class DisconnectedBlockTransactions {
	private:
	typedef boost::multi_index_container<
	CTransactionRef, boost::multi_index::indexed_by<
	// hashed by txid
	boost::multi_index::hashed_unique<
	boost::multi_index::tag<txid_index>,
	mempoolentry_txid, SaltedTxIdHasher>,
	// sorted by order in the blockchain
	boost::multi_index::sequenced<
	boost::multi_index::tag<insertion_order>>>>
	indexed_disconnected_transactions;

	indexed_disconnected_transactions queuedTx;
	uint64_t cachedInnerUsage = 0;

	struct TxInfo {
	const std::chrono::seconds time;
	const Amount feeDelta;
	const unsigned height;
	TxInfo(const std::chrono::seconds &time_, Amount feeDelta_,
	unsigned height_) noexcept
	: time(time_), feeDelta(feeDelta_), height(height_) {}
	};

	using TxInfoMap = std::unordered_map<TxId, TxInfo, SaltedTxIdHasher>;
	/// populated by importMempool(); the original tx entry times and feeDeltas
	TxInfoMap txInfo;

	void addTransaction(const CTransactionRef &tx) {
	queuedTx.insert(tx);
	cachedInnerUsage += RecursiveDynamicUsage(tx);
	}

	/// @returns a pointer into the txInfo map if tx->GetId() exists in the map,
	/// or nullptr otherwise. Note that the returned pointer is only valid for
	/// as long as its underlying map node is valid.
	const TxInfo *getTxInfo(const CTransactionRef &tx) const;

	public:
	// It's almost certainly a logic bug if we don't clear out queuedTx before
	// destruction, as we add to it while disconnecting blocks, and then we
	// need to re-process remaining transactions to ensure mempool consistency.
	// For now, assert() that we've emptied out this object on destruction.
	// This assert() can always be removed if the reorg-processing code were
	// to be refactored such that this assumption is no longer true (for
	// instance if there was some other way we cleaned up the mempool after a
	// reorg, besides draining this object).
	~DisconnectedBlockTransactions() { assert(queuedTx.empty()); }

	// Estimate the overhead of queuedTx to be 6 pointers + an allocation, as
	// no exact formula for boost::multi_index_contained is implemented.
	size_t DynamicMemoryUsage() const {
	return memusage::MallocUsage(sizeof(CTransactionRef) +
	6 * sizeof(void ))
	queuedTx.size() +
	memusage::DynamicUsage(txInfo) + cachedInnerUsage;
	}

	const indexed_disconnected_transactions &GetQueuedTx() const {
	return queuedTx;
	}

	// Import mempool entries in topological order into queuedTx and clear the
	// mempool. Caller should call updateMempoolForReorg to reprocess these
	// transactions
	void importMempool(CTxMemPool &pool) EXCLUSIVE_LOCKS_REQUIRED(pool.cs);

	// Add entries for a block while reconstructing the topological ordering so
	// they can be added back to the mempool simply.
	void addForBlock(const std::vector<CTransactionRef> &vtx, CTxMemPool &pool)
	EXCLUSIVE_LOCKS_REQUIRED(pool.cs);

	// Remove entries based on txid_index, and update memory usage.
	void removeForBlock(const std::vector<CTransactionRef> &vtx) {
	// Short-circuit in the common case of a block being added to the tip
	if (queuedTx.empty()) {
	return;
	}
	for (auto const &tx : vtx) {
	auto it = queuedTx.find(tx->GetId());
	if (it != queuedTx.end()) {
	cachedInnerUsage -= RecursiveDynamicUsage(*it);
	queuedTx.erase(it);
	txInfo.erase(tx->GetId());
	}
	}
	}

	// Remove an entry by insertion_order index, and update memory usage.
	void removeEntry(indexed_disconnected_transactions::index<
	insertion_order>::type::iterator entry) {
	cachedInnerUsage -= RecursiveDynamicUsage(*entry);
	txInfo.erase((*entry)->GetId());
	queuedTx.get<insertion_order>().erase(entry);
	}

	bool isEmpty() const { return queuedTx.empty(); }

	void clear() {
	cachedInnerUsage = 0;
	queuedTx.clear();
	txInfo.clear();
	}

	/**
	* Make mempool consistent after a reorg, by re-adding or recursively
	* erasing disconnected block transactions from the mempool, and also
	* removing any other transactions from the mempool that are no longer valid
	* given the new tip/height.
	*
	* Note: we assume that disconnectpool only contains transactions that are
	* NOT confirmed in the current chain nor already in the mempool (otherwise,
	* in-mempool descendants of such transactions would be removed).
	*
	* Passing fAddToMempool=false will skip trying to add the transactions
	* back, and instead just erase from the mempool as needed.
	*/
	void updateMempoolForReorg(const Config &config,
	Chainstate &active_chainstate,
	bool fAddToMempool, CTxMemPool &pool)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main, pool.cs);
	};

	#endif // BITCOIN_TXMEMPOOL_H
	diff --git a/src/validation.cpp b/src/validation.cpp
	index f64020f05..b028f8eb0 100644
	--- a/src/validation.cpp
	+++ b/src/validation.cpp
	@@ -1,6750 +1,6750 @@
	// Copyright (c) 2009-2010 Satoshi Nakamoto
	// Copyright (c) 2009-2018 The Bitcoin Core developers
	// Copyright (c) 2017-2020 The Bitcoin developers
	// Distributed under the MIT software license, see the accompanying
	// file COPYING or http://www.opensource.org/licenses/mit-license.php.

	#include <validation.h>

	#include <arith_uint256.h>
	#include <avalanche/avalanche.h>
	#include <avalanche/processor.h>
	#include <blockvalidity.h>
	#include <chainparams.h>
	#include <checkpoints.h>
	#include <checkqueue.h>
	#include <config.h>
	#include <consensus/activation.h>
	#include <consensus/amount.h>
	#include <consensus/merkle.h>
	#include <consensus/tx_check.h>
	#include <consensus/tx_verify.h>
	#include <consensus/validation.h>
	#include <deploymentstatus.h>
	#include <hash.h>
	#include <index/blockfilterindex.h>
	#include <logging.h>
	#include <logging/timer.h>
	#include <minerfund.h>
	#include <node/blockstorage.h>
	#include <node/coinstats.h>
	#include <node/ui_interface.h>
	#include <node/utxo_snapshot.h>
	#include <policy/block/minerfund.h>
	#include <policy/block/stakingrewards.h>
	#include <policy/policy.h>
	#include <policy/settings.h>
	#include <pow/pow.h>
	#include <primitives/block.h>
	#include <primitives/transaction.h>
	#include <random.h>
	#include <reverse_iterator.h>
	#include <script/script.h>
	#include <script/scriptcache.h>
	#include <script/sigcache.h>
	#include <shutdown.h>
	#include <tinyformat.h>
	#include <txdb.h>
	#include <txmempool.h>
	#include <undo.h>
	#include <util/check.h> // For NDEBUG compile time check
	#include <util/strencodings.h>
	#include <util/string.h>
	#include <util/system.h>
	#include <util/time.h>
	#include <util/trace.h>
	#include <util/translation.h>
	#include <validationinterface.h>
	#include <warnings.h>

	#include <algorithm>
	#include <atomic>
	#include <cassert>
	#include <chrono>
	#include <deque>
	#include <numeric>
	#include <optional>
	#include <string>
	#include <thread>

	using node::BLOCKFILE_CHUNK_SIZE;
	using node::BlockManager;
	using node::BlockMap;
	using node::CCoinsStats;
	using node::CoinStatsHashType;
	using node::ComputeUTXOStats;
	using node::fReindex;
	using node::nPruneTarget;
	using node::OpenBlockFile;
	using node::ReadBlockFromDisk;
	using node::SnapshotMetadata;
	using node::UNDOFILE_CHUNK_SIZE;
	using node::UndoReadFromDisk;
	using node::UnlinkPrunedFiles;

	#define MICRO 0.000001
	#define MILLI 0.001

	/** Time to wait between writing blocks/block index to disk. */
	static constexpr std::chrono::hours DATABASE_WRITE_INTERVAL{1};
	/** Time to wait between flushing chainstate to disk. */
	static constexpr std::chrono::hours DATABASE_FLUSH_INTERVAL{24};
	const std::vector<std::string> CHECKLEVEL_DOC{
	"level 0 reads the blocks from disk",
	"level 1 verifies block validity",
	"level 2 verifies undo data",
	"level 3 checks disconnection of tip blocks",
	"level 4 tries to reconnect the blocks",
	"each level includes the checks of the previous levels",
	};

	/**
	* Global state
	*
	* Mutex to guard access to validation specific variables, such as reading
	* or changing the chainstate.
	*
	* This may also need to be locked when updating the transaction pool, e.g. on
	* AcceptToMemoryPool. See CTxMemPool::cs comment for details.
	*
	* The transaction pool has a separate lock to allow reading from it and the
	* chainstate at the same time.
	*/
	RecursiveMutex cs_main;

	GlobalMutex g_best_block_mutex;
	std::condition_variable g_best_block_cv;
	uint256 g_best_block;
	bool fRequireStandard = true;
	bool fCheckBlockIndex = false;
	bool fCheckpointsEnabled = DEFAULT_CHECKPOINTS_ENABLED;
	int64_t nMaxTipAge = DEFAULT_MAX_TIP_AGE;

	BlockHash hashAssumeValid;
	arith_uint256 nMinimumChainWork;

	BlockValidationOptions::BlockValidationOptions(const Config &config)
	: excessiveBlockSize(config.GetMaxBlockSize()), checkPoW(true),
	checkMerkleRoot(true) {}

	const CBlockIndex *
	Chainstate::FindForkInGlobalIndex(const CBlockLocator &locator) const {
	AssertLockHeld(cs_main);

	// Find the latest block common to locator and chain - we expect that
	// locator.vHave is sorted descending by height.
	for (const BlockHash &hash : locator.vHave) {
	const CBlockIndex *pindex{m_blockman.LookupBlockIndex(hash)};
	if (pindex) {
	if (m_chain.Contains(pindex)) {
	return pindex;
	}
	if (pindex->GetAncestor(m_chain.Height()) == m_chain.Tip()) {
	return m_chain.Tip();
	}
	}
	}
	return m_chain.Genesis();
	}

	static uint32_t GetNextBlockScriptFlags(const Consensus::Params &params,
	const CBlockIndex *pindex);

	bool CheckSequenceLocksAtTip(CBlockIndex *tip, const CCoinsView &coins_view,
	const CTransaction &tx, LockPoints *lp,
	bool useExistingLockPoints) {
	assert(tip != nullptr);

	CBlockIndex index;
	index.pprev = tip;
	// CheckSequenceLocksAtTip() uses active_chainstate.m_chain.Height()+1 to
	// evaluate height based locks because when SequenceLocks() is called within
	// ConnectBlock(), the height of the block being evaluated is what is
	// used. Thus if we want to know if a transaction can be part of the next
	// block, we need to use one more than active_chainstate.m_chain.Height()
	index.nHeight = tip->nHeight + 1;

	std::pair<int, int64_t> lockPair;
	if (useExistingLockPoints) {
	assert(lp);
	lockPair.first = lp->height;
	lockPair.second = lp->time;
	} else {
	std::vector<int> prevheights;
	prevheights.resize(tx.vin.size());
	for (size_t txinIndex = 0; txinIndex < tx.vin.size(); txinIndex++) {
	const CTxIn &txin = tx.vin[txinIndex];
	Coin coin;
	if (!coins_view.GetCoin(txin.prevout, coin)) {
	return error("%s: Missing input", __func__);
	}
	if (coin.GetHeight() == MEMPOOL_HEIGHT) {
	// Assume all mempool transaction confirm in the next block
	prevheights[txinIndex] = tip->nHeight + 1;
	} else {
	prevheights[txinIndex] = coin.GetHeight();
	}
	}
	lockPair = CalculateSequenceLocks(tx, STANDARD_LOCKTIME_VERIFY_FLAGS,
	prevheights, index);
	if (lp) {
	lp->height = lockPair.first;
	lp->time = lockPair.second;
	// Also store the hash of the block with the highest height of all
	// the blocks which have sequence locked prevouts. This hash needs
	// to still be on the chain for these LockPoint calculations to be
	// valid.
	// Note: It is impossible to correctly calculate a maxInputBlock if
	// any of the sequence locked inputs depend on unconfirmed txs,
	// except in the special case where the relative lock time/height is
	// 0, which is equivalent to no sequence lock. Since we assume input
	// height of tip+1 for mempool txs and test the resulting lockPair
	// from CalculateSequenceLocks against tip+1. We know
	// EvaluateSequenceLocks will fail if there was a non-zero sequence
	// lock on a mempool input, so we can use the return value of
	// CheckSequenceLocksAtTip to indicate the LockPoints validity.
	int maxInputHeight = 0;
	for (const int height : prevheights) {
	// Can ignore mempool inputs since we'll fail if they had
	// non-zero locks.
	if (height != tip->nHeight + 1) {
	maxInputHeight = std::max(maxInputHeight, height);
	}
	}
	// tip->GetAncestor(maxInputHeight) should never return a nullptr
	// because maxInputHeight is always less than the tip height.
	// It would, however, be a bad bug to continue execution, since a
	// LockPoints object with the maxInputBlock member set to nullptr
	// signifies no relative lock time.
	lp->maxInputBlock = Assert(tip->GetAncestor(maxInputHeight));
	}
	}
	return EvaluateSequenceLocks(index, lockPair);
	}

	// Command-line argument "-replayprotectionactivationtime=<timestamp>" will
	// cause the node to switch to replay protected SigHash ForkID value when the
	// median timestamp of the previous 11 blocks is greater than or equal to
	// <timestamp>. Defaults to the pre-defined timestamp when not set.
	static bool IsReplayProtectionEnabled(const Consensus::Params &params,
	int64_t nMedianTimePast) {
	return nMedianTimePast >= gArgs.GetIntArg("-replayprotectionactivationtime",
	params.leeKuanYewActivationTime);
	}

	static bool IsReplayProtectionEnabled(const Consensus::Params &params,
	const CBlockIndex *pindexPrev) {
	if (pindexPrev == nullptr) {
	return false;
	}

	return IsReplayProtectionEnabled(params, pindexPrev->GetMedianTimePast());
	}

	/**
	* Checks to avoid mempool polluting consensus critical paths since cached
	* signature and script validity results will be reused if we validate this
	* transaction again during block validation.
	*/
	static bool CheckInputsFromMempoolAndCache(
	const CTransaction &tx, TxValidationState &state,
	const CCoinsViewCache &view, const CTxMemPool &pool, const uint32_t flags,
	PrecomputedTransactionData &txdata, int &nSigChecksOut,
	CCoinsViewCache &coins_tip) EXCLUSIVE_LOCKS_REQUIRED(cs_main, pool.cs) {
	AssertLockHeld(cs_main);
	AssertLockHeld(pool.cs);

	assert(!tx.IsCoinBase());
	for (const CTxIn &txin : tx.vin) {
	const Coin &coin = view.AccessCoin(txin.prevout);

	// This coin was checked in PreChecks and MemPoolAccept
	// has been holding cs_main since then.
	Assume(!coin.IsSpent());
	if (coin.IsSpent()) {
	return false;
	}

	// If the Coin is available, there are 2 possibilities:
	// it is available in our current ChainstateActive UTXO set,
	// or it's a UTXO provided by a transaction in our mempool.
	// Ensure the scriptPubKeys in Coins from CoinsView are correct.
	const CTransactionRef &txFrom = pool.get(txin.prevout.GetTxId());
	if (txFrom) {
	assert(txFrom->GetId() == txin.prevout.GetTxId());
	assert(txFrom->vout.size() > txin.prevout.GetN());
	assert(txFrom->vout[txin.prevout.GetN()] == coin.GetTxOut());
	} else {
	const Coin &coinFromUTXOSet = coins_tip.AccessCoin(txin.prevout);
	assert(!coinFromUTXOSet.IsSpent());
	assert(coinFromUTXOSet.GetTxOut() == coin.GetTxOut());
	}
	}

	// Call CheckInputScripts() to cache signature and script validity against
	// current tip consensus rules.
	return CheckInputScripts(tx, state, view, flags, /sigCacheStore=/true,
	/scriptCacheStore=/true, txdata, nSigChecksOut);
	}

	namespace {

	class MemPoolAccept {
	public:
	MemPoolAccept(CTxMemPool &mempool, Chainstate &active_chainstate)
	: m_pool(mempool), m_view(&m_dummy),
	m_viewmempool(&active_chainstate.CoinsTip(), m_pool),
	m_active_chainstate(active_chainstate) {}

	// We put the arguments we're handed into a struct, so we can pass them
	// around easier.
	struct ATMPArgs {
	const Config &m_config;
	const int64_t m_accept_time;
	const bool m_bypass_limits;
	/*
	* Return any outpoints which were not previously present in the coins
	* cache, but were added as a result of validating the tx for mempool
	* acceptance. This allows the caller to optionally remove the cache
	* additions if the associated transaction ends up being rejected by
	* the mempool.
	*/
	std::vector<COutPoint> &m_coins_to_uncache;
	const bool m_test_accept;
	const unsigned int m_heightOverride;
	/**
	* When true, the mempool will not be trimmed when individual
	* transactions are submitted in Finalize(). Instead, limits should be
	* enforced at the end to ensure the package is not partially submitted.
	*/
	const bool m_package_submission;

	/** Parameters for single transaction mempool validation. */
	static ATMPArgs SingleAccept(const Config &config, int64_t accept_time,
	bool bypass_limits,
	std::vector<COutPoint> &coins_to_uncache,
	bool test_accept,
	unsigned int heightOverride) {
	return ATMPArgs{config,
	accept_time,
	bypass_limits,
	coins_to_uncache,
	test_accept,
	heightOverride,
	/package_submission=/false};
	}

	/**
	* Parameters for test package mempool validation through
	* testmempoolaccept.
	*/
	static ATMPArgs
	PackageTestAccept(const Config &config, int64_t accept_time,
	std::vector<COutPoint> &coins_to_uncache) {
	return ATMPArgs{config, accept_time,
	/bypass_limits=/false, coins_to_uncache,
	/test_accept=/true,
	/height_override=/0,
	// not submitting to mempool
	/package_submission=/false};
	}

	/** Parameters for child-with-unconfirmed-parents package validation. */
	static ATMPArgs
	PackageChildWithParents(const Config &config, int64_t accept_time,
	std::vector<COutPoint> &coins_to_uncache) {
	return ATMPArgs{config,
	accept_time,
	/bypass_limits=/false,
	coins_to_uncache,
	/test_accept=/false,
	/height_override=/0,
	/package_submission=/true};
	}

	private:
	// Private ctor to avoid exposing details to clients and allowing the
	// possibility of mixing up the order of the arguments. Use static
	// functions above instead.
	ATMPArgs(const Config &config, int64_t accept_time, bool bypass_limits,
	std::vector<COutPoint> &coins_to_uncache, bool test_accept,
	unsigned int height_override, bool package_submission)
	: m_config{config}, m_accept_time{accept_time},
	m_bypass_limits{bypass_limits},
	m_coins_to_uncache{coins_to_uncache}, m_test_accept{test_accept},
	m_heightOverride{height_override}, m_package_submission{
	package_submission} {}
	};

	// Single transaction acceptance
	MempoolAcceptResult AcceptSingleTransaction(const CTransactionRef &ptx,
	ATMPArgs &args)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main);

	/**
	* Multiple transaction acceptance. Transactions may or may not be
	* interdependent, but must not conflict with each other, and the
	* transactions cannot already be in the mempool. Parents must come
	* before children if any dependencies exist.
	*/
	PackageMempoolAcceptResult
	AcceptMultipleTransactions(const std::vector<CTransactionRef> &txns,
	ATMPArgs &args)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main);

	/**
	* Package (more specific than just multiple transactions) acceptance.
	* Package must be a child with all of its unconfirmed parents, and
	* topologically sorted.
	*/
	PackageMempoolAcceptResult AcceptPackage(const Package &package,
	ATMPArgs &args)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main);

	private:
	// All the intermediate state that gets passed between the various levels
	// of checking a given transaction.
	struct Workspace {
	Workspace(const CTransactionRef &ptx,
	const uint32_t next_block_script_verify_flags)
	: m_ptx(ptx),
	m_next_block_script_verify_flags(next_block_script_verify_flags) {
	}
	/**
	* Mempool entry constructed for this transaction.
	* Constructed in PreChecks() but not inserted into the mempool until
	* Finalize().
	*/
	std::unique_ptr<CTxMemPoolEntry> m_entry;

	/**
	* Virtual size of the transaction as used by the mempool, calculated
	* using serialized size of the transaction and sigchecks.
	*/
	int64_t m_vsize;
	/**
	* Fees paid by this transaction: total input amounts subtracted by
	* total output amounts.
	*/
	Amount m_base_fees;

	/**
	* Base fees + any fee delta set by the user with
	* prioritisetransaction.
	*/
	Amount m_modified_fees;

	const CTransactionRef &m_ptx;
	TxValidationState m_state;
	/**
	* A temporary cache containing serialized transaction data for
	* signature verification.
	* Reused across PreChecks and ConsensusScriptChecks.
	*/
	PrecomputedTransactionData m_precomputed_txdata;

	// ABC specific flags that are used in both PreChecks and
	// ConsensusScriptChecks
	const uint32_t m_next_block_script_verify_flags;
	int m_sig_checks_standard;
	};

	// Run the policy checks on a given transaction, excluding any script
	// checks. Looks up inputs, calculates feerate, considers replacement,
	// evaluates package limits, etc. As this function can be invoked for "free"
	// by a peer, only tests that are fast should be done here (to avoid CPU
	// DoS).
	bool PreChecks(ATMPArgs &args, Workspace &ws)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);

	// Re-run the script checks, using consensus flags, and try to cache the
	// result in the scriptcache. This should be done after
	// PolicyScriptChecks(). This requires that all inputs either be in our
	// utxo set or in the mempool.
	bool ConsensusScriptChecks(const ATMPArgs &args, Workspace &ws)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);

	// Try to add the transaction to the mempool, removing any conflicts first.
	// Returns true if the transaction is in the mempool after any size
	// limiting is performed, false otherwise.
	bool Finalize(const ATMPArgs &args, Workspace &ws)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);

	// Submit all transactions to the mempool and call ConsensusScriptChecks to
	// add to the script cache - should only be called after successful
	// validation of all transactions in the package.
	// The package may end up partially-submitted after size limiting;
	// returns true if all transactions are successfully added to the mempool,
	// false otherwise.
	bool SubmitPackage(const ATMPArgs &args, std::vector<Workspace> &workspaces,
	PackageValidationState &package_state,
	std::map<const TxId, const MempoolAcceptResult> &results)
	EXCLUSIVE_LOCKS_REQUIRED(cs_main, m_pool.cs);

	private:
	CTxMemPool &m_pool;
	CCoinsViewCache m_view;
	CCoinsViewMemPool m_viewmempool;
	CCoinsView m_dummy;

	Chainstate &m_active_chainstate;
	};

	bool MemPoolAccept::PreChecks(ATMPArgs &args, Workspace &ws) {
	AssertLockHeld(cs_main);
	AssertLockHeld(m_pool.cs);
	const CTransactionRef &ptx = ws.m_ptx;
	const CTransaction &tx = *ws.m_ptx;
	const TxId &txid = ws.m_ptx->GetId();

	// Copy/alias what we need out of args
	const int64_t nAcceptTime = args.m_accept_time;
	const bool bypass_limits = args.m_bypass_limits;
	std::vector<COutPoint> &coins_to_uncache = args.m_coins_to_uncache;
	const unsigned int heightOverride = args.m_heightOverride;

	// Alias what we need out of ws
	TxValidationState &state = ws.m_state;
	// Coinbase is only valid in a block, not as a loose transaction.
	if (!CheckRegularTransaction(tx, state)) {
	// state filled in by CheckRegularTransaction.
	return false;
	}

	// Rather not work on nonstandard transactions (unless -testnet)
	std::string reason;
	if (fRequireStandard && !IsStandardTx(tx, reason)) {
	return state.Invalid(TxValidationResult::TX_NOT_STANDARD, reason);
	}

	// Only accept nLockTime-using transactions that can be mined in the next
	// block; we don't want our mempool filled up with transactions that can't
	// be mined yet.
	TxValidationState ctxState;
	if (!ContextualCheckTransactionForCurrentBlock(
	m_active_chainstate.m_chain.Tip(),
	args.m_config.GetChainParams().GetConsensus(), tx, ctxState)) {
	// We copy the state from a dummy to ensure we don't increase the
	// ban score of peer for transaction that could be valid in the future.
	return state.Invalid(TxValidationResult::TX_PREMATURE_SPEND,
	ctxState.GetRejectReason(),
	ctxState.GetDebugMessage());
	}

	// Is it already in the memory pool?
	if (m_pool.exists(txid)) {
	return state.Invalid(TxValidationResult::TX_DUPLICATE,
	"txn-already-in-mempool");
	}

	// Check for conflicts with in-memory transactions
	for (const CTxIn &txin : tx.vin) {
	const CTransaction *ptxConflicting = m_pool.GetConflictTx(txin.prevout);
	if (ptxConflicting) {
	// Disable replacement feature for good
	return state.Invalid(TxValidationResult::TX_CONFLICT,
	"txn-mempool-conflict");
	}
	}

	LockPoints lp;
	m_view.SetBackend(m_viewmempool);

	const CCoinsViewCache &coins_cache = m_active_chainstate.CoinsTip();
	// Do all inputs exist?
	for (const CTxIn &txin : tx.vin) {
	if (!coins_cache.HaveCoinInCache(txin.prevout)) {
	coins_to_uncache.push_back(txin.prevout);
	}

	// Note: this call may add txin.prevout to the coins cache
	// (coins_cache.cacheCoins) by way of FetchCoin(). It should be
	// removed later (via coins_to_uncache) if this tx turns out to be
	// invalid.
	if (!m_view.HaveCoin(txin.prevout)) {
	// Are inputs missing because we already have the tx?
	for (size_t out = 0; out < tx.vout.size(); out++) {
	// Optimistically just do efficient check of cache for
	// outputs.
	if (coins_cache.HaveCoinInCache(COutPoint(txid, out))) {
	return state.Invalid(TxValidationResult::TX_DUPLICATE,
	"txn-already-known");
	}
	}

	// Otherwise assume this might be an orphan tx for which we just
	// haven't seen parents yet.
	return state.Invalid(TxValidationResult::TX_MISSING_INPUTS,
	"bad-txns-inputs-missingorspent");
	}
	}

	// Are the actual inputs available?
	if (!m_view.HaveInputs(tx)) {
	return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY,
	"bad-txns-inputs-spent");
	}

	// Bring the best block into scope.
	m_view.GetBestBlock();

	// we have all inputs cached now, so switch back to dummy (to protect
	// against bugs where we pull more inputs from disk that miss being
	// added to coins_to_uncache)
	m_view.SetBackend(m_dummy);

	assert(m_active_chainstate.m_blockman.LookupBlockIndex(
	m_view.GetBestBlock()) == m_active_chainstate.m_chain.Tip());

	// Only accept BIP68 sequence locked transactions that can be mined in
	// the next block; we don't want our mempool filled up with transactions
	// that can't be mined yet.
	// Pass in m_view which has all of the relevant inputs cached. Note that,
	// since m_view's backend was removed, it no longer pulls coins from the
	// mempool.
	if (!CheckSequenceLocksAtTip(m_active_chainstate.m_chain.Tip(), m_view, tx,
	&lp)) {
	return state.Invalid(TxValidationResult::TX_PREMATURE_SPEND,
	"non-BIP68-final");
	}

	// The mempool holds txs for the next block, so pass height+1 to
	// CheckTxInputs
	if (!Consensus::CheckTxInputs(tx, state, m_view,
	m_active_chainstate.m_chain.Height() + 1,
	ws.m_base_fees)) {
	// state filled in by CheckTxInputs
	return false;
	}

	// Check for non-standard pay-to-script-hash in inputs
	if (fRequireStandard &&
	!AreInputsStandard(tx, m_view, ws.m_next_block_script_verify_flags)) {
	return state.Invalid(TxValidationResult::TX_INPUTS_NOT_STANDARD,
	"bad-txns-nonstandard-inputs");
	}

	// ws.m_modified_fess includes any fee deltas from PrioritiseTransaction
	ws.m_modified_fees = ws.m_base_fees;
	m_pool.ApplyDelta(txid, ws.m_modified_fees);

	// Keep track of transactions that spend a coinbase, which we re-scan
	// during reorgs to ensure COINBASE_MATURITY is still met.
	bool fSpendsCoinbase = false;
	for (const CTxIn &txin : tx.vin) {
	const Coin &coin = m_view.AccessCoin(txin.prevout);
	if (coin.IsCoinBase()) {
	fSpendsCoinbase = true;
	break;
	}
	}

	unsigned int nSize = tx.GetTotalSize();

	// No transactions are allowed below minRelayTxFee except from disconnected
	// blocks.
	// Do not change this to use virtualsize without coordinating a network
	// policy upgrade.
	if (!bypass_limits && ws.m_modified_fees < minRelayTxFee.GetFee(nSize)) {
	return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY,
	"min relay fee not met",
	strprintf("%d < %d", ws.m_modified_fees,
	::minRelayTxFee.GetFee(nSize)));
	}

	// Validate input scripts against standard script flags.
	const uint32_t scriptVerifyFlags =
	ws.m_next_block_script_verify_flags \| STANDARD_SCRIPT_VERIFY_FLAGS;
	ws.m_precomputed_txdata = PrecomputedTransactionData{tx};
	if (!CheckInputScripts(tx, state, m_view, scriptVerifyFlags, true, false,
	ws.m_precomputed_txdata, ws.m_sig_checks_standard)) {
	// State filled in by CheckInputScripts
	return false;
	}

	ws.m_entry = std::make_unique<CTxMemPoolEntry>(
	ptx, ws.m_base_fees, nAcceptTime,
	heightOverride ? heightOverride : m_active_chainstate.m_chain.Height(),
	fSpendsCoinbase, ws.m_sig_checks_standard, lp);

	ws.m_vsize = ws.m_entry->GetTxVirtualSize();

	Amount mempoolRejectFee = m_pool.GetMinFee().GetFee(ws.m_vsize);
	if (!bypass_limits && mempoolRejectFee > Amount::zero() &&
	ws.m_modified_fees < mempoolRejectFee) {
	return state.Invalid(
	TxValidationResult::TX_MEMPOOL_POLICY, "mempool min fee not met",
	strprintf("%d < %d", ws.m_modified_fees, mempoolRejectFee));
	}

	return true;
	}

	bool MemPoolAccept::ConsensusScriptChecks(const ATMPArgs &args, Workspace &ws) {
	AssertLockHeld(cs_main);
	AssertLockHeld(m_pool.cs);
	const CTransaction &tx = *ws.m_ptx;
	const TxId &txid = tx.GetId();
	TxValidationState &state = ws.m_state;

	// Check again against the next block's script verification flags
	// to cache our script execution flags.
	//
	// This is also useful in case of bugs in the standard flags that cause
	// transactions to pass as valid when they're actually invalid. For
	// instance the STRICTENC flag was incorrectly allowing certain CHECKSIG
	// NOT scripts to pass, even though they were invalid.
	//
	// There is a similar check in CreateNewBlock() to prevent creating
	// invalid blocks (using TestBlockValidity), however allowing such
	// transactions into the mempool can be exploited as a DoS attack.
	int nSigChecksConsensus;
	if (!CheckInputsFromMempoolAndCache(
	tx, state, m_view, m_pool, ws.m_next_block_script_verify_flags,
	ws.m_precomputed_txdata, nSigChecksConsensus,
	m_active_chainstate.CoinsTip())) {
	// This can occur under some circumstances, if the node receives an
	// unrequested tx which is invalid due to new consensus rules not
	// being activated yet (during IBD).
	LogPrintf("BUG! PLEASE REPORT THIS! CheckInputScripts failed against "
	"latest-block but not STANDARD flags %s, %s\n",
	txid.ToString(), state.ToString());
	return Assume(false);
	}

	if (ws.m_sig_checks_standard != nSigChecksConsensus) {
	// We can't accept this transaction as we've used the standard count
	// for the mempool/mining, but the consensus count will be enforced
	// in validation (we don't want to produce bad block templates).
	return error(
	"%s: BUG! PLEASE REPORT THIS! SigChecks count differed between "
	"standard and consensus flags in %s",
	__func__, txid.ToString());
	}
	return true;
	}

	bool MemPoolAccept::Finalize(const ATMPArgs &args, Workspace &ws) {
	AssertLockHeld(cs_main);
	AssertLockHeld(m_pool.cs);
	const TxId &txid = ws.m_ptx->GetId();
	TxValidationState &state = ws.m_state;
	const bool bypass_limits = args.m_bypass_limits;

	// Store transaction in memory
	CTxMemPoolEntry *pentry = ws.m_entry.release();
	auto entry = CTxMemPoolEntryRef::acquire(pentry);
	m_pool.addUnchecked(entry);

	// Trim mempool and check if tx was trimmed.
	// If we are validating a package, don't trim here because we could evict a
	// previous transaction in the package. LimitMempoolSize() should be called
	// at the very end to make sure the mempool is still within limits and
	// package submission happens atomically.
	if (!args.m_package_submission && !bypass_limits) {
	m_pool.LimitSize(m_active_chainstate.CoinsTip());
	if (!m_pool.exists(txid)) {
	return state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY,
	"mempool full");
	}
	}
	return true;
	}

	// Get the coins spent by ptx from the coins_view. Assumes coins are present.
	static std::vector<Coin> getSpentCoins(const CTransactionRef &ptx,
	const CCoinsViewCache &coins_view) {
	std::vector<Coin> spent_coins;
	spent_coins.reserve(ptx->vin.size());
	for (const CTxIn &input : ptx->vin) {
	Coin coin;
	const bool coinFound = coins_view.GetCoin(input.prevout, coin);
	Assume(coinFound);
	spent_coins.push_back(std::move(coin));
	}
	return spent_coins;
	}

	bool MemPoolAccept::SubmitPackage(
	const ATMPArgs &args, std::vector<Workspace> &workspaces,
	PackageValidationState &package_state,
	std::map<const TxId, const MempoolAcceptResult> &results) {
	AssertLockHeld(cs_main);
	AssertLockHeld(m_pool.cs);
	// Sanity check: none of the transactions should be in the mempool.
	assert(std::all_of(
	workspaces.cbegin(), workspaces.cend(),
	[this](const auto &ws) { return !m_pool.exists(ws.m_ptx->GetId()); }));

	bool all_submitted = true;
	// ConsensusScriptChecks adds to the script cache and is therefore
	// consensus-critical; CheckInputsFromMempoolAndCache asserts that
	// transactions only spend coins available from the mempool or UTXO set.
	// Submit each transaction to the mempool immediately after calling
	// ConsensusScriptChecks to make the outputs available for subsequent
	// transactions.
	for (Workspace &ws : workspaces) {
	if (!ConsensusScriptChecks(args, ws)) {
	results.emplace(ws.m_ptx->GetId(),
	MempoolAcceptResult::Failure(ws.m_state));
	// Since PreChecks() passed, this should never fail.
	all_submitted = Assume(false);
	}

	// If we call LimitMempoolSize() for each individual Finalize(), the
	// mempool will not take the transaction's descendant feerate into
	// account because it hasn't seen them yet. Also, we risk evicting a
	// transaction that a subsequent package transaction depends on.
	// Instead, allow the mempool to temporarily bypass limits, the maximum
	// package size) while submitting transactions individually and then
	// trim at the very end.
	if (!Finalize(args, ws)) {
	results.emplace(ws.m_ptx->GetId(),
	MempoolAcceptResult::Failure(ws.m_state));
	// Since LimitMempoolSize() won't be called, this should never fail.
	all_submitted = Assume(false);
	}
	}

	// It may or may not be the case that all the transactions made it into the
	// mempool. Regardless, make sure we haven't exceeded max mempool size.
	m_pool.LimitSize(m_active_chainstate.CoinsTip());
	if (!all_submitted) {
	return false;
	}

	// Find the txids of the transactions that made it into the mempool. Allow
	// partial submission, but don't report success unless they all made it into
	// the mempool.
	for (Workspace &ws : workspaces) {
	if (m_pool.exists(ws.m_ptx->GetId())) {
	results.emplace(ws.m_ptx->GetId(), MempoolAcceptResult::Success(
	ws.m_vsize, ws.m_base_fees));
	GetMainSignals().TransactionAddedToMempool(
	ws.m_ptx,
	std::make_shared<const std::vector<Coin>>(
	getSpentCoins(ws.m_ptx, m_view)),
	m_pool.GetAndIncrementSequence());
	} else {
	all_submitted = false;
	ws.m_state.Invalid(TxValidationResult::TX_MEMPOOL_POLICY,
	"mempool full");
	results.emplace(ws.m_ptx->GetId(),
	MempoolAcceptResult::Failure(ws.m_state));
	}
	}
	return all_submitted;
	}

	MempoolAcceptResult
	MemPoolAccept::AcceptSingleTransaction(const CTransactionRef &ptx,
	ATMPArgs &args) {
	AssertLockHeld(cs_main);
	// mempool "read lock" (held through
	// GetMainSignals().TransactionAddedToMempool())
	LOCK(m_pool.cs);

	const Consensus::Params &consensusParams =
	args.m_config.GetChainParams().GetConsensus();
	const CBlockIndex *tip = m_active_chainstate.m_chain.Tip();

	Workspace ws(ptx, GetNextBlockScriptFlags(consensusParams, tip));

	// Perform the inexpensive checks first and avoid hashing and signature
	// verification unless those checks pass, to mitigate CPU exhaustion
	// denial-of-service attacks.
	if (!PreChecks(args, ws)) {
	return MempoolAcceptResult::Failure(ws.m_state);
	}

	if (!ConsensusScriptChecks(args, ws)) {
	return MempoolAcceptResult::Failure(ws.m_state);
	}

	const TxId txid = ptx->GetId();

	// Mempool sanity check -- in our new mempool no tx can be added if its
	// outputs are already spent in the mempool (that is, no children before
	// parents allowed; the mempool must be consistent at all times).
	//
	// This means that on reorg, the disconnectpool must always import
	// the existing mempool tx's, clear the mempool, and then re-add
	// remaining tx's in topological order via this function. Our new mempool
	// has fast adds, so this is ok.
	if (auto it = m_pool.mapNextTx.lower_bound(COutPoint{txid, 0});
	it != m_pool.mapNextTx.end() && it->first->GetTxId() == txid) {
	LogPrintf("%s: BUG! PLEASE REPORT THIS! Attempt to add txid %s, but "
	"its outputs are already spent in the "
	"mempool\n",
	__func__, txid.ToString());
	ws.m_state.Invalid(TxValidationResult::TX_CHILD_BEFORE_PARENT,
	"txn-child-before-parent");
	return MempoolAcceptResult::Failure(ws.m_state);
	}

	// Tx was accepted, but not added
	if (args.m_test_accept) {
	return MempoolAcceptResult::Success(ws.m_vsize, ws.m_base_fees);
	}

	if (!Finalize(args, ws)) {
	return MempoolAcceptResult::Failure(ws.m_state);
	}

	GetMainSignals().TransactionAddedToMempool(
	ptx,
	std::make_shared<const std::vector<Coin>>(getSpentCoins(ptx, m_view)),
	m_pool.GetAndIncrementSequence());

	return MempoolAcceptResult::Success(ws.m_vsize, ws.m_base_fees);
	}

	PackageMempoolAcceptResult MemPoolAccept::AcceptMultipleTransactions(
	const std::vector<CTransactionRef> &txns, ATMPArgs &args) {
	AssertLockHeld(cs_main);

	// These context-free package limits can be done before taking the mempool
	// lock.
	PackageValidationState package_state;
	if (!CheckPackage(txns, package_state)) {
	return PackageMempoolAcceptResult(package_state, {});
	}

	std::vector<Workspace> workspaces{};
	workspaces.reserve(txns.size());
	std::transform(txns.cbegin(), txns.cend(), std::back_inserter(workspaces),
	[&args, this](const auto &tx) {
	return Workspace(
	tx,
	GetNextBlockScriptFlags(
	args.m_config.GetChainParams().GetConsensus(),
	m_active_chainstate.m_chain.Tip()));
	});
	std::map<const TxId, const MempoolAcceptResult> results;

	LOCK(m_pool.cs);

	// Do all PreChecks first and fail fast to avoid running expensive script
	// checks when unnecessary.
	for (Workspace &ws : workspaces) {
	if (!PreChecks(args, ws)) {
	package_state.Invalid(PackageValidationResult::PCKG_TX,
	"transaction failed");
	// Exit early to avoid doing pointless work. Update the failed tx
	// result; the rest are unfinished.
	results.emplace(ws.m_ptx->GetId(),
	MempoolAcceptResult::Failure(ws.m_state));
	return PackageMempoolAcceptResult(package_state,
	std::move(results));
	}
	// Make the coins created by this transaction available for subsequent
	// transactions in the package to spend.
	m_viewmempool.PackageAddTransaction(ws.m_ptx);
	if (args.m_test_accept) {
	// When test_accept=true, transactions that pass PreChecks
	// are valid because there are no further mempool checks (passing
	// PreChecks implies passing ConsensusScriptChecks).
	results.emplace(ws.m_ptx->GetId(), MempoolAcceptResult::Success(
	ws.m_vsize, ws.m_base_fees));
	}
	}

	if (args.m_test_accept) {
	return PackageMempoolAcceptResult(package_state, std::move(results));
	}

	if (!SubmitPackage(args, workspaces, package_state, results)) {
	package_state.Invalid(PackageValidationResult::PCKG_TX,
	"submission failed");
	return PackageMempoolAcceptResult(package_state, std::move(results));
	}

	return PackageMempoolAcceptResult(package_state, std::move(results));
	}

	PackageMempoolAcceptResult MemPoolAccept::AcceptPackage(const Package &package,
	ATMPArgs &args) {
	AssertLockHeld(cs_main);
	PackageValidationState package_state;

	// Check that the package is well-formed. If it isn't, we won't try to
	// validate any of the transactions and thus won't return any
	// MempoolAcceptResults, just a package-wide error.

	// Context-free package checks.
	if (!CheckPackage(package, package_state)) {
	return PackageMempoolAcceptResult(package_state, {});
	}

	// All transactions in the package must be a parent of the last transaction.
	// This is just an opportunity for us to fail fast on a context-free check
	// without taking the mempool lock.
	if (!IsChildWithParents(package)) {
	package_state.Invalid(PackageValidationResult::PCKG_POLICY,
	"package-not-child-with-parents");
	return PackageMempoolAcceptResult(package_state, {});
	}

	// IsChildWithParents() guarantees the package is > 1 transactions.
	assert(package.size() > 1);
	// The package must be 1 child with all of its unconfirmed parents. The
	// package is expected to be sorted, so the last transaction is the child.
	const auto &child = package.back();
	std::unordered_set<TxId, SaltedTxIdHasher> unconfirmed_parent_txids;
	std::transform(
	package.cbegin(), package.cend() - 1,
	std::inserter(unconfirmed_parent_txids, unconfirmed_parent_txids.end()),
	[](const auto &tx) { return tx->GetId(); });

	// All child inputs must refer to a preceding package transaction or a
	// confirmed UTXO. The only way to verify this is to look up the child's
	// inputs in our current coins view (not including mempool), and enforce
	// that all parents not present in the package be available at chain tip.
	// Since this check can bring new coins into the coins cache, keep track of
	// these coins and uncache them if we don't end up submitting this package
	// to the mempool.
	const CCoinsViewCache &coins_tip_cache = m_active_chainstate.CoinsTip();
	for (const auto &input : child->vin) {
	if (!coins_tip_cache.HaveCoinInCache(input.prevout)) {
	args.m_coins_to_uncache.push_back(input.prevout);
	}
	}
	// Using the MemPoolAccept m_view cache allows us to look up these same
	// coins faster later. This should be connecting directly to CoinsTip, not
	// to m_viewmempool, because we specifically require inputs to be confirmed
	// if they aren't in the package.
	m_view.SetBackend(m_active_chainstate.CoinsTip());
	const auto package_or_confirmed = [this, &unconfirmed_parent_txids](
	const auto &input) {
	return unconfirmed_parent_txids.count(input.prevout.GetTxId()) > 0 \|\|
	m_view.HaveCoin(input.prevout);
	};
	if (!std::all_of(child->vin.cbegin(), child->vin.cend(),
	package_or_confirmed)) {
	package_state.Invalid(PackageValidationResult::PCKG_POLICY,
	"package-not-child-with-unconfirmed-parents");
	return PackageMempoolAcceptResult(package_state, {});
	}
	// Protect against bugs where we pull more inputs from disk that miss being
	// added to coins_to_uncache. The backend will be connected again when
	// needed in PreChecks.
	m_view.SetBackend(m_dummy);

	LOCK(m_pool.cs);
	std::map<const TxId, const MempoolAcceptResult> results;
	// Node operators are free to set their mempool policies however they
	// please, nodes may receive transactions in different orders, and malicious
	// counterparties may try to take advantage of policy differences to pin or
	// delay propagation of transactions. As such, it's possible for some
	// package transaction(s) to already be in the mempool, and we don't want to
	// reject the entire package in that case (as that could be a censorship
	// vector). De-duplicate the transactions that are already in the mempool,
	// and only call AcceptMultipleTransactions() with the new transactions.
	// This ensures we don't double-count transaction counts and sizes when
	// checking ancestor/descendant limits, or double-count transaction fees for
	// fee-related policy.
	std::vector<CTransactionRef> txns_new;
	for (const auto &tx : package) {
	const auto &txid = tx->GetId();
	// An already confirmed tx is treated as one not in mempool, because all
	// we know is that the inputs aren't available.
	if (m_pool.exists(txid)) {
	// Exact transaction already exists in the mempool.
	auto iter = m_pool.GetIter(txid);
	assert(iter != std::nullopt);
	results.emplace(txid, MempoolAcceptResult::MempoolTx(
	(*iter.value())->GetTxSize(),
	(*iter.value())->GetFee()));
	} else {
	// Transaction does not already exist in the mempool.
	txns_new.push_back(tx);
	}
	}

	// Nothing to do if the entire package has already been submitted.
	if (txns_new.empty()) {
	return PackageMempoolAcceptResult(package_state, std::move(results));
	}
	// Validate the (deduplicated) transactions as a package.
	auto submission_result = AcceptMultipleTransactions(txns_new, args);
	// Include already-in-mempool transaction results in the final result.
	for (const auto &[txid, mempoolaccept_res] : results) {
	submission_result.m_tx_results.emplace(txid, mempoolaccept_res);
	}
	return submission_result;
	}
	} // namespace

	MempoolAcceptResult AcceptToMemoryPool(const Config &config,
	Chainstate &active_chainstate,
	const CTransactionRef &tx,
	int64_t accept_time, bool bypass_limits,
	bool test_accept,
	unsigned int heightOverride) {
	AssertLockHeld(::cs_main);
	assert(active_chainstate.GetMempool() != nullptr);
	CTxMemPool &pool{*active_chainstate.GetMempool()};

	std::vector<COutPoint> coins_to_uncache;
	auto args = MemPoolAccept::ATMPArgs::SingleAccept(
	config, accept_time, bypass_limits, coins_to_uncache, test_accept,
	heightOverride);
	const MempoolAcceptResult result = MemPoolAccept(pool, active_chainstate)
	.AcceptSingleTransaction(tx, args);
	if (result.m_result_type != MempoolAcceptResult::ResultType::VALID) {
	// Remove coins that were not present in the coins cache before calling
	// ATMPW; this is to prevent memory DoS in case we receive a large
	// number of invalid transactions that attempt to overrun the in-memory
	// coins cache
	// (`CCoinsViewCache::cacheCoins`).

	for (const COutPoint &outpoint : coins_to_uncache) {
	active_chainstate.CoinsTip().Uncache(outpoint);
	}
	}

	// After we've (potentially) uncached entries, ensure our coins cache is
	// still within its size limits
	BlockValidationState stateDummy;
	active_chainstate.FlushStateToDisk(stateDummy, FlushStateMode::PERIODIC);
	return result;
	}

	PackageMempoolAcceptResult
	ProcessNewPackage(const Config &config, Chainstate &active_chainstate,
	CTxMemPool &pool, const Package &package, bool test_accept) {
	AssertLockHeld(cs_main);
	assert(!package.empty());
	assert(std::all_of(package.cbegin(), package.cend(),
	[](const auto &tx) { return tx != nullptr; }));

	std::vector<COutPoint> coins_to_uncache;
	const auto result = [&]() EXCLUSIVE_LOCKS_REQUIRED(cs_main) {
	AssertLockHeld(cs_main);
	if (test_accept) {
	auto args = MemPoolAccept::ATMPArgs::PackageTestAccept(
	config, GetTime(), coins_to_uncache);
	return MemPoolAccept(pool, active_chainstate)
	.AcceptMultipleTransactions(package, args);
	} else {
	auto args = MemPoolAccept::ATMPArgs::PackageChildWithParents(
	config, GetTime(), coins_to_uncache);
	return MemPoolAccept(pool, active_chainstate)
	.AcceptPackage(package, args);
	}
	}();

	// Uncache coins pertaining to transactions that were not submitted to the
	// mempool.
	if (test_accept \|\| result.m_state.IsInvalid()) {
	for (const COutPoint &hashTx : coins_to_uncache) {
	active_chainstate.CoinsTip().Uncache(hashTx);
	}
	}
	// Ensure the coins cache is still within limits.
	BlockValidationState state_dummy;
	active_chainstate.FlushStateToDisk(state_dummy, FlushStateMode::PERIODIC);
	return result;
	}

	Amount GetBlockSubsidy(int nHeight, const Consensus::Params &consensusParams) {
	int halvings = nHeight / consensusParams.nSubsidyHalvingInterval;
	// Force block reward to zero when right shift is undefined.
	if (halvings >= 64) {
	return Amount::zero();
	}

	Amount nSubsidy = 50 * COIN;
	// Subsidy is cut in half every 210,000 blocks which will occur
	// approximately every 4 years.
	return ((nSubsidy / SATOSHI) >> halvings) * SATOSHI;
	}

	CoinsViews::CoinsViews(std::string ldb_name, size_t cache_size_bytes,
	bool in_memory, bool should_wipe)
	: m_dbview(gArgs.GetDataDirNet() / ldb_name, cache_size_bytes, in_memory,
	should_wipe),
	m_catcherview(&m_dbview) {}

	void CoinsViews::InitCache() {
	AssertLockHeld(::cs_main);
	m_cacheview = std::make_unique<CCoinsViewCache>(&m_catcherview);
	}

	Chainstate::Chainstate(CTxMemPool *mempool, BlockManager &blockman,
	ChainstateManager &chainman,
	std::optional<BlockHash> from_snapshot_blockhash)
	: m_mempool(mempool), m_blockman(blockman), m_chainman(chainman),
	m_from_snapshot_blockhash(from_snapshot_blockhash) {}

	void Chainstate::InitCoinsDB(size_t cache_size_bytes, bool in_memory,
	bool should_wipe, std::string leveldb_name) {
	if (m_from_snapshot_blockhash) {
	leveldb_name += node::SNAPSHOT_CHAINSTATE_SUFFIX;
	}
	m_coins_views = std::make_unique<CoinsViews>(leveldb_name, cache_size_bytes,
	in_memory, should_wipe);
	}

	void Chainstate::InitCoinsCache(size_t cache_size_bytes) {
	AssertLockHeld(::cs_main);
	assert(m_coins_views != nullptr);
	m_coinstip_cache_size_bytes = cache_size_bytes;
	m_coins_views->InitCache();
	}

	// Note that though this is marked const, we may end up modifying
	// `m_cached_finished_ibd`, which is a performance-related implementation
	// detail. This function must be marked `const` so that `CValidationInterface`
	// clients (which are given a `const Chainstate*`) can call it.
	//
	bool Chainstate::IsInitialBlockDownload() const {
	// Optimization: pre-test latch before taking the lock.
	if (m_cached_finished_ibd.load(std::memory_order_relaxed)) {
	return false;
	}

	LOCK(cs_main);
	if (m_cached_finished_ibd.load(std::memory_order_relaxed)) {
	return false;
	}
	if (m_chainman.m_blockman.LoadingBlocks()) {
	return true;
	}
	if (m_chain.Tip() == nullptr) {
	return true;
	}
	if (m_chain.Tip()->nChainWork < nMinimumChainWork) {
	return true;
	}
	if (m_chain.Tip()->GetBlockTime() < (GetTime() - nMaxTipAge)) {
	return true;
	}
	LogPrintf("Leaving InitialBlockDownload (latching to false)\n");
	m_cached_finished_ibd.store(true, std::memory_order_relaxed);
	return false;
	}

	static void AlertNotify(const std::string &strMessage) {
	uiInterface.NotifyAlertChanged();
	#if defined(HAVE_SYSTEM)
	std::string strCmd = gArgs.GetArg("-alertnotify", "");
	if (strCmd.empty()) {
	return;
	}

	// Alert text should be plain ascii coming from a trusted source, but to be
	// safe we first strip anything not in safeChars, then add single quotes
	// around the whole string before passing it to the shell:
	std::string singleQuote("'");
	std::string safeStatus = SanitizeString(strMessage);
	safeStatus = singleQuote + safeStatus + singleQuote;
	ReplaceAll(strCmd, "%s", safeStatus);

	std::thread t(runCommand, strCmd);
	// thread runs free
	t.detach();
	#endif
	}

	void Chainstate::CheckForkWarningConditions() {
	AssertLockHeld(cs_main);

	// Before we get past initial download, we cannot reliably alert about forks
	// (we assume we don't get stuck on a fork before finishing our initial
	// sync)
	if (IsInitialBlockDownload()) {
	return;
	}

	// If our best fork is no longer within 72 blocks (+/- 12 hours if no one
	// mines it) of our head, or if it is back on the active chain, drop it
	if (m_best_fork_tip && (m_chain.Height() - m_best_fork_tip->nHeight >= 72 \|\|
	m_chain.Contains(m_best_fork_tip))) {
	m_best_fork_tip = nullptr;
	}

	if (m_best_fork_tip \|\|
	(m_chainman.m_best_invalid &&
	m_chainman.m_best_invalid->nChainWork >
	m_chain.Tip()->nChainWork + (GetBlockProof(m_chain.Tip()) 6))) {
	if (!GetfLargeWorkForkFound() && m_best_fork_base) {
	std::string warning =
	std::string("'Warning: Large-work fork detected, forking after "
	"block ") +
	m_best_fork_base->phashBlock->ToString() + std::string("'");
	AlertNotify(warning);
	}

	if (m_best_fork_tip && m_best_fork_base) {
	LogPrintf("%s: Warning: Large fork found\n forking the "
	"chain at height %d (%s)\n lasting to height %d "
	"(%s).\nChain state database corruption likely.\n",
	__func__, m_best_fork_base->nHeight,
	m_best_fork_base->phashBlock->ToString(),
	m_best_fork_tip->nHeight,
	m_best_fork_tip->phashBlock->ToString());
	SetfLargeWorkForkFound(true);
	} else {
	LogPrintf("%s: Warning: Found invalid chain at least ~6 blocks "
	"longer than our best chain.\nChain state database "
	"corruption likely.\n",
	__func__);
	SetfLargeWorkInvalidChainFound(true);
	}
	} else {
	SetfLargeWorkForkFound(false);
	SetfLargeWorkInvalidChainFound(false);
	}
	}

	void Chainstate::CheckForkWarningConditionsOnNewFork(
	CBlockIndex *pindexNewForkTip) {
	AssertLockHeld(cs_main);

	// If we are on a fork that is sufficiently large, set a warning flag.
	const CBlockIndex *pfork = m_chain.FindFork(pindexNewForkTip);

	// We define a condition where we should warn the user about as a fork of at
	// least 7 blocks with a tip within 72 blocks (+/- 12 hours if no one mines
	// it) of ours. We use 7 blocks rather arbitrarily as it represents just
	// under 10% of sustained network hash rate operating on the fork, or a
	// chain that is entirely longer than ours and invalid (note that this
	// should be detected by both). We define it this way because it allows us
	// to only store the highest fork tip (+ base) which meets the 7-block
	// condition and from this always have the most-likely-to-cause-warning fork
	if (pfork &&
	(!m_best_fork_tip \|\|
	pindexNewForkTip->nHeight > m_best_fork_tip->nHeight) &&
	pindexNewForkTip->nChainWork - pfork->nChainWork >
	(GetBlockProof(pfork) 7) &&
	m_chain.Height() - pindexNewForkTip->nHeight < 72) {
	m_best_fork_tip = pindexNewForkTip;
	m_best_fork_base = pfork;
	}

	CheckForkWarningConditions();
	}

	// Called both upon regular invalid block discovery and InvalidateBlock
	void Chainstate::InvalidChainFound(CBlockIndex *pindexNew) {
	AssertLockHeld(cs_main);
	if (!m_chainman.m_best_invalid \|\|
	pindexNew->nChainWork > m_chainman.m_best_invalid->nChainWork) {
	m_chainman.m_best_invalid = pindexNew;
	}
	if (m_chainman.m_best_header != nullptr &&
	m_chainman.m_best_header->GetAncestor(pindexNew->nHeight) ==
	pindexNew) {
	m_chainman.m_best_header = m_chain.Tip();
	}

	// If the invalid chain found is supposed to be finalized, we need to move
	// back the finalization point.
	if (IsBlockAvalancheFinalized(pindexNew)) {
	LOCK(cs_avalancheFinalizedBlockIndex);
	m_avalancheFinalizedBlockIndex = pindexNew->pprev;
	}

	LogPrintf("%s: invalid block=%s height=%d log2_work=%f date=%s\n",
	__func__, pindexNew->GetBlockHash().ToString(),
	pindexNew->nHeight,
	log(pindexNew->nChainWork.getdouble()) / log(2.0),
	FormatISO8601DateTime(pindexNew->GetBlockTime()));
	CBlockIndex *tip = m_chain.Tip();
	assert(tip);
	LogPrintf("%s: current best=%s height=%d log2_work=%f date=%s\n",
	__func__, tip->GetBlockHash().ToString(), m_chain.Height(),
	log(tip->nChainWork.getdouble()) / log(2.0),
	FormatISO8601DateTime(tip->GetBlockTime()));
	}

	// Same as InvalidChainFound, above, except not called directly from
	// InvalidateBlock, which does its own setBlockIndexCandidates management.
	void Chainstate::InvalidBlockFound(CBlockIndex *pindex,
	const BlockValidationState &state) {
	AssertLockHeld(cs_main);
	if (state.GetResult() != BlockValidationResult::BLOCK_MUTATED) {
	pindex->nStatus = pindex->nStatus.withFailed();
	m_chainman.m_failed_blocks.insert(pindex);
	m_blockman.m_dirty_blockindex.insert(pindex);
	InvalidChainFound(pindex);
	}
	}

	void SpendCoins(CCoinsViewCache &view, const CTransaction &tx, CTxUndo &txundo,
	int nHeight) {
	// Mark inputs spent.
	if (tx.IsCoinBase()) {
	return;
	}

	txundo.vprevout.reserve(tx.vin.size());
	for (const CTxIn &txin : tx.vin) {
	txundo.vprevout.emplace_back();
	bool is_spent = view.SpendCoin(txin.prevout, &txundo.vprevout.back());
	assert(is_spent);
	}
	}

	void UpdateCoins(CCoinsViewCache &view, const CTransaction &tx, CTxUndo &txundo,
	int nHeight) {
	SpendCoins(view, tx, txundo, nHeight);
	AddCoins(view, tx, nHeight);
	}

	bool CScriptCheck::operator()() {
	const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
	if (!VerifyScript(scriptSig, m_tx_out.scriptPubKey, nFlags,
	CachingTransactionSignatureChecker(
	ptxTo, nIn, m_tx_out.nValue, cacheStore, txdata),
	metrics, &error)) {
	return false;
	}
	if ((pTxLimitSigChecks &&
	!pTxLimitSigChecks->consume_and_check(metrics.nSigChecks)) \|\|
	(pBlockLimitSigChecks &&
	!pBlockLimitSigChecks->consume_and_check(metrics.nSigChecks))) {
	// we can't assign a meaningful script error (since the script
	// succeeded), but remove the ScriptError::OK which could be
	// misinterpreted.
	error = ScriptError::SIGCHECKS_LIMIT_EXCEEDED;
	return false;
	}
	return true;
	}

	bool CheckInputScripts(const CTransaction &tx, TxValidationState &state,
	const CCoinsViewCache &inputs, const uint32_t flags,
	bool sigCacheStore, bool scriptCacheStore,
	const PrecomputedTransactionData &txdata,
	int &nSigChecksOut, TxSigCheckLimiter &txLimitSigChecks,
	CheckInputsLimiter *pBlockLimitSigChecks,
	std::vector<CScriptCheck> *pvChecks) {
	AssertLockHeld(cs_main);
	assert(!tx.IsCoinBase());

	if (pvChecks) {
	pvChecks->reserve(tx.vin.size());
	}

	// First check if script executions have been cached with the same flags.
	// Note that this assumes that the inputs provided are correct (ie that the
	// transaction hash which is in tx's prevouts properly commits to the
	// scriptPubKey in the inputs view of that transaction).
	ScriptCacheKey hashCacheEntry(tx, flags);
	if (IsKeyInScriptCache(hashCacheEntry, !scriptCacheStore, nSigChecksOut)) {
	if (!txLimitSigChecks.consume_and_check(nSigChecksOut) \|\|
	(pBlockLimitSigChecks &&
	!pBlockLimitSigChecks->consume_and_check(nSigChecksOut))) {
	return state.Invalid(TxValidationResult::TX_CONSENSUS,
	"too-many-sigchecks");
	}
	return true;
	}

	int nSigChecksTotal = 0;

	for (size_t i = 0; i < tx.vin.size(); i++) {
	const COutPoint &prevout = tx.vin[i].prevout;
	const Coin &coin = inputs.AccessCoin(prevout);
	assert(!coin.IsSpent());

	// We very carefully only pass in things to CScriptCheck which are
	// clearly committed to by tx's hash. This provides a sanity
	// check that our caching is not introducing consensus failures through
	// additional data in, eg, the coins being spent being checked as a part
	// of CScriptCheck.

	// Verify signature
	CScriptCheck check(coin.GetTxOut(), tx, i, flags, sigCacheStore, txdata,
	&txLimitSigChecks, pBlockLimitSigChecks);

	// If pvChecks is not null, defer the check execution to the caller.
	if (pvChecks) {
	pvChecks->push_back(std::move(check));
	continue;
	}

	if (!check()) {
	ScriptError scriptError = check.GetScriptError();
	// Compute flags without the optional standardness flags.
	// This differs from MANDATORY_SCRIPT_VERIFY_FLAGS as it contains
	// additional upgrade flags (see AcceptToMemoryPoolWorker variable
	// extraFlags).
	uint32_t mandatoryFlags =
	flags & ~STANDARD_NOT_MANDATORY_VERIFY_FLAGS;
	if (flags != mandatoryFlags) {
	// Check whether the failure was caused by a non-mandatory
	// script verification check. If so, ensure we return
	// NOT_STANDARD instead of CONSENSUS to avoid downstream users
	// splitting the network between upgraded and non-upgraded nodes
	// by banning CONSENSUS-failing data providers.
	CScriptCheck check2(coin.GetTxOut(), tx, i, mandatoryFlags,
	sigCacheStore, txdata);
	if (check2()) {
	return state.Invalid(
	TxValidationResult::TX_NOT_STANDARD,
	strprintf("non-mandatory-script-verify-flag (%s)",
	ScriptErrorString(scriptError)));
	}
	// update the error message to reflect the mandatory violation.
	scriptError = check2.GetScriptError();
	}

	// MANDATORY flag failures correspond to
	// TxValidationResult::TX_CONSENSUS. Because CONSENSUS failures are
	// the most serious case of validation failures, we may need to
	// consider using RECENT_CONSENSUS_CHANGE for any script failure
	// that could be due to non-upgraded nodes which we may want to
	// support, to avoid splitting the network (but this depends on the
	// details of how net_processing handles such errors).
	return state.Invalid(
	TxValidationResult::TX_CONSENSUS,
	strprintf("mandatory-script-verify-flag-failed (%s)",
	ScriptErrorString(scriptError)));
	}

	nSigChecksTotal += check.GetScriptExecutionMetrics().nSigChecks;
	}

	nSigChecksOut = nSigChecksTotal;

	if (scriptCacheStore && !pvChecks) {
	// We executed all of the provided scripts, and were told to cache the
	// result. Do so now.
	AddKeyInScriptCache(hashCacheEntry, nSigChecksTotal);
	}

	return true;
	}

	bool AbortNode(BlockValidationState &state, const std::string &strMessage,
	const bilingual_str &userMessage) {
	AbortNode(strMessage, userMessage);
	return state.Error(strMessage);
	}

	/** Restore the UTXO in a Coin at a given COutPoint. */
	DisconnectResult UndoCoinSpend(Coin &&undo, CCoinsViewCache &view,
	const COutPoint &out) {
	bool fClean = true;

	if (view.HaveCoin(out)) {
	// Overwriting transaction output.
	fClean = false;
	}

	if (undo.GetHeight() == 0) {
	// Missing undo metadata (height and coinbase). Older versions included
	// this information only in undo records for the last spend of a
	// transactions' outputs. This implies that it must be present for some
	// other output of the same tx.
	const Coin &alternate = AccessByTxid(view, out.GetTxId());
	if (alternate.IsSpent()) {
	// Adding output for transaction without known metadata
	return DisconnectResult::FAILED;
	}

	// This is somewhat ugly, but hopefully utility is limited. This is only
	// useful when working from legacy on disck data. In any case, putting
	// the correct information in there doesn't hurt.
	const_cast<Coin &>(undo) = Coin(undo.GetTxOut(), alternate.GetHeight(),
	alternate.IsCoinBase());
	}

	// If the coin already exists as an unspent coin in the cache, then the
	// possible_overwrite parameter to AddCoin must be set to true. We have
	// already checked whether an unspent coin exists above using HaveCoin, so
	// we don't need to guess. When fClean is false, an unspent coin already
	// existed and it is an overwrite.
	view.AddCoin(out, std::move(undo), !fClean);

	return fClean ? DisconnectResult::OK : DisconnectResult::UNCLEAN;
	}

	/**
	* Undo the effects of this block (with given index) on the UTXO set represented
	* by coins. When FAILED is returned, view is left in an indeterminate state.
	*/
	DisconnectResult Chainstate::DisconnectBlock(const CBlock &block,
	const CBlockIndex *pindex,
	CCoinsViewCache &view) {
	AssertLockHeld(::cs_main);
	CBlockUndo blockUndo;
	if (!UndoReadFromDisk(blockUndo, pindex)) {
	error("DisconnectBlock(): failure reading undo data");
	return DisconnectResult::FAILED;
	}

	return ApplyBlockUndo(std::move(blockUndo), block, pindex, view);
	}

	DisconnectResult ApplyBlockUndo(CBlockUndo &&blockUndo, const CBlock &block,
	const CBlockIndex *pindex,
	CCoinsViewCache &view) {
	bool fClean = true;

	if (blockUndo.vtxundo.size() + 1 != block.vtx.size()) {
	error("DisconnectBlock(): block and undo data inconsistent");
	return DisconnectResult::FAILED;
	}

	// First, restore inputs.
	for (size_t i = 1; i < block.vtx.size(); i++) {
	const CTransaction &tx = *(block.vtx[i]);
	CTxUndo &txundo = blockUndo.vtxundo[i - 1];
	if (txundo.vprevout.size() != tx.vin.size()) {
	error("DisconnectBlock(): transaction and undo data inconsistent");
	return DisconnectResult::FAILED;
	}

	for (size_t j = 0; j < tx.vin.size(); j++) {
	const COutPoint &out = tx.vin[j].prevout;
	DisconnectResult res =
	UndoCoinSpend(std::move(txundo.vprevout[j]), view, out);
	if (res == DisconnectResult::FAILED) {
	return DisconnectResult::FAILED;
	}
	fClean = fClean && res != DisconnectResult::UNCLEAN;
	}
	// At this point, all of txundo.vprevout should have been moved out.
	}

	// Second, revert created outputs.
	for (const auto &ptx : block.vtx) {
	const CTransaction &tx = *ptx;
	const TxId &txid = tx.GetId();
	const bool is_coinbase = tx.IsCoinBase();

	// Check that all outputs are available and match the outputs in the
	// block itself exactly.
	for (size_t o = 0; o < tx.vout.size(); o++) {
	if (tx.vout[o].scriptPubKey.IsUnspendable()) {
	continue;
	}

	COutPoint out(txid, o);
	Coin coin;
	bool is_spent = view.SpendCoin(out, &coin);
	if (!is_spent \|\| tx.vout[o] != coin.GetTxOut() \|\|
	uint32_t(pindex->nHeight) != coin.GetHeight() \|\|
	is_coinbase != coin.IsCoinBase()) {
	// transaction output mismatch
	fClean = false;
	}
	}
	}

	// Move best block pointer to previous block.
	view.SetBestBlock(block.hashPrevBlock);

	return fClean ? DisconnectResult::OK : DisconnectResult::UNCLEAN;
	}

	static CCheckQueue<CScriptCheck> scriptcheckqueue(128);

	void StartScriptCheckWorkerThreads(int threads_num) {
	scriptcheckqueue.StartWorkerThreads(threads_num);
	}

	void StopScriptCheckWorkerThreads() {
	scriptcheckqueue.StopWorkerThreads();
	}

	// Returns the script flags which should be checked for the block after
	// the given block.
	static uint32_t GetNextBlockScriptFlags(const Consensus::Params &params,
	const CBlockIndex *pindex) {
	uint32_t flags = SCRIPT_VERIFY_NONE;

	// Enforce P2SH (BIP16)
	if (DeploymentActiveAfter(pindex, params, Consensus::DEPLOYMENT_P2SH)) {
	flags \|= SCRIPT_VERIFY_P2SH;
	}

	// Enforce the DERSIG (BIP66) rule.
	if (DeploymentActiveAfter(pindex, params, Consensus::DEPLOYMENT_DERSIG)) {
	flags \|= SCRIPT_VERIFY_DERSIG;
	}

	// Start enforcing CHECKLOCKTIMEVERIFY (BIP65) rule.
	if (DeploymentActiveAfter(pindex, params, Consensus::DEPLOYMENT_CLTV)) {
	flags \|= SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
	}

	// Start enforcing CSV (BIP68, BIP112 and BIP113) rule.
	if (DeploymentActiveAfter(pindex, params, Consensus::DEPLOYMENT_CSV)) {
	flags \|= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
	}

	// If the UAHF is enabled, we start accepting replay protected txns
	if (IsUAHFenabled(params, pindex)) {
	flags \|= SCRIPT_VERIFY_STRICTENC;
	flags \|= SCRIPT_ENABLE_SIGHASH_FORKID;
	}

	// If the DAA HF is enabled, we start rejecting transaction that use a high
	// s in their signature. We also make sure that signature that are supposed
	// to fail (for instance in multisig or other forms of smart contracts) are
	// null.
	if (IsDAAEnabled(params, pindex)) {
	flags \|= SCRIPT_VERIFY_LOW_S;
	flags \|= SCRIPT_VERIFY_NULLFAIL;
	}

	// When the magnetic anomaly fork is enabled, we start accepting
	// transactions using the OP_CHECKDATASIG opcode and it's verify
	// alternative. We also start enforcing push only signatures and
	// clean stack.
	if (IsMagneticAnomalyEnabled(params, pindex)) {
	flags \|= SCRIPT_VERIFY_SIGPUSHONLY;
	flags \|= SCRIPT_VERIFY_CLEANSTACK;
	}

	if (IsGravitonEnabled(params, pindex)) {
	flags \|= SCRIPT_ENABLE_SCHNORR_MULTISIG;
	flags \|= SCRIPT_VERIFY_MINIMALDATA;
	}

	if (IsPhononEnabled(params, pindex)) {
	flags \|= SCRIPT_ENFORCE_SIGCHECKS;
	}

	// We make sure this node will have replay protection during the next hard
	// fork.
	if (IsReplayProtectionEnabled(params, pindex)) {
	flags \|= SCRIPT_ENABLE_REPLAY_PROTECTION;
	}

	return flags;
	}

	static int64_t nTimeCheck = 0;
	static int64_t nTimeForks = 0;
	static int64_t nTimeVerify = 0;
	static int64_t nTimeConnect = 0;
	static int64_t nTimeIndex = 0;
	static int64_t nTimeTotal = 0;
	static int64_t nBlocksTotal = 0;

	/**
	* Apply the effects of this block (with given index) on the UTXO set
	* represented by coins. Validity checks that depend on the UTXO set are also
	* done; ConnectBlock() can fail if those validity checks fail (among other
	* reasons).
	*/
	bool Chainstate::ConnectBlock(const CBlock &block, BlockValidationState &state,
	CBlockIndex *pindex, CCoinsViewCache &view,
	BlockValidationOptions options, Amount *blockFees,
	bool fJustCheck) {
	AssertLockHeld(cs_main);
	assert(pindex);

	const BlockHash block_hash{block.GetHash()};
	assert(*pindex->phashBlock == block_hash);

	int64_t nTimeStart = GetTimeMicros();

	const CChainParams &params{m_chainman.GetParams()};
	const Consensus::Params &consensusParams = params.GetConsensus();

	// Check it again in case a previous version let a bad block in
	// NOTE: We don't currently (re-)invoke ContextualCheckBlock() or
	// ContextualCheckBlockHeader() here. This means that if we add a new
	// consensus rule that is enforced in one of those two functions, then we
	// may have let in a block that violates the rule prior to updating the
	// software, and we would NOT be enforcing the rule here. Fully solving
	// upgrade from one software version to the next after a consensus rule
	// change is potentially tricky and issue-specific.
	// Also, currently the rule against blocks more than 2 hours in the future
	// is enforced in ContextualCheckBlockHeader(); we wouldn't want to
	// re-enforce that rule here (at least until we make it impossible for
	// m_adjusted_time_callback() to go backward).
	if (!CheckBlock(block, state, consensusParams,
	options.withCheckPoW(!fJustCheck)
	.withCheckMerkleRoot(!fJustCheck))) {
	if (state.GetResult() == BlockValidationResult::BLOCK_MUTATED) {
	// We don't write down blocks to disk if they may have been
	// corrupted, so this should be impossible unless we're having
	// hardware problems.
	return AbortNode(state, "Corrupt block found indicating potential "
	"hardware failure; shutting down");
	}
	return error("%s: Consensus::CheckBlock: %s", __func__,
	state.ToString());
	}

	// Verify that the view's current state corresponds to the previous block
	BlockHash hashPrevBlock =
	pindex->pprev == nullptr ? BlockHash() : pindex->pprev->GetBlockHash();
	assert(hashPrevBlock == view.GetBestBlock());

	nBlocksTotal++;

	// Special case for the genesis block, skipping connection of its
	// transactions (its coinbase is unspendable)
	if (block_hash == consensusParams.hashGenesisBlock) {
	if (!fJustCheck) {
	view.SetBestBlock(pindex->GetBlockHash());
	}

	return true;
	}

	bool fScriptChecks = true;
	if (!hashAssumeValid.IsNull()) {
	// We've been configured with the hash of a block which has been
	// externally verified to have a valid history. A suitable default value
	// is included with the software and updated from time to time. Because
	// validity relative to a piece of software is an objective fact these
	// defaults can be easily reviewed. This setting doesn't force the
	// selection of any particular chain but makes validating some faster by
	// effectively caching the result of part of the verification.
	BlockMap::const_iterator it =
	m_blockman.m_block_index.find(hashAssumeValid);
	if (it != m_blockman.m_block_index.end()) {
	if (it->second.GetAncestor(pindex->nHeight) == pindex &&
	m_chainman.m_best_header->GetAncestor(pindex->nHeight) ==
	pindex &&
	m_chainman.m_best_header->nChainWork >= nMinimumChainWork) {
	// This block is a member of the assumed verified chain and an
	// ancestor of the best header.
	// Script verification is skipped when connecting blocks under
	// the assumevalid block. Assuming the assumevalid block is
	// valid this is safe because block merkle hashes are still
	// computed and checked, Of course, if an assumed valid block is
	// invalid due to false scriptSigs this optimization would allow
	// an invalid chain to be accepted.
	// The equivalent time check discourages hash power from
	// extorting the network via DOS attack into accepting an
	// invalid block through telling users they must manually set
	// assumevalid. Requiring a software change or burying the
	// invalid block, regardless of the setting, makes it hard to
	// hide the implication of the demand. This also avoids having
	// release candidates that are hardly doing any signature
	// verification at all in testing without having to artificially
	// set the default assumed verified block further back. The test
	// against nMinimumChainWork prevents the skipping when denied
	// access to any chain at least as good as the expected chain.
	fScriptChecks = (GetBlockProofEquivalentTime(
	m_chainman.m_best_header, pindex,
	*m_chainman.m_best_header,
	consensusParams) <= 60 * 60 * 24 * 7 * 2);
	}
	}
	}

	int64_t nTime1 = GetTimeMicros();
	nTimeCheck += nTime1 - nTimeStart;
	LogPrint(BCLog::BENCH, " - Sanity checks: %.2fms [%.2fs (%.2fms/blk)]\n",
	MILLI * (nTime1 - nTimeStart), nTimeCheck * MICRO,
	nTimeCheck * MILLI / nBlocksTotal);

	// Do not allow blocks that contain transactions which 'overwrite' older
	// transactions, unless those are already completely spent. If such
	// overwrites are allowed, coinbases and transactions depending upon those
	// can be duplicated to remove the ability to spend the first instance --
	// even after being sent to another address.
	// See BIP30, CVE-2012-1909, and http://r6.ca/blog/20120206T005236Z.html
	// for more information. This rule was originally applied to all blocks
	// with a timestamp after March 15, 2012, 0:00 UTC. Now that the whole
	// chain is irreversibly beyond that time it is applied to all blocks
	// except the two in the chain that violate it. This prevents exploiting
	// the issue against nodes during their initial block download.
	bool fEnforceBIP30 = !((pindex->nHeight == 91842 &&
	pindex->GetBlockHash() ==
	uint256S("0x00000000000a4d0a398161ffc163c503763"
	"b1f4360639393e0e4c8e300e0caec")) \|\|
	(pindex->nHeight == 91880 &&
	pindex->GetBlockHash() ==
	uint256S("0x00000000000743f190a18c5577a3c2d2a1f"
	"610ae9601ac046a38084ccb7cd721")));

	// Once BIP34 activated it was not possible to create new duplicate
	// coinbases and thus other than starting with the 2 existing duplicate
	// coinbase pairs, not possible to create overwriting txs. But by the time
	// BIP34 activated, in each of the existing pairs the duplicate coinbase had
	// overwritten the first before the first had been spent. Since those
	// coinbases are sufficiently buried it's no longer possible to create
	// further duplicate transactions descending from the known pairs either. If
	// we're on the known chain at height greater than where BIP34 activated, we
	// can save the db accesses needed for the BIP30 check.

	// BIP34 requires that a block at height X (block X) has its coinbase
	// scriptSig start with a CScriptNum of X (indicated height X). The above
	// logic of no longer requiring BIP30 once BIP34 activates is flawed in the
	// case that there is a block X before the BIP34 height of 227,931 which has
	// an indicated height Y where Y is greater than X. The coinbase for block
	// X would also be a valid coinbase for block Y, which could be a BIP30
	// violation. An exhaustive search of all mainnet coinbases before the
	// BIP34 height which have an indicated height greater than the block height
	// reveals many occurrences. The 3 lowest indicated heights found are
	// 209,921, 490,897, and 1,983,702 and thus coinbases for blocks at these 3
	// heights would be the first opportunity for BIP30 to be violated.

	// The search reveals a great many blocks which have an indicated height
	// greater than 1,983,702, so we simply remove the optimization to skip
	// BIP30 checking for blocks at height 1,983,702 or higher. Before we reach
	// that block in another 25 years or so, we should take advantage of a
	// future consensus change to do a new and improved version of BIP34 that
	// will actually prevent ever creating any duplicate coinbases in the
	// future.
	static constexpr int BIP34_IMPLIES_BIP30_LIMIT = 1983702;

	// There is no potential to create a duplicate coinbase at block 209,921
	// because this is still before the BIP34 height and so explicit BIP30
	// checking is still active.

	// The final case is block 176,684 which has an indicated height of
	// 490,897. Unfortunately, this issue was not discovered until about 2 weeks
	// before block 490,897 so there was not much opportunity to address this
	// case other than to carefully analyze it and determine it would not be a
	// problem. Block 490,897 was, in fact, mined with a different coinbase than
	// block 176,684, but it is important to note that even if it hadn't been or
	// is remined on an alternate fork with a duplicate coinbase, we would still
	// not run into a BIP30 violation. This is because the coinbase for 176,684
	// is spent in block 185,956 in transaction
	// d4f7fbbf92f4a3014a230b2dc70b8058d02eb36ac06b4a0736d9d60eaa9e8781. This
	// spending transaction can't be duplicated because it also spends coinbase
	// 0328dd85c331237f18e781d692c92de57649529bd5edf1d01036daea32ffde29. This
	// coinbase has an indicated height of over 4.2 billion, and wouldn't be
	// duplicatable until that height, and it's currently impossible to create a
	// chain that long. Nevertheless we may wish to consider a future soft fork
	// which retroactively prevents block 490,897 from creating a duplicate
	// coinbase. The two historical BIP30 violations often provide a confusing
	// edge case when manipulating the UTXO and it would be simpler not to have
	// another edge case to deal with.

	// testnet3 has no blocks before the BIP34 height with indicated heights
	// post BIP34 before approximately height 486,000,000 and presumably will
	// be reset before it reaches block 1,983,702 and starts doing unnecessary
	// BIP30 checking again.
	assert(pindex->pprev);
	CBlockIndex *pindexBIP34height =
	pindex->pprev->GetAncestor(consensusParams.BIP34Height);
	// Only continue to enforce if we're below BIP34 activation height or the
	// block hash at that height doesn't correspond.
	fEnforceBIP30 =
	fEnforceBIP30 &&
	(!pindexBIP34height \|\|
	!(pindexBIP34height->GetBlockHash() == consensusParams.BIP34Hash));

	// TODO: Remove BIP30 checking from block height 1,983,702 on, once we have
	// a consensus change that ensures coinbases at those heights can not
	// duplicate earlier coinbases.
	if (fEnforceBIP30 \|\| pindex->nHeight >= BIP34_IMPLIES_BIP30_LIMIT) {
	for (const auto &tx : block.vtx) {
	for (size_t o = 0; o < tx->vout.size(); o++) {
	if (view.HaveCoin(COutPoint(tx->GetId(), o))) {
	LogPrintf("ERROR: ConnectBlock(): tried to overwrite "
	"transaction\n");
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"bad-txns-BIP30");
	}
	}
	}
	}

	// Enforce BIP68 (sequence locks).
	int nLockTimeFlags = 0;
	if (DeploymentActiveAt(*pindex, consensusParams,
	Consensus::DEPLOYMENT_CSV)) {
	nLockTimeFlags \|= LOCKTIME_VERIFY_SEQUENCE;
	}

	const uint32_t flags =
	GetNextBlockScriptFlags(consensusParams, pindex->pprev);

	int64_t nTime2 = GetTimeMicros();
	nTimeForks += nTime2 - nTime1;
	LogPrint(BCLog::BENCH, " - Fork checks: %.2fms [%.2fs (%.2fms/blk)]\n",
	MILLI * (nTime2 - nTime1), nTimeForks * MICRO,
	nTimeForks * MILLI / nBlocksTotal);

	std::vector<int> prevheights;
	Amount nFees = Amount::zero();
	int nInputs = 0;

	// Limit the total executed signature operations in the block, a consensus
	// rule. Tracking during the CPU-consuming part (validation of uncached
	// inputs) is per-input atomic and validation in each thread stops very
	// quickly after the limit is exceeded, so an adversary cannot cause us to
	// exceed the limit by much at all.
	CheckInputsLimiter nSigChecksBlockLimiter(
	GetMaxBlockSigChecksCount(options.getExcessiveBlockSize()));

	std::vector<TxSigCheckLimiter> nSigChecksTxLimiters;
	nSigChecksTxLimiters.resize(block.vtx.size() - 1);

	CBlockUndo blockundo;
	blockundo.vtxundo.resize(block.vtx.size() - 1);

	CCheckQueueControl<CScriptCheck> control(fScriptChecks ? &scriptcheckqueue
	: nullptr);

	// Add all outputs
	try {
	for (const auto &ptx : block.vtx) {
	AddCoins(view, *ptx, pindex->nHeight);
	}
	} catch (const std::logic_error &e) {
	// This error will be thrown from AddCoin if we try to connect a block
	// containing duplicate transactions. Such a thing should normally be
	// caught early nowadays (due to ContextualCheckBlock's CTOR
	// enforcement) however some edge cases can escape that:
	// - ContextualCheckBlock does not get re-run after saving the block to
	// disk, and older versions may have saved a weird block.
	// - its checks are not applied to pre-CTOR chains, which we might visit
	// with checkpointing off.
	LogPrintf("ERROR: ConnectBlock(): tried to overwrite transaction\n");
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"tx-duplicate");
	}

	size_t txIndex = 0;
	// nSigChecksRet may be accurate (found in cache) or 0 (checks were
	// deferred into vChecks).
	int nSigChecksRet;
	for (const auto &ptx : block.vtx) {
	const CTransaction &tx = *ptx;
	const bool isCoinBase = tx.IsCoinBase();
	nInputs += tx.vin.size();

	{
	Amount txfee = Amount::zero();
	TxValidationState tx_state;
	if (!isCoinBase &&
	!Consensus::CheckTxInputs(tx, tx_state, view, pindex->nHeight,
	txfee)) {
	// Any transaction validation failure in ConnectBlock is a block
	// consensus failure.
	state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	tx_state.GetRejectReason(),
	tx_state.GetDebugMessage());

	return error("%s: Consensus::CheckTxInputs: %s, %s", __func__,
	tx.GetId().ToString(), state.ToString());
	}
	nFees += txfee;
	}

	if (!MoneyRange(nFees)) {
	LogPrintf("ERROR: %s: accumulated fee in the block out of range.\n",
	__func__);
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"bad-txns-accumulated-fee-outofrange");
	}

	// The following checks do not apply to the coinbase.
	if (isCoinBase) {
	continue;
	}

	// Check that transaction is BIP68 final BIP68 lock checks (as
	// opposed to nLockTime checks) must be in ConnectBlock because they
	// require the UTXO set.
	prevheights.resize(tx.vin.size());
	for (size_t j = 0; j < tx.vin.size(); j++) {
	prevheights[j] = view.AccessCoin(tx.vin[j].prevout).GetHeight();
	}

	if (!SequenceLocks(tx, nLockTimeFlags, prevheights, *pindex)) {
	LogPrintf("ERROR: %s: contains a non-BIP68-final transaction\n",
	__func__);
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"bad-txns-nonfinal");
	}

	// Don't cache results if we're actually connecting blocks (still
	// consult the cache, though).
	bool fCacheResults = fJustCheck;

	const bool fEnforceSigCheck = flags & SCRIPT_ENFORCE_SIGCHECKS;
	if (!fEnforceSigCheck) {
	// Historically, there has been transactions with a very high
	// sigcheck count, so we need to disable this check for such
	// transactions.
	nSigChecksTxLimiters[txIndex] = TxSigCheckLimiter::getDisabled();
	}

	std::vector<CScriptCheck> vChecks;
	TxValidationState tx_state;
	if (fScriptChecks &&
	!CheckInputScripts(tx, tx_state, view, flags, fCacheResults,
	fCacheResults, PrecomputedTransactionData(tx),
	nSigChecksRet, nSigChecksTxLimiters[txIndex],
	&nSigChecksBlockLimiter, &vChecks)) {
	// Any transaction validation failure in ConnectBlock is a block
	// consensus failure
	state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	tx_state.GetRejectReason(),
	tx_state.GetDebugMessage());
	return error(
	"ConnectBlock(): CheckInputScripts on %s failed with %s",
	tx.GetId().ToString(), state.ToString());
	}

	control.Add(vChecks);

	// Note: this must execute in the same iteration as CheckTxInputs (not
	// in a separate loop) in order to detect double spends. However,
	// this does not prevent double-spending by duplicated transaction
	// inputs in the same transaction (cf. CVE-2018-17144) -- that check is
	// done in CheckBlock (CheckRegularTransaction).
	SpendCoins(view, tx, blockundo.vtxundo.at(txIndex), pindex->nHeight);
	txIndex++;
	}

	int64_t nTime3 = GetTimeMicros();
	nTimeConnect += nTime3 - nTime2;
	LogPrint(BCLog::BENCH,
	" - Connect %u transactions: %.2fms (%.3fms/tx, %.3fms/txin) "
	"[%.2fs (%.2fms/blk)]\n",
	(unsigned)block.vtx.size(), MILLI * (nTime3 - nTime2),
	MILLI * (nTime3 - nTime2) / block.vtx.size(),
	nInputs <= 1 ? 0 : MILLI * (nTime3 - nTime2) / (nInputs - 1),
	nTimeConnect * MICRO, nTimeConnect * MILLI / nBlocksTotal);

	const Amount blockReward =
	nFees + GetBlockSubsidy(pindex->nHeight, consensusParams);
	if (block.vtx[0]->GetValueOut() > blockReward) {
	LogPrintf("ERROR: ConnectBlock(): coinbase pays too much (actual=%d vs "
	"limit=%d)\n",
	block.vtx[0]->GetValueOut(), blockReward);
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"bad-cb-amount");
	}

	if (blockFees) {
	*blockFees = nFees;
	}

	if (!control.Wait()) {
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"blk-bad-inputs", "parallel script check failed");
	}

	int64_t nTime4 = GetTimeMicros();
	nTimeVerify += nTime4 - nTime2;
	LogPrint(
	BCLog::BENCH,
	" - Verify %u txins: %.2fms (%.3fms/txin) [%.2fs (%.2fms/blk)]\n",
	nInputs - 1, MILLI * (nTime4 - nTime2),
	nInputs <= 1 ? 0 : MILLI * (nTime4 - nTime2) / (nInputs - 1),
	nTimeVerify * MICRO, nTimeVerify * MILLI / nBlocksTotal);

	if (fJustCheck) {
	return true;
	}

	if (!m_blockman.WriteUndoDataForBlock(blockundo, state, pindex, params)) {
	return false;
	}

	if (!pindex->IsValid(BlockValidity::SCRIPTS)) {
	pindex->RaiseValidity(BlockValidity::SCRIPTS);
	m_blockman.m_dirty_blockindex.insert(pindex);
	}

	assert(pindex->phashBlock);
	// add this block to the view's block chain
	view.SetBestBlock(pindex->GetBlockHash());

	int64_t nTime5 = GetTimeMicros();
	nTimeIndex += nTime5 - nTime4;
	LogPrint(BCLog::BENCH, " - Index writing: %.2fms [%.2fs (%.2fms/blk)]\n",
	MILLI * (nTime5 - nTime4), nTimeIndex * MICRO,
	nTimeIndex * MILLI / nBlocksTotal);

	TRACE6(validation, block_connected, block_hash.data(), pindex->nHeight,
	block.vtx.size(), nInputs, nSigChecksRet,
	// in microseconds (µs)
	nTime5 - nTimeStart);

	return true;
	}

	CoinsCacheSizeState Chainstate::GetCoinsCacheSizeState() {
	AssertLockHeld(::cs_main);
	return this->GetCoinsCacheSizeState(m_coinstip_cache_size_bytes,
	m_mempool ? m_mempool->m_max_size_bytes
	: 0);
	}

	CoinsCacheSizeState
	Chainstate::GetCoinsCacheSizeState(size_t max_coins_cache_size_bytes,
	size_t max_mempool_size_bytes) {
	AssertLockHeld(::cs_main);
	int64_t nMempoolUsage = m_mempool ? m_mempool->DynamicMemoryUsage() : 0;
	int64_t cacheSize = CoinsTip().DynamicMemoryUsage();
	int64_t nTotalSpace =
	max_coins_cache_size_bytes +
	std::max<int64_t>(int64_t(max_mempool_size_bytes) - nMempoolUsage, 0);

	//! No need to periodic flush if at least this much space still available.
	static constexpr int64_t MAX_BLOCK_COINSDB_USAGE_BYTES =
	10 * 1024 * 1024; // 10MB
	int64_t large_threshold = std::max(
	(9 * nTotalSpace) / 10, nTotalSpace - MAX_BLOCK_COINSDB_USAGE_BYTES);

	if (cacheSize > nTotalSpace) {
	LogPrintf("Cache size (%s) exceeds total space (%s)\n", cacheSize,
	nTotalSpace);
	return CoinsCacheSizeState::CRITICAL;
	} else if (cacheSize > large_threshold) {
	return CoinsCacheSizeState::LARGE;
	}
	return CoinsCacheSizeState::OK;
	}

	bool Chainstate::FlushStateToDisk(BlockValidationState &state,
	FlushStateMode mode, int nManualPruneHeight) {
	LOCK(cs_main);
	assert(this->CanFlushToDisk());
	std::set<int> setFilesToPrune;
	bool full_flush_completed = false;

	const size_t coins_count = CoinsTip().GetCacheSize();
	const size_t coins_mem_usage = CoinsTip().DynamicMemoryUsage();

	try {
	{
	bool fFlushForPrune = false;
	bool fDoFullFlush = false;

	CoinsCacheSizeState cache_state = GetCoinsCacheSizeState();
	LOCK(m_blockman.cs_LastBlockFile);
	if (m_blockman.IsPruneMode() &&
	(m_blockman.m_check_for_pruning \|\| nManualPruneHeight > 0) &&
	!fReindex) {
	// Make sure we don't prune above the blockfilterindexes
	// bestblocks. Pruning is height-based.
	int last_prune = m_chain.Height();
	ForEachBlockFilterIndex([&](BlockFilterIndex &index) {
	last_prune = std::max(
	1, std::min(last_prune,
	index.GetSummary().best_block_height));
	});

	if (nManualPruneHeight > 0) {
	LOG_TIME_MILLIS_WITH_CATEGORY(
	"find files to prune (manual)", BCLog::BENCH);
	m_blockman.FindFilesToPruneManual(
	setFilesToPrune,
	std::min(last_prune, nManualPruneHeight),
	m_chain.Height());
	} else {
	LOG_TIME_MILLIS_WITH_CATEGORY("find files to prune",
	BCLog::BENCH);
	m_blockman.FindFilesToPrune(
	setFilesToPrune,
	m_chainman.GetParams().PruneAfterHeight(),
	m_chain.Height(), last_prune, IsInitialBlockDownload());
	m_blockman.m_check_for_pruning = false;
	}
	if (!setFilesToPrune.empty()) {
	fFlushForPrune = true;
	if (!m_blockman.m_have_pruned) {
	m_blockman.m_block_tree_db->WriteFlag(
	"prunedblockfiles", true);
	m_blockman.m_have_pruned = true;
	}
	}
	}
	const auto nNow = GetTime<std::chrono::microseconds>();
	// Avoid writing/flushing immediately after startup.
	if (m_last_write.count() == 0) {
	m_last_write = nNow;
	}
	if (m_last_flush.count() == 0) {
	m_last_flush = nNow;
	}
	// The cache is large and we're within 10% and 10 MiB of the limit,
	// but we have time now (not in the middle of a block processing).
	bool fCacheLarge = mode == FlushStateMode::PERIODIC &&
	cache_state >= CoinsCacheSizeState::LARGE;
	// The cache is over the limit, we have to write now.
	bool fCacheCritical = mode == FlushStateMode::IF_NEEDED &&
	cache_state >= CoinsCacheSizeState::CRITICAL;
	// It's been a while since we wrote the block index to disk. Do this
	// frequently, so we don't need to redownload after a crash.
	bool fPeriodicWrite = mode == FlushStateMode::PERIODIC &&
	nNow > m_last_write + DATABASE_WRITE_INTERVAL;
	// It's been very long since we flushed the cache. Do this
	// infrequently, to optimize cache usage.
	bool fPeriodicFlush = mode == FlushStateMode::PERIODIC &&
	nNow > m_last_flush + DATABASE_FLUSH_INTERVAL;
	// Combine all conditions that result in a full cache flush.
	fDoFullFlush = (mode == FlushStateMode::ALWAYS) \|\| fCacheLarge \|\|
	fCacheCritical \|\| fPeriodicFlush \|\| fFlushForPrune;
	// Write blocks and block index to disk.
	if (fDoFullFlush \|\| fPeriodicWrite) {
	// Ensure we can write block index
	if (!CheckDiskSpace(gArgs.GetBlocksDirPath())) {
	return AbortNode(state, "Disk space is too low!",
	_("Disk space is too low!"));
	}

	{
	LOG_TIME_MILLIS_WITH_CATEGORY(
	"write block and undo data to disk", BCLog::BENCH);

	// First make sure all block and undo data is flushed to
	// disk.
	m_blockman.FlushBlockFile();
	}
	// Then update all block file information (which may refer to
	// block and undo files).
	{
	LOG_TIME_MILLIS_WITH_CATEGORY("write block index to disk",
	BCLog::BENCH);

	if (!m_blockman.WriteBlockIndexDB()) {
	return AbortNode(
	state, "Failed to write to block index database");
	}
	}

	// Finally remove any pruned files
	if (fFlushForPrune) {
	LOG_TIME_MILLIS_WITH_CATEGORY("unlink pruned files",
	BCLog::BENCH);

	UnlinkPrunedFiles(setFilesToPrune);
	}
	m_last_write = nNow;
	}
	// Flush best chain related state. This can only be done if the
	// blocks / block index write was also done.
	if (fDoFullFlush && !CoinsTip().GetBestBlock().IsNull()) {
	LOG_TIME_MILLIS_WITH_CATEGORY(
	strprintf("write coins cache to disk (%d coins, %.2fkB)",
	coins_count, coins_mem_usage / 1000),
	BCLog::BENCH);

	// Typical Coin structures on disk are around 48 bytes in size.
	// Pushing a new one to the database can cause it to be written
	// twice (once in the log, and once in the tables). This is
	// already an overestimation, as most will delete an existing
	// entry or overwrite one. Still, use a conservative safety
	// factor of 2.
	if (!CheckDiskSpace(gArgs.GetDataDirNet(),
	48 * 2 * 2 * CoinsTip().GetCacheSize())) {
	return AbortNode(state, "Disk space is too low!",
	_("Disk space is too low!"));
	}

	// Flush the chainstate (which may refer to block index
	// entries).
	if (!CoinsTip().Flush()) {
	return AbortNode(state, "Failed to write to coin database");
	}
	m_last_flush = nNow;
	full_flush_completed = true;
	}

	TRACE5(utxocache, flush,
	// in microseconds (µs)
	GetTimeMicros() - nNow.count(), uint32_t(mode), coins_count,
	uint64_t(coins_mem_usage), fFlushForPrune);
	}

	if (full_flush_completed) {
	// Update best block in wallet (so we can detect restored wallets).
	GetMainSignals().ChainStateFlushed(m_chain.GetLocator());
	}
	} catch (const std::runtime_error &e) {
	return AbortNode(state, std::string("System error while flushing: ") +
	e.what());
	}
	return true;
	}

	void Chainstate::ForceFlushStateToDisk() {
	BlockValidationState state;
	if (!this->FlushStateToDisk(state, FlushStateMode::ALWAYS)) {
	LogPrintf("%s: failed to flush state (%s)\n", __func__,
	state.ToString());
	}
	}

	void Chainstate::PruneAndFlush() {
	BlockValidationState state;
	m_blockman.m_check_for_pruning = true;
	if (!this->FlushStateToDisk(state, FlushStateMode::NONE)) {
	LogPrintf("%s: failed to flush state (%s)\n", __func__,
	state.ToString());
	}
	}

	static void UpdateTipLog(const CCoinsViewCache &coins_tip,
	const CBlockIndex *tip, const CChainParams &params,
	const std::string &func_name,
	const std::string &prefix)
	EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
	AssertLockHeld(::cs_main);
	LogPrintf("%s%s: new best=%s height=%d version=0x%08x log2_work=%f tx=%ld "
	"date='%s' progress=%f cache=%.1fMiB(%utxo)\n",
	prefix, func_name, tip->GetBlockHash().ToString(), tip->nHeight,
	tip->nVersion, log(tip->nChainWork.getdouble()) / log(2.0),
	tip->GetChainTxCount(),
	FormatISO8601DateTime(tip->GetBlockTime()),
	GuessVerificationProgress(params.TxData(), tip),
	coins_tip.DynamicMemoryUsage() * (1.0 / (1 << 20)),
	coins_tip.GetCacheSize());
	}

	void Chainstate::UpdateTip(const CBlockIndex *pindexNew) {
	AssertLockHeld(::cs_main);
	const auto &coins_tip = CoinsTip();

	const CChainParams &params{m_chainman.GetParams()};

	// The remainder of the function isn't relevant if we are not acting on
	// the active chainstate, so return if need be.
	if (this != &m_chainman.ActiveChainstate()) {
	// Only log every so often so that we don't bury log messages at the
	// tip.
	constexpr int BACKGROUND_LOG_INTERVAL = 2000;
	if (pindexNew->nHeight % BACKGROUND_LOG_INTERVAL == 0) {
	UpdateTipLog(coins_tip, pindexNew, params, __func__,
	"[background validation] ");
	}
	return;
	}

	// New best block
	if (m_mempool) {
	m_mempool->AddTransactionsUpdated(1);
	}

	{
	LOCK(g_best_block_mutex);
	g_best_block = pindexNew->GetBlockHash();
	g_best_block_cv.notify_all();
	}

	UpdateTipLog(coins_tip, pindexNew, params, __func__, "");
	}

	/**
	* Disconnect m_chain's tip.
	* After calling, the mempool will be in an inconsistent state, with
	* transactions from disconnected blocks being added to disconnectpool. You
	* should make the mempool consistent again by calling updateMempoolForReorg.
	* with cs_main held.
	*
	* If disconnectpool is nullptr, then no disconnected transactions are added to
	* disconnectpool (note that the caller is responsible for mempool consistency
	* in any case).
	*/
	bool Chainstate::DisconnectTip(BlockValidationState &state,
	DisconnectedBlockTransactions *disconnectpool) {
	AssertLockHeld(cs_main);
	if (m_mempool) {
	AssertLockHeld(m_mempool->cs);
	}

	CBlockIndex *pindexDelete = m_chain.Tip();
	const Consensus::Params &consensusParams = m_chainman.GetConsensus();

	assert(pindexDelete);

	// Read block from disk.
	std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
	CBlock &block = *pblock;
	if (!ReadBlockFromDisk(block, pindexDelete, consensusParams)) {
	return error("DisconnectTip(): Failed to read block");
	}

	// Apply the block atomically to the chain state.
	int64_t nStart = GetTimeMicros();
	{
	CCoinsViewCache view(&CoinsTip());
	assert(view.GetBestBlock() == pindexDelete->GetBlockHash());
	if (DisconnectBlock(block, pindexDelete, view) !=
	DisconnectResult::OK) {
	return error("DisconnectTip(): DisconnectBlock %s failed",
	pindexDelete->GetBlockHash().ToString());
	}

	bool flushed = view.Flush();
	assert(flushed);
	}

	LogPrint(BCLog::BENCH, "- Disconnect block: %.2fms\n",
	(GetTimeMicros() - nStart) * MILLI);

	// Write the chain state to disk, if necessary.
	if (!FlushStateToDisk(state, FlushStateMode::IF_NEEDED)) {
	return false;
	}

	if (m_mempool) {
	// If this block is deactivating a fork, we move all mempool
	// transactions in front of disconnectpool for reprocessing in a future
	// updateMempoolForReorg call
	if (pindexDelete->pprev != nullptr &&
	GetNextBlockScriptFlags(consensusParams, pindexDelete) !=
	GetNextBlockScriptFlags(consensusParams, pindexDelete->pprev)) {
	LogPrint(BCLog::MEMPOOL,
	"Disconnecting mempool due to rewind of upgrade block\n");
	if (disconnectpool) {
	disconnectpool->importMempool(*m_mempool);
	}
	m_mempool->clear();
	}

	if (disconnectpool) {
	disconnectpool->addForBlock(block.vtx, *m_mempool);
	}
	}

	m_chain.SetTip(pindexDelete->pprev);

	UpdateTip(pindexDelete->pprev);
	// Let wallets know transactions went from 1-confirmed to
	// 0-confirmed or conflicted:
	GetMainSignals().BlockDisconnected(pblock, pindexDelete);
	return true;
	}

	static int64_t nTimeReadFromDisk = 0;
	static int64_t nTimeConnectTotal = 0;
	static int64_t nTimeFlush = 0;
	static int64_t nTimeChainState = 0;
	static int64_t nTimePostConnect = 0;

	struct PerBlockConnectTrace {
	CBlockIndex *pindex = nullptr;
	std::shared_ptr<const CBlock> pblock;
	PerBlockConnectTrace() {}
	};

	/**
	* Used to track blocks whose transactions were applied to the UTXO state as a
	* part of a single ActivateBestChainStep call.
	*
	* This class is single-use, once you call GetBlocksConnected() you have to
	* throw it away and make a new one.
	*/
	class ConnectTrace {
	private:
	std::vector<PerBlockConnectTrace> blocksConnected;

	public:
	explicit ConnectTrace() : blocksConnected(1) {}

	void BlockConnected(CBlockIndex *pindex,
	std::shared_ptr<const CBlock> pblock) {
	assert(!blocksConnected.back().pindex);
	assert(pindex);
	assert(pblock);
	blocksConnected.back().pindex = pindex;
	blocksConnected.back().pblock = std::move(pblock);
	blocksConnected.emplace_back();
	}

	std::vector<PerBlockConnectTrace> &GetBlocksConnected() {
	// We always keep one extra block at the end of our list because blocks
	// are added after all the conflicted transactions have been filled in.
	// Thus, the last entry should always be an empty one waiting for the
	// transactions from the next block. We pop the last entry here to make
	// sure the list we return is sane.
	assert(!blocksConnected.back().pindex);
	blocksConnected.pop_back();
	return blocksConnected;
	}
	};

	/**
	* Connect a new block to m_chain. pblock is either nullptr or a pointer to
	* a CBlock corresponding to pindexNew, to bypass loading it again from disk.
	*
	* The block is added to connectTrace if connection succeeds.
	*/
	bool Chainstate::ConnectTip(const Config &config, BlockValidationState &state,
	BlockPolicyValidationState &blockPolicyState,
	CBlockIndex *pindexNew,
	const std::shared_ptr<const CBlock> &pblock,
	ConnectTrace &connectTrace,
	DisconnectedBlockTransactions &disconnectpool) {
	AssertLockHeld(cs_main);
	if (m_mempool) {
	AssertLockHeld(m_mempool->cs);
	}

	const Consensus::Params &consensusParams = m_chainman.GetConsensus();

	assert(pindexNew->pprev == m_chain.Tip());
	// Read block from disk.
	int64_t nTime1 = GetTimeMicros();
	std::shared_ptr<const CBlock> pthisBlock;
	if (!pblock) {
	std::shared_ptr<CBlock> pblockNew = std::make_shared<CBlock>();
	if (!ReadBlockFromDisk(*pblockNew, pindexNew, consensusParams)) {
	return AbortNode(state, "Failed to read block");
	}
	pthisBlock = pblockNew;
	} else {
	pthisBlock = pblock;
	}

	const CBlock &blockConnecting = *pthisBlock;

	// Apply the block atomically to the chain state.
	int64_t nTime2 = GetTimeMicros();
	nTimeReadFromDisk += nTime2 - nTime1;
	int64_t nTime3;
	LogPrint(BCLog::BENCH, " - Load block from disk: %.2fms [%.2fs]\n",
	(nTime2 - nTime1) * MILLI, nTimeReadFromDisk * MICRO);
	{
	Amount blockFees{Amount::zero()};
	CCoinsViewCache view(&CoinsTip());
	bool rv = ConnectBlock(blockConnecting, state, pindexNew, view,
	BlockValidationOptions(config), &blockFees);
	GetMainSignals().BlockChecked(blockConnecting, state);
	if (!rv) {
	if (state.IsInvalid()) {
	InvalidBlockFound(pindexNew, state);
	}

	return error("%s: ConnectBlock %s failed, %s", __func__,
	pindexNew->GetBlockHash().ToString(),
	state.ToString());
	}

	/**
	* The block is valid by consensus rules so now we check if the block
	* passes all block policy checks. If not, then park the block and bail.
	*
	* We check block parking policies before flushing changes to the UTXO
	* set. This allows us to avoid rewinding everything immediately after.
	*
	* Only check block parking policies the first time the block is
	* connected. Avalanche voting can override the parking decision made by
	* these policies.
	*/
	const BlockHash blockhash = pindexNew->GetBlockHash();
	if (!IsInitialBlockDownload() &&
	!m_filterParkingPoliciesApplied.contains(blockhash)) {
	m_filterParkingPoliciesApplied.insert(blockhash);

	const Amount blockReward =
	blockFees +
	GetBlockSubsidy(pindexNew->nHeight, consensusParams);

	std::vector<std::unique_ptr<ParkingPolicy>> parkingPolicies;
	parkingPolicies.emplace_back(std::make_unique<MinerFundPolicy>(
	consensusParams, *pindexNew, blockConnecting, blockReward));

	if (g_avalanche) {
	parkingPolicies.emplace_back(
	std::make_unique<StakingRewardsPolicy>(
	consensusParams, *pindexNew, blockConnecting,
	blockReward));
	}

	// If any block policy is violated, bail on the first one found
	if (std::find_if_not(parkingPolicies.begin(), parkingPolicies.end(),
	[&](const auto &policy) {
	bool ret = (*policy)(blockPolicyState);
	if (!ret) {
	LogPrintf(
	"Park block because it "
	"violated a block policy: %s\n",
	blockPolicyState.ToString());
	}
	return ret;
	}) != parkingPolicies.end()) {
	pindexNew->nStatus = pindexNew->nStatus.withParked();
	m_blockman.m_dirty_blockindex.insert(pindexNew);
	return false;
	}
	}

	nTime3 = GetTimeMicros();
	nTimeConnectTotal += nTime3 - nTime2;
	assert(nBlocksTotal > 0);
	LogPrint(BCLog::BENCH,
	" - Connect total: %.2fms [%.2fs (%.2fms/blk)]\n",
	(nTime3 - nTime2) * MILLI, nTimeConnectTotal * MICRO,
	nTimeConnectTotal * MILLI / nBlocksTotal);
	bool flushed = view.Flush();
	assert(flushed);
	}

	int64_t nTime4 = GetTimeMicros();
	nTimeFlush += nTime4 - nTime3;
	LogPrint(BCLog::BENCH, " - Flush: %.2fms [%.2fs (%.2fms/blk)]\n",
	(nTime4 - nTime3) * MILLI, nTimeFlush * MICRO,
	nTimeFlush * MILLI / nBlocksTotal);

	// Write the chain state to disk, if necessary.
	if (!FlushStateToDisk(state, FlushStateMode::IF_NEEDED)) {
	return false;
	}

	int64_t nTime5 = GetTimeMicros();
	nTimeChainState += nTime5 - nTime4;
	LogPrint(BCLog::BENCH,
	" - Writing chainstate: %.2fms [%.2fs (%.2fms/blk)]\n",
	(nTime5 - nTime4) * MILLI, nTimeChainState * MICRO,
	nTimeChainState * MILLI / nBlocksTotal);

	// Remove conflicting transactions from the mempool.;
	if (m_mempool) {
	m_mempool->removeForBlock(blockConnecting.vtx);
	disconnectpool.removeForBlock(blockConnecting.vtx);

	// If this block is activating a fork, we move all mempool transactions
	// in front of disconnectpool for reprocessing in a future
	// updateMempoolForReorg call
	if (pindexNew->pprev != nullptr &&
	GetNextBlockScriptFlags(consensusParams, pindexNew) !=
	GetNextBlockScriptFlags(consensusParams, pindexNew->pprev)) {
	LogPrint(
	BCLog::MEMPOOL,
	"Disconnecting mempool due to acceptance of upgrade block\n");
	disconnectpool.importMempool(*m_mempool);
	}
	}

	// Update m_chain & related variables.
	m_chain.SetTip(pindexNew);
	UpdateTip(pindexNew);

	int64_t nTime6 = GetTimeMicros();
	nTimePostConnect += nTime6 - nTime5;
	nTimeTotal += nTime6 - nTime1;
	LogPrint(BCLog::BENCH,
	" - Connect postprocess: %.2fms [%.2fs (%.2fms/blk)]\n",
	(nTime6 - nTime5) * MILLI, nTimePostConnect * MICRO,
	nTimePostConnect * MILLI / nBlocksTotal);
	LogPrint(BCLog::BENCH, "- Connect block: %.2fms [%.2fs (%.2fms/blk)]\n",
	(nTime6 - nTime1) * MILLI, nTimeTotal * MICRO,
	nTimeTotal * MILLI / nBlocksTotal);

	// If we are the background validation chainstate, check to see if we are
	// done validating the snapshot (i.e. our tip has reached the snapshot's
	// base block).
	if (this != &m_chainman.ActiveChainstate()) {
	// This call may set `m_disabled`, which is referenced immediately
	// afterwards in ActivateBestChain, so that we stop connecting blocks
	// past the snapshot base.
	m_chainman.MaybeCompleteSnapshotValidation();
	}

	connectTrace.BlockConnected(pindexNew, std::move(pthisBlock));
	return true;
	}

	/**
	* Return the tip of the chain with the most work in it, that isn't known to be
	* invalid (it's however far from certain to be valid).
	*/
	CBlockIndex *Chainstate::FindMostWorkChain(
	std::vector<const CBlockIndex *> &blocksToReconcile) {
	AssertLockHeld(::cs_main);
	do {
	CBlockIndex *pindexNew = nullptr;

	// Find the best candidate header.
	{
	std::set<CBlockIndex *, CBlockIndexWorkComparator>::reverse_iterator
	it = setBlockIndexCandidates.rbegin();
	if (it == setBlockIndexCandidates.rend()) {
	return nullptr;
	}
	pindexNew = *it;
	}

	// If this block will cause an avalanche finalized block to be reorged,
	// then we park it.
	{
	LOCK(cs_avalancheFinalizedBlockIndex);
	if (m_avalancheFinalizedBlockIndex &&
	!AreOnTheSameFork(pindexNew, m_avalancheFinalizedBlockIndex)) {
	LogPrintf("Park block %s because it forks prior to the "
	"avalanche finalized chaintip.\n",
	pindexNew->GetBlockHash().ToString());
	pindexNew->nStatus = pindexNew->nStatus.withParked();
	m_blockman.m_dirty_blockindex.insert(pindexNew);
	}
	}

	const bool fAvalancheEnabled = isAvalancheEnabled(gArgs);
	const bool fAutoUnpark =
	gArgs.GetBoolArg("-automaticunparking", !fAvalancheEnabled);

	const CBlockIndex *pindexFork = m_chain.FindFork(pindexNew);

	// Check whether all blocks on the path between the currently active
	// chain and the candidate are valid. Just going until the active chain
	// is an optimization, as we know all blocks in it are valid already.
	CBlockIndex *pindexTest = pindexNew;
	bool hasValidAncestor = true;
	while (hasValidAncestor && pindexTest && pindexTest != pindexFork) {
	assert(pindexTest->HaveTxsDownloaded() \|\| pindexTest->nHeight == 0);

	// If this is a parked chain, but it has enough PoW, clear the park
	// state.
	bool fParkedChain = pindexTest->nStatus.isOnParkedChain();
	if (fAutoUnpark && fParkedChain) {
	const CBlockIndex *pindexTip = m_chain.Tip();

	// During initialization, pindexTip and/or pindexFork may be
	// null. In this case, we just ignore the fact that the chain is
	// parked.
	if (!pindexTip \|\| !pindexFork) {
	UnparkBlock(pindexTest);
	continue;
	}

	// A parked chain can be unparked if it has twice as much PoW
	// accumulated as the main chain has since the fork block.
	CBlockIndex const *pindexExtraPow = pindexTip;
	arith_uint256 requiredWork = pindexTip->nChainWork;
	switch (pindexTip->nHeight - pindexFork->nHeight) {
	// Limit the penality for depth 1, 2 and 3 to half a block
	// worth of work to ensure we don't fork accidentally.
	case 3:
	case 2:
	pindexExtraPow = pindexExtraPow->pprev;
	// FALLTHROUGH
	case 1: {
	const arith_uint256 deltaWork =
	pindexExtraPow->nChainWork - pindexFork->nChainWork;
	requiredWork += (deltaWork >> 1);
	break;
	}
	default:
	requiredWork +=
	pindexExtraPow->nChainWork - pindexFork->nChainWork;
	break;
	}

	if (pindexNew->nChainWork > requiredWork) {
	// We have enough, clear the parked state.
	LogPrintf("Unpark chain up to block %s as it has "
	"accumulated enough PoW.\n",
	pindexNew->GetBlockHash().ToString());
	fParkedChain = false;
	UnparkBlock(pindexTest);
	}
	}

	// Pruned nodes may have entries in setBlockIndexCandidates for
	// which block files have been deleted. Remove those as candidates
	// for the most work chain if we come across them; we can't switch
	// to a chain unless we have all the non-active-chain parent blocks.
	bool fInvalidChain = pindexTest->nStatus.isInvalid();
	bool fMissingData = !pindexTest->nStatus.hasData();
	if (!(fInvalidChain \|\| fParkedChain \|\| fMissingData)) {
	// The current block is acceptable, move to the parent, up to
	// the fork point.
	pindexTest = pindexTest->pprev;
	continue;
	}

	// Candidate chain is not usable (either invalid or parked or
	// missing data)
	hasValidAncestor = false;
	setBlockIndexCandidates.erase(pindexTest);

	if (fInvalidChain && (m_chainman.m_best_invalid == nullptr \|\|
	pindexNew->nChainWork >
	m_chainman.m_best_invalid->nChainWork)) {
	m_chainman.m_best_invalid = pindexNew;
	}

	if (fParkedChain && (m_chainman.m_best_parked == nullptr \|\|
	pindexNew->nChainWork >
	m_chainman.m_best_parked->nChainWork)) {
	m_chainman.m_best_parked = pindexNew;
	}

	LogPrintf("Considered switching to better tip %s but that chain "
	"contains a%s%s%s block.\n",
	pindexNew->GetBlockHash().ToString(),
	fInvalidChain ? "n invalid" : "",
	fParkedChain ? " parked" : "",
	fMissingData ? " missing-data" : "");

	CBlockIndex *pindexFailed = pindexNew;
	// Remove the entire chain from the set.
	while (pindexTest != pindexFailed) {
	if (fInvalidChain \|\| fParkedChain) {
	pindexFailed->nStatus =
	pindexFailed->nStatus.withFailedParent(fInvalidChain)
	.withParkedParent(fParkedChain);
	} else if (fMissingData) {
	// If we're missing data, then add back to
	// m_blocks_unlinked, so that if the block arrives in the
	// future we can try adding to setBlockIndexCandidates
	// again.
	m_blockman.m_blocks_unlinked.insert(
	std::make_pair(pindexFailed->pprev, pindexFailed));
	}
	setBlockIndexCandidates.erase(pindexFailed);
	pindexFailed = pindexFailed->pprev;
	}

	if (fInvalidChain \|\| fParkedChain) {
	// We discovered a new chain tip that is either parked or
	// invalid, we may want to warn.
	CheckForkWarningConditionsOnNewFork(pindexNew);
	}
	}

	if (fAvalancheEnabled && g_avalanche) {
	blocksToReconcile.push_back(pindexNew);
	}

	// We found a candidate that has valid ancestors. This is our guy.
	if (hasValidAncestor) {
	return pindexNew;
	}
	} while (true);
	}

	/**
	* Delete all entries in setBlockIndexCandidates that are worse than the current
	* tip.
	*/
	void Chainstate::PruneBlockIndexCandidates() {
	// Note that we can't delete the current block itself, as we may need to
	// return to it later in case a reorganization to a better block fails.
	auto it = setBlockIndexCandidates.begin();
	while (it != setBlockIndexCandidates.end() &&
	setBlockIndexCandidates.value_comp()(*it, m_chain.Tip())) {
	setBlockIndexCandidates.erase(it++);
	}

	// Either the current tip or a successor of it we're working towards is left
	// in setBlockIndexCandidates.
	assert(!setBlockIndexCandidates.empty());
	}

	/**
	* Try to make some progress towards making pindexMostWork the active block.
	* pblock is either nullptr or a pointer to a CBlock corresponding to
	* pindexMostWork.
	*
	* @returns true unless a system error occurred
	*/
	bool Chainstate::ActivateBestChainStep(
	const Config &config, BlockValidationState &state,
	CBlockIndex *pindexMostWork, const std::shared_ptr<const CBlock> &pblock,
	bool &fInvalidFound, ConnectTrace &connectTrace) {
	AssertLockHeld(cs_main);
	if (m_mempool) {
	AssertLockHeld(m_mempool->cs);
	}

	const CBlockIndex *pindexOldTip = m_chain.Tip();
	const CBlockIndex *pindexFork = m_chain.FindFork(pindexMostWork);

	// Disconnect active blocks which are no longer in the best chain.
	bool fBlocksDisconnected = false;
	DisconnectedBlockTransactions disconnectpool;
	while (m_chain.Tip() && m_chain.Tip() != pindexFork) {
	if (!fBlocksDisconnected) {
	// Import and clear mempool; we must do this to preserve
	// topological ordering in the mempool index. This is ok since
	// inserts into the mempool are very fast now in our new
	// implementation.
	disconnectpool.importMempool(*m_mempool);
	}

	if (!DisconnectTip(state, &disconnectpool)) {
	// This is likely a fatal error, but keep the mempool consistent,
	// just in case. Only remove from the mempool in this case.
	if (m_mempool) {
	disconnectpool.updateMempoolForReorg(config, *this, false,
	*m_mempool);
	}

	// If we're unable to disconnect a block during normal operation,
	// then that is a failure of our local system -- we should abort
	// rather than stay on a less work chain.
	AbortNode(state,
	"Failed to disconnect block; see debug.log for details");
	return false;
	}

	fBlocksDisconnected = true;
	}

	// Build list of new blocks to connect.
	std::vector<CBlockIndex *> vpindexToConnect;
	bool fContinue = true;
	int nHeight = pindexFork ? pindexFork->nHeight : -1;
	while (fContinue && nHeight != pindexMostWork->nHeight) {
	// Don't iterate the entire list of potential improvements toward the
	// best tip, as we likely only need a few blocks along the way.
	int nTargetHeight = std::min(nHeight + 32, pindexMostWork->nHeight);
	vpindexToConnect.clear();
	vpindexToConnect.reserve(nTargetHeight - nHeight);
	CBlockIndex *pindexIter = pindexMostWork->GetAncestor(nTargetHeight);
	while (pindexIter && pindexIter->nHeight != nHeight) {
	vpindexToConnect.push_back(pindexIter);
	pindexIter = pindexIter->pprev;
	}

	nHeight = nTargetHeight;

	// Connect new blocks.
	for (CBlockIndex *pindexConnect : reverse_iterate(vpindexToConnect)) {
	BlockPolicyValidationState blockPolicyState;
	if (!ConnectTip(config, state, blockPolicyState, pindexConnect,
	pindexConnect == pindexMostWork
	? pblock
	: std::shared_ptr<const CBlock>(),
	connectTrace, disconnectpool)) {
	if (state.IsInvalid()) {
	// The block violates a consensus rule.
	if (state.GetResult() !=
	BlockValidationResult::BLOCK_MUTATED) {
	InvalidChainFound(vpindexToConnect.back());
	}
	state = BlockValidationState();
	fInvalidFound = true;
	fContinue = false;
	break;
	}

	if (blockPolicyState.IsInvalid()) {
	// The block violates a policy rule.
	fContinue = false;
	break;
	}

	// A system error occurred (disk space, database error, ...).
	// Make the mempool consistent with the current tip, just in
	// case any observers try to use it before shutdown.
	if (m_mempool) {
	disconnectpool.updateMempoolForReorg(config, *this, false,
	*m_mempool);
	}
	return false;
	} else {
	PruneBlockIndexCandidates();
	if (!pindexOldTip \|\|
	m_chain.Tip()->nChainWork > pindexOldTip->nChainWork) {
	// We're in a better position than we were. Return
	// temporarily to release the lock.
	fContinue = false;
	break;
	}
	}
	}
	}

	if (m_mempool) {
	if (fBlocksDisconnected \|\| !disconnectpool.isEmpty()) {
	// If any blocks were disconnected, we need to update the mempool
	// even if disconnectpool is empty. The disconnectpool may also be
	// non-empty if the mempool was imported due to new validation rules
	// being in effect.
	LogPrint(BCLog::MEMPOOL,
	"Updating mempool due to reorganization or "
	"rules upgrade/downgrade\n");
	disconnectpool.updateMempoolForReorg(config, *this, true,
	*m_mempool);
	}

	m_mempool->check(this->CoinsTip(), this->m_chain.Height() + 1);
	}

	// Callbacks/notifications for a new best chain.
	if (fInvalidFound) {
	CheckForkWarningConditionsOnNewFork(pindexMostWork);
	} else {
	CheckForkWarningConditions();
	}

	return true;
	}

	static SynchronizationState GetSynchronizationState(bool init) {
	if (!init) {
	return SynchronizationState::POST_INIT;
	}
	if (::fReindex) {
	return SynchronizationState::INIT_REINDEX;
	}
	return SynchronizationState::INIT_DOWNLOAD;
	}

	static bool NotifyHeaderTip(Chainstate &chainstate) LOCKS_EXCLUDED(cs_main) {
	bool fNotify = false;
	bool fInitialBlockDownload = false;
	static CBlockIndex *pindexHeaderOld = nullptr;
	CBlockIndex *pindexHeader = nullptr;
	{
	LOCK(cs_main);
	pindexHeader = chainstate.m_chainman.m_best_header;

	if (pindexHeader != pindexHeaderOld) {
	fNotify = true;
	fInitialBlockDownload = chainstate.IsInitialBlockDownload();
	pindexHeaderOld = pindexHeader;
	}
	}

	// Send block tip changed notifications without cs_main
	if (fNotify) {
	uiInterface.NotifyHeaderTip(
	GetSynchronizationState(fInitialBlockDownload),
	pindexHeader->nHeight, pindexHeader->nTime, false);
	}
	return fNotify;
	}

	static void LimitValidationInterfaceQueue() LOCKS_EXCLUDED(cs_main) {
	AssertLockNotHeld(cs_main);

	if (GetMainSignals().CallbacksPending() > 10) {
	SyncWithValidationInterfaceQueue();
	}
	}

	bool Chainstate::ActivateBestChain(const Config &config,
	BlockValidationState &state,
	std::shared_ptr<const CBlock> pblock) {
	AssertLockNotHeld(m_chainstate_mutex);

	// Note that while we're often called here from ProcessNewBlock, this is
	// far from a guarantee. Things in the P2P/RPC will often end up calling
	// us in the middle of ProcessNewBlock - do not assume pblock is set
	// sanely for performance or correctness!
	AssertLockNotHeld(::cs_main);

	// ABC maintains a fair degree of expensive-to-calculate internal state
	// because this function periodically releases cs_main so that it does not
	// lock up other threads for too long during large connects - and to allow
	// for e.g. the callback queue to drain we use m_chainstate_mutex to enforce
	// mutual exclusion so that only one caller may execute this function at a
	// time
	LOCK(m_chainstate_mutex);

	// Belt-and-suspenders check that we aren't attempting to advance the
	// background chainstate past the snapshot base block.
	if (WITH_LOCK(::cs_main, return m_disabled)) {
	LogPrintf("m_disabled is set - this chainstate should not be in "
	"operation. Please report this as a bug. %s\n",
	PACKAGE_BUGREPORT);
	return false;
	}

	CBlockIndex *pindexMostWork = nullptr;
	CBlockIndex *pindexNewTip = nullptr;
	int nStopAtHeight = gArgs.GetIntArg("-stopatheight", DEFAULT_STOPATHEIGHT);
	do {
	// Block until the validation queue drains. This should largely
	// never happen in normal operation, however may happen during
	// reindex, causing memory blowup if we run too far ahead.
	// Note that if a validationinterface callback ends up calling
	// ActivateBestChain this may lead to a deadlock! We should
	// probably have a DEBUG_LOCKORDER test for this in the future.
	LimitValidationInterfaceQueue();

	std::vector<const CBlockIndex *> blocksToReconcile;
	bool blocks_connected = false;

	{
	LOCK(cs_main);
	// Lock transaction pool for at least as long as it takes for
	// connectTrace to be consumed
	LOCK(MempoolMutex());
	CBlockIndex *starting_tip = m_chain.Tip();
	do {
	// We absolutely may not unlock cs_main until we've made forward
	// progress (with the exception of shutdown due to hardware
	// issues, low disk space, etc).

	// Destructed before cs_main is unlocked
	ConnectTrace connectTrace;

	if (pindexMostWork == nullptr) {
	pindexMostWork = FindMostWorkChain(blocksToReconcile);
	}

	// Whether we have anything to do at all.
	if (pindexMostWork == nullptr \|\|
	pindexMostWork == m_chain.Tip()) {
	break;
	}

	bool fInvalidFound = false;
	std::shared_ptr<const CBlock> nullBlockPtr;
	if (!ActivateBestChainStep(
	config, state, pindexMostWork,
	pblock && pblock->GetHash() ==
	pindexMostWork->GetBlockHash()
	? pblock
	: nullBlockPtr,
	fInvalidFound, connectTrace)) {
	// A system error occurred
	return false;
	}
	blocks_connected = true;

	if (fInvalidFound \|\|
	(pindexMostWork && pindexMostWork->nStatus.isParked())) {
	// Wipe cache, we may need another branch now.
	pindexMostWork = nullptr;
	}

	pindexNewTip = m_chain.Tip();
	for (const PerBlockConnectTrace &trace :
	connectTrace.GetBlocksConnected()) {
	assert(trace.pblock && trace.pindex);
	GetMainSignals().BlockConnected(trace.pblock, trace.pindex);
	}

	// This will have been toggled in
	// ActivateBestChainStep -> ConnectTip ->
	// MaybeCompleteSnapshotValidation, if at all, so we should
	// catch it here.
	//
	// Break this do-while to ensure we don't advance past the base
	// snapshot.
	if (m_disabled) {
	break;
	}
	} while (!m_chain.Tip() \|\|
	(starting_tip && CBlockIndexWorkComparator()(
	m_chain.Tip(), starting_tip)));

	// Check the index once we're done with the above loop, since
	// we're going to release cs_main soon. If the index is in a bad
	// state now, then it's better to know immediately rather than
	// randomly have it cause a problem in a race.
	CheckBlockIndex();

	if (blocks_connected) {
	const CBlockIndex *pindexFork = m_chain.FindFork(starting_tip);
	bool fInitialDownload = IsInitialBlockDownload();

	// Notify external listeners about the new tip.
	// Enqueue while holding cs_main to ensure that UpdatedBlockTip
	// is called in the order in which blocks are connected
	if (pindexFork != pindexNewTip) {
	// Notify ValidationInterface subscribers
	GetMainSignals().UpdatedBlockTip(pindexNewTip, pindexFork,
	fInitialDownload);

	// Always notify the UI if a new block tip was connected
	uiInterface.NotifyBlockTip(
	GetSynchronizationState(fInitialDownload),
	pindexNewTip);
	}
	}
	}
	// When we reach this point, we switched to a new tip (stored in
	// pindexNewTip).
	if (g_avalanche) {
	for (const CBlockIndex *pindex : blocksToReconcile) {
	g_avalanche->addToReconcile(pindex);
	g_avalanche->computeStakingReward(pindex);
	}
	}

	if (!blocks_connected) {
	return true;
	}

	if (nStopAtHeight && pindexNewTip &&
	pindexNewTip->nHeight >= nStopAtHeight) {
	StartShutdown();
	}

	if (WITH_LOCK(::cs_main, return m_disabled)) {
	// Background chainstate has reached the snapshot base block, so
	// exit.
	break;
	}

	// We check shutdown only after giving ActivateBestChainStep a chance to
	// run once so that we never shutdown before connecting the genesis
	// block during LoadChainTip(). Previously this caused an assert()
	// failure during shutdown in such cases as the UTXO DB flushing checks
	// that the best block hash is non-null.
	if (ShutdownRequested()) {
	break;
	}
	} while (pindexNewTip != pindexMostWork);

	// Write changes periodically to disk, after relay.
	if (!FlushStateToDisk(state, FlushStateMode::PERIODIC)) {
	return false;
	}

	return true;
	}

	bool Chainstate::PreciousBlock(const Config &config,
	BlockValidationState &state,
	CBlockIndex *pindex) {
	AssertLockNotHeld(m_chainstate_mutex);
	AssertLockNotHeld(::cs_main);
	{
	LOCK(cs_main);
	if (pindex->nChainWork < m_chain.Tip()->nChainWork) {
	// Nothing to do, this block is not at the tip.
	return true;
	}

	if (m_chain.Tip()->nChainWork > nLastPreciousChainwork) {
	// The chain has been extended since the last call, reset the
	// counter.
	nBlockReverseSequenceId = -1;
	}

	nLastPreciousChainwork = m_chain.Tip()->nChainWork;
	setBlockIndexCandidates.erase(pindex);
	pindex->nSequenceId = nBlockReverseSequenceId;
	if (nBlockReverseSequenceId > std::numeric_limits<int32_t>::min()) {
	// We can't keep reducing the counter if somebody really wants to
	// call preciousblock 2**31-1 times on the same set of tips...
	nBlockReverseSequenceId--;
	}

	// In case this was parked, unpark it.
	UnparkBlock(pindex);

	// Make sure it is added to the candidate list if appropriate.
	if (pindex->IsValid(BlockValidity::TRANSACTIONS) &&
	pindex->HaveTxsDownloaded()) {
	setBlockIndexCandidates.insert(pindex);
	PruneBlockIndexCandidates();
	}
	}

	return ActivateBestChain(config, state);
	}

	namespace {
	// Leverage RAII to run a functor at scope end
	template <typename Func> struct Defer {
	Func func;
	Defer(Func &&f) : func(std::move(f)) {}
	~Defer() { func(); }
	};
	} // namespace

	bool Chainstate::UnwindBlock(const Config &config, BlockValidationState &state,
	CBlockIndex *pindex, bool invalidate) {
	// Genesis block can't be invalidated or parked
	assert(pindex);
	if (pindex->nHeight == 0) {
	return false;
	}

	CBlockIndex *to_mark_failed_or_parked = pindex;
	bool pindex_was_in_chain = false;
	int disconnected = 0;

	// We do not allow ActivateBestChain() to run while UnwindBlock() is
	// running, as that could cause the tip to change while we disconnect
	// blocks. (Note for backport of Core PR16849: we acquire
	// LOCK(m_chainstate_mutex) in the Park, Invalidate and FinalizeBlock
	// functions due to differences in our code)
	AssertLockHeld(m_chainstate_mutex);

	// We'll be acquiring and releasing cs_main below, to allow the validation
	// callbacks to run. However, we should keep the block index in a
	// consistent state as we disconnect blocks -- in particular we need to
	// add equal-work blocks to setBlockIndexCandidates as we disconnect.
	// To avoid walking the block index repeatedly in search of candidates,
	// build a map once so that we can look up candidate blocks by chain
	// work as we go.
	std::multimap<const arith_uint256, CBlockIndex *> candidate_blocks_by_work;

	{
	LOCK(cs_main);
	for (auto &entry : m_blockman.m_block_index) {
	CBlockIndex *candidate = &entry.second;
	// We don't need to put anything in our active chain into the
	// multimap, because those candidates will be found and considered
	// as we disconnect.
	// Instead, consider only non-active-chain blocks that have at
	// least as much work as where we expect the new tip to end up.
	if (!m_chain.Contains(candidate) &&
	!CBlockIndexWorkComparator()(candidate, pindex->pprev) &&
	candidate->IsValid(BlockValidity::TRANSACTIONS) &&
	candidate->HaveTxsDownloaded()) {
	candidate_blocks_by_work.insert(
	std::make_pair(candidate->nChainWork, candidate));
	}
	}
	}

	{
	LOCK(cs_main);
	// Lock for as long as disconnectpool is in scope to make sure
	// UpdateMempoolForReorg is called after DisconnectTip without unlocking
	// in between
	LOCK(MempoolMutex());

	constexpr int maxDisconnectPoolBlocks = 10;
	bool ret = false;
	DisconnectedBlockTransactions disconnectpool;
	// After 10 blocks this becomes nullptr, so that DisconnectTip will
	// stop giving us unwound block txs if we are doing a deep unwind.
	DisconnectedBlockTransactions *optDisconnectPool = &disconnectpool;

	// Disable thread safety analysis because we can't require m_mempool->cs
	// as m_mempool can be null. We keep the runtime analysis though.
	Defer deferred([&]() NO_THREAD_SAFETY_ANALYSIS {
	AssertLockHeld(cs_main);
	if (m_mempool && !disconnectpool.isEmpty()) {
	AssertLockHeld(m_mempool->cs);
	// DisconnectTip will add transactions to disconnectpool.
	// When all unwinding is done and we are on a new tip, we must
	// add all transactions back to the mempool against the new tip.
	disconnectpool.updateMempoolForReorg(config, *this,
	/* fAddToMempool = */ ret,
	*m_mempool);
	}
	});

	// Disconnect (descendants of) pindex, and mark them invalid.
	while (true) {
	if (ShutdownRequested()) {
	break;
	}

	// Make sure the queue of validation callbacks doesn't grow
	// unboundedly.
	// FIXME this commented code is a regression and could cause OOM if
	// a very old block is invalidated via the invalidateblock RPC.
	// This can be uncommented if the main signals are moved away from
	// cs_main or this code is refactored so that cs_main can be
	// released at this point.
	//
	// LimitValidationInterfaceQueue();

	if (!m_chain.Contains(pindex)) {
	break;
	}

	if (m_mempool && disconnected == 0) {
	// On first iteration, we grab all the mempool txs to preserve
	// topological ordering. This has the side-effect of temporarily
	// clearing the mempool, but we will re-add later in
	// updateMempoolForReorg() (above). This technique guarantees
	// mempool consistency as well as ensures that our topological
	// entry_id index is always correct.
	disconnectpool.importMempool(*m_mempool);
	}

	pindex_was_in_chain = true;
	CBlockIndex *invalid_walk_tip = m_chain.Tip();

	// ActivateBestChain considers blocks already in m_chain
	// unconditionally valid already, so force disconnect away from it.

	ret = DisconnectTip(state, optDisconnectPool);
	++disconnected;

	if (optDisconnectPool && disconnected > maxDisconnectPoolBlocks) {
	// Stop using the disconnect pool after 10 blocks. After 10
	// blocks we no longer add block tx's to the disconnectpool.
	// However, when this scope ends we will reconcile what's
	// in the pool with the new tip (in the deferred d'tor above).
	optDisconnectPool = nullptr;
	}

	if (!ret) {
	return false;
	}

	assert(invalid_walk_tip->pprev == m_chain.Tip());

	// We immediately mark the disconnected blocks as invalid.
	// This prevents a case where pruned nodes may fail to
	// invalidateblock and be left unable to start as they have no tip
	// candidates (as there are no blocks that meet the "have data and
	// are not invalid per nStatus" criteria for inclusion in
	// setBlockIndexCandidates).

	invalid_walk_tip->nStatus =
	invalidate ? invalid_walk_tip->nStatus.withFailed()
	: invalid_walk_tip->nStatus.withParked();

	m_blockman.m_dirty_blockindex.insert(invalid_walk_tip);
	setBlockIndexCandidates.insert(invalid_walk_tip->pprev);

	if (invalid_walk_tip == to_mark_failed_or_parked->pprev &&
	(invalidate ? to_mark_failed_or_parked->nStatus.hasFailed()
	: to_mark_failed_or_parked->nStatus.isParked())) {
	// We only want to mark the last disconnected block as
	// Failed (or Parked); its children need to be FailedParent (or
	// ParkedParent) instead.
	to_mark_failed_or_parked->nStatus =
	(invalidate
	? to_mark_failed_or_parked->nStatus.withFailed(false)
	.withFailedParent()
	: to_mark_failed_or_parked->nStatus.withParked(false)
	.withParkedParent());

	m_blockman.m_dirty_blockindex.insert(to_mark_failed_or_parked);
	}

	// Add any equal or more work headers to setBlockIndexCandidates
	auto candidate_it = candidate_blocks_by_work.lower_bound(
	invalid_walk_tip->pprev->nChainWork);
	while (candidate_it != candidate_blocks_by_work.end()) {
	if (!CBlockIndexWorkComparator()(candidate_it->second,
	invalid_walk_tip->pprev)) {
	setBlockIndexCandidates.insert(candidate_it->second);
	candidate_it = candidate_blocks_by_work.erase(candidate_it);
	} else {
	++candidate_it;
	}
	}

	// Track the last disconnected block, so we can correct its
	// FailedParent (or ParkedParent) status in future iterations, or,
	// if it's the last one, call InvalidChainFound on it.
	to_mark_failed_or_parked = invalid_walk_tip;
	}
	}

	CheckBlockIndex();

	{
	LOCK(cs_main);
	if (m_chain.Contains(to_mark_failed_or_parked)) {
	// If the to-be-marked invalid block is in the active chain,
	// something is interfering and we can't proceed.
	return false;
	}

	// Mark pindex (or the last disconnected block) as invalid (or parked),
	// even when it never was in the main chain.
	to_mark_failed_or_parked->nStatus =
	invalidate ? to_mark_failed_or_parked->nStatus.withFailed()
	: to_mark_failed_or_parked->nStatus.withParked();
	m_blockman.m_dirty_blockindex.insert(to_mark_failed_or_parked);
	if (invalidate) {
	m_chainman.m_failed_blocks.insert(to_mark_failed_or_parked);
	}

	// If any new blocks somehow arrived while we were disconnecting
	// (above), then the pre-calculation of what should go into
	// setBlockIndexCandidates may have missed entries. This would
	// technically be an inconsistency in the block index, but if we clean
	// it up here, this should be an essentially unobservable error.
	// Loop back over all block index entries and add any missing entries
	// to setBlockIndexCandidates.
	for (auto &[_, block_index] : m_blockman.m_block_index) {
	if (block_index.IsValid(BlockValidity::TRANSACTIONS) &&
	block_index.HaveTxsDownloaded() &&
	!setBlockIndexCandidates.value_comp()(&block_index,
	m_chain.Tip())) {
	setBlockIndexCandidates.insert(&block_index);
	}
	}

	if (invalidate) {
	InvalidChainFound(to_mark_failed_or_parked);
	}
	}

	// Only notify about a new block tip if the active chain was modified.
	if (pindex_was_in_chain) {
	uiInterface.NotifyBlockTip(
	GetSynchronizationState(IsInitialBlockDownload()),
	to_mark_failed_or_parked->pprev);
	}
	return true;
	}

	bool Chainstate::InvalidateBlock(const Config &config,
	BlockValidationState &state,
	CBlockIndex *pindex) {
	AssertLockNotHeld(m_chainstate_mutex);
	AssertLockNotHeld(::cs_main);
	// See 'Note for backport of Core PR16849' in Chainstate::UnwindBlock
	LOCK(m_chainstate_mutex);

	return UnwindBlock(config, state, pindex, true);
	}

	bool Chainstate::ParkBlock(const Config &config, BlockValidationState &state,
	CBlockIndex *pindex) {
	AssertLockNotHeld(m_chainstate_mutex);
	AssertLockNotHeld(::cs_main);
	// See 'Note for backport of Core PR16849' in Chainstate::UnwindBlock
	LOCK(m_chainstate_mutex);

	return UnwindBlock(config, state, pindex, false);
	}

	template <typename F>
	bool Chainstate::UpdateFlagsForBlock(CBlockIndex *pindexBase,
	CBlockIndex *pindex, F f) {
	BlockStatus newStatus = f(pindex->nStatus);
	if (pindex->nStatus != newStatus &&
	(!pindexBase \|\|
	pindex->GetAncestor(pindexBase->nHeight) == pindexBase)) {
	pindex->nStatus = newStatus;
	m_blockman.m_dirty_blockindex.insert(pindex);
	if (newStatus.isValid()) {
	m_chainman.m_failed_blocks.erase(pindex);
	}

	if (pindex->IsValid(BlockValidity::TRANSACTIONS) &&
	pindex->HaveTxsDownloaded() &&
	setBlockIndexCandidates.value_comp()(m_chain.Tip(), pindex)) {
	setBlockIndexCandidates.insert(pindex);
	}
	return true;
	}
	return false;
	}

	template <typename F, typename C, typename AC>
	void Chainstate::UpdateFlags(CBlockIndex pindex, CBlockIndex &pindexReset,
	F f, C fChild, AC fAncestorWasChanged) {
	AssertLockHeld(cs_main);

	// Update the current block and ancestors; while we're doing this, identify
	// which was the deepest ancestor we changed.
	CBlockIndex *pindexDeepestChanged = pindex;
	for (auto pindexAncestor = pindex; pindexAncestor != nullptr;
	pindexAncestor = pindexAncestor->pprev) {
	if (UpdateFlagsForBlock(nullptr, pindexAncestor, f)) {
	pindexDeepestChanged = pindexAncestor;
	}
	}

	if (pindexReset &&
	pindexReset->GetAncestor(pindexDeepestChanged->nHeight) ==
	pindexDeepestChanged) {
	// reset pindexReset if it had a modified ancestor.
	pindexReset = nullptr;
	}

	// Update all blocks under modified blocks.
	for (auto &[_, block_index] : m_blockman.m_block_index) {
	UpdateFlagsForBlock(pindex, &block_index, fChild);
	UpdateFlagsForBlock(pindexDeepestChanged, &block_index,
	fAncestorWasChanged);
	}
	}

	void Chainstate::ResetBlockFailureFlags(CBlockIndex *pindex) {
	AssertLockHeld(cs_main);

	UpdateFlags(
	pindex, m_chainman.m_best_invalid,
	[](const BlockStatus status) {
	return status.withClearedFailureFlags();
	},
	[](const BlockStatus status) {
	return status.withClearedFailureFlags();
	},
	[](const BlockStatus status) {
	return status.withFailedParent(false);
	});
	}

	void Chainstate::UnparkBlockImpl(CBlockIndex *pindex, bool fClearChildren) {
	AssertLockHeld(cs_main);

	UpdateFlags(
	pindex, m_chainman.m_best_parked,
	[](const BlockStatus status) {
	return status.withClearedParkedFlags();
	},
	[fClearChildren](const BlockStatus status) {
	return fClearChildren ? status.withClearedParkedFlags()
	: status.withParkedParent(false);
	},
	[](const BlockStatus status) {
	return status.withParkedParent(false);
	});
	}

	void Chainstate::UnparkBlockAndChildren(CBlockIndex *pindex) {
	return UnparkBlockImpl(pindex, true);
	}

	void Chainstate::UnparkBlock(CBlockIndex *pindex) {
	return UnparkBlockImpl(pindex, false);
	}

	bool Chainstate::AvalancheFinalizeBlock(CBlockIndex *pindex) {
	if (!pindex) {
	return false;
	}

	if (!m_chain.Contains(pindex)) {
	LogPrint(BCLog::AVALANCHE,
	"The block to mark finalized by avalanche is not on the "
	"active chain: %s\n",
	pindex->GetBlockHash().ToString());
	return false;
	}

	if (g_avalanche) {
	g_avalanche->cleanupStakingRewards(pindex->nHeight);
	}

	if (IsBlockAvalancheFinalized(pindex)) {
	return true;
	}

	{
	LOCK(cs_avalancheFinalizedBlockIndex);
	m_avalancheFinalizedBlockIndex = pindex;
	}

	GetMainSignals().BlockFinalized(pindex);

	return true;
	}

	void Chainstate::ClearAvalancheFinalizedBlock() {
	LOCK(cs_avalancheFinalizedBlockIndex);
	m_avalancheFinalizedBlockIndex = nullptr;
	}

	bool Chainstate::IsBlockAvalancheFinalized(const CBlockIndex *pindex) const {
	LOCK(cs_avalancheFinalizedBlockIndex);
	return pindex && m_avalancheFinalizedBlockIndex &&
	m_avalancheFinalizedBlockIndex->GetAncestor(pindex->nHeight) ==
	pindex;
	}

	/**
	* Mark a block as having its data received and checked (up to
	* BLOCK_VALID_TRANSACTIONS).
	*/
	void Chainstate::ReceivedBlockTransactions(const CBlock &block,
	CBlockIndex *pindexNew,
	const FlatFilePos &pos) {
	pindexNew->nTx = block.vtx.size();
	pindexNew->nSize = ::GetSerializeSize(block, PROTOCOL_VERSION);
	pindexNew->nFile = pos.nFile;
	pindexNew->nDataPos = pos.nPos;
	pindexNew->nUndoPos = 0;
	pindexNew->nStatus = pindexNew->nStatus.withData();
	pindexNew->RaiseValidity(BlockValidity::TRANSACTIONS);
	m_blockman.m_dirty_blockindex.insert(pindexNew);

	if (pindexNew->UpdateChainStats()) {
	// If pindexNew is the genesis block or all parents are
	// BLOCK_VALID_TRANSACTIONS.
	std::deque<CBlockIndex *> queue;
	queue.push_back(pindexNew);

	// Recursively process any descendant blocks that now may be eligible to
	// be connected.
	while (!queue.empty()) {
	CBlockIndex *pindex = queue.front();
	queue.pop_front();
	pindex->UpdateChainStats();
	if (pindex->nSequenceId == 0) {
	// We assign a sequence is when transaction are received to
	// prevent a miner from being able to broadcast a block but not
	// its content. However, a sequence id may have been set
	// manually, for instance via PreciousBlock, in which case, we
	// don't need to assign one.
	pindex->nSequenceId = nBlockSequenceId++;
	}

	if (m_chain.Tip() == nullptr \|\|
	!setBlockIndexCandidates.value_comp()(pindex, m_chain.Tip())) {
	setBlockIndexCandidates.insert(pindex);
	}

	std::pair<std::multimap<CBlockIndex , CBlockIndex >::iterator,
	std::multimap<CBlockIndex , CBlockIndex >::iterator>
	range = m_blockman.m_blocks_unlinked.equal_range(pindex);
	while (range.first != range.second) {
	std::multimap<CBlockIndex , CBlockIndex >::iterator it =
	range.first;
	queue.push_back(it->second);
	range.first++;
	m_blockman.m_blocks_unlinked.erase(it);
	}
	}
	} else if (pindexNew->pprev &&
	pindexNew->pprev->IsValid(BlockValidity::TREE)) {
	m_blockman.m_blocks_unlinked.insert(
	std::make_pair(pindexNew->pprev, pindexNew));
	}
	}

	/**
	* Return true if the provided block header is valid.
	* Only verify PoW if blockValidationOptions is configured to do so.
	* This allows validation of headers on which the PoW hasn't been done.
	* For example: to validate template handed to mining software.
	* Do not call this for any check that depends on the context.
	* For context-dependent calls, see ContextualCheckBlockHeader.
	*/
	static bool CheckBlockHeader(const CBlockHeader &block,
	BlockValidationState &state,
	const Consensus::Params &params,
	BlockValidationOptions validationOptions) {
	// Check proof of work matches claimed amount
	if (validationOptions.shouldValidatePoW() &&
	!CheckProofOfWork(block.GetHash(), block.nBits, params)) {
	return state.Invalid(BlockValidationResult::BLOCK_INVALID_HEADER,
	"high-hash", "proof of work failed");
	}

	return true;
	}

	bool CheckBlock(const CBlock &block, BlockValidationState &state,
	const Consensus::Params &params,
	BlockValidationOptions validationOptions) {
	// These are checks that are independent of context.
	if (block.fChecked) {
	return true;
	}

	// Check that the header is valid (particularly PoW). This is mostly
	// redundant with the call in AcceptBlockHeader.
	if (!CheckBlockHeader(block, state, params, validationOptions)) {
	return false;
	}

	// Check the merkle root.
	if (validationOptions.shouldValidateMerkleRoot()) {
	bool mutated;
	uint256 hashMerkleRoot2 = BlockMerkleRoot(block, &mutated);
	if (block.hashMerkleRoot != hashMerkleRoot2) {
	return state.Invalid(BlockValidationResult::BLOCK_MUTATED,
	"bad-txnmrklroot", "hashMerkleRoot mismatch");
	}

	// Check for merkle tree malleability (CVE-2012-2459): repeating
	// sequences of transactions in a block without affecting the merkle
	// root of a block, while still invalidating it.
	if (mutated) {
	return state.Invalid(BlockValidationResult::BLOCK_MUTATED,
	"bad-txns-duplicate", "duplicate transaction");
	}
	}

	// All potential-corruption validation must be done before we do any
	// transaction validation, as otherwise we may mark the header as invalid
	// because we receive the wrong transactions for it.

	// First transaction must be coinbase.
	if (block.vtx.empty()) {
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"bad-cb-missing", "first tx is not coinbase");
	}

	// Size limits.
	auto nMaxBlockSize = validationOptions.getExcessiveBlockSize();

	// Bail early if there is no way this block is of reasonable size.
	if ((block.vtx.size() * MIN_TRANSACTION_SIZE) > nMaxBlockSize) {
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"bad-blk-length", "size limits failed");
	}

	auto currentBlockSize = ::GetSerializeSize(block, PROTOCOL_VERSION);
	if (currentBlockSize > nMaxBlockSize) {
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"bad-blk-length", "size limits failed");
	}

	// And a valid coinbase.
	TxValidationState tx_state;
	if (!CheckCoinbase(*block.vtx[0], tx_state)) {
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	tx_state.GetRejectReason(),
	strprintf("Coinbase check failed (txid %s) %s",
	block.vtx[0]->GetId().ToString(),
	tx_state.GetDebugMessage()));
	}

	// Check transactions for regularity, skipping the first. Note that this
	// is the first time we check that all after the first are !IsCoinBase.
	for (size_t i = 1; i < block.vtx.size(); i++) {
	auto *tx = block.vtx[i].get();
	if (!CheckRegularTransaction(*tx, tx_state)) {
	return state.Invalid(
	BlockValidationResult::BLOCK_CONSENSUS,
	tx_state.GetRejectReason(),
	strprintf("Transaction check failed (txid %s) %s",
	tx->GetId().ToString(), tx_state.GetDebugMessage()));
	}
	}

	if (validationOptions.shouldValidatePoW() &&
	validationOptions.shouldValidateMerkleRoot()) {
	block.fChecked = true;
	}

	return true;
	}

	bool HasValidProofOfWork(const std::vector<CBlockHeader> &headers,
	const Consensus::Params &consensusParams) {
	return std::all_of(headers.cbegin(), headers.cend(),
	[&](const auto &header) {
	return CheckProofOfWork(
	header.GetHash(), header.nBits, consensusParams);
	});
	}

	arith_uint256 CalculateHeadersWork(const std::vector<CBlockHeader> &headers) {
	arith_uint256 total_work{0};
	for (const CBlockHeader &header : headers) {
	CBlockIndex dummy(header);
	total_work += GetBlockProof(dummy);
	}
	return total_work;
	}

	/**
	* Context-dependent validity checks.
	* By "context", we mean only the previous block headers, but not the UTXO
	* set; UTXO-related validity checks are done in ConnectBlock().
	* NOTE: This function is not currently invoked by ConnectBlock(), so we
	* should consider upgrade issues if we change which consensus rules are
	* enforced in this function (eg by adding a new consensus rule). See comment
	* in ConnectBlock().
	* Note that -reindex-chainstate skips the validation that happens here!
	*/
	static bool ContextualCheckBlockHeader(const CChainParams &params,
	const CBlockHeader &block,
	BlockValidationState &state,
	BlockManager &blockman,
	const CBlockIndex *pindexPrev,
	NodeClock::time_point now)
	EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
	AssertLockHeld(::cs_main);
	assert(pindexPrev != nullptr);
	const int nHeight = pindexPrev->nHeight + 1;

	// Check proof of work
	if (block.nBits != GetNextWorkRequired(pindexPrev, &block, params)) {
	LogPrintf("bad bits after height: %d\n", pindexPrev->nHeight);
	return state.Invalid(BlockValidationResult::BLOCK_INVALID_HEADER,
	"bad-diffbits", "incorrect proof of work");
	}

	// Check against checkpoints
	if (fCheckpointsEnabled) {
	const CCheckpointData &checkpoints = params.Checkpoints();

	// Check that the block chain matches the known block chain up to a
	// checkpoint.
	if (!Checkpoints::CheckBlock(checkpoints, nHeight, block.GetHash())) {
	LogPrint(BCLog::VALIDATION,
	"ERROR: %s: rejected by checkpoint lock-in at %d\n",
	__func__, nHeight);
	return state.Invalid(BlockValidationResult::BLOCK_CHECKPOINT,
	"checkpoint mismatch");
	}

	// Don't accept any forks from the main chain prior to last checkpoint.
	// GetLastCheckpoint finds the last checkpoint in MapCheckpoints that's
	// in our BlockIndex().

	const CBlockIndex *pcheckpoint =
	blockman.GetLastCheckpoint(checkpoints);
	if (pcheckpoint && nHeight < pcheckpoint->nHeight) {
	LogPrint(BCLog::VALIDATION,
	"ERROR: %s: forked chain older than last checkpoint "
	"(height %d)\n",
	__func__, nHeight);
	return state.Invalid(BlockValidationResult::BLOCK_CHECKPOINT,
	"bad-fork-prior-to-checkpoint");
	}
	}

	// Check timestamp against prev
	if (block.GetBlockTime() <= pindexPrev->GetMedianTimePast()) {
	return state.Invalid(BlockValidationResult::BLOCK_INVALID_HEADER,
	"time-too-old", "block's timestamp is too early");
	}

	// Check timestamp
	if (block.Time() > now + std::chrono::seconds{MAX_FUTURE_BLOCK_TIME}) {
	return state.Invalid(BlockValidationResult::BLOCK_TIME_FUTURE,
	"time-too-new",
	"block timestamp too far in the future");
	}

	const Consensus::Params &consensusParams = params.GetConsensus();
	// Reject blocks with outdated version
	if ((block.nVersion < 2 &&
	DeploymentActiveAfter(pindexPrev, consensusParams,
	Consensus::DEPLOYMENT_HEIGHTINCB)) \|\|
	(block.nVersion < 3 &&
	DeploymentActiveAfter(pindexPrev, consensusParams,
	Consensus::DEPLOYMENT_DERSIG)) \|\|
	(block.nVersion < 4 &&
	DeploymentActiveAfter(pindexPrev, consensusParams,
	Consensus::DEPLOYMENT_CLTV))) {
	return state.Invalid(
	BlockValidationResult::BLOCK_INVALID_HEADER,
	strprintf("bad-version(0x%08x)", block.nVersion),
	strprintf("rejected nVersion=0x%08x block", block.nVersion));
	}

	return true;
	}

	bool ContextualCheckTransactionForCurrentBlock(
	const CBlockIndex *active_chain_tip, const Consensus::Params &params,
	const CTransaction &tx, TxValidationState &state) {
	AssertLockHeld(cs_main);
	// TODO: Make active_chain_tip a reference
	assert(active_chain_tip);

	// ContextualCheckTransactionForCurrentBlock() uses
	// active_chain_tip.Height()+1 to evaluate nLockTime because when
	// IsFinalTx() is called within AcceptBlock(), the height of the
	// block being evaluated is what is used. Thus if we want to know if a
	// transaction can be part of the next block, we need to call
	// ContextualCheckTransaction() with one more than
	// active_chain_tip.Height().
	const int nBlockHeight = active_chain_tip->nHeight + 1;

	// BIP113 will require that time-locked transactions have nLockTime set to
	// less than the median time of the previous block they're contained in.
	// When the next block is created its previous block will be the current
	// chain tip, so we use that to calculate the median time passed to
	// ContextualCheckTransaction().
	// This time can also be used for consensus upgrades.
	const int64_t nMedianTimePast{active_chain_tip->GetMedianTimePast()};

	return ContextualCheckTransaction(params, tx, state, nBlockHeight,
	nMedianTimePast);
	}

	/**
	* NOTE: This function is not currently invoked by ConnectBlock(), so we
	* should consider upgrade issues if we change which consensus rules are
	* enforced in this function (eg by adding a new consensus rule). See comment
	* in ConnectBlock().
	* Note that -reindex-chainstate skips the validation that happens here!
	*/
	static bool ContextualCheckBlock(const CBlock &block,
	BlockValidationState &state,
	const Consensus::Params &params,
	const CBlockIndex *pindexPrev) {
	const int nHeight = pindexPrev == nullptr ? 0 : pindexPrev->nHeight + 1;

	// Enforce BIP113 (Median Time Past).
	bool enforce_locktime_median_time_past{false};
	if (DeploymentActiveAfter(pindexPrev, params, Consensus::DEPLOYMENT_CSV)) {
	assert(pindexPrev != nullptr);
	enforce_locktime_median_time_past = true;
	}

	const int64_t nMedianTimePast =
	pindexPrev == nullptr ? 0 : pindexPrev->GetMedianTimePast();

	const int64_t nLockTimeCutoff{enforce_locktime_median_time_past
	? nMedianTimePast
	: block.GetBlockTime()};

	const bool fIsMagneticAnomalyEnabled =
	IsMagneticAnomalyEnabled(params, pindexPrev);

	// Check transactions:
	// - canonical ordering
	// - ensure they are finalized
	// - check they have the minimum size
	const CTransaction *prevTx = nullptr;
	for (const auto &ptx : block.vtx) {
	const CTransaction &tx = *ptx;
	if (fIsMagneticAnomalyEnabled) {
	if (prevTx && (tx.GetId() <= prevTx->GetId())) {
	if (tx.GetId() == prevTx->GetId()) {
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"tx-duplicate",
	strprintf("Duplicated transaction %s",
	tx.GetId().ToString()));
	}

	return state.Invalid(
	BlockValidationResult::BLOCK_CONSENSUS, "tx-ordering",
	strprintf("Transaction order is invalid (%s < %s)",
	tx.GetId().ToString(),
	prevTx->GetId().ToString()));
	}

	if (prevTx \|\| !tx.IsCoinBase()) {
	prevTx = &tx;
	}
	}

	TxValidationState tx_state;
	if (!ContextualCheckTransaction(params, tx, tx_state, nHeight,
	nLockTimeCutoff)) {
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	tx_state.GetRejectReason(),
	tx_state.GetDebugMessage());
	}
	}

	// Enforce rule that the coinbase starts with serialized block height
	if (DeploymentActiveAfter(pindexPrev, params,
	Consensus::DEPLOYMENT_HEIGHTINCB)) {
	CScript expect = CScript() << nHeight;
	if (block.vtx[0]->vin[0].scriptSig.size() < expect.size() \|\|
	!std::equal(expect.begin(), expect.end(),
	block.vtx[0]->vin[0].scriptSig.begin())) {
	return state.Invalid(BlockValidationResult::BLOCK_CONSENSUS,
	"bad-cb-height",
	"block height mismatch in coinbase");
	}
	}

	return true;
	}

	/**
	* If the provided block header is valid, add it to the block index.
	*
	* Returns true if the block is successfully added to the block index.
	*/
	bool ChainstateManager::AcceptBlockHeader(const Config &config,
	const CBlockHeader &block,
	BlockValidationState &state,
	CBlockIndex **ppindex,
	bool min_pow_checked) {
	AssertLockHeld(cs_main);
	const CChainParams &chainparams = config.GetChainParams();

	// Check for duplicate
	BlockHash hash = block.GetHash();
	BlockMap::iterator miSelf{m_blockman.m_block_index.find(hash)};
	if (hash != chainparams.GetConsensus().hashGenesisBlock) {
	if (miSelf != m_blockman.m_block_index.end()) {
	// Block header is already known.
	CBlockIndex *pindex = &(miSelf->second);
	if (ppindex) {
	*ppindex = pindex;
	}

	if (pindex->nStatus.isInvalid()) {
	LogPrint(BCLog::VALIDATION, "%s: block %s is marked invalid\n",
	__func__, hash.ToString());
	return state.Invalid(
	BlockValidationResult::BLOCK_CACHED_INVALID, "duplicate");
	}

	return true;
	}

	if (!CheckBlockHeader(block, state, chainparams.GetConsensus(),
	BlockValidationOptions(config))) {
	LogPrint(BCLog::VALIDATION,
	"%s: Consensus::CheckBlockHeader: %s, %s\n", __func__,
	hash.ToString(), state.ToString());
	return false;
	}

	// Get prev block index
	BlockMap::iterator mi{
	m_blockman.m_block_index.find(block.hashPrevBlock)};
	if (mi == m_blockman.m_block_index.end()) {
	LogPrint(BCLog::VALIDATION,
	"header %s has prev block not found: %s\n",
	hash.ToString(), block.hashPrevBlock.ToString());
	return state.Invalid(BlockValidationResult::BLOCK_MISSING_PREV,
	"prev-blk-not-found");
	}

	CBlockIndex pindexPrev = &((mi).second);
	assert(pindexPrev);
	if (pindexPrev->nStatus.isInvalid()) {
	LogPrint(BCLog::VALIDATION,
	"header %s has prev block invalid: %s\n", hash.ToString(),
	block.hashPrevBlock.ToString());
	return state.Invalid(BlockValidationResult::BLOCK_INVALID_PREV,
	"bad-prevblk");
	}

	if (!ContextualCheckBlockHeader(chainparams, block, state, m_blockman,
	pindexPrev,
	m_options.adjusted_time_callback())) {
	LogPrint(BCLog::VALIDATION,
	"%s: Consensus::ContextualCheckBlockHeader: %s, %s\n",
	__func__, hash.ToString(), state.ToString());
	return false;
	}

	/* Determine if this block descends from any block which has been found
	* invalid (m_failed_blocks), then mark pindexPrev and any blocks
	* between them as failed. For example:
	*
	* D3
	* /
	* B2 - C2
	* / \
	* A D2 - E2 - F2
	* \
	* B1 - C1 - D1 - E1
	*
	* In the case that we attempted to reorg from E1 to F2, only to find
	* C2 to be invalid, we would mark D2, E2, and F2 as BLOCK_FAILED_CHILD
	* but NOT D3 (it was not in any of our candidate sets at the time).
	*
	* In any case D3 will also be marked as BLOCK_FAILED_CHILD at restart
	* in LoadBlockIndex.
	*/
	if (!pindexPrev->IsValid(BlockValidity::SCRIPTS)) {
	// The above does not mean "invalid": it checks if the previous
	// block hasn't been validated up to BlockValidity::SCRIPTS. This is
	// a performance optimization, in the common case of adding a new
	// block to the tip, we don't need to iterate over the failed blocks
	// list.
	for (const CBlockIndex *failedit : m_failed_blocks) {
	if (pindexPrev->GetAncestor(failedit->nHeight) == failedit) {
	assert(failedit->nStatus.hasFailed());
	CBlockIndex *invalid_walk = pindexPrev;
	while (invalid_walk != failedit) {
	invalid_walk->nStatus =
	invalid_walk->nStatus.withFailedParent();
	m_blockman.m_dirty_blockindex.insert(invalid_walk);
	invalid_walk = invalid_walk->pprev;
	}
	LogPrint(BCLog::VALIDATION,
	"header %s has prev block invalid: %s\n",
	hash.ToString(), block.hashPrevBlock.ToString());
	return state.Invalid(
	BlockValidationResult::BLOCK_INVALID_PREV,
	"bad-prevblk");
	}
	}
	}
	}
	if (!min_pow_checked) {
	LogPrint(BCLog::VALIDATION,
	"%s: not adding new block header %s, missing anti-dos "
	"proof-of-work validation\n",
	__func__, hash.ToString());
	return state.Invalid(BlockValidationResult::BLOCK_HEADER_LOW_WORK,
	"too-little-chainwork");
	}
	CBlockIndex *pindex{m_blockman.AddToBlockIndex(block, m_best_header)};

	if (ppindex) {
	*ppindex = pindex;
	}

	return true;
	}

	// Exposed wrapper for AcceptBlockHeader
	bool ChainstateManager::ProcessNewBlockHeaders(
	const Config &config, const std::vector<CBlockHeader> &headers,
	bool min_pow_checked, BlockValidationState &state,
	const CBlockIndex **ppindex) {
	AssertLockNotHeld(cs_main);
	{
	LOCK(cs_main);
	for (const CBlockHeader &header : headers) {
	// Use a temp pindex instead of ppindex to avoid a const_cast
	CBlockIndex *pindex = nullptr;
	bool accepted = AcceptBlockHeader(config, header, state, &pindex,
	min_pow_checked);
	ActiveChainstate().CheckBlockIndex();

	if (!accepted) {
	return false;
	}

	if (ppindex) {
	*ppindex = pindex;
	}
	}
	}

	if (NotifyHeaderTip(ActiveChainstate())) {
	if (ActiveChainstate().IsInitialBlockDownload() && ppindex &&
	*ppindex) {
	const CBlockIndex &last_accepted{**ppindex};
	const int64_t blocks_left{
	(GetTime() - last_accepted.GetBlockTime()) /
	config.GetChainParams().GetConsensus().nPowTargetSpacing};
	const double progress{100.0 * last_accepted.nHeight /
	(last_accepted.nHeight + blocks_left)};
	LogPrintf("Synchronizing blockheaders, height: %d (~%.2f%%)\n",
	last_accepted.nHeight, progress);
	}
	}
	return true;
	}

	void ChainstateManager::ReportHeadersPresync(const arith_uint256 &work,
	int64_t height,
	int64_t timestamp) {
	AssertLockNotHeld(cs_main);
	const auto &chainstate = ActiveChainstate();
	{
	LOCK(cs_main);
	// Don't report headers presync progress if we already have a
	// post-minchainwork header chain.
	// This means we lose reporting for potentially legimate, but unlikely,
	// deep reorgs, but prevent attackers that spam low-work headers from
	// filling our logs.
	if (m_best_header->nChainWork >=
	UintToArith256(GetConsensus().nMinimumChainWork)) {
	return;
	}
	// Rate limit headers presync updates to 4 per second, as these are not
	// subject to DoS protection.
	auto now = Now<SteadyMilliseconds>();
	if (now < m_last_presync_update + 250ms) {
	return;
	}
	m_last_presync_update = now;
	}
	bool initial_download = chainstate.IsInitialBlockDownload();
	uiInterface.NotifyHeaderTip(GetSynchronizationState(initial_download),
	height, timestamp, /presync=/true);
	if (initial_download) {
	const int64_t blocks_left{(GetTime() - timestamp) /
	GetConsensus().nPowTargetSpacing};
	const double progress{100.0 * height / (height + blocks_left)};
	LogPrintf("Pre-synchronizing blockheaders, height: %d (~%.2f%%)\n",
	height, progress);
	}
	}

	/**
	* Store a block on disk.
	*
	* @param[in] config The global config.
	* @param[in,out] pblock The block we want to accept.
	* @param[in] fRequested A boolean to indicate if this block was requested
	* from our peers.
	* @param[in] dbp If non-null, the disk position of the block.
	* @param[in,out] fNewBlock True if block was first received via this call.
	* @param[in] min_pow_checked True if proof-of-work anti-DoS checks have
	* been done by caller for headers chain
	* @return True if the block is accepted as a valid block and written to disk.
	*/
	bool Chainstate::AcceptBlock(const Config &config,
	const std::shared_ptr<const CBlock> &pblock,
	BlockValidationState &state, bool fRequested,
	const FlatFilePos dbp, bool fNewBlock,
	bool min_pow_checked) {
	AssertLockHeld(cs_main);

	const CBlock &block = *pblock;
	if (fNewBlock) {
	*fNewBlock = false;
	}

	CBlockIndex *pindex = nullptr;

	bool accepted_header{m_chainman.AcceptBlockHeader(
	config, block, state, &pindex, min_pow_checked)};
	CheckBlockIndex();

	if (!accepted_header) {
	return false;
	}

	// Try to process all requested blocks that we don't have, but only
	// process an unrequested block if it's new and has enough work to
	// advance our tip, and isn't too many blocks ahead.
	bool fAlreadyHave = pindex->nStatus.hasData();

	// TODO: deal better with return value and error conditions for duplicate
	// and unrequested blocks.
	if (fAlreadyHave) {
	return true;
	}

	// Compare block header timestamps and received times of the block and the
	// chaintip. If they have the same chain height, use these diffs as a
	// tie-breaker, attempting to pick the more honestly-mined block.
	int64_t newBlockTimeDiff = std::llabs(pindex->GetReceivedTimeDiff());
	int64_t chainTipTimeDiff =
	m_chain.Tip() ? std::llabs(m_chain.Tip()->GetReceivedTimeDiff()) : 0;

	bool isSameHeight =
	m_chain.Tip() && (pindex->nChainWork == m_chain.Tip()->nChainWork);
	if (isSameHeight) {
	LogPrintf("Chain tip timestamp-to-received-time difference: hash=%s, "
	"diff=%d\n",
	m_chain.Tip()->GetBlockHash().ToString(), chainTipTimeDiff);
	LogPrintf("New block timestamp-to-received-time difference: hash=%s, "
	"diff=%d\n",
	pindex->GetBlockHash().ToString(), newBlockTimeDiff);
	}

	bool fHasMoreOrSameWork =
	(m_chain.Tip() ? pindex->nChainWork >= m_chain.Tip()->nChainWork
	: true);

	// Blocks that are too out-of-order needlessly limit the effectiveness of
	// pruning, because pruning will not delete block files that contain any
	// blocks which are too close in height to the tip. Apply this test
	// regardless of whether pruning is enabled; it should generally be safe to
	// not process unrequested blocks.
	bool fTooFarAhead{pindex->nHeight >
	m_chain.Height() + int(MIN_BLOCKS_TO_KEEP)};

	// TODO: Decouple this function from the block download logic by removing
	// fRequested
	// This requires some new chain data structure to efficiently look up if a
	// block is in a chain leading to a candidate for best tip, despite not
	// being such a candidate itself.
	// Note that this would break the getblockfrompeer RPC

	// If we didn't ask for it:
	if (!fRequested) {
	// This is a previously-processed block that was pruned.
	if (pindex->nTx != 0) {
	return true;
	}

	// Don't process less-work chains.
	if (!fHasMoreOrSameWork) {
	return true;
	}

	// Block height is too high.
	if (fTooFarAhead) {
	return true;
	}

	// Protect against DoS attacks from low-work chains.
	// If our tip is behind, a peer could try to send us
	// low-work blocks on a fake chain that we would never
	// request; don't process these.
	if (pindex->nChainWork < nMinimumChainWork) {
	return true;
	}
	}

	const CChainParams &params{m_chainman.GetParams()};
	const Consensus::Params &consensusParams = params.GetConsensus();

	if (!CheckBlock(block, state, consensusParams,
	BlockValidationOptions(config)) \|\|
	!ContextualCheckBlock(block, state, consensusParams, pindex->pprev)) {
	if (state.IsInvalid() &&
	state.GetResult() != BlockValidationResult::BLOCK_MUTATED) {
	pindex->nStatus = pindex->nStatus.withFailed();
	m_blockman.m_dirty_blockindex.insert(pindex);
	}

	return error("%s: %s (block %s)", __func__, state.ToString(),
	block.GetHash().ToString());
	}

	// If connecting the new block would require rewinding more than one block
	// from the active chain (i.e., a "deep reorg"), then mark the new block as
	// parked. If it has enough work then it will be automatically unparked
	// later, during FindMostWorkChain. We mark the block as parked at the very
	// last minute so we can make sure everything is ready to be reorged if
	// needed.
	if (gArgs.GetBoolArg("-parkdeepreorg", true)) {
	const CBlockIndex *pindexFork = m_chain.FindFork(pindex);
	if (pindexFork && pindexFork->nHeight + 1 < m_chain.Height()) {
	LogPrintf("Park block %s as it would cause a deep reorg.\n",
	pindex->GetBlockHash().ToString());
	pindex->nStatus = pindex->nStatus.withParked();
	m_blockman.m_dirty_blockindex.insert(pindex);
	}
	}

	// Header is valid/has work and the merkle tree is good.
	// Relay now, but if it does not build on our best tip, let the
	// SendMessages loop relay it.
	if (!IsInitialBlockDownload() && m_chain.Tip() == pindex->pprev) {
	GetMainSignals().NewPoWValidBlock(pindex, pblock);
	}

	// Write block to history file
	if (fNewBlock) {
	*fNewBlock = true;
	}
	try {
	FlatFilePos blockPos{m_blockman.SaveBlockToDisk(block, pindex->nHeight,
	m_chain, params, dbp)};
	if (blockPos.IsNull()) {
	state.Error(strprintf(
	"%s: Failed to find position to write new block to disk",
	__func__));
	return false;
	}
	ReceivedBlockTransactions(block, pindex, blockPos);
	} catch (const std::runtime_error &e) {
	return AbortNode(state, std::string("System error: ") + e.what());
	}

	FlushStateToDisk(state, FlushStateMode::NONE);

	CheckBlockIndex();

	return true;
	}

	bool ChainstateManager::ProcessNewBlock(
	const Config &config, const std::shared_ptr<const CBlock> &block,
	bool force_processing, bool min_pow_checked, bool *new_block) {
	AssertLockNotHeld(cs_main);

	{
	if (new_block) {
	*new_block = false;
	}

	BlockValidationState state;

	// CheckBlock() does not support multi-threaded block validation
	// because CBlock::fChecked can cause data race.
	// Therefore, the following critical section must include the
	// CheckBlock() call as well.
	LOCK(cs_main);

	// Skipping AcceptBlock() for CheckBlock() failures means that we will
	// never mark a block as invalid if CheckBlock() fails. This is
	// protective against consensus failure if there are any unknown form
	// s of block malleability that cause CheckBlock() to fail; see e.g.
	// CVE-2012-2459 and
	// https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2019-February/016697.html.
	// Because CheckBlock() is not very expensive, the anti-DoS benefits of
	// caching failure (of a definitely-invalid block) are not substantial.
	bool ret =
	CheckBlock(*block, state, config.GetChainParams().GetConsensus(),
	BlockValidationOptions(config));
	if (ret) {
	// Store to disk
	ret = ActiveChainstate().AcceptBlock(config, block, state,
	force_processing, nullptr,
	new_block, min_pow_checked);
	}

	if (!ret) {
	GetMainSignals().BlockChecked(*block, state);
	return error("%s: AcceptBlock FAILED (%s)", __func__,
	state.ToString());
	}
	}

	NotifyHeaderTip(ActiveChainstate());

	// Only used to report errors, not invalidity - ignore it
	BlockValidationState state;
	if (!ActiveChainstate().ActivateBestChain(config, state, block)) {
	return error("%s: ActivateBestChain failed (%s)", __func__,
	state.ToString());
	}

	return true;
	}

	MempoolAcceptResult
	ChainstateManager::ProcessTransaction(const CTransactionRef &tx,
	bool test_accept) {
	AssertLockHeld(cs_main);
	Chainstate &active_chainstate = ActiveChainstate();
	if (!active_chainstate.GetMempool()) {
	TxValidationState state;
	state.Invalid(TxValidationResult::TX_NO_MEMPOOL, "no-mempool");
	return MempoolAcceptResult::Failure(state);
	}
	// Use GetConfig() temporarily. It will be removed in a follow-up by
	// making AcceptToMemoryPool take a CChainParams instead of a Config.
	// This avoids passing an extra Config argument to this function that will
	// be removed soon.
	auto result =
	AcceptToMemoryPool(::GetConfig(), active_chainstate, tx, GetTime(),
	/bypass_limits=/false, test_accept);
	active_chainstate.GetMempool()->check(
	active_chainstate.CoinsTip(), active_chainstate.m_chain.Height() + 1);
	return result;
	}

	bool TestBlockValidity(
	BlockValidationState &state, const CChainParams &params,
	Chainstate &chainstate, const CBlock &block, CBlockIndex *pindexPrev,
	const std::function<NodeClock::time_point()> &adjusted_time_callback,
	BlockValidationOptions validationOptions) {
	AssertLockHeld(cs_main);
	assert(pindexPrev && pindexPrev == chainstate.m_chain.Tip());
	CCoinsViewCache viewNew(&chainstate.CoinsTip());
	BlockHash block_hash(block.GetHash());
	CBlockIndex indexDummy(block);
	indexDummy.pprev = pindexPrev;
	indexDummy.nHeight = pindexPrev->nHeight + 1;
	indexDummy.phashBlock = &block_hash;

	// NOTE: CheckBlockHeader is called by CheckBlock
	if (!ContextualCheckBlockHeader(params, block, state, chainstate.m_blockman,
	pindexPrev, adjusted_time_callback())) {
	return error("%s: Consensus::ContextualCheckBlockHeader: %s", __func__,
	state.ToString());
	}

	if (!CheckBlock(block, state, params.GetConsensus(), validationOptions)) {
	return error("%s: Consensus::CheckBlock: %s", __func__,
	state.ToString());
	}

	if (!ContextualCheckBlock(block, state, params.GetConsensus(),
	pindexPrev)) {
	return error("%s: Consensus::ContextualCheckBlock: %s", __func__,
	state.ToString());
	}

	if (!chainstate.ConnectBlock(block, state, &indexDummy, viewNew,
	validationOptions, nullptr, true)) {
	return false;
	}

	assert(state.IsValid());
	return true;
	}

	/* This function is called from the RPC code for pruneblockchain */
	void PruneBlockFilesManual(Chainstate &active_chainstate,
	int nManualPruneHeight) {
	BlockValidationState state;
	if (active_chainstate.FlushStateToDisk(state, FlushStateMode::NONE,
	nManualPruneHeight)) {
	LogPrintf("%s: failed to flush state (%s)\n", __func__,
	state.ToString());
	}
	}

	void Chainstate::LoadMempool(const Config &config, const ArgsManager &args) {
	if (!m_mempool) {
	return;
	}
	if (args.GetBoolArg("-persistmempool", DEFAULT_PERSIST_MEMPOOL)) {
	::LoadMempool(config, m_mempool, this);
	}
	- m_mempool->SetIsLoaded(!ShutdownRequested());
	+ m_mempool->SetLoadTried(!ShutdownRequested());
	}

	bool Chainstate::LoadChainTip() {
	AssertLockHeld(cs_main);
	const CCoinsViewCache &coins_cache = CoinsTip();
	// Never called when the coins view is empty
	assert(!coins_cache.GetBestBlock().IsNull());
	const CBlockIndex *tip = m_chain.Tip();

	if (tip && tip->GetBlockHash() == coins_cache.GetBestBlock()) {
	return true;
	}

	// Load pointer to end of best chain
	CBlockIndex *pindex =
	m_blockman.LookupBlockIndex(coins_cache.GetBestBlock());
	if (!pindex) {
	return false;
	}
	m_chain.SetTip(pindex);
	PruneBlockIndexCandidates();

	tip = m_chain.Tip();
	LogPrintf(
	"Loaded best chain: hashBestChain=%s height=%d date=%s progress=%f\n",
	tip->GetBlockHash().ToString(), m_chain.Height(),
	FormatISO8601DateTime(tip->GetBlockTime()),
	GuessVerificationProgress(m_chainman.GetParams().TxData(), tip));
	return true;
	}

	CVerifyDB::CVerifyDB() {
	uiInterface.ShowProgress(_("Verifying blocks...").translated, 0, false);
	}

	CVerifyDB::~CVerifyDB() {
	uiInterface.ShowProgress("", 100, false);
	}

	VerifyDBResult CVerifyDB::VerifyDB(Chainstate &chainstate, const Config &config,
	CCoinsView &coinsview, int nCheckLevel,
	int nCheckDepth) {
	AssertLockHeld(cs_main);

	const CChainParams &params = config.GetChainParams();
	const Consensus::Params &consensusParams = params.GetConsensus();

	if (chainstate.m_chain.Tip() == nullptr \|\|
	chainstate.m_chain.Tip()->pprev == nullptr) {
	return VerifyDBResult::SUCCESS;
	}

	// Verify blocks in the best chain
	if (nCheckDepth <= 0 \|\| nCheckDepth > chainstate.m_chain.Height()) {
	nCheckDepth = chainstate.m_chain.Height();
	}

	nCheckLevel = std::max(0, std::min(4, nCheckLevel));
	LogPrintf("Verifying last %i blocks at level %i\n", nCheckDepth,
	nCheckLevel);

	CCoinsViewCache coins(&coinsview);
	CBlockIndex *pindex;
	CBlockIndex *pindexFailure = nullptr;
	int nGoodTransactions = 0;
	BlockValidationState state;
	int reportDone = 0;
	bool skipped_no_block_data{false};
	bool skipped_l3_checks{false};
	LogPrintf("Verification progress: 0%%\n");

	const bool is_snapshot_cs{!chainstate.m_from_snapshot_blockhash};

	for (pindex = chainstate.m_chain.Tip(); pindex && pindex->pprev;
	pindex = pindex->pprev) {
	const int percentageDone = std::max(
	1, std::min(99, (int)(((double)(chainstate.m_chain.Height() -
	pindex->nHeight)) /
	(double)nCheckDepth *
	(nCheckLevel >= 4 ? 50 : 100))));
	if (reportDone < percentageDone / 10) {
	// report every 10% step
	LogPrintf("Verification progress: %d%%\n", percentageDone);
	reportDone = percentageDone / 10;
	}

	uiInterface.ShowProgress(_("Verifying blocks...").translated,
	percentageDone, false);
	if (pindex->nHeight <= chainstate.m_chain.Height() - nCheckDepth) {
	break;
	}

	if ((chainstate.m_blockman.IsPruneMode() \|\| is_snapshot_cs) &&
	!pindex->nStatus.hasData()) {
	// If pruning or running under an assumeutxo snapshot, only go
	// back as far as we have data.
	LogPrintf("VerifyDB(): block verification stopping at height %d "
	"(no data). This could be due to pruning or use of an "
	"assumeutxo snapshot.\n",
	pindex->nHeight);
	skipped_no_block_data = true;
	break;
	}

	CBlock block;

	// check level 0: read from disk
	if (!ReadBlockFromDisk(block, pindex, consensusParams)) {
	LogPrintf(
	"Verification error: ReadBlockFromDisk failed at %d, hash=%s\n",
	pindex->nHeight, pindex->GetBlockHash().ToString());
	return VerifyDBResult::CORRUPTED_BLOCK_DB;
	}

	// check level 1: verify block validity
	if (nCheckLevel >= 1 && !CheckBlock(block, state, consensusParams,
	BlockValidationOptions(config))) {
	LogPrintf(
	"Verification error: found bad block at %d, hash=%s (%s)\n",
	pindex->nHeight, pindex->GetBlockHash().ToString(),
	state.ToString());
	return VerifyDBResult::CORRUPTED_BLOCK_DB;
	}

	// check level 2: verify undo validity
	if (nCheckLevel >= 2 && pindex) {
	CBlockUndo undo;
	if (!pindex->GetUndoPos().IsNull()) {
	if (!UndoReadFromDisk(undo, pindex)) {
	LogPrintf("Verification error: found bad undo data at %d, "
	"hash=%s\n",
	pindex->nHeight,
	pindex->GetBlockHash().ToString());
	return VerifyDBResult::CORRUPTED_BLOCK_DB;
	}
	}
	}
	// check level 3: check for inconsistencies during memory-only
	// disconnect of tip blocks
	size_t curr_coins_usage = coins.DynamicMemoryUsage() +
	chainstate.CoinsTip().DynamicMemoryUsage();

	if (nCheckLevel >= 3) {
	if (curr_coins_usage <= chainstate.m_coinstip_cache_size_bytes) {
	assert(coins.GetBestBlock() == pindex->GetBlockHash());
	DisconnectResult res =
	chainstate.DisconnectBlock(block, pindex, coins);
	if (res == DisconnectResult::FAILED) {
	LogPrintf("Verification error: irrecoverable inconsistency "
	"in block data at %d, hash=%s\n",
	pindex->nHeight,
	pindex->GetBlockHash().ToString());
	return VerifyDBResult::CORRUPTED_BLOCK_DB;
	}
	if (res == DisconnectResult::UNCLEAN) {
	nGoodTransactions = 0;
	pindexFailure = pindex;
	} else {
	nGoodTransactions += block.vtx.size();
	}
	} else {
	skipped_l3_checks = true;
	}
	}

	if (ShutdownRequested()) {
	return VerifyDBResult::INTERRUPTED;
	}
	}

	if (pindexFailure) {
	LogPrintf("Verification error: coin database inconsistencies found "
	"(last %i blocks, %i good transactions before that)\n",
	chainstate.m_chain.Height() - pindexFailure->nHeight + 1,
	nGoodTransactions);
	return VerifyDBResult::CORRUPTED_BLOCK_DB;
	}
	if (skipped_l3_checks) {
	LogPrintf("Skipped verification of level >=3 (insufficient database "
	"cache size). Consider increasing -dbcache.\n");
	}

	// store block count as we move pindex at check level >= 4
	int block_count = chainstate.m_chain.Height() - pindex->nHeight;

	// check level 4: try reconnecting blocks
	if (nCheckLevel >= 4 && !skipped_l3_checks) {
	while (pindex != chainstate.m_chain.Tip()) {
	const int percentageDone = std::max(
	1, std::min(99, 100 - int(double(chainstate.m_chain.Height() -
	pindex->nHeight) /
	double(nCheckDepth) * 50)));
	if (reportDone < percentageDone / 10) {
	// report every 10% step
	LogPrintf("Verification progress: %d%%\n", percentageDone);
	reportDone = percentageDone / 10;
	}
	uiInterface.ShowProgress(_("Verifying blocks...").translated,
	percentageDone, false);
	pindex = chainstate.m_chain.Next(pindex);
	CBlock block;
	if (!ReadBlockFromDisk(block, pindex, consensusParams)) {
	LogPrintf("Verification error: ReadBlockFromDisk failed at %d, "
	"hash=%s\n",
	pindex->nHeight, pindex->GetBlockHash().ToString());
	return VerifyDBResult::CORRUPTED_BLOCK_DB;
	}
	if (!chainstate.ConnectBlock(block, state, pindex, coins,
	BlockValidationOptions(config))) {
	LogPrintf("Verification error: found unconnectable block at "
	"%d, hash=%s (%s)\n",
	pindex->nHeight, pindex->GetBlockHash().ToString(),
	state.ToString());
	return VerifyDBResult::CORRUPTED_BLOCK_DB;
	}
	if (ShutdownRequested()) {
	return VerifyDBResult::INTERRUPTED;
	}
	}
	}

	LogPrintf("Verification: No coin database inconsistencies in last %i "
	"blocks (%i transactions)\n",
	block_count, nGoodTransactions);

	if (skipped_l3_checks) {
	return VerifyDBResult::SKIPPED_L3_CHECKS;
	}
	if (skipped_no_block_data) {
	return VerifyDBResult::SKIPPED_MISSING_BLOCKS;
	}
	return VerifyDBResult::SUCCESS;
	}

	/**
	* Apply the effects of a block on the utxo cache, ignoring that it may already
	* have been applied.
	*/
	bool Chainstate::RollforwardBlock(const CBlockIndex *pindex,
	CCoinsViewCache &view) {
	AssertLockHeld(cs_main);
	// TODO: merge with ConnectBlock
	CBlock block;
	if (!ReadBlockFromDisk(block, pindex, m_chainman.GetConsensus())) {
	return error("ReplayBlock(): ReadBlockFromDisk failed at %d, hash=%s",
	pindex->nHeight, pindex->GetBlockHash().ToString());
	}

	for (const CTransactionRef &tx : block.vtx) {
	// Pass check = true as every addition may be an overwrite.
	AddCoins(view, *tx, pindex->nHeight, true);
	}

	for (const CTransactionRef &tx : block.vtx) {
	if (tx->IsCoinBase()) {
	continue;
	}

	for (const CTxIn &txin : tx->vin) {
	view.SpendCoin(txin.prevout);
	}
	}

	return true;
	}

	bool Chainstate::ReplayBlocks() {
	LOCK(cs_main);

	CCoinsView &db = this->CoinsDB();
	CCoinsViewCache cache(&db);

	std::vector<BlockHash> hashHeads = db.GetHeadBlocks();
	if (hashHeads.empty()) {
	// We're already in a consistent state.
	return true;
	}
	if (hashHeads.size() != 2) {
	return error("ReplayBlocks(): unknown inconsistent state");
	}

	uiInterface.ShowProgress(_("Replaying blocks...").translated, 0, false);
	LogPrintf("Replaying blocks\n");

	// Old tip during the interrupted flush.
	const CBlockIndex *pindexOld = nullptr;
	// New tip during the interrupted flush.
	const CBlockIndex *pindexNew;
	// Latest block common to both the old and the new tip.
	const CBlockIndex *pindexFork = nullptr;

	if (m_blockman.m_block_index.count(hashHeads[0]) == 0) {
	return error(
	"ReplayBlocks(): reorganization to unknown block requested");
	}

	pindexNew = &(m_blockman.m_block_index[hashHeads[0]]);

	if (!hashHeads[1].IsNull()) {
	// The old tip is allowed to be 0, indicating it's the first flush.
	if (m_blockman.m_block_index.count(hashHeads[1]) == 0) {
	return error(
	"ReplayBlocks(): reorganization from unknown block requested");
	}

	pindexOld = &(m_blockman.m_block_index[hashHeads[1]]);
	pindexFork = LastCommonAncestor(pindexOld, pindexNew);
	assert(pindexFork != nullptr);
	}

	// Rollback along the old branch.
	while (pindexOld != pindexFork) {
	if (pindexOld->nHeight > 0) {
	// Never disconnect the genesis block.
	CBlock block;
	if (!ReadBlockFromDisk(block, pindexOld,
	m_chainman.GetConsensus())) {
	return error("RollbackBlock(): ReadBlockFromDisk() failed at "
	"%d, hash=%s",
	pindexOld->nHeight,
	pindexOld->GetBlockHash().ToString());
	}

	LogPrintf("Rolling back %s (%i)\n",
	pindexOld->GetBlockHash().ToString(), pindexOld->nHeight);
	DisconnectResult res = DisconnectBlock(block, pindexOld, cache);
	if (res == DisconnectResult::FAILED) {
	return error(
	"RollbackBlock(): DisconnectBlock failed at %d, hash=%s",
	pindexOld->nHeight, pindexOld->GetBlockHash().ToString());
	}

	// If DisconnectResult::UNCLEAN is returned, it means a non-existing
	// UTXO was deleted, or an existing UTXO was overwritten. It
	// corresponds to cases where the block-to-be-disconnect never had
	// all its operations applied to the UTXO set. However, as both
	// writing a UTXO and deleting a UTXO are idempotent operations, the
	// result is still a version of the UTXO set with the effects of
	// that block undone.
	}
	pindexOld = pindexOld->pprev;
	}

	// Roll forward from the forking point to the new tip.
	int nForkHeight = pindexFork ? pindexFork->nHeight : 0;
	for (int nHeight = nForkHeight + 1; nHeight <= pindexNew->nHeight;
	++nHeight) {
	const CBlockIndex &pindex{*Assert(pindexNew->GetAncestor(nHeight))};
	LogPrintf("Rolling forward %s (%i)\n", pindex.GetBlockHash().ToString(),
	nHeight);
	uiInterface.ShowProgress(_("Replaying blocks...").translated,
	(int)((nHeight - nForkHeight) * 100.0 /
	(pindexNew->nHeight - nForkHeight)),
	false);
	if (!RollforwardBlock(&pindex, cache)) {
	return false;
	}
	}

	cache.SetBestBlock(pindexNew->GetBlockHash());
	cache.Flush();
	uiInterface.ShowProgress("", 100, false);
	return true;
	}

	// May NOT be used after any connections are up as much of the peer-processing
	// logic assumes a consistent block index state
	void Chainstate::UnloadBlockIndex() {
	AssertLockHeld(::cs_main);
	nBlockSequenceId = 1;
	m_best_fork_tip = nullptr;
	m_best_fork_base = nullptr;
	setBlockIndexCandidates.clear();
	}

	bool ChainstateManager::LoadBlockIndex() {
	AssertLockHeld(cs_main);
	// Load block index from databases
	bool needs_init = fReindex;
	if (!fReindex) {
	bool ret = m_blockman.LoadBlockIndexDB(GetConsensus());
	if (!ret) {
	return false;
	}

	std::vector<CBlockIndex *> vSortedByHeight{
	m_blockman.GetAllBlockIndices()};
	std::sort(vSortedByHeight.begin(), vSortedByHeight.end(),
	CBlockIndexHeightOnlyComparator());

	// Find start of assumed-valid region.
	int first_assumed_valid_height = std::numeric_limits<int>::max();

	for (const CBlockIndex *block : vSortedByHeight) {
	if (block->IsAssumedValid()) {
	auto chainstates = GetAll();

	// If we encounter an assumed-valid block index entry, ensure
	// that we have one chainstate that tolerates assumed-valid
	// entries and another that does not (i.e. the background
	// validation chainstate), since assumed-valid entries should
	// always be pending validation by a fully-validated chainstate.
	auto any_chain = [&](auto fnc) {
	return std::any_of(chainstates.cbegin(), chainstates.cend(),
	fnc);
	};
	assert(any_chain([](auto chainstate) {
	return chainstate->reliesOnAssumedValid();
	}));
	assert(any_chain([](auto chainstate) {
	return !chainstate->reliesOnAssumedValid();
	}));

	first_assumed_valid_height = block->nHeight;
	LogPrintf("Saw first assumedvalid block at height %d (%s)\n",
	first_assumed_valid_height, block->ToString());
	break;
	}
	}

	for (CBlockIndex *pindex : vSortedByHeight) {
	if (ShutdownRequested()) {
	return false;
	}
	if (pindex->IsAssumedValid() \|\|
	(pindex->IsValid(BlockValidity::TRANSACTIONS) &&
	(pindex->HaveTxsDownloaded() \|\| pindex->pprev == nullptr))) {
	// Fill each chainstate's block candidate set. Only add
	// assumed-valid blocks to the tip candidate set if the
	// chainstate is allowed to rely on assumed-valid blocks.
	//
	// If all setBlockIndexCandidates contained the assumed-valid
	// blocks, the background chainstate's ActivateBestChain() call
	// would add assumed-valid blocks to the chain (based on how
	// FindMostWorkChain() works). Obviously we don't want this
	// since the purpose of the background validation chain is to
	// validate assumed-valid blocks.
	//
	// Note: This is considering all blocks whose height is greater
	// or equal to the first assumed-valid block to be assumed-valid
	// blocks, and excluding them from the background chainstate's
	// setBlockIndexCandidates set. This does mean that some blocks
	// which are not technically assumed-valid (later blocks on a
	// fork beginning before the first assumed-valid block) might
	// not get added to the background chainstate, but this is ok,
	// because they will still be attached to the active chainstate
	// if they actually contain more work.
	//
	// Instead of this height-based approach, an earlier attempt was
	// made at detecting "holistically" whether the block index
	// under consideration relied on an assumed-valid ancestor, but
	// this proved to be too slow to be practical.
	for (Chainstate *chainstate : GetAll()) {
	if (chainstate->reliesOnAssumedValid() \|\|
	pindex->nHeight < first_assumed_valid_height) {
	chainstate->setBlockIndexCandidates.insert(pindex);
	}
	}
	}

	if (pindex->nStatus.isInvalid() &&
	(!m_best_invalid \|\|
	pindex->nChainWork > m_best_invalid->nChainWork)) {
	m_best_invalid = pindex;
	}

	if (pindex->nStatus.isOnParkedChain() &&
	(!m_best_parked \|\|
	pindex->nChainWork > m_best_parked->nChainWork)) {
	m_best_parked = pindex;
	}

	if (pindex->IsValid(BlockValidity::TREE) &&
	(m_best_header == nullptr \|\|
	CBlockIndexWorkComparator()(m_best_header, pindex))) {
	m_best_header = pindex;
	}
	}

	needs_init = m_blockman.m_block_index.empty();
	}

	if (needs_init) {
	// Everything here is for new reindex/DBs. Thus, though
	// LoadBlockIndexDB may have set fReindex if we shut down
	// mid-reindex previously, we don't check fReindex and
	// instead only check it prior to LoadBlockIndexDB to set
	// needs_init.

	LogPrintf("Initializing databases...\n");
	}
	return true;
	}

	bool Chainstate::LoadGenesisBlock() {
	LOCK(cs_main);

	const CChainParams &params{m_chainman.GetParams()};

	// Check whether we're already initialized by checking for genesis in
	// m_blockman.m_block_index. Note that we can't use m_chain here, since it
	// is set based on the coins db, not the block index db, which is the only
	// thing loaded at this point.
	if (m_blockman.m_block_index.count(params.GenesisBlock().GetHash())) {
	return true;
	}

	try {
	const CBlock &block = params.GenesisBlock();
	FlatFilePos blockPos{
	m_blockman.SaveBlockToDisk(block, 0, m_chain, params, nullptr)};
	if (blockPos.IsNull()) {
	return error("%s: writing genesis block to disk failed", __func__);
	}
	CBlockIndex *pindex =
	m_blockman.AddToBlockIndex(block, m_chainman.m_best_header);
	ReceivedBlockTransactions(block, pindex, blockPos);
	} catch (const std::runtime_error &e) {
	return error("%s: failed to write genesis block: %s", __func__,
	e.what());
	}

	return true;
	}

	void Chainstate::LoadExternalBlockFile(
	const Config &config, FILE fileIn, FlatFilePos dbp,
	std::multimap<BlockHash, FlatFilePos> *blocks_with_unknown_parent) {
	AssertLockNotHeld(m_chainstate_mutex);

	// Either both should be specified (-reindex), or neither (-loadblock).
	assert(!dbp == !blocks_with_unknown_parent);

	int64_t nStart = GetTimeMillis();
	const CChainParams &params{m_chainman.GetParams()};

	int nLoaded = 0;
	try {
	// This takes over fileIn and calls fclose() on it in the CBufferedFile
	// destructor. Make sure we have at least 2*MAX_TX_SIZE space in there
	// so any transaction can fit in the buffer.
	CBufferedFile blkdat(fileIn, 2 * MAX_TX_SIZE, MAX_TX_SIZE + 8, SER_DISK,
	CLIENT_VERSION);
	uint64_t nRewind = blkdat.GetPos();
	while (!blkdat.eof()) {
	if (ShutdownRequested()) {
	return;
	}

	blkdat.SetPos(nRewind);
	// Start one byte further next time, in case of failure.
	nRewind++;
	// Remove former limit.
	blkdat.SetLimit();
	unsigned int nSize = 0;
	try {
	// Locate a header.
	uint8_t buf[CMessageHeader::MESSAGE_START_SIZE];
	blkdat.FindByte(char(params.DiskMagic()[0]));
	nRewind = blkdat.GetPos() + 1;
	blkdat >> buf;
	if (memcmp(buf, params.DiskMagic().data(),
	CMessageHeader::MESSAGE_START_SIZE)) {
	continue;
	}

	// Read size.
	blkdat >> nSize;
	if (nSize < 80) {
	continue;
	}
	} catch (const std::exception &) {
	// No valid block header found; don't complain.
	break;
	}

	try {
	// read block
	uint64_t nBlockPos = blkdat.GetPos();
	if (dbp) {
	dbp->nPos = nBlockPos;
	}
	blkdat.SetLimit(nBlockPos + nSize);
	std::shared_ptr<CBlock> pblock = std::make_shared<CBlock>();
	CBlock &block = *pblock;
	blkdat >> block;
	nRewind = blkdat.GetPos();

	const BlockHash hash = block.GetHash();
	{
	LOCK(cs_main);
	// detect out of order blocks, and store them for later
	if (hash != params.GetConsensus().hashGenesisBlock &&
	!m_blockman.LookupBlockIndex(block.hashPrevBlock)) {
	LogPrint(
	BCLog::REINDEX,
	"%s: Out of order block %s, parent %s not known\n",
	__func__, hash.ToString(),
	block.hashPrevBlock.ToString());
	if (dbp && blocks_with_unknown_parent) {
	blocks_with_unknown_parent->emplace(
	block.hashPrevBlock, *dbp);
	}
	continue;
	}

	// process in case the block isn't known yet
	const CBlockIndex *pindex =
	m_blockman.LookupBlockIndex(hash);
	if (!pindex \|\| !pindex->nStatus.hasData()) {
	BlockValidationState state;
	if (AcceptBlock(config, pblock, state, true, dbp,
	nullptr, true)) {
	nLoaded++;
	}
	if (state.IsError()) {
	break;
	}
	} else if (hash != params.GetConsensus().hashGenesisBlock &&
	pindex->nHeight % 1000 == 0) {
	LogPrint(
	BCLog::REINDEX,
	"Block Import: already had block %s at height %d\n",
	hash.ToString(), pindex->nHeight);
	}
	}

	// Activate the genesis block so normal node progress can
	// continue
	if (hash == params.GetConsensus().hashGenesisBlock) {
	BlockValidationState state;
	if (!ActivateBestChain(config, state, nullptr)) {
	break;
	}
	}

	if (m_blockman.IsPruneMode() && !fReindex && pblock) {
	// Must update the tip for pruning to work while importing
	// with -loadblock. This is a tradeoff to conserve disk
	// space at the expense of time spent updating the tip to be
	// able to prune. Otherwise, ActivateBestChain won't be
	// called by the import process until after all of the block
	// files are loaded. ActivateBestChain can be called by
	// concurrent network message processing, but that is not
	// reliable for the purpose of pruning while importing.
	BlockValidationState state;
	if (!ActivateBestChain(config, state, pblock)) {
	LogPrint(BCLog::REINDEX,
	"failed to activate chain (%s)\n",
	state.ToString());
	break;
	}
	}

	NotifyHeaderTip(*this);

	if (!blocks_with_unknown_parent) {
	continue;
	}

	// Recursively process earlier encountered successors of this
	// block
	std::deque<BlockHash> queue;
	queue.push_back(hash);
	while (!queue.empty()) {
	BlockHash head = queue.front();
	queue.pop_front();
	auto range = blocks_with_unknown_parent->equal_range(head);
	while (range.first != range.second) {
	std::multimap<BlockHash, FlatFilePos>::iterator it =
	range.first;
	std::shared_ptr<CBlock> pblockrecursive =
	std::make_shared<CBlock>();
	if (ReadBlockFromDisk(*pblockrecursive, it->second,
	params.GetConsensus())) {
	LogPrint(
	BCLog::REINDEX,
	"%s: Processing out of order child %s of %s\n",
	__func__, pblockrecursive->GetHash().ToString(),
	head.ToString());
	LOCK(cs_main);
	BlockValidationState dummy;
	if (AcceptBlock(config, pblockrecursive, dummy,
	true, &it->second, nullptr, true)) {
	nLoaded++;
	queue.push_back(pblockrecursive->GetHash());
	}
	}
	range.first++;
	blocks_with_unknown_parent->erase(it);
	NotifyHeaderTip(*this);
	}
	}
	} catch (const std::exception &e) {
	// Historical bugs added extra data to the block files that does
	// not deserialize cleanly. Commonly this data is between
	// readable blocks, but it does not really matter. Such data is
	// not fatal to the import process. The code that reads the
	// block files deals with invalid data by simply ignoring it. It
	// continues to search for the next {4 byte magic message start
	// bytes + 4 byte length + block} that does deserialize cleanly
	// and passes all of the other block validation checks dealing
	// with POW and the merkle root, etc... We merely note with this
	// informational log message when unexpected data is
	// encountered. We could also be experiencing a storage system
	// read error, or a read of a previous bad write. These are
	// possible, but less likely scenarios. We don't have enough
	// information to tell a difference here. The reindex process is
	// not the place to attempt to clean and/or compact the block
	// files. If so desired, a studious node operator may use
	// knowledge of the fact that the block files are not entirely
	// pristine in order to prepare a set of pristine, and perhaps
	// ordered, block files for later reindexing.
	LogPrint(BCLog::REINDEX,
	"%s: unexpected data at file offset 0x%x - %s. "
	"continuing\n",
	__func__, (nRewind - 1), e.what());
	}
	}
	} catch (const std::runtime_error &e) {
	AbortNode(std::string("System error: ") + e.what());
	}

	LogPrintf("Loaded %i blocks from external file in %dms\n", nLoaded,
	GetTimeMillis() - nStart);
	}

	void Chainstate::CheckBlockIndex() {
	if (!fCheckBlockIndex) {
	return;
	}

	LOCK(cs_main);

	// During a reindex, we read the genesis block and call CheckBlockIndex
	// before ActivateBestChain, so we have the genesis block in
	// m_blockman.m_block_index but no active chain. (A few of the tests when
	// iterating the block tree require that m_chain has been initialized.)
	if (m_chain.Height() < 0) {
	assert(m_blockman.m_block_index.size() <= 1);
	return;
	}

	// Build forward-pointing map of the entire block tree.
	std::multimap<CBlockIndex , CBlockIndex > forward;
	for (auto &[_, block_index] : m_blockman.m_block_index) {
	forward.emplace(block_index.pprev, &block_index);
	}

	assert(forward.size() == m_blockman.m_block_index.size());

	std::pair<std::multimap<CBlockIndex , CBlockIndex >::iterator,
	std::multimap<CBlockIndex , CBlockIndex >::iterator>
	rangeGenesis = forward.equal_range(nullptr);
	CBlockIndex *pindex = rangeGenesis.first->second;
	rangeGenesis.first++;
	// There is only one index entry with parent nullptr.
	assert(rangeGenesis.first == rangeGenesis.second);

	// Iterate over the entire block tree, using depth-first search.
	// Along the way, remember whether there are blocks on the path from genesis
	// block being explored which are the first to have certain properties.
	size_t nNodes = 0;
	int nHeight = 0;
	// Oldest ancestor of pindex which is invalid.
	CBlockIndex *pindexFirstInvalid = nullptr;
	// Oldest ancestor of pindex which is parked.
	CBlockIndex *pindexFirstParked = nullptr;
	// Oldest ancestor of pindex which does not have data available.
	CBlockIndex *pindexFirstMissing = nullptr;
	// Oldest ancestor of pindex for which nTx == 0.
	CBlockIndex *pindexFirstNeverProcessed = nullptr;
	// Oldest ancestor of pindex which does not have BLOCK_VALID_TREE
	// (regardless of being valid or not).
	CBlockIndex *pindexFirstNotTreeValid = nullptr;
	// Oldest ancestor of pindex which does not have BLOCK_VALID_TRANSACTIONS
	// (regardless of being valid or not).
	CBlockIndex *pindexFirstNotTransactionsValid = nullptr;
	// Oldest ancestor of pindex which does not have BLOCK_VALID_CHAIN
	// (regardless of being valid or not).
	CBlockIndex *pindexFirstNotChainValid = nullptr;
	// Oldest ancestor of pindex which does not have BLOCK_VALID_SCRIPTS
	// (regardless of being valid or not).
	CBlockIndex *pindexFirstNotScriptsValid = nullptr;
	while (pindex != nullptr) {
	nNodes++;
	if (pindexFirstInvalid == nullptr && pindex->nStatus.hasFailed()) {
	pindexFirstInvalid = pindex;
	}
	if (pindexFirstParked == nullptr && pindex->nStatus.isParked()) {
	pindexFirstParked = pindex;
	}
	// Assumed-valid index entries will not have data since we haven't
	// downloaded the full block yet.
	if (pindexFirstMissing == nullptr && !pindex->nStatus.hasData() &&
	!pindex->IsAssumedValid()) {
	pindexFirstMissing = pindex;
	}
	if (pindexFirstNeverProcessed == nullptr && pindex->nTx == 0) {
	pindexFirstNeverProcessed = pindex;
	}
	if (pindex->pprev != nullptr && pindexFirstNotTreeValid == nullptr &&
	pindex->nStatus.getValidity() < BlockValidity::TREE) {
	pindexFirstNotTreeValid = pindex;
	}
	if (pindex->pprev != nullptr && !pindex->IsAssumedValid()) {
	if (pindexFirstNotTransactionsValid == nullptr &&
	pindex->nStatus.getValidity() < BlockValidity::TRANSACTIONS) {
	pindexFirstNotTransactionsValid = pindex;
	}
	if (pindexFirstNotChainValid == nullptr &&
	pindex->nStatus.getValidity() < BlockValidity::CHAIN) {
	pindexFirstNotChainValid = pindex;
	}
	if (pindexFirstNotScriptsValid == nullptr &&
	pindex->nStatus.getValidity() < BlockValidity::SCRIPTS) {
	pindexFirstNotScriptsValid = pindex;
	}
	}

	// Begin: actual consistency checks.
	if (pindex->pprev == nullptr) {
	// Genesis block checks.
	// Genesis block's hash must match.
	assert(pindex->GetBlockHash() ==
	m_chainman.GetConsensus().hashGenesisBlock);
	// The current active chain's genesis block must be this block.
	assert(pindex == m_chain.Genesis());
	}
	if (!pindex->HaveTxsDownloaded()) {
	// nSequenceId can't be set positive for blocks that aren't linked
	// (negative is used for preciousblock)
	assert(pindex->nSequenceId <= 0);
	}
	// VALID_TRANSACTIONS is equivalent to nTx > 0 for all nodes (whether or
	// not pruning has occurred). HAVE_DATA is only equivalent to nTx > 0
	// (or VALID_TRANSACTIONS) if no pruning has occurred.
	// Unless these indexes are assumed valid and pending block download on
	// a background chainstate.
	if (!m_blockman.m_have_pruned && !pindex->IsAssumedValid()) {
	// If we've never pruned, then HAVE_DATA should be equivalent to nTx
	// > 0
	assert(pindex->nStatus.hasData() == (pindex->nTx > 0));
	assert(pindexFirstMissing == pindexFirstNeverProcessed);
	} else if (pindex->nStatus.hasData()) {
	// If we have pruned, then we can only say that HAVE_DATA implies
	// nTx > 0
	assert(pindex->nTx > 0);
	}
	if (pindex->nStatus.hasUndo()) {
	assert(pindex->nStatus.hasData());
	}
	if (pindex->IsAssumedValid()) {
	// Assumed-valid blocks should have some nTx value.
	assert(pindex->nTx > 0);
	// Assumed-valid blocks should connect to the main chain.
	assert(pindex->nStatus.getValidity() >= BlockValidity::TREE);
	} else {
	// Otherwise there should only be an nTx value if we have
	// actually seen a block's transactions.
	// This is pruning-independent.
	assert((pindex->nStatus.getValidity() >=
	BlockValidity::TRANSACTIONS) == (pindex->nTx > 0));
	}
	// All parents having had data (at some point) is equivalent to all
	// parents being VALID_TRANSACTIONS, which is equivalent to
	// HaveTxsDownloaded(). All parents having had data (at some point) is
	// equivalent to all parents being VALID_TRANSACTIONS, which is
	// equivalent to HaveTxsDownloaded().
	assert((pindexFirstNeverProcessed == nullptr) ==
	(pindex->HaveTxsDownloaded()));
	assert((pindexFirstNotTransactionsValid == nullptr) ==
	(pindex->HaveTxsDownloaded()));
	// nHeight must be consistent.
	assert(pindex->nHeight == nHeight);
	// For every block except the genesis block, the chainwork must be
	// larger than the parent's.
	assert(pindex->pprev == nullptr \|\|
	pindex->nChainWork >= pindex->pprev->nChainWork);
	// The pskip pointer must point back for all but the first 2 blocks.
	assert(nHeight < 2 \|\|
	(pindex->pskip && (pindex->pskip->nHeight < nHeight)));
	// All m_blockman.m_block_index entries must at least be TREE valid
	assert(pindexFirstNotTreeValid == nullptr);
	if (pindex->nStatus.getValidity() >= BlockValidity::TREE) {
	// TREE valid implies all parents are TREE valid
	assert(pindexFirstNotTreeValid == nullptr);
	}
	if (pindex->nStatus.getValidity() >= BlockValidity::CHAIN) {
	// CHAIN valid implies all parents are CHAIN valid
	assert(pindexFirstNotChainValid == nullptr);
	}
	if (pindex->nStatus.getValidity() >= BlockValidity::SCRIPTS) {
	// SCRIPTS valid implies all parents are SCRIPTS valid
	assert(pindexFirstNotScriptsValid == nullptr);
	}
	if (pindexFirstInvalid == nullptr) {
	// Checks for not-invalid blocks.
	// The failed mask cannot be set for blocks without invalid parents.
	assert(!pindex->nStatus.isInvalid());
	}
	if (pindexFirstParked == nullptr) {
	// Checks for not-parked blocks.
	// The parked mask cannot be set for blocks without parked parents.
	// (i.e., hasParkedParent only if an ancestor is properly parked).
	assert(!pindex->nStatus.isOnParkedChain());
	}
	if (!CBlockIndexWorkComparator()(pindex, m_chain.Tip()) &&
	pindexFirstNeverProcessed == nullptr) {
	if (pindexFirstInvalid == nullptr) {
	// Don't perform this check for the background chainstate since
	// its setBlockIndexCandidates shouldn't have some entries (i.e.
	// those past the snapshot block) which do exist in the block
	// index for the active chainstate.
	if (this == &m_chainman.ActiveChainstate()) {
	// If this block sorts at least as good as the current tip
	// and is valid and we have all data for its parents, it
	// must be in setBlockIndexCandidates or be parked.
	if (pindexFirstMissing == nullptr) {
	assert(pindex->nStatus.isOnParkedChain() \|\|
	setBlockIndexCandidates.count(pindex));
	}
	// m_chain.Tip() must also be there even if some data has
	// been pruned.
	if (pindex == m_chain.Tip()) {
	assert(setBlockIndexCandidates.count(pindex));
	}
	}
	// If some parent is missing, then it could be that this block
	// was in setBlockIndexCandidates but had to be removed because
	// of the missing data. In this case it must be in
	// m_blocks_unlinked -- see test below.
	}
	} else {
	// If this block sorts worse than the current tip or some ancestor's
	// block has never been seen, it cannot be in
	// setBlockIndexCandidates.
	assert(setBlockIndexCandidates.count(pindex) == 0);
	}
	// Check whether this block is in m_blocks_unlinked.
	std::pair<std::multimap<CBlockIndex , CBlockIndex >::iterator,
	std::multimap<CBlockIndex , CBlockIndex >::iterator>
	rangeUnlinked =
	m_blockman.m_blocks_unlinked.equal_range(pindex->pprev);
	bool foundInUnlinked = false;
	while (rangeUnlinked.first != rangeUnlinked.second) {
	assert(rangeUnlinked.first->first == pindex->pprev);
	if (rangeUnlinked.first->second == pindex) {
	foundInUnlinked = true;
	break;
	}
	rangeUnlinked.first++;
	}
	if (pindex->pprev && pindex->nStatus.hasData() &&
	pindexFirstNeverProcessed != nullptr &&
	pindexFirstInvalid == nullptr) {
	// If this block has block data available, some parent was never
	// received, and has no invalid parents, it must be in
	// m_blocks_unlinked.
	assert(foundInUnlinked);
	}
	if (!pindex->nStatus.hasData()) {
	// Can't be in m_blocks_unlinked if we don't HAVE_DATA
	assert(!foundInUnlinked);
	}
	if (pindexFirstMissing == nullptr) {
	// We aren't missing data for any parent -- cannot be in
	// m_blocks_unlinked.
	assert(!foundInUnlinked);
	}
	if (pindex->pprev && pindex->nStatus.hasData() &&
	pindexFirstNeverProcessed == nullptr &&
	pindexFirstMissing != nullptr) {
	// We HAVE_DATA for this block, have received data for all parents
	// at some point, but we're currently missing data for some parent.
	// We must have pruned.
	assert(m_blockman.m_have_pruned);
	// This block may have entered m_blocks_unlinked if:
	// - it has a descendant that at some point had more work than the
	// tip, and
	// - we tried switching to that descendant but were missing
	// data for some intermediate block between m_chain and the
	// tip.
	// So if this block is itself better than m_chain.Tip() and it
	// wasn't in
	// setBlockIndexCandidates, then it must be in m_blocks_unlinked.
	if (!CBlockIndexWorkComparator()(pindex, m_chain.Tip()) &&
	setBlockIndexCandidates.count(pindex) == 0) {
	if (pindexFirstInvalid == nullptr) {
	assert(foundInUnlinked);
	}
	}
	}
	// Perhaps too slow
	// assert(pindex->GetBlockHash() == pindex->GetBlockHeader().GetHash());
	// End: actual consistency checks.

	// Try descending into the first subnode.
	std::pair<std::multimap<CBlockIndex , CBlockIndex >::iterator,
	std::multimap<CBlockIndex , CBlockIndex >::iterator>
	range = forward.equal_range(pindex);
	if (range.first != range.second) {
	// A subnode was found.
	pindex = range.first->second;
	nHeight++;
	continue;
	}
	// This is a leaf node. Move upwards until we reach a node of which we
	// have not yet visited the last child.
	while (pindex) {
	// We are going to either move to a parent or a sibling of pindex.
	// If pindex was the first with a certain property, unset the
	// corresponding variable.
	if (pindex == pindexFirstInvalid) {
	pindexFirstInvalid = nullptr;
	}
	if (pindex == pindexFirstParked) {
	pindexFirstParked = nullptr;
	}
	if (pindex == pindexFirstMissing) {
	pindexFirstMissing = nullptr;
	}
	if (pindex == pindexFirstNeverProcessed) {
	pindexFirstNeverProcessed = nullptr;
	}
	if (pindex == pindexFirstNotTreeValid) {
	pindexFirstNotTreeValid = nullptr;
	}
	if (pindex == pindexFirstNotTransactionsValid) {
	pindexFirstNotTransactionsValid = nullptr;
	}
	if (pindex == pindexFirstNotChainValid) {
	pindexFirstNotChainValid = nullptr;
	}
	if (pindex == pindexFirstNotScriptsValid) {
	pindexFirstNotScriptsValid = nullptr;
	}
	// Find our parent.
	CBlockIndex *pindexPar = pindex->pprev;
	// Find which child we just visited.
	std::pair<std::multimap<CBlockIndex , CBlockIndex >::iterator,
	std::multimap<CBlockIndex , CBlockIndex >::iterator>
	rangePar = forward.equal_range(pindexPar);
	while (rangePar.first->second != pindex) {
	// Our parent must have at least the node we're coming from as
	// child.
	assert(rangePar.first != rangePar.second);
	rangePar.first++;
	}
	// Proceed to the next one.
	rangePar.first++;
	if (rangePar.first != rangePar.second) {
	// Move to the sibling.
	pindex = rangePar.first->second;
	break;
	} else {
	// Move up further.
	pindex = pindexPar;
	nHeight--;
	continue;
	}
	}
	}

	// Check that we actually traversed the entire map.
	assert(nNodes == forward.size());
	}

	std::string Chainstate::ToString() {
	AssertLockHeld(::cs_main);
	CBlockIndex *tip = m_chain.Tip();
	return strprintf("Chainstate [%s] @ height %d (%s)",
	m_from_snapshot_blockhash ? "snapshot" : "ibd",
	tip ? tip->nHeight : -1,
	tip ? tip->GetBlockHash().ToString() : "null");
	}

	bool Chainstate::ResizeCoinsCaches(size_t coinstip_size, size_t coinsdb_size) {
	AssertLockHeld(::cs_main);
	if (coinstip_size == m_coinstip_cache_size_bytes &&
	coinsdb_size == m_coinsdb_cache_size_bytes) {
	// Cache sizes are unchanged, no need to continue.
	return true;
	}
	size_t old_coinstip_size = m_coinstip_cache_size_bytes;
	m_coinstip_cache_size_bytes = coinstip_size;
	m_coinsdb_cache_size_bytes = coinsdb_size;
	CoinsDB().ResizeCache(coinsdb_size);

	LogPrintf("[%s] resized coinsdb cache to %.1f MiB\n", this->ToString(),
	coinsdb_size * (1.0 / 1024 / 1024));
	LogPrintf("[%s] resized coinstip cache to %.1f MiB\n", this->ToString(),
	coinstip_size * (1.0 / 1024 / 1024));

	BlockValidationState state;
	bool ret;

	if (coinstip_size > old_coinstip_size) {
	// Likely no need to flush if cache sizes have grown.
	ret = FlushStateToDisk(state, FlushStateMode::IF_NEEDED);
	} else {
	// Otherwise, flush state to disk and deallocate the in-memory coins
	// map.
	ret = FlushStateToDisk(state, FlushStateMode::ALWAYS);
	CoinsTip().ReallocateCache();
	}
	return ret;
	}

	static const uint64_t MEMPOOL_DUMP_VERSION = 1;

	bool LoadMempool(const Config &config, CTxMemPool &pool,
	Chainstate &active_chainstate,
	FopenFn mockable_fopen_function) {
	int64_t nExpiryTimeout = std::chrono::seconds{pool.m_expiry}.count();
	FILE *filestr{
	mockable_fopen_function(gArgs.GetDataDirNet() / "mempool.dat", "rb")};
	CAutoFile file(filestr, SER_DISK, CLIENT_VERSION);
	if (file.IsNull()) {
	LogPrintf(
	"Failed to open mempool file from disk. Continuing anyway.\n");
	return false;
	}

	int64_t count = 0;
	int64_t expired = 0;
	int64_t failed = 0;
	int64_t already_there = 0;
	int64_t unbroadcast = 0;
	int64_t nNow = GetTime();

	try {
	uint64_t version;
	file >> version;
	if (version != MEMPOOL_DUMP_VERSION) {
	return false;
	}

	uint64_t num;
	file >> num;
	while (num) {
	--num;
	CTransactionRef tx;
	int64_t nTime;
	int64_t nFeeDelta;
	file >> tx;
	file >> nTime;
	file >> nFeeDelta;

	Amount amountdelta = nFeeDelta * SATOSHI;
	if (amountdelta != Amount::zero()) {
	pool.PrioritiseTransaction(tx->GetId(), amountdelta);
	}
	if (nTime > nNow - nExpiryTimeout) {
	LOCK(cs_main);
	const auto &accepted =
	AcceptToMemoryPool(config, active_chainstate, tx, nTime,
	/bypass_limits=/false,
	/test_accept=/false);
	if (accepted.m_result_type ==
	MempoolAcceptResult::ResultType::VALID) {
	++count;
	} else {
	// mempool may contain the transaction already, e.g. from
	// wallet(s) having loaded it while we were processing
	// mempool transactions; consider these as valid, instead of
	// failed, but mark them as 'already there'
	if (pool.exists(tx->GetId())) {
	++already_there;
	} else {
	++failed;
	}
	}
	} else {
	++expired;
	}

	if (ShutdownRequested()) {
	return false;
	}
	}
	std::map<TxId, Amount> mapDeltas;
	file >> mapDeltas;

	for (const auto &i : mapDeltas) {
	pool.PrioritiseTransaction(i.first, i.second);
	}

	std::set<TxId> unbroadcast_txids;
	file >> unbroadcast_txids;
	unbroadcast = unbroadcast_txids.size();
	for (const auto &txid : unbroadcast_txids) {
	// Ensure transactions were accepted to mempool then add to
	// unbroadcast set.
	if (pool.get(txid) != nullptr) {
	pool.AddUnbroadcastTx(txid);
	}
	}
	} catch (const std::exception &e) {
	LogPrintf("Failed to deserialize mempool data on disk: %s. Continuing "
	"anyway.\n",
	e.what());
	return false;
	}

	LogPrintf("Imported mempool transactions from disk: %i succeeded, %i "
	"failed, %i expired, %i already there, %i waiting for initial "
	"broadcast\n",
	count, failed, expired, already_there, unbroadcast);
	return true;
	}

	bool DumpMempool(const CTxMemPool &pool, const fs::path &dump_path,
	FopenFn mockable_fopen_function, bool skip_file_commit) {
	auto start = SteadyClock::now();

	std::map<uint256, Amount> mapDeltas;
	std::vector<TxMempoolInfo> vinfo;
	std::set<TxId> unbroadcast_txids;

	static Mutex dump_mutex;
	LOCK(dump_mutex);

	{
	LOCK(pool.cs);
	for (const auto &i : pool.mapDeltas) {
	mapDeltas[i.first] = i.second;
	}

	vinfo = pool.infoAll();
	unbroadcast_txids = pool.GetUnbroadcastTxs();
	}

	auto mid = SteadyClock::now();

	try {
	FILE *filestr{mockable_fopen_function(dump_path + ".new", "wb")};
	if (!filestr) {
	return false;
	}

	CAutoFile file(filestr, SER_DISK, CLIENT_VERSION);

	uint64_t version = MEMPOOL_DUMP_VERSION;
	file << version;

	file << uint64_t(vinfo.size());
	for (const auto &i : vinfo) {
	file << *(i.tx);
	file << int64_t(count_seconds(i.m_time));
	file << i.nFeeDelta;
	mapDeltas.erase(i.tx->GetId());
	}

	file << mapDeltas;

	LogPrintf("Writing %d unbroadcast transactions to disk.\n",
	unbroadcast_txids.size());
	file << unbroadcast_txids;

	if (!skip_file_commit && !FileCommit(file.Get())) {
	throw std::runtime_error("FileCommit failed");
	}
	file.fclose();
	if (!RenameOver(dump_path + ".new", dump_path)) {
	throw std::runtime_error("Rename failed");
	}
	auto last = SteadyClock::now();

	LogPrintf("Dumped mempool: %gs to copy, %gs to dump\n",
	Ticks<SecondsDouble>(mid - start),
	Ticks<SecondsDouble>(last - mid));
	} catch (const std::exception &e) {
	LogPrintf("Failed to dump mempool: %s. Continuing anyway.\n", e.what());
	return false;
	}
	return true;
	}

	//! Guess how far we are in the verification process at the given block index
	//! require cs_main if pindex has not been validated yet (because the chain's
	//! transaction count might be unset) This conditional lock requirement might be
	//! confusing, see: https://github.com/bitcoin/bitcoin/issues/15994
	double GuessVerificationProgress(const ChainTxData &data,
	const CBlockIndex *pindex) {
	if (pindex == nullptr) {
	return 0.0;
	}

	int64_t nNow = time(nullptr);

	double fTxTotal;
	if (pindex->GetChainTxCount() <= data.nTxCount) {
	fTxTotal = data.nTxCount + (nNow - data.nTime) * data.dTxRate;
	} else {
	fTxTotal = pindex->GetChainTxCount() +
	(nNow - pindex->GetBlockTime()) * data.dTxRate;
	}

	return std::min<double>(pindex->GetChainTxCount() / fTxTotal, 1.0);
	}

	std::optional<BlockHash> ChainstateManager::SnapshotBlockhash() const {
	LOCK(::cs_main);
	if (m_active_chainstate && m_active_chainstate->m_from_snapshot_blockhash) {
	// If a snapshot chainstate exists, it will always be our active.
	return m_active_chainstate->m_from_snapshot_blockhash;
	}
	return std::nullopt;
	}

	std::vector<Chainstate *> ChainstateManager::GetAll() {
	LOCK(::cs_main);
	std::vector<Chainstate *> out;

	for (Chainstate *pchainstate :
	{m_ibd_chainstate.get(), m_snapshot_chainstate.get()}) {
	if (this->IsUsable(pchainstate)) {
	out.push_back(pchainstate);
	}
	}

	return out;
	}

	Chainstate &ChainstateManager::InitializeChainstate(CTxMemPool *mempool) {
	AssertLockHeld(::cs_main);
	assert(!m_ibd_chainstate);
	assert(!m_active_chainstate);

	m_ibd_chainstate = std::make_unique<Chainstate>(mempool, m_blockman, *this);
	m_active_chainstate = m_ibd_chainstate.get();
	return *m_active_chainstate;
	}

	const AssumeutxoData *ExpectedAssumeutxo(const int height,
	const CChainParams &chainparams) {
	const MapAssumeutxo &valid_assumeutxos_map = chainparams.Assumeutxo();
	const auto assumeutxo_found = valid_assumeutxos_map.find(height);

	if (assumeutxo_found != valid_assumeutxos_map.end()) {
	return &assumeutxo_found->second;
	}
	return nullptr;
	}

	static bool DeleteCoinsDBFromDisk(const fs::path &db_path, bool is_snapshot)
	EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
	AssertLockHeld(::cs_main);

	if (is_snapshot) {
	fs::path base_blockhash_path =
	db_path / node::SNAPSHOT_BLOCKHASH_FILENAME;

	try {
	const bool existed{fs::remove(base_blockhash_path)};
	if (!existed) {
	LogPrintf("[snapshot] snapshot chainstate dir being removed "
	"lacks %s file\n",
	fs::PathToString(node::SNAPSHOT_BLOCKHASH_FILENAME));
	}
	} catch (const fs::filesystem_error &e) {
	LogPrintf("[snapshot] failed to remove file %s: %s\n",
	fs::PathToString(base_blockhash_path),
	fsbridge::get_filesystem_error_message(e));
	}
	}

	std::string path_str = fs::PathToString(db_path);
	LogPrintf("Removing leveldb dir at %s\n", path_str);

	// We have to destruct before this call leveldb::DB in order to release the
	// db lock, otherwise `DestroyDB` will fail. See `leveldb::~DBImpl()`.
	const bool destroyed = dbwrapper::DestroyDB(path_str, {}).ok();

	if (!destroyed) {
	LogPrintf("error: leveldb DestroyDB call failed on %s\n", path_str);
	}

	// Datadir should be removed from filesystem; otherwise initialization may
	// detect it on subsequent statups and get confused.
	//
	// If the base_blockhash_path removal above fails in the case of snapshot
	// chainstates, this will return false since leveldb won't remove a
	// non-empty directory.
	return destroyed && !fs::exists(db_path);
	}

	bool ChainstateManager::ActivateSnapshot(AutoFile &coins_file,
	const SnapshotMetadata &metadata,
	bool in_memory) {
	BlockHash base_blockhash = metadata.m_base_blockhash;

	if (this->SnapshotBlockhash()) {
	LogPrintf("[snapshot] can't activate a snapshot-based chainstate more "
	"than once\n");
	return false;
	}

	int64_t current_coinsdb_cache_size{0};
	int64_t current_coinstip_cache_size{0};

	// Cache percentages to allocate to each chainstate.
	//
	// These particular percentages don't matter so much since they will only be
	// relevant during snapshot activation; caches are rebalanced at the
	// conclusion of this function. We want to give (essentially) all available
	// cache capacity to the snapshot to aid the bulk load later in this
	// function.
	static constexpr double IBD_CACHE_PERC = 0.01;
	static constexpr double SNAPSHOT_CACHE_PERC = 0.99;

	{
	LOCK(::cs_main);
	// Resize the coins caches to ensure we're not exceeding memory limits.
	//
	// Allocate the majority of the cache to the incoming snapshot
	// chainstate, since (optimistically) getting to its tip will be the top
	// priority. We'll need to call `MaybeRebalanceCaches()` once we're done
	// with this function to ensure the right allocation (including the
	// possibility that no snapshot was activated and that we should restore
	// the active chainstate caches to their original size).
	//
	current_coinsdb_cache_size =
	this->ActiveChainstate().m_coinsdb_cache_size_bytes;
	current_coinstip_cache_size =
	this->ActiveChainstate().m_coinstip_cache_size_bytes;

	// Temporarily resize the active coins cache to make room for the
	// newly-created snapshot chain.
	this->ActiveChainstate().ResizeCoinsCaches(
	static_cast<size_t>(current_coinstip_cache_size * IBD_CACHE_PERC),
	static_cast<size_t>(current_coinsdb_cache_size * IBD_CACHE_PERC));
	}

	auto snapshot_chainstate =
	WITH_LOCK(::cs_main, return std::make_unique<Chainstate>(
	/* mempool / nullptr, m_blockman, this,
	base_blockhash));

	{
	LOCK(::cs_main);
	snapshot_chainstate->InitCoinsDB(
	static_cast<size_t>(current_coinsdb_cache_size *
	SNAPSHOT_CACHE_PERC),
	in_memory, false, "chainstate");
	snapshot_chainstate->InitCoinsCache(static_cast<size_t>(
	current_coinstip_cache_size * SNAPSHOT_CACHE_PERC));
	}

	bool snapshot_ok = this->PopulateAndValidateSnapshot(*snapshot_chainstate,
	coins_file, metadata);

	// If not in-memory, persist the base blockhash for use during subsequent
	// initialization.
	if (!in_memory) {
	LOCK(::cs_main);
	if (!node::WriteSnapshotBaseBlockhash(*snapshot_chainstate)) {
	snapshot_ok = false;
	}
	}
	if (!snapshot_ok) {
	LOCK(::cs_main);
	this->MaybeRebalanceCaches();

	// PopulateAndValidateSnapshot can return (in error) before the leveldb
	// datadir has been created, so only attempt removal if we got that far.
	if (auto snapshot_datadir = node::FindSnapshotChainstateDir()) {
	// We have to destruct leveldb::DB in order to release the db lock,
	// otherwise DestroyDB() (in DeleteCoinsDBFromDisk()) will fail. See
	// `leveldb::~DBImpl()`. Destructing the chainstate (and so
	// resetting the coinsviews object) does this.
	snapshot_chainstate.reset();
	bool removed =
	DeleteCoinsDBFromDisk(snapshot_datadir, /is_snapshot=*/true);
	if (!removed) {
	AbortNode(
	strprintf("Failed to remove snapshot chainstate dir (%s). "
	"Manually remove it before restarting.\n",
	fs::PathToString(*snapshot_datadir)));
	}
	}
	return false;
	}

	{
	LOCK(::cs_main);
	assert(!m_snapshot_chainstate);
	m_snapshot_chainstate.swap(snapshot_chainstate);
	const bool chaintip_loaded = m_snapshot_chainstate->LoadChainTip();
	assert(chaintip_loaded);

	m_active_chainstate = m_snapshot_chainstate.get();

	LogPrintf("[snapshot] successfully activated snapshot %s\n",
	base_blockhash.ToString());
	LogPrintf("[snapshot] (%.2f MB)\n",
	m_snapshot_chainstate->CoinsTip().DynamicMemoryUsage() /
	(1000 * 1000));

	this->MaybeRebalanceCaches();
	}
	return true;
	}

	static void FlushSnapshotToDisk(CCoinsViewCache &coins_cache,
	bool snapshot_loaded) {
	LOG_TIME_MILLIS_WITH_CATEGORY_MSG_ONCE(
	strprintf("%s (%.2f MB)",
	snapshot_loaded ? "saving snapshot chainstate"
	: "flushing coins cache",
	coins_cache.DynamicMemoryUsage() / (1000 * 1000)),
	BCLog::LogFlags::ALL);

	coins_cache.Flush();
	}

	struct StopHashingException : public std::exception {
	const char *what() const throw() override {
	return "ComputeUTXOStats interrupted by shutdown.";
	}
	};

	static void SnapshotUTXOHashBreakpoint() {
	if (ShutdownRequested()) {
	throw StopHashingException();
	}
	}

	bool ChainstateManager::PopulateAndValidateSnapshot(
	Chainstate &snapshot_chainstate, AutoFile &coins_file,
	const SnapshotMetadata &metadata) {
	// It's okay to release cs_main before we're done using `coins_cache`
	// because we know that nothing else will be referencing the newly created
	// snapshot_chainstate yet.
	CCoinsViewCache &coins_cache =
	*WITH_LOCK(::cs_main, return &snapshot_chainstate.CoinsTip());

	BlockHash base_blockhash = metadata.m_base_blockhash;

	CBlockIndex *snapshot_start_block = WITH_LOCK(
	::cs_main, return m_blockman.LookupBlockIndex(base_blockhash));

	if (!snapshot_start_block) {
	// Needed for ComputeUTXOStats and ExpectedAssumeutxo to determine the
	// height and to avoid a crash when base_blockhash.IsNull()
	LogPrintf("[snapshot] Did not find snapshot start blockheader %s\n",
	base_blockhash.ToString());
	return false;
	}

	int base_height = snapshot_start_block->nHeight;
	auto maybe_au_data = ExpectedAssumeutxo(base_height, GetParams());

	if (!maybe_au_data) {
	LogPrintf("[snapshot] assumeutxo height in snapshot metadata not "
	"recognized (%d) - refusing to load snapshot\n",
	base_height);
	return false;
	}

	const AssumeutxoData &au_data = *maybe_au_data;

	COutPoint outpoint;
	Coin coin;
	const uint64_t coins_count = metadata.m_coins_count;
	uint64_t coins_left = metadata.m_coins_count;

	LogPrintf("[snapshot] loading coins from snapshot %s\n",
	base_blockhash.ToString());
	int64_t coins_processed{0};

	while (coins_left > 0) {
	try {
	coins_file >> outpoint;
	coins_file >> coin;
	} catch (const std::ios_base::failure &) {
	LogPrintf("[snapshot] bad snapshot format or truncated snapshot "
	"after deserializing %d coins\n",
	coins_count - coins_left);
	return false;
	}
	if (coin.GetHeight() > uint32_t(base_height) \|\|
	// Avoid integer wrap-around in coinstats.cpp:ApplyHash
	outpoint.GetN() >=
	std::numeric_limits<decltype(outpoint.GetN())>::max()) {
	LogPrintf(
	"[snapshot] bad snapshot data after deserializing %d coins\n",
	coins_count - coins_left);
	return false;
	}
	coins_cache.EmplaceCoinInternalDANGER(std::move(outpoint),
	std::move(coin));

	--coins_left;
	++coins_processed;

	if (coins_processed % 1000000 == 0) {
	LogPrintf("[snapshot] %d coins loaded (%.2f%%, %.2f MB)\n",
	coins_processed,
	static_cast<float>(coins_processed) * 100 /
	static_cast<float>(coins_count),
	coins_cache.DynamicMemoryUsage() / (1000 * 1000));
	}

	// Batch write and flush (if we need to) every so often.
	//
	// If our average Coin size is roughly 41 bytes, checking every 120,000
	// coins means <5MB of memory imprecision.
	if (coins_processed % 120000 == 0) {
	if (ShutdownRequested()) {
	return false;
	}

	const auto snapshot_cache_state = WITH_LOCK(
	::cs_main, return snapshot_chainstate.GetCoinsCacheSizeState());

	if (snapshot_cache_state >= CoinsCacheSizeState::CRITICAL) {
	// This is a hack - we don't know what the actual best block is,
	// but that doesn't matter for the purposes of flushing the
	// cache here. We'll set this to its correct value
	// (`base_blockhash`) below after the coins are loaded.
	coins_cache.SetBestBlock(BlockHash{GetRandHash()});

	// No need to acquire cs_main since this chainstate isn't being
	// used yet.
	FlushSnapshotToDisk(coins_cache, /snapshot_loaded=/false);
	}
	}
	}

	// Important that we set this. This and the coins_cache accesses above are
	// sort of a layer violation, but either we reach into the innards of
	// CCoinsViewCache here or we have to invert some of the Chainstate to
	// embed them in a snapshot-activation-specific CCoinsViewCache bulk load
	// method.
	coins_cache.SetBestBlock(base_blockhash);

	bool out_of_coins{false};
	try {
	coins_file >> outpoint;
	} catch (const std::ios_base::failure &) {
	// We expect an exception since we should be out of coins.
	out_of_coins = true;
	}
	if (!out_of_coins) {
	LogPrintf("[snapshot] bad snapshot - coins left over after "
	"deserializing %d coins\n",
	coins_count);
	return false;
	}

	LogPrintf("[snapshot] loaded %d (%.2f MB) coins from snapshot %s\n",
	coins_count, coins_cache.DynamicMemoryUsage() / (1000 * 1000),
	base_blockhash.ToString());

	// No need to acquire cs_main since this chainstate isn't being used yet.
	FlushSnapshotToDisk(coins_cache, /snapshot_loaded=/true);

	assert(coins_cache.GetBestBlock() == base_blockhash);

	// As above, okay to immediately release cs_main here since no other context
	// knows about the snapshot_chainstate.
	CCoinsViewDB *snapshot_coinsdb =
	WITH_LOCK(::cs_main, return &snapshot_chainstate.CoinsDB());

	std::optional<CCoinsStats> maybe_stats;

	try {
	maybe_stats = ComputeUTXOStats(CoinStatsHashType::HASH_SERIALIZED,
	snapshot_coinsdb, m_blockman,
	SnapshotUTXOHashBreakpoint);
	} catch (StopHashingException const &) {
	return false;
	}
	if (!maybe_stats.has_value()) {
	LogPrintf("[snapshot] failed to generate coins stats\n");
	return false;
	}

	// Assert that the deserialized chainstate contents match the expected
	// assumeutxo value.
	if (AssumeutxoHash{maybe_stats->hashSerialized} !=
	au_data.hash_serialized) {
	LogPrintf("[snapshot] bad snapshot content hash: expected %s, got %s\n",
	au_data.hash_serialized.ToString(),
	maybe_stats->hashSerialized.ToString());
	return false;
	}

	snapshot_chainstate.m_chain.SetTip(snapshot_start_block);

	// The remainder of this function requires modifying data protected by
	// cs_main.
	LOCK(::cs_main);

	// Fake various pieces of CBlockIndex state:
	CBlockIndex *index = nullptr;

	// Don't make any modifications to the genesis block.
	// This is especially important because we don't want to erroneously
	// apply ASSUMED_VALID_FLAG to genesis, which would happen if we didn't
	// skip it here (since it apparently isn't BlockValidity::SCRIPTS).
	constexpr int AFTER_GENESIS_START{1};

	for (int i = AFTER_GENESIS_START; i <= snapshot_chainstate.m_chain.Height();
	++i) {
	index = snapshot_chainstate.m_chain[i];

	// Fake nTx so that LoadBlockIndex() loads assumed-valid CBlockIndex
	// entries (among other things)
	if (!index->nTx) {
	index->nTx = 1;
	}
	// Fake nChainTx so that GuessVerificationProgress reports accurately
	index->nChainTx = index->pprev->nChainTx + index->nTx;

	// Mark unvalidated block index entries beneath the snapshot base block
	// as assumed-valid.
	if (!index->IsValid(BlockValidity::SCRIPTS)) {
	// This flag will be removed once the block is fully validated by a
	// background chainstate.
	index->nStatus = index->nStatus.withAssumedValid();
	}

	m_blockman.m_dirty_blockindex.insert(index);
	// Changes to the block index will be flushed to disk after this call
	// returns in `ActivateSnapshot()`, when `MaybeRebalanceCaches()` is
	// called, since we've added a snapshot chainstate and therefore will
	// have to downsize the IBD chainstate, which will result in a call to
	// `FlushStateToDisk(ALWAYS)`.
	}

	assert(index);
	index->nChainTx = au_data.nChainTx;
	snapshot_chainstate.setBlockIndexCandidates.insert(snapshot_start_block);

	LogPrintf("[snapshot] validated snapshot (%.2f MB)\n",
	coins_cache.DynamicMemoryUsage() / (1000 * 1000));
	return true;
	}

	// Currently, this function holds cs_main for its duration, which could be for
	// multiple minutes due to the ComputeUTXOStats call. This hold is necessary
	// because we need to avoid advancing the background validation chainstate
	// farther than the snapshot base block - and this function is also invoked
	// from within ConnectTip, i.e. from within ActivateBestChain, so cs_main is
	// held anyway.
	//
	// Eventually (TODO), we could somehow separate this function's runtime from
	// maintenance of the active chain, but that will either require
	//
	// (i) setting `m_disabled` immediately and ensuring all chainstate accesses go
	// through IsUsable() checks, or
	//
	// (ii) giving each chainstate its own lock instead of using cs_main for
	// everything.
	SnapshotCompletionResult ChainstateManager::MaybeCompleteSnapshotValidation(
	std::function<void(bilingual_str)> shutdown_fnc) {
	AssertLockHeld(cs_main);
	if (m_ibd_chainstate.get() == &this->ActiveChainstate() \|\|
	!this->IsUsable(m_snapshot_chainstate.get()) \|\|
	!this->IsUsable(m_ibd_chainstate.get()) \|\|
	!m_ibd_chainstate->m_chain.Tip()) {
	// Nothing to do - this function only applies to the background
	// validation chainstate.
	return SnapshotCompletionResult::SKIPPED;
	}
	const int snapshot_tip_height = this->ActiveHeight();
	const int snapshot_base_height = *Assert(this->GetSnapshotBaseHeight());
	const CBlockIndex &index_new = *Assert(m_ibd_chainstate->m_chain.Tip());

	if (index_new.nHeight < snapshot_base_height) {
	// Background IBD not complete yet.
	return SnapshotCompletionResult::SKIPPED;
	}

	assert(SnapshotBlockhash());
	BlockHash snapshot_blockhash = *Assert(SnapshotBlockhash());

	auto handle_invalid_snapshot = [&]() EXCLUSIVE_LOCKS_REQUIRED(::cs_main) {
	bilingual_str user_error = strprintf(
	_("%s failed to validate the -assumeutxo snapshot state. "
	"This indicates a hardware problem, or a bug in the software, or "
	"a bad software modification that allowed an invalid snapshot to "
	"be loaded. As a result of this, the node will shut down and "
	"stop using any state that was built on the snapshot, resetting "
	"the chain height from %d to %d. On the next restart, the node "
	"will resume syncing from %d without using any snapshot data. "
	"Please report this incident to %s, including how you obtained "
	"the snapshot. The invalid snapshot chainstate has been left on "
	"disk in case it is helpful in diagnosing the issue that caused "
	"this error."),
	PACKAGE_NAME, snapshot_tip_height, snapshot_base_height,
	snapshot_base_height, PACKAGE_BUGREPORT);

	LogPrintf("[snapshot] !!! %s\n", user_error.original);
	LogPrintf("[snapshot] deleting snapshot, reverting to validated chain, "
	"and stopping node\n");

	m_active_chainstate = m_ibd_chainstate.get();
	m_snapshot_chainstate->m_disabled = true;
	assert(!this->IsUsable(m_snapshot_chainstate.get()));
	assert(this->IsUsable(m_ibd_chainstate.get()));

	m_snapshot_chainstate->InvalidateCoinsDBOnDisk();

	shutdown_fnc(user_error);
	};

	if (index_new.GetBlockHash() != snapshot_blockhash) {
	LogPrintf(
	"[snapshot] supposed base block %s does not match the "
	"snapshot base block %s (height %d). Snapshot is not valid.\n",
	index_new.ToString(), snapshot_blockhash.ToString(),
	snapshot_base_height);
	handle_invalid_snapshot();
	return SnapshotCompletionResult::BASE_BLOCKHASH_MISMATCH;
	}

	assert(index_new.nHeight == snapshot_base_height);

	int curr_height = m_ibd_chainstate->m_chain.Height();

	assert(snapshot_base_height == curr_height);
	assert(snapshot_base_height == index_new.nHeight);
	assert(this->IsUsable(m_snapshot_chainstate.get()));
	assert(this->GetAll().size() == 2);

	CCoinsViewDB &ibd_coins_db = m_ibd_chainstate->CoinsDB();
	m_ibd_chainstate->ForceFlushStateToDisk();

	auto maybe_au_data = ExpectedAssumeutxo(curr_height, GetParams());
	if (!maybe_au_data) {
	LogPrintf("[snapshot] assumeutxo data not found for height "
	"(%d) - refusing to validate snapshot\n",
	curr_height);
	handle_invalid_snapshot();
	return SnapshotCompletionResult::MISSING_CHAINPARAMS;
	}

	const AssumeutxoData &au_data = *maybe_au_data;
	std::optional<CCoinsStats> maybe_ibd_stats;
	LogPrintf(
	"[snapshot] computing UTXO stats for background chainstate to validate "
	"snapshot - this could take a few minutes\n");
	try {
	maybe_ibd_stats =
	ComputeUTXOStats(CoinStatsHashType::HASH_SERIALIZED, &ibd_coins_db,
	m_blockman, SnapshotUTXOHashBreakpoint);
	} catch (StopHashingException const &) {
	return SnapshotCompletionResult::STATS_FAILED;
	}

	if (!maybe_ibd_stats) {
	LogPrintf(
	"[snapshot] failed to generate stats for validation coins db\n");
	// While this isn't a problem with the snapshot per se, this condition
	// prevents us from validating the snapshot, so we should shut down and
	// let the user handle the issue manually.
	handle_invalid_snapshot();
	return SnapshotCompletionResult::STATS_FAILED;
	}
	const auto &ibd_stats = *maybe_ibd_stats;

	// Compare the background validation chainstate's UTXO set hash against the
	// hard-coded assumeutxo hash we expect.
	//
	// TODO: For belt-and-suspenders, we could cache the UTXO set
	// hash for the snapshot when it's loaded in its chainstate's leveldb. We
	// could then reference that here for an additional check.
	if (AssumeutxoHash{ibd_stats.hashSerialized} != au_data.hash_serialized) {
	LogPrintf("[snapshot] hash mismatch: actual=%s, expected=%s\n",
	ibd_stats.hashSerialized.ToString(),
	au_data.hash_serialized.ToString());
	handle_invalid_snapshot();
	return SnapshotCompletionResult::HASH_MISMATCH;
	}

	LogPrintf("[snapshot] snapshot beginning at %s has been fully validated\n",
	snapshot_blockhash.ToString());

	m_ibd_chainstate->m_disabled = true;
	this->MaybeRebalanceCaches();

	return SnapshotCompletionResult::SUCCESS;
	}

	Chainstate &ChainstateManager::ActiveChainstate() const {
	LOCK(::cs_main);
	assert(m_active_chainstate);
	return *m_active_chainstate;
	}

	bool ChainstateManager::IsSnapshotActive() const {
	LOCK(::cs_main);
	return m_snapshot_chainstate &&
	m_active_chainstate == m_snapshot_chainstate.get();
	}
	void ChainstateManager::MaybeRebalanceCaches() {
	AssertLockHeld(::cs_main);
	bool ibd_usable = this->IsUsable(m_ibd_chainstate.get());
	bool snapshot_usable = this->IsUsable(m_snapshot_chainstate.get());
	assert(ibd_usable \|\| snapshot_usable);

	if (ibd_usable && !snapshot_usable) {
	LogPrintf("[snapshot] allocating all cache to the IBD chainstate\n");
	// Allocate everything to the IBD chainstate.
	m_ibd_chainstate->ResizeCoinsCaches(m_total_coinstip_cache,
	m_total_coinsdb_cache);
	} else if (snapshot_usable && !ibd_usable) {
	// If background validation has completed and snapshot is our active
	// chain...
	LogPrintf(
	"[snapshot] allocating all cache to the snapshot chainstate\n");
	// Allocate everything to the snapshot chainstate.
	m_snapshot_chainstate->ResizeCoinsCaches(m_total_coinstip_cache,
	m_total_coinsdb_cache);
	} else if (ibd_usable && snapshot_usable) {
	// If both chainstates exist, determine who needs more cache based on
	// IBD status.
	//
	// Note: shrink caches first so that we don't inadvertently overwhelm
	// available memory.
	if (m_snapshot_chainstate->IsInitialBlockDownload()) {
	m_ibd_chainstate->ResizeCoinsCaches(m_total_coinstip_cache * 0.05,
	m_total_coinsdb_cache * 0.05);
	m_snapshot_chainstate->ResizeCoinsCaches(
	m_total_coinstip_cache * 0.95, m_total_coinsdb_cache * 0.95);
	} else {
	m_snapshot_chainstate->ResizeCoinsCaches(
	m_total_coinstip_cache * 0.05, m_total_coinsdb_cache * 0.05);
	m_ibd_chainstate->ResizeCoinsCaches(m_total_coinstip_cache * 0.95,
	m_total_coinsdb_cache * 0.95);
	}
	}
	}

	void ChainstateManager::ResetChainstates() {
	m_ibd_chainstate.reset();
	m_snapshot_chainstate.reset();
	m_active_chainstate = nullptr;
	}

	bool ChainstateManager::DetectSnapshotChainstate(CTxMemPool *mempool) {
	assert(!m_snapshot_chainstate);
	std::optional<fs::path> path = node::FindSnapshotChainstateDir();
	if (!path) {
	return false;
	}
	std::optional<BlockHash> base_blockhash =
	node::ReadSnapshotBaseBlockhash(*path);
	if (!base_blockhash) {
	return false;
	}
	LogPrintf("[snapshot] detected active snapshot chainstate (%s) - loading\n",
	fs::PathToString(*path));

	this->ActivateExistingSnapshot(mempool, *base_blockhash);
	return true;
	}

	Chainstate &
	ChainstateManager::ActivateExistingSnapshot(CTxMemPool *mempool,
	BlockHash base_blockhash) {
	assert(!m_snapshot_chainstate);
	m_snapshot_chainstate = std::make_unique<Chainstate>(mempool, m_blockman,
	*this, base_blockhash);
	LogPrintf("[snapshot] switching active chainstate to %s\n",
	m_snapshot_chainstate->ToString());
	m_active_chainstate = m_snapshot_chainstate.get();
	return *m_snapshot_chainstate;
	}

	void Chainstate::InvalidateCoinsDBOnDisk() {
	AssertLockHeld(::cs_main);
	// Should never be called on a non-snapshot chainstate.
	assert(m_from_snapshot_blockhash);
	auto storage_path_maybe = this->CoinsDB().StoragePath();
	// Should never be called with a non-existent storage path.
	assert(storage_path_maybe);
	fs::path snapshot_datadir = *storage_path_maybe;

	// Coins views no longer usable.
	m_coins_views.reset();

	auto invalid_path = snapshot_datadir + "_INVALID";
	std::string dbpath = fs::PathToString(snapshot_datadir);
	std::string target = fs::PathToString(invalid_path);
	LogPrintf("[snapshot] renaming snapshot datadir %s to %s\n", dbpath,
	target);

	// The invalid snapshot datadir is simply moved and not deleted because we
	// may want to do forensics later during issue investigation. The user is
	// instructed accordingly in MaybeCompleteSnapshotValidation().
	try {
	fs::rename(snapshot_datadir, invalid_path);
	} catch (const fs::filesystem_error &e) {
	auto src_str = fs::PathToString(snapshot_datadir);
	auto dest_str = fs::PathToString(invalid_path);

	LogPrintf("%s: error renaming file '%s' -> '%s': %s\n", __func__,
	src_str, dest_str, e.what());
	AbortNode(strprintf("Rename of '%s' -> '%s' failed. "
	"You should resolve this by manually moving or "
	"deleting the invalid "
	"snapshot directory %s, otherwise you will "
	"encounter the same error again "
	"on the next startup.",
	src_str, dest_str, src_str));
	}
	}

	const CBlockIndex *ChainstateManager::GetSnapshotBaseBlock() const {
	const auto blockhash_op = this->SnapshotBlockhash();
	if (!blockhash_op) {
	return nullptr;
	}
	return Assert(m_blockman.LookupBlockIndex(*blockhash_op));
	}

	std::optional<int> ChainstateManager::GetSnapshotBaseHeight() const {
	const CBlockIndex *base = this->GetSnapshotBaseBlock();
	return base ? std::make_optional(base->nHeight) : std::nullopt;
	}

	bool ChainstateManager::ValidatedSnapshotCleanup() {
	AssertLockHeld(::cs_main);
	auto get_storage_path = [](auto &chainstate) EXCLUSIVE_LOCKS_REQUIRED(
	::cs_main) -> std::optional<fs::path> {
	if (!(chainstate && chainstate->HasCoinsViews())) {
	return {};
	}
	return chainstate->CoinsDB().StoragePath();
	};
	std::optional<fs::path> ibd_chainstate_path_maybe =
	get_storage_path(m_ibd_chainstate);
	std::optional<fs::path> snapshot_chainstate_path_maybe =
	get_storage_path(m_snapshot_chainstate);

	if (!this->IsSnapshotValidated()) {
	// No need to clean up.
	return false;
	}
	// If either path doesn't exist, that means at least one of the chainstates
	// is in-memory, in which case we can't do on-disk cleanup. You'd better be
	// in a unittest!
	if (!ibd_chainstate_path_maybe \|\| !snapshot_chainstate_path_maybe) {
	LogPrintf("[snapshot] snapshot chainstate cleanup cannot happen with "
	"in-memory chainstates. You are testing, right?\n");
	return false;
	}

	const auto &snapshot_chainstate_path = *snapshot_chainstate_path_maybe;
	const auto &ibd_chainstate_path = *ibd_chainstate_path_maybe;

	// Since we're going to be moving around the underlying leveldb filesystem
	// content for each chainstate, make sure that the chainstates (and their
	// constituent CoinsViews members) have been destructed first.
	//
	// The caller of this method will be responsible for reinitializing
	// chainstates if they want to continue operation.
	this->ResetChainstates();

	// No chainstates should be considered usable.
	assert(this->GetAll().size() == 0);

	LogPrintf("[snapshot] deleting background chainstate directory (now "
	"unnecessary) (%s)\n",
	fs::PathToString(ibd_chainstate_path));

	fs::path tmp_old{ibd_chainstate_path + "_todelete"};

	auto rename_failed_abort = [](fs::path p_old, fs::path p_new,
	const fs::filesystem_error &err) {
	LogPrintf("Error renaming file (%s): %s\n", fs::PathToString(p_old),
	err.what());
	AbortNode(strprintf(
	"Rename of '%s' -> '%s' failed. "
	"Cannot clean up the background chainstate leveldb directory.",
	fs::PathToString(p_old), fs::PathToString(p_new)));
	};

	try {
	fs::rename(ibd_chainstate_path, tmp_old);
	} catch (const fs::filesystem_error &e) {
	rename_failed_abort(ibd_chainstate_path, tmp_old, e);
	throw;
	}

	LogPrintf("[snapshot] moving snapshot chainstate (%s) to "
	"default chainstate directory (%s)\n",
	fs::PathToString(snapshot_chainstate_path),
	fs::PathToString(ibd_chainstate_path));

	try {
	fs::rename(snapshot_chainstate_path, ibd_chainstate_path);
	} catch (const fs::filesystem_error &e) {
	rename_failed_abort(snapshot_chainstate_path, ibd_chainstate_path, e);
	throw;
	}

	if (!DeleteCoinsDBFromDisk(tmp_old, /is_snapshot=/false)) {
	// No need to AbortNode because once the unneeded bg chainstate data is
	// moved, it will not interfere with subsequent initialization.
	LogPrintf("Deletion of %s failed. Please remove it manually, as the "
	"directory is now unnecessary.\n",
	fs::PathToString(tmp_old));
	} else {
	LogPrintf("[snapshot] deleted background chainstate directory (%s)\n",
	fs::PathToString(ibd_chainstate_path));
	}
	return true;
	}

File Metadata

Mime Type: text/x-diff
Expires: Wed, May 21, 19:37 (1 d, 3 h)
Storage Engine: blob
Storage Format: Raw Data
Storage Handle: 5865800
Default Alt Text: (498 KB)

No OneTemporaryActions

View Options

File Metadata

Event Timeline

No OneTemporary
Actions