$oldData = file_get_contents('checkForNewVanityPoolWork.txt');
$newData = file_get_contents('https://vanitypool.appspot.com/getWork');
if(md5($oldData) != md5($newData)) {
// Found changes..
echo "\n\n\nNEW VANITY POOL WORK!\n\n\n";
file_put_contents('checkForNewVanityPoolWork.txt', $newData);
}
| vanity | difficulty | pool lavishness | calculated lavishness | ratio |
| 1ALiCECiLA | 2938077882634390
As great as it would be to have those features implemented, at the moment I am working on too many projects to rework the Pool. I think what the Pool needs more of is exposure - if more people start using it, miners will be able to work on more addresses and get more regular profit.
Looks like there's some renewed interest in this - any chance a shared mining pool (which I thought of, but figured it was somewhere in this thread already - and it was) could make an appearance, or is the I/O cost still too high?
It's possible to make vanity address mining much like regular bitcoin mining, in the sense of tracking the total work completed by each participant, and possibly distributing rewards to all participants rather than just the finder. The idea would be, if somebody wants 1DanieLRH, post the bounty for 1Danie, and keep track of how many addresses each miner returns. Eventually, a matching address will come back, and all of the partial matches will make it possible to determine the division of compute resources. I suppose the partial rewards would be possible, but could tax the pool a bit too much. It is running on Google App Engine which charges for each read/write operation. I guess if there is enough demand I can look into that. Though the way I had thought of doing this was to be a bit more useful in the work generated - but then samr7 seems to have disappeared and several code changes would be needed, if even possible without breaking the whole 'zero trust' bit. But a possibly simpler solution dawned on me that should work without any changes on the miner side - but may be a headache in the making for accounting. In addition to the long-prefix (Lx) work posted, you would have another set of work posted that has much simpler vanity prefixes (Sx) - be that short common words, repeating characters, or just inherently simpler prefixes (trying to recall why some characters were inherently more difficult than others.. might have been dreaming that); say prefixes that may average just a few per day (as opposed to the current '50% change of hitting a solution in N years') A miner would run the oclvanityminer app twice*, with two different URLs for each (so that each gets a different list), supplying the same bitcoin address (this becomes the miner's 'ID'). When started 'as is', each will be mining at about the same hash rate (a 50/50 split), so the number of solutions sent out for Sx becomes indicative of how much work they're doing toward the solution of Lx. If the miner decides to give Sx a higher priority (assigning more threads, say), this inherently cuts into the hash rate for the Lx, making it less likely that they will hit the Lx within the same time frame as somebody who leaves it at 50/50. So while they may get a larger proportion of the bounty** once Lx has been found, it would - on average - take longer for it to be found, thus eating into electricity/maintenance costs and also allowing more shares by others to be submitted in that time. If they decide to do the opposite, giving Lx a higher priority than Sx, they may arrive at a solution of Lx more quickly, but because they have sent in fewer Sx, they'll get a smaller proportion of the bounty. * May need -g XxY tweaks as otherwise it may run out of resources (and crash the driver while at it - oops). ** One option to discourage this behavior further is by giving the miner that actually finds the bounty a larger proportion by default - thus encouraging a miner to mine as fast as possible, 'beating' others to the solution, while letting them decide the shares vs actually-finding-it trade-off The upsides to this approach are:
The downsides are many, too, though:
Yes looking aimlessly for "1aantonop" is absolutely niche. Useless POS. Could someone create a pool that can say not search for the same address until the end of time? It's all supply and demand - if people aren't buying addresses, there is little work. If you want to get more mining work, try convincing people to get themselves a vanity address  .Lol. I can't really complain. I found two addresses on that dual Nvidia machine. I don't think I can afford 1UnicornHasher 
I wish someone would make a decent tutorial online video on how to get a vanity address
any info I have found so far is sketchy at best.  Yes looking aimlessly for "1aantonop" is absolutely niche. Useless POS. Could someone create a pool that can say not search for the same address until the end of time? It's all supply and demand - if people aren't buying addresses, there is little work. If you want to get more mining work, try convincing people to get themselves a vanity address . 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 someone did set up some other pool, but to the best of my knowledge this is the only pool that has any traffic. It's a small niche market. Yes looking aimlessly for "1aantonop" is absolutely niche. Useless POS. Could someone create a pool that can say not search for the same address until the end of time? 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 someone did set up some other pool, but to the best of my knowledge this is the only pool that has any traffic. It's a small niche market.
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.
PS Screw you 1aantonop
I think I'm going to stop using the pool until this address goes away. I'll work on 1Unicorn for a bit.
The Vanity Address DAC mines blocks into existence by finding vanity names.
Names are processed on a highest Bid basis and the entire hash power of the network is directed toward finding Vanity addresses for users.
@miaviator
Then you were pretty lucky, indeed. My AMD 5770 crunches about 15.5 MKeys/s and, oh yeah, once I was lucky too on the vanity pool. It made me happy to see that something unusual happened that day. Always a nice surprise. Unfortunately most work is way out of near reach and heavily underpaid for the amount of work needed to find a solution. Sure, with a tremendous amount of luck it might work out, but you can't rely on that. When I'm in the right mood and bored of other mining, I'll point oclvanitymine @ the pool and hope for some lucky day.  Fantastic. Found another one. On a cheap nvidia GPU. What's your hash rate and what estimate did it show? 20Kkeys x 10 rigs Plus 4Mkeys x 2 cards I don't look at the estimates. So far this is the only thing profitable I have found for spare cycles and a 3.8Khash nvidia rig. All of which refuses to find 1Unicorn mostly because of the length and the U at the beginning.
I'm still confused... Is there a way to search for all available work at once even though there are different part public keys? I understand making a simple bat and text to search for ones with the same part public key but there has to be a way to search for multiple part public keys at the same time....
Ideally there should be a one time command line that searches for all available work at the same time whilst listing your Bitcoin address and once you solve one it pays out automatically. If this already exists please shoot a example oclvanitygen line that does this. Fantastic. Found another one. On a cheap nvidia GPU. What's your hash rate and what estimate did it show? Jump to:
|
