Bitcoin puzzle transaction ~32 BTC prize to who solves it

[WanderingPhilospher]

want to secure your coin or what to learn about bitcoin mining. contact me

No, but could you tell us the exact location of puzzle #s 64 through say 119?

[1680436464]

1680436464

[1680436464]

1680436464

[fxsniper]

problem of puzzle address that not have public key. key it is still standalone. blockchain still connect to only that key can coming to get funds withdraw out.

one public key still make bitcoin like clean data not have mush to reference


on reason puzzle #64 still search because still on low bits level.

I think all other puzzle 9 address that have public key bay be easy to scan

I try puzzle #64 and #120

but for now all public key still on high bits level may be need to use method like bitcoin

brute force die when using on full 256 bits keys

kangaroo still good one but on high bits need to have some algorithm help to sharp focus target and hits straight

anyone can develop bitcrack mix with kangaroo strategy to hit puzzle #64

public key may be need formula like bitcoin vulnerability  to help calculate

use pure brute force only still long time used

[Andzhig]

Well, or so look...

import time

a1= [(0, 3), (3, 0), (1, 2), (2, 1)]
a2= [(0, 11), (11, 0), (1, 10), (2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2), (10, 1)]
a3= [(0, 11), (11, 0), (1, 10), (2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2), (10, 1)]
a4= [(0, 14), (14, 0), (1, 13), (2, 12), (3, 11), (4, 10), (5, 9), (6, , (7, 7), (8, 6), (9, 5), (10, 4), (11, 3), (12, 2), (13, 1)]
a5= [(0, 4), (4, 0), (1, 3), (2, 2), (3, 1)]
a6= [(0, 2), (2, 0), (1, 1)]
a7= [(0, 10), (10, 0), (1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a8= [(0, 2), (2, 0), (1, 1)]
a9= [(0, 10), (10, 0), (1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a10=[(0, 10), (10, 0), (1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]

count = 0

for b1 in a1:
    for b2 in a2:
        for b3 in a3:
            for b4 in a4:
                for b5 in a5:
                    for b6 in a6:
                        for b7 in a7:
                            for b8 in a8:
                                for b9 in a9:
                                    for b10 in a10:
                                        count += 1
                                        d = b1+b2+b3+b4+b5+b6+b7+b8+b9+b10
                                        print(d) #517492800
    

print(count)
time.sleep(260.0)

[/size]

2×8×4×4×5×3×13×15×11×2       16473600      1135041350219496382
5×7×15×12×6×7×14×9×17×2     1133546400  1425787542618654982
12×8×10×7×6×5×15×4×6×2       145152000    3908372542507822062
17×12×4×18×13×7×8×15×13×8  16680867840 8993229949524469768
4×12×12×15×5×3×11×3×11×11  517492800    30568377312064202855 (3×11×11×14×4×2×10×2×10×10)

for pz 30568377312064202855 517 million 492,800...

all possible 18x18x18x18x18x18x18x18x18x18 = 3570467226624 steps.

roughly pz 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN between 9223372036854775807 18446744073709551615

previous less 9223372036854775807 pz 8993229949524469768
which is higher 36893488147419103231 pz 30568377312064202855

then it should start with [(1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7)]

9223372036854775807

10...
11...
12...
13...
14...
15...
16...
17...

18446744073709551615

import random
from bit import Key
import time

list = ["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","18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe"]





def func():

    gennum1 = random.randint(0,18)
    gennum = gennum1
    print(gennum)
    number = int(gennum)
    
    lst = []
    tmp = (0, number)
    lst.append(tmp)
    tmp = (number, 0)
    lst.append(tmp)

    for j in range(number):
        for i in range(number):
            
            
            if j + i  == number:
                tmp = (j, i)
                if tmp not in lst:
                    lst.append(tmp)
                    #print(*tmp)
    return lst

a1= [(1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7)]
a2= func()
a3= func()
a4= func()
a5= func()
a6= func()
a7= func()
a8= func()
a9= func()
a10=func()

print(a1)
print(a2)
print(a3)
print(a4)
print(a5)
print(a6)
print(a7)
print(a8)
print(a9)
print(a10)

time.sleep(3.0)
count = 0

for b1 in a1:
    for b2 in a2:
        for b3 in a3:
            for b4 in a4:
                for b5 in a5:
                    for b6 in a6:
                        for b7 in a7:
                            for b8 in a8:
                                for b9 in a9:
                                    for b10 in a10:
                                        
                                        count += 1
                                        
                                        d = b1+b2+b3+b4+b5+b6+b7+b8+b9+b10
                                        
                                        dd = ''.join(str(v) for v in d)
                                        
                                        ran = int(dd)
                                        key1 = Key.from_int(ran)
                                        addr1 = key1.address
                                                                    
                                        if addr1 in list:

                                            print (ran,"found!!!")

                                            s5 = str(ran)
                                            f=open(u"C:/a.txt","a")
                                            f.write(s5 + '\n')
                                            f.close()

                                            break

                                        else:
                                                                            
                                            #pass
                                            print(count,ran,addr1,d,len(dd))
                                        

[/size]

***

for pz 120 kangooru can do this

664613997892457936451903530140172287-1329227995784915872903807060280344575

1329227995784915872903807060280344575

[['1', '3'], ['2', '9'], ['2', '2'], ['7', '9'], ['9', '5'], ['7', '8'], ['4', '9'], ['1', '5'], ['8', '7'], ['2', '9'], ['0', '3'], ['8', '0'], ['7', '0'], ['6', '0'], ['2', '8'], ['0', '3'], ['4', '4'], ['5', '7'], ['5']]
[4, 11, 4, 16, 14, 15, 13, 6, 15, 11, 3, 8, 7, 6, 10, 3, 8, 12, 5]
[15, 20, 29, 19, 26, 11, 13, 13, 20, 5]
35 48 26
83 26
109

[4, 11, 4, 16, 14, 15, 13, 6, 15, 11, 3, 8, 7, 6, 10, 3, 8, 12, 5]  x19 by 18

all possible 708235345355337676357632 steps.

708235345355337676357632 / 2 = 354117672677668838178816

354117672677668838178816 × 3753633603581 = 1329227995784795106519698655335940096
354117672677668838178816 × 3753633603581 = 1329227995784440988847020986497761280
354117672677668838178816 × 3753633603579 = 1329227995784086871174343317659582464
354117672677668838178816 × 3753633603578 = 1329227995783732753501665648821403648

kangaroo jumping   from 3753633603581 to ~3003633603581 if performance allows there should be a chance.

[dextronomous]

https://bitcointalk.org/index.php?topic=5218972.msg53649852#msg53649852
no sir not quite yet,

[Dobrodav]

  so this puzzle still not solve yet??? I wish I learn good math at school so I have more chance to solve this. I will try but it's no promise.

[dextronomous]

hi there andzhig,

could you make it so it searches the address starting with 16 only or show and search only the 64th range with the same way
you already beautifully described and explained thanks a lot sir.

[bigvito19]

hi there andzhig,

could you make it so it searches the address starting with 16 only or show and search only the 64th range with the same way
you already beautifully described and explained thanks a lot sir.

Maybe with vanitygen.

[Andzhig]

hi there andzhig,

could you make it so it searches the address starting with 16 only or show and search only the 64th range with the same way
you already beautifully described and explained thanks a lot sir.

16 in the sense of a number or name of an address...

to make the number start

a1= [(1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7)]

a1= [(1, 6)]

all the first similarly (9, 2), (9, 3), (9, 4), (9, 5)...

especially since we do not need more than (9, 9) in sets (11, 1), (14, 0) etc...

a1= [(0, 3), (3, 0), (1, 2), (2, 1)]
a2= [(0, 11), (11, 0), (1, 10), (2, 9), (3, Cool, (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2), (10, 1)]
a3= [(0, 11), (11, 0), (1, 10), (2, 9), (3, Cool, (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2), (10, 1)]
a4= [(0, 14), (14, 0), (1, 13), (2, 12), (3, 11), (4, 10), (5, 9), (6, Cool, (7, 7), (8, 6), (9, 5), (10, 4), (11, 3), (12, 2), (13, 1)]
a5= [(0, 4), (4, 0), (1, 3), (2, 2), (3, 1)]
a6= [(0, 2), (2, 0), (1, 1)]
a7= [(0, 10), (10, 0), (1, 9), (2, Cool, (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a8= [(0, 2), (2, 0), (1, 1)]
a9= [(0, 10), (10, 0), (1, 9), (2, Cool, (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a10=[(0, 10), (10, 0), (1, 9), (2, Cool, (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]

-

a1= [(0, 3), (3, 0), (1, 2), (2, 1)]
a2= [(2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2)]
a3= [(2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2)]
a4= [(5, 9), (6, , (7, 7), (8, 6), (9, 5)]
a5= [(0, 4), (4, 0), (1, 3), (2, 2), (3, 1)]
a6= [(0, 2), (2, 0), (1, 1)]
a7= [(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a8= [(0, 2), (2, 0), (1, 1)]
a9= [(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a10=[(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]

instead of all brute force after discarding, 41990400 whole run, finding at 15513701 steps.

import time

a1= [(0, 3), (3, 0), (1, 2), (2, 1)]
a2= [(2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2)]
a3= [(2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2)]
a4= [(5, 9), (6, , (7, 7), (8, 6), (9, 5)]
a5= [(0, 4), (4, 0), (1, 3), (2, 2), (3, 1)]
a6= [(0, 2), (2, 0), (1, 1)]
a7= [(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a8= [(0, 2), (2, 0), (1, 1)]
a9= [(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a10=[(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]

count = 0

for b1 in a1:
    for b2 in a2:
        for b3 in a3:
            for b4 in a4:
                for b5 in a5:
                    for b6 in a6:
                        for b7 in a7:
                            for b8 in a8:
                                for b9 in a9:
                                    for b10 in a10:
                                        count += 1
                                        d = b1+b2+b3+b4+b5+b6+b7+b8+b9+b10
                                        
                                        
                                        
                                        if d == (3, 0, 5, 6, 8, 3, 7, 7, 3, 1, 2, 0, 6, 4, 2, 0, 2, 8, 5, 5):
                                            print(d)
                                            print(count)

print(count)
time.sleep(260.0)

in any case, even discarding unnecessary (not need more than (9, 9) in sets (11, 1), (14, 0) etc...)

18×18×18×18×18×18×18×18×18×18 = 3570467226624 / 2 = 1785233613312 fixed combinations in which only 3 to 4 may be needed. again a performance question. If could it run 10-50 million at least in a second

1×18×18×18×18×18×18×18×18×18 1 sec
2×18×18×18×18×18×18×18×18×18 2 sec
3×18×18×18×18×18×18×18×18×18 3 sec
4×18×18×18×18×18×18×18×18×18 4 sec
18×18×18×18×18×18×18×18×18×1 blablabla sec
18×18×18×18×18×18×18×18×18×2 blablabla sec
18×18×18×18×18×1×18×18×18×18 blablabla sec
18×18×18×18×18×2×18×18×18×18 blablabla sec
...

try it on gpu (who can write the code) .

import random
from bit import Key
import time
import itertools

list = ["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","18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe"]



def funcc(u):
    number = int(u)
    
    lst = []
    tmp = sorted((0, number))
    lst.append(tmp)

    for j in range(number):
        for i in range(number):
            
            
            if j + i  == number:
                tmp = (j, i)
                if tmp not in lst:
                    lst.append(tmp)
                    #print(*tmp)

    tmp = sorted((number, 0))
    lst.append(tmp)
    return lst

def func():
    
    
    gennum1 = random.randint(0,18)
    gennum = gennum1
    print(gennum,funcc(gennum))
    number = int(gennum)
    
    lst = []
    tmp = (0, number)
    if tmp[0] <=9:
        if tmp[1] <=9:
            lst.append(tmp)

    for j in range(number):
        for i in range(number):
            
            if j + i  == number:
                tmp = (j, i)
                if tmp[0] <=9:
                    if tmp[1] <=9:
                        if tmp not in lst:
                            lst.append(tmp)
                            #print(*tmp)
    tmp = (number, 0)
    if tmp[0] <=9:
        if tmp[1] <=9:
            lst.append(tmp)
    
    return lst

print("18×18×18×18×18×18×18×18×18×18 = 3570467226624")
print(" ")

a1= [(1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7)]
a2= func()
a3= func()
a4= func()
a5= func()
a6= func()
a7= func()
a8= func()
a9= func()
a10=func()

print(" ")
print("***")
print("cut off set (18, 0), (0, 18), (17, 1), (1, 17)... = 1785233613312")
print(" ")

print(a1)
print(a2)
print(a3)
print(a4)
print(a5)
print(a6)
print(a7)
print(a8)
print(a9)
print(a10)

print(" ")
print("***")

time.sleep(3.0)
count = 0

for x in itertools.product(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10):
    count += 1

    d = ("".join(map(str, (item for sublist in x for item in sublist))))
    if len(d) <= 50:
        ran = int(d)
        key1 = Key.from_int(ran)
        addr1 = key1.address
                                                                            
        if addr1 in list:

            print (ran,"found!!!")

            s5 = str(ran)
            f=open(u"C:/a.txt","a")
            f.write(s5 + '\n')
            f.close()

            break

        else:
                                                                                    
            #pass
            print(count,ran,len(d),addr1)

[/size]

***

don’t understand how to count, we removed unnecessary and we get options 10×10×10×10×10×10×10×10×10×10 =  10000000000 possible, among which there are 400000000 (exl 8 8 6 8 10 9 7 7 3 10 = 406425600) and several thousand (8 1 3 1 3 2 3 2 7 10 = 60480)

transformation


18×18×18×18×18×18×18×18×18×18                                                   10×10×10×10×10×10×10×10×10×10

2×8×4×4×5×3×13×15×11×2        16473600      1135041350219496382    3×9×5×5×6×4×6×4×8×3     9331200
5×7×15×12×6×7×14×9×17×2      1133546400   1425787542618654982     6×8×4×7×7×8×5×10×2×3  22579200
12×8×10×7×6×5×15×4×6×2        145152000     3908372542507822062    7×9×9×8×7×6×4×5×7×3    80015040
17×12×4×18×13×7×8×15×13×8   16680867840  8993229949524469768    2×7×5×1×6×8×9×4×6×9    6531840

what can factorization give to produce exactly such in the set 3×9×5×5×6×4×6×4×8×3     9331200

how will it look to

9331201
9331202
9331203
...

[Dobrodav]

Does anyone have GitHub share code brute-forced or something relating to this puzzle?

[WanderingPhilospher]

Does anyone have GitHub share code brute-forced or something relating to this puzzle?

This program found the last 2 keys, #110 and #115

https://github.com/JeanLucPons/Kangaroo

This is one many people use to brute force for #64

https://github.com/brichard19/BitCrack

[Dobrodav]

Thanks. I will try to config and use Kangaroo. start with 8000000000000000 (edited). 0.64 bitcoin. not bad to give it a try. lol

[WanderingPhilospher]

Thanks. I will try to config and use Kangaroo. start with 8000000000000000 (edited). 0.64 bitcoin. not bad to give it a try. lol

You can't use Kangaroo for #64; in order to use Kangaroo you must know the public key; kangaroo only good for puzzles in multiples of 5 where the public keys have been exposed, 120, 125, 130, 135, etc.

For #64, you will have to use a brute force attack using something like BitCrack.

[Dobrodav]

Thanks. I will try to config and use Kangaroo. start with 8000000000000000 (edited). 0.64 bitcoin. not bad to give it a try. lol

You can't use Kangaroo for #64; in order to use Kangaroo you must know the public key; kangaroo only good for puzzles in multiples of 5 where the public keys have been exposed, 120, 125, 130, 135, etc.

For #64, you will have to use a brute force attack using something like BitCrack.

Aw. I try Bitcrack but it not complicated with my card AMD. Keep crashing. so bad.

[WanderingPhilospher]

Thanks. I will try to config and use Kangaroo. start with 8000000000000000 (edited). 0.64 bitcoin. not bad to give it a try. lol

You can't use Kangaroo for #64; in order to use Kangaroo you must know the public key; kangaroo only good for puzzles in multiples of 5 where the public keys have been exposed, 120, 125, 130, 135, etc.

For #64, you will have to use a brute force attack using something like BitCrack.

Aw. I try Bitcrack but it not complicated with my card AMD. Keep crashing. so bad.

Yes, there are none issues...if you have an AMD card you must use the clBitcrack not the cuBitcrack, but do not use the newest version, use the version that is one back from newest. Version 30 I believe.

[nioctib.co]

hi there andzhig,

could you make it so it searches the address starting with 16 only or show and search only the 64th range with the same way
you already beautifully described and explained thanks a lot sir.

16 in the sense of a number or name of an address...

to make the number start

a1= [(1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7)]

a1= [(1, 6)]

all the first similarly (9, 2), (9, 3), (9, 4), (9, 5)...

especially since we do not need more than (9, 9) in sets (11, 1), (14, 0) etc...

a1= [(0, 3), (3, 0), (1, 2), (2, 1)]
a2= [(0, 11), (11, 0), (1, 10), (2, 9), (3, Cool, (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2), (10, 1)]
a3= [(0, 11), (11, 0), (1, 10), (2, 9), (3, Cool, (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2), (10, 1)]
a4= [(0, 14), (14, 0), (1, 13), (2, 12), (3, 11), (4, 10), (5, 9), (6, Cool, (7, 7), (8, 6), (9, 5), (10, 4), (11, 3), (12, 2), (13, 1)]
a5= [(0, 4), (4, 0), (1, 3), (2, 2), (3, 1)]
a6= [(0, 2), (2, 0), (1, 1)]
a7= [(0, 10), (10, 0), (1, 9), (2, Cool, (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a8= [(0, 2), (2, 0), (1, 1)]
a9= [(0, 10), (10, 0), (1, 9), (2, Cool, (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a10=[(0, 10), (10, 0), (1, 9), (2, Cool, (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]

-

a1= [(0, 3), (3, 0), (1, 2), (2, 1)]
a2= [(2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2)]
a3= [(2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2)]
a4= [(5, 9), (6, , (7, 7), (8, 6), (9, 5)]
a5= [(0, 4), (4, 0), (1, 3), (2, 2), (3, 1)]
a6= [(0, 2), (2, 0), (1, 1)]
a7= [(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a8= [(0, 2), (2, 0), (1, 1)]
a9= [(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a10=[(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]

instead of all brute force after discarding, 41990400 whole run, finding at 15513701 steps.

import time

a1= [(0, 3), (3, 0), (1, 2), (2, 1)]
a2= [(2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2)]
a3= [(2, 9), (3, , (4, 7), (5, 6), (6, 5), (7, 4), (8, 3), (9, 2)]
a4= [(5, 9), (6, , (7, 7), (8, 6), (9, 5)]
a5= [(0, 4), (4, 0), (1, 3), (2, 2), (3, 1)]
a6= [(0, 2), (2, 0), (1, 1)]
a7= [(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a8= [(0, 2), (2, 0), (1, 1)]
a9= [(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]
a10=[(1, 9), (2, , (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)]

count = 0

for b1 in a1:
    for b2 in a2:
        for b3 in a3:
            for b4 in a4:
                for b5 in a5:
                    for b6 in a6:
                        for b7 in a7:
                            for b8 in a8:
                                for b9 in a9:
                                    for b10 in a10:
                                        count += 1
                                        d = b1+b2+b3+b4+b5+b6+b7+b8+b9+b10
                                        
                                        
                                        
                                        if d == (3, 0, 5, 6, 8, 3, 7, 7, 3, 1, 2, 0, 6, 4, 2, 0, 2, 8, 5, 5):
                                            print(d)
                                            print(count)

print(count)
time.sleep(260.0)

in any case, even discarding unnecessary (not need more than (9, 9) in sets (11, 1), (14, 0) etc...)

18×18×18×18×18×18×18×18×18×18 = 3570467226624 / 2 = 1785233613312 fixed combinations in which only 3 to 4 may be needed. again a performance question. If could it run 10-50 million at least in a second

1×18×18×18×18×18×18×18×18×18 1 sec
2×18×18×18×18×18×18×18×18×18 2 sec
3×18×18×18×18×18×18×18×18×18 3 sec
4×18×18×18×18×18×18×18×18×18 4 sec
18×18×18×18×18×18×18×18×18×1 blablabla sec
18×18×18×18×18×18×18×18×18×2 blablabla sec
18×18×18×18×18×1×18×18×18×18 blablabla sec
18×18×18×18×18×2×18×18×18×18 blablabla sec
...

try it on gpu (who can write the code) .

import random
from bit import Key
import time
import itertools

list = ["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","18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe"]



def funcc(u):
    number = int(u)
    
    lst = []
    tmp = sorted((0, number))
    lst.append(tmp)

    for j in range(number):
        for i in range(number):
            
            
            if j + i  == number:
                tmp = (j, i)
                if tmp not in lst:
                    lst.append(tmp)
                    #print(*tmp)

    tmp = sorted((number, 0))
    lst.append(tmp)
    return lst

def func():
    
    
    gennum1 = random.randint(0,18)
    gennum = gennum1
    print(gennum,funcc(gennum))
    number = int(gennum)
    
    lst = []
    tmp = (0, number)
    if tmp[0] <=9:
        if tmp[1] <=9:
            lst.append(tmp)

    for j in range(number):
        for i in range(number):
            
            if j + i  == number:
                tmp = (j, i)
                if tmp[0] <=9:
                    if tmp[1] <=9:
                        if tmp not in lst:
                            lst.append(tmp)
                            #print(*tmp)
    tmp = (number, 0)
    if tmp[0] <=9:
        if tmp[1] <=9:
            lst.append(tmp)
    
    return lst

print("18×18×18×18×18×18×18×18×18×18 = 3570467226624")
print(" ")

a1= [(1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7)]
a2= func()
a3= func()
a4= func()
a5= func()
a6= func()
a7= func()
a8= func()
a9= func()
a10=func()

print(" ")
print("***")
print("cut off set (18, 0), (0, 18), (17, 1), (1, 17)... = 1785233613312")
print(" ")

print(a1)
print(a2)
print(a3)
print(a4)
print(a5)
print(a6)
print(a7)
print(a8)
print(a9)
print(a10)

print(" ")
print("***")

time.sleep(3.0)
count = 0

for x in itertools.product(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10):
    count += 1

    d = ("".join(map(str, (item for sublist in x for item in sublist))))
    if len(d) <= 50:
        ran = int(d)
        key1 = Key.from_int(ran)
        addr1 = key1.address
                                                                            
        if addr1 in list:

            print (ran,"found!!!")

            s5 = str(ran)
            f=open(u"C:/a.txt","a")
            f.write(s5 + '\n')
            f.close()

            break

        else:
                                                                                    
            #pass
            print(count,ran,len(d),addr1)

[/size]

I think you don't need to rewrite the Python code if you want to run it on GPU. You need the help with TensorFlow, Keras, or Anaconda to run Python with GPU.

[fxsniper]

I think you don't need to rewrite the Python code if you want to run it on GPU. You need the help with TensorFlow, Keras, or Anaconda to run Python with GPU.

I think Normal python can not run on GPU  and tensorflow and keras it use specific for AI. deep learning

Normal python code work with CPU only it generate slowly and use time a lot

Try code on NumPy arrays and use Numba for work on GPU

or Try write code to OpenCL calculate for can work with any GPU

but all option can use GPU need to write code all new one.

https://www.geeksforgeeks.org/running-python-script-on-gpu/
https://stackoverflow.com/questions/53650577/how-to-run-python-code-with-support-of-gpu

[nioctib.co]

I think you don't need to rewrite the Python code if you want to run it on GPU. You need the help with TensorFlow, Keras, or Anaconda to run Python with GPU.

I think Normal python can not run on GPU  and tensorflow and keras it use specific for AI. deep learning

Normal python code work with CPU only it generate slowly and use time a lot

Try code on NumPy arrays and use Numba for work on GPU

or Try write code to OpenCL calculate for can work with any GPU

but all option can use GPU need to write code all new one.

https://www.geeksforgeeks.org/running-python-script-on-gpu/
https://stackoverflow.com/questions/53650577/how-to-run-python-code-with-support-of-gpu

Not a pro programmer. Figuring how to use Numba and @cuda.jit to calculate without needing extensive new code.

[olegniko]

What was the intent of the creator of this puzzle?

[Joe_Bauers]

What was the intent of the creator of this puzzle?

Likely for someone to attempt to solve an equation, rather than brute-force it   

[Andzhig]

What was the intent of the creator of this puzzle?

As far as I remember, the author wanted to check the security (how safe is bitcoin), And a few years ago, the author "opened" the public keys for testing the kangaroo. It is possible that the authors are https://en.wikipedia.org/wiki/National_Security_Agency  

***

As I understand it, gpu does not speed up the program code itself, but allows you to run more programs due to more processors. Therefore, the weak link is directly converting a digit to an address and its comparison. Can generate numbers in trillions without gpu.

can find several options for gpu mining and try to adapt the code from there (if it possible) https://pypi.org/project/apoclypsebm/ https://github.com/bkerler/opencl_brute https://github.com/m0mchil/poclbm https://github.com/bismuthfoundation/Bismuth-GPU-miner Apparently, these gpu miners generate sha256 hashing (nonce) similar to asics and there is no sense from them... And what other options are there, parallelization, but it doesn't seem to speed up (gil)... optimize the python bitcoin libraries using the method where possible numba will process the path... and how to distribute from one number generator to several address handlers and reconciliations on several threads, or just scatter several copies to several processes (and what's the difference if you just run several copies of the program)...

***

continuation ... discard unnecessary?
                                                                                                                                            steps
4×10×9×12×17×1×12×10×11     96940800       138245758910846492    5×9×10×7×2×2×7×9×8     6350400  
10×18×13×12×16×13×7×2×13   1062996480    199976667976342049    9×1×6×7×3×6×8×3×6       979776
7×5×7×11×6×13×8×7×10          117717600     525070384258266191    8×6×8×8×7×6×9×8×9       83607552  
2×8×4×4×5×3×13×15×11×2      16473600       1135041350219496382  3×9×5×5×6×4×6×4×8×3    9331200
5×7×15×12×6×7×14×9×17×2     1133546400   1425787542618654982   6×8×4×7×7×8×5×10×2×3  22579200
12×8×10×7×6×5×15×4×6×2       145152000     3908372542507822062  7×9×9×8×7×6×4×5×7×3   80015040
17×12×4×18×13×7×8×15×13×8  16680867840  8993229949524469768  2×7×5×1×6×8×9×4×6×9   6531840
3×11×11×14×4×2×10×2×10×10  517492800     30568377312064202855                                       41990400

as you can see pz does not exceed 100,000,000 steps

we can only run those that are smaller or discard all large and their combinations (so as not to use them)

10124976407546442823  [1, 3, 13, 13, 4, 12, 10, 8, 10, 5] 97344000         [2, 4, 6, 6, 5, 7, 9, 9, 9, 6] 44089920
10237399942181288170  [1, 5, 10, 18, 13, 3, 9, 10, 9, 7] 199017000          [2, 6, 9, 1, 6, 4, 10, 9, 10, 8] 18662400
10349823476816133517  [1, 7, 17, 5, 11, 14, 7, 4, 8, 8] 164200960           [2, 8, 2, 6, 8, 5, 8, 5, 9, 9] 24883200
10462247011450978864  [1, 10, 4, 11, 1, 5, 5, 16, 16, 10] 28160000          [2, 9, 5, 8, 2, 6, 6, 3, 3, 9] 4199040
10574670546085824211  [1, 12, 10, 7, 9, 6, 13, 10, 6, 2] 70761600           [2, 7, 9, 8, 10, 7, 6, 9, 7, 3] 80015040
10687094080720669558  [1, 14, 7, 13, 8, 7, 2, 12, 14, 13] 311630592         [2, 5, 8, 6, 9, 8, 3, 7, 5, 6] 21772800
10799517615355514905  [1, 16, 14, 8, 7, 8, 10, 6, 13, 5] 391372800         [2, 3, 5, 9, 8, 9, 9, 7, 6, 6] 44089920
10911941149990360252  [1, 10, 10, 5, 5, 18, 9, 9, 2, 7] 51030000            [2, 9, 9, 6, 6, 1, 10, 10, 3, 8] 13996800
11024364684625205599  [2, 2, 7, 10, 14, 10, 7, 2, 10, 18] 98784000          [3, 3, 8, 9, 5, 9, 8, 3, 9, 1] 6298560
11136788219260050946  [2, 4, 13, 16, 3, 11, 6, 5, 9, 10] 148262400          [3, 5, 6, 3, 4, 8, 7, 6, 10, 9] 32659200
11249211753894896293  [2, 6, 11, 2, 12, 11, 13, 17, 8, 12] 739335168        [3, 7, 8, 3, 7, 8, 6, 2, 9, 7] 21337344
11361635288529741640  [2, 9, 7, 8, 10, 13, 11, 11, 7, 4] 443963520          [3, 10, 8, 9, 9, 6, 8, 8, 8, 5] 298598400
11474058823164586987  [2, 11, 4, 13, 10, 4, 10, 13, 15, 15] 1338480000      [3, 8, 5, 6, 9, 5, 9, 6, 4, 4] 27993600
11586482357799432334  [2, 13, 10, 10, 8, 14, 18, 7, 5, 7] 1284192000        [3, 6, 9, 9, 9, 5, 1, 8, 6, 8] 25194240
11698905892434277681  [2, 15, 17, 5, 17, 6, 7, 9, 13, 9] 1917197100         [3, 4, 2, 6, 2, 7, 8, 10, 6, 10] 9676800
11811329427069123028  [2, 9, 4, 11, 6, 7, 15, 3, 3, 10] 44906400               [3, 10, 5, 8, 7, 8, 4, 4, 4, 9] 38707200
11923752961703968375  [2, 11, 10, 7, 15, 8, 3, 15, 11, 12] 1097712000       [3, 8, 9, 8, 4, 9, 4, 4, 8, 7] 55738368
12036176496338813722  [3, 3, 7, 13, 13, 9, 11, 9, 10, 4] 379459080          [4, 4, 8, 6, 6, 10, 8, 10, 9, 5] 165888000
12148600030973659069  [3, 5, 14, 0, 3, 9, 10, 11, 9, 15] 0                      [4, 6, 5, 2, 4, 10, 9, 8, 10, 4] 27648000
12261023565608504416  [3, 8, 1, 5, 11, 11, 8, 5, 8, 7] 32524800               [4, 9, 2, 6, 8, 8, 9, 6, 9, 8] 107495424
12373447100243349763  [3, 10, 7, 11, 1, 2, 7, 7, 16, 9] 32598720              [4, 9, 8, 8, 2, 3, 8, 8, 3, 10] 26542080
12485870634878195110  [3, 12, 13, 7, 9, 12, 15, 10, 6, 1] 318427200         [4, 7, 6, 8, 10, 7, 4, 9, 7, 2] 47416320
12598294169513040457  [3, 14, 10, 13, 7, 14, 4, 4, 4, 12] 410941440         [4, 5, 9, 6, 8, 5, 5, 5, 5, 7] 37800000
12710717704147885804  [3, 8, 7, 8, 7, 5, 11, 16, 13, 4] 430510080             [4, 9, 8, 9, 8, 6, 8, 3, 6, 5] 89579520
12823141238782731151  [3, 10, 4, 5, 5, 15, 10, 10, 2, 6] 54000000             [4, 9, 5, 6, 6, 4, 9, 9, 3, 7] 44089920
12935564773417576498  [3, 12, 10, 10, 14, 7, 8, 12, 10, 17] 5757696000      [4, 7, 9, 9, 5, 8, 9, 7, 9, 2] 102876480
13047988308052421845  [4, 4, 16, 16, 3, 8, 7, 6, 9, 9] 334430208              [5, 5, 3, 3, 4, 9, 8, 7, 10, 10] 45360000
13160411842687267192  [4, 7, 4, 2, 12, 8, 15, 8, 8, 11] 227082240            [5, 8, 5, 3, 7, 9, 4, 9, 9, 8] 97977600
13272835377322112539  [4, 9, 10, 8, 10, 10, 4, 2, 7, 12] 193536000          [5, 10, 9, 9, 9, 9, 5, 3, 8, 7] 275562000
13385258911956957886  [4, 11, 7, 13, 10, 10, 11, 14, 15, 14] 12948936000    [5, 8, 8, 6, 9, 9, 8, 5, 4, 5] 124416000
13497682446591803233  [4, 13, 13, 10, 8, 11, 10, 8, 5, 6] 1427712000        [5, 6, 6, 9, 9, 8, 9, 9, 6, 7] 396809280
13610105981226648580  [4, 7, 1, 5, 17, 3, 8, 10, 13, 8] 59404800             [5, 8, 2, 6, 2, 4, 9, 9, 6, 9] 16796160
13722529515861493927  [4, 9, 7, 11, 6, 13, 7, 13, 12, 9] 2124970848         [5, 10, 8, 8, 7, 6, 8, 6, 7, 10] 451584000
13834953050496339274  [4, 11, 13, 8, 5, 4, 15, 6, 11, 11] 996652800         [5, 8, 6, 9, 6, 5, 4, 7, 8, 8] 116121600
13947376585131184621  [4, 13, 10, 13, 13, 6, 4, 9, 10, 3] 569462400         [5, 6, 9, 6, 6, 7, 5, 10, 9, 4] 122472000
14059800119766029968  [5, 5, 17, 0, 2, 16, 12, 2, 18, 14] 0                      [6, 6, 2, 2, 3, 3, 7, 3, 1, 5] 136080
14172223654400875315  [5, 8, 4, 5, 11, 8, 0, 15, 8, 6] 0                          [6, 9, 5, 6, 8, 9, 2, 4, 9, 7] 58786560
14284647189035720662  [5, 10, 10, 11, 9, 9, 8, 9, 6, 8] 1539648000          [6, 9, 9, 8, 10, 10, 9, 10, 7, 9] 2204496000  <= or these mega pieces cut off
14397070723670566009  [5, 12, 7, 7, 9, 9, 7, 11, 6, 9] 990186120             [6, 7, 8, 8, 10, 10, 8, 8, 7, 10] 1204224000  <= or these mega pieces cut off
14509494258305411356  [5, 5, 13, 13, 7, 11, 5, 5, 4, 11] 357857500           [6, 6, 6, 6, 8, 8, 6, 6, 5, 8] 119439360
14621917792940256703  [5, 8, 10, 8, 16, 11, 4, 7, 13, 3] 615014400           [6, 9, 9, 9, 3, 8, 5, 8, 6, 4] 100776960
14734341327575102050  [5, 10, 7, 5, 5, 12, 12, 1, 2, 5] 12600000              [6, 9, 8, 6, 6, 7, 7, 2, 3, 6] 27433728
14846764862209947397  [5, 12, 13, 10, 14, 4, 9, 13, 10, 16] 8176896000      [6, 7, 6, 9, 5, 5, 10, 6, 9, 3] 91854000
14959188396844792744  [5, 14, 10, 16, 12, 14, 8, 16, 9, 8] 17340825600      [6, 5, 9, 3, 7, 5, 9, 3, 10, 9] 68890500
15071611931479638091  [6, 7, 7, 2, 12, 5, 16, 9, 8, 10] 406425600             [7, 8, 8, 3, 7, 6, 3, 10, 9, 9] 137168640
15184035466114483438  [6, 9, 4, 8, 10, 7, 5, 12, 7, 11] 558835200            [7, 10, 5, 9, 9, 8, 6, 7, 8, 8] 609638400
15296459000749328785  [6, 11, 10, 14, 0, 7, 13, 5, 15, 13] 0                    [7, 8, 9, 5, 2, 8, 6, 6, 4, 6] 34836480
15408882535384174132  [6, 4, 16, 10, 8, 8, 12, 8, 5, 5] 589824000            [7, 5, 3, 9, 9, 9, 7, 9, 6, 6] 173604060
15521306070019019479  [6, 7, 4, 6, 7, 0, 10, 1, 13, 16] 0                         [7, 8, 5, 7, 8, 2, 9, 2, 6, 3] 10160640
15633729604653864826  [6, 9, 10, 11, 6, 10, 8, 14, 12, 8] 3832012800        [7, 10, 9, 8, 7, 9, 9, 5, 7, 9] 900169200
15746153139288710173  [6, 11, 7, 8, 4, 11, 16, 8, 1, 10] 208158720           [7, 8, 8, 9, 5, 8, 3, 9, 2, 9] 78382080
15858576673923555520  [6, 13, 13, 13, 13, 12, 5, 10, 10, 2] 2056392000      [7, 6, 6, 6, 6, 7, 6, 9, 9, 3] 92588832
15971000208558400867  [6, 16, 1, 0, 2, 13, 13, 4, 8, 13] 0                     [7, 3, 2, 2, 3, 6, 6, 5, 9, 6] 2449440
16083423743193246214  [7, 8, 7, 5, 11, 4, 12, 6, 8, 5] 248371200            [8, 9, 8, 6, 8, 5, 7, 7, 9, 6] 365783040
16195847277828091561  [7, 10, 13, 11, 9, 15, 10, 9, 6, 7] 5108103000        [8, 9, 6, 8, 10, 4, 9, 10, 7, 8] 696729600
16308270812462936908  [7, 3, 10, 7, 9, 6, 8, 12, 15, 8] 914457600           [8, 4, 9, 8, 10, 7, 9, 7, 4, 9] 365783040
16420694347097782255  [7, 6, 6, 13, 7, 7, 16, 15, 4, 10] 1541030400         [8, 7, 7, 6, 8, 8, 3, 4, 5, 9] 81285120
16533117881732627602  [7, 8, 4, 8, 16, 8, 5, 8, 13, 2] 238551040            [8, 9, 5, 9, 3, 9, 6, 9, 6, 3] 85030560
16645541416367472949  [7, 10, 10, 5, 5, 9, 13, 11, 11, 13] 3220717500       [8, 9, 9, 6, 6, 10, 6, 8, 8, 6] 537477120
16757964951002318296  [7, 12, 16, 10, 14, 1, 2, 4, 10, 15] 225792000        [8, 7, 3, 9, 5, 2, 3, 5, 9, 4] 8164800
16870388485637163643  [7, 15, 3, 16, 12, 11, 10, 7, 9, 7] 2933884800        [8, 4, 4, 3, 7, 8, 9, 8, 10, 8] 123863040
16982812020272008990  [7, 17, 10, 3, 2, 2, 9, 0, 17, 9] 0                        [8, 2, 9, 4, 3, 3, 10, 2, 2, 10] 2073600
17095235554906854337  [8, 9, 7, 8, 10, 13, 6, 13, 7, 10] 2861913600         [9, 10, 8, 9, 9, 6, 7, 6, 8, 9] 1058158080       <= or these mega pieces cut off
17207659089541699684  [8, 2, 13, 14, 8, 14, 5, 15, 15, 12] 4402944000       [9, 3, 6, 5, 9, 5, 6, 4, 4, 7] 24494400
17320082624176545031  [8, 5, 0, 10, 8, 5, 13, 9, 5, 4] 0                          [9, 6, 2, 9, 9, 6, 6, 10, 6, 5] 94478400
17432506158811390378  [8, 7, 7, 6, 6, 16, 2, 12, 3, 15] 243855360           [9, 8, 8, 7, 7, 3, 3, 7, 4, 4] 28449792
17544929693446235725  [8, 9, 13, 11, 15, 7, 10, 5, 12, 7] 4540536000        [9, 10, 6, 8, 4, 8, 9, 6, 7, 8] 418037760
17657353228081081072  [8, 11, 10, 8, 4, 8, 9, 8, 1, 9] 145981440              [9, 8, 9, 9, 5, 9, 10, 9, 2, 10] 472392000
17769776762715926419  [8, 13, 16, 13, 13, 9, 6, 11, 10, 10] 16704230400     [9, 6, 3, 6, 6, 10, 7, 8, 9, 9] 264539520
17882200297350771766  [8, 16, 4, 0, 11, 10, 5, 14, 8, 12] 0                      [9, 3, 5, 2, 8, 9, 6, 5, 9, 7] 36741600
17994623831985617113  [8, 18, 10, 5, 11, 10, 13, 7, 8, 4] 2306304000        [9, 1, 9, 6, 8, 9, 6, 8, 9, 5] 75582720
18107047366620462460  [9, 1, 7, 11, 9, 12, 2, 10, 6, 6] 53887680             [10, 2, 8, 8, 10, 7, 3, 9, 7, 7] 118540800
18219470901255307807  [9, 3, 13, 7, 9, 3, 10, 3, 15, 7] 208967850           [10, 4, 6, 8, 10, 4, 9, 4, 4, 8] 88473600
18331894435890153154  [9, 6, 9, 13, 7, 13, 9, 6, 4, 9] 1117679472           [10, 7, 10, 6, 8, 6, 10, 7, 5, 10] 705600000
18444317970524998501  [9, 8, 7, 8, 16, 5, 6, 18, 13, 1] 452874240           [10, 9, 8, 9, 3, 6, 7, 1, 6, 2] 9797760

the puzzles themselves can jump in the middle of these sequences from 100000 to 100000000

the larger the piece, the less chance that the puzzle will end up there... because the big pieces are smaller than the middle ones? or there are equal parts of them...

but if we create a database of discarded them, we will have to check this will take place and time...


schedule 1024-8192

pz 1155  [2, 10] 20          [3, 9] 27
pz 2683  [8, 11] 88          [9, 8] 72
pz 5216  [7, 7] 49            [8, 8] 64

https://ibb.co/FqWy12D

similarly somewhere out there, in the distance

https://ibb.co/4Z49tpf

***

the sizes of the iteration count of fixed values (a1,a2)(a2,a1)...

3628800 10  a1*a2*a3*a4*a5*a6*a7*a8*a9*a10                                
362880   9
40320     8
5040      7
720       6
120       5
24        4
6          3    a1*a2*a3
2          2    a1*a2
1         1     a1


we have all options 1785233613312

                3628800
                362880000        100        pieces cut off                                                                            
                36288000000     10000     pieces cut off
                362880000000    100000   pieces cut off
                3628800000000  1000000  pieces cut off
                1785233613312

take it       362880000000    100000   pieces cut off

100000 parts by 3628800 iteration count

mega pieces too 3628800 => 17095235554906854337  [8, 9, 7, 8, 10, 13, 6, 13, 7, 10] 2861913600         [9, 10, 8, 9, 9, 6, 7, 6, 8, 9] 1058158080       <= or these mega pieces cut off

and all this shit needs to be cut...

how they all fit into the ranges is a separate question...

1785233613312 x 3628800 = 6478255735986585600

somehow fits

2305843009213693951
4611686018427387903
9223372036854775807

6478255735986585600

18446744073709551615
36893488147419103231
73786976294838206463

***

he jumps when 1 number changes

30568377312064202856 [3, 11, 11, 14, 4, 2, 10, 2, 10, 11] 89443200   [4, 8, 8, 5, 5, 3, 9, 3, 9, 8]     37324800
30568377312064202855 [3, 11, 11, 14, 4, 2, 10, 2, 10, 10] 81312000   [4, 8, 8, 5, 5, 3, 9, 3, 9, 9]     41990400
30568377312064202854 [3, 11, 11, 14, 4, 2, 10, 2, 10, 9]   73180800   [4, 8, 8, 5, 5, 3, 9, 3, 9, 10]   46656000

31568377312064202855 [4, 11, 11, 14, 4, 2, 10, 2, 10, 10]  108416000  [5, 8, 8, 5, 5, 3, 9, 3, 9, 9]   52488000
30568377312064202855 [3, 11, 11, 14, 4, 2, 10, 2, 10, 10]  81312000    [4, 8, 8, 5, 5, 3, 9, 3, 9, 9]   41990400
29568377312064202855 [11, 11, 11, 14, 4, 2, 10, 2, 10, 10] 298144000 [8, 8, 8, 5, 5, 3, 9, 3, 9, 9]    83980800