Enum ComposedRelation 

pub enum ComposedRelation<G: PrimeGroup> {
    Simple(CanonicalLinearRelation<G>),
    And(Vec<ComposedRelation<G>>),
    Or(Vec<ComposedRelation<G>>),
    Threshold(usize, Vec<ComposedRelation<G>>),
}

A protocol proving knowledge of a witness for a composition of linear relations.

This implementation generalizes CanonicalLinearRelation by using AND/OR links.

Type Parameters

• G: A cryptographic group implementing group::Group and group::GroupEncoding.

Variants

Simple(CanonicalLinearRelation<G>)

And(Vec<ComposedRelation<G>>)

Or(Vec<ComposedRelation<G>>)

Threshold(usize, Vec<ComposedRelation<G>>)

Implementations

impl<G: PrimeGroup + ConstantTimeEq + ConditionallySelectable> ComposedRelation<G>

pub fn and<T: Into<ComposedRelation<G>>>( witness: impl IntoIterator<Item = T>, ) -> Self

Create a ComposedRelation for an AND relation from the given list of relations.

pub fn or<T: Into<ComposedRelation<G>>>( witness: impl IntoIterator<Item = T>, ) -> Self

Create a ComposedRelation for an OR relation from the given list of relations.

pub fn threshold<T: Into<ComposedRelation<G>>>( threshold: usize, witness: impl IntoIterator<Item = T>, ) -> Self

Create a ComposedRelation for a threshold relation from the given list of relations.

impl<G> ComposedRelation<G>

where G: PrimeGroup + ConstantTimeEq + ConditionallySelectable + Encoding<[u8]> + NargSerialize + NargDeserialize + MultiScalarMul, G::Scalar: Encoding<[u8]> + NargSerialize + NargDeserialize + Decoding<[u8]> + ConditionallySelectable,

pub fn into_nizk(self, session_identifier: &[u8]) -> Nizk<ComposedRelation<G>>

Convert this Protocol into a non-interactive zero-knowledge proof using the Shake128DuplexSponge codec and a specified session identifier.

This method provides a convenient way to create a NIZK from a Protocol without exposing the specific codec type to the API caller.

Parameters

• session_identifier: Domain separator bytes for the Fiat-Shamir transform

Returns

A Nizk instance ready for proving and verification

Trait Implementations

impl<G: Clone + PrimeGroup> Clone for ComposedRelation<G>

fn clone(&self) -> ComposedRelation<G>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<G: PrimeGroup> From<CanonicalLinearRelation<G>> for ComposedRelation<G>

fn from(value: CanonicalLinearRelation<G>) -> Self

Converts to this type from the input type.

impl<G> SigmaProtocol for ComposedRelation<G>

where G: PrimeGroup + ConstantTimeEq + ConditionallySelectable + Encoding<[u8]> + NargSerialize + NargDeserialize + MultiScalarMul, G::Scalar: Encoding<[u8]> + NargSerialize + NargDeserialize + Decoding<[u8]> + ConditionallySelectable,

type Commitment = ComposedCommitment<G>

type ProverState = ComposedProverState<G>

type Response = ComposedResponse<G>

type Witness = ComposedWitness<G>

type Challenge = <CanonicalLinearRelation<G> as SigmaProtocol>::Challenge

fn prover_commit( &self, witness: &Self::Witness, rng: &mut impl ScalarRng, ) -> Result<(Vec<Self::Commitment>, Self::ProverState), Error>

First step of the protocol. Given the witness and RNG, this generates:

fn prover_response( &self, state: Self::ProverState, challenge: &Self::Challenge, ) -> Result<Vec<Self::Response>, Error>

Computes the prover’s response to a challenge based on the prover state.

fn verifier( &self, commitment: &[Self::Commitment], challenge: &Self::Challenge, response: &[Self::Response], ) -> Result<(), Error>

Final step of the protocol: checks that the commitment, challenge, and response form a valid transcript.

fn commitment_len(&self) -> usize

fn response_len(&self) -> usize

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

fn protocol_identifier(&self) -> [u8; 64]

impl<G> SigmaProtocolSimulator for ComposedRelation<G>

where G: PrimeGroup + ConstantTimeEq + ConditionallySelectable + Encoding<[u8]> + NargSerialize + NargDeserialize + MultiScalarMul, G::Scalar: Encoding<[u8]> + NargSerialize + NargDeserialize + Decoding<[u8]> + ConditionallySelectable,

fn simulate_commitment( &self, challenge: &Self::Challenge, response: &[Self::Response], ) -> Result<Vec<Self::Commitment>, Error>

Simulates a commitment for which (‘commitment’, ‘challenge’, ‘response’) is a valid transcript.

fn simulate_response(&self, rng: &mut impl ScalarRng) -> Vec<Self::Response>

Generates a random response (e.g. for simulation or OR composition).

fn simulate_transcript( &self, rng: &mut impl ScalarRng, ) -> Result<(Vec<Self::Commitment>, Self::Challenge, Vec<Self::Response>), Error>

Generates a full simulated proof transcript (commitment, challenge, response) without requiring knowledge of a witness.

impl<G: PrimeGroup + MultiScalarMul> TryFrom<LinearRelation<G>> for ComposedRelation<G>

type Error = InvalidInstance

The type returned in the event of a conversion error.

fn try_from(value: LinearRelation<G>) -> Result<Self, Self::Error>

Performs the conversion.