Search content
Sort by
Showing 11 of 11 results by sdhgfdsjfgsiujdgf
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
~~~
For public broadcasting your transaction you would need to predict when a new block is mined within seconds (and your transaction has reached the mining pool's mempool and has been properly processed to be included in the next block). This is impossible.For slipstream.mara.com it doesn't really matter when you submit your transaction to them. If their claim is to be trusted that a submitted transaction will be mined by Mara pool non-publicly and the pool doesn't exploit your transaction you could submit it at any time (maybe 90min after Mara's last block).
What if the key finder will post the transaction with a very large fee, like 10K, will this somehow affect the timings?
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Looking for more information about puzzle 66 transaction issue and how to prevent such situation. What does it mean for us, which puzzles are still secure from such outcome?
For how long a transaction can be blocked by the processing party?
For how long a transaction can be blocked by the processing party?
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
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)
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.
Re: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==
If (hypothetically) you found the private key for puzzle 66, and simply tried to spend puzzle 66's BTC balance to another wallet that you control, you better hope that that transaction gets mined into the next block
within a few seconds, or it will be stolen with 100% certainty. This is also the case for the next few puzzles, 67,68,69...
within a few seconds, or it will be stolen with 100% certainty. This is also the case for the next few puzzles, 67,68,69...
You mean that the Public Key will become visible to everyone BEFORE the bitcoins have moved to the new bitcoin address?
Is this what you are saying?
Will someone be able to beat my transaction and have his trasaction go thru before mine?
Re: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==
So, has anyone figured out a bulletproof way to spend puzzle 66's inputs, once the key is found, without the internet-of-bots stealing the prize? Other than trying to find a big enough mining pool that will mine your transaction into a block and not expose the transaction to the mempool? Could any mining pool even be trusted to that extent?
I cant belive that I read this BS again on this forum. Are you out of your mind? Why the hell do you need a mining pool?
I have read a similar BS from another user in another topic, that is talking about miners.
You dont need any miners to get the money, when you got the privatekey, you can immediately take control of the bitcoins. Do you really dont know how?
It's a blast to solve Puzzle 65, 66, 67, 68. It takes about 60 seconds once we identify the public key from the blockchain.
Here i tested my toddler bot script on Puzzle 65 = address -> 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
root@puzzle ~/Test # time python3 toddler_puzzle_bot.py
Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
Endomorphism enabled
Threads : 12
Search compress only
Quiet thread output
K factor 4096
Mode BSGS sequential
Opening file 65.txt
Added 1 points from file
Bit Range 65
-- from : 0x10000000000000000
-- to : 0x20000000000000000
N = 0x100000000000
Bloom filter for 17179869184 elements : 58890.60 MB
Bloom filter for 536870912 elements : 1840.33 MB
Bloom filter for 16777216 elements : 57.51 MB
Allocating 256.00 MB for 16777216 bP Points
Reading bloom filter from file keyhunt_bsgs_4_17179869184.blm .... Done!
Reading bloom filter from file keyhunt_bsgs_6_536870912.blm .... Done!
Reading bP Table from file keyhunt_bsgs_2_16777216.tbl .... Done!
Reading bloom filter from file keyhunt_bsgs_7_16777216.blm .... Done!
Thread Key found privkey 1a838b13505b26867
Publickey 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
All points were found
Private Key: 1a838b13505b26867
WIF Key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZM21gaY8WN2CdwnTG57
Starting Electrum ....
starting daemon (PID 41802)
true
Keypair imported: 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
Transaction IDs: []
Daemon stopped
Electrum daemon stopped successfully.
real 2m46.311s
user 1m55.133s
sys 0m59.598s
and the time required to import the key into Electrum and start the redirection of transactions (if they exist ).
The 10 minutes is the average time and this is a pretty stupid circumstance. At this stage, the transaction has
entered the mempool and remains 'Pending,' waiting for confirmation.
It only takes a matter of seconds (for such a small range) to obtain the private key from public key, after which
you (or a thousand of them) can replace the still-unconfirmed transaction in the mempool.
In other words, you need a very strong miner to speed up (prioritize) the transaction to go through the mempool in
one (or less than) minute for puzzle 66, 67, 68, 69.
Are you replying to me, or just randomly hallucinating? What is the purpose of your writing?
Re: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==
So, has anyone figured out a bulletproof way to spend puzzle 66's inputs, once the key is found, without the internet-of-bots stealing the prize? Other than trying to find a big enough mining pool that will mine your transaction into a block and not expose the transaction to the mempool? Could any mining pool even be trusted to that extent?
I cant belive that I read this BS again on this forum. Are you out of your mind? Why the hell do you need a mining pool?
I have read a similar BS from another user in another topic, that is talking about miners.
You dont need any miners to get the money, when you got the privatekey, you can immediately take control of the bitcoins. Do you really dont know how?
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!
Pls, HELP ME!!!!!
Find a major miner here who is willing to purchase the private key from you. Conduct this transaction in a public setting to guarantee transparency and prevent possible fraud.Good luck...
I need some advice on how to publicly conduct a transaction. How can I safely hand over the key and ensure I get paid at the right moment? Any ideas on this?
You should first mix the private key and a secret message together, then post the SHA-256 hash of that combination here. For example, if your private key in hex format is '36b0f7381163cd38c' and your secret message is 'helloitsme123xyz', you should post the SHA-256 hash of the concatenated string here immediately.
Next, you need to find a miner. There are many people here who have claimed to be miners, so if any of them can assist, please help this person.
All dealings between you and the miner should be conducted in this forum. I think 5 bitcoins for you and the rest for the miner should be sufficient.
As soon as the miner receives the correct private key, they should post here confirming that they have received the correct private key. If the miner tries to deceive and claims the private key is incorrect, your posted hash will verify whether you are right or wrong.
These are my thoughts, but you can take opinions from others on how to complete this task honestly.
Just ensure that all discussions take place exclusively within this forum. Avoid any miner who is not willing to communicate here.
I'm providing you with a simple script. Completely disconnect your PC from the internet, run this script, and then upload the hash immediately. Do not perform this task on any online site.
Code
Code:
import hashlib
# input private key + strong secret message
secret_key = input('Enter your secret key: ')
hash_hex = hashlib.sha256(secret_key.encode()).hexdigest()
# Post this hash right now
print(f'The SHA-256 hash of the secret key is: {hash_hex}')
# input private key + strong secret message
secret_key = input('Enter your secret key: ')
hash_hex = hashlib.sha256(secret_key.encode()).hexdigest()
# Post this hash right now
print(f'The SHA-256 hash of the secret key is: {hash_hex}')
This is not OK, the moderators should block this zahid888 user. Spreading false information should not be allowed. People here dont need bs...
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!
Pls, HELP ME!!!!!
I assume that you are joking/trolling, if you got the private key, you for sure need to know how to get the money.
I have a question
It is for people who know the Kangaroo program well.
Kangaroo program has a multiple pubkey search feature, but it searches sequentially. that is, key1 key2 key3. It does not search for key2 before key1 is found. Likewise, it does not search for key3 unless key2 is found. I AM GIVING AN EXAMPLE. We have created 500 pubkeys. Is it possible to search all of them at the same time? Is there anyone working on this? can you share?
It is for people who know the Kangaroo program well.
Kangaroo program has a multiple pubkey search feature, but it searches sequentially. that is, key1 key2 key3. It does not search for key2 before key1 is found. Likewise, it does not search for key3 unless key2 is found. I AM GIVING AN EXAMPLE. We have created 500 pubkeys. Is it possible to search all of them at the same time? Is there anyone working on this? can you share?
It is like getting a taxi and asking to drive to multiple directions at the same time.