Expand description
All the different proof types and their associated circuit
versions
to be used when proving (recursive) Stark
statements
Structs§
- A compressed proof format of a single STARK.
- A compressed
StarkProof
format of a single STARK with its public inputs. - A combination of STARK proofs for independent statements operating on possibly shared variables, along with Cross-Table Lookup (CTL) challenges to assert consistency of common variables across tables.
- Randomness for all STARK proofs contained in a
MultiProof
`. - Purported values of each polynomial at the challenge point.
- Circuit version of
StarkOpeningSet
.Target
s for the purported values of each polynomial at the challenge point. - Merkle caps and openings that form the proof of a single STARK.
- Randomness used for a STARK proof.
- Circuit version of
StarkProofChallenges
. - Circuit version of
StarkProof
. Merkle caps and openings that form the proof of a single STARK. - A
StarkProof
along with metadata about the initial Fiat-Shamir state, which is used when creating a recursive wrapper proof around a STARK proof. - Merkle caps and openings that form the proof of a single STARK, along with its public inputs.
- Circuit version of
StarkProofWithPublicInputs
.