mlemanczyk/even-perfect-numbers-scanner
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add heuristic prime sieves for cached divisor sequences

Browse Source
This commit is contained in:
Marek Lemańczyk committed 2025-10-26 03:21:29 +01:00
1 parent 4ee6464130
commit 15c229665d
10 files changed
+1597 -364
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

PerfectNumbers.Core/PrimeOrderCalculator.Cpu.cs
+11 -6
View File
@@ -1055,6 +1055,8 @@ internal static partial class PrimeOrderCalculator
List<PendingEntry> pending = ThreadStaticPools.RentPrimeOrderPendingEntryList(2);
Stack<ulong>? compositeStack = null;
PartialFactorResult result;
PrimeTester primeTester = PrimeTester.Exclusive;
if (!gpuFactored)
{
// We don't need to worry about leftovers, because we always use indexes within the calculated counts
@@ -1120,7 +1122,7 @@ internal static partial class PrimeOrderCalculator
// continue;
// }
bool isPrime = PrimeTester.IsPrimeGpu(composite);
bool isPrime = primeTester.HeuristicIsPrimeGpu(composite);
// bool isPrime = PrimeTester.IsPrimeInternal(composite, CancellationToken.None);
// bool isPrime = Open.Numeric.Primes.Prime.Numbers.IsPrime(composite);
@@ -1182,9 +1184,10 @@ internal static partial class PrimeOrderCalculator
if (!entry.HasKnownPrimality)
{
bool isPrime = PrimeTester.IsPrimeGpu(composite);
bool isPrime = primeTester.HeuristicIsPrimeGpu(composite);
// bool isPrime = PrimeTester.IsPrimeInternal(composite, CancellationToken.None);
// bool isPrime = Open.Numeric.Primes.Prime.Numbers.IsPrime(composite);
entry = entry.WithPrimality(isPrime);
pending[index] = entry;
}
@@ -1213,7 +1216,7 @@ internal static partial class PrimeOrderCalculator
}
else
{
cofactorIsPrime = PrimeTester.IsPrimeGpu(cofactor);
cofactorIsPrime = primeTester.HeuristicIsPrimeGpu(cofactor);
// cofactorIsPrime = PrimeTester.IsPrimeInternal(cofactor, CancellationToken.None);
// cofactorIsPrime = Open.Numeric.Primes.Prime.Numbers.IsPrime(cofactor);
}
@@ -1743,7 +1746,9 @@ internal static partial class PrimeOrderCalculator
return;
}
bool isPrime = PrimeTester.IsPrimeGpu(value);
PrimeTester primeTester = PrimeTester.Exclusive;
bool isPrime = primeTester.HeuristicIsPrimeGpu(value);
// bool isPrime = PrimeTester.IsPrimeInternal(value, CancellationToken.None);
// bool isPrime = Open.Numeric.Primes.Prime.Numbers.IsPrime(value);
if (!knownComposite && isPrime)
@@ -1755,7 +1760,7 @@ internal static partial class PrimeOrderCalculator
ulong factor = PollardRhoStrict(value);
ulong quotient = value / factor;
isPrime = PrimeTester.IsPrimeGpu(factor);
isPrime = primeTester.HeuristicIsPrimeGpu(factor);
// isPrime = PrimeTester.IsPrimeInternal(factor, CancellationToken.None);
// isPrime = Open.Numeric.Primes.Prime.Numbers.IsPrime(factor);
if (isPrime)
@@ -1786,7 +1791,7 @@ internal static partial class PrimeOrderCalculator
}
else
{
isPrime = PrimeTester.IsPrimeGpu(quotient);
isPrime = primeTester.HeuristicIsPrimeGpu(quotient);
// isPrime = PrimeTester.IsPrimeInternal(quotient, CancellationToken.None);
// isPrime = Open.Numeric.Primes.Prime.Numbers.IsPrime(quotient);
}