VanitySearch (Yet another address prefix finder)

[Rath_]

@Jean_Luc, what about case sensitive addresses? Is there any ETA on this feature? How difficult is it to implement such feature?

[1713538843]

1713538843

[1713538843]

1713538843

[1713538843]

1713538843

[1713538843]

1713538843

[1713538843]

1713538843

[Jean_Luc]

No, this is not difficult to implement.
I'll add this feature in the new release.

[escope]

Hello, @Jean_Luc!

First of all I want to say a big thank you for the amazing project you are developing. Just a huge pleasure to use it.
Had you been thinking about expanding pattern abilities? Search for a word at the end of an address or inside an address? What do you think about the implementation of regular expressions?
I know regex in vanitygen working with CPU only. I don't know if this is possible but I think it would be just awesome to see something like a hybrid algo for finding regex patterns faster.
Thank you!

[feryjhie]

No, this is not difficult to implement.
I'll add this feature in the new release.

can you add an option to search all address in lowercase or upper case?

[Jean_Luc]

can you add an option to search all address in lowercase or upper case?

I'm not sure to fully understand your request ? Could you be more precise ?

Hello, @Jean_Luc!

First of all I want to say a big thank you for the amazing project you are developing. Just a huge pleasure to use it.
Had you been thinking about expanding pattern abilities? Search for a word at the end of an address or inside an address? What do you think about the implementation of regular expressions?
I know regex in vanitygen working with CPU only. I don't know if this is possible but I think it would be just awesome to see something like a hybrid algo for finding regex patterns faster.
Thank you!

What do you think about using wildcard and using pattern like 1*Bit*Coin* ?

[feryjhie]

can you add an option to search all address in lowercase or upper case?

I'm not sure to fully understand your request? Could you be more precise?

the one i ask about is like this
in this thread  no upper/no lower address giveaway he can generate an address like this no upper case letters(e.g. 184wwh1dtg8xv858d1n1ktj2cpvvbjugft) or no lower case letters (e.g. 1GNGTB96XPDHQ47Y6SNP8KN3YNPLFUP6B8)

now he doesn't do that anymore and he doesn't share the application he uses to generate the address

[OgNasty]

What do you think about using wildcard and using pattern like 1*Bit*Coin* ?

I think that's a great idea.

[DaveF]

What do you think about using wildcard and using pattern like 1*Bit*Coin* ?

Would like that very much!

Also, is it possible to encrypt the -o text file that you save the keys to?
I am running this on a offline PC that in theory nobody has access to. But, since it's alone churning for days on end other people in the office can walk up to it.

It would be another switch that encrypts the file, and clears the screen so nobody can see the command you ran.

Paranoid, I know.

-Dave

[Jean_Luc]

Hi there

Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.

[escope]

Hi there

Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.

Awesome!
Hope to see all upper-case or all lower-case search. Also hope to see regexp search for finding whatever want.

I am not an expert but I guess there are some algos for base64 encoding/decoding on GPU:
https://www.codeproject.com/Articles/276993/Base64-Encoding-on-a-GPU
https://lemire.me/blog/2018/01/17/ridiculously-fast-base64-encoding-and-decoding/

Also there are several fast GPU regexp:
https://madhumithasridhara.github.io/QuickMatch/

[OgNasty]

Hope to see all upper-case or all lower-case search.

I don’t believe anything is stopping you from doing this now.

[RobertPaulig]

Jean_Luc
Here's your piece of code for generating pseudorandom numbers.
/* Knuth's PRNG as used in the Mersenne Twister reference implementation */

Code:

  for (pos=0; pos<RK_STATE_LEN; pos++)
  {
    state->key[pos] = seed;
    seed = (1812433253UL * (seed ^ (seed >> 30)) + pos + 1) & 0xffffffffUL;
  }

  state->pos = RK_STATE_LEN;
}

This is a quote from the Wiki

Is not cryptographically secure, unless the CryptMT variant (discussed below) is used. The reason is that observing a sufficient number of iterations (624 in the case of MT19937, since this is the size of the state vector from which future iterations are produced) allows one to predict all future iterations.

https://en.wikipedia.org/wiki/Mersenne_Twister

[escope]

I don’t believe anything is stopping you from doing this now.

I can. But I guess it is possible by slow CPU regexp in slow Vanitygen only.
Please if you know something lmk about that

[Jean_Luc]

Hope to see all upper-case or all lower-case search. Also hope to see regexp search for finding whatever want.

I am not an expert but I guess there are some algos for base64 encoding/decoding on GPU:
https://www.codeproject.com/Articles/276993/Base64-Encoding-on-a-GPU
https://lemire.me/blog/2018/01/17/ridiculously-fast-base64-encoding-and-decoding/

Also there are several fast GPU regexp:
https://madhumithasridhara.github.io/QuickMatch/

Thanks for the link, I will have a look at this.
Adding a way to generate only upper or lower case is easy except for the difficulty calculation.

Jean_Luc
Here's your piece of code for generating pseudorandom numbers.
...

Thanks for the info but as written in the readme it is better to use a seed for generating a safe base key and obviously to run it on a machine where you are alone. The PNRG is not used at all by default, it is enabled only if you want to use the -r option which I do not recommend (I will add a UNSAFE message in the command line usage infos for the - r option).

[DaveF]

Has anyone put together (or started to put together) a list of CPUs / Video Cards & the speed you can get out of them.
I know it's a newer project and Jean_Luc is working VERY VERY hard on it so getting accurate numbers is going to be a moving target. But for now all we can do is look through the thread and see who is running what to get a general idea.
So far I have pulled from this thread:

GPU: GPU #0 GeForce GTX 1080 Ti (28x128 cores) Grid(224x128)
914.418 MK/s (GPU 896.216 MK/s)

GPU: GPU #0 GeForce GTX 1050 Ti (6x128 cores) Grid(48x128)
220.180 MK/s (GPU 220.180 MK/s)

GPU: GPU #0 GeForce GT 520M (1x48 cores) Grid(8x128)
10.233 MK/s (GPU 7.026 MK/s)

GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
1535.880 MK/s (GPU 1470.257 MK/s)

Added 30-April-2019

GPU: GPU #0 GeForce GTX 1060 3GB (9x128 cores) Grid(72x128)
321.929 MK/s (GPU 321.929 MK/s)

GPU: GPU #0 GeForce GTX 1080 (20x128 cores) Grid(160x128)
672.062 MK/s (GPU 672.062 MK/s)

Added 1-May-2019

GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
GPU: GPU #3 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
GPU: GPU #2 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
GPU: GPU #1 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
7260.449 MK/s (GPU 7212.931 MK/s)
So 7260 / 4 = 1815 MK/s

GPU: GPU #0 GeForce GTX 750 (4x128 cores) Grid(32x128)
104.960 MK/s (GPU 94.405 MK/s) (2^32.12)

Added 3-May-2019
i7-7700K CPU Number of CPU thread: 8
22.092 MK/s (GPU 0.000 MK/s)

With -t 7
Number of CPU thread: 7
21.609 MK/s

Added 8-May-2019

EVGA RTX 2080 XC ULTRA
1427.967 MK/s (GPU 1424.946 MK/s)

Added 23-May-2019

GPU: GPU #0 GeForce GTX 1660 Ti
961.319 MK/s (GPU 961.319 MK/s)

GPU: GPU #0 GeForce RTX 2080 Ti (68x64 cores) Grid(544x128)
GPU: GPU #1 GeForce RTX 2080 Ti (68x64 cores) Grid(544x128)
5128.213 MK/s (GPU 5128.213 MK/s)
So 5128 / 2  = 2564 MK/s


Added 8-June-2019

GPU: GPU #0 GeForce GTX 960M (5x128 cores) Grid(40x128)
117.802 MK/s (GPU 117.802 MK/s)

Added 23-July-2019

GPU: GPU #0 GeForce GTX 1660 (22x64 cores) Grid(176x128)
839.061 MK/s (GPU 839.061 MK/s)

Added 25-July-2019

GPU: GPU #0 GeForce GTX 1650 (14x64 cores) Grid(112x128)
511.906 MK/s (GPU 511.906 MK/s) (2^36.97)


Added 21-Nov-2019

GPU: GPU #0 GeForce GTX 970 (13x128 cores) Grid(104x128)
360.322 MK/s (GPU 331.442 MK/s) (2^32.77)

Added 25-Nov-2019

GPU: GPU #0 GeForce GTX 980 (16x128 cores) Grid(128x128)
375.384 MK/s (GPU 375.384 MK/s)

GPU: GPU #0 GeForce RTX 2060 SUPER (34x64 cores) Grid(272x256)
[1361.71 Mkey/s][GPU 1361.71 Mkey/s]

GPU: GPU #0 GeForce RTX 2080 SUPER (48x64 cores) Grid(384x256)
[2001.52 Mkey/s][GPU 2001.52 Mkey/s]

Anything else?

-Dave

Last updated 25-Nov-2019.

[Coinettin]

Hi Jean_Luc,

Thank you for your work. It's a huge step for generating vanity addresses. I appreciate it.

[DarkStar_]

GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
1535.880 MK/s (GPU 1470.257 MK/s)

Anything else?

GPU: GPU #0 GeForce GTX 1060 3GB (9x128 cores) Grid(72x128)
321.929 MK/s (GPU 321.929 MK/s)

[DaveF]

GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
1535.880 MK/s (GPU 1470.257 MK/s)

Anything else?

GPU: GPU #0 GeForce GTX 1060 3GB (9x128 cores) Grid(72x128)
321.929 MK/s (GPU 321.929 MK/s)

I updated my original post.
https://bitcointalk.org/index.php?topic=5112311.msg50823897#msg50823897

I am going to do my best to keep it updated as more info comes in.
As I add cards I will post the date added so there will be some form of tracking.

-Dave

[Jean_Luc]

Many thanks for your report Dave

Some news:
Wildcard search is between 4 and 5 times slower than classic search for known prefixes. I reach ~40MK/s with my 1050 Ti and ~4MK/s with my i7-4770.
It is due to the fact that I have to compute full address each time and it requires 2 SHA for the checksum and a base58 encoding. For the CPU release, I implemented SSE checksum and I will try to implement SSE Base58 encoding using Barret's reduction (for computing div and mod 58).

[Lolo54]

Bonjour
You can add it https://bitcointalk.org/index.php?topic=5112311.msg50108268#msg50108268

Code:

C: \ VanitySearch> VanitySearch.exe -stop -gpu -gpuId 0,1,2,3 1SLarkBoyKEK 
Début Dim 10 mars 2019 22:26:19 
Difficulté: 583137945833742401536Search: 1SLarkBoyKEK 
base clé: 7098934A348028B578A730116289AC3A6BB56AFF8664117F5CE69920A360A4E9 
Nombre de thread CPU: 31 
GPU: GPU # 0 Tesla V100-SXM2-16GB (80x64 noyaux) Grille (640x128) 
GPU: GPU n ° 3 Tesla V100-SXM2-16GB (80x64 noyaux) Grille (640x128) 
GPU: GPU n ° 2 Tesla V100-SXM2-16GB (80x64 cœurs) Grille (640x128) 
GPU: GPU n ° 1 Tesla V100-SXM2-16GB (80x64 cœurs) Grille (640x128) 
7260.449 MK / s (GPU 7212.931 MK / s) (2 ^ 36.56) [P 0.00%] [50.00% en 1765.33y ] [0]