Struct SsaBuilder 

pub struct SsaBuilder<S: PixSpec> {
    pub full_commitment: PixGroup<S>,
    num_polys: usize,
    target_useful_shares: u64,
    builder: PixScalar<S>,
    received_indices: HashSet<PolynomialIndex>,
    early_notified: bool,
}

Reconstruct a single SSA from a set of SSA parts recovered from polynomials.

Fields

full_commitment: PixGroup<S>

num_polys: usize

target_useful_shares: u64

Carried from the negotiated PixParams rather than recomputed. See SsaCommitmentBuilder::target_useful_shares.

builder: PixScalar<S>

received_indices: HashSet<PolynomialIndex>

early_notified: bool

Implementations

impl<S: PixSpec> SsaBuilder<S>

pub fn new( full_commitment: PixGroup<S>, exit_secret_scalar: PixScalar<S>, num_polys: usize, target_useful_shares: u64, ) -> Self

pub fn target_useful_shares(&self) -> u64

Useful shares that constitute full recovery, as negotiated.

pub fn num_polys(&self) -> usize

Number of polynomials this SSA is composed of.

pub fn check_early_threshold(&mut self, threshold: f64) -> bool

Returns true once, when the number of received polynomial parts reaches ceil(threshold * num_polys) for the first time. Subsequent calls return false (idempotent guard — fires at most once per SSA lifecycle).

threshold is assumed finite, which validate_early_recovery_threshold is what makes true — SsaReconstructorConfig is the only source of it, and its constructor validates. The cast below is why that matters rather than being a formality: NaN survives the multiply and the ceil, then saturates to 0, so an unvalidated threshold fires this on the first part instead of the configured fraction of them.

pub fn add_recovered_ssa_part( &mut self, index: PolynomialIndex, sub_secret: PixScalar<S>, ) -> Result<Option<PixScalar<S>>, S::Pseudonym>