Check if `cts` generate valid cosets of the roots of unity subgroup (of `domain_size`) of the field F. https://hackmd.io/CfFCbA0TTJ6X08vHg0-9_g

Returns the smallest power of two needed for the curcuit

Clears all data in the [`Prover`] instance. This function is used when the user wants to use the same `Prover` to make a [`Proof`] regarding a differ

Compress a vector of multisets into a single multiset using a RLC. A random challenge `alpha` needs to be provided. It is derived by hashing the trans

Computes the Quotient [`DensePolynomial`] given the [`EvaluationDomain`], a [`ProverKey`], and some other info.

Compute the linearisation polynomial.

Computes contribution to the quotient polynomial that ensures the gate constraints are satisfied.

Computes the gate constraint satisfiability portion of the linearisation polynomial.

Computes the arithmetic gate contribution to the linearisation polynomial at the given evaluation points.

Compute linearization for lookup gates

Computes the linearisation commitments.

Computes the commitment to `[r]_1`.

Computes arithmetic gate contribution to the linearisation polynomial commitment.

Computes the linearisation commitments.

Computes the permutation contribution to the quotient polynomial over `domain`.

Computes the arithmetic gate contribution to the quotient polynomial at the element of the domain at the given `index`.

Generates full benchmark suite for compiling, proving, and verifying.

Given an MDS matrix `m`, compute all its associated matrices.

Extends `scalars` and `points` to build the linearisation commitment with the given instantiation of `evaluations` and `separation_challenge`.

This trait requires `fmt` with this exact signature.

Constructs a [`VerifierKey`] from the widget VerifierKey's that are constructed based on the selector polynomial commitments and the sigma polynomial

Constructs a [`ProverKey`] from the widget ProverKey's that are constructed based on the selector polynomials and the sigma polynomials and it's evalu

Constructs [`PublicInputs`] from a positions and a values. Panics if the positions and values have different lenghts or if several values try to be i

Generates a proof using the provided [`ProverKey`] and [`ark_poly_commit::PCUniversalParams`]. Returns a [`crate::proof_system::Proof`] and the [`Publ

Generate all constants needed for poseidon hash of specified width. Note that WIDTH = ARITY + 1

Returns the position of non-zero PI values.

Returns the non-zero PI values.

return an identity matrix of size `n*n`

Returns an identity point.

Function builds a table from mutiple operations. If, for example, we are using lookup tables for both XOR and mul operataions, we can create a table w

check if `self` is square and `self[1..][1..]` is identity

Returns a reference to the contained [`VerifierKey`].

Keys the [`Transcript`] with additional seed information Wrapper around [`Transcript::append_message`]. [`Transcript`]: merlin::Transcript [`Transcri

Computes a linear combination of the polynomial evaluations and polynomial commitments provided a challenge. TODO: complete doc & use util::lc for eva

Computes the linearisation polynomial term for the given gate type at the `selector_polynomial` instantiated with `separation_challenge` and `values`.

Returns a matrix associated to `m` in the optimization of MDS matrices.

Returns a matrix associated to `m` in the optimization of MDS matrices.

Returns two vectors associated to `m` in the optimization of MDS matrices.

Creates an addition table for addends from the lower bound up to the upper bound 2^n

Returns a mutable copy of the underlying composer.

Derive MDS matrix of size `dim*dim` and relevant things

Creates a new `VerifierData` from a [`VerifierKey`] and the public input of the circuit that it represents.

Creates a Permutation struct with an expected capacity of zero.

Creates a new `Verifier` instance.

Creates a new struct for [`PublicInputs`].

Creates a new `Prover` instance.

Creates an empty vector with a multiset wrapper around it