28:I[49813,["/_next/static/chunks/3fntmmi971322.js","/_next/static/chunks/2z2rzbhvs4alm.js","/_next/static/chunks/2o8aqne6zrjpk.js","/_next/static/chunks/2rt30ysyypg2r.js","/_next/static/chunks/3vwx4w48i_94p.js","/_next/static/chunks/44hzt1esx8oc4.js","/_next/static/chunks/204ajj8ij30o4.js","/_next/static/chunks/12atl0av32l1x.js","/_next/static/chunks/1hqn9gft3gnvj.js"],"CodeWorkspace"] 29:T48a,Merge bitcoin/bitcoin#36310: rpc: clarify that `getaddrmaninfo` counts unique addresses 0d34b6e9287f523adf1c85a05ada2ba21f0d820c rpc: clarify that getaddrmaninfo counts unique addresses (0xb10c) Pull request description: While using the `getaddrmaninfo` RPC for monitoring the sizes of my address managers, we noticed that it returns the count of unique addresses in the tables. While the addresses in the `tried` table are always unique, the `new` table might contain an address multiple times if we received it from sources in different network groups. I incorrectly assumed the returned values to be the number of address manager slots filled. To make this clearer for the next person, I'm clarifying this in the documentation. The number of filled addrman slots can be derived from the output of the hidden `getrawaddrman` RPC. ACKs for top commit: fjahr: ACK 0d34b6e9287f523adf1c85a05ada2ba21f0d820c stratospher: ACK 0d34b6e. danielabrozzoni: ACK 0d34b6e9287f523adf1c85a05ada2ba21f0d820c Tree-SHA512: 44c607ada730d7264cacd1ba8930cc60d84e59bc92e4e08b98f2453c951f2e0251707cd968bf39d544426a674b78aa5f99b8df08acc06201fceae423ffd814e22a:T3f19,// Copyright (c) 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 #include #include #include #include #include #include #include #ifndef BITCOIN_TXGRAPH_H #define BITCOIN_TXGRAPH_H inline constexpr unsigned MAX_CLUSTER_COUNT_LIMIT{64}; /** Data structure to encapsulate fees, sizes, and dependencies for a set of transactions. * * Each TxGraph represents one or two such graphs ("main", and optionally "staging"), to allow for * working with batches of changes that may still be discarded. * * The connected components within each transaction graph are called clusters: whenever one * transaction is reachable from another, through any sequence of is-parent-of or is-child-of * relations, they belong to the same cluster (so clusters include parents, children, but also * grandparents, siblings, cousins twice removed, ...). * * For each graph, TxGraph implicitly defines an associated total ordering on its transactions * (its linearization) that respects topology (parents go before their children), aiming for it to * be close to the optimal order those transactions should be mined in if the goal is fee * maximization, though this is a best effort only, not a strong guarantee. * * For more explanation, see https://delvingbitcoin.org/t/introduction-to-cluster-linearization/1032 * * This linearization is partitioned into chunks: groups of transactions that according to this * order would be mined together. Each chunk consists of the highest-feerate prefix of what remains * of the linearization after removing previous chunks. TxGraph guarantees that the maintained * linearization always results in chunks consisting of transactions that are connected. A chunk's * transactions always belong to the same cluster. * * The interface is designed to accommodate an implementation that only stores the transitive * closure of dependencies, so if B spends C, it does not distinguish between "A spending B" and * "A spending both B and C". */ class TxGraph { public: /** Internal identifier for a transaction within a TxGraph. */ using GraphIndex = uint32_t; /** Data type used to reference transactions within a TxGraph. * * Every transaction within a TxGraph has exactly one corresponding TxGraph::Ref, held by users * of the class. Destroying the TxGraph::Ref removes the corresponding transaction (in both the * main and staging graphs). * * Users of the class can inherit from TxGraph::Ref. If all Refs are inherited this way, the * Ref* pointers returned by TxGraph functions can be cast to, and used as, this inherited type. */ class Ref; enum class Level { TOP, //!< Refers to staging if it exists, main otherwise. MAIN //!< Always refers to the main graph, whether staging is present or not. }; /** Virtual destructor, so inheriting is safe. */ virtual ~TxGraph() = default; /** Initialize arg (which must be an empty Ref) to refer to a new transaction in this graph * with the specified feerate. * * If a staging graph exists, the new transaction is only created there. feerate.size must be * strictly positive. In all further calls, only Refs passed to AddTransaction() are allowed * to be passed to this TxGraph object (or empty Ref objects). Ref objects may outlive the * TxGraph they were added to. */ virtual void AddTransaction(Ref& arg, const FeePerWeight& feerate) noexcept = 0; /** Remove the specified transaction. If a staging graph exists, the removal only happens * there. This is a no-op if the transaction was already removed. * * TxGraph may internally reorder transaction removals with dependency additions for * performance reasons. If together with any transaction removal all its descendants, or all * its ancestors, are removed as well (which is what always happens in realistic scenarios), * this reordering will not affect the behavior of TxGraph. * * As an example, imagine 3 transactions A,B,C where B depends on A. If a dependency of C on B * is added, and then B is deleted, C will still depend on A. If the deletion of B is reordered * before the C->B dependency is added, the dependency adding has no effect. If, together with * the deletion of B also either A or C is deleted, there is no distinction between the * original order case and the reordered case. */ virtual void RemoveTransaction(const Ref& arg) noexcept = 0; /** Add a dependency between two specified transactions. If a staging graph exists, the * dependency is only added there. Parent may not be a descendant of child already (but may * be an ancestor of it already, in which case this is a no-op). If either transaction is * already removed, this is a no-op. */ virtual void AddDependency(const Ref& parent, const Ref& child) noexcept = 0; /** Modify the fee of the specified transaction, in both the main graph and the staging * graph if it exists. Wherever the transaction does not exist (or was removed), this has no * effect. */ virtual void SetTransactionFee(const Ref& arg, int64_t fee) noexcept = 0; /** TxGraph is internally lazy, and will not compute many things until they are needed. * Calling DoWork will perform some work now (controlled by max_cost) so that future operations * are fast, if there is any. Returns whether all currently-available work is done. This can * be invoked while oversized, but oversized graphs will be skipped by this call. */ virtual bool DoWork(uint64_t max_cost) noexcept = 0; /** Create a staging graph (which cannot exist already). This acts as if a full copy of * the transaction graph is made, upon which further modifications are made. This copy can * be inspected, and then either discarded, or the main graph can be replaced by it by * committing it. */ virtual void StartStaging() noexcept = 0; /** Discard the existing active staging graph (which must exist). */ virtual void AbortStaging() noexcept = 0; /** Replace the main graph with the staging graph (which must exist). */ virtual void CommitStaging() noexcept = 0; /** Check whether a staging graph exists. */ virtual bool HaveStaging() const noexcept = 0; /** Determine whether the graph is oversized (contains a connected component of more than the * configured maximum cluster count). Some of the functions below are not available * for oversized graphs. The mutators above are always available. Removing a transaction by * destroying its Ref while staging exists will not clear main's oversizedness until staging * is aborted or committed. */ virtual bool IsOversized(Level level) noexcept = 0; /** Determine whether arg exists in the graph (i.e., was not removed). This is * available even for oversized graphs. */ virtual bool Exists(const Ref& arg, Level level) noexcept = 0; /** Get the individual transaction feerate of transaction arg. Returns the empty FeePerWeight * if arg does not exist in either main or staging. This is available even for oversized * graphs. */ virtual FeePerWeight GetIndividualFeerate(const Ref& arg) noexcept = 0; /** Get the feerate of the chunk which transaction arg is in, in the main graph. Returns the * empty FeePerWeight if arg does not exist in the main graph. The main graph must not be * oversized. */ virtual FeePerWeight GetMainChunkFeerate(const Ref& arg) noexcept = 0; /** Get pointers to all transactions in the cluster which arg is in. The transactions are * returned in graph order. The queried graph must not be oversized. Returns {} if * arg does not exist in the queried graph. */ virtual std::vector GetCluster(const Ref& arg, Level level) noexcept = 0; /** Get pointers to all ancestors of the specified transaction (including the transaction * itself), in unspecified order. The queried graph must not be oversized. * Returns {} if arg does not exist in the graph. */ virtual std::vector GetAncestors(const Ref& arg, Level level) noexcept = 0; /** Get pointers to all descendants of the specified transaction (including the transaction * itself), in unspecified order. The queried graph must not be oversized. * Returns {} if arg does not exist in the graph. */ virtual std::vector GetDescendants(const Ref& arg, Level level) noexcept = 0; /** Like GetAncestors, but return the Refs for all transactions in the union of the provided * arguments' ancestors (each transaction is only reported once). Refs that do not exist in * the queried graph are ignored. Null refs are not allowed. */ virtual std::vector GetAncestorsUnion(std::span args, Level level) noexcept = 0; /** Like GetDescendants, but return the Refs for all transactions in the union of the provided * arguments' descendants (each transaction is only reported once). Refs that do not exist in * the queried graph are ignored. Null refs are not allowed. */ virtual std::vector GetDescendantsUnion(std::span args, Level level) noexcept = 0; /** Get the total number of transactions in the graph. This is available even * for oversized graphs. */ virtual GraphIndex GetTransactionCount(Level level) noexcept = 0; /** Compare two transactions according to their order in the main graph. Both transactions must * be in the main graph. The main graph must not be oversized. */ virtual std::strong_ordering CompareMainOrder(const Ref& a, const Ref& b) noexcept = 0; /** Count the number of distinct clusters that the specified transactions belong to. Refs that * do not exist in the queried graph are ignored. Refs can not be null. The queried graph must * not be oversized. */ virtual GraphIndex CountDistinctClusters(std::span, Level level) noexcept = 0; /** For both main and staging (which must both exist and not be oversized), return the combined * respective feerate diagrams, including chunks from all clusters, but excluding clusters * that appear identically in both. Use FeeFrac rather than FeePerWeight so CompareChunks is * usable without type-conversion. */ virtual std::pair, std::vector> GetMainStagingDiagrams() noexcept = 0; /** Remove transactions (including their own descendants) according to a fast but best-effort * strategy such that the TxGraph's cluster and size limits are respected. Applies to staging * if it exists, and to main otherwise. Returns the list of all removed transactions in * unspecified order. This has no effect unless the relevant graph is oversized. */ virtual std::vector Trim() noexcept = 0; /** Interface returned by GetBlockBuilder. */ class BlockBuilder { protected: /** Make constructor non-public (use TxGraph::GetBlockBuilder()). */ BlockBuilder() noexcept = default; public: /** Support safe inheritance. */ virtual ~BlockBuilder() = default; /** Get the chunk that is currently suggested to be included, plus its feerate, if any. */ virtual std::optional, FeePerWeight>> GetCurrentChunk() noexcept = 0; /** Mark the current chunk as included, and progress to the next one. */ virtual void Include() noexcept = 0; /** Mark the current chunk as skipped, and progress to the next one. Further chunks from * the same cluster as the current one will not be reported anymore. */ virtual void Skip() noexcept = 0; }; /** Construct a block builder, drawing chunks in order, from the main graph, which cannot be * oversized. While the returned object exists, no mutators on the main graph are allowed. * The BlockBuilder object must not outlive the TxGraph it was created with. */ virtual std::unique_ptr GetBlockBuilder() noexcept = 0; /** Get the last chunk in the main graph, i.e., the last chunk that would be returned by a * BlockBuilder created now, together with its feerate. The chunk is returned in * reverse-topological order, so every element is preceded by all its descendants. The main * graph must not be oversized. If the graph is empty, {{}, FeePerWeight{}} is returned. */ virtual std::pair, FeePerWeight> GetWorstMainChunk() noexcept = 0; /** Get the approximate memory usage for this object, just counting the main graph. If a * staging graph is present, return a number corresponding to memory usage after * AbortStaging() would be called. BlockBuilders' memory usage, memory usage of internally * queued operations, and memory due to temporary caches, is not included here. Can always be * called. */ virtual size_t GetMainMemoryUsage() noexcept = 0; /** Perform an internal consistency check on this object. */ virtual void SanityCheck() const = 0; protected: // Allow TxGraph::Ref to call UpdateRef and UnlinkRef. friend class TxGraph::Ref; /** Inform the TxGraph implementation that a TxGraph::Ref has moved. */ virtual void UpdateRef(GraphIndex index, Ref& new_location) noexcept = 0; /** Inform the TxGraph implementation that a TxGraph::Ref was destroyed. */ virtual void UnlinkRef(GraphIndex index) noexcept = 0; // Allow TxGraph implementations (inheriting from it) to access Ref internals. static TxGraph*& GetRefGraph(Ref& arg) noexcept { return arg.m_graph; } static TxGraph* GetRefGraph(const Ref& arg) noexcept { return arg.m_graph; } static GraphIndex& GetRefIndex(Ref& arg) noexcept { return arg.m_index; } static GraphIndex GetRefIndex(const Ref& arg) noexcept { return arg.m_index; } public: class Ref { // Allow TxGraph's GetRefGraph and GetRefIndex to access internals. friend class TxGraph; /** Which Graph the Entry lives in. nullptr if this Ref is empty. */ TxGraph* m_graph = nullptr; /** Index into the Graph's m_entries. Only used if m_graph != nullptr. */ GraphIndex m_index = GraphIndex(-1); public: /** Construct an empty Ref. It can be initialized through TxGraph::AddTransaction. */ Ref() noexcept = default; /** Destroy this Ref. If it is not empty, the corresponding transaction is removed (in both * main and staging, if it exists). */ virtual ~Ref(); // Support move-constructing a Ref. Ref& operator=(Ref&& other) noexcept = delete; Ref(Ref&& other) noexcept; // Do not permit copy constructing or copy assignment. A TxGraph entry can have at most one // Ref pointing to it. Ref& operator=(const Ref&) = delete; Ref(const Ref&) = delete; }; }; /** Construct a new TxGraph with the specified limit on the number of transactions within a cluster, * and on the sum of transaction sizes within a cluster. * * - max_cluster_count cannot exceed MAX_CLUSTER_COUNT_LIMIT. * - acceptable_cost controls how much linearization optimization work will be performed per * cluster before they are considered to be of acceptable quality. * - fallback_order determines how to break tie-breaks between transactions: * fallback_order(a, b) < 0 means a is "better" than b, and will (in case of ties) be placed * first. This ordering must be stable over the transactions' lifetimes. */ std::unique_ptr MakeTxGraph( unsigned max_cluster_count, uint64_t max_cluster_size, uint64_t acceptable_cost, const std::function& fallback_order ) noexcept; #endif // BITCOIN_TXGRAPH_H 11:["$","$L28",null,{"project":{"id":"cmu7az2uy000101pe5399ibzc","owner":"bitcoin","repo":"bitcoin","displayName":"bitcoin/bitcoin","defaultBranch":"master"},"commit":{"sha":"f86cbf53eb3ed90eea20e35936182689014f3143","message":"$29","authorLogin":"sedited","authorName":"merge-script","date":"2026-09-22T08:48:23.000Z","htmlUrl":"https://github.com/bitcoin/bitcoin/commit/f86cbf53eb3ed90eea20e35936182689014f3143","isHead":true,"headSha":"f86cbf53eb3ed90eea20e35936182689014f3143"},"gitRef":"master","path":"src/txgraph.h","target":{"kind":"file","file":{"path":"src/txgraph.h","size":16153,"content":"$2a","tooLarge":false,"binary":false,"htmlUrl":"https://github.com/bitcoin/bitcoin/blob/f86cbf53eb3ed90eea20e35936182689014f3143/src/txgraph.h","mutants":[],"mutantsAtOtherRevisions":0}},"treeCache":{"":[{"name":".github","path":".github","type":"dir","size":null},{"name":".tx","path":".tx","type":"dir","size":null},{"name":"ci","path":"ci","type":"dir","size":null},{"name":"cmake","path":"cmake","type":"dir","size":null},{"name":"contrib","path":"contrib","type":"dir","size":null},{"name":"depends","path":"depends","type":"dir","size":null},{"name":"doc","path":"doc","type":"dir","size":null},{"name":"share","path":"share","type":"dir","size":null},{"name":"src","path":"src","type":"dir","size":null},{"name":"test","path":"test","type":"dir","size":null},{"name":".editorconfig","path":".editorconfig","type":"file","size":434},{"name":".gitattributes","path":".gitattributes","type":"file","size":67},{"name":".gitignore","path":".gitignore","type":"file","size":607},{"name":".python-version","path":".python-version","type":"file","size":5},{"name":".style.yapf","path":".style.yapf","type":"file","size":7942},{"name":"CMakeLists.txt","path":"CMakeLists.txt","type":"file","size":30361},{"name":"CMakePresets.json","path":"CMakePresets.json","type":"file","size":2803},{"name":"CONTRIBUTING.md","path":"CONTRIBUTING.md","type":"file","size":21570},{"name":"COPYING","path":"COPYING","type":"file","size":1142},{"name":"CTestConfig.cmake","path":"CTestConfig.cmake","type":"file","size":122},{"name":"INSTALL.md","path":"INSTALL.md","type":"file","size":28},{"name":"libbitcoinkernel.pc.in","path":"libbitcoinkernel.pc.in","type":"file","size":342},{"name":"README.md","path":"README.md","type":"file","size":3489},{"name":"ruff.toml","path":"ruff.toml","type":"file","size":460},{"name":"SECURITY.md","path":"SECURITY.md","type":"file","size":870},{"name":"vcpkg.json","path":"vcpkg.json","type":"file","size":1189}],"src":[{"name":"bench","path":"src/bench","type":"dir","size":null},{"name":"common","path":"src/common","type":"dir","size":null},{"name":"compat","path":"src/compat","type":"dir","size":null},{"name":"consensus","path":"src/consensus","type":"dir","size":null},{"name":"crc32c","path":"src/crc32c","type":"dir","size":null},{"name":"crypto","path":"src/crypto","type":"dir","size":null},{"name":"index","path":"src/index","type":"dir","size":null},{"name":"init","path":"src/init","type":"dir","size":null},{"name":"interfaces","path":"src/interfaces","type":"dir","size":null},{"name":"ipc","path":"src/ipc","type":"dir","size":null},{"name":"kernel","path":"src/kernel","type":"dir","size":null},{"name":"leveldb","path":"src/leveldb","type":"dir","size":null},{"name":"logging","path":"src/logging","type":"dir","size":null},{"name":"minisketch","path":"src/minisketch","type":"dir","size":null},{"name":"node","path":"src/node","type":"dir","size":null},{"name":"policy","path":"src/policy","type":"dir","size":null},{"name":"primitives","path":"src/primitives","type":"dir","size":null},{"name":"qt","path":"src/qt","type":"dir","size":null},{"name":"rpc","path":"src/rpc","type":"dir","size":null},{"name":"script","path":"src/script","type":"dir","size":null},{"name":"secp256k1","path":"src/secp256k1","type":"dir","size":null},{"name":"support","path":"src/support","type":"dir","size":null},{"name":"test","path":"src/test","type":"dir","size":null},{"name":"univalue","path":"src/univalue","type":"dir","size":null},{"name":"util","path":"src/util","type":"dir","size":null},{"name":"wallet","path":"src/wallet","type":"dir","size":null},{"name":"zmq","path":"src/zmq","type":"dir","size":null},{"name":".clang-format","path":"src/.clang-format","type":"file","size":6363},{"name":".clang-tidy","path":"src/.clang-tidy","type":"file","size":1808},{"name":"addrdb.cpp","path":"src/addrdb.cpp","type":"file","size":8437},{"name":"addrdb.h","path":"src/addrdb.h","type":"file","size":2015},{"name":"addresstype.cpp","path":"src/addresstype.cpp","type":"file","size":5139},{"name":"addresstype.h","path":"src/addresstype.h","type":"file","size":6434},{"name":"addrman_impl.h","path":"src/addrman_impl.h","type":"file","size":11970},{"name":"addrman.cpp","path":"src/addrman.cpp","type":"file","size":44359},{"name":"addrman.h","path":"src/addrman.h","type":"file","size":11479},{"name":"arith_uint256.cpp","path":"src/arith_uint256.cpp","type":"file","size":6506},{"name":"arith_uint256.h","path":"src/arith_uint256.h","type":"file","size":8141},{"name":"attributes.h","path":"src/attributes.h","type":"file","size":745},{"name":"banman.cpp","path":"src/banman.cpp","type":"file","size":5453},{"name":"banman.h","path":"src/banman.h","type":"file","size":4749},{"name":"base58.cpp","path":"src/base58.cpp","type":"file","size":5867},{"name":"base58.h","path":"src/base58.h","type":"file","size":1571},{"name":"bech32.cpp","path":"src/bech32.cpp","type":"file","size":26916},{"name":"bech32.h","path":"src/bech32.h","type":"file","size":2699},{"name":"bip324.cpp","path":"src/bip324.cpp","type":"file","size":4548},{"name":"bip324.h","path":"src/bip324.h","type":"file","size":4074},{"name":"bitcoin-chainstate.cpp","path":"src/bitcoin-chainstate.cpp","type":"file","size":7795},{"name":"bitcoin-cli-res.rc","path":"src/bitcoin-cli-res.rc","type":"file","size":1381},{"name":"bitcoin-cli.cpp","path":"src/bitcoin-cli.cpp","type":"file","size":80833},{"name":"bitcoin-res.rc","path":"src/bitcoin-res.rc","type":"file","size":1388},{"name":"bitcoin-tx-res.rc","path":"src/bitcoin-tx-res.rc","type":"file","size":1380},{"name":"bitcoin-tx.cpp","path":"src/bitcoin-tx.cpp","type":"file","size":31472},{"name":"bitcoin-util-res.rc","path":"src/bitcoin-util-res.rc","type":"file","size":1369},{"name":"bitcoin-util.cpp","path":"src/bitcoin-util.cpp","type":"file","size":8210},{"name":"bitcoin-wallet-res.rc","path":"src/bitcoin-wallet-res.rc","type":"file","size":1394},{"name":"bitcoin-wallet.cpp","path":"src/bitcoin-wallet.cpp","type":"file","size":5431},{"name":"bitcoin.cpp","path":"src/bitcoin.cpp","type":"file","size":10599},{"name":"bitcoind-res.rc","path":"src/bitcoind-res.rc","type":"file","size":1369},{"name":"bitcoind.cpp","path":"src/bitcoind.cpp","type":"file","size":10266},{"name":"blockencodings.cpp","path":"src/blockencodings.cpp","type":"file","size":11043},{"name":"blockencodings.h","path":"src/blockencodings.h","type":"file","size":5028},{"name":"blockfilter.cpp","path":"src/blockfilter.cpp","type":"file","size":7309},{"name":"blockfilter.h","path":"src/blockfilter.h","type":"file","size":5546},{"name":"chain.cpp","path":"src/chain.cpp","type":"file","size":6310},{"name":"chain.h","path":"src/chain.h","type":"file","size":16648},{"name":"chainparams.cpp","path":"src/chainparams.cpp","type":"file","size":6435},{"name":"chainparams.h","path":"src/chainparams.h","type":"file","size":879},{"name":"chainparamsbase.cpp","path":"src/chainparamsbase.cpp","type":"file","size":4682},{"name":"chainparamsbase.h","path":"src/chainparamsbase.h","type":"file","size":1603},{"name":"chainparamsseeds.h","path":"src/chainparamsseeds.h","type":"file","size":340385},{"name":"checkqueue.h","path":"src/checkqueue.h","type":"file","size":8579},{"name":"clientversion.cpp","path":"src/clientversion.cpp","type":"file","size":2350},{"name":"clientversion.h","path":"src/clientversion.h","type":"file","size":1423},{"name":"cluster_linearize.h","path":"src/cluster_linearize.h","type":"file","size":104128},{"name":"CMakeLists.txt","path":"src/CMakeLists.txt","type":"file","size":10419},{"name":"coins.cpp","path":"src/coins.cpp","type":"file","size":18547},{"name":"coins.h","path":"src/coins.h","type":"file","size":35255},{"name":"compressor.cpp","path":"src/compressor.cpp","type":"file","size":5455},{"name":"compressor.h","path":"src/compressor.h","type":"file","size":3818},{"name":"core_io.cpp","path":"src/core_io.cpp","type":"file","size":19861},{"name":"core_io.h","path":"src/core_io.h","type":"file","size":2034},{"name":"core_memusage.h","path":"src/core_memusage.h","type":"file","size":2598},{"name":"cuckoocache.h","path":"src/cuckoocache.h","type":"file","size":19272},{"name":"dbwrapper.cpp","path":"src/dbwrapper.cpp","type":"file","size":15441},{"name":"dbwrapper.h","path":"src/dbwrapper.h","type":"file","size":11231},{"name":"deploymentinfo.cpp","path":"src/deploymentinfo.cpp","type":"file","size":1601},{"name":"deploymentinfo.h","path":"src/deploymentinfo.h","type":"file","size":1048},{"name":"deploymentstatus.cpp","path":"src/deploymentstatus.cpp","type":"file","size":1520},{"name":"deploymentstatus.h","path":"src/deploymentstatus.h","type":"file","size":2193},{"name":"dummywallet.cpp","path":"src/dummywallet.cpp","type":"file","size":1756},{"name":"external_signer.cpp","path":"src/external_signer.cpp","type":"file","size":5188},{"name":"external_signer.h","path":"src/external_signer.h","type":"file","size":2926},{"name":"flatfile.cpp","path":"src/flatfile.cpp","type":"file","size":3700},{"name":"flatfile.h","path":"src/flatfile.h","type":"file","size":2794},{"name":"hash.cpp","path":"src/hash.cpp","type":"file","size":2381},{"name":"hash.h","path":"src/hash.h","type":"file","size":6337},{"name":"headerssync.cpp","path":"src/headerssync.cpp","type":"file","size":15260},{"name":"headerssync.h","path":"src/headerssync.h","type":"file","size":11877},{"name":"httprpc.cpp","path":"src/httprpc.cpp","type":"file","size":14624},{"name":"httprpc.h","path":"src/httprpc.h","type":"file","size":1183},{"name":"httpserver.cpp","path":"src/httpserver.cpp","type":"file","size":56963},{"name":"httpserver.h","path":"src/httpserver.h","type":"file","size":23767},{"name":"i2p.cpp","path":"src/i2p.cpp","type":"file","size":15592},{"name":"i2p.h","path":"src/i2p.h","type":"file","size":9424},{"name":"indirectmap.h","path":"src/indirectmap.h","type":"file","size":2553},{"name":"init.cpp","path":"src/init.cpp","type":"file","size":137032},{"name":"init.h","path":"src/init.h","type":"file","size":3227},{"name":"key_io.cpp","path":"src/key_io.cpp","type":"file","size":12671},{"name":"key_io.h","path":"src/key_io.h","type":"file","size":1103},{"name":"key.cpp","path":"src/key.cpp","type":"file","size":19965},{"name":"key.h","path":"src/key.h","type":"file","size":12468},{"name":"logging.cpp","path":"src/logging.cpp","type":"file","size":20221},{"name":"logging.h","path":"src/logging.h","type":"file","size":11907},{"name":"mapport.cpp","path":"src/mapport.cpp","type":"file","size":6240},{"name":"mapport.h","path":"src/mapport.h","type":"file","size":403},{"name":"memusage.h","path":"src/memusage.h","type":"file","size":7344},{"name":"merkleblock.cpp","path":"src/merkleblock.cpp","type":"file","size":7008},{"name":"merkleblock.h","path":"src/merkleblock.h","type":"file","size":5993},{"name":"musig.cpp","path":"src/musig.cpp","type":"file","size":12871},{"name":"musig.h","path":"src/musig.h","type":"file","size":3440},{"name":"net_permissions.cpp","path":"src/net_permissions.cpp","type":"file","size":6913},{"name":"net_permissions.h","path":"src/net_permissions.h","type":"file","size":3684},{"name":"net_processing.cpp","path":"src/net_processing.cpp","type":"file","size":312777},{"name":"net_processing.h","path":"src/net_processing.h","type":"file","size":8915},{"name":"net_types.cpp","path":"src/net_types.cpp","type":"file","size":2553},{"name":"net_types.h","path":"src/net_types.h","type":"file","size":1790},{"name":"net.cpp","path":"src/net.cpp","type":"file","size":170222},{"name":"net.h","path":"src/net.h","type":"file","size":81655},{"name":"netaddress.cpp","path":"src/netaddress.cpp","type":"file","size":31614},{"name":"netaddress.h","path":"src/netaddress.h","type":"file","size":20318},{"name":"netbase.cpp","path":"src/netbase.cpp","type":"file","size":35499},{"name":"netbase.h","path":"src/netbase.h","type":"file","size":13450},{"name":"netgroup.cpp","path":"src/netgroup.cpp","type":"file","size":5170},{"name":"netgroup.h","path":"src/netgroup.h","type":"file","size":3463},{"name":"netmessagemaker.h","path":"src/netmessagemaker.h","type":"file","size":696},{"name":"noui.cpp","path":"src/noui.cpp","type":"file","size":3211},{"name":"noui.h","path":"src/noui.h","type":"file","size":1082},{"name":"outputtype.cpp","path":"src/outputtype.cpp","type":"file","size":3439},{"name":"outputtype.h","path":"src/outputtype.h","type":"file","size":1334},{"name":"pow.cpp","path":"src/pow.cpp","type":"file","size":6549},{"name":"pow.h","path":"src/pow.h","type":"file","size":1969},{"name":"prevector.h","path":"src/prevector.h","type":"file","size":15978},{"name":"private_broadcast.cpp","path":"src/private_broadcast.cpp","type":"file","size":5984},{"name":"private_broadcast.h","path":"src/private_broadcast.h","type":"file","size":10217},{"name":"protocol.cpp","path":"src/protocol.cpp","type":"file","size":3899},{"name":"protocol.h","path":"src/protocol.h","type":"file","size":22347},{"name":"psbt.cpp","path":"src/psbt.cpp","type":"file","size":36168},{"name":"psbt.h","path":"src/psbt.h","type":"file","size":70656},{"name":"pubkey.cpp","path":"src/pubkey.cpp","type":"file","size":14060},{"name":"pubkey.h","path":"src/pubkey.h","type":"file","size":12699},{"name":"random.cpp","path":"src/random.cpp","type":"file","size":24555},{"name":"random.h","path":"src/random.h","type":"file","size":17565},{"name":"randomenv.cpp","path":"src/randomenv.cpp","type":"file","size":14138},{"name":"randomenv.h","path":"src/randomenv.h","type":"file","size":594},{"name":"rest.cpp","path":"src/rest.cpp","type":"file","size":45422},{"name":"rest.h","path":"src/rest.h","type":"file","size":789},{"name":"scheduler.cpp","path":"src/scheduler.cpp","type":"file","size":5840},{"name":"scheduler.h","path":"src/scheduler.h","type":"file","size":6094},{"name":"semaphore_grant.h","path":"src/semaphore_grant.h","type":"file","size":2245},{"name":"serialize.h","path":"src/serialize.h","type":"file","size":43889},{"name":"signet.cpp","path":"src/signet.cpp","type":"file","size":5838},{"name":"signet.h","path":"src/signet.h","type":"file","size":1168},{"name":"span.h","path":"src/span.h","type":"file","size":5093},{"name":"streams.cpp","path":"src/streams.cpp","type":"file","size":4559},{"name":"streams.h","path":"src/streams.h","type":"file","size":23481},{"name":"sync.cpp","path":"src/sync.cpp","type":"file","size":11371},{"name":"sync.h","path":"src/sync.h","type":"file","size":11012},{"name":"threadsafety.h","path":"src/threadsafety.h","type":"file","size":2620},{"name":"tinyformat.h","path":"src/tinyformat.h","type":"file","size":49690},{"name":"torcontrol.cpp","path":"src/torcontrol.cpp","type":"file","size":30106},{"name":"torcontrol.h","path":"src/torcontrol.h","type":"file","size":5404},{"name":"txdb.cpp","path":"src/txdb.cpp","type":"file","size":10267},{"name":"txdb.h","path":"src/txdb.h","type":"file","size":2522},{"name":"txgraph.cpp","path":"src/txgraph.cpp","type":"file","size":175225},{"name":"txgraph.h","path":"src/txgraph.h","type":"file","size":16153},{"name":"txmempool.cpp","path":"src/txmempool.cpp","type":"file","size":41904},{"name":"txmempool.h","path":"src/txmempool.h","type":"file","size":34941},{"name":"txrequest.cpp","path":"src/txrequest.cpp","type":"file","size":36118},{"name":"txrequest.h","path":"src/txrequest.h","type":"file","size":12725},{"name":"uint256.cpp","path":"src/uint256.cpp","type":"file","size":1003},{"name":"uint256.h","path":"src/uint256.h","type":"file","size":7314},{"name":"undo.h","path":"src/undo.h","type":"file","size":2259},{"name":"validation.cpp","path":"src/validation.cpp","type":"file","size":313176},{"name":"validation.h","path":"src/validation.h","type":"file","size":66046},{"name":"validationinterface.cpp","path":"src/validationinterface.cpp","type":"file","size":12637},{"name":"validationinterface.h","path":"src/validationinterface.h","type":"file","size":10670},{"name":"versionbits_impl.h","path":"src/versionbits_impl.h","type":"file","size":3932},{"name":"versionbits.cpp","path":"src/versionbits.cpp","type":"file","size":13020},{"name":"versionbits.h","path":"src/versionbits.h","type":"file","size":4391},{"name":"walletinitinterface.h","path":"src/walletinitinterface.h","type":"file","size":962}]},"revisions":[{"commitSha":"d48e76e689bb4d680d9d8a70b67f994be2f0cdd1","branch":null,"commitMessage":"Merge bitcoin/bitcoin#36286: crypto: Fix MuHash3072 division by itself","commitDate":"2026-09-18T14:46:38.000Z","mutantCount":1},{"commitSha":"a09a81ebfce360a45484e2d0e4e8e889f5d5d214","branch":null,"commitMessage":"Merge bitcoin/bitcoin#35961: depends: Update `boost` package to 1.92.0","commitDate":"2026-09-14T14:18:52.000Z","mutantCount":85},{"commitSha":"05e49b342faa1412266951429c135e9f5daa30c2","branch":null,"commitMessage":"Merge bitcoin/bitcoin#36107: iwyu: Fix warnings in `src/init` and treat them as errors","commitDate":"2026-08-28T11:47:04.000Z","mutantCount":876},{"commitSha":"2f72123f613f3aa1484ed06344039be78dedcb33","branch":null,"commitMessage":"Merge bitcoin/bitcoin#35867: test: classify SOCKS5 peers via getpeerinfo addrbind","commitDate":"2026-08-12T16:41:34.000Z","mutantCount":204},{"commitSha":"d1d85263f8ebb47ad4d6126ff992d4915dda026b","branch":null,"commitMessage":"Merge bitcoin/bitcoin#35681: test: cover disconnect on private broadcast peer with relay=false","commitDate":"2026-07-20T20:33:43.000Z","mutantCount":138},{"commitSha":"2990bd773551c835ab0b6b59d85730adab2fd428","branch":null,"commitMessage":"Merge bitcoin/bitcoin#35118: fuzz: add ipc round-trip fuzz target","commitDate":"2026-07-02T19:04:47.000Z","mutantCount":40},{"commitSha":"1aafd49077041e874d6b5f114927bc37e5b85d71","branch":null,"commitMessage":"Merge bitcoin/bitcoin#35359: blockstorage: Remove cs_LastBlockFile recursive mutex","commitDate":"2026-06-08T17:30:36.000Z","mutantCount":435},{"commitSha":"859215218667ca9f35d5adae0289e4a125798087","branch":null,"commitMessage":"Merge bitcoin/bitcoin#34911: rpc, mempool: -deprecatedrpc fullrbf and bip125-replaceable from mempool RPCs","commitDate":"2026-04-27T19:18:36.000Z","mutantCount":57},{"commitSha":"ca45461ddb2421b4267dad0b7d7bcec88c07eba4","branch":null,"commitMessage":"Merge bitcoin/bitcoin#33986: doc: improvements to doc/descriptors.md","commitDate":"2026-03-05T16:50:26.000Z","mutantCount":528}],"signedIn":false,"pullRequest":null}]