Struct snarkvm_r1cs::FrParameters

pub struct FrParameters;

Trait Implementations

impl FftParameters for FrParameters

type BigInteger = BigInteger

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. 2^s * t = MODULUS - 1 with t odd. This is the two-adicity of the prime.

const TWO_ADIC_ROOT_OF_UNITY: BigInteger

2^s root of unity computed by GENERATOR^t

const SMALL_SUBGROUP_BASE: Option<u32>

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

const SMALL_SUBGROUP_BASE_ADICITY: Option<u32>

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

const LARGE_SUBGROUP_ROOT_OF_UNITY: Option<Self::BigInteger>

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

impl FieldParameters for FrParameters

const GENERATOR: BigInteger

GENERATOR = 11

const MODULUS: BigInteger

MODULUS = 8444461749428370424248824938781546531375899335154063827935233455917409239041

const MODULUS_MINUS_ONE_DIV_TWO: BigInteger

(r - 1)/2 = 4222230874714185212124412469390773265687949667577031913967616727958704619520

const T: BigInteger

t = (r - 1) / 2^s = 60001509534603559531609739528203892656505753216962260608619555

const T_MINUS_ONE_DIV_TWO: BigInteger

(t - 1) / 2 = 30000754767301779765804869764101946328252876608481130304309777

const CAPACITY: u32

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

const INV: u64

INV = -(MODULUS^{-1} mod MODULUS) mod MODULUS

const MODULUS_BITS: u32

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

const R: BigInteger

R = 2^256 % Self::MODULUS

const R2: BigInteger

R2 = R^2 % Self::MODULUS

const REPR_SHAVE_BITS: u32

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

impl Fp256Parameters for FrParameters