Struct storage_proofs_post::election::ElectionPoSt

pub struct ElectionPoSt<'a, Tree> where
    Tree: MerkleTreeTrait,  { /* fields omitted */ }

Trait Implementations

impl<'a, Tree: Clone> Clone for ElectionPoSt<'a, Tree> where
    Tree: MerkleTreeTrait, 

fn clone(&self) -> ElectionPoSt<'a, Tree>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, Tree> CompoundProof<'a, ElectionPoSt<'a, Tree>, ElectionPoStCircuit<Tree>> for ElectionPoStCompound<Tree> where
    Tree: 'static + MerkleTreeTrait, 

fn generate_public_inputs(
    pub_inputs: &<ElectionPoSt<'a, Tree> as ProofScheme<'a>>::PublicInputs,
    pub_params: &<ElectionPoSt<'a, Tree> as ProofScheme<'a>>::PublicParams,
    _partition_k: Option<usize>
) -> Result<Vec<Fr>>

generate_public_inputs generates public inputs suitable for use as input during verification of a proof generated from this CompoundProof’s bellperson::Circuit (C). These inputs correspond to those allocated when C is synthesized.

fn circuit(
    pub_in: &<ElectionPoSt<'a, Tree> as ProofScheme<'a>>::PublicInputs,
    _priv_in: <ElectionPoStCircuit<Tree> as CircuitComponent>::ComponentPrivateInputs,
    vanilla_proof: &<ElectionPoSt<'a, Tree> as ProofScheme<'a>>::Proof,
    _pub_params: &<ElectionPoSt<'a, Tree> as ProofScheme<'a>>::PublicParams,
    _partition_k: Option<usize>
) -> Result<ElectionPoStCircuit<Tree>>

circuit constructs an instance of this CompoundProof’s bellperson::Circuit. circuit takes PublicInputs, PublicParams, and Proof from this CompoundProof’s proof::ProofScheme (S) and uses them to initialize Circuit fields which will be used to construct public and private inputs during circuit synthesis.

fn blank_circuit(
    pub_params: &<ElectionPoSt<'a, Tree> as ProofScheme<'a>>::PublicParams
) -> ElectionPoStCircuit<Tree>

pub fn setup(sp: &SetupParams<'a, S>) -> Result<PublicParams<'a, S>, Error>

pub fn partition_count(public_params: &PublicParams<'a, S>) -> usize

pub fn prove(
    pub_params: &PublicParams<'a, S>,
    pub_in: &<S as ProofScheme<'a>>::PublicInputs,
    priv_in: &<S as ProofScheme<'a>>::PrivateInputs,
    groth_params: &'b MappedParameters<Bls12>
) -> Result<MultiProof<'b>, Error>

prove is equivalent to ProofScheme::prove.

pub fn prove_with_vanilla(
    pub_params: &PublicParams<'a, S>,
    pub_in: &<S as ProofScheme<'a>>::PublicInputs,
    vanilla_proofs: Vec<<S as ProofScheme<'a>>::Proof, Global>,
    groth_params: &'b MappedParameters<Bls12>
) -> Result<MultiProof<'b>, Error>

pub fn verify(
    public_params: &PublicParams<'a, S>,
    public_inputs: &<S as ProofScheme<'a>>::PublicInputs,
    multi_proof: &MultiProof<'b>,
    requirements: &<S as ProofScheme<'a>>::Requirements
) -> Result<bool, Error>

pub fn batch_verify(
    public_params: &PublicParams<'a, S>,
    public_inputs: &[<S as ProofScheme<'a>>::PublicInputs],
    multi_proofs: &[MultiProof<'b>],
    requirements: &<S as ProofScheme<'a>>::Requirements
) -> Result<bool, Error>

Efficiently verify multiple proofs.

pub fn circuit_proofs(
    pub_in: &<S as ProofScheme<'a>>::PublicInputs,
    vanilla_proofs: Vec<<S as ProofScheme<'a>>::Proof, Global>,
    pub_params: &<S as ProofScheme<'a>>::PublicParams,
    groth_params: &MappedParameters<Bls12>,
    priority: bool
) -> Result<Vec<Proof<Bls12>, Global>, Error>

circuit_proof creates and synthesizes a circuit from concrete params/inputs, then generates a groth proof from it. It returns a groth proof. circuit_proof is used internally and should neither be called nor implemented outside of default trait methods.

pub fn groth_params<R>(
    rng: Option<&mut R>,
    public_params: &<S as ProofScheme<'a>>::PublicParams
) -> Result<MappedParameters<Bls12>, Error> where
    R: RngCore, 

If the rng option argument is set, parameters will be generated using it. This is used for testing only, or where parameters are otherwise unavailable (e.g. benches). If rng is not set, an error will result if parameters are not present.

pub fn verifying_key<R>(
    rng: Option<&mut R>,
    public_params: &<S as ProofScheme<'a>>::PublicParams
) -> Result<VerifyingKey<Bls12>, Error> where
    R: RngCore, 

If the rng option argument is set, parameters will be generated using it. This is used for testing only, or where parameters are otherwise unavailable (e.g. benches). If rng is not set, an error will result if parameters are not present.

pub fn circuit_for_test(
    public_parameters: &PublicParams<'a, S>,
    public_inputs: &<S as ProofScheme<'a>>::PublicInputs,
    private_inputs: &<S as ProofScheme<'a>>::PrivateInputs
) -> Result<(C, Vec<Fr, Global>), Error>

pub fn circuit_for_test_all(
    public_parameters: &PublicParams<'a, S>,
    public_inputs: &<S as ProofScheme<'a>>::PublicInputs,
    private_inputs: &<S as ProofScheme<'a>>::PrivateInputs
) -> Result<Vec<(C, Vec<Fr, Global>), Global>, Error>

Like circuit_for_test but returns values for all partitions.

impl<'a, Tree: Debug> Debug for ElectionPoSt<'a, Tree> where
    Tree: MerkleTreeTrait, 

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

Formats the value using the given formatter.

impl<'a, Tree: 'static + MerkleTreeTrait> ProofScheme<'a> for ElectionPoSt<'a, Tree>

type PublicParams = PublicParams

type SetupParams = SetupParams

type PublicInputs = PublicInputs<<Tree::Hasher as Hasher>::Domain>

type PrivateInputs = PrivateInputs<Tree>

type Proof = Proof<Tree::Proof>

type Requirements = NoRequirements

fn setup(sp: &Self::SetupParams) -> Result<Self::PublicParams>

setup is used to generate public parameters from setup parameters in order to specialize a ProofScheme to the specific parameters required by a consumer.

fn prove<'b>(
    pub_params: &'b Self::PublicParams,
    pub_inputs: &'b Self::PublicInputs,
    priv_inputs: &'b Self::PrivateInputs
) -> Result<Self::Proof>

prove generates and returns a proof from public parameters, public inputs, and private inputs.

fn verify(
    pub_params: &Self::PublicParams,
    pub_inputs: &Self::PublicInputs,
    proof: &Self::Proof
) -> Result<bool>

verify returns true if the supplied proof is valid for the given public parameter and public inputs. Note that verify does not have access to private inputs. Remember that proof is untrusted, and any data it provides MUST be validated as corresponding to the supplied public parameters and inputs.

pub fn prove_all_partitions(
    pub_params: &Self::PublicParams,
    pub_in: &Self::PublicInputs,
    priv_in: &Self::PrivateInputs,
    partition_count: usize
) -> Result<Vec<Self::Proof, Global>, Error>

pub fn verify_all_partitions(
    pub_params: &Self::PublicParams,
    pub_in: &Self::PublicInputs,
    proofs: &[Self::Proof]
) -> Result<bool, Error>

pub fn with_partition(
    pub_in: Self::PublicInputs,
    _k: Option<usize>
) -> Self::PublicInputs

pub fn satisfies_requirements(
    _pub_params: &Self::PublicParams,
    _requirements: &Self::Requirements,
    _partitions: usize
) -> bool