Struct BackwardPassCoordinator 

pub struct BackwardPassCoordinator { /* private fields */ }

Coordinates gradient collection and aggregation across peers.

Implementations

impl BackwardPassCoordinator

pub fn new(expected_peers: usize, timeout_ms: u64) -> Self

pub fn start_pass(&self, pass_id: BackwardPassId) -> bool

Start a new backward pass round. Returns false if pass_id already exists.

pub fn submit_contribution( &self, contribution: GradientContribution, ) -> Result<CoordinationStatus, CoordinationError>

Submit a gradient contribution for a pass.

Returns an error if the pass is not found or is already Complete/Failed.

pub fn is_ready_to_aggregate(&self, pass_id: &BackwardPassId) -> bool

Returns true when all expected peers have submitted contributions.

pub fn mark_complete( &self, pass_id: &BackwardPassId, aggregated_cid: impl Into<String>, ) -> bool

Mark aggregation as complete with result CID.

pub fn mark_failed( &self, pass_id: &BackwardPassId, reason: impl Into<String>, ) -> bool

Mark pass as failed with a reason string.

pub fn status(&self, pass_id: &BackwardPassId) -> Option<CoordinationStatus>

Get current status of a pass.

pub fn contributions( &self, pass_id: &BackwardPassId, ) -> Vec<GradientContribution>

Get all contributions for a pass.

pub fn active_count(&self) -> usize

Total active (non-complete, non-failed) passes.

pub fn gc_before_round(&self, round: u64) -> usize

Remove completed/failed passes with pass_id.round < round. Returns the number of passes removed.

pub fn timeout_ms(&self) -> u64

Expose timeout setting (useful for callers).