All the data about the X amount of years etc it takes to crack a PW etc, is based on trying X zillion etc combinations until it's cracked. That presumes the cracking has to try Every possible combination before it gets a result. But i'm "suggesting" that "might" not be the case at all. Why should it automatically be presumed that only until the last X zillion iteration after X years has completed that we get the result ? So the much banded about figures for the amount of time it would take, is in error. In "theory" it's correct, but that's all ! It depends entirely on BOTH what the PW etc is, & also on how the cracking is coded for expediency. If the software is only coded to start at abc/123 etc, then that's the long way to do it. What about having multiple attacks starting at numerous different entry points, not just starting at abc/123 but anywhere possible within the range, forwards & backwards. These individual attacks could be arranged in multiple blocks that didn't overlap, the more there are the quicker it could be cracked. Also it's a bit like the lottery, i'm not aware of EVER seeing 123456 etc come up as the winning number. It could of course, but Never has AFAIK.