1 // This file is Copyright its original authors, visible in version control
4 // This file is licensed under the Apache License, Version 2.0 <LICENSE-APACHE
5 // or http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
6 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your option.
7 // You may not use this file except in accordance with one or both of these
10 //! The top-level routing/network map tracking logic lives here.
12 //! You probably want to create a P2PGossipSync and use that as your RoutingMessageHandler and then
13 //! interrogate it to get routes for your own payments.
15 use bitcoin::secp256k1::PublicKey;
17 use ln::channelmanager::ChannelDetails;
18 use ln::features::{ChannelFeatures, InvoiceFeatures, NodeFeatures};
19 use ln::msgs::{DecodeError, ErrorAction, LightningError, MAX_VALUE_MSAT};
20 use routing::gossip::{DirectedChannelInfoWithUpdate, EffectiveCapacity, ReadOnlyNetworkGraph, NetworkGraph, NodeId, RoutingFees};
21 use routing::scoring::{ChannelUsage, Score};
22 use util::ser::{Writeable, Readable, Writer};
23 use util::logger::{Level, Logger};
24 use util::chacha20::ChaCha20;
28 use alloc::collections::BinaryHeap;
33 #[derive(Clone, Debug, Hash, PartialEq, Eq)]
35 /// The node_id of the node at this hop.
36 pub pubkey: PublicKey,
37 /// The node_announcement features of the node at this hop. For the last hop, these may be
38 /// amended to match the features present in the invoice this node generated.
39 pub node_features: NodeFeatures,
40 /// The channel that should be used from the previous hop to reach this node.
41 pub short_channel_id: u64,
42 /// The channel_announcement features of the channel that should be used from the previous hop
43 /// to reach this node.
44 pub channel_features: ChannelFeatures,
45 /// The fee taken on this hop (for paying for the use of the *next* channel in the path).
46 /// For the last hop, this should be the full value of the payment (might be more than
47 /// requested if we had to match htlc_minimum_msat).
49 /// The CLTV delta added for this hop. For the last hop, this should be the full CLTV value
50 /// expected at the destination, in excess of the current block height.
51 pub cltv_expiry_delta: u32,
54 impl_writeable_tlv_based!(RouteHop, {
55 (0, pubkey, required),
56 (2, node_features, required),
57 (4, short_channel_id, required),
58 (6, channel_features, required),
59 (8, fee_msat, required),
60 (10, cltv_expiry_delta, required),
63 /// A route directs a payment from the sender (us) to the recipient. If the recipient supports MPP,
64 /// it can take multiple paths. Each path is composed of one or more hops through the network.
65 #[derive(Clone, Hash, PartialEq, Eq)]
67 /// The list of routes taken for a single (potentially-)multi-part payment. The pubkey of the
68 /// last RouteHop in each path must be the same. Each entry represents a list of hops, NOT
69 /// INCLUDING our own, where the last hop is the destination. Thus, this must always be at
70 /// least length one. While the maximum length of any given path is variable, keeping the length
71 /// of any path less or equal to 19 should currently ensure it is viable.
72 pub paths: Vec<Vec<RouteHop>>,
73 /// The `payment_params` parameter passed to [`find_route`].
74 /// This is used by `ChannelManager` to track information which may be required for retries,
75 /// provided back to you via [`Event::PaymentPathFailed`].
77 /// [`Event::PaymentPathFailed`]: crate::util::events::Event::PaymentPathFailed
78 pub payment_params: Option<PaymentParameters>,
81 pub(crate) trait RoutePath {
82 /// Gets the fees for a given path, excluding any excess paid to the recipient.
83 fn get_path_fees(&self) -> u64;
85 impl RoutePath for Vec<RouteHop> {
86 fn get_path_fees(&self) -> u64 {
87 // Do not count last hop of each path since that's the full value of the payment
88 self.split_last().map(|(_, path_prefix)| path_prefix).unwrap_or(&[])
89 .iter().map(|hop| &hop.fee_msat)
95 /// Returns the total amount of fees paid on this [`Route`].
97 /// This doesn't include any extra payment made to the recipient, which can happen in excess of
98 /// the amount passed to [`find_route`]'s `params.final_value_msat`.
99 pub fn get_total_fees(&self) -> u64 {
100 self.paths.iter().map(|path| path.get_path_fees()).sum()
103 /// Returns the total amount paid on this [`Route`], excluding the fees.
104 pub fn get_total_amount(&self) -> u64 {
105 return self.paths.iter()
106 .map(|path| path.split_last().map(|(hop, _)| hop.fee_msat).unwrap_or(0))
111 const SERIALIZATION_VERSION: u8 = 1;
112 const MIN_SERIALIZATION_VERSION: u8 = 1;
114 impl Writeable for Route {
115 fn write<W: ::util::ser::Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
116 write_ver_prefix!(writer, SERIALIZATION_VERSION, MIN_SERIALIZATION_VERSION);
117 (self.paths.len() as u64).write(writer)?;
118 for hops in self.paths.iter() {
119 (hops.len() as u8).write(writer)?;
120 for hop in hops.iter() {
124 write_tlv_fields!(writer, {
125 (1, self.payment_params, option),
131 impl Readable for Route {
132 fn read<R: io::Read>(reader: &mut R) -> Result<Route, DecodeError> {
133 let _ver = read_ver_prefix!(reader, SERIALIZATION_VERSION);
134 let path_count: u64 = Readable::read(reader)?;
135 let mut paths = Vec::with_capacity(cmp::min(path_count, 128) as usize);
136 for _ in 0..path_count {
137 let hop_count: u8 = Readable::read(reader)?;
138 let mut hops = Vec::with_capacity(hop_count as usize);
139 for _ in 0..hop_count {
140 hops.push(Readable::read(reader)?);
144 let mut payment_params = None;
145 read_tlv_fields!(reader, {
146 (1, payment_params, option),
148 Ok(Route { paths, payment_params })
152 /// Parameters needed to find a [`Route`].
154 /// Passed to [`find_route`] and [`build_route_from_hops`], but also provided in
155 /// [`Event::PaymentPathFailed`] for retrying a failed payment path.
157 /// [`Event::PaymentPathFailed`]: crate::util::events::Event::PaymentPathFailed
158 #[derive(Clone, Debug)]
159 pub struct RouteParameters {
160 /// The parameters of the failed payment path.
161 pub payment_params: PaymentParameters,
163 /// The amount in msats sent on the failed payment path.
164 pub final_value_msat: u64,
166 /// The CLTV on the final hop of the failed payment path.
167 pub final_cltv_expiry_delta: u32,
170 impl_writeable_tlv_based!(RouteParameters, {
171 (0, payment_params, required),
172 (2, final_value_msat, required),
173 (4, final_cltv_expiry_delta, required),
176 /// Maximum total CTLV difference we allow for a full payment path.
177 pub const DEFAULT_MAX_TOTAL_CLTV_EXPIRY_DELTA: u32 = 1008;
179 /// Maximum number of paths we allow an (MPP) payment to have.
180 // The default limit is currently set rather arbitrary - there aren't any real fundamental path-count
181 // limits, but for now more than 10 paths likely carries too much one-path failure.
182 pub const DEFAULT_MAX_PATH_COUNT: u8 = 10;
184 // The median hop CLTV expiry delta currently seen in the network.
185 const MEDIAN_HOP_CLTV_EXPIRY_DELTA: u32 = 40;
187 // During routing, we only consider paths shorter than our maximum length estimate.
188 // In the legacy onion format, the maximum number of hops used to be a fixed value of 20.
189 // However, in the TLV onion format, there is no fixed maximum length, but the `hop_payloads`
190 // field is always 1300 bytes. As the `tlv_payload` for each hop may vary in length, we have to
191 // estimate how many hops the route may have so that it actually fits the `hop_payloads` field.
193 // We estimate 3+32 (payload length and HMAC) + 2+8 (amt_to_forward) + 2+4 (outgoing_cltv_value) +
194 // 2+8 (short_channel_id) = 61 bytes for each intermediate hop and 3+32
195 // (payload length and HMAC) + 2+8 (amt_to_forward) + 2+4 (outgoing_cltv_value) + 2+32+8
196 // (payment_secret and total_msat) = 93 bytes for the final hop.
197 // Since the length of the potentially included `payment_metadata` is unknown to us, we round
198 // down from (1300-93) / 61 = 19.78... to arrive at a conservative estimate of 19.
199 const MAX_PATH_LENGTH_ESTIMATE: u8 = 19;
201 /// The recipient of a payment.
202 #[derive(Clone, Debug, Hash, PartialEq, Eq)]
203 pub struct PaymentParameters {
204 /// The node id of the payee.
205 pub payee_pubkey: PublicKey,
207 /// Features supported by the payee.
209 /// May be set from the payee's invoice or via [`for_keysend`]. May be `None` if the invoice
210 /// does not contain any features.
212 /// [`for_keysend`]: Self::for_keysend
213 pub features: Option<InvoiceFeatures>,
215 /// Hints for routing to the payee, containing channels connecting the payee to public nodes.
216 pub route_hints: Vec<RouteHint>,
218 /// Expiration of a payment to the payee, in seconds relative to the UNIX epoch.
219 pub expiry_time: Option<u64>,
221 /// The maximum total CLTV delta we accept for the route.
222 /// Defaults to [`DEFAULT_MAX_TOTAL_CLTV_EXPIRY_DELTA`].
223 pub max_total_cltv_expiry_delta: u32,
225 /// The maximum number of paths that may be used by (MPP) payments.
226 /// Defaults to [`DEFAULT_MAX_PATH_COUNT`].
227 pub max_path_count: u8,
230 impl_writeable_tlv_based!(PaymentParameters, {
231 (0, payee_pubkey, required),
232 (1, max_total_cltv_expiry_delta, (default_value, DEFAULT_MAX_TOTAL_CLTV_EXPIRY_DELTA)),
233 (2, features, option),
234 (3, max_path_count, (default_value, DEFAULT_MAX_PATH_COUNT)),
235 (4, route_hints, vec_type),
236 (6, expiry_time, option),
239 impl PaymentParameters {
240 /// Creates a payee with the node id of the given `pubkey`.
241 pub fn from_node_id(payee_pubkey: PublicKey) -> Self {
247 max_total_cltv_expiry_delta: DEFAULT_MAX_TOTAL_CLTV_EXPIRY_DELTA,
248 max_path_count: DEFAULT_MAX_PATH_COUNT,
252 /// Creates a payee with the node id of the given `pubkey` to use for keysend payments.
253 pub fn for_keysend(payee_pubkey: PublicKey) -> Self {
254 Self::from_node_id(payee_pubkey).with_features(InvoiceFeatures::for_keysend())
257 /// Includes the payee's features.
259 /// (C-not exported) since bindings don't support move semantics
260 pub fn with_features(self, features: InvoiceFeatures) -> Self {
261 Self { features: Some(features), ..self }
264 /// Includes hints for routing to the payee.
266 /// (C-not exported) since bindings don't support move semantics
267 pub fn with_route_hints(self, route_hints: Vec<RouteHint>) -> Self {
268 Self { route_hints, ..self }
271 /// Includes a payment expiration in seconds relative to the UNIX epoch.
273 /// (C-not exported) since bindings don't support move semantics
274 pub fn with_expiry_time(self, expiry_time: u64) -> Self {
275 Self { expiry_time: Some(expiry_time), ..self }
278 /// Includes a limit for the total CLTV expiry delta which is considered during routing
280 /// (C-not exported) since bindings don't support move semantics
281 pub fn with_max_total_cltv_expiry_delta(self, max_total_cltv_expiry_delta: u32) -> Self {
282 Self { max_total_cltv_expiry_delta, ..self }
285 /// Includes a limit for the maximum number of payment paths that may be used.
287 /// (C-not exported) since bindings don't support move semantics
288 pub fn with_max_path_count(self, max_path_count: u8) -> Self {
289 Self { max_path_count, ..self }
293 /// A list of hops along a payment path terminating with a channel to the recipient.
294 #[derive(Clone, Debug, Hash, Eq, PartialEq)]
295 pub struct RouteHint(pub Vec<RouteHintHop>);
297 impl Writeable for RouteHint {
298 fn write<W: ::util::ser::Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
299 (self.0.len() as u64).write(writer)?;
300 for hop in self.0.iter() {
307 impl Readable for RouteHint {
308 fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
309 let hop_count: u64 = Readable::read(reader)?;
310 let mut hops = Vec::with_capacity(cmp::min(hop_count, 16) as usize);
311 for _ in 0..hop_count {
312 hops.push(Readable::read(reader)?);
318 /// A channel descriptor for a hop along a payment path.
319 #[derive(Clone, Debug, Hash, Eq, PartialEq)]
320 pub struct RouteHintHop {
321 /// The node_id of the non-target end of the route
322 pub src_node_id: PublicKey,
323 /// The short_channel_id of this channel
324 pub short_channel_id: u64,
325 /// The fees which must be paid to use this channel
326 pub fees: RoutingFees,
327 /// The difference in CLTV values between this node and the next node.
328 pub cltv_expiry_delta: u16,
329 /// The minimum value, in msat, which must be relayed to the next hop.
330 pub htlc_minimum_msat: Option<u64>,
331 /// The maximum value in msat available for routing with a single HTLC.
332 pub htlc_maximum_msat: Option<u64>,
335 impl_writeable_tlv_based!(RouteHintHop, {
336 (0, src_node_id, required),
337 (1, htlc_minimum_msat, option),
338 (2, short_channel_id, required),
339 (3, htlc_maximum_msat, option),
341 (6, cltv_expiry_delta, required),
344 #[derive(Eq, PartialEq)]
345 struct RouteGraphNode {
347 lowest_fee_to_peer_through_node: u64,
348 lowest_fee_to_node: u64,
349 total_cltv_delta: u32,
350 // The maximum value a yet-to-be-constructed payment path might flow through this node.
351 // This value is upper-bounded by us by:
352 // - how much is needed for a path being constructed
353 // - how much value can channels following this node (up to the destination) can contribute,
354 // considering their capacity and fees
355 value_contribution_msat: u64,
356 /// The effective htlc_minimum_msat at this hop. If a later hop on the path had a higher HTLC
357 /// minimum, we use it, plus the fees required at each earlier hop to meet it.
358 path_htlc_minimum_msat: u64,
359 /// All penalties incurred from this hop on the way to the destination, as calculated using
361 path_penalty_msat: u64,
362 /// The number of hops walked up to this node.
363 path_length_to_node: u8,
366 impl cmp::Ord for RouteGraphNode {
367 fn cmp(&self, other: &RouteGraphNode) -> cmp::Ordering {
368 let other_score = cmp::max(other.lowest_fee_to_peer_through_node, other.path_htlc_minimum_msat)
369 .saturating_add(other.path_penalty_msat);
370 let self_score = cmp::max(self.lowest_fee_to_peer_through_node, self.path_htlc_minimum_msat)
371 .saturating_add(self.path_penalty_msat);
372 other_score.cmp(&self_score).then_with(|| other.node_id.cmp(&self.node_id))
376 impl cmp::PartialOrd for RouteGraphNode {
377 fn partial_cmp(&self, other: &RouteGraphNode) -> Option<cmp::Ordering> {
378 Some(self.cmp(other))
382 /// A wrapper around the various hop representations.
384 /// Used to construct a [`PathBuildingHop`] and to estimate [`EffectiveCapacity`].
385 #[derive(Clone, Debug)]
386 enum CandidateRouteHop<'a> {
387 /// A hop from the payer, where the outbound liquidity is known.
389 details: &'a ChannelDetails,
391 /// A hop found in the [`ReadOnlyNetworkGraph`], where the channel capacity may be unknown.
393 info: DirectedChannelInfoWithUpdate<'a>,
394 short_channel_id: u64,
396 /// A hop to the payee found in the payment invoice, though not necessarily a direct channel.
398 hint: &'a RouteHintHop,
402 impl<'a> CandidateRouteHop<'a> {
403 fn short_channel_id(&self) -> u64 {
405 CandidateRouteHop::FirstHop { details } => details.get_outbound_payment_scid().unwrap(),
406 CandidateRouteHop::PublicHop { short_channel_id, .. } => *short_channel_id,
407 CandidateRouteHop::PrivateHop { hint } => hint.short_channel_id,
411 // NOTE: This may alloc memory so avoid calling it in a hot code path.
412 fn features(&self) -> ChannelFeatures {
414 CandidateRouteHop::FirstHop { details } => details.counterparty.features.to_context(),
415 CandidateRouteHop::PublicHop { info, .. } => info.channel().features.clone(),
416 CandidateRouteHop::PrivateHop { .. } => ChannelFeatures::empty(),
420 fn cltv_expiry_delta(&self) -> u32 {
422 CandidateRouteHop::FirstHop { .. } => 0,
423 CandidateRouteHop::PublicHop { info, .. } => info.direction().cltv_expiry_delta as u32,
424 CandidateRouteHop::PrivateHop { hint } => hint.cltv_expiry_delta as u32,
428 fn htlc_minimum_msat(&self) -> u64 {
430 CandidateRouteHop::FirstHop { .. } => 0,
431 CandidateRouteHop::PublicHop { info, .. } => info.direction().htlc_minimum_msat,
432 CandidateRouteHop::PrivateHop { hint } => hint.htlc_minimum_msat.unwrap_or(0),
436 fn htlc_maximum_msat(&self) -> u64 {
438 CandidateRouteHop::FirstHop { details } => details.next_outbound_htlc_limit_msat,
439 CandidateRouteHop::PublicHop { info, .. } => info.htlc_maximum_msat(),
440 CandidateRouteHop::PrivateHop { hint } => {
441 hint.htlc_maximum_msat.unwrap_or(u64::max_value())
446 fn fees(&self) -> RoutingFees {
448 CandidateRouteHop::FirstHop { .. } => RoutingFees {
449 base_msat: 0, proportional_millionths: 0,
451 CandidateRouteHop::PublicHop { info, .. } => info.direction().fees,
452 CandidateRouteHop::PrivateHop { hint } => hint.fees,
456 fn effective_capacity(&self) -> EffectiveCapacity {
458 CandidateRouteHop::FirstHop { details } => EffectiveCapacity::ExactLiquidity {
459 liquidity_msat: details.next_outbound_htlc_limit_msat,
461 CandidateRouteHop::PublicHop { info, .. } => info.effective_capacity(),
462 CandidateRouteHop::PrivateHop { .. } => EffectiveCapacity::Infinite,
467 /// It's useful to keep track of the hops associated with the fees required to use them,
468 /// so that we can choose cheaper paths (as per Dijkstra's algorithm).
469 /// Fee values should be updated only in the context of the whole path, see update_value_and_recompute_fees.
470 /// These fee values are useful to choose hops as we traverse the graph "payee-to-payer".
472 struct PathBuildingHop<'a> {
473 // Note that this should be dropped in favor of loading it from CandidateRouteHop, but doing so
474 // is a larger refactor and will require careful performance analysis.
476 candidate: CandidateRouteHop<'a>,
479 /// Minimal fees required to route to the source node of the current hop via any of its inbound channels.
480 src_lowest_inbound_fees: RoutingFees,
481 /// All the fees paid *after* this channel on the way to the destination
482 next_hops_fee_msat: u64,
483 /// Fee paid for the use of the current channel (see candidate.fees()).
484 /// The value will be actually deducted from the counterparty balance on the previous link.
485 hop_use_fee_msat: u64,
486 /// Used to compare channels when choosing the for routing.
487 /// Includes paying for the use of a hop and the following hops, as well as
488 /// an estimated cost of reaching this hop.
489 /// Might get stale when fees are recomputed. Primarily for internal use.
491 /// A mirror of the same field in RouteGraphNode. Note that this is only used during the graph
492 /// walk and may be invalid thereafter.
493 path_htlc_minimum_msat: u64,
494 /// All penalties incurred from this channel on the way to the destination, as calculated using
496 path_penalty_msat: u64,
497 /// If we've already processed a node as the best node, we shouldn't process it again. Normally
498 /// we'd just ignore it if we did as all channels would have a higher new fee, but because we
499 /// may decrease the amounts in use as we walk the graph, the actual calculated fee may
500 /// decrease as well. Thus, we have to explicitly track which nodes have been processed and
501 /// avoid processing them again.
503 #[cfg(all(not(feature = "_bench_unstable"), any(test, fuzzing)))]
504 // In tests, we apply further sanity checks on cases where we skip nodes we already processed
505 // to ensure it is specifically in cases where the fee has gone down because of a decrease in
506 // value_contribution_msat, which requires tracking it here. See comments below where it is
507 // used for more info.
508 value_contribution_msat: u64,
511 impl<'a> core::fmt::Debug for PathBuildingHop<'a> {
512 fn fmt(&self, f: &mut core::fmt::Formatter) -> Result<(), core::fmt::Error> {
513 let mut debug_struct = f.debug_struct("PathBuildingHop");
515 .field("node_id", &self.node_id)
516 .field("short_channel_id", &self.candidate.short_channel_id())
517 .field("total_fee_msat", &self.total_fee_msat)
518 .field("next_hops_fee_msat", &self.next_hops_fee_msat)
519 .field("hop_use_fee_msat", &self.hop_use_fee_msat)
520 .field("total_fee_msat - (next_hops_fee_msat + hop_use_fee_msat)", &(&self.total_fee_msat - (&self.next_hops_fee_msat + &self.hop_use_fee_msat)))
521 .field("path_penalty_msat", &self.path_penalty_msat)
522 .field("path_htlc_minimum_msat", &self.path_htlc_minimum_msat)
523 .field("cltv_expiry_delta", &self.candidate.cltv_expiry_delta());
524 #[cfg(all(not(feature = "_bench_unstable"), any(test, fuzzing)))]
525 let debug_struct = debug_struct
526 .field("value_contribution_msat", &self.value_contribution_msat);
527 debug_struct.finish()
531 // Instantiated with a list of hops with correct data in them collected during path finding,
532 // an instance of this struct should be further modified only via given methods.
534 struct PaymentPath<'a> {
535 hops: Vec<(PathBuildingHop<'a>, NodeFeatures)>,
538 impl<'a> PaymentPath<'a> {
539 // TODO: Add a value_msat field to PaymentPath and use it instead of this function.
540 fn get_value_msat(&self) -> u64 {
541 self.hops.last().unwrap().0.fee_msat
544 fn get_path_penalty_msat(&self) -> u64 {
545 self.hops.first().map(|h| h.0.path_penalty_msat).unwrap_or(u64::max_value())
548 fn get_total_fee_paid_msat(&self) -> u64 {
549 if self.hops.len() < 1 {
553 // Can't use next_hops_fee_msat because it gets outdated.
554 for (i, (hop, _)) in self.hops.iter().enumerate() {
555 if i != self.hops.len() - 1 {
556 result += hop.fee_msat;
562 fn get_cost_msat(&self) -> u64 {
563 self.get_total_fee_paid_msat().saturating_add(self.get_path_penalty_msat())
566 // If the amount transferred by the path is updated, the fees should be adjusted. Any other way
567 // to change fees may result in an inconsistency.
569 // Sometimes we call this function right after constructing a path which is inconsistent in
570 // that it the value being transferred has decreased while we were doing path finding, leading
571 // to the fees being paid not lining up with the actual limits.
573 // Note that this function is not aware of the available_liquidity limit, and thus does not
574 // support increasing the value being transferred.
575 fn update_value_and_recompute_fees(&mut self, value_msat: u64) {
576 assert!(value_msat <= self.hops.last().unwrap().0.fee_msat);
578 let mut total_fee_paid_msat = 0 as u64;
579 for i in (0..self.hops.len()).rev() {
580 let last_hop = i == self.hops.len() - 1;
582 // For non-last-hop, this value will represent the fees paid on the current hop. It
583 // will consist of the fees for the use of the next hop, and extra fees to match
584 // htlc_minimum_msat of the current channel. Last hop is handled separately.
585 let mut cur_hop_fees_msat = 0;
587 cur_hop_fees_msat = self.hops.get(i + 1).unwrap().0.hop_use_fee_msat;
590 let mut cur_hop = &mut self.hops.get_mut(i).unwrap().0;
591 cur_hop.next_hops_fee_msat = total_fee_paid_msat;
592 // Overpay in fees if we can't save these funds due to htlc_minimum_msat.
593 // We try to account for htlc_minimum_msat in scoring (add_entry!), so that nodes don't
594 // set it too high just to maliciously take more fees by exploiting this
595 // match htlc_minimum_msat logic.
596 let mut cur_hop_transferred_amount_msat = total_fee_paid_msat + value_msat;
597 if let Some(extra_fees_msat) = cur_hop.candidate.htlc_minimum_msat().checked_sub(cur_hop_transferred_amount_msat) {
598 // Note that there is a risk that *previous hops* (those closer to us, as we go
599 // payee->our_node here) would exceed their htlc_maximum_msat or available balance.
601 // This might make us end up with a broken route, although this should be super-rare
602 // in practice, both because of how healthy channels look like, and how we pick
603 // channels in add_entry.
604 // Also, this can't be exploited more heavily than *announce a free path and fail
606 cur_hop_transferred_amount_msat += extra_fees_msat;
607 total_fee_paid_msat += extra_fees_msat;
608 cur_hop_fees_msat += extra_fees_msat;
612 // Final hop is a special case: it usually has just value_msat (by design), but also
613 // it still could overpay for the htlc_minimum_msat.
614 cur_hop.fee_msat = cur_hop_transferred_amount_msat;
616 // Propagate updated fees for the use of the channels to one hop back, where they
617 // will be actually paid (fee_msat). The last hop is handled above separately.
618 cur_hop.fee_msat = cur_hop_fees_msat;
621 // Fee for the use of the current hop which will be deducted on the previous hop.
622 // Irrelevant for the first hop, as it doesn't have the previous hop, and the use of
623 // this channel is free for us.
625 if let Some(new_fee) = compute_fees(cur_hop_transferred_amount_msat, cur_hop.candidate.fees()) {
626 cur_hop.hop_use_fee_msat = new_fee;
627 total_fee_paid_msat += new_fee;
629 // It should not be possible because this function is called only to reduce the
630 // value. In that case, compute_fee was already called with the same fees for
631 // larger amount and there was no overflow.
639 fn compute_fees(amount_msat: u64, channel_fees: RoutingFees) -> Option<u64> {
640 let proportional_fee_millions =
641 amount_msat.checked_mul(channel_fees.proportional_millionths as u64);
642 if let Some(new_fee) = proportional_fee_millions.and_then(|part| {
643 (channel_fees.base_msat as u64).checked_add(part / 1_000_000) }) {
647 // This function may be (indirectly) called without any verification,
648 // with channel_fees provided by a caller. We should handle it gracefully.
653 /// The default `features` we assume for a node in a route, when no `features` are known about that
656 /// Default features are:
657 /// * variable_length_onion_optional
658 fn default_node_features() -> NodeFeatures {
659 let mut features = NodeFeatures::empty();
660 features.set_variable_length_onion_optional();
664 /// Finds a route from us (payer) to the given target node (payee).
666 /// If the payee provided features in their invoice, they should be provided via `params.payee`.
667 /// Without this, MPP will only be used if the payee's features are available in the network graph.
669 /// Private routing paths between a public node and the target may be included in `params.payee`.
671 /// If some channels aren't announced, it may be useful to fill in `first_hops` with the results
672 /// from [`ChannelManager::list_usable_channels`]. If it is filled in, the view of these channels
673 /// from `network_graph` will be ignored, and only those in `first_hops` will be used.
675 /// The fees on channels from us to the next hop are ignored as they are assumed to all be equal.
676 /// However, the enabled/disabled bit on such channels as well as the `htlc_minimum_msat` /
677 /// `htlc_maximum_msat` *are* checked as they may change based on the receiving node.
681 /// May be used to re-compute a [`Route`] when handling a [`Event::PaymentPathFailed`]. Any
682 /// adjustments to the [`NetworkGraph`] and channel scores should be made prior to calling this
687 /// Panics if first_hops contains channels without short_channel_ids;
688 /// [`ChannelManager::list_usable_channels`] will never include such channels.
690 /// [`ChannelManager::list_usable_channels`]: crate::ln::channelmanager::ChannelManager::list_usable_channels
691 /// [`Event::PaymentPathFailed`]: crate::util::events::Event::PaymentPathFailed
692 /// [`NetworkGraph`]: crate::routing::gossip::NetworkGraph
693 pub fn find_route<L: Deref, GL: Deref, S: Score>(
694 our_node_pubkey: &PublicKey, route_params: &RouteParameters,
695 network_graph: &NetworkGraph<GL>, first_hops: Option<&[&ChannelDetails]>, logger: L,
696 scorer: &S, random_seed_bytes: &[u8; 32]
697 ) -> Result<Route, LightningError>
698 where L::Target: Logger, GL::Target: Logger {
699 let graph_lock = network_graph.read_only();
700 let mut route = get_route(our_node_pubkey, &route_params.payment_params, &graph_lock, first_hops,
701 route_params.final_value_msat, route_params.final_cltv_expiry_delta, logger, scorer,
703 add_random_cltv_offset(&mut route, &route_params.payment_params, &graph_lock, random_seed_bytes);
707 pub(crate) fn get_route<L: Deref, S: Score>(
708 our_node_pubkey: &PublicKey, payment_params: &PaymentParameters, network_graph: &ReadOnlyNetworkGraph,
709 first_hops: Option<&[&ChannelDetails]>, final_value_msat: u64, final_cltv_expiry_delta: u32,
710 logger: L, scorer: &S, random_seed_bytes: &[u8; 32]
711 ) -> Result<Route, LightningError>
712 where L::Target: Logger {
713 let payee_node_id = NodeId::from_pubkey(&payment_params.payee_pubkey);
714 let our_node_id = NodeId::from_pubkey(&our_node_pubkey);
716 if payee_node_id == our_node_id {
717 return Err(LightningError{err: "Cannot generate a route to ourselves".to_owned(), action: ErrorAction::IgnoreError});
720 if final_value_msat > MAX_VALUE_MSAT {
721 return Err(LightningError{err: "Cannot generate a route of more value than all existing satoshis".to_owned(), action: ErrorAction::IgnoreError});
724 if final_value_msat == 0 {
725 return Err(LightningError{err: "Cannot send a payment of 0 msat".to_owned(), action: ErrorAction::IgnoreError});
728 for route in payment_params.route_hints.iter() {
729 for hop in &route.0 {
730 if hop.src_node_id == payment_params.payee_pubkey {
731 return Err(LightningError{err: "Route hint cannot have the payee as the source.".to_owned(), action: ErrorAction::IgnoreError});
735 if payment_params.max_total_cltv_expiry_delta <= final_cltv_expiry_delta {
736 return Err(LightningError{err: "Can't find a route where the maximum total CLTV expiry delta is below the final CLTV expiry.".to_owned(), action: ErrorAction::IgnoreError});
739 // The general routing idea is the following:
740 // 1. Fill first/last hops communicated by the caller.
741 // 2. Attempt to construct a path from payer to payee for transferring
742 // any ~sufficient (described later) value.
743 // If succeed, remember which channels were used and how much liquidity they have available,
744 // so that future paths don't rely on the same liquidity.
745 // 3. Proceed to the next step if:
746 // - we hit the recommended target value;
747 // - OR if we could not construct a new path. Any next attempt will fail too.
748 // Otherwise, repeat step 2.
749 // 4. See if we managed to collect paths which aggregately are able to transfer target value
750 // (not recommended value).
751 // 5. If yes, proceed. If not, fail routing.
752 // 6. Randomly combine paths into routes having enough to fulfill the payment. (TODO: knapsack)
753 // 7. Of all the found paths, select only those with the lowest total fee.
754 // 8. The last path in every selected route is likely to be more than we need.
755 // Reduce its value-to-transfer and recompute fees.
756 // 9. Choose the best route by the lowest total fee.
758 // As for the actual search algorithm,
759 // we do a payee-to-payer pseudo-Dijkstra's sorting by each node's distance from the payee
760 // plus the minimum per-HTLC fee to get from it to another node (aka "shitty pseudo-A*").
762 // We are not a faithful Dijkstra's implementation because we can change values which impact
763 // earlier nodes while processing later nodes. Specifically, if we reach a channel with a lower
764 // liquidity limit (via htlc_maximum_msat, on-chain capacity or assumed liquidity limits) than
765 // the value we are currently attempting to send over a path, we simply reduce the value being
766 // sent along the path for any hops after that channel. This may imply that later fees (which
767 // we've already tabulated) are lower because a smaller value is passing through the channels
768 // (and the proportional fee is thus lower). There isn't a trivial way to recalculate the
769 // channels which were selected earlier (and which may still be used for other paths without a
770 // lower liquidity limit), so we simply accept that some liquidity-limited paths may be
773 // One potentially problematic case for this algorithm would be if there are many
774 // liquidity-limited paths which are liquidity-limited near the destination (ie early in our
775 // graph walking), we may never find a path which is not liquidity-limited and has lower
776 // proportional fee (and only lower absolute fee when considering the ultimate value sent).
777 // Because we only consider paths with at least 5% of the total value being sent, the damage
778 // from such a case should be limited, however this could be further reduced in the future by
779 // calculating fees on the amount we wish to route over a path, ie ignoring the liquidity
780 // limits for the purposes of fee calculation.
782 // Alternatively, we could store more detailed path information in the heap (targets, below)
783 // and index the best-path map (dist, below) by node *and* HTLC limits, however that would blow
784 // up the runtime significantly both algorithmically (as we'd traverse nodes multiple times)
785 // and practically (as we would need to store dynamically-allocated path information in heap
786 // objects, increasing malloc traffic and indirect memory access significantly). Further, the
787 // results of such an algorithm would likely be biased towards lower-value paths.
789 // Further, we could return to a faithful Dijkstra's algorithm by rejecting paths with limits
790 // outside of our current search value, running a path search more times to gather candidate
791 // paths at different values. While this may be acceptable, further path searches may increase
792 // runtime for little gain. Specifically, the current algorithm rather efficiently explores the
793 // graph for candidate paths, calculating the maximum value which can realistically be sent at
794 // the same time, remaining generic across different payment values.
796 // TODO: There are a few tweaks we could do, including possibly pre-calculating more stuff
797 // to use as the A* heuristic beyond just the cost to get one node further than the current
800 let network_channels = network_graph.channels();
801 let network_nodes = network_graph.nodes();
803 if payment_params.max_path_count == 0 {
804 return Err(LightningError{err: "Can't find a route with no paths allowed.".to_owned(), action: ErrorAction::IgnoreError});
807 // Allow MPP only if we have a features set from somewhere that indicates the payee supports
808 // it. If the payee supports it they're supposed to include it in the invoice, so that should
810 let allow_mpp = if payment_params.max_path_count == 1 {
812 } else if let Some(features) = &payment_params.features {
813 features.supports_basic_mpp()
814 } else if let Some(node) = network_nodes.get(&payee_node_id) {
815 if let Some(node_info) = node.announcement_info.as_ref() {
816 node_info.features.supports_basic_mpp()
820 log_trace!(logger, "Searching for a route from payer {} to payee {} {} MPP and {} first hops {}overriding the network graph", our_node_pubkey,
821 payment_params.payee_pubkey, if allow_mpp { "with" } else { "without" },
822 first_hops.map(|hops| hops.len()).unwrap_or(0), if first_hops.is_some() { "" } else { "not " });
825 // Prepare the data we'll use for payee-to-payer search by
826 // inserting first hops suggested by the caller as targets.
827 // Our search will then attempt to reach them while traversing from the payee node.
828 let mut first_hop_targets: HashMap<_, Vec<&ChannelDetails>> =
829 HashMap::with_capacity(if first_hops.is_some() { first_hops.as_ref().unwrap().len() } else { 0 });
830 if let Some(hops) = first_hops {
832 if chan.get_outbound_payment_scid().is_none() {
833 panic!("first_hops should be filled in with usable channels, not pending ones");
835 if chan.counterparty.node_id == *our_node_pubkey {
836 return Err(LightningError{err: "First hop cannot have our_node_pubkey as a destination.".to_owned(), action: ErrorAction::IgnoreError});
839 .entry(NodeId::from_pubkey(&chan.counterparty.node_id))
840 .or_insert(Vec::new())
843 if first_hop_targets.is_empty() {
844 return Err(LightningError{err: "Cannot route when there are no outbound routes away from us".to_owned(), action: ErrorAction::IgnoreError});
848 // The main heap containing all candidate next-hops sorted by their score (max(A* fee,
849 // htlc_minimum)). Ideally this would be a heap which allowed cheap score reduction instead of
850 // adding duplicate entries when we find a better path to a given node.
851 let mut targets: BinaryHeap<RouteGraphNode> = BinaryHeap::new();
853 // Map from node_id to information about the best current path to that node, including feerate
855 let mut dist: HashMap<NodeId, PathBuildingHop> = HashMap::with_capacity(network_nodes.len());
857 // During routing, if we ignore a path due to an htlc_minimum_msat limit, we set this,
858 // indicating that we may wish to try again with a higher value, potentially paying to meet an
859 // htlc_minimum with extra fees while still finding a cheaper path.
860 let mut hit_minimum_limit;
862 // When arranging a route, we select multiple paths so that we can make a multi-path payment.
863 // We start with a path_value of the exact amount we want, and if that generates a route we may
864 // return it immediately. Otherwise, we don't stop searching for paths until we have 3x the
865 // amount we want in total across paths, selecting the best subset at the end.
866 const ROUTE_CAPACITY_PROVISION_FACTOR: u64 = 3;
867 let recommended_value_msat = final_value_msat * ROUTE_CAPACITY_PROVISION_FACTOR as u64;
868 let mut path_value_msat = final_value_msat;
870 // Routing Fragmentation Mitigation heuristic:
872 // Routing fragmentation across many payment paths increases the overall routing
873 // fees as you have irreducible routing fees per-link used (`fee_base_msat`).
874 // Taking too many smaller paths also increases the chance of payment failure.
875 // Thus to avoid this effect, we require from our collected links to provide
876 // at least a minimal contribution to the recommended value yet-to-be-fulfilled.
877 // This requirement is currently set to be 1/max_path_count of the payment
878 // value to ensure we only ever return routes that do not violate this limit.
879 let minimal_value_contribution_msat: u64 = if allow_mpp {
880 (final_value_msat + (payment_params.max_path_count as u64 - 1)) / payment_params.max_path_count as u64
885 // Keep track of how much liquidity has been used in selected channels. Used to determine
886 // if the channel can be used by additional MPP paths or to inform path finding decisions. It is
887 // aware of direction *only* to ensure that the correct htlc_maximum_msat value is used. Hence,
888 // liquidity used in one direction will not offset any used in the opposite direction.
889 let mut used_channel_liquidities: HashMap<(u64, bool), u64> =
890 HashMap::with_capacity(network_nodes.len());
892 // Keeping track of how much value we already collected across other paths. Helps to decide
893 // when we want to stop looking for new paths.
894 let mut already_collected_value_msat = 0;
896 for (_, channels) in first_hop_targets.iter_mut() {
897 // Sort the first_hops channels to the same node(s) in priority order of which channel we'd
900 // First, if channels are below `recommended_value_msat`, sort them in descending order,
901 // preferring larger channels to avoid splitting the payment into more MPP parts than is
904 // Second, because simply always sorting in descending order would always use our largest
905 // available outbound capacity, needlessly fragmenting our available channel capacities,
906 // sort channels above `recommended_value_msat` in ascending order, preferring channels
907 // which have enough, but not too much, capacity for the payment.
908 channels.sort_unstable_by(|chan_a, chan_b| {
909 if chan_b.next_outbound_htlc_limit_msat < recommended_value_msat || chan_a.next_outbound_htlc_limit_msat < recommended_value_msat {
910 // Sort in descending order
911 chan_b.next_outbound_htlc_limit_msat.cmp(&chan_a.next_outbound_htlc_limit_msat)
913 // Sort in ascending order
914 chan_a.next_outbound_htlc_limit_msat.cmp(&chan_b.next_outbound_htlc_limit_msat)
919 log_trace!(logger, "Building path from {} (payee) to {} (us/payer) for value {} msat.", payment_params.payee_pubkey, our_node_pubkey, final_value_msat);
921 macro_rules! add_entry {
922 // Adds entry which goes from $src_node_id to $dest_node_id over the $candidate hop.
923 // $next_hops_fee_msat represents the fees paid for using all the channels *after* this one,
924 // since that value has to be transferred over this channel.
925 // Returns whether this channel caused an update to `targets`.
926 ( $candidate: expr, $src_node_id: expr, $dest_node_id: expr, $next_hops_fee_msat: expr,
927 $next_hops_value_contribution: expr, $next_hops_path_htlc_minimum_msat: expr,
928 $next_hops_path_penalty_msat: expr, $next_hops_cltv_delta: expr, $next_hops_path_length: expr ) => { {
929 // We "return" whether we updated the path at the end, via this:
930 let mut did_add_update_path_to_src_node = false;
931 // Channels to self should not be used. This is more of belt-and-suspenders, because in
932 // practice these cases should be caught earlier:
933 // - for regular channels at channel announcement (TODO)
934 // - for first and last hops early in get_route
935 if $src_node_id != $dest_node_id {
936 let short_channel_id = $candidate.short_channel_id();
937 let htlc_maximum_msat = $candidate.htlc_maximum_msat();
939 // It is tricky to subtract $next_hops_fee_msat from available liquidity here.
940 // It may be misleading because we might later choose to reduce the value transferred
941 // over these channels, and the channel which was insufficient might become sufficient.
942 // Worst case: we drop a good channel here because it can't cover the high following
943 // fees caused by one expensive channel, but then this channel could have been used
944 // if the amount being transferred over this path is lower.
945 // We do this for now, but this is a subject for removal.
946 if let Some(mut available_value_contribution_msat) = htlc_maximum_msat.checked_sub($next_hops_fee_msat) {
947 let used_liquidity_msat = used_channel_liquidities
948 .get(&(short_channel_id, $src_node_id < $dest_node_id))
949 .map_or(0, |used_liquidity_msat| {
950 available_value_contribution_msat = available_value_contribution_msat
951 .saturating_sub(*used_liquidity_msat);
955 // Verify the liquidity offered by this channel complies to the minimal contribution.
956 let contributes_sufficient_value = available_value_contribution_msat >= minimal_value_contribution_msat;
957 // Do not consider candidate hops that would exceed the maximum path length.
958 let path_length_to_node = $next_hops_path_length + 1;
959 let doesnt_exceed_max_path_length = path_length_to_node <= MAX_PATH_LENGTH_ESTIMATE;
961 // Do not consider candidates that exceed the maximum total cltv expiry limit.
962 // In order to already account for some of the privacy enhancing random CLTV
963 // expiry delta offset we add on top later, we subtract a rough estimate
964 // (2*MEDIAN_HOP_CLTV_EXPIRY_DELTA) here.
965 let max_total_cltv_expiry_delta = (payment_params.max_total_cltv_expiry_delta - final_cltv_expiry_delta)
966 .checked_sub(2*MEDIAN_HOP_CLTV_EXPIRY_DELTA)
967 .unwrap_or(payment_params.max_total_cltv_expiry_delta - final_cltv_expiry_delta);
968 let hop_total_cltv_delta = ($next_hops_cltv_delta as u32)
969 .saturating_add($candidate.cltv_expiry_delta());
970 let doesnt_exceed_cltv_delta_limit = hop_total_cltv_delta <= max_total_cltv_expiry_delta;
972 let value_contribution_msat = cmp::min(available_value_contribution_msat, $next_hops_value_contribution);
973 // Includes paying fees for the use of the following channels.
974 let amount_to_transfer_over_msat: u64 = match value_contribution_msat.checked_add($next_hops_fee_msat) {
975 Some(result) => result,
976 // Can't overflow due to how the values were computed right above.
977 None => unreachable!(),
979 #[allow(unused_comparisons)] // $next_hops_path_htlc_minimum_msat is 0 in some calls so rustc complains
980 let over_path_minimum_msat = amount_to_transfer_over_msat >= $candidate.htlc_minimum_msat() &&
981 amount_to_transfer_over_msat >= $next_hops_path_htlc_minimum_msat;
983 #[allow(unused_comparisons)] // $next_hops_path_htlc_minimum_msat is 0 in some calls so rustc complains
984 let may_overpay_to_meet_path_minimum_msat =
985 ((amount_to_transfer_over_msat < $candidate.htlc_minimum_msat() &&
986 recommended_value_msat > $candidate.htlc_minimum_msat()) ||
987 (amount_to_transfer_over_msat < $next_hops_path_htlc_minimum_msat &&
988 recommended_value_msat > $next_hops_path_htlc_minimum_msat));
990 // If HTLC minimum is larger than the amount we're going to transfer, we shouldn't
991 // bother considering this channel. If retrying with recommended_value_msat may
992 // allow us to hit the HTLC minimum limit, set htlc_minimum_limit so that we go
993 // around again with a higher amount.
994 if contributes_sufficient_value && doesnt_exceed_max_path_length &&
995 doesnt_exceed_cltv_delta_limit && may_overpay_to_meet_path_minimum_msat {
996 hit_minimum_limit = true;
997 } else if contributes_sufficient_value && doesnt_exceed_max_path_length &&
998 doesnt_exceed_cltv_delta_limit && over_path_minimum_msat {
999 // Note that low contribution here (limited by available_liquidity_msat)
1000 // might violate htlc_minimum_msat on the hops which are next along the
1001 // payment path (upstream to the payee). To avoid that, we recompute
1002 // path fees knowing the final path contribution after constructing it.
1003 let path_htlc_minimum_msat = compute_fees($next_hops_path_htlc_minimum_msat, $candidate.fees())
1004 .and_then(|fee_msat| fee_msat.checked_add($next_hops_path_htlc_minimum_msat))
1005 .map(|fee_msat| cmp::max(fee_msat, $candidate.htlc_minimum_msat()))
1006 .unwrap_or_else(|| u64::max_value());
1007 let hm_entry = dist.entry($src_node_id);
1008 let old_entry = hm_entry.or_insert_with(|| {
1009 // If there was previously no known way to access the source node
1010 // (recall it goes payee-to-payer) of short_channel_id, first add a
1011 // semi-dummy record just to compute the fees to reach the source node.
1012 // This will affect our decision on selecting short_channel_id
1013 // as a way to reach the $dest_node_id.
1014 let mut fee_base_msat = 0;
1015 let mut fee_proportional_millionths = 0;
1016 if let Some(Some(fees)) = network_nodes.get(&$src_node_id).map(|node| node.lowest_inbound_channel_fees) {
1017 fee_base_msat = fees.base_msat;
1018 fee_proportional_millionths = fees.proportional_millionths;
1021 node_id: $dest_node_id.clone(),
1022 candidate: $candidate.clone(),
1024 src_lowest_inbound_fees: RoutingFees {
1025 base_msat: fee_base_msat,
1026 proportional_millionths: fee_proportional_millionths,
1028 next_hops_fee_msat: u64::max_value(),
1029 hop_use_fee_msat: u64::max_value(),
1030 total_fee_msat: u64::max_value(),
1031 path_htlc_minimum_msat,
1032 path_penalty_msat: u64::max_value(),
1033 was_processed: false,
1034 #[cfg(all(not(feature = "_bench_unstable"), any(test, fuzzing)))]
1035 value_contribution_msat,
1039 #[allow(unused_mut)] // We only use the mut in cfg(test)
1040 let mut should_process = !old_entry.was_processed;
1041 #[cfg(all(not(feature = "_bench_unstable"), any(test, fuzzing)))]
1043 // In test/fuzzing builds, we do extra checks to make sure the skipping
1044 // of already-seen nodes only happens in cases we expect (see below).
1045 if !should_process { should_process = true; }
1049 let mut hop_use_fee_msat = 0;
1050 let mut total_fee_msat = $next_hops_fee_msat;
1052 // Ignore hop_use_fee_msat for channel-from-us as we assume all channels-from-us
1053 // will have the same effective-fee
1054 if $src_node_id != our_node_id {
1055 match compute_fees(amount_to_transfer_over_msat, $candidate.fees()) {
1056 // max_value means we'll always fail
1057 // the old_entry.total_fee_msat > total_fee_msat check
1058 None => total_fee_msat = u64::max_value(),
1060 hop_use_fee_msat = fee_msat;
1061 total_fee_msat += hop_use_fee_msat;
1062 // When calculating the lowest inbound fees to a node, we
1063 // calculate fees here not based on the actual value we think
1064 // will flow over this channel, but on the minimum value that
1065 // we'll accept flowing over it. The minimum accepted value
1066 // is a constant through each path collection run, ensuring
1067 // consistent basis. Otherwise we may later find a
1068 // different path to the source node that is more expensive,
1069 // but which we consider to be cheaper because we are capacity
1070 // constrained and the relative fee becomes lower.
1071 match compute_fees(minimal_value_contribution_msat, old_entry.src_lowest_inbound_fees)
1072 .map(|a| a.checked_add(total_fee_msat)) {
1077 total_fee_msat = u64::max_value();
1084 let channel_usage = ChannelUsage {
1085 amount_msat: amount_to_transfer_over_msat,
1086 inflight_htlc_msat: used_liquidity_msat,
1087 effective_capacity: $candidate.effective_capacity(),
1089 let channel_penalty_msat = scorer.channel_penalty_msat(
1090 short_channel_id, &$src_node_id, &$dest_node_id, channel_usage
1092 let path_penalty_msat = $next_hops_path_penalty_msat
1093 .saturating_add(channel_penalty_msat);
1094 let new_graph_node = RouteGraphNode {
1095 node_id: $src_node_id,
1096 lowest_fee_to_peer_through_node: total_fee_msat,
1097 lowest_fee_to_node: $next_hops_fee_msat as u64 + hop_use_fee_msat,
1098 total_cltv_delta: hop_total_cltv_delta,
1099 value_contribution_msat: value_contribution_msat,
1100 path_htlc_minimum_msat,
1102 path_length_to_node,
1105 // Update the way of reaching $src_node_id with the given short_channel_id (from $dest_node_id),
1106 // if this way is cheaper than the already known
1107 // (considering the cost to "reach" this channel from the route destination,
1108 // the cost of using this channel,
1109 // and the cost of routing to the source node of this channel).
1110 // Also, consider that htlc_minimum_msat_difference, because we might end up
1111 // paying it. Consider the following exploit:
1112 // we use 2 paths to transfer 1.5 BTC. One of them is 0-fee normal 1 BTC path,
1113 // and for the other one we picked a 1sat-fee path with htlc_minimum_msat of
1114 // 1 BTC. Now, since the latter is more expensive, we gonna try to cut it
1115 // by 0.5 BTC, but then match htlc_minimum_msat by paying a fee of 0.5 BTC
1117 // Ideally the scoring could be smarter (e.g. 0.5*htlc_minimum_msat here),
1118 // but it may require additional tracking - we don't want to double-count
1119 // the fees included in $next_hops_path_htlc_minimum_msat, but also
1120 // can't use something that may decrease on future hops.
1121 let old_cost = cmp::max(old_entry.total_fee_msat, old_entry.path_htlc_minimum_msat)
1122 .saturating_add(old_entry.path_penalty_msat);
1123 let new_cost = cmp::max(total_fee_msat, path_htlc_minimum_msat)
1124 .saturating_add(path_penalty_msat);
1126 if !old_entry.was_processed && new_cost < old_cost {
1127 targets.push(new_graph_node);
1128 old_entry.next_hops_fee_msat = $next_hops_fee_msat;
1129 old_entry.hop_use_fee_msat = hop_use_fee_msat;
1130 old_entry.total_fee_msat = total_fee_msat;
1131 old_entry.node_id = $dest_node_id.clone();
1132 old_entry.candidate = $candidate.clone();
1133 old_entry.fee_msat = 0; // This value will be later filled with hop_use_fee_msat of the following channel
1134 old_entry.path_htlc_minimum_msat = path_htlc_minimum_msat;
1135 old_entry.path_penalty_msat = path_penalty_msat;
1136 #[cfg(all(not(feature = "_bench_unstable"), any(test, fuzzing)))]
1138 old_entry.value_contribution_msat = value_contribution_msat;
1140 did_add_update_path_to_src_node = true;
1141 } else if old_entry.was_processed && new_cost < old_cost {
1142 #[cfg(all(not(feature = "_bench_unstable"), any(test, fuzzing)))]
1144 // If we're skipping processing a node which was previously
1145 // processed even though we found another path to it with a
1146 // cheaper fee, check that it was because the second path we
1147 // found (which we are processing now) has a lower value
1148 // contribution due to an HTLC minimum limit.
1150 // e.g. take a graph with two paths from node 1 to node 2, one
1151 // through channel A, and one through channel B. Channel A and
1152 // B are both in the to-process heap, with their scores set by
1153 // a higher htlc_minimum than fee.
1154 // Channel A is processed first, and the channels onwards from
1155 // node 1 are added to the to-process heap. Thereafter, we pop
1156 // Channel B off of the heap, note that it has a much more
1157 // restrictive htlc_maximum_msat, and recalculate the fees for
1158 // all of node 1's channels using the new, reduced, amount.
1160 // This would be bogus - we'd be selecting a higher-fee path
1161 // with a lower htlc_maximum_msat instead of the one we'd
1162 // already decided to use.
1163 debug_assert!(path_htlc_minimum_msat < old_entry.path_htlc_minimum_msat);
1165 value_contribution_msat + path_penalty_msat <
1166 old_entry.value_contribution_msat + old_entry.path_penalty_msat
1174 did_add_update_path_to_src_node
1178 let default_node_features = default_node_features();
1180 // Find ways (channels with destination) to reach a given node and store them
1181 // in the corresponding data structures (routing graph etc).
1182 // $fee_to_target_msat represents how much it costs to reach to this node from the payee,
1183 // meaning how much will be paid in fees after this node (to the best of our knowledge).
1184 // This data can later be helpful to optimize routing (pay lower fees).
1185 macro_rules! add_entries_to_cheapest_to_target_node {
1186 ( $node: expr, $node_id: expr, $fee_to_target_msat: expr, $next_hops_value_contribution: expr,
1187 $next_hops_path_htlc_minimum_msat: expr, $next_hops_path_penalty_msat: expr,
1188 $next_hops_cltv_delta: expr, $next_hops_path_length: expr ) => {
1189 let skip_node = if let Some(elem) = dist.get_mut(&$node_id) {
1190 let was_processed = elem.was_processed;
1191 elem.was_processed = true;
1194 // Entries are added to dist in add_entry!() when there is a channel from a node.
1195 // Because there are no channels from payee, it will not have a dist entry at this point.
1196 // If we're processing any other node, it is always be the result of a channel from it.
1197 assert_eq!($node_id, payee_node_id);
1202 if let Some(first_channels) = first_hop_targets.get(&$node_id) {
1203 for details in first_channels {
1204 let candidate = CandidateRouteHop::FirstHop { details };
1205 add_entry!(candidate, our_node_id, $node_id, $fee_to_target_msat,
1206 $next_hops_value_contribution,
1207 $next_hops_path_htlc_minimum_msat, $next_hops_path_penalty_msat,
1208 $next_hops_cltv_delta, $next_hops_path_length);
1212 let features = if let Some(node_info) = $node.announcement_info.as_ref() {
1215 &default_node_features
1218 if !features.requires_unknown_bits() {
1219 for chan_id in $node.channels.iter() {
1220 let chan = network_channels.get(chan_id).unwrap();
1221 if !chan.features.requires_unknown_bits() {
1222 let (directed_channel, source) =
1223 chan.as_directed_to(&$node_id).expect("inconsistent NetworkGraph");
1224 if first_hops.is_none() || *source != our_node_id {
1225 if let Some(direction) = directed_channel.direction() {
1226 if direction.enabled {
1227 let candidate = CandidateRouteHop::PublicHop {
1228 info: directed_channel.with_update().unwrap(),
1229 short_channel_id: *chan_id,
1231 add_entry!(candidate, *source, $node_id,
1232 $fee_to_target_msat,
1233 $next_hops_value_contribution,
1234 $next_hops_path_htlc_minimum_msat,
1235 $next_hops_path_penalty_msat,
1236 $next_hops_cltv_delta, $next_hops_path_length);
1247 let mut payment_paths = Vec::<PaymentPath>::new();
1249 // TODO: diversify by nodes (so that all paths aren't doomed if one node is offline).
1250 'paths_collection: loop {
1251 // For every new path, start from scratch, except for used_channel_liquidities, which
1252 // helps to avoid reusing previously selected paths in future iterations.
1255 hit_minimum_limit = false;
1257 // If first hop is a private channel and the only way to reach the payee, this is the only
1258 // place where it could be added.
1259 if let Some(first_channels) = first_hop_targets.get(&payee_node_id) {
1260 for details in first_channels {
1261 let candidate = CandidateRouteHop::FirstHop { details };
1262 let added = add_entry!(candidate, our_node_id, payee_node_id, 0, path_value_msat,
1264 log_trace!(logger, "{} direct route to payee via SCID {}",
1265 if added { "Added" } else { "Skipped" }, candidate.short_channel_id());
1269 // Add the payee as a target, so that the payee-to-payer
1270 // search algorithm knows what to start with.
1271 match network_nodes.get(&payee_node_id) {
1272 // The payee is not in our network graph, so nothing to add here.
1273 // There is still a chance of reaching them via last_hops though,
1274 // so don't yet fail the payment here.
1275 // If not, targets.pop() will not even let us enter the loop in step 2.
1278 add_entries_to_cheapest_to_target_node!(node, payee_node_id, 0, path_value_msat, 0, 0u64, 0, 0);
1283 // If a caller provided us with last hops, add them to routing targets. Since this happens
1284 // earlier than general path finding, they will be somewhat prioritized, although currently
1285 // it matters only if the fees are exactly the same.
1286 for route in payment_params.route_hints.iter().filter(|route| !route.0.is_empty()) {
1287 let first_hop_in_route = &(route.0)[0];
1288 let have_hop_src_in_graph =
1289 // Only add the hops in this route to our candidate set if either
1290 // we have a direct channel to the first hop or the first hop is
1291 // in the regular network graph.
1292 first_hop_targets.get(&NodeId::from_pubkey(&first_hop_in_route.src_node_id)).is_some() ||
1293 network_nodes.get(&NodeId::from_pubkey(&first_hop_in_route.src_node_id)).is_some();
1294 if have_hop_src_in_graph {
1295 // We start building the path from reverse, i.e., from payee
1296 // to the first RouteHintHop in the path.
1297 let hop_iter = route.0.iter().rev();
1298 let prev_hop_iter = core::iter::once(&payment_params.payee_pubkey).chain(
1299 route.0.iter().skip(1).rev().map(|hop| &hop.src_node_id));
1300 let mut hop_used = true;
1301 let mut aggregate_next_hops_fee_msat: u64 = 0;
1302 let mut aggregate_next_hops_path_htlc_minimum_msat: u64 = 0;
1303 let mut aggregate_next_hops_path_penalty_msat: u64 = 0;
1304 let mut aggregate_next_hops_cltv_delta: u32 = 0;
1305 let mut aggregate_next_hops_path_length: u8 = 0;
1307 for (idx, (hop, prev_hop_id)) in hop_iter.zip(prev_hop_iter).enumerate() {
1308 let source = NodeId::from_pubkey(&hop.src_node_id);
1309 let target = NodeId::from_pubkey(&prev_hop_id);
1310 let candidate = network_channels
1311 .get(&hop.short_channel_id)
1312 .and_then(|channel| channel.as_directed_to(&target))
1313 .and_then(|(channel, _)| channel.with_update())
1314 .map(|info| CandidateRouteHop::PublicHop {
1316 short_channel_id: hop.short_channel_id,
1318 .unwrap_or_else(|| CandidateRouteHop::PrivateHop { hint: hop });
1320 if !add_entry!(candidate, source, target, aggregate_next_hops_fee_msat,
1321 path_value_msat, aggregate_next_hops_path_htlc_minimum_msat,
1322 aggregate_next_hops_path_penalty_msat,
1323 aggregate_next_hops_cltv_delta, aggregate_next_hops_path_length) {
1324 // If this hop was not used then there is no use checking the preceding
1325 // hops in the RouteHint. We can break by just searching for a direct
1326 // channel between last checked hop and first_hop_targets.
1330 let used_liquidity_msat = used_channel_liquidities
1331 .get(&(hop.short_channel_id, source < target)).copied().unwrap_or(0);
1332 let channel_usage = ChannelUsage {
1333 amount_msat: final_value_msat + aggregate_next_hops_fee_msat,
1334 inflight_htlc_msat: used_liquidity_msat,
1335 effective_capacity: candidate.effective_capacity(),
1337 let channel_penalty_msat = scorer.channel_penalty_msat(
1338 hop.short_channel_id, &source, &target, channel_usage
1340 aggregate_next_hops_path_penalty_msat = aggregate_next_hops_path_penalty_msat
1341 .saturating_add(channel_penalty_msat);
1343 aggregate_next_hops_cltv_delta = aggregate_next_hops_cltv_delta
1344 .saturating_add(hop.cltv_expiry_delta as u32);
1346 aggregate_next_hops_path_length = aggregate_next_hops_path_length
1349 // Searching for a direct channel between last checked hop and first_hop_targets
1350 if let Some(first_channels) = first_hop_targets.get(&NodeId::from_pubkey(&prev_hop_id)) {
1351 for details in first_channels {
1352 let candidate = CandidateRouteHop::FirstHop { details };
1353 add_entry!(candidate, our_node_id, NodeId::from_pubkey(&prev_hop_id),
1354 aggregate_next_hops_fee_msat, path_value_msat,
1355 aggregate_next_hops_path_htlc_minimum_msat,
1356 aggregate_next_hops_path_penalty_msat, aggregate_next_hops_cltv_delta,
1357 aggregate_next_hops_path_length);
1365 // In the next values of the iterator, the aggregate fees already reflects
1366 // the sum of value sent from payer (final_value_msat) and routing fees
1367 // for the last node in the RouteHint. We need to just add the fees to
1368 // route through the current node so that the preceding node (next iteration)
1370 let hops_fee = compute_fees(aggregate_next_hops_fee_msat + final_value_msat, hop.fees)
1371 .map_or(None, |inc| inc.checked_add(aggregate_next_hops_fee_msat));
1372 aggregate_next_hops_fee_msat = if let Some(val) = hops_fee { val } else { break; };
1374 let hop_htlc_minimum_msat = candidate.htlc_minimum_msat();
1375 let hop_htlc_minimum_msat_inc = if let Some(val) = compute_fees(aggregate_next_hops_path_htlc_minimum_msat, hop.fees) { val } else { break; };
1376 let hops_path_htlc_minimum = aggregate_next_hops_path_htlc_minimum_msat
1377 .checked_add(hop_htlc_minimum_msat_inc);
1378 aggregate_next_hops_path_htlc_minimum_msat = if let Some(val) = hops_path_htlc_minimum { cmp::max(hop_htlc_minimum_msat, val) } else { break; };
1380 if idx == route.0.len() - 1 {
1381 // The last hop in this iterator is the first hop in
1382 // overall RouteHint.
1383 // If this hop connects to a node with which we have a direct channel,
1384 // ignore the network graph and, if the last hop was added, add our
1385 // direct channel to the candidate set.
1387 // Note that we *must* check if the last hop was added as `add_entry`
1388 // always assumes that the third argument is a node to which we have a
1390 if let Some(first_channels) = first_hop_targets.get(&NodeId::from_pubkey(&hop.src_node_id)) {
1391 for details in first_channels {
1392 let candidate = CandidateRouteHop::FirstHop { details };
1393 add_entry!(candidate, our_node_id,
1394 NodeId::from_pubkey(&hop.src_node_id),
1395 aggregate_next_hops_fee_msat, path_value_msat,
1396 aggregate_next_hops_path_htlc_minimum_msat,
1397 aggregate_next_hops_path_penalty_msat,
1398 aggregate_next_hops_cltv_delta,
1399 aggregate_next_hops_path_length);
1407 log_trace!(logger, "Starting main path collection loop with {} nodes pre-filled from first/last hops.", targets.len());
1409 // At this point, targets are filled with the data from first and
1410 // last hops communicated by the caller, and the payment receiver.
1411 let mut found_new_path = false;
1414 // If this loop terminates due the exhaustion of targets, two situations are possible:
1415 // - not enough outgoing liquidity:
1416 // 0 < already_collected_value_msat < final_value_msat
1417 // - enough outgoing liquidity:
1418 // final_value_msat <= already_collected_value_msat < recommended_value_msat
1419 // Both these cases (and other cases except reaching recommended_value_msat) mean that
1420 // paths_collection will be stopped because found_new_path==false.
1421 // This is not necessarily a routing failure.
1422 'path_construction: while let Some(RouteGraphNode { node_id, lowest_fee_to_node, total_cltv_delta, value_contribution_msat, path_htlc_minimum_msat, path_penalty_msat, path_length_to_node, .. }) = targets.pop() {
1424 // Since we're going payee-to-payer, hitting our node as a target means we should stop
1425 // traversing the graph and arrange the path out of what we found.
1426 if node_id == our_node_id {
1427 let mut new_entry = dist.remove(&our_node_id).unwrap();
1428 let mut ordered_hops: Vec<(PathBuildingHop, NodeFeatures)> = vec!((new_entry.clone(), default_node_features.clone()));
1431 let mut features_set = false;
1432 if let Some(first_channels) = first_hop_targets.get(&ordered_hops.last().unwrap().0.node_id) {
1433 for details in first_channels {
1434 if details.get_outbound_payment_scid().unwrap() == ordered_hops.last().unwrap().0.candidate.short_channel_id() {
1435 ordered_hops.last_mut().unwrap().1 = details.counterparty.features.to_context();
1436 features_set = true;
1442 if let Some(node) = network_nodes.get(&ordered_hops.last().unwrap().0.node_id) {
1443 if let Some(node_info) = node.announcement_info.as_ref() {
1444 ordered_hops.last_mut().unwrap().1 = node_info.features.clone();
1446 ordered_hops.last_mut().unwrap().1 = default_node_features.clone();
1449 // We can fill in features for everything except hops which were
1450 // provided via the invoice we're paying. We could guess based on the
1451 // recipient's features but for now we simply avoid guessing at all.
1455 // Means we succesfully traversed from the payer to the payee, now
1456 // save this path for the payment route. Also, update the liquidity
1457 // remaining on the used hops, so that we take them into account
1458 // while looking for more paths.
1459 if ordered_hops.last().unwrap().0.node_id == payee_node_id {
1463 new_entry = match dist.remove(&ordered_hops.last().unwrap().0.node_id) {
1464 Some(payment_hop) => payment_hop,
1465 // We can't arrive at None because, if we ever add an entry to targets,
1466 // we also fill in the entry in dist (see add_entry!).
1467 None => unreachable!(),
1469 // We "propagate" the fees one hop backward (topologically) here,
1470 // so that fees paid for a HTLC forwarding on the current channel are
1471 // associated with the previous channel (where they will be subtracted).
1472 ordered_hops.last_mut().unwrap().0.fee_msat = new_entry.hop_use_fee_msat;
1473 ordered_hops.push((new_entry.clone(), default_node_features.clone()));
1475 ordered_hops.last_mut().unwrap().0.fee_msat = value_contribution_msat;
1476 ordered_hops.last_mut().unwrap().0.hop_use_fee_msat = 0;
1478 log_trace!(logger, "Found a path back to us from the target with {} hops contributing up to {} msat: \n {:#?}",
1479 ordered_hops.len(), value_contribution_msat, ordered_hops.iter().map(|h| &(h.0)).collect::<Vec<&PathBuildingHop>>());
1481 let mut payment_path = PaymentPath {hops: ordered_hops};
1483 // We could have possibly constructed a slightly inconsistent path: since we reduce
1484 // value being transferred along the way, we could have violated htlc_minimum_msat
1485 // on some channels we already passed (assuming dest->source direction). Here, we
1486 // recompute the fees again, so that if that's the case, we match the currently
1487 // underpaid htlc_minimum_msat with fees.
1488 payment_path.update_value_and_recompute_fees(cmp::min(value_contribution_msat, final_value_msat));
1490 // Since a path allows to transfer as much value as
1491 // the smallest channel it has ("bottleneck"), we should recompute
1492 // the fees so sender HTLC don't overpay fees when traversing
1493 // larger channels than the bottleneck. This may happen because
1494 // when we were selecting those channels we were not aware how much value
1495 // this path will transfer, and the relative fee for them
1496 // might have been computed considering a larger value.
1497 // Remember that we used these channels so that we don't rely
1498 // on the same liquidity in future paths.
1499 let mut prevented_redundant_path_selection = false;
1500 let prev_hop_iter = core::iter::once(&our_node_id)
1501 .chain(payment_path.hops.iter().map(|(hop, _)| &hop.node_id));
1502 for (prev_hop, (hop, _)) in prev_hop_iter.zip(payment_path.hops.iter()) {
1503 let spent_on_hop_msat = value_contribution_msat + hop.next_hops_fee_msat;
1504 let used_liquidity_msat = used_channel_liquidities
1505 .entry((hop.candidate.short_channel_id(), *prev_hop < hop.node_id))
1506 .and_modify(|used_liquidity_msat| *used_liquidity_msat += spent_on_hop_msat)
1507 .or_insert(spent_on_hop_msat);
1508 if *used_liquidity_msat == hop.candidate.htlc_maximum_msat() {
1509 // If this path used all of this channel's available liquidity, we know
1510 // this path will not be selected again in the next loop iteration.
1511 prevented_redundant_path_selection = true;
1513 debug_assert!(*used_liquidity_msat <= hop.candidate.htlc_maximum_msat());
1515 if !prevented_redundant_path_selection {
1516 // If we weren't capped by hitting a liquidity limit on a channel in the path,
1517 // we'll probably end up picking the same path again on the next iteration.
1518 // Decrease the available liquidity of a hop in the middle of the path.
1519 let victim_scid = payment_path.hops[(payment_path.hops.len()) / 2].0.candidate.short_channel_id();
1520 let exhausted = u64::max_value();
1521 log_trace!(logger, "Disabling channel {} for future path building iterations to avoid duplicates.", victim_scid);
1522 *used_channel_liquidities.entry((victim_scid, false)).or_default() = exhausted;
1523 *used_channel_liquidities.entry((victim_scid, true)).or_default() = exhausted;
1526 // Track the total amount all our collected paths allow to send so that we know
1527 // when to stop looking for more paths
1528 already_collected_value_msat += value_contribution_msat;
1530 payment_paths.push(payment_path);
1531 found_new_path = true;
1532 break 'path_construction;
1535 // If we found a path back to the payee, we shouldn't try to process it again. This is
1536 // the equivalent of the `elem.was_processed` check in
1537 // add_entries_to_cheapest_to_target_node!() (see comment there for more info).
1538 if node_id == payee_node_id { continue 'path_construction; }
1540 // Otherwise, since the current target node is not us,
1541 // keep "unrolling" the payment graph from payee to payer by
1542 // finding a way to reach the current target from the payer side.
1543 match network_nodes.get(&node_id) {
1546 add_entries_to_cheapest_to_target_node!(node, node_id, lowest_fee_to_node,
1547 value_contribution_msat, path_htlc_minimum_msat, path_penalty_msat,
1548 total_cltv_delta, path_length_to_node);
1554 // If we don't support MPP, no use trying to gather more value ever.
1555 break 'paths_collection;
1559 // Stop either when the recommended value is reached or if no new path was found in this
1561 // In the latter case, making another path finding attempt won't help,
1562 // because we deterministically terminated the search due to low liquidity.
1563 if already_collected_value_msat >= recommended_value_msat || !found_new_path {
1564 log_trace!(logger, "Have now collected {} msat (seeking {} msat) in paths. Last path loop {} a new path.",
1565 already_collected_value_msat, recommended_value_msat, if found_new_path { "found" } else { "did not find" });
1566 break 'paths_collection;
1567 } else if found_new_path && already_collected_value_msat == final_value_msat && payment_paths.len() == 1 {
1568 // Further, if this was our first walk of the graph, and we weren't limited by an
1569 // htlc_minimum_msat, return immediately because this path should suffice. If we were
1570 // limited by an htlc_minimum_msat value, find another path with a higher value,
1571 // potentially allowing us to pay fees to meet the htlc_minimum on the new path while
1572 // still keeping a lower total fee than this path.
1573 if !hit_minimum_limit {
1574 log_trace!(logger, "Collected exactly our payment amount on the first pass, without hitting an htlc_minimum_msat limit, exiting.");
1575 break 'paths_collection;
1577 log_trace!(logger, "Collected our payment amount on the first pass, but running again to collect extra paths with a potentially higher limit.");
1578 path_value_msat = recommended_value_msat;
1583 if payment_paths.len() == 0 {
1584 return Err(LightningError{err: "Failed to find a path to the given destination".to_owned(), action: ErrorAction::IgnoreError});
1587 if already_collected_value_msat < final_value_msat {
1588 return Err(LightningError{err: "Failed to find a sufficient route to the given destination".to_owned(), action: ErrorAction::IgnoreError});
1591 // Sort by total fees and take the best paths.
1592 payment_paths.sort_unstable_by_key(|path| path.get_total_fee_paid_msat());
1593 if payment_paths.len() > 50 {
1594 payment_paths.truncate(50);
1597 // Draw multiple sufficient routes by randomly combining the selected paths.
1598 let mut drawn_routes = Vec::new();
1599 let mut prng = ChaCha20::new(random_seed_bytes, &[0u8; 12]);
1600 let mut random_index_bytes = [0u8; ::core::mem::size_of::<usize>()];
1602 let num_permutations = payment_paths.len();
1603 for _ in 0..num_permutations {
1604 let mut cur_route = Vec::<PaymentPath>::new();
1605 let mut aggregate_route_value_msat = 0;
1608 // Do a Fisher-Yates shuffle to create a random permutation of the payment paths
1609 for cur_index in (1..payment_paths.len()).rev() {
1610 prng.process_in_place(&mut random_index_bytes);
1611 let random_index = usize::from_be_bytes(random_index_bytes).wrapping_rem(cur_index+1);
1612 payment_paths.swap(cur_index, random_index);
1616 for payment_path in &payment_paths {
1617 cur_route.push(payment_path.clone());
1618 aggregate_route_value_msat += payment_path.get_value_msat();
1619 if aggregate_route_value_msat > final_value_msat {
1620 // Last path likely overpaid. Substract it from the most expensive
1621 // (in terms of proportional fee) path in this route and recompute fees.
1622 // This might be not the most economically efficient way, but fewer paths
1623 // also makes routing more reliable.
1624 let mut overpaid_value_msat = aggregate_route_value_msat - final_value_msat;
1626 // First, we drop some expensive low-value paths entirely if possible, since fewer
1627 // paths is better: the payment is less likely to fail. In order to do so, we sort
1628 // by value and fall back to total fees paid, i.e., in case of equal values we
1629 // prefer lower cost paths.
1630 cur_route.sort_unstable_by(|a, b| {
1631 a.get_value_msat().cmp(&b.get_value_msat())
1632 // Reverse ordering for cost, so we drop higher-cost paths first
1633 .then_with(|| b.get_cost_msat().cmp(&a.get_cost_msat()))
1636 // We should make sure that at least 1 path left.
1637 let mut paths_left = cur_route.len();
1638 cur_route.retain(|path| {
1639 if paths_left == 1 {
1642 let mut keep = true;
1643 let path_value_msat = path.get_value_msat();
1644 if path_value_msat <= overpaid_value_msat {
1646 overpaid_value_msat -= path_value_msat;
1652 if overpaid_value_msat == 0 {
1656 assert!(cur_route.len() > 0);
1659 // Now, subtract the overpaid value from the most-expensive path.
1660 // TODO: this could also be optimized by also sorting by feerate_per_sat_routed,
1661 // so that the sender pays less fees overall. And also htlc_minimum_msat.
1662 cur_route.sort_unstable_by_key(|path| { path.hops.iter().map(|hop| hop.0.candidate.fees().proportional_millionths as u64).sum::<u64>() });
1663 let expensive_payment_path = cur_route.first_mut().unwrap();
1665 // We already dropped all the small value paths above, meaning all the
1666 // remaining paths are larger than remaining overpaid_value_msat.
1667 // Thus, this can't be negative.
1668 let expensive_path_new_value_msat = expensive_payment_path.get_value_msat() - overpaid_value_msat;
1669 expensive_payment_path.update_value_and_recompute_fees(expensive_path_new_value_msat);
1673 drawn_routes.push(cur_route);
1677 // Select the best route by lowest total cost.
1678 drawn_routes.sort_unstable_by_key(|paths| paths.iter().map(|path| path.get_cost_msat()).sum::<u64>());
1679 let mut selected_paths = Vec::<Vec<Result<RouteHop, LightningError>>>::new();
1680 for payment_path in drawn_routes.first().unwrap() {
1681 let mut path = payment_path.hops.iter().map(|(payment_hop, node_features)| {
1683 pubkey: PublicKey::from_slice(payment_hop.node_id.as_slice()).map_err(|_| LightningError{err: format!("Public key {:?} is invalid", &payment_hop.node_id), action: ErrorAction::IgnoreAndLog(Level::Trace)})?,
1684 node_features: node_features.clone(),
1685 short_channel_id: payment_hop.candidate.short_channel_id(),
1686 channel_features: payment_hop.candidate.features(),
1687 fee_msat: payment_hop.fee_msat,
1688 cltv_expiry_delta: payment_hop.candidate.cltv_expiry_delta(),
1690 }).collect::<Vec<_>>();
1691 // Propagate the cltv_expiry_delta one hop backwards since the delta from the current hop is
1692 // applicable for the previous hop.
1693 path.iter_mut().rev().fold(final_cltv_expiry_delta, |prev_cltv_expiry_delta, hop| {
1694 core::mem::replace(&mut hop.as_mut().unwrap().cltv_expiry_delta, prev_cltv_expiry_delta)
1696 selected_paths.push(path);
1698 // Make sure we would never create a route with more paths than we allow.
1699 debug_assert!(selected_paths.len() <= payment_params.max_path_count.into());
1701 if let Some(features) = &payment_params.features {
1702 for path in selected_paths.iter_mut() {
1703 if let Ok(route_hop) = path.last_mut().unwrap() {
1704 route_hop.node_features = features.to_context();
1710 paths: selected_paths.into_iter().map(|path| path.into_iter().collect()).collect::<Result<Vec<_>, _>>()?,
1711 payment_params: Some(payment_params.clone()),
1713 log_info!(logger, "Got route to {}: {}", payment_params.payee_pubkey, log_route!(route));
1717 // When an adversarial intermediary node observes a payment, it may be able to infer its
1718 // destination, if the remaining CLTV expiry delta exactly matches a feasible path in the network
1719 // graph. In order to improve privacy, this method obfuscates the CLTV expiry deltas along the
1720 // payment path by adding a randomized 'shadow route' offset to the final hop.
1721 fn add_random_cltv_offset(route: &mut Route, payment_params: &PaymentParameters,
1722 network_graph: &ReadOnlyNetworkGraph, random_seed_bytes: &[u8; 32]
1724 let network_channels = network_graph.channels();
1725 let network_nodes = network_graph.nodes();
1727 for path in route.paths.iter_mut() {
1728 let mut shadow_ctlv_expiry_delta_offset: u32 = 0;
1730 // Remember the last three nodes of the random walk and avoid looping back on them.
1731 // Init with the last three nodes from the actual path, if possible.
1732 let mut nodes_to_avoid: [NodeId; 3] = [NodeId::from_pubkey(&path.last().unwrap().pubkey),
1733 NodeId::from_pubkey(&path.get(path.len().saturating_sub(2)).unwrap().pubkey),
1734 NodeId::from_pubkey(&path.get(path.len().saturating_sub(3)).unwrap().pubkey)];
1736 // Choose the last publicly known node as the starting point for the random walk.
1737 let mut cur_hop: Option<NodeId> = None;
1738 let mut path_nonce = [0u8; 12];
1739 if let Some(starting_hop) = path.iter().rev()
1740 .find(|h| network_nodes.contains_key(&NodeId::from_pubkey(&h.pubkey))) {
1741 cur_hop = Some(NodeId::from_pubkey(&starting_hop.pubkey));
1742 path_nonce.copy_from_slice(&cur_hop.unwrap().as_slice()[..12]);
1745 // Init PRNG with the path-dependant nonce, which is static for private paths.
1746 let mut prng = ChaCha20::new(random_seed_bytes, &path_nonce);
1747 let mut random_path_bytes = [0u8; ::core::mem::size_of::<usize>()];
1749 // Pick a random path length in [1 .. 3]
1750 prng.process_in_place(&mut random_path_bytes);
1751 let random_walk_length = usize::from_be_bytes(random_path_bytes).wrapping_rem(3).wrapping_add(1);
1753 for random_hop in 0..random_walk_length {
1754 // If we don't find a suitable offset in the public network graph, we default to
1755 // MEDIAN_HOP_CLTV_EXPIRY_DELTA.
1756 let mut random_hop_offset = MEDIAN_HOP_CLTV_EXPIRY_DELTA;
1758 if let Some(cur_node_id) = cur_hop {
1759 if let Some(cur_node) = network_nodes.get(&cur_node_id) {
1760 // Randomly choose the next unvisited hop.
1761 prng.process_in_place(&mut random_path_bytes);
1762 if let Some(random_channel) = usize::from_be_bytes(random_path_bytes)
1763 .checked_rem(cur_node.channels.len())
1764 .and_then(|index| cur_node.channels.get(index))
1765 .and_then(|id| network_channels.get(id)) {
1766 random_channel.as_directed_from(&cur_node_id).map(|(dir_info, next_id)| {
1767 if !nodes_to_avoid.iter().any(|x| x == next_id) {
1768 nodes_to_avoid[random_hop] = *next_id;
1769 dir_info.direction().map(|channel_update_info| {
1770 random_hop_offset = channel_update_info.cltv_expiry_delta.into();
1771 cur_hop = Some(*next_id);
1779 shadow_ctlv_expiry_delta_offset = shadow_ctlv_expiry_delta_offset
1780 .checked_add(random_hop_offset)
1781 .unwrap_or(shadow_ctlv_expiry_delta_offset);
1784 // Limit the total offset to reduce the worst-case locked liquidity timevalue
1785 const MAX_SHADOW_CLTV_EXPIRY_DELTA_OFFSET: u32 = 3*144;
1786 shadow_ctlv_expiry_delta_offset = cmp::min(shadow_ctlv_expiry_delta_offset, MAX_SHADOW_CLTV_EXPIRY_DELTA_OFFSET);
1788 // Limit the offset so we never exceed the max_total_cltv_expiry_delta. To improve plausibility,
1789 // we choose the limit to be the largest possible multiple of MEDIAN_HOP_CLTV_EXPIRY_DELTA.
1790 let path_total_cltv_expiry_delta: u32 = path.iter().map(|h| h.cltv_expiry_delta).sum();
1791 let mut max_path_offset = payment_params.max_total_cltv_expiry_delta - path_total_cltv_expiry_delta;
1792 max_path_offset = cmp::max(
1793 max_path_offset - (max_path_offset % MEDIAN_HOP_CLTV_EXPIRY_DELTA),
1794 max_path_offset % MEDIAN_HOP_CLTV_EXPIRY_DELTA);
1795 shadow_ctlv_expiry_delta_offset = cmp::min(shadow_ctlv_expiry_delta_offset, max_path_offset);
1797 // Add 'shadow' CLTV offset to the final hop
1798 if let Some(last_hop) = path.last_mut() {
1799 last_hop.cltv_expiry_delta = last_hop.cltv_expiry_delta
1800 .checked_add(shadow_ctlv_expiry_delta_offset).unwrap_or(last_hop.cltv_expiry_delta);
1805 /// Construct a route from us (payer) to the target node (payee) via the given hops (which should
1806 /// exclude the payer, but include the payee). This may be useful, e.g., for probing the chosen path.
1808 /// Re-uses logic from `find_route`, so the restrictions described there also apply here.
1809 pub fn build_route_from_hops<L: Deref, GL: Deref>(
1810 our_node_pubkey: &PublicKey, hops: &[PublicKey], route_params: &RouteParameters,
1811 network_graph: &NetworkGraph<GL>, logger: L, random_seed_bytes: &[u8; 32]
1812 ) -> Result<Route, LightningError>
1813 where L::Target: Logger, GL::Target: Logger {
1814 let graph_lock = network_graph.read_only();
1815 let mut route = build_route_from_hops_internal(
1816 our_node_pubkey, hops, &route_params.payment_params, &graph_lock,
1817 route_params.final_value_msat, route_params.final_cltv_expiry_delta, logger, random_seed_bytes)?;
1818 add_random_cltv_offset(&mut route, &route_params.payment_params, &graph_lock, random_seed_bytes);
1822 fn build_route_from_hops_internal<L: Deref>(
1823 our_node_pubkey: &PublicKey, hops: &[PublicKey], payment_params: &PaymentParameters,
1824 network_graph: &ReadOnlyNetworkGraph, final_value_msat: u64, final_cltv_expiry_delta: u32,
1825 logger: L, random_seed_bytes: &[u8; 32]
1826 ) -> Result<Route, LightningError> where L::Target: Logger {
1829 our_node_id: NodeId,
1830 hop_ids: [Option<NodeId>; MAX_PATH_LENGTH_ESTIMATE as usize],
1833 impl Score for HopScorer {
1834 fn channel_penalty_msat(&self, _short_channel_id: u64, source: &NodeId, target: &NodeId,
1835 _usage: ChannelUsage) -> u64
1837 let mut cur_id = self.our_node_id;
1838 for i in 0..self.hop_ids.len() {
1839 if let Some(next_id) = self.hop_ids[i] {
1840 if cur_id == *source && next_id == *target {
1851 fn payment_path_failed(&mut self, _path: &[&RouteHop], _short_channel_id: u64) {}
1853 fn payment_path_successful(&mut self, _path: &[&RouteHop]) {}
1856 impl<'a> Writeable for HopScorer {
1858 fn write<W: Writer>(&self, _w: &mut W) -> Result<(), io::Error> {
1863 if hops.len() > MAX_PATH_LENGTH_ESTIMATE.into() {
1864 return Err(LightningError{err: "Cannot build a route exceeding the maximum path length.".to_owned(), action: ErrorAction::IgnoreError});
1867 let our_node_id = NodeId::from_pubkey(our_node_pubkey);
1868 let mut hop_ids = [None; MAX_PATH_LENGTH_ESTIMATE as usize];
1869 for i in 0..hops.len() {
1870 hop_ids[i] = Some(NodeId::from_pubkey(&hops[i]));
1873 let scorer = HopScorer { our_node_id, hop_ids };
1875 get_route(our_node_pubkey, payment_params, network_graph, None, final_value_msat,
1876 final_cltv_expiry_delta, logger, &scorer, random_seed_bytes)
1881 use routing::gossip::{NetworkGraph, P2PGossipSync, NodeId};
1882 use routing::router::{get_route, build_route_from_hops_internal, add_random_cltv_offset, default_node_features,
1883 PaymentParameters, Route, RouteHint, RouteHintHop, RouteHop, RoutingFees,
1884 DEFAULT_MAX_TOTAL_CLTV_EXPIRY_DELTA, MAX_PATH_LENGTH_ESTIMATE};
1885 use routing::scoring::{ChannelUsage, Score, ProbabilisticScorer, ProbabilisticScoringParameters};
1886 use chain::transaction::OutPoint;
1887 use chain::keysinterface::KeysInterface;
1888 use ln::features::{ChannelFeatures, InitFeatures, InvoiceFeatures, NodeFeatures};
1889 use ln::msgs::{ErrorAction, LightningError, OptionalField, UnsignedChannelAnnouncement, ChannelAnnouncement, RoutingMessageHandler,
1890 NodeAnnouncement, UnsignedNodeAnnouncement, ChannelUpdate, UnsignedChannelUpdate};
1891 use ln::channelmanager;
1892 use util::test_utils;
1893 use util::chacha20::ChaCha20;
1894 use util::ser::Writeable;
1896 use util::ser::Writer;
1898 use bitcoin::hashes::sha256d::Hash as Sha256dHash;
1899 use bitcoin::hashes::Hash;
1900 use bitcoin::network::constants::Network;
1901 use bitcoin::blockdata::constants::genesis_block;
1902 use bitcoin::blockdata::script::Builder;
1903 use bitcoin::blockdata::opcodes;
1904 use bitcoin::blockdata::transaction::TxOut;
1908 use bitcoin::secp256k1::{PublicKey,SecretKey};
1909 use bitcoin::secp256k1::{Secp256k1, All};
1912 use sync::{self, Arc};
1914 fn get_channel_details(short_channel_id: Option<u64>, node_id: PublicKey,
1915 features: InitFeatures, outbound_capacity_msat: u64) -> channelmanager::ChannelDetails {
1916 channelmanager::ChannelDetails {
1917 channel_id: [0; 32],
1918 counterparty: channelmanager::ChannelCounterparty {
1921 unspendable_punishment_reserve: 0,
1922 forwarding_info: None,
1923 outbound_htlc_minimum_msat: None,
1924 outbound_htlc_maximum_msat: None,
1926 funding_txo: Some(OutPoint { txid: bitcoin::Txid::from_slice(&[0; 32]).unwrap(), index: 0 }),
1929 outbound_scid_alias: None,
1930 inbound_scid_alias: None,
1931 channel_value_satoshis: 0,
1934 outbound_capacity_msat,
1935 next_outbound_htlc_limit_msat: outbound_capacity_msat,
1936 inbound_capacity_msat: 42,
1937 unspendable_punishment_reserve: None,
1938 confirmations_required: None,
1939 force_close_spend_delay: None,
1940 is_outbound: true, is_channel_ready: true,
1941 is_usable: true, is_public: true,
1942 inbound_htlc_minimum_msat: None,
1943 inbound_htlc_maximum_msat: None,
1948 // Using the same keys for LN and BTC ids
1950 gossip_sync: &P2PGossipSync<Arc<NetworkGraph<Arc<test_utils::TestLogger>>>, Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>,
1951 secp_ctx: &Secp256k1<All>, node_1_privkey: &SecretKey, node_2_privkey: &SecretKey, features: ChannelFeatures, short_channel_id: u64
1953 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_1_privkey);
1954 let node_id_2 = PublicKey::from_secret_key(&secp_ctx, node_2_privkey);
1956 let unsigned_announcement = UnsignedChannelAnnouncement {
1958 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
1962 bitcoin_key_1: node_id_1,
1963 bitcoin_key_2: node_id_2,
1964 excess_data: Vec::new(),
1967 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_announcement.encode()[..])[..]);
1968 let valid_announcement = ChannelAnnouncement {
1969 node_signature_1: secp_ctx.sign_ecdsa(&msghash, node_1_privkey),
1970 node_signature_2: secp_ctx.sign_ecdsa(&msghash, node_2_privkey),
1971 bitcoin_signature_1: secp_ctx.sign_ecdsa(&msghash, node_1_privkey),
1972 bitcoin_signature_2: secp_ctx.sign_ecdsa(&msghash, node_2_privkey),
1973 contents: unsigned_announcement.clone(),
1975 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1976 Ok(res) => assert!(res),
1982 gossip_sync: &P2PGossipSync<Arc<NetworkGraph<Arc<test_utils::TestLogger>>>, Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>,
1983 secp_ctx: &Secp256k1<All>, node_privkey: &SecretKey, update: UnsignedChannelUpdate
1985 let msghash = hash_to_message!(&Sha256dHash::hash(&update.encode()[..])[..]);
1986 let valid_channel_update = ChannelUpdate {
1987 signature: secp_ctx.sign_ecdsa(&msghash, node_privkey),
1988 contents: update.clone()
1991 match gossip_sync.handle_channel_update(&valid_channel_update) {
1992 Ok(res) => assert!(res),
1997 fn add_or_update_node(
1998 gossip_sync: &P2PGossipSync<Arc<NetworkGraph<Arc<test_utils::TestLogger>>>, Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>,
1999 secp_ctx: &Secp256k1<All>, node_privkey: &SecretKey, features: NodeFeatures, timestamp: u32
2001 let node_id = PublicKey::from_secret_key(&secp_ctx, node_privkey);
2002 let unsigned_announcement = UnsignedNodeAnnouncement {
2008 addresses: Vec::new(),
2009 excess_address_data: Vec::new(),
2010 excess_data: Vec::new(),
2012 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_announcement.encode()[..])[..]);
2013 let valid_announcement = NodeAnnouncement {
2014 signature: secp_ctx.sign_ecdsa(&msghash, node_privkey),
2015 contents: unsigned_announcement.clone()
2018 match gossip_sync.handle_node_announcement(&valid_announcement) {
2024 fn get_nodes(secp_ctx: &Secp256k1<All>) -> (SecretKey, PublicKey, Vec<SecretKey>, Vec<PublicKey>) {
2025 let privkeys: Vec<SecretKey> = (2..22).map(|i| {
2026 SecretKey::from_slice(&hex::decode(format!("{:02x}", i).repeat(32)).unwrap()[..]).unwrap()
2029 let pubkeys = privkeys.iter().map(|secret| PublicKey::from_secret_key(&secp_ctx, secret)).collect();
2031 let our_privkey = SecretKey::from_slice(&hex::decode("01".repeat(32)).unwrap()[..]).unwrap();
2032 let our_id = PublicKey::from_secret_key(&secp_ctx, &our_privkey);
2034 (our_privkey, our_id, privkeys, pubkeys)
2037 fn id_to_feature_flags(id: u8) -> Vec<u8> {
2038 // Set the feature flags to the id'th odd (ie non-required) feature bit so that we can
2039 // test for it later.
2040 let idx = (id - 1) * 2 + 1;
2042 vec![1 << (idx - 8*3), 0, 0, 0]
2043 } else if idx > 8*2 {
2044 vec![1 << (idx - 8*2), 0, 0]
2045 } else if idx > 8*1 {
2046 vec![1 << (idx - 8*1), 0]
2052 fn build_line_graph() -> (
2053 Secp256k1<All>, sync::Arc<NetworkGraph<Arc<test_utils::TestLogger>>>,
2054 P2PGossipSync<sync::Arc<NetworkGraph<Arc<test_utils::TestLogger>>>, sync::Arc<test_utils::TestChainSource>, sync::Arc<test_utils::TestLogger>>,
2055 sync::Arc<test_utils::TestChainSource>, sync::Arc<test_utils::TestLogger>,
2057 let secp_ctx = Secp256k1::new();
2058 let logger = Arc::new(test_utils::TestLogger::new());
2059 let chain_monitor = Arc::new(test_utils::TestChainSource::new(Network::Testnet));
2060 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
2061 let network_graph = Arc::new(NetworkGraph::new(genesis_hash, Arc::clone(&logger)));
2062 let gossip_sync = P2PGossipSync::new(Arc::clone(&network_graph), None, Arc::clone(&logger));
2064 // Build network from our_id to node 19:
2065 // our_id -1(1)2- node0 -1(2)2- node1 - ... - node19
2066 let (our_privkey, _, privkeys, _) = get_nodes(&secp_ctx);
2068 for (idx, (cur_privkey, next_privkey)) in core::iter::once(&our_privkey)
2069 .chain(privkeys.iter()).zip(privkeys.iter()).enumerate() {
2070 let cur_short_channel_id = (idx as u64) + 1;
2071 add_channel(&gossip_sync, &secp_ctx, &cur_privkey, &next_privkey,
2072 ChannelFeatures::from_le_bytes(id_to_feature_flags(1)), cur_short_channel_id);
2073 update_channel(&gossip_sync, &secp_ctx, &cur_privkey, UnsignedChannelUpdate {
2074 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2075 short_channel_id: cur_short_channel_id,
2076 timestamp: idx as u32,
2078 cltv_expiry_delta: 0,
2079 htlc_minimum_msat: 0,
2080 htlc_maximum_msat: OptionalField::Absent,
2082 fee_proportional_millionths: 0,
2083 excess_data: Vec::new()
2085 update_channel(&gossip_sync, &secp_ctx, &next_privkey, UnsignedChannelUpdate {
2086 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2087 short_channel_id: cur_short_channel_id,
2088 timestamp: (idx as u32)+1,
2090 cltv_expiry_delta: 0,
2091 htlc_minimum_msat: 0,
2092 htlc_maximum_msat: OptionalField::Absent,
2094 fee_proportional_millionths: 0,
2095 excess_data: Vec::new()
2097 add_or_update_node(&gossip_sync, &secp_ctx, next_privkey,
2098 NodeFeatures::from_le_bytes(id_to_feature_flags(1)), 0);
2101 (secp_ctx, network_graph, gossip_sync, chain_monitor, logger)
2104 fn build_graph() -> (
2106 sync::Arc<NetworkGraph<Arc<test_utils::TestLogger>>>,
2107 P2PGossipSync<sync::Arc<NetworkGraph<Arc<test_utils::TestLogger>>>, sync::Arc<test_utils::TestChainSource>, sync::Arc<test_utils::TestLogger>>,
2108 sync::Arc<test_utils::TestChainSource>,
2109 sync::Arc<test_utils::TestLogger>,
2111 let secp_ctx = Secp256k1::new();
2112 let logger = Arc::new(test_utils::TestLogger::new());
2113 let chain_monitor = Arc::new(test_utils::TestChainSource::new(Network::Testnet));
2114 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
2115 let network_graph = Arc::new(NetworkGraph::new(genesis_hash, Arc::clone(&logger)));
2116 let gossip_sync = P2PGossipSync::new(Arc::clone(&network_graph), None, Arc::clone(&logger));
2117 // Build network from our_id to node6:
2119 // -1(1)2- node0 -1(3)2-
2121 // our_id -1(12)2- node7 -1(13)2--- node2
2123 // -1(2)2- node1 -1(4)2-
2126 // chan1 1-to-2: disabled
2127 // chan1 2-to-1: enabled, 0 fee
2129 // chan2 1-to-2: enabled, ignored fee
2130 // chan2 2-to-1: enabled, 0 fee
2132 // chan3 1-to-2: enabled, 0 fee
2133 // chan3 2-to-1: enabled, 100 msat fee
2135 // chan4 1-to-2: enabled, 100% fee
2136 // chan4 2-to-1: enabled, 0 fee
2138 // chan12 1-to-2: enabled, ignored fee
2139 // chan12 2-to-1: enabled, 0 fee
2141 // chan13 1-to-2: enabled, 200% fee
2142 // chan13 2-to-1: enabled, 0 fee
2145 // -1(5)2- node3 -1(8)2--
2149 // node2--1(6)2- node4 -1(9)2--- node6 (not in global route map)
2151 // -1(7)2- node5 -1(10)2-
2153 // Channels 5, 8, 9 and 10 are private channels.
2155 // chan5 1-to-2: enabled, 100 msat fee
2156 // chan5 2-to-1: enabled, 0 fee
2158 // chan6 1-to-2: enabled, 0 fee
2159 // chan6 2-to-1: enabled, 0 fee
2161 // chan7 1-to-2: enabled, 100% fee
2162 // chan7 2-to-1: enabled, 0 fee
2164 // chan8 1-to-2: enabled, variable fee (0 then 1000 msat)
2165 // chan8 2-to-1: enabled, 0 fee
2167 // chan9 1-to-2: enabled, 1001 msat fee
2168 // chan9 2-to-1: enabled, 0 fee
2170 // chan10 1-to-2: enabled, 0 fee
2171 // chan10 2-to-1: enabled, 0 fee
2173 // chan11 1-to-2: enabled, 0 fee
2174 // chan11 2-to-1: enabled, 0 fee
2176 let (our_privkey, _, privkeys, _) = get_nodes(&secp_ctx);
2178 add_channel(&gossip_sync, &secp_ctx, &our_privkey, &privkeys[0], ChannelFeatures::from_le_bytes(id_to_feature_flags(1)), 1);
2179 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
2180 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2181 short_channel_id: 1,
2184 cltv_expiry_delta: 0,
2185 htlc_minimum_msat: 0,
2186 htlc_maximum_msat: OptionalField::Absent,
2188 fee_proportional_millionths: 0,
2189 excess_data: Vec::new()
2192 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[0], NodeFeatures::from_le_bytes(id_to_feature_flags(1)), 0);
2194 add_channel(&gossip_sync, &secp_ctx, &our_privkey, &privkeys[1], ChannelFeatures::from_le_bytes(id_to_feature_flags(2)), 2);
2195 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2196 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2197 short_channel_id: 2,
2200 cltv_expiry_delta: (5 << 4) | 3,
2201 htlc_minimum_msat: 0,
2202 htlc_maximum_msat: OptionalField::Absent,
2203 fee_base_msat: u32::max_value(),
2204 fee_proportional_millionths: u32::max_value(),
2205 excess_data: Vec::new()
2207 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
2208 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2209 short_channel_id: 2,
2212 cltv_expiry_delta: 0,
2213 htlc_minimum_msat: 0,
2214 htlc_maximum_msat: OptionalField::Absent,
2216 fee_proportional_millionths: 0,
2217 excess_data: Vec::new()
2220 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[1], NodeFeatures::from_le_bytes(id_to_feature_flags(2)), 0);
2222 add_channel(&gossip_sync, &secp_ctx, &our_privkey, &privkeys[7], ChannelFeatures::from_le_bytes(id_to_feature_flags(12)), 12);
2223 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2224 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2225 short_channel_id: 12,
2228 cltv_expiry_delta: (5 << 4) | 3,
2229 htlc_minimum_msat: 0,
2230 htlc_maximum_msat: OptionalField::Absent,
2231 fee_base_msat: u32::max_value(),
2232 fee_proportional_millionths: u32::max_value(),
2233 excess_data: Vec::new()
2235 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
2236 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2237 short_channel_id: 12,
2240 cltv_expiry_delta: 0,
2241 htlc_minimum_msat: 0,
2242 htlc_maximum_msat: OptionalField::Absent,
2244 fee_proportional_millionths: 0,
2245 excess_data: Vec::new()
2248 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[7], NodeFeatures::from_le_bytes(id_to_feature_flags(8)), 0);
2250 add_channel(&gossip_sync, &secp_ctx, &privkeys[0], &privkeys[2], ChannelFeatures::from_le_bytes(id_to_feature_flags(3)), 3);
2251 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
2252 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2253 short_channel_id: 3,
2256 cltv_expiry_delta: (3 << 4) | 1,
2257 htlc_minimum_msat: 0,
2258 htlc_maximum_msat: OptionalField::Absent,
2260 fee_proportional_millionths: 0,
2261 excess_data: Vec::new()
2263 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
2264 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2265 short_channel_id: 3,
2268 cltv_expiry_delta: (3 << 4) | 2,
2269 htlc_minimum_msat: 0,
2270 htlc_maximum_msat: OptionalField::Absent,
2272 fee_proportional_millionths: 0,
2273 excess_data: Vec::new()
2276 add_channel(&gossip_sync, &secp_ctx, &privkeys[1], &privkeys[2], ChannelFeatures::from_le_bytes(id_to_feature_flags(4)), 4);
2277 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
2278 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2279 short_channel_id: 4,
2282 cltv_expiry_delta: (4 << 4) | 1,
2283 htlc_minimum_msat: 0,
2284 htlc_maximum_msat: OptionalField::Absent,
2286 fee_proportional_millionths: 1000000,
2287 excess_data: Vec::new()
2289 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
2290 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2291 short_channel_id: 4,
2294 cltv_expiry_delta: (4 << 4) | 2,
2295 htlc_minimum_msat: 0,
2296 htlc_maximum_msat: OptionalField::Absent,
2298 fee_proportional_millionths: 0,
2299 excess_data: Vec::new()
2302 add_channel(&gossip_sync, &secp_ctx, &privkeys[7], &privkeys[2], ChannelFeatures::from_le_bytes(id_to_feature_flags(13)), 13);
2303 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
2304 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2305 short_channel_id: 13,
2308 cltv_expiry_delta: (13 << 4) | 1,
2309 htlc_minimum_msat: 0,
2310 htlc_maximum_msat: OptionalField::Absent,
2312 fee_proportional_millionths: 2000000,
2313 excess_data: Vec::new()
2315 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
2316 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2317 short_channel_id: 13,
2320 cltv_expiry_delta: (13 << 4) | 2,
2321 htlc_minimum_msat: 0,
2322 htlc_maximum_msat: OptionalField::Absent,
2324 fee_proportional_millionths: 0,
2325 excess_data: Vec::new()
2328 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[2], NodeFeatures::from_le_bytes(id_to_feature_flags(3)), 0);
2330 add_channel(&gossip_sync, &secp_ctx, &privkeys[2], &privkeys[4], ChannelFeatures::from_le_bytes(id_to_feature_flags(6)), 6);
2331 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
2332 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2333 short_channel_id: 6,
2336 cltv_expiry_delta: (6 << 4) | 1,
2337 htlc_minimum_msat: 0,
2338 htlc_maximum_msat: OptionalField::Absent,
2340 fee_proportional_millionths: 0,
2341 excess_data: Vec::new()
2343 update_channel(&gossip_sync, &secp_ctx, &privkeys[4], UnsignedChannelUpdate {
2344 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2345 short_channel_id: 6,
2348 cltv_expiry_delta: (6 << 4) | 2,
2349 htlc_minimum_msat: 0,
2350 htlc_maximum_msat: OptionalField::Absent,
2352 fee_proportional_millionths: 0,
2353 excess_data: Vec::new(),
2356 add_channel(&gossip_sync, &secp_ctx, &privkeys[4], &privkeys[3], ChannelFeatures::from_le_bytes(id_to_feature_flags(11)), 11);
2357 update_channel(&gossip_sync, &secp_ctx, &privkeys[4], UnsignedChannelUpdate {
2358 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2359 short_channel_id: 11,
2362 cltv_expiry_delta: (11 << 4) | 1,
2363 htlc_minimum_msat: 0,
2364 htlc_maximum_msat: OptionalField::Absent,
2366 fee_proportional_millionths: 0,
2367 excess_data: Vec::new()
2369 update_channel(&gossip_sync, &secp_ctx, &privkeys[3], UnsignedChannelUpdate {
2370 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2371 short_channel_id: 11,
2374 cltv_expiry_delta: (11 << 4) | 2,
2375 htlc_minimum_msat: 0,
2376 htlc_maximum_msat: OptionalField::Absent,
2378 fee_proportional_millionths: 0,
2379 excess_data: Vec::new()
2382 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[4], NodeFeatures::from_le_bytes(id_to_feature_flags(5)), 0);
2384 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[3], NodeFeatures::from_le_bytes(id_to_feature_flags(4)), 0);
2386 add_channel(&gossip_sync, &secp_ctx, &privkeys[2], &privkeys[5], ChannelFeatures::from_le_bytes(id_to_feature_flags(7)), 7);
2387 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
2388 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2389 short_channel_id: 7,
2392 cltv_expiry_delta: (7 << 4) | 1,
2393 htlc_minimum_msat: 0,
2394 htlc_maximum_msat: OptionalField::Absent,
2396 fee_proportional_millionths: 1000000,
2397 excess_data: Vec::new()
2399 update_channel(&gossip_sync, &secp_ctx, &privkeys[5], UnsignedChannelUpdate {
2400 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2401 short_channel_id: 7,
2404 cltv_expiry_delta: (7 << 4) | 2,
2405 htlc_minimum_msat: 0,
2406 htlc_maximum_msat: OptionalField::Absent,
2408 fee_proportional_millionths: 0,
2409 excess_data: Vec::new()
2412 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[5], NodeFeatures::from_le_bytes(id_to_feature_flags(6)), 0);
2414 (secp_ctx, network_graph, gossip_sync, chain_monitor, logger)
2418 fn simple_route_test() {
2419 let (secp_ctx, network_graph, _, _, logger) = build_graph();
2420 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
2421 let payment_params = PaymentParameters::from_node_id(nodes[2]);
2422 let scorer = test_utils::TestScorer::with_penalty(0);
2423 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
2424 let random_seed_bytes = keys_manager.get_secure_random_bytes();
2426 // Simple route to 2 via 1
2428 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 0, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
2429 assert_eq!(err, "Cannot send a payment of 0 msat");
2430 } else { panic!(); }
2432 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2433 assert_eq!(route.paths[0].len(), 2);
2435 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
2436 assert_eq!(route.paths[0][0].short_channel_id, 2);
2437 assert_eq!(route.paths[0][0].fee_msat, 100);
2438 assert_eq!(route.paths[0][0].cltv_expiry_delta, (4 << 4) | 1);
2439 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
2440 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
2442 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
2443 assert_eq!(route.paths[0][1].short_channel_id, 4);
2444 assert_eq!(route.paths[0][1].fee_msat, 100);
2445 assert_eq!(route.paths[0][1].cltv_expiry_delta, 42);
2446 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
2447 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
2451 fn invalid_first_hop_test() {
2452 let (secp_ctx, network_graph, _, _, logger) = build_graph();
2453 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
2454 let payment_params = PaymentParameters::from_node_id(nodes[2]);
2455 let scorer = test_utils::TestScorer::with_penalty(0);
2456 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
2457 let random_seed_bytes = keys_manager.get_secure_random_bytes();
2459 // Simple route to 2 via 1
2461 let our_chans = vec![get_channel_details(Some(2), our_id, InitFeatures::from_le_bytes(vec![0b11]), 100000)];
2463 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) =
2464 get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&our_chans.iter().collect::<Vec<_>>()), 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
2465 assert_eq!(err, "First hop cannot have our_node_pubkey as a destination.");
2466 } else { panic!(); }
2468 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2469 assert_eq!(route.paths[0].len(), 2);
2473 fn htlc_minimum_test() {
2474 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
2475 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
2476 let payment_params = PaymentParameters::from_node_id(nodes[2]);
2477 let scorer = test_utils::TestScorer::with_penalty(0);
2478 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
2479 let random_seed_bytes = keys_manager.get_secure_random_bytes();
2481 // Simple route to 2 via 1
2483 // Disable other paths
2484 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2485 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2486 short_channel_id: 12,
2488 flags: 2, // to disable
2489 cltv_expiry_delta: 0,
2490 htlc_minimum_msat: 0,
2491 htlc_maximum_msat: OptionalField::Absent,
2493 fee_proportional_millionths: 0,
2494 excess_data: Vec::new()
2496 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
2497 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2498 short_channel_id: 3,
2500 flags: 2, // to disable
2501 cltv_expiry_delta: 0,
2502 htlc_minimum_msat: 0,
2503 htlc_maximum_msat: OptionalField::Absent,
2505 fee_proportional_millionths: 0,
2506 excess_data: Vec::new()
2508 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
2509 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2510 short_channel_id: 13,
2512 flags: 2, // to disable
2513 cltv_expiry_delta: 0,
2514 htlc_minimum_msat: 0,
2515 htlc_maximum_msat: OptionalField::Absent,
2517 fee_proportional_millionths: 0,
2518 excess_data: Vec::new()
2520 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
2521 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2522 short_channel_id: 6,
2524 flags: 2, // to disable
2525 cltv_expiry_delta: 0,
2526 htlc_minimum_msat: 0,
2527 htlc_maximum_msat: OptionalField::Absent,
2529 fee_proportional_millionths: 0,
2530 excess_data: Vec::new()
2532 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
2533 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2534 short_channel_id: 7,
2536 flags: 2, // to disable
2537 cltv_expiry_delta: 0,
2538 htlc_minimum_msat: 0,
2539 htlc_maximum_msat: OptionalField::Absent,
2541 fee_proportional_millionths: 0,
2542 excess_data: Vec::new()
2545 // Check against amount_to_transfer_over_msat.
2546 // Set minimal HTLC of 200_000_000 msat.
2547 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2548 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2549 short_channel_id: 2,
2552 cltv_expiry_delta: 0,
2553 htlc_minimum_msat: 200_000_000,
2554 htlc_maximum_msat: OptionalField::Absent,
2556 fee_proportional_millionths: 0,
2557 excess_data: Vec::new()
2560 // Second hop only allows to forward 199_999_999 at most, thus not allowing the first hop to
2562 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
2563 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2564 short_channel_id: 4,
2567 cltv_expiry_delta: 0,
2568 htlc_minimum_msat: 0,
2569 htlc_maximum_msat: OptionalField::Present(199_999_999),
2571 fee_proportional_millionths: 0,
2572 excess_data: Vec::new()
2575 // Not possible to send 199_999_999, because the minimum on channel=2 is 200_000_000.
2576 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 199_999_999, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
2577 assert_eq!(err, "Failed to find a path to the given destination");
2578 } else { panic!(); }
2580 // Lift the restriction on the first hop.
2581 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2582 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2583 short_channel_id: 2,
2586 cltv_expiry_delta: 0,
2587 htlc_minimum_msat: 0,
2588 htlc_maximum_msat: OptionalField::Absent,
2590 fee_proportional_millionths: 0,
2591 excess_data: Vec::new()
2594 // A payment above the minimum should pass
2595 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 199_999_999, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2596 assert_eq!(route.paths[0].len(), 2);
2600 fn htlc_minimum_overpay_test() {
2601 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
2602 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
2603 let payment_params = PaymentParameters::from_node_id(nodes[2]).with_features(InvoiceFeatures::known());
2604 let scorer = test_utils::TestScorer::with_penalty(0);
2605 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
2606 let random_seed_bytes = keys_manager.get_secure_random_bytes();
2608 // A route to node#2 via two paths.
2609 // One path allows transferring 35-40 sats, another one also allows 35-40 sats.
2610 // Thus, they can't send 60 without overpaying.
2611 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2612 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2613 short_channel_id: 2,
2616 cltv_expiry_delta: 0,
2617 htlc_minimum_msat: 35_000,
2618 htlc_maximum_msat: OptionalField::Present(40_000),
2620 fee_proportional_millionths: 0,
2621 excess_data: Vec::new()
2623 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2624 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2625 short_channel_id: 12,
2628 cltv_expiry_delta: 0,
2629 htlc_minimum_msat: 35_000,
2630 htlc_maximum_msat: OptionalField::Present(40_000),
2632 fee_proportional_millionths: 0,
2633 excess_data: Vec::new()
2637 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
2638 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2639 short_channel_id: 13,
2642 cltv_expiry_delta: 0,
2643 htlc_minimum_msat: 0,
2644 htlc_maximum_msat: OptionalField::Absent,
2646 fee_proportional_millionths: 0,
2647 excess_data: Vec::new()
2649 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
2650 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2651 short_channel_id: 4,
2654 cltv_expiry_delta: 0,
2655 htlc_minimum_msat: 0,
2656 htlc_maximum_msat: OptionalField::Absent,
2658 fee_proportional_millionths: 0,
2659 excess_data: Vec::new()
2662 // Disable other paths
2663 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2664 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2665 short_channel_id: 1,
2667 flags: 2, // to disable
2668 cltv_expiry_delta: 0,
2669 htlc_minimum_msat: 0,
2670 htlc_maximum_msat: OptionalField::Absent,
2672 fee_proportional_millionths: 0,
2673 excess_data: Vec::new()
2676 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 60_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2677 // Overpay fees to hit htlc_minimum_msat.
2678 let overpaid_fees = route.paths[0][0].fee_msat + route.paths[1][0].fee_msat;
2679 // TODO: this could be better balanced to overpay 10k and not 15k.
2680 assert_eq!(overpaid_fees, 15_000);
2682 // Now, test that if there are 2 paths, a "cheaper" by fee path wouldn't be prioritized
2683 // while taking even more fee to match htlc_minimum_msat.
2684 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2685 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2686 short_channel_id: 12,
2689 cltv_expiry_delta: 0,
2690 htlc_minimum_msat: 65_000,
2691 htlc_maximum_msat: OptionalField::Present(80_000),
2693 fee_proportional_millionths: 0,
2694 excess_data: Vec::new()
2696 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2697 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2698 short_channel_id: 2,
2701 cltv_expiry_delta: 0,
2702 htlc_minimum_msat: 0,
2703 htlc_maximum_msat: OptionalField::Absent,
2705 fee_proportional_millionths: 0,
2706 excess_data: Vec::new()
2708 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
2709 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2710 short_channel_id: 4,
2713 cltv_expiry_delta: 0,
2714 htlc_minimum_msat: 0,
2715 htlc_maximum_msat: OptionalField::Absent,
2717 fee_proportional_millionths: 100_000,
2718 excess_data: Vec::new()
2721 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 60_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2722 // Fine to overpay for htlc_minimum_msat if it allows us to save fee.
2723 assert_eq!(route.paths.len(), 1);
2724 assert_eq!(route.paths[0][0].short_channel_id, 12);
2725 let fees = route.paths[0][0].fee_msat;
2726 assert_eq!(fees, 5_000);
2728 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 50_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2729 // Not fine to overpay for htlc_minimum_msat if it requires paying more than fee on
2730 // the other channel.
2731 assert_eq!(route.paths.len(), 1);
2732 assert_eq!(route.paths[0][0].short_channel_id, 2);
2733 let fees = route.paths[0][0].fee_msat;
2734 assert_eq!(fees, 5_000);
2738 fn disable_channels_test() {
2739 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
2740 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
2741 let payment_params = PaymentParameters::from_node_id(nodes[2]);
2742 let scorer = test_utils::TestScorer::with_penalty(0);
2743 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
2744 let random_seed_bytes = keys_manager.get_secure_random_bytes();
2746 // // Disable channels 4 and 12 by flags=2
2747 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
2748 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2749 short_channel_id: 4,
2751 flags: 2, // to disable
2752 cltv_expiry_delta: 0,
2753 htlc_minimum_msat: 0,
2754 htlc_maximum_msat: OptionalField::Absent,
2756 fee_proportional_millionths: 0,
2757 excess_data: Vec::new()
2759 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
2760 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2761 short_channel_id: 12,
2763 flags: 2, // to disable
2764 cltv_expiry_delta: 0,
2765 htlc_minimum_msat: 0,
2766 htlc_maximum_msat: OptionalField::Absent,
2768 fee_proportional_millionths: 0,
2769 excess_data: Vec::new()
2772 // If all the channels require some features we don't understand, route should fail
2773 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
2774 assert_eq!(err, "Failed to find a path to the given destination");
2775 } else { panic!(); }
2777 // If we specify a channel to node7, that overrides our local channel view and that gets used
2778 let our_chans = vec![get_channel_details(Some(42), nodes[7].clone(), InitFeatures::from_le_bytes(vec![0b11]), 250_000_000)];
2779 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&our_chans.iter().collect::<Vec<_>>()), 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2780 assert_eq!(route.paths[0].len(), 2);
2782 assert_eq!(route.paths[0][0].pubkey, nodes[7]);
2783 assert_eq!(route.paths[0][0].short_channel_id, 42);
2784 assert_eq!(route.paths[0][0].fee_msat, 200);
2785 assert_eq!(route.paths[0][0].cltv_expiry_delta, (13 << 4) | 1);
2786 assert_eq!(route.paths[0][0].node_features.le_flags(), &vec![0b11]); // it should also override our view of their features
2787 assert_eq!(route.paths[0][0].channel_features.le_flags(), &Vec::<u8>::new()); // No feature flags will meet the relevant-to-channel conversion
2789 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
2790 assert_eq!(route.paths[0][1].short_channel_id, 13);
2791 assert_eq!(route.paths[0][1].fee_msat, 100);
2792 assert_eq!(route.paths[0][1].cltv_expiry_delta, 42);
2793 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
2794 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(13));
2798 fn disable_node_test() {
2799 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
2800 let (_, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
2801 let payment_params = PaymentParameters::from_node_id(nodes[2]);
2802 let scorer = test_utils::TestScorer::with_penalty(0);
2803 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
2804 let random_seed_bytes = keys_manager.get_secure_random_bytes();
2806 // Disable nodes 1, 2, and 8 by requiring unknown feature bits
2807 let mut unknown_features = NodeFeatures::known();
2808 unknown_features.set_unknown_feature_required();
2809 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[0], unknown_features.clone(), 1);
2810 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[1], unknown_features.clone(), 1);
2811 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[7], unknown_features.clone(), 1);
2813 // If all nodes require some features we don't understand, route should fail
2814 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
2815 assert_eq!(err, "Failed to find a path to the given destination");
2816 } else { panic!(); }
2818 // If we specify a channel to node7, that overrides our local channel view and that gets used
2819 let our_chans = vec![get_channel_details(Some(42), nodes[7].clone(), InitFeatures::from_le_bytes(vec![0b11]), 250_000_000)];
2820 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&our_chans.iter().collect::<Vec<_>>()), 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2821 assert_eq!(route.paths[0].len(), 2);
2823 assert_eq!(route.paths[0][0].pubkey, nodes[7]);
2824 assert_eq!(route.paths[0][0].short_channel_id, 42);
2825 assert_eq!(route.paths[0][0].fee_msat, 200);
2826 assert_eq!(route.paths[0][0].cltv_expiry_delta, (13 << 4) | 1);
2827 assert_eq!(route.paths[0][0].node_features.le_flags(), &vec![0b11]); // it should also override our view of their features
2828 assert_eq!(route.paths[0][0].channel_features.le_flags(), &Vec::<u8>::new()); // No feature flags will meet the relevant-to-channel conversion
2830 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
2831 assert_eq!(route.paths[0][1].short_channel_id, 13);
2832 assert_eq!(route.paths[0][1].fee_msat, 100);
2833 assert_eq!(route.paths[0][1].cltv_expiry_delta, 42);
2834 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
2835 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(13));
2837 // Note that we don't test disabling node 3 and failing to route to it, as we (somewhat
2838 // naively) assume that the user checked the feature bits on the invoice, which override
2839 // the node_announcement.
2843 fn our_chans_test() {
2844 let (secp_ctx, network_graph, _, _, logger) = build_graph();
2845 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
2846 let scorer = test_utils::TestScorer::with_penalty(0);
2847 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
2848 let random_seed_bytes = keys_manager.get_secure_random_bytes();
2850 // Route to 1 via 2 and 3 because our channel to 1 is disabled
2851 let payment_params = PaymentParameters::from_node_id(nodes[0]);
2852 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2853 assert_eq!(route.paths[0].len(), 3);
2855 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
2856 assert_eq!(route.paths[0][0].short_channel_id, 2);
2857 assert_eq!(route.paths[0][0].fee_msat, 200);
2858 assert_eq!(route.paths[0][0].cltv_expiry_delta, (4 << 4) | 1);
2859 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
2860 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
2862 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
2863 assert_eq!(route.paths[0][1].short_channel_id, 4);
2864 assert_eq!(route.paths[0][1].fee_msat, 100);
2865 assert_eq!(route.paths[0][1].cltv_expiry_delta, (3 << 4) | 2);
2866 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
2867 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
2869 assert_eq!(route.paths[0][2].pubkey, nodes[0]);
2870 assert_eq!(route.paths[0][2].short_channel_id, 3);
2871 assert_eq!(route.paths[0][2].fee_msat, 100);
2872 assert_eq!(route.paths[0][2].cltv_expiry_delta, 42);
2873 assert_eq!(route.paths[0][2].node_features.le_flags(), &id_to_feature_flags(1));
2874 assert_eq!(route.paths[0][2].channel_features.le_flags(), &id_to_feature_flags(3));
2876 // If we specify a channel to node7, that overrides our local channel view and that gets used
2877 let payment_params = PaymentParameters::from_node_id(nodes[2]);
2878 let our_chans = vec![get_channel_details(Some(42), nodes[7].clone(), InitFeatures::from_le_bytes(vec![0b11]), 250_000_000)];
2879 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&our_chans.iter().collect::<Vec<_>>()), 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
2880 assert_eq!(route.paths[0].len(), 2);
2882 assert_eq!(route.paths[0][0].pubkey, nodes[7]);
2883 assert_eq!(route.paths[0][0].short_channel_id, 42);
2884 assert_eq!(route.paths[0][0].fee_msat, 200);
2885 assert_eq!(route.paths[0][0].cltv_expiry_delta, (13 << 4) | 1);
2886 assert_eq!(route.paths[0][0].node_features.le_flags(), &vec![0b11]);
2887 assert_eq!(route.paths[0][0].channel_features.le_flags(), &Vec::<u8>::new()); // No feature flags will meet the relevant-to-channel conversion
2889 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
2890 assert_eq!(route.paths[0][1].short_channel_id, 13);
2891 assert_eq!(route.paths[0][1].fee_msat, 100);
2892 assert_eq!(route.paths[0][1].cltv_expiry_delta, 42);
2893 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
2894 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(13));
2897 fn last_hops(nodes: &Vec<PublicKey>) -> Vec<RouteHint> {
2898 let zero_fees = RoutingFees {
2900 proportional_millionths: 0,
2902 vec![RouteHint(vec![RouteHintHop {
2903 src_node_id: nodes[3],
2904 short_channel_id: 8,
2906 cltv_expiry_delta: (8 << 4) | 1,
2907 htlc_minimum_msat: None,
2908 htlc_maximum_msat: None,
2910 ]), RouteHint(vec![RouteHintHop {
2911 src_node_id: nodes[4],
2912 short_channel_id: 9,
2915 proportional_millionths: 0,
2917 cltv_expiry_delta: (9 << 4) | 1,
2918 htlc_minimum_msat: None,
2919 htlc_maximum_msat: None,
2920 }]), RouteHint(vec![RouteHintHop {
2921 src_node_id: nodes[5],
2922 short_channel_id: 10,
2924 cltv_expiry_delta: (10 << 4) | 1,
2925 htlc_minimum_msat: None,
2926 htlc_maximum_msat: None,
2930 fn last_hops_multi_private_channels(nodes: &Vec<PublicKey>) -> Vec<RouteHint> {
2931 let zero_fees = RoutingFees {
2933 proportional_millionths: 0,
2935 vec![RouteHint(vec![RouteHintHop {
2936 src_node_id: nodes[2],
2937 short_channel_id: 5,
2940 proportional_millionths: 0,
2942 cltv_expiry_delta: (5 << 4) | 1,
2943 htlc_minimum_msat: None,
2944 htlc_maximum_msat: None,
2946 src_node_id: nodes[3],
2947 short_channel_id: 8,
2949 cltv_expiry_delta: (8 << 4) | 1,
2950 htlc_minimum_msat: None,
2951 htlc_maximum_msat: None,
2953 ]), RouteHint(vec![RouteHintHop {
2954 src_node_id: nodes[4],
2955 short_channel_id: 9,
2958 proportional_millionths: 0,
2960 cltv_expiry_delta: (9 << 4) | 1,
2961 htlc_minimum_msat: None,
2962 htlc_maximum_msat: None,
2963 }]), RouteHint(vec![RouteHintHop {
2964 src_node_id: nodes[5],
2965 short_channel_id: 10,
2967 cltv_expiry_delta: (10 << 4) | 1,
2968 htlc_minimum_msat: None,
2969 htlc_maximum_msat: None,
2974 fn partial_route_hint_test() {
2975 let (secp_ctx, network_graph, _, _, logger) = build_graph();
2976 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
2977 let scorer = test_utils::TestScorer::with_penalty(0);
2978 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
2979 let random_seed_bytes = keys_manager.get_secure_random_bytes();
2981 // Simple test across 2, 3, 5, and 4 via a last_hop channel
2982 // Tests the behaviour when the RouteHint contains a suboptimal hop.
2983 // RouteHint may be partially used by the algo to build the best path.
2985 // First check that last hop can't have its source as the payee.
2986 let invalid_last_hop = RouteHint(vec![RouteHintHop {
2987 src_node_id: nodes[6],
2988 short_channel_id: 8,
2991 proportional_millionths: 0,
2993 cltv_expiry_delta: (8 << 4) | 1,
2994 htlc_minimum_msat: None,
2995 htlc_maximum_msat: None,
2998 let mut invalid_last_hops = last_hops_multi_private_channels(&nodes);
2999 invalid_last_hops.push(invalid_last_hop);
3001 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(invalid_last_hops);
3002 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
3003 assert_eq!(err, "Route hint cannot have the payee as the source.");
3004 } else { panic!(); }
3007 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops_multi_private_channels(&nodes));
3008 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3009 assert_eq!(route.paths[0].len(), 5);
3011 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
3012 assert_eq!(route.paths[0][0].short_channel_id, 2);
3013 assert_eq!(route.paths[0][0].fee_msat, 100);
3014 assert_eq!(route.paths[0][0].cltv_expiry_delta, (4 << 4) | 1);
3015 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
3016 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
3018 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
3019 assert_eq!(route.paths[0][1].short_channel_id, 4);
3020 assert_eq!(route.paths[0][1].fee_msat, 0);
3021 assert_eq!(route.paths[0][1].cltv_expiry_delta, (6 << 4) | 1);
3022 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
3023 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
3025 assert_eq!(route.paths[0][2].pubkey, nodes[4]);
3026 assert_eq!(route.paths[0][2].short_channel_id, 6);
3027 assert_eq!(route.paths[0][2].fee_msat, 0);
3028 assert_eq!(route.paths[0][2].cltv_expiry_delta, (11 << 4) | 1);
3029 assert_eq!(route.paths[0][2].node_features.le_flags(), &id_to_feature_flags(5));
3030 assert_eq!(route.paths[0][2].channel_features.le_flags(), &id_to_feature_flags(6));
3032 assert_eq!(route.paths[0][3].pubkey, nodes[3]);
3033 assert_eq!(route.paths[0][3].short_channel_id, 11);
3034 assert_eq!(route.paths[0][3].fee_msat, 0);
3035 assert_eq!(route.paths[0][3].cltv_expiry_delta, (8 << 4) | 1);
3036 // If we have a peer in the node map, we'll use their features here since we don't have
3037 // a way of figuring out their features from the invoice:
3038 assert_eq!(route.paths[0][3].node_features.le_flags(), &id_to_feature_flags(4));
3039 assert_eq!(route.paths[0][3].channel_features.le_flags(), &id_to_feature_flags(11));
3041 assert_eq!(route.paths[0][4].pubkey, nodes[6]);
3042 assert_eq!(route.paths[0][4].short_channel_id, 8);
3043 assert_eq!(route.paths[0][4].fee_msat, 100);
3044 assert_eq!(route.paths[0][4].cltv_expiry_delta, 42);
3045 assert_eq!(route.paths[0][4].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3046 assert_eq!(route.paths[0][4].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3049 fn empty_last_hop(nodes: &Vec<PublicKey>) -> Vec<RouteHint> {
3050 let zero_fees = RoutingFees {
3052 proportional_millionths: 0,
3054 vec![RouteHint(vec![RouteHintHop {
3055 src_node_id: nodes[3],
3056 short_channel_id: 8,
3058 cltv_expiry_delta: (8 << 4) | 1,
3059 htlc_minimum_msat: None,
3060 htlc_maximum_msat: None,
3061 }]), RouteHint(vec![
3063 ]), RouteHint(vec![RouteHintHop {
3064 src_node_id: nodes[5],
3065 short_channel_id: 10,
3067 cltv_expiry_delta: (10 << 4) | 1,
3068 htlc_minimum_msat: None,
3069 htlc_maximum_msat: None,
3074 fn ignores_empty_last_hops_test() {
3075 let (secp_ctx, network_graph, _, _, logger) = build_graph();
3076 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
3077 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(empty_last_hop(&nodes));
3078 let scorer = test_utils::TestScorer::with_penalty(0);
3079 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
3080 let random_seed_bytes = keys_manager.get_secure_random_bytes();
3082 // Test handling of an empty RouteHint passed in Invoice.
3084 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3085 assert_eq!(route.paths[0].len(), 5);
3087 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
3088 assert_eq!(route.paths[0][0].short_channel_id, 2);
3089 assert_eq!(route.paths[0][0].fee_msat, 100);
3090 assert_eq!(route.paths[0][0].cltv_expiry_delta, (4 << 4) | 1);
3091 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
3092 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
3094 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
3095 assert_eq!(route.paths[0][1].short_channel_id, 4);
3096 assert_eq!(route.paths[0][1].fee_msat, 0);
3097 assert_eq!(route.paths[0][1].cltv_expiry_delta, (6 << 4) | 1);
3098 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
3099 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
3101 assert_eq!(route.paths[0][2].pubkey, nodes[4]);
3102 assert_eq!(route.paths[0][2].short_channel_id, 6);
3103 assert_eq!(route.paths[0][2].fee_msat, 0);
3104 assert_eq!(route.paths[0][2].cltv_expiry_delta, (11 << 4) | 1);
3105 assert_eq!(route.paths[0][2].node_features.le_flags(), &id_to_feature_flags(5));
3106 assert_eq!(route.paths[0][2].channel_features.le_flags(), &id_to_feature_flags(6));
3108 assert_eq!(route.paths[0][3].pubkey, nodes[3]);
3109 assert_eq!(route.paths[0][3].short_channel_id, 11);
3110 assert_eq!(route.paths[0][3].fee_msat, 0);
3111 assert_eq!(route.paths[0][3].cltv_expiry_delta, (8 << 4) | 1);
3112 // If we have a peer in the node map, we'll use their features here since we don't have
3113 // a way of figuring out their features from the invoice:
3114 assert_eq!(route.paths[0][3].node_features.le_flags(), &id_to_feature_flags(4));
3115 assert_eq!(route.paths[0][3].channel_features.le_flags(), &id_to_feature_flags(11));
3117 assert_eq!(route.paths[0][4].pubkey, nodes[6]);
3118 assert_eq!(route.paths[0][4].short_channel_id, 8);
3119 assert_eq!(route.paths[0][4].fee_msat, 100);
3120 assert_eq!(route.paths[0][4].cltv_expiry_delta, 42);
3121 assert_eq!(route.paths[0][4].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3122 assert_eq!(route.paths[0][4].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3125 /// Builds a trivial last-hop hint that passes through the two nodes given, with channel 0xff00
3127 fn multi_hop_last_hops_hint(hint_hops: [PublicKey; 2]) -> Vec<RouteHint> {
3128 let zero_fees = RoutingFees {
3130 proportional_millionths: 0,
3132 vec![RouteHint(vec![RouteHintHop {
3133 src_node_id: hint_hops[0],
3134 short_channel_id: 0xff00,
3137 proportional_millionths: 0,
3139 cltv_expiry_delta: (5 << 4) | 1,
3140 htlc_minimum_msat: None,
3141 htlc_maximum_msat: None,
3143 src_node_id: hint_hops[1],
3144 short_channel_id: 0xff01,
3146 cltv_expiry_delta: (8 << 4) | 1,
3147 htlc_minimum_msat: None,
3148 htlc_maximum_msat: None,
3153 fn multi_hint_last_hops_test() {
3154 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
3155 let (_, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
3156 let last_hops = multi_hop_last_hops_hint([nodes[2], nodes[3]]);
3157 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops.clone());
3158 let scorer = test_utils::TestScorer::with_penalty(0);
3159 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
3160 let random_seed_bytes = keys_manager.get_secure_random_bytes();
3161 // Test through channels 2, 3, 0xff00, 0xff01.
3162 // Test shows that multiple hop hints are considered.
3164 // Disabling channels 6 & 7 by flags=2
3165 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
3166 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3167 short_channel_id: 6,
3169 flags: 2, // to disable
3170 cltv_expiry_delta: 0,
3171 htlc_minimum_msat: 0,
3172 htlc_maximum_msat: OptionalField::Absent,
3174 fee_proportional_millionths: 0,
3175 excess_data: Vec::new()
3177 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
3178 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3179 short_channel_id: 7,
3181 flags: 2, // to disable
3182 cltv_expiry_delta: 0,
3183 htlc_minimum_msat: 0,
3184 htlc_maximum_msat: OptionalField::Absent,
3186 fee_proportional_millionths: 0,
3187 excess_data: Vec::new()
3190 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3191 assert_eq!(route.paths[0].len(), 4);
3193 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
3194 assert_eq!(route.paths[0][0].short_channel_id, 2);
3195 assert_eq!(route.paths[0][0].fee_msat, 200);
3196 assert_eq!(route.paths[0][0].cltv_expiry_delta, 65);
3197 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
3198 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
3200 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
3201 assert_eq!(route.paths[0][1].short_channel_id, 4);
3202 assert_eq!(route.paths[0][1].fee_msat, 100);
3203 assert_eq!(route.paths[0][1].cltv_expiry_delta, 81);
3204 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
3205 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
3207 assert_eq!(route.paths[0][2].pubkey, nodes[3]);
3208 assert_eq!(route.paths[0][2].short_channel_id, last_hops[0].0[0].short_channel_id);
3209 assert_eq!(route.paths[0][2].fee_msat, 0);
3210 assert_eq!(route.paths[0][2].cltv_expiry_delta, 129);
3211 assert_eq!(route.paths[0][2].node_features.le_flags(), &id_to_feature_flags(4));
3212 assert_eq!(route.paths[0][2].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3214 assert_eq!(route.paths[0][3].pubkey, nodes[6]);
3215 assert_eq!(route.paths[0][3].short_channel_id, last_hops[0].0[1].short_channel_id);
3216 assert_eq!(route.paths[0][3].fee_msat, 100);
3217 assert_eq!(route.paths[0][3].cltv_expiry_delta, 42);
3218 assert_eq!(route.paths[0][3].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3219 assert_eq!(route.paths[0][3].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3223 fn private_multi_hint_last_hops_test() {
3224 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
3225 let (_, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
3227 let non_announced_privkey = SecretKey::from_slice(&hex::decode(format!("{:02x}", 0xf0).repeat(32)).unwrap()[..]).unwrap();
3228 let non_announced_pubkey = PublicKey::from_secret_key(&secp_ctx, &non_announced_privkey);
3230 let last_hops = multi_hop_last_hops_hint([nodes[2], non_announced_pubkey]);
3231 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops.clone());
3232 let scorer = test_utils::TestScorer::with_penalty(0);
3233 // Test through channels 2, 3, 0xff00, 0xff01.
3234 // Test shows that multiple hop hints are considered.
3236 // Disabling channels 6 & 7 by flags=2
3237 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
3238 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3239 short_channel_id: 6,
3241 flags: 2, // to disable
3242 cltv_expiry_delta: 0,
3243 htlc_minimum_msat: 0,
3244 htlc_maximum_msat: OptionalField::Absent,
3246 fee_proportional_millionths: 0,
3247 excess_data: Vec::new()
3249 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
3250 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3251 short_channel_id: 7,
3253 flags: 2, // to disable
3254 cltv_expiry_delta: 0,
3255 htlc_minimum_msat: 0,
3256 htlc_maximum_msat: OptionalField::Absent,
3258 fee_proportional_millionths: 0,
3259 excess_data: Vec::new()
3262 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &[42u8; 32]).unwrap();
3263 assert_eq!(route.paths[0].len(), 4);
3265 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
3266 assert_eq!(route.paths[0][0].short_channel_id, 2);
3267 assert_eq!(route.paths[0][0].fee_msat, 200);
3268 assert_eq!(route.paths[0][0].cltv_expiry_delta, 65);
3269 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
3270 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
3272 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
3273 assert_eq!(route.paths[0][1].short_channel_id, 4);
3274 assert_eq!(route.paths[0][1].fee_msat, 100);
3275 assert_eq!(route.paths[0][1].cltv_expiry_delta, 81);
3276 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
3277 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
3279 assert_eq!(route.paths[0][2].pubkey, non_announced_pubkey);
3280 assert_eq!(route.paths[0][2].short_channel_id, last_hops[0].0[0].short_channel_id);
3281 assert_eq!(route.paths[0][2].fee_msat, 0);
3282 assert_eq!(route.paths[0][2].cltv_expiry_delta, 129);
3283 assert_eq!(route.paths[0][2].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3284 assert_eq!(route.paths[0][2].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3286 assert_eq!(route.paths[0][3].pubkey, nodes[6]);
3287 assert_eq!(route.paths[0][3].short_channel_id, last_hops[0].0[1].short_channel_id);
3288 assert_eq!(route.paths[0][3].fee_msat, 100);
3289 assert_eq!(route.paths[0][3].cltv_expiry_delta, 42);
3290 assert_eq!(route.paths[0][3].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3291 assert_eq!(route.paths[0][3].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3294 fn last_hops_with_public_channel(nodes: &Vec<PublicKey>) -> Vec<RouteHint> {
3295 let zero_fees = RoutingFees {
3297 proportional_millionths: 0,
3299 vec![RouteHint(vec![RouteHintHop {
3300 src_node_id: nodes[4],
3301 short_channel_id: 11,
3303 cltv_expiry_delta: (11 << 4) | 1,
3304 htlc_minimum_msat: None,
3305 htlc_maximum_msat: None,
3307 src_node_id: nodes[3],
3308 short_channel_id: 8,
3310 cltv_expiry_delta: (8 << 4) | 1,
3311 htlc_minimum_msat: None,
3312 htlc_maximum_msat: None,
3313 }]), RouteHint(vec![RouteHintHop {
3314 src_node_id: nodes[4],
3315 short_channel_id: 9,
3318 proportional_millionths: 0,
3320 cltv_expiry_delta: (9 << 4) | 1,
3321 htlc_minimum_msat: None,
3322 htlc_maximum_msat: None,
3323 }]), RouteHint(vec![RouteHintHop {
3324 src_node_id: nodes[5],
3325 short_channel_id: 10,
3327 cltv_expiry_delta: (10 << 4) | 1,
3328 htlc_minimum_msat: None,
3329 htlc_maximum_msat: None,
3334 fn last_hops_with_public_channel_test() {
3335 let (secp_ctx, network_graph, _, _, logger) = build_graph();
3336 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
3337 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops_with_public_channel(&nodes));
3338 let scorer = test_utils::TestScorer::with_penalty(0);
3339 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
3340 let random_seed_bytes = keys_manager.get_secure_random_bytes();
3341 // This test shows that public routes can be present in the invoice
3342 // which would be handled in the same manner.
3344 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3345 assert_eq!(route.paths[0].len(), 5);
3347 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
3348 assert_eq!(route.paths[0][0].short_channel_id, 2);
3349 assert_eq!(route.paths[0][0].fee_msat, 100);
3350 assert_eq!(route.paths[0][0].cltv_expiry_delta, (4 << 4) | 1);
3351 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
3352 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
3354 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
3355 assert_eq!(route.paths[0][1].short_channel_id, 4);
3356 assert_eq!(route.paths[0][1].fee_msat, 0);
3357 assert_eq!(route.paths[0][1].cltv_expiry_delta, (6 << 4) | 1);
3358 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
3359 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
3361 assert_eq!(route.paths[0][2].pubkey, nodes[4]);
3362 assert_eq!(route.paths[0][2].short_channel_id, 6);
3363 assert_eq!(route.paths[0][2].fee_msat, 0);
3364 assert_eq!(route.paths[0][2].cltv_expiry_delta, (11 << 4) | 1);
3365 assert_eq!(route.paths[0][2].node_features.le_flags(), &id_to_feature_flags(5));
3366 assert_eq!(route.paths[0][2].channel_features.le_flags(), &id_to_feature_flags(6));
3368 assert_eq!(route.paths[0][3].pubkey, nodes[3]);
3369 assert_eq!(route.paths[0][3].short_channel_id, 11);
3370 assert_eq!(route.paths[0][3].fee_msat, 0);
3371 assert_eq!(route.paths[0][3].cltv_expiry_delta, (8 << 4) | 1);
3372 // If we have a peer in the node map, we'll use their features here since we don't have
3373 // a way of figuring out their features from the invoice:
3374 assert_eq!(route.paths[0][3].node_features.le_flags(), &id_to_feature_flags(4));
3375 assert_eq!(route.paths[0][3].channel_features.le_flags(), &id_to_feature_flags(11));
3377 assert_eq!(route.paths[0][4].pubkey, nodes[6]);
3378 assert_eq!(route.paths[0][4].short_channel_id, 8);
3379 assert_eq!(route.paths[0][4].fee_msat, 100);
3380 assert_eq!(route.paths[0][4].cltv_expiry_delta, 42);
3381 assert_eq!(route.paths[0][4].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3382 assert_eq!(route.paths[0][4].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3386 fn our_chans_last_hop_connect_test() {
3387 let (secp_ctx, network_graph, _, _, logger) = build_graph();
3388 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
3389 let scorer = test_utils::TestScorer::with_penalty(0);
3390 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
3391 let random_seed_bytes = keys_manager.get_secure_random_bytes();
3393 // Simple test with outbound channel to 4 to test that last_hops and first_hops connect
3394 let our_chans = vec![get_channel_details(Some(42), nodes[3].clone(), InitFeatures::from_le_bytes(vec![0b11]), 250_000_000)];
3395 let mut last_hops = last_hops(&nodes);
3396 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops.clone());
3397 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&our_chans.iter().collect::<Vec<_>>()), 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3398 assert_eq!(route.paths[0].len(), 2);
3400 assert_eq!(route.paths[0][0].pubkey, nodes[3]);
3401 assert_eq!(route.paths[0][0].short_channel_id, 42);
3402 assert_eq!(route.paths[0][0].fee_msat, 0);
3403 assert_eq!(route.paths[0][0].cltv_expiry_delta, (8 << 4) | 1);
3404 assert_eq!(route.paths[0][0].node_features.le_flags(), &vec![0b11]);
3405 assert_eq!(route.paths[0][0].channel_features.le_flags(), &Vec::<u8>::new()); // No feature flags will meet the relevant-to-channel conversion
3407 assert_eq!(route.paths[0][1].pubkey, nodes[6]);
3408 assert_eq!(route.paths[0][1].short_channel_id, 8);
3409 assert_eq!(route.paths[0][1].fee_msat, 100);
3410 assert_eq!(route.paths[0][1].cltv_expiry_delta, 42);
3411 assert_eq!(route.paths[0][1].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3412 assert_eq!(route.paths[0][1].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3414 last_hops[0].0[0].fees.base_msat = 1000;
3416 // Revert to via 6 as the fee on 8 goes up
3417 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops);
3418 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3419 assert_eq!(route.paths[0].len(), 4);
3421 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
3422 assert_eq!(route.paths[0][0].short_channel_id, 2);
3423 assert_eq!(route.paths[0][0].fee_msat, 200); // fee increased as its % of value transferred across node
3424 assert_eq!(route.paths[0][0].cltv_expiry_delta, (4 << 4) | 1);
3425 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
3426 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
3428 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
3429 assert_eq!(route.paths[0][1].short_channel_id, 4);
3430 assert_eq!(route.paths[0][1].fee_msat, 100);
3431 assert_eq!(route.paths[0][1].cltv_expiry_delta, (7 << 4) | 1);
3432 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
3433 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
3435 assert_eq!(route.paths[0][2].pubkey, nodes[5]);
3436 assert_eq!(route.paths[0][2].short_channel_id, 7);
3437 assert_eq!(route.paths[0][2].fee_msat, 0);
3438 assert_eq!(route.paths[0][2].cltv_expiry_delta, (10 << 4) | 1);
3439 // If we have a peer in the node map, we'll use their features here since we don't have
3440 // a way of figuring out their features from the invoice:
3441 assert_eq!(route.paths[0][2].node_features.le_flags(), &id_to_feature_flags(6));
3442 assert_eq!(route.paths[0][2].channel_features.le_flags(), &id_to_feature_flags(7));
3444 assert_eq!(route.paths[0][3].pubkey, nodes[6]);
3445 assert_eq!(route.paths[0][3].short_channel_id, 10);
3446 assert_eq!(route.paths[0][3].fee_msat, 100);
3447 assert_eq!(route.paths[0][3].cltv_expiry_delta, 42);
3448 assert_eq!(route.paths[0][3].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3449 assert_eq!(route.paths[0][3].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3451 // ...but still use 8 for larger payments as 6 has a variable feerate
3452 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 2000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3453 assert_eq!(route.paths[0].len(), 5);
3455 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
3456 assert_eq!(route.paths[0][0].short_channel_id, 2);
3457 assert_eq!(route.paths[0][0].fee_msat, 3000);
3458 assert_eq!(route.paths[0][0].cltv_expiry_delta, (4 << 4) | 1);
3459 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(2));
3460 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(2));
3462 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
3463 assert_eq!(route.paths[0][1].short_channel_id, 4);
3464 assert_eq!(route.paths[0][1].fee_msat, 0);
3465 assert_eq!(route.paths[0][1].cltv_expiry_delta, (6 << 4) | 1);
3466 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
3467 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(4));
3469 assert_eq!(route.paths[0][2].pubkey, nodes[4]);
3470 assert_eq!(route.paths[0][2].short_channel_id, 6);
3471 assert_eq!(route.paths[0][2].fee_msat, 0);
3472 assert_eq!(route.paths[0][2].cltv_expiry_delta, (11 << 4) | 1);
3473 assert_eq!(route.paths[0][2].node_features.le_flags(), &id_to_feature_flags(5));
3474 assert_eq!(route.paths[0][2].channel_features.le_flags(), &id_to_feature_flags(6));
3476 assert_eq!(route.paths[0][3].pubkey, nodes[3]);
3477 assert_eq!(route.paths[0][3].short_channel_id, 11);
3478 assert_eq!(route.paths[0][3].fee_msat, 1000);
3479 assert_eq!(route.paths[0][3].cltv_expiry_delta, (8 << 4) | 1);
3480 // If we have a peer in the node map, we'll use their features here since we don't have
3481 // a way of figuring out their features from the invoice:
3482 assert_eq!(route.paths[0][3].node_features.le_flags(), &id_to_feature_flags(4));
3483 assert_eq!(route.paths[0][3].channel_features.le_flags(), &id_to_feature_flags(11));
3485 assert_eq!(route.paths[0][4].pubkey, nodes[6]);
3486 assert_eq!(route.paths[0][4].short_channel_id, 8);
3487 assert_eq!(route.paths[0][4].fee_msat, 2000);
3488 assert_eq!(route.paths[0][4].cltv_expiry_delta, 42);
3489 assert_eq!(route.paths[0][4].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3490 assert_eq!(route.paths[0][4].channel_features.le_flags(), &Vec::<u8>::new()); // We can't learn any flags from invoices, sadly
3493 fn do_unannounced_path_test(last_hop_htlc_max: Option<u64>, last_hop_fee_prop: u32, outbound_capacity_msat: u64, route_val: u64) -> Result<Route, LightningError> {
3494 let source_node_id = PublicKey::from_secret_key(&Secp256k1::new(), &SecretKey::from_slice(&hex::decode(format!("{:02}", 41).repeat(32)).unwrap()[..]).unwrap());
3495 let middle_node_id = PublicKey::from_secret_key(&Secp256k1::new(), &SecretKey::from_slice(&hex::decode(format!("{:02}", 42).repeat(32)).unwrap()[..]).unwrap());
3496 let target_node_id = PublicKey::from_secret_key(&Secp256k1::new(), &SecretKey::from_slice(&hex::decode(format!("{:02}", 43).repeat(32)).unwrap()[..]).unwrap());
3498 // If we specify a channel to a middle hop, that overrides our local channel view and that gets used
3499 let last_hops = RouteHint(vec![RouteHintHop {
3500 src_node_id: middle_node_id,
3501 short_channel_id: 8,
3504 proportional_millionths: last_hop_fee_prop,
3506 cltv_expiry_delta: (8 << 4) | 1,
3507 htlc_minimum_msat: None,
3508 htlc_maximum_msat: last_hop_htlc_max,
3510 let payment_params = PaymentParameters::from_node_id(target_node_id).with_route_hints(vec![last_hops]);
3511 let our_chans = vec![get_channel_details(Some(42), middle_node_id, InitFeatures::from_le_bytes(vec![0b11]), outbound_capacity_msat)];
3512 let scorer = test_utils::TestScorer::with_penalty(0);
3513 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
3514 let random_seed_bytes = keys_manager.get_secure_random_bytes();
3515 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
3516 let logger = test_utils::TestLogger::new();
3517 let network_graph = NetworkGraph::new(genesis_hash, &logger);
3518 let route = get_route(&source_node_id, &payment_params, &network_graph.read_only(),
3519 Some(&our_chans.iter().collect::<Vec<_>>()), route_val, 42, &logger, &scorer, &random_seed_bytes);
3524 fn unannounced_path_test() {
3525 // We should be able to send a payment to a destination without any help of a routing graph
3526 // if we have a channel with a common counterparty that appears in the first and last hop
3528 let route = do_unannounced_path_test(None, 1, 2000000, 1000000).unwrap();
3530 let middle_node_id = PublicKey::from_secret_key(&Secp256k1::new(), &SecretKey::from_slice(&hex::decode(format!("{:02}", 42).repeat(32)).unwrap()[..]).unwrap());
3531 let target_node_id = PublicKey::from_secret_key(&Secp256k1::new(), &SecretKey::from_slice(&hex::decode(format!("{:02}", 43).repeat(32)).unwrap()[..]).unwrap());
3532 assert_eq!(route.paths[0].len(), 2);
3534 assert_eq!(route.paths[0][0].pubkey, middle_node_id);
3535 assert_eq!(route.paths[0][0].short_channel_id, 42);
3536 assert_eq!(route.paths[0][0].fee_msat, 1001);
3537 assert_eq!(route.paths[0][0].cltv_expiry_delta, (8 << 4) | 1);
3538 assert_eq!(route.paths[0][0].node_features.le_flags(), &[0b11]);
3539 assert_eq!(route.paths[0][0].channel_features.le_flags(), &[0; 0]); // We can't learn any flags from invoices, sadly
3541 assert_eq!(route.paths[0][1].pubkey, target_node_id);
3542 assert_eq!(route.paths[0][1].short_channel_id, 8);
3543 assert_eq!(route.paths[0][1].fee_msat, 1000000);
3544 assert_eq!(route.paths[0][1].cltv_expiry_delta, 42);
3545 assert_eq!(route.paths[0][1].node_features.le_flags(), default_node_features().le_flags()); // We dont pass flags in from invoices yet
3546 assert_eq!(route.paths[0][1].channel_features.le_flags(), &[0; 0]); // We can't learn any flags from invoices, sadly
3550 fn overflow_unannounced_path_test_liquidity_underflow() {
3551 // Previously, when we had a last-hop hint connected directly to a first-hop channel, where
3552 // the last-hop had a fee which overflowed a u64, we'd panic.
3553 // This was due to us adding the first-hop from us unconditionally, causing us to think
3554 // we'd built a path (as our node is in the "best candidate" set), when we had not.
3555 // In this test, we previously hit a subtraction underflow due to having less available
3556 // liquidity at the last hop than 0.
3557 assert!(do_unannounced_path_test(Some(21_000_000_0000_0000_000), 0, 21_000_000_0000_0000_000, 21_000_000_0000_0000_000).is_err());
3561 fn overflow_unannounced_path_test_feerate_overflow() {
3562 // This tests for the same case as above, except instead of hitting a subtraction
3563 // underflow, we hit a case where the fee charged at a hop overflowed.
3564 assert!(do_unannounced_path_test(Some(21_000_000_0000_0000_000), 50000, 21_000_000_0000_0000_000, 21_000_000_0000_0000_000).is_err());
3568 fn available_amount_while_routing_test() {
3569 // Tests whether we choose the correct available channel amount while routing.
3571 let (secp_ctx, network_graph, mut gossip_sync, chain_monitor, logger) = build_graph();
3572 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
3573 let scorer = test_utils::TestScorer::with_penalty(0);
3574 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
3575 let random_seed_bytes = keys_manager.get_secure_random_bytes();
3576 let payment_params = PaymentParameters::from_node_id(nodes[2]).with_features(InvoiceFeatures::known());
3578 // We will use a simple single-path route from
3579 // our node to node2 via node0: channels {1, 3}.
3581 // First disable all other paths.
3582 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
3583 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3584 short_channel_id: 2,
3587 cltv_expiry_delta: 0,
3588 htlc_minimum_msat: 0,
3589 htlc_maximum_msat: OptionalField::Present(100_000),
3591 fee_proportional_millionths: 0,
3592 excess_data: Vec::new()
3594 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
3595 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3596 short_channel_id: 12,
3599 cltv_expiry_delta: 0,
3600 htlc_minimum_msat: 0,
3601 htlc_maximum_msat: OptionalField::Present(100_000),
3603 fee_proportional_millionths: 0,
3604 excess_data: Vec::new()
3607 // Make the first channel (#1) very permissive,
3608 // and we will be testing all limits on the second channel.
3609 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
3610 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3611 short_channel_id: 1,
3614 cltv_expiry_delta: 0,
3615 htlc_minimum_msat: 0,
3616 htlc_maximum_msat: OptionalField::Present(1_000_000_000),
3618 fee_proportional_millionths: 0,
3619 excess_data: Vec::new()
3622 // First, let's see if routing works if we have absolutely no idea about the available amount.
3623 // In this case, it should be set to 250_000 sats.
3624 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
3625 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3626 short_channel_id: 3,
3629 cltv_expiry_delta: 0,
3630 htlc_minimum_msat: 0,
3631 htlc_maximum_msat: OptionalField::Absent,
3633 fee_proportional_millionths: 0,
3634 excess_data: Vec::new()
3638 // Attempt to route more than available results in a failure.
3639 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
3640 &our_id, &payment_params, &network_graph.read_only(), None, 250_000_001, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
3641 assert_eq!(err, "Failed to find a sufficient route to the given destination");
3642 } else { panic!(); }
3646 // Now, attempt to route an exact amount we have should be fine.
3647 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 250_000_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3648 assert_eq!(route.paths.len(), 1);
3649 let path = route.paths.last().unwrap();
3650 assert_eq!(path.len(), 2);
3651 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
3652 assert_eq!(path.last().unwrap().fee_msat, 250_000_000);
3655 // Check that setting next_outbound_htlc_limit_msat in first_hops limits the channels.
3656 // Disable channel #1 and use another first hop.
3657 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
3658 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3659 short_channel_id: 1,
3662 cltv_expiry_delta: 0,
3663 htlc_minimum_msat: 0,
3664 htlc_maximum_msat: OptionalField::Present(1_000_000_000),
3666 fee_proportional_millionths: 0,
3667 excess_data: Vec::new()
3670 // Now, limit the first_hop by the next_outbound_htlc_limit_msat of 200_000 sats.
3671 let our_chans = vec![get_channel_details(Some(42), nodes[0].clone(), InitFeatures::from_le_bytes(vec![0b11]), 200_000_000)];
3674 // Attempt to route more than available results in a failure.
3675 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
3676 &our_id, &payment_params, &network_graph.read_only(), Some(&our_chans.iter().collect::<Vec<_>>()), 200_000_001, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
3677 assert_eq!(err, "Failed to find a sufficient route to the given destination");
3678 } else { panic!(); }
3682 // Now, attempt to route an exact amount we have should be fine.
3683 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&our_chans.iter().collect::<Vec<_>>()), 200_000_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3684 assert_eq!(route.paths.len(), 1);
3685 let path = route.paths.last().unwrap();
3686 assert_eq!(path.len(), 2);
3687 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
3688 assert_eq!(path.last().unwrap().fee_msat, 200_000_000);
3691 // Enable channel #1 back.
3692 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
3693 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3694 short_channel_id: 1,
3697 cltv_expiry_delta: 0,
3698 htlc_minimum_msat: 0,
3699 htlc_maximum_msat: OptionalField::Present(1_000_000_000),
3701 fee_proportional_millionths: 0,
3702 excess_data: Vec::new()
3706 // Now let's see if routing works if we know only htlc_maximum_msat.
3707 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
3708 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3709 short_channel_id: 3,
3712 cltv_expiry_delta: 0,
3713 htlc_minimum_msat: 0,
3714 htlc_maximum_msat: OptionalField::Present(15_000),
3716 fee_proportional_millionths: 0,
3717 excess_data: Vec::new()
3721 // Attempt to route more than available results in a failure.
3722 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
3723 &our_id, &payment_params, &network_graph.read_only(), None, 15_001, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
3724 assert_eq!(err, "Failed to find a sufficient route to the given destination");
3725 } else { panic!(); }
3729 // Now, attempt to route an exact amount we have should be fine.
3730 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 15_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3731 assert_eq!(route.paths.len(), 1);
3732 let path = route.paths.last().unwrap();
3733 assert_eq!(path.len(), 2);
3734 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
3735 assert_eq!(path.last().unwrap().fee_msat, 15_000);
3738 // Now let's see if routing works if we know only capacity from the UTXO.
3740 // We can't change UTXO capacity on the fly, so we'll disable
3741 // the existing channel and add another one with the capacity we need.
3742 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
3743 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3744 short_channel_id: 3,
3747 cltv_expiry_delta: 0,
3748 htlc_minimum_msat: 0,
3749 htlc_maximum_msat: OptionalField::Absent,
3751 fee_proportional_millionths: 0,
3752 excess_data: Vec::new()
3755 let good_script = Builder::new().push_opcode(opcodes::all::OP_PUSHNUM_2)
3756 .push_slice(&PublicKey::from_secret_key(&secp_ctx, &privkeys[0]).serialize())
3757 .push_slice(&PublicKey::from_secret_key(&secp_ctx, &privkeys[2]).serialize())
3758 .push_opcode(opcodes::all::OP_PUSHNUM_2)
3759 .push_opcode(opcodes::all::OP_CHECKMULTISIG).into_script().to_v0_p2wsh();
3761 *chain_monitor.utxo_ret.lock().unwrap() = Ok(TxOut { value: 15, script_pubkey: good_script.clone() });
3762 gossip_sync.add_chain_access(Some(chain_monitor));
3764 add_channel(&gossip_sync, &secp_ctx, &privkeys[0], &privkeys[2], ChannelFeatures::from_le_bytes(id_to_feature_flags(3)), 333);
3765 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
3766 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3767 short_channel_id: 333,
3770 cltv_expiry_delta: (3 << 4) | 1,
3771 htlc_minimum_msat: 0,
3772 htlc_maximum_msat: OptionalField::Absent,
3774 fee_proportional_millionths: 0,
3775 excess_data: Vec::new()
3777 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
3778 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3779 short_channel_id: 333,
3782 cltv_expiry_delta: (3 << 4) | 2,
3783 htlc_minimum_msat: 0,
3784 htlc_maximum_msat: OptionalField::Absent,
3786 fee_proportional_millionths: 0,
3787 excess_data: Vec::new()
3791 // Attempt to route more than available results in a failure.
3792 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
3793 &our_id, &payment_params, &network_graph.read_only(), None, 15_001, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
3794 assert_eq!(err, "Failed to find a sufficient route to the given destination");
3795 } else { panic!(); }
3799 // Now, attempt to route an exact amount we have should be fine.
3800 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 15_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3801 assert_eq!(route.paths.len(), 1);
3802 let path = route.paths.last().unwrap();
3803 assert_eq!(path.len(), 2);
3804 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
3805 assert_eq!(path.last().unwrap().fee_msat, 15_000);
3808 // Now let's see if routing chooses htlc_maximum_msat over UTXO capacity.
3809 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
3810 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3811 short_channel_id: 333,
3814 cltv_expiry_delta: 0,
3815 htlc_minimum_msat: 0,
3816 htlc_maximum_msat: OptionalField::Present(10_000),
3818 fee_proportional_millionths: 0,
3819 excess_data: Vec::new()
3823 // Attempt to route more than available results in a failure.
3824 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
3825 &our_id, &payment_params, &network_graph.read_only(), None, 10_001, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
3826 assert_eq!(err, "Failed to find a sufficient route to the given destination");
3827 } else { panic!(); }
3831 // Now, attempt to route an exact amount we have should be fine.
3832 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 10_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3833 assert_eq!(route.paths.len(), 1);
3834 let path = route.paths.last().unwrap();
3835 assert_eq!(path.len(), 2);
3836 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
3837 assert_eq!(path.last().unwrap().fee_msat, 10_000);
3842 fn available_liquidity_last_hop_test() {
3843 // Check that available liquidity properly limits the path even when only
3844 // one of the latter hops is limited.
3845 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
3846 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
3847 let scorer = test_utils::TestScorer::with_penalty(0);
3848 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
3849 let random_seed_bytes = keys_manager.get_secure_random_bytes();
3850 let payment_params = PaymentParameters::from_node_id(nodes[3]).with_features(InvoiceFeatures::known());
3852 // Path via {node7, node2, node4} is channels {12, 13, 6, 11}.
3853 // {12, 13, 11} have the capacities of 100, {6} has a capacity of 50.
3854 // Total capacity: 50 sats.
3856 // Disable other potential paths.
3857 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
3858 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3859 short_channel_id: 2,
3862 cltv_expiry_delta: 0,
3863 htlc_minimum_msat: 0,
3864 htlc_maximum_msat: OptionalField::Present(100_000),
3866 fee_proportional_millionths: 0,
3867 excess_data: Vec::new()
3869 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
3870 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3871 short_channel_id: 7,
3874 cltv_expiry_delta: 0,
3875 htlc_minimum_msat: 0,
3876 htlc_maximum_msat: OptionalField::Present(100_000),
3878 fee_proportional_millionths: 0,
3879 excess_data: Vec::new()
3884 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
3885 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3886 short_channel_id: 12,
3889 cltv_expiry_delta: 0,
3890 htlc_minimum_msat: 0,
3891 htlc_maximum_msat: OptionalField::Present(100_000),
3893 fee_proportional_millionths: 0,
3894 excess_data: Vec::new()
3896 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
3897 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3898 short_channel_id: 13,
3901 cltv_expiry_delta: 0,
3902 htlc_minimum_msat: 0,
3903 htlc_maximum_msat: OptionalField::Present(100_000),
3905 fee_proportional_millionths: 0,
3906 excess_data: Vec::new()
3909 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
3910 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3911 short_channel_id: 6,
3914 cltv_expiry_delta: 0,
3915 htlc_minimum_msat: 0,
3916 htlc_maximum_msat: OptionalField::Present(50_000),
3918 fee_proportional_millionths: 0,
3919 excess_data: Vec::new()
3921 update_channel(&gossip_sync, &secp_ctx, &privkeys[4], UnsignedChannelUpdate {
3922 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3923 short_channel_id: 11,
3926 cltv_expiry_delta: 0,
3927 htlc_minimum_msat: 0,
3928 htlc_maximum_msat: OptionalField::Present(100_000),
3930 fee_proportional_millionths: 0,
3931 excess_data: Vec::new()
3934 // Attempt to route more than available results in a failure.
3935 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
3936 &our_id, &payment_params, &network_graph.read_only(), None, 60_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
3937 assert_eq!(err, "Failed to find a sufficient route to the given destination");
3938 } else { panic!(); }
3942 // Now, attempt to route 49 sats (just a bit below the capacity).
3943 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 49_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3944 assert_eq!(route.paths.len(), 1);
3945 let mut total_amount_paid_msat = 0;
3946 for path in &route.paths {
3947 assert_eq!(path.len(), 4);
3948 assert_eq!(path.last().unwrap().pubkey, nodes[3]);
3949 total_amount_paid_msat += path.last().unwrap().fee_msat;
3951 assert_eq!(total_amount_paid_msat, 49_000);
3955 // Attempt to route an exact amount is also fine
3956 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 50_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
3957 assert_eq!(route.paths.len(), 1);
3958 let mut total_amount_paid_msat = 0;
3959 for path in &route.paths {
3960 assert_eq!(path.len(), 4);
3961 assert_eq!(path.last().unwrap().pubkey, nodes[3]);
3962 total_amount_paid_msat += path.last().unwrap().fee_msat;
3964 assert_eq!(total_amount_paid_msat, 50_000);
3969 fn ignore_fee_first_hop_test() {
3970 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
3971 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
3972 let scorer = test_utils::TestScorer::with_penalty(0);
3973 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
3974 let random_seed_bytes = keys_manager.get_secure_random_bytes();
3975 let payment_params = PaymentParameters::from_node_id(nodes[2]);
3977 // Path via node0 is channels {1, 3}. Limit them to 100 and 50 sats (total limit 50).
3978 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
3979 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3980 short_channel_id: 1,
3983 cltv_expiry_delta: 0,
3984 htlc_minimum_msat: 0,
3985 htlc_maximum_msat: OptionalField::Present(100_000),
3986 fee_base_msat: 1_000_000,
3987 fee_proportional_millionths: 0,
3988 excess_data: Vec::new()
3990 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
3991 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
3992 short_channel_id: 3,
3995 cltv_expiry_delta: 0,
3996 htlc_minimum_msat: 0,
3997 htlc_maximum_msat: OptionalField::Present(50_000),
3999 fee_proportional_millionths: 0,
4000 excess_data: Vec::new()
4004 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 50_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4005 assert_eq!(route.paths.len(), 1);
4006 let mut total_amount_paid_msat = 0;
4007 for path in &route.paths {
4008 assert_eq!(path.len(), 2);
4009 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
4010 total_amount_paid_msat += path.last().unwrap().fee_msat;
4012 assert_eq!(total_amount_paid_msat, 50_000);
4017 fn simple_mpp_route_test() {
4018 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
4019 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
4020 let scorer = test_utils::TestScorer::with_penalty(0);
4021 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
4022 let random_seed_bytes = keys_manager.get_secure_random_bytes();
4023 let payment_params = PaymentParameters::from_node_id(nodes[2])
4024 .with_features(InvoiceFeatures::known());
4026 // We need a route consisting of 3 paths:
4027 // From our node to node2 via node0, node7, node1 (three paths one hop each).
4028 // To achieve this, the amount being transferred should be around
4029 // the total capacity of these 3 paths.
4031 // First, we set limits on these (previously unlimited) channels.
4032 // Their aggregate capacity will be 50 + 60 + 180 = 290 sats.
4034 // Path via node0 is channels {1, 3}. Limit them to 100 and 50 sats (total limit 50).
4035 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4036 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4037 short_channel_id: 1,
4040 cltv_expiry_delta: 0,
4041 htlc_minimum_msat: 0,
4042 htlc_maximum_msat: OptionalField::Present(100_000),
4044 fee_proportional_millionths: 0,
4045 excess_data: Vec::new()
4047 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
4048 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4049 short_channel_id: 3,
4052 cltv_expiry_delta: 0,
4053 htlc_minimum_msat: 0,
4054 htlc_maximum_msat: OptionalField::Present(50_000),
4056 fee_proportional_millionths: 0,
4057 excess_data: Vec::new()
4060 // Path via node7 is channels {12, 13}. Limit them to 60 and 60 sats
4061 // (total limit 60).
4062 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4063 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4064 short_channel_id: 12,
4067 cltv_expiry_delta: 0,
4068 htlc_minimum_msat: 0,
4069 htlc_maximum_msat: OptionalField::Present(60_000),
4071 fee_proportional_millionths: 0,
4072 excess_data: Vec::new()
4074 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
4075 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4076 short_channel_id: 13,
4079 cltv_expiry_delta: 0,
4080 htlc_minimum_msat: 0,
4081 htlc_maximum_msat: OptionalField::Present(60_000),
4083 fee_proportional_millionths: 0,
4084 excess_data: Vec::new()
4087 // Path via node1 is channels {2, 4}. Limit them to 200 and 180 sats
4088 // (total capacity 180 sats).
4089 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4090 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4091 short_channel_id: 2,
4094 cltv_expiry_delta: 0,
4095 htlc_minimum_msat: 0,
4096 htlc_maximum_msat: OptionalField::Present(200_000),
4098 fee_proportional_millionths: 0,
4099 excess_data: Vec::new()
4101 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
4102 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4103 short_channel_id: 4,
4106 cltv_expiry_delta: 0,
4107 htlc_minimum_msat: 0,
4108 htlc_maximum_msat: OptionalField::Present(180_000),
4110 fee_proportional_millionths: 0,
4111 excess_data: Vec::new()
4115 // Attempt to route more than available results in a failure.
4116 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
4117 &our_id, &payment_params, &network_graph.read_only(), None, 300_000, 42,
4118 Arc::clone(&logger), &scorer, &random_seed_bytes) {
4119 assert_eq!(err, "Failed to find a sufficient route to the given destination");
4120 } else { panic!(); }
4124 // Attempt to route while setting max_path_count to 0 results in a failure.
4125 let zero_payment_params = payment_params.clone().with_max_path_count(0);
4126 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
4127 &our_id, &zero_payment_params, &network_graph.read_only(), None, 100, 42,
4128 Arc::clone(&logger), &scorer, &random_seed_bytes) {
4129 assert_eq!(err, "Can't find a route with no paths allowed.");
4130 } else { panic!(); }
4134 // Attempt to route while setting max_path_count to 3 results in a failure.
4135 // This is the case because the minimal_value_contribution_msat would require each path
4136 // to account for 1/3 of the total value, which is violated by 2 out of 3 paths.
4137 let fail_payment_params = payment_params.clone().with_max_path_count(3);
4138 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
4139 &our_id, &fail_payment_params, &network_graph.read_only(), None, 250_000, 42,
4140 Arc::clone(&logger), &scorer, &random_seed_bytes) {
4141 assert_eq!(err, "Failed to find a sufficient route to the given destination");
4142 } else { panic!(); }
4146 // Now, attempt to route 250 sats (just a bit below the capacity).
4147 // Our algorithm should provide us with these 3 paths.
4148 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None,
4149 250_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4150 assert_eq!(route.paths.len(), 3);
4151 let mut total_amount_paid_msat = 0;
4152 for path in &route.paths {
4153 assert_eq!(path.len(), 2);
4154 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
4155 total_amount_paid_msat += path.last().unwrap().fee_msat;
4157 assert_eq!(total_amount_paid_msat, 250_000);
4161 // Attempt to route an exact amount is also fine
4162 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None,
4163 290_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4164 assert_eq!(route.paths.len(), 3);
4165 let mut total_amount_paid_msat = 0;
4166 for path in &route.paths {
4167 assert_eq!(path.len(), 2);
4168 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
4169 total_amount_paid_msat += path.last().unwrap().fee_msat;
4171 assert_eq!(total_amount_paid_msat, 290_000);
4176 fn long_mpp_route_test() {
4177 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
4178 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
4179 let scorer = test_utils::TestScorer::with_penalty(0);
4180 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
4181 let random_seed_bytes = keys_manager.get_secure_random_bytes();
4182 let payment_params = PaymentParameters::from_node_id(nodes[3]).with_features(InvoiceFeatures::known());
4184 // We need a route consisting of 3 paths:
4185 // From our node to node3 via {node0, node2}, {node7, node2, node4} and {node7, node2}.
4186 // Note that these paths overlap (channels 5, 12, 13).
4187 // We will route 300 sats.
4188 // Each path will have 100 sats capacity, those channels which
4189 // are used twice will have 200 sats capacity.
4191 // Disable other potential paths.
4192 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4193 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4194 short_channel_id: 2,
4197 cltv_expiry_delta: 0,
4198 htlc_minimum_msat: 0,
4199 htlc_maximum_msat: OptionalField::Present(100_000),
4201 fee_proportional_millionths: 0,
4202 excess_data: Vec::new()
4204 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4205 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4206 short_channel_id: 7,
4209 cltv_expiry_delta: 0,
4210 htlc_minimum_msat: 0,
4211 htlc_maximum_msat: OptionalField::Present(100_000),
4213 fee_proportional_millionths: 0,
4214 excess_data: Vec::new()
4217 // Path via {node0, node2} is channels {1, 3, 5}.
4218 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4219 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4220 short_channel_id: 1,
4223 cltv_expiry_delta: 0,
4224 htlc_minimum_msat: 0,
4225 htlc_maximum_msat: OptionalField::Present(100_000),
4227 fee_proportional_millionths: 0,
4228 excess_data: Vec::new()
4230 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
4231 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4232 short_channel_id: 3,
4235 cltv_expiry_delta: 0,
4236 htlc_minimum_msat: 0,
4237 htlc_maximum_msat: OptionalField::Present(100_000),
4239 fee_proportional_millionths: 0,
4240 excess_data: Vec::new()
4243 // Capacity of 200 sats because this channel will be used by 3rd path as well.
4244 add_channel(&gossip_sync, &secp_ctx, &privkeys[2], &privkeys[3], ChannelFeatures::from_le_bytes(id_to_feature_flags(5)), 5);
4245 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4246 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4247 short_channel_id: 5,
4250 cltv_expiry_delta: 0,
4251 htlc_minimum_msat: 0,
4252 htlc_maximum_msat: OptionalField::Present(200_000),
4254 fee_proportional_millionths: 0,
4255 excess_data: Vec::new()
4258 // Path via {node7, node2, node4} is channels {12, 13, 6, 11}.
4259 // Add 100 sats to the capacities of {12, 13}, because these channels
4260 // are also used for 3rd path. 100 sats for the rest. Total capacity: 100 sats.
4261 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4262 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4263 short_channel_id: 12,
4266 cltv_expiry_delta: 0,
4267 htlc_minimum_msat: 0,
4268 htlc_maximum_msat: OptionalField::Present(200_000),
4270 fee_proportional_millionths: 0,
4271 excess_data: Vec::new()
4273 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
4274 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4275 short_channel_id: 13,
4278 cltv_expiry_delta: 0,
4279 htlc_minimum_msat: 0,
4280 htlc_maximum_msat: OptionalField::Present(200_000),
4282 fee_proportional_millionths: 0,
4283 excess_data: Vec::new()
4286 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4287 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4288 short_channel_id: 6,
4291 cltv_expiry_delta: 0,
4292 htlc_minimum_msat: 0,
4293 htlc_maximum_msat: OptionalField::Present(100_000),
4295 fee_proportional_millionths: 0,
4296 excess_data: Vec::new()
4298 update_channel(&gossip_sync, &secp_ctx, &privkeys[4], UnsignedChannelUpdate {
4299 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4300 short_channel_id: 11,
4303 cltv_expiry_delta: 0,
4304 htlc_minimum_msat: 0,
4305 htlc_maximum_msat: OptionalField::Present(100_000),
4307 fee_proportional_millionths: 0,
4308 excess_data: Vec::new()
4311 // Path via {node7, node2} is channels {12, 13, 5}.
4312 // We already limited them to 200 sats (they are used twice for 100 sats).
4313 // Nothing to do here.
4316 // Attempt to route more than available results in a failure.
4317 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
4318 &our_id, &payment_params, &network_graph.read_only(), None, 350_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
4319 assert_eq!(err, "Failed to find a sufficient route to the given destination");
4320 } else { panic!(); }
4324 // Now, attempt to route 300 sats (exact amount we can route).
4325 // Our algorithm should provide us with these 3 paths, 100 sats each.
4326 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 300_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4327 assert_eq!(route.paths.len(), 3);
4329 let mut total_amount_paid_msat = 0;
4330 for path in &route.paths {
4331 assert_eq!(path.last().unwrap().pubkey, nodes[3]);
4332 total_amount_paid_msat += path.last().unwrap().fee_msat;
4334 assert_eq!(total_amount_paid_msat, 300_000);
4340 fn mpp_cheaper_route_test() {
4341 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
4342 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
4343 let scorer = test_utils::TestScorer::with_penalty(0);
4344 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
4345 let random_seed_bytes = keys_manager.get_secure_random_bytes();
4346 let payment_params = PaymentParameters::from_node_id(nodes[3]).with_features(InvoiceFeatures::known());
4348 // This test checks that if we have two cheaper paths and one more expensive path,
4349 // so that liquidity-wise any 2 of 3 combination is sufficient,
4350 // two cheaper paths will be taken.
4351 // These paths have equal available liquidity.
4353 // We need a combination of 3 paths:
4354 // From our node to node3 via {node0, node2}, {node7, node2, node4} and {node7, node2}.
4355 // Note that these paths overlap (channels 5, 12, 13).
4356 // Each path will have 100 sats capacity, those channels which
4357 // are used twice will have 200 sats capacity.
4359 // Disable other potential paths.
4360 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4361 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4362 short_channel_id: 2,
4365 cltv_expiry_delta: 0,
4366 htlc_minimum_msat: 0,
4367 htlc_maximum_msat: OptionalField::Present(100_000),
4369 fee_proportional_millionths: 0,
4370 excess_data: Vec::new()
4372 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4373 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4374 short_channel_id: 7,
4377 cltv_expiry_delta: 0,
4378 htlc_minimum_msat: 0,
4379 htlc_maximum_msat: OptionalField::Present(100_000),
4381 fee_proportional_millionths: 0,
4382 excess_data: Vec::new()
4385 // Path via {node0, node2} is channels {1, 3, 5}.
4386 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4387 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4388 short_channel_id: 1,
4391 cltv_expiry_delta: 0,
4392 htlc_minimum_msat: 0,
4393 htlc_maximum_msat: OptionalField::Present(100_000),
4395 fee_proportional_millionths: 0,
4396 excess_data: Vec::new()
4398 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
4399 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4400 short_channel_id: 3,
4403 cltv_expiry_delta: 0,
4404 htlc_minimum_msat: 0,
4405 htlc_maximum_msat: OptionalField::Present(100_000),
4407 fee_proportional_millionths: 0,
4408 excess_data: Vec::new()
4411 // Capacity of 200 sats because this channel will be used by 3rd path as well.
4412 add_channel(&gossip_sync, &secp_ctx, &privkeys[2], &privkeys[3], ChannelFeatures::from_le_bytes(id_to_feature_flags(5)), 5);
4413 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4414 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4415 short_channel_id: 5,
4418 cltv_expiry_delta: 0,
4419 htlc_minimum_msat: 0,
4420 htlc_maximum_msat: OptionalField::Present(200_000),
4422 fee_proportional_millionths: 0,
4423 excess_data: Vec::new()
4426 // Path via {node7, node2, node4} is channels {12, 13, 6, 11}.
4427 // Add 100 sats to the capacities of {12, 13}, because these channels
4428 // are also used for 3rd path. 100 sats for the rest. Total capacity: 100 sats.
4429 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4430 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4431 short_channel_id: 12,
4434 cltv_expiry_delta: 0,
4435 htlc_minimum_msat: 0,
4436 htlc_maximum_msat: OptionalField::Present(200_000),
4438 fee_proportional_millionths: 0,
4439 excess_data: Vec::new()
4441 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
4442 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4443 short_channel_id: 13,
4446 cltv_expiry_delta: 0,
4447 htlc_minimum_msat: 0,
4448 htlc_maximum_msat: OptionalField::Present(200_000),
4450 fee_proportional_millionths: 0,
4451 excess_data: Vec::new()
4454 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4455 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4456 short_channel_id: 6,
4459 cltv_expiry_delta: 0,
4460 htlc_minimum_msat: 0,
4461 htlc_maximum_msat: OptionalField::Present(100_000),
4462 fee_base_msat: 1_000,
4463 fee_proportional_millionths: 0,
4464 excess_data: Vec::new()
4466 update_channel(&gossip_sync, &secp_ctx, &privkeys[4], UnsignedChannelUpdate {
4467 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4468 short_channel_id: 11,
4471 cltv_expiry_delta: 0,
4472 htlc_minimum_msat: 0,
4473 htlc_maximum_msat: OptionalField::Present(100_000),
4475 fee_proportional_millionths: 0,
4476 excess_data: Vec::new()
4479 // Path via {node7, node2} is channels {12, 13, 5}.
4480 // We already limited them to 200 sats (they are used twice for 100 sats).
4481 // Nothing to do here.
4484 // Now, attempt to route 180 sats.
4485 // Our algorithm should provide us with these 2 paths.
4486 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 180_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4487 assert_eq!(route.paths.len(), 2);
4489 let mut total_value_transferred_msat = 0;
4490 let mut total_paid_msat = 0;
4491 for path in &route.paths {
4492 assert_eq!(path.last().unwrap().pubkey, nodes[3]);
4493 total_value_transferred_msat += path.last().unwrap().fee_msat;
4495 total_paid_msat += hop.fee_msat;
4498 // If we paid fee, this would be higher.
4499 assert_eq!(total_value_transferred_msat, 180_000);
4500 let total_fees_paid = total_paid_msat - total_value_transferred_msat;
4501 assert_eq!(total_fees_paid, 0);
4506 fn fees_on_mpp_route_test() {
4507 // This test makes sure that MPP algorithm properly takes into account
4508 // fees charged on the channels, by making the fees impactful:
4509 // if the fee is not properly accounted for, the behavior is different.
4510 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
4511 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
4512 let scorer = test_utils::TestScorer::with_penalty(0);
4513 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
4514 let random_seed_bytes = keys_manager.get_secure_random_bytes();
4515 let payment_params = PaymentParameters::from_node_id(nodes[3]).with_features(InvoiceFeatures::known());
4517 // We need a route consisting of 2 paths:
4518 // From our node to node3 via {node0, node2} and {node7, node2, node4}.
4519 // We will route 200 sats, Each path will have 100 sats capacity.
4521 // This test is not particularly stable: e.g.,
4522 // there's a way to route via {node0, node2, node4}.
4523 // It works while pathfinding is deterministic, but can be broken otherwise.
4524 // It's fine to ignore this concern for now.
4526 // Disable other potential paths.
4527 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4528 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4529 short_channel_id: 2,
4532 cltv_expiry_delta: 0,
4533 htlc_minimum_msat: 0,
4534 htlc_maximum_msat: OptionalField::Present(100_000),
4536 fee_proportional_millionths: 0,
4537 excess_data: Vec::new()
4540 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4541 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4542 short_channel_id: 7,
4545 cltv_expiry_delta: 0,
4546 htlc_minimum_msat: 0,
4547 htlc_maximum_msat: OptionalField::Present(100_000),
4549 fee_proportional_millionths: 0,
4550 excess_data: Vec::new()
4553 // Path via {node0, node2} is channels {1, 3, 5}.
4554 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4555 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4556 short_channel_id: 1,
4559 cltv_expiry_delta: 0,
4560 htlc_minimum_msat: 0,
4561 htlc_maximum_msat: OptionalField::Present(100_000),
4563 fee_proportional_millionths: 0,
4564 excess_data: Vec::new()
4566 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
4567 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4568 short_channel_id: 3,
4571 cltv_expiry_delta: 0,
4572 htlc_minimum_msat: 0,
4573 htlc_maximum_msat: OptionalField::Present(100_000),
4575 fee_proportional_millionths: 0,
4576 excess_data: Vec::new()
4579 add_channel(&gossip_sync, &secp_ctx, &privkeys[2], &privkeys[3], ChannelFeatures::from_le_bytes(id_to_feature_flags(5)), 5);
4580 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4581 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4582 short_channel_id: 5,
4585 cltv_expiry_delta: 0,
4586 htlc_minimum_msat: 0,
4587 htlc_maximum_msat: OptionalField::Present(100_000),
4589 fee_proportional_millionths: 0,
4590 excess_data: Vec::new()
4593 // Path via {node7, node2, node4} is channels {12, 13, 6, 11}.
4594 // All channels should be 100 sats capacity. But for the fee experiment,
4595 // we'll add absolute fee of 150 sats paid for the use channel 6 (paid to node2 on channel 13).
4596 // Since channel 12 allows to deliver only 250 sats to channel 13, channel 13 can transfer only
4597 // 100 sats (and pay 150 sats in fees for the use of channel 6),
4598 // so no matter how large are other channels,
4599 // the whole path will be limited by 100 sats with just these 2 conditions:
4600 // - channel 12 capacity is 250 sats
4601 // - fee for channel 6 is 150 sats
4602 // Let's test this by enforcing these 2 conditions and removing other limits.
4603 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4604 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4605 short_channel_id: 12,
4608 cltv_expiry_delta: 0,
4609 htlc_minimum_msat: 0,
4610 htlc_maximum_msat: OptionalField::Present(250_000),
4612 fee_proportional_millionths: 0,
4613 excess_data: Vec::new()
4615 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
4616 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4617 short_channel_id: 13,
4620 cltv_expiry_delta: 0,
4621 htlc_minimum_msat: 0,
4622 htlc_maximum_msat: OptionalField::Absent,
4624 fee_proportional_millionths: 0,
4625 excess_data: Vec::new()
4628 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
4629 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4630 short_channel_id: 6,
4633 cltv_expiry_delta: 0,
4634 htlc_minimum_msat: 0,
4635 htlc_maximum_msat: OptionalField::Absent,
4636 fee_base_msat: 150_000,
4637 fee_proportional_millionths: 0,
4638 excess_data: Vec::new()
4640 update_channel(&gossip_sync, &secp_ctx, &privkeys[4], UnsignedChannelUpdate {
4641 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4642 short_channel_id: 11,
4645 cltv_expiry_delta: 0,
4646 htlc_minimum_msat: 0,
4647 htlc_maximum_msat: OptionalField::Absent,
4649 fee_proportional_millionths: 0,
4650 excess_data: Vec::new()
4654 // Attempt to route more than available results in a failure.
4655 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
4656 &our_id, &payment_params, &network_graph.read_only(), None, 210_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
4657 assert_eq!(err, "Failed to find a sufficient route to the given destination");
4658 } else { panic!(); }
4662 // Now, attempt to route 200 sats (exact amount we can route).
4663 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 200_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4664 assert_eq!(route.paths.len(), 2);
4666 let mut total_amount_paid_msat = 0;
4667 for path in &route.paths {
4668 assert_eq!(path.last().unwrap().pubkey, nodes[3]);
4669 total_amount_paid_msat += path.last().unwrap().fee_msat;
4671 assert_eq!(total_amount_paid_msat, 200_000);
4672 assert_eq!(route.get_total_fees(), 150_000);
4677 fn mpp_with_last_hops() {
4678 // Previously, if we tried to send an MPP payment to a destination which was only reachable
4679 // via a single last-hop route hint, we'd fail to route if we first collected routes
4680 // totaling close but not quite enough to fund the full payment.
4682 // This was because we considered last-hop hints to have exactly the sought payment amount
4683 // instead of the amount we were trying to collect, needlessly limiting our path searching
4684 // at the very first hop.
4686 // Specifically, this interacted with our "all paths must fund at least 5% of total target"
4687 // criterion to cause us to refuse all routes at the last hop hint which would be considered
4688 // to only have the remaining to-collect amount in available liquidity.
4690 // This bug appeared in production in some specific channel configurations.
4691 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
4692 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
4693 let scorer = test_utils::TestScorer::with_penalty(0);
4694 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
4695 let random_seed_bytes = keys_manager.get_secure_random_bytes();
4696 let payment_params = PaymentParameters::from_node_id(PublicKey::from_slice(&[02; 33]).unwrap()).with_features(InvoiceFeatures::known())
4697 .with_route_hints(vec![RouteHint(vec![RouteHintHop {
4698 src_node_id: nodes[2],
4699 short_channel_id: 42,
4700 fees: RoutingFees { base_msat: 0, proportional_millionths: 0 },
4701 cltv_expiry_delta: 42,
4702 htlc_minimum_msat: None,
4703 htlc_maximum_msat: None,
4706 // Keep only two paths from us to nodes[2], both with a 99sat HTLC maximum, with one with
4707 // no fee and one with a 1msat fee. Previously, trying to route 100 sats to nodes[2] here
4708 // would first use the no-fee route and then fail to find a path along the second route as
4709 // we think we can only send up to 1 additional sat over the last-hop but refuse to as its
4710 // under 5% of our payment amount.
4711 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4712 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4713 short_channel_id: 1,
4716 cltv_expiry_delta: (5 << 4) | 5,
4717 htlc_minimum_msat: 0,
4718 htlc_maximum_msat: OptionalField::Present(99_000),
4719 fee_base_msat: u32::max_value(),
4720 fee_proportional_millionths: u32::max_value(),
4721 excess_data: Vec::new()
4723 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4724 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4725 short_channel_id: 2,
4728 cltv_expiry_delta: (5 << 4) | 3,
4729 htlc_minimum_msat: 0,
4730 htlc_maximum_msat: OptionalField::Present(99_000),
4731 fee_base_msat: u32::max_value(),
4732 fee_proportional_millionths: u32::max_value(),
4733 excess_data: Vec::new()
4735 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
4736 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4737 short_channel_id: 4,
4740 cltv_expiry_delta: (4 << 4) | 1,
4741 htlc_minimum_msat: 0,
4742 htlc_maximum_msat: OptionalField::Absent,
4744 fee_proportional_millionths: 0,
4745 excess_data: Vec::new()
4747 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
4748 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4749 short_channel_id: 13,
4751 flags: 0|2, // Channel disabled
4752 cltv_expiry_delta: (13 << 4) | 1,
4753 htlc_minimum_msat: 0,
4754 htlc_maximum_msat: OptionalField::Absent,
4756 fee_proportional_millionths: 2000000,
4757 excess_data: Vec::new()
4760 // Get a route for 100 sats and check that we found the MPP route no problem and didn't
4762 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4763 assert_eq!(route.paths.len(), 2);
4764 // Paths are somewhat randomly ordered, but:
4765 // * the first is channel 2 (1 msat fee) -> channel 4 -> channel 42
4766 // * the second is channel 1 (0 fee, but 99 sat maximum) -> channel 3 -> channel 42
4767 assert_eq!(route.paths[0][0].short_channel_id, 2);
4768 assert_eq!(route.paths[0][0].fee_msat, 1);
4769 assert_eq!(route.paths[0][2].fee_msat, 1_000);
4770 assert_eq!(route.paths[1][0].short_channel_id, 1);
4771 assert_eq!(route.paths[1][0].fee_msat, 0);
4772 assert_eq!(route.paths[1][2].fee_msat, 99_000);
4773 assert_eq!(route.get_total_fees(), 1);
4774 assert_eq!(route.get_total_amount(), 100_000);
4778 fn drop_lowest_channel_mpp_route_test() {
4779 // This test checks that low-capacity channel is dropped when after
4780 // path finding we realize that we found more capacity than we need.
4781 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
4782 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
4783 let scorer = test_utils::TestScorer::with_penalty(0);
4784 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
4785 let random_seed_bytes = keys_manager.get_secure_random_bytes();
4786 let payment_params = PaymentParameters::from_node_id(nodes[2]).with_features(InvoiceFeatures::known());
4788 // We need a route consisting of 3 paths:
4789 // From our node to node2 via node0, node7, node1 (three paths one hop each).
4791 // The first and the second paths should be sufficient, but the third should be
4792 // cheaper, so that we select it but drop later.
4794 // First, we set limits on these (previously unlimited) channels.
4795 // Their aggregate capacity will be 50 + 60 + 20 = 130 sats.
4797 // Path via node0 is channels {1, 3}. Limit them to 100 and 50 sats (total limit 50);
4798 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4799 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4800 short_channel_id: 1,
4803 cltv_expiry_delta: 0,
4804 htlc_minimum_msat: 0,
4805 htlc_maximum_msat: OptionalField::Present(100_000),
4807 fee_proportional_millionths: 0,
4808 excess_data: Vec::new()
4810 update_channel(&gossip_sync, &secp_ctx, &privkeys[0], UnsignedChannelUpdate {
4811 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4812 short_channel_id: 3,
4815 cltv_expiry_delta: 0,
4816 htlc_minimum_msat: 0,
4817 htlc_maximum_msat: OptionalField::Present(50_000),
4819 fee_proportional_millionths: 0,
4820 excess_data: Vec::new()
4823 // Path via node7 is channels {12, 13}. Limit them to 60 and 60 sats (total limit 60);
4824 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4825 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4826 short_channel_id: 12,
4829 cltv_expiry_delta: 0,
4830 htlc_minimum_msat: 0,
4831 htlc_maximum_msat: OptionalField::Present(60_000),
4833 fee_proportional_millionths: 0,
4834 excess_data: Vec::new()
4836 update_channel(&gossip_sync, &secp_ctx, &privkeys[7], UnsignedChannelUpdate {
4837 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4838 short_channel_id: 13,
4841 cltv_expiry_delta: 0,
4842 htlc_minimum_msat: 0,
4843 htlc_maximum_msat: OptionalField::Present(60_000),
4845 fee_proportional_millionths: 0,
4846 excess_data: Vec::new()
4849 // Path via node1 is channels {2, 4}. Limit them to 20 and 20 sats (total capacity 20 sats).
4850 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4851 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4852 short_channel_id: 2,
4855 cltv_expiry_delta: 0,
4856 htlc_minimum_msat: 0,
4857 htlc_maximum_msat: OptionalField::Present(20_000),
4859 fee_proportional_millionths: 0,
4860 excess_data: Vec::new()
4862 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
4863 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4864 short_channel_id: 4,
4867 cltv_expiry_delta: 0,
4868 htlc_minimum_msat: 0,
4869 htlc_maximum_msat: OptionalField::Present(20_000),
4871 fee_proportional_millionths: 0,
4872 excess_data: Vec::new()
4876 // Attempt to route more than available results in a failure.
4877 if let Err(LightningError{err, action: ErrorAction::IgnoreError}) = get_route(
4878 &our_id, &payment_params, &network_graph.read_only(), None, 150_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes) {
4879 assert_eq!(err, "Failed to find a sufficient route to the given destination");
4880 } else { panic!(); }
4884 // Now, attempt to route 125 sats (just a bit below the capacity of 3 channels).
4885 // Our algorithm should provide us with these 3 paths.
4886 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 125_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4887 assert_eq!(route.paths.len(), 3);
4888 let mut total_amount_paid_msat = 0;
4889 for path in &route.paths {
4890 assert_eq!(path.len(), 2);
4891 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
4892 total_amount_paid_msat += path.last().unwrap().fee_msat;
4894 assert_eq!(total_amount_paid_msat, 125_000);
4898 // Attempt to route without the last small cheap channel
4899 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 90_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
4900 assert_eq!(route.paths.len(), 2);
4901 let mut total_amount_paid_msat = 0;
4902 for path in &route.paths {
4903 assert_eq!(path.len(), 2);
4904 assert_eq!(path.last().unwrap().pubkey, nodes[2]);
4905 total_amount_paid_msat += path.last().unwrap().fee_msat;
4907 assert_eq!(total_amount_paid_msat, 90_000);
4912 fn min_criteria_consistency() {
4913 // Test that we don't use an inconsistent metric between updating and walking nodes during
4914 // our Dijkstra's pass. In the initial version of MPP, the "best source" for a given node
4915 // was updated with a different criterion from the heap sorting, resulting in loops in
4916 // calculated paths. We test for that specific case here.
4918 // We construct a network that looks like this:
4920 // node2 -1(3)2- node3
4924 // node1 -1(5)2- node4 -1(1)2- node6
4930 // We create a loop on the side of our real path - our destination is node 6, with a
4931 // previous hop of node 4. From 4, the cheapest previous path is channel 2 from node 2,
4932 // followed by node 3 over channel 3. Thereafter, the cheapest next-hop is back to node 4
4933 // (this time over channel 4). Channel 4 has 0 htlc_minimum_msat whereas channel 1 (the
4934 // other channel with a previous-hop of node 4) has a high (but irrelevant to the overall
4935 // payment) htlc_minimum_msat. In the original algorithm, this resulted in node4's
4936 // "previous hop" being set to node 3, creating a loop in the path.
4937 let secp_ctx = Secp256k1::new();
4938 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
4939 let logger = Arc::new(test_utils::TestLogger::new());
4940 let network = Arc::new(NetworkGraph::new(genesis_hash, Arc::clone(&logger)));
4941 let gossip_sync = P2PGossipSync::new(Arc::clone(&network), None, Arc::clone(&logger));
4942 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
4943 let scorer = test_utils::TestScorer::with_penalty(0);
4944 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
4945 let random_seed_bytes = keys_manager.get_secure_random_bytes();
4946 let payment_params = PaymentParameters::from_node_id(nodes[6]);
4948 add_channel(&gossip_sync, &secp_ctx, &our_privkey, &privkeys[1], ChannelFeatures::from_le_bytes(id_to_feature_flags(6)), 6);
4949 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
4950 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4951 short_channel_id: 6,
4954 cltv_expiry_delta: (6 << 4) | 0,
4955 htlc_minimum_msat: 0,
4956 htlc_maximum_msat: OptionalField::Absent,
4958 fee_proportional_millionths: 0,
4959 excess_data: Vec::new()
4961 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[1], NodeFeatures::from_le_bytes(id_to_feature_flags(1)), 0);
4963 add_channel(&gossip_sync, &secp_ctx, &privkeys[1], &privkeys[4], ChannelFeatures::from_le_bytes(id_to_feature_flags(5)), 5);
4964 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
4965 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4966 short_channel_id: 5,
4969 cltv_expiry_delta: (5 << 4) | 0,
4970 htlc_minimum_msat: 0,
4971 htlc_maximum_msat: OptionalField::Absent,
4973 fee_proportional_millionths: 0,
4974 excess_data: Vec::new()
4976 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[4], NodeFeatures::from_le_bytes(id_to_feature_flags(4)), 0);
4978 add_channel(&gossip_sync, &secp_ctx, &privkeys[4], &privkeys[3], ChannelFeatures::from_le_bytes(id_to_feature_flags(4)), 4);
4979 update_channel(&gossip_sync, &secp_ctx, &privkeys[4], UnsignedChannelUpdate {
4980 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4981 short_channel_id: 4,
4984 cltv_expiry_delta: (4 << 4) | 0,
4985 htlc_minimum_msat: 0,
4986 htlc_maximum_msat: OptionalField::Absent,
4988 fee_proportional_millionths: 0,
4989 excess_data: Vec::new()
4991 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[3], NodeFeatures::from_le_bytes(id_to_feature_flags(3)), 0);
4993 add_channel(&gossip_sync, &secp_ctx, &privkeys[3], &privkeys[2], ChannelFeatures::from_le_bytes(id_to_feature_flags(3)), 3);
4994 update_channel(&gossip_sync, &secp_ctx, &privkeys[3], UnsignedChannelUpdate {
4995 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
4996 short_channel_id: 3,
4999 cltv_expiry_delta: (3 << 4) | 0,
5000 htlc_minimum_msat: 0,
5001 htlc_maximum_msat: OptionalField::Absent,
5003 fee_proportional_millionths: 0,
5004 excess_data: Vec::new()
5006 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[2], NodeFeatures::from_le_bytes(id_to_feature_flags(2)), 0);
5008 add_channel(&gossip_sync, &secp_ctx, &privkeys[2], &privkeys[4], ChannelFeatures::from_le_bytes(id_to_feature_flags(2)), 2);
5009 update_channel(&gossip_sync, &secp_ctx, &privkeys[2], UnsignedChannelUpdate {
5010 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
5011 short_channel_id: 2,
5014 cltv_expiry_delta: (2 << 4) | 0,
5015 htlc_minimum_msat: 0,
5016 htlc_maximum_msat: OptionalField::Absent,
5018 fee_proportional_millionths: 0,
5019 excess_data: Vec::new()
5022 add_channel(&gossip_sync, &secp_ctx, &privkeys[4], &privkeys[6], ChannelFeatures::from_le_bytes(id_to_feature_flags(1)), 1);
5023 update_channel(&gossip_sync, &secp_ctx, &privkeys[4], UnsignedChannelUpdate {
5024 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
5025 short_channel_id: 1,
5028 cltv_expiry_delta: (1 << 4) | 0,
5029 htlc_minimum_msat: 100,
5030 htlc_maximum_msat: OptionalField::Absent,
5032 fee_proportional_millionths: 0,
5033 excess_data: Vec::new()
5035 add_or_update_node(&gossip_sync, &secp_ctx, &privkeys[6], NodeFeatures::from_le_bytes(id_to_feature_flags(6)), 0);
5038 // Now ensure the route flows simply over nodes 1 and 4 to 6.
5039 let route = get_route(&our_id, &payment_params, &network.read_only(), None, 10_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5040 assert_eq!(route.paths.len(), 1);
5041 assert_eq!(route.paths[0].len(), 3);
5043 assert_eq!(route.paths[0][0].pubkey, nodes[1]);
5044 assert_eq!(route.paths[0][0].short_channel_id, 6);
5045 assert_eq!(route.paths[0][0].fee_msat, 100);
5046 assert_eq!(route.paths[0][0].cltv_expiry_delta, (5 << 4) | 0);
5047 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(1));
5048 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(6));
5050 assert_eq!(route.paths[0][1].pubkey, nodes[4]);
5051 assert_eq!(route.paths[0][1].short_channel_id, 5);
5052 assert_eq!(route.paths[0][1].fee_msat, 0);
5053 assert_eq!(route.paths[0][1].cltv_expiry_delta, (1 << 4) | 0);
5054 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(4));
5055 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(5));
5057 assert_eq!(route.paths[0][2].pubkey, nodes[6]);
5058 assert_eq!(route.paths[0][2].short_channel_id, 1);
5059 assert_eq!(route.paths[0][2].fee_msat, 10_000);
5060 assert_eq!(route.paths[0][2].cltv_expiry_delta, 42);
5061 assert_eq!(route.paths[0][2].node_features.le_flags(), &id_to_feature_flags(6));
5062 assert_eq!(route.paths[0][2].channel_features.le_flags(), &id_to_feature_flags(1));
5068 fn exact_fee_liquidity_limit() {
5069 // Test that if, while walking the graph, we find a hop that has exactly enough liquidity
5070 // for us, including later hop fees, we take it. In the first version of our MPP algorithm
5071 // we calculated fees on a higher value, resulting in us ignoring such paths.
5072 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
5073 let (our_privkey, our_id, _, nodes) = get_nodes(&secp_ctx);
5074 let scorer = test_utils::TestScorer::with_penalty(0);
5075 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5076 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5077 let payment_params = PaymentParameters::from_node_id(nodes[2]);
5079 // We modify the graph to set the htlc_maximum of channel 2 to below the value we wish to
5081 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
5082 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
5083 short_channel_id: 2,
5086 cltv_expiry_delta: 0,
5087 htlc_minimum_msat: 0,
5088 htlc_maximum_msat: OptionalField::Present(85_000),
5090 fee_proportional_millionths: 0,
5091 excess_data: Vec::new()
5094 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
5095 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
5096 short_channel_id: 12,
5099 cltv_expiry_delta: (4 << 4) | 1,
5100 htlc_minimum_msat: 0,
5101 htlc_maximum_msat: OptionalField::Present(270_000),
5103 fee_proportional_millionths: 1000000,
5104 excess_data: Vec::new()
5108 // Now, attempt to route 90 sats, which is exactly 90 sats at the last hop, plus the
5109 // 200% fee charged channel 13 in the 1-to-2 direction.
5110 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 90_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5111 assert_eq!(route.paths.len(), 1);
5112 assert_eq!(route.paths[0].len(), 2);
5114 assert_eq!(route.paths[0][0].pubkey, nodes[7]);
5115 assert_eq!(route.paths[0][0].short_channel_id, 12);
5116 assert_eq!(route.paths[0][0].fee_msat, 90_000*2);
5117 assert_eq!(route.paths[0][0].cltv_expiry_delta, (13 << 4) | 1);
5118 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(8));
5119 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(12));
5121 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
5122 assert_eq!(route.paths[0][1].short_channel_id, 13);
5123 assert_eq!(route.paths[0][1].fee_msat, 90_000);
5124 assert_eq!(route.paths[0][1].cltv_expiry_delta, 42);
5125 assert_eq!(route.paths[0][1].node_features.le_flags(), &id_to_feature_flags(3));
5126 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(13));
5131 fn htlc_max_reduction_below_min() {
5132 // Test that if, while walking the graph, we reduce the value being sent to meet an
5133 // htlc_maximum_msat, we don't end up undershooting a later htlc_minimum_msat. In the
5134 // initial version of MPP we'd accept such routes but reject them while recalculating fees,
5135 // resulting in us thinking there is no possible path, even if other paths exist.
5136 let (secp_ctx, network_graph, gossip_sync, _, logger) = build_graph();
5137 let (our_privkey, our_id, privkeys, nodes) = get_nodes(&secp_ctx);
5138 let scorer = test_utils::TestScorer::with_penalty(0);
5139 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5140 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5141 let payment_params = PaymentParameters::from_node_id(nodes[2]).with_features(InvoiceFeatures::known());
5143 // We modify the graph to set the htlc_minimum of channel 2 and 4 as needed - channel 2
5144 // gets an htlc_maximum_msat of 80_000 and channel 4 an htlc_minimum_msat of 90_000. We
5145 // then try to send 90_000.
5146 update_channel(&gossip_sync, &secp_ctx, &our_privkey, UnsignedChannelUpdate {
5147 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
5148 short_channel_id: 2,
5151 cltv_expiry_delta: 0,
5152 htlc_minimum_msat: 0,
5153 htlc_maximum_msat: OptionalField::Present(80_000),
5155 fee_proportional_millionths: 0,
5156 excess_data: Vec::new()
5158 update_channel(&gossip_sync, &secp_ctx, &privkeys[1], UnsignedChannelUpdate {
5159 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
5160 short_channel_id: 4,
5163 cltv_expiry_delta: (4 << 4) | 1,
5164 htlc_minimum_msat: 90_000,
5165 htlc_maximum_msat: OptionalField::Absent,
5167 fee_proportional_millionths: 0,
5168 excess_data: Vec::new()
5172 // Now, attempt to route 90 sats, hitting the htlc_minimum on channel 4, but
5173 // overshooting the htlc_maximum on channel 2. Thus, we should pick the (absurdly
5174 // expensive) channels 12-13 path.
5175 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 90_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5176 assert_eq!(route.paths.len(), 1);
5177 assert_eq!(route.paths[0].len(), 2);
5179 assert_eq!(route.paths[0][0].pubkey, nodes[7]);
5180 assert_eq!(route.paths[0][0].short_channel_id, 12);
5181 assert_eq!(route.paths[0][0].fee_msat, 90_000*2);
5182 assert_eq!(route.paths[0][0].cltv_expiry_delta, (13 << 4) | 1);
5183 assert_eq!(route.paths[0][0].node_features.le_flags(), &id_to_feature_flags(8));
5184 assert_eq!(route.paths[0][0].channel_features.le_flags(), &id_to_feature_flags(12));
5186 assert_eq!(route.paths[0][1].pubkey, nodes[2]);
5187 assert_eq!(route.paths[0][1].short_channel_id, 13);
5188 assert_eq!(route.paths[0][1].fee_msat, 90_000);
5189 assert_eq!(route.paths[0][1].cltv_expiry_delta, 42);
5190 assert_eq!(route.paths[0][1].node_features.le_flags(), InvoiceFeatures::known().le_flags());
5191 assert_eq!(route.paths[0][1].channel_features.le_flags(), &id_to_feature_flags(13));
5196 fn multiple_direct_first_hops() {
5197 // Previously we'd only ever considered one first hop path per counterparty.
5198 // However, as we don't restrict users to one channel per peer, we really need to support
5199 // looking at all first hop paths.
5200 // Here we test that we do not ignore all-but-the-last first hop paths per counterparty (as
5201 // we used to do by overwriting the `first_hop_targets` hashmap entry) and that we can MPP
5202 // route over multiple channels with the same first hop.
5203 let secp_ctx = Secp256k1::new();
5204 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5205 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
5206 let logger = Arc::new(test_utils::TestLogger::new());
5207 let network_graph = NetworkGraph::new(genesis_hash, Arc::clone(&logger));
5208 let scorer = test_utils::TestScorer::with_penalty(0);
5209 let payment_params = PaymentParameters::from_node_id(nodes[0]).with_features(InvoiceFeatures::known());
5210 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5211 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5214 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&[
5215 &get_channel_details(Some(3), nodes[0], InitFeatures::known(), 200_000),
5216 &get_channel_details(Some(2), nodes[0], InitFeatures::known(), 10_000),
5217 ]), 100_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5218 assert_eq!(route.paths.len(), 1);
5219 assert_eq!(route.paths[0].len(), 1);
5221 assert_eq!(route.paths[0][0].pubkey, nodes[0]);
5222 assert_eq!(route.paths[0][0].short_channel_id, 3);
5223 assert_eq!(route.paths[0][0].fee_msat, 100_000);
5226 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&[
5227 &get_channel_details(Some(3), nodes[0], InitFeatures::known(), 50_000),
5228 &get_channel_details(Some(2), nodes[0], InitFeatures::known(), 50_000),
5229 ]), 100_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5230 assert_eq!(route.paths.len(), 2);
5231 assert_eq!(route.paths[0].len(), 1);
5232 assert_eq!(route.paths[1].len(), 1);
5234 assert_eq!(route.paths[0][0].pubkey, nodes[0]);
5235 assert_eq!(route.paths[0][0].short_channel_id, 3);
5236 assert_eq!(route.paths[0][0].fee_msat, 50_000);
5238 assert_eq!(route.paths[1][0].pubkey, nodes[0]);
5239 assert_eq!(route.paths[1][0].short_channel_id, 2);
5240 assert_eq!(route.paths[1][0].fee_msat, 50_000);
5244 // If we have a bunch of outbound channels to the same node, where most are not
5245 // sufficient to pay the full payment, but one is, we should default to just using the
5246 // one single channel that has sufficient balance, avoiding MPP.
5248 // If we have several options above the 3xpayment value threshold, we should pick the
5249 // smallest of them, avoiding further fragmenting our available outbound balance to
5251 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), Some(&[
5252 &get_channel_details(Some(2), nodes[0], InitFeatures::known(), 50_000),
5253 &get_channel_details(Some(3), nodes[0], InitFeatures::known(), 50_000),
5254 &get_channel_details(Some(5), nodes[0], InitFeatures::known(), 50_000),
5255 &get_channel_details(Some(6), nodes[0], InitFeatures::known(), 300_000),
5256 &get_channel_details(Some(7), nodes[0], InitFeatures::known(), 50_000),
5257 &get_channel_details(Some(8), nodes[0], InitFeatures::known(), 50_000),
5258 &get_channel_details(Some(9), nodes[0], InitFeatures::known(), 50_000),
5259 &get_channel_details(Some(4), nodes[0], InitFeatures::known(), 1_000_000),
5260 ]), 100_000, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5261 assert_eq!(route.paths.len(), 1);
5262 assert_eq!(route.paths[0].len(), 1);
5264 assert_eq!(route.paths[0][0].pubkey, nodes[0]);
5265 assert_eq!(route.paths[0][0].short_channel_id, 6);
5266 assert_eq!(route.paths[0][0].fee_msat, 100_000);
5271 fn prefers_shorter_route_with_higher_fees() {
5272 let (secp_ctx, network_graph, _, _, logger) = build_graph();
5273 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5274 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops(&nodes));
5276 // Without penalizing each hop 100 msats, a longer path with lower fees is chosen.
5277 let scorer = test_utils::TestScorer::with_penalty(0);
5278 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5279 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5280 let route = get_route(
5281 &our_id, &payment_params, &network_graph.read_only(), None, 100, 42,
5282 Arc::clone(&logger), &scorer, &random_seed_bytes
5284 let path = route.paths[0].iter().map(|hop| hop.short_channel_id).collect::<Vec<_>>();
5286 assert_eq!(route.get_total_fees(), 100);
5287 assert_eq!(route.get_total_amount(), 100);
5288 assert_eq!(path, vec![2, 4, 6, 11, 8]);
5290 // Applying a 100 msat penalty to each hop results in taking channels 7 and 10 to nodes[6]
5291 // from nodes[2] rather than channel 6, 11, and 8, even though the longer path is cheaper.
5292 let scorer = test_utils::TestScorer::with_penalty(100);
5293 let route = get_route(
5294 &our_id, &payment_params, &network_graph.read_only(), None, 100, 42,
5295 Arc::clone(&logger), &scorer, &random_seed_bytes
5297 let path = route.paths[0].iter().map(|hop| hop.short_channel_id).collect::<Vec<_>>();
5299 assert_eq!(route.get_total_fees(), 300);
5300 assert_eq!(route.get_total_amount(), 100);
5301 assert_eq!(path, vec![2, 4, 7, 10]);
5304 struct BadChannelScorer {
5305 short_channel_id: u64,
5309 impl Writeable for BadChannelScorer {
5310 fn write<W: Writer>(&self, _w: &mut W) -> Result<(), ::io::Error> { unimplemented!() }
5312 impl Score for BadChannelScorer {
5313 fn channel_penalty_msat(&self, short_channel_id: u64, _: &NodeId, _: &NodeId, _: ChannelUsage) -> u64 {
5314 if short_channel_id == self.short_channel_id { u64::max_value() } else { 0 }
5317 fn payment_path_failed(&mut self, _path: &[&RouteHop], _short_channel_id: u64) {}
5318 fn payment_path_successful(&mut self, _path: &[&RouteHop]) {}
5321 struct BadNodeScorer {
5326 impl Writeable for BadNodeScorer {
5327 fn write<W: Writer>(&self, _w: &mut W) -> Result<(), ::io::Error> { unimplemented!() }
5330 impl Score for BadNodeScorer {
5331 fn channel_penalty_msat(&self, _: u64, _: &NodeId, target: &NodeId, _: ChannelUsage) -> u64 {
5332 if *target == self.node_id { u64::max_value() } else { 0 }
5335 fn payment_path_failed(&mut self, _path: &[&RouteHop], _short_channel_id: u64) {}
5336 fn payment_path_successful(&mut self, _path: &[&RouteHop]) {}
5340 fn avoids_routing_through_bad_channels_and_nodes() {
5341 let (secp_ctx, network, _, _, logger) = build_graph();
5342 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5343 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops(&nodes));
5344 let network_graph = network.read_only();
5346 // A path to nodes[6] exists when no penalties are applied to any channel.
5347 let scorer = test_utils::TestScorer::with_penalty(0);
5348 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5349 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5350 let route = get_route(
5351 &our_id, &payment_params, &network_graph, None, 100, 42,
5352 Arc::clone(&logger), &scorer, &random_seed_bytes
5354 let path = route.paths[0].iter().map(|hop| hop.short_channel_id).collect::<Vec<_>>();
5356 assert_eq!(route.get_total_fees(), 100);
5357 assert_eq!(route.get_total_amount(), 100);
5358 assert_eq!(path, vec![2, 4, 6, 11, 8]);
5360 // A different path to nodes[6] exists if channel 6 cannot be routed over.
5361 let scorer = BadChannelScorer { short_channel_id: 6 };
5362 let route = get_route(
5363 &our_id, &payment_params, &network_graph, None, 100, 42,
5364 Arc::clone(&logger), &scorer, &random_seed_bytes
5366 let path = route.paths[0].iter().map(|hop| hop.short_channel_id).collect::<Vec<_>>();
5368 assert_eq!(route.get_total_fees(), 300);
5369 assert_eq!(route.get_total_amount(), 100);
5370 assert_eq!(path, vec![2, 4, 7, 10]);
5372 // A path to nodes[6] does not exist if nodes[2] cannot be routed through.
5373 let scorer = BadNodeScorer { node_id: NodeId::from_pubkey(&nodes[2]) };
5375 &our_id, &payment_params, &network_graph, None, 100, 42,
5376 Arc::clone(&logger), &scorer, &random_seed_bytes
5378 Err(LightningError { err, .. } ) => {
5379 assert_eq!(err, "Failed to find a path to the given destination");
5381 Ok(_) => panic!("Expected error"),
5386 fn total_fees_single_path() {
5390 pubkey: PublicKey::from_slice(&hex::decode("02eec7245d6b7d2ccb30380bfbe2a3648cd7a942653f5aa340edcea1f283686619").unwrap()[..]).unwrap(),
5391 channel_features: ChannelFeatures::empty(), node_features: NodeFeatures::empty(),
5392 short_channel_id: 0, fee_msat: 100, cltv_expiry_delta: 0
5395 pubkey: PublicKey::from_slice(&hex::decode("0324653eac434488002cc06bbfb7f10fe18991e35f9fe4302dbea6d2353dc0ab1c").unwrap()[..]).unwrap(),
5396 channel_features: ChannelFeatures::empty(), node_features: NodeFeatures::empty(),
5397 short_channel_id: 0, fee_msat: 150, cltv_expiry_delta: 0
5400 pubkey: PublicKey::from_slice(&hex::decode("027f31ebc5462c1fdce1b737ecff52d37d75dea43ce11c74d25aa297165faa2007").unwrap()[..]).unwrap(),
5401 channel_features: ChannelFeatures::empty(), node_features: NodeFeatures::empty(),
5402 short_channel_id: 0, fee_msat: 225, cltv_expiry_delta: 0
5405 payment_params: None,
5408 assert_eq!(route.get_total_fees(), 250);
5409 assert_eq!(route.get_total_amount(), 225);
5413 fn total_fees_multi_path() {
5417 pubkey: PublicKey::from_slice(&hex::decode("02eec7245d6b7d2ccb30380bfbe2a3648cd7a942653f5aa340edcea1f283686619").unwrap()[..]).unwrap(),
5418 channel_features: ChannelFeatures::empty(), node_features: NodeFeatures::empty(),
5419 short_channel_id: 0, fee_msat: 100, cltv_expiry_delta: 0
5422 pubkey: PublicKey::from_slice(&hex::decode("0324653eac434488002cc06bbfb7f10fe18991e35f9fe4302dbea6d2353dc0ab1c").unwrap()[..]).unwrap(),
5423 channel_features: ChannelFeatures::empty(), node_features: NodeFeatures::empty(),
5424 short_channel_id: 0, fee_msat: 150, cltv_expiry_delta: 0
5428 pubkey: PublicKey::from_slice(&hex::decode("02eec7245d6b7d2ccb30380bfbe2a3648cd7a942653f5aa340edcea1f283686619").unwrap()[..]).unwrap(),
5429 channel_features: ChannelFeatures::empty(), node_features: NodeFeatures::empty(),
5430 short_channel_id: 0, fee_msat: 100, cltv_expiry_delta: 0
5433 pubkey: PublicKey::from_slice(&hex::decode("0324653eac434488002cc06bbfb7f10fe18991e35f9fe4302dbea6d2353dc0ab1c").unwrap()[..]).unwrap(),
5434 channel_features: ChannelFeatures::empty(), node_features: NodeFeatures::empty(),
5435 short_channel_id: 0, fee_msat: 150, cltv_expiry_delta: 0
5438 payment_params: None,
5441 assert_eq!(route.get_total_fees(), 200);
5442 assert_eq!(route.get_total_amount(), 300);
5446 fn total_empty_route_no_panic() {
5447 // In an earlier version of `Route::get_total_fees` and `Route::get_total_amount`, they
5448 // would both panic if the route was completely empty. We test to ensure they return 0
5449 // here, even though its somewhat nonsensical as a route.
5450 let route = Route { paths: Vec::new(), payment_params: None };
5452 assert_eq!(route.get_total_fees(), 0);
5453 assert_eq!(route.get_total_amount(), 0);
5457 fn limits_total_cltv_delta() {
5458 let (secp_ctx, network, _, _, logger) = build_graph();
5459 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5460 let network_graph = network.read_only();
5462 let scorer = test_utils::TestScorer::with_penalty(0);
5464 // Make sure that generally there is at least one route available
5465 let feasible_max_total_cltv_delta = 1008;
5466 let feasible_payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops(&nodes))
5467 .with_max_total_cltv_expiry_delta(feasible_max_total_cltv_delta);
5468 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5469 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5470 let route = get_route(&our_id, &feasible_payment_params, &network_graph, None, 100, 0, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5471 let path = route.paths[0].iter().map(|hop| hop.short_channel_id).collect::<Vec<_>>();
5472 assert_ne!(path.len(), 0);
5474 // But not if we exclude all paths on the basis of their accumulated CLTV delta
5475 let fail_max_total_cltv_delta = 23;
5476 let fail_payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops(&nodes))
5477 .with_max_total_cltv_expiry_delta(fail_max_total_cltv_delta);
5478 match get_route(&our_id, &fail_payment_params, &network_graph, None, 100, 0, Arc::clone(&logger), &scorer, &random_seed_bytes)
5480 Err(LightningError { err, .. } ) => {
5481 assert_eq!(err, "Failed to find a path to the given destination");
5483 Ok(_) => panic!("Expected error"),
5488 fn limits_path_length() {
5489 let (secp_ctx, network, _, _, logger) = build_line_graph();
5490 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5491 let network_graph = network.read_only();
5493 let scorer = test_utils::TestScorer::with_penalty(0);
5494 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5495 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5497 // First check we can actually create a long route on this graph.
5498 let feasible_payment_params = PaymentParameters::from_node_id(nodes[18]);
5499 let route = get_route(&our_id, &feasible_payment_params, &network_graph, None, 100, 0,
5500 Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5501 let path = route.paths[0].iter().map(|hop| hop.short_channel_id).collect::<Vec<_>>();
5502 assert!(path.len() == MAX_PATH_LENGTH_ESTIMATE.into());
5504 // But we can't create a path surpassing the MAX_PATH_LENGTH_ESTIMATE limit.
5505 let fail_payment_params = PaymentParameters::from_node_id(nodes[19]);
5506 match get_route(&our_id, &fail_payment_params, &network_graph, None, 100, 0,
5507 Arc::clone(&logger), &scorer, &random_seed_bytes)
5509 Err(LightningError { err, .. } ) => {
5510 assert_eq!(err, "Failed to find a path to the given destination");
5512 Ok(_) => panic!("Expected error"),
5517 fn adds_and_limits_cltv_offset() {
5518 let (secp_ctx, network_graph, _, _, logger) = build_graph();
5519 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5521 let scorer = test_utils::TestScorer::with_penalty(0);
5523 let payment_params = PaymentParameters::from_node_id(nodes[6]).with_route_hints(last_hops(&nodes));
5524 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5525 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5526 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5527 assert_eq!(route.paths.len(), 1);
5529 let cltv_expiry_deltas_before = route.paths[0].iter().map(|h| h.cltv_expiry_delta).collect::<Vec<u32>>();
5531 // Check whether the offset added to the last hop by default is in [1 .. DEFAULT_MAX_TOTAL_CLTV_EXPIRY_DELTA]
5532 let mut route_default = route.clone();
5533 add_random_cltv_offset(&mut route_default, &payment_params, &network_graph.read_only(), &random_seed_bytes);
5534 let cltv_expiry_deltas_default = route_default.paths[0].iter().map(|h| h.cltv_expiry_delta).collect::<Vec<u32>>();
5535 assert_eq!(cltv_expiry_deltas_before.split_last().unwrap().1, cltv_expiry_deltas_default.split_last().unwrap().1);
5536 assert!(cltv_expiry_deltas_default.last() > cltv_expiry_deltas_before.last());
5537 assert!(cltv_expiry_deltas_default.last().unwrap() <= &DEFAULT_MAX_TOTAL_CLTV_EXPIRY_DELTA);
5539 // Check that no offset is added when we restrict the max_total_cltv_expiry_delta
5540 let mut route_limited = route.clone();
5541 let limited_max_total_cltv_expiry_delta = cltv_expiry_deltas_before.iter().sum();
5542 let limited_payment_params = payment_params.with_max_total_cltv_expiry_delta(limited_max_total_cltv_expiry_delta);
5543 add_random_cltv_offset(&mut route_limited, &limited_payment_params, &network_graph.read_only(), &random_seed_bytes);
5544 let cltv_expiry_deltas_limited = route_limited.paths[0].iter().map(|h| h.cltv_expiry_delta).collect::<Vec<u32>>();
5545 assert_eq!(cltv_expiry_deltas_before, cltv_expiry_deltas_limited);
5549 fn adds_plausible_cltv_offset() {
5550 let (secp_ctx, network, _, _, logger) = build_graph();
5551 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5552 let network_graph = network.read_only();
5553 let network_nodes = network_graph.nodes();
5554 let network_channels = network_graph.channels();
5555 let scorer = test_utils::TestScorer::with_penalty(0);
5556 let payment_params = PaymentParameters::from_node_id(nodes[3]);
5557 let keys_manager = test_utils::TestKeysInterface::new(&[4u8; 32], Network::Testnet);
5558 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5560 let mut route = get_route(&our_id, &payment_params, &network_graph, None, 100, 0,
5561 Arc::clone(&logger), &scorer, &random_seed_bytes).unwrap();
5562 add_random_cltv_offset(&mut route, &payment_params, &network_graph, &random_seed_bytes);
5564 let mut path_plausibility = vec![];
5566 for p in route.paths {
5567 // 1. Select random observation point
5568 let mut prng = ChaCha20::new(&random_seed_bytes, &[0u8; 12]);
5569 let mut random_bytes = [0u8; ::core::mem::size_of::<usize>()];
5571 prng.process_in_place(&mut random_bytes);
5572 let random_path_index = usize::from_be_bytes(random_bytes).wrapping_rem(p.len());
5573 let observation_point = NodeId::from_pubkey(&p.get(random_path_index).unwrap().pubkey);
5575 // 2. Calculate what CLTV expiry delta we would observe there
5576 let observed_cltv_expiry_delta: u32 = p[random_path_index..].iter().map(|h| h.cltv_expiry_delta).sum();
5578 // 3. Starting from the observation point, find candidate paths
5579 let mut candidates: VecDeque<(NodeId, Vec<u32>)> = VecDeque::new();
5580 candidates.push_back((observation_point, vec![]));
5582 let mut found_plausible_candidate = false;
5584 'candidate_loop: while let Some((cur_node_id, cur_path_cltv_deltas)) = candidates.pop_front() {
5585 if let Some(remaining) = observed_cltv_expiry_delta.checked_sub(cur_path_cltv_deltas.iter().sum::<u32>()) {
5586 if remaining == 0 || remaining.wrapping_rem(40) == 0 || remaining.wrapping_rem(144) == 0 {
5587 found_plausible_candidate = true;
5588 break 'candidate_loop;
5592 if let Some(cur_node) = network_nodes.get(&cur_node_id) {
5593 for channel_id in &cur_node.channels {
5594 if let Some(channel_info) = network_channels.get(&channel_id) {
5595 if let Some((dir_info, next_id)) = channel_info.as_directed_from(&cur_node_id) {
5596 if let Some(channel_update_info) = dir_info.direction() {
5597 let next_cltv_expiry_delta = channel_update_info.cltv_expiry_delta as u32;
5598 if cur_path_cltv_deltas.iter().sum::<u32>()
5599 .saturating_add(next_cltv_expiry_delta) <= observed_cltv_expiry_delta {
5600 let mut new_path_cltv_deltas = cur_path_cltv_deltas.clone();
5601 new_path_cltv_deltas.push(next_cltv_expiry_delta);
5602 candidates.push_back((*next_id, new_path_cltv_deltas));
5611 path_plausibility.push(found_plausible_candidate);
5613 assert!(path_plausibility.iter().all(|x| *x));
5617 fn builds_correct_path_from_hops() {
5618 let (secp_ctx, network, _, _, logger) = build_graph();
5619 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5620 let network_graph = network.read_only();
5622 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5623 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5625 let payment_params = PaymentParameters::from_node_id(nodes[3]);
5626 let hops = [nodes[1], nodes[2], nodes[4], nodes[3]];
5627 let route = build_route_from_hops_internal(&our_id, &hops, &payment_params,
5628 &network_graph, 100, 0, Arc::clone(&logger), &random_seed_bytes).unwrap();
5629 let route_hop_pubkeys = route.paths[0].iter().map(|hop| hop.pubkey).collect::<Vec<_>>();
5630 assert_eq!(hops.len(), route.paths[0].len());
5631 for (idx, hop_pubkey) in hops.iter().enumerate() {
5632 assert!(*hop_pubkey == route_hop_pubkeys[idx]);
5636 #[cfg(not(feature = "no-std"))]
5637 pub(super) fn random_init_seed() -> u64 {
5638 // Because the default HashMap in std pulls OS randomness, we can use it as a (bad) RNG.
5639 use core::hash::{BuildHasher, Hasher};
5640 let seed = std::collections::hash_map::RandomState::new().build_hasher().finish();
5641 println!("Using seed of {}", seed);
5644 #[cfg(not(feature = "no-std"))]
5645 use util::ser::ReadableArgs;
5648 #[cfg(not(feature = "no-std"))]
5649 fn generate_routes() {
5650 use routing::scoring::{ProbabilisticScorer, ProbabilisticScoringParameters};
5652 let mut d = match super::test_utils::get_route_file() {
5659 let logger = test_utils::TestLogger::new();
5660 let graph = NetworkGraph::read(&mut d, &logger).unwrap();
5661 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5662 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5664 // First, get 100 (source, destination) pairs for which route-getting actually succeeds...
5665 let mut seed = random_init_seed() as usize;
5666 let nodes = graph.read_only().nodes().clone();
5667 'load_endpoints: for _ in 0..10 {
5669 seed = seed.overflowing_mul(0xdeadbeef).0;
5670 let src = &PublicKey::from_slice(nodes.keys().skip(seed % nodes.len()).next().unwrap().as_slice()).unwrap();
5671 seed = seed.overflowing_mul(0xdeadbeef).0;
5672 let dst = PublicKey::from_slice(nodes.keys().skip(seed % nodes.len()).next().unwrap().as_slice()).unwrap();
5673 let payment_params = PaymentParameters::from_node_id(dst);
5674 let amt = seed as u64 % 200_000_000;
5675 let params = ProbabilisticScoringParameters::default();
5676 let scorer = ProbabilisticScorer::new(params, &graph, &logger);
5677 if get_route(src, &payment_params, &graph.read_only(), None, amt, 42, &logger, &scorer, &random_seed_bytes).is_ok() {
5678 continue 'load_endpoints;
5685 #[cfg(not(feature = "no-std"))]
5686 fn generate_routes_mpp() {
5687 use routing::scoring::{ProbabilisticScorer, ProbabilisticScoringParameters};
5689 let mut d = match super::test_utils::get_route_file() {
5696 let logger = test_utils::TestLogger::new();
5697 let graph = NetworkGraph::read(&mut d, &logger).unwrap();
5698 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5699 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5701 // First, get 100 (source, destination) pairs for which route-getting actually succeeds...
5702 let mut seed = random_init_seed() as usize;
5703 let nodes = graph.read_only().nodes().clone();
5704 'load_endpoints: for _ in 0..10 {
5706 seed = seed.overflowing_mul(0xdeadbeef).0;
5707 let src = &PublicKey::from_slice(nodes.keys().skip(seed % nodes.len()).next().unwrap().as_slice()).unwrap();
5708 seed = seed.overflowing_mul(0xdeadbeef).0;
5709 let dst = PublicKey::from_slice(nodes.keys().skip(seed % nodes.len()).next().unwrap().as_slice()).unwrap();
5710 let payment_params = PaymentParameters::from_node_id(dst).with_features(InvoiceFeatures::known());
5711 let amt = seed as u64 % 200_000_000;
5712 let params = ProbabilisticScoringParameters::default();
5713 let scorer = ProbabilisticScorer::new(params, &graph, &logger);
5714 if get_route(src, &payment_params, &graph.read_only(), None, amt, 42, &logger, &scorer, &random_seed_bytes).is_ok() {
5715 continue 'load_endpoints;
5722 fn avoids_banned_nodes() {
5723 let (secp_ctx, network_graph, _, _, logger) = build_line_graph();
5724 let (_, our_id, _, nodes) = get_nodes(&secp_ctx);
5726 let keys_manager = test_utils::TestKeysInterface::new(&[0u8; 32], Network::Testnet);
5727 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5729 let scorer_params = ProbabilisticScoringParameters::default();
5730 let mut scorer = ProbabilisticScorer::new(scorer_params, Arc::clone(&network_graph), Arc::clone(&logger));
5732 // First check we can get a route.
5733 let payment_params = PaymentParameters::from_node_id(nodes[10]);
5734 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes);
5735 assert!(route.is_ok());
5737 // Then check that we can't get a route if we ban an intermediate node.
5738 scorer.add_banned(&NodeId::from_pubkey(&nodes[3]));
5739 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes);
5740 assert!(route.is_err());
5742 // Finally make sure we can route again, when we remove the ban.
5743 scorer.remove_banned(&NodeId::from_pubkey(&nodes[3]));
5744 let route = get_route(&our_id, &payment_params, &network_graph.read_only(), None, 100, 42, Arc::clone(&logger), &scorer, &random_seed_bytes);
5745 assert!(route.is_ok());
5749 #[cfg(all(test, not(feature = "no-std")))]
5750 pub(crate) mod test_utils {
5752 /// Tries to open a network graph file, or panics with a URL to fetch it.
5753 pub(crate) fn get_route_file() -> Result<std::fs::File, &'static str> {
5754 let res = File::open("net_graph-2021-05-31.bin") // By default we're run in RL/lightning
5755 .or_else(|_| File::open("lightning/net_graph-2021-05-31.bin")) // We may be run manually in RL/
5756 .or_else(|_| { // Fall back to guessing based on the binary location
5757 // path is likely something like .../rust-lightning/target/debug/deps/lightning-...
5758 let mut path = std::env::current_exe().unwrap();
5759 path.pop(); // lightning-...
5761 path.pop(); // debug
5762 path.pop(); // target
5763 path.push("lightning");
5764 path.push("net_graph-2021-05-31.bin");
5765 eprintln!("{}", path.to_str().unwrap());
5768 .map_err(|_| "Please fetch https://bitcoin.ninja/ldk-net_graph-v0.0.15-2021-05-31.bin and place it at lightning/net_graph-2021-05-31.bin");
5769 #[cfg(require_route_graph_test)]
5770 return Ok(res.unwrap());
5771 #[cfg(not(require_route_graph_test))]
5776 #[cfg(all(test, feature = "_bench_unstable", not(feature = "no-std")))]
5779 use bitcoin::hashes::Hash;
5780 use bitcoin::secp256k1::{PublicKey, Secp256k1, SecretKey};
5781 use chain::transaction::OutPoint;
5782 use chain::keysinterface::{KeysManager,KeysInterface};
5783 use ln::channelmanager::{ChannelCounterparty, ChannelDetails};
5784 use ln::features::{InitFeatures, InvoiceFeatures};
5785 use routing::gossip::NetworkGraph;
5786 use routing::scoring::{FixedPenaltyScorer, ProbabilisticScorer, ProbabilisticScoringParameters};
5787 use util::logger::{Logger, Record};
5788 use util::ser::ReadableArgs;
5792 struct DummyLogger {}
5793 impl Logger for DummyLogger {
5794 fn log(&self, _record: &Record) {}
5797 fn read_network_graph(logger: &DummyLogger) -> NetworkGraph<&DummyLogger> {
5798 let mut d = test_utils::get_route_file().unwrap();
5799 NetworkGraph::read(&mut d, logger).unwrap()
5802 fn payer_pubkey() -> PublicKey {
5803 let secp_ctx = Secp256k1::new();
5804 PublicKey::from_secret_key(&secp_ctx, &SecretKey::from_slice(&[42; 32]).unwrap())
5808 fn first_hop(node_id: PublicKey) -> ChannelDetails {
5810 channel_id: [0; 32],
5811 counterparty: ChannelCounterparty {
5812 features: InitFeatures::known(),
5814 unspendable_punishment_reserve: 0,
5815 forwarding_info: None,
5816 outbound_htlc_minimum_msat: None,
5817 outbound_htlc_maximum_msat: None,
5819 funding_txo: Some(OutPoint {
5820 txid: bitcoin::Txid::from_slice(&[0; 32]).unwrap(), index: 0
5823 short_channel_id: Some(1),
5824 inbound_scid_alias: None,
5825 outbound_scid_alias: None,
5826 channel_value_satoshis: 10_000_000,
5828 balance_msat: 10_000_000,
5829 outbound_capacity_msat: 10_000_000,
5830 next_outbound_htlc_limit_msat: 10_000_000,
5831 inbound_capacity_msat: 0,
5832 unspendable_punishment_reserve: None,
5833 confirmations_required: None,
5834 force_close_spend_delay: None,
5836 is_channel_ready: true,
5839 inbound_htlc_minimum_msat: None,
5840 inbound_htlc_maximum_msat: None,
5846 fn generate_routes_with_zero_penalty_scorer(bench: &mut Bencher) {
5847 let logger = DummyLogger {};
5848 let network_graph = read_network_graph(&logger);
5849 let scorer = FixedPenaltyScorer::with_penalty(0);
5850 generate_routes(bench, &network_graph, scorer, InvoiceFeatures::empty());
5854 fn generate_mpp_routes_with_zero_penalty_scorer(bench: &mut Bencher) {
5855 let logger = DummyLogger {};
5856 let network_graph = read_network_graph(&logger);
5857 let scorer = FixedPenaltyScorer::with_penalty(0);
5858 generate_routes(bench, &network_graph, scorer, InvoiceFeatures::known());
5862 fn generate_routes_with_probabilistic_scorer(bench: &mut Bencher) {
5863 let logger = DummyLogger {};
5864 let network_graph = read_network_graph(&logger);
5865 let params = ProbabilisticScoringParameters::default();
5866 let scorer = ProbabilisticScorer::new(params, &network_graph, &logger);
5867 generate_routes(bench, &network_graph, scorer, InvoiceFeatures::empty());
5871 fn generate_mpp_routes_with_probabilistic_scorer(bench: &mut Bencher) {
5872 let logger = DummyLogger {};
5873 let network_graph = read_network_graph(&logger);
5874 let params = ProbabilisticScoringParameters::default();
5875 let scorer = ProbabilisticScorer::new(params, &network_graph, &logger);
5876 generate_routes(bench, &network_graph, scorer, InvoiceFeatures::known());
5879 fn generate_routes<S: Score>(
5880 bench: &mut Bencher, graph: &NetworkGraph<&DummyLogger>, mut scorer: S,
5881 features: InvoiceFeatures
5883 let nodes = graph.read_only().nodes().clone();
5884 let payer = payer_pubkey();
5885 let keys_manager = KeysManager::new(&[0u8; 32], 42, 42);
5886 let random_seed_bytes = keys_manager.get_secure_random_bytes();
5888 // First, get 100 (source, destination) pairs for which route-getting actually succeeds...
5889 let mut routes = Vec::new();
5890 let mut route_endpoints = Vec::new();
5891 let mut seed: usize = 0xdeadbeef;
5892 'load_endpoints: for _ in 0..150 {
5895 let src = PublicKey::from_slice(nodes.keys().skip(seed % nodes.len()).next().unwrap().as_slice()).unwrap();
5897 let dst = PublicKey::from_slice(nodes.keys().skip(seed % nodes.len()).next().unwrap().as_slice()).unwrap();
5898 let params = PaymentParameters::from_node_id(dst).with_features(features.clone());
5899 let first_hop = first_hop(src);
5900 let amt = seed as u64 % 1_000_000;
5901 if let Ok(route) = get_route(&payer, ¶ms, &graph.read_only(), Some(&[&first_hop]), amt, 42, &DummyLogger{}, &scorer, &random_seed_bytes) {
5903 route_endpoints.push((first_hop, params, amt));
5904 continue 'load_endpoints;
5909 // ...and seed the scorer with success and failure data...
5910 for route in routes {
5911 let amount = route.get_total_amount();
5912 if amount < 250_000 {
5913 for path in route.paths {
5914 scorer.payment_path_successful(&path.iter().collect::<Vec<_>>());
5916 } else if amount > 750_000 {
5917 for path in route.paths {
5918 let short_channel_id = path[path.len() / 2].short_channel_id;
5919 scorer.payment_path_failed(&path.iter().collect::<Vec<_>>(), short_channel_id);
5924 // Because we've changed channel scores, its possible we'll take different routes to the
5925 // selected destinations, possibly causing us to fail because, eg, the newly-selected path
5926 // requires a too-high CLTV delta.
5927 route_endpoints.retain(|(first_hop, params, amt)| {
5928 get_route(&payer, params, &graph.read_only(), Some(&[first_hop]), *amt, 42, &DummyLogger{}, &scorer, &random_seed_bytes).is_ok()
5930 route_endpoints.truncate(100);
5931 assert_eq!(route_endpoints.len(), 100);
5933 // ...then benchmark finding paths between the nodes we learned.
5936 let (first_hop, params, amt) = &route_endpoints[idx % route_endpoints.len()];
5937 assert!(get_route(&payer, params, &graph.read_only(), Some(&[first_hop]), *amt, 42, &DummyLogger{}, &scorer, &random_seed_bytes).is_ok());