plonky2/starky/src/proof.rs

137 lines
4.6 KiB
Rust
Raw Normal View History

use plonky2::field::extension_field::Extendable;
2022-01-27 12:58:56 +01:00
use plonky2::fri::oracle::PolynomialBatch;
2022-02-07 10:41:52 +01:00
use plonky2::fri::proof::{CompressedFriProof, FriChallenges, FriProof, FriProofTarget};
2022-01-31 18:00:07 +01:00
use plonky2::fri::structure::{FriOpeningBatch, FriOpenings};
2022-02-07 10:41:52 +01:00
use plonky2::hash::hash_types::{MerkleCapTarget, RichField};
use plonky2::hash::merkle_tree::MerkleCap;
2022-02-07 10:41:52 +01:00
use plonky2::iop::ext_target::ExtensionTarget;
use plonky2::iop::target::Target;
use plonky2::plonk::config::GenericConfig;
2022-01-27 12:58:56 +01:00
use rayon::prelude::*;
pub struct StarkProof<F: RichField + Extendable<D>, C: GenericConfig<D, F = F>, const D: usize> {
/// Merkle cap of LDEs of trace values.
pub trace_cap: MerkleCap<F, C::Hasher>,
2022-01-29 12:49:00 +01:00
/// Merkle cap of LDEs of trace values.
pub quotient_polys_cap: MerkleCap<F, C::Hasher>,
/// Purported values of each polynomial at the challenge point.
pub openings: StarkOpeningSet<F, D>,
/// A batch FRI argument for all openings.
pub opening_proof: FriProof<F, C::Hasher, D>,
}
2022-02-07 10:41:52 +01:00
pub struct StarkProofTarget<const D: usize> {
pub trace_cap: MerkleCapTarget,
pub quotient_polys_cap: MerkleCapTarget,
pub openings: StarkOpeningSetTarget<D>,
pub opening_proof: FriProofTarget<D>,
}
2022-01-29 12:49:00 +01:00
pub struct StarkProofWithPublicInputs<
F: RichField + Extendable<D>,
C: GenericConfig<D, F = F>,
const D: usize,
> {
pub proof: StarkProof<F, C, D>,
2022-02-01 17:34:03 +01:00
// TODO: Maybe make it generic over a `S: Stark` and replace with `[F; S::PUBLIC_INPUTS]`.
2022-01-29 12:49:00 +01:00
pub public_inputs: Vec<F>,
}
2022-02-07 10:41:52 +01:00
pub struct StarkProofWithPublicInputsTarget<const D: usize> {
pub proof: StarkProofTarget<D>,
pub public_inputs: Vec<Target>,
}
pub struct CompressedStarkProof<
F: RichField + Extendable<D>,
C: GenericConfig<D, F = F>,
const D: usize,
> {
/// Merkle cap of LDEs of trace values.
pub trace_cap: MerkleCap<F, C::Hasher>,
/// Purported values of each polynomial at the challenge point.
pub openings: StarkOpeningSet<F, D>,
/// A batch FRI argument for all openings.
pub opening_proof: CompressedFriProof<F, C::Hasher, D>,
}
2022-01-29 12:49:00 +01:00
pub struct CompressedStarkProofWithPublicInputs<
F: RichField + Extendable<D>,
C: GenericConfig<D, F = F>,
const D: usize,
> {
pub proof: CompressedStarkProof<F, C, D>,
pub public_inputs: Vec<F>,
}
pub(crate) struct StarkProofChallenges<F: RichField + Extendable<D>, const D: usize> {
2022-02-03 11:49:44 +01:00
/// Random values used to combine STARK constraints.
2022-01-29 12:49:00 +01:00
pub stark_alphas: Vec<F>,
2022-02-03 11:49:44 +01:00
/// Point at which the STARK polynomials are opened.
2022-01-29 12:49:00 +01:00
pub stark_zeta: F::Extension,
2022-01-31 18:00:07 +01:00
pub fri_challenges: FriChallenges<F, D>,
2022-01-29 12:49:00 +01:00
}
/// Purported values of each polynomial at the challenge point.
pub struct StarkOpeningSet<F: RichField + Extendable<D>, const D: usize> {
pub local_values: Vec<F::Extension>,
pub next_values: Vec<F::Extension>,
pub permutation_zs: Vec<F::Extension>,
2022-02-03 11:49:44 +01:00
pub permutation_zs_right: Vec<F::Extension>,
pub quotient_polys: Vec<F::Extension>,
}
2022-01-27 12:58:56 +01:00
impl<F: RichField + Extendable<D>, const D: usize> StarkOpeningSet<F, D> {
pub fn new<C: GenericConfig<D, F = F>>(
zeta: F::Extension,
g: F::Extension,
trace_commitment: &PolynomialBatch<F, C, D>,
quotient_commitment: &PolynomialBatch<F, C, D>,
) -> Self {
let eval_commitment = |z: F::Extension, c: &PolynomialBatch<F, C, D>| {
c.polynomials
.par_iter()
.map(|p| p.to_extension().eval(z))
.collect::<Vec<_>>()
};
Self {
local_values: eval_commitment(zeta, trace_commitment),
next_values: eval_commitment(zeta * g, trace_commitment),
2022-01-27 13:27:06 +01:00
permutation_zs: vec![/*TODO*/],
2022-02-03 11:49:44 +01:00
permutation_zs_right: vec![/*TODO*/],
2022-01-27 12:58:56 +01:00
quotient_polys: eval_commitment(zeta, quotient_commitment),
}
}
2022-01-29 12:49:00 +01:00
2022-01-31 18:00:07 +01:00
pub(crate) fn to_fri_openings(&self) -> FriOpenings<F, D> {
let zeta_batch = FriOpeningBatch {
values: [
self.local_values.as_slice(),
self.quotient_polys.as_slice(),
self.permutation_zs.as_slice(),
]
.concat(),
};
let zeta_right_batch = FriOpeningBatch {
2022-02-03 11:49:44 +01:00
values: [
self.next_values.as_slice(),
self.permutation_zs_right.as_slice(),
]
.concat(),
2022-01-31 18:00:07 +01:00
};
FriOpenings {
batches: vec![zeta_batch, zeta_right_batch],
}
}
2022-01-27 12:58:56 +01:00
}
2022-02-07 10:41:52 +01:00
pub struct StarkOpeningSetTarget<const D: usize> {
pub local_values: Vec<ExtensionTarget<D>>,
pub next_values: Vec<ExtensionTarget<D>>,
pub permutation_zs: Vec<ExtensionTarget<D>>,
pub permutation_zs_right: Vec<ExtensionTarget<D>>,
pub quotient_polys: Vec<ExtensionTarget<D>>,
}