Really good the aplication i pointed 4 servers to the pool to help bit.

Now i have a question

1MPmZ99f52t8cYchJMcD19QqeZnwVo2S8v

I want to bruteforce this btc adress, I own already the private keys but i wanna do some test.

shall i introduce my btc address as pattern and wait for the solution?

Ignoring that it is no use to find a complete bitcoin adress. :-)

You can not put the whole bitcoin adress in vanitygen. the adress is a base58 of a hash+checksum.You will have unbase58; remove the checksum, then rebase58 and try and find that sequence.When found, that checksum part will be regenerated by vanitygen when it presents the result.... in a couple of million years.

Quote

Edit:

I wanna create thousands of btc address with vanity but something give me a error

Running Vanitygen64 generating a key starting with string 1Proto taking about 14 Hours at the rate of 650 Kkeys. I was finding for a tool like this, would be useful to generate some more and use it as a public address to receive bitcoins.

Really good the aplication i pointed 4 servers to the pool to help bit.

Now i have a question

1MPmZ99f52t8cYchJMcD19QqeZnwVo2S8v

I want to bruteforce this btc adress, I own already the private keys but i wanna do some test.

shall i introduce my btc address as pattern and wait for the solution?

Ignoring that it is no use to find a complete bitcoin adress. :-)

You can not put the whole bitcoin adress in vanitygen. the adress is a base58 of a hash+checksum.You will have unbase58; remove the checksum, then rebase58 and try and find that sequence.When found, that checksum part will be regenerated by vanitygen when it presents the result.... in a couple of million years.

Quote

Edit:

I wanna create thousands of btc address with vanity but something give me a error

vanitygen 1 -ko test.log

what im doing wrong?

try:vanitygen 1 -k -o test.log

As far as I know the flags cannot combined.

How we can scalate the efficiency of vanitygen i mind i can rent a supercomputer and put vanitygen to work (amazon cloud, google cloud etc)

if i put 10 grafic cards to work in the same motherboard all the power will be used by vanitygen?

why paterns as 111111 take longer than 1abc?

any chance to ad the rendezvous points to find more quickly the The Elliptic Curve Digital Signature Algorithm (ECDSA)

-snip-How we can scalate the efficiency of vanitygen i mind i can rent a supercomputer and put vanitygen to work (amazon cloud, google cloud etc)

if i put 10 grafic cards to work in the same motherboard all the power will be used by vanitygen?

Same with highly parallel operations, you lose a little for the overhead with every device added. In general 1 GPU is faster than any CPU (probably even true for 18 core CPUs). 2 GPUs are faster than 1, but not truely twice as fast, 3 are faster than 2, but the 3rd does not add another 50% of power. etc. If you want to buy extra computing power for a vanity address by all means go ahead, but keep in mind that its expensive, probably more expensive than just letting your GPU(s) search for a week or two.

The longer the patern that higher the difficulty. Your chance to find a fitting key a smaller if you ask for more symbols to match. Same as it takes longer (on average) to roll five 6's than it takes to roll one 6.

try: # This tries to open an existing file but creates a new file if necessary. logfile = open("jackpot.txt", "a") try: for j in jackpot: logfile.write(j) finally: logfile.close()except IOError: pass

I run in Debian and seems work but the output in the screen its just two files of numbers someone can "refine" this code with help me a lot my knowledge of python is 0 like the balance of cryptsy accounts

Just for fun the author says clearly its mathematically impossible another thing is find a vuln in ECDSA but seems a lot of work

OK i see really interesting the possibilities of vanitygen we just miss one thing a quantum computer.

A quantum computer can not speed up vantiy address generation as its not efficient at sha256 or ripemd160 and thus can not calculate the private key from an address. A QC is not a very fast computer, it is capable of performing certain algorithms like shor's which is better at solving certain tasks. This does not magically enable it to do all calculations faster.

we work with a really big numbers so the possibility of a collision is minimal.

I just wondering to know how long will take discover all the address with the 11L pattern.

with my equipment i just get 1.000.000 of address with the 11L in 4 hours but not sure about the maths.-snip-

Similar to mining you make no progress towards your goal. Vanitygen just randomly generates a private key, checks if it matches the pattern and keep it if it does. If not the key is not stored. Considering 1 million addresses per second and ideal storrage (32 byte per priv. key, no overhead) you have to store 2764800000000 byte or 2.5 TiB per day. Thus you cant check for doubles. Even if you could, knowing the result of one round does not bring you a step closer to the solution. To make sure you have all solutions you have to try all combinations. For bitcoin those are 2256 private keys for 2160 possible addresses.

OK i see really interesting the possibilities of vanitygen we just miss one thing a quantum computer.

A quantum computer can not speed up vantiy address generation as its not efficient at sha256 or ripemd160 and thus can not calculate the private key from an address. A QC is not a very fast computer, it is capable of performing certain algorithms like shor's which is better at solving certain tasks. This does not magically enable it to do all calculations faster.

we work with a really big numbers so the possibility of a collision is minimal.

I just wondering to know how long will take discover all the address with the 11L pattern.

with my equipment i just get 1.000.000 of address with the 11L in 4 hours but not sure about the maths.-snip-

Similar to mining you make no progress towards your goal. Vanitygen just randomly generates a private key, checks if it matches the pattern and keep it if it does. If not the key is not stored. Considering 1 million addresses per second and ideal storrage (32 byte per priv. key, no overhead) you have to store 2764800000000 byte or 2.5 TiB per day. Thus you cant check for doubles. Even if you could, knowing the result of one round does not bring you a step closer to the solution. To make sure you have all solutions you have to try all combinations. For bitcoin those are 2256 private keys for 2160 possible addresses.

then if a quantum computer, does not help solve the fastest hashes, the only option would be to find a weakness in the elliptic curve generated by the EDCSA is that correct? But from what I've read about this algorithm, it uses a random value generated by k, but random really. Also I have to say I read about a weakness that affects wallets that are generated in Java, it is not impossible, but from what little I've read still relies on very robust protocols

Thanks again for your time, I just want to understand a bit more all related to btc

-snip-then if a quantum computer, does not help solve the fastest hashes, the only option would be to find a weakness in the elliptic curve generated by the EDCSA is that correct?

Shor's algorithm is good at finding the private key for a given public key. The addresses bitcoin uses however have an extra layer of protection until they are used for the first time, this layer are the different hashes. A quantum computer would be dangerour development for all eliptic curve crypto used, not only for crypto currencies like bitcoin.

But from what I've read about this algorithm, it uses a random value generated by k, but random really.

No k must not be random, its just important that its not reused. Its possible to use non random k values to limit the chances of a reusing k. Reusing k leaks the private key. This is an implementation weakness.

Also I have to say I read about a weakness that affects wallets that are generated in Java, it is not impossible, but from what little I've read still relies on very robust protocols

Yes, but thats an implementation weakness as well, not one of eliptic curves. It also does not help to find addresses. The weakness is based on a bad random number generator. If you only use 232 different combinations its much more likely to run into collisions. Its like playing with a broken dice that gives certain numbers a higher chance. As such these number will come more often. It does not make dices in general broken.