Struct CtProver 

pub struct CtProver { /* private fields */ }

Implementations

impl CtProver

pub fn new() -> Self

pub fn prove( &self, witness: &CtWitness, ) -> Result<(Vec<u8>, CtPublicInputs), String>

Generate a STARK proof for a confidential transfer. Returns (proof_bytes, public_inputs).

Trait Implementations

impl Prover for CtProver

type BaseField = BaseElement

Base field for the computation described by this prover.

type Air = CtAir

Algebraic intermediate representation (AIR) for the computation described by this prover.

type Trace = TraceTable<BaseElement>

Execution trace of the computation described by this prover.

type HashFn = Rp64_256

Hash function to be used.

type VC = MerkleTree<Rp64_256>

Vector commitment scheme to be used.

type RandomCoin = DefaultRandomCoin<Rp64_256>

PRNG to be used for generating random field elements.

type TraceLde<E: FieldElement<BaseField = BaseElement>> = DefaultTraceLde<E, Rp64_256, MerkleTree<Rp64_256>>

Trace low-degree extension for building the LDEs of trace segments and their commitments.

type ConstraintEvaluator<'a, E: FieldElement<BaseField = BaseElement>> = DefaultConstraintEvaluator<'a, CtAir, E>

Constraints evaluator used to evaluate AIR constraints over the extended execution trace.

type ConstraintCommitment<E: FieldElement<BaseField = BaseElement>> = DefaultConstraintCommitment<E, Rp64_256, MerkleTree<Rp64_256>>

Constraint low-degree extension for building the LDEs of composition polynomial columns and their commitments.

fn get_pub_inputs(&self, trace: &Self::Trace) -> CtPublicInputs

Returns a set of public inputs for an instance of the computation defined by the provided trace.

fn options(&self) -> &ProofOptions

Returns ProofOptions which this prover uses to generate STARK proofs.

fn new_trace_lde<E: FieldElement<BaseField = BaseElement>>( &self, trace_info: &TraceInfo, main_trace: &ColMatrix<BaseElement>, domain: &StarkDomain<BaseElement>, partition_option: PartitionOptions, ) -> (Self::TraceLde<E>, TracePolyTable<E>)

Takes the main trace segment columns as input, interpolates them into polynomials in coefficient form, and evaluates the polynomials over the LDE domain.

fn new_evaluator<'a, E: FieldElement<BaseField = BaseElement>>( &self, air: &'a Self::Air, aux_rand_elements: Option<AuxRandElements<E>>, composition_coefficients: ConstraintCompositionCoefficients<E>, ) -> Self::ConstraintEvaluator<'a, E>

Returns a new constraint evaluator which can be used to evaluate transition and boundary constraints over the extended execution trace.

fn build_constraint_commitment<E: FieldElement<BaseField = BaseElement>>( &self, composition_poly_trace: CompositionPolyTrace<E>, num_constraint_composition_columns: usize, domain: &StarkDomain<BaseElement>, partition_options: PartitionOptions, ) -> (Self::ConstraintCommitment<E>, CompositionPoly<E>)

Extends constraint composition polynomial over the LDE domain and builds a commitment to its evaluations.

fn build_aux_trace<E>( &self, main_trace: &Self::Trace, aux_rand_elements: &AuxRandElements<E>, ) -> ColMatrix<E>

where E: FieldElement<BaseField = Self::BaseField>,

Builds and returns the auxiliary trace.

fn prove(&self, trace: Self::Trace) -> Result<Proof, ProverError>

where <Self::Air as Air>::PublicInputs: Send,

Returns a STARK proof attesting to a correct execution of a computation defined by the provided trace.