wheel_tuner.py

Author: WrathfulSpatula

FindAFactor/_find_a_factor.cpp

@@ -460,6 +460,7 @@ struct Factorizer {
           continue;
         }
         // We have a successful candidate.
+        std::cout << x << ", ";
 
         // If the candidate is already a perfect square,
         // we got lucky, and we might be done already.
@@ -679,6 +680,9 @@ struct Factorizer {
         throw std::runtime_error("No smooth numbers found. Sieve more, or increase smoothness bound to reduce selectiveness. (The sieving bound multiplier is equivalent to that many times the square root of the number to factor, for calculated numerical range above an offset of the square root of the number to factor.)");
     }
 
+    std::cout << std::endl;
+    std::cout << "Performing Gaussian elimination..." << std::endl;
+
     const std::vector<std::vector<size_t>> solutions = gaussianElimination();
     for (const std::vector<size_t>& solution : solutions) {
       const BigInteger factor = solveCongruence(solution);
@@ -914,6 +918,10 @@ std::string find_a_factor(std::string toFactorStr, size_t method, size_t nodeCou
     return isFactorFinder ? worker.sievePolynomials(&inc_seqs_clone) : worker.bruteForce(&inc_seqs_clone);
   };
 
+  if (isFactorFinder) {
+    std::cout << "Smooth numbers: ";
+  }
+
   for (unsigned cpu = 0U; cpu < CpuCount; ++cpu) {
     futures.push_back(std::async(std::launch::async, workerFn));
   }

pyproject.toml

@@ -8,7 +8,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "FindAFactor"
-version = "6.6.0"
+version = "6.7.0"
 requires-python = ">=3.8"
 description = "Find any nontrivial factor of a number"
 readme = {file = "README.txt", content-type = "text/markdown"}

setup.py

@@ -40,7 +40,7 @@ def build_extension(self, ext):
 
 setup(
     name='FindAFactor',
-    version='6.6.0',
+    version='6.7.0',
     author='Dan Strano',
     author_email='[email protected]',
     description='Find any nontrivial factor of a number',

wheel_test.py

@@ -0,0 +1,19 @@
+# Choose a wheel factorization ceiling:
+wheel_factorization_level = 50
+# Grab a sample of smooth numbers from `FACTOR_FINDER` mode, and paste them here.
+smooth_nums = [42571, 42576, 42583, 42589, 42591, 42592, 42593, 42595, 42598, 42601, 42612, 42615, 42617, 42634, 42635, 42639, 42641, 42650, 42677, 42687, 42689, 42696, 42709, 42723, 42747, 42754, 42786, 42800, 42806, 42849, 42851, 42852, 42864, 42871, 42909, 42929, 42931, 42936, 42937, 42942, 42962, 42978, 42985, 42986, 42994, 43013, 43059, 43061, 43079, 43094, 43105, 43109, 43114, 43133, 43150, 43168, 43187, 43209, 43247, 43279]
+
+# Primes up to 1000 are likely enough to choose from in general (but you can add more).
+primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]
+small_primes = [p for p in primes if p < wheel_factorization_level]
+smooth_num_count = len(smooth_nums)
+
+for p in small_primes:
+    mult_count = 0
+    for x in smooth_nums:
+        if (x % p) == 0:
+            mult_count += 1
+
+    print("Prime = " + str(p) + ", quality = " + str((1 / p) / ((mult_count / smooth_num_count)) if mult_count else 0))
+
+print("(Any low quality score, particularly less than 1.0, might be worth excluding.)")