Logo
Explore Help
Sign In
mlemanczyk/even-perfect-numbers-scanner
Watch 1
Star 0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
479 Commits 19 Branches 0 Tags
01ac80466bfbdb81d1d31fc30434d2f3c6da2676
Commit Graph
9 Commits
Author SHA1 Message Date
Marek Lemańczyk 7aaccb5feb Stop using IDisposable on prime order scopes 2025-10-10 02:57:54 +02:00
mlemanczyk b2ab47e0ee Recording of failed heuristic cases turned off to speed up calculations 2025-10-09 23:57:10 +02:00
Marek Lemańczyk f196f1fb96 Assume heuristic order when divisors are unresolved 2025-10-09 23:13:37 +02:00
Marek Lemańczyk 9e0c90a281 Log heuristic fallback primes 2025-10-09 22:49:20 +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 0bc97937aa Restore GPU-backed UInt128 pow2 Montgomery helper 2025-10-05 02:13:31 +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 07dad89fdf Add heuristic support for 128-bit prime orders 2025-10-04 01:58:11 +02:00
Powered by Gitea Version: 28.2.0 Page: 42ms Template: 6ms
Auto
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API