1 billion computers running at 100% usage for 24 hours.
This number only shows how impossible it is to solve.
Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 56. (Read 245098 times)
This number only shows how impossible it is to solve.
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 = bitcoin. privkey_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'
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 = bitcoin. privkey_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'
generate_vanity_address(prefix)
More and more skeptical of these puzzles, the creators are playing a trick on us 
"Here is my own assumption being profered as straight facts without any proof"
Where is the evidence to back all this fud about the creator of this challenge?
Where is the evidence to back all this fud about the creator of this challenge?
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 It will not be the creator, the more people search for puzzle addresses, the greater the chance of solving them
To give an example, if 1,000,000 computers start solving puzzle 67, there is a good chance you will solve it in one day
To give an example, if 1,000,000 computers start solving puzzle 67, there is a good chance you will solve it in one day
Wrong example. I think you meant 1 billion computers running at 100% usage for 24 hours.
https://www.blockchain.com/explorer/transactions/btc/91ec88f5d6d6cc727e0205d3aa3709fee507df05140d187846cf22aef784621a
someone just took out the 130 bit.
dang, it's creator or someone else did samething with 66 bit ?
"outputs": [
{
"address": "1Prestige1zSYorBdz94KA2UbJW3hYLTn4",
"pkscript": "76a914fab6c492ff6de8e5080faa86847e3374dcf042ce88ac",
"value": 1299999680,
"spent": false,
"spender": null
}
ngl, the way you can break the puzzle is from recent history of priv key has been found, if someone found it, and not tell the key, the puzzle is broken, you just need to think this is PUZZLE, and every piece is work together to assemble the next lossless piece.
someone just took out the 130 bit.
dang, it's creator or someone else did samething with 66 bit ?
"outputs": [
{
"address": "1Prestige1zSYorBdz94KA2UbJW3hYLTn4",
"pkscript": "76a914fab6c492ff6de8e5080faa86847e3374dcf042ce88ac",
"value": 1299999680,
"spent": false,
"spender": null
}
ngl, the way you can break the puzzle is from recent history of priv key has been found, if someone found it, and not tell the key, the puzzle is broken, you just need to think this is PUZZLE, and every piece is work together to assemble the next lossless piece.
so you shouldn't invest in it, just run the code on the cpu and voila, you can still try to guess the beginning of the range to speed up the solution
maybe hundreds of people puzzling addresses, but if the whole planet started looking for them, then those addresses would just get dusty
I've been trying to solve puzzle 130 for two years now. 6 GPUs. The puzzle creator is kidding with us. Yes, we are all donkeys. 
First (puzzle 66) there was a mockery with addresses like 1YouDeserveNothingxxxxxxx...
Now (puzzle 130) is going to address 1Prestige1xxxxxxxxxxxxx...
Puzzle 120 and 125 didn't even take altcoins ...
I knew it was a waste of time... It's still exciting but not worth to invest too much time or resources.
It will not be the creator, the more people search for puzzle addresses, the greater the chance of solving them
To give an example, if 1,000,000 computers start solving puzzle 67, there is a good chance you will solve it in one day
To give an example, if 1,000,000 computers start solving puzzle 67, there is a good chance you will solve it in one day
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?
I've been trying to solve puzzle 130 for two years now. 6 GPUs. The puzzle creator is kidding with us. Yes, we are all donkeys.
so today's computing power is able to solve 130 bits it's getting more and more interesting
I'm not sure that a normal person has so much hardware. It is unprofitable even if you are a multimillionaire.
Maybe we are not aware of current state of quantum computing ...
Anyway for most of us it is the end now ... We can only watch...
so today's computing power is able to solve 130 bits it's getting more and more interesting
I'm not sure that a normal person has so much hardware. It is unprofitable even if you are a multimillionaire.
do you know of a method to make 1000,000,000 public keys take up no more than 20MB of space in a text document?
130 puzzle gone, just hour ago. Congrats to "Prestige" 1Prestige1zSYorBdz94KA2UbJW3hYLTn4.
looks like he is a rich man, he has many gpu's... Try crack his vanity, they are more cracable then simple adressess
from what range you thant start ? My scruot what you help me make downgrade pubkey to 30 bits, from 2^130 to 2^100. Can you brute 2^100 fast ?
..
How do you downgrade keyspace from 2^130 to 2^100?
130 puzzle gone, just hour ago. Congrats to "Prestige" 1Prestige1zSYorBdz94KA2UbJW3hYLTn4.
looks like this is yours rng in multycore mode.Im read docs they write what this rng is good for multycore I think you not use all yours cores, bro.
And if that’s the case, you need to predict the exact range with minimal deviation. If anyone succeeds in that, all the puzzles will be solved soon.
too complex method I think, too complex methods not work as fom me
generate uniform distribution or another distribution may be moree goid result, then try to prefict ranges, but, I thin I can give you start of a ranges, but without right part(end of range)
we also can divide faster with your rng, get on of many what will be 2^^60 and brute 2^60 after.
... cold in New York outside, , therer start cold. My hands make mistakes then I write text in my phone
looks like this is yours rng in multycore mode.Im read docs they write what this rng is good for multycore I think you not use all yours cores, bro.
And if that’s the case, you need to predict the exact range with minimal deviation. If anyone succeeds in that, all the puzzles will be solved soon.
from what range you thant start ? My scruot what you help me make downgrade pubkey to 30 bits, from 2^130 to 2^100. Can you brute 2^100 fast ?
edit:
get full needed operations, or get more publeys and ><
edit:
in python I find 2^39 for
..804100000 operations.
Jump to: