CONSTRAINT POLYNOMIAL COMPOSITION -------------------------------------------------------------------------------------------- Divides out OOD point z

Computes element-wise sum of the provided vectors, and stores the result in the first vector. When `concurrent` feature is enabled, the summation is

Adds the provided auxiliary segment trace LDE and Merkle tree to this trace commitment.

TRACE POLYNOMIAL COMPOSITION -------------------------------------------------------------------------------------------- Combines all trace polynomia

FINAL DEGREE ADJUSTMENT -------------------------------------------------------------------------------------------- Increase the degree of the DEEP c

DEGREE-RESPECTING PROJECTION ================================================================================================ Applies degree-respectin

Returns a list of transition constraint degree descriptors for auxiliary trace segments of a computation. This list will be identical to the list pas

Returns transition constraint info for constraints applied against auxiliary trace segments of a computation grouped by constraint degree.

Returns an iterator over the polynomials of all auxiliary trace segments.

Returns the number of columns in all auxiliary trace segments.

Returns number of columns in the auxiliary segments of the execution trace.

QUERY PHASE -------------------------------------------------------------------------------------------- Executes query phase of FRI protocol. For ea

Returns size of the constraint evaluation domain. This is guaranteed to be a power of two, and is equal to `trace_length * ce_blowup_factor`.

Generate a Groth16 proof that the Winterfell proof is correct. Only verifying the Groth16 proof attests of the validity of the Winterfell proof. This

Verify the Groth16 proof of the verification of the Winterfell proof. This function should be used alongside the [check_ood_frame](crate::check_ood_f

Returns collision resistance of this hash function in bits.

Returns index of the column against which this constraint applies.

Returns the length of individual column polynomials; this is guaranteed to be a power of 2.

Returns a mutable iterator over the columns of this matrix.

Commits the prover to the evaluations of the constraint composition polynomial.

For each queried set of composition polynomial column evaluations, combine evaluations into a single value by computing their random linear combinatio

For each queried trace state, combines column values into a single value by computing their random linear combinations as follows: - Assume each colu

Returns the degree of the divisor polynomial

Draws a set of positions at which the polynomial evaluations committed at the first FRI layer should be queried. The positions are pseudo-randomly ge

Returns the next triplet of pseudo-random field elements. # Errors Returns an error if any of the field elements could not be generated after 100 cal

Evaluates boundary constraints against all segments of an execution trace at the specified step of constraint evaluation domain. Specifically, `step`

Returns evaluations of all composition polynomial columns at point z^m, where m is the number of column polynomials.

Evaluates all trace polynomials (across all trace segments) at the specified point `x`.

CONSTRAINT EVALUATOR -------------------------------------------------------------------------------------------- Evaluates this constraint at the spe

Evaluates constraints for the specified evaluation frame.

Evaluates constraints for a single fragment of the evaluation table. This evaluates constraints only over all segments of the execution trace (i.e. m

Evaluates constraints for a single fragment of the evaluation table. This evaluates constraints only over the main segment of the execution trace.

Returns exemption points (the denominator portion) of this constraints divisor.

Returns modulus of the field for the computation described by this context.

Returns the first step of the execution trace against which this assertion is placed. For single value assertions this is equivalent to the assertion

Transmutes a vector of `n` arrays each of length `N`, into a vector of `N` * `n` elements. This function just re-interprets the underlying memory and

Break the table into the number of specified fragments. All fragments can be updated independently - e.g. in different threads.

Returns value of the cell in the specified column at the specified row of this trace.

Returns a reference to a [Matrix] representing an auxiliary trace segment at the specified index.

Returns the number of random elements required by the auxiliary trace segment at the specified index.

Returns a set of random elements required for constructing an auxiliary trace segment with the specified index. The elements are drawn from the publi

Returns a reference to the column at the specified index.

Computes conjectured security level for the specified proof parameters.

When field extension is used, returns conjugate values of the `trace_state` and `z`; otherwise, returns None.

Returns a set of coefficients for constructing a constraint composition polynomial. The coefficients are drawn from the public coin uniformly at rand

Returns coefficients needed for random linear combinations during construction of DEEP composition polynomial.

Returns a set of coefficients for constructing a DEEP composition polynomial. The coefficients are drawn from the public coin uniformly at random.

Returns a vector of all boundary constraint divisors.

Returns trace info for this trace.