rebryk / profanity-brute-force

Tool to hack a vanity address generated with Profanity
125 stars 35 forks source link

Turn to the more efficient deterministic algorithm ? #18

Open ytrezq opened 11 months ago

ytrezq commented 11 months ago

1inch talked about a deterministic algorithm. The only reference I found is :

Since the disclosure of accurate information can lead to hacking other projects, you will only see generalized data here.

Why not search in order to do it ?

Willyfab commented 10 months ago

1inch talked to a deterministic algorithm. The only reference I found is :

Since the disclosure of accurate information can lead to hacking other projects, you will only see generalized data here.

Why not search in order to do it ?

There are 4B seeds, in the original tool, one seed is chosen and derived to 2M different private keys sent to the 25516384 work items. Then these 2 millions keys are derived until profanity find a match. Good luck testing 4 billions seeds 2m derived keys * the number of rounds...

The only thing I don't get is how these 2m derived keys are generated and how to calculate the very first private key.

ytrezq commented 10 months ago

1inch talked to a deterministic algorithm. The only reference I found is :

Since the disclosure of accurate information can lead to hacking other projects, you will only see generalized data here.

Why not search in order to do it ?

There are 4B seeds, in the original tool, one seed is chosen and derived to 2M different private keys sent to the 25516384 work items. Then these 2 millions keys are derived until profanity find a match. Good luck testing 4 billions seeds 2m derived keys * the number of rounds...

The only thing I don't get is how these 2m derived keys are generated and how to calculate the very first private key.

No you didn’t read their article… It allows in seconds to find a private key given a public key if possible.