Hello,
I would like to present an interval ECDLP solver based on the Pollard's kangaroo method.
This program is fully open source and available on GitHub: https://github.com/JeanLucPons/Kangaroo
It has GPU support (CUDA Only) and works on both Linux and Windows.
This program is currently under development.
Thanks to test it and to share ideas of improvements here
I would like to present an interval ECDLP solver based on the Pollard's kangaroo method.
This program is fully open source and available on GitHub: https://github.com/JeanLucPons/Kangaroo
It has GPU support (CUDA Only) and works on both Linux and Windows.
This program is currently under development.
Thanks to test it and to share ideas of improvements here
NICE WORK!!!
As the complexity of the design itself is already surprisingly large - please indicate the best code configuration to achieve results in terms of # 110 puzzle address. The start-up mode will take place inside the network using a dozen or so Tesla V100 machines, but with the use of a built-in server function. I made changes to the code in this form:
Constans.h file:
- Change NB_JUMP to value 64
- Change CLIENT_TIMEOUT to value 36000.0
Will these values be appropriate for this mode of operation, given that there will be ten of the same clients connected to one server?
What is the optimal "-d" value for this mode of operation?
Is this configuration correct?:
----SERVER----
kangaro.exe -w save.work -wi 300 -d 28 -s input.txt
----CLIENT----
kangaro.exe -nt 0 -t 0 -gpu -gpuId 0,1,2,3 -g 640,256,640,256,640,256,640,256 -c {MYserverIP} input.txt
Many thanks