4 hours ago · Tech · hide · 0 comments

A few years ago I published vanity-keygen, a small Go program that brute-forces ed25519 SSH keypairs until the public key matches a regex. It did about 250k keys per second on my 32-core machine: a minute for love$, days for [pP][cC][aA][rR][rR][iI1][eE][rR].This week an LLM rewrote it from scratch in Rust, with all of the cryptography hand-rolled in a single OpenCL kernel. I provided direction, benchmarks on my hardware, and an RTX 4090; every line of code, including the test suite, is its. Kudos Kimi K3! It now does 300 million keys per second, 1200× faster, and my pattern lands in minutes.Everything on the deviceEach work item derives candidates end-to-end in kernels/vanity.cl, with no library code:SHA-512 of a 32-byte seed, specialized to a single block;clamping, then scalar multiplication against the ed25519 basepoint;field arithmetic mod 2^255−19, donna-style, 5 unsigned 64-bit limbs in radix 2^51;compressed-point encoding, SSH blob, base64;matching against a compiled filter.A…

No comments yet. Log in to reply on the Fediverse. Comments will appear here.