triton_vm::table::master_table

Struct MasterMainTable

Source
pub struct MasterMainTable {
    pub num_trace_randomizers: usize,
    /* private fields */
}
Expand description

Fields§

§num_trace_randomizers: usize

Implementations§

Source§

impl MasterMainTable

Source

pub fn new( aet: &AlgebraicExecutionTrace, quotient_domain: ArithmeticDomain, fri_domain: ArithmeticDomain, num_trace_randomizers: usize, trace_randomizer_seed: <StdRng as SeedableRng>::Seed, ) -> Self

Source

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.

Source

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

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

Source

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

A view of the specified table, without any randomizers.

Source

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

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

Trait Implementations§

Source§

impl Clone for MasterMainTable

Source§

fn clone(&self) -> MasterMainTable

Returns a copy of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for MasterMainTable

Source§

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

Formats the value using the given formatter. Read more
Source§

impl MasterTable for MasterMainTable

Source§

const NUM_COLUMNS: usize = 379usize

Source§

type Field = BFieldElement

Source§

fn trace_domain(&self) -> ArithmeticDomain

Source§

fn randomized_trace_domain(&self) -> ArithmeticDomain

Source§

fn quotient_domain(&self) -> ArithmeticDomain

The ArithmeticDomain just large enough to compute all quotients.
Source§

fn fri_domain(&self) -> ArithmeticDomain

The ArithmeticDomain large enough for FRI.
Source§

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

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

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

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

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

The quotient-domain view of the cached low-degree-extended table, if Read more
Source§

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

Return the FRI domain view of the cached low-degree-extended table, if any. Read more
Source§

fn trace_randomizer_seed(&self) -> <StdRng as SeedableRng>::Seed

Source§

fn num_trace_randomizers(&self) -> usize

Source§

fn evaluation_domain(&self) -> ArithmeticDomain

The ArithmeticDomain to low-degree extend into. The larger of the quotient_domain and the fri_domain.
Source§

fn maybe_low_degree_extend_all_columns(&mut self)

Low-degree extend all columns of the trace table (including randomizers) if it can be cached. In that case, the resulting low-degree extended columns can be accessed using quotient_domain_table and fri_domain_table.
Source§

fn out_of_domain_row( &self, indeterminate: 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. Does not include randomizer polynomials.
Source§

fn randomized_column_interpolant( &self, idx: usize, ) -> Polynomial<'static, Self::Field>

Source§

fn trace_randomizer_for_column( &self, idx: usize, ) -> Polynomial<'static, Self::Field>

Uniquely enables the revelation of up to num_trace_randomizers entries in the corresponding column without compromising zero-knowledge. Read more
Source§

fn merkle_tree(&self) -> MerkleTree

Compute a Merkle tree of the FRI domain table. Every row gives one leaf in the tree.
Source§

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

Source§

fn weighted_sum_of_columns( &self, weights: Array1<XFieldElement>, ) -> Polynomial<'_, XFieldElement>

The linear combination of the trace-randomized columns using the given weights. Read more
Source§

fn reveal_rows(&self, row_indices: &[usize]) -> Vec<Vec<Self::Field>>

Panics Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize = _

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V