VanitySearch (Yet another address prefix finder)

[Marynarz]

Does any of the users have an Nvidia Titan X Pascal 12 GB graphics card?  I would like to know what the result is on Kangaroo or VanitySearch.

[xhomerx10]

Does any of the users have an Nvidia Titan X Pascal 12 GB graphics card?  I would like to know what the result is on Kangaroo or VanitySearch.

 Based on benchmarking results I would guess it comes in around 700Mkeys/s 

[NotATether]

This thread is very long so I didn't bother to read all the posts, so my apologies if this question has been answered before.

Is there a speed difference in searching for 1, 3, and bc1q? Particularly, does each key iteration for "1" address take longer than an iteration for a "3" or "bc1q" address? I plan on generating a large number of "3" addresses but I only have 4 Xeons at my disposal.

EDIT: Is searching by prefix 3 even possible? I tried to generate 3Tether, and got this error:

Code:

Ignoring prefix "3Tether" (Unreachable, 31h1 to 3R2c only)

[nc50lc]

EDIT: Is searching by prefix 3 even possible? I tried to generate 3Tether, and got this error:

Code:

Ignoring prefix "3Tether" (Unreachable, 31h1 to 3R2c only)

Like the error said, it is out of the available prefix for Nested SegWit address, you also cannot use lowercase char as the second character (after '1').
If you really want the prefix whole, you can add 'A' before 'Tether' but that will increase the difficulty a lot.

Is there a speed difference in searching for 1, 3, and bc1q? Particularly, does each key iteration for "1" address take longer than an iteration for a "3" or "bc1q" address?

This only based form a simple test by checking the difficulty when generating different address types with 2-character prefix:

• bc1qas: Difficulty: 1024
  
• 3As: Difficulty: 1354
  
• 1As: Difficulty: 1354
  
• 1as: Difficulty: 78509

.
Based from the difficulty, it's quite slower than native SegWit and in par with legacy when you use an uppercase as the second character.

[NotATether]

@Jean_Luc, would it be possible to display at the end of the last line of the progress, the prefix that is being searched for? It helps when generating dozens of addresses to an output file and you want to know which ones have not been found yet.

This is a trivial addition to the project so I'm thinking about displaying the prefix at this position:

Code:

VanitySearch v1.19
Search: 104 prefixes (Lookup size 426) [Compressed]
Start Fri Sep 18 22:14:01 2020
Base Key: xxxxxxxxxxxxxxxxxxxxxx
Number of CPU thread: 4
[9.81 Mkey/s][GPU 0.00 Mkey/s][Total 2^40.59][Prob 64.3%][70% in 07:53:29][Found 103] <<[Prefix {PREFIX}]>> 

Currently I'm busy with another project so I might make a PR for this if I find the time to.

[inklbot]

Can I use it on ubuntu 20.04?

If so, what version of cuda should i have?

[POD5]

Is there the possibility that one of the keys generated by VanitySearch coincide with the keys generated by a common BTC wallet, no matter if a newest or oldest, or even an upcoming key?

[Jean_Luc]

Note that with VanitySearch, the generation of the base key (if no seed specified) is done through secure RNG of the system:
CryptGenRandom() for windows and /dev/urandom for linux.

[bigvito19]

How to go about generating keys from specific ranges?

[Jean_Luc]

There is no way with VanitySearch to specify a priv key range.

[shlomogold]

Note that with VanitySearch, the generation of the base key (if no seed specified) is done through secure RNG of the system:
CryptGenRandom() for windows and /dev/urandom for linux.

does this mean that if we could've recreated someone's system at a time (same OS, processor, time and date, etc.), we could be closer
to generating the same keys this person generated back then or am I completely misunderstanding how it works?

[Jean_Luc]

does this mean that if we could've recreated someone's system at a time (same OS, processor, time and date, etc.), we could be closer
to generating the same keys this person generated back then or am I completely misunderstanding how it works?

Theoretically it is not possible. The system gets entropy from keyboard inputs, disk usage, network, etc... Then it computes secure hashes from that inputs to generate random number.

[xhomerx10]

does this mean that if we could've recreated someone's system at a time (same OS, processor, time and date, etc.), we could be closer
to generating the same keys this person generated back then or am I completely misunderstanding how it works?

Theoretically it is not possible. The system gets entropy from keyboard inputs, disk usage, network, etc... Then it computes secure hashes from that inputs to generate random number.

 I've noticed that is you duplicate the seed value, you will generate the same addresses each time the program is run.   Would the same seed value result in the same addresses on another computer?

 Anyone care to try?

 

Code:

vanitysearch -t 2 -gpu -gpuId 0 -c -s 0000000000000000000000000000000000000000000000000000000000000001 -u -o seetest.txt 1vanity

output

Code:

PubAddress: 1vaNitynLfQsJRMYQKMkbdSg8rLkSjhwv
Priv (WIF): p2pkh:5KbzFV78qNVj1PLRHXYBhG7icZTkifPZEKLchTGDWy5b7mv69qq
Priv (HEX): 0xEB775B6D709EF23F77B4D4A83A9B2EFDDEC07EF17B198320AB0BE94D128FCB9F
PubAddress: 1vaNity5aynUujBya8CMdrvZgx61sK5bZ
Priv (WIF): p2pkh:5Jn7TQNRSgjKaHfTbUEB3GuPxPaEeYAXDbKXhi8ptZLHZiXDhcJ
Priv (HEX): 0x7EC229EA229D8EE34BBC733ADC99ECA1DDCCC543D9C5714DC9626D13CBCD311D
PubAddress: 1vaniTySykD7CsMLDe79zEgRtzmsLDjkx
Priv (WIF): p2pkh:5Jh8WUtmjHQZkDPix71P78RPJu7KaCQt3sUBJVxtYknog3ZVTyZ
Priv (HEX): 0x73725230D841E056B39063C84D3D721BA08616210B1614B6E0F61FA20BA5D660
PubAddress: 1vaNiTyNULTxWy1W9y5u65YypG4mnjfXk
Priv (WIF): p2pkh:5Jn7TQNRSgjKaHfTbUEB3GuPxPaEeWxyHSCYURBzPZjaoT8Loxy
Priv (HEX): 0x7EC229EA229D8EE34BBC733ADC99ECA1DDCCC543D00F714DC9626D13CBC665D5
PubAddress: 1VAniTyzcxeBzAviTpjdoVwu6Pdda4eus
Priv (WIF): p2pkh:5JoCtBynZf5t5YgoPWHd69BYs4LQtUE61eA4cc2YQXTBgNcnWCh
Priv (HEX): 0x813DD615DD62711CB4438CC52366135CDCE217A2EE6A2EEDF66FF17904702C64

[Jean_Luc]

Yes, if you specify manually the same seed, the calculation will be the same.

[MrFreeDragon]

-snip-
 I've noticed that is you duplicate the seed value, you will generate the same addresses each time the program is run.   Would the same seed value result in the same addresses on another computer?
-snip-

As far as I know this soft works, it starts with the base key (as the starting private key) and increment it by 1 calculating the bitcoin address for every key (together with additional keys due to symmetry and endomorphism). For better security the random start key is used.
However if you use the same base key, you should receive the same final results (probably not in the same order as the work is performed not by one core, but by multi CPU/GPU cores)

[bitcoinunide]

Thank you @Jean_Luc for the Code!

We've created a browser tool, for non technical users, that they can easy merge split keys offline in their browser client!

https://github.com/sashmaaan/VanityAddressMerger



 

[alevlaslo]

Radeon VII how many MKeys?

[alevlaslo]

is there a 1-day probability of CPU detecting a private key for the full address, or is it zero?

this address was used by scammers to steal bitcoins from the exchange

[alevlaslo]

Core i5 4t
Vanytygen64 - 550 kkeys per second
Vanitysearch - 5 mkeys per second

how can I import 580,000 addresses to check at the same time, will it slow down the speed?

[bigvito19]

Core i5 4t
Vanytygen64 - 550 kkeys per second
Vanitysearch - 5 mkeys per second

how can I import 580,000 addresses to check at the same time, will it slow down the speed?

Use the -i inputfile