Struct ark_mnt4_298::g1::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 = 1

const COFACTOR_INV: Fr = Fr::ONE

COFACTOR^(-1) mod r = 1

type BaseField = Fp<MontBackend<FqConfig, 5>, 5>

Base field that the curve is defined over.

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

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: Fq = _

COEFF_A = 2 Reference: https://github.com/scipr-lab/libff/blob/c927821ebe02e0a24b5e0f9170cec5e211a35f08/libff/algebra/curves/mnt/mnt4/mnt4_init.cpp#L116

const COEFF_B: Fq = _

COEFF_B = 423894536526684178289416011533888240029318103673896002803341544124054745019340795360841685 Reference: https://github.com/scipr-lab/libff/blob/c927821ebe02e0a24b5e0f9170cec5e211a35f08/libff/algebra/curves/mnt/mnt4/mnt4_init.cpp#L117

const GENERATOR: G1Affine = _

AFFINE_GENERATOR_COEFFS = (G1_GENERATOR_X, G1_GENERATOR_Y)

fn mul_by_a(elem: 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