then the last option is to look for luck. who have 64-core processors.
different 2 symbols for seed give different results
pz 20 example...
step 1100006 seed 000000111011001011000011111101 bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 1532829 seed 000001001101100011010111111001 bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 1129134 seed AAAAAAaaaAaaaaAAaaAaaAaAAaaaAA bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 494992 seed BBBBBBbBBBBbBbbbBbbbbbBbBbbBbb bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 548744 seed BBBBBBbBBbBbbbBBbbBBbbbbbbBBbb bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 896722 seed BBBBBBbbBbBBbBbbBbbbBbbBbbBBbb bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 1325957 seed SSSSSsSSSSsSssssSsSSsssssSsssS bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 5492813 seed RRRRrrRRrRrRRrrRrrrRRRrRRrrrrr bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 6988942 seed RRRRrrrRrrrrRRrrrRRrrRRRrRRRrr bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 7290958 seed RRRRrrrrRrrRRRrrrRRRrrRrrRRrrR bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 7721483 seed RRRRrrrrrrrrrRrrRrrRRrRRRRrRRR bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 8730248 seed RRRrRRrRRrrrrRrRrrrRrRrRrRRRrr bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 1811954 seed OOOOOoOoOooooOoOOOooooooooOOOO bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 1873426 seed VVVVVvVvvVVvvvVvvVvVvVVvVvvvvV bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 430546 seed WWWWWWWwwwwWwWwWWwwWwWwwWWwwww bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 3821040 seed XXXXxXXxxXXxXxxxXxxxXXxxxXXxXx bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 2652540 seed JJJJJjjjJJJjJjjjjjJjjjJJJJjjjJ bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 2777464 seed JJJJJjjjJjJJjjjjJjJJjjjjJJJJjj bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
step 765336 seed FFFFFFfFfffFfffffFffFFFFffFffF bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
step 2367636 seed FFFFFffFfFFfffFFFffFffffffFfFF bit 11010010110001010101 dec 863317 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
...
it turns out for different 2 seed symbols we have 200-300 collisions
22 sym len
6892620648693261354600 76!/38!/38!
1000000000000000000000 =
5892620648693261354600 / 2^64 319,4396054473088187643 collision
that is, there are already 1000-1500 collisions on 5 different 2-sign seeds
200 Aa
200 Bb
200 Cc
200 Dd
200 Ff
5 1000 collisions
10 2000 collisions
15 3000 collisions
20 4000 collisions
25 5000 collisions
30 6000 collisions
35 7000 collisions
40 8000 collisions
45 9000 collisions
50 10000 collisions
100 20000 collisions
500 100000 collisions
now we test the sample, we do not know the required number of 1 puzzle or 200-300 num collisions, pz 20 num len (10 by 2), cillision 22 num len (11 by 2)
if we create random samples (from 100 to 2 numbers) for example 1000 samples of 60 pairs out of 100
import random
import time
Nn =['00', '01', '02', '03', '04', '05', '06', '07', '08', '09',
'10', '11', '12', '13', '14', '15', '16', '17', '18', '19',
'20', '21', '22', '23', '24', '25', '26', '27', '28', '29',
'30', '31', '32', '33', '34', '35', '36', '37', '38', '39',
'40', '41', '42', '43', '44', '45', '46', '47', '48', '49',
'50', '51', '52', '53', '54', '55', '56', '57', '58', '59',
'60', '61', '62', '63', '64', '65', '66', '67', '68', '69',
'70', '71', '72', '73', '74', '75', '76', '77', '78', '79',
'80', '81', '82', '83', '84', '85', '86', '87', '88', '89',
'90', '91', '92', '93', '94', '95', '96', '97', '98', '99']
RRR = []
RRR3 = []
for X in range(200): # 2 seed symbols we have 200-300 collisions, 1000 5000 10000...
random.seed()
i = 1
while i <= 1:
RRR2 = []
for RR in range(11):
DDD = random.choice(Nn)
RRR2.append(DDD)
i=i+1
RRR3.append(RRR2)
RRR2=[]
print(RRR3,len(RRR3))
#count = 0
#count2 = 0
count3 = 0
count4 = 0
for elem in RRR3:
count3 += 1
count = 0
count2 = 0
print(count3,"elem count")
ii = 1
while ii <= 1000: # 1000 by 60 from 100
random.seed(ii)
i = 1
while i <= 1:
RRR = []
count += 1
for RR in range(60): # 50:50
DDD = random.choice(Nn)
RRR.append(DDD)
i=i+1
Nn1 =elem #['30', '56', '83', '77', '31', '20', '64', '20', '30', '28', '49']
fff1 = len(Nn1)
for ee in Nn1:
if ee in RRR:
count2 += 1
if count2 == fff1:
print("")
count4 += 1
print(count3,count,"huuuuuuuuuurraaaaaaaaaa...",Nn1,RRR)
print("")
count=0
break
RRR = []
count2=0
ii=ii+1
print("")
print("find count",count4)
further and this 1000 to 60, we again choose 1000 for each one already for 30
out of 30 it is much easier to choose 11 or 15 successfully
but as collisions increase (and this is 200-300 = 1 working program)
we can reduce the sample to 100
and here we have a ratio 1000*1000/11 or 15 100*100/11 or 15
for example, for the first sample, 100 by 60 for 10000 collision, find count 228 10000 100/60
100 by 60 for 100000 collision find count
2143 100000 100/60
2143 this means that such a number out of has a chance of being sampled at 30, 100(60)*100(30)...
it seems that the chances are good so that in 100(60)*100(30) = 10000 to 30 there are many opportunities to catch the desired set
we will have 10000 rows with a sample of 30 for a sample of 11 or 15 for 100000 collisions
how many collisions can be obtained from these signs !"#$%&\'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~
4371 individual programs i.e. 4371*200 = 874200 collisions
100(60)*100(30) = 10000 / 4371*200 = 874200 collisions
if the 64 core processor does not die to run them all, it may only take about ~50 million step concurrent programs to run
11! 39916800
15! 1307674368000
17! 355687428096000
20! 2432902008176640000
I have encountered 2 problems so far, 1 is a random row selection string from file, although you can run step by step and 2 the algorithm is recursive for seed permutations.
but you can even try to run
1) write a sample of 30 to a file
import random
import time
for MMM in range(1):
Nn =['00', '01', '02', '03', '04', '05', '06', '07', '08', '09',
'10', '11', '12', '13', '14', '15', '16', '17', '18', '19',
'20', '21', '22', '23', '24', '25', '26', '27', '28', '29',
'30', '31', '32', '33', '34', '35', '36', '37', '38', '39',
'40', '41', '42', '43', '44', '45', '46', '47', '48', '49',
'50', '51', '52', '53', '54', '55', '56', '57', '58', '59',
'60', '61', '62', '63', '64', '65', '66', '67', '68', '69',
'70', '71', '72', '73', '74', '75', '76', '77', '78', '79',
'80', '81', '82', '83', '84', '85', '86', '87', '88', '89',
'90', '91', '92', '93', '94', '95', '96', '97', '98', '99']
RRR1 = []
RRR2 = []
i = 1
while i <= 100:
random.seed(i)
for x1 in range(60): # 100 by 60 from 100
DDD = random.choice(Nn)
RRR1.append(DDD)
RRR2.append(RRR1)
RRR1=[]
i=i+1
#for elem in RRR2:
#print(elem)
RR1 = []
RR2 = []
for elem in RRR2:
i2 = 1
while i2 <= 100:
random.seed(i2)
for x1 in range(30): # 100 by 30 from 60
DDD = random.choice(elem)
RR1.append(DDD)
RR2.append(RR1)
#print(RR1)
RR1=[]
i2=i2+1
#print("")
GGG=[]
for elem1 in RR2:
d = ''.join(elem1)
GGG.append(d)
#print(d)
with open("tresher.txt", "a") as file:
for line in GGG:
file.write(line + '\n')
2) permutations for seed by 2
import random
from itertools import *
def reverse_string1(s):
return s[::-1]
def brute_force(alphabet, min_len, max_len):
joiner = ''.join
for cur_len in range(min_len, max_len + 1):
yield from map(joiner, product(alphabet, repeat=cur_len))
#alphabet = '!"#$%&\'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~'
alphabet = "abcdefghijklmnopqrstuvwxyz"
mo = []
b = brute_force(alphabet, 2, 2)
for v in b:
if v[0] != v[1]:
if v not in mo:
l = reverse_string1(v)
mo.append(l)
print(mo,len(mo))
3) 2 templates for writing, read line by line or randomly, they need to be called blablabla.txt
line by line
from os import system
system("title "+__file__)
import random
from bit import Key
#from bit.format import bytes_to_wif
#from PyRandLib import *
#rand = FastRand63()
#random.seed(rand())
import gmpy2
import time
def sym1():
a1 = "0"
return a1
def sym2():
a2 = "1"
return a2
def find_permutation(lst,K,numberbit1,numberbit0):
l = lst
N = numberbit0
M = numberbit1
if N == len(l):
return sym2() * N
if M == len(l):
return sym2() * M
result = ''
for i in range (0, len(lst)-1):
K0 = gmpy2.comb(len(l)-1, M)
if (K < K0):
result += sym1()
l.remove (sym1())
else:
result += sym2()
l.remove (sym2())
M -=1
K = K - K0
result += l[0]
return result
a1=sym1()*38
a2=sym2()*38
import time
list2 = ["16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN","13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so","1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9",
"1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ","19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG","1DJh2eHFYQfACPmrvpyWc8MSTYKh7w9eRF",
"1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU","1JTK7s9YVYywfm5XUH7RNhHJH1LshCaRFR","12VVRNPi4SJqUTsp6FmqDqY5sGosDtysn4",
"1FWGcVDK3JGzCC3WtkYetULPszMaK2Jksv","1DJh2eHFYQfACPmrvpyWc8MSTYKh7w9eRF","1Bxk4CQdqL9p22JEtDfdXMsng1XacifUtE",
"15qF6X51huDjqTmF9BJgxXdt1xcj46Jmhb","1ARk8HWJMn8js8tQmGUJeQHjSE7KRkn2t8","15qsCm78whspNQFydGJQk5rexzxTQopnHZ",
"13zYrYhhJxp6Ui1VV7pqa5WDhNWM45ARAC","14MdEb4eFcT3MVG5sPFG4jGLuHJSnt1Dk2","1CMq3SvFcVEcpLMuuH8PUcNiqsK1oicG2D",
"1K3x5L6G57Y494fDqBfrojD28UJv4s5JcK","1PxH3K1Shdjb7gSEoTX7UPDZ6SH4qGPrvq","16AbnZjZZipwHMkYKBSfswGWKDmXHjEpSf",
"19QciEHbGVNY4hrhfKXmcBBCrJSBZ6TaVt","1EzVHtmbN4fs4MiNk3ppEnKKhsmXYJ4s74","1AE8NzzgKE7Yhz7BWtAcAAxiFMbPo82NB5",
"17Q7tuG2JwFFU9rXVj3uZqRtioH3mx2Jad","1K6xGMUbs6ZTXBnhw1pippqwK6wjBWtNpL","15ANYzzCp5BFHcCnVFzXqyibpzgPLWaD8b",
"18ywPwj39nGjqBrQJSzZVq2izR12MDpDr8","1CaBVPrwUxbQYYswu32w7Mj4HR4maNoJSX","1JWnE6p6UN7ZJBN7TtcbNDoRcjFtuDWoNL",
"1CKCVdbDJasYmhswB6HKZHEAnNaDpK7W4n","1PXv28YxmYMaB8zxrKeZBW8dt2HK7RkRPX","1AcAmB6jmtU6AiEcXkmiNE9TNVPsj9DULf",
"1EQJvpsmhazYCcKX5Au6AZmZKRnzarMVZu","18KsfuHuzQaBTNLASyj15hy4LuqPUo1FNB","15EJFC5ZTs9nhsdvSUeBXjLAuYq3SWaxTc",
"1HB1iKUqeffnVsvQsbpC6dNi1XKbyNuqao","1GvgAXVCbA8FBjXfWiAms4ytFeJcKsoyhL","12JzYkkN76xkwvcPT6AWKZtGX6w2LAgsJg",
"1824ZJQ7nKJ9QFTRBqn7z7dHV5EGpzUpH3","18A7NA9FTsnJxWgkoFfPAFbQzuQxpRtCos","1NeGn21dUDDeqFQ63xb2SpgUuXuBLA4WT4",
"1NLbHuJebVwUZ1XqDjsAyfTRUPwDQbemfv","1MnJ6hdhvK37VLmqcdEwqC3iFxyWH2PHUV","1KNRfGWw7Q9Rmwsc6NT5zsdvEb9M2Wkj5Z",
"1PJZPzvGX19a7twf5HyD2VvNiPdHLzm9F6","1GuBBhf61rnvRe4K8zu8vdQB3kHzwFqSy7","17s2b9ksz5y7abUm92cHwG8jEPCzK3dLnT",
"1GDSuiThEV64c166LUFC9uDcVdGjqkxKyh","1Me3ASYt5JCTAK2XaC32RMeH34PdprrfDx","1CdufMQL892A69KXgv6UNBD17ywWqYpKut",
"1BkkGsX9ZM6iwL3zbqs7HWBV7SvosR6m8N","1PXAyUB8ZoH3WD8n5zoAthYjN15yN5CVq5","1AWCLZAjKbV1P7AHvaPNCKiB7ZWVDMxFiz",
"1G6EFyBRU86sThN3SSt3GrHu1sA7w7nzi4","1MZ2L1gFrCtkkn6DnTT2e4PFUTHw9gNwaj","1Hz3uv3nNZzBVMXLGadCucgjiCs5W9vaGz",
"1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua","16zRPnT8znwq42q7XeMkZUhb1bKqgRogyy","1KrU4dHE5WrW8rhWDsTRjR21r8t3dsrS3R",
"17uDfp5r4n441xkgLFmhNoSW1KWp6xVLD","13A3JrvXmvg5w9XGvyyR4JEJqiLz8ZySY3","16RGFo6hjq9ym6Pj7N5H7L1NR1rVPJyw2v",
"1UDHPdovvR985NrWSkdWQDEQ1xuRiTALq","15nf31J46iLuK1ZkTnqHo7WgN5cARFK3RA","1Ab4vzG6wEQBDNQM1B2bvUz4fqXXdFk2WT",
"1Fz63c775VV9fNyj25d9Xfw3YHE6sKCxbt","1QKBaU6WAeycb3DbKbLBkX7vJiaS8r42Xo","1CD91Vm97mLQvXhrnoMChhJx4TP9MaQkJo",
"15MnK2jXPqTMURX4xC3h4mAZxyCcaWWEDD","13N66gCzWWHEZBxhVxG18P8wyjEWF9Yoi1","1NevxKDYuDcCh1ZMMi6ftmWwGrZKC6j7Ux",
"19GpszRNUej5yYqxXoLnbZWKew3KdVLkXg","1M7ipcdYHey2Y5RZM34MBbpugghmjaV89P","18aNhurEAJsw6BAgtANpexk5ob1aGTwSeL",
"1FwZXt6EpRT7Fkndzv6K4b4DFoT4trbMrV","1CXvTzR6qv8wJ7eprzUKeWxyGcHwDYP1i2","1MUJSJYtGPVGkBCTqGspnxyHahpt5Te8jy",
"13Q84TNNvgcL3HJiqQPvyBb9m4hxjS3jkV","1LuUHyrQr8PKSvbcY1v1PiuGuqFjWpDumN","18192XpzzdDi2K11QVHR7td2HcPS6Qs5vg",
"1NgVmsCCJaKLzGyKLFJfVequnFW9ZvnMLN","1AoeP37TmHdFh8uN72fu9AqgtLrUwcv2wJ","1FTpAbQa4h8trvhQXjXnmNhqdiGBd1oraE",
"14JHoRAdmJg3XR4RjMDh6Wed6ft6hzbQe9","19z6waranEf8CcP8FqNgdwUe1QRxvUNKBG","14u4nA5sugaswb6SZgn5av2vuChdMnD9E5",
"174SNxfqpdMGYy5YQcfLbSTK3MRNZEePoy", "1NBC8uXJy1GiJ6drkiZa1WuKn51ps7EPTv"]
print("")
print("permut 11 15 17 (factorial)")
print("")
print("11! 39916800")
print("15! 1307674368000")
print("17! 355687428096000")
print("20! 2432902008176640000")
while True:
#count2 = 0
h2 = open("tresher.txt", "r")
for elemm2 in h2:
#count2 += 1
Nn = ([elemm2[i:i + 2] for i in range(0, len(elemm2), 2)])[:-1]
print("")
K = print(elemm2, " from file")
print("")
RRR1 = []
for RR in range(15):
DDD = random.choice(Nn)
RRR1.append(DDD)
print(Nn)
print("screening out...")
print(RRR1)
#print(RRR2)
#time.sleep(3.0)
print("loop start...")
count = 0
i=1
while i <= 1000: # step for 11 15 17
#random.seed(i) #
dD = ''.join(random.sample(RRR1,len(RRR1)))
dDD = dD[0:22]
count += 1
bbb = int(dDD)
#print(dD)
if bbb <= 6892620648693261354600-1:
#time.sleep(0.02) #cpu slowdown for many copies
a3 = list(a1+a2)
K = bbb
numberbit1 = len(a1)
numberbit0 = len(a2)
aa = find_permutation(a3,K,numberbit1,numberbit0)
ppp = aa
#print(bin(i),d2,i,int(d2,2),ppp)
random.seed(ppp)
Nn2 = "0","1" #"0","1"
RRR = []
for RR in range(160): # pz bit range
DDD = random.choice(Nn2)
RRR.append(DDD)
d = ''.join(RRR)
print(count,bbb,ppp,"<seed, bit>",d)
ii = 64
while ii <= 160:
#time.sleep(0.02) #cpu slowdown for many copies
dd = (d)[0:ii]
b = int(dd,2)
if b >= 9223372036854775807:
key = Key.from_int(b)
addr = 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(i,ppp,addr) #print(X,r1,b,addr)
ii=ii+1
i=i+1
count = 0
#RRR2=[]
print("loop end...")
time.sleep(2.0)
h2.close()
pass
random
from os import system
system("title "+__file__)
import random
from bit import Key
#from bit.format import bytes_to_wif
#from PyRandLib import *
#rand = FastRand63()
#random.seed(rand())
import gmpy2
import time
def sym1():
a1 = "0"
return a1
def sym2():
a2 = "1"
return a2
#def tiime():
# cz = time.sleep(0.02)
# return cz
def fromfile():
hu=0
hu1=random.randrange(1,10000,1)
h2 = open("tresher.txt", "r")
for elemm2 in h2:
hu +=1
if hu == hu1:
#ggg = elemm2
#print(ggg)
break
h2.close()
return elemm2
def find_permutation(lst,K,numberbit1,numberbit0):
l = lst
N = numberbit0
M = numberbit1
if N == len(l):
return sym2() * N
if M == len(l):
return sym2() * M
result = ''
for i in range (0, len(lst)-1):
K0 = gmpy2.comb(len(l)-1, M)
if (K < K0):
result += sym1()
l.remove (sym1())
else:
result += sym2()
l.remove (sym2())
M -=1
K = K - K0
result += l[0]
return result
a1=sym1()*38
a2=sym2()*38
import time
list2 = ["16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN","13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so","1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9",
"1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ","19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG","1DJh2eHFYQfACPmrvpyWc8MSTYKh7w9eRF",
"1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU","1JTK7s9YVYywfm5XUH7RNhHJH1LshCaRFR","12VVRNPi4SJqUTsp6FmqDqY5sGosDtysn4",
"1FWGcVDK3JGzCC3WtkYetULPszMaK2Jksv","1DJh2eHFYQfACPmrvpyWc8MSTYKh7w9eRF","1Bxk4CQdqL9p22JEtDfdXMsng1XacifUtE",
"15qF6X51huDjqTmF9BJgxXdt1xcj46Jmhb","1ARk8HWJMn8js8tQmGUJeQHjSE7KRkn2t8","15qsCm78whspNQFydGJQk5rexzxTQopnHZ",
"13zYrYhhJxp6Ui1VV7pqa5WDhNWM45ARAC","14MdEb4eFcT3MVG5sPFG4jGLuHJSnt1Dk2","1CMq3SvFcVEcpLMuuH8PUcNiqsK1oicG2D",
"1K3x5L6G57Y494fDqBfrojD28UJv4s5JcK","1PxH3K1Shdjb7gSEoTX7UPDZ6SH4qGPrvq","16AbnZjZZipwHMkYKBSfswGWKDmXHjEpSf",
"19QciEHbGVNY4hrhfKXmcBBCrJSBZ6TaVt","1EzVHtmbN4fs4MiNk3ppEnKKhsmXYJ4s74","1AE8NzzgKE7Yhz7BWtAcAAxiFMbPo82NB5",
"17Q7tuG2JwFFU9rXVj3uZqRtioH3mx2Jad","1K6xGMUbs6ZTXBnhw1pippqwK6wjBWtNpL","15ANYzzCp5BFHcCnVFzXqyibpzgPLWaD8b",
"18ywPwj39nGjqBrQJSzZVq2izR12MDpDr8","1CaBVPrwUxbQYYswu32w7Mj4HR4maNoJSX","1JWnE6p6UN7ZJBN7TtcbNDoRcjFtuDWoNL",
"1CKCVdbDJasYmhswB6HKZHEAnNaDpK7W4n","1PXv28YxmYMaB8zxrKeZBW8dt2HK7RkRPX","1AcAmB6jmtU6AiEcXkmiNE9TNVPsj9DULf",
"1EQJvpsmhazYCcKX5Au6AZmZKRnzarMVZu","18KsfuHuzQaBTNLASyj15hy4LuqPUo1FNB","15EJFC5ZTs9nhsdvSUeBXjLAuYq3SWaxTc",
"1HB1iKUqeffnVsvQsbpC6dNi1XKbyNuqao","1GvgAXVCbA8FBjXfWiAms4ytFeJcKsoyhL","12JzYkkN76xkwvcPT6AWKZtGX6w2LAgsJg",
"1824ZJQ7nKJ9QFTRBqn7z7dHV5EGpzUpH3","18A7NA9FTsnJxWgkoFfPAFbQzuQxpRtCos","1NeGn21dUDDeqFQ63xb2SpgUuXuBLA4WT4",
"1NLbHuJebVwUZ1XqDjsAyfTRUPwDQbemfv","1MnJ6hdhvK37VLmqcdEwqC3iFxyWH2PHUV","1KNRfGWw7Q9Rmwsc6NT5zsdvEb9M2Wkj5Z",
"1PJZPzvGX19a7twf5HyD2VvNiPdHLzm9F6","1GuBBhf61rnvRe4K8zu8vdQB3kHzwFqSy7","17s2b9ksz5y7abUm92cHwG8jEPCzK3dLnT",
"1GDSuiThEV64c166LUFC9uDcVdGjqkxKyh","1Me3ASYt5JCTAK2XaC32RMeH34PdprrfDx","1CdufMQL892A69KXgv6UNBD17ywWqYpKut",
"1BkkGsX9ZM6iwL3zbqs7HWBV7SvosR6m8N","1PXAyUB8ZoH3WD8n5zoAthYjN15yN5CVq5","1AWCLZAjKbV1P7AHvaPNCKiB7ZWVDMxFiz",
"1G6EFyBRU86sThN3SSt3GrHu1sA7w7nzi4","1MZ2L1gFrCtkkn6DnTT2e4PFUTHw9gNwaj","1Hz3uv3nNZzBVMXLGadCucgjiCs5W9vaGz",
"1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua","16zRPnT8znwq42q7XeMkZUhb1bKqgRogyy","1KrU4dHE5WrW8rhWDsTRjR21r8t3dsrS3R",
"17uDfp5r4n441xkgLFmhNoSW1KWp6xVLD","13A3JrvXmvg5w9XGvyyR4JEJqiLz8ZySY3","16RGFo6hjq9ym6Pj7N5H7L1NR1rVPJyw2v",
"1UDHPdovvR985NrWSkdWQDEQ1xuRiTALq","15nf31J46iLuK1ZkTnqHo7WgN5cARFK3RA","1Ab4vzG6wEQBDNQM1B2bvUz4fqXXdFk2WT",
"1Fz63c775VV9fNyj25d9Xfw3YHE6sKCxbt","1QKBaU6WAeycb3DbKbLBkX7vJiaS8r42Xo","1CD91Vm97mLQvXhrnoMChhJx4TP9MaQkJo",
"15MnK2jXPqTMURX4xC3h4mAZxyCcaWWEDD","13N66gCzWWHEZBxhVxG18P8wyjEWF9Yoi1","1NevxKDYuDcCh1ZMMi6ftmWwGrZKC6j7Ux",
"19GpszRNUej5yYqxXoLnbZWKew3KdVLkXg","1M7ipcdYHey2Y5RZM34MBbpugghmjaV89P","18aNhurEAJsw6BAgtANpexk5ob1aGTwSeL",
"1FwZXt6EpRT7Fkndzv6K4b4DFoT4trbMrV","1CXvTzR6qv8wJ7eprzUKeWxyGcHwDYP1i2","1MUJSJYtGPVGkBCTqGspnxyHahpt5Te8jy",
"13Q84TNNvgcL3HJiqQPvyBb9m4hxjS3jkV","1LuUHyrQr8PKSvbcY1v1PiuGuqFjWpDumN","18192XpzzdDi2K11QVHR7td2HcPS6Qs5vg",
"1NgVmsCCJaKLzGyKLFJfVequnFW9ZvnMLN","1AoeP37TmHdFh8uN72fu9AqgtLrUwcv2wJ","1FTpAbQa4h8trvhQXjXnmNhqdiGBd1oraE",
"14JHoRAdmJg3XR4RjMDh6Wed6ft6hzbQe9","19z6waranEf8CcP8FqNgdwUe1QRxvUNKBG","14u4nA5sugaswb6SZgn5av2vuChdMnD9E5",
"174SNxfqpdMGYy5YQcfLbSTK3MRNZEePoy", "1NBC8uXJy1GiJ6drkiZa1WuKn51ps7EPTv"]
print("")
print("permut 11 15 17 (factorial)")
print("")
print("11! 39916800")
print("15! 1307674368000")
print("17! 355687428096000")
print("20! 2432902008176640000")
while True:
#count2 = 0
#h2 = open("tresher.txt", "r")
#for elemm2 in h2:
#count2 += 1
elemm2 = fromfile()
Nn = ([elemm2[i:i + 2] for i in range(0, len(elemm2), 2)])[:-1]
print("")
K = print(elemm2, " from file")
print("")
RRR1 = []
for RR in range(15):
DDD = random.choice(Nn)
RRR1.append(DDD)
print(Nn)
print("screening out...")
print(RRR1)
#print(RRR2)
#time.sleep(3.0)
print("loop start...")
count = 0
i=1
while i <= 50000000: # permut step factorial 11 15 17
#random.seed(i) # seed init?
dD = ''.join(random.sample(RRR1,len(RRR1)))
dDD = dD[0:22]
count += 1
bbb = int(dDD)
#print(dD)
if bbb <= 6892620648693261354600-1:
a3 = list(a1+a2)
K = bbb
numberbit1 = len(a1)
numberbit0 = len(a2)
aa = find_permutation(a3,K,numberbit1,numberbit0)
ppp = aa
#print(bin(i),d2,i,int(d2,2),ppp)
random.seed(ppp)
Nn2 = "0","1" #"0","1"
RRR = []
for RR in range(160): # pz bit range
DDD = random.choice(Nn2)
RRR.append(DDD)
d = ''.join(RRR)
print(count,bbb,ppp,"<seed, bit>",d)
ii = 64
while ii <= 160:
dd = (d)[0:ii]
b = int(dd,2)
if b >= 9223372036854775807:
key = Key.from_int(b)
addr = 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(i,ppp,addr) #print(X,r1,b,addr)
ii=ii+1
i=i+1
count = 0
#RRR2=[]
print("loop end...")
time.sleep(2.0)
break
4) write many different seed scripts, python dont use "re"
import time
GGG = ['ba', 'ca', 'da', 'ea', 'fa', 'ga', 'ha', 'ia', 'ja', 'ka', 'la', 'ma', 'na', 'oa', 'pa', 'qa', 'ra', 'sa', 'ta', 'ua', 'va', 'wa', 'xa', 'ya', 'za', 'Aa', 'Ba', 'Ca', 'Da',
'Ea', 'Fa', 'Za', 'cb', 'db', 'eb', 'fb', 'gb', 'hb', 'ib', 'jb', 'kb', 'lb', 'mb', 'nb', 'ob', 'pb', 'qb', 'rb', 'sb', 'tb', 'ub', 'vb', 'wb', 'xb', 'yb', 'zb', 'Ab', 'Bb',
'Cb', 'Db', 'Eb', 'Fb', 'Zb', 'dc', 'ec', 'fc', 'gc', 'hc', 'ic', 'jc', 'kc', 'lc', 'mc', 'nc', 'oc', 'pc', 'qc', 'rc', 'sc', 'tc', 'uc', 'vc', 'wc', 'xc', 'yc', 'zc', 'Ac',
'Bc', 'Cc', 'Dc', 'Ec', 'Fc', 'Zc', 'ed', 'fd', 'gd', 'hd', 'id', 'jd', 'kd', 'ld', 'md', 'nd', 'od', 'pd', 'qd', 'rd', 'sd', 'td', 'ud', 'vd', 'wd', 'xd', 'yd', 'zd', 'Ad',
'Bd', 'Cd', 'Dd', 'Ed', 'Fd', 'Zd', 'fe', 'ge', 'he', 'ie', 'je', 'ke', 'le', 'me', 'ne', 'oe', 'pe', 'qe', 're', 'se', 'te', 'ue', 've', 'we', 'xe', 'ye', 'ze', 'Ae', 'Be',
'Ce', 'De', 'Ee', 'Fe', 'Ze', 'gf', 'hf', 'if', 'jf', 'kf', 'lf', 'mf', 'nf', 'of', 'pf', 'qf', 'rf', 'sf', 'tf', 'uf', 'vf', 'wf', 'xf', 'yf', 'zf', 'Af', 'Bf', 'Cf', 'Df',
'Ef', 'Ff', 'Zf', 'hg', 'ig', 'jg', 'kg', 'lg', 'mg', 'ng', 'og', 'pg', 'qg', 'rg', 'sg', 'tg', 'ug', 'vg', 'wg', 'xg', 'yg', 'zg', 'Ag', 'Bg', 'Cg', 'Dg', 'Eg', 'Fg', 'Zg',
'ih', 'jh', 'kh', 'lh', 'mh', 'nh', 'oh', 'ph', 'qh', 'rh', 'sh', 'th', 'uh', 'vh', 'wh', 'xh', 'yh', 'zh', 'Ah', 'Bh', 'Ch', 'Dh', 'Eh', 'Fh', 'Zh', 'ji', 'ki', 'li', 'mi',
'ni', 'oi', 'pi', 'qi', 'ri', 'si', 'ti', 'ui', 'vi', 'wi', 'xi', 'yi', 'zi', 'Ai', 'Bi', 'Ci', 'Di', 'Ei', 'Fi', 'Zi', 'kj', 'lj', 'mj', 'nj', 'oj', 'pj', 'qj', 'rj', 'sj',
'tj', 'uj', 'vj', 'wj', 'xj', 'yj', 'zj', 'Aj', 'Bj', 'Cj', 'Dj', 'Ej', 'Fj', 'Zj', 'lk', 'mk', 'nk', 'ok', 'pk', 'qk', 'rk', 'sk', 'tk', 'uk', 'vk', 'wk', 'xk', 'yk', 'zk',
'Ak', 'Bk', 'Ck', 'Dk', 'Ek', 'Fk', 'Zk', 'ml', 'nl', 'ol', 'pl', 'ql', 'rl', 'sl', 'tl', 'ul', 'vl', 'wl', 'xl', 'yl', 'zl', 'Al', 'Bl', 'Cl', 'Dl', 'El', 'Fl', 'Zl', 'nm',
'om', 'pm', 'qm', 'rm', 'sm', 'tm', 'um', 'vm', 'wm', 'xm', 'ym', 'zm', 'Am', 'Bm', 'Cm', 'Dm', 'Em', 'Fm', 'Zm', 'on', 'pn', 'qn', 'rn', 'sn', 'tn', 'un', 'vn', 'wn', 'xn',
'yn', 'zn', 'An', 'Bn', 'Cn', 'Dn', 'En', 'Fn', 'Zn', 'po', 'qo', 'ro', 'so', 'to', 'uo', 'vo', 'wo', 'xo', 'yo', 'zo', 'Ao', 'Bo', 'Co', 'Do', 'Eo', 'Fo', 'Zo', 'qp', 'rp',
'sp', 'tp', 'up', 'vp', 'wp', 'xp', 'yp', 'zp', 'Ap', 'Bp', 'Cp', 'Dp', 'Ep', 'Fp', 'Zp', 'rq', 'sq', 'tq', 'uq', 'vq', 'wq', 'xq', 'yq', 'zq', 'Aq', 'Bq', 'Cq', 'Dq', 'Eq',
'Fq', 'Zq', 'sr', 'tr', 'ur', 'vr', 'wr', 'xr', 'yr', 'zr', 'Ar', 'Br', 'Cr', 'Dr', 'Er', 'Fr', 'Zr', 'ts', 'us', 'vs', 'ws', 'xs', 'ys', 'zs', 'As', 'Bs', 'Cs', 'Ds', 'Es',
'Fs', 'Zs', 'ut', 'vt', 'wt', 'xt', 'yt', 'zt', 'At', 'Bt', 'Ct', 'Dt', 'Et', 'Ft', 'Zt', 'vu', 'wu', 'xu', 'yu', 'zu', 'Au', 'Bu', 'Cu', 'Du', 'Eu', 'Fu', 'Zu', 'wv', 'xv',
'yv', 'zv', 'Av', 'Bv', 'Cv', 'Dv', 'Ev', 'Fv', 'Zv', 'xw', 'yw', 'zw', 'Aw', 'Bw', 'Cw', 'Dw', 'Ew', 'Fw', 'Zw', 'yx', 'zx', 'Ax', 'Bx', 'Cx', 'Dx', 'Ex', 'Fx', 'Zx', 'zy',
'Ay', 'By', 'Cy', 'Dy', 'Ey', 'Fy', 'Zy', 'Az', 'Bz', 'Cz', 'Dz', 'Ez', 'Fz', 'Zz', 'BA', 'CA', 'DA', 'EA', 'FA', 'ZA', 'CB', 'DB', 'EB', 'FB', 'ZB', 'DC', 'EC', 'FC', 'ZC',
'ED', 'FD', 'ZD', 'FE', 'ZE', 'ZF']
for elem in GGG[0:500]: # python dont use "re"
#time.sleep(0.1)
if elem != "re":
ccc = elem
f = open("blablabla.txt")
#f.readline()
f2= open(str(ccc+".py"), "w+")
for l in f:
if " a1 = " in l:
vvv = """ " """+str(ccc[0])+""" " """
vvv2 = str(vvv)
Ggg = vvv2.replace(' ', '')
#print(Ggg)
f2.writelines(" a1 =" + Ggg)
continue
if " a2 = " in l:
vvv = """ " """+str(ccc[1])+""" " """
vvv2 = str(vvv)
Ggg = vvv2.replace(' ', '')
#print(Ggg)
f2.writelines(" a2 =" + Ggg)
continue
else:
f2.writelines(l)
f.close()
f2.close()
5) create cmd to run all scripts
import time
from os import system
system("title "+__file__)
import os
mmm = os.path.dirname(__file__)
mmm1 = str(mmm)#[:6]
print(mmm1)
FFF = []
for root, dirs, files in os.walk("."):
print(root, dirs, files)
for filename in files:
if filename[2:5] == ".py":
FFF.append(filename)
#print(filename)
f2= open("run.cmd", "w+")
f2.writelines("@echo off"+ '\n')
vvv = """ " """+mmm1+""" " """
vvv2 = str(vvv)
Ggg = vvv2.replace(' ', '')
Ggg2 = "cd "+Ggg
f2.writelines(Ggg2+ '\n')
for F in FFF:
f2.writelines("start /min "+str(F)+ '\n')
f2.writelines("exit"+ '\n')
f2.close()
everything should be in the 1st folder
