Pages:
Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 18. (Read 190722 times)

newbie
Activity: 4
Merit: 0
Hi guys, im new here, now i use rotor-cuda i have RTX 3050 (650Mk/s) and i trying puzzle #67 because I'll have a head start when puzzle #66 is solved, is this a good approach or im dumb ? sorry for my english

does not change anything. When pubkey is known puz67 is cracked also within seconds. In my example with a GPU very similar to yours --> 63 seconds

Cheers!
citb0in

so if i solve #66 i can solve #67 but why ?

Already answered by many posters, just start reading 20 pages back
i know what is double spend but i dont know if you send transaction you leak publickey so now make sence   Cry
member
Activity: 316
Merit: 34
Hi guys, im new here, now i use rotor-cuda i have RTX 3050 (650Mk/s) and i trying puzzle #67 because I'll have a head start when puzzle #66 is solved, is this a good approach or im dumb ? sorry for my english

does not change anything. When pubkey is known puz67 is cracked also within seconds. In my example with a GPU very similar to yours --> 63 seconds

Cheers!
citb0in

so if i solve #66 i can solve #67 but why ?

Already answered by many posters, just start reading 20 pages back
newbie
Activity: 4
Merit: 0
Hi guys, im new here, now i use rotor-cuda i have RTX 3050 (650Mk/s) and i trying puzzle #67 because I'll have a head start when puzzle #66 is solved, is this a good approach or im dumb ? sorry for my english

does not change anything. When pubkey is known puz67 is cracked also within seconds. In my example with a GPU very similar to yours --> 63 seconds

Cheers!
citb0in

so if i solve #66 i can solve #67 but why ?
hero member
Activity: 630
Merit: 731
Bitcoin g33k
Hi guys, im new here, now i use rotor-cuda i have RTX 3050 (650Mk/s) and i trying puzzle #67 because I'll have a head start when puzzle #66 is solved, is this a good approach or im dumb ? sorry for my english

does not change anything. When pubkey is known puz67 is cracked also within seconds. In my example with a GPU very similar to yours --> 63 seconds

Cheers!
citb0in
newbie
Activity: 4
Merit: 0
Hi guys, im new here, now i use rotor-cuda i have RTX 3050 (650Mk/s) and i trying puzzle #67 because I'll have a head start when puzzle #66 is solved, is this a good approach or im dumb ? sorry for my english
newbie
Activity: 9
Merit: 0
I had previously written a web application that works using JavaScript and PHP. Actually, it is client side. You can use it


https://latoon.ir/btcgen.php


This version is also for block 66

https://latoon.ir/btcgenl.php
member
Activity: 260
Merit: 19
the right steps towerds the goal

In Sequence Some Sample Founds :
FOUND!!!
PrivateKey= 00000000000000000000000000000000000000000000000000000000002de40f
Address =1CfZWK1QTQE3eS9qn61dQjV89KDjZzfNcv
Minikey = S11111111111111144Xkpy
 FOUND!!!
PrivateKey= 0000000000000000000000000000000000000000000000000000000001fa5ee5
Address =15JhYXn6Mx3oF4Y7PcTAv2wVVAuCFFQNiP
Minikey = S1111111111111122378PV
 FOUND!!!
PrivateKey= 0000000000000000000000000000000000000000000000000000000006ac3875
Address =128z5d7nN7PkCuX5qoA4Ys6pmxUYnEy86k
Minikey = S1111111111111128JJjjq
 FOUND!!!
PrivateKey= 00000000000000000000000000000000000000000000000000000000001ba534
Address =14oFNXucftsHiUMY8uctg6N487riuyXs4h
Minikey = S111111111111113345mux
 FOUND!!!
PrivateKey= 00000000000000000000000000000000000000000000000000000000002de40f
Address =1CfZWK1QTQE3eS9qn61dQjV89KDjZzfNcv
Minikey = S1111111111111137WWbfk


If someone has already tried something like this, please let me know so we can avoid wasting time.
jr. member
Activity: 39
Merit: 12
Then I just got the fork coins (only BCH, BSV, eCash, BTG, BCD and CDY)  Wink

Good to know that even after 12 minutes the fork coins were intact. So probably the situation is not that bad as we are anticipating


During that time the puzzles had like 0.0064 bitcoin it and on top of that BTC was very low. Why would it create a world wide bot race and why would someone waste hundreds or thousands of dollars in fees to withdraw it?
It only became an issue once the creator increased the puzzle prize and since then, no lower end puzzle have been solved.

I suggest to take whatever time/scripts/motivation you have and try to solve puzzle #80 on wards instead where you will be guaranteed the prize.
Or, ask someone with knowledge about timings which is the lowest feasible puzzle to be solved that will leave enough time to withdraw without a bot snatchingup. I don't know this answer, could be even puzzle #70?  

If someone can answer that, that would be great.


Hello again   Cheesy

Puzzle #64 was solved on 09/09/2022. It's prize was 0.64 BTC and that day BTC price was US$21.268, so the prize in BTC was like US$13.611

Any puzzle below #80 or #90, I think, can be snatching up by a bot.



64 was solved before the 10x so the values of the fork coins were not as tempting as they are now.


Then I just got the fork coins (only BCH, BSV, eCash, BTG, BCD and CDY)  Wink

Good to know that even after 12 minutes the fork coins were intact. So probably the situation is not that bad as we are anticipating


That day I got like US$165 between BCH, BSV, XEC (eCash) and BTG. It was cool to get that here in a latinamerican country  Grin

And, even today, fork coins weren't updated with 10x, so the prize is still the same for the fork coins (ie 0.66 BCH for puzzle #66 and so on)
newbie
Activity: 6
Merit: 0
Then I just got the fork coins (only BCH, BSV, eCash, BTG, BCD and CDY)  Wink

Good to know that even after 12 minutes the fork coins were intact. So probably the situation is not that bad as we are anticipating


During that time the puzzles had like 0.0064 bitcoin it and on top of that BTC was very low. Why would it create a world wide bot race and why would someone waste hundreds or thousands of dollars in fees to withdraw it?
It only became an issue once the creator increased the puzzle prize and since then, no lower end puzzle have been solved.

I suggest to take whatever time/scripts/motivation you have and try to solve puzzle #80 on wards instead where you will be guaranteed the prize.
Or, ask someone with knowledge about timings which is the lowest feasible puzzle to be solved that will leave enough time to withdraw without a bot snatchingup. I don't know this answer, could be even puzzle #70?  

If someone can answer that, that would be great.
newbie
Activity: 19
Merit: 5
I’m seeing so many variations of software throughout this thread and the other one. If I wanted to randomly let my pc waste electricity on weekends doing a random search for #66, what would be my best bet?

I have a 3070 and can switch to my Ubuntu partition if that’s better. I know my chances are probably like 0.001%, but I just want to feel like I’m joining the big boys on the hunt.

Your best option would be some implementation of KeyHunt-CUDA / Rotor-CUDA. Or BitCrack if you want to mess with the stride option.

In terms of raw performance BitCrack lacks tho.
full member
Activity: 1078
Merit: 219
Shooters Shoot...
Total number of addresses that start with the same 11 characters = 2^66 / 58^(11 * log2(58))

First, calculate 58^(11 * log2(58)):

58^(11 * log2(58)) ≈ 58^42.614 ≈ 1.2107 × 10^74 (approximately)

Then, divide 2^66 by this result:

2^66 / 1.2107 × 10^74 ≈ 460708775.52

So, the approximate number of addresses that start with the same 11 characters from a key length of 2^66 bits is about 460,708,775.
This made me laugh out loud.

Where did 10^74 come from?

You realize 10^74 is larger than 2^66, correct? Not by a little but a lot.

Thanks for the laugh though! I appreciate it.
newbie
Activity: 12
Merit: 0
Total number of addresses that start with the same 11 characters = 2^66 / 58^(11 * log2(58))

First, calculate 58^(11 * log2(58)):

58^(11 * log2(58)) ≈ 58^42.614 ≈ 1.2107 × 10^74 (approximately)

Then, divide 2^66 by this result:

2^66 / 1.2107 × 10^74 ≈ 460708775.52

So, the approximate number of addresses that start with the same 11 characters from a key length of 2^66 bits is about 460,708,775.
jr. member
Activity: 74
Merit: 2
64 was solved before the 10x so the values of the fork coins were not as tempting as they are now.


Then I just got the fork coins (only BCH, BSV, eCash, BTG, BCD and CDY)  Wink

Good to know that even after 12 minutes the fork coins were intact. So probably the situation is not that bad as we are anticipating

newbie
Activity: 4
Merit: 0
I’m seeing so many variations of software throughout this thread and the other one. If I wanted to randomly let my pc waste electricity on weekends doing a random search for #66, what would be my best bet?

I have a 3070 and can switch to my Ubuntu partition if that’s better. I know my chances are probably like 0.001%, but I just want to feel like I’m joining the big boys on the hunt.
jr. member
Activity: 31
Merit: 52
Then I just got the fork coins (only BCH, BSV, eCash, BTG, BCD and CDY)  Wink

Good to know that even after 12 minutes the fork coins were intact. So probably the situation is not that bad as we are anticipating
hero member
Activity: 862
Merit: 662
i assume any wallet program will just refuse to send a TX due to invalid signature.

Yes that is correct, even if you broadcast it manually the network nodes will not accept your transaction.
jr. member
Activity: 39
Merit: 12
How was the Funds from Puzzle 64 transferred. There mist been a tug of war between the bots fighting each other during that time also. So how was it managed? Does someone know the story of that time. Same must have been for the Forks coin transfer of that puzzle as well. Another Tx another bot war ?

Hello there  Cheesy

I don't remember if there was a bot war for BTC in puzzle #64, but I got the privkey like 12 minutes after the pubkey was exposed (but only with CPU, I don't have GPU  Grin )

Then I just got the fork coins (only BCH, BSV, eCash, BTG, BCD and CDY)  Wink
full member
Activity: 1078
Merit: 219
Shooters Shoot...
Code:
●  12-char prefix
                                       20d45a6a7625355df5e5fc41b358e6f8581991e2
13zb1hQbWVsc1111111111111111111111  => 20d45a6a76253570014f1a30288bd88dc3ff6ffb
13zb1hQbWVsczzzzzzzzzzzzzzzzzzzzzz  => 20d45a6a76253571d7012502fabee39e6bbaf2b4
                                                      1d5b20ad2d2330b10a7bb82b9

FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF / 1D5B20AD2D2330B10A7BB82B9       =   0x8B8758F7C8AD0286
 (every  0x8B8758F7C8AD0286  will find 1 address 12-char prefix)

Did you realize that 0x8B8758F7C8AD0286   is near 1/3 of the 66 bit space?

Code:
>>> 2**65 // 0x8B8758F7C8AD0286
3
>>> 2**65 / 0x8B8758F7C8AD0286
3.6694959191703664

It just interesting

It seems to me that these calculations are very abstract, we are missing several steps for ripemd160. If this were really the case, then any addresses could be taken away without problems. I know you Alberto, we corresponded several times in tg. I am grateful to you in many ways, most likely thanks to you I started this activity. I have no goal of emptying other people’s wallets, but if one is found ownerless or from a puzzle, I will definitely send you a significant reward, rly. But, over time, I realized that this is more of a study, most likely this will never happen, maybe. Once again I apologize, I'm using a translator.

If you are talking addresses or better yet, address prefixes (which both are a reflection of their H160), you don't really need to know all of the steps, really any of them, the H160 or the SHA256, etc. You just have to know what comprises an address, in this case base58. And from there you can get a rough idea of how many specific prefixes will be in a specific, certain sized range.

First, the leading 1, isn't part of the prefix, it is a gimme because all of these type addresses start with 1.

Someone correct me if I am wrong, but couldn't we just take range size / 58^number of leading prefixes (minus the starting "1")
If everything is uniformly spread out, over the range/curve (as the experts like to say, but it's not proven, but is a good "guesstimator" of sorts), an 11-char prefix (1 + 11 characters = total of 12 characters), in a 2^65 bit range, there should be around 1.4 of them. 2^65 / 58^11
2^65 / 58^11 = 1.4
2^65 / 58^10 = 85
2^65 / 58^9 = 4,967
2^65 / 58^8 = 288,088

and I guess you could apply a similar logic to H160s as well, but use 16^number of leading H160 prefixes, instead of 58^number of leading prefixes (minus the starting "1")

Anyone?
newbie
Activity: 2
Merit: 0
these last pages read like schizoposting.

anyway
what stops someone from sending invalid / badly signed TXs to the network so the bots are bogged down cracking the #66 with bad pubkeys? how does the network react in this case? does it just drop the bad transaction? or is it just not possible?
i could not find much on the subject of crafting invalid TXs, as i assume any wallet program will just refuse to send a TX due to invalid signature.
newbie
Activity: 6
Merit: 0
Code:
●  12-char prefix
                                       20d45a6a7625355df5e5fc41b358e6f8581991e2
13zb1hQbWVsc1111111111111111111111  => 20d45a6a76253570014f1a30288bd88dc3ff6ffb
13zb1hQbWVsczzzzzzzzzzzzzzzzzzzzzz  => 20d45a6a76253571d7012502fabee39e6bbaf2b4
                                                      1d5b20ad2d2330b10a7bb82b9

FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF / 1D5B20AD2D2330B10A7BB82B9       =   0x8B8758F7C8AD0286
 (every  0x8B8758F7C8AD0286  will find 1 address 12-char prefix)

Did you realize that 0x8B8758F7C8AD0286   is near 1/3 of the 66 bit space?

Code:
>>> 2**65 // 0x8B8758F7C8AD0286
3
>>> 2**65 / 0x8B8758F7C8AD0286
3.6694959191703664

It just interesting

It seems to me that these calculations are very abstract, we are missing several steps for ripemd160. If this were really the case, then any addresses could be taken away without problems. I know you Alberto, we corresponded several times in tg. I am grateful to you in many ways, most likely thanks to you I started this activity. I have no goal of emptying other people’s wallets, but if one is found ownerless or from a puzzle, I will definitely send you a significant reward, rly. But, over time, I realized that this is more of a study, most likely this will never happen, maybe. Once again I apologize, I'm using a translator.
Pages:
Jump to: