I'm writing the full methodology on my 'smart-cracking' method, because the results were truly breath-taking, and it needs to be implemented in some way into every brute-force cracker from now on.

I was reading up on cryptopgraphy ciphers, and I heard frequency of letters being talked about for some cryptographic algorithms. So I though, 'WHY THE SHIT ISNT THIS USED IN BRUTEFORCING!?', then I thought that it wouldn't make much of a difference. I decided to try it anyways, since the basic implementation of it was really quick.
Normal results are 1000 times faster. THAT, is a reason to be doing this.
[color="#00FF00"]
Here is how it works:[/color]

The basic method for using this is simple. Change the order in which you crack to match the most frequently used letters. This goes as follows:
[code]
etaoinshrdlucmfwypvbgkqjxz
[/code]

That's just the beginning. You can then trim the last 12 letters off. Why? Because 80% of the letters that are most typed, are the first 12. You can, at the very least, remove the last 5. This dramatically speeds up cracking time.

This can then be sped up even further by using letter placement frequencies.
For the first letters in every word in the english dictionary, they are the most frequent:

a 	11.602%
b 	4.702%
c 	3.511%
d 	2.670%
e 	2.000%
f 	3.779%
g 	1.950%
h 	7.232%
i 	6.286%
j 	0.631%
k 	0.690%
l 	2.705%
m 	4.374%
n 	2.365%
o 	6.264%
p 	2.545%
q 	0.173%
r 	1.653%
s 	7.755%
t 	16.671%
u 	1.487%
v 	0.619%
w 	6.661%
x 	0.005%
y 	1.620%
z 	0.050%
In order:
<code>tashwiobmfcldpnegryukjvqzx</code>

But as you can see, this method will be harder to implement, as it requires lots of code, doing it letter by letter.

But it is being done right now, ryoh is getting the frequency for every letter position, and this will be implemented as a feature in every future brute-forcer that I make, I hope in will be in the rest of yours as well :D