We unite you to solve
large scale SAT problems

User of the day

Profile greeed3x
im just a retard from Russia and 18yo enough


4 years anniversary of SAT@home!
October 1, 2015, 9:57 UTC
SAT@home was launched 4 years ago. During this period a lot of results were obtained in it. We wish to thank all crunchers for their resources and feedback!

SAT@home был запущен 4 года назад. За это время в проекте было получено много результатов. Мы хотим поблагодарить всех кранчеров за предоставленные ресурсы и обратную связь!

Reports about SAT@home on the PaCT'2015 and BOINC:FAST'2015 conferences
Septepmber 26, 2015, 3:58 UTC
Report about searching decompoisitions for solving hard SAT instances in SAT@home was presented on the 13th international conference on Parallel Computing Technologies (PaCT'2015). Also 3 reports were presented on the conference BOINC: Fundamental & Applied Science & Technology (BOINC:FAST 2015). The 1st one was devoted to searching of systems of Latin squares in SAT@home, in the 2nd solving weakened cryptanalysis problems of the Bivium cipher in SAT@home was considered, and in the 3rd one new version of CluBORun - a tool for utilizing idle resources of computing clusters in the BOINC-based volunteer computing projects, - was presented.

Доклад про поиск декомпозиций для решения в SAT@home трудных экземпляров SAT-задач был представлен на коференции 13th international conference on Parallel Computing Technologies (PaCT'2015). Также 3 доклада были сделаны на коференции BOINC: Fundamental & Applied Science & Technology (BOINC:FAST 2015). Первый из них был посвящен поиску систем латинских квадратов в SAT@home, во втором докладе было рассмотрено решение ослабленных задач криптоанализа в SAT@home, а в третьем докладе была предсвтавелна новая версия CluBORun - программного средства для использования простаивающих ресурсов вычислительных кластеров в проектах добровольных вычислений, основанных на BOINC.

New peak of performance!
July 1, 2015, 9:24 UTC
New peak of the project performance (10,16 TFLOPs) was obtained! Thanks to all our crunchers! Special thanks to the mega-crunchers Alejandro V. Mena, Endurance, Grandpa, damotbe and [SG-FC] hl. Also thanks to the top-5 teams (by RAC during the period where the peak was obtained): Crystal Dream, L'Alliance Francophone, Russia Team, MENA_COMP_DIE_FI_UNAM, [H]ard|OCP.

Был получен новый рекорд производительности (10,16 TFLOPs)! Спасибо всем нашим кранчерам! Персональное спасибо мега-кранчерам Alejandro V. Mena, Endurance, Grandpa, damotbe и [SG-FC] hl. Также спасибо топ-5 команд (по RAC в течение получения рекорда): Crystal Dream, L'Alliance Francophone, Russia Team, MENA_COMP_DIE_FI_UNAM, [H]ard|OCP.

5 new solutions
July 1, 2015, 9:10 UTC
5 new solutions were found by hawker from Russia, Endurance from Crystal Dream, fzs600 from L'Alliance Francophone, jan, Grandpa from [H]ard|OCP, Ungelovende from Team Norway, Andrey Fesenko (anfes) from Russia, [AF>EDLS]zOU from L'Alliance Francophone

5 новых решений нашли: hawker из Russia, Endurance из Crystal Dream, fzs600 из L'Alliance Francophone, jan, Grandpa из [H]ard|OCP, Ungelovende из Team Norway, Andrey Fesenko (anfes) из Russia, [AF>EDLS]zOU из L'Alliance Francophone

New experiment. New solution.
April 24, 2015, 7:58 UTC
Epxeriment aimed at searching for new pairs of orthogonal diagonal Latin squares of order 10 was started. One such pair was already found by Andrey Fesenko (anfes) from Russia and Mumps [MM] from SETI.USA

Запущен эксперимент по поиску новых пар ортогональных диагональных латинских квадратов порядка 10. Одну такую пару уже нашли Andrey Fesenko (anfes) из Russia и Mumps [MM] из SETI.USA.


News is available as an RSS feed RSS.

Copyright © 2016 Institute for System Dynamics and Control Theory of SB RAS and Institute for Information Transmission Problems of RAS