Struct storage_proofs_core::por::PoR

pub struct PoR<Tree: MerkleTreeTrait> { /* private fields */ }

Merkle tree based proof of retrievability.

Trait Implementations

impl<'a, Tree: 'static + MerkleTreeTrait> CompoundProof<'a, PoR<Tree>, PoRCircuit<Tree>> for PoRCompound<Tree>

fn circuit<'b>( public_inputs: &<PoR<Tree> as ProofScheme<'a>>::PublicInputs, _component_private_inputs: <PoRCircuit<Tree> as CircuitComponent>::ComponentPrivateInputs, proof: &'b <PoR<Tree> as ProofScheme<'a>>::Proof, public_params: &'b <PoR<Tree> as ProofScheme<'a>>::PublicParams, _partition_k: Option<usize>, ) -> Result<PoRCircuit<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( public_params: &<PoR<Tree> as ProofScheme<'a>>::PublicParams, ) -> PoRCircuit<Tree>

fn generate_public_inputs( pub_inputs: &<PoR<Tree> as ProofScheme<'a>>::PublicInputs, pub_params: &<PoR<Tree> as ProofScheme<'a>>::PublicParams, _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 setup(sp: &SetupParams<'a, S>) -> Result<PublicParams<'a, S>>

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

fn prove( pub_params: &PublicParams<'a, S>, pub_in: &S::PublicInputs, priv_in: &S::PrivateInputs, groth_params: &Bls12GrothParams, ) -> Result<Vec<Proof<Bls12>>>

prove is equivalent to ProofScheme::prove.

fn prove_with_vanilla( pub_params: &PublicParams<'a, S>, pub_in: &S::PublicInputs, vanilla_proofs: Vec<S::Proof>, groth_params: &Bls12GrothParams, ) -> Result<Vec<Proof<Bls12>>>

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

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

Efficiently verify multiple proofs.

fn circuit_proofs( pub_in: &S::PublicInputs, vanilla_proofs: Vec<S::Proof>, pub_params: &S::PublicParams, groth_params: &Bls12GrothParams, priority: bool, ) -> Result<Vec<Proof<Bls12>>>

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.

fn aggregate_proofs( prover_srs: &ProverSRS<Bls12>, hashed_seeds_and_comm_rs: &[u8], proofs: &[Proof<Bls12>], version: AggregateVersion, ) -> Result<AggregateProof<Bls12>>

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.

fn verify_aggregate_proofs( ip_verifier_srs: &VerifierSRS<Bls12>, pvk: &PreparedVerifyingKey<Bls12>, hashed_seeds_and_comm_rs: &[u8], public_inputs: &[Vec<Fr>], aggregate_proof: &AggregateProof<Bls12>, version: AggregateVersion, ) -> Result<bool>

Verifies the aggregate proof, with respect to the flattened input list.

fn groth_params<R: RngCore>( rng: Option<&mut R>, public_params: &S::PublicParams, ) -> Result<Bls12GrothParams>

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.

fn verifying_key<R: RngCore>( rng: Option<&mut R>, public_params: &S::PublicParams, ) -> Result<VerifyingKey<Bls12>>

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.

fn srs_key<R: RngCore>( rng: Option<&mut R>, public_params: &S::PublicParams, num_proofs_to_aggregate: usize, ) -> Result<ProverSRS<Bls12>>

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.

fn srs_verifier_key<R: RngCore>( rng: Option<&mut R>, public_params: &S::PublicParams, num_proofs_to_aggregate: usize, ) -> Result<VerifierSRS<Bls12>>

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.

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

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

Like circuit_for_test but returns values for all partitions.

impl<Tree: Debug + MerkleTreeTrait> Debug for PoR<Tree>

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

Formats the value using the given formatter.

impl<Tree: Default + MerkleTreeTrait> Default for PoR<Tree>

fn default() -> PoR<Tree>

Returns the “default value” for a type.

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

type PublicParams = PublicParams

type SetupParams = SetupParams

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

type PrivateInputs = PrivateInputs<'a, Tree>

type Proof = DataProof<<Tree as MerkleTreeTrait>::Proof>

type Requirements = NoRequirements

fn setup(sp: &SetupParams) -> Result<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.

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

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

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

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