mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-09 17:23:08 +00:00
even less thorough :P
This commit is contained in:
parent
a4f60a0431
commit
a704b1523d
@ -506,9 +506,9 @@ fn test_modmul_bignum_all() -> Result<()> {
|
||||
|
||||
#[test]
|
||||
fn test_modexp_bignum_all() -> Result<()> {
|
||||
let exp_bit_sizes = vec![2, 20, 31, 40];
|
||||
let exp_bit_sizes = vec![2, 9, 11, 16];
|
||||
|
||||
for bit_size in &BIT_SIZES_TO_TEST[3..9] {
|
||||
for bit_size in &BIT_SIZES_TO_TEST[3..7] {
|
||||
for exp_bit_size in &exp_bit_sizes {
|
||||
let b = gen_bignum(*bit_size);
|
||||
let e = gen_bignum(*exp_bit_size);
|
||||
@ -531,7 +531,7 @@ fn test_modexp_bignum_all() -> Result<()> {
|
||||
let inputs = test_data_biguint(TEST_DATA_BIGNUM_INPUTS);
|
||||
let modexp_outputs = test_data_biguint(TEST_DATA_MODEXP_OUTPUTS);
|
||||
let mut modexp_outputs_iter = modexp_outputs.into_iter();
|
||||
for b in &inputs[..13] {
|
||||
for b in &inputs[..9] {
|
||||
// Include only smaller exponents, to keep tests from becoming too slow.
|
||||
for e in &inputs[..7] {
|
||||
// For m, skip the first input, which is zero.
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user