Search content
Sort by
Showing 16 of 16 results by ihsotas91
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I realized something strange after some tests.
I have a lot of equipment. All running for searches about these puzzles.
To have fun, I chose to search via vanity in last days.
I have desktops and notebooks with latest and powerful intel chips, nvidia graphics, 120GB DDR5 etc. each. On vanity, these setups find ~20 addresses per day for each.
However, when I applied vanity via apple silicone chips (M1, M2, M3), daily found vanity addresses ~500 per each setup.
I observed the behavior, and when it finds a vanity address in the pool I search, immediately it finds 5-6 addresses more in milliseconds, it is moving to the numbers to check that might have the vanity around some near numbers while I'm generating those numbers using "random".
For example:
1MVDYUvrcMqdprCTYuthuaQxWWAL8Ty2KS 220647290646478288674
1MVDYE2EHY3VR3AXKrD7mYvpSgD2SGgqZb 257335783054352585279
1MVDYuE5HGPjYaEH72sZukwNXhdtdKSQRY 280101386265359359876
1MVDYNcMjPsAW1PQgjwCGRNwijJMSW1UcR 274962343828436157207
1MVDYGms9qGRsrDD7AuoyYJBZnJTzAj9B8 213173989571665196391
1MVDYnfq7s3yG8fdnhQ66cqDa4h2DNoGeB 247904416465366500764
1MVDYY8GUU8or4WfLSrsbHip8F7pwA4xpv 243282287509672730681
1MVDYxMNG8fKf9fvX3r5PmwNXY8tjfESsu 245042251007899478320
1MVDY8aYEQsCWqU2MVWRjhrLHaX28SHFky 270190501490895327846
These are found in the same second and it keeps this behavior.
This behavior made me crazy guys. I do not understand how it can do this.
I have a lot of equipment. All running for searches about these puzzles.
To have fun, I chose to search via vanity in last days.
I have desktops and notebooks with latest and powerful intel chips, nvidia graphics, 120GB DDR5 etc. each. On vanity, these setups find ~20 addresses per day for each.
However, when I applied vanity via apple silicone chips (M1, M2, M3), daily found vanity addresses ~500 per each setup.
I observed the behavior, and when it finds a vanity address in the pool I search, immediately it finds 5-6 addresses more in milliseconds, it is moving to the numbers to check that might have the vanity around some near numbers while I'm generating those numbers using "random".
For example:
1MVDYUvrcMqdprCTYuthuaQxWWAL8Ty2KS 220647290646478288674
1MVDYE2EHY3VR3AXKrD7mYvpSgD2SGgqZb 257335783054352585279
1MVDYuE5HGPjYaEH72sZukwNXhdtdKSQRY 280101386265359359876
1MVDYNcMjPsAW1PQgjwCGRNwijJMSW1UcR 274962343828436157207
1MVDYGms9qGRsrDD7AuoyYJBZnJTzAj9B8 213173989571665196391
1MVDYnfq7s3yG8fdnhQ66cqDa4h2DNoGeB 247904416465366500764
1MVDYY8GUU8or4WfLSrsbHip8F7pwA4xpv 243282287509672730681
1MVDYxMNG8fKf9fvX3r5PmwNXY8tjfESsu 245042251007899478320
1MVDY8aYEQsCWqU2MVWRjhrLHaX28SHFky 270190501490895327846
These are found in the same second and it keeps this behavior.
This behavior made me crazy guys. I do not understand how it can do this.
There are already plenty of people using the same trick or method to find private keys within a similar range, as I mentioned. It's not surprising or new information to most of us. Developers have known for a while that there are tens of thousands of addresses like this clustered in the same range. You spent time, energy, and resources on this approach, but it may not be as productive as you hoped. My intention is not to stop you but to educate you.
Thank you. I thought the same in the beginning. However check the range for the addresses I shared, it is not a small range to cluster easily.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I realized something strange after some tests.
I have a lot of equipment. All running for searches about these puzzles.
To have fun, I chose to search via vanity in last days.
I have desktops and notebooks with latest and powerful intel chips, nvidia graphics, 120GB DDR5 etc. each. On vanity, these setups find ~20 addresses per day for each.
However, when I applied vanity via apple silicone chips (M1, M2, M3), daily found vanity addresses ~500 per each setup.
I observed the behavior, and when it finds a vanity address in the pool I search, immediately it finds 5-6 addresses more in milliseconds, it is moving to the numbers to check that might have the vanity around some near numbers while I'm generating those numbers using "random".
For example:
1MVDYUvrcMqdprCTYuthuaQxWWAL8Ty2KS 220647290646478288674
1MVDYE2EHY3VR3AXKrD7mYvpSgD2SGgqZb 257335783054352585279
1MVDYuE5HGPjYaEH72sZukwNXhdtdKSQRY 280101386265359359876
1MVDYNcMjPsAW1PQgjwCGRNwijJMSW1UcR 274962343828436157207
1MVDYGms9qGRsrDD7AuoyYJBZnJTzAj9B8 213173989571665196391
1MVDYnfq7s3yG8fdnhQ66cqDa4h2DNoGeB 247904416465366500764
1MVDYY8GUU8or4WfLSrsbHip8F7pwA4xpv 243282287509672730681
1MVDYxMNG8fKf9fvX3r5PmwNXY8tjfESsu 245042251007899478320
1MVDY8aYEQsCWqU2MVWRjhrLHaX28SHFky 270190501490895327846
These are found in the same second and it keeps this behavior.
This behavior made me crazy guys. I do not understand how it can do this.
I have a lot of equipment. All running for searches about these puzzles.
To have fun, I chose to search via vanity in last days.
I have desktops and notebooks with latest and powerful intel chips, nvidia graphics, 120GB DDR5 etc. each. On vanity, these setups find ~20 addresses per day for each.
However, when I applied vanity via apple silicone chips (M1, M2, M3), daily found vanity addresses ~500 per each setup.
I observed the behavior, and when it finds a vanity address in the pool I search, immediately it finds 5-6 addresses more in milliseconds, it is moving to the numbers to check that might have the vanity around some near numbers while I'm generating those numbers using "random".
For example:
1MVDYUvrcMqdprCTYuthuaQxWWAL8Ty2KS 220647290646478288674
1MVDYE2EHY3VR3AXKrD7mYvpSgD2SGgqZb 257335783054352585279
1MVDYuE5HGPjYaEH72sZukwNXhdtdKSQRY 280101386265359359876
1MVDYNcMjPsAW1PQgjwCGRNwijJMSW1UcR 274962343828436157207
1MVDYGms9qGRsrDD7AuoyYJBZnJTzAj9B8 213173989571665196391
1MVDYnfq7s3yG8fdnhQ66cqDa4h2DNoGeB 247904416465366500764
1MVDYY8GUU8or4WfLSrsbHip8F7pwA4xpv 243282287509672730681
1MVDYxMNG8fKf9fvX3r5PmwNXY8tjfESsu 245042251007899478320
1MVDY8aYEQsCWqU2MVWRjhrLHaX28SHFky 270190501490895327846
These are found in the same second and it keeps this behavior.
This behavior made me crazy guys. I do not understand how it can do this.
Do you have a binary to search vanity which runs on Silicon CPUs? I could not find any nor make it work, a lot of libraries are only for intel.
Could you share it ?
It is very simple vanity search written in Python
import sqlite3
import random
from bit import Key
import bitcoin
# Connect to btc.db for checking address existence
btc_conn = sqlite3.connect('btc.db')
btc_cursor = btc_conn.cursor()
# Connect to vanity_addresses.db for storing found vanity addresses
vanity_conn = sqlite3.connect('vanity_addresses.db')
vanity_cursor = vanity_conn.cursor()
# Create a table in vanity_addresses.db to store vanity addresses and private keys
vanity_cursor.execute('''
CREATE TABLE IF NOT EXISTS vanity_addresses (
address TEXT PRIMARY KEY,
private_key TEXT
)
''')
vanity_conn.commit()
def existInBtcDb(search_term):
query = 'SELECT EXISTS(SELECT 1 FROM btc WHERE address = ? LIMIT 1)'
btc_cursor.execute(query, (search_term,))
# Fetch the result
exists = btc_cursor.fetchone()[0]
# Return True if exists is 1, else False
return exists == 1
def generate_vanity_address(prefix):
while True:
# Generate a new private key
private_key = random.randint(147573952589676412927, 295147905179352825855)
# Compute the corresponding public key
key = Key.from_int(private_key)
addr = key.address
addr_uncompressed = bitcoin. privkey_to_address(private_key)
if existInBtcDb(addr) or existInBtcDb(addr_uncompressed):
try:
filename = f"found/found_{private_key}.txt"
with open(filename, 'w') as f:
f.write(f'{private_key}, {addr}\n')
except Exception as e:
print(
f'Error while writing to file: {private_key}. Error: {e}')
if addr.startswith(prefix):
# Insert found vanity addresses into the vanity_addresses.db database
vanity_cursor.execute(
'INSERT INTO vanity_addresses (address, private_key) VALUES (?, ?)', (addr, str(private_key)))
vanity_conn.commit()
if addr_uncompressed.startswith(prefix):
# Insert found vanity addresses into the vanity_addresses.db database
vanity_cursor.execute(
'INSERT INTO vanity_addresses (address, private_key) VALUES (?, ?)', (addr_uncompressed, str(private_key)))
vanity_conn.commit()
# Log that a vanity address was found
# print(
# "Vanity Address found and inserted into the vanity_addresses.db database:", addr)
prefix = '1MVDY'
generate_vanity_address(prefix)
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I realized something strange after some test.
I have a lot of equipment. All running for searches about these puzzles.
To have fun, I chose to search via vanity in last days.
I have desktops and notebooks with latest and powerful intel chips, nvidia graphics, 120GB DDR5 etc. each. On vanity, these setups find ~20 addresses per day for each.
However, when I applied vanity via apple silicone chips (M1, M2, M3), daily found vanity addresses ~500.
I observed the behavior, and when it picks a vanity address in the pool I search, immediately it finds 5-6 addresses more in milliseconds, it is moving to the numbers to check that might have the vanity around some near numbers for example
1MVDYUvrcMqdprCTYuthuaQxWWAL8Ty2KS 220647290646478288674
1MVDYE2EHY3VR3AXKrD7mYvpSgD2SGgqZb 257335783054352585279
1MVDYuE5HGPjYaEH72sZukwNXhdtdKSQRY 280101386265359359876
1MVDYNcMjPsAW1PQgjwCGRNwijJMSW1UcR 274962343828436157207
1MVDYGms9qGRsrDD7AuoyYJBZnJTzAj9B8 213173989571665196391
1MVDYnfq7s3yG8fdnhQ66cqDa4h2DNoGeB 247904416465366500764
1MVDYY8GUU8or4WfLSrsbHip8F7pwA4xpv 243282287509672730681
1MVDYxMNG8fKf9fvX3r5PmwNXY8tjfESsu 245042251007899478320
1MVDY8aYEQsCWqU2MVWRjhrLHaX28SHFky 270190501490895327846
These are found in the same second and it keeps this behavior.
This behavior made me crazy guys. I do not understand how it can do this.
I have a lot of equipment. All running for searches about these puzzles.
To have fun, I chose to search via vanity in last days.
I have desktops and notebooks with latest and powerful intel chips, nvidia graphics, 120GB DDR5 etc. each. On vanity, these setups find ~20 addresses per day for each.
However, when I applied vanity via apple silicone chips (M1, M2, M3), daily found vanity addresses ~500.
I observed the behavior, and when it picks a vanity address in the pool I search, immediately it finds 5-6 addresses more in milliseconds, it is moving to the numbers to check that might have the vanity around some near numbers for example
1MVDYUvrcMqdprCTYuthuaQxWWAL8Ty2KS 220647290646478288674
1MVDYE2EHY3VR3AXKrD7mYvpSgD2SGgqZb 257335783054352585279
1MVDYuE5HGPjYaEH72sZukwNXhdtdKSQRY 280101386265359359876
1MVDYNcMjPsAW1PQgjwCGRNwijJMSW1UcR 274962343828436157207
1MVDYGms9qGRsrDD7AuoyYJBZnJTzAj9B8 213173989571665196391
1MVDYnfq7s3yG8fdnhQ66cqDa4h2DNoGeB 247904416465366500764
1MVDYY8GUU8or4WfLSrsbHip8F7pwA4xpv 243282287509672730681
1MVDYxMNG8fKf9fvX3r5PmwNXY8tjfESsu 245042251007899478320
1MVDY8aYEQsCWqU2MVWRjhrLHaX28SHFky 270190501490895327846
These are found in the same second and it keeps this behavior.
This behavior made me crazy guys. I do not understand how it can do this.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Hello friends,
I have thoughts that the creator of 120 - 125 - and 130 wallets has moved to 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs wallet.
17s2b9ksz5y7abUm92cHwG8jEPCzK3dLnT on 27/02/2023
1PXAyUB8ZoH3WD8n5zoAthYjN15yN5CVq5 on 09/07/2023
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 on 24/09/2024
all of these are being transferred to 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs. But for some reason, as of 27/02/2023, not even $1 can be withdrawn or processed? Another person who doesn't need it?
I have thoughts that the creator of 120 - 125 - and 130 wallets has moved to 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs wallet.
17s2b9ksz5y7abUm92cHwG8jEPCzK3dLnT on 27/02/2023
1PXAyUB8ZoH3WD8n5zoAthYjN15yN5CVq5 on 09/07/2023
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 on 24/09/2024
all of these are being transferred to 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs. But for some reason, as of 27/02/2023, not even $1 can be withdrawn or processed? Another person who doesn't need it?
What I do not understand is they are not even converting it to USDT or trading with some other coins etc.
So it is not about anonymity. Most probably does not need it..
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
The creator intentionally left 10% of the BTC from puzzle 66 behind so that some fool would actually go to Binance and withdraw it, placing all the blame on the poor person who had no intention of stealing.
How we can safely withdraw?
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
120, 125 and 130.
captured by hacker ? because this address is 1DiegoU6ETJXK9hNWVTeuK4Y8fkksPnEnK seem fishy with 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs
and he's announce this "https://www.blockchain.com/explorer/transactions/btc/69888f5e55d414b8de65f3a9307a1f414d7035cf9142239045300ce018984bd4"
the next target to take and spend.
{
"address": "1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9",
"pkscript": "76a914739437bb3dd6d1983e66629c5f08c70e5276937188ac",
"value": 1231,
"spent": false,
"spender": null
},
it's 67, anyone who can find even 67, the transactions will be attacked by this person.
ngl, this guy very smart and genius build the transaction and from the number of transactions increasing slowly and rhythmically.
captured by hacker ? because this address is 1DiegoU6ETJXK9hNWVTeuK4Y8fkksPnEnK seem fishy with 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs
and he's announce this "https://www.blockchain.com/explorer/transactions/btc/69888f5e55d414b8de65f3a9307a1f414d7035cf9142239045300ce018984bd4"
the next target to take and spend.
{
"address": "1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9",
"pkscript": "76a914739437bb3dd6d1983e66629c5f08c70e5276937188ac",
"value": 1231,
"spent": false,
"spender": null
},
it's 67, anyone who can find even 67, the transactions will be attacked by this person.
ngl, this guy very smart and genius build the transaction and from the number of transactions increasing slowly and rhythmically.
You are right about the attack. However about 3Emi, I do not think so, that transaction you shared does not belong to 3Emi, it belongs to a lamer, a noob, a very beginner who does not know anything.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 has been emptied half hour ago Probably owner get fear from script...
Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
Probably owner get fear from script...Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
120 is also solved by 3Emi.
This 3Emi guy is definitely hiding something, or the creator himself..
Key 130 was found by the same person as the previous two.
I think he used Kangaro, and this person is a miner. The timing is roughly consistent.
I also don't think he will share the keys he found and how exactly he found them.
yeah I agree. I am using vanity for the small ones. For example there are around 10 Billion addresses starts with "1BY8G" between 2^66 and 2^67. I run 10 vanity search instances and daily around 300 unique addresses found. It is kind of a lottery for me. 300/10B is very good probability.
As for using Kangaroo method for 130bit ... as far as i know none of the publicly available software was able to do it cause they were limited to 125 or 128 bit (i don't remember).
BTW How is vanity search "better" than normal brute force ? Isn't it like you still just randomly generate private keys and check if they match given address ? If so ... then all you do is saving addresses that starts with the same characters but it doesn't increase your chances. Correct me please if i'm wrong.
For the one which does not have public key and small I am using this just for fun. If it does not have public key, and you brute force between 2^66 and 2^67, and if you check 1B records per second, your chance will be 1B * 60 * 60 * 24 / 2^66 per day. Currently 10 vanity instances find 300-400 unique records per day, and as I explained there are approximately 10B addresses starts with "1BY8G" between 2^66 and 2^67. However most probably vanity will stuck when the count reaches big numbers because it will hit same addresses most probably and the find rate will decrease. I did not say it is better from brute forcing, I just enjoy this way of doing the search. It will be around 100K vanity records per year, if I am lucky it will hit that address, if not who cares
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 has been emptied half hour ago Probably owner get fear from script...
Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
Probably owner get fear from script...Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
120 is also solved by 3Emi.
This 3Emi guy is definitely hiding something, or the creator himself..
Key 130 was found by the same person as the previous two.
I think he used Kangaro, and this person is a miner. The timing is roughly consistent.
I also don't think he will share the keys he found and how exactly he found them.
yeah I agree. I am using vanity for the small ones. For example there are around 10 Billion addresses starts with "1BY8G" between 2^66 and 2^67. I run 10 vanity search instances and daily around 300 addresses found. It is kind of a lottery for me. 300/10B is very good probability.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Hi Guys, Lets say I have the key for puzzle 68 already , How can I spend it safely as I have seen what happned with puzzle 65 , Please can someone help will tip
what happened with puzzle 65?
the guy sent the bitcoins out that found the privatekey, someone used the public adddress to quickly crack the privatekey and re-sent the btc to himself using a higher fee and his was taken
from bitcoinlib.wallets import Wallet
from bitcoinlib.transactions import Transaction
# Connect to Bitcoin mainnet
network = 'bitcoin'
# Create a wallet from a private key
private_key = 'your_private_key_here'
wallet = Wallet.create("YourWalletName", keys=private_key, network=network)
# Define the recipient address and the amount to send (in satoshis)
recipient_address = 'your_recipient_address_here'
amount = 100000 # Amount in satoshis (1 BTC = 100,000,000 satoshis)
# Create and sign the transaction
tx = Transaction.create(wallet.get_key().address, recipient_address, amount, network=network)
tx.sign()
# Broadcast the transaction to the network
tx.send()
# Print transaction details
print(f'Transaction ID: {tx.txid}')
print(f'Transaction Hex: {tx.as_hex()}')
by this kind of python script you can immediately transfer, make sure you are transferring whole amount at once otherwise it will take 4-5 minutes to find private key from the exposed public key for 68, try script on other accounts before use it for 68.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 has been emptied half hour ago Probably owner get fear from script...
Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
Probably owner get fear from script...Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs.
120 is also solved by 3Emi.
This 3Emi guy definitely hiding something..
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I think rather than brute forcing I like playing vanity game, it is more exciting..
import sqlite3
import random
from bit import Key
import bitcoin
# Connect to vanity_addresses.db for storing found vanity addresses
vanity_conn = sqlite3.connect('vanity_addresses.db')
vanity_cursor = vanity_conn.cursor()
# Create a table in vanity_addresses.db to store vanity addresses and private keys
vanity_cursor.execute('''
CREATE TABLE IF NOT EXISTS vanity_addresses (
address TEXT PRIMARY KEY,
private_key TEXT
)
''')
vanity_conn.commit()
def generate_vanity_address(prefix):
while True:
private_key = random.randint(2**66, 2**67)
key = Key.from_int(private_key)
addr = key.address
addr_uncompressed = bitcoi[Suspicious link removed]ivkey_to_address(private_key)
if addr.startswith(prefix):
# Insert found vanity addresses into the vanity_addresses.db database
vanity_cursor.execute(
'INSERT INTO vanity_addresses (address, private_key) VALUES (?, ?)', (addr, str(private_key)))
vanity_conn.commit()
if addr_uncompressed.startswith(prefix):
# Insert found vanity addresses into the vanity_addresses.db database
vanity_cursor.execute(
'INSERT INTO vanity_addresses (address, private_key) VALUES (?, ?)', (addr_uncompressed, str(private_key)))
vanity_conn.commit()
prefix = '1BY8G'
while True:
generate_vanity_address(prefix)
import sqlite3
import random
from bit import Key
import bitcoin
# Connect to vanity_addresses.db for storing found vanity addresses
vanity_conn = sqlite3.connect('vanity_addresses.db')
vanity_cursor = vanity_conn.cursor()
# Create a table in vanity_addresses.db to store vanity addresses and private keys
vanity_cursor.execute('''
CREATE TABLE IF NOT EXISTS vanity_addresses (
address TEXT PRIMARY KEY,
private_key TEXT
)
''')
vanity_conn.commit()
def generate_vanity_address(prefix):
while True:
private_key = random.randint(2**66, 2**67)
key = Key.from_int(private_key)
addr = key.address
addr_uncompressed = bitcoi[Suspicious link removed]ivkey_to_address(private_key)
if addr.startswith(prefix):
# Insert found vanity addresses into the vanity_addresses.db database
vanity_cursor.execute(
'INSERT INTO vanity_addresses (address, private_key) VALUES (?, ?)', (addr, str(private_key)))
vanity_conn.commit()
if addr_uncompressed.startswith(prefix):
# Insert found vanity addresses into the vanity_addresses.db database
vanity_cursor.execute(
'INSERT INTO vanity_addresses (address, private_key) VALUES (?, ?)', (addr_uncompressed, str(private_key)))
vanity_conn.commit()
prefix = '1BY8G'
while True:
generate_vanity_address(prefix)
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I guess finders are never gonna share solutions for 120, 125 and 130?
lol are you guys gonna try vanity 1Prestige1zSYorBdz94KA2UbJW3hYLTn4 instead of search 67?
lol are you guys gonna try vanity 1Prestige1zSYorBdz94KA2UbJW3hYLTn4 instead of search 67?
possibility of finding 67 via vanity > possibility to find 1Prestige between 0 and 2^256 Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Hi Guys, Lets say I have the key for puzzle 68 already , How can I spend it safely as I have seen what happned with puzzle 65 , Please can someone help will tip
what happened with puzzle 65?
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
https://privatekeys.pw/address/bitcoin/1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
For other addresses you can check using hash:
Public Key Hash (Hash 160):
739437bb3dd6d1983e66629c5f08c70e52769371
Based on the puzzle's statistics, the private key for 67 is likely around 95XXXXXX. If anyone finds it within this range, I’d be more than happy to accept some gifts!
bc1q4xj4maw4csvn084zwjtrgzg8tk08660mxj6wnw
For other addresses you can check using hash:
Public Key Hash (Hash 160):
739437bb3dd6d1983e66629c5f08c70e52769371
Based on the puzzle's statistics, the private key for 67 is likely around 95XXXXXX. If anyone finds it within this range, I’d be more than happy to accept some gifts!
bc1q4xj4maw4csvn084zwjtrgzg8tk08660mxj6wnw
Your statistics must be fantastic (none of them are working because the you was generated randomly), but it is very unlikely the private key for 67 is likely around 95XXXXXX because it is out if it's range. If I were you I wouldn't expect too much gifts.
The range for 67 is between 73786976294838206463 and 147573952589676412927
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Can you share the address of puzzle 67 that starts with bc and 3. I don't know how to find it. Someone previously shared the address for puzzle 66 that starts with bc and 3. Can you share it for puzzle 67 too?
__https://i.imgur.com/reTwOd9.png
For puzzle 67 on website we can see the same address:
Code:
Bitcoin:
W bc1qww2r0wea6mges0nxv2w97zx8pef8dym3x2g8t3
0 0 0
W bc1qww2r0wea6mges0nxv2w97zx8pef8dym3x2g8t3
0 0 0
but how can we find the other addresses that have the same private key for bitcoin like we have for puzzle 66 without having the private key?
Code:
Bitcoin:
U 138XxHZGcKM6WyWuYCijLsoCd8K3x4WYjs
0 0 0
S 3PdQoXyQwWmerpt3SbF7Hbh3aukC5w28GP
0 0.00046714 4
W bc1qyr2956nky56hqr8fuzepdccejse4mw994lyftn
0 0.00006001 2
T bc1pgchl8k5hhxnlcfd3tmxp8vfk9jks438msjkth5lg93fzmskwy6js0kuqd2
0 0 0
U 138XxHZGcKM6WyWuYCijLsoCd8K3x4WYjs
0 0 0
S 3PdQoXyQwWmerpt3SbF7Hbh3aukC5w28GP
0 0.00046714 4
W bc1qyr2956nky56hqr8fuzepdccejse4mw994lyftn
0 0.00006001 2
T bc1pgchl8k5hhxnlcfd3tmxp8vfk9jks438msjkth5lg93fzmskwy6js0kuqd2
0 0 0
https://privatekeys.pw/address/bitcoin/1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9#google_vignette
import ecdsa
from ecdsa import SECP256k1
from ecdsa.ellipticcurve import Point
import bitcoin
def point_halving(point):
""" Halving the provided point """
return point * 57896044618658097711785492504343953926418782139537452191302581570759080747169
def point_subtract(point, other, curve):
"""Subtract one point from another on the given elliptic curve."""
# Inverting the y-coordinate of 'other' point
inverse_y = (-other.y() % curve.p())
inverse_point = Point(curve, other.x(), inverse_y)
# Adding point to the inverse of the other point
return point + inverse_point
def get_first_point():
pubkey = bitcoi[Suspicious link removed]ivkey_to_pubkey(1)
return Point(SECP256k1.curve,
pubkey[0],
pubkey[1])
def get_infinity_point():
return Point(SECP256k1.curve,
None,
None)
def slope_at_point(point, a):
"""Calculate the slope at a given point on the elliptic curve."""
try:
slope = (3 * point.x()**2 + a) / (2 * point.y())
except ZeroDivisionError:
raise ValueError("Slope is undefined for y=0.")
return slope
def is_point_odd(P):
slope = (slope_at_point(P, SECP256k1.curve.a()))
if slope % 3 >= 1:
return "odd"
else:
return "even"
def get_private_key_from_public_point(point):
""" Extracts private key from a public key point, this method reverses Double and Add method by Subtract and Halve """
G = ecdsa.SECP256k1.generator
NEXT = point
BINARY_ORDER = ""
for i in range(0, 256):
if NEXT == get_first_point():
break
PSUB = point_subtract(NEXT, G, SECP256k1.curve)
SUBTRACT_AND_HALVE = point_halving(PSUB)
JUST_HALVE = point_halving(NEXT)
IPO = is_point_odd(NEXT)
if IPO == "odd":
BINARY_ORDER = BINARY_ORDER + "1"
NEXT = SUBTRACT_AND_HALVE
else:
BINARY_ORDER = BINARY_ORDER + "0"
NEXT = JUST_HALVE
return int(BINARY_ORDER, 2)
G = ecdsa.SECP256k1.generator
PK = 880564733841876926926749214863536422911
pubkey = bitcoi[Suspicious link removed]ivkey_to_pubkey(
PK)
Q = Point(SECP256k1.curve,
pubkey[0],
pubkey[1])
PKV = get_private_key_from_public_point(Q)
print(PKV)
assert PK == PKV
Find the real implementation of "is_point_odd" method, or check JUST_HALVE, when you halve the point, if JUST_HALVE is on the left side of the curve, this means NEXT is even. Find the way, and break the curve.
I'm done. I lost all my money, my job, my wife left me, and I lost all my years by being a slave to others for a living.
I'm planning to end my life.
My followers will continue work on this, but I want to make this code public.
This is the donation address, if one day anyone wants to support my scholars:
1XXXSTL5DrcyvBfF64riYvdchZjCF6Nt9