Struct PermutationInstance 

pub struct PermutationInstance<T, const WIDTH: usize> { /* private fields */ }

A validated relation, ready for a proof system.

Produced by PermutationRelation::compile; see there for what is checked.

Implementations

impl<T: Unit + Encoding + FromNarg + PartialEq, const WIDTH: usize> PermutationInstance<T, WIDTH>

pub fn to_bytes(&self) -> Vec<u8>

The canonical byte encoding of this instance.

pub fn from_bytes(bytes: &[u8]) -> Result<Self, InvalidRelation>

Parses Self::to_bytes, running the same checks as PermutationRelation::compile.

pub fn digest(&self) -> [u8; 32]

The 32-byte digest of Self::to_bytes, for binding the statement into a transcript.

impl<T, const WIDTH: usize> PermutationInstance<T, WIDTH>

pub fn label(&self) -> &str

The permutation’s label; see PermutationRelation::labeled.

pub const fn vars_count(&self) -> usize

The number of wires, FieldVar::ZERO included.

pub fn public_vars(&self) -> &[(FieldVar, T)]

The assigned wires and their values, in index order.

pub fn queries(&self) -> &[QueryAnswerPair<FieldVar, WIDTH>]

The queries to prove, in the order they were made.

pub fn equations(&self) -> &[LinearEquation<T>]

The linear equations to prove.

pub fn value(&self, var: FieldVar) -> Option<&T>

The value assigned to var, if it is public.

pub fn is_witness_valid<P>( &self, permutation: &P, witness: &PermutationWitness<T, WIDTH>, ) -> bool

where T: Ring, P: Permutation<WIDTH, U = T>,

Whether witness satisfies this instance under permutation.

The trace must have one step per query, each step must be an evaluation of permutation, every wire must carry one value wherever it appears, public wires must carry their assigned value, and every equation must hold on those values.

This is a plain comparison, not a constant-time one: it is meant for the prover checking its own witness, and for tests.

Trait Implementations

impl<T: Clone, const WIDTH: usize> Clone for PermutationInstance<T, WIDTH>

fn clone(&self) -> PermutationInstance<T, WIDTH>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, const WIDTH: usize> Debug for PermutationInstance<T, WIDTH>

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

Formats the value using the given formatter.

impl<T: Unit + Encoding + FromNarg + PartialEq, const WIDTH: usize> Encoding for PermutationInstance<T, WIDTH>

fn encode(&self) -> impl AsRef<[u8]>

The function encoding prover messages into inputs to be absorbed by the duplex sponge.

impl<T: Eq, const WIDTH: usize> Eq for PermutationInstance<T, WIDTH>

impl<T: Unit + Encoding + FromNarg + PartialEq, const WIDTH: usize> FromNarg for PermutationInstance<T, WIDTH>

fn from_narg(reader: &mut NargReader<'_>) -> Result<Self, VerificationError>

This map must compute the inverse of Encoding::encode, or return an error if a pre-image does not exist.

fn from_narg_array<const N: usize>( reader: &mut NargReader<'_>, ) -> Result<[Self; N], VerificationError>

Reads N consecutive values: the body of [Self; N]’s implementation.

impl<T: PartialEq, const WIDTH: usize> PartialEq for PermutationInstance<T, WIDTH>

fn eq(&self, other: &PermutationInstance<T, WIDTH>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T: PartialEq, const WIDTH: usize> StructuralPartialEq for PermutationInstance<T, WIDTH>