Pushes chosen value onto the end of the Multiset

Add Input first calls the Permutation to generate and allocate a new [`Variable`] `var`. The Composer then links the variable to the [`PrimeField`] a

Function used to generate any arithmetic gate with fan-in-2 or fan-in-3.

Extendes values onto the end of the Multiset

Returns the cardinality of the multiset

Get the evaluation of the specified label. This funtions panics if the requested label is not found

Returns the length of the `LookupTable` vector.

Maps a set of [`Variable`]s (a,b,c,d) to a set of [`Wire`](WireData)s (left, right, out, fourth) with the corresponding gate index

Inserts all the elements of `iter` converted into constraint field elements in consecutive positions. Returns the number of field elements occupied by

Witness representation of zero of the first variable of any circuit

Inserts public input data that can be converted to one or more field elements starting at a given position. Returns the number of field elements occup

Creates a new [`Variable`] by incrementing the index of the `variable_map`. This is correct as whenever we add a new [`Variable`] into the system It i

Constrain a [`Variable`] to be equal to a specific constant value which is part of the circuit description and NOT** a Public Input. ie. this value wi

Inserts a new public input value at a given position. If the value provided is zero no insertion will be made as zeros are the implicit value of empt

Add a constraint into the circuit description that states that two [`Variable`]s are equal.

Asserts that a [`Point`] in the circuit is equal to a known public point.

return `vec @ self`, treat `vec` as a row vector.

Computes `f(f-1)(f-2)(f-3)`

Adds an elliptic curve scalar multiplication gate to the circuit description. # Note This function is optimized for fixed base ops **ONLY** and ther

Returns a mutable copy of the underlying [`StandardComposer`].

Adds a range-constraint gate that checks and constrains a [`Variable`] to be inside of the range \[0,num_bits\]. This function adds `num_bits/4` gate

Returns the smallest power of two needed for the curcuit.

Insert a new row

Adds two curve points together using a curve addition gate Note that since the points are not fixed the generator is not a part of the circuit descrip

Adds a width-3 poly gate. This gate gives total freedom to the end user to implement the corresponding circuits in the most optimized way possible bec

Fetches last element in MultiSet. Returns None if there are no elements in the MultiSet.

Linear combination of a series of values For values [v_0, v_1,... v_k] returns: v_0 + challenge * v_1 + ... + challenge^k * v_k

This function takes in a precomputed look up table and pads it to the length of the circuit entries, as a power of 2. The function then interpolates a

Adds a boolean constraint (also known as binary constraint) where the gate eq. will enforce that the [`Variable`] received is either `0` or `1` by add

Conditionally selects a [`Variable`] based on an input bit. If: bit == 1 => choice_a, bit == 0 => choice_b, # Note The `bit` used as input which is

Returns a reference to the [`PublicInputs`] stored in the [`StandardComposer`].

return `self @ other`

Adds a logical XOR gate that performs the XOR between two values for the specified first `num_bits` returning a [`Variable`] holding the result. # Pa

Fixes a [`Variable`] in the witness to be a part of the circuit description.

Asserts that a point in the circuit is equal to another point in the circuit.

Returns the round numbers for a given width `t`. Here, the `security_margin` parameter does not indicate that we are calculating `R_F` and `R_P` for t

Performs shift by one permutation and computes `sigma_1`, `sigma_2` and `sigma_3`, `sigma_4` permutations from the variable maps.

Computes `f(f-1)(f-2)(f-3)`.

Input 3 inputs \[w1, w2, w3\], four selectors \[q1, q2, q3, qc, qo\], constraint the following statement: ``` ignore q1 w^5 + q2 w2^5 + q3 w3^5 + q4 +

A gate which outputs a variable whose value is 1 if the input is 0 and whose value is 0 otherwise

Input 3 inputs \[w1, w2, w3\], four selectors \[q1, q2, q3, qc, qo\], constraint the following statement: ``` ignore q1 w^5 + q2 w2^5 + q3 w3^5 + q4 +

Returns a reference to the contained Public Input .

Convert variables to their actual witness values.

Insert data in the PI starting at the given position and stores the occupied positions as intended for public inputs.

Returns the public inputs as a vector of `n` evaluations. The provided `n` must be a power of 2.

Returns the smallest power of two needed for the circuit.

Computes the permutation term of the linearisation polynomial.

input one field element to Poseidon. Return the position of the element in state.

input one field element to Poseidon. Return the position of the element in state.

Function builds a table from more than one operation. This is denoted as 'Multiple Tables' in the paper. If, for example, we are using lookup tables f

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

Insert a new row for an XOR operation. This function needs to know the upper bound of the amount of XOR operations that will be done in the plookup t

Returns whether or not the multiset is empty.

return `self @ vec`, treating `vec` as a column vector.

Adds a plookup gate to the circuit with its corresponding constraints.

Output the hash

Proves a circuit is satisfied, then clears the witness variables If the circuit is not pre-processed, then the preprocessed circuit will also be compu

Performs row operations to put a matrix in upper triangular form. Each row operation is performed on `shadow` as well to keep track of their cumulativ

Converts an embeded curve point into a constraint system Point without constraining the values

Resets the witnesses in the prover object. This function is used when the user wants to make multiple proofs with the same circuit.

Combines two multisets and splits them into alternating halves of the same length, subject to the ordering in the multiset calling the method (t). All

The first lagrange polynomial has the expression: ```text L_0(X) = mul_from_1_to_(n-1) [(X - omega^i) / (1 - omega^i)] ``` with `omega` being the ge

Computes the first lagrange polynomial with the given `scale` over `domain`.

This can be adapted into a general product argument for any number of wires, with specific formulas defined in the numerator_irreducible and denominat

Computes permutation term of the quotient polynomial at the `i`th domain point.

Computes the sigma polynomials which are used to build the permutation polynomial.