... some code ...
The LBC project is currently running at 346.02 Mkeys/s and recently had a peak of about 521 Mkeys/s
How many keys per second does your method check?
Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 332. (Read 239754 times)
... some code ...
The LBC project is currently running at 346.02 Mkeys/s and recently had a peak of about 521 Mkeys/s
How many keys per second does your method check?
Addresses are all compressed in the puzzle?
***
in the general gemoro there full with jumps, who understands to supplement the code, but for now you can duplicate and run the sites ...
the heat went off http://meson.ad-l.ink/7Try5DcVV/image.png I have 20 scanners without problems for the PC to run at the same time, how many on amd ryzen interesting...
python exists for android... need to somehow gpu to steal, numba...
***
Quote
if you like to waste your time trying to find a pattern in random data
And you've been guessing for a few years now already all the methods have been tried all sorts, random programs generators... and without the slightest hint of luck. began to study "python" in pieces from Inet assembled a generator with a selectable range of randomization (until 1 step) and a hex output and a compressed key, It remains to teach how to compare the address lines generated with the puzzle addresses next or in the file and stop work.***
in the general gemoro there full with jumps, who understands to supplement the code, but for now you can duplicate and run the sites ...
Quote
from bitcoin import *
import random
while True:
ran = random.randrange(36028797018963968,72057594037927936)
myhex = "%064x" % ran
myhex = myhex[:64]
priv = myhex
pub = privtopub(priv)
pubkey1 = encode_pubkey(privtopub(priv), "bin_compressed")
addr = pubtoaddr(pubkey1)
n = addr
if n.strip() == "17aPYR1m6pVAacXg1PTDDU7XafvK1dxvhi":
print ("found!!!",addr,myhex)
s1 = myhex
s2 = addr
f=open(u"C:/a.txt","a")
f.write(s1)
f.write(s2)
f.close()
break
else:
print ("searching...",addr,myhex)
import random
while True:
ran = random.randrange(36028797018963968,72057594037927936)
myhex = "%064x" % ran
myhex = myhex[:64]
priv = myhex
pub = privtopub(priv)
pubkey1 = encode_pubkey(privtopub(priv), "bin_compressed")
addr = pubtoaddr(pubkey1)
n = addr
if n.strip() == "17aPYR1m6pVAacXg1PTDDU7XafvK1dxvhi":
print ("found!!!",addr,myhex)
s1 = myhex
s2 = addr
f=open(u"C:/a.txt","a")
f.write(s1)
f.write(s2)
f.close()
break
else:
print ("searching...",addr,myhex)
the heat went off http://meson.ad-l.ink/7Try5DcVV/image.png I have 20 scanners without problems for the PC to run at the same time, how many on amd ryzen interesting...
Quote
from bitcoin import *
import random
a = int (input("start scan range:"))
b = int (input("end scan range:"))
c = input ("address:")
while True:
ran = random.randrange(a,b)
myhex = "%064x" % ran
myhex = myhex[:64]
priv = myhex
pub = privtopub(priv)
pubkey1 = encode_pubkey(privtopub(priv), "bin_compressed")
addr = pubtoaddr(pubkey1)
n = addr
if n.strip() == c:
print ("found!!!",addr,myhex)
s1 = myhex
s2 = addr
f=open(u"C:/a.txt","a")
f.write(s1)
f.write(s2)
f.close()
break
else:
print ("searching...",addr,myhex)
import random
a = int (input("start scan range:"))
b = int (input("end scan range:"))
c = input ("address:")
while True:
ran = random.randrange(a,b)
myhex = "%064x" % ran
myhex = myhex[:64]
priv = myhex
pub = privtopub(priv)
pubkey1 = encode_pubkey(privtopub(priv), "bin_compressed")
addr = pubtoaddr(pubkey1)
n = addr
if n.strip() == c:
print ("found!!!",addr,myhex)
s1 = myhex
s2 = addr
f=open(u"C:/a.txt","a")
f.write(s1)
f.write(s2)
f.close()
break
else:
print ("searching...",addr,myhex)
python exists for android... need to somehow gpu to steal, numba...
***
Quote
Key one has a random one bit key, key two has a random two bit key, key three has a random three bit key, etc.
deterministic random? most likely generated by time in windows. After considering a bunch of pvks found by the bots I noticed that many addresses were on the same transaction, after a tight check I saw what kind of pattern the sequence was. One thing I noticed perhaps this transaction was made by the Bitcoin developers. Some GPU bots would be best to violate it, as shorena has said. Is anyone out there?
Yes, ALL the Bitcoins in the puzzle transaction were placed there in a single transaction. The author of the puzzle transaction came into this thread and explained the whole thing. Yes, there is a well defined pattern to the puzzle transaction. All the private keys are random but each key uses an increasing bit length. Key one has a random one bit key, key two has a random two bit key, key three has a random three bit key, etc. All of this work trying to find out a pattern to the random private keys is a complete and total waste of time. "Fun" maybe, if you like to waste your time trying to find a pattern in random data. If you bothered to read the thread you would know all this and would not have to guess.
After considering a bunch of pvks found by the bots I noticed that many addresses were on the same transaction, after a tight check I saw what kind of pattern the sequence was. One thing I noticed perhaps this transaction was made by the Bitcoin developers. Some GPU bots would be best to violate it, as shorena has said. Is anyone out there?
Maybe if we learn a bit more from how the numbers were generated it could greatly optimize the program. 
We know exactly how the numbers were generated because the author of the puzzle came into this thread and told us.
Read back and find it if you are interested.
Where is the fun in knowing something? Isn't it much more interesting to throw around half-baked theories and draw maps where X marks the hidden treasure chest?
Maybe if we learn a bit more from how the numbers were generated it could greatly optimize the program.
We know exactly how the numbers were generated because the author of the puzzle came into this thread and told us.
Read back and find it if you are interested.
I am incompetent to solve a problem like this, I know its trading at Bittrex and Binance.
but hopefully at the end ny code like this can be solved and I will congratulate the person who broke the code. yuhuuu
but hopefully at the end ny code like this can be solved and I will congratulate the person who broke the code. yuhuuu
fast ... last 55 as I understand the author of the puzzle specially flashed the public key (threw some bitcoin and deducing). to see how it works baby step gigant step.
they all lie side by side (in its macrocosm)), The scanner would be with a random (127,7-16 signs randomisation) and a step up-down for a couple million.
56 49 42
127,************************* 127 127,27325883491766944644041359425 127,34166804622509516775608062744
63,583036446150909604124734642028 63,5 63,660348182749885381781496107578 63,668431836413219571113586425781
31,861576626618332619411688710898 31,75 31,787429311634468831471167504787 31,771796089393319562077522277832
15,90613502904471082688431238239 15,875 15,908679856821891007712110877037 15,926393464003922417759895324707
7,941484368221046585833988729064 7,9375 7,9644791460323176579549908638 7,966582541557727381587028503418
35
127,414638392627239227294921875 127
63,588673464953899383544921875
31,7922732196748256683349609375
15,90996809303760528564453125
7,938812442123889923095703125
28
127,151996135711669921875 127
63,58295440673828125
31,7968273162841796875
15,876374721527099609375
7,9462490081787109375
21
127,1361083984375 127
63,58837890625
31,82952880859375
15,9052734375
7,954345703125
14
127,359375 127
7
127,40625
you can try to search 7,9 she meets frequently for the next step 576460752303423488 - (((((((((7,94910898 * 128) * 128) * 128) * 128)* 128) * 128) * 128)* 128) - 571957152676052992) * 128)
next step 576460752303423488 * 128 = 73786976294838206464 - 576460752303423488 = 73210515542534782976 formula 73786976294838206464 - ((((((((((7,94910898 * 128) * 128) * 128) * 128)* 128) * 128) * 128)* 128) * 128) - 73210515542534782976) * 128)
if you look at the beginning
0 1 2
1 3 4
2 7 8
3 8 16
4 21 32
5 49 64
6 76 128
7 224 256
8 467 512
9 514 1024 < 1018,15625
10 1155 2048
11 2683 4096
12 5216 8192
13 10544 16384
14 26867 32768
15 51510 65536
16 95823 131072 < 130324 < 748
17 198669 262144
18 357535 524288
19 863317 1048576
20 1811764 2097152
21 3007503 4194304
22 5598802 8388608
23 14428676 16777216 < 16664492 112724 (16777216-112724=16664492/128/128/128)
24 33185509 33554432
25 54538862 67108864
26 111949941 134217728
27 227634408 268435456
You can try to print the number first example take the second step 7,954345703125 * 128 = < 1018,15625 * 128 = < 130324 ; 131072-130324= < 748 a prime number to find 131072-748=130324/128/128 = 7,954345703125 formula 131072 - ((((((((7,954345703125 * 128) * 128) - 130048) * 128) = 95744 slightly askew because 95823/128=748,6171875 ; 131072 - 748,6171875 = 130323,3828125/128/128= 7,954308032989501953125 with this value 131072 - ((((((((7,954308032989501953125 * 128) * 128) - 130048) * 128) = 95823 here you can try 749
take the previous step 7,9462490081787109375 * 128 = 1017,119873046875 * 128 = < 130191,34375 on the second multiplication, the tail does not disappear * 128 = < 16664492 (etc with each puzzle...)
you can take a number from the first step or from the second (any) and choose a number for the formula, for example last thing 7,941484368221046585833988729064*128*128=130113,27988893362726230407133698 on the idea should be enough for the first 8 characters (meaning scanning). 131072 - 130113 = 959 and let's go 959,2 959,3 959,4.. 959,23 959,28... 959,50 959,59.. or 959,random... 960...
or all can be much simpler to take the number and multiply by 128, 749*128=95872 (95823), (880,656494140625) 881 * 128* 128 = 14434304 (14428676)... (958,72011106637273769592866301537) 959*128*128*128*128*128*128=4217726604148736 (4216495639600700)... what number to multiply 7 times to get 56.
or the program that the whole numbers searched for and multiplied by the comparator compared with the key.
they all lie side by side (in its macrocosm)), The scanner would be with a random (127,7-16 signs randomisation) and a step up-down for a couple million.
56 49 42
127,************************* 127 127,27325883491766944644041359425 127,34166804622509516775608062744
63,583036446150909604124734642028 63,5 63,660348182749885381781496107578 63,668431836413219571113586425781
31,861576626618332619411688710898 31,75 31,787429311634468831471167504787 31,771796089393319562077522277832
15,90613502904471082688431238239 15,875 15,908679856821891007712110877037 15,926393464003922417759895324707
7,941484368221046585833988729064 7,9375 7,9644791460323176579549908638 7,966582541557727381587028503418
35
127,414638392627239227294921875 127
63,588673464953899383544921875
31,7922732196748256683349609375
15,90996809303760528564453125
7,938812442123889923095703125
28
127,151996135711669921875 127
63,58295440673828125
31,7968273162841796875
15,876374721527099609375
7,9462490081787109375
21
127,1361083984375 127
63,58837890625
31,82952880859375
15,9052734375
7,954345703125
14
127,359375 127
7
127,40625
you can try to search 7,9 she meets frequently for the next step 576460752303423488 - (((((((((7,94910898 * 128) * 128) * 128) * 128)* 128) * 128) * 128)* 128) - 571957152676052992) * 128)
next step 576460752303423488 * 128 = 73786976294838206464 - 576460752303423488 = 73210515542534782976 formula 73786976294838206464 - ((((((((((7,94910898 * 128) * 128) * 128) * 128)* 128) * 128) * 128)* 128) * 128) - 73210515542534782976) * 128)
if you look at the beginning
0 1 2
1 3 4
2 7 8
3 8 16
4 21 32
5 49 64
6 76 128
7 224 256
8 467 512
9 514 1024 < 1018,15625
10 1155 2048
11 2683 4096
12 5216 8192
13 10544 16384
14 26867 32768
15 51510 65536
16 95823 131072 < 130324 < 748
17 198669 262144
18 357535 524288
19 863317 1048576
20 1811764 2097152
21 3007503 4194304
22 5598802 8388608
23 14428676 16777216 < 16664492 112724 (16777216-112724=16664492/128/128/128)
24 33185509 33554432
25 54538862 67108864
26 111949941 134217728
27 227634408 268435456
You can try to print the number first example take the second step 7,954345703125 * 128 = < 1018,15625 * 128 = < 130324 ; 131072-130324= < 748 a prime number to find 131072-748=130324/128/128 = 7,954345703125 formula 131072 - ((((((((7,954345703125 * 128) * 128) - 130048) * 128) = 95744 slightly askew because 95823/128=748,6171875 ; 131072 - 748,6171875 = 130323,3828125/128/128= 7,954308032989501953125 with this value 131072 - ((((((((7,954308032989501953125 * 128) * 128) - 130048) * 128) = 95823 here you can try 749
take the previous step 7,9462490081787109375 * 128 = 1017,119873046875 * 128 = < 130191,34375 on the second multiplication, the tail does not disappear * 128 = < 16664492 (etc with each puzzle...)
you can take a number from the first step or from the second (any) and choose a number for the formula, for example last thing 7,941484368221046585833988729064*128*128=130113,27988893362726230407133698 on the idea should be enough for the first 8 characters (meaning scanning). 131072 - 130113 = 959 and let's go 959,2 959,3 959,4.. 959,23 959,28... 959,50 959,59.. or 959,random... 960...
or all can be much simpler to take the number and multiply by 128, 749*128=95872 (95823), (880,656494140625) 881 * 128* 128 = 14434304 (14428676)... (958,72011106637273769592866301537) 959*128*128*128*128*128*128=4217726604148736 (4216495639600700)... what number to multiply 7 times to get 56.
or the program that the whole numbers searched for and multiplied by the comparator compared with the key.
Nice attempt DannyHamilton! There must be a way to make it much more efficient as the last three addresses were found so fast it couldn't have been by brute forcing.
Maybe if we learn a bit more from how the numbers were generated it could greatly optimize the program.
Maybe if we learn a bit more from how the numbers were generated it could greatly optimize the program.
As here more precisely... formula 36028797018963968 - (36028797018963968:128) = 35747322042253312 ; 36028797018963968-(30045390491869460:128) = 35794067405746237,84375 all this is divided further into 128
71681994167562459 71494644084506624
35794067405746237,84375 35747322042253312
17936473077884353,46875 17873661021126656
8954357973713819,15625 8936830510563328
4470658255186115,53125 4468415255281664
127,332801540126 127
63,583036446150909604124734642028 63,5
31,861576626618332619411688710898 31,75
15,90613502904471082688431238239 15,875
7,941484368221046585833988729064 7,9375
63,5:128... etc left column like always more...
0,00388080056434026547876737882337 0,003875732421875
127:128:128 = 0,00775146484375 means left 0,00776... 0,00776x128=0,993...
36028797018963968 - ((((((((63,583036446150909604124734642028 * 128) * 128) * 128) * 128) * 128) * 128) * 128) - 35747322042253312) * 128)
72057594037927936 - ((((((((127,16607289230181920824946928406 * 128) * 128) * 128) * 128) * 128) * 128) * 128) - 71494644084506624) * 128)
formula 360... 56 presumably begins 0,993 (+ 6 some numbers = 1000000 combinations for scanning)
72057594037927936 - (((((((((0,993123456 * 128) * 128) * 128) * 128) * 128) * 128) * 128) * 128) - 71494644084506624) * 128)
substitute the formula in https://qalculate.github.io/downloads.html generate 1000000 digits of 6 digits add after 0,993 you do not need to sort everything out, you can start at 0,993623456 or 0,993723456
6 digits are taken from the least error compensated by scanning, you can take 127,1660728 but there are already 7 digits so that the more the better, but the error grows in case of wrong.
in the next step, the left side can is starting to become less, who knows... 127x2 = 254x2 = 508
Can there is a variant of search of a key as the whole number (in any python or something like that).
***
Although this can be done with the formula 358))
(((180143985 - 178575943) * 100000000) + 77925431597630) * 128
(((360287970 - 358123456) * 100000000) + 234729613217730) * 128
***
If collisions located 0 - 2^160 (and addresses themselves in the area +- 2^250-255) then where is the collision puzzle?
71681994167562459 71494644084506624
35794067405746237,84375 35747322042253312
17936473077884353,46875 17873661021126656
8954357973713819,15625 8936830510563328
4470658255186115,53125 4468415255281664
127,332801540126 127
63,583036446150909604124734642028 63,5
31,861576626618332619411688710898 31,75
15,90613502904471082688431238239 15,875
7,941484368221046585833988729064 7,9375
63,5:128... etc left column like always more...
0,00388080056434026547876737882337 0,003875732421875
127:128:128 = 0,00775146484375 means left 0,00776... 0,00776x128=0,993...
36028797018963968 - ((((((((63,583036446150909604124734642028 * 128) * 128) * 128) * 128) * 128) * 128) * 128) - 35747322042253312) * 128)
72057594037927936 - ((((((((127,16607289230181920824946928406 * 128) * 128) * 128) * 128) * 128) * 128) * 128) - 71494644084506624) * 128)
formula 360... 56 presumably begins 0,993 (+ 6 some numbers = 1000000 combinations for scanning)
72057594037927936 - (((((((((0,993123456 * 128) * 128) * 128) * 128) * 128) * 128) * 128) * 128) - 71494644084506624) * 128)
substitute the formula in https://qalculate.github.io/downloads.html generate 1000000 digits of 6 digits add after 0,993 you do not need to sort everything out, you can start at 0,993623456 or 0,993723456
6 digits are taken from the least error compensated by scanning, you can take 127,1660728 but there are already 7 digits so that the more the better, but the error grows in case of wrong.
in the next step, the left side can is starting to become less, who knows... 127x2 = 254x2 = 508
Can there is a variant of search of a key as the whole number (in any python or something like that).
***
Although this can be done with the formula 358))
(((180143985 - 178575943) * 100000000) + 77925431597630) * 128
(((360287970 - 358123456) * 100000000) + 234729613217730) * 128
***
If collisions located 0 - 2^160 (and addresses themselves in the area +- 2^250-255) then where is the collision puzzle?
Not checked if you are right with p1-55
but half of 2^55 is still a job for gf1080 GPU for several years
Try to narrow range a bit more, please
but half of 2^55 is still a job for gf1080 GPU for several years
Try to narrow range a bit more, please
Hey buddy,
we search for an partner, maybe you are interested ? I tried send you a PN but it was not possible.
Best Regards
I don't understand the pattern. What does the last column mean?
I have seen some of these before and I have to ask, how do you solve things like this. Is there a method or general way to go about looking at this. All this is to me is numbers and letters. None of it makes sense to me, but I would like it to make sense.
Hi bro, I agree with you because it has no common with us. You are doing what you need and time doing what I need. We don't need to look about sex numbers and think about it anything.
Not checked if you are right with p1-55
but half of 2^55 is still a job for gf1080 GPU for several years
Try to narrow range a bit more, please
but half of 2^55 is still a job for gf1080 GPU for several years
Try to narrow range a bit more, please
Thank you.
Yes, I mean to install this: https://github.com/ndv/vanitygen
I found this "pattern" in my old spec computer, with a little formula:
1 0 0,00
3 0 1,33
7 0 2,43
8 0 3,00
21 0 4,24
49 0 5,35
76 1 6,16
224 2 7,43
467 4 8,45
514 4 9,00
1155 9 10,11
2683 21 11,24
5216 41 12,21
10544 82 13,22
26867 210 14,39
51510 402 15,36
95823 749 16,32
198669 1555 17,34
357535 2793 18,27
863317 6745 19,39
1811764 14154 20,42
3007503 23496 21,30
5598802 43741 22,25
14428676 112724 23,42
33185509 259262 24,49
54538862 426085 25,38
111949941 874609 26,40
227634408 1778394 27,41
400708894 3130538 28,33
1033162084 8071579 29,48
2102388551 16424911 30,49
3093472814 24167756 31,31
7137437912 55761234 32,40
14133072157 110414626 33,39
20112871792 157131811 34,15
42387769980 331154453 35,19
100251560595 783215317 36,31
146971536592 1148215130 37,06
323724968937 2529101320 38,15
1003651412950 7841026664 39,45
1458252205147 11392595353 40,25
2895374552463 22620113691 41,24
7409811047825 57889148811 42,41
15404761757071 120349701227 43,43
19996463086597 156222367864 44,12
51408670348612 401630237099 45,32
119666659114170 934895774329 46,41
191206974700443 1493804489847 47,26
409118905032525 3196241445567 48,31
611140496167764 4774535126311 49,08
2058769515153870 16084136837140 50,45
4216495639600700 32941372184381 51,47
6763683971478120 52841281027173 52,33
9974455244496710 77925431597631 53,10
30045390491869400 234729613217730 54,40
So the next code = between 55,00 and 55,49
I've never done a scan / search since I do not know what program I should install for that process. I found post puzzle 32 btc by accident 2 months ago, but I'm sure this is not a coincidence!
2 months I try to find the appropriate pattern, from dozens of patterns that I found there are only a few that do not deviate from no 1-55
Yes, I mean to install this: https://github.com/ndv/vanitygen
I found this "pattern" in my old spec computer, with a little formula:
1 0 0,00
3 0 1,33
7 0 2,43
8 0 3,00
21 0 4,24
49 0 5,35
76 1 6,16
224 2 7,43
467 4 8,45
514 4 9,00
1155 9 10,11
2683 21 11,24
5216 41 12,21
10544 82 13,22
26867 210 14,39
51510 402 15,36
95823 749 16,32
198669 1555 17,34
357535 2793 18,27
863317 6745 19,39
1811764 14154 20,42
3007503 23496 21,30
5598802 43741 22,25
14428676 112724 23,42
33185509 259262 24,49
54538862 426085 25,38
111949941 874609 26,40
227634408 1778394 27,41
400708894 3130538 28,33
1033162084 8071579 29,48
2102388551 16424911 30,49
3093472814 24167756 31,31
7137437912 55761234 32,40
14133072157 110414626 33,39
20112871792 157131811 34,15
42387769980 331154453 35,19
100251560595 783215317 36,31
146971536592 1148215130 37,06
323724968937 2529101320 38,15
1003651412950 7841026664 39,45
1458252205147 11392595353 40,25
2895374552463 22620113691 41,24
7409811047825 57889148811 42,41
15404761757071 120349701227 43,43
19996463086597 156222367864 44,12
51408670348612 401630237099 45,32
119666659114170 934895774329 46,41
191206974700443 1493804489847 47,26
409118905032525 3196241445567 48,31
611140496167764 4774535126311 49,08
2058769515153870 16084136837140 50,45
4216495639600700 32941372184381 51,47
6763683971478120 52841281027173 52,33
9974455244496710 77925431597631 53,10
30045390491869400 234729613217730 54,40
So the next code = between 55,00 and 55,49
I've never done a scan / search since I do not know what program I should install for that process. I found post puzzle 32 btc by accident 2 months ago, but I'm sure this is not a coincidence!
2 months I try to find the appropriate pattern, from dozens of patterns that I found there are only a few that do not deviate from no 1-55
If I install vanitygen, what should computer hardware spec ?
Please someone explain me step by step.
Thank you.
Please someone explain me step by step.
Thank you.
1) Are you trying to use vanitygen to solve this puzzle? If so you are using the wrong tool - unless you plan to modify the code to make a program to work on this puzzle.
2) If you just want to install vanitygen for the heck of it and need information about vanitygen I suggest you ask in the vanitygen thread. This thread is about the BTC puzzle transaction.
3) Maybe you meant LBC instead of vanitygen? You can ask about LBC in the LBC thread - not here.
Maybe he meant ndv/vanitygen.
Formula 358 doesn't seem relevant. It's obvious that if you substract n/128 (or something smaller) from n, the result will be close to n.
This is not a pattern.
Vanitygen should work on any hardware. Your hashrate will depend on the computing power.
This is not a pattern.
Vanitygen should work on any hardware. Your hashrate will depend on the computing power.
If I install vanitygen, what should computer hardware spec ?
Please someone explain me step by step.
Thank you.
Please someone explain me step by step.
Thank you.
1) Are you trying to use vanitygen to solve this puzzle? If so you are using the wrong tool - unless you plan to modify the code to make a program to work on this puzzle.
2) If you just want to install vanitygen for the heck of it and need information about vanitygen I suggest you ask in the vanitygen thread. This thread is about the BTC puzzle transaction.
3) Maybe you meant LBC instead of vanitygen? You can ask about LBC in the LBC thread - not here.
If I install vanitygen, what should computer hardware spec ?
Please someone explain me step by step.
Thank you.
Please someone explain me step by step.
Thank you.
So....
You are trying to find a pattern in random data, right?
You are trying to find a pattern in random data, right?
Jump to: