12-05-2014, 10:25 PM
Right. Distributing CPU workload is easy because you have the actual literal keyspace and can simply divide it up as appropriate and this is consistent for all attack modes. But distributing oclHashcat gets very difficult because the keyspace of the base loop is calculated differently for each attack mode, and the multiplier changes depending on the real keyspace. It took us a little while to work through all of the corner cases in Hashstack and nail down the algorithm for consistently dividing up work. It's very rewarding once you finally figure it out, but it's definitely something you will struggle through.