Jean-Luc PONS

Hello, Yes when having a large list, you have to increase the number of maximum prefix found by the kernel using the -m option. I'm a bit surprised by this...

May be there is no duplicate address in your list but the gap [93,2882] is quite surprising. It means that the lookup table is not uniformly filled. In my test...

> > > When the optimized Pollard rho for attacking ECDLP256, will be ready ? I don't know, I have still few improvements to bring to VanitySearch.

Hi, Link are in the code. The one currently used in the Thomas Pornin's method (used with 62 bits instead of 31 in his implementation): https://github.com/pornin/bingcd/blob/main/doc/bingcd.pdf You can also activate...

There is few words in the README. https://github.com/JeanLucPons/VanitySearch#generate-a-vanity-address-for-a-third-party-using-split-key-vanity-address

The -sp and -rp options are for slipt-key only. This is for generating a vanity address by someone else in a safe manner. Basically the -sp (start public key) adds...

Exactly the same as -s, VanitySeacrh.exe -ps "My PassPhrase" 1MyPref The only difference is that with -ps a secure random string is concatenated to the specified passphrase, that also means...

Hi there, This would require a different program, at least for the GPU side. This feature requires to compute a complete EC multiplication at each point. The GPU constant memory...

Yes you can modify it but as I said It will better to start a new program, the strategy will be very different than the one currently used in VanitySearch...

When i have time, i'll start this pollard_rho project.