Hashtopolis Forum

Full Version: hashtopolis for one target
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
Hello, I can't find any information on my question, I hope you can help me. I recently encountered a situation where I need to use a brute force method to spot attack a hash. The hash brute force method is slow. And to get a positive result, I found several ways.
1. Increase the server performance. Thus reducing the waiting time for the decryption.
2. Increase the number of agents for hashtopolis, thereby creating a large and powerful pool.

I want to use the second option. The method of splitting tasks, where each agent performs its own task, is not suitable. I need all agents to work on calculating the hash, and their performance is summed. At the same time, so that each agent knows and does not use the "failed" attempts of other agents in a given session. The principle of work is similar to the work of miners in a common pool, to solve the hash of a bitcoin block.

Can you tell me, at the moment hashtopolis can cope with such a task? If so, please give information how I can implement this method of attack.
(08-29-2022, 12:48 PM)billy_vonka Wrote: [ -> ]Hello, I can't find any information on my question, I hope you can help me. I recently encountered a situation where I need to use a brute force method to spot attack a hash. The hash brute force method is slow. And to get a positive result, I found several ways.
1. Increase the server performance. Thus reducing the waiting time for the decryption.
2. Increase the number of agents for hashtopolis, thereby creating a large and powerful pool.

I want to use the second option. The method of splitting tasks, where each agent performs its own task, is not suitable. I need all agents to work on calculating the hash, and their performance is summed. At the same time, so that each agent knows and does not use the "failed" attempts of other agents in a given session. The principle of work is similar to the work of miners in a common pool, to solve the hash of a bitcoin block.

Can you tell me, at the moment hashtopolis can cope with such a task? If so, please give information how I can implement this method of attack.
 I too am researching hashtopolis for this very reason, I want them to ignore each others wrong answers in the pursuit of one hash, or even one hash list containing multiple hashes.
Yes, that's exactly what Hashtopolis is for. A larger task of many password candidates is split over multiple agents which each works on his part without doing the same work as the other agents.