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
536 Commits 19 Branches 0 Tags
b2ed0d58326cde2eaaaad3ceef9e1fd5c0ccd55b
Commit Graph
11 Commits
Author SHA1 Message Date
Marek Lemańczyk b8aa845c5c Clarify cycle stepper reset inlining 2025-10-02 13:30:56 +02:00
Marek Lemańczyk 36d316d19c Add TODOs for divisor metadata caching 2025-10-01 22:52:21 +02:00
Marek Lemańczyk 9becb8df67 using cleanup. 2025-09-23 22:00:31 +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 412ce4fd50 % 10 operations replaces with UInt128/ulong.Mod10 methods 2025-09-21 07:42:25 +02:00
Marek Lemańczyk 34cc0b0fdd Refine GPU residue prime tables 2025-09-17 17:35:26 +02:00
Marek Lemańczyk 95fa143ac3 Protection against integer overflow added 2025-09-10 19:52:46 +02:00
Marek Lemańczyk 60f6952f91 Check for overflow when calculating pow 2 2025-09-10 19:02:12 +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
Powered by Gitea Version: 28.2.0 Page: 33ms 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