Struct breez_sdk_core::lightning::routing::gossip::NetworkGraph

pub struct NetworkGraph<L>
where
    L: Deref,
    <L as Deref>::Target: Logger,
{ /* private fields */ }

Represents the network as nodes and channels between them

Implementations

impl<L> NetworkGraph<L>

where L: Deref, <L as Deref>::Target: Logger,

pub fn handle_network_update(&self, network_update: &NetworkUpdate)

Handles any network updates originating from Events. Note that this will skip applying any NetworkUpdate::ChannelUpdateMessage to avoid leaking possibly identifying information of the sender to the public network.

pub fn get_chain_hash(&self) -> ChainHash

Gets the chain hash for this network graph.

impl<L> NetworkGraph<L>

where L: Deref, <L as Deref>::Target: Logger,

pub fn new(network: Network, logger: L) -> NetworkGraph<L>

Creates a new, empty, network graph.

pub fn read_only(&self) -> ReadOnlyNetworkGraph<'_>

Returns a read-only view of the network graph.

pub fn get_last_rapid_gossip_sync_timestamp(&self) -> Option<u32>

The unix timestamp provided by the most recent rapid gossip sync. It will be set by the rapid sync process after every sync completion.

pub fn set_last_rapid_gossip_sync_timestamp( &self, last_rapid_gossip_sync_timestamp: u32, )

Update the unix timestamp provided by the most recent rapid gossip sync. This should be done automatically by the rapid sync process after every sync completion.

pub fn update_node_from_announcement( &self, msg: &NodeAnnouncement, ) -> Result<(), LightningError>

For an already known node (from channel announcements), update its stored properties from a given node announcement.

You probably don’t want to call this directly, instead relying on a P2PGossipSync’s RoutingMessageHandler implementation to call it indirectly. This may be useful to accept routing messages from a source using a protocol other than the lightning P2P protocol.

pub fn update_node_from_unsigned_announcement( &self, msg: &UnsignedNodeAnnouncement, ) -> Result<(), LightningError>

For an already known node (from channel announcements), update its stored properties from a given node announcement without verifying the associated signatures. Because we aren’t given the associated signatures here we cannot relay the node announcement to any of our peers.

pub fn update_channel_from_announcement<U>( &self, msg: &ChannelAnnouncement, utxo_lookup: &Option<U>, ) -> Result<(), LightningError>

where U: Deref, <U as Deref>::Target: UtxoLookup,

Store or update channel info from a channel announcement.

You probably don’t want to call this directly, instead relying on a P2PGossipSync’s RoutingMessageHandler implementation to call it indirectly. This may be useful to accept routing messages from a source using a protocol other than the lightning P2P protocol.

If a UtxoLookup object is provided via utxo_lookup, it will be called to verify the corresponding UTXO exists on chain and is correctly-formatted.

pub fn update_channel_from_announcement_no_lookup( &self, msg: &ChannelAnnouncement, ) -> Result<(), LightningError>

Store or update channel info from a channel announcement.

You probably don’t want to call this directly, instead relying on a P2PGossipSync’s RoutingMessageHandler implementation to call it indirectly. This may be useful to accept routing messages from a source using a protocol other than the lightning P2P protocol.

This will skip verification of if the channel is actually on-chain.

pub fn update_channel_from_unsigned_announcement<U>( &self, msg: &UnsignedChannelAnnouncement, utxo_lookup: &Option<U>, ) -> Result<(), LightningError>

where U: Deref, <U as Deref>::Target: UtxoLookup,

Store or update channel info from a channel announcement without verifying the associated signatures. Because we aren’t given the associated signatures here we cannot relay the channel announcement to any of our peers.

If a UtxoLookup object is provided via utxo_lookup, it will be called to verify the corresponding UTXO exists on chain and is correctly-formatted.

pub fn add_channel_from_partial_announcement( &self, short_channel_id: u64, timestamp: u64, features: Features<ChannelContext>, node_id_1: PublicKey, node_id_2: PublicKey, ) -> Result<(), LightningError>

Update channel from partial announcement data received via rapid gossip sync

timestamp: u64: Timestamp emulating the backdated original announcement receipt (by the rapid gossip sync server)

All other parameters as used in msgs::UnsignedChannelAnnouncement fields.

pub fn channel_failed_permanent(&self, short_channel_id: u64)

Marks a channel in the graph as failed permanently.

The channel and any node for which this was their last channel are removed from the graph.

pub fn node_failed_permanent(&self, node_id: &PublicKey)

Marks a node in the graph as permanently failed, effectively removing it and its channels from local storage.

pub fn remove_stale_channels_and_tracking(&self)

Removes information about channels that we haven’t heard any updates about in some time. This can be used regularly to prune the network graph of channels that likely no longer exist.

While there is no formal requirement that nodes regularly re-broadcast their channel updates every two weeks, the non-normative section of BOLT 7 currently suggests that pruning occur for updates which are at least two weeks old, which we implement here.

Note that for users of the lightning-background-processor crate this method may be automatically called regularly for you.

This method will also cause us to stop tracking removed nodes and channels if they have been in the map for a while so that these can be resynced from gossip in the future.

This method is only available with the std feature. See NetworkGraph::remove_stale_channels_and_tracking_with_time for no-std use.

pub fn remove_stale_channels_and_tracking_with_time( &self, current_time_unix: u64, )

Removes information about channels that we haven’t heard any updates about in some time. This can be used regularly to prune the network graph of channels that likely no longer exist.

While there is no formal requirement that nodes regularly re-broadcast their channel updates every two weeks, the non-normative section of BOLT 7 currently suggests that pruning occur for updates which are at least two weeks old, which we implement here.

This method will also cause us to stop tracking removed nodes and channels if they have been in the map for a while so that these can be resynced from gossip in the future.

This function takes the current unix time as an argument. For users with the std feature enabled, NetworkGraph::remove_stale_channels_and_tracking may be preferable.

pub fn update_channel(&self, msg: &ChannelUpdate) -> Result<(), LightningError>

For an already known (from announcement) channel, update info about one of the directions of the channel.

You probably don’t want to call this directly, instead relying on a P2PGossipSync’s RoutingMessageHandler implementation to call it indirectly. This may be useful to accept routing messages from a source using a protocol other than the lightning P2P protocol.

If built with no-std, any updates with a timestamp more than two weeks in the past or materially in the future will be rejected.

pub fn update_channel_unsigned( &self, msg: &UnsignedChannelUpdate, ) -> Result<(), LightningError>

For an already known (from announcement) channel, update info about one of the directions of the channel without verifying the associated signatures. Because we aren’t given the associated signatures here we cannot relay the channel update to any of our peers.

If built with no-std, any updates with a timestamp more than two weeks in the past or materially in the future will be rejected.

pub fn verify_channel_update( &self, msg: &ChannelUpdate, ) -> Result<(), LightningError>

For an already known (from announcement) channel, verify the given ChannelUpdate.

This checks whether the update currently is applicable by Self::update_channel.

If built with no-std, any updates with a timestamp more than two weeks in the past or materially in the future will be rejected.

Trait Implementations

impl<L> Display for NetworkGraph<L>

where L: Deref, <L as Deref>::Target: Logger,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<L> PartialEq for NetworkGraph<L>

where L: Deref, <L as Deref>::Target: Logger,

fn eq(&self, other: &NetworkGraph<L>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<L> ReadableArgs<L> for NetworkGraph<L>

where L: Deref, <L as Deref>::Target: Logger,

fn read<R>(reader: &mut R, logger: L) -> Result<NetworkGraph<L>, DecodeError>

where R: Read,

Reads a Self in from the given Read.

impl<L> Writeable for NetworkGraph<L>

where L: Deref, <L as Deref>::Target: Logger,

fn write<W>(&self, writer: &mut W) -> Result<(), Error>

where W: Writer,

Writes self out to the given Writer.

fn encode(&self) -> Vec<u8>

Writes self out to a Vec<u8>.

fn serialized_length(&self) -> usize

Gets the length of this object after it has been serialized. This can be overridden to optimize cases where we prepend an object with its length.

impl<L> Eq for NetworkGraph<L>

where L: Deref, <L as Deref>::Target: Logger,