Write the program's byte encoding to a file.

Write the sequence of instructions to a file.

Approximate reciprocal of [b]: Given [b], compute [1/b]

res = last carry bit in addition of a and b a: array of clear bits b: array of secret bits (same length as a) c: initial carry-in bi

Little-endian version

M-Code Version ***********/ Check can support this

################################################################### */

Compute cyclotomic polynomial */

Goldschmidt method as presented in Catrina10,

Find a (2m)'th primitive root moduli the current prime * This is deterministic so all players have the same root of unity * poly is Phi_m(X) */

Find a m'th primitive root moduli the current prime * This is deterministic so all players have the same root of unity * poly is Phi_m(X) */

Invert a non-zero value

Computes the FFT via Horner's Rule theta is assumed to be an Nth root of unity */

Create an ORAM instance suitable for the size based on experiments. This uses :py:class:`LinearORAM` for sizes up to a few thousand and :py:c

r = random secret integer in range [0, 2^k - 1]

S = U*A*V

################################################################### */

Oblivious truncation by secret m

Clear equality test. :param other: cint/regint/int :return: 0/1 (regint)

Set prime p and the initial instructions and registers.

Clear comparison. :param other: cint/regint/int :return: 0/1 (regint)