Todamont
|
|
October 28, 2013, 03:22:27 AM |
|
Hmmm. "1ZhouTong" has a lavishness at 1.5e-5 and a reward of 0.48btc. So higher lavishness and higher reward than "1TioKiko". Maybe I'm missing something...
|
|
|
|
|
|
Transactions must be included in a block to be properly completed. When you send a transaction, it is broadcast to miners. Miners can then optionally include it in their next blocks. Miners will be more inclined to include your transaction if it has a higher transaction fee.
|
|
|
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
|
ThePiachu (OP)
|
|
October 28, 2013, 04:55:09 AM |
|
It is possible that the way the Pool calculates how profitable a work is and the way vanitygen calculates it is different. I know that sometimes we have to look at the sum of the profitability of all work for a given public key - if one person requests a few addresses searching for them is often more profitable since you have many different solutions to go for with the same calculations. Hi, I'm just starting out with vanity mining, seeing if it might still put this old ATI 5850 to good use. So I'm using this command to run the miner: ./oclvanityminer -D 0:1,grid=1024x1024 -u https://vanitypool.appspot.com/ -a 1mybitcoinpublickey I with -a 1mybitcoinpublickey you should use address instead, but otherwise it appears to be correct .
|
|
|
|
|
ThePiachu (OP)
|
|
October 30, 2013, 02:20:18 AM |
|
According to the bottom chart on http://fizzisist.com/mining-value/ , the mining ratio is 3 But according to vanitypoool.appspot.com , the mining ratio is 41. Which is correct? Thanks. It probably depends how you calculate it. On Vanity Pool website it's quite optimistic, saying that if you could mine for all addresses at once using sum algorithm you would get this ratio. I don't think that's how miners do it, they generally focus on one most profitable address (or set of addresses) and mine that. Moreover, with the ASICs entering the picture that metric is skewed again, since Bitcoin's difficulty is not representative of what a GPU miner could earn by mining alt-coins for example. I will have to update that part of the pool at some point to be more coin-independent. At any rate, it's best to calculate this yourself, since you will know exactly how your hardware performs (on those websites that performance is guesstimated based on a few GPUs that were measured).
|
|
|
|
integrity42
|
|
October 30, 2013, 03:04:51 AM |
|
Right. I think it would make sense to compare it to LTC, since its the most widely mined coin with GPUs.
|
|
|
|
Todamont
|
|
October 31, 2013, 03:05:49 AM |
|
Well if "TioKiko" is the most profitable reward to mine for right now, it's 17.8 days at 23.5 Mkey/s for a 0.04btc reward, so that's a far cry from being profitable on electricity. If there is a way to search for more than one key at a time, I haven't figured it out, but I would love some instruction from anybody out there.
|
|
|
|
ThePiachu (OP)
|
|
October 31, 2013, 03:06:58 AM |
|
Well if "TioKiko" is the most profitable reward to mine for right now, it's 17.8 days at 23.5 Mkey/s for a 0.04btc reward, so that's a far cry from being profitable on electricity. If there is a way to search for more than one key at a time, I haven't figured it out, but I would love some instruction from anybody out there.
It should be done automatically by the miner.
|
|
|
|
Dare
|
|
October 31, 2013, 03:14:45 AM |
|
Well if "TioKiko" is the most profitable reward to mine for right now, it's 17.8 days at 23.5 Mkey/s for a 0.04btc reward, so that's a far cry from being profitable on electricity. If there is a way to search for more than one key at a time, I haven't figured it out, but I would love some instruction from anybody out there.
It should be done automatically by the miner. How does that work? Since each address has a different partial private key, wouldn't it only be possible to search for one (or multiple with the same key) at a time?
|
|
|
|
Otoh
Donator
Legendary
Offline
Activity: 3024
Merit: 1105
|
|
October 31, 2013, 09:57:04 AM |
|
You can search at the same time for any patterns that have been requested with the same public key, for instance the one that starts 04C13D9C... has 11 requests in atm https://vanitypool.appspot.com/availableWork
|
|
|
|
Todamont
|
|
October 31, 2013, 10:58:18 PM |
|
Otoh, can you explain how I would mine these 11 requests simultaneously? Are you using oclvanityminer, or vanitygen, and what is the command-line string?
|
|
|
|
Otoh
Donator
Legendary
Offline
Activity: 3024
Merit: 1105
|
|
October 31, 2013, 11:44:14 PM |
|
Otoh, can you explain how I would mine these 11 requests simultaneously? Are you using oclvanityminer, or vanitygen, and what is the command-line string?
Sorry, I have no idea, I just request these, that's my public key.
|
|
|
|
Todamont
|
|
October 31, 2013, 11:54:59 PM Last edit: November 01, 2013, 12:18:54 AM by Todamont |
|
Anyone? I guess I can start looking at the source...
|
|
|
|
ThePiachu (OP)
|
|
November 01, 2013, 01:35:39 AM |
|
Anyone? I guess I can start looking at the source...
When you mine for an address, you take a public key and generate a random private-public keypair associated with it. The resulting address will be a valid vanity address for ALL patterns that use the same public key. So after you generate the address, check it against all patterns of that public key and see if any matches. If they do, submit your solution to that work, otherwise generate a new key. Of course, you need to abide by the standard vanity address generation algorithms when creating the keypair.
|
|
|
|
Todamont
|
|
November 02, 2013, 12:14:40 AM |
|
Yes, oclvanityminer should do all of this automatically...
|
|
|
|
Dare
|
|
November 02, 2013, 12:55:29 AM |
|
I guess I was right then, you can only search for addresses from one public key at a time. I just didn't notice there were multiple requests with the same key in the pool! I'm using vanitygen and not oclvanityminer, so I never noticed before. I should be getting a GPU with more MH/s than my CPU soon, though. (No, it's not integrated, it's just a dedicated card that's ~5 years old. Oclvanityminer tends to crash because there are only ~5-10 threads available for it to use, if that.)
|
|
|
|
sheinsha
|
|
November 03, 2013, 06:45:18 PM |
|
Im using ./oclvanityminer now and im getting Searching for pattern: "1UnnDunn" Reward: 0.036000 Value: 0.000001 BTC/Gkey Is this ok? Shouldn't I be getting all the patterns requested by "04C13D9C.." for example.. ? The sum is greater than 0.036...
|
Minar.cc pools are not running anymore, the domain was registered by someone else and I don't have any relationship with the new owner.
|
|
|
ThePiachu (OP)
|
|
November 03, 2013, 09:14:14 PM |
|
Im using ./oclvanityminer now and im getting Searching for pattern: "1UnnDunn" Reward: 0.036000 Value: 0.000001 BTC/Gkey Is this ok? Shouldn't I be getting all the patterns requested by "04C13D9C.." for example.. ? The sum is greater than 0.036... I guess it's just a convenient way of displaying it, rather than listing all patterns beings searched for.
|
|
|
|
Todamont
|
|
November 04, 2013, 06:28:34 PM |
|
Here is the way I'm vanity mining now, searching for 11 rewards using my GPU. I find the public key part with the most rewards pending (from https://vanitypool.appspot.com/availableWork and https://vanitypool.appspot.com/getWork), with at least one reward that is not insanely difficult, which turns out to be: 04C13D... Then I put all the requested patterns linked to this key part into a file called patterns.txt, one line each, in the same folder as the oclvanitygen executable. now I run this script: #!/bin/bash cd /path/to/vanitygen/ rm *.oclbin now=`date +"%m_%d_%Y"` outputFile="Solution_$now.txt" ./oclvanitygen \ -D 0:1,grid=1024x1024 \ -P 04C13D... \ -f patterns.txt \ -o $outputFile \ -k It appears that the -P option does not show up when you type ./oclvanitygen -help, but it is supported in the code, so hopefully when / if it finds a solution, it will be a valid key part and I'll get one of the rewards. A script to do this automatically should be easy enough to generate, not sure what went wrong with "oclvanityminer".
|
|
|
|
ThePiachu (OP)
|
|
November 04, 2013, 09:49:17 PM |
|
Here is the way I'm vanity mining now, searching for 11 rewards using my GPU. I find the public key part with the most rewards pending (from https://vanitypool.appspot.com/availableWork and https://vanitypool.appspot.com/getWork), with at least one reward that is not insanely difficult, which turns out to be: 04C13D... Then I put all the requested patterns linked to this key part into a file called patterns.txt, one line each, in the same folder as the oclvanitygen executable. now I run this script: #!/bin/bash cd /path/to/vanitygen/ rm *.oclbin now=`date +"%m_%d_%Y"` outputFile="Solution_$now.txt" ./oclvanitygen \ -D 0:1,grid=1024x1024 \ -P 04C13D... \ -f patterns.txt \ -o $outputFile \ -k It appears that the -P option does not show up when you type ./oclvanitygen -help, but it is supported in the code, so hopefully when / if it finds a solution, it will be a valid key part and I'll get one of the rewards. A script to do this automatically should be easy enough to generate, not sure what went wrong with "oclvanityminer". Any problems with vanitygen are best addressed to the author of the software - https://bitcointalk.org/index.php?topic=25804.0 .
|
|
|
|
HotSwap
|
|
November 05, 2013, 10:52:59 AM |
|
just out of curiosity is this pool still up and running?
|
|
|
|
|