Field Operations

Miden assembly provides a set of instructions which can perform operations with raw field elements. These instructions are described in the tables below.

While most operations place no restrictions on inputs, some operations expect inputs to be binary values, and fail if executed with non-binary inputs.

For instructions where one or more operands can be provided as immediate parameters (e.g., add and add.b), we provide stack transition diagrams only for the non-immediate version. For the immediate version, it can be assumed that the operand with the specified name is not present on the stack.

Assertions and tests

Instruction	Stack_input	Stack_output	Notes
assert - (1 cycle)	[a, ...]	[...]	If $a = 1$ , removes it from the stack. Fails if $a \neq = 1$
assertz - (2 cycles)	[a, ...]	[...]	If $a = 0$ , removes it from the stack, Fails if $a \neq = 0$
assert_eq - (2 cycles)	[b, a, ...]	[...]	If $a = b$ , removes them from the stack. Fails if $a \neq = b$
assert_eqw - (11 cycles)	[B, A, ...]	[...]	If $A = B$ , removes them from the stack. Fails if $A \neq = B$

The above instructions can also be parametrized with an error code which can be any 32-bit value specified either directly or via a named constant. For example:

assert.err=123
assert.err=MY_CONSTANT

If the error code is omitted, the default value of $0$ is assumed.

Arithmetic and Boolean operations

The arithmetic operations below are performed in a 64-bit prime filed defined by modulus $p = 2^{64} - 2^{32} + 1$ . This means that overflow happens after a value exceeds $p$ . Also, the result of divisions may appear counter-intuitive because divisions are defined via inversions.

Instruction	Stack_input	Stack_output	Notes
add - (1 cycle) add.b - (1-2 cycle)	[b, a, ...]	[c, ...]	$c \leftarrow (a + b) mod p$
sub - (2 cycles) sub.b - (2 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow (a - b) mod p$
mul - (1 cycle) mul.b - (2 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow (a \cdot b) mod p$
div - (2 cycles) div.b - (2 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow (a \cdot b^{- 1}) mod p$ Fails if $b = 0$
neg - (1 cycle)	[a, ...]	[b, ...]	$b \leftarrow - a mod p$
inv - (1 cycle)	[a, ...]	[b, ...]	$b \leftarrow a^{- 1} mod p$ Fails if $a = 0$
pow2 - (16 cycles)	[a, ...]	[b, ...]	$b \leftarrow 2^{a}$ Fails if $a > 63$
exp.uxx - (9 + xx cycles) exp.b - (9 + log2(b) cycles)	[b, a, ...]	[c, ...]	$c \leftarrow a^{b}$ Fails if xx is outside [0, 63) exp is equivalent to exp.u64 and needs 73 cycles
ilog2 - (44 cycles)	[a, ...]	[b, ...]	$b \leftarrow ⌊ l o g_{2} a ⌋$ Fails if $a = 0$
not - (1 cycle)	[a, ...]	[b, ...]	$b \leftarrow 1 - a$ Fails if $a > 1$
and - (1 cycle)	[b, a, ...]	[c, ...]	$c \leftarrow a \cdot b$ Fails if $ma x (a, b) > 1$
or - (1 cycle)	[b, a, ...]	[c, ...]	$c \leftarrow a + b - a \cdot b$ Fails if $ma x (a, b) > 1$
xor - (7 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow a + b - 2 \cdot a \cdot b$ Fails if $ma x (a, b) > 1$

Comparison operations

Instruction	Stack_input	Stack_output	Notes
eq - (1 cycle) eq.b - (1-2 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow {1, 0, if a = b otherwise$
neq - (2 cycle) neq.b - (2-3 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow {1, 0, if a \neq = b otherwise$
lt - (14 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow {1, 0, if a < b otherwise$
lte - (15 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow {1, 0, if a \leq b otherwise$
gt - (15 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow {1, 0, if a > b otherwise$
gte - (16 cycles)	[b, a, ...]	[c, ...]	$c \leftarrow {1, 0, if a \geq b otherwise$
is_odd - (5 cycles)	[a, ...]	[b, ...]	$b \leftarrow {1, 0, if a is odd otherwise$
eqw - (15 cycles)	[A, B, ...]	[c, A, B, ...]	$c \leftarrow {1, 0, if a_{i} = b_{i} \forall i \in {0, 1, 2, 3} otherwise$

Extension Field Operations

Instruction	Stack Input	Stack Output	Notes
ext2add - (5 cycles)	[b1, b0, a1, a0, ...]	[c1, c0, ...]	$c 1 \leftarrow (a 1 + b 1) mod p$ and $c 0 \leftarrow (a 0 + b 0) mod p$
ext2sub - (7 cycles)	[b1, b0, a1, a0, ...]	[c1, c0, ...]	$c 1 \leftarrow (a 1 - b 1) mod p$ and $c 0 \leftarrow (a 0 - b 0) mod p$
ext2mul - (3 cycles)	[b1, b0, a1, a0, ...]	[c1, c0, ...]	$c 1 \leftarrow (a 0 + a 1) * (b 0 + b 1) mod p$ and $c 0 \leftarrow (a 0 * b 0) - 2 * (a 1 * b 1) mod p$
ext2neg - (4 cycles)	[a1, a0, ...]	[a1', a0', ...]	$a 1^{'} \leftarrow - a 1$ and $a 0^{'} \leftarrow - a 0$
ext2inv - (8 cycles)	[a1, a0, ...]	[a1', a0', ...]	$a^{'} \leftarrow a^{- 1} mod q$ Fails if $a = 0$
ext2div - (11 cycles)	[b1, b0, a1, a0, ...]	[c1, c0,]	$c \leftarrow a * b^{- 1}$ fails if $b = 0$ , where multiplication and inversion are as defined by the operations above