There is no pattern.
https://i.postimg.cc/1XR5swQv/photo-2024-02-06-20-12-03.jpg
Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 77. (Read 215611 times)
Hi, citb0in! i think stupid you are, because JavaSandcrawler sad nothing about hashing, only prefs, why he collecting them you don't know.
I collect them like a journal. For example: I want to search in 123000-124000, I open the journal and see that I have already gone to 123444.
Also, based on what I found, I have a code in Java using AI, which, based on the first 20-30 bits, selects similar ones and gives me ranges.
For example, I found some kind of prefix 13zb1hQbW in 1 minute. And I have about 500 of these using the code.
In addition, I have some experience using the 8-bit binary table. In which I saw an interesting pattern on previous addresses.
I did a lot of research with hashes, mersen twister, random number libraries and others ideias... And i once even raised my network, with the very first vulnerabilities, lol.
This turned into an interesting learning experience for me.
There is no pattern.
13zb1hQbWV 10 char match in ripemd160 hash will be little reference significance
#0x20000000000000000 ~ 0x40000000000000000 have 10000+ private key has 10 char match compressed address
13zb1hQbWVs 11 char match
#0x20000000000000000 ~ 0x40000000000000000 have 200~250 private key has 11 char match compressed address
13zb1hQbWVsc 12 char match
#0x20000000000000000 ~ 0x40000000000000000 have 3~4 private key has 12 char match compressed address
I found 13zb1hQbWVsSAaNvpKfmc43NsuAj33LyRM in range 0x20000000000000000 ~ 0x40000000000000000 last month
But I still don't know which range I should jump and keep search
Are you saying you found 10000+ private keys in the 65-bit range with all of them sharing that exact 10-char prefix? So, in other words, 10000+ hashes with same 59-bit prefix in a 65-bit keyspace? And hundreds of keys with same 64.43 bits of hash prefix in a 65-bit keyspace? This smells like "not even remotely possible".
13zb1hQbWV 50 pieces.
13zb1hQbWVs 2 pieces.
13zb1hQbWVs 2 pieces.
13zb1hQbWV 10 char match in ripemd160 hash will be little reference significance
#0x20000000000000000 ~ 0x40000000000000000 have 10000+ private key has 10 char match compressed address
13zb1hQbWVs 11 char match
#0x20000000000000000 ~ 0x40000000000000000 have 200~250 private key has 11 char match compressed address
13zb1hQbWVsc 12 char match
#0x20000000000000000 ~ 0x40000000000000000 have 3~4 private key has 12 char match compressed address
I found 13zb1hQbWVsSAaNvpKfmc43NsuAj33LyRM in range 0x20000000000000000 ~ 0x40000000000000000 last month
But I still don't know which range I should jump and keep search
Hi all. In principle, I didn’t plan to write here, I’ll just write as a participant.
You are welcome bro 
Could you Post your finding prefixes 13zb1hQbW here in text files or upload at some download able link ?
I already shared some list. Have already appeared here. So I'm sorry I can't
I found 13zb1hQbWVsSAaNvpKfmc43NsuAj33LyRM in range 0x20000000000000000 ~ 0x40000000000000000 last month
But I still don't know which range I should jump and keep search
Send me PM pls. I can share 1 WVs if u share too. This of course doesn't make sense lol
13zb1hQbWV 50 pieces.
13zb1hQbWVs 2 pieces.
13zb1hQbWVs 2 pieces.
13zb1hQbWV 10 char match in ripemd160 hash will be little reference significance
#0x20000000000000000 ~ 0x40000000000000000 have 10000+ private key has 10 char match compressed address
13zb1hQbWVs 11 char match
#0x20000000000000000 ~ 0x40000000000000000 have 200~250 private key has 11 char match compressed address
13zb1hQbWVsc 12 char match
#0x20000000000000000 ~ 0x40000000000000000 have 3~4 private key has 12 char match compressed address
I found 13zb1hQbWVsSAaNvpKfmc43NsuAj33LyRM in range 0x20000000000000000 ~ 0x40000000000000000 last month
But I still don't know which range I should jump and keep search
But I'm sure (no, I know) that you don't know the private key of #66 yet. 
I would hire some block solvers here right away.
I receive numerous messages in my inbox from individuals who are diligently attempting to solve Puzzle 66 and choose to share their ideas with me. However, I've noticed that not a single post from them exists within the community. I would advise them to come here and share their ideas; doing so will undoubtedly be beneficial for them.
Hi all. In principle, I didn’t plan to write here, I’ll just write as a participant. I've been working on the solution for about two years. this year I found ~2000 prefixes 13zb1hQbW.
13zb1hQbWV 50 pieces.
13zb1hQbWVs 2 pieces.
This is probably very stupid, but I'm just keeping it as a journal.
There were a lot of ideas, and a lot of wasted time. I also tortured the IBM quantum machine and got some research results.
But I still haven’t solved 66.
At the moment I can quickly iterate through 2xxxx000000000000:2xxxxffffffffffff
If user kTimesG really solved 66, then I sincerely congratulate him. I planned that if someone finds the key, then I will not try to open the next keys, because firstly, the range is much larger, and secondly, there will also be sharks hungry for easy money from the public key. But the problem with sharks is really very big. I did research on some addresses. Perhaps the right solution would be to block these funds. So that no one gets it.
Also please forgive me, I am using a translator.
Hi, citb0in! i think stupid you are, because JavaSandcrawler sad nothing about hashing, only prefs, why he collecting them you don't know.
I collect them like a journal. For example: I want to search in 123000-124000, I open the journal and see that I have already gone to 123444.
Also, based on what I found, I have a code in Java using AI, which, based on the first 20-30 bits, selects similar ones and gives me ranges.
For example, I found some kind of prefix 13zb1hQbW in 1 minute. And I have about 500 of these using the code.
In addition, I have some experience using the 8-bit binary table. In which I saw an interesting pattern on previous addresses.
I did a lot of research with hashes, mersen twister, random number libraries and others ideias... And i once even raised my network, with the very first vulnerabilities, lol.
This turned into an interesting learning experience for me.
Hi, citb0in! i think stupid you are, because JavaSandcrawler sad nothing about hashing, only prefs, why he collecting them you don't know.
The following two strings demonstrate the avalanche effect. Even if you add the punctuation "." at the end of the sentence and thus changing the string slightly, it'll produce a complete different hash.
This is stupid
f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80b
This is stupid.
dbf61110bee7b482f8b5536d4996effaae1de69fcd5e132c0d3af1ebf7146b3d
Imagine you find the string of the hash f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80b
f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80c
never ever it will be similar to the real string "This is stupid". The string for this hash could be "something completely different in ch4rs and s!ze"
Please stop looking for prefixes, suffixes or parts of hashes because it's a waste of time. Instead, invest your strength and energy and read about the avalanche effect.
Cheers
The following two strings demonstrate the avalanche effect - you got a range, very huge yeh, but it's a range anyway, so yuor effect got a start and got an and.
he show 2 pref with WVs, nice if you ask math you got something like that 2^65 / 58^10 ~ 85 - 13zb1hQbWVs
so where is here you avalanche effect could be?
I've been working on the solution for about two years. this year I found ~2000 prefixes 13zb1hQbW.
13zb1hQbWV 50 pieces.
13zb1hQbWVs 2 pieces.
This is probably very stupid, but ...
Yes, absolutely! That IS stupid. I don't understand why so many people in here insist and keep trying to find similar strings whose hash value only approximates the target hash value. This is a pure waste of time, nerves and resources as it does not contribute in any way - not even in the slightest - to speeding up or even impairing the solution finding process.13zb1hQbWV 50 pieces.
13zb1hQbWVs 2 pieces.
This is probably very stupid, but ...
The following two strings demonstrate the avalanche effect. Even if you add the punctuation "." at the end of the sentence and thus changing the string slightly, it'll produce a complete different hash.
This is stupid
f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80b
This is stupid.
dbf61110bee7b482f8b5536d4996effaae1de69fcd5e132c0d3af1ebf7146b3d
Imagine you find the string of the hash f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80b
f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80c
never ever it will be similar to the real string "This is stupid". The string for this hash could be "something completely different in ch4rs and s!ze"
Please stop looking for prefixes, suffixes or parts of hashes because it's a waste of time. Instead, invest your strength and energy and read about the avalanche effect.
There were a lot of ideas, and a lot of wasted time. I also tortured the IBM quantum machine and got some research results.
So true ...But I still haven’t solved 66.
puzzled? no, huh?Also please forgive me, I am using a translator.
anyone's welcome here despite of their origin and native language. Have fun and enjoy and last but not least ... Good luck! Cheers
The following two strings demonstrate the avalanche effect - you got a range, very huge yeh, but it's a range anyway, so yuor effect got a start and got an and.
he show 2 pref with WVs, nice if you ask math you got something like that 2^65 / 58^10 ~ 85 - 13zb1hQbWVs
so where is here you avalanche effect could be?
I've been working on the solution for about two years. this year I found ~2000 prefixes 13zb1hQbW.
13zb1hQbWV 50 pieces.
13zb1hQbWVs 2 pieces.
This is probably very stupid, but ...
Yes, absolutely! That IS stupid. I don't understand why so many people in here insist and keep trying to find similar strings whose hash value only approximates the target hash value. This is a pure waste of time, nerves and resources as it does not contribute in any way - not even in the slightest - to speeding up or even impairing the solution finding process.13zb1hQbWV 50 pieces.
13zb1hQbWVs 2 pieces.
This is probably very stupid, but ...
The following two strings demonstrate the avalanche effect. Even if you add the punctuation "." at the end of the sentence and thus changing the string slightly, it'll produce a complete different hash.
This is stupid
f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80b
This is stupid.
dbf61110bee7b482f8b5536d4996effaae1de69fcd5e132c0d3af1ebf7146b3d
Imagine you find the string of the hash f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80b
f061b6de6d36df2330b1ba15dca3cf858c7e20a2935e453668c6b7124e58d80c
never ever it will be similar to the real string "This is stupid". The string for this hash could be "something completely different in ch4rs and s!ze"
Please stop looking for prefixes, suffixes or parts of hashes because it's a waste of time. Instead, invest your strength and energy and read about the avalanche effect.
There were a lot of ideas, and a lot of wasted time. I also tortured the IBM quantum machine and got some research results.
So true ...But I still haven’t solved 66.
puzzled? no, huh?Also please forgive me, I am using a translator.
anyone's welcome here despite of their origin and native language. Have fun and enjoy and last but not least ... Good luck! Cheers
I receive numerous messages in my inbox from individuals who are diligently attempting to solve Puzzle 66 and choose to share their ideas with me. However, I've noticed that not a single post from them exists within the community. I would advise them to come here and share their ideas; doing so will undoubtedly be beneficial for them.
Hi all. In principle, I didn’t plan to write here, I’ll just write as a participant. I've been working on the solution for about two years. this year I found ~2000 prefixes 13zb1hQbW.
13zb1hQbWV 50 pieces.
13zb1hQbWVs 2 pieces.
This is probably very stupid, but I'm just keeping it as a journal.
There were a lot of ideas, and a lot of wasted time. I also tortured the IBM quantum machine and got some research results.
But I still haven’t solved 66.
At the moment I can quickly iterate through 2xxxx000000000000:2xxxxffffffffffff
If user kTimesG really solved 66, then I sincerely congratulate him. I planned that if someone finds the key, then I will not try to open the next keys, because firstly, the range is much larger, and secondly, there will also be sharks hungry for easy money from the public key. But the problem with sharks is really very big. I did research on some addresses. Perhaps the right solution would be to block these funds. So that no one gets it.
Also please forgive me, I am using a translator.
If anyone steals my prize I will divulge the decryption key.
But why? I mean what you want to achieve with this?
I missed the part that we also need 16 bytes for the encrypted padding block, or else we can put whatever we want in it.but that's a funny threat if someone steals your price, then he has already stolen it and therefore the pubkey is known and anyone can calculate the private key within seconds. Moreover, it would be made public here immediately. But that doesn't change the fact that your prize has still been snatched by someone else.
But I'm sure (no, I know) that you don't know the private key of #66 yet.
I'm not even bothering with it, as I said already that the ROI on it is close to 0 as it's a higher fees competition. Any number above 0 of free bitcoin is better than 0, so no one will stop at some lower bound. if someone steals your price, then he has already stolen it and therefore the pubkey is known and anyone can calculate the private key within seconds. Moreover, it would be made public here immediately. But that doesn't change the fact that your prize has still been snatched by someone else.But I'm sure (no, I know) that you don't know the private key of #66 yet.
And the other problem is that you don't even need some powerful GPU to solve the 66 priv key once pub is known. Most of the work can be done in advance.
If anyone steals my prize I will divulge the decryption key.
but that's a funny threat
if someone steals your price, then he has already stolen it and therefore the pubkey is known and anyone can calculate the private key within seconds. Moreover, it would be made public here immediately. But that doesn't change the fact that your prize has still been snatched by someone else.But I'm sure (no, I know) that you don't know the private key of #66 yet.
Why not simply AES-256 encrypt the private key and be done with it in, like, 3 lines? No password hashing and so on.
I solved puzzle #66 but I'm very afraid to sweep it. Since no one claimed it yet, they definitely belong to me, right? Here's my proof: the encrypted private key is:
First 16 bytes are the IV, then 32 bytes of private key. I removed the padding, since it's 16 bytes of 0x10 (e.g. no bytes in last block).
I solved puzzle #66 but I'm very afraid to sweep it. Since no one claimed it yet, they definitely belong to me, right? Here's my proof: the encrypted private key is:
Code:
0x4074a46512e55c9559cb8af86c983bc424d9f2d5fbb3c14b65b1045d21972d219b359a24806826a94c72e9a95ca00dab
Quoted to save this
If anyone steals my prize I will divulge the decryption key.
But why? I mean what you want to achieve with this?
Code:
SHA256(privateKey + "some secret value")
ThanksI receive numerous messages in my inbox from individuals who are diligently attempting to solve Puzzle 66 and choose to share their ideas with me. However, I've noticed that not a single post from them exists within the community. I would advise them to come here and share their ideas; doing so will undoubtedly be beneficial for them.
Edit:
In the midst of our conversation, another thought crosses my mind: why not explore the another crude measuring instrument, of the hashing strength of the community within a 66-bit range? Hence, this is the SHA256 hash: '7e4cb2ad57ba006e5991ad3289b51744ee2d1a02812905a0b64f17c22d978ce0', In bitrange '20000000000000000:40000000000000000', where the puzzle 66 private key exists in hexadecimal format with leading '0x', without any additional text or message or password. (Something valuable is hidden here)... In my opinion, hashing alone might be an exceptionally fast process, potentially solvable in matter of few minutes ??
Something like this...
Code:
import hashlib
target = '7e4cb2ad57ba006e5991ad3289b51744ee2d1a02812905a0b64f17c22d978ce0'
for i in range (2**65,2**66):
key = hex(i)
sha = hashlib.sha256(key.encode()).hexdigest()
if sha == target:
print("\nfound",key, sha)
break
else:
print(key, sha, end='\r')
You are encouraged to post your salt and password here as evidence that you had solved Puzzle 66.
This will enable the entire community to potentially pursue legal action against the thief. Therefore, anyone attempting to undermine someone else's hard work is hereby warned.
@alberto or any other member, if you discover any vulnerabilities here or are capable of cracking this script, please inform us. Additionally, if there are any alternative implementations, kindly share those as well.
Why not simply AES-256 encrypt the private key and be done with it in, like, 3 lines? No password hashing and so on.This will enable the entire community to potentially pursue legal action against the thief. Therefore, anyone attempting to undermine someone else's hard work is hereby warned.
@alberto or any other member, if you discover any vulnerabilities here or are capable of cracking this script, please inform us. Additionally, if there are any alternative implementations, kindly share those as well.
I solved puzzle #66 but I'm very afraid to sweep it. Since no one claimed it yet, they definitely belong to me, right? Here's my proof: the encrypted private key is:
Code:
0x4074a46512e55c9559cb8af86c983bc424d9f2d5fbb3c14b65b1045d21972d219b359a24806826a94c72e9a95ca00dab
If anyone steals my prize I will divulge the decryption key.
Or, simply hash it once together with some secret value, you only need to prove you knew the hashed value before anyone else, not to protect the actual data.
Code:
SHA256(privateKey + "some secret value")
Whoever manages to obtain the private key for Puzzle 66.
Is requested to encrypt it using this script and post the encrypted message here. Post only the encrypted message, and keep the salt and password to yourself.
Then, proceed to complete your transaction process after few days. If, for any reason, the transaction fails to validate and someone else hijacks it,
You are encouraged to post your salt and password here as evidence that you had solved Puzzle 66.
This will enable the entire community to potentially pursue legal action against the thief. Therefore, anyone attempting to undermine someone else's hard work is hereby warned.
@alberto or any other member, if you discover any vulnerabilities here or are capable of cracking this script, please inform us. Additionally, if there are any alternative implementations, kindly share those as well.
Is requested to encrypt it using this script and post the encrypted message here. Post only the encrypted message, and keep the salt and password to yourself.
Then, proceed to complete your transaction process after few days. If, for any reason, the transaction fails to validate and someone else hijacks it,
You are encouraged to post your salt and password here as evidence that you had solved Puzzle 66.
This will enable the entire community to potentially pursue legal action against the thief. Therefore, anyone attempting to undermine someone else's hard work is hereby warned.
@alberto or any other member, if you discover any vulnerabilities here or are capable of cracking this script, please inform us. Additionally, if there are any alternative implementations, kindly share those as well.
Just the first person who solves Puzzle 66 issues the first 32 bytes + 32 bytes of the public key and replaces it with ***********
example: 023b1ac48deb1302bbc9bd302104e6747**************************
The first person who solves Puzzle 66 can post it in this thread or a YouTube video... record the time
It can prove that he is the first person to discover the private key of Puzzle 66... and transfer 6.6 BTC away the next day...
But of course thousands of programs will leak the public key within 1 minute after the transaction, and snatch this bonus
No one Really legal possession....
Even the creator saatoshi_rising cannot sue because he has already released the BTC ...as game bonuses
.. just like he has done with puzzle 120 and puzzle 125.. and he has not even spent those coins yet, which proves that he has done it,, but if we post a lot of encrypted messages in which fake and real are mixed,, then Satoshi will not even know, and after the public key is exposed, it will be known who has posted the real key. Whether someone does it or not, I am definitely going to do it. I have scanned 12% so far, but if luck doesn't support us, what can we do?
I am telling everyone to do this because I am very curious to see this process, and conducting this process silently would only perpetuate confusion surrounding the issue forever. thank you. this feature is really fucked up .
like there is no max or smth. or a security. they should have integrated, that coins are locked in some way as long as the transaction is ongoing and that you can not change the destination address.
like there is no max or smth. or a security. they should have integrated, that coins are locked in some way as long as the transaction is ongoing and that you can not change the destination address.
you come to this conclusion solely from the perspective of your current glasses in the position of puzzle hunter #66. otherwise, RBF and similar techniques have their reason of existence and this was also agreed with the developers and thus implemented. But that would be totally off-topic now, if you want to read more about it, you will find plenty of information in the corresponding sections here in the forum.
I agree with you that this is a pretty stupid circumstance. This is also due to the fact that we now have tools like BSGS and Kangaroo that can calculate the private key very quickly if the public key and the corresponding range are known. Unfortunately, this is suboptimal for us puzzle hunters
blocktime is 10 mins - do you think it is possible, that you e.g. wait 9 mins, set the reward extremly high (like 0.09 btc) and distribute it ?
The 10 minutes is the average time. There are enough cases in which no block has fallen for almost an hour and other cases in which several blocks have fallen within a minute. So there is no guarantee that you will send the transaction to the net just before 10 minutes have elapsed and the next block will fall shortly afterwards. That would be a huge amount of luck that you would also need. The only way out of this dilemma, as already mentioned several times, is to find a large miner who will include your transaction in the next block to be calculated. This large miner must have so much power that he regularly mines blocks and the probability is in your favor that he will ever mine a block. And of course there must be an incentive for this miner, perhaps in the form of a reasonable commission, to comply with your request and make the extra effort to do so. Very unlikely, but not impossible.
All other dubious and questionable methods mentioned here are not target-oriented but misleading and inspire false confidence, just like the last hopeless appeal of a desperate user. Even if you were to find out the key and provide some form of proof here in the forum that you know the key, it would not change the fact that you have no legal right to open the vault and obtain the contents. To make this clear, let's take a simple example: imagine that Alice has known the key from #66 for over a year. This fact alone does not make her the owner of the contents of the safe from puzzle #66. If Mallory finds out the key 3 years later and grabs the coins from #66, they belong to Mallory. That's the way the game is, that's how it's defined in Bitcoin and there is no "law" or "rules". The mighty power is written in Bitcoin protocol and everything is defined in there.
like there is no max or smth. or a security. they should have integrated, that coins are locked in some way as long as the transaction is ongoing and that you can not change the destination address.
Jump to: