3 ms·
Doesn't have any scaling losses - it's a very parallel problem. Divide the keyspace N ways, run N brute-force searches. Similarly, it doesn't benefit from a fas
by fwip 2y ago
Doesn't have any scaling losses - it's a very parallel problem. Divide the keyspace N ways, run N brute-force searches. Similarly, it doesn't benefit from a faster connection to other nodes or main memory.
Most bit-flips won't matter - either you get a false positive which is ruled out trivially, or the 1-in-$SearchSpace chance you get the false negative.
- jerf 2y agoFor education's sake and better internet search terms, there's some terms for this, the most popular of which is "embarassingly parallel": https://en.wikipedia.org/wiki/Embarrassingly_parallel https://en.wikipedia.org/wiki/Embarrassingly_parallel And agreed; coordination costs are negligible next to the cost of the calculation, so it should be effectively linear, and dominated by the luck of the draw on when the correct key is selected.