Expand description
Arithmetic related re-exported traits and utilities.
Structs§
- The affine coordinates of a point on an elliptic curve.
- 2-adicity multiplicative domain
- Contains numerator and denominator for deferred evaluation.
- Rotation on a group.
Traits§
- Extension trait for iterators over mutable field elements which allows those field elements to be inverted in a batch.
- Efficient representation of an elliptic curve point guaranteed.
- This trait is the affine counterpart to
Curveand is used for serialization, storage in memory, and inspection of $x$ and $y$ coordinates. - This trait is a common interface for dealing with elements of an elliptic curve group in a “projective” form, where that arithmetic is usually more efficient.
- This trait represents an element of a field.
- Trait for fields that can implement Poseidon hash
- Operations that could be done with field elements.
- Trait for constructing a
PrimeFieldelement from a fixed-length uniform byte array. - This trait represents an element of a cryptographic group.
- Represents results of a Miller loop, one of the most expensive portions of the pairing function.
- Affine representation of an elliptic curve point guaranteed to be in the correct prime order subgroup.
- This represents an element of a non-binary prime field.
Functions§
- Batch invert
PrimeFieldelements. - Batch invert
PrimeFieldelements and multiply all with given coefficient. - Convert a
BigUintinto aPrimeField. - Convert a
PrimeFieldinto aBigUint. - Convert a
PrimeFieldinto anotherPrimeField. - Compute inner product of 2 slice of
Field. - Modulus of a
PrimeField - Returns iterator that yields scalar^0, scalar^1, scalar^2…
- Root of unity of 2^k-sized multiplicative subgroup of
PrimeFieldby repeatedly squaring the root of unity of the largest multiplicative subgroup.
Derive Macros§
- Derive the
PrimeFieldtrait.