Compressed binary representation of BLS12-381 seed parameter x = 0xD201000000010000 for efficient Miller loop computation. Binary digits with consecutive zeros replaced by 3 for compression…
NAF (Non-Adjacent Form) representation of BN254 seed parameter for Miller loop computation in pairing operations. Computed as: NAF(6·x + 2) 1: where x = 0x44E992B44A6909F1…
Returns the curve order n as a CircuitModulus for circuit operations. CircuitModulus is used by Cairo’s circuit builtins for modular arithmetic in the scalar field….
Returns the base field modulus p as a CircuitModulus for circuit operations. CircuitModulus is used by Cairo’s circuit builtins for modular arithmetic….
Returns the order n of the curve’s prime-order subgroup. This is the number of points in the main cryptographic subgroup. For most curves, this equals #E(Fp)/cofactor….
Returns a primitive cube root of unity ω in the base field Fp. This element satisfies ω³ = 1 and ω ≠ 1, and is used in GLV endomorphism computations for accelerating scalar multiplication….
Checks if a curve has an efficient endomorphism available for GLV decomposition. GLV (Gallant-Lambert-Vanstone) decomposition accelerates scalar multiplication…
Degree-12 extension field element (generic coefficients). Represents an element of the extension field F _ {q^12} modeled as the quotient ring F_q w /p(w), where p(w) is an irreducible polynomial of…
A 2048-bit integer packed into 6 chunks of at most 384 bits each (the top chunk w5 is constrained to 128 bits). Given 22 limbs of 96 bits, groups of 4 consecutive limbs form one u384…