I was able to retrieved case #62 private key 363D541EB611ABEE in 8122.18 sec. (running 4 instances of the script by splitting the interval in 4 pieces at 160000 h/s per core)
It is a pity that this can be done only after an outgoing transaction  Can your script modification distinguish between compressed and uncompressed addresses? If I understand correctly, the script does not stop at the specified range and if the key contains more bits, then the script starts to search for infinitely long? |
|
|
|
|
How much time should a search for a 50-bit key take? If I put a 50-bit key in a 50-bit range, this happens quickly, but a 32-bit key in a 50-bit range has not yet been found.
|
|
|
|
|
Suppose I know that the private key for the public (32 bit) 0209c58240e50e3ba3f833c82655e8725c037a2294e14cf5d73a5df8d56159de69 is in the range of 1-50 bits, can I run a script with an unknown bit size in the range of 1-50?
|
|
|
|
|
57fe script and Telariust searches for a private key only in the indicated bit range? I changed the name of the 16 bit key to 51 and nothing was found in a few hours.
|
|
|
|
Kangaroo System, test friends.
Can you share your scan time and speed?
and How many bits?
I'm
48 bit - 110k / s - 87 sec
51 bit - 110k / s - 200 sec
[################################################]
[# ECDSA Pollard-kangaroo PrivKey Recovery Tool #]
[# based on code by 57fe 2019 #]
[# singlecore #]
[################################################]
[date] Tue Sep 3 17:52:34 2019
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[PRNGseed] 439144377
[bits] 2^50
[i] pubkey#50 loaded from default table
[prvkey#50] 0x00000000000000000000000000000000000000000000000000022bd43c2e9354
[pubkey#50] 03f46f41027bbf44fafd6b059091b900dad41e6845b2241dc3254c7cdd3c5a16c6
[format] compressed
[Xcoordinate] f46f41027bbf44fafd6b059091b900dad41e6845b2241dc3254c7cdd3c5a16c6
[Ycoordinate] eb3dfcc04c320b55c529291478550be6072977c0c86603fb2e4f5283631064fb
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[+] P-table ready
[~~~~~~~~~~~~~~~~~~~~~~~[1]~~~~~~~~~~~~~~~~~~~~~~]
[+] T+W ready
[~] 144975.9 j/s
[prvkeyX] 00000000000000000000000000000000000000000000000000022bd43c2e9354
[prvkey0] 00000000000000000000000000000000000000000000000000022bd43c2e9354
[double-check] success!
[jump] 82359278
[time] 570.5 sec what does 3 column mean? And why do 33 and 105 matter False? pubkeys = {
16: ('029d8c5d35231d75eb87fd2c5f05f65281ed9573dc41853288c62ee94eb2590b7a', 0xc936)
, 24: ('036ea839d22847ee1dce3bfc5b11f6cf785b0682db58c35b63d1342eb221c3490c', 0xdc2a04)
, 32: ('0209c58240e50e3ba3f833c82655e8725c037a2294e14cf5d73a5df8d56159de69', 0xb862a62e)
, 33: ('02ed949eaca31df5e8be9bf46adc1dfae1734b8900dcc303606831372955c728da', False) #0x01abcd1234
, 40: ('03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4', 0xe9ae4933d6)
, 45: ('026ecabd2d22fdb737be21975ce9a694e108eb94f3649c586cc7461c8abf5da71a', 0x122fca143c05)
, 50: ('03f46f41027bbf44fafd6b059091b900dad41e6845b2241dc3254c7cdd3c5a16c6', 0x022bd43c2e9354)
, 65: ('0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b', 0x01a838b13505b26867)
,105: ('03bcf7ce887ffca5e62c9cabbdb7ffa71dc183c52c04ff4ee5ee82e0c55c39d77b', False) |
|
|
|
Let's discuss the Pollard's kangaroo script from 57fe since it is not possible to register on its forum. Has anyone managed to increase the speed above 150k? And who understands, explain what the lines mean 5-8:
modulo = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
order = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141
Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798
Gy = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
This is the easiest part  All these integers are determined by bitcoin mathematics in ECDSA. Gx and Gy are x, y coordinates of the base point (G) which is used to produce private key. Modulo is the mod of the field (like border). Order is the order of the fiels, i.e the total number of points of ECDSA curve. if I want to look for any other bitcoin key (I guess it takes a very long time), I do not need to change these lines? Only lines 168-176 and 178? |
|
|
|
Let's discuss the Pollard's kangaroo script from 57fe since it is not possible to register on its forum. Has anyone managed to increase the speed above 150k? And who understands, explain what the lines mean 5-8: modulo = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F order = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798 Gy = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 Who knows for bitcrack is it important to have Visual Studio 2017 and CUDA Toolkit 9.2? Will it work with Visual Studio 2019 and CUDA Toolkit 10.1 (newest vesrions)?
If I understand correctly, then there is a new version with Upgrade to Visual Studio 2019 / CUDA 10.1, but it is not in releases https://github.com/brichard19/BitCrack |
|
|
|
Can someone calculate 60-63% key range for 62 bit key?
If full range 62 key: Hex: 0x2000000000000000 - 0x3FFFFFFFFFFFFFFF Dec: 2305843009213693952 - 4611686018427387903 that: 2305843009213693952 + 60% = 3689348814741910528 0x3333333333333400 2305843009213693952 + 63% = 3758524105018320896 0x3428F5C28F5C2800 0x3333333333333400 - 0x3428F5C28F5C2800 Yes or no? /translated google/ |
|
|
|
If you have 2^143 * 200 = 2230074519853062314153571827264836150598041600 PS3 and 6 months. And the electricity to power them, let's say about 100W per PS3.
Just? Count all bitcoins in my pocket  |
|
|
|
112 bit is the current record for the ECDLP (Elliptic Curve Discrete Logarithm Problem = retrieve the private key from the public key)
I understood correctly: if you have 200 playstation3 and 6 months, then you can find a private key to any Bitcoin address that had outgoing transactions? |
|
|
|
I think that beyond #85 it will be very difficult to recover the private key, even with 1 TB of RAM (with the Baby-Giant Step algorithm).
Nvme ssd as a swap? |
|
|
|
|
Show Posts
