Enum EvaluationOrder

pub enum EvaluationOrder {
    LowToHigh,
    HighToLow,
}

Sumcheck evaluation order.

While one can reasonably perform sumcheck over any permutation of the variables, ultimately only two evaluation orders make sense - low-to-high and high-to-low.

Each have pros and cons under little endian representation of multilinears:

1. Low-to-high - good locality of access (especially for univariate skip), but needs deinterleaving which prevents byteslicing; computes partial low foldings.
2. High-to-low - worse locality of access in univariate skip, but byteslicing friendly, has inplace multithreaded folding; computes partial high foldings.

Variants

LowToHigh

Substituting lower indexed variables first.

HighToLow

Substituting higher indexed variables first.

Trait Implementations

impl Clone for EvaluationOrder

fn clone(&self) -> EvaluationOrder

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for EvaluationOrder

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

Formats the value using the given formatter.

impl PartialEq for EvaluationOrder

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

impl Eq for EvaluationOrder

impl StructuralPartialEq for EvaluationOrder