Assert the form and represent an MDS matrix as a sparse MDS matrix

This is very pesky implementation of matrix inversion, It won't even alarm when a matrix is not invertable.

Returns original MDS matrix

`lhs * rhs * constant`

Constructs new hasher chip with assigned initial state

Constructs new hasher chip with assigned initial state

Constructs the transcript chip

Given number of round parameters constructs new Posedion instance calculating unoptimized round constants with reference `Grain` then calculates optim

Range of the partial products polynomials in the `zs_partial_products_commitment`.

Returns transition matrix for sparse trick

Second element of the state is the result

Applies sbox for all elements of the state. Only supports `alpha = 7` sbox case.

Partial round sbox applies sbox to the first element of the state. Only supports `alpha = 7` sbox case

Accepts a condition input which does not necessarily have to be binary. In this case, it computes the arithmetic generalization of `if b { x } else {

Returns sparse matrices for partial rounds

Constrain squeezing new challenge

Appends field elements to the absorbation line. It won't perform permutation here

A wire which stores `swap * (input[i + 4] - input[i])`; used to compute the swapped inputs.

A wire which stores the input of the `i`-th S-box of the `round`-th round of the first set of full rounds.

A wire which stores the input of the `i`-th S-box of the `round`-th round of the second set of full rounds.

The wire index for the `i`th input to the permutation.

The wire index for the `i`th output to the permutation.

A wire which stores the input of the S-box of the `round`-th round of the partial rounds.