Unsigned integer types which are constrained within a modular field using montgomery multiplication, never overflowing or exceeding the modulo
Elliptic curve fast fourier transform for all prime fields
command line tool to convert a modulus into bignum instance parameters for https://github.com/noir-lang/noir-bignum
High-performance, constant-time, cryptography-grade number theory library for ClockCurve ecosystem
necosystems series finite field arithmetic for secp256k1 and P-256
Unsigned integer type with const-generic bit length
Unsigned integer type with cont-generic bit length
Construct bigger uints by combining two smaller ones into a two-word uint