There is total separation between the myspace list and the rest of the program. The only thing the simulation can do is query hit or miss. Through these hits and misses it figures out what are the words inside the myspace list. The situation is exactly the same when the list is full of md5 hashes, except we hash the candidate password now before we check for a hit or miss.<p>&quot;what is the input and output of this at a conceptual level?&quot;
Our input is the dataset we want to crack, and our output is the passwords that were successfully cracked.
In a more conventional scenario, we would have a list of hashses that need to be cracked. So the steps are<p>1. pick parents at random<p>2. crossover and maybe mutate<p>3. hash the child<p>4. see if the hashed child exists as a password in our list of hashses we want to crack<p>5. if it does, add the child to the end of the container and pop the oldest organism from the front.<p>6. goto start