[−][src]Struct storage_proofs::merklepor::MerklePoR
Merkle tree based proof of retrievability.
Trait Implementations
impl<'a, H> CompoundProof<'a, Bls12, MerklePoR<H>, PoRCircuit<'a, Bls12, H>> for PoRCompound<H> where
H: 'a + Hasher,
[src]
H: 'a + Hasher,
fn circuit<'b>(
public_inputs: &<MerklePoR<H> as ProofScheme<'a>>::PublicInputs,
_component_private_inputs: <PoRCircuit<'a, Bls12, H> as CircuitComponent>::ComponentPrivateInputs,
proof: &'b <MerklePoR<H> as ProofScheme<'a>>::Proof,
public_params: &'b <MerklePoR<H> as ProofScheme<'a>>::PublicParams,
engine_params: &'a JubjubBls12
) -> PoRCircuit<'a, Bls12, H>
[src]
public_inputs: &<MerklePoR<H> as ProofScheme<'a>>::PublicInputs,
_component_private_inputs: <PoRCircuit<'a, Bls12, H> as CircuitComponent>::ComponentPrivateInputs,
proof: &'b <MerklePoR<H> as ProofScheme<'a>>::Proof,
public_params: &'b <MerklePoR<H> as ProofScheme<'a>>::PublicParams,
engine_params: &'a JubjubBls12
) -> PoRCircuit<'a, Bls12, H>
fn blank_circuit(
public_params: &<MerklePoR<H> as ProofScheme<'a>>::PublicParams,
params: &'a JubjubBls12
) -> PoRCircuit<'a, Bls12, H>
[src]
public_params: &<MerklePoR<H> as ProofScheme<'a>>::PublicParams,
params: &'a JubjubBls12
) -> PoRCircuit<'a, Bls12, H>
fn generate_public_inputs(
pub_inputs: &<MerklePoR<H> as ProofScheme<'a>>::PublicInputs,
pub_params: &<MerklePoR<H> as ProofScheme<'a>>::PublicParams,
_k: Option<usize>
) -> Vec<Fr>
[src]
pub_inputs: &<MerklePoR<H> as ProofScheme<'a>>::PublicInputs,
pub_params: &<MerklePoR<H> as ProofScheme<'a>>::PublicParams,
_k: Option<usize>
) -> Vec<Fr>
fn setup<'b>(sp: &SetupParams<'a, 'b, E, S>) -> Result<PublicParams<'a, E, S>> where
E::Params: Sync,
[src]
E::Params: Sync,
fn partition_count(public_params: &PublicParams<'a, E, S>) -> usize
[src]
fn prove<'b>(
pub_params: &'b PublicParams<'a, E, S>,
pub_in: &'b S::PublicInputs,
priv_in: &'b S::PrivateInputs,
groth_params: &'b Parameters<E>
) -> Result<MultiProof<'b, E>> where
E::Params: Sync,
[src]
pub_params: &'b PublicParams<'a, E, S>,
pub_in: &'b S::PublicInputs,
priv_in: &'b S::PrivateInputs,
groth_params: &'b Parameters<E>
) -> Result<MultiProof<'b, E>> where
E::Params: Sync,
prove is equivalent to ProofScheme::prove.
fn verify(
public_params: &PublicParams<'a, E, S>,
public_inputs: &S::PublicInputs,
multi_proof: &MultiProof<E>,
requirements: &S::Requirements
) -> Result<bool>
[src]
public_params: &PublicParams<'a, E, S>,
public_inputs: &S::PublicInputs,
multi_proof: &MultiProof<E>,
requirements: &S::Requirements
) -> Result<bool>
fn circuit_proof<'b>(
pub_in: &S::PublicInputs,
vanilla_proof: &S::Proof,
pub_params: &'b S::PublicParams,
params: &'a E::Params,
groth_params: &Parameters<E>
) -> Result<Proof<E>>
[src]
pub_in: &S::PublicInputs,
vanilla_proof: &S::Proof,
pub_params: &'b S::PublicParams,
params: &'a E::Params,
groth_params: &Parameters<E>
) -> Result<Proof<E>>
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
fn groth_params(
public_params: &S::PublicParams,
engine_params: &'a E::Params
) -> Result<Parameters<E>>
[src]
public_params: &S::PublicParams,
engine_params: &'a E::Params
) -> Result<Parameters<E>>
fn verifying_key(
public_params: &S::PublicParams,
engine_params: &'a E::Params
) -> Result<VerifyingKey<E>>
[src]
public_params: &S::PublicParams,
engine_params: &'a E::Params
) -> Result<VerifyingKey<E>>
fn circuit_for_test(
public_parameters: &PublicParams<'a, E, S>,
public_inputs: &S::PublicInputs,
private_inputs: &S::PrivateInputs
) -> (C, Vec<E::Fr>)
[src]
public_parameters: &PublicParams<'a, E, S>,
public_inputs: &S::PublicInputs,
private_inputs: &S::PrivateInputs
) -> (C, Vec<E::Fr>)
impl<'a, H: 'a + Hasher> ProofScheme<'a> for MerklePoR<H>
[src]
type PublicParams = PublicParams
type SetupParams = SetupParams
type PublicInputs = PublicInputs<H::Domain>
type PrivateInputs = PrivateInputs<'a, H>
type Proof = Proof<H>
type Requirements = NoRequirements
fn setup(sp: &SetupParams) -> Result<PublicParams>
[src]
fn prove<'b>(
pub_params: &'b Self::PublicParams,
pub_inputs: &'b Self::PublicInputs,
priv_inputs: &'b Self::PrivateInputs
) -> Result<Self::Proof>
[src]
pub_params: &'b Self::PublicParams,
pub_inputs: &'b Self::PublicInputs,
priv_inputs: &'b Self::PrivateInputs
) -> Result<Self::Proof>
fn verify(
pub_params: &Self::PublicParams,
pub_inputs: &Self::PublicInputs,
proof: &Self::Proof
) -> Result<bool>
[src]
pub_params: &Self::PublicParams,
pub_inputs: &Self::PublicInputs,
proof: &Self::Proof
) -> Result<bool>
fn prove_all_partitions<'b>(
pub_params: &'b Self::PublicParams,
pub_in: &'b Self::PublicInputs,
priv_in: &'b Self::PrivateInputs,
partition_count: usize
) -> Result<Vec<Self::Proof>>
[src]
pub_params: &'b Self::PublicParams,
pub_in: &'b Self::PublicInputs,
priv_in: &'b 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>
[src]
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
[src]
pub_in: Self::PublicInputs,
_k: Option<usize>
) -> Self::PublicInputs
fn satisfies_requirements(
_pub_params: &Self::PublicParams,
_requirements: &Self::Requirements,
_partitions: usize
) -> bool
[src]
_pub_params: &Self::PublicParams,
_requirements: &Self::Requirements,
_partitions: usize
) -> bool
impl<H: Default + Hasher> Default for MerklePoR<H>
[src]
impl<H: Debug + Hasher> Debug for MerklePoR<H>
[src]
Auto Trait Implementations
impl<H> Unpin for MerklePoR<H> where
H: Unpin,
H: Unpin,
impl<H> Sync for MerklePoR<H>
impl<H> Send for MerklePoR<H>
impl<H> RefUnwindSafe for MerklePoR<H> where
H: RefUnwindSafe,
H: RefUnwindSafe,
impl<H> UnwindSafe for MerklePoR<H> where
H: UnwindSafe,
H: UnwindSafe,
Blanket Implementations
impl<'a, L> ProofScheme<'a> for L where
L: Layers,
[src]
L: Layers,
type PublicParams = PublicParams<<L as Layers>::Hasher, <L as Layers>::Graph>
type SetupParams = SetupParams
type PublicInputs = PublicInputs<<<L as Layers>::Hasher as Hasher>::Domain>
type PrivateInputs = PrivateInputs<<L as Layers>::Hasher>
type Proof = Proof<<L as Layers>::Hasher>
type Requirements = ChallengeRequirements
fn setup(
&<L as ProofScheme<'a>>::SetupParams
) -> Result<<L as ProofScheme<'a>>::PublicParams, Error>
[src]
&<L as ProofScheme<'a>>::SetupParams
) -> Result<<L as ProofScheme<'a>>::PublicParams, Error>
fn prove(
&'b <L as ProofScheme<'a>>::PublicParams,
&'b <L as ProofScheme<'a>>::PublicInputs,
&'b <L as ProofScheme<'a>>::PrivateInputs
) -> Result<<L as ProofScheme<'a>>::Proof, Error>
[src]
&'b <L as ProofScheme<'a>>::PublicParams,
&'b <L as ProofScheme<'a>>::PublicInputs,
&'b <L as ProofScheme<'a>>::PrivateInputs
) -> Result<<L as ProofScheme<'a>>::Proof, Error>
fn prove_all_partitions(
&'b <L as ProofScheme<'a>>::PublicParams,
&'b <L as ProofScheme<'a>>::PublicInputs,
&'b <L as ProofScheme<'a>>::PrivateInputs,
usize
) -> Result<Vec<<L as ProofScheme<'a>>::Proof>, Error>
[src]
&'b <L as ProofScheme<'a>>::PublicParams,
&'b <L as ProofScheme<'a>>::PublicInputs,
&'b <L as ProofScheme<'a>>::PrivateInputs,
usize
) -> Result<Vec<<L as ProofScheme<'a>>::Proof>, Error>
fn verify_all_partitions(
&<L as ProofScheme<'a>>::PublicParams,
&<L as ProofScheme<'a>>::PublicInputs,
&[<L as ProofScheme<'a>>::Proof]
) -> Result<bool, Error>
[src]
&<L as ProofScheme<'a>>::PublicParams,
&<L as ProofScheme<'a>>::PublicInputs,
&[<L as ProofScheme<'a>>::Proof]
) -> Result<bool, Error>
fn with_partition(
<L as ProofScheme<'a>>::PublicInputs,
Option<usize>
) -> <L as ProofScheme<'a>>::PublicInputs
[src]
<L as ProofScheme<'a>>::PublicInputs,
Option<usize>
) -> <L as ProofScheme<'a>>::PublicInputs
fn satisfies_requirements(
&PublicParams<<L as Layers>::Hasher, <L as Layers>::Graph>,
&ChallengeRequirements,
usize
) -> bool
[src]
&PublicParams<<L as Layers>::Hasher, <L as Layers>::Graph>,
&ChallengeRequirements,
usize
) -> bool
fn verify(
_pub_params: &Self::PublicParams,
_pub_inputs: &Self::PublicInputs,
_proof: &Self::Proof
) -> Result<bool>
[src]
_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. Read more
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> SendSyncUnwindSafe for T where
T: Send + Sync + UnwindSafe + ?Sized,
[src]
T: Send + Sync + UnwindSafe + ?Sized,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,