Map the word to other types

Returns the length of the byte array.

Return values in little-endian.

Creates a [`BaseTester`]

Query advice of WordLibs of columns advice

Changes the number of rows in the circuit to 2^k. By default it will also set lookup bits as large as possible, to `k - 1`.

Returns the [AssignedValue] of the cell at the given `offset` in the `advice` column of [Context] `offset`: the offset of the cell to be fetched `offs

Returns a mutable reference to the [Context] of a gate thread. Spawns a new thread for the given phase, if none exists. `phase`: The challenge phase (

Assigns a witness value and returns the corresponding assigned cell. `witness`: the witness value to be assigned

If using `UnsafeFieldPoint`, make sure multiplication does not cause overflow.

Run a mock test by providing a closure that uses a `ctx` and `GateChip`. - `expect_satisfied`: flag for whether you expect the test to pass or fail. F

Assigns a region of witness cells in an iterator and returns a [Vec] of assigned cells. `witnesses`: Iterator that specifies the cells to be assigned

Run a mock test by providing a closure that uses a `ctx` and `RangeChip`. - `expect_satisfied`: flag for whether you expect the test to pass or fail.

Sets the size of the lookup table used for range checks to [0, 2^lookup_bits)

Pushes multiple advice cells to the `advice` column of [Context] and enables them by enabling the corresponding selector specified in `gate_offset`.

Returns the [AssignedValue] of the last cell in the `advice` column of [Context] or [None] if `advice` is empty

Wrapper for [ConstraintSystem].create_gate(name, meta) creates a gate form [q * (a + b * c - out)]. `meta`: [ConstraintSystem] used for the gate

Returns the inner [`FlexGateConfig`]

Returns the number of bits represented in the lookup table [0,2^^lookup_bits).

Assigns a constant value and returns the corresponding assigned cell. `c`: the constant value to be assigned

Constrains and returns `a + b * 1 = out`. Defines a vertical gate of form | a | b | 1 | a + b | where (a + b) = out. `ctx`: [Context] to add the cons

signed overflow BigInt functions

Converts an immutable reference to an PrimeField element into a [BigUint] element. `fe`: immutable reference to PrimeField element to convert

Constrains and returns the inner product of `<a, b>`. If the first element of `b` is `Constant(F::ONE)`, then an optimization is performed to save 3 c

exp is in little-endian # Assumptions `a` is nonzero field point

Constrains and returns `a & b`, assumeing `a` and `b` are boolean. Defines a vertical gate of form | 0 | a | b | out |, where out = a * b. `ctx`: [Co

Runs keygen, real prover, and verifier by providing a closure that uses a `builder` and `RangeChip`. Must provide `init_input` for use during key gen

Auto-calculates configuration parameters for the circuit and sets them. `k`: The number of in the circuit (i.e. numeber of rows = 2^k) `min

Checks and constrains that `a` lies in the range [0, 2^range_bits). This is done by decomposing `a` into `num_limbs` limbs, where `num_limb

Constrains that `a` is equal to `constant` value. `ctx`: [Context] to add the constraints to `a`: [QuantumCell] value `constant`: constant value to co

we precompute lambda and constrain (2y) * lambda = 3 x^2 (mod p) then we compute x_3 = lambda^2 - 2 x (mod p) y_3 = lambda (x - x_3) - y (mod p) # Ass

The high 128 bits limb

the low 128 bits limb

Constrains and returns `a + b * (-1) = out`. Defines a vertical gate of form | a - b | b | 1 | a |, where (a - b) = out. `ctx`: [Context] to add the

Returns new with `k` set

Returns `a / b` without constraining `b` to be nonzero. Warning: undefined behavior when `b` is zero. `a, b` must be such that `quot * b - a` withou

For testing use only: Helper function to generate a proof **without public instances** with real prover using SHPLONK KZG multi-open polynomical commi

Constrains and returns a [Vec] `indicator` of length `len`, where `indicator[i] == 1 if i == idx otherwise 0`, if `idx >= len` then `indicator` is all

Perform permutation on this state. ATTETION: inputs.len() needs to be fixed at compile time. Assume len <= inputs.len(). `inputs` is right padded. If

Virtually assigns the `input` within the current [Context], with different handling depending on the [QuantumCell] variant.

Pushes multiple advice cells to the `advice` column of [Context] and enables them by enabling the corresponding selector specified in `gate_offset` an

The break points of the circuit.

For testing only: Helper function to verify a proof (generated using [`gen_proof`]) without public instances using SHPLONK KZG multi-open polynomical

Implements: Given P = (x_1, y_1) and Q = (x_2, y_2), ecc points over the field F_p assume x_1 != x_2 Find ec addition P + Q = (x_3, y_3) By solving: l

Assigns the 0 value to a new cell or returns a previously assigned zero cell from `zero_cell`.

Constrains and returns `0 + a * b = out`. Defines a vertical gate of form | 0 | a | b | a * b |, where (a * b) = out. `ctx`: [Context] to add the co

Creates an equality constraint between two `advice` cells. `a`: the first `advice` cell to be constrained equal `b`: the second `advice` cell to be co

returns (a-b, underflow), where underflow is nonzero iff a < b # Assumptions `a, b` are proper CRT representations of integers with the same number of

Specify whether you expect this test to pass or fail. Default: pass

Load affine point as private witness. Constrains witness to lie on curve. Does not allow (0, 0) point,

Implements: Given P = (x_1, y_1) and Q = (x_2, y_2), ecc points over the field F_p Find ecc subtraction P - Q = (x_3, y_3) -Q = (x_2, -y_2) lambda = -

Constrains whether `a` is in `[0, b)`, and returns 1 if `a` < `b`, otherwise 0. a: first [QuantumCell] to compare b: second [QuantumCell] to compare

Does not constrain witness to lie on curve

Creates a new [RangeChip] sharing the same [LookupAnyManager]s as `self`.

Consume buffer and perform permutation, then output second element of state.

Returns vector of `is_final`, `length`, `hash.lo`, `hash.hi` for assigned rows

Clear all consts.

Debug helper function for writing negative tests. This will change the **witness** value in `ctx` corresponding to `self.offset`. This assumes that `c

computes a ** (p ** power) only works for p = 3 (mod 4) and p = 1 (mod 6)

Initialize necessary consts of hasher. Must be called before any computation.

Constrains that a cell is equal to 0 and returns `1` if `a = 0`, otherwise `0`. Defines a vertical gate of form `| out | a | inv | 1 | 0 | a | out |

Constrains and returns `a * b + c = out`. Defines a vertical gate of form | c | a | b | a * b + c |, where (a * b + c) = out. `ctx`: [Context] to ad

Constrains and returns little-endian bit vector representation of `a`. Assumes `range_bits >= number of bits in a`. `a`: [QuantumCell] of the value t

Constrains and set self to a specific state if `selector` is true.