Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Bram24732]

should stop there though.

That’s the point of this fake user. To get as many people as possible to leave this topic, so only Digarans remain in it 

Oh I meant the discussion between him and I.
I’ll stay here for other people

Which puzzle numbers have you solved? Did you work on them solo or in a pool? And how much time did you spend on all of them?

I suggest you read my post history it will be simpler.
I solved 67 and 68. I was managing operations but got funding from about 20 people. So it was essentially a centrally managed private pool.

Cool! Have you decided to stop here or are you ready to keep developing your strategic skills?

I stopped there. 71 is not worth it from a cost / risk / reward perspective

[Valera909]

should stop there though.

That’s the point of this fake user. To get as many people as possible to leave this topic, so only Digarans remain in it 

Oh I meant the discussion between him and I.
I’ll stay here for other people

Which puzzle numbers have you solved? Did you work on them solo or in a pool? And how much time did you spend on all of them?

I suggest you read my post history it will be simpler.
I solved 67 and 68. I was managing operations but got funding from about 20 people. So it was essentially a centrally managed private pool.

Cool! Have you decided to stop here or are you ready to keep developing your strategic skills?

I stopped there. 71 is not worth it from a cost / risk / reward perspective

What computational power do you have at your disposal, and by how much would the range need to be reduced to make it profitable?

[Bram24732]

should stop there though.

That’s the point of this fake user. To get as many people as possible to leave this topic, so only Digarans remain in it  

Oh I meant the discussion between him and I.
I’ll stay here for other people

Which puzzle numbers have you solved? Did you work on them solo or in a pool? And how much time did you spend on all of them?

I suggest you read my post history it will be simpler.
I solved 67 and 68. I was managing operations but got funding from about 20 people. So it was essentially a centrally managed private pool.

Cool! Have you decided to stop here or are you ready to keep developing your strategic skills?

I stopped there. 71 is not worth it from a cost / risk / reward perspective

What computational power do you have at your disposal, and by how much would the range need to be reduced to make it profitable?

It’s variable since we rent the machines. But we peaked at tens of thousands of GPUs
71 is profitable at only a quater of the problem size.

[Valera909]

should stop there though.

That’s the point of this fake user. To get as many people as possible to leave this topic, so only Digarans remain in it  

Oh I meant the discussion between him and I.
I’ll stay here for other people

Which puzzle numbers have you solved? Did you work on them solo or in a pool? And how much time did you spend on all of them?

I suggest you read my post history it will be simpler.
I solved 67 and 68. I was managing operations but got funding from about 20 people. So it was essentially a centrally managed private pool.

Cool! Have you decided to stop here or are you ready to keep developing your strategic skills?

I stopped there. 71 is not worth it from a cost / risk / reward perspective

What computational power do you have at your disposal, and by how much would the range need to be reduced to make it profitable?

It’s variable since we rent the machines. But we peaked at tens of thousands of GPUs
71 is profitable at only a quater of the problem size.

Am I right in thinking that a quarter of the range corresponds to the maximum 21-digit number, and it's no more than 590295810358705651712?

[Dom1nic]

It’s variable since we rent the machines. But we peaked at tens of thousands of GPUs
71 is profitable at only a quater of the problem size.

or when the btc price is 300k..

[Valera909]

It’s variable since we rent the machines. But we peaked at tens of thousands of GPUs
71 is profitable at only a quater of the problem size.

or when the btc price is 300k..

To wait for inflation or price growth is a longer path than to simply reduce the chaos to a deterministic set.

There are two paths forward. I won’t argue about software-level tricks or theoretical optimizations they may help, but they don’t solve the puzzle alone. What truly matters is the strategic approach: a combination of hardware efficiency and software orchestration, whether through rented compute or a coordinated user-powered project.

In either case, it’s a massive, high-value undertaking, requiring scale, precision, and vision.

[hoanghuy2912]

basically it's a waste of time, if you want to solve it just invest in a lot of gpu, there's no other way to solve it. Are you tired?

[analyticnomad]

basically it's a waste of time, if you want to solve it just invest in a lot of gpu, there's no other way to solve it. Are you tired?

Why stupidy?
Rent

Where are the best options to rent gpu's in your opinion?

[Akito S. M. Hosana]

basically it's a waste of time, if you want to solve it just invest in a lot of gpu, there's no other way to solve it. Are you tired?

Why stupidy?
Rent

Where are the best options to rent gpu's in your opinion?

China. But it is best to travel to Beijing. And finish everything there on the spot. And bring a suitcase with money. 

[vneos]

Is it more cost-effective to resolve 135 now than to resolve 71?

How many operations are required to resolve 135?

[Bram24732]

basically it's a waste of time, if you want to solve it just invest in a lot of gpu, there's no other way to solve it. Are you tired?

Why stupidy?
Rent

Where are the best options to rent gpu's in your opinion?

China. But it is best to travel to Beijing. And finish everything there on the spot. And bring a suitcase with money. 

I disagree

[hoanghuy2912]

I have a side question that if the private key of the old address with balance is found, can it be freely spent, or do we need other measures to make it legal?

[madogss]

I have a side question that if the private key of the old address with balance is found, can it be freely spent, or do we need other measures to make it legal?

Addresses in this puzzle yes they can be spent freely.

you can find a list of the addresses here: https://privatekeys.pw/puzzles/bitcoin-puzzle-tx

[Nodemath]

How to execute own code using cyclon module private key to hash 160
Can anyone help me to run colab GPU
I have a idea

[teguh54321]

basically it's a waste of time, if you want to solve it just invest in a lot of gpu, there's no other way to solve it. Are you tired?

Mybe private key cracker asic with ??ths 🤪

basically it's a waste of time, if you want to solve it just invest in a lot of gpu, there's no other way to solve it. Are you tired?

There might be a way, but no one has discovered it yet........

[Nodemath]

I just discovered way but
I need rotor cuda gpu code to with speed of 300mkey/sec

Can anyone help me which able run on colab
Using cuda gpu module
Please

import time
import hashlib
from coincurve import PrivateKey
from Crypto.Hash import RIPEMD160
import psutil
import os
import signal
import sys
import multiprocessing as mp
from bloom_filter2 import BloomFilter
from google.colab import drive

# Mount Google Drive
drive.mount('/content/drive')

# Config
File_NAME = "Puzzle 71.013.000.csv"
DRIVE_FOLDER = "/content/drive/MyDrive/Puzzle71"
file_path = f"{DRIVE_FOLDER}/{File_NAME}"
SCAN_RANGE = 100_000
TARGET_PREFIX = "f6f543"
BLOOM_CAPACITY = 1_000_000
BLOOM_ERROR_RATE = 0.001

# Load known H160 hashes into Bloom filter
KNOWN_H160S = [
    "f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8",
]
bloom = BloomFilter(max_elements=BLOOM_CAPACITY, error_rate=BLOOM_ERROR_RATE)
for h in KNOWN_H160S:
    bloom.add(h)

# Read decimal numbers from CSV
with open(file_path, 'r') as f:
    lines = [line.strip() for line in f if line.strip()]
if lines[0].lower().startswith('value'):
    lines = lines[1:]
Decimal_numbers = [int(line) for line in lines]

def privatekey_to_h160(priv_key_int):
    try:
        priv = PrivateKey.from_int(priv_key_int)
        pubkey = priv.public_key.format(compressed=True)
        sha256 = hashlib.sha256(pubkey).digest()
        ripemd160 = RIPEMD160.new(sha256).digest()
        return ripemd160.hex()
    except Exception:
        return None

def optimize_performance():
    try:
        p = psutil.Process()
        if hasattr(p, "cpu_affinity"):
            p.cpu_affinity(list(range(os.cpu_count())))
        if hasattr(psutil, "REALTIME_PRIORITY_CLASS"):
            p.nice(psutil.REALTIME_PRIORITY_CLASS)
        else:
            p.nice(-20)
    except Exception as e:
        print(f"[!] Optimization warning: {e}")

def signal_handler(sig, frame):
    print("\n[!] Interrupted. Exiting.")
    sys.exit(0)

def check_key(k):
    h160 = privatekey_to_h160(k)
    if h160 and (h160.startswith(TARGET_PREFIX) or h160 in bloom):
        return ('match', k, h160)
    return ('progress', k, h160)

def process_decimal(decimal):
    start = max(1, decimal - SCAN_RANGE)
    end = decimal + SCAN_RANGE
    keys = list(range(start, end + 1))

    processed = 0
    start_time = time.time()
    last_key = None
    last_h160 = None

    ctx = mp.get_context("fork")
    with ctx.Pool(processes=os.cpu_count()) as pool:
        result_iter = pool.imap_unordered(check_key, keys, chunksize=1000)

        for result in result_iter:
            if result[0] == 'match':
                _, key, h160 = result
                print(f"\n**PREFIX MATCH FOUND!** Private key {hex(key)} produces Hash160: {h160}\n")
            elif result[0] == 'progress':
                _, key, h160 = result
                processed += 1
                last_key = key
                last_h160 = h160

    elapsed = time.time() - start_time
    speed = processed / elapsed if elapsed > 0 else 0
    print(f"\nHash160 of the last processed key {hex(last_key)} -> {last_h160}")
    print(f"[✓] Completed Decimal: {Decimal} - Processed {processed} keys in {elapsed:.2f}s (Speed: {speed:.2f} keys/sec)")

def main():
    signal.signal(signal.SIGINT, signal_handler)
    optimize_performance()

    print(f"\nLoaded {len(Decimal_numbers)} Decimal numbers.")
    print(f"Scanning ±{SCAN_RANGE} around each.\nTarget prefix: {TARGET_PREFIX}")
    print(f"Bloom filter contains {len(KNOWN_H160S)} known H160 hashes.\n")

    for decimal in decimal_numbers:
        process_decimal(decimal)

if __name__ == '__main__':
    main()


Help me out to use rotor cuda gpu modules able run on colab
Private key to hash 160

[zion3301]

import time
import hashlib
from coincurve import PrivateKey
from Crypto.Hash import RIPEMD160
import psutil
import os
import signal
import sys
import multiprocessing as mp
from bloom_filter2 import BloomFilter
from google.colab import drive

# Mount Google Drive
drive.mount('/content/drive')

# Config
File_NAME = "Puzzle 71.013.000.csv"
DRIVE_FOLDER = "/content/drive/MyDrive/Puzzle71"
file_path = f"{DRIVE_FOLDER}/{File_NAME}"
SCAN_RANGE = 100_000
TARGET_PREFIX = "f6f543"
BLOOM_CAPACITY = 1_000_000
BLOOM_ERROR_RATE = 0.001

# Load known H160 hashes into Bloom filter
KNOWN_H160S = [
    "f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8",
]
bloom = BloomFilter(max_elements=BLOOM_CAPACITY, error_rate=BLOOM_ERROR_RATE)
for h in KNOWN_H160S:
    bloom.add(h)

# Read decimal numbers from CSV
with open(file_path, 'r') as f:
    lines = [line.strip() for line in f if line.strip()]
if lines[0].lower().startswith('value'):
    lines = lines[1:]
Decimal_numbers = [int(line) for line in lines]

def privatekey_to_h160(priv_key_int):
    try:
        priv = PrivateKey.from_int(priv_key_int)
        pubkey = priv.public_key.format(compressed=True)
        sha256 = hashlib.sha256(pubkey).digest()
        ripemd160 = RIPEMD160.new(sha256).digest()
        return ripemd160.hex()
    except Exception:
        return None

def optimize_performance():
    try:
        p = psutil.Process()
        if hasattr(p, "cpu_affinity"):
            p.cpu_affinity(list(range(os.cpu_count())))
        if hasattr(psutil, "REALTIME_PRIORITY_CLASS"):
            p.nice(psutil.REALTIME_PRIORITY_CLASS)
        else:
            p.nice(-20)
    except Exception as e:
        print(f"[!] Optimization warning: {e}")

def signal_handler(sig, frame):
    print("\n[!] Interrupted. Exiting.")
    sys.exit(0)

def check_key(k):
    h160 = privatekey_to_h160(k)
    if h160 and (h160.startswith(TARGET_PREFIX) or h160 in bloom):
        return ('match', k, h160)
    return ('progress', k, h160)

def process_decimal(decimal):
    start = max(1, decimal - SCAN_RANGE)
    end = decimal + SCAN_RANGE
    keys = list(range(start, end + 1))

    processed = 0
    start_time = time.time()
    last_key = None
    last_h160 = None

    ctx = mp.get_context("fork")
    with ctx.Pool(processes=os.cpu_count()) as pool:
        result_iter = pool.imap_unordered(check_key, keys, chunksize=1000)

        for result in result_iter:
            if result[0] == 'match':
                _, key, h160 = result
                print(f"\n**PREFIX MATCH FOUND!** Private key {hex(key)} produces Hash160: {h160}\n")
            elif result[0] == 'progress':
                _, key, h160 = result
                processed += 1
                last_key = key
                last_h160 = h160

    elapsed = time.time() - start_time
    speed = processed / elapsed if elapsed > 0 else 0
    print(f"\nHash160 of the last processed key {hex(last_key)} -> {last_h160}")
    print(f"[✓] Completed Decimal: {Decimal} - Processed {processed} keys in {elapsed:.2f}s (Speed: {speed:.2f} keys/sec)")

def main():
    signal.signal(signal.SIGINT, signal_handler)
    optimize_performance()

    print(f"\nLoaded {len(Decimal_numbers)} Decimal numbers.")
    print(f"Scanning ±{SCAN_RANGE} around each.\nTarget prefix: {TARGET_PREFIX}")
    print(f"Bloom filter contains {len(KNOWN_H160S)} known H160 hashes.\n")

    for decimal in decimal_numbers:
        process_decimal(decimal)

if __name__ == '__main__':
    main()


Help me out to use rotor cuda gpu modules able run on colab
Private key to hash 160

Imo there is no real benefit compared to bitcrack or other optimized brute force cuda codes.

[Nodemath]

If above code is done in gpu way
I am sure that I can find in a month even 71 to 80 puzzle

[Akito S. M. Hosana]

If above code is done in gpu way
I am sure that I can find in a month even 71 to 80 puzzle

With a speed of 300 MKeys/s?

I have 6,900 MKeys/s on a 4090, running 24/7 for the last two months (using FixedPaul's VanitySearch-BitCrack).

Still can’t find a thing. It’s just wasting electricity.

[madogss]

basically it's a waste of time, if you want to solve it just invest in a lot of gpu, there's no other way to solve it. Are you tired?

Mybe private key cracker asic with ??ths 🤪

asic does sha256d which is 2 sha256 we only need 1, I think one guy got his asic to forcefully output before hashing the second time but sha256 is not what's holding us back it's secp256k1 that's limiting speed.

If above code is done in gpu way
I am sure that I can find in a month even 71 to 80 puzzle

That code is already being done in a gpu way besides loading the file, look at bitcrack and other brute force for examples.