Struct CompactProof 

pub struct CompactProof {
    pub challenge: Scalar,
    pub responses: Vec<Scalar>,
}

A Schnorr proof in compact format.

This performs the standard folklore optimization of sending the challenge in place of the commitments to the prover’s randomness. However, this optimization prevents batch verification.

This proof has m+1 32-byte elements, where m is the number of secret variables. This means there is no space savings for a CompactProof over a BatchableProof when there is only one statement.

Fields

challenge: Scalar

The Fiat-Shamir challenge.

responses: Vec<Scalar>

The prover’s responses, one per secret variable.

Trait Implementations

impl Clone for CompactProof

fn clone(&self) -> CompactProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'de> Deserialize<'de> for CompactProof

fn deserialize<__D>( __deserializer: __D, ) -> Result<CompactProof, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for CompactProof

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.