Struct ConfigStakerSet 

pub struct ConfigStakerSet { /* private fields */ }

In-memory StakerSet implementation, built from a parsed NodeId set or empty.

The runtime wires the chain-backed ChainStakerSet (reads CapacityBond.getRegisteredNodes() once at startup, then follows the registry’s membership events via the shared eth_getLogs poll) — see capacity_bond_registry::bootstrap, #1110. This impl is what tests and explicit operator-supplied sets use: construct via Self::new with a known HashSet, or Self::empty. It implements the same StakerSet trait as the chain-backed impl, so the two are interchangeable.

Implementations

impl ConfigStakerSet

pub const fn new(active: HashSet<NodeId>) -> Self

Build from a parsed NodeId set.

pub fn empty() -> Self

Empty set — useful in tests where no staker check is desired (paired with a permissive handler config). Production code MUST NOT use this without an explicit operator opt-in; an empty staker set means every Store is rejected.

Trait Implementations

impl Debug for ConfigStakerSet

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

Formats the value using the given formatter.

impl StakerSet for ConfigStakerSet

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.