Struct storage_proofs_post::fallback::FallbackPoStCompound [−][src]
pub struct FallbackPoStCompound<Tree> where
Tree: MerkleTreeTrait, { /* fields omitted */ }Trait Implementations
impl<C: Circuit<Bls12>, P: ParameterSetMetadata, Tree: MerkleTreeTrait> CacheableParameters<C, P> for FallbackPoStCompound<Tree>
impl<C: Circuit<Bls12>, P: ParameterSetMetadata, Tree: MerkleTreeTrait> CacheableParameters<C, P> for FallbackPoStCompound<Tree>fn get_groth_params<R>(
rng: Option<&mut R>,
circuit: C,
pub_params: &P
) -> Result<MappedParameters<Bls12>, Error> where
R: RngCore,
fn get_groth_params<R>(
rng: Option<&mut R>,
circuit: C,
pub_params: &P
) -> 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. Read more
fn get_inner_product<R>(
rng: Option<&mut R>,
_circuit: C,
pub_params: &P,
num_proofs_to_aggregate: usize
) -> Result<GenericSRS<Bls12>, Error> where
R: RngCore,
fn get_inner_product<R>(
rng: Option<&mut R>,
_circuit: C,
pub_params: &P,
num_proofs_to_aggregate: usize
) -> Result<GenericSRS<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. Read more
fn get_verifying_key<R>(
rng: Option<&mut R>,
circuit: C,
pub_params: &P
) -> Result<VerifyingKey<Bls12>, Error> where
R: RngCore,
fn get_verifying_key<R>(
rng: Option<&mut R>,
circuit: C,
pub_params: &P
) -> 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. Read more
impl<'a, Tree: 'static + MerkleTreeTrait> CompoundProof<'a, FallbackPoSt<'a, Tree>, FallbackPoStCircuit<Tree>> for FallbackPoStCompound<Tree>
impl<'a, Tree: 'static + MerkleTreeTrait> CompoundProof<'a, FallbackPoSt<'a, Tree>, FallbackPoStCircuit<Tree>> for FallbackPoStCompound<Tree>fn generate_public_inputs(
pub_inputs: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::PublicInputs,
pub_params: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::PublicParams,
partition_k: Option<usize>
) -> Result<Vec<Fr>>
fn generate_public_inputs(
pub_inputs: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::PublicInputs,
pub_params: &<FallbackPoSt<'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. Read more
fn circuit(
pub_in: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::PublicInputs,
_priv_in: <FallbackPoStCircuit<Tree> as CircuitComponent>::ComponentPrivateInputs,
vanilla_proof: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::Proof,
pub_params: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::PublicParams,
partition_k: Option<usize>
) -> Result<FallbackPoStCircuit<Tree>>
fn circuit(
pub_in: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::PublicInputs,
_priv_in: <FallbackPoStCircuit<Tree> as CircuitComponent>::ComponentPrivateInputs,
vanilla_proof: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::Proof,
pub_params: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::PublicParams,
partition_k: Option<usize>
) -> Result<FallbackPoStCircuit<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. Read more
fn blank_circuit(
pub_params: &<FallbackPoSt<'a, Tree> as ProofScheme<'a>>::PublicParams
) -> FallbackPoStCircuit<Tree>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>
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.
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>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>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>
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.
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>
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. Read more
Given a prover_srs key, a list of groth16 proofs, and an ordered list of seeds (used to derive the PoRep challenges) hashed pair-wise with the comm_rs using sha256, aggregate them all into an AggregateProof type. Read more
fn verify_aggregate_proofs(
ip_verifier_srs: &VerifierSRS<Bls12>,
pvk: &PreparedVerifyingKey<Bls12>,
hashed_seeds_and_comm_rs: &[u8],
public_inputs: &[Vec<Fr, Global>],
aggregate_proof: &AggregateProof<Bls12>
) -> Result<bool, Error>
fn verify_aggregate_proofs(
ip_verifier_srs: &VerifierSRS<Bls12>,
pvk: &PreparedVerifyingKey<Bls12>,
hashed_seeds_and_comm_rs: &[u8],
public_inputs: &[Vec<Fr, Global>],
aggregate_proof: &AggregateProof<Bls12>
) -> Result<bool, Error>Verifies the aggregate proof, with respect to the flattened input list. Read more
fn groth_params<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams
) -> Result<MappedParameters<Bls12>, Error> where
R: RngCore,
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. Read more
fn verifying_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams
) -> Result<VerifyingKey<Bls12>, Error> where
R: RngCore,
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. Read more
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. Read more
fn srs_verifier_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
num_proofs_to_aggregate: usize
) -> Result<VerifierSRS<Bls12>, Error> where
R: RngCore,
fn srs_verifier_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
num_proofs_to_aggregate: usize
) -> Result<VerifierSRS<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. Read more
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>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>
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.
Auto Trait Implementations
impl<Tree> RefUnwindSafe for FallbackPoStCompound<Tree> where
Tree: RefUnwindSafe, impl<Tree> Send for FallbackPoStCompound<Tree>impl<Tree> Sync for FallbackPoStCompound<Tree>impl<Tree> Unpin for FallbackPoStCompound<Tree> where
Tree: Unpin, impl<Tree> UnwindSafe for FallbackPoStCompound<Tree> where
Tree: UnwindSafe,