Bitcoin puzzle transaction ~32 BTC prize to who solves it

[bibilgin]

the first and second lines are the dec range of the wallet, the third line is the hex key, the key in hex is formed from the elements of the dec range, the color shows the values in the order of formation. You look at the first hex character and find it in dec by color and so on. For example 100: a=6+3+1 , f=8+7 and so on. The rest of the information is only for donations

It would be better if the creator himself joined the conversation before I started laying out a method for generating conversion coefficients from wallet to wallet.

Ok, I understand the logic.

But, you can extract any hex format you want from the 1st and 2nd decimals.
It does not take a certain point from a certain level as fixed.
You can take it from the beginning, middle or end and put it below at the beginning, middle or end of HEX.

In your table example, in the same way, when you look at it normally, the order shows that it will start with 7. But you can also get 6 from a decimal in the middle.

[Gtsg]

the first and second lines are the dec range of the wallet, the third line is the hex key, the key in hex is formed from the elements of the dec range, the color shows the values in the order of formation. You look at the first hex character and find it in dec by color and so on. For example 100: a=6+3+1 , f=8+7 and so on. The rest of the information is only for donations

It would be better if the creator himself joined the conversation before I started laying out a method for generating conversion coefficients from wallet to wallet.

Ok, I understand the logic.

But, you can extract any hex format you want from the 1st and 2nd decimals.
It does not take a certain point from a certain level as fixed.
You can take it from the beginning, middle or end and put it below at the beginning, middle or end of HEX.

In your table example, in the same way, when you look at it normally, the order shows that it will start with 7. But you can also get 6 from a decimal in the middle.

The 66th wallet has reset the coefficient to 0. The 67th wallet starts with a new transition coefficient located at the point of progressing one digit. Arithmetic operations with the previous coefficient lead to the starting value of the next wallet. There are 4 possible starting points in this wallet if you don't know the exact transition coefficient. There are other formation markers in the table, there are even fractions of a coefficient and fractions of fractions of a coefficient that lead to the result.

[Jorge54PT]

if 67, 68 bit wallets, etc, the bots take and if 135, 140, etc, takes thousands of years to discover, then these puzzles are only for learning and nothing more.

[nomachine]

3 seconds on PYTHON! PK found.

Code:

import math, time, sys, os
from gmpy2 import mpz, powmod, invert, jacobi
import xxhash  
from sortedcontainers import SortedDict 

# Clear screen and initialize
os.system("cls||clear")
t = time.ctime()
sys.stdout.write(f"\033[?25l\033[01;33m[+] BSGS: {t}\n")
sys.stdout.flush()

# Elliptic Curve Parameters (secp256k1)
modulo = mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F)
order = mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141)
Gx = mpz(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
Gy = mpz(0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8)
PG = (Gx, Gy)

# Point Addition on Elliptic Curve
def add(P, Q):
    if P == (0, 0):
        return Q
    if Q == (0, 0):
        return P
    Px, Py = P
    Qx, Qy = Q
    if Px == Qx:
        if Py == Qy:
            inv_2Py = invert((Py << 1) % modulo, modulo)
            m = (3 * Px * Px * inv_2Py) % modulo
        else:
            return (0, 0)
    else:
        inv_diff_x = invert(Qx - Px, modulo)
        m = ((Qy - Py) * inv_diff_x) % modulo
    x = (m * m - Px - Qx) % modulo
    y = (m * (Px - x) - Py) % modulo
    return (x, y)

# Scalar Multiplication on Elliptic Curve
def mul(k, P=PG):
    R0, R1 = (0, 0), P
    for i in reversed(range(k.bit_length())):
        if (k >> i) & 1:
            R0, R1 = add(R0, R1), add(R1, R1)
        else:
            R1, R0 = add(R0, R1), add(R0, R0)
    return R0

# Point Subtraction
def point_subtraction(P, Q):
    Q_neg = (Q[0], (-Q[1]) % modulo)
    return add(P, Q_neg)

# Compute Y from X using curve equation
def X2Y(X, y_parity, p=modulo):
    X3_7 = (pow(X, 3, p) + 7) % p
    if jacobi(X3_7, p) != 1:
        return None
    Y = powmod(X3_7, (p + 1) >> 2, p)
    return Y if (Y & 1) == y_parity else (p - Y)

# Convert point to compressed public key
def point_to_cpub(point):
    x, y = point
    y_parity = y & 1
    prefix = '02' if y_parity == 0 else '03'
    compressed_pubkey = prefix + format(x, '064x')
    return compressed_pubkey

# Hash a compressed public key using xxhash and store only the first 8 characters
def hash_cpub(cpub):
    return xxhash.xxh64(cpub.encode()).hexdigest()[:8]

# Main Script
if __name__ == "__main__":
    # Puzzle Parameters
    puzzle = 40
    start_range, end_range = 2**(puzzle-1), (2**puzzle) - 1
    puzzle_pubkey = '03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4'

    # Parse Public Key
    if len(puzzle_pubkey) != 66:
        print("[error] Public key length invalid!")
        sys.exit(1)
    prefix = puzzle_pubkey[:2]
    X = mpz(int(puzzle_pubkey[2:], 16))
    y_parity = int(prefix) - 2
    Y = X2Y(X, y_parity)
    if Y is None:
        print("[error] Invalid compressed public key!")
        sys.exit(1)
    P = (X, Y)  # Uncompressed public key

    # Precompute m and mP for BSGS
    m = int(math.floor(math.sqrt(end_range - start_range)))
    m_P = mul(m)

    # Create Baby Table with SortedDict
    print('[+] Creating babyTable...')
    baby_table = SortedDict()  
    Ps = (0, 0)  # Start with the point at infinity
    for i in range(m + 1):
        cpub = point_to_cpub(Ps)
        cpub_hash = hash_cpub(cpub)  # Use xxhash and store only 8 characters
        baby_table[cpub_hash] = i  # Store the hash as the key and index as the value
        Ps = add(Ps, PG)  # Incrementally add PG

    # BSGS Search
    print('[+] BSGS Search in progress')
    S = point_subtraction(P, mul(start_range))
    step = 0
    st = time.time()
    while step < (end_range - start_range):
        cpub = point_to_cpub(S)
        cpub_hash = hash_cpub(cpub)  # Hash the current compressed public key
        # Check if the hash exists in the baby_table
        if cpub_hash in baby_table:
            b = baby_table[cpub_hash]
            k = start_range + step + b
            if point_to_cpub(mul(k)) == puzzle_pubkey:
                print(f'[+] m={m} step={step} b={b}')
                print(f'[+] Key found: {k}')
                print("[+] Time Spent : {0:.2f} seconds".format(time.time() - st))
                sys.exit()
        S = point_subtraction(S, m_P)
        step += m

    print('[+] Key not found')
    print("[+] Time Spent : {0:.2f} seconds".format(time.time() - st))

puzzle 40

• BSGS: Thu Feb 20 21:49:30 2025
• Creating babyTable...
• BSGS Search in progress
• m=741455 step=453895024440 b=574622
• Key found: 1003651412950
• Time Spent : 2.90 seconds

puzzle 50

• BSGS: Thu Feb 20 22:13:12 2025
• Creating babyTable...
• BSGS Search in progress
• m=23726566 step=48190529944714 b=12801738
• Key found: 611140496167764
• Time Spent : 12.71 seconds

This is the result... on a single core

P.S. For puzzles above 50, you'll need a Bloom Filter

[benjaniah]

Well, 67 was just solved.

730fc235c1942c1ae

[mjojo]

goodluck to the solver.. how about prefixs method is pvkeys is in your formula calculation???

[mjojo]

if he move use maraslipstream, I hope Wandering philosoper get a tip. because the guy who research found and give well instruction how to use maraslipstream after puzzle 66 intercept by bots is Wandering Philosoper.

[mcdouglasx]

I hope it was one of the people here who succeeded, who can please let us know how they sent the BTC, whether they used 'marasplit' or something else, and what techniques worked for them. I hope it was some enthusiastic member of this community. It is great news! From the way they withdrew, I assume they know very well what they are doing.

[cctv5go]

Firstly, the puzzle solver must be 99% of the community members, and the low puzzle solver appears to be the creator themselves. From puzzle 67, it seems that this is a cold wallet address of the creator himself.
Personal opinion, don't criticize if you don't like it.

[JDScreesh]

Congratulations for the solver of puzzle 67.

I saw he (or she ) used MARA Slipstream. Is good to know that MARA works well for lower range puzzles 

[Akito S. M. Hosana]

Great!!!!
This is wonderful   

I bet we all know the solver. 

[Asmodeus_Zero]

Great!!!!
This is wonderful   

I bet we all know the solver. 

Retired Coder.

[frozenen]

#67 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
00000000000000000000000000000000000000000000000730fc235c1942c1ae
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qbP2K5cm35XKMND1X1KW

Well done, I think he must have insane amount of GPUs! unlike #66 I was close to #67 solution was searching just a bit too high

[deep_seek]

https://mempool.space/tx/0be77ec8bec331da8750c8b715085c6cf6c374ca31f829a515c62b9846e32986

Only 50.4 sat/vB... even not disabling RBF...... Finally Marapool ends the Bot War.... Wondring Philosopher deserve the donation....

[Gtsg]

Creator, I understood your move, thank you, 0.2-0.06+1 . Do you have a request, + or -?

[frozenen]

Creator, I understood your move, thank you, 0.2-0.06+1 . Do you have a request, + or -?

Lol, creator is thinking???
#68
147573952589676412928
295147905179352825855
8+5=D  so does #68 start with D ?

[WinsomeGuy]

Congratulations to the puzzle 67 solver   

It's good that this one did not get stolen

[Akito S. M. Hosana]

Can someone create a Python script that generates a raw Bitcoin transaction with fixed fee value and allows you to manually copy/paste the transaction into slipstream.mara.com ?

This is very delicate and intricate to do without screwing up. 

[nomachine]

Can someone create a Python script that generates a raw Bitcoin transaction

Of course, we can. The question is whether we will. Do you have a preferred MP3 track for the script to play while you’re getting your RAW transaction?  

[citb0in]

Congratulations to the solver of puzzle #67. Enjoy the weekend