Struct ark_bn254::g2::Config

pub struct Config;

Trait Implementations

impl Clone for Config

fn clone(&self) -> Config

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl CurveConfig for Config

const COFACTOR: &'static [u64] = _

COFACTOR = (36 * X^4) + (36 * X^3) + (30 * X^2) + 6*X + 1 21888242871839275222246405745257275088844257914179612981679871602714643921549

const COFACTOR_INV: Fr = _

COFACTOR_INV = COFACTOR^{-1} mod r

type BaseField = QuadExtField<Fp2ConfigWrapper<Fq2Config>>

Base field that the curve is defined over.

type ScalarField = Fp<MontBackend<FrConfig, 4>, 4>

Finite prime field corresponding to an appropriate prime-order subgroup of the curve group.

fn cofactor_is_one() -> bool

impl Default for Config

fn default() -> Config

Returns the “default value” for a type.

impl PartialEq<Config> for Config

fn eq(&self, other: &Config) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl SWCurveConfig for Config

const COEFF_A: Fq2 = Fq2::ZERO

COEFF_A = [0, 0]

const COEFF_B: Fq2 = _

COEFF_B = 3/(u+9) (19485874751759354771024239261021720505790618469301721065564631296452457478373, 266929791119991161246907387137283842545076965332900288569378510910307636690)

const GENERATOR: G2Affine = _

AFFINE_GENERATOR_COEFFS = (G2_GENERATOR_X, G2_GENERATOR_Y)

fn mul_by_a(_: Self::BaseField) -> Self::BaseField

Helper method for computing elem * Self::COEFF_A.

fn add_b(elem: Self::BaseField) -> Self::BaseField

Helper method for computing elem + Self::COEFF_B.

fn is_in_correct_subgroup_assuming_on_curve(item: &Affine<Self>) -> bool

Check if the provided curve point is in the prime-order subgroup.

fn clear_cofactor(item: &Affine<Self>) -> Affine<Self>

Performs cofactor clearing. The default method is simply to multiply by the cofactor. Some curves can implement a more efficient algorithm.

fn mul_projective(base: &Projective<Self>, scalar: &[u64]) -> Projective<Self>

Default implementation of group multiplication for projective coordinates

fn mul_affine(base: &Affine<Self>, scalar: &[u64]) -> Projective<Self>

Default implementation of group multiplication for affine coordinates.

fn msm(
    bases: &[Affine<Self>],
    scalars: &[Self::ScalarField]
) -> Result<Projective<Self>, usize>

Default implementation for multi scalar multiplication

fn serialize_with_mode<W>(
    item: &Affine<Self>,
    writer: W,
    compress: Compress
) -> Result<(), SerializationError>where
    W: Write,

If uncompressed, serializes both x and y coordinates as well as a bit for whether it is infinity. If compressed, serializes x coordinate with two bits to encode whether y is positive, negative, or infinity.

fn deserialize_with_mode<R>(
    reader: R,
    compress: Compress,
    validate: Validate
) -> Result<Affine<Self>, SerializationError>where
    R: Read,

If validate is Yes, calls check() to make sure the element is valid.

fn serialized_size(compress: Compress) -> usize

impl Eq for Config

impl StructuralEq for Config

impl StructuralPartialEq for Config