Struct GossipProtocol 

pub struct GossipProtocol {
    pub nodes: HashMap<NodeId, TernaryNode>,
    pub round: u64,
}

Gossip protocol for propagating ternary state across a cluster.

Each round, nodes share their state with random peers. State converges using a “dominant trit” rule: if any peer has a non-zero state, the receiving node adopts the most common non-zero value (with ties broken toward Pos).

Fields

nodes: HashMap<NodeId, TernaryNode>

round: u64

Implementations

impl GossipProtocol

pub fn new() -> Self

pub fn add_node(&mut self, node: TernaryNode)

pub fn run_round(&mut self) -> u32

pub fn run_until_converged(&mut self, max_rounds: u64) -> u64

pub fn is_converged(&self) -> bool

Trait Implementations

impl Clone for GossipProtocol

fn clone(&self) -> GossipProtocol

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GossipProtocol

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

Formats the value using the given formatter.