1 // This file is Copyright its original authors, visible in version control
4 // This file is licensed under the Apache License, Version 2.0 <LICENSE-APACHE
5 // or http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
6 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your option.
7 // You may not use this file except in accordance with one or both of these
10 //! The [`NetworkGraph`] stores the network gossip and [`P2PGossipSync`] fetches it from peers
12 use bitcoin::secp256k1::constants::PUBLIC_KEY_SIZE;
13 use bitcoin::secp256k1::PublicKey;
14 use bitcoin::secp256k1::Secp256k1;
15 use bitcoin::secp256k1;
17 use bitcoin::hashes::sha256d::Hash as Sha256dHash;
18 use bitcoin::hashes::Hash;
19 use bitcoin::hashes::hex::FromHex;
20 use bitcoin::hash_types::BlockHash;
22 use bitcoin::network::constants::Network;
23 use bitcoin::blockdata::constants::genesis_block;
25 use crate::events::{MessageSendEvent, MessageSendEventsProvider};
26 use crate::ln::features::{ChannelFeatures, NodeFeatures, InitFeatures};
27 use crate::ln::msgs::{DecodeError, ErrorAction, Init, LightningError, RoutingMessageHandler, NetAddress, MAX_VALUE_MSAT};
28 use crate::ln::msgs::{ChannelAnnouncement, ChannelUpdate, NodeAnnouncement, GossipTimestampFilter};
29 use crate::ln::msgs::{QueryChannelRange, ReplyChannelRange, QueryShortChannelIds, ReplyShortChannelIdsEnd};
31 use crate::routing::utxo::{self, UtxoLookup, UtxoResolver};
32 use crate::util::ser::{Readable, ReadableArgs, Writeable, Writer, MaybeReadable};
33 use crate::util::logger::{Logger, Level};
34 use crate::util::scid_utils::{block_from_scid, scid_from_parts, MAX_SCID_BLOCK};
35 use crate::util::string::PrintableString;
36 use crate::util::indexed_map::{IndexedMap, Entry as IndexedMapEntry};
39 use crate::io_extras::{copy, sink};
40 use crate::prelude::*;
42 use core::convert::TryFrom;
43 use crate::sync::{RwLock, RwLockReadGuard};
44 #[cfg(feature = "std")]
45 use core::sync::atomic::{AtomicUsize, Ordering};
46 use crate::sync::Mutex;
47 use core::ops::{Bound, Deref};
48 use core::str::FromStr;
50 #[cfg(feature = "std")]
51 use std::time::{SystemTime, UNIX_EPOCH};
53 /// We remove stale channel directional info two weeks after the last update, per BOLT 7's
55 const STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS: u64 = 60 * 60 * 24 * 14;
57 /// We stop tracking the removal of permanently failed nodes and channels one week after removal
58 const REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS: u64 = 60 * 60 * 24 * 7;
60 /// The maximum number of extra bytes which we do not understand in a gossip message before we will
61 /// refuse to relay the message.
62 const MAX_EXCESS_BYTES_FOR_RELAY: usize = 1024;
64 /// Maximum number of short_channel_ids that will be encoded in one gossip reply message.
65 /// This value ensures a reply fits within the 65k payload limit and is consistent with other implementations.
66 const MAX_SCIDS_PER_REPLY: usize = 8000;
68 /// Represents the compressed public key of a node
69 #[derive(Clone, Copy)]
70 pub struct NodeId([u8; PUBLIC_KEY_SIZE]);
73 /// Create a new NodeId from a public key
74 pub fn from_pubkey(pubkey: &PublicKey) -> Self {
75 NodeId(pubkey.serialize())
78 /// Get the public key slice from this NodeId
79 pub fn as_slice(&self) -> &[u8] {
83 /// Get the public key from this NodeId
84 pub fn as_pubkey(&self) -> Result<PublicKey, secp256k1::Error> {
85 PublicKey::from_slice(&self.0)
89 impl fmt::Debug for NodeId {
90 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
91 write!(f, "NodeId({})", log_bytes!(self.0))
94 impl fmt::Display for NodeId {
95 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
96 write!(f, "{}", log_bytes!(self.0))
100 impl core::hash::Hash for NodeId {
101 fn hash<H: core::hash::Hasher>(&self, hasher: &mut H) {
106 impl Eq for NodeId {}
108 impl PartialEq for NodeId {
109 fn eq(&self, other: &Self) -> bool {
110 self.0[..] == other.0[..]
114 impl cmp::PartialOrd for NodeId {
115 fn partial_cmp(&self, other: &Self) -> Option<cmp::Ordering> {
116 Some(self.cmp(other))
120 impl Ord for NodeId {
121 fn cmp(&self, other: &Self) -> cmp::Ordering {
122 self.0[..].cmp(&other.0[..])
126 impl Writeable for NodeId {
127 fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
128 writer.write_all(&self.0)?;
133 impl Readable for NodeId {
134 fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
135 let mut buf = [0; PUBLIC_KEY_SIZE];
136 reader.read_exact(&mut buf)?;
141 impl From<PublicKey> for NodeId {
142 fn from(pubkey: PublicKey) -> Self {
143 Self::from_pubkey(&pubkey)
147 impl TryFrom<NodeId> for PublicKey {
148 type Error = secp256k1::Error;
150 fn try_from(node_id: NodeId) -> Result<Self, Self::Error> {
155 impl FromStr for NodeId {
156 type Err = bitcoin::hashes::hex::Error;
158 fn from_str(s: &str) -> Result<Self, Self::Err> {
159 let data: [u8; PUBLIC_KEY_SIZE] = FromHex::from_hex(s)?;
164 /// Represents the network as nodes and channels between them
165 pub struct NetworkGraph<L: Deref> where L::Target: Logger {
166 secp_ctx: Secp256k1<secp256k1::VerifyOnly>,
167 last_rapid_gossip_sync_timestamp: Mutex<Option<u32>>,
168 genesis_hash: BlockHash,
170 // Lock order: channels -> nodes
171 channels: RwLock<IndexedMap<u64, ChannelInfo>>,
172 nodes: RwLock<IndexedMap<NodeId, NodeInfo>>,
173 // Lock order: removed_channels -> removed_nodes
175 // NOTE: In the following `removed_*` maps, we use seconds since UNIX epoch to track time instead
176 // of `std::time::Instant`s for a few reasons:
177 // * We want it to be possible to do tracking in no-std environments where we can compare
178 // a provided current UNIX timestamp with the time at which we started tracking.
179 // * In the future, if we decide to persist these maps, they will already be serializable.
180 // * Although we lose out on the platform's monotonic clock, the system clock in a std
181 // environment should be practical over the time period we are considering (on the order of a
184 /// Keeps track of short channel IDs for channels we have explicitly removed due to permanent
185 /// failure so that we don't resync them from gossip. Each SCID is mapped to the time (in seconds)
186 /// it was removed so that once some time passes, we can potentially resync it from gossip again.
187 removed_channels: Mutex<HashMap<u64, Option<u64>>>,
188 /// Keeps track of `NodeId`s we have explicitly removed due to permanent failure so that we don't
189 /// resync them from gossip. Each `NodeId` is mapped to the time (in seconds) it was removed so
190 /// that once some time passes, we can potentially resync it from gossip again.
191 removed_nodes: Mutex<HashMap<NodeId, Option<u64>>>,
192 /// Announcement messages which are awaiting an on-chain lookup to be processed.
193 pub(super) pending_checks: utxo::PendingChecks,
196 /// A read-only view of [`NetworkGraph`].
197 pub struct ReadOnlyNetworkGraph<'a> {
198 channels: RwLockReadGuard<'a, IndexedMap<u64, ChannelInfo>>,
199 nodes: RwLockReadGuard<'a, IndexedMap<NodeId, NodeInfo>>,
202 /// Update to the [`NetworkGraph`] based on payment failure information conveyed via the Onion
203 /// return packet by a node along the route. See [BOLT #4] for details.
205 /// [BOLT #4]: https://github.com/lightning/bolts/blob/master/04-onion-routing.md
206 #[derive(Clone, Debug, PartialEq, Eq)]
207 pub enum NetworkUpdate {
208 /// An error indicating a `channel_update` messages should be applied via
209 /// [`NetworkGraph::update_channel`].
210 ChannelUpdateMessage {
211 /// The update to apply via [`NetworkGraph::update_channel`].
214 /// An error indicating that a channel failed to route a payment, which should be applied via
215 /// [`NetworkGraph::channel_failed_permanent`] if permanent.
217 /// The short channel id of the closed channel.
218 short_channel_id: u64,
219 /// Whether the channel should be permanently removed or temporarily disabled until a new
220 /// `channel_update` message is received.
223 /// An error indicating that a node failed to route a payment, which should be applied via
224 /// [`NetworkGraph::node_failed_permanent`] if permanent.
226 /// The node id of the failed node.
228 /// Whether the node should be permanently removed from consideration or can be restored
229 /// when a new `channel_update` message is received.
234 impl_writeable_tlv_based_enum_upgradable!(NetworkUpdate,
235 (0, ChannelUpdateMessage) => {
238 (2, ChannelFailure) => {
239 (0, short_channel_id, required),
240 (2, is_permanent, required),
242 (4, NodeFailure) => {
243 (0, node_id, required),
244 (2, is_permanent, required),
248 /// Receives and validates network updates from peers,
249 /// stores authentic and relevant data as a network graph.
250 /// This network graph is then used for routing payments.
251 /// Provides interface to help with initial routing sync by
252 /// serving historical announcements.
253 pub struct P2PGossipSync<G: Deref<Target=NetworkGraph<L>>, U: Deref, L: Deref>
254 where U::Target: UtxoLookup, L::Target: Logger
257 utxo_lookup: Option<U>,
258 #[cfg(feature = "std")]
259 full_syncs_requested: AtomicUsize,
260 pending_events: Mutex<Vec<MessageSendEvent>>,
264 impl<G: Deref<Target=NetworkGraph<L>>, U: Deref, L: Deref> P2PGossipSync<G, U, L>
265 where U::Target: UtxoLookup, L::Target: Logger
267 /// Creates a new tracker of the actual state of the network of channels and nodes,
268 /// assuming an existing [`NetworkGraph`].
269 /// UTXO lookup is used to make sure announced channels exist on-chain, channel data is
270 /// correct, and the announcement is signed with channel owners' keys.
271 pub fn new(network_graph: G, utxo_lookup: Option<U>, logger: L) -> Self {
274 #[cfg(feature = "std")]
275 full_syncs_requested: AtomicUsize::new(0),
277 pending_events: Mutex::new(vec![]),
282 /// Adds a provider used to check new announcements. Does not affect
283 /// existing announcements unless they are updated.
284 /// Add, update or remove the provider would replace the current one.
285 pub fn add_utxo_lookup(&mut self, utxo_lookup: Option<U>) {
286 self.utxo_lookup = utxo_lookup;
289 /// Gets a reference to the underlying [`NetworkGraph`] which was provided in
290 /// [`P2PGossipSync::new`].
292 /// This is not exported to bindings users as bindings don't support a reference-to-a-reference yet
293 pub fn network_graph(&self) -> &G {
297 #[cfg(feature = "std")]
298 /// Returns true when a full routing table sync should be performed with a peer.
299 fn should_request_full_sync(&self, _node_id: &PublicKey) -> bool {
300 //TODO: Determine whether to request a full sync based on the network map.
301 const FULL_SYNCS_TO_REQUEST: usize = 5;
302 if self.full_syncs_requested.load(Ordering::Acquire) < FULL_SYNCS_TO_REQUEST {
303 self.full_syncs_requested.fetch_add(1, Ordering::AcqRel);
310 /// Used to broadcast forward gossip messages which were validated async.
312 /// Note that this will ignore events other than `Broadcast*` or messages with too much excess
314 pub(super) fn forward_gossip_msg(&self, mut ev: MessageSendEvent) {
316 MessageSendEvent::BroadcastChannelAnnouncement { msg, ref mut update_msg } => {
317 if msg.contents.excess_data.len() > MAX_EXCESS_BYTES_FOR_RELAY { return; }
318 if update_msg.as_ref()
319 .map(|msg| msg.contents.excess_data.len()).unwrap_or(0) > MAX_EXCESS_BYTES_FOR_RELAY
324 MessageSendEvent::BroadcastChannelUpdate { msg } => {
325 if msg.contents.excess_data.len() > MAX_EXCESS_BYTES_FOR_RELAY { return; }
327 MessageSendEvent::BroadcastNodeAnnouncement { msg } => {
328 if msg.contents.excess_data.len() > MAX_EXCESS_BYTES_FOR_RELAY ||
329 msg.contents.excess_address_data.len() > MAX_EXCESS_BYTES_FOR_RELAY ||
330 msg.contents.excess_data.len() + msg.contents.excess_address_data.len() > MAX_EXCESS_BYTES_FOR_RELAY
337 self.pending_events.lock().unwrap().push(ev);
341 impl<L: Deref> NetworkGraph<L> where L::Target: Logger {
342 /// Handles any network updates originating from [`Event`]s.
344 /// [`Event`]: crate::events::Event
345 pub fn handle_network_update(&self, network_update: &NetworkUpdate) {
346 match *network_update {
347 NetworkUpdate::ChannelUpdateMessage { ref msg } => {
348 let short_channel_id = msg.contents.short_channel_id;
349 let is_enabled = msg.contents.flags & (1 << 1) != (1 << 1);
350 let status = if is_enabled { "enabled" } else { "disabled" };
351 log_debug!(self.logger, "Updating channel with channel_update from a payment failure. Channel {} is {}.", short_channel_id, status);
352 let _ = self.update_channel(msg);
354 NetworkUpdate::ChannelFailure { short_channel_id, is_permanent } => {
356 log_debug!(self.logger, "Removing channel graph entry for {} due to a payment failure.", short_channel_id);
357 self.channel_failed_permanent(short_channel_id);
360 NetworkUpdate::NodeFailure { ref node_id, is_permanent } => {
362 log_debug!(self.logger,
363 "Removed node graph entry for {} due to a payment failure.", log_pubkey!(node_id));
364 self.node_failed_permanent(node_id);
371 macro_rules! secp_verify_sig {
372 ( $secp_ctx: expr, $msg: expr, $sig: expr, $pubkey: expr, $msg_type: expr ) => {
373 match $secp_ctx.verify_ecdsa($msg, $sig, $pubkey) {
376 return Err(LightningError {
377 err: format!("Invalid signature on {} message", $msg_type),
378 action: ErrorAction::SendWarningMessage {
379 msg: msgs::WarningMessage {
381 data: format!("Invalid signature on {} message", $msg_type),
383 log_level: Level::Trace,
391 macro_rules! get_pubkey_from_node_id {
392 ( $node_id: expr, $msg_type: expr ) => {
393 PublicKey::from_slice($node_id.as_slice())
394 .map_err(|_| LightningError {
395 err: format!("Invalid public key on {} message", $msg_type),
396 action: ErrorAction::SendWarningMessage {
397 msg: msgs::WarningMessage {
399 data: format!("Invalid public key on {} message", $msg_type),
401 log_level: Level::Trace
407 impl<G: Deref<Target=NetworkGraph<L>>, U: Deref, L: Deref> RoutingMessageHandler for P2PGossipSync<G, U, L>
408 where U::Target: UtxoLookup, L::Target: Logger
410 fn handle_node_announcement(&self, msg: &msgs::NodeAnnouncement) -> Result<bool, LightningError> {
411 self.network_graph.update_node_from_announcement(msg)?;
412 Ok(msg.contents.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
413 msg.contents.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
414 msg.contents.excess_data.len() + msg.contents.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
417 fn handle_channel_announcement(&self, msg: &msgs::ChannelAnnouncement) -> Result<bool, LightningError> {
418 self.network_graph.update_channel_from_announcement(msg, &self.utxo_lookup)?;
419 Ok(msg.contents.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
422 fn handle_channel_update(&self, msg: &msgs::ChannelUpdate) -> Result<bool, LightningError> {
423 self.network_graph.update_channel(msg)?;
424 Ok(msg.contents.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
427 fn get_next_channel_announcement(&self, starting_point: u64) -> Option<(ChannelAnnouncement, Option<ChannelUpdate>, Option<ChannelUpdate>)> {
428 let mut channels = self.network_graph.channels.write().unwrap();
429 for (_, ref chan) in channels.range(starting_point..) {
430 if chan.announcement_message.is_some() {
431 let chan_announcement = chan.announcement_message.clone().unwrap();
432 let mut one_to_two_announcement: Option<msgs::ChannelUpdate> = None;
433 let mut two_to_one_announcement: Option<msgs::ChannelUpdate> = None;
434 if let Some(one_to_two) = chan.one_to_two.as_ref() {
435 one_to_two_announcement = one_to_two.last_update_message.clone();
437 if let Some(two_to_one) = chan.two_to_one.as_ref() {
438 two_to_one_announcement = two_to_one.last_update_message.clone();
440 return Some((chan_announcement, one_to_two_announcement, two_to_one_announcement));
442 // TODO: We may end up sending un-announced channel_updates if we are sending
443 // initial sync data while receiving announce/updates for this channel.
449 fn get_next_node_announcement(&self, starting_point: Option<&NodeId>) -> Option<NodeAnnouncement> {
450 let mut nodes = self.network_graph.nodes.write().unwrap();
451 let iter = if let Some(node_id) = starting_point {
452 nodes.range((Bound::Excluded(node_id), Bound::Unbounded))
456 for (_, ref node) in iter {
457 if let Some(node_info) = node.announcement_info.as_ref() {
458 if let Some(msg) = node_info.announcement_message.clone() {
466 /// Initiates a stateless sync of routing gossip information with a peer
467 /// using [`gossip_queries`]. The default strategy used by this implementation
468 /// is to sync the full block range with several peers.
470 /// We should expect one or more [`reply_channel_range`] messages in response
471 /// to our [`query_channel_range`]. Each reply will enqueue a [`query_scid`] message
472 /// to request gossip messages for each channel. The sync is considered complete
473 /// when the final [`reply_scids_end`] message is received, though we are not
474 /// tracking this directly.
476 /// [`gossip_queries`]: https://github.com/lightning/bolts/blob/master/07-routing-gossip.md#query-messages
477 /// [`reply_channel_range`]: msgs::ReplyChannelRange
478 /// [`query_channel_range`]: msgs::QueryChannelRange
479 /// [`query_scid`]: msgs::QueryShortChannelIds
480 /// [`reply_scids_end`]: msgs::ReplyShortChannelIdsEnd
481 fn peer_connected(&self, their_node_id: &PublicKey, init_msg: &Init, _inbound: bool) -> Result<(), ()> {
482 // We will only perform a sync with peers that support gossip_queries.
483 if !init_msg.features.supports_gossip_queries() {
484 // Don't disconnect peers for not supporting gossip queries. We may wish to have
485 // channels with peers even without being able to exchange gossip.
489 // The lightning network's gossip sync system is completely broken in numerous ways.
491 // Given no broadly-available set-reconciliation protocol, the only reasonable approach is
492 // to do a full sync from the first few peers we connect to, and then receive gossip
493 // updates from all our peers normally.
495 // Originally, we could simply tell a peer to dump us the entire gossip table on startup,
496 // wasting lots of bandwidth but ensuring we have the full network graph. After the initial
497 // dump peers would always send gossip and we'd stay up-to-date with whatever our peer has
500 // In order to reduce the bandwidth waste, "gossip queries" were introduced, allowing you
501 // to ask for the SCIDs of all channels in your peer's routing graph, and then only request
502 // channel data which you are missing. Except there was no way at all to identify which
503 // `channel_update`s you were missing, so you still had to request everything, just in a
504 // very complicated way with some queries instead of just getting the dump.
506 // Later, an option was added to fetch the latest timestamps of the `channel_update`s to
507 // make efficient sync possible, however it has yet to be implemented in lnd, which makes
508 // relying on it useless.
510 // After gossip queries were introduced, support for receiving a full gossip table dump on
511 // connection was removed from several nodes, making it impossible to get a full sync
512 // without using the "gossip queries" messages.
514 // Once you opt into "gossip queries" the only way to receive any gossip updates that a
515 // peer receives after you connect, you must send a `gossip_timestamp_filter` message. This
516 // message, as the name implies, tells the peer to not forward any gossip messages with a
517 // timestamp older than a given value (not the time the peer received the filter, but the
518 // timestamp in the update message, which is often hours behind when the peer received the
521 // Obnoxiously, `gossip_timestamp_filter` isn't *just* a filter, but its also a request for
522 // your peer to send you the full routing graph (subject to the filter). Thus, in order to
523 // tell a peer to send you any updates as it sees them, you have to also ask for the full
524 // routing graph to be synced. If you set a timestamp filter near the current time, peers
525 // will simply not forward any new updates they see to you which were generated some time
526 // ago (which is not uncommon). If you instead set a timestamp filter near 0 (or two weeks
527 // ago), you will always get the full routing graph from all your peers.
529 // Most lightning nodes today opt to simply turn off receiving gossip data which only
530 // propagated some time after it was generated, and, worse, often disable gossiping with
531 // several peers after their first connection. The second behavior can cause gossip to not
532 // propagate fully if there are cuts in the gossiping subgraph.
534 // In an attempt to cut a middle ground between always fetching the full graph from all of
535 // our peers and never receiving gossip from peers at all, we send all of our peers a
536 // `gossip_timestamp_filter`, with the filter time set either two weeks ago or an hour ago.
538 // For no-std builds, we bury our head in the sand and do a full sync on each connection.
539 #[allow(unused_mut, unused_assignments)]
540 let mut gossip_start_time = 0;
541 #[cfg(feature = "std")]
543 gossip_start_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
544 if self.should_request_full_sync(&their_node_id) {
545 gossip_start_time -= 60 * 60 * 24 * 7 * 2; // 2 weeks ago
547 gossip_start_time -= 60 * 60; // an hour ago
551 let mut pending_events = self.pending_events.lock().unwrap();
552 pending_events.push(MessageSendEvent::SendGossipTimestampFilter {
553 node_id: their_node_id.clone(),
554 msg: GossipTimestampFilter {
555 chain_hash: self.network_graph.genesis_hash,
556 first_timestamp: gossip_start_time as u32, // 2106 issue!
557 timestamp_range: u32::max_value(),
563 fn handle_reply_channel_range(&self, _their_node_id: &PublicKey, _msg: ReplyChannelRange) -> Result<(), LightningError> {
564 // We don't make queries, so should never receive replies. If, in the future, the set
565 // reconciliation extensions to gossip queries become broadly supported, we should revert
566 // this code to its state pre-0.0.106.
570 fn handle_reply_short_channel_ids_end(&self, _their_node_id: &PublicKey, _msg: ReplyShortChannelIdsEnd) -> Result<(), LightningError> {
571 // We don't make queries, so should never receive replies. If, in the future, the set
572 // reconciliation extensions to gossip queries become broadly supported, we should revert
573 // this code to its state pre-0.0.106.
577 /// Processes a query from a peer by finding announced/public channels whose funding UTXOs
578 /// are in the specified block range. Due to message size limits, large range
579 /// queries may result in several reply messages. This implementation enqueues
580 /// all reply messages into pending events. Each message will allocate just under 65KiB. A full
581 /// sync of the public routing table with 128k channels will generated 16 messages and allocate ~1MB.
582 /// Logic can be changed to reduce allocation if/when a full sync of the routing table impacts
583 /// memory constrained systems.
584 fn handle_query_channel_range(&self, their_node_id: &PublicKey, msg: QueryChannelRange) -> Result<(), LightningError> {
585 log_debug!(self.logger, "Handling query_channel_range peer={}, first_blocknum={}, number_of_blocks={}", log_pubkey!(their_node_id), msg.first_blocknum, msg.number_of_blocks);
587 let inclusive_start_scid = scid_from_parts(msg.first_blocknum as u64, 0, 0);
589 // We might receive valid queries with end_blocknum that would overflow SCID conversion.
590 // If so, we manually cap the ending block to avoid this overflow.
591 let exclusive_end_scid = scid_from_parts(cmp::min(msg.end_blocknum() as u64, MAX_SCID_BLOCK), 0, 0);
593 // Per spec, we must reply to a query. Send an empty message when things are invalid.
594 if msg.chain_hash != self.network_graph.genesis_hash || inclusive_start_scid.is_err() || exclusive_end_scid.is_err() || msg.number_of_blocks == 0 {
595 let mut pending_events = self.pending_events.lock().unwrap();
596 pending_events.push(MessageSendEvent::SendReplyChannelRange {
597 node_id: their_node_id.clone(),
598 msg: ReplyChannelRange {
599 chain_hash: msg.chain_hash.clone(),
600 first_blocknum: msg.first_blocknum,
601 number_of_blocks: msg.number_of_blocks,
603 short_channel_ids: vec![],
606 return Err(LightningError {
607 err: String::from("query_channel_range could not be processed"),
608 action: ErrorAction::IgnoreError,
612 // Creates channel batches. We are not checking if the channel is routable
613 // (has at least one update). A peer may still want to know the channel
614 // exists even if its not yet routable.
615 let mut batches: Vec<Vec<u64>> = vec![Vec::with_capacity(MAX_SCIDS_PER_REPLY)];
616 let mut channels = self.network_graph.channels.write().unwrap();
617 for (_, ref chan) in channels.range(inclusive_start_scid.unwrap()..exclusive_end_scid.unwrap()) {
618 if let Some(chan_announcement) = &chan.announcement_message {
619 // Construct a new batch if last one is full
620 if batches.last().unwrap().len() == batches.last().unwrap().capacity() {
621 batches.push(Vec::with_capacity(MAX_SCIDS_PER_REPLY));
624 let batch = batches.last_mut().unwrap();
625 batch.push(chan_announcement.contents.short_channel_id);
630 let mut pending_events = self.pending_events.lock().unwrap();
631 let batch_count = batches.len();
632 let mut prev_batch_endblock = msg.first_blocknum;
633 for (batch_index, batch) in batches.into_iter().enumerate() {
634 // Per spec, the initial `first_blocknum` needs to be <= the query's `first_blocknum`
635 // and subsequent `first_blocknum`s must be >= the prior reply's `first_blocknum`.
637 // Additionally, c-lightning versions < 0.10 require that the `first_blocknum` of each
638 // reply is >= the previous reply's `first_blocknum` and either exactly the previous
639 // reply's `first_blocknum + number_of_blocks` or exactly one greater. This is a
640 // significant diversion from the requirements set by the spec, and, in case of blocks
641 // with no channel opens (e.g. empty blocks), requires that we use the previous value
642 // and *not* derive the first_blocknum from the actual first block of the reply.
643 let first_blocknum = prev_batch_endblock;
645 // Each message carries the number of blocks (from the `first_blocknum`) its contents
646 // fit in. Though there is no requirement that we use exactly the number of blocks its
647 // contents are from, except for the bogus requirements c-lightning enforces, above.
649 // Per spec, the last end block (ie `first_blocknum + number_of_blocks`) needs to be
650 // >= the query's end block. Thus, for the last reply, we calculate the difference
651 // between the query's end block and the start of the reply.
653 // Overflow safe since end_blocknum=msg.first_block_num+msg.number_of_blocks and
654 // first_blocknum will be either msg.first_blocknum or a higher block height.
655 let (sync_complete, number_of_blocks) = if batch_index == batch_count-1 {
656 (true, msg.end_blocknum() - first_blocknum)
658 // Prior replies should use the number of blocks that fit into the reply. Overflow
659 // safe since first_blocknum is always <= last SCID's block.
661 (false, block_from_scid(batch.last().unwrap()) - first_blocknum)
664 prev_batch_endblock = first_blocknum + number_of_blocks;
666 pending_events.push(MessageSendEvent::SendReplyChannelRange {
667 node_id: their_node_id.clone(),
668 msg: ReplyChannelRange {
669 chain_hash: msg.chain_hash.clone(),
673 short_channel_ids: batch,
681 fn handle_query_short_channel_ids(&self, _their_node_id: &PublicKey, _msg: QueryShortChannelIds) -> Result<(), LightningError> {
684 err: String::from("Not implemented"),
685 action: ErrorAction::IgnoreError,
689 fn provided_node_features(&self) -> NodeFeatures {
690 let mut features = NodeFeatures::empty();
691 features.set_gossip_queries_optional();
695 fn provided_init_features(&self, _their_node_id: &PublicKey) -> InitFeatures {
696 let mut features = InitFeatures::empty();
697 features.set_gossip_queries_optional();
701 fn processing_queue_high(&self) -> bool {
702 self.network_graph.pending_checks.too_many_checks_pending()
706 impl<G: Deref<Target=NetworkGraph<L>>, U: Deref, L: Deref> MessageSendEventsProvider for P2PGossipSync<G, U, L>
708 U::Target: UtxoLookup,
711 fn get_and_clear_pending_msg_events(&self) -> Vec<MessageSendEvent> {
712 let mut ret = Vec::new();
713 let mut pending_events = self.pending_events.lock().unwrap();
714 core::mem::swap(&mut ret, &mut pending_events);
719 #[derive(Clone, Debug, PartialEq, Eq)]
720 /// Details about one direction of a channel as received within a [`ChannelUpdate`].
721 pub struct ChannelUpdateInfo {
722 /// When the last update to the channel direction was issued.
723 /// Value is opaque, as set in the announcement.
724 pub last_update: u32,
725 /// Whether the channel can be currently used for payments (in this one direction).
727 /// The difference in CLTV values that you must have when routing through this channel.
728 pub cltv_expiry_delta: u16,
729 /// The minimum value, which must be relayed to the next hop via the channel
730 pub htlc_minimum_msat: u64,
731 /// The maximum value which may be relayed to the next hop via the channel.
732 pub htlc_maximum_msat: u64,
733 /// Fees charged when the channel is used for routing
734 pub fees: RoutingFees,
735 /// Most recent update for the channel received from the network
736 /// Mostly redundant with the data we store in fields explicitly.
737 /// Everything else is useful only for sending out for initial routing sync.
738 /// Not stored if contains excess data to prevent DoS.
739 pub last_update_message: Option<ChannelUpdate>,
742 impl fmt::Display for ChannelUpdateInfo {
743 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
744 write!(f, "last_update {}, enabled {}, cltv_expiry_delta {}, htlc_minimum_msat {}, fees {:?}", self.last_update, self.enabled, self.cltv_expiry_delta, self.htlc_minimum_msat, self.fees)?;
749 impl Writeable for ChannelUpdateInfo {
750 fn write<W: crate::util::ser::Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
751 write_tlv_fields!(writer, {
752 (0, self.last_update, required),
753 (2, self.enabled, required),
754 (4, self.cltv_expiry_delta, required),
755 (6, self.htlc_minimum_msat, required),
756 // Writing htlc_maximum_msat as an Option<u64> is required to maintain backwards
757 // compatibility with LDK versions prior to v0.0.110.
758 (8, Some(self.htlc_maximum_msat), required),
759 (10, self.fees, required),
760 (12, self.last_update_message, required),
766 impl Readable for ChannelUpdateInfo {
767 fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
768 _init_tlv_field_var!(last_update, required);
769 _init_tlv_field_var!(enabled, required);
770 _init_tlv_field_var!(cltv_expiry_delta, required);
771 _init_tlv_field_var!(htlc_minimum_msat, required);
772 _init_tlv_field_var!(htlc_maximum_msat, option);
773 _init_tlv_field_var!(fees, required);
774 _init_tlv_field_var!(last_update_message, required);
776 read_tlv_fields!(reader, {
777 (0, last_update, required),
778 (2, enabled, required),
779 (4, cltv_expiry_delta, required),
780 (6, htlc_minimum_msat, required),
781 (8, htlc_maximum_msat, required),
782 (10, fees, required),
783 (12, last_update_message, required)
786 if let Some(htlc_maximum_msat) = htlc_maximum_msat {
787 Ok(ChannelUpdateInfo {
788 last_update: _init_tlv_based_struct_field!(last_update, required),
789 enabled: _init_tlv_based_struct_field!(enabled, required),
790 cltv_expiry_delta: _init_tlv_based_struct_field!(cltv_expiry_delta, required),
791 htlc_minimum_msat: _init_tlv_based_struct_field!(htlc_minimum_msat, required),
793 fees: _init_tlv_based_struct_field!(fees, required),
794 last_update_message: _init_tlv_based_struct_field!(last_update_message, required),
797 Err(DecodeError::InvalidValue)
802 #[derive(Clone, Debug, PartialEq, Eq)]
803 /// Details about a channel (both directions).
804 /// Received within a channel announcement.
805 pub struct ChannelInfo {
806 /// Protocol features of a channel communicated during its announcement
807 pub features: ChannelFeatures,
808 /// Source node of the first direction of a channel
809 pub node_one: NodeId,
810 /// Details about the first direction of a channel
811 pub one_to_two: Option<ChannelUpdateInfo>,
812 /// Source node of the second direction of a channel
813 pub node_two: NodeId,
814 /// Details about the second direction of a channel
815 pub two_to_one: Option<ChannelUpdateInfo>,
816 /// The channel capacity as seen on-chain, if chain lookup is available.
817 pub capacity_sats: Option<u64>,
818 /// An initial announcement of the channel
819 /// Mostly redundant with the data we store in fields explicitly.
820 /// Everything else is useful only for sending out for initial routing sync.
821 /// Not stored if contains excess data to prevent DoS.
822 pub announcement_message: Option<ChannelAnnouncement>,
823 /// The timestamp when we received the announcement, if we are running with feature = "std"
824 /// (which we can probably assume we are - no-std environments probably won't have a full
825 /// network graph in memory!).
826 announcement_received_time: u64,
830 /// Returns a [`DirectedChannelInfo`] for the channel directed to the given `target` from a
831 /// returned `source`, or `None` if `target` is not one of the channel's counterparties.
832 pub fn as_directed_to(&self, target: &NodeId) -> Option<(DirectedChannelInfo, &NodeId)> {
833 let (direction, source) = {
834 if target == &self.node_one {
835 (self.two_to_one.as_ref(), &self.node_two)
836 } else if target == &self.node_two {
837 (self.one_to_two.as_ref(), &self.node_one)
842 direction.map(|dir| (DirectedChannelInfo::new(self, dir), source))
845 /// Returns a [`DirectedChannelInfo`] for the channel directed from the given `source` to a
846 /// returned `target`, or `None` if `source` is not one of the channel's counterparties.
847 pub fn as_directed_from(&self, source: &NodeId) -> Option<(DirectedChannelInfo, &NodeId)> {
848 let (direction, target) = {
849 if source == &self.node_one {
850 (self.one_to_two.as_ref(), &self.node_two)
851 } else if source == &self.node_two {
852 (self.two_to_one.as_ref(), &self.node_one)
857 direction.map(|dir| (DirectedChannelInfo::new(self, dir), target))
860 /// Returns a [`ChannelUpdateInfo`] based on the direction implied by the channel_flag.
861 pub fn get_directional_info(&self, channel_flags: u8) -> Option<&ChannelUpdateInfo> {
862 let direction = channel_flags & 1u8;
864 self.one_to_two.as_ref()
866 self.two_to_one.as_ref()
871 impl fmt::Display for ChannelInfo {
872 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
873 write!(f, "features: {}, node_one: {}, one_to_two: {:?}, node_two: {}, two_to_one: {:?}",
874 log_bytes!(self.features.encode()), log_bytes!(self.node_one.as_slice()), self.one_to_two, log_bytes!(self.node_two.as_slice()), self.two_to_one)?;
879 impl Writeable for ChannelInfo {
880 fn write<W: crate::util::ser::Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
881 write_tlv_fields!(writer, {
882 (0, self.features, required),
883 (1, self.announcement_received_time, (default_value, 0)),
884 (2, self.node_one, required),
885 (4, self.one_to_two, required),
886 (6, self.node_two, required),
887 (8, self.two_to_one, required),
888 (10, self.capacity_sats, required),
889 (12, self.announcement_message, required),
895 // A wrapper allowing for the optional deseralization of ChannelUpdateInfo. Utilizing this is
896 // necessary to maintain backwards compatibility with previous serializations of `ChannelUpdateInfo`
897 // that may have no `htlc_maximum_msat` field set. In case the field is absent, we simply ignore
898 // the error and continue reading the `ChannelInfo`. Hopefully, we'll then eventually receive newer
899 // channel updates via the gossip network.
900 struct ChannelUpdateInfoDeserWrapper(Option<ChannelUpdateInfo>);
902 impl MaybeReadable for ChannelUpdateInfoDeserWrapper {
903 fn read<R: io::Read>(reader: &mut R) -> Result<Option<Self>, DecodeError> {
904 match crate::util::ser::Readable::read(reader) {
905 Ok(channel_update_option) => Ok(Some(Self(channel_update_option))),
906 Err(DecodeError::ShortRead) => Ok(None),
907 Err(DecodeError::InvalidValue) => Ok(None),
908 Err(err) => Err(err),
913 impl Readable for ChannelInfo {
914 fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
915 _init_tlv_field_var!(features, required);
916 _init_tlv_field_var!(announcement_received_time, (default_value, 0));
917 _init_tlv_field_var!(node_one, required);
918 let mut one_to_two_wrap: Option<ChannelUpdateInfoDeserWrapper> = None;
919 _init_tlv_field_var!(node_two, required);
920 let mut two_to_one_wrap: Option<ChannelUpdateInfoDeserWrapper> = None;
921 _init_tlv_field_var!(capacity_sats, required);
922 _init_tlv_field_var!(announcement_message, required);
923 read_tlv_fields!(reader, {
924 (0, features, required),
925 (1, announcement_received_time, (default_value, 0)),
926 (2, node_one, required),
927 (4, one_to_two_wrap, upgradable_option),
928 (6, node_two, required),
929 (8, two_to_one_wrap, upgradable_option),
930 (10, capacity_sats, required),
931 (12, announcement_message, required),
935 features: _init_tlv_based_struct_field!(features, required),
936 node_one: _init_tlv_based_struct_field!(node_one, required),
937 one_to_two: one_to_two_wrap.map(|w| w.0).unwrap_or(None),
938 node_two: _init_tlv_based_struct_field!(node_two, required),
939 two_to_one: two_to_one_wrap.map(|w| w.0).unwrap_or(None),
940 capacity_sats: _init_tlv_based_struct_field!(capacity_sats, required),
941 announcement_message: _init_tlv_based_struct_field!(announcement_message, required),
942 announcement_received_time: _init_tlv_based_struct_field!(announcement_received_time, (default_value, 0)),
947 /// A wrapper around [`ChannelInfo`] representing information about the channel as directed from a
948 /// source node to a target node.
950 pub struct DirectedChannelInfo<'a> {
951 channel: &'a ChannelInfo,
952 direction: &'a ChannelUpdateInfo,
953 htlc_maximum_msat: u64,
954 effective_capacity: EffectiveCapacity,
957 impl<'a> DirectedChannelInfo<'a> {
959 fn new(channel: &'a ChannelInfo, direction: &'a ChannelUpdateInfo) -> Self {
960 let mut htlc_maximum_msat = direction.htlc_maximum_msat;
961 let capacity_msat = channel.capacity_sats.map(|capacity_sats| capacity_sats * 1000);
963 let effective_capacity = match capacity_msat {
964 Some(capacity_msat) => {
965 htlc_maximum_msat = cmp::min(htlc_maximum_msat, capacity_msat);
966 EffectiveCapacity::Total { capacity_msat, htlc_maximum_msat: htlc_maximum_msat }
968 None => EffectiveCapacity::AdvertisedMaxHTLC { amount_msat: htlc_maximum_msat },
972 channel, direction, htlc_maximum_msat, effective_capacity
976 /// Returns information for the channel.
978 pub fn channel(&self) -> &'a ChannelInfo { self.channel }
980 /// Returns the maximum HTLC amount allowed over the channel in the direction.
982 pub fn htlc_maximum_msat(&self) -> u64 {
983 self.htlc_maximum_msat
986 /// Returns the [`EffectiveCapacity`] of the channel in the direction.
988 /// This is either the total capacity from the funding transaction, if known, or the
989 /// `htlc_maximum_msat` for the direction as advertised by the gossip network, if known,
991 pub fn effective_capacity(&self) -> EffectiveCapacity {
992 self.effective_capacity
995 /// Returns information for the direction.
997 pub(super) fn direction(&self) -> &'a ChannelUpdateInfo { self.direction }
1000 impl<'a> fmt::Debug for DirectedChannelInfo<'a> {
1001 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
1002 f.debug_struct("DirectedChannelInfo")
1003 .field("channel", &self.channel)
1008 /// The effective capacity of a channel for routing purposes.
1010 /// While this may be smaller than the actual channel capacity, amounts greater than
1011 /// [`Self::as_msat`] should not be routed through the channel.
1012 #[derive(Clone, Copy, Debug, PartialEq)]
1013 pub enum EffectiveCapacity {
1014 /// The available liquidity in the channel known from being a channel counterparty, and thus a
1017 /// Either the inbound or outbound liquidity depending on the direction, denominated in
1019 liquidity_msat: u64,
1021 /// The maximum HTLC amount in one direction as advertised on the gossip network.
1023 /// The maximum HTLC amount denominated in millisatoshi.
1026 /// The total capacity of the channel as determined by the funding transaction.
1028 /// The funding amount denominated in millisatoshi.
1030 /// The maximum HTLC amount denominated in millisatoshi.
1031 htlc_maximum_msat: u64
1033 /// A capacity sufficient to route any payment, typically used for private channels provided by
1036 /// The maximum HTLC amount as provided by an invoice route hint.
1038 /// The maximum HTLC amount denominated in millisatoshi.
1041 /// A capacity that is unknown possibly because either the chain state is unavailable to know
1042 /// the total capacity or the `htlc_maximum_msat` was not advertised on the gossip network.
1046 /// The presumed channel capacity denominated in millisatoshi for [`EffectiveCapacity::Unknown`] to
1047 /// use when making routing decisions.
1048 pub const UNKNOWN_CHANNEL_CAPACITY_MSAT: u64 = 250_000 * 1000;
1050 impl EffectiveCapacity {
1051 /// Returns the effective capacity denominated in millisatoshi.
1052 pub fn as_msat(&self) -> u64 {
1054 EffectiveCapacity::ExactLiquidity { liquidity_msat } => *liquidity_msat,
1055 EffectiveCapacity::AdvertisedMaxHTLC { amount_msat } => *amount_msat,
1056 EffectiveCapacity::Total { capacity_msat, .. } => *capacity_msat,
1057 EffectiveCapacity::HintMaxHTLC { amount_msat } => *amount_msat,
1058 EffectiveCapacity::Infinite => u64::max_value(),
1059 EffectiveCapacity::Unknown => UNKNOWN_CHANNEL_CAPACITY_MSAT,
1064 /// Fees for routing via a given channel or a node
1065 #[derive(Eq, PartialEq, Copy, Clone, Debug, Hash, Ord, PartialOrd)]
1066 pub struct RoutingFees {
1067 /// Flat routing fee in millisatoshis.
1069 /// Liquidity-based routing fee in millionths of a routed amount.
1070 /// In other words, 10000 is 1%.
1071 pub proportional_millionths: u32,
1074 impl_writeable_tlv_based!(RoutingFees, {
1075 (0, base_msat, required),
1076 (2, proportional_millionths, required)
1079 #[derive(Clone, Debug, PartialEq, Eq)]
1080 /// Information received in the latest node_announcement from this node.
1081 pub struct NodeAnnouncementInfo {
1082 /// Protocol features the node announced support for
1083 pub features: NodeFeatures,
1084 /// When the last known update to the node state was issued.
1085 /// Value is opaque, as set in the announcement.
1086 pub last_update: u32,
1087 /// Color assigned to the node
1089 /// Moniker assigned to the node.
1090 /// May be invalid or malicious (eg control chars),
1091 /// should not be exposed to the user.
1092 pub alias: NodeAlias,
1093 /// An initial announcement of the node
1094 /// Mostly redundant with the data we store in fields explicitly.
1095 /// Everything else is useful only for sending out for initial routing sync.
1096 /// Not stored if contains excess data to prevent DoS.
1097 pub announcement_message: Option<NodeAnnouncement>
1100 impl NodeAnnouncementInfo {
1101 /// Internet-level addresses via which one can connect to the node
1102 pub fn addresses(&self) -> &[NetAddress] {
1103 self.announcement_message.as_ref()
1104 .map(|msg| msg.contents.addresses.as_slice())
1105 .unwrap_or_default()
1109 impl Writeable for NodeAnnouncementInfo {
1110 fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
1111 let empty_addresses = Vec::<NetAddress>::new();
1112 write_tlv_fields!(writer, {
1113 (0, self.features, required),
1114 (2, self.last_update, required),
1115 (4, self.rgb, required),
1116 (6, self.alias, required),
1117 (8, self.announcement_message, option),
1118 (10, empty_addresses, vec_type), // Versions prior to 0.0.115 require this field
1124 impl Readable for NodeAnnouncementInfo {
1125 fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
1126 _init_and_read_tlv_fields!(reader, {
1127 (0, features, required),
1128 (2, last_update, required),
1130 (6, alias, required),
1131 (8, announcement_message, option),
1132 (10, _addresses, vec_type), // deprecated, not used anymore
1134 let _: Option<Vec<NetAddress>> = _addresses;
1135 Ok(Self { features: features.0.unwrap(), last_update: last_update.0.unwrap(), rgb: rgb.0.unwrap(),
1136 alias: alias.0.unwrap(), announcement_message })
1140 /// A user-defined name for a node, which may be used when displaying the node in a graph.
1142 /// Since node aliases are provided by third parties, they are a potential avenue for injection
1143 /// attacks. Care must be taken when processing.
1144 #[derive(Clone, Copy, Debug, PartialEq, Eq)]
1145 pub struct NodeAlias(pub [u8; 32]);
1147 impl fmt::Display for NodeAlias {
1148 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
1149 let first_null = self.0.iter().position(|b| *b == 0).unwrap_or(self.0.len());
1150 let bytes = self.0.split_at(first_null).0;
1151 match core::str::from_utf8(bytes) {
1152 Ok(alias) => PrintableString(alias).fmt(f)?,
1154 use core::fmt::Write;
1155 for c in bytes.iter().map(|b| *b as char) {
1156 // Display printable ASCII characters
1157 let control_symbol = core::char::REPLACEMENT_CHARACTER;
1158 let c = if c >= '\x20' && c <= '\x7e' { c } else { control_symbol };
1167 impl Writeable for NodeAlias {
1168 fn write<W: Writer>(&self, w: &mut W) -> Result<(), io::Error> {
1173 impl Readable for NodeAlias {
1174 fn read<R: io::Read>(r: &mut R) -> Result<Self, DecodeError> {
1175 Ok(NodeAlias(Readable::read(r)?))
1179 #[derive(Clone, Debug, PartialEq, Eq)]
1180 /// Details about a node in the network, known from the network announcement.
1181 pub struct NodeInfo {
1182 /// All valid channels a node has announced
1183 pub channels: Vec<u64>,
1184 /// More information about a node from node_announcement.
1185 /// Optional because we store a Node entry after learning about it from
1186 /// a channel announcement, but before receiving a node announcement.
1187 pub announcement_info: Option<NodeAnnouncementInfo>
1190 impl fmt::Display for NodeInfo {
1191 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
1192 write!(f, " channels: {:?}, announcement_info: {:?}",
1193 &self.channels[..], self.announcement_info)?;
1198 impl Writeable for NodeInfo {
1199 fn write<W: crate::util::ser::Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
1200 write_tlv_fields!(writer, {
1201 // Note that older versions of LDK wrote the lowest inbound fees here at type 0
1202 (2, self.announcement_info, option),
1203 (4, self.channels, vec_type),
1209 // A wrapper allowing for the optional deserialization of `NodeAnnouncementInfo`. Utilizing this is
1210 // necessary to maintain compatibility with previous serializations of `NetAddress` that have an
1211 // invalid hostname set. We ignore and eat all errors until we are either able to read a
1212 // `NodeAnnouncementInfo` or hit a `ShortRead`, i.e., read the TLV field to the end.
1213 struct NodeAnnouncementInfoDeserWrapper(NodeAnnouncementInfo);
1215 impl MaybeReadable for NodeAnnouncementInfoDeserWrapper {
1216 fn read<R: io::Read>(reader: &mut R) -> Result<Option<Self>, DecodeError> {
1217 match crate::util::ser::Readable::read(reader) {
1218 Ok(node_announcement_info) => return Ok(Some(Self(node_announcement_info))),
1220 copy(reader, &mut sink()).unwrap();
1227 impl Readable for NodeInfo {
1228 fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
1229 // Historically, we tracked the lowest inbound fees for any node in order to use it as an
1230 // A* heuristic when routing. Sadly, these days many, many nodes have at least one channel
1231 // with zero inbound fees, causing that heuristic to provide little gain. Worse, because it
1232 // requires additional complexity and lookups during routing, it ends up being a
1233 // performance loss. Thus, we simply ignore the old field here and no longer track it.
1234 let mut _lowest_inbound_channel_fees: Option<RoutingFees> = None;
1235 let mut announcement_info_wrap: Option<NodeAnnouncementInfoDeserWrapper> = None;
1236 _init_tlv_field_var!(channels, vec_type);
1238 read_tlv_fields!(reader, {
1239 (0, _lowest_inbound_channel_fees, option),
1240 (2, announcement_info_wrap, upgradable_option),
1241 (4, channels, vec_type),
1245 announcement_info: announcement_info_wrap.map(|w| w.0),
1246 channels: _init_tlv_based_struct_field!(channels, vec_type),
1251 const SERIALIZATION_VERSION: u8 = 1;
1252 const MIN_SERIALIZATION_VERSION: u8 = 1;
1254 impl<L: Deref> Writeable for NetworkGraph<L> where L::Target: Logger {
1255 fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
1256 write_ver_prefix!(writer, SERIALIZATION_VERSION, MIN_SERIALIZATION_VERSION);
1258 self.genesis_hash.write(writer)?;
1259 let channels = self.channels.read().unwrap();
1260 (channels.len() as u64).write(writer)?;
1261 for (ref chan_id, ref chan_info) in channels.unordered_iter() {
1262 (*chan_id).write(writer)?;
1263 chan_info.write(writer)?;
1265 let nodes = self.nodes.read().unwrap();
1266 (nodes.len() as u64).write(writer)?;
1267 for (ref node_id, ref node_info) in nodes.unordered_iter() {
1268 node_id.write(writer)?;
1269 node_info.write(writer)?;
1272 let last_rapid_gossip_sync_timestamp = self.get_last_rapid_gossip_sync_timestamp();
1273 write_tlv_fields!(writer, {
1274 (1, last_rapid_gossip_sync_timestamp, option),
1280 impl<L: Deref> ReadableArgs<L> for NetworkGraph<L> where L::Target: Logger {
1281 fn read<R: io::Read>(reader: &mut R, logger: L) -> Result<NetworkGraph<L>, DecodeError> {
1282 let _ver = read_ver_prefix!(reader, SERIALIZATION_VERSION);
1284 let genesis_hash: BlockHash = Readable::read(reader)?;
1285 let channels_count: u64 = Readable::read(reader)?;
1286 let mut channels = IndexedMap::new();
1287 for _ in 0..channels_count {
1288 let chan_id: u64 = Readable::read(reader)?;
1289 let chan_info = Readable::read(reader)?;
1290 channels.insert(chan_id, chan_info);
1292 let nodes_count: u64 = Readable::read(reader)?;
1293 let mut nodes = IndexedMap::new();
1294 for _ in 0..nodes_count {
1295 let node_id = Readable::read(reader)?;
1296 let node_info = Readable::read(reader)?;
1297 nodes.insert(node_id, node_info);
1300 let mut last_rapid_gossip_sync_timestamp: Option<u32> = None;
1301 read_tlv_fields!(reader, {
1302 (1, last_rapid_gossip_sync_timestamp, option),
1306 secp_ctx: Secp256k1::verification_only(),
1309 channels: RwLock::new(channels),
1310 nodes: RwLock::new(nodes),
1311 last_rapid_gossip_sync_timestamp: Mutex::new(last_rapid_gossip_sync_timestamp),
1312 removed_nodes: Mutex::new(HashMap::new()),
1313 removed_channels: Mutex::new(HashMap::new()),
1314 pending_checks: utxo::PendingChecks::new(),
1319 impl<L: Deref> fmt::Display for NetworkGraph<L> where L::Target: Logger {
1320 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
1321 writeln!(f, "Network map\n[Channels]")?;
1322 for (key, val) in self.channels.read().unwrap().unordered_iter() {
1323 writeln!(f, " {}: {}", key, val)?;
1325 writeln!(f, "[Nodes]")?;
1326 for (&node_id, val) in self.nodes.read().unwrap().unordered_iter() {
1327 writeln!(f, " {}: {}", log_bytes!(node_id.as_slice()), val)?;
1333 impl<L: Deref> Eq for NetworkGraph<L> where L::Target: Logger {}
1334 impl<L: Deref> PartialEq for NetworkGraph<L> where L::Target: Logger {
1335 fn eq(&self, other: &Self) -> bool {
1336 self.genesis_hash == other.genesis_hash &&
1337 *self.channels.read().unwrap() == *other.channels.read().unwrap() &&
1338 *self.nodes.read().unwrap() == *other.nodes.read().unwrap()
1342 impl<L: Deref> NetworkGraph<L> where L::Target: Logger {
1343 /// Creates a new, empty, network graph.
1344 pub fn new(network: Network, logger: L) -> NetworkGraph<L> {
1346 secp_ctx: Secp256k1::verification_only(),
1347 genesis_hash: genesis_block(network).header.block_hash(),
1349 channels: RwLock::new(IndexedMap::new()),
1350 nodes: RwLock::new(IndexedMap::new()),
1351 last_rapid_gossip_sync_timestamp: Mutex::new(None),
1352 removed_channels: Mutex::new(HashMap::new()),
1353 removed_nodes: Mutex::new(HashMap::new()),
1354 pending_checks: utxo::PendingChecks::new(),
1358 /// Returns a read-only view of the network graph.
1359 pub fn read_only(&'_ self) -> ReadOnlyNetworkGraph<'_> {
1360 let channels = self.channels.read().unwrap();
1361 let nodes = self.nodes.read().unwrap();
1362 ReadOnlyNetworkGraph {
1368 /// The unix timestamp provided by the most recent rapid gossip sync.
1369 /// It will be set by the rapid sync process after every sync completion.
1370 pub fn get_last_rapid_gossip_sync_timestamp(&self) -> Option<u32> {
1371 self.last_rapid_gossip_sync_timestamp.lock().unwrap().clone()
1374 /// Update the unix timestamp provided by the most recent rapid gossip sync.
1375 /// This should be done automatically by the rapid sync process after every sync completion.
1376 pub fn set_last_rapid_gossip_sync_timestamp(&self, last_rapid_gossip_sync_timestamp: u32) {
1377 self.last_rapid_gossip_sync_timestamp.lock().unwrap().replace(last_rapid_gossip_sync_timestamp);
1380 /// Clears the `NodeAnnouncementInfo` field for all nodes in the `NetworkGraph` for testing
1383 pub fn clear_nodes_announcement_info(&self) {
1384 for node in self.nodes.write().unwrap().unordered_iter_mut() {
1385 node.1.announcement_info = None;
1389 /// For an already known node (from channel announcements), update its stored properties from a
1390 /// given node announcement.
1392 /// You probably don't want to call this directly, instead relying on a P2PGossipSync's
1393 /// RoutingMessageHandler implementation to call it indirectly. This may be useful to accept
1394 /// routing messages from a source using a protocol other than the lightning P2P protocol.
1395 pub fn update_node_from_announcement(&self, msg: &msgs::NodeAnnouncement) -> Result<(), LightningError> {
1396 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.contents.encode()[..])[..]);
1397 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.signature, &get_pubkey_from_node_id!(msg.contents.node_id, "node_announcement"), "node_announcement");
1398 self.update_node_from_announcement_intern(&msg.contents, Some(&msg))
1401 /// For an already known node (from channel announcements), update its stored properties from a
1402 /// given node announcement without verifying the associated signatures. Because we aren't
1403 /// given the associated signatures here we cannot relay the node announcement to any of our
1405 pub fn update_node_from_unsigned_announcement(&self, msg: &msgs::UnsignedNodeAnnouncement) -> Result<(), LightningError> {
1406 self.update_node_from_announcement_intern(msg, None)
1409 fn update_node_from_announcement_intern(&self, msg: &msgs::UnsignedNodeAnnouncement, full_msg: Option<&msgs::NodeAnnouncement>) -> Result<(), LightningError> {
1410 let mut nodes = self.nodes.write().unwrap();
1411 match nodes.get_mut(&msg.node_id) {
1413 core::mem::drop(nodes);
1414 self.pending_checks.check_hold_pending_node_announcement(msg, full_msg)?;
1415 Err(LightningError{err: "No existing channels for node_announcement".to_owned(), action: ErrorAction::IgnoreError})
1418 if let Some(node_info) = node.announcement_info.as_ref() {
1419 // The timestamp field is somewhat of a misnomer - the BOLTs use it to order
1420 // updates to ensure you always have the latest one, only vaguely suggesting
1421 // that it be at least the current time.
1422 if node_info.last_update > msg.timestamp {
1423 return Err(LightningError{err: "Update older than last processed update".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1424 } else if node_info.last_update == msg.timestamp {
1425 return Err(LightningError{err: "Update had the same timestamp as last processed update".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1430 msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
1431 msg.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
1432 msg.excess_data.len() + msg.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY;
1433 node.announcement_info = Some(NodeAnnouncementInfo {
1434 features: msg.features.clone(),
1435 last_update: msg.timestamp,
1438 announcement_message: if should_relay { full_msg.cloned() } else { None },
1446 /// Store or update channel info from a channel announcement.
1448 /// You probably don't want to call this directly, instead relying on a [`P2PGossipSync`]'s
1449 /// [`RoutingMessageHandler`] implementation to call it indirectly. This may be useful to accept
1450 /// routing messages from a source using a protocol other than the lightning P2P protocol.
1452 /// If a [`UtxoLookup`] object is provided via `utxo_lookup`, it will be called to verify
1453 /// the corresponding UTXO exists on chain and is correctly-formatted.
1454 pub fn update_channel_from_announcement<U: Deref>(
1455 &self, msg: &msgs::ChannelAnnouncement, utxo_lookup: &Option<U>,
1456 ) -> Result<(), LightningError>
1458 U::Target: UtxoLookup,
1460 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.contents.encode()[..])[..]);
1461 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.node_signature_1, &get_pubkey_from_node_id!(msg.contents.node_id_1, "channel_announcement"), "channel_announcement");
1462 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.node_signature_2, &get_pubkey_from_node_id!(msg.contents.node_id_2, "channel_announcement"), "channel_announcement");
1463 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.bitcoin_signature_1, &get_pubkey_from_node_id!(msg.contents.bitcoin_key_1, "channel_announcement"), "channel_announcement");
1464 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.bitcoin_signature_2, &get_pubkey_from_node_id!(msg.contents.bitcoin_key_2, "channel_announcement"), "channel_announcement");
1465 self.update_channel_from_unsigned_announcement_intern(&msg.contents, Some(msg), utxo_lookup)
1468 /// Store or update channel info from a channel announcement.
1470 /// You probably don't want to call this directly, instead relying on a [`P2PGossipSync`]'s
1471 /// [`RoutingMessageHandler`] implementation to call it indirectly. This may be useful to accept
1472 /// routing messages from a source using a protocol other than the lightning P2P protocol.
1474 /// This will skip verification of if the channel is actually on-chain.
1475 pub fn update_channel_from_announcement_no_lookup(
1476 &self, msg: &ChannelAnnouncement
1477 ) -> Result<(), LightningError> {
1478 self.update_channel_from_announcement::<&UtxoResolver>(msg, &None)
1481 /// Store or update channel info from a channel announcement without verifying the associated
1482 /// signatures. Because we aren't given the associated signatures here we cannot relay the
1483 /// channel announcement to any of our peers.
1485 /// If a [`UtxoLookup`] object is provided via `utxo_lookup`, it will be called to verify
1486 /// the corresponding UTXO exists on chain and is correctly-formatted.
1487 pub fn update_channel_from_unsigned_announcement<U: Deref>(
1488 &self, msg: &msgs::UnsignedChannelAnnouncement, utxo_lookup: &Option<U>
1489 ) -> Result<(), LightningError>
1491 U::Target: UtxoLookup,
1493 self.update_channel_from_unsigned_announcement_intern(msg, None, utxo_lookup)
1496 /// Update channel from partial announcement data received via rapid gossip sync
1498 /// `timestamp: u64`: Timestamp emulating the backdated original announcement receipt (by the
1499 /// rapid gossip sync server)
1501 /// All other parameters as used in [`msgs::UnsignedChannelAnnouncement`] fields.
1502 pub fn add_channel_from_partial_announcement(&self, short_channel_id: u64, timestamp: u64, features: ChannelFeatures, node_id_1: PublicKey, node_id_2: PublicKey) -> Result<(), LightningError> {
1503 if node_id_1 == node_id_2 {
1504 return Err(LightningError{err: "Channel announcement node had a channel with itself".to_owned(), action: ErrorAction::IgnoreError});
1507 let node_1 = NodeId::from_pubkey(&node_id_1);
1508 let node_2 = NodeId::from_pubkey(&node_id_2);
1509 let channel_info = ChannelInfo {
1511 node_one: node_1.clone(),
1513 node_two: node_2.clone(),
1515 capacity_sats: None,
1516 announcement_message: None,
1517 announcement_received_time: timestamp,
1520 self.add_channel_between_nodes(short_channel_id, channel_info, None)
1523 fn add_channel_between_nodes(&self, short_channel_id: u64, channel_info: ChannelInfo, utxo_value: Option<u64>) -> Result<(), LightningError> {
1524 let mut channels = self.channels.write().unwrap();
1525 let mut nodes = self.nodes.write().unwrap();
1527 let node_id_a = channel_info.node_one.clone();
1528 let node_id_b = channel_info.node_two.clone();
1530 match channels.entry(short_channel_id) {
1531 IndexedMapEntry::Occupied(mut entry) => {
1532 //TODO: because asking the blockchain if short_channel_id is valid is only optional
1533 //in the blockchain API, we need to handle it smartly here, though it's unclear
1535 if utxo_value.is_some() {
1536 // Either our UTXO provider is busted, there was a reorg, or the UTXO provider
1537 // only sometimes returns results. In any case remove the previous entry. Note
1538 // that the spec expects us to "blacklist" the node_ids involved, but we can't
1540 // a) we don't *require* a UTXO provider that always returns results.
1541 // b) we don't track UTXOs of channels we know about and remove them if they
1543 // c) it's unclear how to do so without exposing ourselves to massive DoS risk.
1544 Self::remove_channel_in_nodes(&mut nodes, &entry.get(), short_channel_id);
1545 *entry.get_mut() = channel_info;
1547 return Err(LightningError{err: "Already have knowledge of channel".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1550 IndexedMapEntry::Vacant(entry) => {
1551 entry.insert(channel_info);
1555 for current_node_id in [node_id_a, node_id_b].iter() {
1556 match nodes.entry(current_node_id.clone()) {
1557 IndexedMapEntry::Occupied(node_entry) => {
1558 node_entry.into_mut().channels.push(short_channel_id);
1560 IndexedMapEntry::Vacant(node_entry) => {
1561 node_entry.insert(NodeInfo {
1562 channels: vec!(short_channel_id),
1563 announcement_info: None,
1572 fn update_channel_from_unsigned_announcement_intern<U: Deref>(
1573 &self, msg: &msgs::UnsignedChannelAnnouncement, full_msg: Option<&msgs::ChannelAnnouncement>, utxo_lookup: &Option<U>
1574 ) -> Result<(), LightningError>
1576 U::Target: UtxoLookup,
1578 if msg.node_id_1 == msg.node_id_2 || msg.bitcoin_key_1 == msg.bitcoin_key_2 {
1579 return Err(LightningError{err: "Channel announcement node had a channel with itself".to_owned(), action: ErrorAction::IgnoreError});
1582 if msg.chain_hash != self.genesis_hash {
1583 return Err(LightningError {
1584 err: "Channel announcement chain hash does not match genesis hash".to_owned(),
1585 action: ErrorAction::IgnoreAndLog(Level::Debug),
1590 let channels = self.channels.read().unwrap();
1592 if let Some(chan) = channels.get(&msg.short_channel_id) {
1593 if chan.capacity_sats.is_some() {
1594 // If we'd previously looked up the channel on-chain and checked the script
1595 // against what appears on-chain, ignore the duplicate announcement.
1597 // Because a reorg could replace one channel with another at the same SCID, if
1598 // the channel appears to be different, we re-validate. This doesn't expose us
1599 // to any more DoS risk than not, as a peer can always flood us with
1600 // randomly-generated SCID values anyway.
1602 // We use the Node IDs rather than the bitcoin_keys to check for "equivalence"
1603 // as we didn't (necessarily) store the bitcoin keys, and we only really care
1604 // if the peers on the channel changed anyway.
1605 if msg.node_id_1 == chan.node_one && msg.node_id_2 == chan.node_two {
1606 return Err(LightningError {
1607 err: "Already have chain-validated channel".to_owned(),
1608 action: ErrorAction::IgnoreDuplicateGossip
1611 } else if utxo_lookup.is_none() {
1612 // Similarly, if we can't check the chain right now anyway, ignore the
1613 // duplicate announcement without bothering to take the channels write lock.
1614 return Err(LightningError {
1615 err: "Already have non-chain-validated channel".to_owned(),
1616 action: ErrorAction::IgnoreDuplicateGossip
1623 let removed_channels = self.removed_channels.lock().unwrap();
1624 let removed_nodes = self.removed_nodes.lock().unwrap();
1625 if removed_channels.contains_key(&msg.short_channel_id) ||
1626 removed_nodes.contains_key(&msg.node_id_1) ||
1627 removed_nodes.contains_key(&msg.node_id_2) {
1628 return Err(LightningError{
1629 err: format!("Channel with SCID {} or one of its nodes was removed from our network graph recently", &msg.short_channel_id),
1630 action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1634 let utxo_value = self.pending_checks.check_channel_announcement(
1635 utxo_lookup, msg, full_msg)?;
1637 #[allow(unused_mut, unused_assignments)]
1638 let mut announcement_received_time = 0;
1639 #[cfg(feature = "std")]
1641 announcement_received_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1644 let chan_info = ChannelInfo {
1645 features: msg.features.clone(),
1646 node_one: msg.node_id_1,
1648 node_two: msg.node_id_2,
1650 capacity_sats: utxo_value,
1651 announcement_message: if msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY
1652 { full_msg.cloned() } else { None },
1653 announcement_received_time,
1656 self.add_channel_between_nodes(msg.short_channel_id, chan_info, utxo_value)?;
1658 log_gossip!(self.logger, "Added channel_announcement for {}{}", msg.short_channel_id, if !msg.excess_data.is_empty() { " with excess uninterpreted data!" } else { "" });
1662 /// Marks a channel in the graph as failed permanently.
1664 /// The channel and any node for which this was their last channel are removed from the graph.
1665 pub fn channel_failed_permanent(&self, short_channel_id: u64) {
1666 #[cfg(feature = "std")]
1667 let current_time_unix = Some(SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs());
1668 #[cfg(not(feature = "std"))]
1669 let current_time_unix = None;
1671 self.channel_failed_permanent_with_time(short_channel_id, current_time_unix)
1674 /// Marks a channel in the graph as failed permanently.
1676 /// The channel and any node for which this was their last channel are removed from the graph.
1677 fn channel_failed_permanent_with_time(&self, short_channel_id: u64, current_time_unix: Option<u64>) {
1678 let mut channels = self.channels.write().unwrap();
1679 if let Some(chan) = channels.remove(&short_channel_id) {
1680 let mut nodes = self.nodes.write().unwrap();
1681 self.removed_channels.lock().unwrap().insert(short_channel_id, current_time_unix);
1682 Self::remove_channel_in_nodes(&mut nodes, &chan, short_channel_id);
1686 /// Marks a node in the graph as permanently failed, effectively removing it and its channels
1687 /// from local storage.
1688 pub fn node_failed_permanent(&self, node_id: &PublicKey) {
1689 #[cfg(feature = "std")]
1690 let current_time_unix = Some(SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs());
1691 #[cfg(not(feature = "std"))]
1692 let current_time_unix = None;
1694 let node_id = NodeId::from_pubkey(node_id);
1695 let mut channels = self.channels.write().unwrap();
1696 let mut nodes = self.nodes.write().unwrap();
1697 let mut removed_channels = self.removed_channels.lock().unwrap();
1698 let mut removed_nodes = self.removed_nodes.lock().unwrap();
1700 if let Some(node) = nodes.remove(&node_id) {
1701 for scid in node.channels.iter() {
1702 if let Some(chan_info) = channels.remove(scid) {
1703 let other_node_id = if node_id == chan_info.node_one { chan_info.node_two } else { chan_info.node_one };
1704 if let IndexedMapEntry::Occupied(mut other_node_entry) = nodes.entry(other_node_id) {
1705 other_node_entry.get_mut().channels.retain(|chan_id| {
1708 if other_node_entry.get().channels.is_empty() {
1709 other_node_entry.remove_entry();
1712 removed_channels.insert(*scid, current_time_unix);
1715 removed_nodes.insert(node_id, current_time_unix);
1719 #[cfg(feature = "std")]
1720 /// Removes information about channels that we haven't heard any updates about in some time.
1721 /// This can be used regularly to prune the network graph of channels that likely no longer
1724 /// While there is no formal requirement that nodes regularly re-broadcast their channel
1725 /// updates every two weeks, the non-normative section of BOLT 7 currently suggests that
1726 /// pruning occur for updates which are at least two weeks old, which we implement here.
1728 /// Note that for users of the `lightning-background-processor` crate this method may be
1729 /// automatically called regularly for you.
1731 /// This method will also cause us to stop tracking removed nodes and channels if they have been
1732 /// in the map for a while so that these can be resynced from gossip in the future.
1734 /// This method is only available with the `std` feature. See
1735 /// [`NetworkGraph::remove_stale_channels_and_tracking_with_time`] for `no-std` use.
1736 pub fn remove_stale_channels_and_tracking(&self) {
1737 let time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1738 self.remove_stale_channels_and_tracking_with_time(time);
1741 /// Removes information about channels that we haven't heard any updates about in some time.
1742 /// This can be used regularly to prune the network graph of channels that likely no longer
1745 /// While there is no formal requirement that nodes regularly re-broadcast their channel
1746 /// updates every two weeks, the non-normative section of BOLT 7 currently suggests that
1747 /// pruning occur for updates which are at least two weeks old, which we implement here.
1749 /// This method will also cause us to stop tracking removed nodes and channels if they have been
1750 /// in the map for a while so that these can be resynced from gossip in the future.
1752 /// This function takes the current unix time as an argument. For users with the `std` feature
1753 /// enabled, [`NetworkGraph::remove_stale_channels_and_tracking`] may be preferable.
1754 pub fn remove_stale_channels_and_tracking_with_time(&self, current_time_unix: u64) {
1755 let mut channels = self.channels.write().unwrap();
1756 // Time out if we haven't received an update in at least 14 days.
1757 if current_time_unix > u32::max_value() as u64 { return; } // Remove by 2106
1758 if current_time_unix < STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS { return; }
1759 let min_time_unix: u32 = (current_time_unix - STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS) as u32;
1760 // Sadly BTreeMap::retain was only stabilized in 1.53 so we can't switch to it for some
1762 let mut scids_to_remove = Vec::new();
1763 for (scid, info) in channels.unordered_iter_mut() {
1764 if info.one_to_two.is_some() && info.one_to_two.as_ref().unwrap().last_update < min_time_unix {
1765 info.one_to_two = None;
1767 if info.two_to_one.is_some() && info.two_to_one.as_ref().unwrap().last_update < min_time_unix {
1768 info.two_to_one = None;
1770 if info.one_to_two.is_none() || info.two_to_one.is_none() {
1771 // We check the announcement_received_time here to ensure we don't drop
1772 // announcements that we just received and are just waiting for our peer to send a
1773 // channel_update for.
1774 if info.announcement_received_time < min_time_unix as u64 {
1775 scids_to_remove.push(*scid);
1779 if !scids_to_remove.is_empty() {
1780 let mut nodes = self.nodes.write().unwrap();
1781 for scid in scids_to_remove {
1782 let info = channels.remove(&scid).expect("We just accessed this scid, it should be present");
1783 Self::remove_channel_in_nodes(&mut nodes, &info, scid);
1784 self.removed_channels.lock().unwrap().insert(scid, Some(current_time_unix));
1788 let should_keep_tracking = |time: &mut Option<u64>| {
1789 if let Some(time) = time {
1790 current_time_unix.saturating_sub(*time) < REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS
1792 // NOTE: In the case of no-std, we won't have access to the current UNIX time at the time of removal,
1793 // so we'll just set the removal time here to the current UNIX time on the very next invocation
1794 // of this function.
1795 #[cfg(feature = "no-std")]
1797 let mut tracked_time = Some(current_time_unix);
1798 core::mem::swap(time, &mut tracked_time);
1801 #[allow(unreachable_code)]
1805 self.removed_channels.lock().unwrap().retain(|_, time| should_keep_tracking(time));
1806 self.removed_nodes.lock().unwrap().retain(|_, time| should_keep_tracking(time));
1809 /// For an already known (from announcement) channel, update info about one of the directions
1812 /// You probably don't want to call this directly, instead relying on a P2PGossipSync's
1813 /// RoutingMessageHandler implementation to call it indirectly. This may be useful to accept
1814 /// routing messages from a source using a protocol other than the lightning P2P protocol.
1816 /// If built with `no-std`, any updates with a timestamp more than two weeks in the past or
1817 /// materially in the future will be rejected.
1818 pub fn update_channel(&self, msg: &msgs::ChannelUpdate) -> Result<(), LightningError> {
1819 self.update_channel_intern(&msg.contents, Some(&msg), Some(&msg.signature))
1822 /// For an already known (from announcement) channel, update info about one of the directions
1823 /// of the channel without verifying the associated signatures. Because we aren't given the
1824 /// associated signatures here we cannot relay the channel update to any of our peers.
1826 /// If built with `no-std`, any updates with a timestamp more than two weeks in the past or
1827 /// materially in the future will be rejected.
1828 pub fn update_channel_unsigned(&self, msg: &msgs::UnsignedChannelUpdate) -> Result<(), LightningError> {
1829 self.update_channel_intern(msg, None, None)
1832 fn update_channel_intern(&self, msg: &msgs::UnsignedChannelUpdate, full_msg: Option<&msgs::ChannelUpdate>, sig: Option<&secp256k1::ecdsa::Signature>) -> Result<(), LightningError> {
1833 let chan_enabled = msg.flags & (1 << 1) != (1 << 1);
1835 if msg.chain_hash != self.genesis_hash {
1836 return Err(LightningError {
1837 err: "Channel update chain hash does not match genesis hash".to_owned(),
1838 action: ErrorAction::IgnoreAndLog(Level::Debug),
1842 #[cfg(all(feature = "std", not(test), not(feature = "_test_utils")))]
1844 // Note that many tests rely on being able to set arbitrarily old timestamps, thus we
1845 // disable this check during tests!
1846 let time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1847 if (msg.timestamp as u64) < time - STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS {
1848 return Err(LightningError{err: "channel_update is older than two weeks old".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1850 if msg.timestamp as u64 > time + 60 * 60 * 24 {
1851 return Err(LightningError{err: "channel_update has a timestamp more than a day in the future".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1855 let mut channels = self.channels.write().unwrap();
1856 match channels.get_mut(&msg.short_channel_id) {
1858 core::mem::drop(channels);
1859 self.pending_checks.check_hold_pending_channel_update(msg, full_msg)?;
1860 return Err(LightningError{err: "Couldn't find channel for update".to_owned(), action: ErrorAction::IgnoreError});
1863 if msg.htlc_maximum_msat > MAX_VALUE_MSAT {
1864 return Err(LightningError{err:
1865 "htlc_maximum_msat is larger than maximum possible msats".to_owned(),
1866 action: ErrorAction::IgnoreError});
1869 if let Some(capacity_sats) = channel.capacity_sats {
1870 // It's possible channel capacity is available now, although it wasn't available at announcement (so the field is None).
1871 // Don't query UTXO set here to reduce DoS risks.
1872 if capacity_sats > MAX_VALUE_MSAT / 1000 || msg.htlc_maximum_msat > capacity_sats * 1000 {
1873 return Err(LightningError{err:
1874 "htlc_maximum_msat is larger than channel capacity or capacity is bogus".to_owned(),
1875 action: ErrorAction::IgnoreError});
1878 macro_rules! check_update_latest {
1879 ($target: expr) => {
1880 if let Some(existing_chan_info) = $target.as_ref() {
1881 // The timestamp field is somewhat of a misnomer - the BOLTs use it to
1882 // order updates to ensure you always have the latest one, only
1883 // suggesting that it be at least the current time. For
1884 // channel_updates specifically, the BOLTs discuss the possibility of
1885 // pruning based on the timestamp field being more than two weeks old,
1886 // but only in the non-normative section.
1887 if existing_chan_info.last_update > msg.timestamp {
1888 return Err(LightningError{err: "Update older than last processed update".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1889 } else if existing_chan_info.last_update == msg.timestamp {
1890 return Err(LightningError{err: "Update had same timestamp as last processed update".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1896 macro_rules! get_new_channel_info {
1898 let last_update_message = if msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY
1899 { full_msg.cloned() } else { None };
1901 let updated_channel_update_info = ChannelUpdateInfo {
1902 enabled: chan_enabled,
1903 last_update: msg.timestamp,
1904 cltv_expiry_delta: msg.cltv_expiry_delta,
1905 htlc_minimum_msat: msg.htlc_minimum_msat,
1906 htlc_maximum_msat: msg.htlc_maximum_msat,
1908 base_msat: msg.fee_base_msat,
1909 proportional_millionths: msg.fee_proportional_millionths,
1913 Some(updated_channel_update_info)
1917 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.encode()[..])[..]);
1918 if msg.flags & 1 == 1 {
1919 check_update_latest!(channel.two_to_one);
1920 if let Some(sig) = sig {
1921 secp_verify_sig!(self.secp_ctx, &msg_hash, &sig, &PublicKey::from_slice(channel.node_two.as_slice()).map_err(|_| LightningError{
1922 err: "Couldn't parse source node pubkey".to_owned(),
1923 action: ErrorAction::IgnoreAndLog(Level::Debug)
1924 })?, "channel_update");
1926 channel.two_to_one = get_new_channel_info!();
1928 check_update_latest!(channel.one_to_two);
1929 if let Some(sig) = sig {
1930 secp_verify_sig!(self.secp_ctx, &msg_hash, &sig, &PublicKey::from_slice(channel.node_one.as_slice()).map_err(|_| LightningError{
1931 err: "Couldn't parse destination node pubkey".to_owned(),
1932 action: ErrorAction::IgnoreAndLog(Level::Debug)
1933 })?, "channel_update");
1935 channel.one_to_two = get_new_channel_info!();
1943 fn remove_channel_in_nodes(nodes: &mut IndexedMap<NodeId, NodeInfo>, chan: &ChannelInfo, short_channel_id: u64) {
1944 macro_rules! remove_from_node {
1945 ($node_id: expr) => {
1946 if let IndexedMapEntry::Occupied(mut entry) = nodes.entry($node_id) {
1947 entry.get_mut().channels.retain(|chan_id| {
1948 short_channel_id != *chan_id
1950 if entry.get().channels.is_empty() {
1951 entry.remove_entry();
1954 panic!("Had channel that pointed to unknown node (ie inconsistent network map)!");
1959 remove_from_node!(chan.node_one);
1960 remove_from_node!(chan.node_two);
1964 impl ReadOnlyNetworkGraph<'_> {
1965 /// Returns all known valid channels' short ids along with announced channel info.
1967 /// This is not exported to bindings users because we don't want to return lifetime'd references
1968 pub fn channels(&self) -> &IndexedMap<u64, ChannelInfo> {
1972 /// Returns information on a channel with the given id.
1973 pub fn channel(&self, short_channel_id: u64) -> Option<&ChannelInfo> {
1974 self.channels.get(&short_channel_id)
1977 #[cfg(c_bindings)] // Non-bindings users should use `channels`
1978 /// Returns the list of channels in the graph
1979 pub fn list_channels(&self) -> Vec<u64> {
1980 self.channels.unordered_keys().map(|c| *c).collect()
1983 /// Returns all known nodes' public keys along with announced node info.
1985 /// This is not exported to bindings users because we don't want to return lifetime'd references
1986 pub fn nodes(&self) -> &IndexedMap<NodeId, NodeInfo> {
1990 /// Returns information on a node with the given id.
1991 pub fn node(&self, node_id: &NodeId) -> Option<&NodeInfo> {
1992 self.nodes.get(node_id)
1995 #[cfg(c_bindings)] // Non-bindings users should use `nodes`
1996 /// Returns the list of nodes in the graph
1997 pub fn list_nodes(&self) -> Vec<NodeId> {
1998 self.nodes.unordered_keys().map(|n| *n).collect()
2001 /// Get network addresses by node id.
2002 /// Returns None if the requested node is completely unknown,
2003 /// or if node announcement for the node was never received.
2004 pub fn get_addresses(&self, pubkey: &PublicKey) -> Option<Vec<NetAddress>> {
2005 self.nodes.get(&NodeId::from_pubkey(&pubkey))
2006 .and_then(|node| node.announcement_info.as_ref().map(|ann| ann.addresses().to_vec()))
2011 pub(crate) mod tests {
2012 use crate::events::{MessageSendEvent, MessageSendEventsProvider};
2013 use crate::ln::channelmanager;
2014 use crate::ln::chan_utils::make_funding_redeemscript;
2015 #[cfg(feature = "std")]
2016 use crate::ln::features::InitFeatures;
2017 use crate::routing::gossip::{P2PGossipSync, NetworkGraph, NetworkUpdate, NodeAlias, MAX_EXCESS_BYTES_FOR_RELAY, NodeId, RoutingFees, ChannelUpdateInfo, ChannelInfo, NodeAnnouncementInfo, NodeInfo};
2018 use crate::routing::utxo::{UtxoLookupError, UtxoResult};
2019 use crate::ln::msgs::{RoutingMessageHandler, UnsignedNodeAnnouncement, NodeAnnouncement,
2020 UnsignedChannelAnnouncement, ChannelAnnouncement, UnsignedChannelUpdate, ChannelUpdate,
2021 ReplyChannelRange, QueryChannelRange, QueryShortChannelIds, MAX_VALUE_MSAT};
2022 use crate::util::config::UserConfig;
2023 use crate::util::test_utils;
2024 use crate::util::ser::{ReadableArgs, Readable, Writeable};
2025 use crate::util::scid_utils::scid_from_parts;
2027 use crate::routing::gossip::REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS;
2028 use super::STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS;
2030 use bitcoin::hashes::sha256d::Hash as Sha256dHash;
2031 use bitcoin::hashes::Hash;
2032 use bitcoin::network::constants::Network;
2033 use bitcoin::blockdata::constants::genesis_block;
2034 use bitcoin::blockdata::script::Script;
2035 use bitcoin::blockdata::transaction::TxOut;
2039 use bitcoin::secp256k1::{PublicKey, SecretKey};
2040 use bitcoin::secp256k1::{All, Secp256k1};
2043 use bitcoin::secp256k1;
2044 use crate::prelude::*;
2045 use crate::sync::Arc;
2047 fn create_network_graph() -> NetworkGraph<Arc<test_utils::TestLogger>> {
2048 let logger = Arc::new(test_utils::TestLogger::new());
2049 NetworkGraph::new(Network::Testnet, logger)
2052 fn create_gossip_sync(network_graph: &NetworkGraph<Arc<test_utils::TestLogger>>) -> (
2053 Secp256k1<All>, P2PGossipSync<&NetworkGraph<Arc<test_utils::TestLogger>>,
2054 Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>
2056 let secp_ctx = Secp256k1::new();
2057 let logger = Arc::new(test_utils::TestLogger::new());
2058 let gossip_sync = P2PGossipSync::new(network_graph, None, Arc::clone(&logger));
2059 (secp_ctx, gossip_sync)
2063 #[cfg(feature = "std")]
2064 fn request_full_sync_finite_times() {
2065 let network_graph = create_network_graph();
2066 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2067 let node_id = PublicKey::from_secret_key(&secp_ctx, &SecretKey::from_slice(&hex::decode("0202020202020202020202020202020202020202020202020202020202020202").unwrap()[..]).unwrap());
2069 assert!(gossip_sync.should_request_full_sync(&node_id));
2070 assert!(gossip_sync.should_request_full_sync(&node_id));
2071 assert!(gossip_sync.should_request_full_sync(&node_id));
2072 assert!(gossip_sync.should_request_full_sync(&node_id));
2073 assert!(gossip_sync.should_request_full_sync(&node_id));
2074 assert!(!gossip_sync.should_request_full_sync(&node_id));
2077 pub(crate) fn get_signed_node_announcement<F: Fn(&mut UnsignedNodeAnnouncement)>(f: F, node_key: &SecretKey, secp_ctx: &Secp256k1<secp256k1::All>) -> NodeAnnouncement {
2078 let node_id = NodeId::from_pubkey(&PublicKey::from_secret_key(&secp_ctx, node_key));
2079 let mut unsigned_announcement = UnsignedNodeAnnouncement {
2080 features: channelmanager::provided_node_features(&UserConfig::default()),
2084 alias: NodeAlias([0; 32]),
2085 addresses: Vec::new(),
2086 excess_address_data: Vec::new(),
2087 excess_data: Vec::new(),
2089 f(&mut unsigned_announcement);
2090 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_announcement.encode()[..])[..]);
2092 signature: secp_ctx.sign_ecdsa(&msghash, node_key),
2093 contents: unsigned_announcement
2097 pub(crate) fn get_signed_channel_announcement<F: Fn(&mut UnsignedChannelAnnouncement)>(f: F, node_1_key: &SecretKey, node_2_key: &SecretKey, secp_ctx: &Secp256k1<secp256k1::All>) -> ChannelAnnouncement {
2098 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_1_key);
2099 let node_id_2 = PublicKey::from_secret_key(&secp_ctx, node_2_key);
2100 let node_1_btckey = &SecretKey::from_slice(&[40; 32]).unwrap();
2101 let node_2_btckey = &SecretKey::from_slice(&[39; 32]).unwrap();
2103 let mut unsigned_announcement = UnsignedChannelAnnouncement {
2104 features: channelmanager::provided_channel_features(&UserConfig::default()),
2105 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2106 short_channel_id: 0,
2107 node_id_1: NodeId::from_pubkey(&node_id_1),
2108 node_id_2: NodeId::from_pubkey(&node_id_2),
2109 bitcoin_key_1: NodeId::from_pubkey(&PublicKey::from_secret_key(&secp_ctx, node_1_btckey)),
2110 bitcoin_key_2: NodeId::from_pubkey(&PublicKey::from_secret_key(&secp_ctx, node_2_btckey)),
2111 excess_data: Vec::new(),
2113 f(&mut unsigned_announcement);
2114 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_announcement.encode()[..])[..]);
2115 ChannelAnnouncement {
2116 node_signature_1: secp_ctx.sign_ecdsa(&msghash, node_1_key),
2117 node_signature_2: secp_ctx.sign_ecdsa(&msghash, node_2_key),
2118 bitcoin_signature_1: secp_ctx.sign_ecdsa(&msghash, node_1_btckey),
2119 bitcoin_signature_2: secp_ctx.sign_ecdsa(&msghash, node_2_btckey),
2120 contents: unsigned_announcement,
2124 pub(crate) fn get_channel_script(secp_ctx: &Secp256k1<secp256k1::All>) -> Script {
2125 let node_1_btckey = SecretKey::from_slice(&[40; 32]).unwrap();
2126 let node_2_btckey = SecretKey::from_slice(&[39; 32]).unwrap();
2127 make_funding_redeemscript(&PublicKey::from_secret_key(secp_ctx, &node_1_btckey),
2128 &PublicKey::from_secret_key(secp_ctx, &node_2_btckey)).to_v0_p2wsh()
2131 pub(crate) fn get_signed_channel_update<F: Fn(&mut UnsignedChannelUpdate)>(f: F, node_key: &SecretKey, secp_ctx: &Secp256k1<secp256k1::All>) -> ChannelUpdate {
2132 let mut unsigned_channel_update = UnsignedChannelUpdate {
2133 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
2134 short_channel_id: 0,
2137 cltv_expiry_delta: 144,
2138 htlc_minimum_msat: 1_000_000,
2139 htlc_maximum_msat: 1_000_000,
2140 fee_base_msat: 10_000,
2141 fee_proportional_millionths: 20,
2142 excess_data: Vec::new()
2144 f(&mut unsigned_channel_update);
2145 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_channel_update.encode()[..])[..]);
2147 signature: secp_ctx.sign_ecdsa(&msghash, node_key),
2148 contents: unsigned_channel_update
2153 fn handling_node_announcements() {
2154 let network_graph = create_network_graph();
2155 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2157 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2158 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2159 let zero_hash = Sha256dHash::hash(&[0; 32]);
2161 let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
2162 match gossip_sync.handle_node_announcement(&valid_announcement) {
2164 Err(e) => assert_eq!("No existing channels for node_announcement", e.err)
2168 // Announce a channel to add a corresponding node.
2169 let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2170 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2171 Ok(res) => assert!(res),
2176 match gossip_sync.handle_node_announcement(&valid_announcement) {
2177 Ok(res) => assert!(res),
2181 let fake_msghash = hash_to_message!(&zero_hash);
2182 match gossip_sync.handle_node_announcement(
2184 signature: secp_ctx.sign_ecdsa(&fake_msghash, node_1_privkey),
2185 contents: valid_announcement.contents.clone()
2188 Err(e) => assert_eq!(e.err, "Invalid signature on node_announcement message")
2191 let announcement_with_data = get_signed_node_announcement(|unsigned_announcement| {
2192 unsigned_announcement.timestamp += 1000;
2193 unsigned_announcement.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
2194 }, node_1_privkey, &secp_ctx);
2195 // Return false because contains excess data.
2196 match gossip_sync.handle_node_announcement(&announcement_with_data) {
2197 Ok(res) => assert!(!res),
2201 // Even though previous announcement was not relayed further, we still accepted it,
2202 // so we now won't accept announcements before the previous one.
2203 let outdated_announcement = get_signed_node_announcement(|unsigned_announcement| {
2204 unsigned_announcement.timestamp += 1000 - 10;
2205 }, node_1_privkey, &secp_ctx);
2206 match gossip_sync.handle_node_announcement(&outdated_announcement) {
2208 Err(e) => assert_eq!(e.err, "Update older than last processed update")
2213 fn handling_channel_announcements() {
2214 let secp_ctx = Secp256k1::new();
2215 let logger = test_utils::TestLogger::new();
2217 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2218 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2220 let good_script = get_channel_script(&secp_ctx);
2221 let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2223 // Test if the UTXO lookups were not supported
2224 let network_graph = NetworkGraph::new(Network::Testnet, &logger);
2225 let mut gossip_sync = P2PGossipSync::new(&network_graph, None, &logger);
2226 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2227 Ok(res) => assert!(res),
2232 match network_graph.read_only().channels().get(&valid_announcement.contents.short_channel_id) {
2238 // If we receive announcement for the same channel (with UTXO lookups disabled),
2239 // drop new one on the floor, since we can't see any changes.
2240 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2242 Err(e) => assert_eq!(e.err, "Already have non-chain-validated channel")
2245 // Test if an associated transaction were not on-chain (or not confirmed).
2246 let chain_source = test_utils::TestChainSource::new(Network::Testnet);
2247 *chain_source.utxo_ret.lock().unwrap() = UtxoResult::Sync(Err(UtxoLookupError::UnknownTx));
2248 let network_graph = NetworkGraph::new(Network::Testnet, &logger);
2249 gossip_sync = P2PGossipSync::new(&network_graph, Some(&chain_source), &logger);
2251 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
2252 unsigned_announcement.short_channel_id += 1;
2253 }, node_1_privkey, node_2_privkey, &secp_ctx);
2254 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2256 Err(e) => assert_eq!(e.err, "Channel announced without corresponding UTXO entry")
2259 // Now test if the transaction is found in the UTXO set and the script is correct.
2260 *chain_source.utxo_ret.lock().unwrap() =
2261 UtxoResult::Sync(Ok(TxOut { value: 0, script_pubkey: good_script.clone() }));
2262 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
2263 unsigned_announcement.short_channel_id += 2;
2264 }, node_1_privkey, node_2_privkey, &secp_ctx);
2265 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2266 Ok(res) => assert!(res),
2271 match network_graph.read_only().channels().get(&valid_announcement.contents.short_channel_id) {
2277 // If we receive announcement for the same channel, once we've validated it against the
2278 // chain, we simply ignore all new (duplicate) announcements.
2279 *chain_source.utxo_ret.lock().unwrap() =
2280 UtxoResult::Sync(Ok(TxOut { value: 0, script_pubkey: good_script }));
2281 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2283 Err(e) => assert_eq!(e.err, "Already have chain-validated channel")
2286 #[cfg(feature = "std")]
2288 use std::time::{SystemTime, UNIX_EPOCH};
2290 let tracking_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
2291 // Mark a node as permanently failed so it's tracked as removed.
2292 gossip_sync.network_graph().node_failed_permanent(&PublicKey::from_secret_key(&secp_ctx, node_1_privkey));
2294 // Return error and ignore valid channel announcement if one of the nodes has been tracked as removed.
2295 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
2296 unsigned_announcement.short_channel_id += 3;
2297 }, node_1_privkey, node_2_privkey, &secp_ctx);
2298 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2300 Err(e) => assert_eq!(e.err, "Channel with SCID 3 or one of its nodes was removed from our network graph recently")
2303 gossip_sync.network_graph().remove_stale_channels_and_tracking_with_time(tracking_time + REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS);
2305 // The above channel announcement should be handled as per normal now.
2306 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2307 Ok(res) => assert!(res),
2312 // Don't relay valid channels with excess data
2313 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
2314 unsigned_announcement.short_channel_id += 4;
2315 unsigned_announcement.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
2316 }, node_1_privkey, node_2_privkey, &secp_ctx);
2317 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2318 Ok(res) => assert!(!res),
2322 let mut invalid_sig_announcement = valid_announcement.clone();
2323 invalid_sig_announcement.contents.excess_data = Vec::new();
2324 match gossip_sync.handle_channel_announcement(&invalid_sig_announcement) {
2326 Err(e) => assert_eq!(e.err, "Invalid signature on channel_announcement message")
2329 let channel_to_itself_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_1_privkey, &secp_ctx);
2330 match gossip_sync.handle_channel_announcement(&channel_to_itself_announcement) {
2332 Err(e) => assert_eq!(e.err, "Channel announcement node had a channel with itself")
2335 // Test that channel announcements with the wrong chain hash are ignored (network graph is testnet,
2336 // announcement is mainnet).
2337 let incorrect_chain_announcement = get_signed_channel_announcement(|unsigned_announcement| {
2338 unsigned_announcement.chain_hash = genesis_block(Network::Bitcoin).header.block_hash();
2339 }, node_1_privkey, node_2_privkey, &secp_ctx);
2340 match gossip_sync.handle_channel_announcement(&incorrect_chain_announcement) {
2342 Err(e) => assert_eq!(e.err, "Channel announcement chain hash does not match genesis hash")
2347 fn handling_channel_update() {
2348 let secp_ctx = Secp256k1::new();
2349 let logger = test_utils::TestLogger::new();
2350 let chain_source = test_utils::TestChainSource::new(Network::Testnet);
2351 let network_graph = NetworkGraph::new(Network::Testnet, &logger);
2352 let gossip_sync = P2PGossipSync::new(&network_graph, Some(&chain_source), &logger);
2354 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2355 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2357 let amount_sats = 1000_000;
2358 let short_channel_id;
2361 // Announce a channel we will update
2362 let good_script = get_channel_script(&secp_ctx);
2363 *chain_source.utxo_ret.lock().unwrap() =
2364 UtxoResult::Sync(Ok(TxOut { value: amount_sats, script_pubkey: good_script.clone() }));
2366 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2367 short_channel_id = valid_channel_announcement.contents.short_channel_id;
2368 match gossip_sync.handle_channel_announcement(&valid_channel_announcement) {
2375 let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
2376 match gossip_sync.handle_channel_update(&valid_channel_update) {
2377 Ok(res) => assert!(res),
2382 match network_graph.read_only().channels().get(&short_channel_id) {
2384 Some(channel_info) => {
2385 assert_eq!(channel_info.one_to_two.as_ref().unwrap().cltv_expiry_delta, 144);
2386 assert!(channel_info.two_to_one.is_none());
2391 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2392 unsigned_channel_update.timestamp += 100;
2393 unsigned_channel_update.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
2394 }, node_1_privkey, &secp_ctx);
2395 // Return false because contains excess data
2396 match gossip_sync.handle_channel_update(&valid_channel_update) {
2397 Ok(res) => assert!(!res),
2401 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2402 unsigned_channel_update.timestamp += 110;
2403 unsigned_channel_update.short_channel_id += 1;
2404 }, node_1_privkey, &secp_ctx);
2405 match gossip_sync.handle_channel_update(&valid_channel_update) {
2407 Err(e) => assert_eq!(e.err, "Couldn't find channel for update")
2410 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2411 unsigned_channel_update.htlc_maximum_msat = MAX_VALUE_MSAT + 1;
2412 unsigned_channel_update.timestamp += 110;
2413 }, node_1_privkey, &secp_ctx);
2414 match gossip_sync.handle_channel_update(&valid_channel_update) {
2416 Err(e) => assert_eq!(e.err, "htlc_maximum_msat is larger than maximum possible msats")
2419 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2420 unsigned_channel_update.htlc_maximum_msat = amount_sats * 1000 + 1;
2421 unsigned_channel_update.timestamp += 110;
2422 }, node_1_privkey, &secp_ctx);
2423 match gossip_sync.handle_channel_update(&valid_channel_update) {
2425 Err(e) => assert_eq!(e.err, "htlc_maximum_msat is larger than channel capacity or capacity is bogus")
2428 // Even though previous update was not relayed further, we still accepted it,
2429 // so we now won't accept update before the previous one.
2430 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2431 unsigned_channel_update.timestamp += 100;
2432 }, node_1_privkey, &secp_ctx);
2433 match gossip_sync.handle_channel_update(&valid_channel_update) {
2435 Err(e) => assert_eq!(e.err, "Update had same timestamp as last processed update")
2438 let mut invalid_sig_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2439 unsigned_channel_update.timestamp += 500;
2440 }, node_1_privkey, &secp_ctx);
2441 let zero_hash = Sha256dHash::hash(&[0; 32]);
2442 let fake_msghash = hash_to_message!(&zero_hash);
2443 invalid_sig_channel_update.signature = secp_ctx.sign_ecdsa(&fake_msghash, node_1_privkey);
2444 match gossip_sync.handle_channel_update(&invalid_sig_channel_update) {
2446 Err(e) => assert_eq!(e.err, "Invalid signature on channel_update message")
2449 // Test that channel updates with the wrong chain hash are ignored (network graph is testnet, channel
2450 // update is mainet).
2451 let incorrect_chain_update = get_signed_channel_update(|unsigned_channel_update| {
2452 unsigned_channel_update.chain_hash = genesis_block(Network::Bitcoin).header.block_hash();
2453 }, node_1_privkey, &secp_ctx);
2455 match gossip_sync.handle_channel_update(&incorrect_chain_update) {
2457 Err(e) => assert_eq!(e.err, "Channel update chain hash does not match genesis hash")
2462 fn handling_network_update() {
2463 let logger = test_utils::TestLogger::new();
2464 let network_graph = NetworkGraph::new(Network::Testnet, &logger);
2465 let secp_ctx = Secp256k1::new();
2467 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2468 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2469 let node_2_id = PublicKey::from_secret_key(&secp_ctx, node_2_privkey);
2472 // There is no nodes in the table at the beginning.
2473 assert_eq!(network_graph.read_only().nodes().len(), 0);
2476 let short_channel_id;
2478 // Announce a channel we will update
2479 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2480 short_channel_id = valid_channel_announcement.contents.short_channel_id;
2481 let chain_source: Option<&test_utils::TestChainSource> = None;
2482 assert!(network_graph.update_channel_from_announcement(&valid_channel_announcement, &chain_source).is_ok());
2483 assert!(network_graph.read_only().channels().get(&short_channel_id).is_some());
2485 let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
2486 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_none());
2488 network_graph.handle_network_update(&NetworkUpdate::ChannelUpdateMessage {
2489 msg: valid_channel_update,
2492 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_some());
2495 // Non-permanent failure doesn't touch the channel at all
2497 match network_graph.read_only().channels().get(&short_channel_id) {
2499 Some(channel_info) => {
2500 assert!(channel_info.one_to_two.as_ref().unwrap().enabled);
2504 network_graph.handle_network_update(&NetworkUpdate::ChannelFailure {
2506 is_permanent: false,
2509 match network_graph.read_only().channels().get(&short_channel_id) {
2511 Some(channel_info) => {
2512 assert!(channel_info.one_to_two.as_ref().unwrap().enabled);
2517 // Permanent closing deletes a channel
2518 network_graph.handle_network_update(&NetworkUpdate::ChannelFailure {
2523 assert_eq!(network_graph.read_only().channels().len(), 0);
2524 // Nodes are also deleted because there are no associated channels anymore
2525 assert_eq!(network_graph.read_only().nodes().len(), 0);
2528 // Get a new network graph since we don't want to track removed nodes in this test with "std"
2529 let network_graph = NetworkGraph::new(Network::Testnet, &logger);
2531 // Announce a channel to test permanent node failure
2532 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2533 let short_channel_id = valid_channel_announcement.contents.short_channel_id;
2534 let chain_source: Option<&test_utils::TestChainSource> = None;
2535 assert!(network_graph.update_channel_from_announcement(&valid_channel_announcement, &chain_source).is_ok());
2536 assert!(network_graph.read_only().channels().get(&short_channel_id).is_some());
2538 // Non-permanent node failure does not delete any nodes or channels
2539 network_graph.handle_network_update(&NetworkUpdate::NodeFailure {
2541 is_permanent: false,
2544 assert!(network_graph.read_only().channels().get(&short_channel_id).is_some());
2545 assert!(network_graph.read_only().nodes().get(&NodeId::from_pubkey(&node_2_id)).is_some());
2547 // Permanent node failure deletes node and its channels
2548 network_graph.handle_network_update(&NetworkUpdate::NodeFailure {
2553 assert_eq!(network_graph.read_only().nodes().len(), 0);
2554 // Channels are also deleted because the associated node has been deleted
2555 assert_eq!(network_graph.read_only().channels().len(), 0);
2560 fn test_channel_timeouts() {
2561 // Test the removal of channels with `remove_stale_channels_and_tracking`.
2562 let logger = test_utils::TestLogger::new();
2563 let chain_source = test_utils::TestChainSource::new(Network::Testnet);
2564 let network_graph = NetworkGraph::new(Network::Testnet, &logger);
2565 let gossip_sync = P2PGossipSync::new(&network_graph, Some(&chain_source), &logger);
2566 let secp_ctx = Secp256k1::new();
2568 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2569 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2571 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2572 let short_channel_id = valid_channel_announcement.contents.short_channel_id;
2573 let chain_source: Option<&test_utils::TestChainSource> = None;
2574 assert!(network_graph.update_channel_from_announcement(&valid_channel_announcement, &chain_source).is_ok());
2575 assert!(network_graph.read_only().channels().get(&short_channel_id).is_some());
2577 // Submit two channel updates for each channel direction (update.flags bit).
2578 let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
2579 assert!(gossip_sync.handle_channel_update(&valid_channel_update).is_ok());
2580 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_some());
2582 let valid_channel_update_2 = get_signed_channel_update(|update| {update.flags |=1;}, node_2_privkey, &secp_ctx);
2583 gossip_sync.handle_channel_update(&valid_channel_update_2).unwrap();
2584 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().two_to_one.is_some());
2586 network_graph.remove_stale_channels_and_tracking_with_time(100 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2587 assert_eq!(network_graph.read_only().channels().len(), 1);
2588 assert_eq!(network_graph.read_only().nodes().len(), 2);
2590 network_graph.remove_stale_channels_and_tracking_with_time(101 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2591 #[cfg(not(feature = "std"))] {
2592 // Make sure removed channels are tracked.
2593 assert_eq!(network_graph.removed_channels.lock().unwrap().len(), 1);
2595 network_graph.remove_stale_channels_and_tracking_with_time(101 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS +
2596 REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS);
2598 #[cfg(feature = "std")]
2600 // In std mode, a further check is performed before fully removing the channel -
2601 // the channel_announcement must have been received at least two weeks ago. We
2602 // fudge that here by indicating the time has jumped two weeks.
2603 assert_eq!(network_graph.read_only().channels().len(), 1);
2604 assert_eq!(network_graph.read_only().nodes().len(), 2);
2606 // Note that the directional channel information will have been removed already..
2607 // We want to check that this will work even if *one* of the channel updates is recent,
2608 // so we should add it with a recent timestamp.
2609 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_none());
2610 use std::time::{SystemTime, UNIX_EPOCH};
2611 let announcement_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
2612 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2613 unsigned_channel_update.timestamp = (announcement_time + 1 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS) as u32;
2614 }, node_1_privkey, &secp_ctx);
2615 assert!(gossip_sync.handle_channel_update(&valid_channel_update).is_ok());
2616 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_some());
2617 network_graph.remove_stale_channels_and_tracking_with_time(announcement_time + 1 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2618 // Make sure removed channels are tracked.
2619 assert_eq!(network_graph.removed_channels.lock().unwrap().len(), 1);
2620 // Provide a later time so that sufficient time has passed
2621 network_graph.remove_stale_channels_and_tracking_with_time(announcement_time + 1 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS +
2622 REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS);
2625 assert_eq!(network_graph.read_only().channels().len(), 0);
2626 assert_eq!(network_graph.read_only().nodes().len(), 0);
2627 assert!(network_graph.removed_channels.lock().unwrap().is_empty());
2629 #[cfg(feature = "std")]
2631 use std::time::{SystemTime, UNIX_EPOCH};
2633 let tracking_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
2635 // Clear tracked nodes and channels for clean slate
2636 network_graph.removed_channels.lock().unwrap().clear();
2637 network_graph.removed_nodes.lock().unwrap().clear();
2639 // Add a channel and nodes from channel announcement. So our network graph will
2640 // now only consist of two nodes and one channel between them.
2641 assert!(network_graph.update_channel_from_announcement(
2642 &valid_channel_announcement, &chain_source).is_ok());
2644 // Mark the channel as permanently failed. This will also remove the two nodes
2645 // and all of the entries will be tracked as removed.
2646 network_graph.channel_failed_permanent_with_time(short_channel_id, Some(tracking_time));
2648 // Should not remove from tracking if insufficient time has passed
2649 network_graph.remove_stale_channels_and_tracking_with_time(
2650 tracking_time + REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS - 1);
2651 assert_eq!(network_graph.removed_channels.lock().unwrap().len(), 1, "Removed channel count ≠1 with tracking_time {}", tracking_time);
2653 // Provide a later time so that sufficient time has passed
2654 network_graph.remove_stale_channels_and_tracking_with_time(
2655 tracking_time + REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS);
2656 assert!(network_graph.removed_channels.lock().unwrap().is_empty(), "Unexpectedly removed channels with tracking_time {}", tracking_time);
2657 assert!(network_graph.removed_nodes.lock().unwrap().is_empty(), "Unexpectedly removed nodes with tracking_time {}", tracking_time);
2660 #[cfg(not(feature = "std"))]
2662 // When we don't have access to the system clock, the time we started tracking removal will only
2663 // be that provided by the first call to `remove_stale_channels_and_tracking_with_time`. Hence,
2664 // only if sufficient time has passed after that first call, will the next call remove it from
2666 let removal_time = 1664619654;
2668 // Clear removed nodes and channels for clean slate
2669 network_graph.removed_channels.lock().unwrap().clear();
2670 network_graph.removed_nodes.lock().unwrap().clear();
2672 // Add a channel and nodes from channel announcement. So our network graph will
2673 // now only consist of two nodes and one channel between them.
2674 assert!(network_graph.update_channel_from_announcement(
2675 &valid_channel_announcement, &chain_source).is_ok());
2677 // Mark the channel as permanently failed. This will also remove the two nodes
2678 // and all of the entries will be tracked as removed.
2679 network_graph.channel_failed_permanent(short_channel_id);
2681 // The first time we call the following, the channel will have a removal time assigned.
2682 network_graph.remove_stale_channels_and_tracking_with_time(removal_time);
2683 assert_eq!(network_graph.removed_channels.lock().unwrap().len(), 1);
2685 // Provide a later time so that sufficient time has passed
2686 network_graph.remove_stale_channels_and_tracking_with_time(
2687 removal_time + REMOVED_ENTRIES_TRACKING_AGE_LIMIT_SECS);
2688 assert!(network_graph.removed_channels.lock().unwrap().is_empty());
2689 assert!(network_graph.removed_nodes.lock().unwrap().is_empty());
2694 fn getting_next_channel_announcements() {
2695 let network_graph = create_network_graph();
2696 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2697 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2698 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2700 // Channels were not announced yet.
2701 let channels_with_announcements = gossip_sync.get_next_channel_announcement(0);
2702 assert!(channels_with_announcements.is_none());
2704 let short_channel_id;
2706 // Announce a channel we will update
2707 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2708 short_channel_id = valid_channel_announcement.contents.short_channel_id;
2709 match gossip_sync.handle_channel_announcement(&valid_channel_announcement) {
2715 // Contains initial channel announcement now.
2716 let channels_with_announcements = gossip_sync.get_next_channel_announcement(short_channel_id);
2717 if let Some(channel_announcements) = channels_with_announcements {
2718 let (_, ref update_1, ref update_2) = channel_announcements;
2719 assert_eq!(update_1, &None);
2720 assert_eq!(update_2, &None);
2726 // Valid channel update
2727 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2728 unsigned_channel_update.timestamp = 101;
2729 }, node_1_privkey, &secp_ctx);
2730 match gossip_sync.handle_channel_update(&valid_channel_update) {
2736 // Now contains an initial announcement and an update.
2737 let channels_with_announcements = gossip_sync.get_next_channel_announcement(short_channel_id);
2738 if let Some(channel_announcements) = channels_with_announcements {
2739 let (_, ref update_1, ref update_2) = channel_announcements;
2740 assert_ne!(update_1, &None);
2741 assert_eq!(update_2, &None);
2747 // Channel update with excess data.
2748 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2749 unsigned_channel_update.timestamp = 102;
2750 unsigned_channel_update.excess_data = [1; MAX_EXCESS_BYTES_FOR_RELAY + 1].to_vec();
2751 }, node_1_privkey, &secp_ctx);
2752 match gossip_sync.handle_channel_update(&valid_channel_update) {
2758 // Test that announcements with excess data won't be returned
2759 let channels_with_announcements = gossip_sync.get_next_channel_announcement(short_channel_id);
2760 if let Some(channel_announcements) = channels_with_announcements {
2761 let (_, ref update_1, ref update_2) = channel_announcements;
2762 assert_eq!(update_1, &None);
2763 assert_eq!(update_2, &None);
2768 // Further starting point have no channels after it
2769 let channels_with_announcements = gossip_sync.get_next_channel_announcement(short_channel_id + 1000);
2770 assert!(channels_with_announcements.is_none());
2774 fn getting_next_node_announcements() {
2775 let network_graph = create_network_graph();
2776 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2777 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2778 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2779 let node_id_1 = NodeId::from_pubkey(&PublicKey::from_secret_key(&secp_ctx, node_1_privkey));
2782 let next_announcements = gossip_sync.get_next_node_announcement(None);
2783 assert!(next_announcements.is_none());
2786 // Announce a channel to add 2 nodes
2787 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2788 match gossip_sync.handle_channel_announcement(&valid_channel_announcement) {
2794 // Nodes were never announced
2795 let next_announcements = gossip_sync.get_next_node_announcement(None);
2796 assert!(next_announcements.is_none());
2799 let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
2800 match gossip_sync.handle_node_announcement(&valid_announcement) {
2805 let valid_announcement = get_signed_node_announcement(|_| {}, node_2_privkey, &secp_ctx);
2806 match gossip_sync.handle_node_announcement(&valid_announcement) {
2812 let next_announcements = gossip_sync.get_next_node_announcement(None);
2813 assert!(next_announcements.is_some());
2815 // Skip the first node.
2816 let next_announcements = gossip_sync.get_next_node_announcement(Some(&node_id_1));
2817 assert!(next_announcements.is_some());
2820 // Later announcement which should not be relayed (excess data) prevent us from sharing a node
2821 let valid_announcement = get_signed_node_announcement(|unsigned_announcement| {
2822 unsigned_announcement.timestamp += 10;
2823 unsigned_announcement.excess_data = [1; MAX_EXCESS_BYTES_FOR_RELAY + 1].to_vec();
2824 }, node_2_privkey, &secp_ctx);
2825 match gossip_sync.handle_node_announcement(&valid_announcement) {
2826 Ok(res) => assert!(!res),
2831 let next_announcements = gossip_sync.get_next_node_announcement(Some(&node_id_1));
2832 assert!(next_announcements.is_none());
2836 fn network_graph_serialization() {
2837 let network_graph = create_network_graph();
2838 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2840 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2841 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2843 // Announce a channel to add a corresponding node.
2844 let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2845 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2846 Ok(res) => assert!(res),
2850 let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
2851 match gossip_sync.handle_node_announcement(&valid_announcement) {
2856 let mut w = test_utils::TestVecWriter(Vec::new());
2857 assert!(!network_graph.read_only().nodes().is_empty());
2858 assert!(!network_graph.read_only().channels().is_empty());
2859 network_graph.write(&mut w).unwrap();
2861 let logger = Arc::new(test_utils::TestLogger::new());
2862 assert!(<NetworkGraph<_>>::read(&mut io::Cursor::new(&w.0), logger).unwrap() == network_graph);
2866 fn network_graph_tlv_serialization() {
2867 let network_graph = create_network_graph();
2868 network_graph.set_last_rapid_gossip_sync_timestamp(42);
2870 let mut w = test_utils::TestVecWriter(Vec::new());
2871 network_graph.write(&mut w).unwrap();
2873 let logger = Arc::new(test_utils::TestLogger::new());
2874 let reassembled_network_graph: NetworkGraph<_> = ReadableArgs::read(&mut io::Cursor::new(&w.0), logger).unwrap();
2875 assert!(reassembled_network_graph == network_graph);
2876 assert_eq!(reassembled_network_graph.get_last_rapid_gossip_sync_timestamp().unwrap(), 42);
2880 #[cfg(feature = "std")]
2881 fn calling_sync_routing_table() {
2882 use std::time::{SystemTime, UNIX_EPOCH};
2883 use crate::ln::msgs::Init;
2885 let network_graph = create_network_graph();
2886 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2887 let node_privkey_1 = &SecretKey::from_slice(&[42; 32]).unwrap();
2888 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_privkey_1);
2890 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2892 // It should ignore if gossip_queries feature is not enabled
2894 let init_msg = Init { features: InitFeatures::empty(), remote_network_address: None };
2895 gossip_sync.peer_connected(&node_id_1, &init_msg, true).unwrap();
2896 let events = gossip_sync.get_and_clear_pending_msg_events();
2897 assert_eq!(events.len(), 0);
2900 // It should send a gossip_timestamp_filter with the correct information
2902 let mut features = InitFeatures::empty();
2903 features.set_gossip_queries_optional();
2904 let init_msg = Init { features, remote_network_address: None };
2905 gossip_sync.peer_connected(&node_id_1, &init_msg, true).unwrap();
2906 let events = gossip_sync.get_and_clear_pending_msg_events();
2907 assert_eq!(events.len(), 1);
2909 MessageSendEvent::SendGossipTimestampFilter{ node_id, msg } => {
2910 assert_eq!(node_id, &node_id_1);
2911 assert_eq!(msg.chain_hash, chain_hash);
2912 let expected_timestamp = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
2913 assert!((msg.first_timestamp as u64) >= expected_timestamp - 60*60*24*7*2);
2914 assert!((msg.first_timestamp as u64) < expected_timestamp - 60*60*24*7*2 + 10);
2915 assert_eq!(msg.timestamp_range, u32::max_value());
2917 _ => panic!("Expected MessageSendEvent::SendChannelRangeQuery")
2923 fn handling_query_channel_range() {
2924 let network_graph = create_network_graph();
2925 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2927 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2928 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2929 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2930 let node_id_2 = PublicKey::from_secret_key(&secp_ctx, node_2_privkey);
2932 let mut scids: Vec<u64> = vec![
2933 scid_from_parts(0xfffffe, 0xffffff, 0xffff).unwrap(), // max
2934 scid_from_parts(0xffffff, 0xffffff, 0xffff).unwrap(), // never
2937 // used for testing multipart reply across blocks
2938 for block in 100000..=108001 {
2939 scids.push(scid_from_parts(block, 0, 0).unwrap());
2942 // used for testing resumption on same block
2943 scids.push(scid_from_parts(108001, 1, 0).unwrap());
2946 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
2947 unsigned_announcement.short_channel_id = scid;
2948 }, node_1_privkey, node_2_privkey, &secp_ctx);
2949 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2955 // Error when number_of_blocks=0
2956 do_handling_query_channel_range(
2960 chain_hash: chain_hash.clone(),
2962 number_of_blocks: 0,
2965 vec![ReplyChannelRange {
2966 chain_hash: chain_hash.clone(),
2968 number_of_blocks: 0,
2969 sync_complete: true,
2970 short_channel_ids: vec![]
2974 // Error when wrong chain
2975 do_handling_query_channel_range(
2979 chain_hash: genesis_block(Network::Bitcoin).header.block_hash(),
2981 number_of_blocks: 0xffff_ffff,
2984 vec![ReplyChannelRange {
2985 chain_hash: genesis_block(Network::Bitcoin).header.block_hash(),
2987 number_of_blocks: 0xffff_ffff,
2988 sync_complete: true,
2989 short_channel_ids: vec![],
2993 // Error when first_blocknum > 0xffffff
2994 do_handling_query_channel_range(
2998 chain_hash: chain_hash.clone(),
2999 first_blocknum: 0x01000000,
3000 number_of_blocks: 0xffff_ffff,
3003 vec![ReplyChannelRange {
3004 chain_hash: chain_hash.clone(),
3005 first_blocknum: 0x01000000,
3006 number_of_blocks: 0xffff_ffff,
3007 sync_complete: true,
3008 short_channel_ids: vec![]
3012 // Empty reply when max valid SCID block num
3013 do_handling_query_channel_range(
3017 chain_hash: chain_hash.clone(),
3018 first_blocknum: 0xffffff,
3019 number_of_blocks: 1,
3024 chain_hash: chain_hash.clone(),
3025 first_blocknum: 0xffffff,
3026 number_of_blocks: 1,
3027 sync_complete: true,
3028 short_channel_ids: vec![]
3033 // No results in valid query range
3034 do_handling_query_channel_range(
3038 chain_hash: chain_hash.clone(),
3039 first_blocknum: 1000,
3040 number_of_blocks: 1000,
3045 chain_hash: chain_hash.clone(),
3046 first_blocknum: 1000,
3047 number_of_blocks: 1000,
3048 sync_complete: true,
3049 short_channel_ids: vec![],
3054 // Overflow first_blocknum + number_of_blocks
3055 do_handling_query_channel_range(
3059 chain_hash: chain_hash.clone(),
3060 first_blocknum: 0xfe0000,
3061 number_of_blocks: 0xffffffff,
3066 chain_hash: chain_hash.clone(),
3067 first_blocknum: 0xfe0000,
3068 number_of_blocks: 0xffffffff - 0xfe0000,
3069 sync_complete: true,
3070 short_channel_ids: vec![
3071 0xfffffe_ffffff_ffff, // max
3077 // Single block exactly full
3078 do_handling_query_channel_range(
3082 chain_hash: chain_hash.clone(),
3083 first_blocknum: 100000,
3084 number_of_blocks: 8000,
3089 chain_hash: chain_hash.clone(),
3090 first_blocknum: 100000,
3091 number_of_blocks: 8000,
3092 sync_complete: true,
3093 short_channel_ids: (100000..=107999)
3094 .map(|block| scid_from_parts(block, 0, 0).unwrap())
3100 // Multiple split on new block
3101 do_handling_query_channel_range(
3105 chain_hash: chain_hash.clone(),
3106 first_blocknum: 100000,
3107 number_of_blocks: 8001,
3112 chain_hash: chain_hash.clone(),
3113 first_blocknum: 100000,
3114 number_of_blocks: 7999,
3115 sync_complete: false,
3116 short_channel_ids: (100000..=107999)
3117 .map(|block| scid_from_parts(block, 0, 0).unwrap())
3121 chain_hash: chain_hash.clone(),
3122 first_blocknum: 107999,
3123 number_of_blocks: 2,
3124 sync_complete: true,
3125 short_channel_ids: vec![
3126 scid_from_parts(108000, 0, 0).unwrap(),
3132 // Multiple split on same block
3133 do_handling_query_channel_range(
3137 chain_hash: chain_hash.clone(),
3138 first_blocknum: 100002,
3139 number_of_blocks: 8000,
3144 chain_hash: chain_hash.clone(),
3145 first_blocknum: 100002,
3146 number_of_blocks: 7999,
3147 sync_complete: false,
3148 short_channel_ids: (100002..=108001)
3149 .map(|block| scid_from_parts(block, 0, 0).unwrap())
3153 chain_hash: chain_hash.clone(),
3154 first_blocknum: 108001,
3155 number_of_blocks: 1,
3156 sync_complete: true,
3157 short_channel_ids: vec![
3158 scid_from_parts(108001, 1, 0).unwrap(),
3165 fn do_handling_query_channel_range(
3166 gossip_sync: &P2PGossipSync<&NetworkGraph<Arc<test_utils::TestLogger>>, Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>,
3167 test_node_id: &PublicKey,
3168 msg: QueryChannelRange,
3170 expected_replies: Vec<ReplyChannelRange>
3172 let mut max_firstblocknum = msg.first_blocknum.saturating_sub(1);
3173 let mut c_lightning_0_9_prev_end_blocknum = max_firstblocknum;
3174 let query_end_blocknum = msg.end_blocknum();
3175 let result = gossip_sync.handle_query_channel_range(test_node_id, msg);
3178 assert!(result.is_ok());
3180 assert!(result.is_err());
3183 let events = gossip_sync.get_and_clear_pending_msg_events();
3184 assert_eq!(events.len(), expected_replies.len());
3186 for i in 0..events.len() {
3187 let expected_reply = &expected_replies[i];
3189 MessageSendEvent::SendReplyChannelRange { node_id, msg } => {
3190 assert_eq!(node_id, test_node_id);
3191 assert_eq!(msg.chain_hash, expected_reply.chain_hash);
3192 assert_eq!(msg.first_blocknum, expected_reply.first_blocknum);
3193 assert_eq!(msg.number_of_blocks, expected_reply.number_of_blocks);
3194 assert_eq!(msg.sync_complete, expected_reply.sync_complete);
3195 assert_eq!(msg.short_channel_ids, expected_reply.short_channel_ids);
3197 // Enforce exactly the sequencing requirements present on c-lightning v0.9.3
3198 assert!(msg.first_blocknum == c_lightning_0_9_prev_end_blocknum || msg.first_blocknum == c_lightning_0_9_prev_end_blocknum.saturating_add(1));
3199 assert!(msg.first_blocknum >= max_firstblocknum);
3200 max_firstblocknum = msg.first_blocknum;
3201 c_lightning_0_9_prev_end_blocknum = msg.first_blocknum.saturating_add(msg.number_of_blocks);
3203 // Check that the last block count is >= the query's end_blocknum
3204 if i == events.len() - 1 {
3205 assert!(msg.first_blocknum.saturating_add(msg.number_of_blocks) >= query_end_blocknum);
3208 _ => panic!("expected MessageSendEvent::SendReplyChannelRange"),
3214 fn handling_query_short_channel_ids() {
3215 let network_graph = create_network_graph();
3216 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
3217 let node_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
3218 let node_id = PublicKey::from_secret_key(&secp_ctx, node_privkey);
3220 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
3222 let result = gossip_sync.handle_query_short_channel_ids(&node_id, QueryShortChannelIds {
3224 short_channel_ids: vec![0x0003e8_000000_0000],
3226 assert!(result.is_err());
3230 fn displays_node_alias() {
3231 let format_str_alias = |alias: &str| {
3232 let mut bytes = [0u8; 32];
3233 bytes[..alias.as_bytes().len()].copy_from_slice(alias.as_bytes());
3234 format!("{}", NodeAlias(bytes))
3237 assert_eq!(format_str_alias("I\u{1F496}LDK! \u{26A1}"), "I\u{1F496}LDK! \u{26A1}");
3238 assert_eq!(format_str_alias("I\u{1F496}LDK!\0\u{26A1}"), "I\u{1F496}LDK!");
3239 assert_eq!(format_str_alias("I\u{1F496}LDK!\t\u{26A1}"), "I\u{1F496}LDK!\u{FFFD}\u{26A1}");
3241 let format_bytes_alias = |alias: &[u8]| {
3242 let mut bytes = [0u8; 32];
3243 bytes[..alias.len()].copy_from_slice(alias);
3244 format!("{}", NodeAlias(bytes))
3247 assert_eq!(format_bytes_alias(b"\xFFI <heart> LDK!"), "\u{FFFD}I <heart> LDK!");
3248 assert_eq!(format_bytes_alias(b"\xFFI <heart>\0LDK!"), "\u{FFFD}I <heart>");
3249 assert_eq!(format_bytes_alias(b"\xFFI <heart>\tLDK!"), "\u{FFFD}I <heart>\u{FFFD}LDK!");
3253 fn channel_info_is_readable() {
3254 let chanmon_cfgs = crate::ln::functional_test_utils::create_chanmon_cfgs(2);
3255 let node_cfgs = crate::ln::functional_test_utils::create_node_cfgs(2, &chanmon_cfgs);
3256 let node_chanmgrs = crate::ln::functional_test_utils::create_node_chanmgrs(2, &node_cfgs, &[None, None, None, None]);
3257 let nodes = crate::ln::functional_test_utils::create_network(2, &node_cfgs, &node_chanmgrs);
3258 let config = crate::ln::functional_test_utils::test_default_channel_config();
3260 // 1. Test encoding/decoding of ChannelUpdateInfo
3261 let chan_update_info = ChannelUpdateInfo {
3264 cltv_expiry_delta: 42,
3265 htlc_minimum_msat: 1234,
3266 htlc_maximum_msat: 5678,
3267 fees: RoutingFees { base_msat: 9, proportional_millionths: 10 },
3268 last_update_message: None,
3271 let mut encoded_chan_update_info: Vec<u8> = Vec::new();
3272 assert!(chan_update_info.write(&mut encoded_chan_update_info).is_ok());
3274 // First make sure we can read ChannelUpdateInfos we just wrote
3275 let read_chan_update_info: ChannelUpdateInfo = crate::util::ser::Readable::read(&mut encoded_chan_update_info.as_slice()).unwrap();
3276 assert_eq!(chan_update_info, read_chan_update_info);
3278 // Check the serialization hasn't changed.
3279 let legacy_chan_update_info_with_some: Vec<u8> = hex::decode("340004000000170201010402002a060800000000000004d2080909000000000000162e0a0d0c00040000000902040000000a0c0100").unwrap();
3280 assert_eq!(encoded_chan_update_info, legacy_chan_update_info_with_some);
3282 // Check we fail if htlc_maximum_msat is not present in either the ChannelUpdateInfo itself
3283 // or the ChannelUpdate enclosed with `last_update_message`.
3284 let legacy_chan_update_info_with_some_and_fail_update: Vec<u8> = hex::decode("b40004000000170201010402002a060800000000000004d2080909000000000000162e0a0d0c00040000000902040000000a0c8181d977cb9b53d93a6ff64bb5f1e158b4094b66e798fb12911168a3ccdf80a83096340a6a95da0ae8d9f776528eecdbb747eb6b545495a4319ed5378e35b21e073a000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f00083a840000034d013413a70000009000000000000f42400000271000000014").unwrap();
3285 let read_chan_update_info_res: Result<ChannelUpdateInfo, crate::ln::msgs::DecodeError> = crate::util::ser::Readable::read(&mut legacy_chan_update_info_with_some_and_fail_update.as_slice());
3286 assert!(read_chan_update_info_res.is_err());
3288 let legacy_chan_update_info_with_none: Vec<u8> = hex::decode("2c0004000000170201010402002a060800000000000004d20801000a0d0c00040000000902040000000a0c0100").unwrap();
3289 let read_chan_update_info_res: Result<ChannelUpdateInfo, crate::ln::msgs::DecodeError> = crate::util::ser::Readable::read(&mut legacy_chan_update_info_with_none.as_slice());
3290 assert!(read_chan_update_info_res.is_err());
3292 // 2. Test encoding/decoding of ChannelInfo
3293 // Check we can encode/decode ChannelInfo without ChannelUpdateInfo fields present.
3294 let chan_info_none_updates = ChannelInfo {
3295 features: channelmanager::provided_channel_features(&config),
3296 node_one: NodeId::from_pubkey(&nodes[0].node.get_our_node_id()),
3298 node_two: NodeId::from_pubkey(&nodes[1].node.get_our_node_id()),
3300 capacity_sats: None,
3301 announcement_message: None,
3302 announcement_received_time: 87654,
3305 let mut encoded_chan_info: Vec<u8> = Vec::new();
3306 assert!(chan_info_none_updates.write(&mut encoded_chan_info).is_ok());
3308 let read_chan_info: ChannelInfo = crate::util::ser::Readable::read(&mut encoded_chan_info.as_slice()).unwrap();
3309 assert_eq!(chan_info_none_updates, read_chan_info);
3311 // Check we can encode/decode ChannelInfo with ChannelUpdateInfo fields present.
3312 let chan_info_some_updates = ChannelInfo {
3313 features: channelmanager::provided_channel_features(&config),
3314 node_one: NodeId::from_pubkey(&nodes[0].node.get_our_node_id()),
3315 one_to_two: Some(chan_update_info.clone()),
3316 node_two: NodeId::from_pubkey(&nodes[1].node.get_our_node_id()),
3317 two_to_one: Some(chan_update_info.clone()),
3318 capacity_sats: None,
3319 announcement_message: None,
3320 announcement_received_time: 87654,
3323 let mut encoded_chan_info: Vec<u8> = Vec::new();
3324 assert!(chan_info_some_updates.write(&mut encoded_chan_info).is_ok());
3326 let read_chan_info: ChannelInfo = crate::util::ser::Readable::read(&mut encoded_chan_info.as_slice()).unwrap();
3327 assert_eq!(chan_info_some_updates, read_chan_info);
3329 // Check the serialization hasn't changed.
3330 let legacy_chan_info_with_some: Vec<u8> = hex::decode("ca00020000010800000000000156660221027f921585f2ac0c7c70e36110adecfd8fd14b8a99bfb3d000a283fcac358fce88043636340004000000170201010402002a060800000000000004d2080909000000000000162e0a0d0c00040000000902040000000a0c010006210355f8d2238a322d16b602bd0ceaad5b01019fb055971eaadcc9b29226a4da6c23083636340004000000170201010402002a060800000000000004d2080909000000000000162e0a0d0c00040000000902040000000a0c01000a01000c0100").unwrap();
3331 assert_eq!(encoded_chan_info, legacy_chan_info_with_some);
3333 // Check we can decode legacy ChannelInfo, even if the `two_to_one` / `one_to_two` /
3334 // `last_update_message` fields fail to decode due to missing htlc_maximum_msat.
3335 let legacy_chan_info_with_some_and_fail_update = hex::decode("fd01ca00020000010800000000000156660221027f921585f2ac0c7c70e36110adecfd8fd14b8a99bfb3d000a283fcac358fce8804b6b6b40004000000170201010402002a060800000000000004d2080909000000000000162e0a0d0c00040000000902040000000a0c8181d977cb9b53d93a6ff64bb5f1e158b4094b66e798fb12911168a3ccdf80a83096340a6a95da0ae8d9f776528eecdbb747eb6b545495a4319ed5378e35b21e073a000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f00083a840000034d013413a70000009000000000000f4240000027100000001406210355f8d2238a322d16b602bd0ceaad5b01019fb055971eaadcc9b29226a4da6c2308b6b6b40004000000170201010402002a060800000000000004d2080909000000000000162e0a0d0c00040000000902040000000a0c8181d977cb9b53d93a6ff64bb5f1e158b4094b66e798fb12911168a3ccdf80a83096340a6a95da0ae8d9f776528eecdbb747eb6b545495a4319ed5378e35b21e073a000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f00083a840000034d013413a70000009000000000000f424000002710000000140a01000c0100").unwrap();
3336 let read_chan_info: ChannelInfo = crate::util::ser::Readable::read(&mut legacy_chan_info_with_some_and_fail_update.as_slice()).unwrap();
3337 assert_eq!(read_chan_info.announcement_received_time, 87654);
3338 assert_eq!(read_chan_info.one_to_two, None);
3339 assert_eq!(read_chan_info.two_to_one, None);
3341 let legacy_chan_info_with_none: Vec<u8> = hex::decode("ba00020000010800000000000156660221027f921585f2ac0c7c70e36110adecfd8fd14b8a99bfb3d000a283fcac358fce88042e2e2c0004000000170201010402002a060800000000000004d20801000a0d0c00040000000902040000000a0c010006210355f8d2238a322d16b602bd0ceaad5b01019fb055971eaadcc9b29226a4da6c23082e2e2c0004000000170201010402002a060800000000000004d20801000a0d0c00040000000902040000000a0c01000a01000c0100").unwrap();
3342 let read_chan_info: ChannelInfo = crate::util::ser::Readable::read(&mut legacy_chan_info_with_none.as_slice()).unwrap();
3343 assert_eq!(read_chan_info.announcement_received_time, 87654);
3344 assert_eq!(read_chan_info.one_to_two, None);
3345 assert_eq!(read_chan_info.two_to_one, None);
3349 fn node_info_is_readable() {
3350 // 1. Check we can read a valid NodeAnnouncementInfo and fail on an invalid one
3351 let announcement_message = hex::decode("d977cb9b53d93a6ff64bb5f1e158b4094b66e798fb12911168a3ccdf80a83096340a6a95da0ae8d9f776528eecdbb747eb6b545495a4319ed5378e35b21e073a000122013413a7031b84c5567b126440995d3ed5aaba0565d71e1834604819ff9c17f5e9d5dd078f2020201010101010101010101010101010101010101010101010101010101010101010000701fffefdfc2607").unwrap();
3352 let announcement_message = NodeAnnouncement::read(&mut announcement_message.as_slice()).unwrap();
3353 let valid_node_ann_info = NodeAnnouncementInfo {
3354 features: channelmanager::provided_node_features(&UserConfig::default()),
3357 alias: NodeAlias([0u8; 32]),
3358 announcement_message: Some(announcement_message)
3361 let mut encoded_valid_node_ann_info = Vec::new();
3362 assert!(valid_node_ann_info.write(&mut encoded_valid_node_ann_info).is_ok());
3363 let read_valid_node_ann_info = NodeAnnouncementInfo::read(&mut encoded_valid_node_ann_info.as_slice()).unwrap();
3364 assert_eq!(read_valid_node_ann_info, valid_node_ann_info);
3365 assert_eq!(read_valid_node_ann_info.addresses().len(), 1);
3367 let encoded_invalid_node_ann_info = hex::decode("3f0009000788a000080a51a20204000000000403000000062000000000000000000000000000000000000000000000000000000000000000000a0505014004d2").unwrap();
3368 let read_invalid_node_ann_info_res = NodeAnnouncementInfo::read(&mut encoded_invalid_node_ann_info.as_slice());
3369 assert!(read_invalid_node_ann_info_res.is_err());
3371 // 2. Check we can read a NodeInfo anyways, but set the NodeAnnouncementInfo to None if invalid
3372 let valid_node_info = NodeInfo {
3373 channels: Vec::new(),
3374 announcement_info: Some(valid_node_ann_info),
3377 let mut encoded_valid_node_info = Vec::new();
3378 assert!(valid_node_info.write(&mut encoded_valid_node_info).is_ok());
3379 let read_valid_node_info = NodeInfo::read(&mut encoded_valid_node_info.as_slice()).unwrap();
3380 assert_eq!(read_valid_node_info, valid_node_info);
3382 let encoded_invalid_node_info_hex = hex::decode("4402403f0009000788a000080a51a20204000000000403000000062000000000000000000000000000000000000000000000000000000000000000000a0505014004d20400").unwrap();
3383 let read_invalid_node_info = NodeInfo::read(&mut encoded_invalid_node_info_hex.as_slice()).unwrap();
3384 assert_eq!(read_invalid_node_info.announcement_info, None);
3388 fn test_node_info_keeps_compatibility() {
3389 let old_ann_info_with_addresses = hex::decode("3f0009000708a000080a51220204000000000403000000062000000000000000000000000000000000000000000000000000000000000000000a0505014104d2").unwrap();
3390 let ann_info_with_addresses = NodeAnnouncementInfo::read(&mut old_ann_info_with_addresses.as_slice())
3391 .expect("to be able to read an old NodeAnnouncementInfo with addresses");
3392 // This serialized info has an address field but no announcement_message, therefore the addresses returned by our function will still be empty
3393 assert!(ann_info_with_addresses.addresses().is_empty());
3397 #[cfg(all(test, feature = "_bench_unstable"))]
3405 fn read_network_graph(bench: &mut Bencher) {
3406 let logger = crate::util::test_utils::TestLogger::new();
3407 let mut d = crate::routing::router::bench_utils::get_route_file().unwrap();
3408 let mut v = Vec::new();
3409 d.read_to_end(&mut v).unwrap();
3411 let _ = NetworkGraph::read(&mut std::io::Cursor::new(&v), &logger).unwrap();
3416 fn write_network_graph(bench: &mut Bencher) {
3417 let logger = crate::util::test_utils::TestLogger::new();
3418 let mut d = crate::routing::router::bench_utils::get_route_file().unwrap();
3419 let net_graph = NetworkGraph::read(&mut d, &logger).unwrap();
3421 let _ = net_graph.encode();