Struct MultiClaim 

pub struct MultiClaim<F: ExtensionField<F>, Point, Data> { /* private fields */ }

A batch of openings that share one evaluation point.

    point     ── shared by every opening
    openings  [opening_0, opening_1, ...]

Alpha-ordering contract

• Each recorded opening consumes one power of the batching challenge.
• The canonical ordering is insertion order, walked as:
  • placements, in witness-layout order,
  • claims inside each placement, in recording order,
  • openings inside each claim, in the order they entered eval.
• Prover and verifier walk the same three-loop nest, so the alpha-to-claim mapping is forced to agree when the transcripts mirror each other.

Implementations

impl<EF: Field, Point, Data> MultiClaim<EF, Point, Data>

pub const fn new(point: Point, openings: Vec<Opening<EF, Data>>) -> Self

Builds a batch sharing point, holding the given openings.

pub const fn point(&self) -> &Point

Returns the shared evaluation point.

pub const fn len(&self) -> usize

Returns the number of openings.

pub const fn is_empty(&self) -> bool

Returns whether the batch holds no openings.

pub fn openings(&self) -> &[Opening<EF, Data>]

Returns the openings as a slice in insertion order.

Trait Implementations

impl<F: Clone + ExtensionField<F>, Point: Clone, Data: Clone> Clone for MultiClaim<F, Point, Data>

fn clone(&self) -> MultiClaim<F, Point, Data>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug + ExtensionField<F>, Point: Debug, Data: Debug> Debug for MultiClaim<F, Point, Data>

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

Formats the value using the given formatter.