Bitcoin puzzle transaction ~32 BTC prize to who solves it

[sxiclub]

This puzzle is very strange. If it's for measuring the world's brute forcing capacity, 161-256 are just a waste (RIPEMD160 entropy is filled by 160, and by all of P2PKH Bitcoin). The puzzle creator could improve the puzzle's utility without bringing in any extra funds from outside - just spend 161-256 across to the unsolved portion 51-160, and roughly treble the puzzle's content density.

If on the other hand there's a pattern to find... well... that's awfully open-ended... can we have a hint or two?

I am the creator.

You are quite right, 161-256 are silly.  I honestly just did not think of this.  What is especially embarrassing, is this did not occur to me once, in two years.  By way of excuse, I was not really thinking much about the puzzle at all.

I will make up for two years of stupidity.  I will spend from 161-256 to the unsolved parts, as you suggest.  In addition, I intend to add further funds.  My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key).  Probably in the next few weeks.  At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully.

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology.  The "large bitcoin collider" is especially innovative and interesting!

Hello.

I've been working on this challenge for a few months. I've tested several equations.
You put the compressed public key in wallets 135, 140, 145, 150, 155, and 160. Is there a reason for this, or is it just random information?

History:

2019-05-31
The creator of the "puzzles" creates outgoing transaction with the value of 1000 satoshi for addresses #65, #70, #75, #80, #85, #90, #95, #100, #105, #110, #115, #120, #125, #130, #135, #140, #145, #150, #155, #160 with the aim of probably comparing the difficulty of finding a private key for the address from which such a transaction was carried out, and one that there is no transaction.

[ericb148]

I tried converting everything to binary and doing some analysis and it seems like the private keys always have 1s in around 1/2 of the search space. Seems like this approach would be much more efficient than trying to exhaust them all.

[brainless]

Ecc loop game
You will post pubkey
I will issue your pubkey looped pubkey

I will tell you one multiplayer scaler number aftér apply scaler you will sub subtract your pubkey, you will be backed in result at looped pubkey

[Saketmishra01]

1st thing if you use github based wif solver you need a perfect ending byte required because it's random value either it impossible to solve via wifsolver because wifsolver the actual algorithm are so complex 1st you need to read first
Wifsolver show speed are not real

I don't know if it exists, but it would be very inefficient for mathematical reasons; I wouldn't be able to perform modular inversion efficiently.
I'm working on a code that allows for arbitrary ranges, not powers of 2, as is often the case.

How does a WIF password cracker work? If there are missing characters in the middle, the keys are also not sequential.
 Or a dictionary attack on Brain Wallet? They're the same thing, and there are programs with speeds of 300-400 M/s. I'd be perfectly happy with 100 M/s.

[BOEHDA]

with new vanity I'm getting this speed with 5090
VanitySearch v1.19 Linux with BitCrack integration
Difficulty: 1461501637330902918203684832716283019655932542976
Search: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU [Compressed]
Current task START time: Wed Jul 23 17:22:14 2025
Number of CPU thread: 0
GPU: GPU #0 NVIDIA GeForce RTX 5090 (170x0 cores) Grid(1792x256)
[14.09 Gkeys/s][Total 2^34.71][00:00:02 RUN || END 00:20:41][Found 0]

Hello
Could you please share de version of "VanitySearch" (Github) are you using?
Thanks!

[nochkin]

The puzzle 71 is quite hard for everyone!

Why i can't find any data on the progress that has been made on scanning the ranges 400000000000000000:7fffffffffffffffff ?

Does any one have any information on this matter?

The only progress is "not found".

[Garys27]

The puzzle 71 is quite hard for everyone!

Why i can't find any data on the progress that has been made on scanning the ranges 400000000000000000:7fffffffffffffffff ?

Does any one have any information on this matter?

https://btcpuzzle.info/ currently shows a scan progress of %0.414565 

[iceland2k14]

Would that be the Galaxy of RSZ or the special mathematical property's that are not public but have become so.

Let's chat.

Yes, However the irony is that even with all these non public weakness, This Puzzle still does not fall into a solvable system.

[XXKK-Exchange]

This puzzle has fascinated me for a long time. I spent a few evenings digging into the PVK values and I’m fairly sure they’re not random — there’s definitely a deterministic formula behind them.

One interesting thing I noticed: the jumps aren’t linear or purely exponential, but they do share some structural similarity with recursive sequences (not exactly Fibonacci, but possibly something derived from combinations or modular arithmetic). For example:

3 → 7 → 8 → 21 → 49

76 → 224 → 467 → 514

Some of these numbers line up with partial sums or offsets from binomial coefficients. It makes me wonder if the original creator used a function involving factorial growth or elliptic curve scalar multiplication steps.

If that’s true, brute force won’t help much — the key might lie in reverse-engineering the formula used to generate the PVKs rather than trying them all.

Has anyone here tried plotting the differences or ratios between successive keys? I think the clue is hidden in how those change over time.

[BlackAKAAngel]

This puzzle has fascinated me for a long time. I spent a few evenings digging into the PVK values and I’m fairly sure they’re not random — there’s definitely a deterministic formula behind them.

One interesting thing I noticed: the jumps aren’t linear or purely exponential, but they do share some structural similarity with recursive sequences (not exactly Fibonacci, but possibly something derived from combinations or modular arithmetic). For example:

3 → 7 → 8 → 21 → 49

76 → 224 → 467 → 514

Some of these numbers line up with partial sums or offsets from binomial coefficients. It makes me wonder if the original creator used a function involving factorial growth or elliptic curve scalar multiplication steps.

If that’s true, brute force won’t help much — the key might lie in reverse-engineering the formula used to generate the PVKs rather than trying them all.

Has anyone here tried plotting the differences or ratios between successive keys? I think the clue is hidden in how those change over time.

i work on that theory almost two years and you can forget,you can just guess near but you need to search forward and backward for small key range 45 bit not problem  i write self fibonacci code,for 2 weks i rewrite  code from the https://github.com/JeanLucPons/VanitySearch  i just add the key range and work perfect

[FrozenThroneGuy]

with new vanity I'm getting this speed with 5090
VanitySearch v1.19 Linux with BitCrack integration
Difficulty: 1461501637330902918203684832716283019655932542976
Search: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU [Compressed]
Current task START time: Wed Jul 23 17:22:14 2025
Number of CPU thread: 0
GPU: GPU #0 NVIDIA GeForce RTX 5090 (170x0 cores) Grid(1792x256)
[14.09 Gkeys/s][Total 2^34.71][00:00:02 RUN || END 00:20:41][Found 0]

Hello
Could you please share de version of "VanitySearch" (Github) are you using?
Thanks!

This is impossible, it has a bug somewhere.

The puzzle 71 is quite hard for everyone!

Why i can't find any data on the progress that has been made on scanning the ranges 400000000000000000:7fffffffffffffffff ?

Does any one have any information on this matter?

https://btcpuzzle.info/ currently shows a scan progress of %0.414565  

We scanned 0.118%
Link: https://t.me/+t9Ss2oR3O_cwMmEy

[BlackAKAAngel]

here the   https://github.com/deniboy28/VanitySearch_keyrange.git with a keyrange start and end

[Menowa*]

I have a question: why big miners with high hashrate didnt try to crack these puzzles yet? These puzzles has the double of prize and its easier for them, so why didnt it happen or would never happen?

[kTimesG]

I have a question: why big miners with high hashrate didnt try to crack these puzzles yet? These puzzles has the double of prize and its easier for them, so why didnt it happen or would never happen?

Because, just like individual or pool puzzle mining, they would lose money, not earn a profit.

This is what happens when the expected costs are higher than the expected returns.

[sxiclub]

I have a question: why big miners with high hashrate didnt try to crack these puzzles yet? These puzzles has the double of prize and its easier for them, so why didnt it happen or would never happen?

ASICs in miners are designed to do other types of calculations, they are not effective for this purpose.

[dextronomous]

Nomachine where you at mate, you around or not?
missing his coding skills,
we all need a thing or two more to do around here, and its a bit silent in here,
so waiting wanting some of this good stuff, 

[pbies]

Nomachine where you at mate, you around or not?

Better is to say exactly what you need from the start, than to ping a guy which is busy.

[epomis]

I stumbled upon this: https://www.youtube.com/watch?v=35Euhs7bzGM

He claims to have found the deterministic nature of the puzzle seeds and to have solved 71.
Mastermind or possible scam attempt?

Might be Japanese (again!  ) looking at his script comments.

[SRG02289]

I stumbled upon this: https://www.youtube.com/watch?v=35Euhs7bzGM

He claims to have found the deterministic nature of the puzzle seeds and to have solved 71.
Mastermind or possible scam attempt?

Might be Japanese (again!  ) looking at his script comments.

The coins are all in place. It's a scam.

[BlackAKAAngel]

I stumbled upon this: https://www.youtube.com/watch?v=35Euhs7bzGM

He claims to have found the deterministic nature of the puzzle seeds and to have solved 71.
Mastermind or possible scam attempt?

Might be Japanese (again!   ) looking at his script comments.

The coins are all in place. It's a scam.

i dont think its japanese but here the code its not entire code >>>><

Code:

# -*- coding: utf-8 -*-
import sys
import time
import random
from sympy import symbols, sympify, SympifyError

TAKOU_SHIKI_JIZOKUSEI_SOU = "seeds.txt"
DOKURITSU_HENSUU_SHIKIBETSU_SHI = 'n'

#this is the rng the creator used. Lets run it.


def kakuritsuteki_kikan_no_shokika():
    print("計算環境を初期化しています...")
    tane = int(time.time() * 1000)
    random.seed(tane)
    shoki_joutai_bekutoru = random.getrandbits(32)
    print("...メルセンヌ・ツイスタの状態がシード {0} で水和されました。初期状態ベクトル: {1}".format(tane, shoki_joutai_bekutoru))
    print("...環境の準備ができました。")




def jizokusei_sou_kara_tayoutai_wo_fukugen(pasu):
    try:
        with open(pasu, "r", encoding="utf-8") as fuaido_kisojushi:
            nama_tayoutai_deeta = fuaido_kisojushi.read().strip()
            return nama_tayoutai_deeta
    except IOError as e:
        print("致命的: I/Oサブシステム障害。永続層から逆シリアル化できませんでした: {0}".format(e))
        return None
        
        
      #  <-----------------73 Lines REDACTED-------->





def kiseki_de_shiki_wo_hyouka(kigouteki_hyougen_tayoutai, dokuritsu_hensuu, hyouka_kiseki):
    return kigouteki_hyougen_tayoutai.subs(dokuritsu_hensuu, hyouka_kiseki)


def format_hex(val):
    i = int(val)
    h = format(i, 'x')  # convert to hex without prefix
    if len(h) < 64:
        h = h.rjust(64, '0')  # pad with leading zeros to 64 chars
    return h


def taiwa_gata_hyouka_purotokoru_kaishi(shiki_tayoutai, hensuu_kigou):
    print("\n--- 対話型評価プロトコル開始 ---")
    while True:
        try:
            nyuryoku_moji = input("シーケンスの位置を入力してください（終了するには0を入力）: ")
            ichi_kiseki = int(nyuryoku_moji)

            if ichi_kiseki == 0:
                print("終了信号を受信しました。対話プロトコルをシャットダウンします。")
                break

            tokubetsu_na_kekka = tokushu_jirei_no_kensa(ichi_kiseki)
            if tokubetsu_na_kekka is not None:
                kekka = tokubetsu_na_kekka
            else:
                kekka = kiseki_de_shiki_wo_hyouka(shiki_tayoutai, hensuu_kigou, ichi_kiseki)

            print(format_hex(kekka))

        except (ValueError, TypeError) as e:
            print("エラー: 無効な入力データです。整数の軌跡を指定してください。詳細: {0}".format(e))
        except Exception as e:
            print("予期せぬシステム例外が発生しました: {0}".format(e))


def shuyou():
    kakuritsuteki_kikan_no_shokika()

    takou_shiki_moji = jizokusei_sou_kara_tayoutai_wo_fukugen(TAKOU_SHIKI_JIZOKUSEI_SOU)
    if takou_shiki_moji is None:
        sys.exit(1)

    dokuritsu_hensuu_zeta = symbols(DOKURITSU_HENSUU_SHIKIBETSU_SHI)

    try:
        kigouteki_hyougen_tayoutai = sympify(takou_shiki_moji)
    except SympifyError as e:
        print("致命的: 多様体の解析に失敗しました。提供された式文字列の構文が無効です: {0}".format(e))
        sys.exit(1)

    if len(sys.argv) > 1:
        try:
            batchi_kiseki = int(sys.argv[1])
            print("\n--- バッチモード操作 ---")

            tokubetsu_na_kekka = tokushu_jirei_no_kensa(batchi_kiseki)
            if tokubetsu_na_kekka is not None:
                kekka = tokubetsu_na_kekka
            else:
                kekka = kiseki_de_shiki_wo_hyouka(kigouteki_hyougen_tayoutai, dokuritsu_hensuu_zeta, batchi_kiseki)

            print(format_hex(kekka))
        except ValueError:
            print("エラー: コマンドライン引数は有効な整数でなければなりません。")
    else:
        taiwa_gata_hyouka_purotokoru_kaishi(kigouteki_hyougen_tayoutai, dokuritsu_hensuu_zeta)


if __name__ == "__main__":
    shuyou()

>>>>>>english<<<<<<<<<
 

Code:

# -*- coding: utf-8 -*-
import sys
import time
import random
from sympy import symbols, sympify, SympifyError

PERSISTENT_FORMULA_SOU = "seeds.txt"
INDEPENDENT_VARIABLE_ID = 'n'

def probabilistic_machine_initialization():
    print("Initializing computational environment...")
    seed = int(time.time() * 1000)
    random.seed(seed)
    initial_state_vector = random.getrandbits(32)
    print("...Mersenne Twister state hydrated with seed {0}. Initial state vector: {1}".format(seed, initial_state_vector))
    print("...Environment ready.")

def restore_state_from_persistent_layer(path):
    try:
        with open(path, "r", encoding="utf-8") as file_base_substrate:
            raw_state_data = file_base_substrate.read().strip()
            return raw_state_data
    except IOError as e:
        print("Fatal: I/O subsystem failure. Could not deserialize from persistent layer: {0}".format(e))
        return None
        
# <-----------------73 Lines REDACTED-------->

def evaluate_expression_at_trajectory(symbolic_expression_state, independent_variable, evaluation_trajectory):
    return symbolic_expression_state.subs(independent_variable, evaluation_trajectory)

def format_hex(val):
    i = int(val)
    h = format(i, 'x')  # convert to hex without prefix
    if len(h) < 64:
        h = h.rjust(64, '0')  # pad with leading zeros to 64 chars
    return h

def interactive_evaluation_protocol_start(expression_state, variable_symbol):
    print("\n--- Interactive evaluation protocol started ---")
    while True:
        try:
            input_string = input("Enter sequence position (enter 0 to exit): ")
            trajectory_position = int(input_string)

            if trajectory_position == 0:
                print("Exit signal received. Shutting down interactive protocol.")
                break

            special_result = check_special_case(trajectory_position)
            if special_result is not None:
                result = special_result
            else:
                result = evaluate_expression_at_trajectory(expression_state, variable_symbol, trajectory_position)

            print(format_hex(result))

        except (ValueError, TypeError) as e:
            print("Error: Invalid input data. Please specify an integer trajectory. Details: {0}".format(e))
        except Exception as e:
            print("Unexpected system exception occurred: {0}".format(e))

def main():
    probabilistic_machine_initialization()

    formula_string = restore_state_from_persistent_layer(PERSISTENT_FORMULA_SOU)
    if formula_string is None:
        sys.exit(1)

    independent_variable_zeta = symbols(INDEPENDENT_VARIABLE_ID)

    try:
        symbolic_expression_state = sympify(formula_string)
    except SympifyError as e:
        print("Fatal: Failed to parse manifold. Invalid syntax in provided formula string: {0}".format(e))
        sys.exit(1)

    if len(sys.argv) > 1:
        try:
            batch_trajectory = int(sys.argv[1])
            print("\n--- Batch mode operation ---")

            special_result = check_special_case(batch_trajectory)
            if special_result is not None:
                result = special_result
            else:
                result = evaluate_expression_at_trajectory(symbolic_expression_state, independent_variable_zeta, batch_trajectory)

            print(format_hex(result))
        except ValueError:
            print("Error: Command line argument must be a valid integer.")
    else:
        interactive_evaluation_protocol_start(symbolic_expression_state, independent_variable_zeta)

if __name__ == "__main__":
    main()