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.
Topic: Vanity Pool - vanity address generator pool - page 11. (Read 148044 times)
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.
The website has been updated to include a message from the admin:
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:
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:
I'm not really on top of ECDSA and this is really confusing. Any help is appreciated.
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.
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.
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
If it's not case sensitive, it should take less than a day.
I see. Thanks!
If it's not case sensitive, it should take less than a day.
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?
winter is six characters, so it's easy even you use your cpu power, you can get it in less than an hour.
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.
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.
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.
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.
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.
I liked vanity addresses but I prefer not to use them now. I don't think they are safe enough actually.
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 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.
How do I generate a mixed case address on vanitypool?
You don't. You could try one of the other pools that offer case-insensitive options, but they're all pretty much inactive.And what miners would be the best for mining vanity address, sha or script? Sorry for all the noob questions
Use the oclvanityminer that's part of vanitygen, or do it manually using oclvanitygen. SHA vs Scrypt comes into play if you want to generate vanity addresses for altcoins that use Scrypt - you'd have to check if there's a vanitygen build for the applicable altcoin.How do I generate a mixed case address on vanitypool?
You don't. You could try one of the other pools that offer case-insensitive options, but they're all pretty much inactive.And what miners would be the best for mining vanity address, sha or script? Sorry for all the noob questions
Use the oclvanityminer that's part of vanitygen, or do it manually using oclvanitygen. SHA vs Scrypt comes into play if you want to generate vanity addresses for altcoins that use Scrypt - you'd have to check if there's a vanitygen build for the applicable altcoin.
How do I generate a mixed case address on vanitypool? And what miners would be the best for mining vanity address, sha or script? Sorry for all the noob questions
Jump to: