Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 7. (Read 245962 times)
with my cpu tool #67 shows e+9 years to go. how did they found latter ones? what can be that fast?
How long do you think the hash 160 can break?
How long can it take?
How long can it take?
Code:
import hashlib
import time
from itertools import product
import string
def ripemd160(data):
"""
Compute the RIPEMD-160 hash of the given data.
"""
h = hashlib.new('ripemd160')
h.update(data.encode('utf-8'))
return h.hexdigest()
def brute_force_ripemd160(target_hash, max_length=5):
"""
Simulate brute-forcing a RIPEMD-160 hash.
Test all combinations of characters up to a given length.
"""
characters = string.ascii_letters + string.digits
start_time = time.time()
attempt_count = 0 # Track number of attempts
print(f"Brute-forcing RIPEMD-160 hash: {target_hash}")
print(f"Using characters: {characters}")
# Brute-force attempt
for length in range(1, max_length + 1):
print(f"\nTesting all combinations of length: {length}")
for attempt in product(characters, repeat=length):
attempt_count += 1
guess = ''.join(attempt)
guess_hash = ripemd160(guess)
# Show progress every 100,000 attempts
if attempt_count % 100000 == 0:
elapsed_time = time.time() - start_time
print(f"Attempts: {attempt_count:,} | Time elapsed: {elapsed_time:.2f} seconds")
if guess_hash.upper() == target_hash.upper():
elapsed_time = time.time() - start_time
print(f"\nMatch found: {guess}")
print(f"Attempts: {attempt_count:,}")
print(f"Time taken: {elapsed_time:.2f} seconds")
return guess
elapsed_time = time.time() - start_time
print(f"\nNo match found within {max_length}-character keyspace.")
print(f"Total attempts: {attempt_count:,}")
print(f"Time taken: {elapsed_time:.2f} seconds")
return None
target_hash = "1234567890123456789012345678912345678..." # Replace with your hash
print(f"Target Hash: {target_hash}")
# Run the brute-force simulation
brute_force_ripemd160(target_hash, max_length=5)
The answer is simple, longer than the universe will exist. This means that the universe will collapse onto itself in deflation and basically end, before your script will finish.
December 9, 2024
Google today introduced its latest quantum chip — Willow (~100 qubits) — coinciding with two key achievements run on the new chip: breaking of the so-called Quantum Error Correction Threshold and posting a new benchmark for quantum performance against classical computing; Willow ran a benchmark task in five minutes that Google said would take ten septillion years (1024) on Frontier, which until a few weeks ago was the fastest supercomputer in the world.
It’s rare to catch Google in a talkative mood, but the technology giant held a media/analyst briefing before today’s announcement with handful of prominent members of the Google Quantum-AI team including Hartmut Neven, founder and lead; Michael Newman, research scientist; Julian Kelly, director of quantum hardware; and Carina Chou, director and COO. Currently, the Google Quantum-AI team has roughly 300 people with, plans for growth, and its own state of the art fabrication facility at UCSB.
This an important moment for Google’s quantum effort:
Breaking the QEC threshold (error rate decreases as number of qubits rises) is a long-sought goal in the community and basically proves it will be possible to build large error-corrected useful quantum computer.
The company also walked through its roadmap, discussing on technical goals (though not in great granularity) and business milestones. While the main focus is on achieving error-corrected QC fault-tolerance sometime around the end of the decade, it’s also looking at nearer term applications.
It also discussed its broad quantum business plans which include everything from fabbing its own chips and building its own system to offering quantum services via the cloud (naturally) but also plans for potential on-premise deployments.
How long do you think the hash 160 can break?
How long can it take?
How long can it take?
Code:
import hashlib
import time
from itertools import product
import string
def ripemd160(data):
"""
Compute the RIPEMD-160 hash of the given data.
"""
h = hashlib.new('ripemd160')
h.update(data.encode('utf-8'))
return h.hexdigest()
def brute_force_ripemd160(target_hash, max_length=5):
"""
Simulate brute-forcing a RIPEMD-160 hash.
Test all combinations of characters up to a given length.
"""
characters = string.ascii_letters + string.digits
start_time = time.time()
attempt_count = 0 # Track number of attempts
print(f"Brute-forcing RIPEMD-160 hash: {target_hash}")
print(f"Using characters: {characters}")
# Brute-force attempt
for length in range(1, max_length + 1):
print(f"\nTesting all combinations of length: {length}")
for attempt in product(characters, repeat=length):
attempt_count += 1
guess = ''.join(attempt)
guess_hash = ripemd160(guess)
# Show progress every 100,000 attempts
if attempt_count % 100000 == 0:
elapsed_time = time.time() - start_time
print(f"Attempts: {attempt_count:,} | Time elapsed: {elapsed_time:.2f} seconds")
if guess_hash.upper() == target_hash.upper():
elapsed_time = time.time() - start_time
print(f"\nMatch found: {guess}")
print(f"Attempts: {attempt_count:,}")
print(f"Time taken: {elapsed_time:.2f} seconds")
return guess
elapsed_time = time.time() - start_time
print(f"\nNo match found within {max_length}-character keyspace.")
print(f"Total attempts: {attempt_count:,}")
print(f"Time taken: {elapsed_time:.2f} seconds")
return None
target_hash = "1234567890123456789012345678912345678..." # Replace with your hash
print(f"Target Hash: {target_hash}")
# Run the brute-force simulation
brute_force_ripemd160(target_hash, max_length=5)
The answer is simple, longer than the universe will exist. This means that the universe will collapse onto itself in deflation and basically end, before your script will finish.
How long do you think the hash 160 can break?
How long can it take?
How long can it take?
Code:
import hashlib
import time
from itertools import product
import string
def ripemd160(data):
"""
Compute the RIPEMD-160 hash of the given data.
"""
h = hashlib.new('ripemd160')
h.update(data.encode('utf-8'))
return h.hexdigest()
def brute_force_ripemd160(target_hash, max_length=5):
"""
Simulate brute-forcing a RIPEMD-160 hash.
Test all combinations of characters up to a given length.
"""
characters = string.ascii_letters + string.digits
start_time = time.time()
attempt_count = 0 # Track number of attempts
print(f"Brute-forcing RIPEMD-160 hash: {target_hash}")
print(f"Using characters: {characters}")
# Brute-force attempt
for length in range(1, max_length + 1):
print(f"\nTesting all combinations of length: {length}")
for attempt in product(characters, repeat=length):
attempt_count += 1
guess = ''.join(attempt)
guess_hash = ripemd160(guess)
# Show progress every 100,000 attempts
if attempt_count % 100000 == 0:
elapsed_time = time.time() - start_time
print(f"Attempts: {attempt_count:,} | Time elapsed: {elapsed_time:.2f} seconds")
if guess_hash.upper() == target_hash.upper():
elapsed_time = time.time() - start_time
print(f"\nMatch found: {guess}")
print(f"Attempts: {attempt_count:,}")
print(f"Time taken: {elapsed_time:.2f} seconds")
return guess
elapsed_time = time.time() - start_time
print(f"\nNo match found within {max_length}-character keyspace.")
print(f"Total attempts: {attempt_count:,}")
print(f"Time taken: {elapsed_time:.2f} seconds")
return None
target_hash = "1234567890123456789012345678912345678..." # Replace with your hash
print(f"Target Hash: {target_hash}")
# Run the brute-force simulation
brute_force_ripemd160(target_hash, max_length=5)
Searching for Existing Private Keys with Different Hash Modes in hopes of finding private keys where the first or last character might have been manually adjusted.
Here's an example using most popular rockyou wordlists.
https://github.com/brannondorsey/naive-hashcat/releases/download/data/rockyou.txt
Purpose of this post: To address any lingering hope or speculation that private keys might exist for these hash variations.
Despite exhaustive testing—analyzing trillions of text combinations.. I've found absolutely nothing.
If anyone else has explored something similar or has thoughts on it, consider this a playful third finger salute on behalf of Satoshi!
Here's an example using most popular rockyou wordlists.
https://github.com/brannondorsey/naive-hashcat/releases/download/data/rockyou.txt
Without First char....
Mode: MD5
Text: madhow
Hash: 53b1d1f19dde716e9354a7de820a7c5e
Mark: ^^^^^^^^
Puzz 36: 9DE820A7C
Mode: SHA224
Text: wetlips21
Hash: e6180b64a65911ded896d33409736532ea063845d0839be39f177718
Mark: ^^^^^^^^
Puzz 34: 34A65911D
Mode: SHA384
Text: niceeyez<3
Hash: 4b9ae4933d68dfe4adbf6ae2474946e139e576902c5d026f3e404e5e16b3624361d2fa901380df2 af1c54538bce8431d
Mark: ^^^^^^^^^
Puzz 40: E9AE4933D6
Mode: SHA384
Text: annaisme360
Hash: 63a1a508df52d49d8420860e9f1e83e38cdbfe80f1c9eb8b64a65911df648a0cd3c3bc3ced80476 e4532dd670bb9cb72
Mark: ^^^^^^^^
Puzz 34: 34A65911D
Mode: SHA384
Text: 27431741
Hash: 30ee1869f667fe732b9f730f02df552382facd0a2756ed139c59d6e91489747e7d820f56674d613 f57bc5b656ed39d68
Mark: ^^^^^^^^^
Puzz 38: 22382FACD0
Mode: SHA512
Text: marvelous08
Hash: f6fc1ee7b2318450017462a9d437e641984a1bd73614bde820a7cb390d67dbe2ebb33272ddc4b2f 639d93b42934570625241ffd60e87b3179984976d6621e753
Math: ^^^^^^^^
Puzz 36: 9DE820A7C
Mode: BLAKE2B
Text: jeannette01
Hash: dea924ec2ab4df823149a73760218a96ca8d8e2e5e64600ed7ab6cbacbd445b9f4214aef5b9d256 fa4f0fa9d4796484487557906b30b9fd2c0fac43933b70b24
Mark: ^^^^^^^^
Puzz 33: 1A96CA8D8
Mode: BLAKE2S
Text: 1ponyaholic2
Hash: 8a439c2cd4b228ddba84848996cad5b5f8303e903f0e755827a91d0586a6f289
Mark: ^^^^^^^^^
Puzz 39: 4B5F8303E9
Without Last char....
Mode : MD5
Text : jjjkkj3
Hash : a93522c314e69de820a73af0416bddb8
Mark : ^^^^^^^^
Puzz 36: 9DE820A7C
Mode : SHA1
Text : 1killu
Hash : 80c74a39b5ca25357bd4b2034e86084aed21179f
Mark : ^^^^^^^^
Puzz 35: 4AED21170
Mode : SHA256
Text : polly422
Hash : 18f39914467f0192292eab3d3b558f2f34a659111060237925e203df3f681346
Mark : ^^^^^^^^
Puzz 34: 34A65911D
Mode : SHA384
Text : 890989ooh
Hash : 2e772e72aafc3b0dddf538787f640ac39278caa5ed2335e386bed701af586cafb4b34a65911a540 35d39924b2661c1cf
Mark : ^^^^^^^^
Puzz 34: 34A65911D
Mode : SHA512
Text : pungkong
Hash : ed0624499b03e725a715cf1a96ca8dc0aba0d04ccc0ffe5e5ee96ffcc317d4401b479bc6b2c6377 2c7ef8c5670e882421febb3549c494f04b97072eea2a1b3c4
Mark : ^^^^^^^^
Puzz 33: 1A96CA8D8
Mode : SHA512
Text : 18killerbee
Hash : dd0572168d6680e5104b95d06a4b92e5c230256b88fc30882b4554d0aa957227ad6c3ae1dba1a91 901a96ca8d6d6d81562756ab5f71654de2e74a14e401457b1
Mark : ^^^^^^^^
Puzz 33: 1A96CA8D8
Mode : BLAKE2B
Text : lorenzoastigpogi
Hash : 5938d84d54497f51c8e26314e2df72a25b8ce9fa9ccd08a49fde4201f0934daad106f737bec72ab 888c6751fc63187575cc5c7887ea34a65911cee5695123e8d
Mark : ^^^^^^^^
Puzz 34: 34A65911D
Purpose of this post: To address any lingering hope or speculation that private keys might exist for these hash variations.
Despite exhaustive testing—analyzing trillions of text combinations.. I've found absolutely nothing.
If anyone else has explored something similar or has thoughts on it, consider this a playful third finger salute on behalf of Satoshi!
Come on guys, use your brains a bit. Don't you realize that in the last few weeks (or rather since the last puzzle was solved) more bots and AI-generated content have been landing here? You're talking to bots and going all in on them and spinning your wheels. Frustration leads to four things, as ktimes correctly wrote some postings ago.
Don't be baited, don't feed the trolls, keep working on your goals.
Pull out the information that is helpful to you and if you can contribute something useful, share it with the community.
Everything else is a waste of time and only feeds these unwelcome bots and AI-controlled vultures.
Don't be baited, don't feed the trolls, keep working on your goals.
Pull out the information that is helpful to you and if you can contribute something useful, share it with the community.
Everything else is a waste of time and only feeds these unwelcome bots and AI-controlled vultures.
CongrAtulations ^ ω ^ # 67. There is evidence to confirm that puzzle 67 has been solved.
What indications?
CongrAtulations ^ ω ^ # 67. There is evidence to confirm that puzzle 67 has been solved.
The conversation is over. From now on, whoever can do something should speak.
Yes, no chances more Or if RogueCoder make multypubkey search
The conversation is over. From now on, whoever can do something should speak.
Frustration often leads to insanity and extremism (personal attacks), because rationality no longer applies, so the only weapons remaining for them is low-level attacks. Do not feed the trolls. It is common knowledge that hashes are injective one-way functions, no more explanations are required to convince anyone who already knows this. It is already clear that the guy lost it and has no idea what he's talking about, so the only place for him is on our ignore list. If you give him attention he will continue polluting the thread with his non-sense.
It's better for everyone to just ignore him and his useless ideas, I'm talking to anyone reading this. I promise he can't even write a simple program
) maybe he is just a child or a brainless person )Someone teach this child how to speak technically. He's wasting my time.
Lol... Congratulations on wasting your 5 years. The hash function was specifically designed so that there wouldn’t be any pattern or relationship between the private key and the address.
First, go and research how a hash is created in the first place; you will automatically understand everything you talked about is BS. Your research is just nonsense and a complete waste of time. You wasted 5 years trying to find a pattern, but if you had invested those 5 years studying how a hash works, it would have been much better. I’m saying this from my own experience.
First, go and research how a hash is created in the first place; you will automatically understand everything you talked about is BS. Your research is just nonsense and a complete waste of time. You wasted 5 years trying to find a pattern, but if you had invested those 5 years studying how a hash works, it would have been much better. I’m saying this from my own experience.
I know the hashing process starting from the 02-03-04 relation and going back to the n point combination at which point in the loop.
So understand this well, right now I said it is a valid transaction from 1 to 90 bits.
Now let me 67. I have some things to say to you after the wallet is found. So just wait.
بچه ها کیا دارن روی پازل ها کار میکنن ؟
سلام. من کار میکنم.
child?
Go ahead, Iranian.
Are people the same 20 years ago as they are now? If you are not even capable of distinguishing that, you are too young to talk to you.
Development is something that happens in every field.
But the backward ones like you are usually in countries like IRAN and AFGHANISTAN. But that is written in my past when I was TURKISH.
I don't need to erase any of my past, because no one knows anything 100% for sure. They are learning.
But I am sorry to the brat kids like you who love the ready-made. You think that you are doing something by stealing everything that is ready-made. So now put that cell phone you wrote about in your pocket and pull yourself together. Be well-mannered. Because you are a child. In fact, you are not even 15 years old, little one.
Lol... Congratulations on wasting your 5 years. The hash function was specifically designed so that there wouldn’t be any pattern or relationship between the private key and the address.
First, go and research how a hash is created in the first place; you will automatically understand everything you talked about is BS. Your research is just nonsense and a complete waste of time. You wasted 5 years trying to find a pattern, but if you had invested those 5 years studying how a hash works, it would have been much better. I’m saying this from my own experience.
First, go and research how a hash is created in the first place; you will automatically understand everything you talked about is BS. Your research is just nonsense and a complete waste of time. You wasted 5 years trying to find a pattern, but if you had invested those 5 years studying how a hash works, it would have been much better. I’m saying this from my own experience.
بچه ها کیا دارن روی پازل ها کار میکنن ؟
سلام. من کار میکنم.
child?
Go ahead, Iranian.
Are people the same 20 years ago as they are now? If you are not even capable of distinguishing that, you are too young to talk to you.
Development is something that happens in every field.
But the backward ones like you are usually in countries like IRAN and AFGHANISTAN. But that is written in my past when I was TURKISH.
I don't need to erase any of my past, because no one knows anything 100% for sure. They are learning.
But I am sorry to the brat kids like you who love the ready-made. You think that you are doing something by stealing everything that is ready-made. So now put that cell phone you wrote about in your pocket and pull yourself together. Be well-mannered. Because you are a child. In fact, you are not even 15 years old, little one.
Ok kid, you should have added it after these messages.
What nickname were you using before?
Kid? I'm sure your birth date is in the 2000s.Be quiet now, your adults are busy with work.
If you don't delete these messages soon, you'll be in a very funny situation. I promise.
We have a nice saying here.
"Let's pick up the kids from the track." Now go drink your milk and go to sleep. When you wake up, you'll scream it's a dream.
You are so funny
Reading your history is my new hobby now ))Hello friends;
I think I found a clue.
66. The probability that the wallet is in these ranges is over 90%
3B320044788A17DA0 - 3BC0ABFC3654BAE80
3475FBD690F7B3880 - 34B85C9495BA98840
30389466D233BCDE0 - 305E58789566D2EA0
2E1325EAAC24E8A40 - 2E6917C76BF8F5340
If the result is within these ranges, I will inform you partially about the tip.
Thank you...
I think I found a clue.
66. The probability that the wallet is in these ranges is over 90%
3B320044788A17DA0 - 3BC0ABFC3654BAE80
3475FBD690F7B3880 - 34B85C9495BA98840
30389466D233BCDE0 - 305E58789566D2EA0
2E1325EAAC24E8A40 - 2E6917C76BF8F5340
If the result is within these ranges, I will inform you partially about the tip.
Thank you...
If I were you, after all these wrong predictions, I would just keep quiet.
Yes, this is not a place to write for nothing.
You got the answer to your question and the things you wrote for nothing.
Now, stop asking pointless questions.
If you have the power to do something, we are waiting. Otherwise, do not waste our time.
Hahahaha, look at him:
Hi friend,
There is a tip for 64 wallets,
The beginning starts with the letter B. The next most likely is the number 2.
The highly probable start starts with B2, possibly with B25 or B26.
There is a tip for 64 wallets,
The beginning starts with the letter B. The next most likely is the number 2.
The highly probable start starts with B2, possibly with B25 or B26.
It's better for everyone to just ignore him and his useless ideas, I'm talking to anyone reading this. I promise he can't even write a simple program
) maybe he is just a child or a brainless person )Ok kid, you should have added it after these messages.
What nickname were you using before?
Kid? I'm sure your birth date is in the 2000s.Be quiet now, your adults are busy with work.
If you don't delete these messages soon, you'll be in a very funny situation. I promise.
We have a nice saying here.
"Let's pick up the kids from the track." Now go drink your milk and go to sleep. When you wake up, you'll scream it's a dream.
Yes, this is not a place to write for nothing.
You got the answer to your question and the things you wrote for nothing.
Now, stop asking pointless questions.
If you have the power to do something, we are waiting. Otherwise, do not waste our time.
Hahahaha, look at him:
Hi friend,
There is a tip for 64 wallets,
The beginning starts with the letter B. The next most likely is the number 2.
The highly probable start starts with B2, possibly with B25 or B26.
There is a tip for 64 wallets,
The beginning starts with the letter B. The next most likely is the number 2.
The highly probable start starts with B2, possibly with B25 or B26.
It's better for everyone to just ignore him and his useless ideas, I'm talking to anyone reading this. I promise he can't even write a simple program
) maybe he is just a child or a brainless person ) 5 years of experience, I said only about algorithms. You need to have at least 5 years of experience with all algorithms such as AES, SHA, MD5, Cyrpt etc. (I have been interested in Computers, Software and Hardware since August 2003.)
It is really difficult to explain these to someone who does not know. That's why you can go fishing, take a tour by car, or even travel around the country by boat if you are rich.
I am one of the first people to solve the AES CBC algorithm. For this reason, I do not think of sharing any of my work with anyone who does not deserve it. If you want, even if you give 5 million dollars, it will still be like this.
Nothing in life is random.
Because even randomness includes mathematics.
A little luck, the right time, the right thought, the right hardware etc. etc. but I do not expect people who work in plain logic to understand this anyway.
Now continue scanning straight, only when the time comes, you will learn to respect everyone.
Instead of just bragging, solve puzzle #67 by your way
) This is not a place for talk. This is a place for action.Yes, this is not a place to write for nothing.
You got the answer to your question and the things you wrote for nothing.
Now, stop asking pointless questions.
If you have the power to do something, we are waiting. Otherwise, do not waste our time.
5 years of experience, I said only about algorithms. You need to have at least 5 years of experience with all algorithms such as AES, SHA, MD5, Cyrpt etc. (I have been interested in Computers, Software and Hardware since August 2003.)
It is really difficult to explain these to someone who does not know. That's why you can go fishing, take a tour by car, or even travel around the country by boat if you are rich.
I am one of the first people to solve the AES CBC algorithm. For this reason, I do not think of sharing any of my work with anyone who does not deserve it. If you want, even if you give 5 million dollars, it will still be like this.
Nothing in life is random.
Because even randomness includes mathematics.
A little luck, the right time, the right thought, the right hardware etc. etc. but I do not expect people who work in plain logic to understand this anyway.
Now continue scanning straight, only when the time comes, you will learn to respect everyone.
Instead of just bragging, solve puzzle #67 by your way
) This is not a place for talk. This is a place for action. Jump to: