Demuxing like in the Galois paper.

Matrix multiplication with the transpose of :py:obj:`self` in the virtual machine. :param self: :py:class:`Matrix` / 2-dimen

Secret dot product. :param x: iterable of appropriate secret type :param y: iterable of appropriate secret type and same length

Secret comparison. :param other: sgf2n/cgf2n/regint/int :return: 0/1 (sgf2n)

Look up subtree-min of stash and extract it by linear scanning the structure. Then, evict along the extracted path, and finally, update_min al

i = 0..3

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

Returns the thread argument.

Read an 8-byte integer

Secret random n-bit number according to security model. :param bits: compile-time integer (int) :param size: vector size (int, defau

Secret power of two. :param bit_length: bit length of input (default: global bit length)

Public input read from ``Programs/Public-Input/<progname>``.

Reset reading

Reveal as list.

r""" Sort in place according to "perfect" key. The name hints at the fact that a random order of the keys is revealed. :param k: vector or Ar

r""" Sort in place using `radix sort <https://eprint.iacr.org/2014/121>`_ with complexity :math:`O(n \log n)` for :py:class:`s

Convert a 4 character string to an integer.

Update subtree_min entries on the path from the specified leaf to the root bucket (and stash) by finding the current min entry of ever