Struct PP 

pub struct PP {
    pub disc: BigInt,
    pub g: BinaryQF,
    pub q: BigInt,
    pub p: BigInt,
}

Polynomial commitment as given in the paper: Transparent SNARKs from DARK Compilers (https://eprint.iacr.org/2019/1229.pdf), subsection 4.2 and 4.3 The following algorithms are implemented: Setup: generates public parameters Commit: to commit to a polynomial Open: open and verify a commitment Encode: stand alone code to encode a polynomial as an integer Decode: converts integer to a unique polynomial Eval_prover: NI proof that y = f(z) for a committed polynomial f() Eval_verify: NI verifier for eval_proof.

Fields

disc: BigInt

g: BinaryQF

q: BigInt

p: BigInt

Trait Implementations

impl Clone for PP

fn clone(&self) -> PP

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PP

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

Formats the value using the given formatter.

impl PartialEq for PP

fn eq(&self, other: &PP) -> 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 Eq for PP

impl StructuralPartialEq for PP