Bitcoin puzzle transaction ~32 BTC prize to who solves it

[sdhgfdsjfgsiujdgf]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

I assume that you are joking/trolling, if you got the private key, you for sure need to know how to get the money.

[sdhgfdsjfgsiujdgf]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

Find a major miner here who is willing to purchase the private key from you. Conduct this transaction in a public setting to guarantee transparency and prevent possible fraud.Good luck...

I need some advice on how to publicly conduct a transaction. How can I safely hand over the key and ensure I get paid at the right moment? Any ideas on this?

You should first mix the private key and a secret message together, then post the SHA-256 hash of that combination here. For example, if your private key in hex format is '36b0f7381163cd38c' and your secret message is 'helloitsme123xyz', you should post the SHA-256 hash of the concatenated string here immediately.

Next, you need to find a miner. There are many people here who have claimed to be miners, so if any of them can assist, please help this person.

All dealings between you and the miner should be conducted in this forum. I think 5 bitcoins for you and the rest for the miner should be sufficient.

As soon as the miner receives the correct private key, they should post here confirming that they have received the correct private key. If the miner tries to deceive and claims the private key is incorrect, your posted hash will verify whether you are right or wrong.

These are my thoughts, but you can take opinions from others on how to complete this task honestly.

Just ensure that all discussions take place exclusively within this forum. Avoid any miner who is not willing to communicate here.

I'm providing you with a simple script. Completely disconnect your PC from the internet, run this script, and then upload the hash immediately. Do not perform this task on any online site.

Code

Code:

import hashlib

# input private key + strong secret message
secret_key = input('Enter your secret key: ')

hash_hex = hashlib.sha256(secret_key.encode()).hexdigest()

# Post this hash right now
print(f'The SHA-256 hash of the secret key is: {hash_hex}')

This is not OK, the moderators should block this zahid888 user. Spreading false information should not be allowed. People here dont need bs...

[zahid888]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

Find a major miner here who is willing to purchase the private key from you. Conduct this transaction in a public setting to guarantee transparency and prevent possible fraud.Good luck...

I need some advice on how to publicly conduct a transaction. How can I safely hand over the key and ensure I get paid at the right moment? Any ideas on this?

You should first mix the private key and a secret message together, then post the SHA-256 hash of that combination here. For example, if your private key in hex format is '36b0f7381163cd38c' and your secret message is 'helloitsme123xyz', you should post the SHA-256 hash of the concatenated string here immediately.

This sounds very unsafety...

What kind of insecurity are you feeling? Do you really think that someone can crack the SHA-256 hash created from the combination of your 17-character hex private key and an extended message with no character limit, which can include numbers, symbols, and alphabets ranging from 10, 15, 50, or even 100 characters? If so, that's quite laughable. Let me tell you that it won't just be a hash; it will be proof that after the creator, you were the only person who knew the private key. Many have come and gone, claiming to have solved Puzzle 66, and maybe you're one of them. The sooner you post some proof, the better it will be. There is no method more secure and easier than this, You asked, so I told you. The rest is your own wish..

[WanderingPhilospher]

Yeah, I was trying to create a python script to extract all the info. Finally got back around to my to-do list lol.

https://github.com/albertobsd/ecctools?tab=readme-ov-file#verifymsgaa

I know it has been in your ecctools, but I could never get that part to compile on Windows, so I sat out to write it in Python; which I finally got around to finishing it today.

Code:

Bitcoin Address: 13zb1hQbWVuYdZoAkztVrNrm65aReL2pYD
Message         : I finally got this to work with python
Signature        : H6DZ+QYaSIb+EafHdwIC9uJrM3B6ZovzsvkpIIkNIij8QdORG03/ccbyodreXNp5YlyclvkiSA8lu9XThd8ZauU=

[Gord0nFreeman]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

Find a major miner here who is willing to purchase the private key from you. Conduct this transaction in a public setting to guarantee transparency and prevent possible fraud.Good luck...

I need some advice on how to publicly conduct a transaction. How can I safely hand over the key and ensure I get paid at the right moment? Any ideas on this?

You should first mix the private key and a secret message together, then post the SHA-256 hash of that combination here. For example, if your private key in hex format is '36b0f7381163cd38c' and your secret message is 'helloitsme123xyz', you should post the SHA-256 hash of the concatenated string here immediately.

This sounds very unsafety...

What kind of insecurity are you feeling? Do you really think that someone can crack the SHA-256 hash created from the combination of your 17-character hex private key and an extended message with no character limit, which can include numbers, symbols, and alphabets ranging from 10, 15, 50, or even 100 characters? If so, that's quite laughable. Let me tell you that it won't just be a hash; it will be proof that after the creator, you were the only person who knew the private key. Many have come and gone, claiming to have solved Puzzle 66, and maybe you're one of them. The sooner you post some proof, the better it will be. There is no method more secure and easier than this, You asked, so I told you. The rest is your own wish..

better for whom? for bot owners? they will become more wary, especially since I don’t have much knowledge of cryptography to encrypt my private key and post it here! no need to prove, just help me contact the miners! or let the creator pay attention to the problem of funds being stolen by bots from under the noses of those who actually found the key!

[CY4NiDE]

better for whom? for bot owners? they will become more wary

You already announced it to the whole world, buddy.

let the creator pay attention to the problem of funds being stolen by bots from under the noses of those who actually found the key!

Why should he even care about this? 

just help me contact the miners!

Honest question; is this really feasible?

[coinprober]

better for whom? for bot owners? they will become more wary

You already announced it to the whole world, buddy.

let the creator pay attention to the problem of funds being stolen by bots from under the noses of those who actually found the key!

Why should he even care about this? 

just help me contact the miners!

Honest question; is this really feasible?

Publishing the SHA-256 hash is the best way to prove you've solved Puzzle 66, and it's safe

[Arm90]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

i can help you for a reward 15 %, contact me on dm

[citb0in]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

i can help you for a reward 15 %, contact me on dm

why PM and not publicly posted here into the thread where it belongs to? I am pretty sure everyone is interested you (or other wizards) can help such key finders

[Arm90]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

i can help you for a reward 15 %, contact me on dm

why PM and not publicly posted here into the thread where it belongs to? I am pretty sure everyone is interested you (or other wizards) can help such key finders

Hi.Because untill he dont withdraw yet,i think it not advisable to post here publicly

[Akito S. M. Hosana]

I think they both have to be full forum members to be contacted. It can't be done with only 2 posts.

[sssergy2705]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

i can help you for a reward 15 %, contact me on dm

why PM and not publicly posted here into the thread where it belongs to? I am pretty sure everyone is interested you (or other wizards) can help such key finders

Judging by the questions, the person who found the key is a newbie. It will be easy to deceive him in private messages.
And here we gathered mainly those who are in one way or another familiar first-hand with the work of the blockchain, what public keys and private keys are.
And if there is an attempt to deceive, the locals will tell you if something is wrong.

[Baskentliia]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

i can help you for a reward 15 %, contact me on dm

why PM and not publicly posted here into the thread where it belongs to? I am pretty sure everyone is interested you (or other wizards) can help such key finders

Judging by the questions, the person who found the key is a newbie. It will be easy to deceive him in private messages.
And here we gathered mainly those who are in one way or another familiar first-hand with the work of the blockchain, what public keys and private keys are.
And if there is an attempt to deceive, the locals will tell you if something is wrong.

Maybe he didn't find it, he may be lying, we don't know. If he had found it, he would have done hours of research without wasting time, found a safe way to withdraw it and vacated the address. I think he is lying.

[AlanJohnson]

Hello everyone! I found the key to puzzle 66, but now I have another problem: how to withdraw the funds so that no one can intercept them with a bot? Please repost this message so the creator sees it! Maybe someone can tweet this so that the owners of large pools can respond, whether they can add the transaction to the next block when it is found, without broadcasting it to the network?
Pls, HELP ME!!!!!

i can help you for a reward 15 %, contact me on dm

why PM and not publicly posted here into the thread where it belongs to? I am pretty sure everyone is interested you (or other wizards) can help such key finders

Judging by the questions, the person who found the key is a newbie. It will be easy to deceive him in private messages.
And here we gathered mainly those who are in one way or another familiar first-hand with the work of the blockchain, what public keys and private keys are.
And if there is an attempt to deceive, the locals will tell you if something is wrong.

Maybe he didn't find it, he may be lying, we don't know. If he had found it, he would have done hours of research without wasting time, found a safe way to withdraw it and vacated the address. I think he is lying.

He found 66 bit key   but he don't know what to do next ...  yeah, right ... Just another attention seeker.

[Akito S. M. Hosana]

It's not a game of who is smarter, or how many smart posts someone has; it's about who can guess the puzzle, simple as that, or rather, who has more luck or resources.

• KANGAROO: Sun Jul 14 16:01:51 2024
• [Puzzle]: 40
• [Lower range limit]: 0x8000000000
• [Upper range limit]: 0xffffffffff
• [EC Point Coordinate X]: 0xa2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4
• [EC Point Coordinate Y]: 0x7ba1a987013e78aef5295bf842749bdf97e25336a82458bbaba8c00d16a79ea7
• [Hops: 229969 h/s] [00:00:01]
• total time: 1.47 sec
• KANGAROO: Sun Jul 14 16:01:53 2024 PUZZLE SOLVED
• Private key (hex) : 000000000000000000000000000000000000000000000000000000e9ae4933d6
• Hops: 335150
• Average time to solve: 1.47 sec

Can you make this same app with gmpy2, I don't trust that  Iceland  ?

[WanderingPhilospher]

It's not a game of who is smarter, or how many smart posts someone has; it's about who can guess the puzzle, simple as that, or rather, who has more luck or resources.

• KANGAROO: Sun Jul 14 16:01:51 2024
• [Puzzle]: 40
• [Lower range limit]: 0x8000000000
• [Upper range limit]: 0xffffffffff
• [EC Point Coordinate X]: 0xa2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4
• [EC Point Coordinate Y]: 0x7ba1a987013e78aef5295bf842749bdf97e25336a82458bbaba8c00d16a79ea7
• [Hops: 229969 h/s] [00:00:01]
• total time: 1.47 sec
• KANGAROO: Sun Jul 14 16:01:53 2024 PUZZLE SOLVED
• Private key (hex) : 000000000000000000000000000000000000000000000000000000e9ae4933d6
• Hops: 335150
• Average time to solve: 1.47 sec

Can you make this same app with gmpy2, I don't trust that  Iceland  ?

Wasn't his first post written in gmp?!

[nomachine]

Can you make this same app with gmpy2, I don't trust that  Iceland  ?

You mean in Python?

Code:

import time, random
from gmpy2 import mpz, f_mod, powmod, invert

modulo = mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F)
Gx = mpz(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
Gy = mpz(0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8)
PG = (Gx, Gy)
Z = (0, 0)

def add(P, Q, p=modulo):
    Px, Py = P
    Qx, Qy = Q
    if P == Z:
        return Q
    elif Q == Z:
        return P
    elif Px == Qx:
        if Py != Qy or Py == 0:
            return Z
        num = 3 * Px * Px
        denom = 2 * Py
    else:
        num = Qy - Py
        denom = Qx - Px  
    m = (num * invert(denom, p)) % p  
    x = (m * m - Px - Qx) % p
    y = (m * (Px - x) - Py) % p  
    return (x, y)

def mul(k, P=PG):
    R = Z
    while k:
        if k & 1:
            R = add(R, P)
        P = add(P, P)
        k >>= 1
    return R

def X2Y(X, y_parity, p=modulo):
    X_cubed = powmod(X, 3, p)
    tmp = (X_cubed + 7) % p
    Y = powmod(tmp, (p + 1) // 4, p)
    if y_parity == 1:
        Y = (-Y) % p
    return Y

def comparator(P, Pindex, DP_rarity, t, W, w, T):
    if f_mod(P[0], DP_rarity) == 0:
        T.append(P[0])
        t.append(Pindex)
        common_elements = set(T).intersection(W)
        if common_elements:
            match = common_elements.pop()
            tT = t[T.index(match)]
            wW = w[W.index(match)]
            HEX = '%064x' % abs(tT - wW)
            dec = int(HEX, 16)
            total_time = time.time() - starttime
            print(f"\n[+] total time: {total_time:.2f} sec")
            print_status(time.ctime(), 'PUZZLE SOLVED')
            print(f"\033[32m[+] Private key (hex) : {HEX} \033[0m")
            log_solution(total_time, dec, HEX)
            return True
    return False

def search(P, W0, DP_rarity, Nw, Nt, hop_modulo, upper, lower):
    t = [lower + random.randint(0, upper - lower) for _ in range(Nt)]
    T = [mul(ti) for ti in t]
    w = [random.randint(0, upper - lower) for _ in range(Nw)]
    W = [add(W0, mul(wi)) for wi in w]
    Hops, Hops_old = 0, 0
    t0 = time.time()
    solved = False
    while not solved:
        for k in range(Nt + Nw):
            Hops += 1
            if k < Nt:
                pw = T[k][0] % hop_modulo
                solved = comparator(T[k], t[k], DP_rarity, T, t, W, w)
                if solved: break
                t[k] += 1 << pw
                T[k] = add(P[pw], T[k])
            else:
                k -= Nt
                pw = W[k][0] % hop_modulo
                solved = comparator(W[k], w[k], DP_rarity, W, w, T, t)
                if solved: break
                w[k] += 1 << pw
                W[k] = add(P[pw], W[k])
        t1 = time.time()
        elapsed_time = t1 - starttime
        if (t1 - t0) > 1:
            hops_per_second = (Hops - Hops_old) / (t1 - t0)
            hours, rem = divmod(elapsed_time, 3600)
            minutes, seconds = divmod(rem, 60)
            elapsed_time_str = f"{int(hours):02d}:{int(minutes):02d}:{int(seconds):02d}"
            print(f'[+] [Hops: {hops_per_second:.0f} h/s] [{elapsed_time_str}]', end='\r', flush=True)
            t0 = t1
            Hops_old = Hops
    print('\r[+] Hops:', Hops)
    print('[+] Average time to solve: %.2f sec' % ((time.time() - starttime)))

def print_status(t, message):
    print(f"\033[?25l\033[01;33m[+]\033[32m KANGAROO: \033[01;33m{t}\033[0m {message}")

def print_puzzle_info(puzzle, lower, upper, X, Y):
    print(f"[+] [Puzzle]: {puzzle}")
    print(f"[+] [Lower range limit]: {hex(lower)}")
    print(f"[+] [Upper range limit]: {hex(upper)}")
    print(f"[+] [EC Point Coordinate X]: {hex(X)}")
    print(f"[+] [EC Point Coordinate Y]: {hex(Y)}")

def log_solution(total_time, dec, HEX):
    t = time.ctime()
    dash_line = '-' * 140
    with open("KEYFOUNDKEYFOUND.txt", "a") as file:
        file.write(f"\n{dash_line}")
        file.write("\n\nSOLVED " + t)
        file.write(f"\nTotal Time: {total_time:.2f} sec")
        file.write("\nPrivate Key (decimal): " + str(dec))
        file.write("\nPrivate Key (hex): " + HEX)
        file.write(f"\n{dash_line}")

t = time.ctime()
print_status(t, "")

# Configuration for the puzzle
puzzle = 40
compressed_public_key = "03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4"
kangaroo_power = 5
lower = 2 ** (puzzle - 1)
upper = (2 ** puzzle) - 1

DP_rarity = 1 << int(((puzzle -  2*kangaroo_power)/2 - 2))
hop_modulo = ((puzzle - 1) // 2) + kangaroo_power

Nt = Nw = 2**kangaroo_power

if len(compressed_public_key) == 66:
    X = mpz(compressed_public_key[2:66], 16)
    Y = X2Y(X, mpz(compressed_public_key[:2]) - 2)
else:
    print("[error] pubkey len(66/130) invalid!")

W0 = (X, Y)
starttime = time.time()
print_puzzle_info(puzzle, lower, upper, X, Y)
Hops = 0
solved = False

random.seed()

P = [PG]
for k in range(255):
        P.append(add(P[k], P[k]))

solved = search(P, W0, DP_rarity, Nw, Nt, hop_modulo, upper, lower)

• KANGAROO: Tue Jul 16 20:01:26 2024
• [Puzzle]: 40
• [Lower range limit]: 0x8000000000
• [Upper range limit]: 0xffffffffff
• [EC Point Coordinate X]: 0xa2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4
• [EC Point Coordinate Y]: 0x7ba1a987013e78aef5295bf842749bdf97e25336a82458bbaba8c00d16a79ea7
• [Hops: 303330 h/s] [00:00:02]
• total time: 2.20 sec
• KANGAROO: Tue Jul 16 20:01:28 2024 PUZZLE SOLVED
• Private key (hex) : 000000000000000000000000000000000000000000000000000000e9ae4933d6
• Hops: 657608
• Average time to solve: 2.20 sec

[Akito S. M. Hosana]

Can you make this same app with gmpy2, I don't trust that  Iceland  ?

You mean in Python?

Code:

import time, random
from gmpy2 import mpz, f_mod, powmod, invert

modulo = mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F)
Gx = mpz(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
Gy = mpz(0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8)
PG = (Gx, Gy)
Z = (0, 0)

def add(P, Q, p=modulo):
    Px, Py = P
    Qx, Qy = Q
    if P == Z:
        return Q
    elif Q == Z:
        return P
    elif Px == Qx:
        if Py != Qy or Py == 0:
            return Z
        num = 3 * Px * Px
        denom = 2 * Py
    else:
        num = Qy - Py
        denom = Qx - Px  
    m = (num * invert(denom, p)) % p  
    x = (m * m - Px - Qx) % p
    y = (m * (Px - x) - Py) % p  
    return (x, y)

def mul(k, P=PG):
    R = Z
    while k:
        if k & 1:
            R = add(R, P)
        P = add(P, P)
        k >>= 1
    return R

def X2Y(X, y_parity, p=modulo):
    X_cubed = powmod(X, 3, p)
    tmp = (X_cubed + 7) % p
    Y = powmod(tmp, (p + 1) // 4, p)
    if y_parity == 1:
        Y = (-Y) % p
    return Y

def comparator(P, Pindex, DP_rarity, t, W, w, T):
    if f_mod(P[0], DP_rarity) == 0:
        T.append(P[0])
        t.append(Pindex)
        common_elements = set(T).intersection(W)
        if common_elements:
            match = common_elements.pop()
            tT = t[T.index(match)]
            wW = w[W.index(match)]
            HEX = '%064x' % abs(tT - wW)
            dec = int(HEX, 16)
            total_time = time.time() - starttime
            print(f"\n[+] total time: {total_time:.2f} sec")
            print_status(time.ctime(), 'PUZZLE SOLVED')
            print(f"\033[32m[+] Private key (hex) : {HEX} \033[0m")
            log_solution(total_time, dec, HEX)
            return True
    return False

def search(P, W0, DP_rarity, Nw, Nt, hop_modulo, upper, lower):
    t = [lower + random.randint(0, upper - lower) for _ in range(Nt)]
    T = [mul(ti) for ti in t]
    w = [random.randint(0, upper - lower) for _ in range(Nw)]
    W = [add(W0, mul(wi)) for wi in w]
    Hops, Hops_old = 0, 0
    t0 = time.time()
    solved = False
    while not solved:
        for k in range(Nt + Nw):
            Hops += 1
            if k < Nt:
                pw = T[k][0] % hop_modulo
                solved = comparator(T[k], t[k], DP_rarity, T, t, W, w)
                if solved: break
                t[k] += 1 << pw
                T[k] = add(P[pw], T[k])
            else:
                k -= Nt
                pw = W[k][0] % hop_modulo
                solved = comparator(W[k], w[k], DP_rarity, W, w, T, t)
                if solved: break
                w[k] += 1 << pw
                W[k] = add(P[pw], W[k])
        t1 = time.time()
        elapsed_time = t1 - starttime
        if (t1 - t0) > 1:
            hops_per_second = (Hops - Hops_old) / (t1 - t0)
            hours, rem = divmod(elapsed_time, 3600)
            minutes, seconds = divmod(rem, 60)
            elapsed_time_str = f"{int(hours):02d}:{int(minutes):02d}:{int(seconds):02d}"
            print(f'[+] [Hops: {hops_per_second:.0f} h/s] [{elapsed_time_str}]', end='\r', flush=True)
            t0 = t1
            Hops_old = Hops
    print('\r[+] Hops:', Hops)
    print('[+] Average time to solve: %.2f sec' % ((time.time() - starttime)))

def print_status(t, message):
    print(f"\033[?25l\033[01;33m[+]\033[32m KANGAROO: \033[01;33m{t}\033[0m {message}")

def print_puzzle_info(puzzle, lower, upper, X, Y):
    print(f"[+] [Puzzle]: {puzzle}")
    print(f"[+] [Lower range limit]: {hex(lower)}")
    print(f"[+] [Upper range limit]: {hex(upper)}")
    print(f"[+] [EC Point Coordinate X]: {hex(X)}")
    print(f"[+] [EC Point Coordinate Y]: {hex(Y)}")

def log_solution(total_time, dec, HEX):
    t = time.ctime()
    dash_line = '-' * 140
    with open("KEYFOUNDKEYFOUND.txt", "a") as file:
        file.write(f"\n{dash_line}")
        file.write("\n\nSOLVED " + t)
        file.write(f"\nTotal Time: {total_time:.2f} sec")
        file.write("\nPrivate Key (decimal): " + str(dec))
        file.write("\nPrivate Key (hex): " + HEX)
        file.write(f"\n{dash_line}")

t = time.ctime()
print_status(t, "")

# Configuration for the puzzle
puzzle = 40
compressed_public_key = "03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4"
kangaroo_power = 5
lower = 2 ** (puzzle - 1)
upper = (2 ** puzzle) - 1

DP_rarity = 1 << int(((puzzle -  2*kangaroo_power)/2 - 2))
hop_modulo = ((puzzle - 1) // 2) + kangaroo_power

Nt = Nw = 2**kangaroo_power

if len(compressed_public_key) == 66:
    X = mpz(compressed_public_key[2:66], 16)
    Y = X2Y(X, mpz(compressed_public_key[:2]) - 2)
else:
    print("[error] pubkey len(66/130) invalid!")

W0 = (X, Y)
starttime = time.time()
print_puzzle_info(puzzle, lower, upper, X, Y)
Hops = 0
solved = False

random.seed()

P = [PG]
for k in range(255):
        P.append(add(P[k], P[k]))

solved = search(P, W0, DP_rarity, Nw, Nt, hop_modulo, upper, lower)

• KANGAROO: Tue Jul 16 20:01:26 2024
• [Puzzle]: 40
• [Lower range limit]: 0x8000000000
• [Upper range limit]: 0xffffffffff
• [EC Point Coordinate X]: 0xa2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4
• [EC Point Coordinate Y]: 0x7ba1a987013e78aef5295bf842749bdf97e25336a82458bbaba8c00d16a79ea7
• [Hops: 303330 h/s] [00:00:02]
• total time: 2.20 sec
• KANGAROO: Tue Jul 16 20:01:28 2024 PUZZLE SOLVED
• Private key (hex) : 000000000000000000000000000000000000000000000000000000e9ae4933d6
• Hops: 657608
• Average time to solve: 2.20 sec

• KANGAROO: Tue Jul 16 20:46:12 2024
• [Puzzle]: 40
• [Lower range limit]: 0x8000000000
• [Upper range limit]: 0xffffffffff
• [EC Point Coordinate X]: 0xa2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4
• [EC Point Coordinate Y]: 0x7ba1a987013e78aef5295bf842749bdf97e25336a82458bbaba8c00d16a79ea7
• [Hops: 301975 h/s] [00:00:03]
• total time: 3.59 sec
• KANGAROO: Tue Jul 16 20:46:16 2024 PUZZLE SOLVED
• Private key (hex) : 000000000000000000000000000000000000000000000000000000e9ae4933d6
• Hops: 1076731
• Average time to solve: 3.59 sec

Thanks. But why is the speed sometimes 290000 and sometimes 305000?
Sometimes solve in 2 seconds and sometimes in 10 seconds? Strange.

[nomachine]

Can you make this same app with gmpy2, I don't trust that  Iceland  ?

You mean in Python?

Code:

import time, random
from gmpy2 import mpz, f_mod, powmod, invert

modulo = mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F)
Gx = mpz(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
Gy = mpz(0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8)
PG = (Gx, Gy)
Z = (0, 0)

def add(P, Q, p=modulo):
    Px, Py = P
    Qx, Qy = Q
    if P == Z:
        return Q
    elif Q == Z:
        return P
    elif Px == Qx:
        if Py != Qy or Py == 0:
            return Z
        num = 3 * Px * Px
        denom = 2 * Py
    else:
        num = Qy - Py
        denom = Qx - Px  
    m = (num * invert(denom, p)) % p  
    x = (m * m - Px - Qx) % p
    y = (m * (Px - x) - Py) % p  
    return (x, y)

def mul(k, P=PG):
    R = Z
    while k:
        if k & 1:
            R = add(R, P)
        P = add(P, P)
        k >>= 1
    return R

def X2Y(X, y_parity, p=modulo):
    X_cubed = powmod(X, 3, p)
    tmp = (X_cubed + 7) % p
    Y = powmod(tmp, (p + 1) // 4, p)
    if y_parity == 1:
        Y = (-Y) % p
    return Y

def comparator(P, Pindex, DP_rarity, t, W, w, T):
    if f_mod(P[0], DP_rarity) == 0:
        T.append(P[0])
        t.append(Pindex)
        common_elements = set(T).intersection(W)
        if common_elements:
            match = common_elements.pop()
            tT = t[T.index(match)]
            wW = w[W.index(match)]
            HEX = '%064x' % abs(tT - wW)
            dec = int(HEX, 16)
            total_time = time.time() - starttime
            print(f"\n[+] total time: {total_time:.2f} sec")
            print_status(time.ctime(), 'PUZZLE SOLVED')
            print(f"\033[32m[+] Private key (hex) : {HEX} \033[0m")
            log_solution(total_time, dec, HEX)
            return True
    return False

def search(P, W0, DP_rarity, Nw, Nt, hop_modulo, upper, lower):
    t = [lower + random.randint(0, upper - lower) for _ in range(Nt)]
    T = [mul(ti) for ti in t]
    w = [random.randint(0, upper - lower) for _ in range(Nw)]
    W = [add(W0, mul(wi)) for wi in w]
    Hops, Hops_old = 0, 0
    t0 = time.time()
    solved = False
    while not solved:
        for k in range(Nt + Nw):
            Hops += 1
            if k < Nt:
                pw = T[k][0] % hop_modulo
                solved = comparator(T[k], t[k], DP_rarity, T, t, W, w)
                if solved: break
                t[k] += 1 << pw
                T[k] = add(P[pw], T[k])
            else:
                k -= Nt
                pw = W[k][0] % hop_modulo
                solved = comparator(W[k], w[k], DP_rarity, W, w, T, t)
                if solved: break
                w[k] += 1 << pw
                W[k] = add(P[pw], W[k])
        t1 = time.time()
        elapsed_time = t1 - starttime
        if (t1 - t0) > 1:
            hops_per_second = (Hops - Hops_old) / (t1 - t0)
            hours, rem = divmod(elapsed_time, 3600)
            minutes, seconds = divmod(rem, 60)
            elapsed_time_str = f"{int(hours):02d}:{int(minutes):02d}:{int(seconds):02d}"
            print(f'[+] [Hops: {hops_per_second:.0f} h/s] [{elapsed_time_str}]', end='\r', flush=True)
            t0 = t1
            Hops_old = Hops
    print('\r[+] Hops:', Hops)
    print('[+] Average time to solve: %.2f sec' % ((time.time() - starttime)))

def print_status(t, message):
    print(f"\033[?25l\033[01;33m[+]\033[32m KANGAROO: \033[01;33m{t}\033[0m {message}")

def print_puzzle_info(puzzle, lower, upper, X, Y):
    print(f"[+] [Puzzle]: {puzzle}")
    print(f"[+] [Lower range limit]: {hex(lower)}")
    print(f"[+] [Upper range limit]: {hex(upper)}")
    print(f"[+] [EC Point Coordinate X]: {hex(X)}")
    print(f"[+] [EC Point Coordinate Y]: {hex(Y)}")

def log_solution(total_time, dec, HEX):
    t = time.ctime()
    dash_line = '-' * 140
    with open("KEYFOUNDKEYFOUND.txt", "a") as file:
        file.write(f"\n{dash_line}")
        file.write("\n\nSOLVED " + t)
        file.write(f"\nTotal Time: {total_time:.2f} sec")
        file.write("\nPrivate Key (decimal): " + str(dec))
        file.write("\nPrivate Key (hex): " + HEX)
        file.write(f"\n{dash_line}")

t = time.ctime()
print_status(t, "")

# Configuration for the puzzle
puzzle = 40
compressed_public_key = "03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4"
kangaroo_power = 5
lower = 2 ** (puzzle - 1)
upper = (2 ** puzzle) - 1

DP_rarity = 1 << int(((puzzle -  2*kangaroo_power)/2 - 2))
hop_modulo = ((puzzle - 1) // 2) + kangaroo_power

Nt = Nw = 2**kangaroo_power

if len(compressed_public_key) == 66:
    X = mpz(compressed_public_key[2:66], 16)
    Y = X2Y(X, mpz(compressed_public_key[:2]) - 2)
else:
    print("[error] pubkey len(66/130) invalid!")

W0 = (X, Y)
starttime = time.time()
print_puzzle_info(puzzle, lower, upper, X, Y)
Hops = 0
solved = False

random.seed()

P = [PG]
for k in range(255):
        P.append(add(P[k], P[k]))

solved = search(P, W0, DP_rarity, Nw, Nt, hop_modulo, upper, lower)

• KANGAROO: Tue Jul 16 20:01:26 2024
• [Puzzle]: 40
• [Lower range limit]: 0x8000000000
• [Upper range limit]: 0xffffffffff
• [EC Point Coordinate X]: 0xa2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4
• [EC Point Coordinate Y]: 0x7ba1a987013e78aef5295bf842749bdf97e25336a82458bbaba8c00d16a79ea7
• [Hops: 303330 h/s] [00:00:02]
• total time: 2.20 sec
• KANGAROO: Tue Jul 16 20:01:28 2024 PUZZLE SOLVED
• Private key (hex) : 000000000000000000000000000000000000000000000000000000e9ae4933d6
• Hops: 657608
• Average time to solve: 2.20 sec

• KANGAROO: Tue Jul 16 20:46:12 2024
• [Puzzle]: 40
• [Lower range limit]: 0x8000000000
• [Upper range limit]: 0xffffffffff
• [EC Point Coordinate X]: 0xa2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4
• [EC Point Coordinate Y]: 0x7ba1a987013e78aef5295bf842749bdf97e25336a82458bbaba8c00d16a79ea7
• [Hops: 301975 h/s] [00:00:03]
• total time: 3.59 sec
• KANGAROO: Tue Jul 16 20:46:16 2024 PUZZLE SOLVED
• Private key (hex) : 000000000000000000000000000000000000000000000000000000e9ae4933d6
• Hops: 1076731
• Average time to solve: 3.59 sec

Thanks. But why is the speed sometimes 290000 and sometimes 305000?
Sometimes solve in 2 seconds and sometimes in 10 seconds? Strange.

Kangaroo is a probabilistic algorithm, it depends which random.seed() you hit at which moment. One is faster and the other is slower. Then it depends on the load of the whole machine.

[wilspen]

UPDATE

Guys, here's a new puzzle challenge from the channel https://www.youtube.com/watch?v=LkejrZuQadg, this challenge consists of locating the private key of the address 19L9vivFCPJnAVDsjZ76mF2ZiTLKFUXEpV which is in the same range as puzzle 66, but with a dot , according to the creator, next Friday, he will request a transfer, the objective would be to export the public key on the blockchain and test whether it would be possible for someone to intercept the transfer before it is completed through the RBF, thus removing doubts whether The same thing could happen with puzzle 66, so whoever has the BOTs being heated could do this test with this key. hahahaha.

Anyway, you already know the day, you just need to be more agile than the process on the blockchain, according to the creator, he will place the transaction at the lowest possible rate, precisely to understand if it would be possible for someone to intercept this transaction and withdraw before him, good luck.

Creator:
https://www.youtube.com/watch?v=LkejrZuQadg

Address: 19L9vivFCPJnAVDsjZ76mF2ZiTLKFUXEpV
Range: 20000000000000000:3ffffffffffffffff

complement of the challenge, According to the creator in his new video, the transaction will take place between 1-2am, Brasilia time (UTC-03:00), he said he will try to delay some blocks, to give people time to try to make the transfers using RBF according to the last video https://www.youtube.com/watch?v=Xe1w-AfL6qQ