Pollard's kangaroo ECDLP solver

[Jean_Luc]

What about removing completely the jD array?

If I remove the distance, I will have to redo walk to get the distance in case of a collision and will make merge difficult with kangaroo indexing, and impossibility to check a work file integrity.
The work file will have to contain starting positions and a merge will imply reindexing of the workfile. When working with work file of hundreds of GB, it will take time.
A intermediate solution could be to redo the walk of each DP at the output of the GPU but here this is tricky as while the GPU is working, the CPU is occupied to do network transfer of DP.

[WanderingPhilospher]

Everybody quiet...waiting for their screen to pop up the #120 private key

Something to chew on and ponder...

If you use more kangaroos, you increase the number of kangaroos that can collide and make their walks/jumps/starting points closer together which reduces the number of jumps until a collision occurs.

But, having more kangaroos jumping at each step, does it increase the number of group operations required as each step increases?

Thoughts?

[WanderingPhilospher]

I'm running a CPU only test, if anyone is interested in connecting and taking part, PM me.

I'll give you links, .bat file, and IP address

Example, run Kangaroo, CPU only when you are sleeping or at work. Only uses 4 threads so will not take much juice.

[PrivatePerson]

Is this some kind of innovative development? Which can find a key on 4 CPU cores?

[brainless]

hi @BitCrack
Will you consider releasing a server-client version of bitcrack  ?

Yes, I have been working on it for a little while.

Great news 

don't forget to merge this https://github.com/brichard19/BitCrack/issues/256 if it is not already done.
And thanks a lot.

anyone have study bitcrack codes, and have commands in hand to modifiy/add/update some features
if yes, then these feature, work fast then kangaroo for find 120 puzzle, pls check and update us all community

--stride 1000:52000
where 1000 key check, and 52000 key bypass(no check)
--loop 500
count total keys of --keyspace * 500 = total keys
example 1 to 100 + 1 to 100 + 1 to 100
cuurent stride work only fixed like --stride 1:52000  or 1:123456

Brichard19 refuse to further work at bitcrack

[Jean_Luc]

If you know a way with stride/variable increment/etc to solve #120 faster than kangaroo with bitcrak then you should write a tool that just compute pubkeys without hashing as you have it. It will be faster than bitcrack mods...

[WanderingPhilospher]

hi @BitCrack
Will you consider releasing a server-client version of bitcrack  ?

Yes, I have been working on it for a little while.

Great news 

don't forget to merge this https://github.com/brichard19/BitCrack/issues/256 if it is not already done.
And thanks a lot.

anyone have study bitcrack codes, and have commands in hand to modifiy/add/update some features
if yes, then these feature, work fast then kangaroo for find 120 puzzle, pls check and update us all community

--stride 1000:52000
where 1000 key check, and 52000 key bypass(no check)
--loop 500
count total keys of --keyspace * 500 = total keys
example 1 to 100 + 1 to 100 + 1 to 100
cuurent stride work only fixed like --stride 1:52000  or 1:123456

Brichard19 refuse to further work at bitcrack

I'm trying to follow what you are saying/wanting the program to do.

It checks 1000 keys, and then skips 52000 keys?
I didn't know the current stride function could be used as --stride1:52000; I only used --stride and a single number. But I do know the stride function is broken when you try to use it with the continue function. If you use a number higher than 9, say --stride 11 with --continue, it works first time around but changes the stride second time around. It doesn't parse/calculate numbers above 10(A) correctly.

[brainless]

hi @BitCrack
Will you consider releasing a server-client version of bitcrack  ?

Yes, I have been working on it for a little while.

Great news 

don't forget to merge this https://github.com/brichard19/BitCrack/issues/256 if it is not already done.
And thanks a lot.

anyone have study bitcrack codes, and have commands in hand to modifiy/add/update some features
if yes, then these feature, work fast then kangaroo for find 120 puzzle, pls check and update us all community

--stride 1000:52000
where 1000 key check, and 52000 key bypass(no check)
--loop 500
count total keys of --keyspace * 500 = total keys
example 1 to 100 + 1 to 100 + 1 to 100
cuurent stride work only fixed like --stride 1:52000  or 1:123456

Brichard19 refuse to further work at bitcrack

I'm trying to follow what you are saying/wanting the program to do.

It checks 1000 keys, and then skips 52000 keys?
I didn't know the current stride function could be used as --stride1:52000; I only used --stride and a single number. But I do know the stride function is broken when you try to use it with the continue function. If you use a number higher than 9, say --stride 11 with --continue, it works first time around but changes the stride second time around. It doesn't parse/calculate numbers above 10(A) correctly.

actual func is --stride 52000, 52000 define by user, its skip 52000 and check 1 key, as i think its fixed inside first key and next key,
in program by default only 1 is fixed for check, should be create func for check keys define by user
and loop function

i design reverse kangaroo inside bitcrack, mean i created pubkeys inside bit range, as per kangaroo jump
and checking and skips calculation will find solution in loop, in this senerio, no need highest rams, and hdd spaces, and no dead kangaroo, and by default save/continuous func save your work just 1 click

[WhyMe]

@JeanLuc @Zielar

If you fellas haven't started searching the 120 range for the #120 puzzle, don't start now. It's too late, me and my MOAP...the Mother of All Processors are running things and will find it.

Mind as well tweak VanitySearch and try for #64     

My MOAP is dropping bombs like a rolling thunder...

I wish you a luck

Tell me is there any option to use multiply GPU on BitCrack or Vanity because i have 1k Gpu idle

Interesting.
I'm working on a tool able to process one bitcrack instance per gpu. And multi hosts.
And I'm thinking about a pool system ...
But it's not the place for that here

[WanderingPhilospher]

hi @BitCrack
Will you consider releasing a server-client version of bitcrack  ?

Yes, I have been working on it for a little while.

Great news 

don't forget to merge this https://github.com/brichard19/BitCrack/issues/256 if it is not already done.
And thanks a lot.

anyone have study bitcrack codes, and have commands in hand to modifiy/add/update some features
if yes, then these feature, work fast then kangaroo for find 120 puzzle, pls check and update us all community

--stride 1000:52000
where 1000 key check, and 52000 key bypass(no check)
--loop 500
count total keys of --keyspace * 500 = total keys
example 1 to 100 + 1 to 100 + 1 to 100
cuurent stride work only fixed like --stride 1:52000  or 1:123456

Brichard19 refuse to further work at bitcrack

I'm trying to follow what you are saying/wanting the program to do.

It checks 1000 keys, and then skips 52000 keys?
I didn't know the current stride function could be used as --stride1:52000; I only used --stride and a single number. But I do know the stride function is broken when you try to use it with the continue function. If you use a number higher than 9, say --stride 11 with --continue, it works first time around but changes the stride second time around. It doesn't parse/calculate numbers above 10(A) correctly.

actual func is --stride 52000, 52000 define by user, its skip 52000 and check 1 key, as i think its fixed inside first key and next key,
in program by default only 1 is fixed for check, should be create func for check keys define by user
and loop function

i design reverse kangaroo inside bitcrack, mean i created pubkeys inside bit range, as per kangaroo jump
and checking and skips calculation will find solution in loop, in this senerio, no need highest rams, and hdd spaces, and no dead kangaroo, and by default save/continuous func save your work just 1 click

Sounds interesting...PM this info, may be able to implement in a psuedo way via python.

[WanderingPhilospher]

@JeanLuc @Zielar

If you fellas haven't started searching the 120 range for the #120 puzzle, don't start now. It's too late, me and my MOAP...the Mother of All Processors are running things and will find it.

Mind as well tweak VanitySearch and try for #64     

My MOAP is dropping bombs like a rolling thunder...

I wish you a luck

Tell me is there any option to use multiply GPU on BitCrack or Vanity because i have 1k Gpu idle

Interesting.
I'm working on a tool able to process one bitcrack instance per gpu. And multi hosts.
And I'm thinking about a pool system ...
But it's not the place for that here

Yeah I've been thinking their should be a topic of tweaks and tactics via the different tools available/used to attack puzzle challenge

[dextronomous]

hi @BitCrack
Will you consider releasing a server-client version of bitcrack  ?

Yes, I have been working on it for a little while.

brichard you'r app speaks for itself, no talks just run,

any news under the sun about updates or anything like that, server thing.
thanks

[Kpot87]

Hi all! Can anybody explain which different in range search between (ex 2^66) 20000000000000000...3ffffffffffffffff    and 20000000000000000...40000000000000000, in dec 3ffffffffffffffff it is 40000000000000000. Thx

[COBRAS]

Hi all! Can anybody explain which different in range search between (ex 2^66) 20000000000000000...3ffffffffffffffff    and 20000000000000000...40000000000000000, in dec 3ffffffffffffffff it is 40000000000000000. Thx

You foget firs argument - 200...4000... is from 20...to 40... and 3ff is from 3fff to 4000... start pont of range different 2... vs 3fff...

Think you think in right direction... this direction is bytes before start of a range. ))

[COBRAS]

Please, someone, share link for unpack kangaroo work saved files for human readable format ?

[WanderingPhilospher]

Please, someone, share link for unpack kangaroo work saved files for human readable format ?

https://github.com/PatatasFritas/FriedKangaroo/commit/1669df5f91ef2cc8a7619b21f66883fa164ab602

Or open with something like Sublime Text.  Just a bunch of hex numbers, x coord and distances.

[patatasfritas]

Please, someone, share link for unpack kangaroo work saved files for human readable format ?

Work export in python script
https://gist.github.com/PatatasFritas/a0409df4306fb1bb81f9a53e70151ddc

[MrFreeDragon]

Congratulations to Jean_Luc and zielar!
Very nice job!

Is it possible you share your combined DPs database for #115? (300Gb file as you said)

So, can you share your work files for #115?

[Radiant311]

Can someone please tell me what format this private key is in?

Kangaroo v2.1
Start:1000000000000000000000
Stop :1FFFFFFFFFFFFFFFFFFFFF
Keys :1
Number of CPU thread: 0
Range width: 2^84
Jump Avg distance: 2^42.03
Number of kangaroos: 2^23.32
Suggested DP: 16
Expected operations: 2^43.12
Expected RAM: 6347.6MB
DP size: 16 [0xFFFF000000000000]
GPU: GPU #1 Tesla V100-PCIE-16GB (80x64 cores) Grid(160x128) (207.0 MB used)
SolveKeyGPU Thread GPU#1: creating kangaroos...
GPU: GPU #2 Tesla V100-PCIE-16GB (80x64 cores) Grid(160x128) (207.0 MB used)
SolveKeyGPU Thread GPU#2: creating kangaroos...
GPU: GPU #0 Tesla V100-PCIE-16GB (80x64 cores) Grid(160x128) (207.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
GPU: GPU #3 Tesla V100-PCIE-16GB (80x64 cores) Grid(160x128) (207.0 MB used)
SolveKeyGPU Thread GPU#3: creating kangaroos...
SolveKeyGPU Thread GPU#1: 2^21.32 kangaroos [12.3s]
SolveKeyGPU Thread GPU#2: 2^21.32 kangaroos [12.3s]
SolveKeyGPU Thread GPU#3: 2^21.32 kangaroos [12.3s]
SolveKeyGPU Thread GPU#0: 2^21.32 kangaroos [12.4s]
[7828.45 MK/s][GPU 7828.45 MK/s][Count 2^43.22][Dead 2][24:56 (Avg 20:24)][4.8/6.9GB]
Key# 0 [1S]Pub:  0x0329C4574A4FD8C810B7E42A4B398882B381BCD85E40C6883712912D167C83E73A
       Priv: 0x11720C4F018D51B8CEBBA8

[MrFreeDragon]

Can someone please tell me what format this private key is in?
-snip-
Key# 0 [1S]Pub:  0x0329C4574A4FD8C810B7E42A4B398882B381BCD85E40C6883712912D167C83E73A
       Priv: 0x11720C4F018D51B8CEBBA8

It is in HEX.

Full hex value: 00000000000000000000000000000000000000000011720c4f018d51b8cebba8
WIF compres.: KwDiBf89QgGbjEhKnhXJuH7LrciVrZkCnRjpBspr8M5K8YnUtDNa