Our BOINC project has launched a new Application "Calc15Tuples".

The Application uses a very interesting algorithm developed by me.
We know the exact number of tasks, so theoretically the search can be completed completely.
Almost everything depends on the execution time.

In the Application, we search for the central 15-tuplets and their approximations, as well as the central 9-tuplets, 11-tuplets and 13-tuplets.

The search is performed in the range
[2079914861571286679, 117288381359406970983270).

The first Application "Calculate Tuples" will be stopped to save resources for the new Application.

You can see the results of the new Application here
https://boinc.mak.termit.me:5000/algo_15/

You can also copy the results.

---

The TBEG BOINC project maintains the database
https://boinc.tbrada.eu/spt/explore.php

Please look at the topic

https://boinc.progger.info/odlk/forum_thread.php?id=323

---

The TBEG BOINC project maintains the database
https://boinc.tbrada.eu/spt/explore.php

Hello!

There were some difficulties loading the tasks for Application 4 ("Calc15Tuples").
Loading is temporarily suspended.

The algorithm of Application 4 has a finite number of tasks: 1312030720.
termit has generated 41000960 tasks so far, which is 1/32 of all tasks.

Application 4 has already produced very good results.
The new algorithm is effective.
This is an interesting and important search!

------

Dear project participants!

Does anyone have access to a cluster or supercomputer?
I understand that this is not free.
Unfortunately, I cannot pay.
But I will announce a collection of donations for the project.
I think that someone will want to help us.

Please write me a PM if you want to try to perform this interesting search on a cluster or supercomputer.
Please give an approximate price.

---

The TBEG BOINC project maintains the database
https://boinc.tbrada.eu/spt/explore.php