Enum SymbolicMultilinearPolyVariant

pub enum SymbolicMultilinearPolyVariant<F: TowerField> {
    Committed,
    Transparent(TransparentPolyOracle<F>),
    Structured(ArithCircuit<F>),
    Repeating {
        id: OracleId,
    },
    Projected {
        id: OracleId,
        values: Vec<F>,
        variant: ProjectionVariant,
    },
    Shifted {
        id: OracleId,
        shift_offset: usize,
        block_size: usize,
        shift_variant: ShiftVariant,
    },
    Packed {
        id: OracleId,
        log_degree: usize,
    },
    LinearCombination {
        offset: F,
        inner: Vec<(OracleId, F)>,
    },
    ZeroPadded {
        id: OracleId,
        n_pad_vars: usize,
        nonzero_index: usize,
        start_index: usize,
    },
    Composite {
        inner: Vec<OracleId>,
        circuit: ArithCircuit<F>,
    },
}

Variants

Committed

Transparent(TransparentPolyOracle<F>)

Structured(ArithCircuit<F>)

A structured virtual polynomial is one that can be evaluated succinctly by a verifier.

These are referred to as “MLE-structured” tables in Lasso. The evaluation algorithm is expressed as an arithmetic circuit, of polynomial size in the number of variables.

Repeating

Fields

id: OracleId

Projected

Fields

id: OracleId

values: Vec<F>

variant: ProjectionVariant

Shifted

Fields

id: OracleId

shift_offset: usize

block_size: usize

shift_variant: ShiftVariant

Packed

Fields

id: OracleId

log_degree: usize

The number of tower levels increased by the packing operation.

This is the base 2 logarithm of the field extension, and is called $\kappa$ in DP23, Section 4.3.

LinearCombination

Fields

offset: F

inner: Vec<(OracleId, F)>

ZeroPadded

Fields

id: OracleId

n_pad_vars: usize

nonzero_index: usize

start_index: usize

Composite

Fields

inner: Vec<OracleId>

circuit: ArithCircuit<F>

Trait Implementations

impl<F: Clone + TowerField> Clone for SymbolicMultilinearPolyVariant<F>

fn clone(&self) -> SymbolicMultilinearPolyVariant<F>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Debug + TowerField> Debug for SymbolicMultilinearPolyVariant<F>

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

Formats the value using the given formatter.

impl DeserializeBytes for SymbolicMultilinearPolyVariant<BinaryField128b>

fn deserialize( buf: impl Buf, mode: SerializationMode, ) -> Result<Self, SerializationError>

where Self: Sized,

impl<F: PartialEq + TowerField> PartialEq for SymbolicMultilinearPolyVariant<F>

fn eq(&self, other: &SymbolicMultilinearPolyVariant<F>) -> 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<F: TowerField + SerializeBytes> SerializeBytes for SymbolicMultilinearPolyVariant<F>

fn serialize( &self, write_buf: impl BufMut, mode: SerializationMode, ) -> Result<(), SerializationError>

impl<F: Eq + TowerField> Eq for SymbolicMultilinearPolyVariant<F>

impl<F: TowerField> StructuralPartialEq for SymbolicMultilinearPolyVariant<F>