Topic: Vanity Pool - vanity address generator pool - page 5. (Read 147800 times)
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).
Quote
Good day!
I've seen this wallet address from the list of my referrals in a faucet, look at the last 3 character: 3GZLKxx7SgYkUXarSRNULxjxRQf4P3DAY3
I thought the addresses only starting in 1 can be generated for vanity address, isn't that a multi-sig address? If that is possible, how?
I've seen this wallet address from the list of my referrals in a faucet, look at the last 3 character: 3GZLKxx7SgYkUXarSRNULxjxRQf4P3DAY3
I thought the addresses only starting in 1 can be generated for vanity address, isn't that a multi-sig address? If that is possible, how?
afaik before you base58encode it, instead of 0x00 at the beginning, you start with a 0x05 (prefix/version number)
this results in a leading 3 address
e.g.
05.payload.checksum -> base58encode -> 3.....
00.payload.checksum -> base58encode -> 1.....
Can I just do that using the vanity miner?
Yes it is possible.
Here's the command to generate a vanity address with the "3Love" prefix:
./vanitygen -F script 3Love
When will this be live? Would like to get a vanity address asap.
It is already live and has been working for quite some time. You can use this to get a vanity address right now
When will this be live? Would like to get a vanity address asap.
mean INVEST... like if you've solved this problem, someone needs to be throwing money at you to buy hardware and further develop this proprietary software for a promise in sharing future profits. Maybe I'm wrong, but I see a big demand for this kind of service as Bitcoin awareness spreads.
The Vanity Pool sends payments with quite low fees due to the network requiring higher fees now. A recent payment used 44.444 sat/byte.
Any possibility in bumping up the fee a bit to make confirmations faster for these transactions?
Any possibility in bumping up the fee a bit to make confirmations faster for these transactions?
Is it possible to merge-mine vanity addresses?
Each user enters a pattern and a public key, for example:
User Alice sends pattern "1alice" and public key a1 (private key is A1).
User Bob sends pattern "1bob" and public key b1 (private key is B1).
User Charlie sends pattern "1charlie" and a public key c1 (private key is C1).
Now the miners begin hashing, combining all the public keys together, adding arbitrary keys, hashing and comparing each hash to all the provided patterns.
Assume they find a solution for Bob first:
Hash160(a1+b1+c1+x1)=1bob...
Now, Alice and Charlie publish their private keys A1 and C1, and the miner publishes X1 (the private key that generates x1).
Now, Bob combines A1, B1, C1, and X1 to create his private key, and no one else can do this because only Bob has B1.
Bob now has a vanity address which fits his pattern, and goes offline.
Now, Alice and Charlie generate new key pairs, and send the public keys:
Alice sends a2 (private key is A2).
Charlie sends c2 (private key is C2).
Now the pool continues hashing, combining the two keys, hashing, and comparing each hash to both provided patterns, until they find a hash that fits 1alice or 1charlie.
When this happens, the same thing happens again, one user (probably Charlie) publishes the private key, and the other gets control over the new address.
The main problem I see is that a user can refuse to publish the private key after an address is found for someone else, wasting all the mining effort.
Can this problem be overcome?
Each user enters a pattern and a public key, for example:
User Alice sends pattern "1alice" and public key a1 (private key is A1).
User Bob sends pattern "1bob" and public key b1 (private key is B1).
User Charlie sends pattern "1charlie" and a public key c1 (private key is C1).
Now the miners begin hashing, combining all the public keys together, adding arbitrary keys, hashing and comparing each hash to all the provided patterns.
Assume they find a solution for Bob first:
Hash160(a1+b1+c1+x1)=1bob...
Now, Alice and Charlie publish their private keys A1 and C1, and the miner publishes X1 (the private key that generates x1).
Now, Bob combines A1, B1, C1, and X1 to create his private key, and no one else can do this because only Bob has B1.
Bob now has a vanity address which fits his pattern, and goes offline.
Now, Alice and Charlie generate new key pairs, and send the public keys:
Alice sends a2 (private key is A2).
Charlie sends c2 (private key is C2).
Now the pool continues hashing, combining the two keys, hashing, and comparing each hash to both provided patterns, until they find a hash that fits 1alice or 1charlie.
When this happens, the same thing happens again, one user (probably Charlie) publishes the private key, and the other gets control over the new address.
The main problem I see is that a user can refuse to publish the private key after an address is found for someone else, wasting all the mining effort.
Can this problem be overcome?
I got a bunch of old GPUs that can't mine any of the current profitable coins such as ZEC or ETH.
Wondering if any of the work available at:
https://vanitypool.appspot.com/availableWork
Still will pay out if a solution is found. For example,
1qwertyuiop
Pays 1.2 BTC however the guy was looking for this vanity key since 2013.
EDIT: Nevermind, didn't know the results had to be case sentitive, in that case it would take millions of years to find a result.
Wondering if any of the work available at:
https://vanitypool.appspot.com/availableWork
Still will pay out if a solution is found. For example,
1qwertyuiop
Pays 1.2 BTC however the guy was looking for this vanity key since 2013.
EDIT: Nevermind, didn't know the results had to be case sentitive, in that case it would take millions of years to find a result.
Quote
An example (available from gobittest website):
We have a private key:
18E14A7B6A307F426A94F8114701E7C8E774E7F9A47E2C2035DB29A206321725
which maps to public key:
0450863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B23522CD470243453A 299FA9E77237716103ABC11A1DF38855ED6F2EE187E9C582BA6
and say we want to find a pattern "166". One of the solutions takes a form of a private key
B18427B169E86DE681A1A62588E1D02AE4A7E83C1B413849989A76282A7B562F
mapping to public key:
049C95E0949E397FACCECF0FE8EAD247E6FD082717E4A4A876049FB34A9ADED110DFEA2EF691CC4 A1410498F4C312F3A94318CD5B6F0E8E92051064876751C8404
If we add the two public keys (like the person looking for the solution would do), we get a public key:
0436970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461E100E705CCA98 54436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487
which is equivalent to this address:
166ev9JXn2rFqiPSQAwM7qJYpNL1JrNf3h
If we add the two private keys (like the person requesting the address would), we get:
CA65722CD418ED28EC369E36CFE3B7F3CC1CD035BFBF6469CE759FCA30AD6D54
which maps to the same public key as the sum of the public keys, and thus - to the same address.
We have a private key:
18E14A7B6A307F426A94F8114701E7C8E774E7F9A47E2C2035DB29A206321725
which maps to public key:
0450863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B23522CD470243453A 299FA9E77237716103ABC11A1DF38855ED6F2EE187E9C582BA6
and say we want to find a pattern "166". One of the solutions takes a form of a private key
B18427B169E86DE681A1A62588E1D02AE4A7E83C1B413849989A76282A7B562F
mapping to public key:
049C95E0949E397FACCECF0FE8EAD247E6FD082717E4A4A876049FB34A9ADED110DFEA2EF691CC4 A1410498F4C312F3A94318CD5B6F0E8E92051064876751C8404
If we add the two public keys (like the person looking for the solution would do), we get a public key:
0436970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461E100E705CCA98 54436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487
which is equivalent to this address:
166ev9JXn2rFqiPSQAwM7qJYpNL1JrNf3h
If we add the two private keys (like the person requesting the address would), we get:
CA65722CD418ED28EC369E36CFE3B7F3CC1CD035BFBF6469CE759FCA30AD6D54
which maps to the same public key as the sum of the public keys, and thus - to the same address.
If we add the two public keys (like the person looking for the solution would do), we get a public key:
0436970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461E100E705CCA98 54436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487
which is equivalent to this address:
166ev9JXn2rFqiPSQAwM7qJYpNL1JrNf3h
how?
0450863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B23522CD470243453A 299FA9E77237716103ABC11A1DF38855ED6F2EE187E9C582BA6
+
049C95E0949E397FACCECF0FE8EAD247E6FD082717E4A4A876049FB34A9ADED110DFEA2EF691CC4 A1410498F4C312F3A94318CD5B6F0E8E92051064876751C8404
=
0436970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461E100E705CCA98 54436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487
how to calculate it ? the last number 6+4=7? not 6+4=a?
Curve secp256k1:
base point : G = (79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B 16F81798, 483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8)
order curve: n = FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFBAAEDCE6AF48A03BBFD25E8CD0364141
First private key : a = 18E14A7B6A307F426A94F8114701E7C8E774E7F9A47E2C2035DB29A206321725
First public key :
A = a*G = (50863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B23522CD470243453A, 299FA9E77237716103ABC11A1DF38855ED6F2EE187E9C582BA6)
see for yourself here --> https://gobittest.appspot.com/Address
Second private key : b = B18427B169E86DE681A1A62588E1D02AE4A7E83C1B413849989A76282A7B562F
Second public key :
B =b*G=(36970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461E100E705CCA98, 54436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487)
If we add the two private keys : a+b = CA65722CD418ED28EC369E36CFE3B7F3CC1CD035BFBF6469CE759FCA30AD6D54
Code:
~$ python
Python 2.7.12+ (default, Sep 17 2016, 12:08:02)
[GCC 6.2.0 20160914] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> a=0x18E14A7B6A307F426A94F8114701E7C8E774E7F9A47E2C2035DB29A206321725
>>> b=0xB18427B169E86DE681A1A62588E1D02AE4A7E83C1B413849989A76282A7B562F
>>> n=0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 #order curve
>>> print hex((a+b) % n) # add mod 'n'
0xca65722cd418ed28ec369e36cfe3b7f3cc1cd035bfbf6469ce759fca30ad6d54
and if we add the two public keys: A+B = a*G + b*G = (a+b)*G
see for yourself here --> https://gobittest.appspot.com/Address
(a+b)*G = (36970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461, E100E705CCA9854436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487)
and the address is: 166ev9JXn2rFqiPSQAwM7qJYpNL1JrNf3h
ThePiachu,
I'm not sure how much you are actively maintaining this project, but any chance you could update the "Solved work" page to include a "Solved on Date" column or similar? I'd also like to see a "Requested on Date" column on the available work page if possible.
It would be nice to be able to look at dates to see if there are recent requests or solved work to monitor the recent activity of the pool.
I'm not sure how much you are actively maintaining this project, but any chance you could update the "Solved work" page to include a "Solved on Date" column or similar? I'd also like to see a "Requested on Date" column on the available work page if possible.
It would be nice to be able to look at dates to see if there are recent requests or solved work to monitor the recent activity of the pool.
Quote
Good day!
I've seen this wallet address from the list of my referrals in a faucet, look at the last 3 character: 3GZLKxx7SgYkUXarSRNULxjxRQf4P3DAY3
I thought the addresses only starting in 1 can be generated for vanity address, isn't that a multi-sig address? If that is possible, how?
I've seen this wallet address from the list of my referrals in a faucet, look at the last 3 character: 3GZLKxx7SgYkUXarSRNULxjxRQf4P3DAY3
I thought the addresses only starting in 1 can be generated for vanity address, isn't that a multi-sig address? If that is possible, how?
afaik before you base58encode it, instead of 0x00 at the beginning, you start with a 0x05 (prefix/version number)
this results in a leading 3 address
e.g.
05.payload.checksum -> base58encode -> 3.....
00.payload.checksum -> base58encode -> 1.....
Can I just do that using the vanity miner?
Quote
Good day!
I've seen this wallet address from the list of my referrals in a faucet, look at the last 3 character: 3GZLKxx7SgYkUXarSRNULxjxRQf4P3DAY3
I thought the addresses only starting in 1 can be generated for vanity address, isn't that a multi-sig address? If that is possible, how?
I've seen this wallet address from the list of my referrals in a faucet, look at the last 3 character: 3GZLKxx7SgYkUXarSRNULxjxRQf4P3DAY3
I thought the addresses only starting in 1 can be generated for vanity address, isn't that a multi-sig address? If that is possible, how?
afaik before you base58encode it, instead of 0x00 at the beginning, you start with a 0x05 (prefix/version number)
this results in a leading 3 address
e.g.
05.payload.checksum -> base58encode -> 3.....
00.payload.checksum -> base58encode -> 1.....
Good day!
I've seen this wallet address from the list of my referrals in a faucet, look at the last 3 character: 3GZLKxx7SgYkUXarSRNULxjxRQf4P3DAY3
I thought the addresses only starting in 1 can be generated for vanity address, isn't that a multi-sig address? If that is possible, how?
I've seen this wallet address from the list of my referrals in a faucet, look at the last 3 character: 3GZLKxx7SgYkUXarSRNULxjxRQf4P3DAY3
I thought the addresses only starting in 1 can be generated for vanity address, isn't that a multi-sig address? If that is possible, how?
Quote
An example (available from gobittest website):
We have a private key:
18E14A7B6A307F426A94F8114701E7C8E774E7F9A47E2C2035DB29A206321725
which maps to public key:
0450863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B23522CD470243453A 299FA9E77237716103ABC11A1DF38855ED6F2EE187E9C582BA6
and say we want to find a pattern "166". One of the solutions takes a form of a private key
B18427B169E86DE681A1A62588E1D02AE4A7E83C1B413849989A76282A7B562F
mapping to public key:
049C95E0949E397FACCECF0FE8EAD247E6FD082717E4A4A876049FB34A9ADED110DFEA2EF691CC4 A1410498F4C312F3A94318CD5B6F0E8E92051064876751C8404
If we add the two public keys (like the person looking for the solution would do), we get a public key:
0436970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461E100E705CCA98 54436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487
which is equivalent to this address:
166ev9JXn2rFqiPSQAwM7qJYpNL1JrNf3h
If we add the two private keys (like the person requesting the address would), we get:
CA65722CD418ED28EC369E36CFE3B7F3CC1CD035BFBF6469CE759FCA30AD6D54
which maps to the same public key as the sum of the public keys, and thus - to the same address.
We have a private key:
18E14A7B6A307F426A94F8114701E7C8E774E7F9A47E2C2035DB29A206321725
which maps to public key:
0450863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B23522CD470243453A 299FA9E77237716103ABC11A1DF38855ED6F2EE187E9C582BA6
and say we want to find a pattern "166". One of the solutions takes a form of a private key
B18427B169E86DE681A1A62588E1D02AE4A7E83C1B413849989A76282A7B562F
mapping to public key:
049C95E0949E397FACCECF0FE8EAD247E6FD082717E4A4A876049FB34A9ADED110DFEA2EF691CC4 A1410498F4C312F3A94318CD5B6F0E8E92051064876751C8404
If we add the two public keys (like the person looking for the solution would do), we get a public key:
0436970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461E100E705CCA98 54436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487
which is equivalent to this address:
166ev9JXn2rFqiPSQAwM7qJYpNL1JrNf3h
If we add the two private keys (like the person requesting the address would), we get:
CA65722CD418ED28EC369E36CFE3B7F3CC1CD035BFBF6469CE759FCA30AD6D54
which maps to the same public key as the sum of the public keys, and thus - to the same address.
If we add the two public keys (like the person looking for the solution would do), we get a public key:
0436970CE32E14DC06AC50217CDCF53E628B32810707080D6848D9C8D4BE9FE461E100E705CCA98 54436A1283210CCEFBB6B16CB9A86B009488922A8F302A27487
which is equivalent to this address:
166ev9JXn2rFqiPSQAwM7qJYpNL1JrNf3h
how?
No one helping?
how to calculate it ? the last number 6+4=7? not 6+4=a?
No one helping?Might have something to do with the fact we have lives and don't monitor ever thread all day.
Did you try multiplying the two values together?
Jump to: