Struct triton_vm::table::master_table::MasterBaseTable

pub struct MasterBaseTable {
    pub num_trace_randomizers: usize,
    /* private fields */
}

See MasterTable.

Fields

num_trace_randomizers: usize

Implementations

impl MasterBaseTable

pub fn new( aet: &AlgebraicExecutionTrace, num_trace_randomizers: usize, quotient_domain: ArithmeticDomain, fri_domain: ArithmeticDomain ) -> Self

pub fn pad(&mut self)

Pad the trace to the next power of two using the various, table-specific padding rules. All tables must have the same height for reasons of verifier efficiency. Furthermore, that height must be a power of two for reasons of prover efficiency. Concretely, the Number Theory Transform (NTT) performed by the prover is particularly efficient over the used base field when the number of rows is a power of two.

pub fn extend(&self, challenges: &Challenges) -> MasterExtTable

Create a MasterExtTable from a MasterBaseTable by .extend()ing each individual base table. The .extend() for each table is specific to that table, but always involves adding some number of columns.

pub fn table(&self, table_id: TableId) -> ArrayView2<'_, BFieldElement>

A view of the specified table, without any randomizers.

pub fn table_mut( &mut self, table_id: TableId ) -> ArrayViewMut2<'_, BFieldElement>

A mutable view of the specified table, without any randomizers.

Trait Implementations

impl Clone for MasterBaseTable

fn clone(&self) -> MasterBaseTable

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MasterBaseTable

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

Formats the value using the given formatter.

impl MasterTable<BFieldElement> for MasterBaseTable

fn trace_domain(&self) -> ArithmeticDomain

fn randomized_trace_domain(&self) -> ArithmeticDomain

fn quotient_domain(&self) -> ArithmeticDomain

fn fri_domain(&self) -> ArithmeticDomain

fn trace_table(&self) -> ArrayView2<'_, BFieldElement>

Presents underlying trace data, excluding trace randomizers and randomizer polynomials.

fn trace_table_mut(&mut self) -> ArrayViewMut2<'_, BFieldElement>

Mutably presents underlying trace data, excluding trace randomizers and randomizer polynomials.

fn randomized_trace_table(&self) -> ArrayView2<'_, BFieldElement>

fn randomized_trace_table_mut(&mut self) -> ArrayViewMut2<'_, BFieldElement>

fn quotient_domain_table(&self) -> ArrayView2<'_, BFieldElement>

The low-degree extended randomized trace data over the quotient domain. Includes randomizer polynomials. Requires having called low_degree_extend_all_columns first.

fn fri_domain_table(&self) -> ArrayView2<'_, BFieldElement>

The low-degree extended randomized trace data over the FRI domain. Includes randomizer polynomials. Requires having called low_degree_extend_all_columns first.

fn memoize_low_degree_extended_table( &mut self, low_degree_extended_columns: Array2<BFieldElement> )

Not intended for direct use, but through Self::low_degree_extend_all_columns.

fn low_degree_extended_table(&self) -> ArrayView2<'_, BFieldElement>

Requires having called low_degree_extend_all_columns first.

fn memoize_interpolation_polynomials( &mut self, interpolation_polynomials: Array1<Polynomial<BFieldElement>> )

Memoize the polynomials interpolating the columns. Not intended for direct use, but through Self::low_degree_extend_all_columns.

fn interpolation_polynomials(&self) -> ArrayView1<'_, Polynomial<XFieldElement>>

Requires having called low_degree_extend_all_columns first.

fn row(&self, row_index: XFieldElement) -> Array1<XFieldElement>

Get one row of the table at an arbitrary index. Notably, the index does not have to be in any of the domains. In other words, can be used to compute out-of-domain rows. Requires having called low_degree_extend_all_columns first. Does not include randomizer polynomials.

fn hash_one_row(row: ArrayView1<'_, BFieldElement>) -> Digest

fn randomize_trace(&mut self)

Set all rows not part of the actual (padded) trace to random values.

fn low_degree_extend_all_columns(&mut self)

Low-degree extend all columns of the randomized trace domain table. The resulting low-degree extended columns can be accessed using quotient_domain_table and fri_domain_table.

fn merkle_tree( &self, maybe_profiler: &mut Option<TritonProfiler> ) -> MerkleTree<Tip5>

Compute a Merkle tree of the FRI domain table. Every row gives one leaf in the tree. The function hash_row is used to hash each row.

fn hash_all_fri_domain_rows(&self) -> Vec<Digest>