Enum ZerofierTree

pub enum ZerofierTree<'c, FF: FiniteField + MulAssign<BFieldElement>> {
    Leaf(Leaf<'c, FF>),
    Branch(Box<Branch<'c, FF>>),
    Padding,
}

A zerofier tree is a balanced binary tree of vanishing polynomials. Conceptually, every leaf corresponds to a single point, and the value of that leaf is the monic linear polynomial that evaluates to zero there and no-where else. Every non-leaf node is the product of its two children. In practice, it makes sense to truncate the tree depth, in which case every leaf contains a chunk of points whose size is upper-bounded and more or less equal to some constant threshold.

Variants

Leaf(Leaf<'c, FF>)

Branch(Box<Branch<'c, FF>>)

Padding

Implementations

impl<FF: FiniteField + MulAssign<BFieldElement>> ZerofierTree<'static, FF>

pub fn new_from_domain(domain: &[FF]) -> Self

impl<'c, FF> ZerofierTree<'c, FF>

where FF: FiniteField + MulAssign<BFieldElement> + 'static,

pub fn zerofier(&self) -> Polynomial<'c, FF>

Trait Implementations

impl<'c, FF: Clone + FiniteField + MulAssign<BFieldElement>> Clone for ZerofierTree<'c, FF>

fn clone(&self) -> ZerofierTree<'c, FF>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'c, FF: Debug + FiniteField + MulAssign<BFieldElement>> Debug for ZerofierTree<'c, FF>

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

Formats the value using the given formatter.

impl<'c, FF: PartialEq + FiniteField + MulAssign<BFieldElement>> PartialEq for ZerofierTree<'c, FF>

fn eq(&self, other: &ZerofierTree<'c, FF>) -> 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, FF: FiniteField + MulAssign<BFieldElement>> StructuralPartialEq for ZerofierTree<'c, FF>