Struct NeighborSyncState 

pub struct NeighborSyncState {
    pub order: Vec<PeerId>,
    pub cursor: usize,
    pub last_sync_times: HashMap<PeerId, Instant>,
    pub bootstrap_claims: HashMap<PeerId, Instant>,
}

Neighbor sync cycle state.

Tracks a deterministic walk through the current close-group snapshot, per-peer cooldown times, and bootstrap claim first-seen timestamps.

Fields

order: Vec<PeerId>

Deterministic ordering of peers for the current cycle (snapshot).

cursor: usize

Current cursor position into order.

last_sync_times: HashMap<PeerId, Instant>

Per-peer last successful sync time (for cooldown).

bootstrap_claims: HashMap<PeerId, Instant>

Bootstrap claim first-seen timestamps per peer.

Entries are removed when a peer passes or fails audit (i.e. stops claiming bootstrap). Under Sybil attack with many distinct peer IDs perpetually claiming bootstrap, this map grows unboundedly. In practice the trust engine limits Sybil impact before this becomes a memory issue.

Implementations

impl NeighborSyncState

pub fn new_cycle(close_neighbors: Vec<PeerId>) -> Self

Create a new cycle from the given close neighbors.

pub fn is_cycle_complete(&self) -> bool

Whether the current cycle is complete.

Trait Implementations

impl Debug for NeighborSyncState

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

Formats the value using the given formatter.