Struct scuttlebutt::field::F2e19x3e26

source · [−]

pub struct F2e19x3e26 { /* private fields */ }

Expand description

The finite field over the prime $M = 2^{19} 3^{26} + 1$. Hence, $\phi(M)$ is divisible by $2^{19}$ and $3^{26}$ and thus supports a large number of FFT<2> and FFT<3> sizes for threshold secret sharing.

Trait Implementations

source

impl<'a> Add<&'a F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the + operator.

source

fn add(self, rhs: &'a F2e19x3e26) -> Self::Output

Performs the + operation. Read more

source

impl<'a> Add<&'a F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the + operator.

source

fn add(self, rhs: &'a F2e19x3e26) -> Self::Output

Performs the + operation. Read more

source

impl<'a> Add<F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the + operator.

source

fn add(self, rhs: F2e19x3e26) -> Self::Output

Performs the + operation. Read more

source

impl Add<F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the + operator.

source

fn add(self, rhs: F2e19x3e26) -> Self::Output

Performs the + operation. Read more

source

impl AddAssign<&F2e19x3e26> for F2e19x3e26

source

fn add_assign(&mut self, rhs: &F2e19x3e26)

Performs the += operation. Read more

source

impl AddAssign<F2e19x3e26> for F2e19x3e26

source

fn add_assign(&mut self, rhs: F2e19x3e26)

Performs the += operation. Read more

source

impl CanonicalSerialize for F2e19x3e26

source

fn to_bytes(&self) -> GenericArray<u8, Self::ByteReprLen>

Return the canonical byte representation (byte representation of the reduced field element).

type Serializer = ByteElementSerializer<F2e19x3e26>

A way to serialize field elements of this type. Read more

type Deserializer = ByteElementDeserializer<F2e19x3e26>

A way to deserialize field elements of this type. Read more

type ByteReprLen = UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>

The number of bytes in the byte representation for this element.

type FromBytesError = BiggerThanModulus

The error that can result from trying to decode an invalid byte sequence.

source

fn from_bytes(
buf: &GenericArray<u8, Self::ByteReprLen>
) -> Result<Self, BiggerThanModulus>

Deserialize an element from a byte array. Read more

source

impl Clone for F2e19x3e26

source

fn clone(&self) -> F2e19x3e26

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl ConditionallySelectable for F2e19x3e26

source

fn conditional_select(a: &Self, b: &Self, choice: Choice) -> Self

Select a or b according to choice. Read more

source

fn conditional_assign(&mut self, other: &Self, choice: Choice)

Conditionally assign other to self, according to choice. Read more

source

fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)

Conditionally swap self and other if choice == 1; otherwise, reassign both unto themselves. Read more

source

impl ConstantTimeEq for F2e19x3e26

source

fn ct_eq(&self, other: &Self) -> Choice

Determine if two items are equal. Read more

source

impl Debug for F2e19x3e26

source

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

Formats the value using the given formatter. Read more

source

impl Default for F2e19x3e26

source

fn default() -> Self

Returns the “default value” for a type. Read more

source

impl<'de> Deserialize<'de> for F2e19x3e26

source

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer. Read more

source

impl Distribution<F2e19x3e26> for Standard

source

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> F2e19x3e26

Generate a random value of T, using rng as the source of randomness.

source

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>where
R: Rng,

Create an iterator that generates random values of T, using rng as the source of randomness. Read more

source

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>where
F: Fn(T) -> S,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F Read more

source

impl<'a> Div<&'a F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the / operator.

source

fn div(self, rhs: &'a F2e19x3e26) -> Self::Output

Performs the / operation. Read more

source

impl<'a> Div<&'a F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the / operator.

source

fn div(self, rhs: &'a F2e19x3e26) -> Self::Output

Performs the / operation. Read more

source

impl<'a> Div<F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the / operator.

source

fn div(self, rhs: F2e19x3e26) -> Self::Output

Performs the / operation. Read more

source

impl Div<F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the / operator.

source

fn div(self, rhs: F2e19x3e26) -> Self::Output

Performs the / operation. Read more

source

impl<'a> DivAssign<&'a F2e19x3e26> for F2e19x3e26

source

fn div_assign(&mut self, rhs: &Self)

Performs the /= operation. Read more

source

impl DivAssign<F2e19x3e26> for F2e19x3e26

source

fn div_assign(&mut self, rhs: F2e19x3e26)

Performs the /= operation. Read more

source

impl FieldForFFT<2> for F2e19x3e26

source

const PHI_EXP: usize = 19usize

Largest integer p such that phi(MODULUS) = N^p * k for integer k.

source

fn roots(ix: usize) -> Self

For each p such that N^p | phi(MODULUS), there is a (N^p)th root of unity, namely r_p = GENERATOR^(phi(MODULUS) / N^p), since then r_p^(N^p) = GENERATOR^phi(MODULUS) = 1. This function should return this r_p, on input p, for p in [0 .. PHI_EXP]. Read more

source

impl FieldForFFT<3> for F2e19x3e26

source

const PHI_EXP: usize = 26usize

Largest integer p such that phi(MODULUS) = N^p * k for integer k.

source

fn roots(ix: usize) -> Self

For each p such that N^p | phi(MODULUS), there is a (N^p)th root of unity, namely r_p = GENERATOR^(phi(MODULUS) / N^p), since then r_p^(N^p) = GENERATOR^phi(MODULUS) = 1. This function should return this r_p, on input p, for p in [0 .. PHI_EXP]. Read more

source

impl FiniteField for F2e19x3e26

source

fn inverse(&self) -> Self

Compute the multiplicative inverse of self. Read more

source

const GENERATOR: Self = _

The generator for the multiplicative group.

type PrimeField = F2e19x3e26

The prime-order subfield of the finite field.

source

fn polynomial_modulus() -> Polynomial<Self::PrimeField>

Multiplication over field elements should be reduced over this polynomial.

type NumberOfBitsInBitDecomposition = UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B1>

The number of bits in the bit decomposition of any element of this finite field. Read more

source

fn bit_decomposition(
&self
) -> GenericArray<bool, Self::NumberOfBitsInBitDecomposition>

Decompose the given field element into bits. Read more

source

fn decompose<T: FiniteField + IsSubFieldOf<Self>>(
&self
) -> GenericArray<T, DegreeModulo<T, Self>>

Decompose self into an array of T elements where T is a subfield of Self. Read more

source

fn from_subfield<T: FiniteField + IsSubFieldOf<Self>>(
arr: &GenericArray<T, DegreeModulo<T, Self>>
) -> Self

Create a field element from an array of subfield T elements. Read more

source

impl FiniteRing for F2e19x3e26

source

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

Generate a random element.

source

const ZERO: Self = _

The additive identity element.

source

const ONE: Self = _

The multiplicative identity element.

source

fn from_uniform_bytes(x: &[u8 ; 16]) -> Self

Construct an element from the given uniformly chosen random bytes.

source

fn random_nonzero<R: Rng + ?Sized>(rng: &mut R) -> Self

Generate a random non-zero element.

source

fn pow(&self, n: u128) -> Self

Compute self to the power of n. Read more

source

fn pow_bounded(&self, n: u128, bound: u16) -> Self

Compute self to the power of n, where n is guaranteed to be <= 2^bound. Read more

source

fn pow_var_time(&self, n: u128) -> Self

Compute self to the power of n, in non-constant time.

source

impl Hash for F2e19x3e26

source

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more

1.3.0 · source

fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,

Feeds a slice of this type into the given Hasher. Read more

source

impl<'a> Mul<&'a F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the * operator.

source

fn mul(self, rhs: &'a F2e19x3e26) -> Self::Output

Performs the * operation. Read more

source

impl<'a> Mul<&'a F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the * operator.

source

fn mul(self, rhs: &'a F2e19x3e26) -> Self::Output

Performs the * operation. Read more

source

impl<'a> Mul<F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the * operator.

source

fn mul(self, rhs: F2e19x3e26) -> Self::Output

Performs the * operation. Read more

source

impl Mul<F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the * operator.

source

fn mul(self, rhs: F2e19x3e26) -> Self::Output

Performs the * operation. Read more

source

impl MulAdd<F2e19x3e26, F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the fused multiply-add.

source

fn mul_add(self, a: Self, b: Self) -> Self::Output

Performs the fused multiply-add operation.

source

impl MulAssign<&F2e19x3e26> for F2e19x3e26

source

fn mul_assign(&mut self, rhs: &F2e19x3e26)

Performs the *= operation. Read more

source

impl MulAssign<F2e19x3e26> for F2e19x3e26

source

fn mul_assign(&mut self, rhs: F2e19x3e26)

Performs the *= operation. Read more

source

impl Neg for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the - operator.

source

fn neg(self) -> Self::Output

Performs the unary - operation. Read more

source

impl Num for F2e19x3e26

type FromStrRadixErr = BiggerThanModulus

source

fn from_str_radix(s: &str, r: u32) -> Result<Self, Self::FromStrRadixErr>

Convert from a string and radix (typically 2..=36). Read more

source

impl One for F2e19x3e26

source

fn one() -> Self

Returns the multiplicative identity element of Self, 1. Read more

source

fn is_one(&self) -> bool

Returns true if self is equal to the multiplicative identity. Read more

source

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

source

impl PartialEq<F2e19x3e26> for F2e19x3e26

source

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

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

1.0.0 · source

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. Read more

source

impl Product<F2e19x3e26> for F2e19x3e26

source

fn product<I: Iterator<Item = Self>>(iter: I) -> Self

Method which takes an iterator and generates Self from the elements by multiplying the items. Read more

source

impl Rem<F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the % operator.

source

fn rem(self, _modulus: Self) -> Self

Performs the % operation. Read more

source

impl Serialize for F2e19x3e26

source

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer. Read more

source

impl<'a> Sub<&'a F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the - operator.

source

fn sub(self, rhs: &'a F2e19x3e26) -> Self::Output

Performs the - operation. Read more

source

impl<'a> Sub<&'a F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the - operator.

source

fn sub(self, rhs: &'a F2e19x3e26) -> Self::Output

Performs the - operation. Read more

source

impl<'a> Sub<F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the - operator.

source

fn sub(self, rhs: F2e19x3e26) -> Self::Output

Performs the - operation. Read more

source

impl Sub<F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

The resulting type after applying the - operator.

source

fn sub(self, rhs: F2e19x3e26) -> Self::Output

Performs the - operation. Read more

source

impl SubAssign<&F2e19x3e26> for F2e19x3e26

source

fn sub_assign(&mut self, rhs: &F2e19x3e26)

Performs the -= operation. Read more

source

impl SubAssign<F2e19x3e26> for F2e19x3e26

source

fn sub_assign(&mut self, rhs: F2e19x3e26)

Performs the -= operation. Read more

source

impl Sum<F2e19x3e26> for F2e19x3e26

source

fn sum<I: Iterator<Item = Self>>(iter: I) -> Self

Method which takes an iterator and generates Self from the elements by “summing up” the items. Read more

source

impl TryFrom<u128> for F2e19x3e26

type Error = BiggerThanModulus

The type returned in the event of a conversion error.

source

fn try_from(value: u128) -> Result<Self, Self::Error>

Performs the conversion.

source

impl Zero for F2e19x3e26

source

fn zero() -> Self

Returns the additive identity element of Self, 0. Read more

source

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

source

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

source

impl StructuralEq for F2e19x3e26

Auto Trait Implementations

impl RefUnwindSafe for F2e19x3e26

impl Send for F2e19x3e26

impl Sync for F2e19x3e26

impl Unpin for F2e19x3e26

impl UnwindSafe for F2e19x3e26

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> Conv for T

fn conv<T>(self) -> Twhere
Self: Into<T>,

Converts self into T using Into<T>. Read more

impl<T> FmtForward for T

fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.

fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,

Causes self to use its Display implementation when Debug-formatted. Read more

fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted. Read more

fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted. Read more

fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.

fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted. Read more

fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted. Read more

fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted. Read more

fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<FE> IsSubFieldOf<FE> for FEwhere
FE: FiniteField,

type DegreeModulo = UInt<UTerm, B1>

The value $n$ from above.

source

fn decompose_superfield(
fe: &FE
) -> GenericArray<FE, <FE as IsSubFieldOf<FE>>::DegreeModulo>

Turn FE into an array of Self, a subfield of FE.

source

fn form_superfield(
components: &GenericArray<FE, <FE as IsSubFieldOf<FE>>::DegreeModulo>
) -> FE

Homomorphically lift an array of Self into an FE.

impl<T> Pipe for Twhere
T: ?Sized,

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R

Pipes by value. This is generally the method you want to use. Read more

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,

Borrows self and passes that borrow into the pipe function. Read more

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere
 Self: Borrow,
 B: 'a + ?Sized,
 R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more

fn pipe_borrow_mut<'a, B, R>(
 &'a mut self,
 func: impl FnOnce(&'a mut B) -> R
) -> Rwhere
 Self: BorrowMut,
 B: 'a + ?Sized,
 R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere
 Self: AsRef,
 U: 'a + ?Sized,
 R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere
 Self: AsMut,
 U: 'a + ?Sized,
 R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function. Read more

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> Rwhere
 Self: Deref<Target = T>,
 T: 'a + ?Sized,
 R: 'a,

Borrows self, then passes self.deref() into the pipe function.

fn pipe_deref_mut<'a, T, R>(&'a mut self, func: impl FnOnce(&'a mut T) -> R) -> Rwhere
 Self: DerefMut<Target = T> + Deref,
 T: 'a + ?Sized,
 R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function. Read more

source

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T> Tap for T

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more

fn tap_borrow(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow,
B: ?Sized,

Immutable access to the Borrow of a value. Read more

fn tap_borrow_mut(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut,
B: ?Sized,

Mutable access to the BorrowMut of a value. Read more

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere
Self: Deref<Target = T>,
T: ?Sized,

Immutable access to the Deref::Target of a value. Read more

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere
Self: DerefMut<Target = T> + Deref,
T: ?Sized,

Mutable access to the Deref::Target of a value. Read more

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds. Read more

fn tap_borrow_dbg(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow,
B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds. Read more

fn tap_borrow_mut_dbg(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut,
B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds. Read more

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds. Read more

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds. Read more

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Selfwhere
Self: Deref<Target = T>,
T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds. Read more

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere
Self: DerefMut<Target = T> + Deref,
T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds. Read more

source

impl<T> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T> TryConv for T

fn try_conv<T>(self) -> Result<T, Self::Error>where
Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

impl<V, T> VZip<V> for Twhere
V: MultiLane<T>,

fn vzip(self) -> V

source

impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,

source

impl<R> IsSubRingOf<R> for Rwhere
R: FiniteRing,

source

impl<T> LinalgScalar for Twhere
T: One<Output = T> + Add<T, Output = T> + Sub<T, Output = T> + Mul<T> + Div<T, Output = T> + 'static + Copy + Zero,

source

impl<T, Rhs, Output> NumOps<Rhs, Output> for Twhere
T: Mul<Rhs, Output = Output> + Div<Rhs, Output = Output> + Rem<Rhs, Output = Output> + Add<Rhs, Output = Output> + Sub<Rhs, Output = Output>,

Struct scuttlebutt::field::F2e19x3e26

Trait Implementations

impl<'a> Add<&'a F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

fn add(self, rhs: &'a F2e19x3e26) -> Self::Output

impl<'a> Add<&'a F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

fn add(self, rhs: &'a F2e19x3e26) -> Self::Output

impl<'a> Add<F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

fn add(self, rhs: F2e19x3e26) -> Self::Output

impl Add<F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

fn add(self, rhs: F2e19x3e26) -> Self::Output

impl AddAssign<&F2e19x3e26> for F2e19x3e26

fn add_assign(&mut self, rhs: &F2e19x3e26)

impl AddAssign<F2e19x3e26> for F2e19x3e26

fn add_assign(&mut self, rhs: F2e19x3e26)

impl CanonicalSerialize for F2e19x3e26

fn to_bytes(&self) -> GenericArray<u8, Self::ByteReprLen>

type Serializer = ByteElementSerializer<F2e19x3e26>

type Deserializer = ByteElementDeserializer<F2e19x3e26>

type ByteReprLen = UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>

type FromBytesError = BiggerThanModulus

fn from_bytes( buf: &GenericArray<u8, Self::ByteReprLen>) -> Result<Self, BiggerThanModulus>

impl Clone for F2e19x3e26

fn clone(&self) -> F2e19x3e26

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

impl ConditionallySelectable for F2e19x3e26

fn conditional_select(a: &Self, b: &Self, choice: Choice) -> Self

fn conditional_assign(&mut self, other: &Self, choice: Choice)

fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)

impl ConstantTimeEq for F2e19x3e26

fn ct_eq(&self, other: &Self) -> Choice

impl Debug for F2e19x3e26

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

impl Default for F2e19x3e26

fn default() -> Self

impl<'de> Deserialize<'de> for F2e19x3e26

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

impl Distribution<F2e19x3e26> for Standard

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> F2e19x3e26

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>where R: Rng,

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>where F: Fn(T) -> S,

impl<'a> Div<&'a F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

fn div(self, rhs: &'a F2e19x3e26) -> Self::Output

impl<'a> Div<&'a F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

fn div(self, rhs: &'a F2e19x3e26) -> Self::Output

impl<'a> Div<F2e19x3e26> for &'a F2e19x3e26

type Output = F2e19x3e26

fn div(self, rhs: F2e19x3e26) -> Self::Output

impl Div<F2e19x3e26> for F2e19x3e26

type Output = F2e19x3e26

fn div(self, rhs: F2e19x3e26) -> Self::Output

impl<'a> DivAssign<&'a F2e19x3e26> for F2e19x3e26

fn div_assign(&mut self, rhs: &Self)

impl DivAssign<F2e19x3e26> for F2e19x3e26

fn div_assign(&mut self, rhs: F2e19x3e26)

impl FieldForFFT<2> for F2e19x3e26

const PHI_EXP: usize = 19usize

fn roots(ix: usize) -> Self

impl FieldForFFT<3> for F2e19x3e26

const PHI_EXP: usize = 26usize

fn roots(ix: usize) -> Self

impl FiniteField for F2e19x3e26

fn inverse(&self) -> Self

const GENERATOR: Self = _

type PrimeField = F2e19x3e26

fn polynomial_modulus() -> Polynomial<Self::PrimeField>

type NumberOfBitsInBitDecomposition = UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B1>

fn bit_decomposition( &self) -> GenericArray<bool, Self::NumberOfBitsInBitDecomposition>

fn decompose<T: FiniteField + IsSubFieldOf<Self>>( &self) -> GenericArray<T, DegreeModulo<T, Self>>

fn from_subfield<T: FiniteField + IsSubFieldOf<Self>>( arr: &GenericArray<T, DegreeModulo<T, Self>>) -> Self

impl FiniteRing for F2e19x3e26

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

const ZERO: Self = _

const ONE: Self = _

fn from_uniform_bytes(x: &[u8; 16]) -> Self

fn from_bytes(
buf: &GenericArray<u8, Self::ByteReprLen>
) -> Result<Self, BiggerThanModulus>

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>where
R: Rng,

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>where
F: Fn(T) -> S,

fn bit_decomposition(
&self
) -> GenericArray<bool, Self::NumberOfBitsInBitDecomposition>

fn decompose<T: FiniteField + IsSubFieldOf<Self>>(
&self
) -> GenericArray<T, DegreeModulo<T, Self>>

fn from_subfield<T: FiniteField + IsSubFieldOf<Self>>(
arr: &GenericArray<T, DegreeModulo<T, Self>>
) -> Self

fn from_uniform_bytes(x: &[u8 ; 16]) -> Self

fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,