Vanitygen: Vanity bitcoin address generator/miner [v0.22]

[bigvito19]

That's where y'all get it wrong at, y'all keep trying to brute force the whole space. You have to know exactly where the range of the address is in then brute force that.

But you can't know within what range was the private key of the address once it was chosen. Can you explain it a little more? I'm not an expert.

First of all you should be going after addresses with its public key already exposed. That's 2^128 search range right there. You should be generating addresses/keys from the desired public key. The next step would be to find a partial collision of the key and brute force the remaining of the key or half 2^128 to 2^64.

[1714043295]

1714043295

[1714043295]

1714043295

[1714043295]

1714043295

[1714043295]

1714043295

[1714043295]

1714043295

[BlackHatCoiner]

First of all you should be going after addresses with its public key already exposed. That's 2^128 search range right there. You should be generating addresses/keys from the desired public key. The next step would be to find a partial collision of the key and brute force the remaining of the key or half 2^128 to 2^64.

Wait how is that possible? What can you do with a public key? Knowing the x and y axis won't benefit you on doing brute force. The possibilities of finding the same public key are 1 in 2²⁵⁶.

That's 2^128 search range right there.

How did you conclude that?

[bigvito19]

First of all you should be going after addresses with its public key already exposed. That's 2^128 search range right there. You should be generating addresses/keys from the desired public key. The next step would be to find a partial collision of the key and brute force the remaining of the key or half 2^128 to 2^64.

Wait how is that possible? What can you do with a public key? Knowing the x and y axis won't benefit you on doing brute force. The possibilities of finding the same public key are 1 in 2²⁵⁶.

That's 2^128 search range right there.

How did you conclude that?

You need to read on this then

https://bitcointalk.org/index.php?topic=5244940.0
https://github.com/JeanLucPons/Kangaroo

Searching with the public key reduces the search space of 2^256 to 2^128.

[alevlaslo]

From 2^160 to 2^128

And you can find the key in 1 second, if you are lucky, the probability is small, but above zero

the cost of busting is very high, the production will be less, it is better to tune in to luck and low power

[A-Bolt]

That's 2^128 search range right there.

How did you conclude that?

Cryptographic strength of a secp256k1 (and hence a public key) is 128 bit:
https://www.secg.org/sec2-v2.pdf

[puplebtc]

Hi, i try to generate a address that starts with 1eevee, after 3000+ results there is no address that starts with 1 EEVEE. (so all capital lettes)

I use:  oclvanitygen.exe -v -i -D 0:0,grid*1024x1024 -f names7.txt -o eevee.txt



When i change it to:

oclvanitygen.exe -v -D 0:0,grid*1024x1024 -f names7.txt -o eevee.txt  (so without -i), he founds it after 10 seconds!, can someone explain this?

[LoyceV]

Hi, i try to generate a address that starts with 1eevee, after 3000+ results there is no address that starts with 1 EEVEE. (so all capital lettes)

I use:  oclvanitygen.exe -v -i -D 0:0,grid*1024x1024 -f names7.txt -o eevee.txt



When i change it to:

oclvanitygen.exe -v -D 0:0,grid*1024x1024 -f names7.txt -o eevee.txt  (so without -i), he founds it after 10 seconds!,

can someone explain this?

Option "-i" makes your search case-insensitive, so you can expect many more results. But if you find 1EEVEE without "-i", that means you entered 1EEVEE in full caps in names7.txt.
It's very unlikely to find 3000+ variations of "eevee" without one in full caps though.

[puplebtc]

Hi, i try to generate a address that starts with 1eevee, after 3000+ results there is no address that starts with 1 EEVEE. (so all capital lettes)

I use:  oclvanitygen.exe -v -i -D 0:0,grid*1024x1024 -f names7.txt -o eevee.txt



When i change it to:

oclvanitygen.exe -v -D 0:0,grid*1024x1024 -f names7.txt -o eevee.txt  (so without -i), he founds it after 10 seconds!,

can someone explain this?

Option "-i" makes your search case-insensitive, so you can expect many more results. But if you find 1EEVEE without "-i", that means you entered 1EEVEE in full caps in names7.txt.
It's very unlikely to find 3000+ variations of "eevee" without one in full caps though.

Yes it's very unlikely but true!..i have searched 3382 addresses to be eaxctly and none where 1EEVEE.
I am going to test this another time with 10000 searches.

[puplebtc]

I did 10.000+ searches and not even 1 1EEVEE!, must be something in the bitcoin address structure that doesnt allow this combination, if u dont belive me try it yourself.

[NotATether]

I did 10.000+ searches and not even 1 1EEVEE!, must be something in the bitcoin address structure that doesnt allow this combination, if u dont belive me try it yourself.

Both E and V are base58 digits so this combination is possible. However there is as 1/(58^5) % chance of finding an address beginning with it. Which means for every one address starting with 1EEVEE, there are 656,356,767 that start with something else.

Now your key rate for a GPU in Kkeys/s is going to be something along the lines of (GPU Cores) x (Shader MHz) x some small but unknown constant. So you're going to have to run this for at most 65635 seconds or almost 19 hours to find a 1EEVEE (and by extension a 1eevee) address.

[ranochigo]

I did 10.000+ searches and not even 1 1EEVEE!, must be something in the bitcoin address structure that doesnt allow this combination, if u dont belive me try it yourself.

The difficulty to compute 1eevee with case sensitive is roughly 264104224. Which makes it 1 in 264104224.

I tried running it with vanitysearch (more optimized than vanitygen) with my 1080TI and I found like 7 of them within 5 seconds. You won't be able to find any of those vanity addresses if you only generate such a small space of addresses.

[LoyceV]

I did 10.000+ searches and not even 1 1EEVEE!, must be something in the bitcoin address structure that doesnt allow this combination, if u dont belive me try it yourself.

This took a few seconds:

Code:

./oclvanitygen 1EEVEE -ik
Difficulty: 15956296
Pattern: 1EEVEE                                                                
Address: 1EeveeUmLzb4XrR5ig38uARZPBvMGHENrU
Privkey: 5J5Wj1EQsXi5o8iSmvnExs22DWDfXmYqvvFHNeQSypvM7JyuQya
Pattern: 1EEVEE                                                                
Address: 1EEVEELTN8APXaASXQrPE1QVFzANJxuXfS
Privkey: 5HtbZPDRA1Q17nQAwcydfQJtoyZV3a2B3xLK1jnyi89dWQX871z
Pattern: 1EEVEE                                                                
Address: 1EevEEmC5FVMfs52b4S167UE6X69BgQ5T
Privkey: 5KgxnjfLNuoDdVb2KPrHQoHMmHWptwBkTy2fCcDUE9dNQwkAN82

[willi9974]

Hello all,

i tried it several times but i can not run oclvanitygen.exe on my win10 machine with my AMD RX 480 card.

Knows any in this topic the right syntax to use my GPU instead of my CPU. CPU search with "vanitygen64.exe -i -o priv.key.txt 1WiLLi9974" works fine, but takes to long and i would run the search with my GPU.

Best regards,
Willi

[NotATether]

Hello all,

i tried it several times but i can not run oclvanitygen.exe on my win10 machine with my AMD RX 480 card.

Knows any in this topic the right syntax to use my GPU instead of my CPU. CPU search with "vanitygen64.exe -i -o priv.key.txt 1WiLLi9974" works fine, but takes to long and i would run the search with my GPU.

Best regards,
Willi

When you build the codebase there's another program available called oclvanitygen. It uses OpenCL to run on GPUs so use that one instead and experiment with the command-line options that work best for you.

In particular, there's a -D option for choosing the device, and -w -t -g options to control the grid size and the amount of work per thread.

[Dabs]

Guys, really should be using native segwit these days. Addresses beginning with 1 are so "legacy". I can generate some that start with bc1q....... but using one of the later forks of this app, I believe VanitySearch works.

[malevolent]

Unfortunately Vanitysearch is CUDA-only so it won't work on AMD GPUs (the user two posts above yours has one) which leverage OpenCL. A bit of a shame since the fork is also faster.

[Dabs]

I don't even have a GPU to do this, I just use the CPU versions. Of course, that limits me to 4 or 5 characters, maybe longer if I can wait.

For most purposes though, I simply recommend to most people, don't bother and use normal segwit addresses. Now, if only there were a vanity generator for native segwit multi-sig addresses, that would be something.

Code:

1 sig    = bc1qxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
2-of-3   = bc1qxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
15-of-15 = bc1qxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

The longer ones are multi-sig.

[willi9974]

Is it possible to put complete BTC adresses in the Präfix list and Not only a Part of a BTC adress?

Error message: Prefix xxx is too long

[bigvito19]

Is it possible to put complete BTC adresses in the Präfix list and Not only a Part of a BTC adress?

Error message: Prefix xxx is too long

With this one you can put the whole address in

https://github.com/JeanLucPons/VanitySearch

https://bitcointalk.org/index.php?topic=5112311.0

[willi9974]

Is it possible to put complete BTC adresses in the Präfix list and Not only a Part of a BTC adress?

Error message: Prefix xxx is too long

With this one you can put the whole address in

https://github.com/JeanLucPons/VanitySearch

https://bitcointalk.org/index.php?topic=5112311.0

Yes i know but i have a AMD RX580 GPU and this software support only NVIDIA GPU and CUDA driver