850 lines
25 KiB
C#
850 lines
25 KiB
C#
using System.Buffers;
|
|
using System.Diagnostics;
|
|
using System.Runtime.CompilerServices;
|
|
using EvenPerfectBitScanner.Candidates;
|
|
using Open.Collections;
|
|
using PerfectNumbers.Core;
|
|
using PerfectNumbers.Core.Cpu;
|
|
using PerfectNumbers.Core.Gpu;
|
|
|
|
namespace EvenPerfectBitScanner;
|
|
|
|
internal static class Program
|
|
{
|
|
private static ThreadLocal<PrimeTester> PrimeTesters = null!;
|
|
private static ThreadLocal<MersenneNumberTester> MersenneTesters = null!;
|
|
private static ThreadLocal<ModResidueTracker> PResidue = null!; // p mod d tracker (per-thread)
|
|
private const ulong InitialP = PerfectNumberConstants.BiggestKnownEvenPerfectP;
|
|
private static MersenneNumberDivisorGpuTester? _divisorTester;
|
|
private static IMersenneNumberDivisorByDivisorTester? _byDivisorTester;
|
|
private static Dictionary<ulong, (bool DetailedCheck, bool PassedAllTests)>? _byDivisorPreviousResults;
|
|
private static bool _limitReached;
|
|
private static ulong _byDivisorStartPrime;
|
|
private static CliArguments _cliArguments;
|
|
private static int _testTargetPrimeCount;
|
|
private static int _testProcessedPrimeCount;
|
|
|
|
[ThreadStatic]
|
|
private static bool _lastCompositeP;
|
|
|
|
private static void Main(string[] args)
|
|
{
|
|
try
|
|
{
|
|
CliArguments parsedArguments = CliArguments.Parse(args);
|
|
if (parsedArguments.ThreadCount == 0 && !parsedArguments.ShowHelp)
|
|
{
|
|
return;
|
|
}
|
|
|
|
_cliArguments = parsedArguments;
|
|
|
|
if (_cliArguments.ShowHelp)
|
|
{
|
|
CliArguments.PrintHelp();
|
|
return;
|
|
}
|
|
|
|
NttGpuMath.GpuTransformBackend = _cliArguments.NttBackend;
|
|
NttGpuMath.ReductionMode = _cliArguments.ModReductionMode;
|
|
GpuContextPool.ForceCpu = _cliArguments.ForcePrimeKernelsOnCpu;
|
|
|
|
ulong currentP = _cliArguments.StartPrime;
|
|
ulong remainder = currentP % 6UL;
|
|
bool startPrimeProvided = _cliArguments.StartPrimeProvided;
|
|
int threadCount = Math.Max(1, _cliArguments.ThreadCount);
|
|
int blockSize = Math.Max(1, _cliArguments.BlockSize);
|
|
int gpuPrimeThreads = Math.Max(1, _cliArguments.GpuPrimeThreads);
|
|
int gpuPrimeBatch = Math.Max(1, _cliArguments.GpuPrimeBatch);
|
|
GpuKernelType kernelType = _cliArguments.KernelType;
|
|
bool useBitTransform = _cliArguments.UseBitTransform;
|
|
bool useOrder = _cliArguments.UseOrder;
|
|
bool useResidue = _cliArguments.UseResidue;
|
|
bool useDivisor = _cliArguments.UseDivisor;
|
|
bool useByDivisor = _cliArguments.UseByDivisor;
|
|
bool useLucas = _cliArguments.UseLucas;
|
|
bool testMode = _cliArguments.TestMode;
|
|
bool useGpuCycles = _cliArguments.UseGpuCycles;
|
|
PrimeTransformMode transformMode = _cliArguments.UseBitTransform
|
|
? PrimeTransformMode.Bit
|
|
: (useResidue ? PrimeTransformMode.Add : PrimeTransformMode.AddPrimes);
|
|
CandidatesCalculator.Configure(transformMode);
|
|
bool mersenneOnGpu = _cliArguments.UseMersenneOnGpu;
|
|
bool orderOnGpu = _cliArguments.UseOrderOnGpu;
|
|
int scanBatchSize = Math.Max(1, _cliArguments.ScanBatchSize);
|
|
int sliceSize = Math.Max(1, _cliArguments.SliceSize);
|
|
ulong residueKMax = _cliArguments.ResidueKMax;
|
|
string filterFile = _cliArguments.FilterFile;
|
|
UInt128 maxPrimeLimit = _cliArguments.MaxPrimeLimit;
|
|
bool maxPrimeConfigured = _cliArguments.MaxPrimeConfigured;
|
|
string cyclesPath = _cliArguments.CyclesPath;
|
|
int cyclesBatchSize = Math.Max(1, _cliArguments.CyclesBatchSize);
|
|
bool continueCyclesGeneration = _cliArguments.ContinueCyclesGeneration;
|
|
ulong divisorCyclesSearchLimit = _cliArguments.DivisorCyclesSearchLimit;
|
|
ulong? orderWarmupLimitOverride = _cliArguments.OrderWarmupLimitOverride;
|
|
int testPrimeCandidateLimit = 0;
|
|
|
|
_limitReached = false;
|
|
_testTargetPrimeCount = 0;
|
|
_testProcessedPrimeCount = 0;
|
|
|
|
if (testMode)
|
|
{
|
|
currentP = 31UL;
|
|
remainder = currentP % 6UL;
|
|
filterFile = string.Empty;
|
|
maxPrimeLimit = UInt128.MaxValue;
|
|
maxPrimeConfigured = false;
|
|
startPrimeProvided = true;
|
|
testPrimeCandidateLimit = Math.Max(1, threadCount) * 3;
|
|
}
|
|
|
|
if (useByDivisor)
|
|
{
|
|
_byDivisorStartPrime = startPrimeProvided ? currentP : 0UL;
|
|
}
|
|
else
|
|
{
|
|
_byDivisorStartPrime = 0UL;
|
|
}
|
|
|
|
if (useByDivisor && !testMode && string.IsNullOrEmpty(filterFile))
|
|
{
|
|
Console.WriteLine("--mersenne=bydivisor requires --filter-p=<path>.");
|
|
return;
|
|
}
|
|
|
|
// Apply GPU prime sieve runtime configuration
|
|
GpuPrimeWorkLimiter.SetLimit(gpuPrimeThreads);
|
|
PrimeTester.GpuBatchSize = Math.Max(1, gpuPrimeBatch);
|
|
|
|
MersenneDivisorCycles mersenneDivisorCycles = new();
|
|
if (!File.Exists(cyclesPath) || continueCyclesGeneration)
|
|
{
|
|
Console.WriteLine($"Generating divisor cycles '{cyclesPath}' for all p <= {PerfectNumberConstants.MaxQForDivisorCycles}...");
|
|
|
|
long nextPosition = 0L, completeCount = 0L;
|
|
if (continueCyclesGeneration && File.Exists(cyclesPath))
|
|
{
|
|
Console.WriteLine("Finding last divisor position...");
|
|
(nextPosition, completeCount) = MersenneDivisorCycles.FindLast(cyclesPath);
|
|
}
|
|
|
|
if (useGpuCycles)
|
|
{
|
|
if (!continueCyclesGeneration || completeCount == 0L)
|
|
{
|
|
Console.WriteLine("Starting generation...");
|
|
}
|
|
else
|
|
{
|
|
Console.WriteLine("Resuming generation...");
|
|
}
|
|
|
|
// TODO: Wire GenerateGpu to the unrolled-hex kernel that led the MersenneDivisorCycleLengthGpuBenchmarks once it lands.
|
|
MersenneDivisorCycles.GenerateGpu(cyclesPath, PerfectNumberConstants.MaxQForDivisorCycles, cyclesBatchSize, skipCount: completeCount, nextPosition: nextPosition);
|
|
}
|
|
else
|
|
{
|
|
MersenneDivisorCycles.Generate(cyclesPath, PerfectNumberConstants.MaxQForDivisorCycles);
|
|
}
|
|
}
|
|
|
|
Console.WriteLine($"Loading divisor cycles into memory...");
|
|
if (string.Equals(Path.GetExtension(cyclesPath), ".csv", StringComparison.OrdinalIgnoreCase))
|
|
{
|
|
MersenneDivisorCycles.Shared.LoadFrom(cyclesPath);
|
|
}
|
|
else
|
|
{
|
|
MersenneDivisorCycles.Shared.LoadFrom(cyclesPath);
|
|
}
|
|
|
|
DivisorCycleCache.SetDivisorCyclesBatchSize(cyclesBatchSize);
|
|
DivisorCycleCache.Shared.ConfigureGeneratorDevice(useGpuCycles);
|
|
// TODO: Keep a single cached block loaded from disk and honor the configured device when
|
|
// computing ad-hoc cycles for divisors that fall outside that snapshot instead of queuing
|
|
// generation of additional blocks.
|
|
DivisorCycleCache.Shared.RefreshSnapshot();
|
|
// TODO: Stop reloading the full snapshot once the ad-hoc path streams results straight from
|
|
// the configured device without persisting them, so memory stays bounded while preserving
|
|
// the single cached block strategy.
|
|
|
|
Console.WriteLine("Divisor cycles are ready");
|
|
|
|
if (useByDivisor)
|
|
{
|
|
blockSize = 1;
|
|
}
|
|
|
|
PResidue = new ThreadLocal<ModResidueTracker>(() => new ModResidueTracker(ResidueModel.Identity, initialNumber: currentP, initialized: true), trackAllValues: true);
|
|
PrimeTesters = new ThreadLocal<PrimeTester>(() => new PrimeTester(), trackAllValues: true);
|
|
// Note: --primes-device controls default device for library kernels; p primality remains CPU here.
|
|
// Initialize per-thread p residue tracker (Identity model) at currentP
|
|
if (!useDivisor && !_cliArguments.UseByDivisor)
|
|
{
|
|
MersenneTesters = new ThreadLocal<MersenneNumberTester>(() =>
|
|
{
|
|
// ProcessEightBitWindows windowed pow2 ladder is the default kernel.
|
|
var tester = new MersenneNumberTester(
|
|
useIncremental: !useLucas,
|
|
useOrderCache: false,
|
|
kernelType: kernelType,
|
|
useOrder: useOrder,
|
|
useGpuLucas: mersenneOnGpu,
|
|
useGpuScan: mersenneOnGpu,
|
|
useGpuOrder: orderOnGpu,
|
|
useResidue: useResidue,
|
|
maxK: residueKMax);
|
|
if (!useLucas)
|
|
{
|
|
Console.WriteLine("Warming up orders");
|
|
tester.WarmUpOrders(currentP, orderWarmupLimitOverride ?? 5_000_000UL);
|
|
}
|
|
|
|
return tester;
|
|
}, trackAllValues: true);
|
|
}
|
|
else if (useDivisor)
|
|
{
|
|
MersenneNumberDivisorGpuTester.BuildDivisorCandidates();
|
|
|
|
_divisorTester = new MersenneNumberDivisorGpuTester();
|
|
}
|
|
else if (useByDivisor)
|
|
{
|
|
_byDivisorTester = mersenneOnGpu
|
|
? new MersenneNumberDivisorByDivisorGpuTester()
|
|
: new MersenneNumberDivisorByDivisorCpuTester();
|
|
_byDivisorTester.BatchSize = scanBatchSize;
|
|
}
|
|
|
|
// Load RLE blacklist (optional)
|
|
if (!string.IsNullOrEmpty(_cliArguments.RleBlacklistPath))
|
|
{
|
|
RleBlacklist.Load(_cliArguments.RleBlacklistPath!);
|
|
}
|
|
|
|
// Mod6 lookup turned out slower (see Mod6ComparisonBenchmarks), so keep `%` here for large candidates.
|
|
if (currentP == InitialP && string.IsNullOrEmpty(filterFile))
|
|
{
|
|
// bool passedAllTests = IsEvenPerfectCandidate(InitialP, out bool searchedMersenne, out bool detailedCheck);
|
|
// Skip the already processed range below 138 million
|
|
while (currentP < 138_000_000UL && !Volatile.Read(ref _limitReached))
|
|
{
|
|
currentP = CandidatesCalculator.AdvancePrime(currentP, ref remainder, ref _limitReached);
|
|
}
|
|
|
|
if (Volatile.Read(ref _limitReached))
|
|
{
|
|
return;
|
|
}
|
|
}
|
|
|
|
Console.WriteLine("Initialization...");
|
|
// Compose a results file name that encodes configuration (before opening file)
|
|
var builtName = BuildResultsFileName(
|
|
useBitTransform,
|
|
threadCount,
|
|
blockSize,
|
|
kernelType,
|
|
useLucas,
|
|
useDivisor,
|
|
useByDivisor,
|
|
mersenneOnGpu,
|
|
useOrder,
|
|
_cliArguments.UseGcdFilter,
|
|
NttGpuMath.GpuTransformBackend,
|
|
gpuPrimeThreads,
|
|
sliceSize,
|
|
scanBatchSize,
|
|
orderWarmupLimitOverride ?? 5_000_000UL,
|
|
NttGpuMath.ReductionMode,
|
|
mersenneOnGpu ? "gpu" : "cpu",
|
|
GpuContextPool.ForceCpu ? "cpu" : "gpu",
|
|
orderOnGpu ? "gpu" : "cpu");
|
|
|
|
if (!string.IsNullOrEmpty(_cliArguments.ResultsPrefix))
|
|
{
|
|
builtName = _cliArguments.ResultsPrefix + "_" + builtName;
|
|
}
|
|
|
|
string resultsFileName = string.IsNullOrEmpty(_cliArguments.ResultsDirectory)
|
|
? builtName
|
|
: Path.Combine(_cliArguments.ResultsDirectory!, builtName);
|
|
|
|
CalculationResultHandler.Initialize(resultsFileName, _cliArguments.WriteBatchSize);
|
|
var dir = Path.GetDirectoryName(resultsFileName);
|
|
if (!string.IsNullOrEmpty(dir))
|
|
{
|
|
Directory.CreateDirectory(dir!);
|
|
}
|
|
|
|
|
|
Dictionary<ulong, (bool DetailedCheck, bool PassedAllTests)>? previousResults = useByDivisor ? new Dictionary<ulong, (bool DetailedCheck, bool PassedAllTests)>() : null;
|
|
_byDivisorPreviousResults = previousResults;
|
|
|
|
if (File.Exists(resultsFileName))
|
|
{
|
|
Console.WriteLine("Processing previous results...");
|
|
LoadResultsFile(resultsFileName, (p, detailedCheck, passedAllTests) =>
|
|
{
|
|
CalculationResultHandler.RegisterExistingResult(detailedCheck, passedAllTests);
|
|
|
|
if (previousResults is not null)
|
|
{
|
|
previousResults[p] = (detailedCheck, passedAllTests);
|
|
}
|
|
});
|
|
}
|
|
else
|
|
{
|
|
CalculationResultHandler.CreateResultsFileWithHeader();
|
|
}
|
|
|
|
bool useFilter = !testMode && !string.IsNullOrEmpty(filterFile);
|
|
HashSet<ulong> filter = [];
|
|
List<ulong> byDivisorCandidates = [];
|
|
ulong maxP = 0UL;
|
|
ulong[] localFilter = Array.Empty<ulong>();
|
|
int filterCount = 0;
|
|
|
|
if (useByDivisor)
|
|
{
|
|
if (testMode)
|
|
{
|
|
byDivisorCandidates = CandidatesCalculator.BuildTestPrimeCandidates(testPrimeCandidateLimit);
|
|
}
|
|
else
|
|
{
|
|
Console.WriteLine("Loading filter...");
|
|
int skippedByLimit = 0;
|
|
byDivisorCandidates = LoadByDivisorCandidates(filterFile, maxPrimeLimit, maxPrimeConfigured, out skippedByLimit);
|
|
if (maxPrimeConfigured)
|
|
{
|
|
if (skippedByLimit > 0)
|
|
{
|
|
Console.WriteLine($"Skipped {skippedByLimit} by-divisor candidate(s) above --max-prime limit.");
|
|
}
|
|
|
|
if (byDivisorCandidates.Count == 0)
|
|
{
|
|
Console.WriteLine("No by-divisor candidates fall within the --max-prime limit.");
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (useFilter)
|
|
{
|
|
Console.WriteLine("Loading filter...");
|
|
// TODO: Rent this filter buffer from ArrayPool<ulong> and reuse it across reload batches so
|
|
// we do not allocate fresh arrays while replaying large result filters.
|
|
localFilter = new ulong[1024];
|
|
filterCount = 0;
|
|
bool addedWithinLimit = false;
|
|
int skippedByLimit = 0;
|
|
LoadResultsFile(filterFile, (p, detailedCheck, passedAllTests) =>
|
|
{
|
|
if (!passedAllTests)
|
|
{
|
|
return;
|
|
}
|
|
|
|
if (maxPrimeConfigured && (UInt128)p > maxPrimeLimit)
|
|
{
|
|
skippedByLimit++;
|
|
return;
|
|
}
|
|
|
|
localFilter[filterCount++] = p;
|
|
addedWithinLimit = true;
|
|
if (p > maxP)
|
|
{
|
|
maxP = p;
|
|
}
|
|
|
|
if (filterCount == 1024)
|
|
{
|
|
filter.AddRange(localFilter[..filterCount]);
|
|
filterCount = 0;
|
|
Console.WriteLine($"Added {p}");
|
|
}
|
|
});
|
|
|
|
if (filterCount > 0)
|
|
{
|
|
filter.AddRange(localFilter[..filterCount]);
|
|
}
|
|
|
|
if (maxPrimeConfigured)
|
|
{
|
|
if (!addedWithinLimit)
|
|
{
|
|
Console.WriteLine("No filter candidates fall within the --max-prime limit.");
|
|
return;
|
|
}
|
|
|
|
if (skippedByLimit > 0)
|
|
{
|
|
Console.WriteLine($"Skipped {skippedByLimit} filter candidate(s) above --max-prime limit.");
|
|
}
|
|
}
|
|
}
|
|
|
|
if (testMode)
|
|
{
|
|
_testTargetPrimeCount = testPrimeCandidateLimit;
|
|
}
|
|
CalculationResultHandler.InitializeOutputBuffer();
|
|
|
|
// Limit GPU concurrency only for prime checks (LL/NTT & GPU order scans).
|
|
GpuPrimeWorkLimiter.SetLimit(gpuPrimeThreads);
|
|
// Configure batch size for GPU primality sieve
|
|
PrimeTester.GpuBatchSize = gpuPrimeBatch;
|
|
|
|
Stopwatch? stopwatch = null;
|
|
if (testMode)
|
|
{
|
|
stopwatch = Stopwatch.StartNew();
|
|
}
|
|
|
|
Console.WriteLine("Starting scan...");
|
|
|
|
if (useByDivisor)
|
|
{
|
|
MersenneNumberDivisorByDivisorTester.Run(
|
|
byDivisorCandidates,
|
|
_byDivisorTester!,
|
|
_byDivisorPreviousResults,
|
|
_byDivisorStartPrime,
|
|
static () => _lastCompositeP = true,
|
|
static () => _lastCompositeP = false,
|
|
static (candidate, searchedMersenne, detailedCheck, passedAllTests) => CalculationResultHandler.HandleResult(candidate, searchedMersenne, detailedCheck, passedAllTests, _lastCompositeP),
|
|
threadCount);
|
|
CalculationResultHandler.FlushBuffer();
|
|
CalculationResultHandler.ReleaseOutputBuffer();
|
|
if (stopwatch is not null)
|
|
{
|
|
stopwatch.Stop();
|
|
CalculationTestTime.Report(stopwatch.Elapsed, _cliArguments.ResultsDirectory);
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
if (!useDivisor && !_cliArguments.UseByDivisor)
|
|
{
|
|
threadCount = Math.Max(1, threadCount);
|
|
// Don't remove this. It's to initialize the testers
|
|
_ = MersenneTesters.Value;
|
|
if (!useLucas)
|
|
{
|
|
Console.WriteLine("Warming up orders...");
|
|
MersenneTesters.Value!.WarmUpOrders(currentP, orderWarmupLimitOverride ?? 5_000_000UL);
|
|
}
|
|
}
|
|
|
|
if (testMode)
|
|
{
|
|
testPrimeCandidateLimit = Math.Max(1, threadCount) * 3;
|
|
_testTargetPrimeCount = testPrimeCandidateLimit;
|
|
}
|
|
|
|
CandidatesCalculator.InitializeState(currentP, remainder);
|
|
|
|
Task[] tasks = new Task[threadCount];
|
|
|
|
int taskIndex = 0;
|
|
for (; taskIndex < threadCount; taskIndex++)
|
|
{
|
|
tasks[taskIndex] = Task.Run(() =>
|
|
{
|
|
int count, j;
|
|
ulong p;
|
|
bool passedAllTests, searchedMersenne, detailedCheck;
|
|
ArrayPool<ulong> pool = ThreadStaticPools.UlongPool;
|
|
ulong[] buffer = pool.Rent(blockSize);
|
|
while (!Volatile.Read(ref _limitReached))
|
|
{
|
|
count = CandidatesCalculator.ReserveBlock(buffer, blockSize, ref _limitReached);
|
|
if (count == 0)
|
|
{
|
|
break;
|
|
}
|
|
|
|
if (!useFilter)
|
|
{
|
|
for (j = 0; j < count && !Volatile.Read(ref _limitReached); j++)
|
|
{
|
|
p = buffer[j];
|
|
passedAllTests = IsEvenPerfectCandidate(p, divisorCyclesSearchLimit, out searchedMersenne, out detailedCheck);
|
|
CalculationResultHandler.HandleResult(p, searchedMersenne, detailedCheck, passedAllTests, _lastCompositeP);
|
|
}
|
|
|
|
continue;
|
|
}
|
|
|
|
bool reachedMax = false;
|
|
|
|
for (j = 0; j < count; j++)
|
|
{
|
|
p = buffer[j];
|
|
|
|
if (Volatile.Read(ref _limitReached) && p > maxP)
|
|
{
|
|
break;
|
|
}
|
|
|
|
if (!filter.Contains(p))
|
|
{
|
|
continue;
|
|
}
|
|
|
|
passedAllTests = IsEvenPerfectCandidate(p, divisorCyclesSearchLimit, out searchedMersenne, out detailedCheck);
|
|
CalculationResultHandler.HandleResult(p, searchedMersenne, detailedCheck, passedAllTests, _lastCompositeP);
|
|
|
|
if (p == maxP)
|
|
{
|
|
reachedMax = true;
|
|
}
|
|
}
|
|
|
|
if (reachedMax)
|
|
{
|
|
Volatile.Write(ref _limitReached, true);
|
|
break;
|
|
}
|
|
}
|
|
|
|
pool.Return(buffer);
|
|
});
|
|
}
|
|
|
|
Task.WaitAll(tasks);
|
|
|
|
TimeSpan testElapsed = default;
|
|
bool reportTestTime = false;
|
|
if (stopwatch is not null)
|
|
{
|
|
stopwatch.Stop();
|
|
testElapsed = stopwatch.Elapsed;
|
|
reportTestTime = true;
|
|
}
|
|
|
|
CalculationResultHandler.FlushBuffer();
|
|
CalculationResultHandler.ReleaseOutputBuffer();
|
|
|
|
if (reportTestTime)
|
|
{
|
|
CalculationTestTime.Report(testElapsed, _cliArguments.ResultsDirectory);
|
|
}
|
|
}
|
|
finally
|
|
{
|
|
CalculationResultHandler.Dispose();
|
|
}
|
|
}
|
|
|
|
// TODO: Move this to a new static class CalculationResultsFile under IO namespace / folder. Rename it to LoadCandidatesWithinRange.
|
|
private static List<ulong> LoadByDivisorCandidates(string candidateFile, UInt128 maxPrimeLimit, bool maxPrimeConfigured, out int skippedByLimit)
|
|
{
|
|
List<ulong> candidates = [];
|
|
skippedByLimit = 0;
|
|
using FileStream readStream = new(candidateFile, FileMode.Open, FileAccess.Read, FileShare.ReadWrite);
|
|
using StreamReader reader = new(readStream);
|
|
string? line;
|
|
ReadOnlySpan<char> span;
|
|
while ((line = reader.ReadLine()) is not null)
|
|
{
|
|
if (string.IsNullOrWhiteSpace(line))
|
|
{
|
|
continue;
|
|
}
|
|
|
|
span = line.AsSpan().Trim();
|
|
if (span.IsEmpty || span[0] == '#')
|
|
{
|
|
continue;
|
|
}
|
|
int index = 0;
|
|
while (index < span.Length)
|
|
{
|
|
if (!char.IsDigit(span[index]))
|
|
{
|
|
index++;
|
|
continue;
|
|
}
|
|
|
|
int start = index;
|
|
index++;
|
|
while (index < span.Length && char.IsDigit(span[index]))
|
|
{
|
|
index++;
|
|
}
|
|
|
|
if (Utf8CliParser.TryParseUInt64(span[start..index], out ulong parsed))
|
|
{
|
|
if (!maxPrimeConfigured || (UInt128)parsed <= maxPrimeLimit)
|
|
{
|
|
candidates.Add(parsed);
|
|
}
|
|
else
|
|
{
|
|
skippedByLimit++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return candidates;
|
|
}
|
|
|
|
// TODO: Move this to a new static class CalculationResultsFile under IO namespace / folder. Rename it to EnumerateCandidates.
|
|
private static void LoadResultsFile(string resultsFileName, Action<ulong, bool, bool> lineProcessorAction)
|
|
{
|
|
using FileStream readStream = new(resultsFileName, FileMode.Open, FileAccess.Read, FileShare.ReadWrite);
|
|
using StreamReader reader = new(readStream);
|
|
string? line;
|
|
bool headerSkipped = false;
|
|
ReadOnlySpan<char> span;
|
|
int first = 0;
|
|
int second = 0;
|
|
int third = 0;
|
|
ulong parsedP = 0UL;
|
|
ReadOnlySpan<char> detailedSpan = default;
|
|
ReadOnlySpan<char> passedAllTestsSpan = default;
|
|
bool detailed = false;
|
|
bool passedAllTests = false;
|
|
while ((line = reader.ReadLine()) != null)
|
|
{
|
|
if (!headerSkipped)
|
|
{
|
|
headerSkipped = true;
|
|
continue;
|
|
}
|
|
|
|
if (string.IsNullOrWhiteSpace(line))
|
|
{
|
|
continue;
|
|
}
|
|
|
|
span = line.AsSpan();
|
|
first = span.IndexOf(',');
|
|
if (first < 0)
|
|
{
|
|
continue;
|
|
}
|
|
parsedP = Utf8CliParser.ParseUInt64(span[..first]);
|
|
span = span[(first + 1)..];
|
|
second = span.IndexOf(',');
|
|
if (second < 0)
|
|
{
|
|
continue;
|
|
}
|
|
|
|
span = span[(second + 1)..];
|
|
third = span.IndexOf(',');
|
|
if (third < 0)
|
|
{
|
|
continue;
|
|
}
|
|
|
|
detailedSpan = span[..third];
|
|
passedAllTestsSpan = span[(third + 1)..];
|
|
|
|
if (Utf8CliParser.TryParseBoolean(detailedSpan, out detailed) && Utf8CliParser.TryParseBoolean(passedAllTestsSpan, out passedAllTests))
|
|
{
|
|
lineProcessorAction(parsedP, detailed, passedAllTests);
|
|
}
|
|
}
|
|
}
|
|
|
|
// TODO: Move this to a new static class CalculationResultsFile under IO namespace / folder. Rename it to BuildFileName.
|
|
private static string BuildResultsFileName(bool bitInc, int threads, int block, GpuKernelType kernelType, bool useLucasFlag, bool useDivisorFlag, bool useByDivisorFlag, bool mersenneOnGpu, bool useOrder, bool useGcd, NttBackend nttBackend, int gpuPrimeThreads, int llSlice, int gpuScanBatch, ulong warmupLimit, ModReductionMode reduction, string mersenneDevice, string primesDevice, string orderDevice)
|
|
{
|
|
string inc = bitInc ? "bit" : "add";
|
|
string mers = useDivisorFlag
|
|
? "divisor"
|
|
: (useLucasFlag
|
|
? "lucas"
|
|
: (useByDivisorFlag
|
|
? "bydivisor"
|
|
: (kernelType == GpuKernelType.Pow2Mod ? "pow2mod" : "incremental")));
|
|
string ntt = nttBackend == NttBackend.Staged ? "staged" : "reference";
|
|
string red = reduction switch { ModReductionMode.Mont64 => "mont64", ModReductionMode.Barrett128 => "barrett128", ModReductionMode.GpuUInt128 => "uint128", _ => "auto" };
|
|
string order = useOrder ? "order-on" : "order-off";
|
|
string gcd = useGcd ? "gcd-on" : "gcd-off";
|
|
Span<char> initialBuffer = stackalloc char[256];
|
|
var builder = new PooledValueStringBuilder(initialBuffer);
|
|
try
|
|
{
|
|
builder.Append("even_perfect_bit_scan_inc-");
|
|
builder.Append(inc);
|
|
builder.Append("_thr-");
|
|
builder.Append(threads);
|
|
builder.Append("_blk-");
|
|
builder.Append(block);
|
|
builder.Append("_mers-");
|
|
builder.Append(mers);
|
|
builder.Append("_mersdev-");
|
|
builder.Append(mersenneDevice);
|
|
builder.Append("_ntt-");
|
|
builder.Append(ntt);
|
|
builder.Append("_red-");
|
|
builder.Append(red);
|
|
builder.Append("_primesdev-");
|
|
builder.Append(primesDevice);
|
|
builder.Append('_');
|
|
builder.Append(order);
|
|
builder.Append("_orderdev-");
|
|
builder.Append(orderDevice);
|
|
builder.Append('_');
|
|
builder.Append(gcd);
|
|
builder.Append("_gputh-");
|
|
builder.Append(gpuPrimeThreads);
|
|
builder.Append("_llslice-");
|
|
builder.Append(llSlice);
|
|
builder.Append("_scanb-");
|
|
builder.Append(gpuScanBatch);
|
|
builder.Append("_warm-");
|
|
builder.Append(warmupLimit);
|
|
builder.Append(".csv");
|
|
return builder.ToString();
|
|
}
|
|
finally
|
|
{
|
|
builder.Dispose();
|
|
}
|
|
}
|
|
|
|
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
private static void OnPrimeCandidateConfirmed()
|
|
{
|
|
if (!_cliArguments.TestMode)
|
|
{
|
|
return;
|
|
}
|
|
|
|
int processed = Interlocked.Increment(ref _testProcessedPrimeCount);
|
|
if (processed == _testTargetPrimeCount)
|
|
{
|
|
Volatile.Write(ref _limitReached, true);
|
|
}
|
|
}
|
|
|
|
internal static bool IsEvenPerfectCandidate(ulong p, ulong divisorCyclesSearchLimit, out bool searchedMersenne, out bool detailedCheck)
|
|
{
|
|
searchedMersenne = false;
|
|
detailedCheck = false;
|
|
_lastCompositeP = false;
|
|
|
|
if (_cliArguments.UseGcdFilter && p.IsCompositeByGcd())
|
|
{
|
|
_lastCompositeP = true;
|
|
return false;
|
|
}
|
|
|
|
// Optional: RLE blacklist and binary-threshold filters on p (safe only when configured)
|
|
if (p <= _cliArguments.RleHardMaxP)
|
|
{
|
|
if (!_cliArguments.RleOnlyLast7 || p.Mod10() == 7UL)
|
|
{
|
|
if (RleBlacklist.IsLoaded() && RleBlacklist.Matches(p))
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (_cliArguments.ZeroFractionHard >= 0 || (_cliArguments.ZeroFractionConjecture >= 0 && _cliArguments.MaxZeroConjecture >= 0))
|
|
{
|
|
double zf;
|
|
int bitLength;
|
|
int zeroCountValue;
|
|
int maxZeroBlockValue;
|
|
p.ComputeBitStats(out bitLength, out zeroCountValue, out maxZeroBlockValue);
|
|
zf = (double)zeroCountValue / bitLength;
|
|
if (_cliArguments.ZeroFractionHard >= 0)
|
|
{
|
|
if (zf > _cliArguments.ZeroFractionHard)
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
|
|
if (_cliArguments.ZeroFractionConjecture >= 0 && _cliArguments.MaxZeroConjecture >= 0)
|
|
{
|
|
if (zf > _cliArguments.ZeroFractionConjecture && maxZeroBlockValue >= _cliArguments.MaxZeroConjecture)
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Fast residue-based composite check for p using small primes
|
|
if (!_cliArguments.UseDivisor && !_cliArguments.UseByDivisor && IsCompositeByResidues(p))
|
|
{
|
|
searchedMersenne = false;
|
|
detailedCheck = false;
|
|
_lastCompositeP = true;
|
|
return false;
|
|
}
|
|
|
|
// If primes-device=gpu, route p primality through GPU-assisted sieve with deterministic MR validation.
|
|
if (!_cliArguments.UseByDivisor)
|
|
{
|
|
if (!(GpuContextPool.ForceCpu
|
|
? PrimeTesters.Value!.IsPrime(p, CancellationToken.None)
|
|
: PrimeTesters.Value!.IsPrimeGpu(p, CancellationToken.None)))
|
|
{
|
|
_lastCompositeP = true;
|
|
return false;
|
|
}
|
|
|
|
OnPrimeCandidateConfirmed();
|
|
}
|
|
|
|
searchedMersenne = true;
|
|
if (_cliArguments.UseByDivisor)
|
|
{
|
|
// Windowed pow2mod kernel handles by-divisor scans.
|
|
return _byDivisorTester!.IsPrime(p, out detailedCheck);
|
|
}
|
|
|
|
detailedCheck = MersenneTesters.Value!.IsMersennePrime(p);
|
|
return detailedCheck;
|
|
}
|
|
|
|
// TODO: Move this together with the tracker to existing CandidatesCalculator class in the Candidates folder.
|
|
// Use ModResidueTracker with a small set of primes to pre-filter composite p.
|
|
private static bool IsCompositeByResidues(ulong p)
|
|
{
|
|
var tracker = PResidue.Value!;
|
|
// TODO: Integrate the divisor-cycle cache here so the small-prime sweep reuses precomputed remainders instead of
|
|
// running MergeOrAppend for every candidate and missing the cycle-accelerated early exits.
|
|
tracker.BeginMerge(p);
|
|
// Use the small prime list from PerfectNumbers.Core to the extent of sqrt(p)
|
|
var primes = PrimesGenerator.SmallPrimes;
|
|
var primesPow2 = PrimesGenerator.SmallPrimesPow2;
|
|
int len = primes.Length;
|
|
int primeIndex = 0;
|
|
bool divisible;
|
|
for (; primeIndex < len; primeIndex++)
|
|
{
|
|
if (primesPow2[primeIndex] > p)
|
|
{
|
|
break;
|
|
}
|
|
|
|
if (tracker.MergeOrAppend(p, primes[primeIndex], out divisible) && divisible)
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
}
|