Struct proof_system::proof_spec::ProofSpec

pub struct ProofSpec<E: PairingEngine, G: AffineCurve> {
    pub statements: Statements<E, G>,
    pub meta_statements: MetaStatements,
    pub setup_params: Vec<SetupParams<E, G>>,
    pub context: Option<Vec<u8>>,
}

Describes the relations that need to proven. This is created independently by the prover and verifier and must be agreed upon and be same before creating a Proof. Represented as collection of Statements and MetaStatements.

Fields

statements: Statements<E, G>

meta_statements: MetaStatements

setup_params: Vec<SetupParams<E, G>>

context: Option<Vec<u8>>

context is any arbitrary data that needs to be hashed into the proof and it must be kept same while creating and verifying the proof. Eg of context are the purpose of the proof or the verifier’s identity or some verifier-specific identity of the holder or all of the above combined.

Implementations

impl<E, G> ProofSpec<E, G>where
    E: PairingEngine,
    G: AffineCurve,

pub fn new(
    statements: Statements<E, G>,
    meta_statements: MetaStatements,
    setup_params: Vec<SetupParams<E, G>>,
    context: Option<Vec<u8>>
) -> Self

pub fn add_statement(&mut self, statement: Statement<E, G>) -> usize

pub fn add_meta_statement(&mut self, meta_statement: MetaStatement) -> usize

pub fn is_valid(&self) -> bool

Sanity check to ensure the proof spec is valid. This should never be false as these are used by same entity creating them.

pub fn derive_commitment_keys(
    &self
) -> Result<(StatementDerivedParams<Vec<E::G1Affine>>, StatementDerivedParams<Vec<E::G1Affine>>, StatementDerivedParams<(Vec<E::G1Affine>, Vec<E::G1Affine>)>, StatementDerivedParams<Vec<E::G1Affine>>), ProofSystemError>

Derive commitment keys for Schnorr protocol from public params. This is done to avoid creating them if the same public params are used in multiple statements and is effectively a pre-processing step done for optimization.

pub fn derive_prepared_parameters(
    &self
) -> Result<(StatementDerivedParams<LegoPreparedVerifyingKey<E>>, StatementDerivedParams<PreparedEncryptionGens<E>>, StatementDerivedParams<PreparedEncryptionKey<E>>, StatementDerivedParams<SaverPreparedVerifyingKey<E>>), ProofSystemError>

Derive prepared keys for performing pairings. This is done to avoid preparing the same parameters again and is effectively a pre-processing step done for optimization.

Trait Implementations

impl<E: PairingEngine, G: AffineCurve> CanonicalDeserialize for ProofSpec<E, G>

fn deserialize<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads Self from reader.

fn deserialize_uncompressed<R: Read>(
    reader: R
) -> Result<Self, SerializationError>

Reads Self from reader without compression.

fn deserialize_unchecked<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads self from reader without compression, and without performing validity checks. Should be used only when the input is trusted.

impl<E: PairingEngine, G: AffineCurve> CanonicalSerialize for ProofSpec<E, G>

fn serialize<W: Write>(&self, writer: W) -> Result<(), SerializationError>

Serializes self into writer. It is left up to a particular type for how it strikes the serialization efficiency vs compression tradeoff. For standard types (e.g. bool, lengths, etc.) typically an uncompressed form is used, whereas for algebraic types compressed forms are used.

fn serialized_size(&self) -> usize

fn serialize_uncompressed<W: Write>(
    &self,
    writer: W
) -> Result<(), SerializationError>

Serializes self into writer without compression.

fn serialize_unchecked<W: Write>(
    &self,
    writer: W
) -> Result<(), SerializationError>

Serializes self into writer without compression, and without performing validity checks. Should be used only when there is no danger of adversarial manipulation of the output.

fn uncompressed_size(&self) -> usize

impl<E: Clone + PairingEngine, G: Clone + AffineCurve> Clone for ProofSpec<E, G>

fn clone(&self) -> ProofSpec<E, G>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E: Debug + PairingEngine, G: Debug + AffineCurve> Debug for ProofSpec<E, G>

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

Formats the value using the given formatter.

impl<E, G> Default for ProofSpec<E, G>where
    E: PairingEngine,
    G: AffineCurve,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, E: PairingEngine, G: AffineCurve> Deserialize<'de> for ProofSpec<E, G>

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

Deserialize this value from the given Serde deserializer.

impl<E: PartialEq + PairingEngine, G: PartialEq + AffineCurve> PartialEq<ProofSpec<E, G>> for ProofSpec<E, G>

fn eq(&self, other: &ProofSpec<E, G>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<E: PairingEngine, G: AffineCurve> Serialize for ProofSpec<E, G>

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

Serialize this value into the given Serde serializer.

impl<E: PairingEngine, G: AffineCurve> StructuralPartialEq for ProofSpec<E, G>