Keep up your good work, you can do this, you can solve any key as long as you have the private key. Lol
Some of your posts are interesting. Thank you.
And when the time comes, you begin to understand that you can spend it on learning C++ or on useless messages? I continue to develop my old program, which I started in 2000. I initially saved all DP data to a file. It takes a long time to open the file and write. Now I will add a Hash table for temporary aggregation of selected points and their subsequent recording to a file - this is faster. My saved data is 256 bits in size. I also save the working kangaroos to another file. For those interested, the function for loading and unloading a herd of kangaroos is in the backup.cpp file. Can be used. I will not publish other functions, at least for now, for obvious reasons. But if you want to solve 130, you'll have to rewrite Jean Luck's program because it has limitations. And not only in the GPU code, but also in the size of the data in the table itself. It’s not just that, having computing resources, download the finished code and solve 130. It’s even pleasing. Those who have resources have no knowledge. And those who have knowledge do not have resources.
I don’t know, I achieved a speed of 520 Mkeys - this is with writing to a table, reading from a table and writing to files, and at the same time checking to find a solution. And added loading the herd from the file - when restarting. I’m still writing the code, even if I’m unlucky in solving the problem. And still. Everyone complains about the amount of energy wasted, but have you ever analyzed someone else's program code? To avoid wasting money...
./vs-kangaroo-multi -dp 16 -gpu -bits 64 03100611c54dfef604163b8358f7b7fac13ce478e02cb224ae16d45526b25d9d4d
The forked software created 29.10.2023 by Alek-76 fixed modify v0.16 ...
make: warning: Clock skew detected. Your build may be incomplete.
[###########################################################]
[# Pollard-kangaroo PrivKey Recovery Tool #]
[# (based on engine of VanitySearch 1.19) #]
[# bitcoin ecdsa secp256k1 #]
[# ver. 0.16 #]
[# GPU implementation changes by Alek76 #]
[# Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9 #]
[###########################################################]
[DATE(utc)] 29 Oct 2023 12:34:37
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[pow2bits] 64
[Wsqrt] (2^31) 100000000
[M] C000000000000000
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[i] Used OpenSSL Random number generator
[i] OpenSSL 3.0.2 15 Mar 2022 (Library: OpenSSL 3.0.2 15 Mar 2022)
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[rangeW] 2^63..2^64 ; W = U - L = 2^63
[DPsize] 1048576 (hashtable size)
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[pubkey#64] loaded
[Xcoordinate] 100611C54DFEF604163B8358F7B7FAC13CE478E02CB224AE16D45526B25D9D4D
[Ycoordinate] 5127C2D0B1C4A4D5B4996BBDF37633B86901D0303B61E2F6F0772282AE08FF95
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[+] Sp-table of pow2 points - ready
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[UV] U*V=0*0=0 (0x00)
[i] Old DPmodule: 2^29
[i] New DPmodule: 2^24
[+] 0T+0W kangaroos - ready
[CPU] threads: 0
[GPU] threads: 1 Hang on to your hats... ;-)
[i] Used Comparator in Python
===========================================================================
by Pollard (.. The best choice of m (mean jump size: 2^32) is w^(1/2)/2 ..)
[i] Used Mixed 16 Jump Table: G,2G,4G,8G,16G,...,Rand(2^pow2Wsqrt+1)
Create Jump Table (size: 16) Max Jump: 2^33
Jump Avg distance: 2^31.04 (+/- use option -p)
===========================================================================
GPUEngine: Fixed DPmodule = 2^16
GPUEngine: Total kangaroos and their close relatives 1310720 ;-)
GPUEngine: Fixed DPmodule: 0x10000 2^16 Hop_modulo: 32 Power: 0
GPUEngine: Stack Size: 1024
GPUEngine: Heap Size: 8388608
GPU GPU #0 Tesla T4 (40x64 cores) Grid(80x128) (129.0 MB used; GRP size: 128; nbSpin: 256)
[i] GPU TameStartingKey: C000000000000000
GPU thId: 128 GPU bnL: 64
GPU Tame Points: [M] + Rand(pow2W)
GPU Wild Points: [Target] + Rand(pow2W)
GPU Wild Starting Key 0: 4243657DAD16D786
GPU Tame Starting Key 1: 12318636040F76DBF
GPU Wild Starting Key 2: 5D33C0C3E0BBEACD
GPU Tame Starting Key 3: 12821E106B999205E
GPU Wild Starting Key 4: B2905822AFDE251
GPU Tame Starting Key 5: C14C17F1ADF64974
GPU Wild Starting Key 6: 27ABF855C19AFB16
GPU Tame Starting Key 7: 1148E716BA44257DB
GPU Wild Starting Key 8: 375F3D5C55AFDF84
GPU Tame Starting Key 9: DF8E0EA7009CA26F
GPU Tame Starting Key 1300480: E191DA8F160EC93C Kangaroos: 1310720
NB Thread: 10240 , GPU_GRP_SIZE: 128
[+] Runing Comparator every: 30 sec
Python Comparator time: 1256.725 msec
[\][ 0: 0:34 ; 566.1M j/s; [GPU 566.12 Mj/s] 18.0Gj 437.5%; dp/kgr=0.0; 0: 0: 0 ]
Python Comparator time: 3188.568 msec
[-][ 0: 1: 4 ; 524.2M j/s; [GPU 524.20 Mj/s] 34.0Gj 812.5%; dp/kgr=0.0; 0: 0: 0 ]
SOLVED: 0xf7051f27b09112d4
Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9
[\][ 0: 1: 6 ; 524.2M j/s; [GPU 524.20 Mj/s] 35.0Gj 835.9%; dp/kgr=0.0; 0: 0: 0 ]
[i] No Cleaning wild and tame files
SOLVED: 0xf7051f27b09112d4
Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9
[i] 550.9M j/s; 36.0Gj of 4.0Gj 859.4%; DP 0T+0W=0+0=0; dp/kgr=0.0;
[runtime] 0: 1: 7
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[DATE(utc)] 29 Oct 2023 12:36:07
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[x] EXIT
I don't know why the Jean Luck Pons program checks for collision distance. It is necessary to check the coincidence of X coordinates.