The order of the finite field

minimal number of bytes required to encode a value of the field.

check_bytes bs returns true if bs is a correct byte representation of a field element

The neutral element for the addition

The neutral element for the multiplication

add a b returns a + b mod order

mul a b returns a * b mod order

eq a b returns true if a = b mod order, else false

negate x returns -x mod order. Equivalently, negate x returns the unique y such that x + y mod order = 0

inverse_exn x returns x^-1 if x is not 0, else raise Division_by_zero

inverse_opt x returns x^-1 if x is not 0 as an option, else None

pow x n returns x^n

From a predefined bytes representation, construct a value t. It is not required that to_bytes (of_bytes_exn t) = t. Raise Not_in_field if the bytes do not represent an element in the field.

From a predefined bytes representation, construct a value t. It is not required that to_bytes (Option.get (of_bytes_opt t)) = t. By default, little endian encoding is used and the given element is modulo the prime order

Convert the value t to a bytes representation which can be used for hashing for instance. It is not required that to_bytes (of_bytes_exn t) = t. By default, little endian encoding is used, and length of the resulting bytes may vary depending on the order.

Actual number of bytes allocated for a value of type t

of_z x builds an element t from the Zarith element x. mod order is applied if x >= order or x < 0.

to_z x builds a Zarith element, using the decimal representation. Arithmetic on the result can be done using the modular functions on integers