Quote from: Evillo on Today at 01:22:42 AM

Quote from: Mikorist on December 07, 2022, 12:00:16 PM

Quote from: VinIVaderr on October 25, 2022, 08:30:41 PM

I cannot get your @jolly_jocker code to run correctly.

However, I think what you are trying to achieve is using the known WIF key part and tumble searching the remaining characters to find the WIF private key. I am able to again, use the known key part and add a randomize search for the remaining part and output this in hexadecimal format. It is not any faster than a general hexadecimal search.

I am not sure if you can generate a WIF private key with a check sum and convert/compare ; and then print the WIF key again in the same script.
I do agree that this puzzle is about testing the strength and secure-ness of bitcoin with new, creative code.

This is a basic python script and variation of VanityGen:

Code:

import secrets
import base58
import binascii
from bitcoin import privtopub, pubtoaddr
import sys

vanity = "13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so"
btc_addr = ""

while btc_addr[:len(vanity)] != vanity:
   prefix = "KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa"
   alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"
   postfix = ''.join(secrets.choice(alphabet) for i in range(18))
   first_encode = base58.b58decode(prefix + postfix)
   private_key_full = binascii.hexlify(first_encode)
   private_key = private_key_full[2:-8]
   btc_pubkey = privtopub(private_key.decode())
   btc_addr = pubtoaddr(btc_pubkey)

print(private_key.decode())
print(btc_pubkey)
print(btc_addr)

sys.exit()

Hello, Thanks for all your posts !
I modified your script a little, so that it loads the database of all BTC addresses plus searches for puzzle patterns at the same time. Grin

Code:

import os
import time
import secrets
import base58
import binascii
from bitcoin import privtopub, pubtoaddr
import sys
import multiprocessing
from halo import Halo
import random, string
import threading

print("Loading TXT Please Wait and Good Luck...")
filename ='list.txt'
with open(filename) as f:
   add = f.read().split()
add = set(add)

spinner = Halo(text='Loading', spinner='dots')

r = 0
cores=1 #CPU Control Set Cores
def seek(r):
   F = []
   while True:
   prefix = "KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa"
   alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"
   postfix = ''.join(secrets.choice(alphabet) for i in range(18))
   first_encode = base58.b58decode(f'{prefix}{postfix}')
   private_key_full = binascii.hexlify(first_encode)
   private_key = private_key_full[2:-8]
   btc_pubkey = privtopub(private_key.decode())
   btc_addr = pubtoaddr(btc_pubkey)
   spinner.start()

   if btc_addr.startswith("13zb1"):
   t = time.ctime()
   spinner.stop()
   print("Pattern Found:",t, btc_addr, private_key)
   print("\n continue...\n")
   spinner.start()

   if btc_addr in add:
   t = time.ctime()
   spinner.stop()
   print("Winner Found!:",t, btc_addr, private_key)
   f=open(u"Winner.txt","a") #Output File
   f.write('WIF private key: ' + str(private_key) + '\n' +
   'public key: ' + str(btc_pubkey) + '\n' +
   'BTC address: ' + str(btc_addr) + '\n\n')
   f.close()
   sleep(1)
   break

#CPU Control Command
if __name__ == '__main__':
   os.system('clear')
   t = time.ctime()
   print(t, "GOOD LUCK AND HAPPY HUNTING...")

   jobs = []
   for r in range(cores):
   p = multiprocessing.Process(target=seek, args=(r,))
   jobs.append(p)
   p.start()

Cool thanks .. Can you test speed and post results for us?

It is slow compared to ICE secp256k1. Twice the speed...However, I am currently creating a script that will be Full ICE - to search for lost parts of the private key. About 3 million per second. Grin