Returns a polynomial resulting from dividing one polynomial by another. Specifically, divides polynomial `a` by polynomial `b` and returns the result

Returns a divisor applicable to all boundary constraints in this group.

Returns the offset by which the low-degree extension domain is shifted in relation to the trace domain. Currently, this is hard-coded to the primitiv

Returns the offset by which the domain for low-degree extension is shifted in relation to the execution trace domain.

Returns size of the domain over which a polynomial commitment checked by this verifier has been evaluated. The domain size can be computed by roundin

Returns a new alpha drawn from the public coin.

LOW-DEGREE EXTENSION -------------------------------------------------------------------------------------------- Evaluates the columns of the composi

EVALUATOR -------------------------------------------------------------------------------------------- Evaluates constraints against the provided exte

Evaluates all constraints in this group at the specified point `x`. `xp` is a degree adjustment multiplier which must be computed as `x^degree_adjust

Evaluates polynomial `p` in-place over the domain of length `p.len()` in the field specified by `B` using the FFT algorithm.

Evaluates polynomial `p` using FFT algorithm; the evaluation is done in-place, meaning `p` is updated with results of the evaluation.

Evaluates polynomial `p` over the domain of length `p.len()` * `blowup_factor` shifted by `domain_offset` in the field specified `B` using the FFT alg

Evaluates polynomial `p` using FFT algorithm and returns the result. The polynomial is evaluated over domain specified by `twiddles`, expanded by the

SEQUENTIAL OPS ================================================================================================

Computes and returns the size of the remainder layer (the last FRI layer) for a domain of the specified size. The size of the remainder layer for a g

Converts a 128-bit value into a field element. If the value is greater than or equal to the field modulus, modular reduction is silently performed.

Converts a 128-bit value into a field element. If the value is greater than or equal to the field modulus, modular reduction is silently performed.

Converts a 128-bit value into a field element. If the value is greater than or equal to the field modulus, modular reduction is silently performed.

Converts 256-bit value into field element. If the value is greater than or equal to the field modulus, modular reduction is silently applied.

Builds a divisor for a boundary constraint described by the assertion. For boundary constraints, the divisor polynomial is defined as: $$ z(x) = x^k

Returns a [BoundaryConstraintGroup] created from the specified group of constraints against auxiliary segments of an execution trace. Constraints agai

Returns a STARK proof read from the specified `source`. # Errors Returns an error of a valid STARK proof could not be read from the specified `source

CONSTRUCTORS -------------------------------------------------------------------------------------------- Returns a new [Table] instantiated with data

Returns a [BoundaryConstraintGroup] created from the specified group of constraints against the main segment of an execution trace. Constraints agains

Constructs a batch Merkle proof from individual Merkle authentication paths. # Panics Panics if: No paths have been provided (i.e., `paths` is an emp