First: you did not publish all the code.
Second: it is impossible to run your code.
Third: you don’t show the video.

The discussion is over

Быстро скатились на русский.
Сколько ты готов заплатить за алгоритм быстрее того, который у тебя?

On the video there is testing the algorithm in single-threaded python execution mode. What else is needed?
I made a multi-threaded and economical memory option, and I sell it. It can still be improved, but I do not have time.

No. Python is very slow. I wrote that I was selling an algorithm
I don’t have time to do development and I need money right now.

So I am the author of the script and algorithm. I need money now, so I want to sell the algorithm and its implementation for python.

The algorithm is important. My algorithm allows me to search faster than Pollard-Ro. In general, I sell an algorithm

Selling search script for $ 1000

https://bitcointalk.org/index.php?topic=5218972.msg53781868#msg53781868

Thanks for pointing to the github. I learned a lot from Telariust code.
Now I’ve modified the algorithm (I’ll write the whole algorithm here soon) in terms of performing operations specific to python and productivity has increased by 14%. And this is only single-threaded execution.
I also have a multithreaded part ready.
I still can not lay out a single-threaded code, because it is not optimized by memory. Soon

I do not plan to publish the code yet, but as the important parts are transferred to another language, I will publish the entire algorithm in this thread.

This is the release date of Python 3.7.5 )

I am now modifying the code for execution in multiple threads. After that I’ll try to run 110 bit in a cloud server to find a solution.
I don’t think you would show anyone such code

My link to the latest post from 57fe. My algorithm is based on a different math. And he is faster

I have a search algorithm that is several times faster than the @57fe https://bitcointalk.org/index.php?topic=5166284.msg52582231#msg52582231 algorithm in single-threaded mode. According to my calculations, in skilled hands, you can keep within a month on a good server in the cloud to calculate 110 tasks. Server costs will reduce the reward by about half. This is more interesting than simple mining.
The algorithm can only be shifted to FPGA. Modular arithmetic does not imply the use of ASIC.

If there are interested people, I can post the evidence in the video.

Python does not assume that code is closed when used by other people, so I can not publish the source code, and the prototype algorithm is implemented in python.

Sorry for my English, but I'm not a native speaker of this language

What do you want to know? Z values for known private keys in this transaction?
I have them.

Все, разобрался сам. Ничего не надо собирать для винды.
В Windows 10 в WSL с Убунтой прекрасно запускается демон линусковый и к нему даже можно обращаться из винды по rpc.
Вопрос снимается)

Надо клиента собрать. До того большого блока, на котором сейчас стопорится синхронизация было немного.

Профит есть. Тема из топика никуда не делась. А вот топикстартер улетучился(

Привет. Куда пропал? Давай соберем клиента SV для винды, а то старый не хочет блоки принимать. Там как я понял блоки большие появились.

Факторизацию числа делает любой ленивый с помощью компьютера. Функция divmod в любом языке программирования дает идентичный результат. Другое дело EC шифрование и связанное с ним.
Согласен, что знание публичного ключа существенно увеличивает шансы стырить приватный, но они все еще призрачные (в сравнении с количеством значений). Однако, факторизация заранее неизвестного целого числа это задача, у которой нет решения в принципе.