@@ -71,11 +71,13 @@ struct {
7171
7272static const size_t TOTAL_TRIES = 100000 ;
7373
74- util::Result<SelectionResult> SelectCoinsBnB (std::vector<OutputGroup>& utxo_pool, const CAmount& selection_target, const CAmount& cost_of_change)
74+ util::Result<SelectionResult> SelectCoinsBnB (std::vector<OutputGroup>& utxo_pool, const CAmount& selection_target, const CAmount& cost_of_change,
75+ int max_weight)
7576{
7677 SelectionResult result (selection_target, SelectionAlgorithm::BNB);
7778 CAmount curr_value = 0 ;
7879 std::vector<size_t > curr_selection; // selected utxo indexes
80+ int curr_selection_weight = 0 ; // sum of selected utxo weight
7981
8082 // Calculate curr_available_value
8183 CAmount curr_available_value = 0 ;
@@ -97,6 +99,7 @@ util::Result<SelectionResult> SelectCoinsBnB(std::vector<OutputGroup>& utxo_pool
9799 CAmount best_waste = MAX_MONEY;
98100
99101 bool is_feerate_high = utxo_pool.at (0 ).fee > utxo_pool.at (0 ).long_term_fee ;
102+ bool max_tx_weight_exceeded = false ;
100103
101104 // Depth First search loop for choosing the UTXOs
102105 for (size_t curr_try = 0 , utxo_pool_index = 0 ; curr_try < TOTAL_TRIES; ++curr_try, ++utxo_pool_index) {
@@ -106,6 +109,9 @@ util::Result<SelectionResult> SelectCoinsBnB(std::vector<OutputGroup>& utxo_pool
106109 curr_value > selection_target + cost_of_change || // Selected value is out of range, go back and try other branch
107110 (curr_waste > best_waste && is_feerate_high)) { // Don't select things which we know will be more wasteful if the waste is increasing
108111 backtrack = true ;
112+ } else if (curr_selection_weight > max_weight) { // Exceeding weight for standard tx, cannot find more solutions by adding more inputs
113+ max_tx_weight_exceeded = true ; // at least one selection attempt exceeded the max weight
114+ backtrack = true ;
109115 } else if (curr_value >= selection_target) { // Selected value is within range
110116 curr_waste += (curr_value - selection_target); // This is the excess value which is added to the waste for the below comparison
111117 // Adding another UTXO after this check could bring the waste down if the long term fee is higher than the current fee.
@@ -135,6 +141,7 @@ util::Result<SelectionResult> SelectCoinsBnB(std::vector<OutputGroup>& utxo_pool
135141 OutputGroup& utxo = utxo_pool.at (utxo_pool_index);
136142 curr_value -= utxo.GetSelectionAmount ();
137143 curr_waste -= utxo.fee - utxo.long_term_fee ;
144+ curr_selection_weight -= utxo.m_weight ;
138145 curr_selection.pop_back ();
139146 } else { // Moving forwards, continuing down this branch
140147 OutputGroup& utxo = utxo_pool.at (utxo_pool_index);
@@ -154,13 +161,14 @@ util::Result<SelectionResult> SelectCoinsBnB(std::vector<OutputGroup>& utxo_pool
154161 curr_selection.push_back (utxo_pool_index);
155162 curr_value += utxo.GetSelectionAmount ();
156163 curr_waste += utxo.fee - utxo.long_term_fee ;
164+ curr_selection_weight += utxo.m_weight ;
157165 }
158166 }
159167 }
160168
161169 // Check for solution
162170 if (best_selection.empty ()) {
163- return util::Error ();
171+ return max_tx_weight_exceeded ? ErrorMaxWeightExceeded () : util::Error ();
164172 }
165173
166174 // Set output set
0 commit comments