Struct SsaClientCommitmentMessage 

pub struct SsaClientCommitmentMessage<I, G, K> {
    pub session_id: I,
    pub ssa_index: SsaIndex,
    pub coefficient_index: u16,
    pub commitment_proof: Option<K>,
    pub coefficient_commitments: HashMap<PolynomialIndex, G>,
}

Filling up the Client’s commitment to the Session Stealth Address (SSA).

The generic argument G typically represents a PixGroupRepr.

The overall Client’s commitment to a single new SSA usually requires multiple messages, all sharing the same SsaIndex.

Each of these messages contains commitments to polynomial coefficients that all belong to the same coefficient in each polynomial.

In practice every message carries coefficient_index == 0: PIX commits to each polynomial’s constant term and nothing else, so the constant-term pass is the whole commitment. The field (and phase 2 of new_multiple, which now has nothing to emit) is retained because the wire format still admits higher coefficient indices; a peer that sends them merely wastes bandwidth, since the receiver ignores them.

See hopr_protocol_pix::SsaPartCommitment for why the non-constant coefficient commitments were dropped and what that costs.

Fields

session_id: I

Session ID.

ssa_index: SsaIndex

Index of the Session Stealth Address (SSA) that is being committed.

coefficient_index: u16

Index of the polynomial coefficient that is being committed.

Zero value indicates the polynomial constant term commitment, which when summed over all polynomials for a given SsaIndex results in the Client’s SSA commitment.

This is always zero in practice — see the type-level documentation.

commitment_proof: Option<K>

Proof that the Client knows the discrete logarithm of its SSA commitment.

Present exactly when coefficient_index == 0: the commitment it opens is the sum of all constant terms, so it belongs with the messages that deliver them, and there is no separate presence flag on the wire — the coefficient index decides it. Every constant-term message carries it rather than only one, so no single lost packet can strand a cycle that would otherwise be recoverable, and the receiver keeps the first it sees.

Without it the receiver cannot distinguish a genuine commitment from one crafted so the combined deposit key is known to the sender alone. See hopr_protocol_pix::SsaCommitmentProof.

coefficient_commitments: HashMap<PolynomialIndex, G>

Contains the serialized coefficient commitments of multiple polynomials, all belonging to the same coefficient_index in each polynomial.

This might not be the complete set yet and might require multiple messages to deliver the complete commitment to the given coefficient of all polynomials for the given SSA.

Implementations

impl<I: Serialize + Clone, G: Clone, K: Clone> SsaClientCommitmentMessage<I, G, K>

pub fn new_multiple<S: PixSpec>( session_id: I, commitment: SsaCommitment<S, S::Pseudonym>, ) -> Result<Vec<Self>, StartProtocolError>

where G: From<PixGroupRepr<S>>, K: From<SsaCommitmentProof<S>>,

Uses given the session_id and an SsaCommitment that will be split across multiple messages.

The returned messages are ordered by coefficient index, making sure the constant terms of the polynomials are delivered first.

Trait Implementations

impl<I: Clone, G: Clone, K: Clone> Clone for SsaClientCommitmentMessage<I, G, K>

fn clone(&self) -> SsaClientCommitmentMessage<I, G, K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug, G: Debug, K: Debug> Debug for SsaClientCommitmentMessage<I, G, K>

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

Formats the value using the given formatter.

impl<I: Eq, G: Eq, K: Eq> Eq for SsaClientCommitmentMessage<I, G, K>

impl<I: PartialEq, G: PartialEq, K: PartialEq> PartialEq for SsaClientCommitmentMessage<I, G, K>

fn eq(&self, other: &SsaClientCommitmentMessage<I, G, K>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<I: PartialEq, G: PartialEq, K: PartialEq> StructuralPartialEq for SsaClientCommitmentMessage<I, G, K>