Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 158. (Read 244886 times)

from tqdm import tqdm
import secp256k1 as ice

# Define the start and end 
start = 0x20000000000000000
end = 0x3ffffffffffffffff

# Define the chunk size
chunk_size = 10_000_000

# Initialize the current start and end values
current_start = start
current_end = start + chunk_size

# Initialize the chunk number
chunk_number = 1

while current_start < end:
    current_end = min(current_end, end)
    
    # Create a tqdm progress bar for the current chunk
    with tqdm(total=current_end - current_start, desc=f'Chunk {chunk_number} end {current_end}') as pbar:
        for x in range(current_start, current_end):
            h160 = ice.privatekey_to_h160(2, True, x)
            if bytes.fromhex('20d45a6a762535700ce9e0b216e31994335db8a5') in h160:
                with open("KEYFOUNDKEYFOUND.txt", "a") as f:
                    f.write(str(x) + "-" + (h160.hex()) + "\n")
            pbar.update(1)
    
    # Update the current_start and current_end for the next chunk
    current_start = current_end
    current_end += chunk_size
    chunk_number += 1

  //Set startKey from Seed
  int BitL = Random_bits - 1;
  int BitU = Random_bits;
  Int *Sk = new Int[1];
  if (Seed.length() > 0) {
	  // from Seed
	  getKeysFromRandomSeed(BitL, BitU, true, 1, Sk);
	  startKey.Set(&Sk[0]);
	  printf("[i] startKey.Set() from Seed: %s \n", Seed.c_str());
	  //
  }
  delete [] Sk;
  //

// argv Seed
if (Seed.length() == 0) {
	// Default seed
	seed = Timer::getSeed(32);// random seed
} else {
	seed = Seed;// -s seed
}