Finding k nonce using Kangaroo method

Hey everyone, I need some help with the kangaroo algorithm. What jumps should I set in the code to locate k nonce? I know k nonce is between n-2^40 and n-1, but the jump settings are confusing me.

You should definitely add 02 or 03 to r. This way, you’ll get the public key and the k nonce from the kangaroo pubkey. Just follow that approach.

Could you explain that a bit more? I have my public key, but I’m trying to retrieve k nonce using signatures rather than digging out the private key. Can you break it down for a newbie? Here’s the code I’m currently using: import os import time import gmpy2 from coincurve import PublicKey from multiprocessing import Pool, cpu_count import random import signal from datetime import datetime # Parameters of the secp256k1 curve n = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 # Files input_file = "rsz_8.txt" output_file = "k_8.txt" # Global flag for exe

You can use BSGS or the Kangaroo algorithm for this. Keyhunt (BSGS) is a solid option to find those coordinates at the same time. Honestly, a 40-bit range is pretty small. You could probably wrap this up in under a second.