@@ -227,19 +227,21 @@ impl FRIGadget {
227
227
#[ cfg( test) ]
228
228
mod test {
229
229
use crate :: channel:: Channel ;
230
- use crate :: circle:: CirclePoint ;
231
230
use crate :: fri;
232
231
use crate :: fri:: { FRIGadget , N_QUERIES } ;
233
- use crate :: math:: Field ;
234
232
use crate :: treepp:: * ;
235
233
use crate :: twiddle_merkle_tree:: { TwiddleMerkleTree , TWIDDLE_MERKLE_TREE_ROOT_18 } ;
236
234
use crate :: utils:: permute_eval;
237
235
use bitcoin:: hashes:: Hash ;
238
236
use bitcoin:: { TapLeafHash , Transaction } ;
239
237
use bitcoin_scriptexec:: { Exec , ExecCtx , Experimental , Options , TxTemplate } ;
238
+ use num_traits:: One ;
240
239
use rand:: { Rng , SeedableRng } ;
241
240
use rand_chacha:: ChaCha20Rng ;
242
241
use rust_bitcoin_m31:: qm31_equalverify;
242
+ use stwo_prover:: core:: circle:: CirclePointIndex ;
243
+ use stwo_prover:: core:: fields:: m31:: M31 ;
244
+ use stwo_prover:: core:: fields:: FieldExpOps ;
243
245
244
246
#[ test]
245
247
fn test_fiat_shamir ( ) {
@@ -255,15 +257,15 @@ mod test {
255
257
let logn = 19 ;
256
258
257
259
let proof = {
258
- let p = CirclePoint :: subgroup_gen ( logn + 1 ) ;
260
+ let p = CirclePointIndex :: subgroup_gen ( logn as u32 + 1 ) . to_point ( ) ;
259
261
260
262
let mut prng = ChaCha20Rng :: seed_from_u64 ( 0 ) ;
261
263
262
264
let mut channel_init_state = [ 0u8 ; 32 ] ;
263
265
channel_init_state. iter_mut ( ) . for_each ( |v| * v = prng. gen ( ) ) ;
264
266
265
267
let evaluation = ( 0 ..( 1 << logn) )
266
- . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + 1 . into ( ) ) . into ( ) )
268
+ . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + M31 :: one ( ) ) . into ( ) )
267
269
. collect ( ) ;
268
270
let evaluation = permute_eval ( evaluation) ;
269
271
@@ -325,10 +327,10 @@ mod test {
325
327
channel_init_state. iter_mut ( ) . for_each ( |v| * v = prng. gen ( ) ) ;
326
328
327
329
let proof = {
328
- let p = CirclePoint :: subgroup_gen ( logn + 1 ) ;
330
+ let p = CirclePointIndex :: subgroup_gen ( logn as u32 + 1 ) . to_point ( ) ;
329
331
330
332
let evaluation = ( 0 ..( 1 << logn) )
331
- . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + 1 . into ( ) ) . into ( ) )
333
+ . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + M31 :: one ( ) ) . into ( ) )
332
334
. collect ( ) ;
333
335
let evaluation = permute_eval ( evaluation) ;
334
336
@@ -388,10 +390,10 @@ mod test {
388
390
channel_init_state. iter_mut ( ) . for_each ( |v| * v = prng. gen ( ) ) ;
389
391
390
392
let proof = {
391
- let p = CirclePoint :: subgroup_gen ( logn + 1 ) ;
393
+ let p = CirclePointIndex :: subgroup_gen ( logn as u32 + 1 ) . to_point ( ) ;
392
394
393
395
let evaluation = ( 0 ..( 1 << logn) )
394
- . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + 1 . into ( ) ) . into ( ) )
396
+ . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + M31 :: one ( ) ) . into ( ) )
395
397
. collect ( ) ;
396
398
let evaluation = permute_eval ( evaluation) ;
397
399
@@ -448,10 +450,10 @@ mod test {
448
450
channel_init_state. iter_mut ( ) . for_each ( |v| * v = prng. gen ( ) ) ;
449
451
450
452
let proof = {
451
- let p = CirclePoint :: subgroup_gen ( logn + 1 ) ;
453
+ let p = CirclePointIndex :: subgroup_gen ( logn as u32 + 1 ) . to_point ( ) ;
452
454
453
455
let evaluation = ( 0 ..( 1 << logn) )
454
- . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + 1 . into ( ) ) . into ( ) )
456
+ . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + M31 :: one ( ) ) . into ( ) )
455
457
. collect ( ) ;
456
458
let evaluation = permute_eval ( evaluation) ;
457
459
@@ -527,15 +529,15 @@ mod test {
527
529
let logn = 19 ;
528
530
529
531
let proof = {
530
- let p = CirclePoint :: subgroup_gen ( logn + 1 ) ;
532
+ let p = CirclePointIndex :: subgroup_gen ( logn as u32 + 1 ) . to_point ( ) ;
531
533
532
534
let mut prng = ChaCha20Rng :: seed_from_u64 ( 0 ) ;
533
535
534
536
let mut channel_init_state = [ 0u8 ; 32 ] ;
535
537
channel_init_state. iter_mut ( ) . for_each ( |v| * v = prng. gen ( ) ) ;
536
538
537
539
let evaluation = ( 0 ..( 1 << logn) )
538
- . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + 1 . into ( ) ) . into ( ) )
540
+ . map ( |i| ( p. mul ( i * 2 + 1 ) . x . square ( ) . square ( ) + M31 :: one ( ) ) . into ( ) )
539
541
. collect ( ) ;
540
542
let evaluation = permute_eval ( evaluation) ;
541
543
0 commit comments