Pages:
Author

Topic: Vanitygen: Vanity bitcoin address generator/miner [v0.22] - page 5. (Read 1152778 times)

legendary
Activity: 2954
Merit: 4158
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.
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
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.
newbie
Activity: 6
Merit: 0
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.
newbie
Activity: 6
Merit: 0
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.
legendary
Activity: 3290
Merit: 16489
Thick-Skinned Gang Leader and Golden Feather 2021
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.
newbie
Activity: 6
Merit: 0
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?

legendary
Activity: 2314
Merit: 2300
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

hero member
Activity: 1988
Merit: 593
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 Wink
full member
Activity: 706
Merit: 111
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 2256.

That's 2^128 search range right there.
How did you conclude that?


You need to read on this then

https://bitcointalksearch.org/topic/pollards-kangaroo-ecdlp-solver-5244940
https://github.com/JeanLucPons/Kangaroo

Searching with the public key reduces the search space of 2^256 to 2^128.
legendary
Activity: 1512
Merit: 7340
Farewell, Leo
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 2256.

That's 2^128 search range right there.
How did you conclude that?
full member
Activity: 706
Merit: 111
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.
legendary
Activity: 1512
Merit: 7340
Farewell, Leo
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.
hero member
Activity: 1988
Merit: 593
there is no difference between 1 and 580000 addresses, the speed is limited by the random number generator

why can't I set more than 19 characters to Vanitygen64, in case I get lucky and the whole address is generated quickly? Probably the fact is that this is a calculation and not a random generation, faster than the estimated time calculation is impossible, unlike random generenation in another program


This one you can put in the whole address

https://bitcointalksearch.org/topic/vanitysearch-yet-another-address-prefix-finder-5112311
https://github.com/JeanLucPons/VanitySearch

thank you!
hero member
Activity: 1988
Merit: 593
low probability is not a hindrance, there is a person who won the lottery twice on the same combination, just adjust your thoughts correctly, and the result will attract
full member
Activity: 706
Merit: 111
I just did a small research about how difficult it is to guess a bitcoin address. All private keys are 2256 but the total addresses aren't that many. They are 2160 as @nullius said.

Now let's compare 2160 with another huge number:

14,615,016,400,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 (2160)
133,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 (Total atoms that exist on our planet)
That answer comes from an estimation of the number of atoms in each of Earth's elements, like Iron, Oxygen, Silicon, Magnesium, Sulfur … etc

It's scary to think how many different combinations of addresses can exist. Imagine that one water drop contains about 5 sextillion atoms. (5.01 x 1021)

Imagine picking one atom randomly from the earth and expecting someone to guess it.
When your computer generates an address is like picking one atom from ~10,000 different Earths.

You can't brute force a bitcoin address. You just can't.

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.
legendary
Activity: 1512
Merit: 7340
Farewell, Leo
I just did a small research about how difficult it is to guess a bitcoin address. All private keys are 2256 but the total addresses aren't that many. They are 2160 as @nullius said.

Now let's compare 2160 with another huge number:

14,615,016,400,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 (2160)
133,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 (Total atoms that exist on our planet)
That answer comes from an estimation of the number of atoms in each of Earth's elements, like Iron, Oxygen, Silicon, Magnesium, Sulfur … etc

It's scary to think how many different combinations of addresses can exist. Imagine that one water drop contains about 5 sextillion atoms. (5.01 x 1021)

Imagine picking one atom randomly from the earth and expecting someone to guess it.
When your computer generates an address is like picking one atom from ~10,000 different Earths.

You can't brute force a bitcoin address. You just can't.
full member
Activity: 706
Merit: 111
there is no difference between 1 and 580000 addresses, the speed is limited by the random number generator

why can't I set more than 19 characters to Vanitygen64, in case I get lucky and the whole address is generated quickly? Probably the fact is that this is a calculation and not a random generation, faster than the estimated time calculation is impossible, unlike random generenation in another program


This one you can put in the whole address

https://bitcointalksearch.org/topic/vanitysearch-yet-another-address-prefix-finder-5112311
https://github.com/JeanLucPons/VanitySearch
hero member
Activity: 1988
Merit: 593
there is no difference between 1 and 580000 addresses, the speed is limited by the random number generator

why can't I set more than 19 characters to Vanitygen64, in case I get lucky and the whole address is generated quickly? Probably the fact is that this is a calculation and not a random generation, faster than the estimated time calculation is impossible, unlike random generenation in another program
copper member
Activity: 630
Merit: 2610
If you don’t do PGP, you don’t do crypto!
[...] To be clear, you are full of shit.

  • 2160 search space of Hash160s
  • [...]
[...]

you forgot to divide the result by 2^96 because there are so many private keys for each address

I forgot nothing.  The 296 is divided out of (slightly less than) 2256 valid private/public keypairs, for the 2160 search space that I stated.

You clearly have no fucking idea what you are talking about.  Also, you are a spammer peddling a scam program with posts that are off-topic on the Vanitygen thread.
hero member
Activity: 1988
Merit: 593
it takes a million years to select one address, but 2 years is enough to select one of 590 thousands 1+ BTC addresses

however, 12000 keys per second is very small on the processor, how much will the video card give if you write the same program?
[blah]

This discussion is off-topic on the Vanitygen thread; but I feel a need to stick a spike in what is essentially idiot-FUD over Bitcoin’s security.  To be clear, you are full of shit.

  • 2160 search space of Hash160s
  • 12000 trials per second
  • 590000 Bitcoin addresses with ≥ 1 BTC (assuming that your information is correct; I can’t be bothered to investigate, when it cannot make any appreciable difference)
  • 86400 seconds per day, 365.2425 days per year

Ignoring the question of how different script types are handled:  On average, what is the expected number of years for you to hit any one of the desired addresses?

Code:
$ bc -l
((2^160 / 590000) / 12000) / (86400 * 365.2425)
6541404408567194639988331071041.54191444061112656733

Well, have fun trying, as I said.

you forgot to divide the result by 2^96 because there are so many private keys for each address
Pages:
Jump to: