Struct LagrangePolynomial 

pub struct LagrangePolynomial<I, O> {
    pub evaluations: Vec<Evaluation<I, O>>,
}

Fields

evaluations: Vec<Evaluation<I, O>>

Implementations

impl<I, O> LagrangePolynomial<I, O>

pub fn new(evaluations: Vec<Evaluation<I, O>>) -> Self

The evaluations are expected to have distinct input values. If two or more evaluations reuse the same input, evaluation and share-issuance will cause panics.

impl LagrangePolynomial<MaybeScalar, MaybeScalar>

pub fn issue_share(&self, x: MaybeScalar) -> SecretShare

Issue a share at the given input x.

impl LagrangePolynomial<MaybeScalar, MaybePoint>

pub fn issue_share(&self, x: MaybeScalar) -> PointShare

Issue a share at the given input x.

impl LagrangePolynomial<MaybeScalar, MaybePoint>

pub fn derive_secret(&self, x: MaybeScalar) -> [u8; 32]

Derive a secret c by hashing the output point produced by evaluating the polynomial on x.

Trait Implementations

impl Mul<&LagrangePolynomial<MaybeScalar, MaybeScalar>> for G

Allows multiplying an interpolated secret-sharing polynomial by the secp256k1 generator point.

type Output = LagrangePolynomial<MaybeScalar, MaybePoint>

The resulting type after applying the * operator.

fn mul(self, rhs: &InterpolatedSecretPolynomial) -> Self::Output

Performs the * operation.

impl Mul<&LagrangePolynomial<MaybeScalar, MaybeScalar>> for Point

Allows multiplying an interpolated secret-sharing polynomial by a given fixed point.

type Output = LagrangePolynomial<MaybeScalar, MaybePoint>

The resulting type after applying the * operator.

fn mul(self, rhs: &InterpolatedSecretPolynomial) -> Self::Output

Performs the * operation.

impl Mul<LagrangePolynomial<MaybeScalar, MaybeScalar>> for G

type Output = LagrangePolynomial<MaybeScalar, MaybePoint>

The resulting type after applying the * operator.

fn mul(self, rhs: InterpolatedSecretPolynomial) -> Self::Output

Performs the * operation.

impl Mul<LagrangePolynomial<MaybeScalar, MaybeScalar>> for Point

type Output = LagrangePolynomial<MaybeScalar, MaybePoint>

The resulting type after applying the * operator.

fn mul(self, rhs: InterpolatedSecretPolynomial) -> Self::Output

Performs the * operation.

impl<I, O> Polynomial<I, O> for LagrangePolynomial<I, O>

where I: Copy + PartialEq + One + Zero + Sub<I, Output = I> + UnsafeDiv<I, Output = I> + Mul<I, Output = I>, O: Copy + Zero + Mul<I, Output = O> + Add<O, Output = O>,

fn evaluate(&self, x: I) -> O

Evaluate the polynomial on a given input.

fn degree(&self) -> usize

Returns the degree of the polynomial, which is usually the number of coefficients minus 1. If the polynomial has no coefficients, it has degree zero.

fn interpolation_threshold(&self) -> usize

Returns the number of evaluations needed to interpolate this polynomial, which is just the number of coefficients in the polynomial.