BOINC
Compute for Science

  • BOINC lets you help cutting-edge science research using your computer. The BOINC app, running on your computer, downloads scientific computing jobs and runs them invisibly in the background. It's easy and safe.

  • About 30 science projects use BOINC. They investigate diseases, study climate change, discover pulsars, and do many other types of scientific research.

  • The BOINC and Science United projects are located at the University of California, Berkeley and are supported by the National Science Foundation.
UCB logo           NSF logo
START COMPUTING!

To contribute to science areas (biomedicine, physics, astronomy, and so on) use Science United. Your computer will help current and future projects in the areas you choose.

Join Science United

Or download BOINC and choose specific projects. This will let you participate in competitions and systems like Gridcoin.

Download BOINC

News from BOINC Projects

[SETI@home] Website outage

Multiple disk failure resulted in a web site outage. We think we've recovered almost everything from the web site, so it should be back up and running.

View article · Thu, 3 Apr 2025 20:49:48 +0000


[YAFU] Aliquot sequence 3072384, 3176376, 3246240 have terminated!!!

Aliquot sequence 3072384, 3176376, 3246240 have terminated!!!





View article · Thu, 3 Apr 2025 19:04:21 +0000


[Minecraft@Home] Xoroshiro128++ Guessing Order Optimization Project

You may have noticed some new workunits hit the queue. As of the time of writing, the workunits that are available should be considered "beta" as we're working out a few kinks.
That said, this is a new CPU app! As time goes on, we'll be replacing configuration files for it to further refine the results, so work will be sent out in stages and we'll feel out how much workunits make sense for each stage.

I've included a fairly technical explanation from the primary author of the app, MC, longtime contributor to Minecraft@Home:

The Xoroshiro Guessing Order project aims to uncover exploitable statistical weaknesses in the xoroshiro128++ pseudorandom number generator (PRNG). Recent versions of Minecraft now use xoroshiro128++ for specific aspects of world generation, replacing Java's default PRNG. Unfortunately, this shift creates significant challenges for seedcracking projects, as no efficient algorithm currently exists to reconstruct the internal state of xoroshiro from its outputs.

Our primary goal is to develop a reliable method for recovering the PRNG's 128-bit seed from just two sequential 64-bit outputs. Currently, the most efficient known method (excluding SAT solvers) involves guessing 54 bits of the state, after which the remaining bits can be derived, a process requiring roughly 9 quadrillion attempts on average. Our aim is to significantly reduce this computational requirement.

Xoroshiro128++ belongs to the "xorshift" family of PRNGs, which means its core operations are linear. The internal state can therefore be represented as a binary vector within a 128-dimensional vector space, with state transitions represented as matrix multiplications. However, the primary challenge arises from its use of a non-linear "scrambler" function, which maps the internal state to its output. Due to this scrambler, there is no straightforward one-to-one relationship between the 128-dimensional internal state and the 128-bit output.

Fortunately, the scrambler function is imperfect. Most of the information provided by each output bit is concentrated in a relatively small subset, approximately a dozen dimensions, of the total 128-dimensional state. Even with a partial, lower-dimensional guess of the state, it is frequently possible to determine whether the guess is incorrect based on the known output. If we can identify low-dimensional subsets of the state space that are significantly constrained by the outputs, we can efficiently guess and verify these smaller portions first, rapidly eliminating incorrect possibilities.

Participants in our project analyze these lower-dimensional subsets of the state space, identifying those subsets most constrained by observed outputs. To facilitate this process, we use a large precomputed table that estimates the amount of information (in bits) xoroshiro's output data provides about each subset of state dimensions.

By ultimately identifying an optimal sequence of highly constrained subspaces, we can incrementally guess the state one dimension at a time, discarding incorrect possibilities early on. Achieving this optimal guessing order would produce a highly efficient algorithm capable of recovering the PRNG's internal state within a small number of attempts, significantly advancing future efforts in Minecraft seedcracking and related research.

View article · Sat, 29 Mar 2025 05:56:02 +0000


... more

News

Lines of code visualization
Vitalii made a visualization of the number of lines of code in BOINC going back to 2002.
16 Mar 2025, 9:07:20 UTC · Discuss


Grafana project dashboards
Check out Grafana project dashboards showing time-varying graphs of project info such as number of unsent and in-progress jobs.
15 Feb 2025, 21:03:13 UTC · Discuss


Contributor history video
Vitalii made a video showing the top 25 BOINC committers, based on CVS, Subversion and Git data, every month going back to 2002.
2 Jan 2025, 3:33:26 UTC · Discuss


... more

News is available as an RSS feed   RSS



Copyright © 2025 University of California.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.