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^n-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 note-worthy and verifiable brute force searching projects,