Struct BackwardPassStep 

pub struct BackwardPassStep {
    pub node_id: String,
    pub op: String,
    pub peer_contributions: HashMap<String, BackwardStepStatus>,
    pub aggregated_gradient_cid: Option<String>,
    pub started_at: Instant,
}

Tracks one layer’s backward pass across multiple peers

Fields

node_id: String

Node (layer) identifier

op: String

Operation type (e.g. “matmul”, “relu”)

peer_contributions: HashMap<String, BackwardStepStatus>

Per-peer status map

aggregated_gradient_cid: Option<String>

CID of the aggregated gradient (set after aggregation)

started_at: Instant

Wall-clock start time of this step

Implementations

impl BackwardPassStep

pub fn new(node_id: String, op: String) -> Self

Create a new step with no peers yet

pub fn add_peer(&mut self, peer_id: &str)

Register a new peer as a contributor for this step

pub fn record_gradient_received(&mut self, peer_id: &str, cid: &str)

Record that a gradient CID was received from peer_id

pub fn record_gradient_failed(&mut self, peer_id: &str, reason: &str)

Record a failure for peer_id

pub fn is_complete(&self) -> bool

Returns true when every peer has either received or failed

pub fn ready_to_aggregate(&self) -> bool

Returns true when all peers have received (no pending/failed)

pub fn received_count(&self) -> usize

Number of peers whose gradient has been received

pub fn failed_count(&self) -> usize

Number of peers that have failed

Trait Implementations

impl Debug for BackwardPassStep

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

Formats the value using the given formatter.