Struct ark_mnt6_753::FqParameters

pub struct FqParameters;

Trait Implementations

impl FftParameters for FrParameters

type BigInt = BigInteger768

pub const TWO_ADICITY: u32

Let N be the size of the multiplicative group defined by the field. Then TWO_ADICITY is the two-adicity of N, i.e. the integer s such that N = 2^s * t for some odd integer t.

pub const TWO_ADIC_ROOT_OF_UNITY: BigInteger768

2^s root of unity computed by GENERATOR^t

pub const SMALL_SUBGROUP_BASE: Option<u32>

An integer b such that there exists a multiplicative subgroup of size b^k for some integer k.

pub const SMALL_SUBGROUP_BASE_ADICITY: Option<u32>

The integer k such that there exists a multiplicative subgroup of size Self::SMALL_SUBGROUP_BASE^k.

pub const LARGE_SUBGROUP_ROOT_OF_UNITY: Option<Self::BigInt>

GENERATOR^((MODULUS-1) / (2^s * SMALL_SUBGROUP_BASE^SMALL_SUBGROUP_BASE_ADICITY)) Used for mixed-radix FFT.

impl Fp768Parameters for FrParameters

impl FpParameters for FrParameters

pub const MODULUS: BigInteger768

MODULUS = 41898490967918953402344214791240637128170709919953949071783502921025352812571106773058893763790338921418070971888458477323173057491593855069696241854796396165721416325350064441470418137846398469611935719059908164220784476160001

pub const MODULUS_BITS: u32

The number of bits needed to represent the Self::MODULUS.

pub const CAPACITY: u32

The number of bits that can be reliably stored. (Should equal SELF::MODULUS_BITS - 1)

pub const REPR_SHAVE_BITS: u32

The number of bits that must be shaved from the beginning of the representation when randomly sampling.

pub const R: BigInteger768

Let M be the power of 2^64 nearest to Self::MODULUS_BITS. Then R = M % Self::MODULUS.

pub const R2: BigInteger768

R2 = R^2 % Self::MODULUS

pub const INV: u64

INV = -MODULUS^{-1} mod 2^64

pub const GENERATOR: BigInteger768

A multiplicative generator of the field. Self::GENERATOR is an element having multiplicative order Self::MODULUS - 1.

pub const MODULUS_MINUS_ONE_DIV_TWO: BigInteger768

(Self::MODULUS - 1) / 2

pub const T: BigInteger768

T = (MODULUS - 1) / 2^S = 39021010480745652133919498688765463538626870065884617224134041854204007249857398469987226430131438115069708760723898631821547688442835449306011425196003537779414482717728302293895201885929702287178426719326440397855625

pub const T_MINUS_ONE_DIV_TWO: BigInteger768

(T - 1) / 2 = 19510505240372826066959749344382731769313435032942308612067020927102003624928699234993613215065719057534854380361949315910773844221417724653005712598001768889707241358864151146947600942964851143589213359663220198927812