News archive


August 8, 2016, 14:42 UTC
24 new pairs of MODLS of order 10 were found in the current experiment (# 34-56 in the list of solutions found).

24 новые пары ОДЛК порядка 10 были найдены в текущем эксперименте (№ 34-56 в списке найденных решений).


March 12, 2016, 8:58 UTC
New record of the project performance (15,6 TFLOPs) was obtained during the last competition! Thanks to all our crunchers!

В течение последнего соревнования был достигнут новый рекорд производительности (15,6 терафлопс). Спасибо всем нашим кранчерам!


March 9, 2016, 14:42 UTC
33rd pair of ODLS of order 10 was found in the current experiment (by Mixa from Russia Team and Reiner Weber). It's also the 50th pair in the project - 17 pairs were found in 2012-2013.

В текущем эксперименте найдена 33-я пара ОДЛК порядка 10 (Mixa из Russia team и Reiner Weber). Также это 50-ая пара, найденная в проекте - 17 пар были найдены в 2012-2013 гг.


March 3, 2016, 12:58 UTC
New expetiment was launched. Now to search for pairs of ODLS of order 10 we vary values of the main and secondary diagonals of the first DLS from a pair.

Запущен новый эксперимент. Теперь варьируются элементы главной и побочной диагоналей первого ДЛК из искомой пары ОДЛК порядка 10.


March 1, 2016, 8:18 UTC
Work generator is suspended for about a week. New type of an experiment is comping soon.

Генератор заданий приостановлен примерно на неделю. Готовится новый вид эксперимента.


February 29, 2016, 12:15 UTC
During discussion of goals and results of SAT@home the idea of new approach to search for diagonal Latin squares (DLS) and orthogonal systems based on them has appeared. As a result of an additional investigation several new pairs of othogonal diagonal Latin squares (ODLS) of order 10 were found. In particular, a DLS of order 10 with exactly 6 orthogonal mates was found. Based on this DLS a record pseudotiple was constructed. In the pseudotriple DLS A is completelty orthogonal to B and C, while DLS B and C are orthogonal in 68 out of 100 ordered pairs of elements.

При обсуждении целей и результатов проекта SAT@home возникла идея применить новый подход к поиску диагональных латинских квадратов (ДЛК) и ортогональных систем, построенных на их основе. В ходе дополнительного исследлования получены новые пары ортогональных диагональных латинских квадратов (ОДЛК) порядка 10. В частности, найден ДЛК порядка 10, на основе которого были построены 6 пар ОДЛК. На основе этого ДЛК также была построена рекордная псевдотройка. В этой псевдотройке ДЛК A ортогонален B и C, а ДЛК B и C ортогональны по 68 упорядоченным парам элементов из 100 возможных. Подробности будут выложены после полной обработки и проверки полученных данных.


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 года назад. За это время в проекте было получено много результатов. Мы хотим поблагодарить всех кранчеров за предоставленные ресурсы и обратную связь!


February 14, 2016, 10:50 UTC
Competition SAT@home february challenge will be held from February 17, 2016 to February 24, 2016

Соревнование SAT@home february challenge будет проведено с 17 по 24 февраля 2016 года.


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 года назад. За это время в проекте было получено много результатов. Мы хотим поблагодарить всех кранчеров за предоставленные ресурсы и обратную связь!


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.


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.


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


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.


March 27, 2014, 6:56 UTC
In the current experiment all WUs were generated. About 10 day there will be no new WUs, then a new experiment (aimed at searching for new systems of Latin squares) will be started.

В текущем эксперименте были сгенерированы все WU. Примерно 10 дней новых WU не будет, а потом будет запущен новый эксперимент по поиску систем латинских квадратов.


March 6, 2014, 9:20 UTC
The server was restored after crash. The reason of the crash was the lack of a disk space (due to large log files). As a result some workunits were created incorrectly. Such workunits were cancelled. If processing of any workunit does not take any CPU resources, please abort it manually. I am sorry for these troubles. Besides all we moved all log files to separate disk partition, so such crashes should not occur in the future.

Сервер проекта восстановлен после сбоя. Причиной был недостаток дискового пространства (вызванный большими размерами файлов с логами). В результате некоторые задания были созданные некорректно. Эти задания были отменены. Если обработка некоторого задания не занимает ресурсы процессора, пожалуйста прервите эту обработку вручную. Извиняюсь за беспокойство. Кроме всего прочего, мы переместили все файлы с логами в отдельный дисковый раздел, поэтому подобные сбои больше не должны повториться.


January 30, 2014, 15:50 UTC
Competition Bivium must collapse will be held from February 1 2015 to February 8 2015.

Соревнование Bivium must collapse будет проведено с 1 по 8 февраля 2015 года.


January 15, 2014, 8:28 UTC
In the current experiment value of fixed credits was increased from 84 to 94.

В текущем эксперименте количество выдаваемых фиксированных кредитов было увеличено с 84 до 94.


January 8, 2014, 16:04 UTC
New experiment aimed at solving non-weakened cryptanalysis problem for the Bivium cipher was started. WUs are simpler than ones in previous experiment, so 84 credits are granted for every WU (instead of 130 credits).

Новый эксперимент по неослабленному криптоанализу шифра Bivium был запущен. WU в новом эксперименте проще, чем в предыдущем, поэтому за каждый WU выдаются 84 кредита (вместо 130).


January 8, 2015, 15:59 UTC
5 instances (Bivium9_0, Bivium9_1, Bivium9_2, Bivium9_3, Bivium9_4) were solved by:
5 задач (Bivium9_0, Bivium9_1, Bivium9_2, Bivium9_3, Bivium9_4) были решены:
KySU / Crystal Spirit from Crystal Dream
Ralfy from BOINC Synergy / Crystal Spirit from Crystal Dream
NotANumber / Crystal Spirit from Crystal Dream
DooKey from [H]ard|OCP / Crystal Spirit from Crystal Dream
Endurance from Crystal Dream / Crystal Spirit from Crystal Dream


December 17, 2014, 8:53 UTC
Server of the project was offline for 3 days because of hardware problems. Recently these problems were fixed.

Сервер проекта был недоступен 3 дня из-за проблем с аппартаным обеспечением. К настоящему моменту проблемы были решены.


December 12, 2014, 13:14 UTC
Fixed credit system was launched. In the current experiment 130 credits are granted for each WU.

Запущена система с фиксированными кредитами. В текущем эксперименте за каждый WU выдается 130 кредитов.


Nobember 21, 2014, 4:40 UTC
Paper Alexander Semenov, Oleg Zaikin and Ilya Otpuschennikov. Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks. arXiv:1411.5433 [cs.DC] was published on arxiv.

Статья Alexander Semenov, Oleg Zaikin and Ilya Otpuschennikov. Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks. arXiv:1411.5433 [cs.DC] была опубликована на arxiv.


November 7, 2014, 5:52 UTC
Russia Team decided to help SAT@home by creating powerful team PC. Crawdfunding project was created for this purpose.

Команда Russia Team решила поддержать SAT@home путем создания мощного вычислительного командного компьютера. С этой целью создан краудфандинговый проект для сбора средств.


October 23, 2014, 6:06 UTC
Competition SAT@home. Three years with the project. will be held from November 3 2014 to November 10 2014.

Соревнование SAT@home. Три года с проектом. будет проведено с 3 по 10 ноября 2014 года.


October 14, 2014, 6:12 UTC
Выпущено приложение pdsat_crypto версии 2.02. Ускорен процесс решения на задачах криптоанализа Bivium примерно на 15 %.

Version 2.02 of the application pdsat_crypto released. Performance on Bivium problem was increased by about 15%.


September 29, 2014, 14:12 UTC
Instance a5_1_114_5 solved by toest from TSC! Russia, Winer from BOINC RUSSIA

Instance a5_1_114_6 solved by Lavoler from Russia Team, ChertseyAl

Instance a5_1_114_7 solved by Crystal Spirit from Crystal dream, mi5rys from Crystal Dream

Instance a5_1_114_8 solved by morgan from Team Norway, Igo Centrical from Russia Team

Instance a5_1_114_9 solved by Shurale from Astronomy.Ru forum, Shaman from Czech National Team

Instance a5_1_114_10 solved by Grey from Russia, Mixa from Russia Team, Владимир from TSC! Russia, plumbum from Russia Team.


July 27, 2014, 4:50 UTC
Instance a5_1_114_1 solved by Crystal Spirit from Crystal Dream, Stanley A Bourdon from BOINC Synergy.

Instance a5_1_114_2 solved by Phil Klassen from Canada, evatutin from kvt.kurskstu.

Instance a5_1_114_3 solved by NotANumber, Oleg Zaikin [SAT@home] from Crystal Dream.

Instance a5_1_114_4 solved by toest from TSC! Russia, Winer from BOINC RUSSIA.


July 7, 2014, 12:30 UTC
Competition Bienvenido, amigos! will be held from July 12 2014 to July 17 2014.

Соревнование Bienvenido, amigos! будет проведено с 12 по 17 июля 2014 года.


June 9, 2014, 9:38 UTC
Instance a5_1_114_0 solved by [AF>Libristes] Pascal from L'Alliance Francophone and Ralfy from BOINC Synergy.


May 26, 2014, 5:59 UTC
Instance Bivium10_2 solved by http://vk.com/boinc from Colombia and alnb from Russia Team.


May 11, 2014, 8:51 UTC
Problem Bivium10_1 was solved by Pavel_Kirpichenko and Crystal Spirit.

Задача Bivium10_1 была решена Pavel_Kirpichenko и Crystal Spirit


April 10, 2014, 8:09 UTC
Problem Bivium10_0 was solved by mi5rys and Alexandr Burnashev.

Задача Bivium10_0 была решена mi5rys и Alexandr Burnashev


March 25, 2014, 6:33 UTC
Competition Bivium cipher can not stand will be held from April 1 to April 8.

Соревнование Bivium cipher can not stand будет проведено с 1 по 8 апреля.


March 25, 2014, 6:29 UTC
Problem Bivium14_0 was solved by madx and kunzea.

Задача Bivium14_0 была решена madx и kunzea


March 17, 2014, 9:03 UTC
Problem Bivium14_1 was solved by Crystal Spirit and Shaman.

Задача Bivium14_1 была решена Crystal Spirit и Shaman


February 24, 2014, 5:56 UTC
First result in the current experiment was obtained by Retupmoc and dimawalker.

Первые результаты текущего эксперимента были получены Retupmoc и dimawalker


February 11, 2014, 10:32 UTC
Experiment aimed at solving weakened cryptanalysis problems for Bivium cipher was launched.

Запущен эксперимент, направленный на решение ослабленных задач криптоанализа шифра Bivium.


January 29, 2014, 9:59 UTC
In the current experiment all workunits were generated. New experiment is coming soon. One's goal is to analyze cryptographic cipher Bivium.

В текущем эксперименте сгенерированы все задания. Скоро будет запущен новый эксперимент. Его цель - анализ криптографического шифра Bivium.


January 23, 2014, 9:45 UTC
Status of the project was changed from alpha to beta.

Статус проекта был изменен с alpha на beta.


November 11, 2013, 7:25 UTC
Source code of client and server software was published on github.

Исходный код клиентского и серверного ПО был выложен на github.


October 20, 2013, 4:54 UTC
Результаты текущего эксперимента выложены в разделе Найденные решения.

Results of the current experiment were posted in the section Solutions.


October 18, 2013, 4:25 UTC
Выпущено приложение версии 3.18. В нем используется новая кодировка условия 'минимум 72 ортогональные ячейки между 2-ым и 3-им квадратами в искомой тройке'. Использование оперативной памяти сокращено примерно на 15 %.

Version 3.18 of the application released. It uses a new variant of encoding of condition 'at least 72 orthogonal cells between 2nd and 3rd squares of the triple'. RAM usage reduced by about 15 %.


October 18, 2013, 4:10 UTC
На конференции BOINC:FAST, прошедшей в Петрозаводске с 9 по 13 сентября 2013 года, были представлены 3 доклада, посвященные SAT@home: про поиск латинских квадратов, про разработку и использование средства CluBORun и про разработку приложения для GPU. Тексты статей и видео докладов доступны на сайте конференции.

3 reports about SAT@home were presented on the conference BOINC:FAST which was held on 9-13 September in Petrozavodsk (Russia). Reports were focused on searching for Latin squares, develompent and using of tool CluBORun and develompent of application for GPU. Texts of the articles and video of the reports were published on site of the conference


September 19, 2013, 14:56 UTC
Выпущено приложение версии 3.17. В нем добавлено новое условие для текущей задачи - 'минимум 72 ортогональные ячейки между 2-ым и 3-им квадратами в искомой тройке'.

Version 3.17 of the application released. New condition 'at least 72 orthogonal cells between 2nd and 3rd squares of the triple' was added for the current problem.


September 15, 2013, 11:16 UTC
During the challenge On halfway. Part 2, organized by Astronomy.Ru Forum team, new maximum of performance was obtained, amounting 7423 GFLOPs!

Во время соревнования On halfway. Part 2, организованного командой Astronomy.Ru Forum, был достигнут новый рекорд производительности, составивший 7423 GFLOPs!


August 27, 2013, 16:46 UTC
Last 74 WUs from experiment 'Pairs of orthogonal diagonal latin squares of order 10' were processed.

Последние 74 WU из эксперимента 'Pairs of orthogonal diagonal latin squares of order 10' были обработаны.


August 23, 2013, 5:15 UTC
4 new pairs of diagonal orthogonal Latin squares of order 10 were found by:

В текущем эксперименте 4 новые пары диагональных ортогональных латинских квадратов порядка 10 были найдены следующими участниками:

dimawalker
tanos from Astronomy.Ru Forum
Alex from St.Petersburg
DrPop [BlackOps] from SETI.USA
Koof from Russia Team
steve
keta
RoSMag from TSC! Russia


August 14, 2013, 9:18 UTC
Paper Alexander Semenov and Oleg Zaikin. On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project. arXiv:1308.0761 [cs.AI] was published on arxiv.

Статья Alexander Semenov and Oleg Zaikin. On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project. arXiv:1308.0761 [cs.AI] была выложена на arxiv.


August 3, 2013, 14:22 UTC
In version 3.15 there was a bug that led to calculations with 0 % of CPU usage and with no checkpointing. Bug was fixed in 3.16. Please abort tasks obtained for 3.15 and you will get correct ones for 3.16.

В версии 3.15 была ошибка, приводящая к загрузке CPU на 0 % и отстутствию выставления контрольных точек. Ошибка была исправлена в версии 3.16. Пожалуйста прервите задания, полученные для версии 3.15 и Вы получите правильные задания для версии 3.16.


August 2, 2013, 3:32 UTC
In new version 3.15 encoding of the current problem via SAT was modified again.

В новой версии 3.15 снова модифицировано кодирование текущей задачи в виде SAT задачи.


July 18, 2013, 17:11 UTC
In new version 3.14 encoding of the current problem via SAT was modified.

В новой версии 3.14 модифицировано кодирование текущей задачи в виде SAT задачи.


July 15, 2013, 13:05 UTC
During the challenge new maximum of performance 7040 GFLOPs was obtained!

Во время соревнования был достигнут новый максимум производительности, составивший 7040 GFLOPs!


July 8, 2013, 16:22 UTC
Poster about estimating time to solve problems in the SAT@home project will be present at SAT-2013 conference on July 12.

Постер, посвященный оценке времени решения задач в SAT@home будет представлен на конференции SAT-2013 12-го июля.


July 8, 2013, 10:55 UTC
12 teams are participating in the competition Sat@home: new task, new 64-bit application that was launched in boincstats.com today.

12 команд принимают участие в соревновании Sat@home: new task, new 64-bit application, стартовавшем сегодня на boincstats.com.


July 3, 2013, 7:43 UTC





June 28, 2013, 9:44 UTC
Добавлен прогресс бар нового эксперимента.

Progress bar for new experiment was added.


June 24, 2013, 11:48 UTC
New application 3.10 was released.

Выпущено приложение 3.10.


June 24, 2013, 11:45 UTC
Запущен новый эксперимент, направленный на поиск тройки взаимно ортогональных латинских квадратов порядка 10.

Experiment aimed at finding triple of mutual orthogonal Latin squares of order 10 was launched.


May 29, 2013, 14:56 UTC
В текущем эксперименте сгенерированы все задания. Скоро будет запущен новый эксперимент. Его цель - поиск тройки взаимно ортогональных латинских квадратов порядка 10.

In the current experiment all workunits were generated. New experiment is coming soon. One's goal is to find triple of mutual orthogonal Latin squares of order 10.


April 26, 2013, 7:52 UTC
SAT@home - кандидат в категории Математика - CPU (тяжелая атлетика) BOINC пентатлона 2013.

SAT@home is a candidate in category Mathematics - CPU (Weightlifting) of BOINC Pentathlon 2013.


April 26, 2013, 7:45 UTC
Во время соревнования 80 por ciento pasaron. Primero en llegar a 100, организованного командой Colombia была достигнута производительность 4.9 терафлопс.

During challenge 80 por ciento pasaron. Primero en llegar a 100 organized by Colombia performance 4.9 teraflops was obtained in the project.


April 8, 2012, 6:55 UTC
In the current experiment 3 new solutions were found by:
В текущем эксперименте 3 новых решения нашли участники:
Ivan
RoSMag from TSC! Russia
dimawalker


April 2, 2012, 10:55 UTC
In the current experiment 5 new pairs of diagonal orthogonal Latin squares of order 10 were found by:

В текущем эксперименте 5 новых пар диагональных ортогональных латинских квадратов порядка 10 были найдены следующими участниками:

tanos from Astronomy.Ru Forum
_2e_ from Russia
Bunky
electrician from TSC! Russia
EDGeSUser
http://vkontakte.ru/boinc from Colombia
Voyager from Astronomy.Ru Forum
Ivan
Joe from TeAm AnandTech


March 15, 2013, 4:10 UTC
Во время соревнования On halfway, организованного командой Astronomy.Ru Forum team было обработано около 5% пространства поиска текущего эксперимента. Также была достигнута производительность 5.3 терафлопс.

During challenge On halfway organized by Astronomy.Ru Forum team about 5% of the current experiment's search space was processed. Also performance 5.3 teraflops was obtained in the project.


January 25, 2012, 8:54 UTC
В Известиях ИГУ и в Вестнике ННГУ опубликовны статьи, посвященные нахождению декомпозиций SAT задач для их последующего решения в SAT@home.

Two papers about seerching decompositions of SAT problems for their solving in SAT@home were published in Russian journals.


January 2, 2012, 16:28 UTC
In the current experiment three new pairs of diagonal orthogonal Latin squares of order 10 were found by: tanos from Astronomy.Ru Forum and Tommy from US NAVY; 288larsson from Sicituradastra. and [ESL Brigade] kill_u4_free from Electronic Sports League (ESL); Ilex from Crystal Dream and plumbum from Russia Team.

В текущем эксперименте были найдены три новые пары диагональных ортогональных латинских квадратов порядка 10. Нашли их участники: tanos из Astronomy.Ru Forum и Tommy из US NAVY; 288larsson from Sicituradastra. и [ESL Brigade] kill_u4_free из Electronic Sports League (ESL); Ilex из Crystal Dream и plumbum из Russia Team,


December 26, 2012, 16:51 UTC
В газете 'Троицкий вариант - Наука' вышла статья Охотники за квадратами. Авторы: А. Андреев (один из руководителей сайта BOINC.ru) и О. Заикин (программист проекта SAT@home).

New paper was published in the scientific newspaper.


November 20, 2012, 10:49 UTC
Программист проекта SAT@home Олег Заикин получил стипендию Президента РФ! Тема исследования: 'разработка распределенных решателей больших систем булевых уравнений, их реализация в проекте добровольных грид-вычислений и применение к исследованию сложных дискретных структур.'

SAT@home programmer Oleg Zaikin received President of Russian Federation grant СП-1855.2012.5. Topic of the research: 'Development of distributed solvers of larger systems of Boolean equations, their implementation in the volunteer computing grid project and application for research of complex discrete structures'.


November 15, 2012, 9:14 UTC
Выпущена версия 3.02 прилоежния. Немного изменен формат выходной информации для более удобной обработки на сервере.

Version 3.02 of application released. Format of output data was slightly modifed for the server needs.


November 7, 2012, 8:55 UTC
В разделе Публикации и материалы выложена статья О.С. Заикин, М.А. Посыпкин, А.А. Семенов. Процедуры построения декомпозиционных множеств для распределенного решения SAT-задач в проекте добровольных вычислений SAT@home // Труды международной конференции PACO'2012. Т. 2. С. 85-95.

In the section Publications and materials new paper from materials of PACO'2012 coonference was added.


November 6, 2012, 8:40 UTC
In the current experiment second pair of diagonal orthogonal Latin squares of order 10 was found by quel from Sicituradastra. and tanos from Astronomy.Ru Forum

В текущем эксперименте вторую пару диагональных ортогональных латинских квадратов порядка 10 нашли quel из Sicituradastra. и tanos из Astronomy.Ru Forum


November 6, 2012, 8:45 UTC
During last challenge historical maximum of performance (6325 GFLOPs) was obtained in the project!

Во время прошедшего соревнования в проекте был достигнут исторический максимум производительности (6325 ГФЛОПс)!


October 31, 2012, 19:12 UTC
In the current experiment first pair of diagonal orthogonal Latin squares of order 10 was found by tanos from Astronomy.Ru Forum and notnA from Crystal Dream

В текущем эксперименте первую пару диагональных ортогональных латинских квадратов порядка 10 нашли tanos из Astronomy.Ru Forum и notnA из Crystal Dream


October 25, 2012, 6:42 UTC
Challenge in SAT@home 'Happy baker dozen' will start on 29 October 2012.

Соревнование в SAT@home 'Happy baker dozen' стартует 29 октября 2012 года.


october 25, 2012, 5:22 UTC
Report 'Zaikin O., Semenov A., Posypkin M. Procedures of constructing decomposition sets for distributed solving of SAT-problems in the volunteer computing project SAT@home' was presented at the PACO'2012 conference in Moscow on 24 October 2012.

Доклад 'Заикин О.С., Посыпкин М.А., Семенов А.А. Процедуры построения декомпозиционных множеств для распределенного решения SAT-задач в проекте добровольных вычислений SAT@home' был представлен на конференции PACO'2012 в Москве 24 октября 2012 года.


October 9, 2012, 9:23 UTC
Page Research progress was added by hoarfrost.

Страница Прогресс исследования добавлена hoarfrost'ом.


September 26, 2012, 8:55 UTC
Project was migrated to a new server. Server configuration: 2 x CPU Xeon5620, platform SR1690WBR, 24 Gb RAM, 2 x HDD 1 Tb in RAID. Server is located in ISA RAS, Moscow.

Проект был перенесен на новый сервер. Конфигурация сервера: 2 x CPU Xeon5620, платформа SR1690WBR, 24 Gb RAM, 2 x 1 Tb HDD в RAID. Сервер расположен в ИСА РАН, Москва.


September 12, 2012, 15:18 UTC
Version 3.01 of application released. Processing time for WUs reduced by about 25 %.

Выпущена версия 3.01 приложения. Время обработки заданий уменьшено примерно на 25 %.


September 11, 2012, 6:08 UTC
On the page Top countries diagrams with countries statistics were added by hoarfrost

На странице Лучшие страны hoarfrost добавил диаграммы со статистикой стран.


September 8, 2012, 14:17 UTC
Brief report 'Zaikin O., Semenov A., Posypkin M. Using volunteer computing to solve cryptographic problems' was presented at the Sibecrypt'2012 conference in Irkutsk on 7 August 2012.

Обзорный доклад 'Заикин О.С., Посыпкин М.А., Семенов А.А. Применение добровольных вычислений к решению криптографических задач' был представлен на конференции Sibecrypt'2012 в Иркутске 7 августа 2012 года.


September 3, 2012, 6:44 UTC
New experiment was started. The goal is to find pairs of diagonal orthogonal Latin squares of order 10. New version 3.00 of appliction was released for these purposes.

Запущен новый эксперимент. Цель - найти пары диагональных ортогональных латинских квадратов порядка 10. Для этого выпущена версия 3.00 приложения


August 28, 2012, 7:03 UTC
On the page Statistics new sections Top countries and Hosts total statistics are developed by hoarfrost.

На странице Статистика hoarfrost сделал новые разделы Лучшие страны и Общая статистика хостов.


August 27, 2012, 12:05 UTC
In the current experiment more than 100 pairs of diagonal Latin squares of order 9 were found. New experiment for order 10 coming soon.

В текущем эксперименте найдено более 100 пар ортогональных диагональных латинских квадратов размерности 9. Скоро будет запущен новый эксперимент для размерности 10.


July 24, 2012, 16:58 UTC
Report about expirience of promoting SAT@home was presented at the Grid'2012 conference on 20 July 2012.

Доклад об опыте раскрутки SAT@home был представлен на конференции Grid'2012 20 июля 2012 г.


July 4, 2012, 9:45 UTC


June 8, 2012, 17:25 UTC


June 4, 2012, 14:12 UTC


May 11, 2012, 17:03 UTC


April 26, 2012, 14:23 GMT


April 16, 2012, 9:18 GMT


April 11, 2012, 18:25 GMT


March 24, 2012, 17:40 GMT


March 4, 2012, 9:03 GMT


February 19, 2012, 16:55 GMT


February 3, 2012, 15:05 GMT


January 20, 2012, 9:20 GMT


January 6, 2012, 15:41 GMT


December 26, 2011, 15:41 GMT


December 16, 2011, 15:06 GMT


December 8, 2011, 17:22 GMT


November 23, 2011, 16:22 GMT


November 16, 2011, 15:20 GMT


November 15, 2011, 8:36 GMT


November 12, 2011, 13:09 GMT
SAT@home was added to Formula BOINC

November 9, 2011, 16:03 GMT
New experiment was launched. The goal is to solve 2nd SAT problem for the generator A5/1. Using of redundancy was added. Deadline was increased from 5 days to 10. max_wus_in_progress was incresed from 2 to 6.

November 7, 2011, 15:45 GMT
Second satisfying assignment for current SAT problem was successfully found. A new experiment will be lauchched soon.

October 28, 2011, 4:41 GMT
First satisfying assignment for current SAT problem was successfully found. In this experiment we will process all WUs in order to find other satisfying assignments, so called 'collisions'.

October 21, 2011, 16:17 GMT
Poster about SAT@home will be presented at Cracow Grid Workshop'2011 (Poland, Krakow, 7 November, Session S2). The title is Using BOINC Desktop Grid to Solve Large Scale SAT Problems, see programme of the conference

October 17, 2011, 11:18 GMT
New large-scale experiment with 65536 WUs has started. The goal is to solve SAT problem for the generator A5/1. The estimated run time for 1 WU is 3 hours. Deadline was increased to 5 days.

October 17, 2011, 11:15 GMT
SAT problem # 2 for summation generator was solved.

October 15, 2011, 17:18 GMT
New experiment with 16384 WUs has started. The goal is to solve another SAT problem for summation generator (4 LFSRs, 66 bits). Deadline was increased to 3 days. Large-scale experiment for the generator A5/1 is coming soon.

October 15, 2011, 17:15 GMT
SAT problem for summation generator was solved.

October 13, 2011, 17:00 GMT
New experiment with 16384 WUs has started. The goal is to solve 1 SAT problem for summation generator (4 LFSRs, 66 bits). There are no publicly available results for solving inversion problems for this type of generator. In new version of server application problem with credits was fixed.

October 13, 2011, 16:55 GMT
All 10 problems were solved. SAT problems for summation generator in configuration (4 LFSR, 63 bit) are simple enough. SAT problems for (4 LFSR, 66 bits) are about 10 times harder.

October 13, 2011, 5:02 GMT
New experiment with 81920 WUs has started. The goal is to solve another 10 SAT problems (8192 WUs for every problem) for summation generator (4 LFSRs, 63 bits). Aborting of WUs by server has caused problems with credits (thanks to users for reports and sorry for inconvenience). The estimated run time was set to approximately 20 min. (it will decrease effect of credit losing) and the deadline increased to 2 days. New version of server application now is being implemented, problem with credits will be fixed.

October 13, 2011, 3:01 GMT
Experiment #1 successfully finished. All 10 problems were solved. Thanks everybody! New experiment is coming soon. It looks like eight time more WUs are needed to load the system adequatly.

October 12, 2011, 13:45 GMT
Message boards were added. There are already some topics with discussion

October 12, 2011, 2:59 GMT
5 of 10 problems were successfully solved. Thanks to all new participants! The remaining 5 problems will be solved soon

October 1, 2011, 20:45 GMT
Experiment with 10240 WUs started. The goal is to solve 10 problems of inversion of a function that is used to generate keystream in summation generator (4 LFSRs, initialization sequence of length 63 bits). The estimated run time was set to approximately 2 hours and the deadline was set to 1 day.

September 29, 2011, 15:57 GMT
Project has started! Thanks to all users who helped in testing. Special thanks to user brmn - our permanent user of the day.


Home | My Account | Message Boards


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