Dear VGTU project@Home users,
We are constantly working on the current research problem.
Although, you don’t see changes in the client applications (versions are the same), generation of work and assimilation/processing of the results are changed from time to time.
After one of such changes, the bug was introduced into generation of tasks (workunits). We believe that we have fixed this bug in work generator on Monday, March 12. It seems that there are no problems with the tasks/workunits generated since then. However, some older erroneous work units may still be there… We don’t know exactly which to cancel them. Don’t worry, no time is lost: application simply fails to start and generates ERR_TOO_MANY_EXITS error after some number of trials.
The good news is that we have started to write a draft of the paper on the current research using our BOINC project.
With best regards,
The Project Team.

Dear VGTU project@Home users,
We have decided to stop the computations with the current [Link] application for dynamic visual cryptography based on non-linear oscillations. Some results have been obtained and published. However, new ideas are needed to move forward.
In the meantime, we have developed a new application in collaboration with our colleagues from the VGTU Department of Information Technologies. New application is solving the grillage optimization problem with parallel global optimization algorithms. More detailed description is [Link] here.
We thank you for your active participation and hope that you will find the new application also worthy of your computer’s time.
We have tried our best to test it. However, some undiscovered issues may appear. So, we will start with small portions of work.
With best regards,
The Project Team.

Dear VGTU project@Home users,
We have updated information on our current application for studying the dynamic visual cryptography based on non-linear oscillations. Extended description and scientific publications on the [Link] topic are presented here.
With best regards,
The Project Team.

Based on all hosts for this project (anonymous hosts included) the following table displays some estimated projected RAC for a specific architecture. The data can be incorrect, incomplete and/or very inaccurate since we have no way to verify how much the host runs the specific project. This is based on architectures that has checked in once the last week with at least 5 hosts.

Max RAC: The highest RAC score found for a single host.

Please note that this is NOT a mining calculator, but rather a way to find hosts that can perform well on the project based on what other uses.