@@ -7,15 +7,15 @@ use crate::{
77} ;
88
99#[ derive( Clone , Debug ) ]
10- pub struct U256MontgomeryConfigTwoAdic ;
11- impl IsModulus < U256 > for U256MontgomeryConfigTwoAdic {
10+ pub struct MontgomeryConfigStark252PrimeField ;
11+ impl IsModulus < U256 > for MontgomeryConfigStark252PrimeField {
1212 const MODULUS : U256 =
1313 U256 :: from ( "800000000000011000000000000000000000000000000000000000000000001" ) ;
1414}
1515
16- pub type U256MontgomeryTwoAdicPrimeField = U256PrimeField < U256MontgomeryConfigTwoAdic > ;
16+ pub type Stark252PrimeField = U256PrimeField < MontgomeryConfigStark252PrimeField > ;
1717
18- impl IsTwoAdicField for U256MontgomeryTwoAdicPrimeField {
18+ impl IsTwoAdicField for Stark252PrimeField {
1919 const TWO_ADICITY : u64 = 48 ;
2020 // Change this line for a new function like `from_limbs`.
2121 const TWO_ADIC_PRIMITVE_ROOT_OF_UNITY : U256 = UnsignedInteger {
@@ -32,7 +32,7 @@ impl IsTwoAdicField for U256MontgomeryTwoAdicPrimeField {
3232mod u256_two_adic_prime_field_tests {
3333 use proptest:: { prelude:: any, prop_assert_eq, prop_compose, proptest, strategy:: Strategy } ;
3434
35- use super :: U256MontgomeryTwoAdicPrimeField ;
35+ use super :: Stark252PrimeField ;
3636 use crate :: {
3737 fft:: helpers:: log2,
3838 field:: {
@@ -42,7 +42,7 @@ mod u256_two_adic_prime_field_tests {
4242 polynomial:: Polynomial ,
4343 } ;
4444
45- type F = U256MontgomeryTwoAdicPrimeField ;
45+ type F = Stark252PrimeField ;
4646 type FE = FieldElement < F > ;
4747
4848 prop_compose ! {
0 commit comments