The unified diff between revisions [2fac918f..] and [4e40e885..] is displayed below. It can also be downloaded as a raw diff.

This diff has been restricted to the following files: 'src/make_prm.cpp'

#
#
# patch "src/make_prm.cpp"
#  from [83c6312cc45c5657734b544d35e256d1e6d5feff]
#    to [67084166fa8d39268b1743f5d5f1231d4265f427]
#
============================================================
--- src/make_prm.cpp	83c6312cc45c5657734b544d35e256d1e6d5feff
+++ src/make_prm.cpp	67084166fa8d39268b1743f5d5f1231d4265f427
@@ -29,8 +29,6 @@ BigInt random_prime(u32bit bits, const B

    while(true)
       {
-      global_state().pulse(PRIME_SEARCHING);
-
       BigInt p = random_integer(bits);
       p.set_bit(bits - 2);
       p.set_bit(0);
@@ -42,10 +40,7 @@ BigInt random_prime(u32bit bits, const B
       SecureVector<u32bit> sieve(sieve_size);

       for(u32bit j = 0; j != sieve.size(); ++j)
-         {
          sieve[j] = p % PRIMES[j];
-         global_state().pulse(PRIME_SIEVING);
-         }

       u32bit counter = 0;
       while(true)
@@ -53,8 +48,6 @@ BigInt random_prime(u32bit bits, const B
          if(counter == 4096 || p.bits() > bits)
             break;

-         global_state().pulse(PRIME_SEARCHING);
-
          bool passes_sieve = true;
          ++counter;
          p += modulo;
@@ -62,19 +55,14 @@ BigInt random_prime(u32bit bits, const B
          for(u32bit j = 0; j != sieve.size(); ++j)
             {
             sieve[j] = (sieve[j] + modulo) % PRIMES[j];
-            global_state().pulse(PRIME_SIEVING);
             if(sieve[j] == 0)
                passes_sieve = false;
             }

          if(!passes_sieve || gcd(p - 1, coprime) != 1)
             continue;
-         global_state().pulse(PRIME_PASSED_SIEVE);
          if(passes_mr_tests(p))
-            {
-            global_state().pulse(PRIME_FOUND);
             return p;
-            }
          }
       }
    }