@@ -464,10 +464,11 @@ mod tests {
464464 ( proof, vc, * n)
465465 } ) ;
466466
467- let max_n = nm. iter ( ) . map ( |( n, _) | * n) . max ( ) . unwrap_or ( 0 ) ;
468- let max_m = nm. iter ( ) . map ( |( _, m) | * m) . max ( ) . unwrap_or ( 0 ) ;
467+ let max_nm = nm. iter ( ) . map ( |( n, m) | n * m) . max ( ) . unwrap_or ( 0 ) ;
469468
470- let generators = Generators :: new ( PedersenGenerators :: default ( ) , max_n, max_m) ;
469+ // hackish split of `n*m` into `n*m, 1` because we do not want
470+ // to compute more 8 generators for the case such as ((4,1),(2,2)).
471+ let generators = Generators :: new ( PedersenGenerators :: default ( ) , max_nm, 1 ) ;
471472
472473 assert ! ( RangeProof :: verify_batch( inputs, generators. all( ) , & mut transcript, & mut rng) . is_ok( ) ) ;
473474 }
@@ -582,11 +583,6 @@ mod tests {
582583 batch_verify_helper ( & [ ( 64 , 1 ) , ( 32 , 2 ) , ( 16 , 4 ) ] ) ;
583584 }
584585
585- #[ test]
586- fn batch_verify_mvp_failure ( ) {
587- batch_verify_helper ( & [ ( 4 , 1 ) , ( 2 , 2 ) ] ) ;
588- }
589-
590586 #[ test]
591587 fn batch_verify_n_differ_m_differ_total_256 ( ) {
592588 batch_verify_helper ( & [ ( 16 , 1 ) , ( 32 , 2 ) , ( 64 , 4 ) ] ) ;
0 commit comments