Struct PeerEntry 

pub struct PeerEntry {
    pub peer_id: PeerId,
    pub addresses: Vec<CandidateAddr>,
    pub connection_class: Option<TraversalKind>,
    pub provenance: Provenance,
    pub quality: PeerQuality,
    pub first_seen: u64,
    pub last_outcome_at: Option<u64>,
    pub connected: bool,
    pub banned: bool,
    /* private fields */
}

One registry entry: identity, reachability, live-link class, provenance, and the learned quality model (SPEC §2.1). Field names are the API contract; private bookkeeping fields are added below.

Fields

peer_id: PeerId

The registry key: peer_id = SHA-256(TLS SPKI DER) (SPEC §1.3, re-used from dig-nat).

addresses: Vec<CandidateAddr>

Dial candidates, byte-compatible with dig-dht provider records / the L7 dig.getPeers shape.

connection_class: Option<TraversalKind>

The dig-nat tier of the live link, if connected — observational only (SPEC §2.1, §7.3).

provenance: Provenance

How this peer entered the registry (strongest-evidence provenance kept — SPEC §2.2).

quality: PeerQuality

The learned quality model (SPEC §3) — MEASURED-only.

first_seen: u64

Unix seconds when first registered.

last_outcome_at: Option<u64>

Unix seconds of the most recent measured outcome, if any.

connected: bool

Whether the peer currently has a live pool link (SPEC §2.3). A disconnected peer is retained (with its quality) but is a weaker eviction-protection candidate.

banned: bool

Whether the peer is banned — ineligible for selection until re-added (SPEC §9.4).

Implementations

impl PeerEntry

pub fn cold(peer_id: PeerId, provenance: Provenance, now: u64) -> Self

A fresh, cold entry for peer_id first seen at now with the given provenance (SPEC §2.3, §3.5). Its quality is cold, so its first selection is exploratory (SPEC §4.4-E).

pub fn is_eligible(&self) -> bool

Whether this peer is eligible for selection: not banned (SPEC §9.4). (Disconnected peers stay eligible — they may be reachable via a fresh dial; only a ban excludes.)

pub fn is_evictable(&self) -> bool

Whether this entry may be evicted under NORMAL pressure: never a connected peer or one with a range in flight (SPEC §2.5). Registry::enforce_capacity prefers this, but falls back to PeerEntry::is_force_evictable when nothing satisfies it, so the capacity bound always holds.

pub fn is_force_evictable(&self) -> bool

Whether this entry may be evicted as a LAST RESORT when no entry satisfies Self::is_evictable (#179 finding 1): still never a currently-connected peer (a live link is never silently dropped), but a disconnected peer’s stuck in_flight no longer protects it. This is what keeps the registry’s capacity bound a hard limit even when every disconnected entry has an unsettled dispatch (SPEC §2.5 “the capacity bound is always enforceable”).

pub fn preferred_address(&self) -> Option<&CandidateAddr>

The most-direct dial address (lowest dig_dht::AddressKind::rank), if any (SPEC §2.1). The registry sorts most-direct-first on demand and never assumes wire order.

Trait Implementations

impl Clone for PeerEntry

fn clone(&self) -> PeerEntry

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PeerEntry

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

Formats the value using the given formatter.