Apps

BOINC Central distributes jobs for the following applications:

Name Description Science keywords Web page Docker required?
Details
Autodock Autodock predicts how small molecules, such as substrates or drug candidates, bind to a receptor such as a protein. Biology and Medicine
Drug discovery
View
Autodock Vina A version of Autodock that improves speed and accuracy Biology and Medicine
Drug discovery
View
Autodock Vinardo A version of Autodock that improves speed and accuracy Biology and Medicine
Drug discovery
View
D48-24 Starday Dime The problem of finding runs of consecutive positive integers with the same number of divisors was first addressed in the pioneering work of Ivo Düntsch and Roger Eggleton. They systematically described the properties of such "equidivisible integers" and set a world record for that time by discovering a run of 9 consecutive numbers.

Further theoretical foundations and crucial algorithmic constraints for these structures were developed in the fundamental works of the participants of the "Dream Pentadecathlon" thread on the dxdy forum, including Vladimir Letsko (VAL). Their modern mathematical estimates and research findings are preserved in the international arXiv repository.

Research in this area remains an open and vast frontier. Following the 2022 discovery of the D12-15 Pentadecathlon—a continuous run of 15 consecutive integers, each having exactly 12 divisors—it has stood ever since as the only such sequence of length greater than 7 for which the absolute maximum possible length has been achieved.

Yet, even for this relatively less complex sequence, a fundamental question remains unanswered to this day: is it the absolute minimal one? Moreover, minimality has not been established for even shorter runs, such as D12-14 and D12-13.

As practical results demonstrate, 48 is the most promising number of divisors for discovering the longest consecutive runs. In this system, the theoretical ceiling for a sequence length can reach an impressive 31 numbers in a row. In that same year, 2022, a run of length 20 was discovered for the first time. Resuming this challenge three years later, we have successively shattered the world records, uncovering first a 21-element run, followed by sequences of lengths 22 and 23 (the latest of which is a 54-digit number).

Theoretically, even exceeding this record is possible during the current search.
Mathematics and Computer Science
Number Theory
Yes
Boolean chains Search for shortest boolean chains for specific functions, inspired by problems discussed in The Art of Computer Programming Vol. 4A by Donald E. Knuth. Mathematics and Computer Science Yes
Nova API Yes
Symplectic Attention & Error Envelope This application generates multi‑precision trajectories of chaotic systems (e.g., double pendulum) using fixed‑step symplectic integrators with optional Kahan compensation. It extracts geometry‑aware symplectic attention features (position‑difference queries, momentum values), robust energy envelope logarithmic slopes, and multi‑head attention entropy spectra. The data is used to investigate the symbolic relationship between numerical error growth and attention entropy, and to perform inverse dynamics perturbation retrieval (“chaotic fingerprinting”). The research aims to build physically interpretable attention mechanisms for long‑term chaotic prediction. Physics
Mathematics and Computer Science
Artificial Intelligence and Cognitive Science
Yes
Register to submit jobs

Researchers

Name: Oliver Runge
Research interests: Computer science
Location: Germany


Powered by BOINC

© 2026 UC Berkeley