package bls12-381-js

You can search for identifiers within the package.

in-package search v0.2.0

bls12-381-js
- Bls12_381
- Fq12
  - Fq12
- Fr
  - Fr
- G1
  - Scalar
- G2
  - Scalar
- Pairing
  - P

Legend:
Library
Module
Module type
Parameter
Class
Class type

module Fr : sig ... end

include module type of struct include Fr end

exception Not_in_field of Bytes.t

type t

val order : Z.t

val size_in_bytes : int

val zero : t

val one : t

val is_zero : t -> bool

val is_one : t -> bool

val random : ?state:Random.State.t -> unit -> t

val non_null_random : ?state:Random.State.t -> unit -> t

val add : t -> t -> t

val (+) : t -> t -> t

val sub : t -> t -> t

val mul : t -> t -> t

val (*) : t -> t -> t

val eq : t -> t -> bool

val (=) : t -> t -> bool

val negate : t -> t

val (-) : t -> t

val inverse_exn : t -> t

val inverse_opt : t -> t option

val div_exn : t -> t -> t

val div_opt : t -> t -> t option

val (/) : t -> t -> t

val square : t -> t

val double : t -> t

val pow : t -> Z.t -> t

val (**) : t -> Z.t -> t

val of_bytes_exn : Bytes.t -> t

val of_bytes_opt : Bytes.t -> t option

val to_bytes : t -> Bytes.t

val factor_power_of_two : int * Z.t

val of_string : string -> t

val to_string : t -> string

val of_z : Z.t -> t

val to_z : t -> Z.t

val legendre_symbol : t -> Z.t

val is_quadratic_residue : t -> bool

val sqrt_opt : t -> t option

val check_bytes : Bytes.t -> bool

val fft : domain:t array -> points:t list -> t list

val ifft : domain:t array -> points:t list -> t list