Struct CommitmentList 

pub struct CommitmentList { /* private fields */ }

A Feldman-style commitment list to a VSS polynomial: C_k = a_k · B for each coefficient a_k. Reveal nothing about the secret beyond what the public key already does (since C_0 = A, the public key), but let recipients verify that a share f(i) is consistent with the committed polynomial via f(i)·B == Σ_k i^k · C_k.

Implementations

impl CommitmentList

pub fn from_bytes(commits: Vec<[u8; 32]>) -> Self

Build from already-encoded commitment bytes.

pub fn commit(poly: &Polynomial) -> Self

Build by committing each coefficient of poly to the base point.

pub fn public_key_bytes(&self) -> [u8; 32]

The aggregate public key A = C_0 = a_0 · B as compressed bytes.

pub fn as_bytes(&self) -> &[[u8; 32]]

The full commitment list as compressed-point bytes.

pub fn verify_share(&self, participant: u32, share: &Scalar) -> bool

Verify a share s_i claimed to be f(i) for the polynomial this list commits to. Returns true iff s_i · B == Σ_k i^k · C_k.

Trait Implementations

impl Clone for CommitmentList

fn clone(&self) -> CommitmentList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CommitmentList

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

Formats the value using the given formatter.

impl Eq for CommitmentList

impl PartialEq for CommitmentList

fn eq(&self, other: &CommitmentList) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for CommitmentList