you need to try create file h5py by using that algorithm new one again using python generate that serial binary file

---

that method is may be on theory only because that script it generate itself both private key and public key it is complete run on script
it not work in real
for improve or testing you need to try spilt generate part and LLL method part and test it

function ecdsa.ecdsa.Public_key can not easy to put manual public key proint for test it need to modify to can use easy

sorry I am not coder pro, I just try testing it but can not apply to advance
how every I think method we found on internet it never work with high bit puzzle may be need some complex method

TheArchaeologist  correct

python
>>> hex(int(0x9cbdfb599ed0100/10))[2:]
'fac99228fe19b0'


mausuv, What is that number?

ok, I will try upgrade by python to 3.9 and test again my WSL python is 3.8

Can you help to explain each value on shiftdown function for non-programmer understand?

pubkey in hex convert to pubkey point x and y is Q (Q.x,Q.y)
G is Gx,Gy of curve right
P is value after subtract value
What is k value?
i is how may time to dividing

I am hobby code not professional coder, try to understand (may be slowly understand)

I use same script just copy Bitcoin testnet raw transaction to
I got result

('THE R VALUE is  :', '503434f27f0d5dc23c01a5d2b2b2abb902e2816987515dafa619ffded8fc2ec6')
('THE S VALUE is  :', '4c30c0b82c9afd623e140bf2d6badfa2f02414ef3ffc603e83f2f65a264ce2b8')
('THE Z VALUE is  :', 'c340c9ece755e54bf99c34386eb8e19befd76cb3ddd5b47a4d52be65fea05b6d')
('THE PUBKEY is :', '0355d77643f9bbccde7a1f05d8fa72c0b6c53075cdc299753242320ef9c6611233')


if I know Key how I can calculate and got result same on testnet

this scripts last version update run with some error
TypeError: unsupported operand type(s) for -: 'str' and 'Point' and  pk2 missing =

last version on my WSL ubuntu run fine

how every will be great if can have some version for python on windows 10 use ecdsa or other
because fastecdsa it is can use only on Linux (can't install on windows), for run scripts with fastecdsa for me use no problem I use WSL

Ok,
I just understand method use RSZ is can use only if bad transaction/signature use same R value or other way use same nonce  or use something duplicate or share it will can find difference, but if not have sorting duplicate it can not use to find keys

---

How to fix this script
I found sometime script give result wrong by mission one zero at last y value for uncompressed pub key

uncompressed public key 130 character but script give result 129 character compare result it is missing one zero

COBRAS,
Did you try idea puzzle #120 use that script flip/reverse convert from public key to R S Z and try use RSZ to recover private key.
I try read from code it is very complex math I can not code.
but it is good idea to try do it

I believe AI - machine learning (deep learning) can possible to predict bitcoin price
but don't use time series forecasting
may be customize model training by price habits or investor habits can possible success to predict
but can do only very large size model development (like GPT-3), for small develop and simple develop can not predict bitcoin

How can I try to use Lightning Network on bitcoin testnet?
Did testnet support Lightning Network?
and What is application  app for use Lightning Network both on testnet and on bitcoin Lightning Network real live?

What you mean real collisions? I don't know much about it.

I thought it is have collisions about Pollard's kangaroo for SECPK1 method already. What collisions you mean?

I don't know subtract method will work or not? not yet have sample case for test with any puzzle improve
but many people try, I will tri to test this subtract method (not yet clear to understand on this knowledge)
Is there any other scripts keysubtracter in python language (sorry for ask, I am not expert on c++, I am not programmer)?

For this keysubtracter in c++ language, why not try to add GPU calculate to work faster (Dev both CUDA and OpenCL will be great)

For now, very rare to find one high-end graphics card
Does anyone use a graphics card Nvidia GTX 1650 4GB, How many key can search by bitcrack both original and sp-mod 5?

GTX 1650 better than GTX 1050Ti   Right?

This thread subtracting stop to talk meaning it is not works right?
if it is possible work can possible explain to new arrival to know again
thread is continue from talk on kangaroo thread page 8x -9x
seem need to understand knowledge  about bit and ECDLP to understand right?

I am not yet understand about subtract method I follow come later
May be subtract method it is not works. for now can not solve
What is thing make subtract method stuck, power of GPU not help right

I not yet deep understand about ECDLP and Pollard's kangaroo Algorithm and about Collision
I just know overview that not enough for knowledge can solve puzzle

I am not sure I understand it correctly
This Collision method meaning it have Collision every where on range around 2*32 will be found Collision of every key right (but size large 2**256 it is large enough for can not find it)

Still far away for puzzle #64 or puzzle #120

from last Kangaroo record
#105 Solved 23/09/2019
#110 Solved 30/05/2020
#115 Solved 16/06/2020

For now 17/11/2021

over pass a year not yet found any key on puzzle list

from history may be need new one method to solve puzzle
like from bitcrack and change to kangaroo and What next?

High powerful GPU not answer (but GPU is very very useful) but need some algorithm to solve it

COBRAS, How you method can found key? I not yet know you knowledge on this way. sorry I don't follow forum and don't know feel 3-4 month what happen.
if someone know and believe your way can found key may be help to search as you request. 

I think it can not change, server give distribute split range to search and record what range search already look like each one add some address on range search for test your bitcrack still work fine and can found key I think so.

Recommend to join with owner pool 64bit on telegram and talk with them

Thank a lot

How long JeanLucPons use time for solve puzzle #105 ,#110 and #115 each ?
info on GitHub tell only #120

็How to can calculate range for my GPU can search?
example
[139.25 MK/s][GPU 117.25 MK/s][Count 2^39.32][Dead 0][01:34:25 (Avg 17.4802y)][2.0/4.0MB]

24 hour = 24*60=1,440*60=86,400 sec

117.25 MK = 117000000
117000000*86400=77,760,000,000,000
log2(77760000,0000000)
49.466021547366765
49bit range

just try spilt search
D5F00C73EA6B3394A6BB77FFFFFFFF
D5FE01DEDF5D348E540611C71C71C7
02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630