Bitcoin Forum
December 05, 2016, 02:48:20 AM *
News: To be able to use the next phase of the beta forum software, please ensure that your email address is correct/functional.
 
   Home   Help Search Donate Login Register  
Pages: « 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 [26] 27 28 29 30 31 »
  Print  
Author Topic: Vanity Pool - vanity address generator pool  (Read 106237 times)
TheRealSteve
Hero Member
*****
Offline Offline

Activity: 686

FUN > ROI


View Profile
April 21, 2014, 12:44:23 AM
 #501

so for Bitcoin vanity addresses,  I ll have to use sha?
Correct - though specifically, you would have to generate them according to what makes a valid Bitcoin address:
https://en.bitcoin.it/wiki/Technical_background_of_version_1_Bitcoin_addresses

VanityGen and the included vanityminer will do all this for you - there's no reason to worry about the particular technical details at all unless you were creating your own implementation.

Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
1480906100
Hero Member
*
Offline Offline

Posts: 1480906100

View Profile Personal Message (Offline)

Ignore
1480906100
Reply with quote  #2

1480906100
Report to moderator
1480906100
Hero Member
*
Offline Offline

Posts: 1480906100

View Profile Personal Message (Offline)

Ignore
1480906100
Reply with quote  #2

1480906100
Report to moderator
1480906100
Hero Member
*
Offline Offline

Posts: 1480906100

View Profile Personal Message (Offline)

Ignore
1480906100
Reply with quote  #2

1480906100
Report to moderator
coinnewbit
Full Member
***
Offline Offline

Activity: 238


View Profile
April 21, 2014, 01:13:17 AM
 #502

so for Bitcoin vanity addresses,  I ll have to use sha?
Correct - though specifically, you would have to generate them according to what makes a valid Bitcoin address:
https://en.bitcoin.it/wiki/Technical_background_of_version_1_Bitcoin_addresses

VanityGen and the included vanityminer will do all this for you - there's no reason to worry about the particular technical details at all unless you were creating your own implementation.
So given that I have a 1 ths miner, how long will i take to generate a 7 letter case insensitive pattern, e.g 1gosgade....?

      BinaryBase.co    
▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬
cogabonito
Sr. Member
****
Offline Offline

Activity: 240


View Profile
April 21, 2014, 01:52:47 AM
 #503

I liked vanity addresses but I prefer not to use them now. I don't think they are safe enough actually.

Winterfrost
Full Member
***
Offline Offline

Activity: 149


GPG 0FC76C1241E39BF6


View Profile
April 21, 2014, 01:53:06 AM
 #504

So given that I have a 1 ths miner, how long will i take to generate a 7 letter case insensitive pattern, e.g 1gosgade....?

Since you're quoting TH/s, I assume you're referring to an ASIC device. You can't use bitcoin mining devices to create vanity addresses. Bitcoin ASICs only do one specific thing, and that thing is bitcoin mining, not address calculations. You will need to use a CPU/GPU.

1winteru2GkEyqLGK95WVCHwBBpGRJXW1
coinnewbit
Full Member
***
Offline Offline

Activity: 238


View Profile
April 21, 2014, 01:54:48 AM
 #505

So given that I have a 1 ths miner, how long will i take to generate a 7 letter case insensitive pattern, e.g 1gosgade....?

Since you're quoting TH/s, I assume you're referring to an ASIC device. You can't use bitcoin mining devices to create vanity addresses. Bitcoin ASICs only do one specific thing, and that thing is bitcoin mining, not address calculations. You will need to use a CPU/GPU.
right, so what about guys? Suppose I have 4 r920s, how long would I take?

      BinaryBase.co    
▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬
Winterfrost
Full Member
***
Offline Offline

Activity: 149


GPG 0FC76C1241E39BF6


View Profile
April 21, 2014, 01:56:48 AM
 #506

right, so what about guys? Suppose I have 4 r920s, how long would I take?

I don't know how fast r290s can get for vanity addresses, but should give you an estimate when you start up oclvanitygen.

1winteru2GkEyqLGK95WVCHwBBpGRJXW1
coinnewbit
Full Member
***
Offline Offline

Activity: 238


View Profile
April 21, 2014, 02:00:15 AM
 #507

right, so what about guys? Suppose I have 4 r920s, how long would I take?

I don't know how fast r290s can get for vanity addresses, but should give you an estimate when you start up oclvanitygen.
How long did it take for you to get your vanity address?

      BinaryBase.co    
▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬
Winterfrost
Full Member
***
Offline Offline

Activity: 149


GPG 0FC76C1241E39BF6


View Profile
April 21, 2014, 02:06:00 AM
 #508

How long did it take for you to get your vanity address?

It's been a while, but I think it was a vanitypool request because I didn't want to bother with figuring drivers out.

1winteru2GkEyqLGK95WVCHwBBpGRJXW1
cogabonito
Sr. Member
****
Offline Offline

Activity: 240


View Profile
April 21, 2014, 02:08:30 AM
 #509

winter is six characters, so it's easy even you use your cpu power, you can get it in less than an hour.

coinnewbit
Full Member
***
Offline Offline

Activity: 238


View Profile
April 21, 2014, 02:16:45 AM
 #510

winter is six characters, so it's easy even you use your cpu power, you can get it in less than an hour.
Oh, so seven characters would take maybe about a few days with 4 r920s?

      BinaryBase.co    
▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬
cogabonito
Sr. Member
****
Offline Offline

Activity: 240


View Profile
April 21, 2014, 02:22:08 AM
 #511

If it's not case sensitive, it should take less than a day.

coinnewbit
Full Member
***
Offline Offline

Activity: 238


View Profile
April 21, 2014, 02:32:35 AM
 #512

If it's not case sensitive, it should take less than a day.
I see. Thanks!

      BinaryBase.co    
▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬
blackvoice
Jr. Member
*
Offline Offline

Activity: 56


View Profile
April 21, 2014, 08:53:44 AM
 #513


Is there any other vanity pools? (I couldn't find any other) Or this is only one? If there are multiple ones, which one would be most profitable? ie. with most rewards and easiest addresses.

------------

I think just one



Comm: CY5h6q3ckuK4F4pSxrNUK63sxaHoPWiP7T
ShareCoin: SeXNHc5ZQGdE1UYNQptgjD5gte1HNxPhVs
TheRealSteve
Hero Member
*****
Offline Offline

Activity: 686

FUN > ROI


View Profile
April 21, 2014, 09:05:33 AM
 #514

Is there any other vanity pools? (I couldn't find any other) Or this is only one? If there are multiple ones, which one would be most profitable? ie. with most rewards and easiest addresses.
There are others, but Vanity Pool is the only particularly active one.
The others:
Vanity Address Market Place (VAMP) - in alpha, may be broken right now.  I contacted the proprietor, but didn't get a response.
Vanity Address Request (VAR) - should work, doesn't see many 'miners' though, and as a result not many requests.

You may want to set up some automated system to check for new work at Vanity Pool and see if it's profitable enough for you to mine, as most of the existing work is much too complex for the given rewards.

bardi.harborow
Member
**
Offline Offline

Activity: 114


Democracy is vulnerable to a 51% attack.


View Profile WWW
April 25, 2014, 05:42:19 AM
 #515

The website has been updated to include a message from the admin:
Quote
Important message from the admin:
The Pool now supports compressed key solutions. We will also be phasing out additive solutions soon, so make sure to keep your miners up to date.

Would someone mind explaining what all this business about additive/multiplicative/compressed key solutions is. I also saw this:

I'm 100% sure oclvanityminer is searching for patterns belonging to only a single public key at once, and this implies the multiplicative method (if I understand correctly). Still, I don't know if it is actually using that method.

There have been a lot of questions lately about additive vs. multiplicative, and how they work in oclvanitygen/oclvanityminer.  I'll try to answer them.

Oclvanityminer uses the additive method:

  • Generate a random partial private key
  • Calculate the associated partial public key
  • Add the base public key to the partial public key to get the test public key
  • Generate a large batch (~1M) of sequential addresses by successively adding the generator point to the test public key, and converting the points to addresses
  • If a match is found, report the partial private key plus the number of times the test public key was incremented.  Otherwise, repeat the previous step

Sequential public keys in this scheme are generated by successively adding the generator point to the test public key.  In the multiplicative method, we would skip adding the base public key to the test key at the start, and use the base public key as the increment instead of the generator point.

If anyone really wants to use the multiplicative method instead, it's possible to modify oclvanityminer to do this by changing maybe 5-10 lines of code.  The performance difference would be negligible.

You are correct that oclvanityminer will search for addresses belonging to a single public key at a time.  I'm not sure how additive vs. multiplicative makes a difference in the ability to concurrently search for patterns using different base public keys.  For that matter, I'm not quite sure how to efficiently search for multiple patterns with different base public keys in the first place.

Which is confusing me. I thought the system went like this:

  • Generate a random partial private key
  • Calculate the associated partial public key
  • Add the base public key to the partial public key to get the address public key
  • Use RipeMD160 and Base58 to check the address. Repeat.

I'm not really on top of ECDSA and this is really confusing. Any help is appreciated.

Web | Twitter | GPG | Bitcoin-OTC | LocalBitcoins | CEX.IO | DigitalOcean | Daliy Bitcoins | BTCClicks | CoinReaper
BTC/TRC/FRC: 1Bardi4eoUvJomBEtVoxPcP8VK26E3Ayxn LTC: LW7SnLeiEt6u9VkPQYwQdNWbysPtaYjR36 FTC: 6evSnqyQLgntbYE7yo63gvFBZg4xiYFTGg DVC: 18HfpNn9PnsDb8vP4t35cSpQn5A6n6qN8Z
TheRealSteve
Hero Member
*****
Offline Offline

Activity: 686

FUN > ROI


View Profile
April 25, 2014, 10:27:16 AM
 #516

Would someone mind explaining what all this business about additive/multiplicative/compressed key solutions is.
It's a bit technical, but let's distill it down to the basics...

ECDSA keys are comprised of X and Y coordinate information.  A compressed key is simply a shorter representation of the public key by discarding the Y coordinate and instead adding a small bit of information about the coordinates that allows a bit of code to work out the Y coordinate based on the X coordinate.
This is desirable because it keeps the size of the blockchain down a fair bit at the expense of a teensy bit more computation for any piece of software that has to actually deal with these calculations.
However, because Bitcoin addresses are based on the public key representation - rather than the public key information - such a compressed key yields a different address than a non-compressed key.
( For those wondering - yes, that means that for every address out there, there's another matching address.  That's why private keys represented in a WIF format will have a bit of information for clients on whether the public key is uncompressed (WIF starts with a '5') or compressed (WIF starts with 'K' or 'L'), while for raw or incorrect imports you'll have to help the client along a bit by specifying it specifically. )

The additive and multiplicative bits are even more technical, you really would have to read up on the finer details, but suffice it to say that both yield the same results due to the way elliptic curve cryptography work with the exception that when using additive you can combine two public keys and get the desired address, while with multiplicative you can't.  This doesn't really affect the end-result other than having to choose which combination to use to actually get the correct address - i.e. if it is multiplicative and you choose additive instead, you still get a valid Bitcoin address.. just not the one with the vanity.

Can't help you with the other one other than that I believe the steps are exactly as you mention with the modification that the base point is added as that still yields valid results and is faster than re-generating a new key for each test.

micax1
Hero Member
*****
Offline Offline

Activity: 532


View Profile
June 10, 2014, 04:31:31 AM
 #517

hi got the solution for

Pattern: 1BitSnitch
Address: 1BiTSniTCH....
Privkey: Kx19...........



when submitting - getting error:
Solution does not match the pattern

using bitcoin address utility by Casascius to convert key to hex.
Please advise.

█▌
_
█▌█▌█▌
_
█▌█▌█▌
_
█▌█▌█▌
ThePiachu
Sr. Member
****
Offline Offline

Activity: 442



View Profile WWW
June 10, 2014, 05:19:30 AM
 #518

hi got the solution for

Pattern: 1BitSnitch
Address: 1BiTSniTCH....
Privkey: Kx19...........



when submitting - getting error:
Solution does not match the pattern

using bitcoin address utility by Casascius to convert key to hex.
Please advise.

Addresses are case sensitive. Also keep in mind to use split-key vanity address generators in case you haven't been.

1HWbVLhxj7bhewhyapMZpyhqWAeAhJd51E
My Bitcoin Calculator:
http://tpbitcalc.appspot.com/
micax1
Hero Member
*****
Offline Offline

Activity: 532


View Profile
June 10, 2014, 12:47:06 PM
 #519

hi got the solution for

Pattern: 1BitSnitch
Address: 1BiTSniTCH....
Privkey: Kx19...........



when submitting - getting error:
Solution does not match the pattern

using bitcoin address utility by Casascius to convert key to hex.
Please advise.

Addresses are case sensitive. Also keep in mind to use split-key vanity address generators in case you haven't been.

oh ok.
missed split-key somehow...
is there opportunity to use list of prefixes with list of Public Keys with oclvanityminer?

also is there opportunity to generate priv key without pubkey and than combine somehow?

Or it is only possible with oclvanitygen to generate 1 address at a time with split-key requirements?

thank you!

█▌
_
█▌█▌█▌
_
█▌█▌█▌
_
█▌█▌█▌
micax1
Hero Member
*****
Offline Offline

Activity: 532


View Profile
June 10, 2014, 05:27:25 PM
 #520

Trying vanityminer on pool:
Is it normal to have 1.2y 50% prob on 50mkey/sec?

█▌
_
█▌█▌█▌
_
█▌█▌█▌
_
█▌█▌█▌
Pages: « 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 [26] 27 28 29 30 31 »
  Print  
 
Jump to:  

Sponsored by , a Bitcoin-accepting VPN.
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!