Computes the table of coefficients: `{eq(r, x) for all x in {0, 1}^n}`

Helper function to evaluate a uniform matrix at a specific point

Generates a lookup index where right operand is 111..000

bigger number is higher privilege level

Loads multiple bytes. This method takes virtual address and translates into physical address inside. # Arguments `v_address` Virtual address `width`

Loads eight bytes from main memory or peripheral devices depending on physical address. # Arguments `p_address` Physical address

Loads four bytes from main memory or peripheral devices depending on physical address. # Arguments `p_address` Physical address

Helpers for generator commitment keys used by Pedersen and AFGHO16

Reads multiple bytes from memory. # Arguments `address` `width` up to eight

Resets this table to be length 1, containing only the given `value`.

Stages 2-5 return sumcheck instances that will be batched together

Store an byte. This method takes virtual address and translates into physical address inside. # Arguments `v_address` Virtual address `value`

Write multiple bytes to memory. # Arguments `address` `value` `width` up to eight

Loads and runs all SHA256 rounds

Loads exactly 32 bytes from the transcript by hashing the seed with the round constant

Compute powers of scalar q : (1, q, q^2, ..., q^(len-1))

Clears the reservation for atomic memory operations

we require eval(0) + eval(1) = hint, so we can solve for the linear term as: linear_term = hint - 2 * constant_term - deg2 term - deg3 term

Computes the dot product of the polynomial's coefficients and a vector of field elements.

This is the old polynomial evaluation code that uses the dot product with langrange bases as the algorithm This might be eventually removed from the c

Fetches instruction four bytes. This method takes virtual address and translates into physical address inside. # Arguments `v_address` Virtual addres

Returns immutable reference to `Cpu`.

Returns mutable reference to `Cpu`.

Returns `PrivilegeMode` from encoded privilege mode bits

Compute the quadratic sumcheck evaluations (i.e., the evaluations at {0, 2, 3}) of a polynomial s(X) = l(X) * q(X), where l(X) is the current (linear)

Checks if a reservation is set for the given address

To be called in the beginning of each phase, before any binding

Combines two 32-bit values into a single 64-bit value by interleaving their bits. Takes even bits from the first argument and odd bits from the second