Hello Tomáš Brada!

I suggest you resume the BOINC project SPT.

To start, I propose a new algorithm that was developed by me.
The algorithm was tested in the BOINC project Gerasim@Home.
Testing was successful.

See topics
https://boinc.progger.info/odlk/forum_thread.php?id=247
https://boinc.ru/forum/topic/vychisleniya-v-ruchnom-rezhime/
https://boinc.termit.me/adsl/forum_thread.php?id=50

PS. I invite everyone to start a new BOINC project!
Please write to me at natalimak1@yandex.ru

HI,

What processes this project?

Hello!

I'm developing new algorithms for finding tuples.
These are different original algorithms.
I recently developed another new algorithm.

Please see topic
https://boinc.progger.info/odlk/forum_thread.php?id=290

I want to start a new BOINC project with my new algorithm.
Please help me with this!

Hello Tomáš Brada!

Are you rested? :)

Please start a new subproject.
This is a very interesting algorithm.

Please see topic
https://boinc.progger.info/odlk/forum_thread.php?id=290

Answer, please.
I really need help!

Thank you for making the results database available!
Many people use the results.

In the BOINC project SPT
https://boinc.termit.me/adsl/
there is progress.

Found symmetrical 19-tuples

6919940122097246303: 0 48 78 138 198 204 210 264 288 294 300 324 378 384 390 450 510 540 588
7325015925425379457: 0 6 30 90 126 132 150 162 216 246 276 330 342 360 366 402 462 486 492
9218260110780722411: 0 18 102 120 132 222 252 258 270 300 330 342 348 378 468 480 498 582 600

https://boinc.termit.me/adsl/tuples.php?spt=19&p=1&ln

Now we solve the problem for 19-tuple with a minimum diameter of 252.
Need to find a tuple

X: 0, 6, 12, 30, 42, 72, 90, 96, 120, 126, 132, 156, 162, 180, 210, 222, 240, 246, 252

where the numbers
X, X+6, X+12, X+30, X+42, X+72, X+90, X+96, X+120, X+126, X+132, X+156, X+162, X+180, X+210, X+222, X+240, X+246, X+252
are sequential prime numbers.

For 9 years such a tuple has not been found!

Tomáš Brada
your subproject can solve this problem.

Let's try!