New experiment toy. Just really trying to beat various BSGS programs out there.
I have tested it up to 72 Bits; it can find any public key (with private key) in under 4 minutes, max.
Not that special or fast, right? Well, that is only using 6 CPU cores. No GPU involved.
It's a combo of BSGS and a little of Kangaroo, but mainly BSGS. Biggest bonus over the various BSGS programs, this program only uses up 1.3GB of RAM.
It's also a lot faster, IMO.
So to all of those peeps working on their own new stuff/experiments, I say keep on grinding. You never know what might work.
I have tested it up to 72 Bits; it can find any public key (with private key) in under 4 minutes, max.
Not that special or fast, right? Well, that is only using 6 CPU cores. No GPU involved.
It's a combo of BSGS and a little of Kangaroo, but mainly BSGS. Biggest bonus over the various BSGS programs, this program only uses up 1.3GB of RAM.
It's also a lot faster, IMO.
Code:
KangaBGStrider v1.01
Range Start :0 (0 bit)
Range End :FFFFFFFFFFFFFFFFFF (72 bit)
Public Key(s) :1
Creating Stride Table...
CPU thread(s) : 6
Stride Table Complete: Max Stride: 2^34
Stride Avg Distance: 2^32.17
Number of Striders: 2^12.58
Suggested DP: 20
Expected operations: 2^38.60
Simulated DP size: 28 [0x000000000FFFFFFF]
[28.99 MS/s][GPU 0.00 MS/s][Total Collision Checks 2^30.94][01:28 (Avg 03:59:53)]
Key# 0 [1S]Pub: 0x02C15C8C23D90C8E35C1A214DDE2D4383C0735AE45BEF61F10AA1A1C255984CF74
Priv: 0x800000000000000000
Done: Total time 01:31
So to all of those peeps working on their own new stuff/experiments, I say keep on grinding. You never know what might work.
It appears that the GPU version of the product will be exceptional, and I trust that you will promptly develop this version. Additionally, I was wondering whether we will have the opportunity to utilize it ourselves? If so, may I inquire about the projected timeline for its release? One more question, will there be an option to increase the CPU cores in the toy as well
