How to choose what pattern to generate?
I don't have a very good GPU and with the autochosen pattern it says 50% in 25 years,
i guess what i want to say is how to choose the one with the lowest difficult?
Topic: Vanity Pool - vanity address generator pool - page 5. (Read 148044 times)
No version info available is just a warning; as you can see, it does searches for the hash regardless.
The miner only searches for the one pattern displayed (it choses the one it thinks being most profitable based on reward divided by difficulty).
You can use as many computers with the same credit address as you want; if one of them finds a solution it will submit it with that address. The computations are done "offline" with no shares sent to the upstream server, so it doesn't really knows how many miners are there until one of them finds a solution. (Well, technically they still request a list of available bounties from the server every once in a while, but it gives no indication to the pool of the speed and capacity of each client).
Thanks for these informations.
I have some questions
I 'm getting this:
- Is "no version information available" is just a warning or a serious error?
- Does the miner search only for the displayed pattern (ie 1BETBTCcom) or a pattern set?
- Can we use several miners (different computers) with the same credit address?
I 'm getting this:
Code:
./oclvanityminer: /usr/local/cuda-8.0/targets/x86_64-linux/lib/libOpenCL.so.1: no version information available (required by ./oclvanityminer)
Searching for pattern: "1BETBTCcom" Reward: 0.200000 Value: 0.000000 BTC/Gkey
Difficulty: 2938077882634386
Total value for current work: 0.000000 BTC/Gkey
[22.68 Mkey/s][total 48909778944][Prob 0.0%][50% in 2.8y]
Searching for pattern: "1BETBTCcom" Reward: 0.200000 Value: 0.000000 BTC/Gkey
Difficulty: 2938077882634386
Total value for current work: 0.000000 BTC/Gkey
[22.68 Mkey/s][total 48909778944][Prob 0.0%][50% in 2.8y]
- Is "no version information available" is just a warning or a serious error?
- Does the miner search only for the displayed pattern (ie 1BETBTCcom) or a pattern set?
- Can we use several miners (different computers) with the same credit address?
No version info available is just a warning; as you can see, it does searches for the hash regardless.
The miner only searches for the one pattern displayed (it choses the one it thinks being most profitable based on reward divided by difficulty).
You can use as many computers with the same credit address as you want; if one of them finds a solution it will submit it with that address. The computations are done "offline" with no shares sent to the upstream server, so it doesn't really knows how many miners are there until one of them finds a solution. (Well, technically they still request a list of available bounties from the server every once in a while, but it gives no indication to the pool of the speed and capacity of each client).
I have some questions
I 'm getting this:
- Is "no version information available" is just a warning or a serious error?
- Does the miner search only for the displayed pattern (ie 1BETBTCcom) or a pattern set?
- Can we use several miners (different computers) with the same credit address?
I 'm getting this:
Code:
./oclvanityminer: /usr/local/cuda-8.0/targets/x86_64-linux/lib/libOpenCL.so.1: no version information available (required by ./oclvanityminer)
Searching for pattern: "1BETBTCcom" Reward: 0.200000 Value: 0.000000 BTC/Gkey
Difficulty: 2938077882634386
Total value for current work: 0.000000 BTC/Gkey
[22.68 Mkey/s][total 48909778944][Prob 0.0%][50% in 2.8y]
Searching for pattern: "1BETBTCcom" Reward: 0.200000 Value: 0.000000 BTC/Gkey
Difficulty: 2938077882634386
Total value for current work: 0.000000 BTC/Gkey
[22.68 Mkey/s][total 48909778944][Prob 0.0%][50% in 2.8y]
- Is "no version information available" is just a warning or a serious error?
- Does the miner search only for the displayed pattern (ie 1BETBTCcom) or a pattern set?
- Can we use several miners (different computers) with the same credit address?
Is there a functioning split-key vanity pool. There were two before but I can't seem to find the other legitimate one.
For the record, the pool in the first message of the topic is still alive and paying out rewards. I've successfully found a solution recently and got the reward, so feel free to post vanity requests.
Is there a functioning split-key vanity pool. There were two before but I can't seem to find the other legitimate one.
t looks like someone is hammering my vanitypool-value API every 30 seconds with a Ruby script. The API is cached for 5 minutes, so you aren't actually gaining anything from pinging it so often. Would you please reduce the frequency to closer to 5 minutes?
The IP address of the requests starts is 82.
Thanks!
The IP address of the requests starts is 82.
Thanks!
Yeah, most of the requests that are currently in the pool have been there for quite some time and are very difficult. The rewards start to seem a little bit better now with the increased BTC price then what they were when first requested, but even then most of them are too difficult to be worth pursuing with the current rewards.
Yeah. I've also noticed some characters are much, much harder by orders of magnitude to find than others; for instance prefix 1Satoshi ..., of course the 1's are much harder, and others with what looks like a comparable prefix i.e. 1 CAP (6x LC) are either harder or easier. Not sure if I understand why.
Would anyone like to put small bounties on addresses such as:
1Bitcoin
1LoLcat
1LoLcats
1Miner
1BtcMinr
1[up to 7 valid chars]
?
With the increased price of bitcoin and the fees on the network, it doesn't seem as many people are interested in vanity addresses. There are still some in the pool but the reward to challenge ratio doesn't make them that appealing.
So that's why the reward is only just above 1.5 BTC for the prefix "qwertyuio"? Would have expected at least 0.5 BTC for prefixes of length >= 6 with difficulties well over 10,000,000,000.
Yeah, most of the requests that are currently in the pool have been there for quite some time and are very difficult. The rewards start to seem a little bit better now with the increased BTC price then what they were when first requested, but even then most of them are too difficult to be worth pursuing with the current rewards.
Are vanity addresses still a thing? Could I make a few Satoshi generating addresses? There are not many good bounties there and the amounts are a little low for the compute to try and find them.
Doesn't seem worth it, although if you already have the equipment...
I just generated 1hack...
Takes about a month for me to get to probability ~50% for generating interesting addresses like 1bitcoin[...] and 1satoshi[...]
Doesn't seem worth it, although if you already have the equipment...
I just generated 1hack...
Takes about a month for me to get to probability ~50% for generating interesting addresses like 1bitcoin[...] and 1satoshi[...]
You need to use OCLvanitygen and use a decent GPU to get better speeds if you are not already.
I figured that might be the case. I'm getting a not so great 12Mkey/sec.
With the increased price of bitcoin and the fees on the network, it doesn't seem as many people are interested in vanity addresses. There are still some in the pool but the reward to challenge ratio doesn't make them that appealing.
So that's why the reward is only just above 1.5 BTC for the prefix "qwertyuio"? Would have expected at least 0.5 BTC for prefixes of length >= 6 with difficulties well over 10,000,000,000.
Are vanity addresses still a thing? Could I make a few Satoshi generating addresses? There are not many good bounties there and the amounts are a little low for the compute to try and find them.
Doesn't seem worth it, although if you already have the equipment...
I just generated 1hack...
Takes about a month for me to get to probability ~50% for generating interesting addresses like 1bitcoin[...] and 1satoshi[...]
Doesn't seem worth it, although if you already have the equipment...
I just generated 1hack...
Takes about a month for me to get to probability ~50% for generating interesting addresses like 1bitcoin[...] and 1satoshi[...]
You need to use OCLvanitygen and use a decent GPU to get better speeds if you are not already.
With the increased price of bitcoin and the fees on the network, it doesn't seem as many people are interested in vanity addresses. There are still some in the pool but the reward to challenge ratio doesn't make them that appealing.
Are vanity addresses still a thing? Could I make a few Satoshi generating addresses? There are not many good bounties there and the amounts are a little low for the compute to try and find them.
Doesn't seem worth it, although if you already have the equipment...
I just generated 1hack...
Takes about a month for me to get to probability ~50% for generating interesting addresses like 1bitcoin[...] and 1satoshi[...]
Doesn't seem worth it, although if you already have the equipment...
I just generated 1hack...
Takes about a month for me to get to probability ~50% for generating interesting addresses like 1bitcoin[...] and 1satoshi[...]
what format data need
bits or bytes ?
bits or bytes ?
support for this formats address be add ? https://blockchain.info/ru/address/3AZRLnsQ1QhbTsWpb6ftGuShTQQX8GXd5v
i hv hardware rnd generator i can use it on vanitygen ? if i can how use it ? add rand bit's how seed ? Or what need do for vanity gen use my rnd bit's
my rng gen bit's entropy
Entropy = 7.999506 bits per byte.
Optimum compression would reduce the size
of this 333348 byte file by 0 percent.
Chi square distribution for 333348 samples is 227.67, and randomly
would exceed this value 89.00 percent of the times.
Arithmetic mean value of data bytes is 127.4296 (127.5 = random).
Monte Carlo value for Pi is 3.143309694 (error 0.05 percent).
Serial correlation coefficient is -0.001518 (totally uncorrelated = 0.0).
my rng gen bit's entropy
Entropy = 7.999506 bits per byte.
Optimum compression would reduce the size
of this 333348 byte file by 0 percent.
Chi square distribution for 333348 samples is 227.67, and randomly
would exceed this value 89.00 percent of the times.
Arithmetic mean value of data bytes is 127.4296 (127.5 = random).
Monte Carlo value for Pi is 3.143309694 (error 0.05 percent).
Serial correlation coefficient is -0.001518 (totally uncorrelated = 0.0).
Vanitygen includes the -s option which allows you to seed the random number generator from a file on the system. If your hardware random number generator can be accessed via a file, you should be able to use it like this.
how work -s , it pick all bits how one seed , or how it pick them ? How match it pick bit's for 1 generation , i dont understand this
here is example of hardware gen numbers output. It's generate random bit's. But how vanitygen use them?
Code:
€1 Я–‘}_яню Ou&Ц[ЇFЕZy=/ыУХ
чEJiT!Ї@§ббХ¬[хџМ¶в'6’ш_фУвэжaLюЦMМ0©l‹њ)¶ 4Nў8jљ–,ҐЛо—8Й»”ргBvз€fАc}РHЁё
bяd7НnДe§ h@Ш
ЃжЂ© §ґ±v њ№ђh іЁ=ЬT!k…¬ENАТs&ЛuЭБІгxґнcBчљвАяљ–Ю 0Џ$!AЫљ›©Uэg¶#H)r3шИРН'FUa і2ґ1bЯкАС¬E~ ЬGI[}ћ 3°Бы»РєKHї7:’›ЯКm0?2Ќ=нс7!аG5ДЮЛЧK‚-ҐtЦтЏ>Їє7 Љ@\ЉФјИбЌХ}”ч1©ц5R–M!QаlF¦щѕ[‹‚(Мez№,'С€ЃО‹‘z!ЦвН@Tущ„d`Ю‚ ‹Љ»ьЃЏ НЮгµЃ<
ЌG AЊK
¤·by`p®8ќ7™у@]љDїУШ05юc¶А¦О\%ЌQ
Ї2–> dLЮѓЙ™ќыЭ†O•џWi%@ИлАmДЙѓ7вU±с|1ЋЭ``aµ «‰І@#Ќ|Л.%ьРLPсцвўМ2K
К&”сY˜QA§ѓрS0ЋѕМщЧпt±Љ®^d\Nї©kмGEЌTЬдіqоЯї ъyЫXЃВ}¦Т«ЊД]R ‚†'ІЖ3
ЖЭ ТЖиzЯfИ˜1^ѕUЪµhS”ЃQА5њ жщ«°6ЛNЏў†мЄ$fшІXOє0U¤ЩќuС%“д9л‡К
is it possible if private key can found with this vanity address generator?!?
That is the whole purpose of the program. It will provide you with a private key for an address with the pattern you provide.
If you are asking if it can find a private key for an entire specific address, then the answer is yes but it would take so long that there is no way you would be successful.
i hv hardware rnd generator i can use it on vanitygen ? if i can how use it ? add rand bit's how seed ? Or what need do for vanity gen use my rnd bit's
my rng gen bit's entropy
Entropy = 7.999506 bits per byte.
Optimum compression would reduce the size
of this 333348 byte file by 0 percent.
Chi square distribution for 333348 samples is 227.67, and randomly
would exceed this value 89.00 percent of the times.
Arithmetic mean value of data bytes is 127.4296 (127.5 = random).
Monte Carlo value for Pi is 3.143309694 (error 0.05 percent).
Serial correlation coefficient is -0.001518 (totally uncorrelated = 0.0).
my rng gen bit's entropy
Entropy = 7.999506 bits per byte.
Optimum compression would reduce the size
of this 333348 byte file by 0 percent.
Chi square distribution for 333348 samples is 227.67, and randomly
would exceed this value 89.00 percent of the times.
Arithmetic mean value of data bytes is 127.4296 (127.5 = random).
Monte Carlo value for Pi is 3.143309694 (error 0.05 percent).
Serial correlation coefficient is -0.001518 (totally uncorrelated = 0.0).
Vanitygen includes the -s option which allows you to seed the random number generator from a file on the system. If your hardware random number generator can be accessed via a file, you should be able to use it like this.
is it possible if private key can found with this vanity address generator?!?
i hv hardware rnd generator i can use it on vanitygen ? if i can how use it ? add rand bit's how seed ? Or what need do for vanity gen use my rnd bit's
my rng gen bit's entropy
Entropy = 7.999506 bits per byte.
Optimum compression would reduce the size
of this 333348 byte file by 0 percent.
Chi square distribution for 333348 samples is 227.67, and randomly
would exceed this value 89.00 percent of the times.
Arithmetic mean value of data bytes is 127.4296 (127.5 = random).
Monte Carlo value for Pi is 3.143309694 (error 0.05 percent).
Serial correlation coefficient is -0.001518 (totally uncorrelated = 0.0).
my rng gen bit's entropy
Entropy = 7.999506 bits per byte.
Optimum compression would reduce the size
of this 333348 byte file by 0 percent.
Chi square distribution for 333348 samples is 227.67, and randomly
would exceed this value 89.00 percent of the times.
Arithmetic mean value of data bytes is 127.4296 (127.5 = random).
Monte Carlo value for Pi is 3.143309694 (error 0.05 percent).
Serial correlation coefficient is -0.001518 (totally uncorrelated = 0.0).
Jump to: