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

Switch GPU powmod host helpers to simplified mul-mod

Browse Source
This commit is contained in:
Marek Lemańczyk committed 2025-10-25 02:20:09 +02:00
1 parent 03194650c9
commit 4b13bc6497
2 files changed
+7 -7
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

PerfectNumbers.Core/ULongExtensions.Gpu.cs
+5 -5
View File
@@ -81,7 +81,7 @@ public static partial class ULongExtensions
while (index >= 0)
{
ulong currentBit = (exponent >> index) & 1UL;
ulong squared = result.MulMod64(result, modulus);
ulong squared = result.GpuCompatibleMulModSimplifiedExtension(result, modulus);
result = currentBit == 0UL ? squared : result;
index = currentBit == 0UL ? index - 1 : index;
if (currentBit == 0UL)
@@ -101,14 +101,14 @@ public static partial class ULongExtensions
int windowLength = index - windowStart + 1;
for (int square = 0; square < windowLength; square++)
{
result = result.MulMod64(result, modulus);
result = result.GpuCompatibleMulModSimplifiedExtension(result, modulus);
}
ulong mask = (1UL << windowLength) - 1UL;
ulong windowValue = (exponent >> windowStart) & mask;
int tableIndex = (int)((windowValue - 1UL) >> 1);
ulong multiplier = oddPowers[tableIndex];
result = result.MulMod64(multiplier, modulus);
result = result.GpuCompatibleMulModSimplifiedExtension(multiplier, modulus);
index = windowStart - 1;
}
@@ -311,11 +311,11 @@ public static partial class ULongExtensions
return;
}
ulong square = baseValue.MulMod64(baseValue, modulus);
ulong square = baseValue.GpuCompatibleMulModSimplifiedExtension(baseValue, modulus);
for (int i = 1; i < oddPowers.Length; i++)
{
ulong previous = oddPowers[i - 1];
oddPowers[i] = previous.MulMod64(square, modulus);
oddPowers[i] = previous.GpuCompatibleMulModSimplifiedExtension(square, modulus);
}
}