AIR TRAIT ================================================================================================ Describes algebraic intermediate representa

Defines a zero-copy representation of `Self` as a sequence of bytes.

Wrapper around BLAKE3 hasher to implement [ByteWriter] trait for it.

Contains constraints all having the same divisor. The constraints are separated into single value constraints, small polynomial constraints, and large

Contains all boundary constraints defined for an instance of a computation. This includes constraints against the main segment of the execution trace

Boundary constraints for a computation. Boundary constraints are arranged into two categories: constraints against columns of the main trace segment,

Defines how primitive values are to be read from `Self`.

Defines how primitive values are to be written into `Self`.

COMPOSITION POLYNOMIAL ================================================================================================ Represents a composition polyn

Constraint evaluation commitment. The commitment consists of two components: Evaluations of composition polynomial columns over the LDE domain. Merkl

Container of constraint evaluation query data, including: Queried constraint evaluation values. Merkle authentication paths for all queries.

DEEP COMPOSITION POLYNOMIAL ================================================================================================

Provides a default implementation of the [ProverChannel] trait. Though this implementation is intended primarily for testing purposes, it can be used

Provides a default implementation of the [VerifierChannel] trait. Default verifier channel can be instantiated directly from a [FriProof] struct. Th

Defines how to deserialize `Self` from bytes.

Defines output type for a cryptographic hash function.

Defines a cryptographic hash function for hashing field elements. This trait defines a hash procedure for a sequence of field elements. The elements

Defines basic arithmetic in an extension of a StarkField of a given degree. This trait defines how to perform multiplication and compute a Frobenius

Specifies that a field is an extension of another field. Currently, this implies the following: - An element in the base field can be converted into

FIELD ELEMENT ================================================================================================ Defines an element in a finite field.

Implements the prover component of the FRI protocol. Given evaluations of a function *f* over domain *D* (`evaluations`), a FRI prover generates a pr

FRI VERIFIER ================================================================================================ Implements the verifier component of the

Defines a cryptographic hash function. This trait defined hash procedures for the following inputs: A sequence of bytes. Two digests - this is intend

A constraint where the numerator can be represented by p(x) - b(x), where b(x) is a large polynomial. In such cases, we pre-compute evaluations of b(x

Logging level selector for functions of this crate.

POSEIDON WITH 256-BIT OUTPUT =============================================================================================== Implementation of the [Ha

Defines a STARK prover for a computation. A STARK prover can be used to generate STARK proofs. The prover contains definitions of a computation's AIR

Defines an interface for a channel over which a prover communicates with a verifier. The prover uses this channel to send commitments to FRI layer po

Pseudo-random element generator for finite fields. A random coin can be used to draws elements uniformly at random from the specified base field (whi

Defines how `Self` can be read from a sequence of random bytes.

Implementation of [Hasher] trait for Rescue Prime hash function with 248-bit output. The hash function is implemented according to the Rescue Prime [

Implementation of [Hasher] trait for Rescue Prime hash function with 256-bit output. The hash function is implemented according to the Rescue Prime [

Defines how to serialize `Self` into bytes.

Implementation of the [Hasher](super::Hasher) trait for SHA3 hash function with 256-bit output.

Wrapper around SHA3 hasher to implement [ByteWriter] trait for it.

A constraint where the numerator can be represented by p(x) - v, where v is the asserted value, and p(x) is the trace polynomial for the column agains

Implements [ByteReader] trait for a slice of bytes.

A constraint where the numerator can be represented by p(x) - c(x), where b(x) is the polynomial describing a set of asserted values. This specializat

Defines an element in a STARK-friendly finite field. A STARK-friendly field is defined as a prime field with high two-addicity. That is, the the modu

TRACE TRAIT ================================================================================================ Defines an execution trace of a computati

Execution trace commitment. The describes one or more trace segments, each consisting of the following components: Evaluations of a trace segment's p

TRACE LOW DEGREE EXTENSION ================================================================================================ TODO: add docs