News archive


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 © 2012 Institute for Systems Analysis of RAS and Institue for System Dynamics and Control Theory of SB RAS