Struct RecoveredSsaTail 

pub(crate) struct RecoveredSsaTail {
    ssa_index: SsaIndex,
    num_polys: usize,
    counters: Arc<RecoveryCounters>,
    surplus_budget: SurplusBudget,
}

Minimal state retained after cryptographic recovery so buffered, already-paid SURBs can finish draining.

There is no polynomial, commitment, share set, or recovered secret here. The only mutable state is an absolute progress counter and one bounded counter per polynomial. The latter is security-critical: a cycle-wide allowance would let an Entry replay one completed polynomial and spend the surplus budget belonging to every other polynomial.

The polynomial commitment is deliberately not retained, so this path cannot prove that a new evaluation belongs to the recovered polynomial. It therefore grants liveness only, never useful/payment progress, and only from the per-polynomial allowance already included in the cycle’s paid quota. The supervisor independently caps the aggregate at the negotiated full-cycle volume. Those bounds, rather than an authentication claim this compact state cannot make, are what prevent an Entry-selected non-zero evaluation from buying unbounded service.

Fields

ssa_index: SsaIndex

num_polys: usize

counters: Arc<RecoveryCounters>

surplus_budget: SurplusBudget

Implementations

impl RecoveredSsaTail

pub(crate) fn ssa_index(&self) -> SsaIndex

pub(crate) fn credit_share<S: PixSpec>( &self, ssa_id: SsaId<S::Pseudonym>, poly_index: PolynomialIndex, msg: PixScalar<S>, share: &PartialSsaShare<S>, ) -> Result<RecoveredTailCredit<S::Pseudonym>, S::Pseudonym>

Trait Implementations

impl Clone for RecoveredSsaTail

fn clone(&self) -> RecoveredSsaTail

Returns a duplicate of the value.

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

Performs copy-assignment from source.