Inside Bitcoin
Opening the selected file…
Inside Bitcoin
Opening the selected file…
The code behind the network, with room to understand it.
Release published 2026-10-28 · Snapshot fetched 2026-11-01. Latest stable release at fetch time; development branches and Git history are excluded. Only the selected code window and visible folders load here.
1// Copyright (c) 2022-present The Bitcoin Core developers2// Distributed under the MIT software license, see the accompanying3// file COPYING or http://www.opensource.org/licenses/mit-license.php.5#include <node/eviction.h>7#include <algorithm>8#include <array>9#include <chrono>10#include <cstdint>11#include <functional>12#include <map>13#include <vector>16static bool ReverseCompareNodeMinPingTime(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b)17{18return a.m_min_ping_time > b.m_min_ping_time;19}21static bool ReverseCompareNodeTimeConnected(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b)22{23return a.m_connected > b.m_connected;24}26static bool CompareNetGroupKeyed(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b) {27return a.nKeyedNetGroup < b.nKeyedNetGroup;28}30static bool CompareNodeBlockTime(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b)31{32// There is a fall-through here because it is common for a node to have many peers which have not yet relayed a block.33if (a.m_last_block_time != b.m_last_block_time) return a.m_last_block_time < b.m_last_block_time;34if (a.fRelevantServices != b.fRelevantServices) return b.fRelevantServices;35return a.m_connected > b.m_connected;36}38static bool CompareNodeTXTime(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b)39{40// There is a fall-through here because it is common for a node to have more than a few peers that have not yet relayed txn.41if (a.m_last_tx_time != b.m_last_tx_time) return a.m_last_tx_time < b.m_last_tx_time;42if (a.m_relay_txs != b.m_relay_txs) return b.m_relay_txs;43if (a.fBloomFilter != b.fBloomFilter) return a.fBloomFilter;44return a.m_connected > b.m_connected;45}47// Pick out the potential block-relay only peers, and sort them by last block time.48static bool CompareNodeBlockRelayOnlyTime(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b)49{50if (a.m_relay_txs != b.m_relay_txs) return a.m_relay_txs;51if (a.m_last_block_time != b.m_last_block_time) return a.m_last_block_time < b.m_last_block_time;52if (a.fRelevantServices != b.fRelevantServices) return b.fRelevantServices;53return a.m_connected > b.m_connected;54}56/**57* Sort eviction candidates by network/localhost and connection uptime.58* Candidates near the beginning are more likely to be evicted, and those59* near the end are more likely to be protected, e.g. less likely to be evicted.60* - First, nodes that are not `is_local` and that do not belong to `network`,61* sorted by increasing uptime (from most recently connected to connected longer).62* - Then, nodes that are `is_local` or belong to `network`, sorted by increasing uptime.63*/64struct CompareNodeNetworkTime {65const bool m_is_local;66const Network m_network;67CompareNodeNetworkTime(bool is_local, Network network) : m_is_local(is_local), m_network(network) {}68bool operator()(const NodeEvictionCandidate& a, const NodeEvictionCandidate& b) const69{70if (m_is_local && a.m_is_local != b.m_is_local) return b.m_is_local;71if ((a.m_network == m_network) != (b.m_network == m_network)) return b.m_network == m_network;72return a.m_connected > b.m_connected;73};74};76//! Sort an array by the specified comparator, then erase the last K elements where predicate is true.77template <typename T, typename Comparator>78static void EraseLastKElements(79std::vector<T>& elements, Comparator comparator, size_t k,80std::function<bool(const NodeEvictionCandidate&)> predicate = [](const NodeEvictionCandidate& n) { return true; })81{82std::sort(elements.begin(), elements.end(), comparator);83size_t eraseSize = std::min(k, elements.size());84elements.erase(std::remove_if(elements.end() - eraseSize, elements.end(), predicate), elements.end());85}87void ProtectNoBanConnections(std::vector<NodeEvictionCandidate>& eviction_candidates)88{89eviction_candidates.erase(std::remove_if(eviction_candidates.begin(), eviction_candidates.end(),90[](NodeEvictionCandidate const& n) {91return n.m_noban;92}),93eviction_candidates.end());94}96void ProtectOutboundConnections(std::vector<NodeEvictionCandidate>& eviction_candidates)97{98eviction_candidates.erase(std::remove_if(eviction_candidates.begin(), eviction_candidates.end(),99[](NodeEvictionCandidate const& n) {100return n.m_conn_type != ConnectionType::INBOUND;101}),102eviction_candidates.end());103}105void ProtectEvictionCandidatesByRatio(std::vector<NodeEvictionCandidate>& eviction_candidates)106{107// Protect the half of the remaining nodes which have been connected the longest.108// This replicates the non-eviction implicit behavior, and precludes attacks that start later.109// To favorise the diversity of our peer connections, reserve up to half of these protected110// spots for Tor/onion, localhost, I2P, and CJDNS peers, even if they're not longest uptime111// overall. This helps protect these higher-latency peers that tend to be otherwise112// disadvantaged under our eviction criteria.113const size_t initial_size = eviction_candidates.size();114const size_t total_protect_size{initial_size / 2};116// Disadvantaged networks to protect. In the case of equal counts, earlier array members117// have the first opportunity to recover unused slots from the previous iteration.118struct Net { bool is_local; Network id; size_t count; };119std::array<Net, 4> networks{120{{false, NET_CJDNS, 0}, {false, NET_I2P, 0}, {/*localhost=*/true, NET_MAX, 0}, {false, NET_ONION, 0}}};122// Count and store the number of eviction candidates per network.123for (Net& n : networks) {124n.count = std::count_if(eviction_candidates.cbegin(), eviction_candidates.cend(),125[&n](const NodeEvictionCandidate& c) {126return n.is_local ? c.m_is_local : c.m_network == n.id;127});128}129// Sort `networks` by ascending candidate count, to give networks having fewer candidates130// the first opportunity to recover unused protected slots from the previous iteration.131std::stable_sort(networks.begin(), networks.end(), [](Net a, Net b) { return a.count < b.count; });133// Protect up to 25% of the eviction candidates by disadvantaged network.134const size_t max_protect_by_network{total_protect_size / 2};135size_t num_protected{0};137while (num_protected < max_protect_by_network) {138// Count the number of disadvantaged networks from which we have peers to protect.139auto num_networks = std::count_if(networks.begin(), networks.end(), [](const Net& n) { return n.count; });140if (num_networks == 0) {141break;142}143const size_t disadvantaged_to_protect{max_protect_by_network - num_protected};144const size_t protect_per_network{std::max(disadvantaged_to_protect / num_networks, static_cast<size_t>(1))};145// Early exit flag if there are no remaining candidates by disadvantaged network.146bool protected_at_least_one{false};148for (Net& n : networks) {149if (n.count == 0) continue;150const size_t before = eviction_candidates.size();151EraseLastKElements(eviction_candidates, CompareNodeNetworkTime(n.is_local, n.id),152protect_per_network, [&n](const NodeEvictionCandidate& c) {153return n.is_local ? c.m_is_local : c.m_network == n.id;154});155const size_t after = eviction_candidates.size();156if (before > after) {157protected_at_least_one = true;158const size_t delta{before - after};159num_protected += delta;160if (num_protected >= max_protect_by_network) {161break;162}163n.count -= delta;164}165}166if (!protected_at_least_one) {167break;168}169}171// Calculate how many we removed, and update our total number of peers that172// we want to protect based on uptime accordingly.173assert(num_protected == initial_size - eviction_candidates.size());174const size_t remaining_to_protect{total_protect_size - num_protected};175EraseLastKElements(eviction_candidates, ReverseCompareNodeTimeConnected, remaining_to_protect);176}178[[nodiscard]] std::optional<NodeId> SelectNodeToEvict(std::vector<NodeEvictionCandidate>&& vEvictionCandidates)179{180// Protect connections with certain characteristics182ProtectNoBanConnections(vEvictionCandidates);184ProtectOutboundConnections(vEvictionCandidates);186// Deterministically select 4 peers to protect by netgroup.187// An attacker cannot predict which netgroups will be protected188EraseLastKElements(vEvictionCandidates, CompareNetGroupKeyed, 4);189// Protect the 8 nodes with the lowest minimum ping time.190// An attacker cannot manipulate this metric without physically moving nodes closer to the target.191EraseLastKElements(vEvictionCandidates, ReverseCompareNodeMinPingTime, 8);192// Protect 4 nodes that most recently sent us novel transactions accepted into our mempool.193// An attacker cannot manipulate this metric without performing useful work.194EraseLastKElements(vEvictionCandidates, CompareNodeTXTime, 4);195// Protect up to 8 non-tx-relay peers that have sent us novel blocks.196EraseLastKElements(vEvictionCandidates, CompareNodeBlockRelayOnlyTime, 8,197[](const NodeEvictionCandidate& n) { return !n.m_relay_txs && n.fRelevantServices; });199// Protect 4 nodes that most recently sent us novel blocks.200// An attacker cannot manipulate this metric without performing useful work.201EraseLastKElements(vEvictionCandidates, CompareNodeBlockTime, 4);203// Protect some of the remaining eviction candidates by ratios of desirable204// or disadvantaged characteristics.205ProtectEvictionCandidatesByRatio(vEvictionCandidates);207if (vEvictionCandidates.empty()) return std::nullopt;209// If any remaining peers are preferred for eviction consider only them.210// This happens after the other preferences since if a peer is really the best by other criteria (esp relaying blocks)211// then we probably don't want to evict it no matter what.212if (std::any_of(vEvictionCandidates.begin(),vEvictionCandidates.end(),[](NodeEvictionCandidate const &n){return n.prefer_evict;})) {213vEvictionCandidates.erase(std::remove_if(vEvictionCandidates.begin(),vEvictionCandidates.end(),214[](NodeEvictionCandidate const &n){return !n.prefer_evict;}),vEvictionCandidates.end());215}217// Identify the network group with the most connections and youngest member.218// (vEvictionCandidates is already sorted by reverse connect time)219uint64_t naMostConnections;220unsigned int nMostConnections = 0;221NodeClock::time_point nMostConnectionsTime{NodeClock::epoch};222std::map<uint64_t, std::vector<NodeEvictionCandidate> > mapNetGroupNodes;223for (const NodeEvictionCandidate &node : vEvictionCandidates) {224std::vector<NodeEvictionCandidate> &group = mapNetGroupNodes[node.nKeyedNetGroup];225group.push_back(node);226const auto grouptime{group[0].m_connected};228if (group.size() > nMostConnections || (group.size() == nMostConnections && grouptime > nMostConnectionsTime)) {229nMostConnections = group.size();230nMostConnectionsTime = grouptime;231naMostConnections = node.nKeyedNetGroup;232}233}235// Reduce to the network group with the most connections236vEvictionCandidates = std::move(mapNetGroupNodes[naMostConnections]);238// Disconnect from the network group with the most connections239return vEvictionCandidates.front().id;240}
Independent explanations by MyBitcoinExplorer. Not affiliated with or endorsed by Bitcoin Core. Guides are educational and do not replace the source or its tests.
Bitcoin Core source © its contributors, distributed under the MIT license. Original notices and bundled third-party licenses are retained in the source tree.