Turn to the more efficient deterministic algorithm ?

[ytrezq]

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]

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 255*16384 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]

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 255*16384 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.