Verifiable Brute Force Strength

Summary

Verifiable brute force strength Below are table of various projects that can completely exhaust n-bits of keyspace. In other words, counting completely and fully from 0 to 2ⁿ-1. This Gist implies no discussion about how this is relevant to quantum computing using Grover's algorithm, meet-in-the-middle or birthday attacks, or anything of the like. It's strictly a Gist about raw speed, measuring the result in bits. If you know of other noteworthy and verifiable brute force searching projects, please reach out to me on Mastodon, and reference this Gist. Fastest rates as of 2026-01-05 This is a table of the fastest rates collected from the rest of the tables below. Project 2ⁿ/sec. 2ⁿ/hr. 2ⁿ/day 2ⁿ/wk. 2ⁿ/mo. 2ⁿ/yr. Bitcoin Mining 69.850 81.664 86.249 89.056 91.177 94.762 448x 2080 GPUs 44.855 56.669 61.254 64.061 66.181 69.765 RC5-72 39.841 51.655 56.240 59.047 61.168 64.753 8x 1080 GPUs 38.900 50.714 55.299 58.107 60.226 63.811 RTX 4090 GPU 38.070 49.884 54.469 57.276 59.396 62.981 AES-NI 35.528 47.341 51.927 54.734 56.853 60.438 macOS M3 Pro 33.181 44.995 49.580 52.387 54.503 58.093 ThinkPad T480s 31.616 37.522 48.014 50.822 52.941 56.526 Years to full 128-bit exhaustion Using the rates above, how long would it take to fully exhaust 128 bits? Note: human life will probably be extinct in about 1 billion years. Project Years Bitcoin Mining 10.131 billion 448x 2080 GPUs 339.220 quadrillion RC5-72 10.946 quintillion 8x 1080 GPUs 21.029 quintillion RTX 4090 GPU 37.383 quintillion AES-NI 217.866 quintillion macOS M3 Pro 1.107 sextillion ThinkPad T480s 3.280 sextillion Lenovo ThinkPad T480s /dev/urandom performance This is my personal laptop running dd(1) on /dev/urandom. It's mimicking getting data of various byte sizes, simulating key generation from 16 bytes (128 bits) up to 8 kilobytes (64 kilobits). I am running a Lenovo T480s ThinkPad with Linux kernel 5.16.11 on an Intel Core i7-8650U CPU @ 1.90GHz with Debian Sid. nordrand is set as a kernel argument during boot for ...