Author

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

sr. member
Activity: 261
Merit: 250
I couldn't find a way to make blockchain.info make a compressed address, so I just made a new address in bitcoin-qt, exported the key from that, then importied it into blockchain.info, and I get this:


Type "compressed" into the search box from the Dev & Tech page.  You won't be disappointed.

Thanks for the pointer, but I can't figure out what you mean, there's no Dev & Tech page on the wiki or forums. In case its not obvious, I'm a noob, so sorry if this is a really dumb thing to not know about.
legendary
Activity: 3416
Merit: 1912
The Concierge of Crypto
Compressed keys take up less space in the blockchain, so you don't contribute to the bloat. A compressed key is just a way of storing a public key in fewer bytes (33 instead of 65). There is no real reason to use uncompressed keys anymore except if your client can't use it. In which case, I strongly recommend that you switch to a client that does allow compressed keys, such as the bitcoind / bitcoin-qt client.

Here is an example of an uncompressed key:
044f355bdcb7cc0af728ef3cceb9615d90684bb5b2ca5f859ab0f0b704075871aa385b6b1b8ead8 09ca67454d9683fcf2ba03456d6fe2c4abe2b07f0fbdbb2f1c1

Here is an example of the same key in compressed format:
034f355bdcb7cc0af728ef3cceb9615d90684bb5b2ca5f859ab0f0b704075871aa

Notice the length.
kjj
legendary
Activity: 1302
Merit: 1026
TIL there's such a thing as compressed addresses. Is there any good docs on this? I can't find anything that explains it on the bitcoin.it wiki, maybe its called something else. The only mention is on this page https://en.bitcoin.it/wiki/Private_key where it says you can tell if a private key is for a compressed key because it starts with an L or K.

From what I've read in random places, compressed are 34 characters (including the 1), right? Every one of my public keys are that long, and I used the normal oclvanitygen to make them, so how much shorter would a compressed public key be?

Type "compressed" into the search box from the Dev & Tech page.  You won't be disappointed.
legendary
Activity: 2126
Merit: 1001
TIL there's such a thing as compressed addresses. Is there any good docs on this? I can't find anything that explains it on the bitcoin.it wiki, maybe its called something else. The only mention is on this page https://en.bitcoin.it/wiki/Private_key where it says you can tell if a private key is for a compressed key because it starts with an L or K.

From what I've read in random places, compressed are 34 characters (including the 1), right? Every one of my public keys are that long, and I used the normal oclvanitygen to make them, so how much shorter would a compressed public key be?


The adress, which we see in our clients, are always the same length and look the same no matter if the underlying key is compressed or uncompressed. I can't go into more detail without writing more false than true statements ;-)
(ocl)vanitygen creates only uncompressed keys/adresses, unless you patch it or use a fork from other developers.

Ente
sr. member
Activity: 261
Merit: 250
TIL there's such a thing as compressed addresses. Is there any good docs on this? I can't find anything that explains it on the bitcoin.it wiki, maybe its called something else. The only mention is on this page https://en.bitcoin.it/wiki/Private_key where it says you can tell if a private key is for a compressed key because it starts with an L or K.

From what I've read in random places, compressed are 34 characters (including the 1), right? Every one of my public keys are that long, and I used the normal oclvanitygen to make them, so how much shorter would a compressed public key be?
legendary
Activity: 2126
Merit: 1001
I use salfters. The windows bins are here:
https://bitcointalksearch.org/topic/m.2296814

He gpg signed the md5 and sha1 hashes. I verified the hashes. Haven't checked the sig yet tho. I better do that tomorrow.

The GPU version is forked by scintil, but you need to compile it. I don't have a GPU so I never tried it yet. CPU is fast enough for my needs.

Thank you for the info!

Ente
legendary
Activity: 3416
Merit: 1912
The Concierge of Crypto
I use salfters. The windows bins are here:
https://bitcointalksearch.org/topic/m.2296814

He gpg signed the md5 and sha1 hashes. I verified the hashes. Haven't checked the sig yet tho. I better do that tomorrow.

The GPU version is forked by scintil, but you need to compile it. I don't have a GPU so I never tried it yet. CPU is fast enough for my needs.
legendary
Activity: 2126
Merit: 1001
@Ente, I used almost exclusively compressed keys. Simply because they save transaction size so I pay less fees or none if not needed. If I had used uncompressed keys for some of my transactions, the fee would have been double.

Compressed keys have been the standard since bitcoin-qt version 0.6+. We are at 0.8.5 now.

Oh, good hint, I didn't even think of that yet!

I'll start "mining" compressed keys now.

/edit:
I see samr7s' vanitygen doesn't support compressed keys yet.
There seems to be at least two patched versions out there, gmaxwells' and salfters'.
Which one are you using, Dabs? Would you be so kind and share the windows bins of this? I have a remote box available for this with 7970 gpu, but no compiling stuff installed there.
Oh, is there any gpu vanitygen out there for compressed keys? In case I ever get that 7970 to run..

Thank you!

Ente
legendary
Activity: 3416
Merit: 1912
The Concierge of Crypto
@Ente, I used almost exclusively compressed keys. Simply because they save transaction size so I pay less fees or none if not needed. If I had used uncompressed keys for some of my transactions, the fee would have been double.

Compressed keys have been the standard since bitcoin-qt version 0.6+. We are at 0.8.5 now.
legendary
Activity: 2126
Merit: 1001
Also:
Are you guys creating compressed or uncompressed vanity adresses?
Uncompressed are the original format, but compressed seems to be the standard of the future..
Obviously, at some point all programs will (have to) understand both formats - which isn't the case now.

And then: A firstbit "wasted" on the wrong format can't be used/converted in the other.

Any thoughts on this, or am I seeing problems which aren't there?

Ente
legendary
Activity: 2126
Merit: 1001
oclvanitygen is also happy to search for all strings in a file specified.  doesn't seem to slow it down much.  with some work, from the info in this discussion, i was able to get it working on my 7970 at 26m/s reliably.

Interesting!
What did you have to do for your 7970 to work? Driver version?
You're the first I stumbled upon who got it working, I gave up at this point.

Ente
legendary
Activity: 1232
Merit: 1094
Thanks for the answers, so I can't just collect all the bounties at vanitypool in one swoop, but I can search for multiple strings when generating for myself.

You can search for multiple bounties from the same person at once.  If someone wants multiple names, then they should submit them all at once to the site and use the same secret.
hero member
Activity: 546
Merit: 500
Quote
so I can't just collect all the bounties at vanitypool in one swoop

yes, because mining bounties does not work the same as local mining

Quote
but I can search for multiple strings when generating for myself

yes
sr. member
Activity: 261
Merit: 250
Thanks for the answers, so I can't just collect all the bounties at vanitypool in one swoop, but I can search for multiple strings when generating for myself.
els
jr. member
Activity: 42
Merit: 4
oclvanitygen is also happy to search for all strings in a file specified.  doesn't seem to slow it down much.  with some work, from the info in this discussion, i was able to get it working on my 7970 at 26m/s reliably.
hero member
Activity: 546
Merit: 500
In case anyone works on this program again (it would be nice if it worked on modern cards again), I have a suggestion. Have it so you can put in a big list of strings and let it match on any of them. When I use oclvanityminer it appears to only grab 1 string from the list and just dial up addresses until it finds a match. But wouldn't it be better to just search for a lot of addresses at once? Or maybe that is not possible to do on a GPU?


oclvanitygen -D 0:2 -i -k -o foundMANY1111111111116234234661s.txt 1111111 1tri11ium 1heartofgold 1aaaaaaaaa 1bbbbbbbbb 1cccccccccc 1ddddddddd 1eeeeeeeee 1fffffffff 1ggggggggg 1hhhhhhhhh 1iiiiiiiii 1jjjjjjjjj 1kkkkkkkkk 1lllllllll 1mmmmmmmmm 1nnnnnnnnn 1ooooooooo 1ppppppppp 1qqqqqqqqq 1rrrrrrrrr 1sssssssss 1ttttttttt 1uuuuuuuuu 1vvvvvvvvv 1wwwwwwwww 1xxxxxxxxx 1yyyyyyyyy 1zzzzzzzzz 1222222222 1333333333 1444444444 1555555555 1666666666 1777777777 1888888888 1999999999 1000000000

kjj
legendary
Activity: 1302
Merit: 1026
If you are using vanitypool, each address request has an associated secret.  The people working don't have access to the secret, but it is a factor in the resulting address, so you can only look for one at a time.
sr. member
Activity: 261
Merit: 250
In case anyone works on this program again (it would be nice if it worked on modern cards again), I have a suggestion. Have it so you can put in a big list of strings and let it match on any of them. When I use oclvanityminer it appears to only grab 1 string from the list and just dial up addresses until it finds a match. But wouldn't it be better to just search for a lot of addresses at once? Or maybe that is not possible to do on a GPU?
I look at a page like this: https://vanitypool.appspot.com/availableWork and think, why can't I just wardial addresses and look for them all at the same time?
legendary
Activity: 3416
Merit: 1912
The Concierge of Crypto
I just ran it. Obviously didn't finish the longer ones. My laptop is also slow as you can see, 100 Kkey/s.

Up to 1234 is almost instant. Longer prefixes take longer amounts of time. People who managed to get this working on their GPUs have faster times or less times needed to generate.
sr. member
Activity: 266
Merit: 250
H:\vanitygen>vanitygen -F compressed 1
Difficulty: 1

H:\vanitygen>vanitygen -F compressed 12
Difficulty: 23
Pattern: 12

H:\vanitygen>vanitygen -F compressed 123
Difficulty: 1353
Pattern: 123

H:\vanitygen>vanitygen -F compressed 1234
Difficulty: 78508
Pattern: 1234

H:\vanitygen>vanitygen -F compressed 12345
Difficulty: 4553521
[103.63 Kkey/s][total 399360][Prob 8.4%][50% in 26.6s]

H:\vanitygen>vanitygen -F compressed 123456
Difficulty: 264104224
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 38.3min]

H:\vanitygen>vanitygen -F compressed 1234567
Difficulty: 15318045009
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 1.5d]

H:\vanitygen>vanitygen -F compressed 12345678
Difficulty: 888446610538
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 89.6d]

H:\vanitygen>vanitygen -F compressed 123456789
Difficulty: 51529903411245
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 14.2y]

H:\vanitygen>vanitygen -F compressed 123456789o
Difficulty: 2988734397852220
[85.70 Kkey/s][total 17408][Prob 0.0%][50% in 766.5y]


Yes, that's what I meant!  Tongue
Jump to: