test/test_factorize.cpp
// These tests are fine, but they take multiple seconds or minutes to run.
// Hence we typically will want to skip them.
//
These tests are fine, but they take multiple seconds or minutes to run.
Hence we typically will want to skip them.
These tests are fine but they take multiple seconds or minutes to run . Hence we typically will want to skip them .
TEST(HurchallaFactoringFactorize, hard_semi_primes128_52) {
    using U = __uint128_t;
    U twoPow52 = static_cast<U>(1) << 52;
    {
        std::vector<U> answer = { twoPow52-143, twoPow52-47 };
        test_factorize<U>(answer);
    }
    {
        std::vector<U> answer = { twoPow52-183, twoPow52-173 };
        test_factorize<U>(answer);
    }
}
TEST ( HurchallaFactoringFactorize , hard_semi_primes128_52 ) { using U = __uint128_t ; U twoPow52 = static_cast < U > ( 1 ) << 52 ; { std :: vector < U > answer = { twoPow52 - 143 , twoPow52 - 47 } ; test_factorize < U > ( answer ) ; } { std :: vector < U > answer = { twoPow52 - 183 , twoPow52 - 173 } ; test_factorize < U > ( answer ) ; } }
These tests are fine, but they take multiple seconds or minutes to run.
These tests are fine but they take multiple seconds or minutes to run .
// use largest primes < 2^52: // 2^52 minus { 47, 143, 173, 183, 197, 209, 269, 285, 335, 395 }