Struct wagyu_zcash::librustzcash::sapling_crypto::jubjub::fs::Fs

pub struct Fs(_);

This is an element of the scalar field of the Jubjub curve.

Trait Implementations

impl Clone for Fs

fn clone(&self) -> Fs

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for Fs

impl Debug for Fs

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Display for Fs

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Eq for Fs

impl Field for Fs

fn random<R: RngCore>(rng: &mut R) -> Self

Returns an element chosen uniformly at random using a user-provided RNG.

fn zero() -> Self

Returns the zero element of the field, the additive identity.

fn one() -> Self

Returns the one element of the field, the multiplicative identity.

fn is_zero(&self) -> bool

Returns true iff this element is zero.

fn add_assign(&mut self, other: &Fs)

Adds another element to this element.

fn double(&mut self)

Doubles this element.

fn sub_assign(&mut self, other: &Fs)

Subtracts another element from this element.

fn negate(&mut self)

Negates this element.

fn inverse(&self) -> Option<Self>

Computes the multiplicative inverse of this element, if nonzero.

fn frobenius_map(&mut self, _: usize)

Exponentiates this element by a power of the base prime modulus via the Frobenius automorphism.

fn mul_assign(&mut self, other: &Fs)

Multiplies another element by this element.

fn square(&mut self)

Squares this element.

fn pow<S: AsRef<[u64]>>(&self, exp: S) -> Self

Exponentiates this element by a number represented with u64 limbs, least significant digit first.

impl From<Fs> for FsRepr

fn from(e: Fs) -> FsRepr

Performs the conversion.

impl PartialEq<Fs> for Fs

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

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

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

This method tests for !=.

impl PrimeField for Fs

type Repr = FsRepr

The prime field can be converted back and forth into this biginteger representation.

fn from_repr(r: FsRepr) -> Result<Fs, PrimeFieldDecodingError>

Convert this prime field element into a biginteger representation.

fn into_repr(&self) -> FsRepr

Convert a biginteger representation into a prime field element, if the number is an element of the field.

fn char() -> FsRepr

Returns the field characteristic; the modulus.

const NUM_BITS: u32

How many bits are needed to represent an element of this field.

const CAPACITY: u32

How many bits of information can be reliably stored in the field element.

fn multiplicative_generator() -> Self

Returns the multiplicative generator of char() - 1 order. This element must also be quadratic nonresidue.

const S: u32

2^s * t = char() - 1 with t odd.

fn root_of_unity() -> Self

Returns the 2^s root of unity computed by exponentiating the multiplicative_generator() by t.

fn from_str(s: &str) -> Option<Self>

Interpret a string of numbers as a (congruent) prime field element. Does not accept unnecessary leading zeroes or a blank string.

impl SqrtField for Fs

fn legendre(&self) -> LegendreSymbol

Returns the Legendre symbol of the field element.

fn sqrt(&self) -> Option<Self>

Returns the square root of the field element, if it is quadratic residue.

impl StructuralEq for Fs

impl StructuralPartialEq for Fs

impl ToUniform for Fs

fn to_uniform(digest: &[u8]) -> Self

Convert a little endian byte string into a uniform field element. The number is reduced mod s. The caller is responsible for ensuring the input is 64 bytes of Random Oracle output.