Struct blsttc::poly::BivarPoly

pub struct BivarPoly { /* fields omitted */ }

A symmetric bivariate polynomial in the prime field.

This can be used for Verifiable Secret Sharing and Distributed Key Generation. See the module documentation for details.

Implementations

impl BivarPoly

pub fn random<R: Rng>(degree: usize, rng: &mut R) -> Self

Creates a random polynomial.

Panics

Panics if the degree is too high for the coefficients to fit into a Vec.

pub fn try_random<R: Rng>(degree: usize, rng: &mut R) -> Result<Self>

Creates a random polynomial.

pub fn degree(&self) -> usize

Returns the polynomial’s degree; which is the same in both variables.

pub fn evaluate<T: IntoFr>(&self, x: T, y: T) -> Fr

Returns the polynomial’s value at the point (x, y).

pub fn row<T: IntoFr>(&self, x: T) -> Poly

Returns the x-th row, as a univariate polynomial.

pub fn commitment(&self) -> BivarCommitment

Returns the corresponding commitment. That information can be shared publicly.

pub fn reveal(&self) -> String

Generates a non-redacted debug string. This method differs from the Debug implementation in that it does leak the the struct’s internal state.

Trait Implementations

impl Clone for BivarPoly

fn clone(&self) -> BivarPoly

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BivarPoly

A debug statement where the coeff vector has been redacted.

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

Formats the value using the given formatter.

impl Drop for BivarPoly

fn drop(&mut self)

Executes the destructor for this type.

impl Zeroize for BivarPoly

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.