Represents an element in the prime subgroup

The order of the group. It is the same than Fr.order

Minimal number of bytes required to encode a value of the group

Actual number of bytes allocated for a value of type t

Checks the bytes represent a point in the prime subgroup. The expected encoding is the same than Fq12.of_bytes_exn.

Same than Fq12.of_bytes_exn but also verifies the element is in the prime subgroup. Raise Not_in_group if the element is not in the prime subgroup.

Same than of_bytes_exn but returns an option instead of an exception.

Same than Fq12.to_bytes.

The neutral element of the subgroup. It is equal to Fq12.one.

is_zero x is equivalent to eq x zero

A generator of the group. It is set to the result of Pairing.pairing G1.one G2.one.

is_one x is equivalent to eq x one

Generate a random element. The function ensures the element is in the prime subgroup.

The routines in the module Random.State are used to generate the elements. A state can be given to the function to be used. If no state is given, Random.get_state is used.

To create a value of type Random.State.t, you can use Random.State.make [|42|].

add x y returns the sum of x and y. It is equivalent to Fq12.mul x y.

negate x returns the opposite of x. It is equivalent to Fq12.inverse_exn x.

mul x n returns [n] x, i.e. the result of adding x n-times with itself. It is equivalent to Fq12.pow x (Fr.to_z n)