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
199 Commits 19 Branches 0 Tags
3fd39c3d3446d3bef610494ea63229b9c3229c19
Commit Graph
10 Commits
Author SHA1 Message Date
Marek Lemańczyk 412ce4fd50 % 10 operations replaces with UInt128/ulong.Mod10 methods 2025-09-21 07:42:25 +02:00
Marek Lemańczyk 7449f146d9 Ensure GPU residue copies are synchronized and cover high divisor sets 2025-09-20 22:49:37 +02:00
Marek Lemańczyk 1ec71f8cfd Align GPU prime sieve with CPU GCD heuristic 2025-09-20 19:48:36 +02:00
Marek Lemańczyk 47e694cdc1 Serialize GPU prime sieve per accelerator 2025-09-20 19:00:27 +02:00
Marek Lemańczyk b1ef9b9512 Tiny cleanup 2025-09-14 16:28:13 +02:00
Marek Lemańczyk 58eb65ca9e Refine GPU residue utilities and add positive divisor tests 2025-09-13 16:47:38 +02:00
Marek Lemańczyk c05cb04a5c Pooling restored 2025-09-10 02:19:45 +02:00
Marek Lemańczyk 117ea94b50 Avoid using declarations for GPU resources 2025-09-10 00:19:48 +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: 346ms Template: 7ms
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