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

Merge pull request #203 from mlemanczyk/codex/fix-primeordergpuheuristicstests-issue

Browse Source 
Adjust GPU pow2 tests for large exponent coverage
This commit is contained in:
Marek Lemańczyk authored and GitHub committed 2025-10-19 01:49:24 +02:00
2 parents 2c6e9f5460 405436988f
commit 691a0d20b7
1 file changed
+12 -6
Download Patch File Download Diff File Expand all files Collapse all files
PerfectNumbers.Core.Tests/Gpu/PrimeOrderGpuHeuristicsTests.cs
+12 -6
View File
@@ -38,9 +38,10 @@ public class PrimeOrderGpuHeuristicsTests
[Fact] [Fact]
public void TryPow2Mod_returns_success_for_supported_prime() public void TryPow2Mod_returns_success_for_supported_prime()
{ {
const ulong prime = 193UL; const ulong exponent = 138_000_001UL;
const ulong prime = 138_000_001UL;
MontgomeryDivisorData divisorData = MontgomeryDivisorData.FromModulus(prime); MontgomeryDivisorData divisorData = MontgomeryDivisorData.FromModulus(prime);
GpuPow2ModStatus status = PrimeOrderGpuHeuristics.TryPow2Mod(1UL, prime, out ulong remainder, divisorData); GpuPow2ModStatus status = PrimeOrderGpuHeuristics.TryPow2Mod(exponent, prime, out ulong remainder, divisorData);
status.Should().Be(GpuPow2ModStatus.Success); status.Should().Be(GpuPow2ModStatus.Success);
remainder.Should().Be(2UL); remainder.Should().Be(2UL);
@@ -118,14 +119,19 @@ public class PrimeOrderGpuHeuristicsTests
public void TryPow2ModBatch_returns_success_for_supported_prime() public void TryPow2ModBatch_returns_success_for_supported_prime()
{ {
ulong[] remainders = { 123UL, 456UL }; ulong[] remainders = { 123UL, 456UL };
ulong[] exponents = { 1UL, 2UL }; ulong[] exponents = { 138_000_001UL, 138_000_011UL };
const ulong prime = 257UL; const ulong prime = 138_000_001UL;
MontgomeryDivisorData divisorData = MontgomeryDivisorData.FromModulus(prime); MontgomeryDivisorData divisorData = MontgomeryDivisorData.FromModulus(prime);
GpuPow2ModStatus status = PrimeOrderGpuHeuristics.TryPow2ModBatch(exponents, prime, remainders, divisorData); GpuPow2ModStatus status = PrimeOrderGpuHeuristics.TryPow2ModBatch(exponents, prime, remainders, divisorData);
ulong expectedFirst = (ulong)BigInteger.ModPow(2, exponents[0], prime);
ulong expectedSecond = (ulong)BigInteger.ModPow(2, exponents[1], prime);
status.Should().Be(GpuPow2ModStatus.Success); status.Should().Be(GpuPow2ModStatus.Success);
remainders[0].Should().Be(2UL); expectedFirst.Should().Be(2UL);
remainders[1].Should().Be(4UL); expectedSecond.Should().Be(2048UL);
remainders[0].Should().Be(expectedFirst);
remainders[1].Should().Be(expectedSecond);
} }
[Fact] [Fact]