Commit Graph
16 Commits
Author SHA1 Message Date
Marek Lemańczyk ebe3b306b9 Refine Mul64 benchmarks with GPU-friendly variant 2025-09-30 04:24:40 +02:00
Marek Lemańczyk 615ae29fd6 Fix residue tester filters and arithmetic utilities 2025-09-24 03:05:34 +02:00
Marek Lemańczyk 6e99ee39e3 Extension methods benchmarked. Slower alternatives replaced. 2025-09-23 22:01:09 +02:00
Marek Lemańczyk 7d112c347f Accelerate Mersenne modular multiplication paths 2025-09-22 23:24:19 +02:00
Marek Lemańczyk 762d205e86 Reuse local variables across modulo helpers 2025-09-22 19:54:59 +02:00
Marek Lemańczyk 3b8a10a20b Inline single-use modulo helpers 2025-09-22 19:54:54 +02:00
Marek Lemańczyk ca866ffc5b Reapply modulo helpers and inline fast remainders 2025-09-22 19:26:07 +02:00
Marek Lemańczyk ace3fcbf34 Rescope loop variables for divisor workflows 2025-09-22 15:11:44 +02:00
Marek Lemańczyk 95a0b030f6 Add optimized modulo helpers for unsigned integers 2025-09-21 10:14:26 +02:00
Marek Lemańczyk 2c2bc62cb2 Small refactoring 2025-09-21 09:32:01 +02:00
Marek Lemańczyk 412ce4fd50 % 10 operations replaces with UInt128/ulong.Mod10 methods 2025-09-21 07:42:25 +02:00
Marek Lemańczyk 1499f6abe1 Benchmarks extended. Small optimizations. 2025-09-21 06:15:14 +02:00
Marek Lemańczyk 72d66e293d Optimize simultaneous remainder calculation 2025-09-21 04:12:34 +02:00
Marek Lemańczyk 01277832e6 Implement UInt128 exponentiation and apply in Mersenne scan 2025-09-10 01:51:37 +02:00
Marek Lemańczyk 2be49020a9 Small primes array type changed to uint[] to avoid excessive memory use, especially on GPU 2025-09-09 23:58:09 +02:00
Marek Lemańczyk 9f35f6c558 Initial commit. 2025-09-09 21:15:57 +02:00