* Simulate an execution of KeyGen to check that these nplayers seeds * produce the correct public key. */

Cholesky decomposition. :returns: lower triangular matrix

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

Clear integer lev, secret gf2n levstar (rep. as power of 2 with Counter object).

Convert a `NetworkX directed graph <https://networkx.org/documentation/stable/reference/classes/digraph.html>`_ to the cleartext representati

Creates a new PositionMap. This is the method one should call when needing a new position map. Depending on the size of the given data, it

Create the program dependency graph.

Matrix diagonal.

Clear hashing (libsodium default).

Distributed Decryption Stuff */

Merge an iterable of nodes in G, returning the number of merged instructions and the index of the merged instruction.

Do-while loop. The loop is stopped if the return value is zero. It must be public. The following executes exactly once: .. code:: @

Insecure.

Equality with clear int

Compute evaluation after training. :param data: sample data (:py:class:`Compiler.types.Matrix` with one row per sample) :param top: