coinselection.h

Go to the documentation of this file.

// Copyright (c) 2017-present 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_WALLET_COINSELECTION_H
#define BITCOIN_WALLET_COINSELECTION_H
 
#include <consensus/amount.h>
#include <consensus/consensus.h>
#include <outputtype.h>
#include <policy/feerate.h>
#include <primitives/transaction.h>
#include <random.h>
#include <util/check.h>
#include <util/insert.h>
#include <util/result.h>
 
#include <optional>
 
 
namespace wallet {
static constexpr CAmount CHANGE_LOWER{50000};
static constexpr CAmount CHANGE_UPPER{1000000};
 
struct COutput {
private:
    std::optional<CAmount> effective_value;
 
    std::optional<CAmount> fee;
 
public:
    COutPoint outpoint;
 
    CTxOut txout;
 
    int depth;
 
    int input_bytes;
 
    bool solvable;
 
    bool safe;
 
    int64_t time;
 
    bool from_me;
 
    CAmount long_term_fee{0};
 
    CAmount ancestor_bump_fees{0};
 
    COutput(const COutPoint& outpoint, const CTxOut& txout, int depth, int input_bytes, bool solvable, bool safe, int64_t time, bool from_me, const std::optional<CFeeRate> feerate = std::nullopt)
        : outpoint{outpoint},
          txout{txout},
          depth{depth},
          input_bytes{input_bytes},
          solvable{solvable},
          safe{safe},
          time{time},
          from_me{from_me}
    {
        if (feerate) {
            // base fee without considering potential unconfirmed ancestors
            fee = input_bytes < 0 ? 0 : feerate.value().GetFee(input_bytes);
            effective_value = txout.nValue - fee.value();
        }
    }
 
    COutput(const COutPoint& outpoint, const CTxOut& txout, int depth, int input_bytes, bool solvable, bool safe, int64_t time, bool from_me, const CAmount fees)
        : COutput(outpoint, txout, depth, input_bytes, solvable, safe, time, from_me)
    {
        // if input_bytes is unknown, then fees should be 0, if input_bytes is known, then the fees should be a positive integer or 0 (input_bytes known and fees = 0 only happens in the tests)
        assert((input_bytes < 0 && fees == 0) || (input_bytes > 0 && fees >= 0));
        fee = fees;
        effective_value = txout.nValue - fee.value();
    }
 
    std::string ToString() const;
 
    bool operator<(const COutput& rhs) const
    {
        return outpoint < rhs.outpoint;
    }
 
    void ApplyBumpFee(CAmount bump_fee)
    {
        assert(bump_fee >= 0);
        ancestor_bump_fees = bump_fee;
        assert(fee);
        *fee += bump_fee;
        // Note: assert(effective_value - bump_fee == nValue - fee.value());
        effective_value = txout.nValue - fee.value();
    }
 
    CAmount GetFee() const
    {
        assert(fee.has_value());
        return fee.value();
    }
 
    CAmount GetEffectiveValue() const
    {
        assert(effective_value.has_value());
        return effective_value.value();
    }
 
    bool HasEffectiveValue() const { return effective_value.has_value(); }
};
 
struct CoinSelectionParams {
    FastRandomContext& rng_fast;
    int change_output_size = 0;
    int change_spend_size = 0;
    CAmount m_min_change_target{0};
    CAmount min_viable_change{0};
    CAmount m_change_fee{0};
    CAmount m_cost_of_change{0};
    CFeeRate m_effective_feerate;
    CFeeRate m_long_term_feerate;
    CFeeRate m_discard_feerate;
    int tx_noinputs_size = 0;
    bool m_subtract_fee_outputs = false;
    bool m_avoid_partial_spends = false;
    bool m_include_unsafe_inputs = false;
    uint32_t m_version{CTransaction::CURRENT_VERSION};
    std::optional<int> m_max_tx_weight{std::nullopt};
 
    CoinSelectionParams(FastRandomContext& rng_fast, int change_output_size, int change_spend_size,
                        CAmount min_change_target, CFeeRate effective_feerate,
                        CFeeRate long_term_feerate, CFeeRate discard_feerate, int tx_noinputs_size, bool avoid_partial,
                        std::optional<int> max_tx_weight = std::nullopt)
        : rng_fast{rng_fast},
          change_output_size(change_output_size),
          change_spend_size(change_spend_size),
          m_min_change_target(min_change_target),
          m_effective_feerate(effective_feerate),
          m_long_term_feerate(long_term_feerate),
          m_discard_feerate(discard_feerate),
          tx_noinputs_size(tx_noinputs_size),
          m_avoid_partial_spends(avoid_partial),
          m_max_tx_weight(max_tx_weight)
    {
    }
    CoinSelectionParams(FastRandomContext& rng_fast)
        : rng_fast{rng_fast} {}
};
 
struct CoinEligibilityFilter
{
    const int conf_mine;
    const int conf_theirs;
    const uint64_t max_ancestors;
    const uint64_t max_descendants;
    const bool m_include_partial_groups{false};
 
    CoinEligibilityFilter() = delete;
    CoinEligibilityFilter(int conf_mine, int conf_theirs, uint64_t max_ancestors) : conf_mine(conf_mine), conf_theirs(conf_theirs), max_ancestors(max_ancestors), max_descendants(max_ancestors) {}
    CoinEligibilityFilter(int conf_mine, int conf_theirs, uint64_t max_ancestors, uint64_t max_descendants) : conf_mine(conf_mine), conf_theirs(conf_theirs), max_ancestors(max_ancestors), max_descendants(max_descendants) {}
    CoinEligibilityFilter(int conf_mine, int conf_theirs, uint64_t max_ancestors, uint64_t max_descendants, bool include_partial) : conf_mine(conf_mine), conf_theirs(conf_theirs), max_ancestors(max_ancestors), max_descendants(max_descendants), m_include_partial_groups(include_partial) {}
 
    bool operator<(const CoinEligibilityFilter& other) const {
        return std::tie(conf_mine, conf_theirs, max_ancestors, max_descendants, m_include_partial_groups)
               < std::tie(other.conf_mine, other.conf_theirs, other.max_ancestors, other.max_descendants, other.m_include_partial_groups);
    }
};
 
struct OutputGroup
{
    std::vector<std::shared_ptr<COutput>> m_outputs;
    bool m_from_me{true};
    CAmount m_value{0};
    int m_depth{999};
    size_t m_ancestors{0};
    size_t m_descendants{0};
    CAmount effective_value{0};
    CAmount fee{0};
    CAmount long_term_fee{0};
    CFeeRate m_long_term_feerate{0};
    bool m_subtract_fee_outputs{false};
    int m_weight{0};
 
    OutputGroup() = default;
    OutputGroup(const CoinSelectionParams& params) :
        m_long_term_feerate(params.m_long_term_feerate),
        m_subtract_fee_outputs(params.m_subtract_fee_outputs)
    {}
 
    void Insert(const std::shared_ptr<COutput>& output, size_t ancestors, size_t descendants);
    bool EligibleForSpending(const CoinEligibilityFilter& eligibility_filter) const;
    CAmount GetSelectionAmount() const;
};
 
struct Groups {
    // Stores 'OutputGroup' containing only positive UTXOs (value > 0).
    std::vector<OutputGroup> positive_group;
    // Stores 'OutputGroup' which may contain both positive and negative UTXOs.
    std::vector<OutputGroup> mixed_group;
};
 
struct OutputGroupTypeMap
{
    // Maps output type to output groups.
    std::map<OutputType, Groups> groups_by_type;
    // All inserted groups, no type distinction.
    Groups all_groups;
 
    // Based on the insert flag; appends group to the 'mixed_group' and, if value > 0, to the 'positive_group'.
    // This affects both; the groups filtered by type and the overall groups container.
    void Push(const OutputGroup& group, OutputType type, bool insert_positive, bool insert_mixed);
    // Different output types count
    size_t TypesCount() { return groups_by_type.size(); }
};
 
typedef std::map<CoinEligibilityFilter, OutputGroupTypeMap> FilteredOutputGroups;
 
[[nodiscard]] CAmount GenerateChangeTarget(CAmount payment_value, CAmount change_fee, FastRandomContext& rng);
 
enum class SelectionAlgorithm : uint8_t
{
    BNB = 0,
    KNAPSACK = 1,
    SRD = 2,
    CG = 3,
    MANUAL = 4,
};
 
std::string GetAlgorithmName(SelectionAlgorithm algo);
 
struct OutputPtrComparator {
    bool operator()(const std::shared_ptr<COutput>& a, const std::shared_ptr<COutput>& b) const {
        return *a < *b;
    }
};
using OutputSet = std::set<std::shared_ptr<COutput>, OutputPtrComparator>;
 
struct SelectionResult
{
private:
    OutputSet m_selected_inputs;
    CAmount m_target;
    SelectionAlgorithm m_algo;
    bool m_use_effective{false};
    std::optional<CAmount> m_waste;
    bool m_algo_completed{true};
    size_t m_selections_evaluated;
    int m_weight{0};
    CAmount bump_fee_group_discount{0};
 
    template<typename T>
    void InsertInputs(const T& inputs)
    {
        // Store sum of combined input sets to check that the results have no shared UTXOs
        const size_t expected_count = m_selected_inputs.size() + inputs.size();
        util::insert(m_selected_inputs, inputs);
        if (m_selected_inputs.size() != expected_count) {
            throw std::runtime_error(STR_INTERNAL_BUG("Shared UTXOs among selection results"));
        }
    }
 
public:
    explicit SelectionResult(const CAmount target, SelectionAlgorithm algo)
        : m_target(target), m_algo(algo) {}
 
    SelectionResult() = delete;
 
    [[nodiscard]] CAmount GetSelectedValue() const;
 
    [[nodiscard]] CAmount GetSelectedEffectiveValue() const;
 
    [[nodiscard]] CAmount GetTotalBumpFees() const;
 
    void Clear();
 
    void AddInput(const OutputGroup& group);
    void AddInputs(const OutputSet& inputs, bool subtract_fee_outputs);
 
    void SetBumpFeeDiscount(CAmount discount);
 
    void RecalculateWaste(CAmount min_viable_change, CAmount change_cost, CAmount change_fee);
    [[nodiscard]] CAmount GetWaste() const;
 
    void SetAlgoCompleted(bool algo_completed);
 
    bool GetAlgoCompleted() const;
 
    void SetSelectionsEvaluated(size_t attempts);
 
    size_t GetSelectionsEvaluated() const ;
 
    void Merge(const SelectionResult& other);
 
    const OutputSet& GetInputSet() const;
    std::vector<std::shared_ptr<COutput>> GetShuffledInputVector() const;
 
    bool operator<(SelectionResult other) const;
 
    CAmount GetChange(CAmount min_viable_change, CAmount change_fee) const;
 
    CAmount GetTarget() const { return m_target; }
 
    SelectionAlgorithm GetAlgo() const { return m_algo; }
 
    int GetWeight() const { return m_weight; }
};
 
util::Result<SelectionResult> SelectCoinsBnB(std::vector<OutputGroup>& utxo_pool, const CAmount& selection_target, const CAmount& cost_of_change,
                                             int max_selection_weight);
 
util::Result<SelectionResult> CoinGrinder(std::vector<OutputGroup>& utxo_pool, const CAmount& selection_target, CAmount change_target, int max_selection_weight);
 
util::Result<SelectionResult> SelectCoinsSRD(const std::vector<OutputGroup>& utxo_pool, CAmount target_value, CAmount change_fee, FastRandomContext& rng,
                                             int max_selection_weight);
 
// Original coin selection algorithm as a fallback
util::Result<SelectionResult> KnapsackSolver(std::vector<OutputGroup>& groups, const CAmount& nTargetValue,
                                             CAmount change_target, FastRandomContext& rng, int max_selection_weight);
} // namespace wallet
 
#endif // BITCOIN_WALLET_COINSELECTION_H