Won't work, rmd160 has 40 characters and by searching for their prefix, should we stop hashing half way? Meaning converting sha256 hash of public key into rmd160 but only looking for a specific prefix, either we generate the whole hash and compare with our target or we can't generate just a prefix to compare because it would break the function and we wouldn't know the result.

About brute force tools, bitcrack, vanity etc they all convert rmd160 to address, otherwise why would they accept an address as an input to check against?

from os import system
system("title "+__file__)
import random
import time
#from bit import Key
#from combi import *

import gmpy2
import secp256k1 as ice


list2 = ["13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so"]

F1="01"

aa1=F1[0]*70
aa2=F1[1]*70

def find_permutation(lst,K,numberbit1,numberbit0):

    l = lst

    N = numberbit0
    M = numberbit1

    if N == len(l):
        return F1[1] * N
   
    if M == len(l):
        return F1[1] * M

    result = ''   

    for i in range (0, len(lst)-1):
        K0 = gmpy2.comb(len(l)-1, M)

        if (K < K0):
            result += F1[0]
            l.remove (F1[0])
        else:
            result += F1[1]
            l.remove (F1[1])
            M -=1
            K = K - K0

    result += l[0]

    return result

#count = 0
#5444517870735015415413993718908291383296  2^66×2^66
#93820969697840041204785894580506297666600 140!/70!/70!

while True:
   
    random.seed()
    sssakkki = random.randrange(1,73786976294838206464,1)
    saki = 73786976294838206464 * sssakkki
   
    print("")
    print("")
    print("")
    print(sssakkki,saki,"step",5444517870735015415413993718908291383296//saki)
    #time.sleep(random.randrange(1,10,1))

   
    X2=0 #X=10
    while X2 <= 5444517870735015415413993718908291383296:

        X=X2 #X=10
        while X <= X2: #+1000
                   
            a3 = list(aa1+aa2)
            K = X #perm_int
            numberbit1 = len(aa1)
            numberbit0 = len(aa2)

            aa = find_permutation(a3,K,numberbit1,numberbit0)
            random.seed(aa)

            b = random.randrange(36893488147419103232,73786976294838206464,1)

           
            if b >= 36893488147419103232:
                   
                    #key = Key.from_int(b)
                addr = ice.privatekey_to_address(0, True, b) #key.address
                           
                if addr in list2:
                               
                    print ("found!!!",b,addr)
                    s1 = str(b)
                    s2 = addr
                    f=open("a.txt","a")
                    f.write(s1)
                    f.write(s2)       
                    f.close()
                    pass
                else:
                    #pass
                    print(b,addr) #print(X,r1,b,addr)

               
            X=X+1


        X2=X2+saki
       
        #print("")
        #print(X2)
        #print("")

 

Edit:
Example of a strange public key:



Find their difference, also after that check 69 and 96 as hex, convert them to decimal and compare their values and difference in values, as I have said before this is an ocean, and somehow the designers of EC and the math involved either used magic to come up with these equations, or I am still unable to fathom  the infrastructure underneath them all, yet.  Do not rely on existing tools, if you can come up with new solutions, share them if they can not be used to endanger coins other than puzzle coins. Otherwise you should not reveal anything if it can be exploited to steal coins from people.

It's actually interesting to see public keys that follow this pattern. The keys produce the following addresses when they are uncompressed:


at compressed format they produce the following addresses (and they had an out transaction meaning they have a valid private key)

fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140 .. there are also invalid public keys. The reason is  there are pub keys that lie outside the curve. But i gotta agree that the mentioned pubs above are interesting, especially knowing that one of their addresses is a used one.

The strange public key which I'm sure has a solution to it, when I try to convert from compressed to uncompressed I get an error.

Are you talking about VBCRandom.exe ?

https://pasteboard.co/2KNmMhxAigSN.bmp

why was the last post of "Professor of wilds" here about puzzle #66 deleted? To the poster: please write again your proposal about the key search and the list you posted

i deleted it because i realized that no one would probably help me if you want to know what i said i have a high chance with the right people we could solve the next keys without kang or brute. if you can code send me your discord telegram anything if you want to try and help. its brought a lot of attention that i deleted my post but never got any while up? maybe that's why i took it down scared for someone to take what i know.

i deleted it because i realized that no one would probably help me if you want to know what i said i have a high chance with the right people we could solve the next keys without kang or brute. if you can code send me your discord telegram anything if you want to try and help. its brought a lot of attention that i deleted my post but never got any while up? maybe that's why i took it down scared for someone to take what i know.