@@ -102,6 +102,9 @@ impl<G: Deref<Target = NetworkGraph<L>> + Clone, L: Deref, S: Deref, SP: Sized,
102
102
// The minimum channel balance certainty required for using a channel in a blinded path.
103
103
const MIN_CHANNEL_CERTAINTY : f64 = 0.5 ;
104
104
105
+ // The minimum success probability required for using a channel in a blinded path.
106
+ const MIN_SUCCESS_PROBABILITY : f64 = 0.25 ;
107
+
105
108
let network_graph = self . network_graph . deref ( ) . read_only ( ) ;
106
109
let counterparty_channels = first_hops. into_iter ( )
107
110
. filter ( |details| details. counterparty . features . supports_route_blinding ( ) )
@@ -177,6 +180,21 @@ impl<G: Deref<Target = NetworkGraph<L>> + Clone, L: Deref, S: Deref, SP: Sized,
177
180
//
178
181
// source --- info ---> counterparty --- counterparty_forward_node ---> recipient
179
182
. filter_map ( |( introduction_node_id, scid, info, counterparty_forward_node) | {
183
+ let amount_msat = amount_msats;
184
+ let effective_capacity = info. effective_capacity ( ) ;
185
+ let usage = ChannelUsage { amount_msat, inflight_htlc_msat : 0 , effective_capacity } ;
186
+ let success_probability = scorer. channel_success_probability (
187
+ scid, & info, usage, & self . score_params
188
+ ) ;
189
+
190
+ if !success_probability. is_finite ( ) {
191
+ return None ;
192
+ }
193
+
194
+ if success_probability < MIN_SUCCESS_PROBABILITY {
195
+ return None ;
196
+ }
197
+
180
198
let htlc_minimum_msat = info. direction ( ) . htlc_minimum_msat ;
181
199
let htlc_maximum_msat = info. direction ( ) . htlc_maximum_msat ;
182
200
let payment_relay: PaymentRelay = match info. try_into ( ) {
@@ -198,12 +216,13 @@ impl<G: Deref<Target = NetworkGraph<L>> + Clone, L: Deref, S: Deref, SP: Sized,
198
216
node_id : introduction_node_id. as_pubkey ( ) . unwrap ( ) ,
199
217
htlc_maximum_msat,
200
218
} ;
201
- Some ( BlindedPath :: new_for_payment (
219
+ let path = BlindedPath :: new_for_payment (
202
220
& [ introduction_forward_node, counterparty_forward_node] , recipient,
203
221
tlvs. clone ( ) , u64:: MAX , entropy_source, secp_ctx
204
- ) )
205
- } )
206
- . take ( MAX_PAYMENT_PATHS ) ;
222
+ ) ;
223
+
224
+ Some ( path. map ( |path| ( path, success_probability) ) )
225
+ } ) ;
207
226
208
227
let two_hop_paths = counterparty_channels
209
228
. map ( |( forward_node, _) | {
@@ -216,6 +235,10 @@ impl<G: Deref<Target = NetworkGraph<L>> + Clone, L: Deref, S: Deref, SP: Sized,
216
235
three_hop_paths
217
236
. collect :: < Result < Vec < _ > , _ > > ( ) . ok ( )
218
237
. and_then ( |paths| ( !paths. is_empty ( ) ) . then ( || paths) )
238
+ . map ( |mut paths| {
239
+ paths. sort_unstable_by ( |a, b| b. 1 . partial_cmp ( & a. 1 ) . unwrap ( ) ) ;
240
+ paths. into_iter ( ) . map ( |( path, _) | path) . take ( MAX_PAYMENT_PATHS ) . collect :: < Vec < _ > > ( )
241
+ } )
219
242
. or_else ( || two_hop_paths. collect :: < Result < Vec < _ > , _ > > ( ) . ok ( ) )
220
243
. and_then ( |paths| ( !paths. is_empty ( ) ) . then ( || paths) )
221
244
. or_else ( || network_graph
0 commit comments