1 // This file is Copyright its original authors, visible in version control
4 // This file is licensed under the Apache License, Version 2.0 <LICENSE-APACHE
5 // or http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
6 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your option.
7 // You may not use this file except in accordance with one or both of these
10 //! The top-level network map tracking logic lives here.
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::blockdata::script::Builder;
20 use bitcoin::blockdata::transaction::TxOut;
21 use bitcoin::blockdata::opcodes;
22 use bitcoin::hash_types::BlockHash;
26 use ln::features::{ChannelFeatures, NodeFeatures};
27 use ln::msgs::{DecodeError, ErrorAction, Init, LightningError, RoutingMessageHandler, NetAddress, MAX_VALUE_MSAT};
28 use ln::msgs::{ChannelAnnouncement, ChannelUpdate, NodeAnnouncement, OptionalField, GossipTimestampFilter};
29 use ln::msgs::{QueryChannelRange, ReplyChannelRange, QueryShortChannelIds, ReplyShortChannelIdsEnd};
31 use util::ser::{Readable, ReadableArgs, Writeable, Writer};
32 use util::logger::{Logger, Level};
33 use util::events::{Event, EventHandler, MessageSendEvent, MessageSendEventsProvider};
34 use util::scid_utils::{block_from_scid, scid_from_parts, MAX_SCID_BLOCK};
38 use alloc::collections::{BTreeMap, btree_map::Entry as BtreeEntry};
40 use sync::{RwLock, RwLockReadGuard};
41 use core::sync::atomic::{AtomicUsize, Ordering};
44 use bitcoin::hashes::hex::ToHex;
46 #[cfg(feature = "std")]
47 use std::time::{SystemTime, UNIX_EPOCH};
49 /// We remove stale channel directional info two weeks after the last update, per BOLT 7's
51 const STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS: u64 = 60 * 60 * 24 * 14;
53 /// The maximum number of extra bytes which we do not understand in a gossip message before we will
54 /// refuse to relay the message.
55 const MAX_EXCESS_BYTES_FOR_RELAY: usize = 1024;
57 /// Maximum number of short_channel_ids that will be encoded in one gossip reply message.
58 /// This value ensures a reply fits within the 65k payload limit and is consistent with other implementations.
59 const MAX_SCIDS_PER_REPLY: usize = 8000;
61 /// Represents the compressed public key of a node
62 #[derive(Clone, Copy)]
63 pub struct NodeId([u8; PUBLIC_KEY_SIZE]);
66 /// Create a new NodeId from a public key
67 pub fn from_pubkey(pubkey: &PublicKey) -> Self {
68 NodeId(pubkey.serialize())
71 /// Get the public key slice from this NodeId
72 pub fn as_slice(&self) -> &[u8] {
77 impl fmt::Debug for NodeId {
78 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
79 write!(f, "NodeId({})", log_bytes!(self.0))
83 impl core::hash::Hash for NodeId {
84 fn hash<H: core::hash::Hasher>(&self, hasher: &mut H) {
91 impl PartialEq for NodeId {
92 fn eq(&self, other: &Self) -> bool {
93 self.0[..] == other.0[..]
97 impl cmp::PartialOrd for NodeId {
98 fn partial_cmp(&self, other: &Self) -> Option<cmp::Ordering> {
103 impl Ord for NodeId {
104 fn cmp(&self, other: &Self) -> cmp::Ordering {
105 self.0[..].cmp(&other.0[..])
109 impl Writeable for NodeId {
110 fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
111 writer.write_all(&self.0)?;
116 impl Readable for NodeId {
117 fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
118 let mut buf = [0; PUBLIC_KEY_SIZE];
119 reader.read_exact(&mut buf)?;
124 /// Represents the network as nodes and channels between them
125 pub struct NetworkGraph<L: Deref> where L::Target: Logger {
126 secp_ctx: Secp256k1<secp256k1::VerifyOnly>,
127 last_rapid_gossip_sync_timestamp: Mutex<Option<u32>>,
128 genesis_hash: BlockHash,
130 // Lock order: channels -> nodes
131 channels: RwLock<BTreeMap<u64, ChannelInfo>>,
132 nodes: RwLock<BTreeMap<NodeId, NodeInfo>>,
135 /// A read-only view of [`NetworkGraph`].
136 pub struct ReadOnlyNetworkGraph<'a> {
137 channels: RwLockReadGuard<'a, BTreeMap<u64, ChannelInfo>>,
138 nodes: RwLockReadGuard<'a, BTreeMap<NodeId, NodeInfo>>,
141 /// Update to the [`NetworkGraph`] based on payment failure information conveyed via the Onion
142 /// return packet by a node along the route. See [BOLT #4] for details.
144 /// [BOLT #4]: https://github.com/lightning/bolts/blob/master/04-onion-routing.md
145 #[derive(Clone, Debug, PartialEq)]
146 pub enum NetworkUpdate {
147 /// An error indicating a `channel_update` messages should be applied via
148 /// [`NetworkGraph::update_channel`].
149 ChannelUpdateMessage {
150 /// The update to apply via [`NetworkGraph::update_channel`].
153 /// An error indicating that a channel failed to route a payment, which should be applied via
154 /// [`NetworkGraph::channel_failed`].
156 /// The short channel id of the closed channel.
157 short_channel_id: u64,
158 /// Whether the channel should be permanently removed or temporarily disabled until a new
159 /// `channel_update` message is received.
162 /// An error indicating that a node failed to route a payment, which should be applied via
163 /// [`NetworkGraph::node_failed`].
165 /// The node id of the failed node.
167 /// Whether the node should be permanently removed from consideration or can be restored
168 /// when a new `channel_update` message is received.
173 impl_writeable_tlv_based_enum_upgradable!(NetworkUpdate,
174 (0, ChannelUpdateMessage) => {
177 (2, ChannelFailure) => {
178 (0, short_channel_id, required),
179 (2, is_permanent, required),
181 (4, NodeFailure) => {
182 (0, node_id, required),
183 (2, is_permanent, required),
187 /// Receives and validates network updates from peers,
188 /// stores authentic and relevant data as a network graph.
189 /// This network graph is then used for routing payments.
190 /// Provides interface to help with initial routing sync by
191 /// serving historical announcements.
193 /// Serves as an [`EventHandler`] for applying updates from [`Event::PaymentPathFailed`] to the
194 /// [`NetworkGraph`].
195 pub struct P2PGossipSync<G: Deref<Target=NetworkGraph<L>>, C: Deref, L: Deref>
196 where C::Target: chain::Access, L::Target: Logger
199 chain_access: Option<C>,
200 full_syncs_requested: AtomicUsize,
201 pending_events: Mutex<Vec<MessageSendEvent>>,
205 impl<G: Deref<Target=NetworkGraph<L>>, C: Deref, L: Deref> P2PGossipSync<G, C, L>
206 where C::Target: chain::Access, L::Target: Logger
208 /// Creates a new tracker of the actual state of the network of channels and nodes,
209 /// assuming an existing Network Graph.
210 /// Chain monitor is used to make sure announced channels exist on-chain,
211 /// channel data is correct, and that the announcement is signed with
212 /// channel owners' keys.
213 pub fn new(network_graph: G, chain_access: Option<C>, logger: L) -> Self {
216 full_syncs_requested: AtomicUsize::new(0),
218 pending_events: Mutex::new(vec![]),
223 /// Adds a provider used to check new announcements. Does not affect
224 /// existing announcements unless they are updated.
225 /// Add, update or remove the provider would replace the current one.
226 pub fn add_chain_access(&mut self, chain_access: Option<C>) {
227 self.chain_access = chain_access;
230 /// Gets a reference to the underlying [`NetworkGraph`] which was provided in
231 /// [`P2PGossipSync::new`].
233 /// (C-not exported) as bindings don't support a reference-to-a-reference yet
234 pub fn network_graph(&self) -> &G {
238 /// Returns true when a full routing table sync should be performed with a peer.
239 fn should_request_full_sync(&self, _node_id: &PublicKey) -> bool {
240 //TODO: Determine whether to request a full sync based on the network map.
241 const FULL_SYNCS_TO_REQUEST: usize = 5;
242 if self.full_syncs_requested.load(Ordering::Acquire) < FULL_SYNCS_TO_REQUEST {
243 self.full_syncs_requested.fetch_add(1, Ordering::AcqRel);
251 impl<L: Deref> EventHandler for NetworkGraph<L> where L::Target: Logger {
252 fn handle_event(&self, event: &Event) {
253 if let Event::PaymentPathFailed { network_update, .. } = event {
254 if let Some(network_update) = network_update {
255 match *network_update {
256 NetworkUpdate::ChannelUpdateMessage { ref msg } => {
257 let short_channel_id = msg.contents.short_channel_id;
258 let is_enabled = msg.contents.flags & (1 << 1) != (1 << 1);
259 let status = if is_enabled { "enabled" } else { "disabled" };
260 log_debug!(self.logger, "Updating channel with channel_update from a payment failure. Channel {} is {}.", short_channel_id, status);
261 let _ = self.update_channel(msg);
263 NetworkUpdate::ChannelFailure { short_channel_id, is_permanent } => {
264 let action = if is_permanent { "Removing" } else { "Disabling" };
265 log_debug!(self.logger, "{} channel graph entry for {} due to a payment failure.", action, short_channel_id);
266 self.channel_failed(short_channel_id, is_permanent);
268 NetworkUpdate::NodeFailure { ref node_id, is_permanent } => {
269 let action = if is_permanent { "Removing" } else { "Disabling" };
270 log_debug!(self.logger, "{} node graph entry for {} due to a payment failure.", action, node_id);
271 self.node_failed(node_id, is_permanent);
279 macro_rules! secp_verify_sig {
280 ( $secp_ctx: expr, $msg: expr, $sig: expr, $pubkey: expr, $msg_type: expr ) => {
281 match $secp_ctx.verify_ecdsa($msg, $sig, $pubkey) {
284 return Err(LightningError {
285 err: format!("Invalid signature on {} message", $msg_type),
286 action: ErrorAction::SendWarningMessage {
287 msg: msgs::WarningMessage {
289 data: format!("Invalid signature on {} message", $msg_type),
291 log_level: Level::Trace,
299 impl<G: Deref<Target=NetworkGraph<L>>, C: Deref, L: Deref> RoutingMessageHandler for P2PGossipSync<G, C, L>
300 where C::Target: chain::Access, L::Target: Logger
302 fn handle_node_announcement(&self, msg: &msgs::NodeAnnouncement) -> Result<bool, LightningError> {
303 self.network_graph.update_node_from_announcement(msg)?;
304 Ok(msg.contents.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
305 msg.contents.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
306 msg.contents.excess_data.len() + msg.contents.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
309 fn handle_channel_announcement(&self, msg: &msgs::ChannelAnnouncement) -> Result<bool, LightningError> {
310 self.network_graph.update_channel_from_announcement(msg, &self.chain_access)?;
311 log_gossip!(self.logger, "Added channel_announcement for {}{}", msg.contents.short_channel_id, if !msg.contents.excess_data.is_empty() { " with excess uninterpreted data!" } else { "" });
312 Ok(msg.contents.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
315 fn handle_channel_update(&self, msg: &msgs::ChannelUpdate) -> Result<bool, LightningError> {
316 self.network_graph.update_channel(msg)?;
317 Ok(msg.contents.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY)
320 fn get_next_channel_announcements(&self, starting_point: u64, batch_amount: u8) -> Vec<(ChannelAnnouncement, Option<ChannelUpdate>, Option<ChannelUpdate>)> {
321 let mut result = Vec::with_capacity(batch_amount as usize);
322 let channels = self.network_graph.channels.read().unwrap();
323 let mut iter = channels.range(starting_point..);
324 while result.len() < batch_amount as usize {
325 if let Some((_, ref chan)) = iter.next() {
326 if chan.announcement_message.is_some() {
327 let chan_announcement = chan.announcement_message.clone().unwrap();
328 let mut one_to_two_announcement: Option<msgs::ChannelUpdate> = None;
329 let mut two_to_one_announcement: Option<msgs::ChannelUpdate> = None;
330 if let Some(one_to_two) = chan.one_to_two.as_ref() {
331 one_to_two_announcement = one_to_two.last_update_message.clone();
333 if let Some(two_to_one) = chan.two_to_one.as_ref() {
334 two_to_one_announcement = two_to_one.last_update_message.clone();
336 result.push((chan_announcement, one_to_two_announcement, two_to_one_announcement));
338 // TODO: We may end up sending un-announced channel_updates if we are sending
339 // initial sync data while receiving announce/updates for this channel.
348 fn get_next_node_announcements(&self, starting_point: Option<&PublicKey>, batch_amount: u8) -> Vec<NodeAnnouncement> {
349 let mut result = Vec::with_capacity(batch_amount as usize);
350 let nodes = self.network_graph.nodes.read().unwrap();
351 let mut iter = if let Some(pubkey) = starting_point {
352 let mut iter = nodes.range(NodeId::from_pubkey(pubkey)..);
356 nodes.range::<NodeId, _>(..)
358 while result.len() < batch_amount as usize {
359 if let Some((_, ref node)) = iter.next() {
360 if let Some(node_info) = node.announcement_info.as_ref() {
361 if node_info.announcement_message.is_some() {
362 result.push(node_info.announcement_message.clone().unwrap());
372 /// Initiates a stateless sync of routing gossip information with a peer
373 /// using gossip_queries. The default strategy used by this implementation
374 /// is to sync the full block range with several peers.
376 /// We should expect one or more reply_channel_range messages in response
377 /// to our query_channel_range. Each reply will enqueue a query_scid message
378 /// to request gossip messages for each channel. The sync is considered complete
379 /// when the final reply_scids_end message is received, though we are not
380 /// tracking this directly.
381 fn peer_connected(&self, their_node_id: &PublicKey, init_msg: &Init) {
382 // We will only perform a sync with peers that support gossip_queries.
383 if !init_msg.features.supports_gossip_queries() {
387 // The lightning network's gossip sync system is completely broken in numerous ways.
389 // Given no broadly-available set-reconciliation protocol, the only reasonable approach is
390 // to do a full sync from the first few peers we connect to, and then receive gossip
391 // updates from all our peers normally.
393 // Originally, we could simply tell a peer to dump us the entire gossip table on startup,
394 // wasting lots of bandwidth but ensuring we have the full network graph. After the initial
395 // dump peers would always send gossip and we'd stay up-to-date with whatever our peer has
398 // In order to reduce the bandwidth waste, "gossip queries" were introduced, allowing you
399 // to ask for the SCIDs of all channels in your peer's routing graph, and then only request
400 // channel data which you are missing. Except there was no way at all to identify which
401 // `channel_update`s you were missing, so you still had to request everything, just in a
402 // very complicated way with some queries instead of just getting the dump.
404 // Later, an option was added to fetch the latest timestamps of the `channel_update`s to
405 // make efficient sync possible, however it has yet to be implemented in lnd, which makes
406 // relying on it useless.
408 // After gossip queries were introduced, support for receiving a full gossip table dump on
409 // connection was removed from several nodes, making it impossible to get a full sync
410 // without using the "gossip queries" messages.
412 // Once you opt into "gossip queries" the only way to receive any gossip updates that a
413 // peer receives after you connect, you must send a `gossip_timestamp_filter` message. This
414 // message, as the name implies, tells the peer to not forward any gossip messages with a
415 // timestamp older than a given value (not the time the peer received the filter, but the
416 // timestamp in the update message, which is often hours behind when the peer received the
419 // Obnoxiously, `gossip_timestamp_filter` isn't *just* a filter, but its also a request for
420 // your peer to send you the full routing graph (subject to the filter). Thus, in order to
421 // tell a peer to send you any updates as it sees them, you have to also ask for the full
422 // routing graph to be synced. If you set a timestamp filter near the current time, peers
423 // will simply not forward any new updates they see to you which were generated some time
424 // ago (which is not uncommon). If you instead set a timestamp filter near 0 (or two weeks
425 // ago), you will always get the full routing graph from all your peers.
427 // Most lightning nodes today opt to simply turn off receiving gossip data which only
428 // propagated some time after it was generated, and, worse, often disable gossiping with
429 // several peers after their first connection. The second behavior can cause gossip to not
430 // propagate fully if there are cuts in the gossiping subgraph.
432 // In an attempt to cut a middle ground between always fetching the full graph from all of
433 // our peers and never receiving gossip from peers at all, we send all of our peers a
434 // `gossip_timestamp_filter`, with the filter time set either two weeks ago or an hour ago.
436 // For no-std builds, we bury our head in the sand and do a full sync on each connection.
437 let should_request_full_sync = self.should_request_full_sync(&their_node_id);
438 #[allow(unused_mut, unused_assignments)]
439 let mut gossip_start_time = 0;
440 #[cfg(feature = "std")]
442 gossip_start_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
443 if should_request_full_sync {
444 gossip_start_time -= 60 * 60 * 24 * 7 * 2; // 2 weeks ago
446 gossip_start_time -= 60 * 60; // an hour ago
450 let mut pending_events = self.pending_events.lock().unwrap();
451 pending_events.push(MessageSendEvent::SendGossipTimestampFilter {
452 node_id: their_node_id.clone(),
453 msg: GossipTimestampFilter {
454 chain_hash: self.network_graph.genesis_hash,
455 first_timestamp: gossip_start_time as u32, // 2106 issue!
456 timestamp_range: u32::max_value(),
461 fn handle_reply_channel_range(&self, _their_node_id: &PublicKey, _msg: ReplyChannelRange) -> Result<(), LightningError> {
462 // We don't make queries, so should never receive replies. If, in the future, the set
463 // reconciliation extensions to gossip queries become broadly supported, we should revert
464 // this code to its state pre-0.0.106.
468 fn handle_reply_short_channel_ids_end(&self, _their_node_id: &PublicKey, _msg: ReplyShortChannelIdsEnd) -> Result<(), LightningError> {
469 // We don't make queries, so should never receive replies. If, in the future, the set
470 // reconciliation extensions to gossip queries become broadly supported, we should revert
471 // this code to its state pre-0.0.106.
475 /// Processes a query from a peer by finding announced/public channels whose funding UTXOs
476 /// are in the specified block range. Due to message size limits, large range
477 /// queries may result in several reply messages. This implementation enqueues
478 /// all reply messages into pending events. Each message will allocate just under 65KiB. A full
479 /// sync of the public routing table with 128k channels will generated 16 messages and allocate ~1MB.
480 /// Logic can be changed to reduce allocation if/when a full sync of the routing table impacts
481 /// memory constrained systems.
482 fn handle_query_channel_range(&self, their_node_id: &PublicKey, msg: QueryChannelRange) -> Result<(), LightningError> {
483 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);
485 let inclusive_start_scid = scid_from_parts(msg.first_blocknum as u64, 0, 0);
487 // We might receive valid queries with end_blocknum that would overflow SCID conversion.
488 // If so, we manually cap the ending block to avoid this overflow.
489 let exclusive_end_scid = scid_from_parts(cmp::min(msg.end_blocknum() as u64, MAX_SCID_BLOCK), 0, 0);
491 // Per spec, we must reply to a query. Send an empty message when things are invalid.
492 if msg.chain_hash != self.network_graph.genesis_hash || inclusive_start_scid.is_err() || exclusive_end_scid.is_err() || msg.number_of_blocks == 0 {
493 let mut pending_events = self.pending_events.lock().unwrap();
494 pending_events.push(MessageSendEvent::SendReplyChannelRange {
495 node_id: their_node_id.clone(),
496 msg: ReplyChannelRange {
497 chain_hash: msg.chain_hash.clone(),
498 first_blocknum: msg.first_blocknum,
499 number_of_blocks: msg.number_of_blocks,
501 short_channel_ids: vec![],
504 return Err(LightningError {
505 err: String::from("query_channel_range could not be processed"),
506 action: ErrorAction::IgnoreError,
510 // Creates channel batches. We are not checking if the channel is routable
511 // (has at least one update). A peer may still want to know the channel
512 // exists even if its not yet routable.
513 let mut batches: Vec<Vec<u64>> = vec![Vec::with_capacity(MAX_SCIDS_PER_REPLY)];
514 let channels = self.network_graph.channels.read().unwrap();
515 for (_, ref chan) in channels.range(inclusive_start_scid.unwrap()..exclusive_end_scid.unwrap()) {
516 if let Some(chan_announcement) = &chan.announcement_message {
517 // Construct a new batch if last one is full
518 if batches.last().unwrap().len() == batches.last().unwrap().capacity() {
519 batches.push(Vec::with_capacity(MAX_SCIDS_PER_REPLY));
522 let batch = batches.last_mut().unwrap();
523 batch.push(chan_announcement.contents.short_channel_id);
528 let mut pending_events = self.pending_events.lock().unwrap();
529 let batch_count = batches.len();
530 let mut prev_batch_endblock = msg.first_blocknum;
531 for (batch_index, batch) in batches.into_iter().enumerate() {
532 // Per spec, the initial `first_blocknum` needs to be <= the query's `first_blocknum`
533 // and subsequent `first_blocknum`s must be >= the prior reply's `first_blocknum`.
535 // Additionally, c-lightning versions < 0.10 require that the `first_blocknum` of each
536 // reply is >= the previous reply's `first_blocknum` and either exactly the previous
537 // reply's `first_blocknum + number_of_blocks` or exactly one greater. This is a
538 // significant diversion from the requirements set by the spec, and, in case of blocks
539 // with no channel opens (e.g. empty blocks), requires that we use the previous value
540 // and *not* derive the first_blocknum from the actual first block of the reply.
541 let first_blocknum = prev_batch_endblock;
543 // Each message carries the number of blocks (from the `first_blocknum`) its contents
544 // fit in. Though there is no requirement that we use exactly the number of blocks its
545 // contents are from, except for the bogus requirements c-lightning enforces, above.
547 // Per spec, the last end block (ie `first_blocknum + number_of_blocks`) needs to be
548 // >= the query's end block. Thus, for the last reply, we calculate the difference
549 // between the query's end block and the start of the reply.
551 // Overflow safe since end_blocknum=msg.first_block_num+msg.number_of_blocks and
552 // first_blocknum will be either msg.first_blocknum or a higher block height.
553 let (sync_complete, number_of_blocks) = if batch_index == batch_count-1 {
554 (true, msg.end_blocknum() - first_blocknum)
556 // Prior replies should use the number of blocks that fit into the reply. Overflow
557 // safe since first_blocknum is always <= last SCID's block.
559 (false, block_from_scid(batch.last().unwrap()) - first_blocknum)
562 prev_batch_endblock = first_blocknum + number_of_blocks;
564 pending_events.push(MessageSendEvent::SendReplyChannelRange {
565 node_id: their_node_id.clone(),
566 msg: ReplyChannelRange {
567 chain_hash: msg.chain_hash.clone(),
571 short_channel_ids: batch,
579 fn handle_query_short_channel_ids(&self, _their_node_id: &PublicKey, _msg: QueryShortChannelIds) -> Result<(), LightningError> {
582 err: String::from("Not implemented"),
583 action: ErrorAction::IgnoreError,
588 impl<G: Deref<Target=NetworkGraph<L>>, C: Deref, L: Deref> MessageSendEventsProvider for P2PGossipSync<G, C, L>
590 C::Target: chain::Access,
593 fn get_and_clear_pending_msg_events(&self) -> Vec<MessageSendEvent> {
594 let mut ret = Vec::new();
595 let mut pending_events = self.pending_events.lock().unwrap();
596 core::mem::swap(&mut ret, &mut pending_events);
601 #[derive(Clone, Debug, PartialEq)]
602 /// Details about one direction of a channel as received within a [`ChannelUpdate`].
603 pub struct ChannelUpdateInfo {
604 /// When the last update to the channel direction was issued.
605 /// Value is opaque, as set in the announcement.
606 pub last_update: u32,
607 /// Whether the channel can be currently used for payments (in this one direction).
609 /// The difference in CLTV values that you must have when routing through this channel.
610 pub cltv_expiry_delta: u16,
611 /// The minimum value, which must be relayed to the next hop via the channel
612 pub htlc_minimum_msat: u64,
613 /// The maximum value which may be relayed to the next hop via the channel.
614 pub htlc_maximum_msat: Option<u64>,
615 /// Fees charged when the channel is used for routing
616 pub fees: RoutingFees,
617 /// Most recent update for the channel received from the network
618 /// Mostly redundant with the data we store in fields explicitly.
619 /// Everything else is useful only for sending out for initial routing sync.
620 /// Not stored if contains excess data to prevent DoS.
621 pub last_update_message: Option<ChannelUpdate>,
624 impl fmt::Display for ChannelUpdateInfo {
625 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
626 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)?;
631 impl_writeable_tlv_based!(ChannelUpdateInfo, {
632 (0, last_update, required),
633 (2, enabled, required),
634 (4, cltv_expiry_delta, required),
635 (6, htlc_minimum_msat, required),
636 (8, htlc_maximum_msat, required),
637 (10, fees, required),
638 (12, last_update_message, required),
641 #[derive(Clone, Debug, PartialEq)]
642 /// Details about a channel (both directions).
643 /// Received within a channel announcement.
644 pub struct ChannelInfo {
645 /// Protocol features of a channel communicated during its announcement
646 pub features: ChannelFeatures,
647 /// Source node of the first direction of a channel
648 pub node_one: NodeId,
649 /// Details about the first direction of a channel
650 pub one_to_two: Option<ChannelUpdateInfo>,
651 /// Source node of the second direction of a channel
652 pub node_two: NodeId,
653 /// Details about the second direction of a channel
654 pub two_to_one: Option<ChannelUpdateInfo>,
655 /// The channel capacity as seen on-chain, if chain lookup is available.
656 pub capacity_sats: Option<u64>,
657 /// An initial announcement of the channel
658 /// Mostly redundant with the data we store in fields explicitly.
659 /// Everything else is useful only for sending out for initial routing sync.
660 /// Not stored if contains excess data to prevent DoS.
661 pub announcement_message: Option<ChannelAnnouncement>,
662 /// The timestamp when we received the announcement, if we are running with feature = "std"
663 /// (which we can probably assume we are - no-std environments probably won't have a full
664 /// network graph in memory!).
665 announcement_received_time: u64,
669 /// Returns a [`DirectedChannelInfo`] for the channel directed to the given `target` from a
670 /// returned `source`, or `None` if `target` is not one of the channel's counterparties.
671 pub fn as_directed_to(&self, target: &NodeId) -> Option<(DirectedChannelInfo, &NodeId)> {
672 let (direction, source) = {
673 if target == &self.node_one {
674 (self.two_to_one.as_ref(), &self.node_two)
675 } else if target == &self.node_two {
676 (self.one_to_two.as_ref(), &self.node_one)
681 Some((DirectedChannelInfo::new(self, direction), source))
684 /// Returns a [`DirectedChannelInfo`] for the channel directed from the given `source` to a
685 /// returned `target`, or `None` if `source` is not one of the channel's counterparties.
686 pub fn as_directed_from(&self, source: &NodeId) -> Option<(DirectedChannelInfo, &NodeId)> {
687 let (direction, target) = {
688 if source == &self.node_one {
689 (self.one_to_two.as_ref(), &self.node_two)
690 } else if source == &self.node_two {
691 (self.two_to_one.as_ref(), &self.node_one)
696 Some((DirectedChannelInfo::new(self, direction), target))
699 /// Returns a [`ChannelUpdateInfo`] based on the direction implied by the channel_flag.
700 pub fn get_directional_info(&self, channel_flags: u8) -> Option<&ChannelUpdateInfo> {
701 let direction = channel_flags & 1u8;
703 self.one_to_two.as_ref()
705 self.two_to_one.as_ref()
710 impl fmt::Display for ChannelInfo {
711 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
712 write!(f, "features: {}, node_one: {}, one_to_two: {:?}, node_two: {}, two_to_one: {:?}",
713 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)?;
718 impl_writeable_tlv_based!(ChannelInfo, {
719 (0, features, required),
720 (1, announcement_received_time, (default_value, 0)),
721 (2, node_one, required),
722 (4, one_to_two, required),
723 (6, node_two, required),
724 (8, two_to_one, required),
725 (10, capacity_sats, required),
726 (12, announcement_message, required),
729 /// A wrapper around [`ChannelInfo`] representing information about the channel as directed from a
730 /// source node to a target node.
732 pub struct DirectedChannelInfo<'a> {
733 channel: &'a ChannelInfo,
734 direction: Option<&'a ChannelUpdateInfo>,
735 htlc_maximum_msat: u64,
736 effective_capacity: EffectiveCapacity,
739 impl<'a> DirectedChannelInfo<'a> {
741 fn new(channel: &'a ChannelInfo, direction: Option<&'a ChannelUpdateInfo>) -> Self {
742 let htlc_maximum_msat = direction.and_then(|direction| direction.htlc_maximum_msat);
743 let capacity_msat = channel.capacity_sats.map(|capacity_sats| capacity_sats * 1000);
745 let (htlc_maximum_msat, effective_capacity) = match (htlc_maximum_msat, capacity_msat) {
746 (Some(amount_msat), Some(capacity_msat)) => {
747 let htlc_maximum_msat = cmp::min(amount_msat, capacity_msat);
748 (htlc_maximum_msat, EffectiveCapacity::Total { capacity_msat, htlc_maximum_msat: Some(htlc_maximum_msat) })
750 (Some(amount_msat), None) => {
751 (amount_msat, EffectiveCapacity::MaximumHTLC { amount_msat })
753 (None, Some(capacity_msat)) => {
754 (capacity_msat, EffectiveCapacity::Total { capacity_msat, htlc_maximum_msat: None })
756 (None, None) => (EffectiveCapacity::Unknown.as_msat(), EffectiveCapacity::Unknown),
760 channel, direction, htlc_maximum_msat, effective_capacity
764 /// Returns information for the channel.
765 pub fn channel(&self) -> &'a ChannelInfo { self.channel }
767 /// Returns information for the direction.
768 pub fn direction(&self) -> Option<&'a ChannelUpdateInfo> { self.direction }
770 /// Returns the maximum HTLC amount allowed over the channel in the direction.
771 pub fn htlc_maximum_msat(&self) -> u64 {
772 self.htlc_maximum_msat
775 /// Returns the [`EffectiveCapacity`] of the channel in the direction.
777 /// This is either the total capacity from the funding transaction, if known, or the
778 /// `htlc_maximum_msat` for the direction as advertised by the gossip network, if known,
780 pub fn effective_capacity(&self) -> EffectiveCapacity {
781 self.effective_capacity
784 /// Returns `Some` if [`ChannelUpdateInfo`] is available in the direction.
785 pub(super) fn with_update(self) -> Option<DirectedChannelInfoWithUpdate<'a>> {
786 match self.direction {
787 Some(_) => Some(DirectedChannelInfoWithUpdate { inner: self }),
793 impl<'a> fmt::Debug for DirectedChannelInfo<'a> {
794 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
795 f.debug_struct("DirectedChannelInfo")
796 .field("channel", &self.channel)
801 /// A [`DirectedChannelInfo`] with [`ChannelUpdateInfo`] available in its direction.
803 pub(super) struct DirectedChannelInfoWithUpdate<'a> {
804 inner: DirectedChannelInfo<'a>,
807 impl<'a> DirectedChannelInfoWithUpdate<'a> {
808 /// Returns information for the channel.
810 pub(super) fn channel(&self) -> &'a ChannelInfo { &self.inner.channel }
812 /// Returns information for the direction.
814 pub(super) fn direction(&self) -> &'a ChannelUpdateInfo { self.inner.direction.unwrap() }
816 /// Returns the [`EffectiveCapacity`] of the channel in the direction.
818 pub(super) fn effective_capacity(&self) -> EffectiveCapacity { self.inner.effective_capacity() }
820 /// Returns the maximum HTLC amount allowed over the channel in the direction.
822 pub(super) fn htlc_maximum_msat(&self) -> u64 { self.inner.htlc_maximum_msat() }
825 impl<'a> fmt::Debug for DirectedChannelInfoWithUpdate<'a> {
826 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
831 /// The effective capacity of a channel for routing purposes.
833 /// While this may be smaller than the actual channel capacity, amounts greater than
834 /// [`Self::as_msat`] should not be routed through the channel.
835 #[derive(Clone, Copy)]
836 pub enum EffectiveCapacity {
837 /// The available liquidity in the channel known from being a channel counterparty, and thus a
840 /// Either the inbound or outbound liquidity depending on the direction, denominated in
844 /// The maximum HTLC amount in one direction as advertised on the gossip network.
846 /// The maximum HTLC amount denominated in millisatoshi.
849 /// The total capacity of the channel as determined by the funding transaction.
851 /// The funding amount denominated in millisatoshi.
853 /// The maximum HTLC amount denominated in millisatoshi.
854 htlc_maximum_msat: Option<u64>
856 /// A capacity sufficient to route any payment, typically used for private channels provided by
859 /// A capacity that is unknown possibly because either the chain state is unavailable to know
860 /// the total capacity or the `htlc_maximum_msat` was not advertised on the gossip network.
864 /// The presumed channel capacity denominated in millisatoshi for [`EffectiveCapacity::Unknown`] to
865 /// use when making routing decisions.
866 pub const UNKNOWN_CHANNEL_CAPACITY_MSAT: u64 = 250_000 * 1000;
868 impl EffectiveCapacity {
869 /// Returns the effective capacity denominated in millisatoshi.
870 pub fn as_msat(&self) -> u64 {
872 EffectiveCapacity::ExactLiquidity { liquidity_msat } => *liquidity_msat,
873 EffectiveCapacity::MaximumHTLC { amount_msat } => *amount_msat,
874 EffectiveCapacity::Total { capacity_msat, .. } => *capacity_msat,
875 EffectiveCapacity::Infinite => u64::max_value(),
876 EffectiveCapacity::Unknown => UNKNOWN_CHANNEL_CAPACITY_MSAT,
881 /// Fees for routing via a given channel or a node
882 #[derive(Eq, PartialEq, Copy, Clone, Debug, Hash)]
883 pub struct RoutingFees {
884 /// Flat routing fee in satoshis
886 /// Liquidity-based routing fee in millionths of a routed amount.
887 /// In other words, 10000 is 1%.
888 pub proportional_millionths: u32,
891 impl_writeable_tlv_based!(RoutingFees, {
892 (0, base_msat, required),
893 (2, proportional_millionths, required)
896 #[derive(Clone, Debug, PartialEq)]
897 /// Information received in the latest node_announcement from this node.
898 pub struct NodeAnnouncementInfo {
899 /// Protocol features the node announced support for
900 pub features: NodeFeatures,
901 /// When the last known update to the node state was issued.
902 /// Value is opaque, as set in the announcement.
903 pub last_update: u32,
904 /// Color assigned to the node
906 /// Moniker assigned to the node.
907 /// May be invalid or malicious (eg control chars),
908 /// should not be exposed to the user.
909 pub alias: NodeAlias,
910 /// Internet-level addresses via which one can connect to the node
911 pub addresses: Vec<NetAddress>,
912 /// An initial announcement of the node
913 /// Mostly redundant with the data we store in fields explicitly.
914 /// Everything else is useful only for sending out for initial routing sync.
915 /// Not stored if contains excess data to prevent DoS.
916 pub announcement_message: Option<NodeAnnouncement>
919 impl_writeable_tlv_based!(NodeAnnouncementInfo, {
920 (0, features, required),
921 (2, last_update, required),
923 (6, alias, required),
924 (8, announcement_message, option),
925 (10, addresses, vec_type),
928 /// A user-defined name for a node, which may be used when displaying the node in a graph.
930 /// Since node aliases are provided by third parties, they are a potential avenue for injection
931 /// attacks. Care must be taken when processing.
932 #[derive(Clone, Debug, PartialEq)]
933 pub struct NodeAlias(pub [u8; 32]);
935 impl fmt::Display for NodeAlias {
936 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
937 let control_symbol = core::char::REPLACEMENT_CHARACTER;
938 let first_null = self.0.iter().position(|b| *b == 0).unwrap_or(self.0.len());
939 let bytes = self.0.split_at(first_null).0;
940 match core::str::from_utf8(bytes) {
942 for c in alias.chars() {
943 let mut bytes = [0u8; 4];
944 let c = if !c.is_control() { c } else { control_symbol };
945 f.write_str(c.encode_utf8(&mut bytes))?;
949 for c in bytes.iter().map(|b| *b as char) {
950 // Display printable ASCII characters
951 let mut bytes = [0u8; 4];
952 let c = if c >= '\x20' && c <= '\x7e' { c } else { control_symbol };
953 f.write_str(c.encode_utf8(&mut bytes))?;
961 impl Writeable for NodeAlias {
962 fn write<W: Writer>(&self, w: &mut W) -> Result<(), io::Error> {
967 impl Readable for NodeAlias {
968 fn read<R: io::Read>(r: &mut R) -> Result<Self, DecodeError> {
969 Ok(NodeAlias(Readable::read(r)?))
973 #[derive(Clone, Debug, PartialEq)]
974 /// Details about a node in the network, known from the network announcement.
975 pub struct NodeInfo {
976 /// All valid channels a node has announced
977 pub channels: Vec<u64>,
978 /// Lowest fees enabling routing via any of the enabled, known channels to a node.
979 /// The two fields (flat and proportional fee) are independent,
980 /// meaning they don't have to refer to the same channel.
981 pub lowest_inbound_channel_fees: Option<RoutingFees>,
982 /// More information about a node from node_announcement.
983 /// Optional because we store a Node entry after learning about it from
984 /// a channel announcement, but before receiving a node announcement.
985 pub announcement_info: Option<NodeAnnouncementInfo>
988 impl fmt::Display for NodeInfo {
989 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
990 write!(f, "lowest_inbound_channel_fees: {:?}, channels: {:?}, announcement_info: {:?}",
991 self.lowest_inbound_channel_fees, &self.channels[..], self.announcement_info)?;
996 impl_writeable_tlv_based!(NodeInfo, {
997 (0, lowest_inbound_channel_fees, option),
998 (2, announcement_info, option),
999 (4, channels, vec_type),
1002 const SERIALIZATION_VERSION: u8 = 1;
1003 const MIN_SERIALIZATION_VERSION: u8 = 1;
1005 impl<L: Deref> Writeable for NetworkGraph<L> where L::Target: Logger {
1006 fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
1007 write_ver_prefix!(writer, SERIALIZATION_VERSION, MIN_SERIALIZATION_VERSION);
1009 self.genesis_hash.write(writer)?;
1010 let channels = self.channels.read().unwrap();
1011 (channels.len() as u64).write(writer)?;
1012 for (ref chan_id, ref chan_info) in channels.iter() {
1013 (*chan_id).write(writer)?;
1014 chan_info.write(writer)?;
1016 let nodes = self.nodes.read().unwrap();
1017 (nodes.len() as u64).write(writer)?;
1018 for (ref node_id, ref node_info) in nodes.iter() {
1019 node_id.write(writer)?;
1020 node_info.write(writer)?;
1023 let last_rapid_gossip_sync_timestamp = self.get_last_rapid_gossip_sync_timestamp();
1024 write_tlv_fields!(writer, {
1025 (1, last_rapid_gossip_sync_timestamp, option),
1031 impl<L: Deref> ReadableArgs<L> for NetworkGraph<L> where L::Target: Logger {
1032 fn read<R: io::Read>(reader: &mut R, logger: L) -> Result<NetworkGraph<L>, DecodeError> {
1033 let _ver = read_ver_prefix!(reader, SERIALIZATION_VERSION);
1035 let genesis_hash: BlockHash = Readable::read(reader)?;
1036 let channels_count: u64 = Readable::read(reader)?;
1037 let mut channels = BTreeMap::new();
1038 for _ in 0..channels_count {
1039 let chan_id: u64 = Readable::read(reader)?;
1040 let chan_info = Readable::read(reader)?;
1041 channels.insert(chan_id, chan_info);
1043 let nodes_count: u64 = Readable::read(reader)?;
1044 let mut nodes = BTreeMap::new();
1045 for _ in 0..nodes_count {
1046 let node_id = Readable::read(reader)?;
1047 let node_info = Readable::read(reader)?;
1048 nodes.insert(node_id, node_info);
1051 let mut last_rapid_gossip_sync_timestamp: Option<u32> = None;
1052 read_tlv_fields!(reader, {
1053 (1, last_rapid_gossip_sync_timestamp, option),
1057 secp_ctx: Secp256k1::verification_only(),
1060 channels: RwLock::new(channels),
1061 nodes: RwLock::new(nodes),
1062 last_rapid_gossip_sync_timestamp: Mutex::new(last_rapid_gossip_sync_timestamp),
1067 impl<L: Deref> fmt::Display for NetworkGraph<L> where L::Target: Logger {
1068 fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
1069 writeln!(f, "Network map\n[Channels]")?;
1070 for (key, val) in self.channels.read().unwrap().iter() {
1071 writeln!(f, " {}: {}", key, val)?;
1073 writeln!(f, "[Nodes]")?;
1074 for (&node_id, val) in self.nodes.read().unwrap().iter() {
1075 writeln!(f, " {}: {}", log_bytes!(node_id.as_slice()), val)?;
1081 impl<L: Deref> PartialEq for NetworkGraph<L> where L::Target: Logger {
1082 fn eq(&self, other: &Self) -> bool {
1083 self.genesis_hash == other.genesis_hash &&
1084 *self.channels.read().unwrap() == *other.channels.read().unwrap() &&
1085 *self.nodes.read().unwrap() == *other.nodes.read().unwrap()
1089 impl<L: Deref> NetworkGraph<L> where L::Target: Logger {
1090 /// Creates a new, empty, network graph.
1091 pub fn new(genesis_hash: BlockHash, logger: L) -> NetworkGraph<L> {
1093 secp_ctx: Secp256k1::verification_only(),
1096 channels: RwLock::new(BTreeMap::new()),
1097 nodes: RwLock::new(BTreeMap::new()),
1098 last_rapid_gossip_sync_timestamp: Mutex::new(None),
1102 /// Returns a read-only view of the network graph.
1103 pub fn read_only(&'_ self) -> ReadOnlyNetworkGraph<'_> {
1104 let channels = self.channels.read().unwrap();
1105 let nodes = self.nodes.read().unwrap();
1106 ReadOnlyNetworkGraph {
1112 /// The unix timestamp provided by the most recent rapid gossip sync.
1113 /// It will be set by the rapid sync process after every sync completion.
1114 pub fn get_last_rapid_gossip_sync_timestamp(&self) -> Option<u32> {
1115 self.last_rapid_gossip_sync_timestamp.lock().unwrap().clone()
1118 /// Update the unix timestamp provided by the most recent rapid gossip sync.
1119 /// This should be done automatically by the rapid sync process after every sync completion.
1120 pub fn set_last_rapid_gossip_sync_timestamp(&self, last_rapid_gossip_sync_timestamp: u32) {
1121 self.last_rapid_gossip_sync_timestamp.lock().unwrap().replace(last_rapid_gossip_sync_timestamp);
1124 /// Clears the `NodeAnnouncementInfo` field for all nodes in the `NetworkGraph` for testing
1127 pub fn clear_nodes_announcement_info(&self) {
1128 for node in self.nodes.write().unwrap().iter_mut() {
1129 node.1.announcement_info = None;
1133 /// For an already known node (from channel announcements), update its stored properties from a
1134 /// given node announcement.
1136 /// You probably don't want to call this directly, instead relying on a P2PGossipSync's
1137 /// RoutingMessageHandler implementation to call it indirectly. This may be useful to accept
1138 /// routing messages from a source using a protocol other than the lightning P2P protocol.
1139 pub fn update_node_from_announcement(&self, msg: &msgs::NodeAnnouncement) -> Result<(), LightningError> {
1140 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.contents.encode()[..])[..]);
1141 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.signature, &msg.contents.node_id, "node_announcement");
1142 self.update_node_from_announcement_intern(&msg.contents, Some(&msg))
1145 /// For an already known node (from channel announcements), update its stored properties from a
1146 /// given node announcement without verifying the associated signatures. Because we aren't
1147 /// given the associated signatures here we cannot relay the node announcement to any of our
1149 pub fn update_node_from_unsigned_announcement(&self, msg: &msgs::UnsignedNodeAnnouncement) -> Result<(), LightningError> {
1150 self.update_node_from_announcement_intern(msg, None)
1153 fn update_node_from_announcement_intern(&self, msg: &msgs::UnsignedNodeAnnouncement, full_msg: Option<&msgs::NodeAnnouncement>) -> Result<(), LightningError> {
1154 match self.nodes.write().unwrap().get_mut(&NodeId::from_pubkey(&msg.node_id)) {
1155 None => Err(LightningError{err: "No existing channels for node_announcement".to_owned(), action: ErrorAction::IgnoreError}),
1157 if let Some(node_info) = node.announcement_info.as_ref() {
1158 // The timestamp field is somewhat of a misnomer - the BOLTs use it to order
1159 // updates to ensure you always have the latest one, only vaguely suggesting
1160 // that it be at least the current time.
1161 if node_info.last_update > msg.timestamp {
1162 return Err(LightningError{err: "Update older than last processed update".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1163 } else if node_info.last_update == msg.timestamp {
1164 return Err(LightningError{err: "Update had the same timestamp as last processed update".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1169 msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
1170 msg.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY &&
1171 msg.excess_data.len() + msg.excess_address_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY;
1172 node.announcement_info = Some(NodeAnnouncementInfo {
1173 features: msg.features.clone(),
1174 last_update: msg.timestamp,
1176 alias: NodeAlias(msg.alias),
1177 addresses: msg.addresses.clone(),
1178 announcement_message: if should_relay { full_msg.cloned() } else { None },
1186 /// Store or update channel info from a channel announcement.
1188 /// You probably don't want to call this directly, instead relying on a P2PGossipSync's
1189 /// RoutingMessageHandler implementation to call it indirectly. This may be useful to accept
1190 /// routing messages from a source using a protocol other than the lightning P2P protocol.
1192 /// If a `chain::Access` object is provided via `chain_access`, it will be called to verify
1193 /// the corresponding UTXO exists on chain and is correctly-formatted.
1194 pub fn update_channel_from_announcement<C: Deref>(
1195 &self, msg: &msgs::ChannelAnnouncement, chain_access: &Option<C>,
1196 ) -> Result<(), LightningError>
1198 C::Target: chain::Access,
1200 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.contents.encode()[..])[..]);
1201 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.node_signature_1, &msg.contents.node_id_1, "channel_announcement");
1202 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.node_signature_2, &msg.contents.node_id_2, "channel_announcement");
1203 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.bitcoin_signature_1, &msg.contents.bitcoin_key_1, "channel_announcement");
1204 secp_verify_sig!(self.secp_ctx, &msg_hash, &msg.bitcoin_signature_2, &msg.contents.bitcoin_key_2, "channel_announcement");
1205 self.update_channel_from_unsigned_announcement_intern(&msg.contents, Some(msg), chain_access)
1208 /// Store or update channel info from a channel announcement without verifying the associated
1209 /// signatures. Because we aren't given the associated signatures here we cannot relay the
1210 /// channel announcement to any of our peers.
1212 /// If a `chain::Access` object is provided via `chain_access`, it will be called to verify
1213 /// the corresponding UTXO exists on chain and is correctly-formatted.
1214 pub fn update_channel_from_unsigned_announcement<C: Deref>(
1215 &self, msg: &msgs::UnsignedChannelAnnouncement, chain_access: &Option<C>
1216 ) -> Result<(), LightningError>
1218 C::Target: chain::Access,
1220 self.update_channel_from_unsigned_announcement_intern(msg, None, chain_access)
1223 /// Update channel from partial announcement data received via rapid gossip sync
1225 /// `timestamp: u64`: Timestamp emulating the backdated original announcement receipt (by the
1226 /// rapid gossip sync server)
1228 /// All other parameters as used in [`msgs::UnsignedChannelAnnouncement`] fields.
1229 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> {
1230 if node_id_1 == node_id_2 {
1231 return Err(LightningError{err: "Channel announcement node had a channel with itself".to_owned(), action: ErrorAction::IgnoreError});
1234 let node_1 = NodeId::from_pubkey(&node_id_1);
1235 let node_2 = NodeId::from_pubkey(&node_id_2);
1236 let channel_info = ChannelInfo {
1238 node_one: node_1.clone(),
1240 node_two: node_2.clone(),
1242 capacity_sats: None,
1243 announcement_message: None,
1244 announcement_received_time: timestamp,
1247 self.add_channel_between_nodes(short_channel_id, channel_info, None)
1250 fn add_channel_between_nodes(&self, short_channel_id: u64, channel_info: ChannelInfo, utxo_value: Option<u64>) -> Result<(), LightningError> {
1251 let mut channels = self.channels.write().unwrap();
1252 let mut nodes = self.nodes.write().unwrap();
1254 let node_id_a = channel_info.node_one.clone();
1255 let node_id_b = channel_info.node_two.clone();
1257 match channels.entry(short_channel_id) {
1258 BtreeEntry::Occupied(mut entry) => {
1259 //TODO: because asking the blockchain if short_channel_id is valid is only optional
1260 //in the blockchain API, we need to handle it smartly here, though it's unclear
1262 if utxo_value.is_some() {
1263 // Either our UTXO provider is busted, there was a reorg, or the UTXO provider
1264 // only sometimes returns results. In any case remove the previous entry. Note
1265 // that the spec expects us to "blacklist" the node_ids involved, but we can't
1267 // a) we don't *require* a UTXO provider that always returns results.
1268 // b) we don't track UTXOs of channels we know about and remove them if they
1270 // c) it's unclear how to do so without exposing ourselves to massive DoS risk.
1271 Self::remove_channel_in_nodes(&mut nodes, &entry.get(), short_channel_id);
1272 *entry.get_mut() = channel_info;
1274 return Err(LightningError{err: "Already have knowledge of channel".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1277 BtreeEntry::Vacant(entry) => {
1278 entry.insert(channel_info);
1282 for current_node_id in [node_id_a, node_id_b].iter() {
1283 match nodes.entry(current_node_id.clone()) {
1284 BtreeEntry::Occupied(node_entry) => {
1285 node_entry.into_mut().channels.push(short_channel_id);
1287 BtreeEntry::Vacant(node_entry) => {
1288 node_entry.insert(NodeInfo {
1289 channels: vec!(short_channel_id),
1290 lowest_inbound_channel_fees: None,
1291 announcement_info: None,
1300 fn update_channel_from_unsigned_announcement_intern<C: Deref>(
1301 &self, msg: &msgs::UnsignedChannelAnnouncement, full_msg: Option<&msgs::ChannelAnnouncement>, chain_access: &Option<C>
1302 ) -> Result<(), LightningError>
1304 C::Target: chain::Access,
1306 if msg.node_id_1 == msg.node_id_2 || msg.bitcoin_key_1 == msg.bitcoin_key_2 {
1307 return Err(LightningError{err: "Channel announcement node had a channel with itself".to_owned(), action: ErrorAction::IgnoreError});
1310 let utxo_value = match &chain_access {
1312 // Tentatively accept, potentially exposing us to DoS attacks
1315 &Some(ref chain_access) => {
1316 match chain_access.get_utxo(&msg.chain_hash, msg.short_channel_id) {
1317 Ok(TxOut { value, script_pubkey }) => {
1318 let expected_script = Builder::new().push_opcode(opcodes::all::OP_PUSHNUM_2)
1319 .push_slice(&msg.bitcoin_key_1.serialize())
1320 .push_slice(&msg.bitcoin_key_2.serialize())
1321 .push_opcode(opcodes::all::OP_PUSHNUM_2)
1322 .push_opcode(opcodes::all::OP_CHECKMULTISIG).into_script().to_v0_p2wsh();
1323 if script_pubkey != expected_script {
1324 return Err(LightningError{err: format!("Channel announcement key ({}) didn't match on-chain script ({})", script_pubkey.to_hex(), expected_script.to_hex()), action: ErrorAction::IgnoreError});
1326 //TODO: Check if value is worth storing, use it to inform routing, and compare it
1327 //to the new HTLC max field in channel_update
1330 Err(chain::AccessError::UnknownChain) => {
1331 return Err(LightningError{err: format!("Channel announced on an unknown chain ({})", msg.chain_hash.encode().to_hex()), action: ErrorAction::IgnoreError});
1333 Err(chain::AccessError::UnknownTx) => {
1334 return Err(LightningError{err: "Channel announced without corresponding UTXO entry".to_owned(), action: ErrorAction::IgnoreError});
1340 #[allow(unused_mut, unused_assignments)]
1341 let mut announcement_received_time = 0;
1342 #[cfg(feature = "std")]
1344 announcement_received_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1347 let chan_info = ChannelInfo {
1348 features: msg.features.clone(),
1349 node_one: NodeId::from_pubkey(&msg.node_id_1),
1351 node_two: NodeId::from_pubkey(&msg.node_id_2),
1353 capacity_sats: utxo_value,
1354 announcement_message: if msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY
1355 { full_msg.cloned() } else { None },
1356 announcement_received_time,
1359 self.add_channel_between_nodes(msg.short_channel_id, chan_info, utxo_value)
1362 /// Marks a channel in the graph as failed if a corresponding HTLC fail was sent.
1363 /// If permanent, removes a channel from the local storage.
1364 /// May cause the removal of nodes too, if this was their last channel.
1365 /// If not permanent, makes channels unavailable for routing.
1366 pub fn channel_failed(&self, short_channel_id: u64, is_permanent: bool) {
1367 let mut channels = self.channels.write().unwrap();
1369 if let Some(chan) = channels.remove(&short_channel_id) {
1370 let mut nodes = self.nodes.write().unwrap();
1371 Self::remove_channel_in_nodes(&mut nodes, &chan, short_channel_id);
1374 if let Some(chan) = channels.get_mut(&short_channel_id) {
1375 if let Some(one_to_two) = chan.one_to_two.as_mut() {
1376 one_to_two.enabled = false;
1378 if let Some(two_to_one) = chan.two_to_one.as_mut() {
1379 two_to_one.enabled = false;
1385 /// Marks a node in the graph as failed.
1386 pub fn node_failed(&self, _node_id: &PublicKey, is_permanent: bool) {
1388 // TODO: Wholly remove the node
1390 // TODO: downgrade the node
1394 #[cfg(feature = "std")]
1395 /// Removes information about channels that we haven't heard any updates about in some time.
1396 /// This can be used regularly to prune the network graph of channels that likely no longer
1399 /// While there is no formal requirement that nodes regularly re-broadcast their channel
1400 /// updates every two weeks, the non-normative section of BOLT 7 currently suggests that
1401 /// pruning occur for updates which are at least two weeks old, which we implement here.
1403 /// Note that for users of the `lightning-background-processor` crate this method may be
1404 /// automatically called regularly for you.
1406 /// This method is only available with the `std` feature. See
1407 /// [`NetworkGraph::remove_stale_channels_with_time`] for `no-std` use.
1408 pub fn remove_stale_channels(&self) {
1409 let time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1410 self.remove_stale_channels_with_time(time);
1413 /// Removes information about channels that we haven't heard any updates about in some time.
1414 /// This can be used regularly to prune the network graph of channels that likely no longer
1417 /// While there is no formal requirement that nodes regularly re-broadcast their channel
1418 /// updates every two weeks, the non-normative section of BOLT 7 currently suggests that
1419 /// pruning occur for updates which are at least two weeks old, which we implement here.
1421 /// This function takes the current unix time as an argument. For users with the `std` feature
1422 /// enabled, [`NetworkGraph::remove_stale_channels`] may be preferable.
1423 pub fn remove_stale_channels_with_time(&self, current_time_unix: u64) {
1424 let mut channels = self.channels.write().unwrap();
1425 // Time out if we haven't received an update in at least 14 days.
1426 if current_time_unix > u32::max_value() as u64 { return; } // Remove by 2106
1427 if current_time_unix < STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS { return; }
1428 let min_time_unix: u32 = (current_time_unix - STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS) as u32;
1429 // Sadly BTreeMap::retain was only stabilized in 1.53 so we can't switch to it for some
1431 let mut scids_to_remove = Vec::new();
1432 for (scid, info) in channels.iter_mut() {
1433 if info.one_to_two.is_some() && info.one_to_two.as_ref().unwrap().last_update < min_time_unix {
1434 info.one_to_two = None;
1436 if info.two_to_one.is_some() && info.two_to_one.as_ref().unwrap().last_update < min_time_unix {
1437 info.two_to_one = None;
1439 if info.one_to_two.is_none() && info.two_to_one.is_none() {
1440 // We check the announcement_received_time here to ensure we don't drop
1441 // announcements that we just received and are just waiting for our peer to send a
1442 // channel_update for.
1443 if info.announcement_received_time < min_time_unix as u64 {
1444 scids_to_remove.push(*scid);
1448 if !scids_to_remove.is_empty() {
1449 let mut nodes = self.nodes.write().unwrap();
1450 for scid in scids_to_remove {
1451 let info = channels.remove(&scid).expect("We just accessed this scid, it should be present");
1452 Self::remove_channel_in_nodes(&mut nodes, &info, scid);
1457 /// For an already known (from announcement) channel, update info about one of the directions
1460 /// You probably don't want to call this directly, instead relying on a P2PGossipSync's
1461 /// RoutingMessageHandler implementation to call it indirectly. This may be useful to accept
1462 /// routing messages from a source using a protocol other than the lightning P2P protocol.
1464 /// If built with `no-std`, any updates with a timestamp more than two weeks in the past or
1465 /// materially in the future will be rejected.
1466 pub fn update_channel(&self, msg: &msgs::ChannelUpdate) -> Result<(), LightningError> {
1467 self.update_channel_intern(&msg.contents, Some(&msg), Some(&msg.signature))
1470 /// For an already known (from announcement) channel, update info about one of the directions
1471 /// of the channel without verifying the associated signatures. Because we aren't given the
1472 /// associated signatures here we cannot relay the channel update to any of our peers.
1474 /// If built with `no-std`, any updates with a timestamp more than two weeks in the past or
1475 /// materially in the future will be rejected.
1476 pub fn update_channel_unsigned(&self, msg: &msgs::UnsignedChannelUpdate) -> Result<(), LightningError> {
1477 self.update_channel_intern(msg, None, None)
1480 fn update_channel_intern(&self, msg: &msgs::UnsignedChannelUpdate, full_msg: Option<&msgs::ChannelUpdate>, sig: Option<&secp256k1::ecdsa::Signature>) -> Result<(), LightningError> {
1482 let chan_enabled = msg.flags & (1 << 1) != (1 << 1);
1483 let chan_was_enabled;
1485 #[cfg(all(feature = "std", not(test), not(feature = "_test_utils")))]
1487 // Note that many tests rely on being able to set arbitrarily old timestamps, thus we
1488 // disable this check during tests!
1489 let time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
1490 if (msg.timestamp as u64) < time - STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS {
1491 return Err(LightningError{err: "channel_update is older than two weeks old".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1493 if msg.timestamp as u64 > time + 60 * 60 * 24 {
1494 return Err(LightningError{err: "channel_update has a timestamp more than a day in the future".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1498 let mut channels = self.channels.write().unwrap();
1499 match channels.get_mut(&msg.short_channel_id) {
1500 None => return Err(LightningError{err: "Couldn't find channel for update".to_owned(), action: ErrorAction::IgnoreError}),
1502 if let OptionalField::Present(htlc_maximum_msat) = msg.htlc_maximum_msat {
1503 if htlc_maximum_msat > MAX_VALUE_MSAT {
1504 return Err(LightningError{err: "htlc_maximum_msat is larger than maximum possible msats".to_owned(), action: ErrorAction::IgnoreError});
1507 if let Some(capacity_sats) = channel.capacity_sats {
1508 // It's possible channel capacity is available now, although it wasn't available at announcement (so the field is None).
1509 // Don't query UTXO set here to reduce DoS risks.
1510 if capacity_sats > MAX_VALUE_MSAT / 1000 || htlc_maximum_msat > capacity_sats * 1000 {
1511 return Err(LightningError{err: "htlc_maximum_msat is larger than channel capacity or capacity is bogus".to_owned(), action: ErrorAction::IgnoreError});
1515 macro_rules! check_update_latest {
1516 ($target: expr) => {
1517 if let Some(existing_chan_info) = $target.as_ref() {
1518 // The timestamp field is somewhat of a misnomer - the BOLTs use it to
1519 // order updates to ensure you always have the latest one, only
1520 // suggesting that it be at least the current time. For
1521 // channel_updates specifically, the BOLTs discuss the possibility of
1522 // pruning based on the timestamp field being more than two weeks old,
1523 // but only in the non-normative section.
1524 if existing_chan_info.last_update > msg.timestamp {
1525 return Err(LightningError{err: "Update older than last processed update".to_owned(), action: ErrorAction::IgnoreAndLog(Level::Gossip)});
1526 } else if existing_chan_info.last_update == msg.timestamp {
1527 return Err(LightningError{err: "Update had same timestamp as last processed update".to_owned(), action: ErrorAction::IgnoreDuplicateGossip});
1529 chan_was_enabled = existing_chan_info.enabled;
1531 chan_was_enabled = false;
1536 macro_rules! get_new_channel_info {
1538 let last_update_message = if msg.excess_data.len() <= MAX_EXCESS_BYTES_FOR_RELAY
1539 { full_msg.cloned() } else { None };
1541 let updated_channel_update_info = ChannelUpdateInfo {
1542 enabled: chan_enabled,
1543 last_update: msg.timestamp,
1544 cltv_expiry_delta: msg.cltv_expiry_delta,
1545 htlc_minimum_msat: msg.htlc_minimum_msat,
1546 htlc_maximum_msat: if let OptionalField::Present(max_value) = msg.htlc_maximum_msat { Some(max_value) } else { None },
1548 base_msat: msg.fee_base_msat,
1549 proportional_millionths: msg.fee_proportional_millionths,
1553 Some(updated_channel_update_info)
1557 let msg_hash = hash_to_message!(&Sha256dHash::hash(&msg.encode()[..])[..]);
1558 if msg.flags & 1 == 1 {
1559 dest_node_id = channel.node_one.clone();
1560 check_update_latest!(channel.two_to_one);
1561 if let Some(sig) = sig {
1562 secp_verify_sig!(self.secp_ctx, &msg_hash, &sig, &PublicKey::from_slice(channel.node_two.as_slice()).map_err(|_| LightningError{
1563 err: "Couldn't parse source node pubkey".to_owned(),
1564 action: ErrorAction::IgnoreAndLog(Level::Debug)
1565 })?, "channel_update");
1567 channel.two_to_one = get_new_channel_info!();
1569 dest_node_id = channel.node_two.clone();
1570 check_update_latest!(channel.one_to_two);
1571 if let Some(sig) = sig {
1572 secp_verify_sig!(self.secp_ctx, &msg_hash, &sig, &PublicKey::from_slice(channel.node_one.as_slice()).map_err(|_| LightningError{
1573 err: "Couldn't parse destination node pubkey".to_owned(),
1574 action: ErrorAction::IgnoreAndLog(Level::Debug)
1575 })?, "channel_update");
1577 channel.one_to_two = get_new_channel_info!();
1582 let mut nodes = self.nodes.write().unwrap();
1584 let node = nodes.get_mut(&dest_node_id).unwrap();
1585 let mut base_msat = msg.fee_base_msat;
1586 let mut proportional_millionths = msg.fee_proportional_millionths;
1587 if let Some(fees) = node.lowest_inbound_channel_fees {
1588 base_msat = cmp::min(base_msat, fees.base_msat);
1589 proportional_millionths = cmp::min(proportional_millionths, fees.proportional_millionths);
1591 node.lowest_inbound_channel_fees = Some(RoutingFees {
1593 proportional_millionths
1595 } else if chan_was_enabled {
1596 let node = nodes.get_mut(&dest_node_id).unwrap();
1597 let mut lowest_inbound_channel_fees = None;
1599 for chan_id in node.channels.iter() {
1600 let chan = channels.get(chan_id).unwrap();
1602 if chan.node_one == dest_node_id {
1603 chan_info_opt = chan.two_to_one.as_ref();
1605 chan_info_opt = chan.one_to_two.as_ref();
1607 if let Some(chan_info) = chan_info_opt {
1608 if chan_info.enabled {
1609 let fees = lowest_inbound_channel_fees.get_or_insert(RoutingFees {
1610 base_msat: u32::max_value(), proportional_millionths: u32::max_value() });
1611 fees.base_msat = cmp::min(fees.base_msat, chan_info.fees.base_msat);
1612 fees.proportional_millionths = cmp::min(fees.proportional_millionths, chan_info.fees.proportional_millionths);
1617 node.lowest_inbound_channel_fees = lowest_inbound_channel_fees;
1623 fn remove_channel_in_nodes(nodes: &mut BTreeMap<NodeId, NodeInfo>, chan: &ChannelInfo, short_channel_id: u64) {
1624 macro_rules! remove_from_node {
1625 ($node_id: expr) => {
1626 if let BtreeEntry::Occupied(mut entry) = nodes.entry($node_id) {
1627 entry.get_mut().channels.retain(|chan_id| {
1628 short_channel_id != *chan_id
1630 if entry.get().channels.is_empty() {
1631 entry.remove_entry();
1634 panic!("Had channel that pointed to unknown node (ie inconsistent network map)!");
1639 remove_from_node!(chan.node_one);
1640 remove_from_node!(chan.node_two);
1644 impl ReadOnlyNetworkGraph<'_> {
1645 /// Returns all known valid channels' short ids along with announced channel info.
1647 /// (C-not exported) because we have no mapping for `BTreeMap`s
1648 pub fn channels(&self) -> &BTreeMap<u64, ChannelInfo> {
1652 /// Returns all known nodes' public keys along with announced node info.
1654 /// (C-not exported) because we have no mapping for `BTreeMap`s
1655 pub fn nodes(&self) -> &BTreeMap<NodeId, NodeInfo> {
1659 /// Get network addresses by node id.
1660 /// Returns None if the requested node is completely unknown,
1661 /// or if node announcement for the node was never received.
1662 pub fn get_addresses(&self, pubkey: &PublicKey) -> Option<Vec<NetAddress>> {
1663 if let Some(node) = self.nodes.get(&NodeId::from_pubkey(&pubkey)) {
1664 if let Some(node_info) = node.announcement_info.as_ref() {
1665 return Some(node_info.addresses.clone())
1675 use ln::PaymentHash;
1676 use ln::features::{ChannelFeatures, InitFeatures, NodeFeatures};
1677 use routing::gossip::{P2PGossipSync, NetworkGraph, NetworkUpdate, NodeAlias, MAX_EXCESS_BYTES_FOR_RELAY};
1678 use ln::msgs::{Init, OptionalField, RoutingMessageHandler, UnsignedNodeAnnouncement, NodeAnnouncement,
1679 UnsignedChannelAnnouncement, ChannelAnnouncement, UnsignedChannelUpdate, ChannelUpdate,
1680 ReplyChannelRange, QueryChannelRange, QueryShortChannelIds, MAX_VALUE_MSAT};
1681 use util::test_utils;
1682 use util::ser::{ReadableArgs, Writeable};
1683 use util::events::{Event, EventHandler, MessageSendEvent, MessageSendEventsProvider};
1684 use util::scid_utils::scid_from_parts;
1686 use super::STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS;
1688 use bitcoin::hashes::sha256d::Hash as Sha256dHash;
1689 use bitcoin::hashes::Hash;
1690 use bitcoin::network::constants::Network;
1691 use bitcoin::blockdata::constants::genesis_block;
1692 use bitcoin::blockdata::script::{Builder, Script};
1693 use bitcoin::blockdata::transaction::TxOut;
1694 use bitcoin::blockdata::opcodes;
1698 use bitcoin::secp256k1::{PublicKey, SecretKey};
1699 use bitcoin::secp256k1::{All, Secp256k1};
1702 use bitcoin::secp256k1;
1706 fn create_network_graph() -> NetworkGraph<Arc<test_utils::TestLogger>> {
1707 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
1708 let logger = Arc::new(test_utils::TestLogger::new());
1709 NetworkGraph::new(genesis_hash, logger)
1712 fn create_gossip_sync(network_graph: &NetworkGraph<Arc<test_utils::TestLogger>>) -> (
1713 Secp256k1<All>, P2PGossipSync<&NetworkGraph<Arc<test_utils::TestLogger>>,
1714 Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>
1716 let secp_ctx = Secp256k1::new();
1717 let logger = Arc::new(test_utils::TestLogger::new());
1718 let gossip_sync = P2PGossipSync::new(network_graph, None, Arc::clone(&logger));
1719 (secp_ctx, gossip_sync)
1723 fn request_full_sync_finite_times() {
1724 let network_graph = create_network_graph();
1725 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
1726 let node_id = PublicKey::from_secret_key(&secp_ctx, &SecretKey::from_slice(&hex::decode("0202020202020202020202020202020202020202020202020202020202020202").unwrap()[..]).unwrap());
1728 assert!(gossip_sync.should_request_full_sync(&node_id));
1729 assert!(gossip_sync.should_request_full_sync(&node_id));
1730 assert!(gossip_sync.should_request_full_sync(&node_id));
1731 assert!(gossip_sync.should_request_full_sync(&node_id));
1732 assert!(gossip_sync.should_request_full_sync(&node_id));
1733 assert!(!gossip_sync.should_request_full_sync(&node_id));
1736 fn get_signed_node_announcement<F: Fn(&mut UnsignedNodeAnnouncement)>(f: F, node_key: &SecretKey, secp_ctx: &Secp256k1<secp256k1::All>) -> NodeAnnouncement {
1737 let node_id = PublicKey::from_secret_key(&secp_ctx, node_key);
1738 let mut unsigned_announcement = UnsignedNodeAnnouncement {
1739 features: NodeFeatures::known(),
1744 addresses: Vec::new(),
1745 excess_address_data: Vec::new(),
1746 excess_data: Vec::new(),
1748 f(&mut unsigned_announcement);
1749 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_announcement.encode()[..])[..]);
1751 signature: secp_ctx.sign_ecdsa(&msghash, node_key),
1752 contents: unsigned_announcement
1756 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 {
1757 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_1_key);
1758 let node_id_2 = PublicKey::from_secret_key(&secp_ctx, node_2_key);
1759 let node_1_btckey = &SecretKey::from_slice(&[40; 32]).unwrap();
1760 let node_2_btckey = &SecretKey::from_slice(&[39; 32]).unwrap();
1762 let mut unsigned_announcement = UnsignedChannelAnnouncement {
1763 features: ChannelFeatures::known(),
1764 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
1765 short_channel_id: 0,
1768 bitcoin_key_1: PublicKey::from_secret_key(&secp_ctx, node_1_btckey),
1769 bitcoin_key_2: PublicKey::from_secret_key(&secp_ctx, node_2_btckey),
1770 excess_data: Vec::new(),
1772 f(&mut unsigned_announcement);
1773 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_announcement.encode()[..])[..]);
1774 ChannelAnnouncement {
1775 node_signature_1: secp_ctx.sign_ecdsa(&msghash, node_1_key),
1776 node_signature_2: secp_ctx.sign_ecdsa(&msghash, node_2_key),
1777 bitcoin_signature_1: secp_ctx.sign_ecdsa(&msghash, node_1_btckey),
1778 bitcoin_signature_2: secp_ctx.sign_ecdsa(&msghash, node_2_btckey),
1779 contents: unsigned_announcement,
1783 fn get_channel_script(secp_ctx: &Secp256k1<secp256k1::All>) -> Script {
1784 let node_1_btckey = &SecretKey::from_slice(&[40; 32]).unwrap();
1785 let node_2_btckey = &SecretKey::from_slice(&[39; 32]).unwrap();
1786 Builder::new().push_opcode(opcodes::all::OP_PUSHNUM_2)
1787 .push_slice(&PublicKey::from_secret_key(&secp_ctx, node_1_btckey).serialize())
1788 .push_slice(&PublicKey::from_secret_key(&secp_ctx, node_2_btckey).serialize())
1789 .push_opcode(opcodes::all::OP_PUSHNUM_2)
1790 .push_opcode(opcodes::all::OP_CHECKMULTISIG).into_script()
1794 fn get_signed_channel_update<F: Fn(&mut UnsignedChannelUpdate)>(f: F, node_key: &SecretKey, secp_ctx: &Secp256k1<secp256k1::All>) -> ChannelUpdate {
1795 let mut unsigned_channel_update = UnsignedChannelUpdate {
1796 chain_hash: genesis_block(Network::Testnet).header.block_hash(),
1797 short_channel_id: 0,
1800 cltv_expiry_delta: 144,
1801 htlc_minimum_msat: 1_000_000,
1802 htlc_maximum_msat: OptionalField::Absent,
1803 fee_base_msat: 10_000,
1804 fee_proportional_millionths: 20,
1805 excess_data: Vec::new()
1807 f(&mut unsigned_channel_update);
1808 let msghash = hash_to_message!(&Sha256dHash::hash(&unsigned_channel_update.encode()[..])[..]);
1810 signature: secp_ctx.sign_ecdsa(&msghash, node_key),
1811 contents: unsigned_channel_update
1816 fn handling_node_announcements() {
1817 let network_graph = create_network_graph();
1818 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
1820 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
1821 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
1822 let zero_hash = Sha256dHash::hash(&[0; 32]);
1824 let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
1825 match gossip_sync.handle_node_announcement(&valid_announcement) {
1827 Err(e) => assert_eq!("No existing channels for node_announcement", e.err)
1831 // Announce a channel to add a corresponding node.
1832 let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
1833 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1834 Ok(res) => assert!(res),
1839 match gossip_sync.handle_node_announcement(&valid_announcement) {
1840 Ok(res) => assert!(res),
1844 let fake_msghash = hash_to_message!(&zero_hash);
1845 match gossip_sync.handle_node_announcement(
1847 signature: secp_ctx.sign_ecdsa(&fake_msghash, node_1_privkey),
1848 contents: valid_announcement.contents.clone()
1851 Err(e) => assert_eq!(e.err, "Invalid signature on node_announcement message")
1854 let announcement_with_data = get_signed_node_announcement(|unsigned_announcement| {
1855 unsigned_announcement.timestamp += 1000;
1856 unsigned_announcement.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
1857 }, node_1_privkey, &secp_ctx);
1858 // Return false because contains excess data.
1859 match gossip_sync.handle_node_announcement(&announcement_with_data) {
1860 Ok(res) => assert!(!res),
1864 // Even though previous announcement was not relayed further, we still accepted it,
1865 // so we now won't accept announcements before the previous one.
1866 let outdated_announcement = get_signed_node_announcement(|unsigned_announcement| {
1867 unsigned_announcement.timestamp += 1000 - 10;
1868 }, node_1_privkey, &secp_ctx);
1869 match gossip_sync.handle_node_announcement(&outdated_announcement) {
1871 Err(e) => assert_eq!(e.err, "Update older than last processed update")
1876 fn handling_channel_announcements() {
1877 let secp_ctx = Secp256k1::new();
1878 let logger = test_utils::TestLogger::new();
1880 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
1881 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
1883 let good_script = get_channel_script(&secp_ctx);
1884 let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
1886 // Test if the UTXO lookups were not supported
1887 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
1888 let network_graph = NetworkGraph::new(genesis_hash, &logger);
1889 let mut gossip_sync = P2PGossipSync::new(&network_graph, None, &logger);
1890 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1891 Ok(res) => assert!(res),
1896 match network_graph.read_only().channels().get(&valid_announcement.contents.short_channel_id) {
1902 // If we receive announcement for the same channel (with UTXO lookups disabled),
1903 // drop new one on the floor, since we can't see any changes.
1904 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1906 Err(e) => assert_eq!(e.err, "Already have knowledge of channel")
1909 // Test if an associated transaction were not on-chain (or not confirmed).
1910 let chain_source = test_utils::TestChainSource::new(Network::Testnet);
1911 *chain_source.utxo_ret.lock().unwrap() = Err(chain::AccessError::UnknownTx);
1912 let network_graph = NetworkGraph::new(genesis_hash, &logger);
1913 gossip_sync = P2PGossipSync::new(&network_graph, Some(&chain_source), &logger);
1915 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
1916 unsigned_announcement.short_channel_id += 1;
1917 }, node_1_privkey, node_2_privkey, &secp_ctx);
1918 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1920 Err(e) => assert_eq!(e.err, "Channel announced without corresponding UTXO entry")
1923 // Now test if the transaction is found in the UTXO set and the script is correct.
1924 *chain_source.utxo_ret.lock().unwrap() = Ok(TxOut { value: 0, script_pubkey: good_script.clone() });
1925 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
1926 unsigned_announcement.short_channel_id += 2;
1927 }, node_1_privkey, node_2_privkey, &secp_ctx);
1928 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1929 Ok(res) => assert!(res),
1934 match network_graph.read_only().channels().get(&valid_announcement.contents.short_channel_id) {
1940 // If we receive announcement for the same channel (but TX is not confirmed),
1941 // drop new one on the floor, since we can't see any changes.
1942 *chain_source.utxo_ret.lock().unwrap() = Err(chain::AccessError::UnknownTx);
1943 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1945 Err(e) => assert_eq!(e.err, "Channel announced without corresponding UTXO entry")
1948 // But if it is confirmed, replace the channel
1949 *chain_source.utxo_ret.lock().unwrap() = Ok(TxOut { value: 0, script_pubkey: good_script });
1950 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
1951 unsigned_announcement.features = ChannelFeatures::empty();
1952 unsigned_announcement.short_channel_id += 2;
1953 }, node_1_privkey, node_2_privkey, &secp_ctx);
1954 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1955 Ok(res) => assert!(res),
1959 match network_graph.read_only().channels().get(&valid_announcement.contents.short_channel_id) {
1960 Some(channel_entry) => {
1961 assert_eq!(channel_entry.features, ChannelFeatures::empty());
1967 // Don't relay valid channels with excess data
1968 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
1969 unsigned_announcement.short_channel_id += 3;
1970 unsigned_announcement.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
1971 }, node_1_privkey, node_2_privkey, &secp_ctx);
1972 match gossip_sync.handle_channel_announcement(&valid_announcement) {
1973 Ok(res) => assert!(!res),
1977 let mut invalid_sig_announcement = valid_announcement.clone();
1978 invalid_sig_announcement.contents.excess_data = Vec::new();
1979 match gossip_sync.handle_channel_announcement(&invalid_sig_announcement) {
1981 Err(e) => assert_eq!(e.err, "Invalid signature on channel_announcement message")
1984 let channel_to_itself_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_1_privkey, &secp_ctx);
1985 match gossip_sync.handle_channel_announcement(&channel_to_itself_announcement) {
1987 Err(e) => assert_eq!(e.err, "Channel announcement node had a channel with itself")
1992 fn handling_channel_update() {
1993 let secp_ctx = Secp256k1::new();
1994 let logger = test_utils::TestLogger::new();
1995 let chain_source = test_utils::TestChainSource::new(Network::Testnet);
1996 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
1997 let network_graph = NetworkGraph::new(genesis_hash, &logger);
1998 let gossip_sync = P2PGossipSync::new(&network_graph, Some(&chain_source), &logger);
2000 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2001 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2003 let amount_sats = 1000_000;
2004 let short_channel_id;
2007 // Announce a channel we will update
2008 let good_script = get_channel_script(&secp_ctx);
2009 *chain_source.utxo_ret.lock().unwrap() = Ok(TxOut { value: amount_sats, script_pubkey: good_script.clone() });
2011 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2012 short_channel_id = valid_channel_announcement.contents.short_channel_id;
2013 match gossip_sync.handle_channel_announcement(&valid_channel_announcement) {
2020 let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
2021 match gossip_sync.handle_channel_update(&valid_channel_update) {
2022 Ok(res) => assert!(res),
2027 match network_graph.read_only().channels().get(&short_channel_id) {
2029 Some(channel_info) => {
2030 assert_eq!(channel_info.one_to_two.as_ref().unwrap().cltv_expiry_delta, 144);
2031 assert!(channel_info.two_to_one.is_none());
2036 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2037 unsigned_channel_update.timestamp += 100;
2038 unsigned_channel_update.excess_data.resize(MAX_EXCESS_BYTES_FOR_RELAY + 1, 0);
2039 }, node_1_privkey, &secp_ctx);
2040 // Return false because contains excess data
2041 match gossip_sync.handle_channel_update(&valid_channel_update) {
2042 Ok(res) => assert!(!res),
2046 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2047 unsigned_channel_update.timestamp += 110;
2048 unsigned_channel_update.short_channel_id += 1;
2049 }, node_1_privkey, &secp_ctx);
2050 match gossip_sync.handle_channel_update(&valid_channel_update) {
2052 Err(e) => assert_eq!(e.err, "Couldn't find channel for update")
2055 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2056 unsigned_channel_update.htlc_maximum_msat = OptionalField::Present(MAX_VALUE_MSAT + 1);
2057 unsigned_channel_update.timestamp += 110;
2058 }, node_1_privkey, &secp_ctx);
2059 match gossip_sync.handle_channel_update(&valid_channel_update) {
2061 Err(e) => assert_eq!(e.err, "htlc_maximum_msat is larger than maximum possible msats")
2064 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2065 unsigned_channel_update.htlc_maximum_msat = OptionalField::Present(amount_sats * 1000 + 1);
2066 unsigned_channel_update.timestamp += 110;
2067 }, node_1_privkey, &secp_ctx);
2068 match gossip_sync.handle_channel_update(&valid_channel_update) {
2070 Err(e) => assert_eq!(e.err, "htlc_maximum_msat is larger than channel capacity or capacity is bogus")
2073 // Even though previous update was not relayed further, we still accepted it,
2074 // so we now won't accept update before the previous one.
2075 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2076 unsigned_channel_update.timestamp += 100;
2077 }, node_1_privkey, &secp_ctx);
2078 match gossip_sync.handle_channel_update(&valid_channel_update) {
2080 Err(e) => assert_eq!(e.err, "Update had same timestamp as last processed update")
2083 let mut invalid_sig_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2084 unsigned_channel_update.timestamp += 500;
2085 }, node_1_privkey, &secp_ctx);
2086 let zero_hash = Sha256dHash::hash(&[0; 32]);
2087 let fake_msghash = hash_to_message!(&zero_hash);
2088 invalid_sig_channel_update.signature = secp_ctx.sign_ecdsa(&fake_msghash, node_1_privkey);
2089 match gossip_sync.handle_channel_update(&invalid_sig_channel_update) {
2091 Err(e) => assert_eq!(e.err, "Invalid signature on channel_update message")
2096 fn handling_network_update() {
2097 let logger = test_utils::TestLogger::new();
2098 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
2099 let network_graph = NetworkGraph::new(genesis_hash, &logger);
2100 let secp_ctx = Secp256k1::new();
2102 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2103 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2106 // There is no nodes in the table at the beginning.
2107 assert_eq!(network_graph.read_only().nodes().len(), 0);
2110 let short_channel_id;
2112 // Announce a channel we will update
2113 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2114 short_channel_id = valid_channel_announcement.contents.short_channel_id;
2115 let chain_source: Option<&test_utils::TestChainSource> = None;
2116 assert!(network_graph.update_channel_from_announcement(&valid_channel_announcement, &chain_source).is_ok());
2117 assert!(network_graph.read_only().channels().get(&short_channel_id).is_some());
2119 let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
2120 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_none());
2122 network_graph.handle_event(&Event::PaymentPathFailed {
2124 payment_hash: PaymentHash([0; 32]),
2125 rejected_by_dest: false,
2126 all_paths_failed: true,
2128 network_update: Some(NetworkUpdate::ChannelUpdateMessage {
2129 msg: valid_channel_update,
2131 short_channel_id: None,
2137 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_some());
2140 // Non-permanent closing just disables a channel
2142 match network_graph.read_only().channels().get(&short_channel_id) {
2144 Some(channel_info) => {
2145 assert!(channel_info.one_to_two.as_ref().unwrap().enabled);
2149 network_graph.handle_event(&Event::PaymentPathFailed {
2151 payment_hash: PaymentHash([0; 32]),
2152 rejected_by_dest: false,
2153 all_paths_failed: true,
2155 network_update: Some(NetworkUpdate::ChannelFailure {
2157 is_permanent: false,
2159 short_channel_id: None,
2165 match network_graph.read_only().channels().get(&short_channel_id) {
2167 Some(channel_info) => {
2168 assert!(!channel_info.one_to_two.as_ref().unwrap().enabled);
2173 // Permanent closing deletes a channel
2174 network_graph.handle_event(&Event::PaymentPathFailed {
2176 payment_hash: PaymentHash([0; 32]),
2177 rejected_by_dest: false,
2178 all_paths_failed: true,
2180 network_update: Some(NetworkUpdate::ChannelFailure {
2184 short_channel_id: None,
2190 assert_eq!(network_graph.read_only().channels().len(), 0);
2191 // Nodes are also deleted because there are no associated channels anymore
2192 assert_eq!(network_graph.read_only().nodes().len(), 0);
2193 // TODO: Test NetworkUpdate::NodeFailure, which is not implemented yet.
2197 fn test_channel_timeouts() {
2198 // Test the removal of channels with `remove_stale_channels`.
2199 let logger = test_utils::TestLogger::new();
2200 let chain_source = test_utils::TestChainSource::new(Network::Testnet);
2201 let genesis_hash = genesis_block(Network::Testnet).header.block_hash();
2202 let network_graph = NetworkGraph::new(genesis_hash, &logger);
2203 let gossip_sync = P2PGossipSync::new(&network_graph, Some(&chain_source), &logger);
2204 let secp_ctx = Secp256k1::new();
2206 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2207 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2209 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2210 let short_channel_id = valid_channel_announcement.contents.short_channel_id;
2211 let chain_source: Option<&test_utils::TestChainSource> = None;
2212 assert!(network_graph.update_channel_from_announcement(&valid_channel_announcement, &chain_source).is_ok());
2213 assert!(network_graph.read_only().channels().get(&short_channel_id).is_some());
2215 let valid_channel_update = get_signed_channel_update(|_| {}, node_1_privkey, &secp_ctx);
2216 assert!(gossip_sync.handle_channel_update(&valid_channel_update).is_ok());
2217 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_some());
2219 network_graph.remove_stale_channels_with_time(100 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2220 assert_eq!(network_graph.read_only().channels().len(), 1);
2221 assert_eq!(network_graph.read_only().nodes().len(), 2);
2223 network_graph.remove_stale_channels_with_time(101 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2224 #[cfg(feature = "std")]
2226 // In std mode, a further check is performed before fully removing the channel -
2227 // the channel_announcement must have been received at least two weeks ago. We
2228 // fudge that here by indicating the time has jumped two weeks. Note that the
2229 // directional channel information will have been removed already..
2230 assert_eq!(network_graph.read_only().channels().len(), 1);
2231 assert_eq!(network_graph.read_only().nodes().len(), 2);
2232 assert!(network_graph.read_only().channels().get(&short_channel_id).unwrap().one_to_two.is_none());
2234 use std::time::{SystemTime, UNIX_EPOCH};
2235 let announcement_time = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
2236 network_graph.remove_stale_channels_with_time(announcement_time + 1 + STALE_CHANNEL_UPDATE_AGE_LIMIT_SECS);
2239 assert_eq!(network_graph.read_only().channels().len(), 0);
2240 assert_eq!(network_graph.read_only().nodes().len(), 0);
2244 fn getting_next_channel_announcements() {
2245 let network_graph = create_network_graph();
2246 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2247 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2248 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2250 // Channels were not announced yet.
2251 let channels_with_announcements = gossip_sync.get_next_channel_announcements(0, 1);
2252 assert_eq!(channels_with_announcements.len(), 0);
2254 let short_channel_id;
2256 // Announce a channel we will update
2257 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2258 short_channel_id = valid_channel_announcement.contents.short_channel_id;
2259 match gossip_sync.handle_channel_announcement(&valid_channel_announcement) {
2265 // Contains initial channel announcement now.
2266 let channels_with_announcements = gossip_sync.get_next_channel_announcements(short_channel_id, 1);
2267 assert_eq!(channels_with_announcements.len(), 1);
2268 if let Some(channel_announcements) = channels_with_announcements.first() {
2269 let &(_, ref update_1, ref update_2) = channel_announcements;
2270 assert_eq!(update_1, &None);
2271 assert_eq!(update_2, &None);
2278 // Valid channel update
2279 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2280 unsigned_channel_update.timestamp = 101;
2281 }, node_1_privkey, &secp_ctx);
2282 match gossip_sync.handle_channel_update(&valid_channel_update) {
2288 // Now contains an initial announcement and an update.
2289 let channels_with_announcements = gossip_sync.get_next_channel_announcements(short_channel_id, 1);
2290 assert_eq!(channels_with_announcements.len(), 1);
2291 if let Some(channel_announcements) = channels_with_announcements.first() {
2292 let &(_, ref update_1, ref update_2) = channel_announcements;
2293 assert_ne!(update_1, &None);
2294 assert_eq!(update_2, &None);
2300 // Channel update with excess data.
2301 let valid_channel_update = get_signed_channel_update(|unsigned_channel_update| {
2302 unsigned_channel_update.timestamp = 102;
2303 unsigned_channel_update.excess_data = [1; MAX_EXCESS_BYTES_FOR_RELAY + 1].to_vec();
2304 }, node_1_privkey, &secp_ctx);
2305 match gossip_sync.handle_channel_update(&valid_channel_update) {
2311 // Test that announcements with excess data won't be returned
2312 let channels_with_announcements = gossip_sync.get_next_channel_announcements(short_channel_id, 1);
2313 assert_eq!(channels_with_announcements.len(), 1);
2314 if let Some(channel_announcements) = channels_with_announcements.first() {
2315 let &(_, ref update_1, ref update_2) = channel_announcements;
2316 assert_eq!(update_1, &None);
2317 assert_eq!(update_2, &None);
2322 // Further starting point have no channels after it
2323 let channels_with_announcements = gossip_sync.get_next_channel_announcements(short_channel_id + 1000, 1);
2324 assert_eq!(channels_with_announcements.len(), 0);
2328 fn getting_next_node_announcements() {
2329 let network_graph = create_network_graph();
2330 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2331 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2332 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2333 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_1_privkey);
2336 let next_announcements = gossip_sync.get_next_node_announcements(None, 10);
2337 assert_eq!(next_announcements.len(), 0);
2340 // Announce a channel to add 2 nodes
2341 let valid_channel_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2342 match gossip_sync.handle_channel_announcement(&valid_channel_announcement) {
2349 // Nodes were never announced
2350 let next_announcements = gossip_sync.get_next_node_announcements(None, 3);
2351 assert_eq!(next_announcements.len(), 0);
2354 let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
2355 match gossip_sync.handle_node_announcement(&valid_announcement) {
2360 let valid_announcement = get_signed_node_announcement(|_| {}, node_2_privkey, &secp_ctx);
2361 match gossip_sync.handle_node_announcement(&valid_announcement) {
2367 let next_announcements = gossip_sync.get_next_node_announcements(None, 3);
2368 assert_eq!(next_announcements.len(), 2);
2370 // Skip the first node.
2371 let next_announcements = gossip_sync.get_next_node_announcements(Some(&node_id_1), 2);
2372 assert_eq!(next_announcements.len(), 1);
2375 // Later announcement which should not be relayed (excess data) prevent us from sharing a node
2376 let valid_announcement = get_signed_node_announcement(|unsigned_announcement| {
2377 unsigned_announcement.timestamp += 10;
2378 unsigned_announcement.excess_data = [1; MAX_EXCESS_BYTES_FOR_RELAY + 1].to_vec();
2379 }, node_2_privkey, &secp_ctx);
2380 match gossip_sync.handle_node_announcement(&valid_announcement) {
2381 Ok(res) => assert!(!res),
2386 let next_announcements = gossip_sync.get_next_node_announcements(Some(&node_id_1), 2);
2387 assert_eq!(next_announcements.len(), 0);
2391 fn network_graph_serialization() {
2392 let network_graph = create_network_graph();
2393 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2395 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2396 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2398 // Announce a channel to add a corresponding node.
2399 let valid_announcement = get_signed_channel_announcement(|_| {}, node_1_privkey, node_2_privkey, &secp_ctx);
2400 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2401 Ok(res) => assert!(res),
2405 let valid_announcement = get_signed_node_announcement(|_| {}, node_1_privkey, &secp_ctx);
2406 match gossip_sync.handle_node_announcement(&valid_announcement) {
2411 let mut w = test_utils::TestVecWriter(Vec::new());
2412 assert!(!network_graph.read_only().nodes().is_empty());
2413 assert!(!network_graph.read_only().channels().is_empty());
2414 network_graph.write(&mut w).unwrap();
2416 let logger = Arc::new(test_utils::TestLogger::new());
2417 assert!(<NetworkGraph<_>>::read(&mut io::Cursor::new(&w.0), logger).unwrap() == network_graph);
2421 fn network_graph_tlv_serialization() {
2422 let network_graph = create_network_graph();
2423 network_graph.set_last_rapid_gossip_sync_timestamp(42);
2425 let mut w = test_utils::TestVecWriter(Vec::new());
2426 network_graph.write(&mut w).unwrap();
2428 let logger = Arc::new(test_utils::TestLogger::new());
2429 let reassembled_network_graph: NetworkGraph<_> = ReadableArgs::read(&mut io::Cursor::new(&w.0), logger).unwrap();
2430 assert!(reassembled_network_graph == network_graph);
2431 assert_eq!(reassembled_network_graph.get_last_rapid_gossip_sync_timestamp().unwrap(), 42);
2435 #[cfg(feature = "std")]
2436 fn calling_sync_routing_table() {
2437 use std::time::{SystemTime, UNIX_EPOCH};
2439 let network_graph = create_network_graph();
2440 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2441 let node_privkey_1 = &SecretKey::from_slice(&[42; 32]).unwrap();
2442 let node_id_1 = PublicKey::from_secret_key(&secp_ctx, node_privkey_1);
2444 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2446 // It should ignore if gossip_queries feature is not enabled
2448 let init_msg = Init { features: InitFeatures::known().clear_gossip_queries(), remote_network_address: None };
2449 gossip_sync.peer_connected(&node_id_1, &init_msg);
2450 let events = gossip_sync.get_and_clear_pending_msg_events();
2451 assert_eq!(events.len(), 0);
2454 // It should send a gossip_timestamp_filter with the correct information
2456 let init_msg = Init { features: InitFeatures::known(), remote_network_address: None };
2457 gossip_sync.peer_connected(&node_id_1, &init_msg);
2458 let events = gossip_sync.get_and_clear_pending_msg_events();
2459 assert_eq!(events.len(), 1);
2461 MessageSendEvent::SendGossipTimestampFilter{ node_id, msg } => {
2462 assert_eq!(node_id, &node_id_1);
2463 assert_eq!(msg.chain_hash, chain_hash);
2464 let expected_timestamp = SystemTime::now().duration_since(UNIX_EPOCH).expect("Time must be > 1970").as_secs();
2465 assert!((msg.first_timestamp as u64) >= expected_timestamp - 60*60*24*7*2);
2466 assert!((msg.first_timestamp as u64) < expected_timestamp - 60*60*24*7*2 + 10);
2467 assert_eq!(msg.timestamp_range, u32::max_value());
2469 _ => panic!("Expected MessageSendEvent::SendChannelRangeQuery")
2475 fn handling_query_channel_range() {
2476 let network_graph = create_network_graph();
2477 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2479 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2480 let node_1_privkey = &SecretKey::from_slice(&[42; 32]).unwrap();
2481 let node_2_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2482 let node_id_2 = PublicKey::from_secret_key(&secp_ctx, node_2_privkey);
2484 let mut scids: Vec<u64> = vec![
2485 scid_from_parts(0xfffffe, 0xffffff, 0xffff).unwrap(), // max
2486 scid_from_parts(0xffffff, 0xffffff, 0xffff).unwrap(), // never
2489 // used for testing multipart reply across blocks
2490 for block in 100000..=108001 {
2491 scids.push(scid_from_parts(block, 0, 0).unwrap());
2494 // used for testing resumption on same block
2495 scids.push(scid_from_parts(108001, 1, 0).unwrap());
2498 let valid_announcement = get_signed_channel_announcement(|unsigned_announcement| {
2499 unsigned_announcement.short_channel_id = scid;
2500 }, node_1_privkey, node_2_privkey, &secp_ctx);
2501 match gossip_sync.handle_channel_announcement(&valid_announcement) {
2507 // Error when number_of_blocks=0
2508 do_handling_query_channel_range(
2512 chain_hash: chain_hash.clone(),
2514 number_of_blocks: 0,
2517 vec![ReplyChannelRange {
2518 chain_hash: chain_hash.clone(),
2520 number_of_blocks: 0,
2521 sync_complete: true,
2522 short_channel_ids: vec![]
2526 // Error when wrong chain
2527 do_handling_query_channel_range(
2531 chain_hash: genesis_block(Network::Bitcoin).header.block_hash(),
2533 number_of_blocks: 0xffff_ffff,
2536 vec![ReplyChannelRange {
2537 chain_hash: genesis_block(Network::Bitcoin).header.block_hash(),
2539 number_of_blocks: 0xffff_ffff,
2540 sync_complete: true,
2541 short_channel_ids: vec![],
2545 // Error when first_blocknum > 0xffffff
2546 do_handling_query_channel_range(
2550 chain_hash: chain_hash.clone(),
2551 first_blocknum: 0x01000000,
2552 number_of_blocks: 0xffff_ffff,
2555 vec![ReplyChannelRange {
2556 chain_hash: chain_hash.clone(),
2557 first_blocknum: 0x01000000,
2558 number_of_blocks: 0xffff_ffff,
2559 sync_complete: true,
2560 short_channel_ids: vec![]
2564 // Empty reply when max valid SCID block num
2565 do_handling_query_channel_range(
2569 chain_hash: chain_hash.clone(),
2570 first_blocknum: 0xffffff,
2571 number_of_blocks: 1,
2576 chain_hash: chain_hash.clone(),
2577 first_blocknum: 0xffffff,
2578 number_of_blocks: 1,
2579 sync_complete: true,
2580 short_channel_ids: vec![]
2585 // No results in valid query range
2586 do_handling_query_channel_range(
2590 chain_hash: chain_hash.clone(),
2591 first_blocknum: 1000,
2592 number_of_blocks: 1000,
2597 chain_hash: chain_hash.clone(),
2598 first_blocknum: 1000,
2599 number_of_blocks: 1000,
2600 sync_complete: true,
2601 short_channel_ids: vec![],
2606 // Overflow first_blocknum + number_of_blocks
2607 do_handling_query_channel_range(
2611 chain_hash: chain_hash.clone(),
2612 first_blocknum: 0xfe0000,
2613 number_of_blocks: 0xffffffff,
2618 chain_hash: chain_hash.clone(),
2619 first_blocknum: 0xfe0000,
2620 number_of_blocks: 0xffffffff - 0xfe0000,
2621 sync_complete: true,
2622 short_channel_ids: vec![
2623 0xfffffe_ffffff_ffff, // max
2629 // Single block exactly full
2630 do_handling_query_channel_range(
2634 chain_hash: chain_hash.clone(),
2635 first_blocknum: 100000,
2636 number_of_blocks: 8000,
2641 chain_hash: chain_hash.clone(),
2642 first_blocknum: 100000,
2643 number_of_blocks: 8000,
2644 sync_complete: true,
2645 short_channel_ids: (100000..=107999)
2646 .map(|block| scid_from_parts(block, 0, 0).unwrap())
2652 // Multiple split on new block
2653 do_handling_query_channel_range(
2657 chain_hash: chain_hash.clone(),
2658 first_blocknum: 100000,
2659 number_of_blocks: 8001,
2664 chain_hash: chain_hash.clone(),
2665 first_blocknum: 100000,
2666 number_of_blocks: 7999,
2667 sync_complete: false,
2668 short_channel_ids: (100000..=107999)
2669 .map(|block| scid_from_parts(block, 0, 0).unwrap())
2673 chain_hash: chain_hash.clone(),
2674 first_blocknum: 107999,
2675 number_of_blocks: 2,
2676 sync_complete: true,
2677 short_channel_ids: vec![
2678 scid_from_parts(108000, 0, 0).unwrap(),
2684 // Multiple split on same block
2685 do_handling_query_channel_range(
2689 chain_hash: chain_hash.clone(),
2690 first_blocknum: 100002,
2691 number_of_blocks: 8000,
2696 chain_hash: chain_hash.clone(),
2697 first_blocknum: 100002,
2698 number_of_blocks: 7999,
2699 sync_complete: false,
2700 short_channel_ids: (100002..=108001)
2701 .map(|block| scid_from_parts(block, 0, 0).unwrap())
2705 chain_hash: chain_hash.clone(),
2706 first_blocknum: 108001,
2707 number_of_blocks: 1,
2708 sync_complete: true,
2709 short_channel_ids: vec![
2710 scid_from_parts(108001, 1, 0).unwrap(),
2717 fn do_handling_query_channel_range(
2718 gossip_sync: &P2PGossipSync<&NetworkGraph<Arc<test_utils::TestLogger>>, Arc<test_utils::TestChainSource>, Arc<test_utils::TestLogger>>,
2719 test_node_id: &PublicKey,
2720 msg: QueryChannelRange,
2722 expected_replies: Vec<ReplyChannelRange>
2724 let mut max_firstblocknum = msg.first_blocknum.saturating_sub(1);
2725 let mut c_lightning_0_9_prev_end_blocknum = max_firstblocknum;
2726 let query_end_blocknum = msg.end_blocknum();
2727 let result = gossip_sync.handle_query_channel_range(test_node_id, msg);
2730 assert!(result.is_ok());
2732 assert!(result.is_err());
2735 let events = gossip_sync.get_and_clear_pending_msg_events();
2736 assert_eq!(events.len(), expected_replies.len());
2738 for i in 0..events.len() {
2739 let expected_reply = &expected_replies[i];
2741 MessageSendEvent::SendReplyChannelRange { node_id, msg } => {
2742 assert_eq!(node_id, test_node_id);
2743 assert_eq!(msg.chain_hash, expected_reply.chain_hash);
2744 assert_eq!(msg.first_blocknum, expected_reply.first_blocknum);
2745 assert_eq!(msg.number_of_blocks, expected_reply.number_of_blocks);
2746 assert_eq!(msg.sync_complete, expected_reply.sync_complete);
2747 assert_eq!(msg.short_channel_ids, expected_reply.short_channel_ids);
2749 // Enforce exactly the sequencing requirements present on c-lightning v0.9.3
2750 assert!(msg.first_blocknum == c_lightning_0_9_prev_end_blocknum || msg.first_blocknum == c_lightning_0_9_prev_end_blocknum.saturating_add(1));
2751 assert!(msg.first_blocknum >= max_firstblocknum);
2752 max_firstblocknum = msg.first_blocknum;
2753 c_lightning_0_9_prev_end_blocknum = msg.first_blocknum.saturating_add(msg.number_of_blocks);
2755 // Check that the last block count is >= the query's end_blocknum
2756 if i == events.len() - 1 {
2757 assert!(msg.first_blocknum.saturating_add(msg.number_of_blocks) >= query_end_blocknum);
2760 _ => panic!("expected MessageSendEvent::SendReplyChannelRange"),
2766 fn handling_query_short_channel_ids() {
2767 let network_graph = create_network_graph();
2768 let (secp_ctx, gossip_sync) = create_gossip_sync(&network_graph);
2769 let node_privkey = &SecretKey::from_slice(&[41; 32]).unwrap();
2770 let node_id = PublicKey::from_secret_key(&secp_ctx, node_privkey);
2772 let chain_hash = genesis_block(Network::Testnet).header.block_hash();
2774 let result = gossip_sync.handle_query_short_channel_ids(&node_id, QueryShortChannelIds {
2776 short_channel_ids: vec![0x0003e8_000000_0000],
2778 assert!(result.is_err());
2782 fn displays_node_alias() {
2783 let format_str_alias = |alias: &str| {
2784 let mut bytes = [0u8; 32];
2785 bytes[..alias.as_bytes().len()].copy_from_slice(alias.as_bytes());
2786 format!("{}", NodeAlias(bytes))
2789 assert_eq!(format_str_alias("I\u{1F496}LDK! \u{26A1}"), "I\u{1F496}LDK! \u{26A1}");
2790 assert_eq!(format_str_alias("I\u{1F496}LDK!\0\u{26A1}"), "I\u{1F496}LDK!");
2791 assert_eq!(format_str_alias("I\u{1F496}LDK!\t\u{26A1}"), "I\u{1F496}LDK!\u{FFFD}\u{26A1}");
2793 let format_bytes_alias = |alias: &[u8]| {
2794 let mut bytes = [0u8; 32];
2795 bytes[..alias.len()].copy_from_slice(alias);
2796 format!("{}", NodeAlias(bytes))
2799 assert_eq!(format_bytes_alias(b"\xFFI <heart> LDK!"), "\u{FFFD}I <heart> LDK!");
2800 assert_eq!(format_bytes_alias(b"\xFFI <heart>\0LDK!"), "\u{FFFD}I <heart>");
2801 assert_eq!(format_bytes_alias(b"\xFFI <heart>\tLDK!"), "\u{FFFD}I <heart>\u{FFFD}LDK!");
2805 #[cfg(all(test, feature = "_bench_unstable"))]
2813 fn read_network_graph(bench: &mut Bencher) {
2814 let logger = ::util::test_utils::TestLogger::new();
2815 let mut d = ::routing::router::test_utils::get_route_file().unwrap();
2816 let mut v = Vec::new();
2817 d.read_to_end(&mut v).unwrap();
2819 let _ = NetworkGraph::read(&mut std::io::Cursor::new(&v), &logger).unwrap();
2824 fn write_network_graph(bench: &mut Bencher) {
2825 let logger = ::util::test_utils::TestLogger::new();
2826 let mut d = ::routing::router::test_utils::get_route_file().unwrap();
2827 let net_graph = NetworkGraph::read(&mut d, &logger).unwrap();
2829 let _ = net_graph.encode();