Merge pull request #2966 from G8XSU/2647-distribute
[rust-lightning] / lightning / src / onion_message / messenger.rs
1 // This file is Copyright its original authors, visible in version control
2 // history.
3 //
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
8 // licenses.
9
10 //! LDK sends, receives, and forwards onion messages via this [`OnionMessenger`], which lives here,
11 //! as well as various types, traits, and utilities that it uses.
12
13 use bitcoin::hashes::{Hash, HashEngine};
14 use bitcoin::hashes::hmac::{Hmac, HmacEngine};
15 use bitcoin::hashes::sha256::Hash as Sha256;
16 use bitcoin::secp256k1::{self, PublicKey, Scalar, Secp256k1, SecretKey};
17
18 use crate::blinded_path::{BlindedPath, IntroductionNode, NextMessageHop, NodeIdLookUp};
19 use crate::blinded_path::message::{advance_path_by_one, ForwardNode, ForwardTlvs, ReceiveTlvs};
20 use crate::blinded_path::utils;
21 use crate::events::{Event, EventHandler, EventsProvider};
22 use crate::sign::{EntropySource, NodeSigner, Recipient};
23 use crate::ln::features::{InitFeatures, NodeFeatures};
24 use crate::ln::msgs::{self, OnionMessage, OnionMessageHandler, SocketAddress};
25 use crate::ln::onion_utils;
26 use crate::routing::gossip::{NetworkGraph, NodeId, ReadOnlyNetworkGraph};
27 use super::packet::OnionMessageContents;
28 use super::packet::ParsedOnionMessageContents;
29 use super::offers::OffersMessageHandler;
30 use super::packet::{BIG_PACKET_HOP_DATA_LEN, ForwardControlTlvs, Packet, Payload, ReceiveControlTlvs, SMALL_PACKET_HOP_DATA_LEN};
31 use crate::util::logger::{Logger, WithContext};
32 use crate::util::ser::Writeable;
33
34 use core::fmt;
35 use core::ops::Deref;
36 use crate::io;
37 use crate::sync::Mutex;
38 use crate::prelude::*;
39
40 #[cfg(not(c_bindings))]
41 use {
42         crate::sign::KeysManager,
43         crate::ln::channelmanager::{SimpleArcChannelManager, SimpleRefChannelManager},
44         crate::ln::peer_handler::IgnoringMessageHandler,
45         crate::sync::Arc,
46 };
47
48 pub(super) const MAX_TIMER_TICKS: usize = 2;
49
50 /// A trivial trait which describes any [`OnionMessenger`].
51 ///
52 /// This is not exported to bindings users as general cover traits aren't useful in other
53 /// languages.
54 pub trait AOnionMessenger {
55         /// A type implementing [`EntropySource`]
56         type EntropySource: EntropySource + ?Sized;
57         /// A type that may be dereferenced to [`Self::EntropySource`]
58         type ES: Deref<Target = Self::EntropySource>;
59         /// A type implementing [`NodeSigner`]
60         type NodeSigner: NodeSigner + ?Sized;
61         /// A type that may be dereferenced to [`Self::NodeSigner`]
62         type NS: Deref<Target = Self::NodeSigner>;
63         /// A type implementing [`Logger`]
64         type Logger: Logger + ?Sized;
65         /// A type that may be dereferenced to [`Self::Logger`]
66         type L: Deref<Target = Self::Logger>;
67         /// A type implementing [`NodeIdLookUp`]
68         type NodeIdLookUp: NodeIdLookUp + ?Sized;
69         /// A type that may be dereferenced to [`Self::NodeIdLookUp`]
70         type NL: Deref<Target = Self::NodeIdLookUp>;
71         /// A type implementing [`MessageRouter`]
72         type MessageRouter: MessageRouter + ?Sized;
73         /// A type that may be dereferenced to [`Self::MessageRouter`]
74         type MR: Deref<Target = Self::MessageRouter>;
75         /// A type implementing [`OffersMessageHandler`]
76         type OffersMessageHandler: OffersMessageHandler + ?Sized;
77         /// A type that may be dereferenced to [`Self::OffersMessageHandler`]
78         type OMH: Deref<Target = Self::OffersMessageHandler>;
79         /// A type implementing [`CustomOnionMessageHandler`]
80         type CustomOnionMessageHandler: CustomOnionMessageHandler + ?Sized;
81         /// A type that may be dereferenced to [`Self::CustomOnionMessageHandler`]
82         type CMH: Deref<Target = Self::CustomOnionMessageHandler>;
83         /// Returns a reference to the actual [`OnionMessenger`] object.
84         fn get_om(&self) -> &OnionMessenger<Self::ES, Self::NS, Self::L, Self::NL, Self::MR, Self::OMH, Self::CMH>;
85 }
86
87 impl<ES: Deref, NS: Deref, L: Deref, NL: Deref, MR: Deref, OMH: Deref, CMH: Deref> AOnionMessenger
88 for OnionMessenger<ES, NS, L, NL, MR, OMH, CMH> where
89         ES::Target: EntropySource,
90         NS::Target: NodeSigner,
91         L::Target: Logger,
92         NL::Target: NodeIdLookUp,
93         MR::Target: MessageRouter,
94         OMH::Target: OffersMessageHandler,
95         CMH::Target: CustomOnionMessageHandler,
96 {
97         type EntropySource = ES::Target;
98         type ES = ES;
99         type NodeSigner = NS::Target;
100         type NS = NS;
101         type Logger = L::Target;
102         type L = L;
103         type NodeIdLookUp = NL::Target;
104         type NL = NL;
105         type MessageRouter = MR::Target;
106         type MR = MR;
107         type OffersMessageHandler = OMH::Target;
108         type OMH = OMH;
109         type CustomOnionMessageHandler = CMH::Target;
110         type CMH = CMH;
111         fn get_om(&self) -> &OnionMessenger<ES, NS, L, NL, MR, OMH, CMH> { self }
112 }
113
114 /// A sender, receiver and forwarder of [`OnionMessage`]s.
115 ///
116 /// # Handling Messages
117 ///
118 /// `OnionMessenger` implements [`OnionMessageHandler`], making it responsible for either forwarding
119 /// messages to peers or delegating to the appropriate handler for the message type. Currently, the
120 /// available handlers are:
121 /// * [`OffersMessageHandler`], for responding to [`InvoiceRequest`]s and paying [`Bolt12Invoice`]s
122 /// * [`CustomOnionMessageHandler`], for handling user-defined message types
123 ///
124 /// # Sending Messages
125 ///
126 /// [`OnionMessage`]s are sent initially using [`OnionMessenger::send_onion_message`]. When handling
127 /// a message, the matched handler may return a response message which `OnionMessenger` will send
128 /// on its behalf.
129 ///
130 /// # Example
131 ///
132 /// ```
133 /// # extern crate bitcoin;
134 /// # use bitcoin::hashes::_export::_core::time::Duration;
135 /// # use bitcoin::hashes::hex::FromHex;
136 /// # use bitcoin::secp256k1::{PublicKey, Secp256k1, SecretKey, self};
137 /// # use lightning::blinded_path::{BlindedPath, EmptyNodeIdLookUp};
138 /// # use lightning::blinded_path::message::ForwardNode;
139 /// # use lightning::sign::{EntropySource, KeysManager};
140 /// # use lightning::ln::peer_handler::IgnoringMessageHandler;
141 /// # use lightning::onion_message::messenger::{Destination, MessageRouter, OnionMessagePath, OnionMessenger};
142 /// # use lightning::onion_message::packet::OnionMessageContents;
143 /// # use lightning::util::logger::{Logger, Record};
144 /// # use lightning::util::ser::{Writeable, Writer};
145 /// # use lightning::io;
146 /// # use std::sync::Arc;
147 /// # struct FakeLogger;
148 /// # impl Logger for FakeLogger {
149 /// #     fn log(&self, record: Record) { println!("{:?}" , record); }
150 /// # }
151 /// # struct FakeMessageRouter {}
152 /// # impl MessageRouter for FakeMessageRouter {
153 /// #     fn find_path(&self, sender: PublicKey, peers: Vec<PublicKey>, destination: Destination) -> Result<OnionMessagePath, ()> {
154 /// #         let secp_ctx = Secp256k1::new();
155 /// #         let node_secret = SecretKey::from_slice(&<Vec<u8>>::from_hex("0101010101010101010101010101010101010101010101010101010101010101").unwrap()[..]).unwrap();
156 /// #         let hop_node_id1 = PublicKey::from_secret_key(&secp_ctx, &node_secret);
157 /// #         let hop_node_id2 = hop_node_id1;
158 /// #         Ok(OnionMessagePath {
159 /// #             intermediate_nodes: vec![hop_node_id1, hop_node_id2],
160 /// #             destination,
161 /// #             first_node_addresses: None,
162 /// #         })
163 /// #     }
164 /// #     fn create_blinded_paths<T: secp256k1::Signing + secp256k1::Verification>(
165 /// #         &self, _recipient: PublicKey, _peers: Vec<PublicKey>, _secp_ctx: &Secp256k1<T>
166 /// #     ) -> Result<Vec<BlindedPath>, ()> {
167 /// #         unreachable!()
168 /// #     }
169 /// # }
170 /// # let seed = [42u8; 32];
171 /// # let time = Duration::from_secs(123456);
172 /// # let keys_manager = KeysManager::new(&seed, time.as_secs(), time.subsec_nanos());
173 /// # let logger = Arc::new(FakeLogger {});
174 /// # let node_secret = SecretKey::from_slice(&<Vec<u8>>::from_hex("0101010101010101010101010101010101010101010101010101010101010101").unwrap()[..]).unwrap();
175 /// # let secp_ctx = Secp256k1::new();
176 /// # let hop_node_id1 = PublicKey::from_secret_key(&secp_ctx, &node_secret);
177 /// # let (hop_node_id3, hop_node_id4) = (hop_node_id1, hop_node_id1);
178 /// # let destination_node_id = hop_node_id1;
179 /// # let node_id_lookup = EmptyNodeIdLookUp {};
180 /// # let message_router = Arc::new(FakeMessageRouter {});
181 /// # let custom_message_handler = IgnoringMessageHandler {};
182 /// # let offers_message_handler = IgnoringMessageHandler {};
183 /// // Create the onion messenger. This must use the same `keys_manager` as is passed to your
184 /// // ChannelManager.
185 /// let onion_messenger = OnionMessenger::new(
186 ///     &keys_manager, &keys_manager, logger, &node_id_lookup, message_router,
187 ///     &offers_message_handler, &custom_message_handler
188 /// );
189
190 /// # #[derive(Debug)]
191 /// # struct YourCustomMessage {}
192 /// impl Writeable for YourCustomMessage {
193 ///     fn write<W: Writer>(&self, w: &mut W) -> Result<(), io::Error> {
194 ///             # Ok(())
195 ///             // Write your custom onion message to `w`
196 ///     }
197 /// }
198 /// impl OnionMessageContents for YourCustomMessage {
199 ///     fn tlv_type(&self) -> u64 {
200 ///             # let your_custom_message_type = 42;
201 ///             your_custom_message_type
202 ///     }
203 ///     fn msg_type(&self) -> &'static str { "YourCustomMessageType" }
204 /// }
205 /// // Send a custom onion message to a node id.
206 /// let destination = Destination::Node(destination_node_id);
207 /// let reply_path = None;
208 /// # let message = YourCustomMessage {};
209 /// onion_messenger.send_onion_message(message, destination, reply_path);
210 ///
211 /// // Create a blinded path to yourself, for someone to send an onion message to.
212 /// # let your_node_id = hop_node_id1;
213 /// let hops = [
214 ///     ForwardNode { node_id: hop_node_id3, short_channel_id: None },
215 ///     ForwardNode { node_id: hop_node_id4, short_channel_id: None },
216 /// ];
217 /// let blinded_path = BlindedPath::new_for_message(&hops, your_node_id, &keys_manager, &secp_ctx).unwrap();
218 ///
219 /// // Send a custom onion message to a blinded path.
220 /// let destination = Destination::BlindedPath(blinded_path);
221 /// let reply_path = None;
222 /// # let message = YourCustomMessage {};
223 /// onion_messenger.send_onion_message(message, destination, reply_path);
224 /// ```
225 ///
226 /// [`InvoiceRequest`]: crate::offers::invoice_request::InvoiceRequest
227 /// [`Bolt12Invoice`]: crate::offers::invoice::Bolt12Invoice
228 pub struct OnionMessenger<ES: Deref, NS: Deref, L: Deref, NL: Deref, MR: Deref, OMH: Deref, CMH: Deref>
229 where
230         ES::Target: EntropySource,
231         NS::Target: NodeSigner,
232         L::Target: Logger,
233         NL::Target: NodeIdLookUp,
234         MR::Target: MessageRouter,
235         OMH::Target: OffersMessageHandler,
236         CMH::Target: CustomOnionMessageHandler,
237 {
238         entropy_source: ES,
239         node_signer: NS,
240         logger: L,
241         message_recipients: Mutex<HashMap<PublicKey, OnionMessageRecipient>>,
242         secp_ctx: Secp256k1<secp256k1::All>,
243         node_id_lookup: NL,
244         message_router: MR,
245         offers_handler: OMH,
246         custom_handler: CMH,
247         intercept_messages_for_offline_peers: bool,
248         pending_events: Mutex<PendingEvents>,
249 }
250
251 struct PendingEvents {
252         intercepted_msgs: Vec<Event>,
253         peer_connecteds: Vec<Event>,
254 }
255
256 /// [`OnionMessage`]s buffered to be sent.
257 enum OnionMessageRecipient {
258         /// Messages for a node connected as a peer.
259         ConnectedPeer(VecDeque<OnionMessage>),
260
261         /// Messages for a node that is not yet connected, which are dropped after [`MAX_TIMER_TICKS`]
262         /// and tracked here.
263         PendingConnection(VecDeque<OnionMessage>, Option<Vec<SocketAddress>>, usize),
264 }
265
266 impl OnionMessageRecipient {
267         fn pending_connection(addresses: Vec<SocketAddress>) -> Self {
268                 Self::PendingConnection(VecDeque::new(), Some(addresses), 0)
269         }
270
271         fn pending_messages(&self) -> &VecDeque<OnionMessage> {
272                 match self {
273                         OnionMessageRecipient::ConnectedPeer(pending_messages) => pending_messages,
274                         OnionMessageRecipient::PendingConnection(pending_messages, _, _) => pending_messages,
275                 }
276         }
277
278         fn enqueue_message(&mut self, message: OnionMessage) {
279                 let pending_messages = match self {
280                         OnionMessageRecipient::ConnectedPeer(pending_messages) => pending_messages,
281                         OnionMessageRecipient::PendingConnection(pending_messages, _, _) => pending_messages,
282                 };
283
284                 pending_messages.push_back(message);
285         }
286
287         fn dequeue_message(&mut self) -> Option<OnionMessage> {
288                 let pending_messages = match self {
289                         OnionMessageRecipient::ConnectedPeer(pending_messages) => pending_messages,
290                         OnionMessageRecipient::PendingConnection(pending_messages, _, _) => {
291                                 debug_assert!(false);
292                                 pending_messages
293                         },
294                 };
295
296                 pending_messages.pop_front()
297         }
298
299         #[cfg(test)]
300         fn release_pending_messages(&mut self) -> VecDeque<OnionMessage> {
301                 let pending_messages = match self {
302                         OnionMessageRecipient::ConnectedPeer(pending_messages) => pending_messages,
303                         OnionMessageRecipient::PendingConnection(pending_messages, _, _) => pending_messages,
304                 };
305
306                 core::mem::take(pending_messages)
307         }
308
309         fn mark_connected(&mut self) {
310                 if let OnionMessageRecipient::PendingConnection(pending_messages, _, _) = self {
311                         let mut new_pending_messages = VecDeque::new();
312                         core::mem::swap(pending_messages, &mut new_pending_messages);
313                         *self = OnionMessageRecipient::ConnectedPeer(new_pending_messages);
314                 }
315         }
316
317         fn is_connected(&self) -> bool {
318                 match self {
319                         OnionMessageRecipient::ConnectedPeer(..) => true,
320                         OnionMessageRecipient::PendingConnection(..) => false,
321                 }
322         }
323 }
324
325
326 /// The `Responder` struct creates an appropriate [`ResponseInstruction`]
327 /// for responding to a message.
328 #[derive(Clone, Debug, Eq, PartialEq)]
329 pub struct Responder {
330         /// The path along which a response can be sent.
331         reply_path: BlindedPath,
332         path_id: Option<[u8; 32]>
333 }
334
335 impl_writeable_tlv_based!(Responder, {
336         (0, reply_path, required),
337         (2, path_id, option),
338 });
339
340 impl Responder {
341         /// Creates a new [`Responder`] instance with the provided reply path.
342         pub(super) fn new(reply_path: BlindedPath, path_id: Option<[u8; 32]>) -> Self {
343                 Responder {
344                         reply_path,
345                         path_id,
346                 }
347         }
348
349         /// Creates a [`ResponseInstruction::WithoutReplyPath`] for a given response.
350         ///
351         /// Use when the recipient doesn't need to send back a reply to us.
352         pub fn respond<T: OnionMessageContents>(self, response: T) -> ResponseInstruction<T> {
353                 ResponseInstruction::WithoutReplyPath(OnionMessageResponse {
354                         message: response,
355                         reply_path: self.reply_path,
356                         path_id: self.path_id,
357                 })
358         }
359
360         /// Creates a [`ResponseInstruction::WithReplyPath`] for a given response.
361         ///
362         /// Use when the recipient needs to send back a reply to us.
363         pub fn respond_with_reply_path<T: OnionMessageContents>(self, response: T) -> ResponseInstruction<T> {
364                 ResponseInstruction::WithReplyPath(OnionMessageResponse {
365                         message: response,
366                         reply_path: self.reply_path,
367                         path_id: self.path_id,
368                 })
369         }
370 }
371
372 /// This struct contains the information needed to reply to a received message.
373 pub struct OnionMessageResponse<T: OnionMessageContents> {
374         message: T,
375         reply_path: BlindedPath,
376         path_id: Option<[u8; 32]>,
377 }
378
379 /// `ResponseInstruction` represents instructions for responding to received messages.
380 pub enum ResponseInstruction<T: OnionMessageContents> {
381         /// Indicates that a response should be sent including a reply path for
382         /// the recipient to respond back.
383         WithReplyPath(OnionMessageResponse<T>),
384         /// Indicates that a response should be sent without including a reply path
385         /// for the recipient to respond back.
386         WithoutReplyPath(OnionMessageResponse<T>),
387         /// Indicates that there's no response to send back.
388         NoResponse,
389 }
390
391 /// An [`OnionMessage`] for [`OnionMessenger`] to send.
392 ///
393 /// These are obtained when released from [`OnionMessenger`]'s handlers after which they are
394 /// enqueued for sending.
395 #[cfg(not(c_bindings))]
396 pub struct PendingOnionMessage<T: OnionMessageContents> {
397         /// The message contents to send in an [`OnionMessage`].
398         pub contents: T,
399
400         /// The destination of the message.
401         pub destination: Destination,
402
403         /// A reply path to include in the [`OnionMessage`] for a response.
404         pub reply_path: Option<BlindedPath>,
405 }
406
407 #[cfg(c_bindings)]
408 /// An [`OnionMessage`] for [`OnionMessenger`] to send.
409 ///
410 /// These are obtained when released from [`OnionMessenger`]'s handlers after which they are
411 /// enqueued for sending.
412 pub type PendingOnionMessage<T> = (T, Destination, Option<BlindedPath>);
413
414 pub(crate) fn new_pending_onion_message<T: OnionMessageContents>(
415         contents: T, destination: Destination, reply_path: Option<BlindedPath>
416 ) -> PendingOnionMessage<T> {
417         #[cfg(not(c_bindings))]
418         return PendingOnionMessage { contents, destination, reply_path };
419         #[cfg(c_bindings)]
420         return (contents, destination, reply_path);
421 }
422
423 /// A trait defining behavior for routing an [`OnionMessage`].
424 pub trait MessageRouter {
425         /// Returns a route for sending an [`OnionMessage`] to the given [`Destination`].
426         fn find_path(
427                 &self, sender: PublicKey, peers: Vec<PublicKey>, destination: Destination
428         ) -> Result<OnionMessagePath, ()>;
429
430         /// Creates [`BlindedPath`]s to the `recipient` node. The nodes in `peers` are assumed to be
431         /// direct peers with the `recipient`.
432         fn create_blinded_paths<
433                 T: secp256k1::Signing + secp256k1::Verification
434         >(
435                 &self, recipient: PublicKey, peers: Vec<PublicKey>, secp_ctx: &Secp256k1<T>,
436         ) -> Result<Vec<BlindedPath>, ()>;
437
438         /// Creates compact [`BlindedPath`]s to the `recipient` node. The nodes in `peers` are assumed
439         /// to be direct peers with the `recipient`.
440         ///
441         /// Compact blinded paths use short channel ids instead of pubkeys for a smaller serialization,
442         /// which is beneficial when a QR code is used to transport the data. The SCID is passed using a
443         /// [`ForwardNode`] but may be `None` for graceful degradation.
444         ///
445         /// Implementations using additional intermediate nodes are responsible for using a
446         /// [`ForwardNode`] with `Some` short channel id, if possible. Similarly, implementations should
447         /// call [`BlindedPath::use_compact_introduction_node`].
448         ///
449         /// The provided implementation simply delegates to [`MessageRouter::create_blinded_paths`],
450         /// ignoring the short channel ids.
451         fn create_compact_blinded_paths<
452                 T: secp256k1::Signing + secp256k1::Verification
453         >(
454                 &self, recipient: PublicKey, peers: Vec<ForwardNode>, secp_ctx: &Secp256k1<T>,
455         ) -> Result<Vec<BlindedPath>, ()> {
456                 let peers = peers
457                         .into_iter()
458                         .map(|ForwardNode { node_id, short_channel_id: _ }| node_id)
459                         .collect();
460                 self.create_blinded_paths(recipient, peers, secp_ctx)
461         }
462 }
463
464 /// A [`MessageRouter`] that can only route to a directly connected [`Destination`].
465 ///
466 /// # Privacy
467 ///
468 /// Creating [`BlindedPath`]s may affect privacy since, if a suitable path cannot be found, it will
469 /// create a one-hop path using the recipient as the introduction node if it is a announced node.
470 /// Otherwise, there is no way to find a path to the introduction node in order to send a message,
471 /// and thus an `Err` is returned.
472 pub struct DefaultMessageRouter<G: Deref<Target=NetworkGraph<L>>, L: Deref, ES: Deref>
473 where
474         L::Target: Logger,
475         ES::Target: EntropySource,
476 {
477         network_graph: G,
478         entropy_source: ES,
479 }
480
481 impl<G: Deref<Target=NetworkGraph<L>>, L: Deref, ES: Deref> DefaultMessageRouter<G, L, ES>
482 where
483         L::Target: Logger,
484         ES::Target: EntropySource,
485 {
486         /// Creates a [`DefaultMessageRouter`] using the given [`NetworkGraph`].
487         pub fn new(network_graph: G, entropy_source: ES) -> Self {
488                 Self { network_graph, entropy_source }
489         }
490
491         fn create_blinded_paths_from_iter<
492                 I: ExactSizeIterator<Item = ForwardNode>,
493                 T: secp256k1::Signing + secp256k1::Verification
494         >(
495                 &self, recipient: PublicKey, peers: I, secp_ctx: &Secp256k1<T>, compact_paths: bool
496         ) -> Result<Vec<BlindedPath>, ()> {
497                 // Limit the number of blinded paths that are computed.
498                 const MAX_PATHS: usize = 3;
499
500                 // Ensure peers have at least three channels so that it is more difficult to infer the
501                 // recipient's node_id.
502                 const MIN_PEER_CHANNELS: usize = 3;
503
504                 let network_graph = self.network_graph.deref().read_only();
505                 let is_recipient_announced =
506                         network_graph.nodes().contains_key(&NodeId::from_pubkey(&recipient));
507
508                 let has_one_peer = peers.len() == 1;
509                 let mut peer_info = peers
510                         // Limit to peers with announced channels unless the recipient is unannounced.
511                         .filter_map(|peer|
512                                 network_graph
513                                         .node(&NodeId::from_pubkey(&peer.node_id))
514                                         .filter(|info|
515                                                 !is_recipient_announced || info.channels.len() >= MIN_PEER_CHANNELS
516                                         )
517                                         .map(|info| (peer, info.is_tor_only(), info.channels.len()))
518                                         // Allow messages directly with the only peer when unannounced.
519                                         .or_else(|| (!is_recipient_announced && has_one_peer)
520                                                 .then(|| (peer, false, 0))
521                                         )
522                         )
523                         // Exclude Tor-only nodes when the recipient is announced.
524                         .filter(|(_, is_tor_only, _)| !(*is_tor_only && is_recipient_announced))
525                         .collect::<Vec<_>>();
526
527                 // Prefer using non-Tor nodes with the most channels as the introduction node.
528                 peer_info.sort_unstable_by(|(_, a_tor_only, a_channels), (_, b_tor_only, b_channels)| {
529                         a_tor_only.cmp(b_tor_only).then(a_channels.cmp(b_channels).reverse())
530                 });
531
532                 let paths = peer_info.into_iter()
533                         .map(|(peer, _, _)| {
534                                 BlindedPath::new_for_message(&[peer], recipient, &*self.entropy_source, secp_ctx)
535                         })
536                         .take(MAX_PATHS)
537                         .collect::<Result<Vec<_>, _>>();
538
539                 let mut paths = match paths {
540                         Ok(paths) if !paths.is_empty() => Ok(paths),
541                         _ => {
542                                 if is_recipient_announced {
543                                         BlindedPath::one_hop_for_message(recipient, &*self.entropy_source, secp_ctx)
544                                                 .map(|path| vec![path])
545                                 } else {
546                                         Err(())
547                                 }
548                         },
549                 }?;
550
551                 if compact_paths {
552                         for path in &mut paths {
553                                 path.use_compact_introduction_node(&network_graph);
554                         }
555                 }
556
557                 Ok(paths)
558         }
559 }
560
561 impl<G: Deref<Target=NetworkGraph<L>>, L: Deref, ES: Deref> MessageRouter for DefaultMessageRouter<G, L, ES>
562 where
563         L::Target: Logger,
564         ES::Target: EntropySource,
565 {
566         fn find_path(
567                 &self, sender: PublicKey, peers: Vec<PublicKey>, mut destination: Destination
568         ) -> Result<OnionMessagePath, ()> {
569                 let network_graph = self.network_graph.deref().read_only();
570                 destination.resolve(&network_graph);
571
572                 let first_node = match destination.first_node() {
573                         Some(first_node) => first_node,
574                         None => return Err(()),
575                 };
576
577                 if peers.contains(&first_node) || sender == first_node {
578                         Ok(OnionMessagePath {
579                                 intermediate_nodes: vec![], destination, first_node_addresses: None
580                         })
581                 } else {
582                         let node_details = network_graph
583                                 .node(&NodeId::from_pubkey(&first_node))
584                                 .and_then(|node_info| node_info.announcement_info.as_ref())
585                                 .map(|announcement_info| (announcement_info.features(), announcement_info.addresses()));
586
587                         match node_details {
588                                 Some((features, addresses)) if features.supports_onion_messages() && addresses.len() > 0 => {
589                                         let first_node_addresses = Some(addresses.clone());
590                                         Ok(OnionMessagePath {
591                                                 intermediate_nodes: vec![], destination, first_node_addresses
592                                         })
593                                 },
594                                 _ => Err(()),
595                         }
596                 }
597         }
598
599         fn create_blinded_paths<
600                 T: secp256k1::Signing + secp256k1::Verification
601         >(
602                 &self, recipient: PublicKey, peers: Vec<PublicKey>, secp_ctx: &Secp256k1<T>,
603         ) -> Result<Vec<BlindedPath>, ()> {
604                 let peers = peers
605                         .into_iter()
606                         .map(|node_id| ForwardNode { node_id, short_channel_id: None });
607                 self.create_blinded_paths_from_iter(recipient, peers, secp_ctx, false)
608         }
609
610         fn create_compact_blinded_paths<
611                 T: secp256k1::Signing + secp256k1::Verification
612         >(
613                 &self, recipient: PublicKey, peers: Vec<ForwardNode>, secp_ctx: &Secp256k1<T>,
614         ) -> Result<Vec<BlindedPath>, ()> {
615                 self.create_blinded_paths_from_iter(recipient, peers.into_iter(), secp_ctx, true)
616         }
617 }
618
619 /// A path for sending an [`OnionMessage`].
620 #[derive(Clone)]
621 pub struct OnionMessagePath {
622         /// Nodes on the path between the sender and the destination.
623         pub intermediate_nodes: Vec<PublicKey>,
624
625         /// The recipient of the message.
626         pub destination: Destination,
627
628         /// Addresses that may be used to connect to [`OnionMessagePath::first_node`].
629         ///
630         /// Only needs to be set if a connection to the node is required. [`OnionMessenger`] may use
631         /// this to initiate such a connection.
632         pub first_node_addresses: Option<Vec<SocketAddress>>,
633 }
634
635 impl OnionMessagePath {
636         /// Returns the first node in the path.
637         pub fn first_node(&self) -> Option<PublicKey> {
638                 self.intermediate_nodes
639                         .first()
640                         .copied()
641                         .or_else(|| self.destination.first_node())
642         }
643 }
644
645 /// The destination of an onion message.
646 #[derive(Clone, Hash, Debug, PartialEq, Eq)]
647 pub enum Destination {
648         /// We're sending this onion message to a node.
649         Node(PublicKey),
650         /// We're sending this onion message to a blinded path.
651         BlindedPath(BlindedPath),
652 }
653
654 impl Destination {
655         /// Attempts to resolve the [`IntroductionNode::DirectedShortChannelId`] of a
656         /// [`Destination::BlindedPath`] to a [`IntroductionNode::NodeId`], if applicable, using the
657         /// provided [`ReadOnlyNetworkGraph`].
658         pub fn resolve(&mut self, network_graph: &ReadOnlyNetworkGraph) {
659                 if let Destination::BlindedPath(path) = self {
660                         if let IntroductionNode::DirectedShortChannelId(..) = path.introduction_node {
661                                 if let Some(pubkey) = path
662                                         .public_introduction_node_id(network_graph)
663                                         .and_then(|node_id| node_id.as_pubkey().ok())
664                                 {
665                                         path.introduction_node = IntroductionNode::NodeId(pubkey);
666                                 }
667                         }
668                 }
669         }
670
671         pub(super) fn num_hops(&self) -> usize {
672                 match self {
673                         Destination::Node(_) => 1,
674                         Destination::BlindedPath(BlindedPath { blinded_hops, .. }) => blinded_hops.len(),
675                 }
676         }
677
678         fn first_node(&self) -> Option<PublicKey> {
679                 match self {
680                         Destination::Node(node_id) => Some(*node_id),
681                         Destination::BlindedPath(BlindedPath { introduction_node, .. }) => {
682                                 match introduction_node {
683                                         IntroductionNode::NodeId(pubkey) => Some(*pubkey),
684                                         IntroductionNode::DirectedShortChannelId(..) => None,
685                                 }
686                         },
687                 }
688         }
689 }
690
691 /// Result of successfully [sending an onion message].
692 ///
693 /// [sending an onion message]: OnionMessenger::send_onion_message
694 #[derive(Clone, Hash, Debug, PartialEq, Eq)]
695 pub enum SendSuccess {
696         /// The message was buffered and will be sent once it is processed by
697         /// [`OnionMessageHandler::next_onion_message_for_peer`].
698         Buffered,
699         /// The message was buffered and will be sent once the node is connected as a peer and it is
700         /// processed by [`OnionMessageHandler::next_onion_message_for_peer`].
701         BufferedAwaitingConnection(PublicKey),
702 }
703
704 /// Errors that may occur when [sending an onion message].
705 ///
706 /// [sending an onion message]: OnionMessenger::send_onion_message
707 #[derive(Clone, Hash, Debug, PartialEq, Eq)]
708 pub enum SendError {
709         /// Errored computing onion message packet keys.
710         Secp256k1(secp256k1::Error),
711         /// Because implementations such as Eclair will drop onion messages where the message packet
712         /// exceeds 32834 bytes, we refuse to send messages where the packet exceeds this size.
713         TooBigPacket,
714         /// The provided [`Destination`] was an invalid [`BlindedPath`] due to not having any blinded
715         /// hops.
716         TooFewBlindedHops,
717         /// The first hop is not a peer and doesn't have a known [`SocketAddress`].
718         InvalidFirstHop(PublicKey),
719         /// Indicates that a path could not be found by the [`MessageRouter`].
720         ///
721         /// This occurs when either:
722         /// - No path from the sender to the destination was found to send the onion message
723         /// - No reply path to the sender could be created when responding to an onion message
724         PathNotFound,
725         /// Onion message contents must have a TLV type >= 64.
726         InvalidMessage,
727         /// Our next-hop peer's buffer was full or our total outbound buffer was full.
728         BufferFull,
729         /// Failed to retrieve our node id from the provided [`NodeSigner`].
730         ///
731         /// [`NodeSigner`]: crate::sign::NodeSigner
732         GetNodeIdFailed,
733         /// The provided [`Destination`] has a blinded path with an unresolved introduction node. An
734         /// attempt to resolve it in the [`MessageRouter`] when finding an [`OnionMessagePath`] likely
735         /// failed.
736         UnresolvedIntroductionNode,
737         /// We attempted to send to a blinded path where we are the introduction node, and failed to
738         /// advance the blinded path to make the second hop the new introduction node. Either
739         /// [`NodeSigner::ecdh`] failed, we failed to tweak the current blinding point to get the
740         /// new blinding point, or we were attempting to send to ourselves.
741         BlindedPathAdvanceFailed,
742 }
743
744 /// Handler for custom onion messages. If you are using [`SimpleArcOnionMessenger`],
745 /// [`SimpleRefOnionMessenger`], or prefer to ignore inbound custom onion messages,
746 /// [`IgnoringMessageHandler`] must be provided to [`OnionMessenger::new`]. Otherwise, a custom
747 /// implementation of this trait must be provided, with [`CustomMessage`] specifying the supported
748 /// message types.
749 ///
750 /// See [`OnionMessenger`] for example usage.
751 ///
752 /// [`IgnoringMessageHandler`]: crate::ln::peer_handler::IgnoringMessageHandler
753 /// [`CustomMessage`]: Self::CustomMessage
754 pub trait CustomOnionMessageHandler {
755         /// The message known to the handler. To support multiple message types, you may want to make this
756         /// an enum with a variant for each supported message.
757         type CustomMessage: OnionMessageContents;
758
759         /// Called with the custom message that was received, returning a response to send, if any.
760         ///
761         /// The returned [`Self::CustomMessage`], if any, is enqueued to be sent by [`OnionMessenger`].
762         fn handle_custom_message(&self, message: Self::CustomMessage, responder: Option<Responder>) -> ResponseInstruction<Self::CustomMessage>;
763
764         /// Read a custom message of type `message_type` from `buffer`, returning `Ok(None)` if the
765         /// message type is unknown.
766         fn read_custom_message<R: io::Read>(&self, message_type: u64, buffer: &mut R) -> Result<Option<Self::CustomMessage>, msgs::DecodeError>;
767
768         /// Releases any [`Self::CustomMessage`]s that need to be sent.
769         ///
770         /// Typically, this is used for messages initiating a message flow rather than in response to
771         /// another message. The latter should use the return value of [`Self::handle_custom_message`].
772         #[cfg(not(c_bindings))]
773         fn release_pending_custom_messages(&self) -> Vec<PendingOnionMessage<Self::CustomMessage>>;
774
775         /// Releases any [`Self::CustomMessage`]s that need to be sent.
776         ///
777         /// Typically, this is used for messages initiating a message flow rather than in response to
778         /// another message. The latter should use the return value of [`Self::handle_custom_message`].
779         #[cfg(c_bindings)]
780         fn release_pending_custom_messages(&self) -> Vec<(Self::CustomMessage, Destination, Option<BlindedPath>)>;
781 }
782
783 /// A processed incoming onion message, containing either a Forward (another onion message)
784 /// or a Receive payload with decrypted contents.
785 #[derive(Clone, Debug)]
786 pub enum PeeledOnion<T: OnionMessageContents> {
787         /// Forwarded onion, with the next node id and a new onion
788         Forward(NextMessageHop, OnionMessage),
789         /// Received onion message, with decrypted contents, path_id, and reply path
790         Receive(ParsedOnionMessageContents<T>, Option<[u8; 32]>, Option<BlindedPath>)
791 }
792
793
794 /// Creates an [`OnionMessage`] with the given `contents` for sending to the destination of
795 /// `path`, first calling [`Destination::resolve`] on `path.destination` with the given
796 /// [`ReadOnlyNetworkGraph`].
797 ///
798 /// Returns the node id of the peer to send the message to, the message itself, and any addresses
799 /// needed to connect to the first node.
800 pub fn create_onion_message_resolving_destination<
801         ES: Deref, NS: Deref, NL: Deref, T: OnionMessageContents
802 >(
803         entropy_source: &ES, node_signer: &NS, node_id_lookup: &NL,
804         network_graph: &ReadOnlyNetworkGraph, secp_ctx: &Secp256k1<secp256k1::All>,
805         mut path: OnionMessagePath, contents: T, reply_path: Option<BlindedPath>,
806 ) -> Result<(PublicKey, OnionMessage, Option<Vec<SocketAddress>>), SendError>
807 where
808         ES::Target: EntropySource,
809         NS::Target: NodeSigner,
810         NL::Target: NodeIdLookUp,
811 {
812         path.destination.resolve(network_graph);
813         create_onion_message(
814                 entropy_source, node_signer, node_id_lookup, secp_ctx, path, contents, reply_path,
815         )
816 }
817
818 /// Creates an [`OnionMessage`] with the given `contents` for sending to the destination of
819 /// `path`.
820 ///
821 /// Returns the node id of the peer to send the message to, the message itself, and any addresses
822 /// needed to connect to the first node.
823 ///
824 /// Returns [`SendError::UnresolvedIntroductionNode`] if:
825 /// - `destination` contains a blinded path with an [`IntroductionNode::DirectedShortChannelId`],
826 /// - unless it can be resolved by [`NodeIdLookUp::next_node_id`].
827 /// Use [`create_onion_message_resolving_destination`] instead to resolve the introduction node
828 /// first with a [`ReadOnlyNetworkGraph`].
829 pub fn create_onion_message<ES: Deref, NS: Deref, NL: Deref, T: OnionMessageContents>(
830         entropy_source: &ES, node_signer: &NS, node_id_lookup: &NL,
831         secp_ctx: &Secp256k1<secp256k1::All>, path: OnionMessagePath, contents: T,
832         reply_path: Option<BlindedPath>,
833 ) -> Result<(PublicKey, OnionMessage, Option<Vec<SocketAddress>>), SendError>
834 where
835         ES::Target: EntropySource,
836         NS::Target: NodeSigner,
837         NL::Target: NodeIdLookUp,
838 {
839         let OnionMessagePath { intermediate_nodes, mut destination, first_node_addresses } = path;
840         if let Destination::BlindedPath(BlindedPath { ref blinded_hops, .. }) = destination {
841                 if blinded_hops.is_empty() {
842                         return Err(SendError::TooFewBlindedHops);
843                 }
844         }
845
846         if contents.tlv_type() < 64 { return Err(SendError::InvalidMessage) }
847
848         // If we are sending straight to a blinded path and we are the introduction node, we need to
849         // advance the blinded path by 1 hop so the second hop is the new introduction node.
850         if intermediate_nodes.len() == 0 {
851                 if let Destination::BlindedPath(ref mut blinded_path) = destination {
852                         let our_node_id = node_signer.get_node_id(Recipient::Node)
853                                 .map_err(|()| SendError::GetNodeIdFailed)?;
854                         let introduction_node_id = match blinded_path.introduction_node {
855                                 IntroductionNode::NodeId(pubkey) => pubkey,
856                                 IntroductionNode::DirectedShortChannelId(direction, scid) => {
857                                         match node_id_lookup.next_node_id(scid) {
858                                                 Some(next_node_id) => *direction.select_pubkey(&our_node_id, &next_node_id),
859                                                 None => return Err(SendError::UnresolvedIntroductionNode),
860                                         }
861                                 },
862                         };
863                         if introduction_node_id == our_node_id {
864                                 advance_path_by_one(blinded_path, node_signer, node_id_lookup, &secp_ctx)
865                                         .map_err(|()| SendError::BlindedPathAdvanceFailed)?;
866                         }
867                 }
868         }
869
870         let blinding_secret_bytes = entropy_source.get_secure_random_bytes();
871         let blinding_secret = SecretKey::from_slice(&blinding_secret_bytes[..]).expect("RNG is busted");
872         let (first_node_id, blinding_point) = if let Some(first_node_id) = intermediate_nodes.first() {
873                 (*first_node_id, PublicKey::from_secret_key(&secp_ctx, &blinding_secret))
874         } else {
875                 match &destination {
876                         Destination::Node(pk) => (*pk, PublicKey::from_secret_key(&secp_ctx, &blinding_secret)),
877                         Destination::BlindedPath(BlindedPath { introduction_node, blinding_point, .. }) => {
878                                 match introduction_node {
879                                         IntroductionNode::NodeId(pubkey) => (*pubkey, *blinding_point),
880                                         IntroductionNode::DirectedShortChannelId(..) => {
881                                                 return Err(SendError::UnresolvedIntroductionNode);
882                                         },
883                                 }
884                         }
885                 }
886         };
887         let (packet_payloads, packet_keys) = packet_payloads_and_keys(
888                 &secp_ctx, &intermediate_nodes, destination, contents, reply_path, &blinding_secret
889         )?;
890
891         let prng_seed = entropy_source.get_secure_random_bytes();
892         let onion_routing_packet = construct_onion_message_packet(
893                 packet_payloads, packet_keys, prng_seed).map_err(|()| SendError::TooBigPacket)?;
894
895         let message = OnionMessage { blinding_point, onion_routing_packet };
896         Ok((first_node_id, message, first_node_addresses))
897 }
898
899 /// Decode one layer of an incoming [`OnionMessage`].
900 ///
901 /// Returns either the next layer of the onion for forwarding or the decrypted content for the
902 /// receiver.
903 pub fn peel_onion_message<NS: Deref, L: Deref, CMH: Deref>(
904         msg: &OnionMessage, secp_ctx: &Secp256k1<secp256k1::All>, node_signer: NS, logger: L,
905         custom_handler: CMH,
906 ) -> Result<PeeledOnion<<<CMH>::Target as CustomOnionMessageHandler>::CustomMessage>, ()>
907 where
908         NS::Target: NodeSigner,
909         L::Target: Logger,
910         CMH::Target: CustomOnionMessageHandler,
911 {
912         let control_tlvs_ss = match node_signer.ecdh(Recipient::Node, &msg.blinding_point, None) {
913                 Ok(ss) => ss,
914                 Err(e) =>  {
915                         log_error!(logger, "Failed to retrieve node secret: {:?}", e);
916                         return Err(());
917                 }
918         };
919         let onion_decode_ss = {
920                 let blinding_factor = {
921                         let mut hmac = HmacEngine::<Sha256>::new(b"blinded_node_id");
922                         hmac.input(control_tlvs_ss.as_ref());
923                         Hmac::from_engine(hmac).to_byte_array()
924                 };
925                 match node_signer.ecdh(Recipient::Node, &msg.onion_routing_packet.public_key,
926                         Some(&Scalar::from_be_bytes(blinding_factor).unwrap()))
927                 {
928                         Ok(ss) => ss.secret_bytes(),
929                         Err(()) => {
930                                 log_trace!(logger, "Failed to compute onion packet shared secret");
931                                 return Err(());
932                         }
933                 }
934         };
935         match onion_utils::decode_next_untagged_hop(
936                 onion_decode_ss, &msg.onion_routing_packet.hop_data[..], msg.onion_routing_packet.hmac,
937                 (control_tlvs_ss, custom_handler.deref(), logger.deref())
938         ) {
939                 Ok((Payload::Receive::<ParsedOnionMessageContents<<<CMH as Deref>::Target as CustomOnionMessageHandler>::CustomMessage>> {
940                         message, control_tlvs: ReceiveControlTlvs::Unblinded(ReceiveTlvs { path_id }), reply_path,
941                 }, None)) => {
942                         Ok(PeeledOnion::Receive(message, path_id, reply_path))
943                 },
944                 Ok((Payload::Forward(ForwardControlTlvs::Unblinded(ForwardTlvs {
945                         next_hop, next_blinding_override
946                 })), Some((next_hop_hmac, new_packet_bytes)))) => {
947                         // TODO: we need to check whether `next_hop` is our node, in which case this is a dummy
948                         // blinded hop and this onion message is destined for us. In this situation, we should keep
949                         // unwrapping the onion layers to get to the final payload. Since we don't have the option
950                         // of creating blinded paths with dummy hops currently, we should be ok to not handle this
951                         // for now.
952                         let new_pubkey = match onion_utils::next_hop_pubkey(&secp_ctx, msg.onion_routing_packet.public_key, &onion_decode_ss) {
953                                 Ok(pk) => pk,
954                                 Err(e) => {
955                                         log_trace!(logger, "Failed to compute next hop packet pubkey: {}", e);
956                                         return Err(())
957                                 }
958                         };
959                         let outgoing_packet = Packet {
960                                 version: 0,
961                                 public_key: new_pubkey,
962                                 hop_data: new_packet_bytes,
963                                 hmac: next_hop_hmac,
964                         };
965                         let onion_message = OnionMessage {
966                                 blinding_point: match next_blinding_override {
967                                         Some(blinding_point) => blinding_point,
968                                         None => {
969                                                 match onion_utils::next_hop_pubkey(
970                                                         &secp_ctx, msg.blinding_point, control_tlvs_ss.as_ref()
971                                                 ) {
972                                                         Ok(bp) => bp,
973                                                         Err(e) => {
974                                                                 log_trace!(logger, "Failed to compute next blinding point: {}", e);
975                                                                 return Err(())
976                                                         }
977                                                 }
978                                         }
979                                 },
980                                 onion_routing_packet: outgoing_packet,
981                         };
982
983                         Ok(PeeledOnion::Forward(next_hop, onion_message))
984                 },
985                 Err(e) => {
986                         log_trace!(logger, "Errored decoding onion message packet: {:?}", e);
987                         Err(())
988                 },
989                 _ => {
990                         log_trace!(logger, "Received bogus onion message packet, either the sender encoded a final hop as a forwarding hop or vice versa");
991                         Err(())
992                 },
993         }
994 }
995
996 impl<ES: Deref, NS: Deref, L: Deref, NL: Deref, MR: Deref, OMH: Deref, CMH: Deref>
997 OnionMessenger<ES, NS, L, NL, MR, OMH, CMH>
998 where
999         ES::Target: EntropySource,
1000         NS::Target: NodeSigner,
1001         L::Target: Logger,
1002         NL::Target: NodeIdLookUp,
1003         MR::Target: MessageRouter,
1004         OMH::Target: OffersMessageHandler,
1005         CMH::Target: CustomOnionMessageHandler,
1006 {
1007         /// Constructs a new `OnionMessenger` to send, forward, and delegate received onion messages to
1008         /// their respective handlers.
1009         pub fn new(
1010                 entropy_source: ES, node_signer: NS, logger: L, node_id_lookup: NL, message_router: MR,
1011                 offers_handler: OMH, custom_handler: CMH
1012         ) -> Self {
1013                 Self::new_inner(
1014                         entropy_source, node_signer, logger, node_id_lookup, message_router,
1015                         offers_handler, custom_handler, false
1016                 )
1017         }
1018
1019         /// Similar to [`Self::new`], but rather than dropping onion messages that are
1020         /// intended to be forwarded to offline peers, we will intercept them for
1021         /// later forwarding.
1022         ///
1023         /// Interception flow:
1024         /// 1. If an onion message for an offline peer is received, `OnionMessenger` will
1025         ///    generate an [`Event::OnionMessageIntercepted`]. Event handlers can
1026         ///    then choose to persist this onion message for later forwarding, or drop
1027         ///    it.
1028         /// 2. When the offline peer later comes back online, `OnionMessenger` will
1029         ///    generate an [`Event::OnionMessagePeerConnected`]. Event handlers will
1030         ///    then fetch all previously intercepted onion messages for this peer.
1031         /// 3. Once the stored onion messages are fetched, they can finally be
1032         ///    forwarded to the now-online peer via [`Self::forward_onion_message`].
1033         ///
1034         /// # Note
1035         ///
1036         /// LDK will not rate limit how many [`Event::OnionMessageIntercepted`]s
1037         /// are generated, so it is the caller's responsibility to limit how many
1038         /// onion messages are persisted and only persist onion messages for relevant
1039         /// peers.
1040         pub fn new_with_offline_peer_interception(
1041                 entropy_source: ES, node_signer: NS, logger: L, node_id_lookup: NL,
1042                 message_router: MR, offers_handler: OMH, custom_handler: CMH
1043         ) -> Self {
1044                 Self::new_inner(
1045                         entropy_source, node_signer, logger, node_id_lookup, message_router,
1046                         offers_handler, custom_handler, true
1047                 )
1048         }
1049
1050         fn new_inner(
1051                 entropy_source: ES, node_signer: NS, logger: L, node_id_lookup: NL,
1052                 message_router: MR, offers_handler: OMH, custom_handler: CMH,
1053                 intercept_messages_for_offline_peers: bool
1054         ) -> Self {
1055                 let mut secp_ctx = Secp256k1::new();
1056                 secp_ctx.seeded_randomize(&entropy_source.get_secure_random_bytes());
1057                 OnionMessenger {
1058                         entropy_source,
1059                         node_signer,
1060                         message_recipients: Mutex::new(new_hash_map()),
1061                         secp_ctx,
1062                         logger,
1063                         node_id_lookup,
1064                         message_router,
1065                         offers_handler,
1066                         custom_handler,
1067                         intercept_messages_for_offline_peers,
1068                         pending_events: Mutex::new(PendingEvents {
1069                                 intercepted_msgs: Vec::new(),
1070                                 peer_connecteds: Vec::new(),
1071                         }),
1072                 }
1073         }
1074
1075         #[cfg(test)]
1076         pub(crate) fn set_offers_handler(&mut self, offers_handler: OMH) {
1077                 self.offers_handler = offers_handler;
1078         }
1079
1080         /// Sends an [`OnionMessage`] with the given `contents` to `destination`.
1081         ///
1082         /// See [`OnionMessenger`] for example usage.
1083         pub fn send_onion_message<T: OnionMessageContents>(
1084                 &self, contents: T, destination: Destination, reply_path: Option<BlindedPath>
1085         ) -> Result<SendSuccess, SendError> {
1086                 self.find_path_and_enqueue_onion_message(
1087                         contents, destination, reply_path, format_args!("")
1088                 )
1089         }
1090
1091         fn find_path_and_enqueue_onion_message<T: OnionMessageContents>(
1092                 &self, contents: T, destination: Destination, reply_path: Option<BlindedPath>,
1093                 log_suffix: fmt::Arguments
1094         ) -> Result<SendSuccess, SendError> {
1095                 let mut logger = WithContext::from(&self.logger, None, None, None);
1096                 let result = self.find_path(destination).and_then(|path| {
1097                         let first_hop = path.intermediate_nodes.get(0).map(|p| *p);
1098                         logger = WithContext::from(&self.logger, first_hop, None, None);
1099                         self.enqueue_onion_message(path, contents, reply_path, log_suffix)
1100                 });
1101
1102                 match result.as_ref() {
1103                         Err(SendError::GetNodeIdFailed) => {
1104                                 log_warn!(logger, "Unable to retrieve node id {}", log_suffix);
1105                         },
1106                         Err(SendError::PathNotFound) => {
1107                                 log_trace!(logger, "Failed to find path {}", log_suffix);
1108                         },
1109                         Err(e) => {
1110                                 log_trace!(logger, "Failed sending onion message {}: {:?}", log_suffix, e);
1111                         },
1112                         Ok(SendSuccess::Buffered) => {
1113                                 log_trace!(logger, "Buffered onion message {}", log_suffix);
1114                         },
1115                         Ok(SendSuccess::BufferedAwaitingConnection(node_id)) => {
1116                                 log_trace!(
1117                                         logger,
1118                                         "Buffered onion message waiting on peer connection {}: {}",
1119                                         log_suffix, node_id
1120                                 );
1121                         },
1122                 }
1123
1124                 result
1125         }
1126
1127         fn find_path(&self, destination: Destination) -> Result<OnionMessagePath, SendError> {
1128                 let sender = self.node_signer
1129                         .get_node_id(Recipient::Node)
1130                         .map_err(|_| SendError::GetNodeIdFailed)?;
1131
1132                 let peers = self.message_recipients.lock().unwrap()
1133                         .iter()
1134                         .filter(|(_, recipient)| matches!(recipient, OnionMessageRecipient::ConnectedPeer(_)))
1135                         .map(|(node_id, _)| *node_id)
1136                         .collect();
1137
1138                 self.message_router
1139                         .find_path(sender, peers, destination)
1140                         .map_err(|_| SendError::PathNotFound)
1141         }
1142
1143         fn create_blinded_path(&self) -> Result<BlindedPath, SendError> {
1144                 let recipient = self.node_signer
1145                         .get_node_id(Recipient::Node)
1146                         .map_err(|_| SendError::GetNodeIdFailed)?;
1147                 let secp_ctx = &self.secp_ctx;
1148
1149                 let peers = self.message_recipients.lock().unwrap()
1150                         .iter()
1151                         .filter(|(_, peer)| matches!(peer, OnionMessageRecipient::ConnectedPeer(_)))
1152                         .map(|(node_id, _ )| *node_id)
1153                         .collect::<Vec<_>>();
1154
1155                 self.message_router
1156                         .create_blinded_paths(recipient, peers, secp_ctx)
1157                         .and_then(|paths| paths.into_iter().next().ok_or(()))
1158                         .map_err(|_| SendError::PathNotFound)
1159         }
1160
1161         fn enqueue_onion_message<T: OnionMessageContents>(
1162                 &self, path: OnionMessagePath, contents: T, reply_path: Option<BlindedPath>,
1163                 log_suffix: fmt::Arguments
1164         ) -> Result<SendSuccess, SendError> {
1165                 log_trace!(self.logger, "Constructing onion message {}: {:?}", log_suffix, contents);
1166
1167                 let (first_node_id, onion_message, addresses) = create_onion_message(
1168                         &self.entropy_source, &self.node_signer, &self.node_id_lookup, &self.secp_ctx, path,
1169                         contents, reply_path,
1170                 )?;
1171
1172                 let mut message_recipients = self.message_recipients.lock().unwrap();
1173                 if outbound_buffer_full(&first_node_id, &message_recipients) {
1174                         return Err(SendError::BufferFull);
1175                 }
1176
1177                 match message_recipients.entry(first_node_id) {
1178                         hash_map::Entry::Vacant(e) => match addresses {
1179                                 None => Err(SendError::InvalidFirstHop(first_node_id)),
1180                                 Some(addresses) => {
1181                                         e.insert(OnionMessageRecipient::pending_connection(addresses))
1182                                                 .enqueue_message(onion_message);
1183                                         Ok(SendSuccess::BufferedAwaitingConnection(first_node_id))
1184                                 },
1185                         },
1186                         hash_map::Entry::Occupied(mut e) => {
1187                                 e.get_mut().enqueue_message(onion_message);
1188                                 if e.get().is_connected() {
1189                                         Ok(SendSuccess::Buffered)
1190                                 } else {
1191                                         Ok(SendSuccess::BufferedAwaitingConnection(first_node_id))
1192                                 }
1193                         },
1194                 }
1195         }
1196
1197         /// Forwards an [`OnionMessage`] to `peer_node_id`. Useful if we initialized
1198         /// the [`OnionMessenger`] with [`Self::new_with_offline_peer_interception`]
1199         /// and want to forward a previously intercepted onion message to a peer that
1200         /// has just come online.
1201         pub fn forward_onion_message(
1202                 &self, message: OnionMessage, peer_node_id: &PublicKey
1203         ) -> Result<(), SendError> {
1204                 let mut message_recipients = self.message_recipients.lock().unwrap();
1205                 if outbound_buffer_full(&peer_node_id, &message_recipients) {
1206                         return Err(SendError::BufferFull);
1207                 }
1208
1209                 match message_recipients.entry(*peer_node_id) {
1210                         hash_map::Entry::Occupied(mut e) if e.get().is_connected() => {
1211                                 e.get_mut().enqueue_message(message);
1212                                 Ok(())
1213                         },
1214                         _ => Err(SendError::InvalidFirstHop(*peer_node_id))
1215                 }
1216         }
1217
1218         #[cfg(any(test, feature = "_test_utils"))]
1219         pub fn send_onion_message_using_path<T: OnionMessageContents>(
1220                 &self, path: OnionMessagePath, contents: T, reply_path: Option<BlindedPath>
1221         ) -> Result<SendSuccess, SendError> {
1222                 self.enqueue_onion_message(path, contents, reply_path, format_args!(""))
1223         }
1224
1225         pub(crate) fn peel_onion_message(
1226                 &self, msg: &OnionMessage
1227         ) -> Result<PeeledOnion<<<CMH>::Target as CustomOnionMessageHandler>::CustomMessage>, ()> {
1228                 peel_onion_message(
1229                         msg, &self.secp_ctx, &*self.node_signer, &*self.logger, &*self.custom_handler
1230                 )
1231         }
1232
1233         /// Handles the response to an [`OnionMessage`] based on its [`ResponseInstruction`],
1234         /// enqueueing any response for sending.
1235         ///
1236         /// This function is useful for asynchronous handling of [`OnionMessage`]s.
1237         /// Handlers have the option to return [`ResponseInstruction::NoResponse`], indicating that
1238         /// no immediate response should be sent. Then, they can transfer the associated [`Responder`]
1239         /// to another task responsible for generating the response asynchronously. Subsequently, when
1240         /// the response is prepared and ready for sending, that task can invoke this method to enqueue
1241         /// the response for delivery.
1242         pub fn handle_onion_message_response<T: OnionMessageContents>(
1243                 &self, response: ResponseInstruction<T>
1244         ) -> Result<Option<SendSuccess>, SendError> {
1245                 let (response, create_reply_path) = match response {
1246                         ResponseInstruction::WithReplyPath(response) => (response, true),
1247                         ResponseInstruction::WithoutReplyPath(response) => (response, false),
1248                         ResponseInstruction::NoResponse => return Ok(None),
1249                 };
1250
1251                 let message_type = response.message.msg_type();
1252                 let reply_path = if create_reply_path {
1253                         match self.create_blinded_path() {
1254                                 Ok(reply_path) => Some(reply_path),
1255                                 Err(err) => {
1256                                         log_trace!(
1257                                                 self.logger,
1258                                                 "Failed to create reply path when responding with {} to an onion message \
1259                                                 with path_id {:02x?}: {:?}",
1260                                                 message_type, response.path_id, err
1261                                         );
1262                                         return Err(err);
1263                                 }
1264                         }
1265                 } else { None };
1266
1267                 self.find_path_and_enqueue_onion_message(
1268                         response.message, Destination::BlindedPath(response.reply_path), reply_path,
1269                         format_args!(
1270                                 "when responding with {} to an onion message with path_id {:02x?}",
1271                                 message_type,
1272                                 response.path_id
1273                         )
1274                 ).map(|result| Some(result))
1275         }
1276
1277         #[cfg(test)]
1278         pub(super) fn release_pending_msgs(&self) -> HashMap<PublicKey, VecDeque<OnionMessage>> {
1279                 let mut message_recipients = self.message_recipients.lock().unwrap();
1280                 let mut msgs = new_hash_map();
1281                 // We don't want to disconnect the peers by removing them entirely from the original map, so we
1282                 // release the pending message buffers individually.
1283                 for (node_id, recipient) in &mut *message_recipients {
1284                         msgs.insert(*node_id, recipient.release_pending_messages());
1285                 }
1286                 msgs
1287         }
1288
1289         fn enqueue_intercepted_event(&self, event: Event) {
1290                 const MAX_EVENTS_BUFFER_SIZE: usize = (1 << 10) * 256;
1291                 let mut pending_events = self.pending_events.lock().unwrap();
1292                 let total_buffered_bytes: usize =
1293                         pending_events.intercepted_msgs.iter().map(|ev| ev.serialized_length()).sum();
1294                 if total_buffered_bytes >= MAX_EVENTS_BUFFER_SIZE {
1295                         log_trace!(self.logger, "Dropping event {:?}: buffer full", event);
1296                         return
1297                 }
1298                 pending_events.intercepted_msgs.push(event);
1299         }
1300
1301         /// Processes any events asynchronously using the given handler.
1302         ///
1303         /// Note that the event handler is called in the order each event was generated, however
1304         /// futures are polled in parallel for some events to allow for parallelism where events do not
1305         /// have an ordering requirement.
1306         ///
1307         /// See the trait-level documentation of [`EventsProvider`] for requirements.
1308         pub async fn process_pending_events_async<Future: core::future::Future<Output = ()> + core::marker::Unpin, H: Fn(Event) -> Future>(
1309                 &self, handler: H
1310         ) {
1311                 let mut intercepted_msgs = Vec::new();
1312                 let mut peer_connecteds = Vec::new();
1313                 {
1314                         let mut pending_events = self.pending_events.lock().unwrap();
1315                         core::mem::swap(&mut pending_events.intercepted_msgs, &mut intercepted_msgs);
1316                         core::mem::swap(&mut pending_events.peer_connecteds, &mut peer_connecteds);
1317                 }
1318
1319                 let mut futures = Vec::with_capacity(intercepted_msgs.len());
1320                 for (node_id, recipient) in self.message_recipients.lock().unwrap().iter_mut() {
1321                         if let OnionMessageRecipient::PendingConnection(_, addresses, _) = recipient {
1322                                 if let Some(addresses) = addresses.take() {
1323                                         futures.push(Some(handler(Event::ConnectionNeeded { node_id: *node_id, addresses })));
1324                                 }
1325                         }
1326                 }
1327
1328                 for ev in intercepted_msgs {
1329                         if let Event::OnionMessageIntercepted { .. } = ev {} else { debug_assert!(false); }
1330                         futures.push(Some(handler(ev)));
1331                 }
1332                 // Let the `OnionMessageIntercepted` events finish before moving on to peer_connecteds
1333                 crate::util::async_poll::MultiFuturePoller(futures).await;
1334
1335                 if peer_connecteds.len() <= 1 {
1336                         for event in peer_connecteds { handler(event).await; }
1337                 } else {
1338                         let mut futures = Vec::new();
1339                         for event in peer_connecteds {
1340                                 futures.push(Some(handler(event)));
1341                         }
1342                         crate::util::async_poll::MultiFuturePoller(futures).await;
1343                 }
1344         }
1345 }
1346
1347 fn outbound_buffer_full(peer_node_id: &PublicKey, buffer: &HashMap<PublicKey, OnionMessageRecipient>) -> bool {
1348         const MAX_TOTAL_BUFFER_SIZE: usize = (1 << 20) * 128;
1349         const MAX_PER_PEER_BUFFER_SIZE: usize = (1 << 10) * 256;
1350         let mut total_buffered_bytes = 0;
1351         let mut peer_buffered_bytes = 0;
1352         for (pk, peer_buf) in buffer {
1353                 for om in peer_buf.pending_messages() {
1354                         let om_len = om.serialized_length();
1355                         if pk == peer_node_id {
1356                                 peer_buffered_bytes += om_len;
1357                         }
1358                         total_buffered_bytes += om_len;
1359
1360                         if total_buffered_bytes >= MAX_TOTAL_BUFFER_SIZE ||
1361                                 peer_buffered_bytes >= MAX_PER_PEER_BUFFER_SIZE
1362                         {
1363                                 return true
1364                         }
1365                 }
1366         }
1367         false
1368 }
1369
1370 impl<ES: Deref, NS: Deref, L: Deref, NL: Deref, MR: Deref, OMH: Deref, CMH: Deref> EventsProvider
1371 for OnionMessenger<ES, NS, L, NL, MR, OMH, CMH>
1372 where
1373         ES::Target: EntropySource,
1374         NS::Target: NodeSigner,
1375         L::Target: Logger,
1376         NL::Target: NodeIdLookUp,
1377         MR::Target: MessageRouter,
1378         OMH::Target: OffersMessageHandler,
1379         CMH::Target: CustomOnionMessageHandler,
1380 {
1381         fn process_pending_events<H: Deref>(&self, handler: H) where H::Target: EventHandler {
1382                 for (node_id, recipient) in self.message_recipients.lock().unwrap().iter_mut() {
1383                         if let OnionMessageRecipient::PendingConnection(_, addresses, _) = recipient {
1384                                 if let Some(addresses) = addresses.take() {
1385                                         handler.handle_event(Event::ConnectionNeeded { node_id: *node_id, addresses });
1386                                 }
1387                         }
1388                 }
1389                 let mut events = Vec::new();
1390                 {
1391                         let mut pending_events = self.pending_events.lock().unwrap();
1392                         #[cfg(debug_assertions)] {
1393                                 for ev in pending_events.intercepted_msgs.iter() {
1394                                         if let Event::OnionMessageIntercepted { .. } = ev {} else { panic!(); }
1395                                 }
1396                                 for ev in pending_events.peer_connecteds.iter() {
1397                                         if let Event::OnionMessagePeerConnected { .. } = ev {} else { panic!(); }
1398                                 }
1399                         }
1400                         core::mem::swap(&mut pending_events.intercepted_msgs, &mut events);
1401                         events.append(&mut pending_events.peer_connecteds);
1402                         pending_events.peer_connecteds.shrink_to(10); // Limit total heap usage
1403                 }
1404                 for ev in events {
1405                         handler.handle_event(ev);
1406                 }
1407         }
1408 }
1409
1410 impl<ES: Deref, NS: Deref, L: Deref, NL: Deref, MR: Deref, OMH: Deref, CMH: Deref> OnionMessageHandler
1411 for OnionMessenger<ES, NS, L, NL, MR, OMH, CMH>
1412 where
1413         ES::Target: EntropySource,
1414         NS::Target: NodeSigner,
1415         L::Target: Logger,
1416         NL::Target: NodeIdLookUp,
1417         MR::Target: MessageRouter,
1418         OMH::Target: OffersMessageHandler,
1419         CMH::Target: CustomOnionMessageHandler,
1420 {
1421         fn handle_onion_message(&self, peer_node_id: &PublicKey, msg: &OnionMessage) {
1422                 let logger = WithContext::from(&self.logger, Some(*peer_node_id), None, None);
1423                 match self.peel_onion_message(msg) {
1424                         Ok(PeeledOnion::Receive(message, path_id, reply_path)) => {
1425                                 log_trace!(
1426                                         logger,
1427                                         "Received an onion message with path_id {:02x?} and {} reply_path: {:?}",
1428                                         path_id, if reply_path.is_some() { "a" } else { "no" }, message);
1429
1430                                 match message {
1431                                         ParsedOnionMessageContents::Offers(msg) => {
1432                                                 let responder = reply_path.map(
1433                                                         |reply_path| Responder::new(reply_path, path_id)
1434                                                 );
1435                                                 let response_instructions = self.offers_handler.handle_message(msg, responder);
1436                                                 let _ = self.handle_onion_message_response(response_instructions);
1437                                         },
1438                                         ParsedOnionMessageContents::Custom(msg) => {
1439                                                 let responder = reply_path.map(
1440                                                         |reply_path| Responder::new(reply_path, path_id)
1441                                                 );
1442                                                 let response_instructions = self.custom_handler.handle_custom_message(msg, responder);
1443                                                 let _ = self.handle_onion_message_response(response_instructions);
1444                                         },
1445                                 }
1446                         },
1447                         Ok(PeeledOnion::Forward(next_hop, onion_message)) => {
1448                                 let next_node_id = match next_hop {
1449                                         NextMessageHop::NodeId(pubkey) => pubkey,
1450                                         NextMessageHop::ShortChannelId(scid) => match self.node_id_lookup.next_node_id(scid) {
1451                                                 Some(pubkey) => pubkey,
1452                                                 None => {
1453                                                         log_trace!(self.logger, "Dropping forwarded onion messager: unable to resolve next hop using SCID {}", scid);
1454                                                         return
1455                                                 },
1456                                         },
1457                                 };
1458
1459                                 let mut message_recipients = self.message_recipients.lock().unwrap();
1460                                 if outbound_buffer_full(&next_node_id, &message_recipients) {
1461                                         log_trace!(
1462                                                 logger,
1463                                                 "Dropping forwarded onion message to peer {}: outbound buffer full",
1464                                                 next_node_id);
1465                                         return
1466                                 }
1467
1468                                 #[cfg(fuzzing)]
1469                                 message_recipients
1470                                         .entry(next_node_id)
1471                                         .or_insert_with(|| OnionMessageRecipient::ConnectedPeer(VecDeque::new()));
1472
1473                                 match message_recipients.entry(next_node_id) {
1474                                         hash_map::Entry::Occupied(mut e) if matches!(
1475                                                 e.get(), OnionMessageRecipient::ConnectedPeer(..)
1476                                         ) => {
1477                                                 e.get_mut().enqueue_message(onion_message);
1478                                                 log_trace!(logger, "Forwarding an onion message to peer {}", next_node_id);
1479                                         },
1480                                         _ if self.intercept_messages_for_offline_peers => {
1481                                                 self.enqueue_intercepted_event(
1482                                                         Event::OnionMessageIntercepted {
1483                                                                 peer_node_id: next_node_id, message: onion_message
1484                                                         }
1485                                                 );
1486                                         },
1487                                         _ => {
1488                                                 log_trace!(
1489                                                         logger,
1490                                                         "Dropping forwarded onion message to disconnected peer {}",
1491                                                         next_node_id);
1492                                                 return
1493                                         },
1494                                 }
1495                         },
1496                         Err(e) => {
1497                                 log_error!(logger, "Failed to process onion message {:?}", e);
1498                         }
1499                 }
1500         }
1501
1502         fn peer_connected(&self, their_node_id: &PublicKey, init: &msgs::Init, _inbound: bool) -> Result<(), ()> {
1503                 if init.features.supports_onion_messages() {
1504                         self.message_recipients.lock().unwrap()
1505                                 .entry(*their_node_id)
1506                                 .or_insert_with(|| OnionMessageRecipient::ConnectedPeer(VecDeque::new()))
1507                                 .mark_connected();
1508                         if self.intercept_messages_for_offline_peers {
1509                                 self.pending_events.lock().unwrap().peer_connecteds.push(
1510                                         Event::OnionMessagePeerConnected { peer_node_id: *their_node_id }
1511                                 );
1512                         }
1513                 } else {
1514                         self.message_recipients.lock().unwrap().remove(their_node_id);
1515                 }
1516
1517                 Ok(())
1518         }
1519
1520         fn peer_disconnected(&self, their_node_id: &PublicKey) {
1521                 match self.message_recipients.lock().unwrap().remove(their_node_id) {
1522                         Some(OnionMessageRecipient::ConnectedPeer(..)) => {},
1523                         Some(_) => debug_assert!(false),
1524                         None => {},
1525                 }
1526         }
1527
1528         fn timer_tick_occurred(&self) {
1529                 let mut message_recipients = self.message_recipients.lock().unwrap();
1530
1531                 // Drop any pending recipients since the last call to avoid retaining buffered messages for
1532                 // too long.
1533                 message_recipients.retain(|_, recipient| match recipient {
1534                         OnionMessageRecipient::PendingConnection(_, None, ticks) => *ticks < MAX_TIMER_TICKS,
1535                         OnionMessageRecipient::PendingConnection(_, Some(_), _) => true,
1536                         _ => true,
1537                 });
1538
1539                 // Increment a timer tick for pending recipients so that their buffered messages are dropped
1540                 // at MAX_TIMER_TICKS.
1541                 for recipient in message_recipients.values_mut() {
1542                         if let OnionMessageRecipient::PendingConnection(_, None, ticks) = recipient {
1543                                 *ticks += 1;
1544                         }
1545                 }
1546         }
1547
1548         fn provided_node_features(&self) -> NodeFeatures {
1549                 let mut features = NodeFeatures::empty();
1550                 features.set_onion_messages_optional();
1551                 features
1552         }
1553
1554         fn provided_init_features(&self, _their_node_id: &PublicKey) -> InitFeatures {
1555                 let mut features = InitFeatures::empty();
1556                 features.set_onion_messages_optional();
1557                 features
1558         }
1559
1560         // Before returning any messages to send for the peer, this method will see if any messages were
1561         // enqueued in the handler by users, find a path to the corresponding blinded path's introduction
1562         // node, and then enqueue the message for sending to the first peer in the full path.
1563         fn next_onion_message_for_peer(&self, peer_node_id: PublicKey) -> Option<OnionMessage> {
1564                 // Enqueue any initiating `OffersMessage`s to send.
1565                 for message in self.offers_handler.release_pending_messages() {
1566                         #[cfg(not(c_bindings))]
1567                         let PendingOnionMessage { contents, destination, reply_path } = message;
1568                         #[cfg(c_bindings)]
1569                         let (contents, destination, reply_path) = message;
1570                         let _ = self.find_path_and_enqueue_onion_message(
1571                                 contents, destination, reply_path, format_args!("when sending OffersMessage")
1572                         );
1573                 }
1574
1575                 // Enqueue any initiating `CustomMessage`s to send.
1576                 for message in self.custom_handler.release_pending_custom_messages() {
1577                         #[cfg(not(c_bindings))]
1578                         let PendingOnionMessage { contents, destination, reply_path } = message;
1579                         #[cfg(c_bindings)]
1580                         let (contents, destination, reply_path) = message;
1581                         let _ = self.find_path_and_enqueue_onion_message(
1582                                 contents, destination, reply_path, format_args!("when sending CustomMessage")
1583                         );
1584                 }
1585
1586                 self.message_recipients.lock().unwrap()
1587                         .get_mut(&peer_node_id)
1588                         .and_then(|buffer| buffer.dequeue_message())
1589         }
1590 }
1591
1592 // TODO: parameterize the below Simple* types with OnionMessenger and handle the messages it
1593 // produces
1594 /// Useful for simplifying the parameters of [`SimpleArcChannelManager`] and
1595 /// [`SimpleArcPeerManager`]. See their docs for more details.
1596 ///
1597 /// This is not exported to bindings users as type aliases aren't supported in most languages.
1598 ///
1599 /// [`SimpleArcChannelManager`]: crate::ln::channelmanager::SimpleArcChannelManager
1600 /// [`SimpleArcPeerManager`]: crate::ln::peer_handler::SimpleArcPeerManager
1601 #[cfg(not(c_bindings))]
1602 pub type SimpleArcOnionMessenger<M, T, F, L> = OnionMessenger<
1603         Arc<KeysManager>,
1604         Arc<KeysManager>,
1605         Arc<L>,
1606         Arc<SimpleArcChannelManager<M, T, F, L>>,
1607         Arc<DefaultMessageRouter<Arc<NetworkGraph<Arc<L>>>, Arc<L>, Arc<KeysManager>>>,
1608         Arc<SimpleArcChannelManager<M, T, F, L>>,
1609         IgnoringMessageHandler
1610 >;
1611
1612 /// Useful for simplifying the parameters of [`SimpleRefChannelManager`] and
1613 /// [`SimpleRefPeerManager`]. See their docs for more details.
1614 ///
1615 /// This is not exported to bindings users as type aliases aren't supported in most languages.
1616 ///
1617 /// [`SimpleRefChannelManager`]: crate::ln::channelmanager::SimpleRefChannelManager
1618 /// [`SimpleRefPeerManager`]: crate::ln::peer_handler::SimpleRefPeerManager
1619 #[cfg(not(c_bindings))]
1620 pub type SimpleRefOnionMessenger<
1621         'a, 'b, 'c, 'd, 'e, 'f, 'g, 'h, 'i, 'j, M, T, F, L
1622 > = OnionMessenger<
1623         &'a KeysManager,
1624         &'a KeysManager,
1625         &'b L,
1626         &'i SimpleRefChannelManager<'a, 'b, 'c, 'd, 'e, 'f, 'g, 'h, M, T, F, L>,
1627         &'j DefaultMessageRouter<&'g NetworkGraph<&'b L>, &'b L, &'a KeysManager>,
1628         &'i SimpleRefChannelManager<'a, 'b, 'c, 'd, 'e, 'f, 'g, 'h, M, T, F, L>,
1629         IgnoringMessageHandler
1630 >;
1631
1632 /// Construct onion packet payloads and keys for sending an onion message along the given
1633 /// `unblinded_path` to the given `destination`.
1634 fn packet_payloads_and_keys<T: OnionMessageContents, S: secp256k1::Signing + secp256k1::Verification>(
1635         secp_ctx: &Secp256k1<S>, unblinded_path: &[PublicKey], destination: Destination, message: T,
1636         mut reply_path: Option<BlindedPath>, session_priv: &SecretKey
1637 ) -> Result<(Vec<(Payload<T>, [u8; 32])>, Vec<onion_utils::OnionKeys>), SendError> {
1638         let num_hops = unblinded_path.len() + destination.num_hops();
1639         let mut payloads = Vec::with_capacity(num_hops);
1640         let mut onion_packet_keys = Vec::with_capacity(num_hops);
1641
1642         let (mut intro_node_id_blinding_pt, num_blinded_hops) = match &destination {
1643                 Destination::Node(_) => (None, 0),
1644                 Destination::BlindedPath(BlindedPath { introduction_node, blinding_point, blinded_hops }) => {
1645                         let introduction_node_id = match introduction_node {
1646                                 IntroductionNode::NodeId(pubkey) => pubkey,
1647                                 IntroductionNode::DirectedShortChannelId(..) => {
1648                                         return Err(SendError::UnresolvedIntroductionNode);
1649                                 },
1650                         };
1651                         (Some((*introduction_node_id, *blinding_point)), blinded_hops.len())
1652                 },
1653         };
1654         let num_unblinded_hops = num_hops - num_blinded_hops;
1655
1656         let mut unblinded_path_idx = 0;
1657         let mut blinded_path_idx = 0;
1658         let mut prev_control_tlvs_ss = None;
1659         let mut final_control_tlvs = None;
1660         utils::construct_keys_callback(secp_ctx, unblinded_path.iter(), Some(destination), session_priv,
1661                 |_, onion_packet_ss, ephemeral_pubkey, control_tlvs_ss, unblinded_pk_opt, enc_payload_opt| {
1662                         if num_unblinded_hops != 0 && unblinded_path_idx < num_unblinded_hops {
1663                                 if let Some(ss) = prev_control_tlvs_ss.take() {
1664                                         payloads.push((Payload::Forward(ForwardControlTlvs::Unblinded(
1665                                                 ForwardTlvs {
1666                                                         next_hop: NextMessageHop::NodeId(unblinded_pk_opt.unwrap()),
1667                                                         next_blinding_override: None,
1668                                                 }
1669                                         )), ss));
1670                                 }
1671                                 prev_control_tlvs_ss = Some(control_tlvs_ss);
1672                                 unblinded_path_idx += 1;
1673                         } else if let Some((intro_node_id, blinding_pt)) = intro_node_id_blinding_pt.take() {
1674                                 if let Some(control_tlvs_ss) = prev_control_tlvs_ss.take() {
1675                                         payloads.push((Payload::Forward(ForwardControlTlvs::Unblinded(ForwardTlvs {
1676                                                 next_hop: NextMessageHop::NodeId(intro_node_id),
1677                                                 next_blinding_override: Some(blinding_pt),
1678                                         })), control_tlvs_ss));
1679                                 }
1680                         }
1681                         if blinded_path_idx < num_blinded_hops.saturating_sub(1) && enc_payload_opt.is_some() {
1682                                 payloads.push((Payload::Forward(ForwardControlTlvs::Blinded(enc_payload_opt.unwrap())),
1683                                         control_tlvs_ss));
1684                                 blinded_path_idx += 1;
1685                         } else if let Some(encrypted_payload) = enc_payload_opt {
1686                                 final_control_tlvs = Some(ReceiveControlTlvs::Blinded(encrypted_payload));
1687                                 prev_control_tlvs_ss = Some(control_tlvs_ss);
1688                         }
1689
1690                         let (rho, mu) = onion_utils::gen_rho_mu_from_shared_secret(onion_packet_ss.as_ref());
1691                         onion_packet_keys.push(onion_utils::OnionKeys {
1692                                 #[cfg(test)]
1693                                 shared_secret: onion_packet_ss,
1694                                 #[cfg(test)]
1695                                 blinding_factor: [0; 32],
1696                                 ephemeral_pubkey,
1697                                 rho,
1698                                 mu,
1699                         });
1700                 }
1701         ).map_err(|e| SendError::Secp256k1(e))?;
1702
1703         if let Some(control_tlvs) = final_control_tlvs {
1704                 payloads.push((Payload::Receive {
1705                         control_tlvs,
1706                         reply_path: reply_path.take(),
1707                         message,
1708                 }, prev_control_tlvs_ss.unwrap()));
1709         } else {
1710                 payloads.push((Payload::Receive {
1711                         control_tlvs: ReceiveControlTlvs::Unblinded(ReceiveTlvs { path_id: None, }),
1712                         reply_path: reply_path.take(),
1713                         message,
1714                 }, prev_control_tlvs_ss.unwrap()));
1715         }
1716
1717         Ok((payloads, onion_packet_keys))
1718 }
1719
1720 /// Errors if the serialized payload size exceeds onion_message::BIG_PACKET_HOP_DATA_LEN
1721 fn construct_onion_message_packet<T: OnionMessageContents>(payloads: Vec<(Payload<T>, [u8; 32])>, onion_keys: Vec<onion_utils::OnionKeys>, prng_seed: [u8; 32]) -> Result<Packet, ()> {
1722         // Spec rationale:
1723         // "`len` allows larger messages to be sent than the standard 1300 bytes allowed for an HTLC
1724         // onion, but this should be used sparingly as it is reduces anonymity set, hence the
1725         // recommendation that it either look like an HTLC onion, or if larger, be a fixed size."
1726         let payloads_ser_len = onion_utils::payloads_serialized_length(&payloads);
1727         let hop_data_len = if payloads_ser_len <= SMALL_PACKET_HOP_DATA_LEN {
1728                 SMALL_PACKET_HOP_DATA_LEN
1729         } else if payloads_ser_len <= BIG_PACKET_HOP_DATA_LEN {
1730                 BIG_PACKET_HOP_DATA_LEN
1731         } else { return Err(()) };
1732
1733         onion_utils::construct_onion_message_packet::<_, _>(
1734                 payloads, onion_keys, prng_seed, hop_data_len)
1735 }