INNER CODE UNIT · Rust

ORDER

pluto/ronkathon · src/algebra/field/extension/mod.rs:69

  const ORDER: usize = PrimeField::<P>::ORDER.pow(N as u32);
}

// impl<const N: usize, const P: usize> FiniteField for GaloisField<N, P> {
//   const GENERATOR: Self = panic!();
//   const NEG_ONE: Self = Self::new(single_instance_array(PrimeField::<P>::NEG_ONE));
//   const ONE: Self = Self::new(single_instance_array(PrimeField::<P>::ONE));
//   const ORDER: usize = P.pow(N as usize) as usize;
//   const THREE: Self = Self::new(single_instance_array(PrimeField::<P>::THREE));
//   const TWO: Self = Self::new(single_instance_array(PrimeField::<P>::from(2usize)));
//   const ZERO: Self = Self::new([PrimeField::<P>::ZERO; N]);

//   fn inverse(&self) -> Option<Self> { todo!() }

//   fn pow(self, power: usize) -> Self { todo!() }
// }

// TODO: This is useful for generating arrays at const time

View source record →