Class AncestorFeerateComparator

src/node/mini_miner.cpp:180–197

Compare by min(ancestor feerate, individual feerate), then txid Under the ancestor-based mining approach, high-feerate children can pay for parents, but high-feerate parents do not incentive inclusion of their children. Therefore the mining algorithm only considers transactions for inclusion on basis of the minimum of their own feerate or their ancestor feerate.

// parents do not incentive inclusion of their children. Therefore the mining algorithm only considers
// transactions for inclusion on basis of the minimum of their own feerate or their ancestor feerate.
struct AncestorFeerateComparator
{
    template<typename I>
    bool operator()(const I& a, const I& b) const {
        auto min_feerate = [](const MiniMinerMempoolEntry& e) -> FeeFrac {
            FeeFrac self_feerate(e.GetModifiedFee(), e.GetTxSize());
            FeeFrac ancestor_feerate(e.GetModFeesWithAncestors(), e.GetSizeWithAncestors());
            return std::min<ByRatioNegSize<FeeFrac>>(ancestor_feerate, self_feerate);
        };
        FeeFrac a_feerate{min_feerate(a->second)};
        FeeFrac b_feerate{min_feerate(b->second)};
        if (a_feerate != b_feerate) {
            return ByRatioNegSize{a_feerate} > ByRatioNegSize{b_feerate};
        }
        // Use txid as tiebreaker for stable sorting
        return a->first < b->first;
    }
};

void MiniMiner::DeleteAncestorPackage(const std::set<MockEntryMap::iterator, IteratorComparator>& ancestors)
{