Pages:
Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 38. (Read 245568 times)

?
Activity: -
Merit: -
All I wanna know is whether it was a manner of hopping or a manner of giant babies. Nothing more.

Of course it was a lot of crazy fast kangaroos  Cheesy
My kangaroos, not JLP's.
newbie
Activity: 30
Merit: 0
Quote
JLP did a great job by making his work open-source.
Though when I see K=2.08, or 3-4GH on 4090, or his code, or that annoying bug with displayed speed higher than real speed, problems with handling large db, etc... Yeah, it definitely looks like free open source  Grin
Anyway, it's a great start point.

I think he used JLP code for this puzzle 120

Judging by his posts, it's doubtful. Why does any time a puzzle is solved, the only option available is "they used JLP code"? Is he like the one and only and the best coder that ever existed? The God of puzzle solving?

JLP code showed its strength by solving Puzzle 115, and no wonder it could also be used for solving Puzzle 120. Let's wait for @RetiredCoder's reply.
member
Activity: 165
Merit: 26
Quote
JLP did a great job by making his work open-source.
Though when I see K=2.08, or 3-4GH on 4090, or his code, or that annoying bug with displayed speed higher than real speed, problems with handling large db, etc... Yeah, it definitely looks like free open source  Grin
Anyway, it's a great start point.

I think he used JLP code for this puzzle 120

Judging by his posts, it's doubtful. Why does any time a puzzle is solved, the only option available is "they used JLP code"? Is he like the one and only and the best coder that ever existed? The God of puzzle solving?
newbie
Activity: 30
Merit: 0
Quote
JLP did a great job by making his work open-source.
Though when I see K=2.08, or 3-4GH on 4090, or his code, or that annoying bug with displayed speed higher than real speed, problems with handling large db, etc... Yeah, it definitely looks like free open source  Grin
Anyway, it's a great start point.

I think he used JLP code for this puzzle 120
member
Activity: 165
Merit: 26
No OP must of been the solver.
What intrigues me is his final response.


Maybe someone was still solving puzzle 120. Purely out of boredom. Grin

All I wanna know is whether it was a manner of hopping or a manner of giant babies. Nothing more.
member
Activity: 503
Merit: 38
No OP must of been the solver.
What intrigues me is his final response.


Maybe someone was still solving puzzle 120. Purely out of boredom. Grin
?
Activity: -
Merit: -
No OP must of been the solver.
What intrigues me is his final response.
member
Activity: 165
Merit: 26
0000000000000000000000000000000000b10f22572c497a836ea187f2e1fc23


puzzle 120 key

Was the #120 puzzle key disclosed before that topic?
member
Activity: 503
Merit: 38
I think, I believe, In my opinion, I assume, I feel, I suppose, I consider, As far as I'm concerned..... Roll Eyes Roll Eyes Roll Eyes

I think – Because why not trust my gut over AI?
I believe – The heart knows more than facts, obviously.
In my opinion – Based on years of serious... Netflix watching.
I assume – Don't have the evidence, but hey, assumptions are basically facts, right?
I feel – Emotions? The most reliable source of objective truth.
I suppose – Basically Sherlock Holmes over here.
I consider – I considered doing the research, then didn’t.
...But hey, trust me, bro! I read it on the internet, so it must be true 😎
hero member
Activity: 862
Merit: 662
I think don't exists.

I think, I believe, In my opinion, I assume, I feel, I suppose, I consider, As far as I'm concerned..... Roll Eyes Roll Eyes Roll Eyes

What more guys? Any comment based in what you believe without any evidence, it is just that a mere comment without any research, so please avoid comment those as absolute true..
member
Activity: 165
Merit: 26
your super fast kangaroo program which nobody see and I think don't exists.

He's not the only one with a super fast version of a kangaroo here. Nomachine and kTimesG have their own versions as well. No one is obliged to tell us anything here. You need to research on your own.

Let us not forget that there may very well be a few among us that have either working-state or in-development FPGA or specialized ASIC versions os kangaroo, built by hardware engineers. Those guys may shut our mouth really quick if they ever disclose their 100x / 1000x greater speeds then our GPU-based implementations, under the same amount of watt power. 3Emi is the main suspect.

No one in their right mind would ever give out code or other stuff that in the next second becomes an asset for scammers. That doesn't make it non-existent.
jr. member
Activity: 42
Merit: 0
your super fast kangaroo program which nobody see and I think don't exists.

He's not the only one with a super fast version of a kangaroo here. Nomachine and kTimesG have their own versions as well. No one is obliged to tell us anything here. You need to research on your own.
newbie
Activity: 18
Merit: 0
Important info stored in here, related to the wallet challenges / puzzles :50BA1F083DE4F022B32996C8070B71F7D27A73E439AE20E5B87B85F3064835EDDB98AFF04FA09B4 D66EA70436C44D927B48408D85D4AB69E57CD466CF922E9A7

More to come...

Why just don't say it in plain words?
Or it's like your super fast kangaroo program which nobody see and I think don't exists.
You're strange.
Probably you should stop with puzzles...
I can confirm that his faster kangaroo version exists.
Why are you mad at him?
jr. member
Activity: 44
Merit: 2
Important info stored in here, related to the wallet challenges / puzzles :50BA1F083DE4F022B32996C8070B71F7D27A73E439AE20E5B87B85F3064835EDDB98AFF04FA09B4 D66EA70436C44D927B48408D85D4AB69E57CD466CF922E9A7

More to come...

Why just don't say it in plain words?
Or it's like your super fast kangaroo program which nobody see and I think don't exists.
You're strange.
Probably you should stop with puzzles...
newbie
Activity: 23
Merit: 0
Important info stored in here, related to the wallet challenges / puzzles :50BA1F083DE4F022B32996C8070B71F7D27A73E439AE20E5B87B85F3064835EDDB98AFF04FA09B4 D66EA70436C44D927B48408D85D4AB69E57CD466CF922E9A7

More to come...
hello! if it's not difficult, can you explain what it is?
jr. member
Activity: 37
Merit: 1
Simple program for puzzle 66 below.

If you want to search from a specific private key number both ways up and down, just use it:

Code:
#!/usr/bin/env python3

from hdwallet import HDWallet
from hdwallet.symbols import BTC
from tqdm import tqdm
from tqdm.contrib.concurrent import process_map

hdwallet = HDWallet(symbol=BTC)

p=0x000000000000000000000000000000000000000000000001a838b13505b26867
middle=p*2
mid=1000000

def go(i):
b=hex(i)
b='0'*(66-len(b))+b[2:]
hdwallet.from_private_key(private_key=b)
a=hdwallet.p2pkh_address()
if a=='13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so':
print('private key: 0x'+b+'\a')
exit()

process_map(go, [x for i in range(mid) for x in {middle-i:0,middle+i:0}], max_workers=10, chunksize=10000)

import sys
print('\a',end='',file=sys.stderr)

Here I set p for previous puzzle pvk and double it.
Middle is the variable from where the search will start.

I think your version have some errors, this version work to me:

Code:
#!/usr/bin/env python3

from hdwallet import HDWallet
from hdwallet.symbols import BTC
from tqdm.contrib.concurrent import process_map
import sys
import concurrent.futures

# Initialize HDWallet for BTC
hdwallet = HDWallet(symbol=BTC)

# Define constants
p = 0x000000000000000000000000000000000000000000000001a838b13505b26867
middle = p * 2
mid = 1000000

# Function to process private keys and check addresses
def go(i):
    # Calculate the private key from the iteration index
    private_key = middle - i if i % 2 == 0 else middle + i
    # Convert the private key to a hex string and ensure it's 64 characters
    b = hex(private_key)[2:].zfill(64)
    # Initialize wallet from private key
    hdwallet.from_private_key(private_key=b)
    # Get address
    address = hdwallet.p2pkh_address()
    # Check if the address matches the target
    if address == '13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so':
        print('Private key: 0x' + b + '\a')
        sys.exit()

# Main script execution with multiprocessing guard
if __name__ == "__main__":
    try:
        # Use process_map to parallelize the work
        process_map(go, range(mid), max_workers=10, chunksize=10000)
    except concurrent.futures.process.BrokenProcessPool:
        print("A process in the pool was terminated abruptly.", file=sys.stderr)
    except KeyboardInterrupt:
        print("Process interrupted.", file=sys.stderr)

    # Optional alert on script completion (in stderr)
    print('\a', end='', file=sys.stderr)
It would work only if the private for the next puzzle is even not odd .
newbie
Activity: 22
Merit: 1
Simple program for puzzle 66 below.

If you want to search from a specific private key number both ways up and down, just use it:

Code:
#!/usr/bin/env python3

from hdwallet import HDWallet
from hdwallet.symbols import BTC
from tqdm import tqdm
from tqdm.contrib.concurrent import process_map

hdwallet = HDWallet(symbol=BTC)

p=0x000000000000000000000000000000000000000000000001a838b13505b26867
middle=p*2
mid=1000000

def go(i):
b=hex(i)
b='0'*(66-len(b))+b[2:]
hdwallet.from_private_key(private_key=b)
a=hdwallet.p2pkh_address()
if a=='13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so':
print('private key: 0x'+b+'\a')
exit()

process_map(go, [x for i in range(mid) for x in {middle-i:0,middle+i:0}], max_workers=10, chunksize=10000)

import sys
print('\a',end='',file=sys.stderr)

Here I set p for previous puzzle pvk and double it.
Middle is the variable from where the search will start.

I think your version have some errors, this version work to me:

Code:
#!/usr/bin/env python3

from hdwallet import HDWallet
from hdwallet.symbols import BTC
from tqdm.contrib.concurrent import process_map
import sys
import concurrent.futures

# Initialize HDWallet for BTC
hdwallet = HDWallet(symbol=BTC)

# Define constants
p = 0x000000000000000000000000000000000000000000000001a838b13505b26867
middle = p * 2
mid = 1000000

# Function to process private keys and check addresses
def go(i):
    # Calculate the private key from the iteration index
    private_key = middle - i if i % 2 == 0 else middle + i
    # Convert the private key to a hex string and ensure it's 64 characters
    b = hex(private_key)[2:].zfill(64)
    # Initialize wallet from private key
    hdwallet.from_private_key(private_key=b)
    # Get address
    address = hdwallet.p2pkh_address()
    # Check if the address matches the target
    if address == '13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so':
        print('Private key: 0x' + b + '\a')
        sys.exit()

# Main script execution with multiprocessing guard
if __name__ == "__main__":
    try:
        # Use process_map to parallelize the work
        process_map(go, range(mid), max_workers=10, chunksize=10000)
    except concurrent.futures.process.BrokenProcessPool:
        print("A process in the pool was terminated abruptly.", file=sys.stderr)
    except KeyboardInterrupt:
        print("Process interrupted.", file=sys.stderr)

    # Optional alert on script completion (in stderr)
    print('\a', end='', file=sys.stderr)
member
Activity: 122
Merit: 11
A further note for everyone, unless something drastically improves with being able to use a public key, such as BSGS, Kangaroo, etc., the 67, 68, and 69 wallets, are all easier reached (time wise) now versus 135.

The lower puzzles are now very risky ... Even if someone manages to crack one of them still they could be easily stolen.

It's better not to find a solution than get it and then being robbed right away.

Please stop this wallet stealing talk. Even if unintentionally, you are creating an invitation and letting more people know.

By the way, the difficulty level of puzzle 69 and 66 is the same, puzzle 69 the first digit is 1 and known , so on . this does make it 66 bit.

I guess everyone who is trying to solve one of the lower puzzles would like to know about the risk. I don't get your point that my previous post was "invitation" to stealing. Even if there is only few people hunting for that public key to be revealed the risk exists and it's better to know that.

BTW How can be 66bit and 69 bit at the same difficulty level ?  Visualize 66 puzzle like you have 66 light switches on a wall. Every switch can be only in position on or off ( one or zero). To resolve the puzzle you must set every switch in a certain position (and of course in certain order)... now... how can adding three more switches keep the same level of difficulty ?
newbie
Activity: 30
Merit: 0
A further note for everyone, unless something drastically improves with being able to use a public key, such as BSGS, Kangaroo, etc., the 67, 68, and 69 wallets, are all easier reached (time wise) now versus 135.

The lower puzzles are now very risky ... Even if someone manages to crack one of them still they could be easily stolen.

It's better not to find a solution than get it and then being robbed right away.

Please stop this wallet stealing talk. Even if unintentionally, you are creating an invitation and letting more people know.

By the way, the difficulty level of puzzle 69 and 66 is the same, puzzle 69 the first digit is 1 and known , so on . this does make it 66 bit.


Everyone needs to be aware of this risk. Attackers can intercept and change transactions before they get mined, which is a serious issue. People should know about tools like https://slipstream.mara.com/ that help secure transactions without exposing public keys, so they don't make any mistakes in the future.
newbie
Activity: 16
Merit: 0
A further note for everyone, unless something drastically improves with being able to use a public key, such as BSGS, Kangaroo, etc., the 67, 68, and 69 wallets, are all easier reached (time wise) now versus 135.

The lower puzzles are now very risky ... Even if someone manages to crack one of them still they could be easily stolen.

It's better not to find a solution than get it and then being robbed right away.

Please stop this wallet stealing talk. Even if unintentionally, you are creating an invitation and letting more people know.

By the way, the difficulty level of puzzle 69 and 66 is the same, puzzle 69 the first digit is 1 and known , so on . this does make it 66 bit.
Pages:
Jump to: