Struct Poly 

pub struct Poly<C>(/* private fields */);

A polynomial that is using a scalar for the variable x and a generic element for the coefficients. The coefficients must be able to multiply the type of the variable, which is always a scalar.

Implementations

impl<C> Poly<C>

pub fn degree(&self) -> usize

Returns the degree of the polynomial

impl<C: Element> Poly<C>

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

Returns a new polynomial of the given degree where each coefficients is sampled at random from the given RNG. In the context of secret sharing, the threshold is the degree + 1.

pub fn get(&self, i: Idx) -> C

get returns the given coefficient at the requested index. It will panic if the index is out of range,i.e. if i > self.degree().

pub fn set(&mut self, index: usize, value: C)

set the given element at the specified index. The index 0 is the free coefficient of the polynomial. It panics if the index is out of range.

pub fn new(degree: usize) -> Self

Returns a new polynomial of the given degree where each coefficients is sampled at random.

In the context of secret sharing, the threshold is the degree + 1.

pub fn zero() -> Self

Returns a polynomial from the given list of coefficients

pub fn add(&mut self, other: &Self)

Performs polynomial addition in place

impl<C> Poly<C>

where C: Element, C::RHS: Scalar<RHS = C::RHS>,

pub fn eval(&self, i: Idx) -> Eval<C>

Evaluates the polynomial at the specified value.

pub fn recover(t: usize, shares: Vec<Eval<C>>) -> Result<C, PolyError>

Given at least t polynomial evaluations, it will recover the polynomial’s constant term

pub fn full_recover(t: usize, shares: Vec<Eval<C>>) -> Result<Self, PolyError>

Given at least t polynomial evaluations, it will recover the entire polynomial

pub fn public_key(&self) -> &C

Returns the constant term of the polynomial which can be interpreted as the threshold public key

impl<X: Scalar<RHS = X>> Poly<X>

pub fn commit<P: Point<RHS = X>>(&self) -> Poly<P>

Commits the scalar polynomial to the group and returns a polynomial over the group

This is done by multiplying each coefficient of the polynomial with the group’s generator.

Trait Implementations

impl<C: Clone> Clone for Poly<C>

fn clone(&self) -> Poly<C>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<C: Debug> Debug for Poly<C>

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

Formats the value using the given formatter.

impl<'de, C> Deserialize<'de> for Poly<C>

where C: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<C: Display> Display for Poly<C>

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

Formats the value using the given formatter.

impl<C: Element> From<Poly<C>> for Vec<C>

fn from(poly: Poly<C>) -> Self

Converts to this type from the input type.

impl<C: Element> From<Vec<C>> for Poly<C>

fn from(c: Vec<C>) -> Self

Converts to this type from the input type.

impl<C: PartialEq> PartialEq for Poly<C>

fn eq(&self, other: &Poly<C>) -> 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<C> Serialize for Poly<C>

where C: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<C> StructuralPartialEq for Poly<C>