VanitySearch (Yet another address prefix finder)

[alky2]

c++ coders please help me how to modify this to work on 64 bit rand not 256 bit rand. c++ really hard to me to understand

To key.Rand(64). This is going to change the starting key to be a 64-bit random int, same for all subsequent keys.

dude above suggest me to comment code blocks related endo and sym i tryed but got compile error then some tests again got key error .

Are you just trying to randomly generate only 64 bit keys to look for #64 of challenge/puzzle?

yes

Something like this:

Code:

VanBitKracken
RandomMode
Range Start=8000000000000000
  Range End=FFFFFFFFFFFFFFFF
Searching For: 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN [Compressed]
Started Mon Mar 15 10:56:51 2021
CPU threads used: 0
GPU: GPU #4 GeForce RTX 2070 SUPER (40x64 cores) Grid(1024x512)
GPU: GPU #0 GeForce RTX 3070 (46x128 cores) Grid(1024x512)
GPU: GPU #5 GeForce RTX 2070 (36x64 cores) Grid(1024x512)
GPU: GPU #2 GeForce RTX 3070 (46x128 cores) Grid(1024x512)
GPU: GPU #1 GeForce RTX 3070 (46x128 cores) Grid(1024x512)
GPU: GPU #3 GeForce RTX 3070 (46x128 cores) Grid(1024x512)
Key 0: F8F7AB14B549D963
Key 1: E27A8E10F7B88360
Key 2: ABFE11261BBD4690
Key 3: F422548A1F4B2DAE
Key 0: FA88129A5AB50074
Key 1: B0341A673B1314D4
Key 2: C6719553AAD5A8C6
Key 3: D09C89B9E74DF9EE
Key 0: E9CC7B8BB752F5CB
Key 1: A7B789B6A94D60AD
Key 2: A741098EFA53130A
Key 3: 97FB2DB875755EA6 
Key 0: F399AEDCE1F72EA8
Key 1: D24BDBDE76E19FAC
Key 2: 8F9A7FC4F8591C25
Key 3: CACFECB3F9230C7F
Key 0: F25D378E2916D696
Key 1: ED7EA9A718B61017
Key 2: FCDDD610A70AF071
Key 3: 893CF7F570EFB585
Key 0: D84FE1221CFDC77A
Key 1: D8445FE43B6D871E
Key 2: 8C323D909C23163C
Key 3: 867C5E6DA5D981D9
Key 524285: AA670B193E7CAA36
Key 524285: C6D15B55CC2DCA5A
Key 524286: C7901B0332FE38A9
Key 524286: EA11A526D7135C77
Key 524287: C5F35D538D961196
Key 524287: 8DA14E252E6DC1E7
Key 524285: D3FBF43E6888E2C0
Key 524286: F8F40F51C3388D6C
Key 524287: FB86E889D499BE6A
Key 524285: 8C639A3EEBBB486D
Key 524286: AFF06C39E04CF30D
Key 524287: D9A7EEE1CC93F155
Key 524285: CF060C3C274DB24A
Key 524286: C4349EEDE915A9A0
Key 524287: A57D8D77096307E4
Key 524285: B15B02DFB42CD315
Key 524286: A4F20EA9DABE20BB
[11419.89 Mkey/s][GPU 11419.89 Mkey/s][Private Keys Checked = 2^35.81] [00:00:07 Run Time ]  [Expected Run Time 34.7357y][Found 0]

version VanBitKracken? it's available?

[gsciservices]

c++ coders please help me how to modify this to work on 64 bit rand not 256 bit rand. c++ really hard to me to understand

To key.Rand(64). This is going to change the starting key to be a 64-bit random int, same for all subsequent keys.

dude above suggest me to comment code blocks related endo and sym i tryed but got compile error then some tests again got key error .

Are you just trying to randomly generate only 64 bit keys to look for #64 of challenge/puzzle?

yes

Something like this:

Code:

VanBitKracken
RandomMode
Range Start=8000000000000000
  Range End=FFFFFFFFFFFFFFFF
Searching For: 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN [Compressed]
Started Mon Mar 15 10:56:51 2021
CPU threads used: 0
GPU: GPU #4 GeForce RTX 2070 SUPER (40x64 cores) Grid(1024x512)
GPU: GPU #0 GeForce RTX 3070 (46x128 cores) Grid(1024x512)
GPU: GPU #5 GeForce RTX 2070 (36x64 cores) Grid(1024x512)
GPU: GPU #2 GeForce RTX 3070 (46x128 cores) Grid(1024x512)
GPU: GPU #1 GeForce RTX 3070 (46x128 cores) Grid(1024x512)
GPU: GPU #3 GeForce RTX 3070 (46x128 cores) Grid(1024x512)
Key 0: F8F7AB14B549D963
Key 1: E27A8E10F7B88360
Key 2: ABFE11261BBD4690
Key 3: F422548A1F4B2DAE
Key 0: FA88129A5AB50074
Key 1: B0341A673B1314D4
Key 2: C6719553AAD5A8C6
Key 3: D09C89B9E74DF9EE
Key 0: E9CC7B8BB752F5CB
Key 1: A7B789B6A94D60AD
Key 2: A741098EFA53130A
Key 3: 97FB2DB875755EA6 
Key 0: F399AEDCE1F72EA8
Key 1: D24BDBDE76E19FAC
Key 2: 8F9A7FC4F8591C25
Key 3: CACFECB3F9230C7F
Key 0: F25D378E2916D696
Key 1: ED7EA9A718B61017
Key 2: FCDDD610A70AF071
Key 3: 893CF7F570EFB585
Key 0: D84FE1221CFDC77A
Key 1: D8445FE43B6D871E
Key 2: 8C323D909C23163C
Key 3: 867C5E6DA5D981D9
Key 524285: AA670B193E7CAA36
Key 524285: C6D15B55CC2DCA5A
Key 524286: C7901B0332FE38A9
Key 524286: EA11A526D7135C77
Key 524287: C5F35D538D961196
Key 524287: 8DA14E252E6DC1E7
Key 524285: D3FBF43E6888E2C0
Key 524286: F8F40F51C3388D6C
Key 524287: FB86E889D499BE6A
Key 524285: 8C639A3EEBBB486D
Key 524286: AFF06C39E04CF30D
Key 524287: D9A7EEE1CC93F155
Key 524285: CF060C3C274DB24A
Key 524286: C4349EEDE915A9A0
Key 524287: A57D8D77096307E4
Key 524285: B15B02DFB42CD315
Key 524286: A4F20EA9DABE20BB
[11419.89 Mkey/s][GPU 11419.89 Mkey/s][Private Keys Checked = 2^35.81] [00:00:07 Run Time ]  [Expected Run Time 34.7357y][Found 0]

version VanBitKracken? it's available?

Dear Sir,
Could you please share to us VanBitKracken software; I am looking for your valuable response.

Regards,
GSCIServices

[NotATether]

~
can somebody implement this please i have millions of private keys so it cannot be converted quickly to addresses with cpu because cpu is not powerful enough can somebody make small modification to the software where it read single hex private key to read those values from file this way we can convert millions of private keys using gpu thanks again for anyone out there who can help.

How exactly many millions are we talking about? Because GPUs cannot do disk I/O, so only the actual conversion of hex to WIF can be accelerated with CUDA. The reads and writes still have to be done on CPU, and then all that has to be copied to the GPU memory and then back again, because CUDA cannot read memory in RAM (unless you use their new feature called Unified Memory but honestly I don't know how fast that is), so what I'm trying to tell you is it might be better implementing this on CPU using multiple threads and the AVX instruction set and that should the job. The CPU can already do much more complicated address generation at millions of keys per second anyway.

[Atariko]

I can't understand, is the search for private keys from the list of full addresses (100000+) on the processor and on the video card not the same (despite the speed)? And what is the difference if it is?

[rama_rao]

Can anyone build GPU vanity search for Onion V3 addresses?

There is cpu version: https://github.com/cathugger/mkp224o
And GPU version for v2 address which are old format: https://github.com/lachesis/scallion

I think it is very similar to these btc address generators. But underlying algo is different which is ed25519 in case of onion v3 addresses. How hard is it to port vanitysearch to do onion v3?

[jennamarble]

~
can somebody implement this please i have millions of private keys so it cannot be converted quickly to addresses with cpu because cpu is not powerful enough can somebody make small modification to the software where it read single hex private key to read those values from file this way we can convert millions of private keys using gpu thanks again for anyone out there who can help.

How exactly many millions are we talking about? Because GPUs cannot do disk I/O, so only the actual conversion of hex to WIF can be accelerated with CUDA. The reads and writes still have to be done on CPU, and then all that has to be copied to the GPU memory and then back again, because CUDA cannot read memory in RAM (unless you use their new feature called Unified Memory but honestly I don't know how fast that is), so what I'm trying to tell you is it might be better implementing this on CPU using multiple threads and the AVX instruction set and that should the job. The CPU can already do much more complicated address generation at millions of keys per second anyway.

Because none have made it as you said the conversation is possible with gpu and at the time of saving you can use cpu i think the program already does it can convert millions keys per second and cpu can save it in a minute this way is better then all the way to cpu or you could directly use this expression -i input.txt > output.txt this way no extra work has to be done we can directly save it to text file whatever the command line is outputting

[NotATether]

I can't understand, is the search for private keys from the list of full addresses (100000+) on the processor and on the video card not the same (despite the speed)? And what is the difference if it is?

I just peeked at the code and it doesn't look like there's any. The GPU code is called from the main loop in CPU so the only things which could possibly be different could be the way it checks points/hashes and how it iterates through them.

I think it is very similar to these btc address generators. But underlying algo is different which is ed25519 in case of onion v3 addresses. How hard is it to port vanitysearch to do onion v3?

The Integer class is abstracted enough to let you make your own curve class and slot it right inside as a parameter, but writing ed25519 arithmetic in assembly will be one hell of a challenge.

... or you could directly use this expression -i input.txt > output.txt this way no extra work has to be done we can directly save it to text file whatever the command line is outputting

I don't like this particular approach. The console is just as slow as file I/O, which you can easily notice if you run any cpu-intensive program with its --verbose switch and notice how the time for the command to complete becomes longer because so much time is being spent printing to the screen.

Redirecting output to a file from a shell doesn't make it any faster, it just "fools" the program into thinking its writing to the console.

[hiten02]

Can anybody please post here link for VanBitKraken program?

[gsciservices]

@Jean_Luc , btw..

yeah I can search all keys in 3 days

this is with 1.16

Vanitysearch.exe -b -t 0 -gpu -gpuId 0,1 -g 1088,512,1088,512 -r 10000000 -o found_0.txt -i in.txt

[4544125350086.37 Mkey/s][GPU 4544125350086.37 Mkey/s][Total 2^64.00][Prob 0.0%][50% in 7.06916e+21y][Found 0]

544,512,544,512 still shows korrekt MKeys

Hi Jean_Luc,
I have work your commanding as above, it was found same result as bellow:

VanitySearch16.exe -b -gpu -gpuId 0,1 -g 1088,512,1088,512 -r 10000000 -o results.txt -i addr.txt
VanitySearch v1.16
Search: 17 prefixes (Lookup size 17) [Compressed or Uncompressed]
Start Thu Mar 25 21:43:10 2021
Base Key: Randomly changed every 10000000 Mkeys
Number of CPU thread: 46
GPU: GPU #0 GeForce RTX 3080 (68x0 cores) Grid(1088x512)
GPU: GPU #1 GeForce RTX 3080 (68x0 cores) Grid(1088x512)
[475.99 Mkey/s][GPU 0.00 Mkey/s][Total 2^29.85][Prob 0.0%][50% in 50.6d][Found 0]
Warning, 1710241 items lost
Hint: Search with less prefixes, less threads (-g) or increase maxFound (-m)

Warning, 1713507 items lost
Hint: Search with less prefixes, less threads (-g) or increase maxFound (-m)
[4521395825967.33 Mkey/s][GPU 4521395825916.71 Mkey/s][Total 2^64.00][Prob 100.0%][99% in 00:00:00][Found 0]

I want to ensure you it is real and it was count 2^64.00 per second. Please response.....

[WhyFhy]

For any of you guys hung up trying to get this to work I've made a simple submission guide/walkthrough for requesting a vanity wallet
Here
I would like to automate this if anyone would be interested in helping i could make it worthwhile
Automating it would entail a quote based on lavishness ,verifying a txid and automatically working it on submission or when txid has 1 confirmation
I have a website too it could be built from/on. Id like to provide 6 digits or less for free with this service.

[ibe66]

I have following question:

If I create a list with around 40 prefixes between 8 and 12 characters and start with -c, my performance drops rapidly. Instead of 2900 Mkey / s I only have about 300 Mkey / s.


ubuntu@ip-.........-....-...:~/VanitySearch$ sudo ./VanitySearch -c -i liste.txt -o output.txt -m 503316480 -t 0 -gpu -gpuId 0,0
VanitySearch v1.19
Search: 23 prefixes (Lookup size 85) [Compressed]
Start Fri Mar 26 18:03:14 2021
Base Key: DEC9F4E734AA0591E9D5434267F37D8D068343482D911D4FFB494094ABCBF29F
Number of CPU thread: 0
GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
[293.54 Mkey/s][GPU 293.54 Mkey/s][Total 2^31.71][Prob 0.0%][50% in 15:18:09][Found 0]

ubuntu@ip-.....-...-..-....:~/VanitySearch$  sudo ./VanitySearch -c -o output.txt -m 503316480 -t 0 -gpu -gpuId 0,0 1vanitytest
VanitySearch v1.19
Difficulty: 19636918973388416
Search: 1vanitytest [Compressed, Case unsensitive] (Lookup size 6)
Start Fri Mar 26 18:05:36 2021
Base Key: 98CDDF3C76F6143E11A6E9B68E271A6E4939483A43A774827DAEE0301C7DA919
Number of CPU thread: 0
GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
[2516.03 Mkey/s][GPU 2516.03 Mkey/s][Total 2^33.81][Prob 0.0%][50% in 62.6d][Found 0]


Is that normal or do I have to change something? How can I search much as possible prefixes (case unsensitive) without speed dropping?

[WhyFhy]

I have following question:

If I create a list with around 40 prefixes between 8 and 12 characters and start with -c, my performance drops rapidly. Instead of 2900 Mkey / s I only have about 300 Mkey / s.


ubuntu@ip-.........-....-...:~/VanitySearch$ sudo ./VanitySearch -c -i liste.txt -o output.txt -m 503316480 -t 0 -gpu -gpuId 0,0
VanitySearch v1.19
Search: 23 prefixes (Lookup size 85) [Compressed]
Start Fri Mar 26 18:03:14 2021
Base Key: DEC9F4E734AA0591E9D5434267F37D8D068343482D911D4FFB494094ABCBF29F
Number of CPU thread: 0
GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
[293.54 Mkey/s][GPU 293.54 Mkey/s][Total 2^31.71][Prob 0.0%][50% in 15:18:09][Found 0]

ubuntu@ip-.....-...-..-....:~/VanitySearch$  sudo ./VanitySearch -c -o output.txt -m 503316480 -t 0 -gpu -gpuId 0,0 1vanitytest
VanitySearch v1.19
Difficulty: 19636918973388416
Search: 1vanitytest [Compressed, Case unsensitive] (Lookup size 6)
Start Fri Mar 26 18:05:36 2021
Base Key: 98CDDF3C76F6143E11A6E9B68E271A6E4939483A43A774827DAEE0301C7DA919
Number of CPU thread: 0
GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
GPU: GPU #0 Tesla V100-SXM2-16GB (80x64 cores) Grid(640x128)
[2516.03 Mkey/s][GPU 2516.03 Mkey/s][Total 2^33.81][Prob 0.0%][50% in 62.6d][Found 0]


Is that normal or do I have to change something? How can I search much as possible prefixes (case unsensitive) without speed dropping?

Yes its normal for multiple queries to decay performance. Want to sell me your sxm2 chips?

------


This has happened to me on 1gorynych back in the day

16DEAB074A29C5444CE849F2231096FB9B7AF4F9A2903899F2B2B42F34198F82 private key . 046098AF1FA301F60EE17DFA008D91D1541666201416279787FD9FA8120AA68CA5DF0FF9A8279D7 937992CB7EFD62F4BC0EA3697121A4E3942BD1F937F4BBF354D
 ^public key worked ^
 and resulted this  PubAddress: 1overGriLuHS3s3yEpYZh7MKnZ59kzdAf
PartialPriv: 5J3dksTuquTvgjVtvdnw1vDfW6qhouof5M9uPtC8qHcVQyNMWsK
but when I combine them we get
15J4NpTt36gyo1Q1Kb2LX9dTV3PhakMwYH  
priv key 5JDhwDBS5ZwLnMiQ3iYtwxkhUwD4rWoAvKTUnZNHeJZDip8rJdM

This is the second time this has happened over the years, does anyone know why? ive asked in the past but do not recall getting answers

https://bitcointalk.org/index.php?topic=5112311.440  nvm

[fxsniper]

Could I ask some thing off topic?

What faster to found address want VanitySearch program?

VanitySearch 1.19
Vanitygen 0.21
oclvanitygen
VanitySearch-1.15.4_bitcrack

[NotATether]

Could I ask some thing off topic?

What faster to found address want VanitySearch program?

VanitySearch 1.19
Vanitygen 0.21
oclvanitygen
VanitySearch-1.15.4_bitcrack

Have you tried running a benchmark yourself? The very first post of this thread has some speed comparisons and tells you you can search for some uncompressed key as a test.

On my Intel Core i7-4770, VanitySearch runs ~4 times faster than vanitygen64. (1.32 Mkey/s -> 5.27  MK/s)
On my  GeForce GTX 645, VanitySearch runs ~1.5 times faster than oclvanitygen. (9.26 Mkey/s -> 14.548 MK/s)
If you want to compare VanitySearch and Vanitygen result, use the -u option for searching uncompressed address.

My gut feeling is VanitySearch-Bitcrack may be slightly slower than VanitySearch but I never used that program.

[WanderingPhilospher]

Could I ask some thing off topic?

What faster to found address want VanitySearch program?

VanitySearch 1.19
Vanitygen 0.21
oclvanitygen
VanitySearch-1.15.4_bitcrack

Have you tried running a benchmark yourself? The very first post of this thread has some speed comparisons and tells you you can search for some uncompressed key as a test.

On my Intel Core i7-4770, VanitySearch runs ~4 times faster than vanitygen64. (1.32 Mkey/s -> 5.27  MK/s)
On my  GeForce GTX 645, VanitySearch runs ~1.5 times faster than oclvanitygen. (9.26 Mkey/s -> 14.548 MK/s)
If you want to compare VanitySearch and Vanitygen result, use the -u option for searching uncompressed address.

My gut feeling is VanitySearch-Bitcrack may be slightly slower than VanitySearch but I never used that program.

For a pure vanity address finder, VanitySearch is hands down faster because of the symmetry and endo features PLUS you can look for compressed uncompressed, and the bc, 3, and 1 addresses.

VS Bitcrack is more about specific ranges although, you can search for Vanity addresses with it.  VS bitcrack and VS are different animals, intended to do different things, but still have common features.

[fxsniper]

Could I ask some thing off topic?

What faster to found address want VanitySearch program?

VanitySearch 1.19
Vanitygen 0.21
oclvanitygen
VanitySearch-1.15.4_bitcrack

Have you tried running a benchmark yourself? The very first post of this thread has some speed comparisons and tells you you can search for some uncompressed key as a test.

On my Intel Core i7-4770, VanitySearch runs ~4 times faster than vanitygen64. (1.32 Mkey/s -> 5.27  MK/s)
On my  GeForce GTX 645, VanitySearch runs ~1.5 times faster than oclvanitygen. (9.26 Mkey/s -> 14.548 MK/s)
If you want to compare VanitySearch and Vanitygen result, use the -u option for searching uncompressed address.

My gut feeling is VanitySearch-Bitcrack may be slightly slower than VanitySearch but I never used that program.

For a pure vanity address finder, VanitySearch is hands down faster because of the symmetry and endo features PLUS you can look for compressed uncompressed, and the bc, 3, and 1 addresses.

VS Bitcrack is more about specific ranges although, you can search for Vanity addresses with it.  VS bitcrack and VS are different animals, intended to do different things, but still have common features.

Thank you every body
I ask because speed of calculate some find message to search in same length some find found fast some slow to found

VanitySearch work by random full 256 bit key right (for can use in real)

VanitySearch-Bitcrack not random it is run from 123 .789  but good for use keyspace and Vanity

Vanity is only from fist part on address right?

Don have any program can search part of address like some part on address or reverse search by search end of address
( mean search  "w1seQz" on 1Fgx98A3CMs97w1seQzA85CqExvpZkBGTD  or search  "ZkBGTD" end of address)

[WanderingPhilospher]

Thank you every body
I ask because speed of calculate some find message to search in same length some find found fast some slow to found

VanitySearch work by random full 256 bit key right (for can use in real)

VanitySearch-Bitcrack not random it is run from 123 .789  but good for use keyspace and Vanity

Vanity is only from fist part on address right?

Don have any program can search part of address like some part on address or reverse search by search end of address
( mean search  "w1seQz" on 1Fgx98A3CMs97w1seQzA85CqExvpZkBGTD  or search  "ZkBGTD" end of address)

Yes, use Vanity Search.  Use 1*w1seQz* or 1*ZkBGTD

[fxsniper]

Thank you every body
I ask because speed of calculate some find message to search in same length some find found fast some slow to found

VanitySearch work by random full 256 bit key right (for can use in real)

VanitySearch-Bitcrack not random it is run from 123 .789  but good for use keyspace and Vanity

Vanity is only from fist part on address right?

Don have any program can search part of address like some part on address or reverse search by search end of address
( mean search  "w1seQz" on 1Fgx98A3CMs97w1seQzA85CqExvpZkBGTD  or search  "ZkBGTD" end of address)

Yes, use Vanity Search.  Use 1*w1seQz* or 1*ZkBGTD

Thank you very much. WanderingPhilospher
I just know program can search pattern like this
very good to have this feature to can search

[MisterCooper]

Please tell me how you can change the code in VanitySearch, instead of looking for an address, I need to replace it with a search public key? That is, set the Gx point search function.

Let's say the public key is 03609747D18DB797783F8DA35BD9D95AAF717C99923D85CCF79C5396F8B897A960

Remove perfis 03

leave only Gx point and run

./VanitySearch -s "609747D18DB797783F8DA35BD9D95AAF717C99923D85CCF79C5396F8B897A960" -kp

I don't really know programming. I would be grateful for your answer!

[WanderingPhilospher]

Please tell me how you can change the code in VanitySearch, instead of looking for an address, I need to replace it with a search public key? That is, set the Gx point search function.

Let's say the public key is 03609747D18DB797783F8DA35BD9D95AAF717C99923D85CCF79C5396F8B897A960

Remove perfis 03

leave only Gx point and run

./VanitySearch -s "609747D18DB797783F8DA35BD9D95AAF717C99923D85CCF79C5396F8B897A960" -kp

I don't really know programming. I would be grateful for your answer!

Why do you have the -kp? That will generate one keypair and the -s is the seed.

Are you searching for a specific pub key?  Do you know the range?  Best to just search for address as minimal time is added; pubkey -> sha256 -> RIPEMD160.

Tell us more exactly what you are trying to do