Limiting the consecutive occurrence

[Pixel]

(05-29-2012 04:02 AM)ntk Wrote:  the one with 3p is virgin (UK)

---

mp64 runs on CPU not GPU, can it be run in more then one instances without reducing speed, if we have enough space? CPU supports SSE2 feature can it be used somehow? Has it used already.

Yes the speed worrying me too, and the size I have to delete a lot of files to make space for the n line ...

mp64 ain't the problem this tool is super quick, its sed this tool really needs multi-threads support and I'm surprised that it hasn't.

(05-29-2012 04:02 AM)ntk Wrote:  4gZaY34e is BT (UK) router WPA2/CMPK

never seen a key like this before, this would be really be hard to crack 62^8= 218,340,105,584,896 Oh my god!!!

---

M@LIK, need your sed wisdom again this is more for my curiosity than these lists as it would strip out too much I think.

So, how would sed delete all lines that don't have at least one or more duplicate character any where in the whole line?

Hash-IT what do you think to this. too much? you did say...

(05-28-2012 03:30 PM)Hash-IT Wrote:  optimized brute force attack. It is not meant to find everything but it aims to find most in the shortest time. .... hopefully.

and if we are still sticking to the assumption that we have observed we won't need these without at least one duplicate? it would make the lists alot smaller.


EDIT:
also with the current filter, if Ive worked this out right, each character will be 56.79GB or 58,162MB with 6,098,751,256 passwords so that means the full A-Z will be 1.44TB or 1,476GB with a total of 158,567,532,656 passwords saving/removing 50,259,531,920 or a percentage of 24.06%

and on your GPU Hash-IT, thats about 6 days and 12hr you will save.

although I don't know how to work out how long it will take to generate. its just done over 5GB, so only another 51.79GB to go