 mlemanczyk
|
fddec17b3f
|
Various try-out changes
|
2025-10-17 06:53:54 +02:00 |
|
|
mlemanczyk
|
56e413064a
|
Using cleanup
|
2025-10-17 02:40:51 +02:00 |
|
|
Marek Lemańczyk
|
ca0f498d0d
|
Recycle small prime stepper arrays
|
2025-10-17 02:34:41 +02:00 |
|
|
mlemanczyk
|
06b08708d9
|
Merge branch 'codex/analyze-gc-instances-in-checkdivisors-method' of https://github.com/mlemanczyk/even-perfect-numbers-scanner into codex/analyze-gc-instances-in-checkdivisors-method
|
2025-10-17 01:24:44 +02:00 |
|
|
Marek Lemańczyk
|
26894db181
|
Merge pull request #179 from mlemanczyk/codex/optimize-partialfactor-method-in-primeordercalculator
Hoist Pollard Rho deadline checks outside factoring loop
|
2025-10-17 01:15:04 +02:00 |
|
|
Marek Lemańczyk
|
b81fe3de75
|
Hoist Pollard Rho deadline checks outside factoring loop
|
2025-10-17 01:14:51 +02:00 |
|
|
mlemanczyk
|
d6a1fa0b51
|
Tiny cleanup
|
2025-10-17 01:05:13 +02:00 |
|
|
mlemanczyk
|
0a2e65e190
|
Small optimizations
|
2025-10-17 00:29:53 +02:00 |
|
|
mlemanczyk
|
e63fba4df1
|
Merge branch 'codex/analyze-gc-instances-in-checkdivisors-method' of https://github.com/mlemanczyk/even-perfect-numbers-scanner into codex/analyze-gc-instances-in-checkdivisors-method
|
2025-10-17 00:11:47 +02:00 |
|
|
mlemanczyk
|
1b03fb311a
|
Cache switched to thread static for better performance
|
2025-10-17 00:10:49 +02:00 |
|
|
Marek Lemańczyk
|
1ce1622388
|
Optimize CPU small prime exponent extraction
|
2025-10-17 00:01:43 +02:00 |
|
|
mlemanczyk
|
140c291344
|
Small optimizations to limit code branches
|
2025-10-16 23:37:06 +02:00 |
|
|
Marek Lemańczyk
|
ab86fc16fe
|
Fix quotient and remainder calculation in factor extraction
|
2025-10-16 22:01:34 +02:00 |
|
|
Marek Lemańczyk
|
d2e7e4905a
|
Streamline primality cache locking
|
2025-10-16 21:52:42 +02:00 |
|
|
Marek Lemańczyk
|
8d9b8b1829
|
Replace primality cache with lock-backed dictionary
|
2025-10-16 21:51:42 +02:00 |
|
|
mlemanczyk
|
4c81f9e5a2
|
IsPrime cache reused
|
2025-10-16 21:21:40 +02:00 |
|
|
mlemanczyk
|
10751bf841
|
Concurrent dictionary added for IsPrime results caching to utilize the repetition of composites.
|
2025-10-16 21:10:58 +02:00 |
|
|
mlemanczyk
|
aa4ff799f3
|
Small optimizations
|
2025-10-16 19:46:25 +02:00 |
|
|
mlemanczyk
|
07395830a5
|
Unnecessary cleanup commented out
|
2025-10-16 18:13:28 +02:00 |
|
|
Marek Lemańczyk
|
e53bb6ba43
|
Track small-prime remainders with cycle steppers
|
2025-10-16 17:18:27 +02:00 |
|
|
Marek Lemańczyk
|
fb08a61c66
|
Restore pooled small factor buffers
|
2025-10-16 17:18:19 +02:00 |
|
|
Marek Lemańczyk
|
3e7ee6ab46
|
Restore pooled buffers in partial factorization
|
2025-10-16 04:52:17 +02:00 |
|
|
Marek Lemańczyk
|
9c474fc241
|
Use stack buffers for small composite collections
|
2025-10-16 00:59:00 +02:00 |
|
|
Marek Lemańczyk
|
3e7bffc812
|
Refactor heuristic pooling to cut GC pressure
|
2025-10-16 00:37:01 +02:00 |
|
|
Marek Lemańczyk
|
0a23502441
|
Clear heuristic candidate list without try-finally
|
2025-10-15 23:57:46 +02:00 |
|
|
Marek Lemańczyk
|
51730bcba3
|
Reduce GC pressure in divisor checking pipeline
|
2025-10-15 23:43:27 +02:00 |
|
|
Marek Lemańczyk
|
0b831b5a23
|
Reduce PartialFactor GC pressure
|
2025-10-15 04:39:46 +02:00 |
|
|
mlemanczyk
|
d3695a3dc3
|
Pools made thread static. Various small optimizations. "in" parameter added to read-only method parameters
|
2025-10-15 02:17:13 +02:00 |
|
|
mlemanczyk
|
7c71d5165e
|
TODO added
|
2025-10-13 21:16:03 +02:00 |
|
|
mlemanczyk
|
e9373dd8c9
|
PollardRho extended to allow running with 10_240 threads. Configuration made static to prevent unnecessary GC pressure.
|
2025-10-13 20:44:15 +02:00 |
|
|
mlemanczyk
|
313286f70d
|
Configuration adjusted
|
2025-10-13 20:13:44 +02:00 |
|
|
mlemanczyk
|
5a4a5e4d98
|
Heuristic defaults restored.
|
2025-10-10 22:48:46 +02:00 |
|
|
Marek Lemańczyk
|
c9ae56a5ec
|
Remove default prime order overloads
|
2025-10-10 21:51:41 +02:00 |
|
|
Marek Lemańczyk
|
cd1debe9d6
|
Various micro- and medium- optimizations
|
2025-10-07 22:14:34 +02:00 |
|
|
Marek Lemańczyk
|
26cc574020
|
Treat Pollard Rho success as the GPU primality check
|
2025-10-05 06:26:09 +02:00 |
|
|
Marek Lemańczyk
|
38df505f4f
|
Implement GPU pow2 heuristics with safe fallbacks
|
2025-10-04 22:40:12 +02:00 |
|
|
Marek Lemańczyk
|
84ebbed98b
|
Add shift-first multiply helper and document benchmarks
|
2025-10-04 20:01:10 +02:00 |
|
|
Marek Lemańczyk
|
40dff45a81
|
Small optimizations
|
2025-10-04 03:07:17 +02:00 |
|
|
Marek Lemańczyk
|
07dad89fdf
|
Add heuristic support for 128-bit prime orders
|
2025-10-04 01:58:11 +02:00 |
|
|
Marek Lemańczyk
|
c27673ed38
|
Performance improvement and debug console output added.
|
2025-10-04 01:06:44 +02:00 |
|
|
Marek Lemańczyk
|
4f18a02b02
|
Merge branch 'main' of https://github.com/mlemanczyk/even-perfect-numbers-scanner
|
2025-10-03 23:51:10 +02:00 |
|
|
Marek Lemańczyk
|
8527a43c97
|
Update PrimeOrderCalculator.cs
Additional console logging added
|
2025-10-03 23:49:20 +02:00 |
|
|
Marek Lemańczyk
|
2d1b6813d1
|
Accept heuristic prime order results
|
2025-10-03 23:36:15 +02:00 |
|
|
Marek Lemańczyk
|
4ce653d19a
|
Accelerate divisor cycle discovery with heuristic order calculator
|
2025-10-03 23:01:03 +02:00 |
|