[−][src]Struct zkp::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.

Blanket Implementations

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T> ToOwned for T where    T: Clone, [src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where    U: Into<T>, [src]

type Error = !

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.