Struct Node 

pub struct Node {
    pub probe: Probe,
    pub validators: Vec<Validator>,
    pub chain: Chain,
    pub mempool: Mempool,
    pub max_block_txs: usize,
    pub live_beacon: Option<String>,
}

A network participant.

Fields

probe: Probe

This node’s post-quantum identity.

validators: Vec<Validator>

The validator set (shared, agreed configuration).

chain: Chain

This node’s view of the chain.

mempool: Mempool

Pending transactions.

max_block_txs: usize

Max transactions per block.

live_beacon: Option<String>

A live beacon value fetched externally for the current round, if any (see entropa_core::beacon::sample_live). Set this once per round before calling is_proposer/try_produce so both see the identical value — fetching live separately in each would risk straddling a beacon update between the two calls. None falls back to the deterministic beacon::sample(round).

Implementations

impl Node

pub fn new(probe: Probe, validators: Vec<Validator>) -> Self

pub fn submit(&mut self, tx: Transaction)

Submit a transaction into this node’s mempool.

pub fn is_proposer(&self, round: u64) -> bool

Am I the beacon-selected proposer for round?

pub fn try_produce(&mut self, round: u64, timestamp: u64) -> Option<Block>

If this node is the beacon-selected proposer for round, drain the mempool, produce and append the next block, and return it for broadcast. Otherwise None.

pub fn accept(&mut self, block: Block) -> Result<(), NodeError>

Accept a peer’s block: enforce the consensus rule (correct proposer for the block’s beacon), then full structural + post-quantum validation.

pub fn height(&self) -> usize