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

I mean if we generate just one more arbitrary address at one pass. The probability of that address collision will be the same if we just flip a coin, once (I think the birthday paradox is not applicable here, or I just don't understand something). I don't know how many addresses vanity (for example) actually checks before spitting out the "new" one it finally generates, so technically you might be right. In any case, this only further confirms my point...

That we might be nearer than previously thought to the onset of a new era, an era of devastating collisions

Neither do I, but I just know that thermodynamics in physics is like statistics in mathematics, meaning there are three types of lies - just lies, damned lies, and statistics, lol...

That's why I didn't believe that picture when I first saw it

Exactly all these details I am not familiar with is why I dont like this picture. I roughly understand whats its trying to tell (probably wrong after read your post) us, but I cant check whether or not the claim is true, because I dont understand physics good enough.

---

No, if half of all addresses have been used there will very likely (just shy of 100%) a collision.

Regarding oclvanitygen

Does anyone know how many keys are searched before generating a new random key?

and

Is there anyway to change this setting? (If it generates a random key every million keys, is there any way to change to a billion or a thousand keys before generating a new random key?)

I think the chances actually increase. Why? If we have fully used the address space (i.e. all possible addresses have been found and used), then the probability of collision will be equal to 1, that is, any address you may find will necessarily lead to a collision. If only half of the address space is taken, the probability diminishes to 0.5...

In this way, by filling up the address space, we increase the probability of collision (that was precisely my point)

Actually no, the lowest possible amount of energy is defined by quantum mechanics and can be calculated using Planck's constant (which equals 6.63*10^-34 joule-seconds) by multiplying it by minimal frequency, i.e. E(min) = h x f(min). The minimal possible frequency is determined by the age of the Universe (4.4*10^17 seconds). So we get the minimal possible energy that an object can possess equal to 6.63*10^-34 x 1 / 4.4*10^17 = 1.5*10^-51 joules. In this way, we only need to make such an object oscillate between the two lowest levels of energy given by Planck's constant (this may require only a tiny amount of energy, thereby making a Dyson sphere totally excessive)...

Provided we find such an object in the first place (some low frequency photon whose wavelength is equal to the diameter of the Universe)

i think the main thing that people arent factoring in is, not just the possibility of a collision.. but you also have to factor in the luck in colliding with a used address.


this will significantly lower your chances..

I got that, but I'm not sure whether this claim is actually true. If I ain't missing something, counting to 2^256 means incrementing by one, from zero right up to that value? So how big is that number in decimal notation? I guess it should be something like 10^77. The Sun emits around 3.8 x 10^26 joules of energy per second. If we take one year as a reasonable term for counting to 2^256, we will have 1.2 x 10^34 joules to do that, or approximately 10^-33 joules per increment. The smallest transistor (which could be considered as a simplest increment device) has been made from just 1 atom, while graphene nanoscale transistors have been clocked up to 1,000 GHz (which gives 10^12 increments per second)....

So we need to know how much power an atomic scale transistor consumes to (in)validate that claim in practice

Has anyone had luck running with a GPU thru a riser connected to PCIe x 1 slot ?

I can mine with a GPU on the PCIe x 1 slot.  (with a riser)

Missed that :C


It should. Not sure, I dont get any numbers when I run it with -k 1, but its not 300k per second. Might be the output slowing it down.

---

Thats impossible to use the entire energy our sun has left fueling the best possible computer and let it count to 2²⁵⁶


IIRC its a dyson sphere around our sun. Its a theoretical concept of a civilization so advanced that it can build a sphere around a sun to harvest 100% (or very close to) of its energy output.

The physical limitations assumed in the picture are the following. Take the thing that requires the least amount of energy to represent a bit in either a 0 or a 1 state. IIRC its the spin of some particle. This lowest possible amount of energy is defined by the law of thermodynamics. Now take a good estimate of what the sun can output in terms of energy and calculate how many bit flips you can fuel with that energy. The result is that you cant do enough bit flips to count to 2²⁵⁶. Keep in mind that this is physics and my understanding of these things is limited. I personally think I understand the pictures point, but I dont like it. Mainly because 2²⁵⁶ does not matter anyway and its not a good explanation without a deep knowledge of physics. Its essentially a "because physics says so" which is useless if you cant follow the argument.

Anyway, trailing off. I assumed no lookup time and no other constrains. I also took half of all possible addresses and not all of them, because of the birthday paradox[1] which essentially means that you have a almost 100% chance of finding a collision after checking half of all possible hashes.

[1] https://en.wikipedia.org/wiki/Birthday_problem

I guess, it did not like riser card,

but,

When it asked which device to use, it looks like it had TWO  zeros??
Available OpenCL platforms:
0: [Advanced Micro Devices, Inc.] AMD Accelerated Parallel Processing
  0: [Advanced Micro Devices, Inc.] Pitcairn
  1: [GenuineIntel] Intel(R) Pentium(R) CPU G3220 @ 3.00GHz

Onboard AMD GPU. Pitcairn

Also, 17.6Mkeys/sec  is that expected for R9 270x?

I am having a problem trying to get oclvanitygen to work with one GPU card.  R9270x

Any suggestions, please

installed a fresh copy of ubuntu 15.10 server
AMD-APP-SDK-linux-v2.9
ADL_SDK8
did the fgrlx-updates

/vanitygen-master# aticonfig --list-adapters
* 0. 02:00.0 AMD Radeon (TM) R9 200 Series
* - Default adapter

I installed all the oclvanitygen requirements
sudo apt-get install libssl-dev libpcre3 libpcre3-dev

but I have an error with the compile:
make oclvanitygen
cc -ggdb -O3 -Wall   -c -o oclengine.o oclengine.c
oclengine.c: In function ‘vg_ocl_prefix_check’:
oclengine.c:1553:18: warning: variable ‘tablesize’ set but not used [-Wunused-but-set-variable]
  int orig_delta, tablesize;
                  ^
cc oclvanitygen.o oclengine.o pattern.o util.o -o oclvanitygen -ggdb -O3 -Wall -lpcre -lcrypto -lm -lpthread -lOpenCL

So, I tried to run with this command
 /vanitygen-master# ./oclvanitygen -i 1address
Difficulty: 13419245680
Killed

Any ideas?

I also tried compiling with the oclengine.c line 459 change but had the exact same error.

Thanks for any help!

I don't understand what that picture should tell me. By the way, what is it? Some virus or a star? Further, I don't quite understand how real are these physical limitations of counting, and what do they have to do with finding a collision? If there are 10 billion Bitcoin addresses, the chances of finding just one collision are multiplied by the number of already created addresses, right? In other words, if all possible addresses were created, then any address you generated would be a collision...

Let's assume for simplicity that a search in the database of existing addresses doesn't take time at all

"You're comparing apples with rainbows"

I specifically made reference to the capacity of the top supercomputers reachable today. I assume that we can consider it as an established fact that the time required to find a collision (which is in inverse proportion to the odds of finding this collision) and available computing power are negatively correlated...

That is, the more computing power you have, the faster you will find a collision

It wasn't me who brought forth the example of 1 billion users (with 10 addresses each) having an address collision, so I couldn't possibly relate them to each other. Thereby you are blaming the wrong person here...

My point was totally different

is NVIDIA SM2.1 supported? if not, it could explain this error... 
I updated everything with Nvidia GeForce Experience but nothing...

I did "-i": case insensitive.

This is the reason I said it's hard to comprehend very small chances (and very large numbers). If you're that lucky, why don't you guess the winning lotto numbers every time?

One more example to try to put it into perspective: even though there are billions of stars in billions of galaxies, each weighing billions of tonnes, each containing billions and billions of atoms, the visible universe is estimated to contain between 10⁷⁸ and 10⁸⁰ atoms.
Only 10⁸⁰ tiny particles, such a small number.

If people are afraid of this they should just never reuse addresses. This greatly limits the chances they lose a large amount of coins. The chance that it happens once is so tiny, what are the odds that you "guess" 100, 500 or 1000 addresses?

You're comparing apples with rainbows there...

The values are not even remotely related to one another... how many floating point calcs you can do in a second, is not a number you can directly compare to the chances of 1billion users (who each have 10 addresses) having an address collision!!?!

Bear in mind... people aren't saying it isn't possible... as the odds are >0... they're just soooooooooooooooooooooo very tiny... that if it does happen, well... that's just "Bad Luck™"

Well for one you didnt check for all possible two symbol prefixes (missed capital letters), but the actual reason why there are only 2¹⁶⁰ different possible address is different. There are 2²⁵⁶ private keys. The public key to each private key gets hashed with RIPEMD160 among another algorithm (SHA256) which has a 160 bit output. Thus the can never be more than 2¹⁶⁰ addresses. It is assumed that each address has 2⁹⁶ private keys that allow spending coins from them. This might not be true for all keys as its unclear whether the distribution is uniform. Its possible that some addresses have 2⁹⁶+X keys while others have 2⁹⁶-X keys, where X is not zero.

---

See the picture above? Its about the physical(!) limitations of counting(!) to 2²⁵⁶. Thus its somewhat wrong as we only need to check 2¹⁶⁰ (which is faster) and we are not counting (ECDSA math and hashes are slower than counting). The ballpark is still correct though. In my example above I even assumed 10²² attacks per second.

Brute-Force is not possible. The only way to attack bitcoin is to find a flaw. In terms of math you need a shortcut. Its easy to calculate A+5=C for any A. If you know the result C you can easily reverse the input from that. This is currently not possible for private key -> public key calculations. Currently we can only select a random private key, calculate the public key and check the result. These shortcuts will be found and when that day comes bitcoin will need to adapt. They will however not be found over night (see e.g. RSA and factorisation), but there will be gradual improvement from 2²⁵⁶ steps to maybe 2¹⁹² and enough time to adapt to a different algorihm[1].

[1] a sidenote: SegWit actually make this super easy.