Struct SsaRecoveryProgress 

pub struct SsaRecoveryProgress<P> {
    pub ssa_id: SsaId<P>,
    pub useful_shares: u64,
    pub shares_seen: u64,
    pub target_useful_shares: u64,
    pub recovered_polynomials: u16,
}

Absolute recovery progress for a single SSA cycle.

Carries running totals rather than per-batch deltas, so a consumer can detect a stall, a completion, or a protocol violation without having received every snapshot. That matters because acknowledgement batches are processed concurrently: snapshots can arrive out of order, and one may be dropped under load. A consumer should keep the maximum it has seen and treat a lower or repeated useful_shares as benign noise.

P is the pseudonym type.

Fields

ssa_id: SsaId<P>

The SSA this snapshot describes.

useful_shares: u64

Shares that advanced reconstruction — verified, distinct, and below their polynomial’s threshold when they arrived. Excludes duplicates and the surplus a conforming Entry sends.

The payment counter: what the Exit can eventually be paid for, and the right input to a consumer’s accounting. It is the wrong input to a liveness check — see shares_seen.

shares_seen: u64

Shares accepted for this cycle whether or not they advanced it. Always at least useful_shares.

The liveness counter: evidence that the Entry is still serving this cycle. The two differ by more than a rounding error, and conflating them has a specific failure mode. A conforming Entry emits threshold + surplus shares per polynomial across a window advancing in lockstep, so every window ends with surplus × window consecutive shares that advance nothing — 4096 packets at the deployed dimensions. A consumer that treats “no useful share” as “the Entry has gone quiet” will act on that run, and if the action is to withhold service it removes the only thing that could have produced the next useful share.

So: bound service and idleness on this, and decide payment on useful_shares.

target_useful_shares: u64

Useful shares that constitute full recovery: polynomials × threshold.

A consumer that negotiated the dimensions can compare this against its own expectation; a mismatch is a protocol violation rather than drift.

recovered_polynomials: u16

Polynomial parts that have reconstructed and opened their commitment.

Trait Implementations

impl<P: Clone> Clone for SsaRecoveryProgress<P>

fn clone(&self) -> SsaRecoveryProgress<P>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Copy> Copy for SsaRecoveryProgress<P>

impl<P: Debug> Debug for SsaRecoveryProgress<P>

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

Formats the value using the given formatter.

impl<P: Eq> Eq for SsaRecoveryProgress<P>

impl<P: Hash> Hash for SsaRecoveryProgress<P>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<P: PartialEq> PartialEq for SsaRecoveryProgress<P>

fn eq(&self, other: &SsaRecoveryProgress<P>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<P: PartialEq> StructuralPartialEq for SsaRecoveryProgress<P>