Struct Proof 

pub struct Proof<F: PrimeField> {
    pub commitments: (ZipPlusCommitment, ZipPlusCommitment, ZipPlusCommitment),
    pub zip: Vec<u8>,
    pub ideal_check: Proof<F>,
    pub resolver: Proof<F>,
    pub combined_sumcheck: MultiDegreeSumcheckProof<F>,
    pub multipoint_eval: Proof<F>,
    pub witness_lifted_evals: Vec<DynamicPolynomialF<F>>,
    pub lookup_proof: Option<BatchedLookupProof<F>>,
}

Full proof produced by the Zinc+ PIOP for UCS.

Fields

commitments: (ZipPlusCommitment, ZipPlusCommitment, ZipPlusCommitment)

Zip+ commitments to the witness columns.

zip: Vec<u8>

Serialized PCS proof data (Zip+ proving transcripts).

ideal_check: Proof<F>

Randomized ideal check proof.

resolver: Proof<F>

Combined polynomial resolver proof (up_evals + down_evals).

combined_sumcheck: MultiDegreeSumcheckProof<F>

Multi-degree sumcheck proof (CPR group + future lookup groups).

multipoint_eval: Proof<F>

Multi-point evaluation sumcheck proof (combines up_evals and down_evals at r’ into a single evaluation point r_0).

witness_lifted_evals: Vec<DynamicPolynomialF<F>>

Witness-only polynomial MLE evaluations at r_0 in F_q[X] (after \phi_q, before \psi_a), ordered as [wit_bin..., wit_arb..., wit_int...]. The verifier recomputes public lifted_evals from public data, interleaves them with these, and derives scalar open_evals via \psi_a for the sumcheck consistency check and Zip+ PCS verify.

lookup_proof: Option<BatchedLookupProof<F>>

Lookup argument proof. None when the UAIR has no lookup specs.

Trait Implementations

impl<F: Clone + PrimeField> Clone for Proof<F>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug + PrimeField> Debug for Proof<F>

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

Formats the value using the given formatter.

impl<F> GenTranscribable for Proof<F>

where F: PrimeField, F::Inner: ConstTranscribable, F::Modulus: ConstTranscribable,

fn read_transcription_bytes_exact(bytes: &[u8]) -> Self

Creates a new instance from a byte buffer. The buffer must be exactly the expected length.

fn write_transcription_bytes_exact(&self, buf: &mut [u8])

Transcribes the current instance into a byte buffer. The buffer must be exactly the expected length.

impl<F: PartialEq + PrimeField> PartialEq for Proof<F>

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

where F: PrimeField, F::Inner: ConstTranscribable, F::Modulus: ConstTranscribable,

fn get_num_bytes(&self) -> usize

Returns the number of bytes required to represent this type. The buffer passed to write_transcription_bytes should be exactly the length returned by this function.

const LENGTH_NUM_BYTES: usize = u32::NUM_BYTES

Number of bytes required to represent length of this type, could be zero if known in advance.

fn read_num_bytes(bytes: &[u8]) -> usize

Read number of bytes required to represent this type. The buffer must be exactly LENGTH_NUM_BYTES long. The buffer passed to read_transcription_bytes should be exactly the length returned by this function.

fn read_transcription_bytes_subset(bytes: &[u8]) -> (Self, &[u8])

Reads an instance of this type from the beginning of the byte slice, and returns the instance along with the remaining byte slice.

fn write_transcription_bytes_subset<'a>( &self, buf: &'a mut [u8], ) -> &'a mut [u8]

Writes this instance, prefixed by length, into the beginning of the byte buffer, and returns the remaining byte buffer.

impl<F: Eq + PrimeField> Eq for Proof<F>

impl<F: PrimeField> StructuralPartialEq for Proof<F>