Skip to main content

P2PNode

Struct P2PNode 

Source
pub struct P2PNode {
    pub security_dashboard: Option<Arc<SecurityDashboard>>,
    /* private fields */
}
Expand description

Main P2P node structure Main P2P network node that manages connections, routing, and communication

This struct represents a complete P2P network participant that can:

  • Connect to other peers via QUIC transport
  • Participate in distributed hash table (DHT) operations
  • Send and receive messages through various protocols
  • Handle network events and peer lifecycle
  • Provide MCP (Model Context Protocol) services

Fields§

§security_dashboard: Option<Arc<SecurityDashboard>>

Security dashboard for monitoring

Implementations§

Source§

impl P2PNode

Source

pub fn new_for_tests() -> Result<Self>

Minimal constructor for tests that avoids real networking

Source

pub async fn new(config: NodeConfig) -> Result<Self>

Create a new P2P node with the given configuration

Source

pub fn builder() -> NodeBuilder

Create a new node builder

Source

pub fn peer_id(&self) -> &PeerId

Get the peer ID of this node

Source

pub fn transport_peer_id(&self) -> Option<String>

Get the hex-encoded transport-level peer ID.

This is the ID used in P2PEvent::Message.source, connected_peers(), and send_message(). It differs from peer_id() which is the app-level ID.

Returns the transport peer ID from whichever stack (v4 or v6) is active.

Source

pub fn local_addr(&self) -> Option<String>

Source

pub async fn subscribe(&self, topic: &str) -> Result<()>

Source

pub async fn publish(&self, topic: &str, data: &[u8]) -> Result<()>

Source

pub fn config(&self) -> &NodeConfig

Get the node configuration

Source

pub async fn start(&self) -> Result<()>

Start the P2P node

Source

pub async fn run(&self) -> Result<()>

Run the P2P node (blocks until shutdown)

Source

pub async fn stop(&self) -> Result<()>

Stop the P2P node

Source

pub async fn shutdown(&self) -> Result<()>

Graceful shutdown alias for tests

Source

pub async fn is_running(&self) -> bool

Check if the node is running

Source

pub async fn listen_addrs(&self) -> Vec<SocketAddr>

Get the current listen addresses

Source

pub async fn connected_peers(&self) -> Vec<PeerId>

Get connected peers

Source

pub async fn peer_count(&self) -> usize

Get peer count

Source

pub async fn peer_info(&self, peer_id: &PeerId) -> Option<PeerInfo>

Get peer info

Source

pub async fn get_peer_id_by_address(&self, addr: &str) -> Option<PeerId>

Get the peer ID for a given socket address, if connected

This method searches through all connected peers to find one that has the specified address in its address list.

§Arguments
  • addr - The socket address to search for (e.g., “192.168.1.100:9000”)
§Returns
  • Some(PeerId) - The peer ID if a matching connected peer is found
  • None - If no peer with this address is currently connected
Source

pub async fn list_active_connections(&self) -> Vec<(PeerId, Vec<String>)>

List all active connections with their peer IDs and addresses

§Returns

A vector of tuples containing (PeerId, Vec) where the Vec contains all known addresses for that peer.

Source

pub async fn remove_peer(&self, peer_id: &PeerId) -> bool

Remove a peer from the peers map

This method removes a peer from the internal peers map. It should be used when a connection is no longer valid (e.g., after detecting that the underlying ant-quic connection has closed).

§Arguments
  • peer_id - The ID of the peer to remove
§Returns

true if the peer was found and removed, false if the peer was not in the map

Source

pub async fn is_peer_connected(&self, peer_id: &PeerId) -> bool

Check if a peer is connected

This method checks if the peer ID exists in the peers map. Note that this only verifies the peer is registered - it does not guarantee the underlying ant-quic connection is still active. For connection validation, use send_message which will fail if the connection is closed.

§Arguments
  • peer_id - The ID of the peer to check
§Returns

true if the peer exists in the peers map, false otherwise

Source

pub async fn connect_peer(&self, address: &str) -> Result<PeerId>

Connect to a peer

Source

pub async fn disconnect_peer(&self, peer_id: &PeerId) -> Result<()>

Disconnect from a peer

Actively closes the underlying QUIC connection via P2pEndpoint::disconnect() and removes the peer from all local tracking maps.

Source

pub async fn is_connection_active(&self, peer_id: &str) -> bool

Check if a connection to a peer is active

Source

pub async fn send_message( &self, peer_id: &PeerId, protocol: &str, data: Vec<u8>, ) -> Result<()>

Send a message to a peer

Source§

impl P2PNode

Source

pub fn subscribe_events(&self) -> Receiver<P2PEvent>

Subscribe to network events

Source

pub fn events(&self) -> Receiver<P2PEvent>

Backwards-compat event stream accessor for tests

Source

pub fn uptime(&self) -> Duration

Get node uptime

Source

pub fn binary_hash(&self) -> &[u8; 32]

Get this node’s binary hash used for attestation.

Source

pub fn entangled_id(&self) -> Option<&EntangledId>

Get this node’s entangled identity, if set.

Source

pub fn set_entangled_id(&mut self, entangled_id: EntangledId)

Set the entangled identity for this node.

This should be called after the node’s cryptographic identity is established, typically by deriving from the NodeIdentity’s public key.

Source

pub fn verify_peer_attestation( &self, peer_id: &str, peer_entangled_id: &EntangledId, peer_public_key: &MlDsaPublicKey, ) -> EnforcementDecision

Verify a peer’s attestation and return the enforcement decision.

This function implements the Entangled Attestation verification protocol (Phase 6: Hard Enforcement). Based on the configured enforcement mode:

  • Off: Skips verification entirely
  • Soft: Logs warnings but allows connections
  • Hard: Rejects connections with invalid attestations
§Arguments
  • peer_id - The peer’s identifier for logging
  • peer_entangled_id - The peer’s claimed entangled ID
  • peer_public_key - The peer’s ML-DSA public key
§Returns

An [EnforcementDecision] indicating whether to allow or reject the connection.

§Example
let decision = node.verify_peer_attestation(peer_id, &entangled_id, &public_key);
if decision.should_reject() {
    // Send rejection message and close connection
    if let Some(rejection) = decision.rejection() {
        send_rejection(peer_id, rejection);
    }
    disconnect(peer_id);
}
Source

pub fn verify_peer_attestation_simple( &self, peer_id: &str, peer_entangled_id: &EntangledId, peer_public_key: &MlDsaPublicKey, ) -> bool

Verify a peer’s attestation and return a simple boolean result.

This is a convenience method that wraps [verify_peer_attestation] for cases where only a pass/fail result is needed without the detailed decision.

§Returns

true if the connection should be allowed, false if it should be rejected.

Source

pub async fn resource_metrics(&self) -> Result<ResourceMetrics>

Get production resource metrics

Source

pub async fn health_check(&self) -> Result<()>

Check system health

Source

pub fn production_config(&self) -> Option<&ProductionConfig>

Get production configuration (if enabled)

Source

pub fn is_production_mode(&self) -> bool

Check if production hardening is enabled

Source

pub fn dht(&self) -> Option<&Arc<RwLock<DHT>>>

Get DHT reference

Source

pub async fn dht_put(&self, key: Key, value: Vec<u8>) -> Result<()>

Store a value in the DHT

Source

pub async fn dht_get(&self, key: Key) -> Result<Option<Vec<u8>>>

Retrieve a value from the DHT

Source

pub async fn add_discovered_peer( &self, peer_id: PeerId, addresses: Vec<String>, ) -> Result<()>

Add a discovered peer to the bootstrap cache

Source

pub async fn update_peer_metrics( &self, peer_id: &PeerId, success: bool, latency_ms: Option<u64>, _error: Option<String>, ) -> Result<()>

Update connection metrics for a peer in the bootstrap cache

Source

pub async fn get_bootstrap_cache_stats(&self) -> Result<Option<CacheStats>>

Get bootstrap cache statistics

Source

pub async fn cached_peer_count(&self) -> usize

Get the number of cached bootstrap peers

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

Source§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

Source§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

Source§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> Conv for T

Source§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
Source§

impl<T> FmtForward for T

Source§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
Source§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
Source§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
Source§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
Source§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
Source§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
Source§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
Source§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
Source§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Pipe for T
where T: ?Sized,

Source§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
Source§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
Source§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
Source§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
Source§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
Source§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
Source§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
Source§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
Source§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
Source§

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> Tap for T

Source§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
Source§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
Source§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
Source§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
Source§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
Source§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
Source§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
Source§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
Source§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
Source§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
Source§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
Source§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
Source§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
Source§

impl<T> TryConv for T

Source§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

impl<A, B, T> HttpServerConnExec<A, B> for T
where B: Body,