Struct ChainStakerSet 

pub struct ChainStakerSet { /* private fields */ }

Chain-backed staker set. Cheap to clone via the shared inner Arc; the runtime holds one Arc<dyn StakerSet> and consumers access the cached set through it. The background loop that keeps the cache fresh is the single shared multiplexed-poller task the runtime owns, so a node-restart cycle never leaks chain-poll tasks.

Trait Implementations

impl Debug for ChainStakerSet

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

Formats the value using the given formatter.

impl StakerSet for ChainStakerSet

fn is_active(&self, node_id: &NodeId) -> bool

Whether node_id is in the active-staker set.

fn active_nodes(&self) -> Vec<NodeId>

Snapshot of the active-staker set. Order is unspecified; the caller MUST randomize before any selection step that an attacker could influence (e.g. bootstrap target picking).

fn len(&self) -> usize

Cardinality of the active set. Default implementation walks Self::active_nodes; production impls (chain-backed cache, etc.) SHOULD override with an O(1) counter.

fn is_empty(&self) -> bool

Convenience over Self::len.