Struct KoalaBearParameters 

pub struct KoalaBearParameters;

Trait Implementations

impl BarrettParameters for KoalaBearParameters

const N: usize = 40usize

const PRIME_I128: i128 = _

const PSEUDO_INV: i64 = _

const MASK: i64 = -1_024i64

impl BinomialExtensionData<4> for KoalaBearParameters

const W: KoalaBear

W is a value such that (x^DEG - WN) is irreducible.

const DTH_ROOT: KoalaBear

DTH_ROOT = W^((p - 1)/DEG)

const EXT_GENERATOR: [KoalaBear; 4]

A generator of the extension fields multiplicative group.

const EXT_TWO_ADICITY: usize = 26usize

const TWO_ADIC_EXTENSION_GENERATORS: Self::ArrayLike

A list of generators of 2-adic subgroups not contained in the base field.

type ArrayLike = [[MontyField31<KoalaBearParameters>; 4]; 2]

ArrayLike should usually be [MontyField31; EXT_TWO_ADICITY - TWO_ADICITY].

impl Clone for KoalaBearParameters

fn clone(&self) -> KoalaBearParameters

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KoalaBearParameters

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

Formats the value using the given formatter.

impl Default for KoalaBearParameters

fn default() -> KoalaBearParameters

Returns the “default value” for a type.

impl FieldParameters for KoalaBearParameters

const MONTY_GEN: KoalaBear

fn exp_u64_generic<FA: FieldAlgebra>(val: FA, power: u64) -> FA

fn try_inverse<F: Field>(p1: F) -> Option<F>

const MONTY_ZERO: MontyField31<Self> = _

const MONTY_ONE: MontyField31<Self> = _

const MONTY_TWO: MontyField31<Self> = _

const MONTY_NEG_ONE: MontyField31<Self> = _

const HALF_P_PLUS_1: u32 = _

impl Hash for KoalaBearParameters

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl InternalLayerBaseParameters<KoalaBearParameters, 16> for KoalaBearInternalLayerParameters

fn internal_layer_mat_mul( state: &mut [MontyField31<KoalaBearParameters>; 16], sum: MontyField31<KoalaBearParameters>, )

Perform the internal matrix multiplication: s -> (1 + Diag(V))s. We ignore state[0] as it is handled separately.

const INTERNAL_DIAG_MONTY: [MontyField31<KoalaBearParameters>; 16] = INTERNAL_DIAG_MONTY_16

type ArrayLike = [MontyField31<KoalaBearParameters>; 15]

fn generic_internal_linear_layer<FA>(state: &mut [FA; 16])

where FA: FieldAlgebra + Mul<KoalaBear, Output = FA>,

Perform the internal matrix multiplication for any Abstract field which implements multiplication by MontyField31 elements.

impl InternalLayerBaseParameters<KoalaBearParameters, 24> for KoalaBearInternalLayerParameters

fn internal_layer_mat_mul( state: &mut [MontyField31<KoalaBearParameters>; 24], sum: MontyField31<KoalaBearParameters>, )

Perform the internal matrix multiplication: s -> (1 + Diag(V))s. We ignore state[0] as it is handled separately.

const INTERNAL_DIAG_MONTY: [MontyField31<KoalaBearParameters>; 24] = INTERNAL_DIAG_MONTY_24

type ArrayLike = [MontyField31<KoalaBearParameters>; 23]

fn generic_internal_linear_layer<FA>(state: &mut [FA; 24])

where FA: FieldAlgebra + Mul<KoalaBear, Output = FA>,

Perform the internal matrix multiplication for any Abstract field which implements multiplication by MontyField31 elements.

impl MontyParameters for KoalaBearParameters

const PRIME: u32 = 2_130_706_433u32

The KoalaBear prime: 2^31 - 2^24 + 1 This is a 31-bit prime with the highest possible two adicity if we additionally demand that the cube map (x -> x^3) is an automorphism of the multiplicative group. It’s not unique, as there is one other option with equal 2 adicity: 2^30 + 2^27 + 2^24 + 1. There is also one 29-bit prime with higher two adicity which might be appropriate for some applications: 2^29 - 2^26 + 1.

const MONTY_BITS: u32 = 32u32

const MONTY_MU: u32 = 2_164_260_865u32

const MONTY_MASK: u32 = _

impl PartialEq for KoalaBearParameters

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl TwoAdicData for KoalaBearParameters

const TWO_ADICITY: usize = 24usize

Largest n such that 2^n divides p - 1.

const TWO_ADIC_GENERATORS: Self::ArrayLike

A list of generators of 2-adic subgroups. The i’th element must be a 2^i root of unity and the i’th element squared must be the i-1’th element.

const ROOTS_8: Self::ArrayLike

Precomputation of the first 3 8th-roots of unity.

const INV_ROOTS_8: Self::ArrayLike

Precomputation of the inverses of ROOTS_8.

const ROOTS_16: Self::ArrayLike

Precomputation of the first 7 16th-roots of unity.

const INV_ROOTS_16: Self::ArrayLike

Precomputation of the inverses of ROOTS_16.

type ArrayLike = &'static [MontyField31<KoalaBearParameters>]

ArrayLike should usually be &'static [MontyField31].

const ODD_FACTOR: i32 = _

The odd constant r such that p = r * 2^n + 1

impl Copy for KoalaBearParameters

impl Eq for KoalaBearParameters

impl InternalLayerParameters<KoalaBearParameters, 16> for KoalaBearInternalLayerParameters

impl InternalLayerParameters<KoalaBearParameters, 24> for KoalaBearInternalLayerParameters

impl PackedMontyParameters for KoalaBearParameters

impl StructuralPartialEq for KoalaBearParameters