Struct ark_marlin::IndexProverKey

pub struct IndexProverKey<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>> {
    pub index_vk: IndexVerifierKey<F, PC>,
    pub index_comm_rands: Vec<PC::Randomness>,
    pub index: Index<F>,
    pub committer_key: PC::CommitterKey,
}

Proving key for a specific index (i.e., R1CS matrices).

Fields

index_vk: IndexVerifierKey<F, PC>

The index verifier key.

index_comm_rands: Vec<PC::Randomness>

The randomness for the index polynomial commitments.

index: Index<F>

The index itself.

committer_key: PC::CommitterKey

The committer key for this index, trimmed from the universal SRS.

Trait Implementations

impl<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>> CanonicalDeserialize for IndexProverKey<F, PC>

fn deserialize<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads Self from reader.

fn deserialize_uncompressed<R: Read>(
    reader: R
) -> Result<Self, SerializationError>

Reads Self from reader without compression.

fn deserialize_unchecked<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads self from reader without compression, and without performing validity checks. Should be used only when the input is trusted.

impl<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>> CanonicalSerialize for IndexProverKey<F, PC>

fn serialize<W: Write>(&self, writer: W) -> Result<(), SerializationError>

Serializes self into writer. It is left up to a particular type for how it strikes the serialization efficiency vs compression tradeoff. For standard types (e.g. bool, lengths, etc.) typically an uncompressed form is used, whereas for algebraic types compressed forms are used.

fn serialized_size(&self) -> usize

fn serialize_uncompressed<W: Write>(
    &self,
    writer: W
) -> Result<(), SerializationError>

Serializes self into writer without compression.

fn serialize_unchecked<W: Write>(
    &self,
    writer: W
) -> Result<(), SerializationError>

Serializes self into writer without compression, and without performing validity checks. Should be used only when there is no danger of adversarial manipulation of the output.

fn uncompressed_size(&self) -> usize

impl<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>> Clone for IndexProverKey<F, PC> where
    PC::Commitment: Clone, 

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.