Sub.
Reviews on the site will be written for freebitcoins.co.uk and free-bitcoins.net as soon as:
A. You are off testnet.
B. You have a decent ui, helping users who have no idea what you are talking about. Me, for example.
Topic: Vanity Pool - vanity address generator pool - page 34. (Read 147800 times)
The service is alive in a bare form currently. Probably this week I'll have a bit time to bring it up to par in terms of functionality and security. The main problem still remains, that there aren't really isn't is very little split-key vanity mining software. I'll try setting up a bounty for that once I get some funds...
My bash bitcoin tools has now a vanityFromPublicPoint function that implements your idea.
Exemple:
The public key must be entered as a first argument, in 04[XPOSINHEX][YPOSINHEX] format. The target string is the second argument.
You can try the above line if you want. Were you ever find a matching address, I might buy it to you
Exemple:
Code:
$ vanityFromPublicPoint 04234F25164361B0021E32B8A4A4043FC9A609D7810E0D2AD72674C078D99DA32D5700F2ECCBDAE9D2345E19D64BA6C628706F5FB0D4FB78E66D097D97DDF8822A "Grondi1u"
The public key must be entered as a first argument, in 04[XPOSINHEX][YPOSINHEX] format. The target string is the second argument.
You can try the above line if you want. Were you ever find a matching address, I might buy it to you
I and others have spent a lot of time trying to come up with a way to do vanity address mining in such a way that you can look for all the outstanding vanity addresse requests (all requests from all customers) with a single loop.
An address-squatter's dream, like domain names, 1-800 numbers and such... Grab a dictionary for a quick peek at initial search targets, but a list of trademarks, especially if biassed by market cap of the trademark owner, might also be useful.
A long term "investment" and maybe a more initially-expensive one than back in the days when I got windows.com, windows.org and windows.net for free on spec from the NIC and am still owed $3.50 by e-bay for their inability to find me a buyer for the matched set thus never yet actually refunded "refund" of the $3.50 they charged my credit card for trying to find a buyer.
(No wonder I have a still lingering lack of being impressed by this purportedly great auction site known as e-bay...
)-MarkM-
I and others have spent a lot of time trying to come up with a way to do vanity address mining in such a way that you can look for all the outstanding vanity addresse requests (all requests from all customers) with a single loop.
Well, it might not be that much of an issue, at least not until a lot of people will want some long vanity addresses at the same time. The option for users to share their private keys would probably be hard to do (people generally can't be bothered). One could, however, also gather orders from people who don't mind having their vanity address generated by traditional means. Those could be cheaper for example, or mined only by some trusted members of the community.
Note that generating vanity addresses that start with 3 like "3vanity" will be much easier and faster than generating vanity addresses that start with 1 (like "1vanity").
The pool already supports that (I'll have to do some input sanitisation at some point though).
Note that generating vanity addresses that start with 3 like "3vanity" will be much easier and faster than generating vanity addresses that start with 1 (like "1vanity").
Only if you bloat the blockchain with a lot of unnecessary garbage, or make hard-to-import "keys".I've published my BIP13 (3...-addresses) branch of vanitygen.
I and others have spent a lot of time trying to come up with a way to do vanity address mining in such a way that you can look for all the outstanding vanity addresse requests (all requests from all customers) with a single loop. There are ways to do this but they all have issues. Here is one thread to read:
https://bitcointalksearch.org/topic/outsourcing-vanity-address-generation-56839
Especially this summary posting:
https://bitcointalksearch.org/topic/m.679537
Note that generating vanity addresses that start with 3 like "3vanity" will be much easier and faster than generating vanity addresses that start with 1 (like "1vanity").
I will get you a couple more threads when I get a chance.
https://bitcointalksearch.org/topic/outsourcing-vanity-address-generation-56839
Especially this summary posting:
https://bitcointalksearch.org/topic/m.679537
Note that generating vanity addresses that start with 3 like "3vanity" will be much easier and faster than generating vanity addresses that start with 1 (like "1vanity").
I will get you a couple more threads when I get a chance.
Hmm, interesting, I'll have to look into that further. I guess the addition version might allow one to look for more addresses at the same time, but it probably won't be enough to compensate for the added complexity.
Adding the functionality to the site will probably be easy, I'll look into it once I have a bit of free time on my hands.
Thank you for the information!
Adding the functionality to the site will probably be easy, I'll look into it once I have a bit of free time on my hands.
Thank you for the information!
There are two ways to do this but one takes less steps inside the time critical loop so would take less time to compute each trial:
Public key addition (described above) steps
1) Generate new key pair
2) Add the generated public key to the provided public key
3) Hash and test
4) If not the vanity address match go to step 1)
Private key multiplication (described elsewhere) steps
0) Set the starting point of all key generation to the provided public key (instead of the normal point G)
1) Generate new key pair
2) Hash and test
3) If not the vanity address match go to step 1)
See how method 1) requires a larger modification to the vanity generation loop and adds a large computational step, point (public key) addition defined over the eliptical curve, into the time critical loop?
I believe that method 2) would run much faster.
After the vanity address is found the only difference between the two methods is that in method 1) the final private key is the modulo sum of the two private keys where as in method 2) is is the modulo product of the two private keys.
Public key addition (described above) steps
1) Generate new key pair
2) Add the generated public key to the provided public key
3) Hash and test
4) If not the vanity address match go to step 1)
Private key multiplication (described elsewhere) steps
0) Set the starting point of all key generation to the provided public key (instead of the normal point G)
1) Generate new key pair
2) Hash and test
3) If not the vanity address match go to step 1)
See how method 1) requires a larger modification to the vanity generation loop and adds a large computational step, point (public key) addition defined over the eliptical curve, into the time critical loop?
I believe that method 2) would run much faster.
After the vanity address is found the only difference between the two methods is that in method 1) the final private key is the modulo sum of the two private keys where as in method 2) is is the modulo product of the two private keys.
It is somewhat close to that algorithm, but not exact.
I'm glad you find the idea interesting. If you want to write a library to perform offline key mearging, or split-vanity-key mining, I'll put up a link to it on the website and the orIginal post. I'll have to look into writing some C++ code for that at some point...
I'm glad you find the idea interesting. If you want to write a library to perform offline key mearging, or split-vanity-key mining, I'll put up a link to it on the website and the orIginal post. I'll have to look into writing some C++ code for that at some point...
Sorry I haven't read the whole thread but that is basically Diffie-Hellman, right?
Anyway it sounds to me like a pretty good idea and a possibility for an additionnal business for miners.
An offline tool will be easy to write. My Perl bitcoin library almost aready does the job.
Anyway it sounds to me like a pretty good idea and a possibility for an additionnal business for miners.
An offline tool will be easy to write. My Perl bitcoin library almost aready does the job.
I generated a 1freenode address (9 characters because the 1 counts as well) and it toook a day or 2 on a single 5870. The time estimate from oclvanitygen was significantly higher than that, so I may have gotten lucky. During that run I actually found 2 matching keys, and one of them happened to be all lowercase too.
we all live in a yellow submarine, a yellow submarine...
I imagine a vanity address of 'polymorphic..." would be difficult [time consuming] in the extreme to generate.
I imagine a vanity address of 'polymorphic..." would be difficult [time consuming] in the extreme to generate.
My estimation is, that the cost would be in the order of 1-2 million Bitcoins. When you go over 8 characters, the keys get quite expensive really fast. But then again, I don't really have much data on the cross performance of many graphic cards doing vanity generation.
we all live in a yellow submarine, a yellow submarine...
I imagine a vanity address of 'polymorphic..." would be difficult [time consuming] in the extreme to generate.
I imagine a vanity address of 'polymorphic..." would be difficult [time consuming] in the extreme to generate.
I've created a simple split vanity miner software in Google Go (if you're wondering why I used this weird language - I've been developing Bitcoin-related apps in it for a year for my master thesis). The source code and a Mac executable is available here:
https://github.com/ThePiachu/Split-Vanity-Miner-Golang
It is quite slow, checking a couple hundred addresses on my old Macbook Pro, but it can solve some reasonably short patterns. The software is streamlined for the vanity pool, you only need to change the given testnet Bitcoin address to yours and it will do most of the work. It fetches work only during the start, so keep that in mind if you want to run it for longer.
https://github.com/ThePiachu/Split-Vanity-Miner-Golang
It is quite slow, checking a couple hundred addresses on my old Macbook Pro, but it can solve some reasonably short patterns. The software is streamlined for the vanity pool, you only need to change the given testnet Bitcoin address to yours and it will do most of the work. It fetches work only during the start, so keep that in mind if you want to run it for longer.
Code:
Work accepted!
Your work has been prepared!
Please send a reward you want to pay for it to this address: mh4ymyUejEA7VNuA9VKEqw3wsVquoN7BPx
Is that address correct? Starting by m?
It's a testnet address:
https://en.bitcoin.it/wiki/Testnet
Means you can play with fake-Bitcoins, just in case something goes wrong with the system.
You can get some testnet bitcoins here:
http://testnet.freebitcoins.appspot.com/
They are free.
Code:
Work accepted!
Your work has been prepared!
Please send a reward you want to pay for it to this address: mh4ymyUejEA7VNuA9VKEqw3wsVquoN7BPx
Is that address correct? Starting by m?
Is there some way to charge based on how long the key took to find? Like what if you set the price equal to whatever you would made mining BTC?
For now the service doesn't charge based on key length. It can be implemented if there is a need for it. I'd have to benchmark some split-vanity-mining software on some various hardware first in order to determine how much should one be charging. I've done it for normal vanity mining (details will be available in my master thesis that I'll probably post on the forum eventually).
Personally, I'd have to first check whether looking for multiple keys at the same time will slow the process down considerably, or will it not be too noticeable.
Generally I'd like to leave a lot of freedom to the miners to discriminate themselves which tasks pay enough for them to undertake them (this is why the bounty is listed along with the task).
Something I have thought about doing for a long time. Subscribe.
I still think an address namespace in namecoin (or something similar) is a better long term solution than vanity addresses, but they are fun for now.
Is there some way to charge based on how long the key took to find? Like what if you set the price equal to whatever you would made mining BTC?
Something I have thought about doing for a long time. Subscribe.
Jump to: