Pollard's kangaroo ECDLP solver

[COBRAS]

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)

And share please old files what was shred in this thread earlier ? I was try donload some day's ago but all links was dead. 


Please Please

[abadon666999]

The private key will be announced immediately after the last transaction on 1FoundByJLPKangaroo111Bht3rtyBav8 receives the first confirmation.
The last transactione have more 1 confirmation..what is the key?  please

[zielar]

Private key for #115 has been found on DP 2^33.363 using DP25:

0000000000000000000000000000000000060f4d11574f5deee49961d9609ac6

It can be solved after ~14 days thanks working with Jean_Luc_Pons and his Kangaroo.
Many thanks!

[Kpot87]

Hi have anybody checked where in the range was located price key?? 110 and 115 bit? Tnx

[WanderingPhilospher]

-snip-
For one by one bitcrack could work too. Even peoples created group pool for find 64. Like client server sharing

A couple of days ago, I decided to leave the kangaroo alone, because it is impossible to compete with Zielar.
 I think, well, I’ll try to solve the 64 puzzle with the help of a BitCrack.
Wrote a server, wrote a client so that more than one could decide .. 
And here it turns out that Zielar also decided to let the dogs down on him..

Of course, no one can forbid him to do anything, but can leave alone at least 64 and 66 for weak players?

Can you share client/server program?

[Etar]

-snip-
Can you share client/server program?

My programm is not so good as used at pool.
They have it more thought out. There, for example, the client is looking for not only the key to the puzzle but also other addresses, this is done so that it is impossible to fake the work.
My program is simpler and it’s very easy to fake the work sent to the server. Therefore, I do not think it makes sense to spread it.
i devide range to a 2^20 intervals and in random way distribute it to clients. Each interval 2^43 calculated in 2.5h at 1x2080ti

[Konstanting2]

Please help me with the program. My posts are higher ...

[COBRAS]

Please help me with the program. My posts are higher ...

USE PM For your qeschion !!!

[Konstanting2]

USE PM For your qeschion !!! I tried to read it, but after that the program did not start. If you can throw off in the form of examples, lay out the work of the program. Indeed, if a person with a development of 14 years does not study, then he will remain 14 years old. After all, you all know share your knowledge.
 Windows 7, Win64.
C \ windows \ system32 \ cmd.exe
C: \ USERS \ GAM> "D: BTC \ Kangaroo.exe" Nothing happens.
If I immediately start Kangaroo.exe, the Windows 7 Command Prompt (CMD) appears and closes immediately. How to make the program work? Javascript: void (0);

Do this so you know it works on your machine / rig:

copy the below text, paste in notepad, and save it as a .bat file. Save it as kangarootest.bat

if you only have CPU
Code:
Kangaroo.exe -t 4 -d 14 -w 65save -wi 30 65.txt

pause

if you have GPU:
Code:
Kangaroo.exe -t 0 -d 14 -gpu -gpuId 0 -w 65save -wi 30 65.txt

Again, copy and paste that into a text document and save as kangarootest.bat

Now, copy the below text and save it as 65.txt
Code:
10000000000000000
1FFFFFFFFFFFFFFFF
0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

make sure each line is it's own line ... a total of 3 lines. Save it as 65.txt

Now, place the kangarootest.bat file, the 65.txt file, and the Kangaroo.exe file all in the same folder.
Double click or select the kangarootest.bat file and the program will start.
It may tell you that you do not have a certain file called, "vcruntime140_1". If that's the case, Google that file, download it and place it in the same folder as the other files. Now, double click, select the kangarootest.bat file and it should work.

Let us know.
Thank you very much for the help. After I received a reply in the file 65save.txt
In three minutes I received just such an answer, and then please help.

65save.txt
20D0900 | 78 C9 C8 0A 68 33 DF 16 81 56 23 A6 92 E5 95 B3 13 C0 67 7C 00 00 00 00 00 00 00 40 00 00 00 00
20D0920 | 00 00 00 00

help

[WanderingPhilospher]

-snip-
Can you share client/server program?

My programm is not so good as used at pool.
They have it more thought out. There, for example, the client is looking for not only the key to the puzzle but also other addresses, this is done so that it is impossible to fake the work.
My program is simpler and it’s very easy to fake the work sent to the server. Therefore, I do not think it makes sense to spread it.
i devide range to a 2^20 intervals and in random way distribute it to clients. Each interval 2^43 calculated in 2.5h at 1x2080ti

Yeah, I just wanted something where I had a central server that distributes work to clients and keeps track of ranges checked. Nothing fancy. Not for pooling with others so I wouldn't care about fake work, it would just be me. Just need way to keep track of ranges checked among all workers. And a way to set the intervals/ranges to assign to clients (like you did with 2^20)

[Etar]

-snip-
Yeah, I just wanted something where I had a central server that distributes work to clients and keeps track of ranges checked. Nothing fancy. Not for pooling with others so I wouldn't care about fake work, it would just be me. Just need way to keep track of ranges checked among all workers. And a way to set the intervals/ranges to assign to clients (like you did with 2^20)

@JeanLuc sorry about little offtop in your thread..
@WanderingPhilospher Here is server/client (source and compiled version) for bitcrack, you also need put cu or cl version of Bitcrack.exe to client folder https://drive.google.com/file/d/1pFTvBLwTDF4GZCyDpJHwnWqfuNeOT6Ik
before using app in big range made few test in small interval to make shure that you correct understand params.(-dp 3 means that the entire range will be divided into 2^3=8 subranges)

[WanderingPhilospher]

-snip-
Yeah, I just wanted something where I had a central server that distributes work to clients and keeps track of ranges checked. Nothing fancy. Not for pooling with others so I wouldn't care about fake work, it would just be me. Just need way to keep track of ranges checked among all workers. And a way to set the intervals/ranges to assign to clients (like you did with 2^20)

@JeanLuc sorry about little offtop in your thread..
@WanderingPhilospher Here is server/client (source and compiled version) for bitcrack, you also need put cu or cl version of Bitcrack.exe to client folder https://drive.google.com/file/d/1pFTvBLwTDF4GZCyDpJHwnWqfuNeOT6Ik
before using app in big range made few test in small interval to make shure that you correct understand params.

Jean Luc, yes sorry, for off topic. Etar - many thanks to you. Will test now!

[WanderingPhilospher]

65save.txt
20D0900 | 78 C9 C8 0A 68 33 DF 16 81 56 23 A6 92 E5 95 B3 13 C0 67 7C 00 00 00 00 00 00 00 40 00 00 00 00
20D0920 | 00 00 00 00

help

The 65save.txt is where the kangaroo x and jump distances are located. Nothing really to do with the file. The program uses it to keep track of what your machine has done so far and if a good collision occurs, it will solve the problem you are working on. If you are using -wsplit option you will have to merge the files to check for collision unless collision happens in newer smaller reset hashtable.

[Kpot87]

@Etar thanks

[WanderingPhilospher]

@JeanLuc sorry about little offtop in your thread..
@WanderingPhilospher Here is server/client (source and compiled version) for bitcrack, you also need put cu or cl version of Bitcrack.exe to client folder https://drive.google.com/file/d/1pFTvBLwTDF4GZCyDpJHwnWqfuNeOT6Ik
before using app in big range made few test in small interval to make shure that you correct understand params.(-dp 3 means that the entire range will be divided into 2^3=8 subranges)
[/quote]
@Etar open up PMs please.

[patatasfritas]

Congratulations to Jean_Luc and zielar!

I have been thinking for several days about removing the hashtables from the joining process, and when I finally finish it I find that it had already been implemented by JeanLuc

Now I have applied the same method to join several files in one process, reducing the total time quite a bit.
My approach is to read all the files in the directory at the same time in HASH_ENTRY loop.

Although my code works, it is still in testing and it is possible that it has some bug.


https://github.com/PatatasFritas/FriedKangaroo/blob/merge/Merge.cpp

[WanderingPhilospher]

Congratulations to Jean_Luc and zielar!

I have been thinking for several days about removing the hashtables from the joining process, and when I finally finish it I find that it had already been implemented by JeanLuc

Now I have applied the same method to join several files in one process, reducing the total time quite a bit.
My approach is to read all the files in the directory at the same time in HASH_ENTRY loop.

Although my code works, it is still in testing and it is possible that it has some bug.


https://github.com/PatatasFritas/FriedKangaroo/blob/merge/Merge.cpp

If you or someone who can program can work on sending hashtable to textfiles (like your export option configuration) then there would be no need for save files and merging, etc. If you give user option to export tame and wild files with any amount they wish (example 20 tame and 20 wild files), then no merging or saving. Just compare the different tame and wild files for a collision/solution. This also eliminates any RAM issues.

[yiren38]

I have a question, P = kG, k is in the range of [k1, k2], I am now solving for a public key, but I don’t know the range of [k1, k2], how should I use the kangaroo.exe program, or can I explain how Estimate the range of [k1, k2]?

[WanderingPhilospher]

I have a question, P = kG, k is in the range of [k1, k2], I am now solving for a public key, but I don’t know the range of [k1, k2], how should I use the kangaroo.exe program, or can I explain how Estimate the range of [k1, k2]?

There is no way to estimate the range. You would have to search range from 000000000000....1 to FFFFFFFFFFF...F (1 to 256)  which would be a really long time.

[yiren38]

I have a question, P = kG, k is in the range of [k1, k2], I am now solving for a public key, but I don’t know the range of [k1, k2], how should I use the kangaroo.exe program, or can I explain how Estimate the range of [k1, k2]?

There is no way to estimate the range. You would have to search range from 000000000000....1 to FFFFFFFFFFF...F (1 to 256)  which would be a really long time.

Is there any way to get other information from the public key, such as X coordinate?