Struct PreprocessedLookupTable 

pub struct PreprocessedLookupTable {
    pub n: u32,
    /* private fields */
}

This table will be the preprocessed version of the precomputed table, T, with arity 4. This structure is passed to the proof alongside the table of witness values.

Fields

n: u32

This is the circuit size

Implementations

impl PreprocessedLookupTable

pub fn preprocess( table: &LookupTable, commit_key: &CommitKey, n: u32, ) -> Result<Self, Error>

This function takes in a precomputed look up table and pads it to the length of the circuit entries, as a power of 2. The function then interpolates a polynomial from the padded table and makes a commitment to the poly. The outputted struct will be used in the proof alongside our circuit witness table.

Trait Implementations

impl Clone for PreprocessedLookupTable

fn clone(&self) -> PreprocessedLookupTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PreprocessedLookupTable

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

Formats the value using the given formatter.

impl PartialEq for PreprocessedLookupTable

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

impl StructuralPartialEq for PreprocessedLookupTable