Struct LogupTransparentOutput 

pub struct LogupTransparentOutput<F> {
    pub index_eval_point: Vec<F>,
    pub tables: Vec<LogupTransparentTableOutput<F>>,
}

The open claims of a logUp* verification that leaves the table side unclosed.

This is what the reduction holds before the pushforward sumcheck runs. Each table keeps two claims on its pushforward and none on the table itself:

    <Y_t, eq_{z_t}> = Y_t(z_t)      the fractional-addition leaf claim
    <Y_t, T_t>      = e_t           the product claim

See super::verify_reduction_transparent.

Fields

index_eval_point: Vec<F>

The point the index evaluation claims are drawn from, of max n coordinates.

A looker whose column has n variables is claimed at the last n coordinates, exactly as in LogupOutput::index_eval_point.

tables: Vec<LogupTransparentTableOutput<F>>

One entry per table, in the order the tables were given.

Trait Implementations

impl<F> Clone for LogupTransparentOutput<F>

where F: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F> Debug for LogupTransparentOutput<F>

where F: Debug,

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

Formats the value using the given formatter.

impl<F> Eq for LogupTransparentOutput<F>

where F: Eq,

impl<F> PartialEq for LogupTransparentOutput<F>

where F: PartialEq,

fn eq(&self, other: &LogupTransparentOutput<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> StructuralPartialEq for LogupTransparentOutput<F>

where F: PartialEq,