VanitySearch (Yet another address prefix finder)

[ayiphelmy]

yes but I would be curious to know the speed of PNY QUADRO RTX 8000 48 GO . One tesla V100 gives about 2900 Mkey / s but QUADRO RTX 8000 ...

that insane gpu LOL

[feryjhie]

Finally I've found the perfect vanity for me!
https://www.blockchain.com/btc/address/1EKKKKLVMLHUUTSXMWGSBQGPATSBDCEEVH

It took ~one full day with 15MK/s
Huge thank you senior Jean_Luc
Also now I have a lot of pleasant addresses with only one number inside

wow, can you share what is the correct command to get all the uppercase letters address?

btw i try to check my GPU speed but i just get an error like below

Code:

VanitySearch v1.14
Search: 1*1111 [Compressed]
Start Sat May 18 11:34:33 2019
Base Key: 9F711488D99E9B52AEE9C47E8CAB4AE287F9C97C0943D0D07A9DBB995A516B35
Number of CPU thread: 7
GPUEngine: CudaGetDeviceCount CUDA driver version is insufficient for CUDA runtime version
GPU:

what i need to install to get my GPU works?

[Lolo54]

You need CUDA 10 drivers
should be also verified that the gpu is compatible with the last version before
https://www.nvidia.fr/Download/index.aspx?lang=en

[escope]

wow, can you share what is the correct command to get all the uppercase letters address?

Well I just added more symbols to wildcard match function in Wildcard.cpp/GPUWildcard.h for finding exact patterns I want.
It's very easy to do. I shared my one https://github.com/skipper70/VanitySearch
I guess it's not a good way to go for production because we should write own regex on next steps =D

[feryjhie]

You need CUDA 10 drivers
should be also verified that the gpu is compatible with the last version before
https://www.nvidia.fr/Download/index.aspx?lang=en

well i just found out that my GPU is an AMD which mean it's not supported by CUDA
as i search on google that CUDA is only for Nvidia users

[naska21]

snip
Wow beautiful speed the 2080 Ti 

Yeah, the speed is high but not worthy to waste ~$1300 just  to be one of those vanity credits.  I am using msi rtx 2080 ti for the purpose for which it was intended that is for mining. I don't see the point of wasting any computational resources to search for  vanity addresses as  they are no different from "ordinary" ones   in regard of security, privacy, profitability and other things that do matter.

[Lolo54]

wow, can you share what is the correct command to get all the uppercase letters address?

Well I just added more symbols to wildcard match function in Wildcard.cpp/GPUWildcard.h for finding exact patterns I want.
It's very easy to do. I shared my one https://github.com/skipper70/VanitySearch
I guess it's not a good way to go for production because we should write own regex on next steps =D

This command is fun after a few hours of testing here is what gives it to me

with only capital letters apart from a single digit

Code:

VanitySearchCUDA10.1141.exe -gpu 1@
VanitySearch v1.14
Search: 1@ [Compressed]
Start Sun May 19 16:07:08 2019
Base Key: BE02CCFA6B1E0C37B104973DD0C8F4F6C5B4D81B011D8DCE5699FB1AA3639203
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
171.668 MK/s (GPU 167.465 MK/s) (2^39.42) [0]
Pub Addr: 1FLQJ1XXEDWRKBEKDMRYGLVFGFUWTNRFQY
Priv (WIF): p2pkh:L3b4riW4Lqzb7ypgdgdAfNkx1NnzjYWRTnVVUA1cjgp1Q6xoiig5
Priv (HEX): 0xBE02CCFA6B1E0C37B104973DD0C8F4F6C634D81B054C8DCE5699FB1AA3950F0F

With only uppercase letters and numbers with prefixes starting with 1

Code:

VanitySearchCUDA10.1141.exe -gpu 1A@0
VanitySearch v1.14
Search: 1A@0 [Compressed]
Start Sun May 19 21:16:10 2019
Base Key: A3E23D4B5F0C8A5CAB10C40A7717CA3B61889D3C4268DC664DD134D91E0AE161
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
24.539 MK/s (GPU 22.458 MK/s) (2^27.88) [0]
Pub Addr: 1A4W7PDN1LEMV4JM5GNQ487HJBPVDH6NPM
Priv (WIF): p2pkh:KzqPMJ3jw1mW6ykL9S6AF5Rf1aTMSpVfCpb5hn6vvC5i5MiFduXT
Priv (HEX): 0x6BDD6A5B1F6EA65EE490267CF96B726022C02647B81E2AECB813B716E891EF49
45.045 MK/s (GPU 43.835 MK/s) (2^31.50) [1]
Pub Addr: 1AL7HBZ9PR1LSA57LW6KRYL8DTTFM3RBSC
Priv (WIF): p2pkh:L4QRtNMyTdGCoeyV8qcKiRYfX93TQJefNj23MTTdKG43R3TKPxuY
Priv (HEX): 0xD66043D3ACA232A1F075D4510CF21E831B4D94A2F8B5E9B1C9AC12227EE7B17C
45.033 MK/s (GPU 43.823 MK/s) (2^31.61) [2]
Pub Addr: 1AEJZ8ZHVW4L6FMD8QR8ASCP2H258DQZQQ
Priv (WIF): p2pkh:L2E37uJPBNAEdbaksWJvqgMNnNHc2wmFDK1HWR6siEWo3Xzgf6M2
Priv (HEX): 0x955ADCC8E1D75A3B44C914D16BCD08F3E9D253E9921A7D8462EBAD5337654F83
33.841 MK/s (GPU 32.634 MK/s) (2^32.05) [3]
Pub Addr: 1AGVQZMD19GCC47JXBFZPCG84B3MXU39VZ
Priv (WIF): p2pkh:L4eSt997pMnyYXnKccc9hwCfgNkuFbfUwwueExTKuzahyuZRYVUi
Priv (HEX): 0xDD9645A08D90FB40DB6A537C7EA6188B4F227E3A5692A1E811BD6A0A7C466D17

addresses vanities in 3 and only capital letters

Code:

VanitySearchCUDA10.1141.exe -gpu 3@
VanitySearch v1.14
Search: 3@ [Compressed]
Start Mon May 20 01:21:52 2019
Base Key: 2A260E200ABFA08FC619A195207C6A0598567A26826B6E373369969065869B20
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
77.335 MK/s (GPU 75.185 MK/s) (2^39.79) [0]
Pub Addr: 3EPSGRMFHQJXJZYZPFPXHZX1CLA1GWEXFN
Priv (WIF): p2wpkh-p2sh:L4bYdVCubrXvLXzS9QqCJrX86TvseF7y2ViCqKbBbCAi16mKYZob
Priv (HEX): 0xDC183BD69292C31CF55058FD6A1B2B8F98C550F8CCBBA067228BB2807577C843
75.923 MK/s (GPU 73.765 MK/s) (2^40.30) [1]
Pub Addr: 3FYUAUADLLELDN1X1VQYJPNZSEKNRPGGMC
Priv (WIF): p2wpkh-p2sh:L4PQjLn5MzmpP9XjiBxNdDJgNWumdsJLT5ZyGuA7uDeAwVE3gPLp
Priv (HEX): 0xD5D9F1DFF5405F7039E65E6ADF8395F921D862BFFFB232048C68C7FC6A54ECF9
76.127 MK/s (GPU 73.995 MK/s) (2^41.33) [2]

addresses vanities looking for numbers .... after more than 24h still nothing :-(

Code:

VanitySearchCUDA10.1141.exe -gpu 10
VanitySearch v1.14
Search: 10 [Compressed]
Start Sun May 19 17:29:36 2019
Base Key: EB517E2C95521769D657D9FCDB6F94D7A60B18F18A7A51405308657C787AF732
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
171.265 MK/s (GPU 166.954 MK/s) (2^43.16) [0]

it works very well but the speed is 8 times slower than in normal mode.
It took me about 1h15 to get this type of addresses all in uppercase starting with 1 / a vanity address with that numbers starting with 1 always nothing more than 24h / a vanity address with only capital letters starting with 3 it's even slower to count close to a day.
It would be nice to be able to do it in lower case too :-)

[Jean_Luc]

Hello,
I published a new release with a fix to prevent generation of segwit addresses using uncompressed keys which is invalid.
I never use uncompressed address so i totally missed this.

[Jean_Luc]

Well I just added more symbols to wildcard match function in Wildcard.cpp/GPUWildcard.h for finding exact patterns I want.
It's very easy to do. I shared my one https://github.com/skipper70/VanitySearch
I guess it's not a good way to go for production because we should write own regex on next steps =D

Nice work
As you seem to be familiar with the code, if you want to implement the regexp, fell free to send pull request

[ayiphelmy]

snip
Wow beautiful speed the 2080 Ti 

Yeah, the speed is high but not worthy to waste ~$1300 just  to be one of those vanity credits.  I am using msi rtx 2080 ti for the purpose for which it was intended that is for mining. I don't see the point of wasting any computational resources to search for  vanity addresses as  they are no different from "ordinary" ones   in regard of security, privacy, profitability and other things that do matter.

thats just a benchmark just curious for the speed... daily use is for mining

[escope]

Nice work
As you seem to be familiar with the code, if you want to implement the regexp, fell free to send pull request

Thank you. I would be very happy to do this. But I'm not able do more than few edits =D

with only capital letters apart from a single digit

I did an exception for char "1" in a code

addresses vanities looking for numbers .... after more than 24h still nothing :-(

I think it's impossible on regular GPU for next years

[feryjhie]

btw is the private key for address 3 and bc1q is able to import to bitcoin core?

~snip

i try the command in my vanitysearch but turn out nothing to search, can you share how to do it via pm or share it here?

[DaveF]

I been slacking in updating my post of card speeds.
https://bitcointalk.org/index.php?topic=5112311.msg50823897#msg50823897
I hope to carve out some time tomorrow or Friday to go though the thread and update it.
Sorry for not keeping it up.

-Dave

[Jean_Luc]

Hello,

Many thanks Dave for you work
A friend of me use a GTX 1660 Ti which gives a very good ratio price/performance (especially for integer calculation)

Code:

VanitySearch.exe -gpu -t 0 1testme
VanitySearch v1.13
Difficulty: 888446610539
Search: 1testme [Compressed]
Start Mon May 13 08:35:35 2019
Base Key: CBCC3BD678704956F2126B5B1346102F315D3271B83545A55C160324E98F52BF
Number of CPU thread: 0
GPU: GPU #0 GeForce GTX 1660 Ti (24x64 cores) Grid(192x128)
961.319 MK/s (GPU 961.319 MK/s) (2^35.46) [P 5.16%][50.00% in 00:09:51][0]

[DaveF]

I been slacking in updating my post of card speeds.
https://bitcointalk.org/index.php?topic=5112311.msg50823897#msg50823897
I hope to carve out some time tomorrow or Friday to go though the thread and update it.
Sorry for not keeping it up.

-Dave

Updated.

Jean_Luc could you put a link to my post in the 1st post so people don't have to go through 15 of the 20 pages to find it. (someone sent me a PM about that)

Also, if anyone wants something added w/o posting in this thread or if you do post it and I miss it feel free to drop me a PM.

Thanks,
Dave

[Jean_Luc]

Done

[Chris!]

Well this certainly deserves a bump. I hope I can figure out how to run it now 

[Telariust]

VanitySearch is 6x faster than VanityGen, and even 2x faster for compress addr (12x total).
But new 5 ecc algorithms uncompatible with split-key project vanitypool.appspot.com
So we lose 6x, only 2x left.

The developer vanitypool has long lost interest, the design is missing, the site has not been updated for more than 5 years.
The keeper ThePiachu is not able to screw the sorting of html-table on javascript and, at best, keeps the server on.
Therefore, it is naive to hope that 5 new algo will add to the job calculator. Ok?

But Jean_Luc can do something.
You use symm and endomorph to -sp pubkey.
I suppose it was faster and easier to do when you added -sp to the main code so as not to overwrite it.
We can not change the split-key and the math of calculating the final key on vanitypool.
Is it possible to eliminate symm and endomorph overlay on split-key?
I'm not sure, but it seems to me that there is no problem either in calculations or in safety.
With 12x tasks on the pool will again become more profitable than mining.

[Jean_Luc]

Hello,
Yes the split key is done using all the 6 ecc algorithms, reduce it to only one is not obvious.
I don't know exactly how Vanitypool is working, does it support only "add" algorithm for final private key reconstruction ?
Vanitypool supports only uncompressed addresses or both ?

[Telariust]

does it support only "add" algorithm for final private key reconstruction ?
Vanitypool supports only uncompressed addresses or both ?

see
gobittest.appspot.com/VanityAll
used add/mul with comp/uncomp = 4 total
(add + uncomp, add + comp, mul + comp, mul + uncomp)
"Solved work" confirms this in the "Solution type"
(most add + uncomp entries because this is vanitygen default)

mul we do not need. I guess this was a trick to get 2x keys for the price of 1M
(like symY/symXBatch/endomorph proposed by arulbero)

we need the splitKey and the addition candidateKey+splitKey not to change

your program gives the result and does not tell which of the 6algos now
when I tried to write the analyzer in python, I failed twice.
At first, I intuitively applied sym/endomorph to the result of the addition of the candidateKey and splitKey, but 5/6 addresses were not recognized.
Well, Of course, I thought, True choice if applied sym/endomorph to the candidateKey before adding with splitKey, but it all happened again.
There is a third option - you apply sym/endomorph to splitKey!
After which the analyzer determined all cases correctly.
I am surprised by this choice, because it makes your calculation incompatible with 5/6 with the pool.
I guess this is due to the late addition of the splitKey to your self-contained code with minimal edits.
In my opinion, you need to apply sym/endomorph to the candidate and not apply to splitKey or the result of addition
imho, after fix u program should also work fine.
(maybe it have some math depend; maybe, I am mistaken and do not take into account some subtlety or dependence)