Author

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

full member
Activity: 1162
Merit: 237
Shooters Shoot...
Thanks. My question appears to be irrelevant as it seems the hardware (CCAP8.9) is not backwards compatible to the compiled code (CCAP7.5).  I will have to recompile everything with the proper CCAP. Messy since I now have to keep track of multiple architectures.



I've acquired a new RTX4070 to add to my aging set of Nvidia cards. Does anyone know if any of the software (Kangaroo, Keyhunt, Bitcrack) take advantage of CCap higher than 7.5? I'm pretty sure none of them do since none of them (except keyhunt) has had recent development.
Two of the newest programs within the past 6 months are https://github.com/Etayson/Etarkangaroo and  https://github.com/ilkerccom/bitcrackrandomiser . Hope that helps
You can compile multiple CCAPs within the same code/exe.
Windows and Linux.
I’ve ran 40xx cards and 30xx, 20xx cards all from same exe.
jr. member
Activity: 85
Merit: 2
Thanks. My question appears to be irrelevant as it seems the hardware (CCAP8.9) is not backwards compatible to the compiled code (CCAP7.5).  I will have to recompile everything with the proper CCAP. Messy since I now have to keep track of multiple architectures.



I've acquired a new RTX4070 to add to my aging set of Nvidia cards. Does anyone know if any of the software (Kangaroo, Keyhunt, Bitcrack) take advantage of CCap higher than 7.5? I'm pretty sure none of them do since none of them (except keyhunt) has had recent development.
Two of the newest programs within the past 6 months are https://github.com/Etayson/Etarkangaroo and  https://github.com/ilkerccom/bitcrackrandomiser . Hope that helps
jr. member
Activity: 76
Merit: 4
I've acquired a new RTX4070 to add to my aging set of Nvidia cards. Does anyone know if any of the software (Kangaroo, Keyhunt, Bitcrack) take advantage of CCap higher than 7.5? I'm pretty sure none of them do since none of them (except keyhunt) has had recent development.
Two of the newest programs within the past 6 months are https://github.com/Etayson/Etarkangaroo and  https://github.com/ilkerccom/bitcrackrandomiser . Hope that helps
jr. member
Activity: 85
Merit: 2
I've acquired a new RTX4070 to add to my aging set of Nvidia cards. Does anyone know if any of the software (Kangaroo, Keyhunt, Bitcrack) take advantage of CCap higher than 7.5? I'm pretty sure none of them do since none of them (except keyhunt) has had recent development.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
I'm currently running keyhunt in bsgs random mode on a 10gb bloomfilter file on puzzle 130. But i realize its probably pointless...

That will probably be solved by the same group/individual that solved 125.
And after that, we only have Puzzles with hash 160 left. Cry
A rookie trying to spit knowledge on here 😂

Or at least one who doesn’t know how Kangaroo works and the expected group ops needed to solve the challenges with pubkeys, compared to the H160s left.

OK. Genius. I left this thread. If you wanted it, you succeeded. Enjoy your intelligence alone.
Left? Lol, what are you 5?
It’s not intelligence; it’s common knowledge that Kanagroo takes roughly 50% ops to solve key.
130/2+1=66
135/2+1=68.5
140/2+1=71
145/2+1=73.5
…..
160/2+1=81

So if one searches up to #81, better off searching the higher bits with Kangaroo; more BTC to be found.

So if, 82 is ever the next h160 to be found, mind as well try for #160.

So
member
Activity: 499
Merit: 38
I'm currently running keyhunt in bsgs random mode on a 10gb bloomfilter file on puzzle 130. But i realize its probably pointless...

That will probably be solved by the same group/individual that solved 125.
And after that, we only have Puzzles with hash 160 left. Cry
A rookie trying to spit knowledge on here 😂

Or at least one who doesn’t know how Kangaroo works and the expected group ops needed to solve the challenges with pubkeys, compared to the H160s left.

OK. Genius. I left this thread. If you wanted it, you succeeded. Enjoy your intelligence alone.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
I'm currently running keyhunt in bsgs random mode on a 10gb bloomfilter file on puzzle 130. But i realize its probably pointless...

That will probably be solved by the same group/individual that solved 125.
And after that, we only have Puzzles with hash 160 left. Cry
A rookie trying to spit knowledge on here 😂

Or at least one who doesn’t know how Kangaroo works and the expected group ops needed to solve the challenges with pubkeys, compared to the H160s left.
member
Activity: 499
Merit: 38
What about 135, 140 etc?

Unprofitable to deal with. Even if I had a farm with 5000 GPUs I wouldn't bother with it. Grin

Whoever came up with this Puzzle knows exactly what he's doing.  Wink
copper member
Activity: 1330
Merit: 899
🖤😏
This whole puzzle is some sort of fuse. Someone is measuring currently available cracking power.
Isn't that suspicious that someone choose to not cash out on those bitcoins and instead organized some sort of competition

I'm currently running keyhunt in bsgs random mode on a 10gb bloomfilter file on puzzle 130. But i realize its probably pointless...
Not suspicious at all, why would someone who has more than a million, way more than a million Bitcoins care to cash out 1000 BTC? This is the best way to test the security of a system, I bet he even paid some "experts" to try and crack these puzzles, which appears that they have failed, and then the next best thing is to use the community in such a challenge.

Can you tell us why do you need 10gb of public keys to search? And how did you get them, by which method?, because if you just did some subtractions, it won't be that easy, also if you have 10gb of data to compare your generated keys on bsgs, you should divide your speed by how many keys you have saved for comparison, AFAIK, the more keys you have, less speed you'd get. But imagine having only 1 key in a file, then if your speed is 5T/s, you can actually search 5T keys per second. Though I'm not sure if I even know how does bsgs work, however it works, it is just for low ranges, high range keys are no child play to use kangaroo/ bsgs etc.


That will probably be solved by the same group/individual that solved 125.
And after that, we only have Puzzles with hash 160 left. Cry
Why do you say after 130 we are left with hash 160? What about 135, 140 etc?
member
Activity: 499
Merit: 38
I'm currently running keyhunt in bsgs random mode on a 10gb bloomfilter file on puzzle 130. But i realize its probably pointless...

That will probably be solved by the same group/individual that solved 125.
And after that, we only have Puzzles with hash 160 left. Cry
member
Activity: 122
Merit: 11
Still .. what this script is really trying to do ?  It just generates random 66bit HEX numbers in hope to hit 66 puzzle ? Or is there something else here ?

Not random. It goes Sequentially. "To kill boredom" script. Like all the other useless scripts here. Grin


But ... with that speed ... it's a complete joke. I can do the same with existing tools on nvidia card much faster. So what's the point of making such scripts ?

It's a complete joke even with 5 GPUs. Compared to the required 200 Giga hashes per second.
Everything is joke. Any script that looks for hash 160. Even if you have a farm with graphics (and I tried there Puzzle 66 too) . The only question is who is the biggest clown.  Grin

This whole puzzle is some sort of fuse. Someone is measuring currently available cracking power.
Isn't that suspicious that someone choose to not cash out on those bitcoins and instead organized some sort of competition

I'm currently running keyhunt in bsgs random mode on a 10gb bloomfilter file on puzzle 130. But i realize its probably pointless...
member
Activity: 499
Merit: 38
Still .. what this script is really trying to do ?  It just generates random 66bit HEX numbers in hope to hit 66 puzzle ? Or is there something else here ?

Not random. It goes Sequentially. "To kill boredom" script. Like all the other useless scripts here. Grin


But ... with that speed ... it's a complete joke. I can do the same with existing tools on nvidia card much faster. So what's the point of making such scripts ?

It's a complete joke even with 5 GPUs. Compared to the required 200 Giga hashes per second.
Everything is joke. Any script that looks for hash 160. Even if you have a farm with graphics (and I tried there Puzzle 66 too) . The only question is who is the biggest clown.  Or whose jokes seems the smartest in the eyes of the public. Grin
jr. member
Activity: 47
Merit: 12
gmaxwell creator of 1000 BTC puzzl + Pinapple fund
Well, for starters you can't solve #66 by doing math on private/ public keys, also you can't solve #130 with your small example, but since you are a rookie hunter, we let them slide. Remember when you are publishing your non existing research, do some actual testing before "publishing them".  This is what I do, I test a few things and if it has promising results, I post them, unlike some people.😉
Next time share your discoveries with your main account, then we can talk, eh?

Code:
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⣀⣤⣤⣤⣤⣤⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⣴⣾⣿⣿⣿⣿⡿⠿⠿⠛⠻⠿⣷⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⣿⣿⣿⣿⡿⠟⠋⠁⠀⠀⠀⠀⠀⠀⠀⠙⢷⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⠟⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣀⣻⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⣿⣿⣿⡿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⠟⠉⠉⢳⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⣠⡴⠶⠦⡄⠀⠀⠈⠃⡴⢻⣷⣾⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣿⣿⣆⠀⠀⠀⠞⠁⢀⣴⣶⠦⡄⠐⡆⠸⣟⠚⠋⠁⠈⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿⠀⠀⠀⠀⠀⢯⣸⣿⠟⠃⠀⢷⠀⠈⠣⠀⠀⠀⠈⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⠟⠀⠀⠀⢨⡷⣄⠀⢿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣿⣿⣿⣿⡟⠛⠿⢿⡄⠀⠀⠀⠀⠀⠀⠀⠀⠈⠀⠐⠛⠀⠀⠀⠙⠆⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⣿⣿⣿⡹⣄⡶⠀⠀⠀⠀⠀⠀⠀⠀⢀⣦⠀⠀⠀⣀⡤⠴⣶⠀⠀⢸⣦⣤⣄⣀⡀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢀⣀⣀⣤⣽⣿⣿⣧⡻⣷⣦⣀⡀⠀⠀⠀⠀⠀⠈⠙⠂⢶⣯⣥⣴⣾⠏⠀⠀⣼⣿⣿⣿⣿⣿⣿⣷⣦⣤⣀
⠀⠀⢀⣠⣤⣶⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣤⡰⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠁⠀⠀⠀⢹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⣴⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⡄⠀⠘⢦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠴⠆⠀⣸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣯⠳⣄⠀⠉⠓⠶⠄⠀⠀⠀⠀⠀⠀⠀⠀⢠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⠙⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠀⠈⠓⠀⠀⠀⠀⠀⠀⠈⠓⠒⠒⠚⠙⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛⠛
copper member
Activity: 1330
Merit: 899
🖤😏
Here is something interesting I found during my research:

if we have a pk e.g.: 0xA9128E282

we can substract from pk = 0xA9128E282 - 0x1. This is on +N. Not on -N!!!
After that I can add 0xA9128E282. You will see what you get when you research on your own. Please remember to give me my share when you find #66 or #130.
Well, for starters you can't solve #66 by doing math on private/ public keys, also you can't solve #130 with your small example, but since you are a rookie hunter, we let them slide. Remember when you are publishing your non existing research, do some actual testing before "publishing them".  This is what I do, I test a few things and if it has promising results, I post them, unlike some people.😉
Next time share your discoveries with your main account, then we can talk, eh?
member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.

This is the output i got when i tested:
Private Key: 000000000000000000000000000000000000000000000002000000000010c4fc
Public Key: 03747a90acd8efec7e9cf1a7555b6c9e4404fc521fc3aebb965bc3bf7e73ef1579
Bitcoin Address: 88508b5ae0788248196a88b63949182342c66ca2
Negated Private Key: fffffffffffffffffffffffffffffffebaaedce6af48a039bfd25e8cd0257c45
Negated Public Key: 02747a90acd8efec7e9cf1a7555b6c9e4404fc521fc3aebb965bc3bf7e73ef1579
Negated Bitcoin Address: c711d99906689482d858a688a3cef4ee5f652e48

i see pub key and negated pub key are the same, how can i use this?


One use could be that if you have a pub with pk= 0x2710-N, negating would go from a 256-bit key to Pk= 0x2710 (equivalent to the range of: puzzle #14),

jr. member
Activity: 47
Merit: 12
gmaxwell creator of 1000 BTC puzzl + Pinapple fund
Here is something interesting I found during my research:

if we have a pk e.g.: 0xA9128E282

we can substract from pk = 0xA9128E282 - 0x1. This is on +N. Not on -N!!!
After that I can add 0xA9128E282. You will see what you get when you research on your own. Please remember to give me my share when you find #66 or #130.
copper member
Activity: 1330
Merit: 899
🖤😏


This is the output i got when i tested:
Private Key: 000000000000000000000000000000000000000000000002000000000010c4fc
Public Key: 03747a90acd8efec7e9cf1a7555b6c9e4404fc521fc3aebb965bc3bf7e73ef1579
Bitcoin Address: 88508b5ae0788248196a88b63949182342c66ca2
Negated Private Key: fffffffffffffffffffffffffffffffebaaedce6af48a039bfd25e8cd0257c45
Negated Public Key: 02747a90acd8efec7e9cf1a7555b6c9e4404fc521fc3aebb965bc3bf7e73ef1579
Negated Bitcoin Address: c711d99906689482d858a688a3cef4ee5f652e48

i see pub key and negated pub key are the same, how can i use this?
I see that you just found out about n and -n, if this is your first time working with public keys, you won't be able to reach anything meaningful, honestly I thought you are all in on public keys, that's why I wanted to help you by providing a hint, but the thing is I haven't worked on this angle yet myself, I will let you know when I can find a correlation between the two keys. However to make it fair for all, the answer is in secp256k1's representation for 2^256.

Even though I know most of you won't understand what I'm talking about, but those who do, remember we are partners.😉
newbie
Activity: 17
Merit: 0
ps.. finally showed my wife what im working on.. and why i couldnt help pay the bills.  Roll Eyes
I thought you were up to coding any ideas, what happened to that promise? I really hope you can find at least one of them, but if you want to not only pay the bills but even buy your wife some jewelry, then I'd suggest you to work on public key related scripts.
For example, if you can find a relation between a key and it's inverse aka -n of a key, you can easily solve low range keys like 130 etc, here is a hint :
Code:
Imagine this is #130
00000000000000000000000000000002c56510da49e97b94ca065bbdfb67309c
And this is -n of 130
fffffffffffffffffffffffffffffffbf549cc0c655f24a6f5cc02ced4cf10a5
What happens if you drop all the leading Fs from -n of 130?
bf549cc0c655f24a6f5cc02ced4cf10a5
Now can you find something useful from this new key above without those leading Fs? I'm sure you'll be surprised when you figure it out.😉


Wow, I haven't attempted any of the puzzles in the 100's, but thanks for the tips you've been sharing. I will definitely look at the approach mentioned above.
I am still staying true to my words, the inbox is open for script dev!  Grin

This is the output i got when i tested:
Private Key: 000000000000000000000000000000000000000000000002000000000010c4fc
Public Key: 03747a90acd8efec7e9cf1a7555b6c9e4404fc521fc3aebb965bc3bf7e73ef1579
Bitcoin Address: 88508b5ae0788248196a88b63949182342c66ca2
Negated Private Key: fffffffffffffffffffffffffffffffebaaedce6af48a039bfd25e8cd0257c45
Negated Public Key: 02747a90acd8efec7e9cf1a7555b6c9e4404fc521fc3aebb965bc3bf7e73ef1579
Negated Bitcoin Address: c711d99906689482d858a688a3cef4ee5f652e48

i see pub key and negated pub key are the same, how can i use this?
copper member
Activity: 1330
Merit: 899
🖤😏
ps.. finally showed my wife what im working on.. and why i couldnt help pay the bills.  Roll Eyes
I thought you were up to coding any ideas, what happened to that promise? I really hope you can find at least one of them, but if you want to not only pay the bills but even buy your wife some jewelry, then I'd suggest you to work on public key related scripts.
For example, if you can find a relation between a key and it's inverse aka -n of a key, you can easily solve low range keys like 130 etc, here is a hint :
Code:
Imagine this is #130
00000000000000000000000000000002c56510da49e97b94ca065bbdfb67309c
And this is -n of 130
fffffffffffffffffffffffffffffffbf549cc0c655f24a6f5cc02ced4cf10a5
What happens if you drop all the leading Fs from -n of 130?
bf549cc0c655f24a6f5cc02ced4cf10a5
Now can you find something useful from this new key above without those leading Fs? I'm sure you'll be surprised when you figure it out.😉
newbie
Activity: 17
Merit: 0
I am going to find at least one address between puzzle 66 - 72
I am iterating through this 1 decimal range and all targets equal $1,201,000 at current prices!



Code:
.target_public_key_hashes = [
    bytes.fromhex('20d45a6a762535700ce9e0b216e31994335db8a5'),
    bytes.fromhex('739437bb3dd6d1983e66629c5f08c70e52769371'),
    bytes.fromhex('e0b8a2baee1b77fc703455f39d51477451fc8cfc'),
    bytes.fromhex('61eb8a50c86b0584bb727dd65bed8d2400d6d5aa'),
    bytes.fromhex('f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8'),
    bytes.fromhex('bf7413e8df4e7a34ce9dc13e2f2648783ec54adb')
]

target_hashes_found = []

# Define the lower and upper bounds for the decimal number search range
lower_bound = Decimal('36893488147420166522')
upper_bound = Decimal('55340232221128654832')

# List of additional hex numbers to modify the decimal number
additional_hex_numbers = [
    '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f',
    '10', '11', '12', '13', '14', '15', '16', '17', '18', '19', '1a', '1b', '1c', '1d', '1e', '1f',
    '40', '41', '42', '43', '44', '45', '46', '47', '48', '49', '4a', '4b', '4c', '4d', '4e', '4f',
    '50', '51', '52', '53', '54', '55', '56', '57', '58', '59', '5a', '5b', '5c', '5d', '5e', '5f',
    '60', '61', '62', '63', '64', '65', '66', '67', '68', '69', '6a', '6b', '6c', '6d', '6e', '6f',
    '70', '71', '72', '73', '74', '75', '76', '77', '78', '79', '7a', '7b', '7c', '7d', '7e', '7f',
    '80', '81', '82', '83', '84', '85', '86', '87', '88', '89', '8a', '8b', '8c', '8d', '8e', '8f',
    '90', '91', '92', '93', '94', '95', '96', '97', '98', '99', '9a', '9b', '9c', '9d', '9e', '9f',
    'a0', 'a1', 'a2', 'a3', 'a4', 'a5', 'a6', 'a7', 'a8', 'a9', 'aa', 'ab', 'ac', 'ad', 'ae', 'af',
    'b0', 'b1', 'b2', 'b3', 'b4', 'b5', 'b6', 'b7', 'b8', 'b9', 'ba', 'bb', 'bc', 'bd', 'be', 'bf',
    'c0', 'c1', 'c2', 'c3', 'c4', 'c5', 'c6', 'c7', 'c8', 'c9', 'ca', 'cb', 'cc', 'cd', 'ce', 'cf',
    'd0', 'd1', 'd2', 'd3', 'd4', 'd5', 'd6', 'd7', 'd8', 'd9', 'da', 'db', 'dc', 'dd', 'de', 'df',
    'e0', 'e1', 'e2', 'e3', 'e4', 'e5', 'e6', 'e7', 'e8', 'e9', 'ea', 'eb', 'ec', 'ed', 'ee', 'ef',
    'f0', 'f1', 'f2', 'f3', 'f4', 'f5', 'f6', 'f7', 'f8', 'f9', 'fa', 'fb', 'fc', 'fd', 'fe', 'ff'
]

ps.. finally showed my wife what im working on.. and why i couldnt help pay the bills.  Roll Eyes
Jump to: