@@ -29,7 +29,7 @@ use crate::ln::channel_keys::{DelayedPaymentBasepoint, HtlcBasepoint};
2929use crate :: ln:: msgs:: DecodeError ;
3030use crate :: chain:: chaininterface:: { FeeEstimator , ConfirmationTarget , MIN_RELAY_FEE_SAT_PER_1000_WEIGHT , compute_feerate_sat_per_1000_weight, FEERATE_FLOOR_SATS_PER_KW } ;
3131use crate :: sign:: ecdsa:: WriteableEcdsaChannelSigner ;
32- use crate :: chain:: onchaintx:: { ExternalHTLCClaim , OnchainTxHandler } ;
32+ use crate :: chain:: onchaintx:: { FeerateStrategy , ExternalHTLCClaim , OnchainTxHandler } ;
3333use crate :: util:: logger:: Logger ;
3434use crate :: util:: ser:: { Readable , Writer , Writeable , RequiredWrapper } ;
3535
@@ -963,7 +963,7 @@ impl PackageTemplate {
963963 /// which was used to generate the value. Will not return less than `dust_limit_sats` for the
964964 /// value.
965965 pub ( crate ) fn compute_package_output < F : Deref , L : Logger > (
966- & self , predicted_weight : u64 , dust_limit_sats : u64 , force_feerate_bump : bool ,
966+ & self , predicted_weight : u64 , dust_limit_sats : u64 , feerate_strategy : & FeerateStrategy ,
967967 fee_estimator : & LowerBoundedFeeEstimator < F > , logger : & L ,
968968 ) -> Option < ( u64 , u64 ) >
969969 where F :: Target : FeeEstimator ,
@@ -974,7 +974,7 @@ impl PackageTemplate {
974974 // If old feerate is 0, first iteration of this claim, use normal fee calculation
975975 if self . feerate_previous != 0 {
976976 if let Some ( ( new_fee, feerate) ) = feerate_bump (
977- predicted_weight, input_amounts, self . feerate_previous , force_feerate_bump ,
977+ predicted_weight, input_amounts, self . feerate_previous , feerate_strategy ,
978978 fee_estimator, logger,
979979 ) {
980980 return Some ( ( cmp:: max ( input_amounts as i64 - new_fee as i64 , dust_limit_sats as i64 ) as u64 , feerate) ) ;
@@ -987,32 +987,32 @@ impl PackageTemplate {
987987 None
988988 }
989989
990- /// Computes a feerate based on the given confirmation target. If a previous feerate was used,
991- /// the new feerate is below it, and `force_feerate_bump` is set, we'll use a 25% increase of
992- /// the previous feerate instead of the new feerate.
990+ /// Computes a feerate based on the given confirmation target and feerate strategy.
993991 pub ( crate ) fn compute_package_feerate < F : Deref > (
994992 & self , fee_estimator : & LowerBoundedFeeEstimator < F > , conf_target : ConfirmationTarget ,
995- force_feerate_bump : bool ,
993+ feerate_strategy : & FeerateStrategy ,
996994 ) -> u32 where F :: Target : FeeEstimator {
997995 let feerate_estimate = fee_estimator. bounded_sat_per_1000_weight ( conf_target) ;
998996 if self . feerate_previous != 0 {
999- // Use the new fee estimate if it's higher than the one previously used.
1000- if feerate_estimate as u64 > self . feerate_previous {
1001- feerate_estimate
1002- } else if !force_feerate_bump {
1003- self . feerate_previous . try_into ( ) . unwrap_or ( u32:: max_value ( ) )
1004- } else {
1005- // Our fee estimate has decreased, but our transaction remains unconfirmed after
1006- // using our previous fee estimate. This may point to an unreliable fee estimator,
1007- // so we choose to bump our previous feerate by 25%, making sure we don't use a
1008- // lower feerate or overpay by a large margin by limiting it to 5x the new fee
1009- // estimate.
1010- let previous_feerate = self . feerate_previous . try_into ( ) . unwrap_or ( u32:: max_value ( ) ) ;
1011- let mut new_feerate = previous_feerate. saturating_add ( previous_feerate / 4 ) ;
1012- if new_feerate > feerate_estimate * 5 {
1013- new_feerate = cmp:: max ( feerate_estimate * 5 , previous_feerate) ;
1014- }
1015- new_feerate
997+ let previous_feerate = self . feerate_previous . try_into ( ) . unwrap_or ( u32:: max_value ( ) ) ;
998+ match feerate_strategy {
999+ FeerateStrategy :: RetryPrevious => previous_feerate,
1000+ FeerateStrategy :: HighestOfPreviousOrNew => cmp:: max ( previous_feerate, feerate_estimate) ,
1001+ FeerateStrategy :: ForceBump => if feerate_estimate > previous_feerate {
1002+ feerate_estimate
1003+ } else {
1004+ // Our fee estimate has decreased, but our transaction remains unconfirmed after
1005+ // using our previous fee estimate. This may point to an unreliable fee estimator,
1006+ // so we choose to bump our previous feerate by 25%, making sure we don't use a
1007+ // lower feerate or overpay by a large margin by limiting it to 5x the new fee
1008+ // estimate.
1009+ let previous_feerate = self . feerate_previous . try_into ( ) . unwrap_or ( u32:: max_value ( ) ) ;
1010+ let mut new_feerate = previous_feerate. saturating_add ( previous_feerate / 4 ) ;
1011+ if new_feerate > feerate_estimate * 5 {
1012+ new_feerate = cmp:: max ( feerate_estimate * 5 , previous_feerate) ;
1013+ }
1014+ new_feerate
1015+ } ,
10161016 }
10171017 } else {
10181018 feerate_estimate
@@ -1128,33 +1128,42 @@ fn compute_fee_from_spent_amounts<F: Deref, L: Logger>(input_amounts: u64, predi
11281128
11291129/// Attempt to propose a bumping fee for a transaction from its spent output's values and predicted
11301130/// weight. If feerates proposed by the fee-estimator have been increasing since last fee-bumping
1131- /// attempt, use them. If `force_feerate_bump` is set , we bump the feerate by 25% of the previous
1132- /// feerate, or just use the previous feerate otherwise . If a feerate bump did happen, we also
1133- /// verify that those bumping heuristics respect BIP125 rules 3) and 4) and if required adjust the
1134- /// new fee to meet the RBF policy requirement.
1131+ /// attempt, use them. If we need to force a feerate bump , we manually bump the feerate by 25% of
1132+ /// the previous feerate. If a feerate bump did happen, we also verify that those bumping heuristics
1133+ /// respect BIP125 rules 3) and 4) and if required adjust the new fee to meet the RBF policy
1134+ /// requirement.
11351135fn feerate_bump < F : Deref , L : Logger > (
1136- predicted_weight : u64 , input_amounts : u64 , previous_feerate : u64 , force_feerate_bump : bool ,
1136+ predicted_weight : u64 , input_amounts : u64 , previous_feerate : u64 , feerate_strategy : & FeerateStrategy ,
11371137 fee_estimator : & LowerBoundedFeeEstimator < F > , logger : & L ,
11381138) -> Option < ( u64 , u64 ) >
11391139where
11401140 F :: Target : FeeEstimator ,
11411141{
11421142 // If old feerate inferior to actual one given back by Fee Estimator, use it to compute new fee...
11431143 let ( new_fee, new_feerate) = if let Some ( ( new_fee, new_feerate) ) = compute_fee_from_spent_amounts ( input_amounts, predicted_weight, fee_estimator, logger) {
1144- if new_feerate > previous_feerate {
1145- ( new_fee, new_feerate)
1146- } else if !force_feerate_bump {
1147- let previous_fee = previous_feerate * predicted_weight / 1000 ;
1148- ( previous_fee, previous_feerate)
1149- } else {
1150- // ...else just increase the previous feerate by 25% (because that's a nice number)
1151- let bumped_feerate = previous_feerate + ( previous_feerate / 4 ) ;
1152- let bumped_fee = bumped_feerate * predicted_weight / 1000 ;
1153- if input_amounts <= bumped_fee {
1154- log_warn ! ( logger, "Can't 25% bump new claiming tx, amount {} is too small" , input_amounts) ;
1155- return None ;
1156- }
1157- ( bumped_fee, bumped_feerate)
1144+ match feerate_strategy {
1145+ FeerateStrategy :: RetryPrevious => {
1146+ let previous_fee = previous_feerate * predicted_weight / 1000 ;
1147+ ( previous_fee, previous_feerate)
1148+ } ,
1149+ FeerateStrategy :: HighestOfPreviousOrNew => if new_feerate > previous_feerate {
1150+ ( new_fee, new_feerate)
1151+ } else {
1152+ let previous_fee = previous_feerate * predicted_weight / 1000 ;
1153+ ( previous_fee, previous_feerate)
1154+ } ,
1155+ FeerateStrategy :: ForceBump => if new_feerate > previous_feerate {
1156+ ( new_fee, new_feerate)
1157+ } else {
1158+ // ...else just increase the previous feerate by 25% (because that's a nice number)
1159+ let bumped_feerate = previous_feerate + ( previous_feerate / 4 ) ;
1160+ let bumped_fee = bumped_feerate * predicted_weight / 1000 ;
1161+ if input_amounts <= bumped_fee {
1162+ log_warn ! ( logger, "Can't 25% bump new claiming tx, amount {} is too small" , input_amounts) ;
1163+ return None ;
1164+ }
1165+ ( bumped_fee, bumped_feerate)
1166+ } ,
11581167 }
11591168 } else {
11601169 log_warn ! ( logger, "Can't new-estimation bump new claiming tx, amount {} is too small" , input_amounts) ;
0 commit comments