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…
Checks if a curve has an efficient endomorphism available for GLV decomposition. GLV (Gallant-Lambert-Vanstone) decomposition accelerates scalar multiplication…
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 the base field modulus p as a CircuitModulus for circuit operations. CircuitModulus is used by Cairo’s circuit builtins for modular arithmetic….
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 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….
A type that can be used as a circuit modulus (a u384 that is not zero or one). The modulus defines the finite field over which the circuit operates. It must be:…