https://boincsynergy.ca/wiki/api.php?action=feedcontributions&feedformat=atom&user=Al+Piskun 2026-05-31T06:14:59Z User contributions MediaWiki 1.43.8 https://boincsynergy.ca/wiki/index.php?title=Climateprediction.net&diff=1476 2026-05-30T18:00:24Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = climateprediction.net<br /> | logo = Clim.jpg<br /> | screenshot = Climateprediction.gif<br /> | caption = climateprediction.net BOINC climate simulation screensaver<br /> <br /> | status = Active<br /> | category = Climate study<br /> | compute = CPU<br /> | dependencies = None<br /> <br /> | developer = University of Oxford, UK Met Office, Open University, University of Reading<br /> | released = {{Start date and age|2003|12|09}}<br /> <br /> | operating system = Windows, Linux, macOS<br /> <br /> | stats as of = {{Start date and age|2026|05|20}}<br /> | average performance = 141972.05 GigaFLOPS<br /> | active users = 6307<br /> | total users = 309046<br /> | active hosts = 9588<br /> | total hosts = 668709<br /> <br /> | website = {{URL|https://www.cpdn.org}}<br /> | license = Research software (climate model dependent)<br /> }}<br /> {{Lowercase title}}<br /> [[File:Boinc client rosetta climateprediction net.jpg|thumb|BOINC manager, running Rosetta@home and ClimatePrediction.net]]<br /> '''climateprediction.net''' ('''CPDN''') is a volunteer distributed computing project operating on the [[wikipedia:BOINC|BOINC]] infrastructure, designed to improve understanding of climate change by running large ensembles of global climate model simulations. It is jointly coordinated by the University of Oxford and partner institutions including the UK Met Office and multiple UK research centres &lt;ref name=cpdn_about&gt;https://www.cpdn.org/about.php&lt;/ref&gt;.<br /> <br /> The project is one of the largest climate modelling experiments ever conducted in terms of computational scale and ensemble size, producing statistically significant distributions of future climate states rather than single deterministic projections &lt;ref name=wiki&gt;https://en.wikipedia.org/wiki/Climateprediction.net&lt;/ref&gt;.<br /> <br /> == Wikipedia page ==<br /> [[wikipedia:climateprediction.net|climateprediction.net]]<br /> <br /> == Overview ==<br /> climateprediction.net applies distributed computing to climate science by running thousands of perturbed climate simulations on volunteer computers worldwide. Each simulation varies uncertain physical parameters within plausible ranges, enabling probabilistic climate prediction through ensemble statistics.<br /> <br /> This approach addresses a fundamental limitation in traditional climate modelling: uncertainty quantification in long-term climate projections.<br /> <br /> == Scientific Rationale ==<br /> The project is based on the recognition that climate models contain structural and parametric uncertainty. Instead of producing a single forecast, CPDN explores a probability distribution of outcomes by varying:<br /> <br /> * Cloud parameterizations <br /> * Ocean heat uptake <br /> * Aerosol forcing <br /> * Radiative transfer parameters <br /> <br /> This ensemble-based method allows estimation of climate sensitivity ranges consistent with observed climate data &lt;ref name=stainforth2005&gt;Stainforth et al., Nature (2005)&lt;/ref&gt;.<br /> <br /> == History ==<br /> The concept for CPDN was introduced by Myles Allen in 1999 in the Nature commentary “Do-it-yourself climate prediction” &lt;ref name=&quot;allen1999&quot;&gt;https://www.nature.com/articles/news991014-12&lt;/ref&gt;.<br /> <br /> Key milestones include:<br /> <br /> * '''1999''' – Concept proposal for distributed climate modelling<br /> * '''2002''' – UK research council funding secured<br /> * '''2003''' – Project launch<br /> * '''2004''' – Migration to BOINC platform<br /> * '''2006''' – BBC Climate Change Experiment<br /> * '''2009''' – BBC experiment concluded and data archived<br /> <br /> == Scientific Projects ==<br /> <br /> CPDN runs multiple research streams grouped into active and completed experiments.<br /> <br /> === Current Projects ===<br /> * DOCILE (Drives Of Change In mid-Latitude weather Events)<br /> * TNC (The Nature Conservancy partnership studies)<br /> * GOTHAM (Globally Observed Teleconnections and their role and representation in Hierarchies of Atmospheric Models)<br /> * AFLAME (Attributing Amazon Forest fires from Land-use Alteration and Meteorological Extremes)<br /> * HIASA (High Impact Atmospheric Simulation Analysis)<br /> * EMBARK (ensemble-based climate risk modelling initiative)<br /> * National Trust climate resilience modelling<br /> <br /> These projects focus on attribution science, extreme event analysis, and climate risk quantification in regional systems &lt;ref name=cpdn_projects&gt;https://climateprediction.net/projects/&lt;/ref&gt;.<br /> <br /> === Completed Projects ===<br /> * weather@home &lt;ref name=weatherhome&gt;https://climateprediction.net/projects/completed-project/completed-weatherhome-projects/&lt;/ref&gt;<br /> * HadCM3 and other models ensemble experiments &lt;ref name=hadcm3&gt;https://climateprediction.net/projects/completed-project/hadcm3-and-other-models/&lt;/ref&gt;<br /> <br /> These completed studies provided foundational datasets for understanding climate variability, extreme weather attribution, and ensemble climate uncertainty.[[File:Global Warming Predictions.png|thumb|Global Warming Predictions]]<br /> == Model Systems ==<br /> CPDN has used multiple generations of climate models:<br /> <br /> === HadCM3-based Models ===<br /> The HadCM3 coupled atmosphere-ocean general circulation model formed the basis of early CPDN experiments. It allowed long-duration simulations at relatively low computational cost.<br /> <br /> === Weather@Home System ===<br /> An extension enabling regional downscaling of global climate projections, widely used in extreme weather attribution studies.<br /> <br /> === OpenIFS Models ===<br /> Recent CPDN simulations use ECMWF OpenIFS configurations, enabling higher-resolution global modeling. Some configurations require multicore execution and up to tens of gigabytes of RAM per job &lt;ref name=&quot;reddit_openifs&quot;&gt;https://www.reddit.com/r/BOINC/comments/1mhrgkw&lt;/ref&gt;.<br /> <br /> == BBC Climate Change Experiment ==<br /> The BBC Climate Change Experiment (2006–2009) was a major public engagement initiative involving over 120,000 volunteers.<br /> <br /> Participants ran simulations covering:<br /> <br /> * 20th century climate (1920–2000)<br /> * Future scenarios (2000–2080)<br /> <br /> The experiment demonstrated the feasibility of large-scale public participation in climate modelling and contributed to early climate risk communication efforts &lt;ref name=bbc&gt;https://www.bbc.co.uk/sn/climateexperiment&lt;/ref&gt;.[[File:Climate Zones, Scenario B1 2001 - 2025, Global (7242981050).jpg|thumb|Climate Zones, Scenario B1 2001 - 2025]]<br /> == Computational Methodology ==<br /> Each CPDN work unit typically includes:<br /> <br /> # Model initialization and spin-up<br /> # Control simulation under baseline parameters<br /> # Perturbed simulation with modified physical constants<br /> <br /> Outputs are aggregated across thousands of independent runs to derive probabilistic climate response functions &lt;ref name=&quot;stainforth2005&quot; /&gt;.<br /> == Scientific Output ==<br /> CPDN data has contributed to numerous peer-reviewed studies in climate science, including:<br /> <br /> * Stainforth et al. (2005) — climate sensitivity uncertainty distributions<br /> * Murphy et al. (2004) — probabilistic climate modelling framework<br /> * Sexton et al. (2012) — regional climate uncertainty analysis<br /> * Philip et al. (2019) — extreme weather attribution studies<br /> <br /> The BOINC scientific publication archive also lists CPDN-derived contributions across multiple climate research domains &lt;ref name=boinc_pubs&gt;https://boinc.berkeley.edu/pubs.php&lt;/ref&gt;.<br /> <br /> == Project Team and Sponsors ==<br /> [[File:Climateprediction.gif|thumb|BOINC client running CPDN work units]]<br /> The project is led by:<br /> <br /> * Prof Myles R. Allen <br /> * Andy Bowery <br /> * Dr Neven S. Fuckar <br /> * Dr Sihan Li <br /> * Dr Friederike E. L. Otto <br /> * Prof David Wallom <br /> <br /> CPDN is based at the University of Oxford, primarily within:<br /> <br /> * Environmental Change Institute <br /> * Oxford e-Research Centre <br /> * Atmospheric, Oceanic and Planetary Physics group <br /> <br /> &lt;ref name=&quot;cpdn_people&quot;&gt;https://climateprediction.net/people&lt;/ref&gt;<br /> <br /> == Impact ==<br /> climateprediction.net has had significant scientific and societal impact:<br /> <br /> * One of the largest ensemble climate datasets ever produced<br /> * Early demonstration of probabilistic climate prediction<br /> * Major contribution to extreme weather attribution science<br /> * Public engagement through BBC collaboration<br /> * Influence on IPCC uncertainty framing methodologies<br /> <br /> == Scientific Publications ==<br /> A full list of CPDN-related publications is maintained at: https://climateprediction.net/publications/ &lt;ref name=cpdn_pubs&gt;https://climateprediction.net/publications/&lt;/ref&gt;<br /> <br /> Key peer-reviewed works include publications in Nature, Journal of Climate, and Environmental Research Letters.<br /> <br /> == See also ==<br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Climate model|Cimaste model]]<br /> * [[Wikipedia:Climate sensitivity|Climate sensitivity]]<br /> * [[wikipedia:Global circulation model|Global circulation model]]<br /> * [[wikipedia:Extreme weather attribution|Extreme weather attribution]]<br /> <br /> == External links ==<br /> * https://www.cpdn.org<br /> * https://climateprediction.net<br /> * https://www.ox.ac.uk<br /> * https://www.metoffice.gov.uk<br /> * https://boinc.berkeley.edu<br /> <br /> == References ==<br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Cpdnboinc_dev&diff=1475 2026-05-30T15:02:29Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = CPDN dev<br /> | logo = Cpdn.png<br /> <br /> | status = Active<br /> | category = Development<br /> | compute = CPU<br /> | dependencies = None<br /> <br /> | developer = [[wikipedia:University of Oxford|University of Oxford]] — Oxford e-Research Centre<br /> | released = {{Start date and age|2003|12|09}}<br /> | completed = No<br /> <br /> | operating system = Windows, Linux, macOS<br /> <br /> | website = {{URL|https://dev.cpdn.org/}}<br /> | license = Proprietary<br /> <br /> }}<br /> <br /> [https://dev.cpdn.org/ '''''cpdnboinc dev'''''] is the '''development''' instance of '''[https://climateprediction.net/ climateprediction.net]''' (CPDN), a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project dedicated to investigating and reducing uncertainties in [[wikipedia:global climate model|climate modelling]]. The development server hosts test work-units and experimental configurations before they are deployed on the main production BOINC server at [https://main.cpdn.org/ main.cpdn.org]. The production project is one of the largest and longest-running climate-science experiments ever conducted, harnessing the idle processing power of hundreds of thousands of personal computers around the world to run climate simulations that would otherwise be impossible on any single supercomputer.&lt;ref name=&quot;wikipedia&quot;&gt;{{cite web |url=https://en.wikipedia.org/wiki/Climateprediction.net |title=climateprediction.net |publisher=Wikipedia |accessdate=2026-05-19}}&lt;/ref&gt;<br /> <br /> == Why cpdnboinc dev? ==<br /> <br /> Climate modelling is one of science's grand computational challenges. The global climate system involves the atmosphere, oceans, land surface, ice, and the biosphere — all interacting across vastly different scales of time and space. Running a single high-resolution simulation of even one century of Earth's climate can take weeks on a supercomputer.&lt;ref name=&quot;wikipedia&quot;/&gt;<br /> <br /> The central problem is '''uncertainty''': climate models contain dozens of physical parameters — such as how clouds form, how aerosols scatter sunlight, or how ocean eddies mix heat — that cannot be measured perfectly. To understand how sensitive the climate is to these unknowns, scientists must run the same model thousands of times, each time with slightly different parameter settings. This technique is called a '''[[wikipedia:climate ensemble|perturbed-physics ensemble]]''' (PPE), and the sheer volume of computing required puts it far beyond the reach of any single institution's hardware.&lt;ref name=&quot;cpdn_home&quot;&gt;{{cite web |url=https://climateprediction.net/ |title=climateprediction.net — World's Largest Climate Modelling Experiment |publisher=University of Oxford |accessdate=2026-05-19}}&lt;/ref&gt;<br /> <br /> Volunteer computing solves this problem elegantly: by distributing individual model runs to tens of thousands of home computers simultaneously, CPDN generates ensemble sizes that dwarf anything previously possible. The IPCC itself identified &quot;long-term ensemble simulations using complex models&quot; as a high-priority research need as far back as 2001.&lt;ref name=&quot;wikipedia&quot;/&gt;<br /> <br /> == Goal ==<br /> <br /> The overarching goal of climateprediction.net — and by extension its development server cpdnboinc dev — is to '''quantify and reduce the uncertainties in 21st-century climate projections''', giving policymakers and scientists a firmer scientific foundation for understanding climate change.&lt;ref name=&quot;cpdn_volunteer&quot;&gt;{{cite web |url=https://climateprediction.net/volunteer-your-computer |title=Volunteer your Computer |publisher=climateprediction.net / University of Oxford |accessdate=2026-05-19}}&lt;/ref&gt;<br /> <br /> More specifically, the project aims to:<br /> <br /> * '''Investigate parameterisation uncertainties''' in state-of-the-art climate models by running the model thousands of times with slight, physically plausible perturbations to atmospheric, oceanic, and sulphur-cycle physics.&lt;ref name=&quot;wikipedia&quot;/&gt;<br /> * '''Determine the range of possible climate sensitivities''' — how much global temperature rises when atmospheric CO₂ doubles — and assess which parameter combinations best reproduce observed past climate (known as ''hindcasting''). Models that faithfully reproduce the historical climate record are weighted more heavily in probabilistic projections.&lt;ref name=&quot;wikipedia&quot;/&gt;<br /> * '''Extend to regional scales''' through the ''weather@home'' sub-project (launched 2010), which nests a high-resolution regional climate model inside the global driver model to examine changes in extreme weather events at the local level.&lt;ref name=&quot;cpdn_history&quot;&gt;{{cite web |url=https://climateprediction.net/history |title=History of the CPDN project |publisher=climateprediction.net |accessdate=2026-05-19}}&lt;/ref&gt;<br /> * '''Support event-attribution science''': assessing how much human-caused greenhouse-gas emissions have changed the probability of specific extreme weather events (e.g., floods, droughts, heatwaves).&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> * '''Expand into new application domains''', including energy-system planning, infrastructure resilience, and health impacts of climate change, through dedicated study types offered to external researchers.&lt;ref name=&quot;cpdn_volunteer&quot;/&gt;<br /> <br /> In summary, CPDN has produced over 100 million model-years of simulation data — more than any other climate modelling project in history — and has registered users in over 220 countries.&lt;ref name=&quot;wikipedia&quot;/&gt;<br /> <br /> == Methods ==<br /> [[File:Global Carbon Monoxide, September 26, 2005 (8269570039).jpg|thumb|Global carbon monoxide measurements from NASA's Atmospheric Infrared Sounder]]<br /> <br /> === Why BOINC? ===<br /> [[File:BOINC logo.png|left|thumb|200x200px|The [[wikipedia:BOINC|BOINC]] logo. BOINC was adopted by CPDN in August 2004.]]<br /> The project originally ran on bespoke &quot;classic&quot; software at its September 2003 launch. On '''26 August 2004''', CPDN migrated to '''[[wikipedia:BOINC|BOINC]]''' (Berkeley Open Infrastructure for Network Computing), the open-source volunteer-computing middleware developed at the University of California, Berkeley by David Anderson and the SETI@home team.&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> <br /> BOINC offered several decisive advantages:<br /> <br /> * '''Cross-platform support''' — the BOINC client runs on Windows, Linux, and macOS, immediately broadening the pool of potential volunteers beyond the Windows-only classic client.&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> * '''Multi-project flexibility''' — volunteers can run CPDN alongside other BOINC projects (e.g., Einstein@home, Rosetta@home) without having to choose between them.&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> * '''Screensaver visualisation''' — the BOINC client can display an animated visualisation of the running climate model as a screensaver, making participation visible and engaging.&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> * '''Robust security and credit accounting''' — BOINC provides redundant result validation, ensuring that volunteer-computed results can be trusted before they enter the scientific database.&lt;ref name=&quot;oxford_boinc&quot;&gt;{{cite web |url=https://www.cs.ox.ac.uk/innovation/research-impact/case-boinc.html |title=BOINC and climateprediction.net — Research Impact |publisher=University of Oxford, Dept. of Computer Science |accessdate=2026-05-19}}&lt;/ref&gt;<br /> <br /> Oxford's contribution to BOINC development during the CPDN project was itself significant enough that the University of Oxford's Department of Computer Science cites it as a major research-impact case study. BOINC is now recognised as the key open-source resource for volunteer computing globally.&lt;ref name=&quot;oxford_boinc&quot;/&gt;<br /> <br /> === How the models work ===<br /> <br /> Each volunteer's computer receives a self-contained climate model — currently a version of the [[wikipedia:HadCM3|Met Office Hadley Centre climate model (HadSM3 / HadCM3)]] — pre-configured with a specific set of perturbed physics parameters. The model runs in the background using only idle CPU time, and periodically &quot;trickles&quot; progress reports back to the server. When complete, the full result is uploaded automatically.&lt;ref name=&quot;cpdn_technical&quot;&gt;{{cite web |url=https://climateprediction.net/volunteer-your-computer/technical-faqs |title=Technical FAQs |publisher=climateprediction.net |accessdate=2026-05-19}}&lt;/ref&gt;<br /> <br /> The suite of model types that CPDN has distributed over its history (in chronological order) includes:&lt;ref name=&quot;wikipedia&quot;/&gt;<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! Model !! Notes<br /> |-<br /> | '''Classic Slab Model''' || The original 2003 experiment; equilibrium response to doubled CO₂, atmosphere and static &quot;slab&quot; ocean. Windows only.<br /> |-<br /> | '''BOINC Slab Model''' || The same experiment re-issued under BOINC from August 2004.<br /> |-<br /> | '''ThermoHaline Circulation (THC) Model''' || Launched May 2004; investigates climate response to a 50% slowdown of the North Atlantic thermohaline circulation. Now closed to new participants.<br /> |-<br /> | '''Sulfur Cycle Model''' || Launched August 2005; models the effect of sulfate aerosols and dimethyl sulfide on climate. A five-phase, 75 model-year simulation.<br /> |-<br /> | '''Coupled Spin-Up Model''' || Internal preparation run (not publicly released); added dynamic ocean physics needed for the coupled model.<br /> |-<br /> | '''Transient Coupled Model (BBC Climate Change Experiment)''' || Launched February 2006; 80-year hindcast (1920–2000) plus 80-year forecast (2000–2080) with dynamic ocean. The most realistic model released to that date.<br /> |-<br /> | '''Seasonal Attribution Project''' || High-resolution single-year runs using HadAM3-N144; at least 1.5 GB RAM required. Studies extreme precipitation events.<br /> |-<br /> | '''weather@home''' || Launched November 2010; pairs a global driver model (HadAM3P at N96 resolution) with the Met Office regional model (HadRM3P at ~50 km resolution) to study regional weather extremes.<br /> |}<br /> <br /> The development server '''cpdnboinc dev''' hosts experimental versions of these model configurations and new application types before they are promoted to the main project. It allows the team to perform integration testing and validation with a smaller pool of technically experienced volunteers.<br /> <br /> === Ensemble size and scale ===<br /> <br /> By November 2005 alone, the project had completed over 135,000 individual model runs across all experiment types, representing more than 6 million model-years processed.&lt;ref name=&quot;wikipedia&quot;/&gt; As of June 2016, the project reported approximately '''55 teraflops''' of processing power from more than 12,000 active participants across 223 countries.&lt;ref name=&quot;wikipedia&quot;/&gt; The total registered user base surpassed 700,000 by 2013.&lt;ref name=&quot;oxford_boinc&quot;/&gt;<br /> <br /> === Key scientific milestone: first results in ''Nature'' (2005) ===<br /> <br /> In January 2005, the first scientific results from the CPDN experiment were published in the journal ''[[wikipedia:Nature (journal)|Nature]]''. The landmark paper — '''Stainforth et al. (2005), &quot;Uncertainty in predictions of the climate response to rising levels of greenhouse gases&quot;''' (''Nature'' 433, 403–406, doi:10.1038/nature03301) — analysed over 2,000 model runs and showed that, with only physically plausible changes to parameters, climate sensitivity ranged from less than 2 °C to more than 11 °C in response to a doubling of CO₂.&lt;ref name=&quot;stainforth2005&quot;&gt;{{cite journal |last=Stainforth |first=D.A. |display-authors=etal |year=2005 |title=Uncertainty in predictions of the climate response to rising levels of greenhouse gases |journal=Nature |volume=433 |issue=7024 |pages=403–406 |doi=10.1038/nature03301}}&lt;/ref&gt; This was the first time that a full [[wikipedia:general circulation model|general circulation model (GCM)]] had produced such extreme sensitivities, and the result attracted worldwide media attention.<br /> <br /> == History ==<br /> [[File:20200327 Climate change deniers cherry picking time periods.gif|thumb|250x250px|Climate change deniers cherry picking time periods]]<br /> <br /> === Origins (1997–2002) ===<br /> <br /> The seeds of climateprediction.net were planted in 1997, when [[wikipedia:Myles Allen|Myles Allen]] — then at the University of Oxford — recognised the scientific need for very large climate-model ensembles. He was introduced to the success of SETI@home in 1999 and was inspired by the potential of volunteer computing. His first funding proposal, submitted in April 1999, was rejected as &quot;utterly unrealistic.&quot;&lt;ref name=&quot;wikipedia&quot;/&gt;<br /> <br /> Following a presentation at the [[wikipedia:World Climate Conference|World Climate Conference]] in Hamburg and the publication of his landmark commentary article ''Do-it-yourself climate prediction'' in ''[[wikipedia:Nature (journal)|Nature]]'' (October 1999), thousands of would-be volunteers signed up — though the software was not yet ready. The [[wikipedia:dot-com bubble|dot-com bubble]] bursting forced the team to develop most of the infrastructure themselves rather than outsourcing it.&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> <br /> The project was initially named '''Casino-21''' — a reference both to [[wikipedia:Monte Carlo method|Monte Carlo simulations]] and to 21st-century climate. It was renamed climateprediction.com and then refined to '''climateprediction.net''' to make clear it was not a commercial enterprise. By 2002, funding from the [[wikipedia:Natural Environment Research Council|Natural Environment Research Council (NERC)]] and the UK Department of Trade and Industry enabled the team to grow significantly, drawing in expertise from the [[wikipedia:Open University|Open University]], the Knowledge Media Institute (KMi), and Oxford's Computing Laboratory.&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> <br /> === Launch and rapid growth (2003–2006) ===<br /> <br /> The full public launch occurred on '''12 September 2003'''. Within 24 hours the project attracted 25,000 registered users, and by the following day it had exceeded the processing capacity of Japan's [[wikipedia:Earth Simulator|Earth Simulator]] — then the world's most powerful supercomputer — to become the world's largest climate modelling facility.&lt;ref name=&quot;wikipedia&quot;/&gt;&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> <br /> In '''May 2004''', a thermohaline circulation slowdown experiment was launched to coincide with the release of the film ''[[wikipedia:The Day After Tomorrow|The Day After Tomorrow]]''. Three months later, on 26 August 2004, CPDN migrated to BOINC, opening participation to Mac and Linux users for the first time.&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> <br /> In '''February 2006''', the '''BBC Climate Change Experiment''' (also known as the transient coupled model) was launched in conjunction with the BBC's climate change season. It attracted approximately 23,000 participants on the first day and eventually recruited around 300,000 new volunteers. It was officially declared complete on 8 March 2009.&lt;ref name=&quot;wikipedia&quot;/&gt;&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> <br /> === weather@home and regional modelling (2010–present) ===<br /> <br /> In '''November 2010''', a new experiment called '''weather@home''' was launched in collaboration with the ''Guardian'' newspaper and with support from Met Office colleagues Dr. Richard Jones and Dr. Simon Wilson. For the first time, CPDN ran a nested regional climate model (the Met Office's PRECIS/HadRM3P regional model) driven by a global driver model (HadAM3P), allowing scientists to study changes in extreme weather at much finer spatial resolution (~50 km).&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> <br /> The first weather@home results, focusing on the European and western US regions, were published in a special issue of the ''Bulletin of the American Meteorological Society''. The framework has since been extended to cover most of the globe, with regional configurations for Africa, North America, South Asia, Australia–New Zealand, Mexico, and more.&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> <br /> == Project team / Sponsors ==<br /> [[File:John Speed's map of Oxford, 1605..jpg|thumb|John Speed's map of Oxford. [[wikipedia:University of Oxford|University of Oxford]], the primary institution hosting CPDN.]]<br /> climateprediction.net / CPDN is operated primarily by the '''[[wikipedia:University of Oxford|University of Oxford]]''', hosted within:&lt;ref name=&quot;cpdn_volunteer&quot;/&gt;<br /> <br /> * '''Oxford e-Research Centre''' (Department of Engineering Science)<br /> * '''Atmospheric, Oceanic and Planetary Physics (AOPP)'''<br /> * '''Environmental Change Institute (ECI)'''<br /> <br /> A team of approximately 13 climate scientists, computing experts, and graduate students runs the day-to-day operations, alongside international partners and collaborators.&lt;ref name=&quot;cpdn_volunteer&quot;/&gt;<br /> <br /> === Key personnel ===<br /> <br /> * '''[[wikipedia:Myles Allen|Prof. Myles Allen]]''' — Founder of climateprediction.net. He wrote the seminal 1999 ''Nature'' commentary ''Do-it-yourself climate prediction'' that sparked the project's creation and has led the team's scientific direction ever since.&lt;ref name=&quot;cpdn_people&quot;&gt;{{cite web |url=https://climateprediction.net/people |title=People in the CPDN group, University of Oxford |publisher=climateprediction.net |accessdate=2026-05-19}}&lt;/ref&gt;<br /> * '''Dr. David Stainforth''' — Led the 2005 ''Nature'' publication and the early perturbed-physics ensemble design.&lt;ref name=&quot;stainforth2005&quot;/&gt;<br /> * '''Dr. Simon Sparrow''' — Current senior scientific computing specialist involved in ongoing ensemble design and publications.&lt;ref name=&quot;cpdn_pubs&quot;&gt;{{cite web |url=https://climateprediction.net/publications |title=Publications from the CPDN project |publisher=climateprediction.net |accessdate=2026-05-19}}&lt;/ref&gt;<br /> * '''Dr. Dave Wallom''' — Oxford e-Research Centre; central to the computing infrastructure.&lt;ref name=&quot;cpdn_pubs&quot;/&gt;<br /> <br /> === Funders and partners ===<br /> <br /> Historic and ongoing funding and partnerships have included:&lt;ref name=&quot;cpdn_history&quot;/&gt;&lt;ref name=&quot;cpdn_volunteer&quot;/&gt;<br /> <br /> * '''[[wikipedia:Natural Environment Research Council|Natural Environment Research Council (NERC)]]''' — primary UK research funder since the early 2000s<br /> * '''UK Department of Trade and Industry''' (now the Department for Business, Energy and Industrial Strategy)<br /> * '''[[wikipedia:BBC|BBC]]''' — co-launched the 2006 BBC Climate Change Experiment<br /> * '''[[wikipedia:Met Office|Met Office Hadley Centre]]''' — provided the base climate models (HadSM3, HadCM3, HadAM3P, HadRM3P)<br /> * '''[[wikipedia:Open University|Open University]]''' / Knowledge Media Institute (KMi) — contributed to early project development<br /> * '''Oxford University Computing Laboratory (ComLab)'''<br /> * '''Carnegie Mellon University''' — collaboration for the 2008 geoengineering experiment (Kate Ricke and Granger Morgan)&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> * '''The Guardian''' — media partner for weather@home launch (2010)&lt;ref name=&quot;cpdn_history&quot;/&gt;<br /> * '''British Council''' — sponsor of the weather@home Mexico / RECLIM-UK project&lt;ref name=&quot;weather_mex&quot;&gt;{{cite web |url=https://www.climateprediction.net/weatherhome-mexico-new-climate-modelling-experiment-launching-soon/ |title=Weather@Home Mexico: New Climate Modelling Experiment |publisher=climateprediction.net |accessdate=2026-05-19}}&lt;/ref&gt;<br /> <br /> == Scientific publications ==<br /> <br /> CPDN has produced a substantial body of peer-reviewed literature. A full list is maintained at [https://climateprediction.net/publications climateprediction.net/publications] and results are also indexed on the [https://boinc.berkeley.edu/pubs.php BOINC publications list].&lt;ref name=&quot;boinc_pubs&quot;&gt;{{cite web |url=https://boinc.berkeley.edu/pubs.php |title=Publications by BOINC Projects |publisher=University of California, Berkeley |accessdate=2026-05-19}}&lt;/ref&gt; Selected landmark papers include:<br /> <br /> === Foundational papers ===<br /> <br /> * {{cite journal |last=Allen |first=M.R. |year=1999 |title=Do-it-yourself climate prediction |journal=Nature |volume=401 |pages=627 |doi=10.1038/44176}} — The commentary article that launched the project concept.<br /> <br /> * {{cite journal |last=Stainforth |first=D.A. |display-authors=etal |year=2005 |title=Uncertainty in predictions of the climate response to rising levels of greenhouse gases |journal=Nature |volume=433 |issue=7024 |pages=403–406 |doi=10.1038/nature03301}} — First major results from over 2,000 CPDN model runs, showing climate sensitivity ranging 2–11 °C.<br /> <br /> * {{cite journal |last=Murphy |first=J.M. |display-authors=etal |year=2004 |title=Quantification of modelling uncertainties in a large ensemble of climate change simulations |journal=Nature |volume=430 |pages=768–772 |doi=10.1038/nature02771}}<br /> <br /> === Event attribution and regional studies ===<br /> <br /> * {{cite journal |last=Pall |first=P. |display-authors=etal |year=2011 |title=Anthropogenic greenhouse gas contribution to flood risk in England and Wales in autumn 2000 |journal=Nature |volume=470 |pages=382–385 |doi=10.1038/nature09762}}<br /> <br /> * {{cite journal |last=Massey |first=N. |display-authors=etal |year=2015 |title=weather@home — development and validation of a very large ensemble modelling system for probabilistic event attribution |journal=Quarterly Journal of the Royal Meteorological Society |volume=141 |pages=1528–1545 |doi=10.1002/qj.2455}}<br /> <br /> === Recent publications (selected) ===<br /> <br /> * {{cite journal |last=Calafat |first=F. |display-authors=etal |year=2022 |title=Trends in Europe storm surge extremes match the rate of sea-level rise |journal=Nature |volume=603 |pages=841–845 |doi=10.1038/s41586-022-04426-5}}<br /> <br /> * {{cite journal |last=Miranda |first=N. |display-authors=etal |year=2023 |title=Change in cooling degree days with global mean temperature rise increasing from 1.5 °C to 2.0 °C |journal=Nature Sustainability |doi=10.1038/s41893-023-01155-z}}<br /> <br /> * {{cite journal |last=Ye |first=K. |display-authors=etal |year=2024 |title=Response of winter climate and extreme weather to projected Arctic sea-ice loss in very large-ensemble climate model simulations |journal=npj Climate and Atmospheric Science |volume=7 |pages=20}}<br /> <br /> == Participating ==<br /> <br /> To join the main (production) project:<br /> # Download and install the [[wikipedia:BOINC|BOINC client]] from [https://boinc.berkeley.edu boinc.berkeley.edu]<br /> # Add the project URL: &lt;code&gt;&lt;nowiki&gt;https://climateprediction.net/&lt;/nowiki&gt;&lt;/code&gt;<br /> # Create or log in with a CPDN account<br /> <br /> To join the development / test server (cpdnboinc dev):<br /> # Use the project URL: &lt;code&gt;&lt;nowiki&gt;https://dev.cpdn.org/&lt;/nowiki&gt;&lt;/code&gt;<br /> # Note: the dev server issues experimental work-units and is intended primarily for experienced BOINC volunteers willing to assist with testing.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:Climate ensemble|Climate ensemble]]<br /> * [[wikipedia:Global climate model|Global climate model]]<br /> * [[wikipedia:Myles Allen|Myles Allen]]<br /> * [[wikipedia:BBC Climate Change Experiment|BBC Climate Change Experiment]]<br /> * [[wikipedia:SETI@home|SETI@home]]<br /> <br /> == References ==<br /> {{Reflist}}<br /> <br /> == External links ==<br /> <br /> * [https://dev.cpdn.org/ cpdnboinc dev — Development server]<br /> * [https://main.cpdn.org/ climateprediction.net — Main BOINC server]<br /> * [https://climateprediction.net/ CPDN project website (University of Oxford)]<br /> * [https://climateprediction.net/history CPDN project history]<br /> * [https://climateprediction.net/publications CPDN scientific publications]<br /> * [https://en.wikipedia.org/wiki/Climateprediction.net Wikipedia: climateprediction.net]<br /> * [https://boinc.berkeley.edu/pubs.php BOINC publications list]<br /> * [https://web.archive.org/web/2003*/https://climateprediction.net/ Archived CPDN pages — Wayback Machine]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1474 2026-05-30T11:46:25Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = NumberFields@Home<br /> | logo = Nf.jpg<br /> | logo caption = NumberFields@Home logo<br /> | status = Active<br /> | category = Mathematics / Algebraic Number Theory<br /> | compute = CPU &amp;amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Eric D. Driver<br /> | author = Eric D. Driver<br /> | sponsor = Arizona State University School of Mathematics<br /> | maintainer = Eric D. Driver, Greg Tucker<br /> | released = August 2011<br /> <br /> | programming language = C, C++ (PARI/GP, GMP)<br /> | operating system = Windows, Linux, macOS (x86)<br /> <br /> | stats as of = May 2026<br /> | average performance = ~47,566 GigaFLOPS<br /> | website = {{URL|https://numberfields.asu.edu/NumberFields/}}<br /> }}<br /> <br /> BOINC project [https://numberfields.asu.edu/NumberFields/ '''''NumberFields@Home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that needs your help to search for fields with special properties.<br /> <br /> [[Image:Algebraicszoom.png|right|thumb|300px|A visualisation of the [[wikipedia:Algebraic_number|algebraic numbers]] in the [[wikipedia:Complex_plane|complex plane]]. Number fields are algebraic extensions of the rationals whose elements lie among these points.]]<br /> <br /> == Background ==<br /> <br /> Fields are important mathematical constructs with far-reaching applications across many branches of mathematics. Most people are familiar with everyday examples such as the field of [[wikipedia:Rational_number|rational numbers]] &lt;math&gt;\mathbf{Q}&lt;/math&gt;, the [[wikipedia:Real_number|real numbers]] &lt;math&gt;\mathbf{R}&lt;/math&gt;, and the [[wikipedia:Complex_number|complex numbers]] &lt;math&gt;\mathbf{C}&lt;/math&gt;. The fields studied by NumberFields@Home are '''[[wikipedia:Algebraic_number_field|number fields]]''': algebraic extension fields of the rationals of finite degree. More precisely, a number field is a subset of &lt;math&gt;\mathbf{C}&lt;/math&gt; which contains the root &lt;math&gt;\alpha&lt;/math&gt; of a given polynomial and is minimal while remaining closed under addition, subtraction, multiplication, and division (excepting division by zero).{{cite web |title=What is NumberFields@home? |url=https://numberfields.asu.edu/NumberFields/ |publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> Formally, every number field &lt;math&gt;K&lt;/math&gt; of degree &lt;math&gt;n&lt;/math&gt; over &lt;math&gt;\mathbf{Q}&lt;/math&gt; may be written as<br /> <br /> <br /> &lt;math&gt;K = \mathbf{Q}(\alpha)&lt;/math&gt;<br /> <br /> where &lt;math&gt;\alpha&lt;/math&gt; is a root of some irreducible polynomial of degree &lt;math&gt;n&lt;/math&gt; with rational coefficients.{{cite web |title=Algebraic number field |url=https://en.wikipedia.org/wiki/Algebraic_number_field |publisher=Wikipedia |access-date=2026-05-29}} The project is principally interested in '''imprimitive degree-10 fields''' (called '''decic fields'''), which correspond to certain degree-10 polynomials. An imprimitive field is one that contains a proper intermediate subfield strictly between &lt;math&gt;\mathbf{Q}&lt;/math&gt; and itself, as opposed to primitive fields whose Galois closure has an irreducible Galois group.<br /> <br /> Number theorists can mine tabulated data for patterns to help formulate conjectures about number fields, leading to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Among the practical applications are [[wikipedia:Cryptography|'''''cryptography''''']], where number fields underpin sophisticated factoring algorithms and novel cryptosystems, and theoretical physics including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].{{cite web |title=NumberFields@home project description |url=https://numberfields.asu.edu/NumberFields/ProjectDescription.html |publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> == History ==<br /> <br /> The project was founded by '''Eric D. Driver''', a researcher associated with the [https://math.asu.edu/ School of Mathematics] at '''[[wikipedia:Arizona_State_University|Arizona State University]]''' (ASU). Driver recognised that computing lower-degree number fields requires comparatively modest resources and that such fields had already been extensively tabulated, but the degree-10 case was the first case demanding a massively parallel computational solution. After reading an [https://www.linux-magazine.com/Issues/2006/71/BOINC/ article in ''Linux Magazine''] about BOINC and knowing the mathematics department had access to a suitable workstation, he launched NumberFields@Home to meet the computational demand.{{cite web |title=NumberFields@home - Methods |url=https://numberfields.asu.edu/NumberFields/ProjectDescription.html |publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> The project went online in '''August 2011'''. In an early forum post, Driver noted that the project had been under construction and work-generation processes still needed automation - yet the response from the distributed computing community was enthusiastic enough to quickly exhaust the initial work queue.{{cite web |title=NumberFields@home still under construction |url=https://numberfields.asu.edu/NumberFields/forum_thread.php?id=1 |publisher=numberfields.asu.edu |date=8 August 2011 |access-date=2026-05-29}}<br /> <br /> A significant milestone arrived in '''May 2016''', when the primary ''bounded'' application completed its multi-year search and found all imprimitive degree-10 fields with absolute discriminant less than or equal to &lt;math&gt;1.2 \times 10^{11}&lt;/math&gt;. In '''July 2016''', a focused special search located a particularly elusive hypothesised field: an &lt;math&gt;A_5&lt;/math&gt; extension of &lt;math&gt;\mathbf{Q}(\sqrt{421})&lt;/math&gt; ramified only at 2, after roughly ten months of intermittent searching.{{cite web |title=2016 year in review |url=https://numberfields.asu.edu/NumberFields/forum_thread.php?id=310 |publisher=numberfields.asu.edu |date=14 January 2017 |access-date=2026-05-29}}<br /> <br /> In '''August 2022''', Driver shared news that his doctoral thesis advisor - the project's primary institutional benefactor at ASU - had retired. While the university permitted the project to continue running, it would no longer fund hardware upgrades, meaning the project's lifespan is now tied to the longevity of the existing server hardware.{{cite web |title=Future of the Project |url=https://numberfields.asu.edu/NumberFields/forum_thread.php?id=520 |publisher=numberfields.asu.edu |date=10 August 2022 |access-date=2026-05-29}} As of 2026, NumberFields@Home remains active, collaborating with the '''[[wikipedia:BOINC|BOINC]]'''-based [https://gerasim.boinc.ru/ Gerasim@Home] project to cross-check and complete certain sub-searches.{{cite web |title=2025 Year End Summary |url=https://numberfields.asu.edu/NumberFields |publisher=numberfields.asu.edu |date=1 January 2026 |access-date=2026-05-29}}<br /> <br /> == Why NumberFields@Home? ==<br /> <br /> Fields are important mathematical constructs that have far-reaching applications to many branches of mathematics. Many people are familiar with the fields of rational numbers, real numbers, and complex numbers. The fields we are concerned with in this project are number fields: subsets of the complex numbers which contain the root of a given polynomial and are minimal for then being closed under addition, subtraction, multiplication, and division (except for division by 0). In particular, we are interested in imprimitive degree 10 fields (called decic fields), which correspond to certain degree 10 polynomials.<br /> <br /> Number theorists can mine the data for interesting patterns to help them formulate conjectures about number fields. Ultimately, this research will lead to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Another application of number fields is in [[wikipedia:Cryptography|'''''cryptography''''']], where they are used in sophisticated factoring algorithms and as the basis for new cryptosystems. There are also distant applications to mathematical physics, including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].<br /> <br /> == Goals ==<br /> <br /> One way to categorise fields is by the primes that ''ramify'' in them. For a given set of primes, the number of fields ramified at those primes is finite (a classical theorem of [[wikipedia:Charles_Hermite|Hermite]]). The primary goal of the project is to find this finite set of fields for various sets of primes. Since the number of combinations of primes is unlimited, the project will remain open-ended for the foreseeable future.<br /> <br /> Another way to categorise fields is by their '''[[wikipedia:Discriminant_of_an_algebraic_number_field|discriminant]]''', which is an important invariant. Given a fixed bound &lt;math&gt;B&lt;/math&gt;, there are only finitely many fields whose absolute discriminant does not exceed &lt;math&gt;B&lt;/math&gt;. A secondary goal of the project is to determine the finite set of ''minimum discriminant'' imprimitive decic fields for the bound<br /> <br /> <br /> &lt;math&gt;B = 1.2 \times 10^{11}&lt;/math&gt;<br /> <br /> This bound was chosen for its potential to find more fields while keeping the computational load manageable.{{cite web |title=NumberFields@home project description |url=https://numberfields.asu.edu/NumberFields/ProjectDescription.html |publisher=Arizona State University |access-date=2026-05-29}} That search was completed in May 2016.{{cite web |title=2016 year in review |url=https://numberfields.asu.edu/NumberFields/forum_thread.php?id=310 |publisher=numberfields.asu.edu |date=14 January 2017 |access-date=2026-05-29}}<br /> <br /> [[Image:Polynomialdeg3.png|right|thumb|250px|The graph of a degree-3 polynomial. NumberFields@Home searches over polynomials of degree 10 whose roots generate number fields with prescribed properties.]]<br /> <br /> == Methods ==<br /> <br /> Computing lower-degree fields requires less processing power and such fields have been more extensively tabulated; the degree-10 case is the first case requiring a massively parallel solution. Finite extension fields are represented by polynomials - that is, they are of the form &lt;math&gt;\mathbf{Q}(\alpha)&lt;/math&gt;, where &lt;math&gt;\alpha&lt;/math&gt; is the root of a polynomial. Bounds on the field discriminant give rise to bounds on the polynomial coefficients, so there are a finite number of possible polynomials that can represent the fields being searched for.<br /> <br /> At the most basic level, the NumberFields@Home algorithm searches over this finite set of polynomials, checking whether or not a given polynomial can represent a field with the desired discriminant and ramification properties. At a finer level, the algorithm uses theoretical arguments to reduce the polynomial search space. In addition, the targeted ramification structure gives rise to congruence relations on the polynomial coefficients, which further reduces the search space. Anybody interested in the finer details of the algorithm is encouraged to look through [https://numberfields.asu.edu/NumberFields/Dissertation.pdf Eric D. Driver's doctoral dissertation].{{cite web |title=Eric D. Driver's dissertation |url=https://numberfields.asu.edu/NumberFields/Dissertation.pdf |publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> === Software stack ===<br /> <br /> The application relies on two key open-source libraries:{{cite web |title=GPU app status update |url=https://tsbt.co.uk/forum/viewtopic.php?t=12560 |publisher=The Scottish BOINC Team |access-date=2026-05-29}}<br /> <br /> * '''[[wikipedia:PARI/GP|PARI/GP]]''' - a computer algebra system widely used in number theory, providing polynomial arithmetic and discriminant computations.<br /> * '''[[wikipedia:GNU_Multiple_Precision_Arithmetic_Library|GMP]]''' (GNU Multiple Precision Arithmetic Library) - multi-precision integer arithmetic, necessary because the integers involved can exceed standard 64-bit representation.<br /> <br /> A significant technical challenge arose during GPU application development: both PARI/GP and GMP rely on dynamically allocated memory, which is incompatible with GPU kernels. Driver solved this by using a fixed-precision multi-precision library with precision hard-coded to the maximum required (approximately 750 bits), allowing compilation of a working GPU kernel.{{cite web |title=GPU app status update (The Scottish BOINC Team) |url=https://tsbt.co.uk/forum/viewtopic.php?t=12560 |publisher=tsbt.co.uk |access-date=2026-05-29}}<br /> <br /> === Application versions ===<br /> <br /> The project currently distributes its '''Get Decic Fields''' application in multiple variants targeting different hardware:{{cite web |title=NumberFields@home Applications |url=https://numberfields.asu.edu/NumberFields/apps.php |publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Platform !! Variant !! Notes<br /> |-<br /> | Windows x86-64 || Default (CPU) v4.00 || ~20,622 GigaFLOPS average<br /> |-<br /> | Windows x86-64 || OpenCL AMD || GPU variant<br /> |-<br /> | Windows x86-64 || OpenCL NVIDIA || GPU variant<br /> |-<br /> | Linux x86-64 || Default (CPU) v4.00 || ~8,860 GigaFLOPS average<br /> |-<br /> | Linux x86-64 || CUDA || NVIDIA GPU variant<br /> |-<br /> | Linux x86-64 || OpenCL AMD || AMD GPU variant<br /> |-<br /> | macOS (Intel) || Default (CPU) v3.00 || ~887 GigaFLOPS average<br /> |}<br /> <br /> The GPU application is reported to be roughly 20 to 30 times faster than the older CPU version, and 2 to 3 times faster than a newer optimised CPU version released alongside the GPU work.{{cite web |title=GPU app status update |url=https://tsbt.co.uk/forum/viewtopic.php?t=12560 |publisher=The Scottish BOINC Team |access-date=2026-05-29}} The combined average computing across all platforms is approximately '''47,566 GigaFLOPS'''.{{cite web |title=NumberFields@home Applications |url=https://numberfields.asu.edu/NumberFields/apps.php |publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> === Results database ===<br /> <br /> The results of NumberFields@Home contribute to an online searchable number field database maintained jointly by John W. Jones and David P. Roberts at ASU. Tabulated results are also integrated into the '''[[wikipedia:L-functions_and_Modular_Forms_Database|LMFDB]]''' (L-functions and Modular Forms Database).{{cite web |title=NumberFields@home |url=https://numberfields.asu.edu/NumberFields/ |publisher=Arizona State University |access-date=2026-05-29}}{{cite journal |last1=Jones |first1=John W. |last2=Roberts |first2=David P. |title=A database of number fields |journal=LMS Journal of Computation and Mathematics |year=2014 |volume=17 |pages=595-618 |doi=10.1112/S1461157014000424}}<br /> <br /> == Research areas ==<br /> <br /> The project as a whole is basic research - in effect, charting unknown mathematical territory. The following sections describe the broader research contexts to which the tabulated data contributes.<br /> <br /> ==== Automorphic Forms ====<br /> <br /> Number fields are related to [[wikipedia:Automorphic_form|'''''automorphic forms''''']], which form one side of the '''[[wikipedia:Langlands_program|Langlands program]]''' - a vast web of conjectures connecting number theory and representation theory. '''[https://www.quantamagazine.org/what-is-the-langlands-program-20220601/ Explanations for the Langlands program]'''. ('''[https://youtu.be/_bJeKUosqoY See video: The Biggest Project in Modern Mathematics]''')<br /> <br /> [[Image:Dedekind Eta.jpg|none|thumb|500px|The [[wikipedia:Dedekind_eta_function|'''''Dedekind eta-function''''']] is an automorphic form in the complex plane.]]<br /> <br /> There are deep connections between automorphic forms and number fields: knowing an automorphic form gives information about the ramifying primes of the corresponding number fields.<br /> <br /> ==== Cryptography ====<br /> <br /> Number fields are used in some modern factoring algorithms relevant to attacks on [[wikipedia:RSA_(cryptosystem)|RSA]]. Other researchers have investigated using properties of number fields as the basis for new cryptosystems. It is not clear which number fields will prove most useful in this research, but the more we know about the general landscape of number fields, the better.<br /> <br /> ==== Arithmetic Statistics ====<br /> <br /> There has been both progress and new conjectures in recent years on asymptotic questions about number fields. If one fixes the degree &lt;math&gt;n&lt;/math&gt; and a bound &lt;math&gt;B&lt;/math&gt;, there are finitely many degree-''n'' number fields with absolute discriminant at most &lt;math&gt;B&lt;/math&gt;. One can then ask how this count grows as a function of &lt;math&gt;B&lt;/math&gt;.<br /> <br /> Researchers have also been factoring the [[wikipedia:Galois_group|Galois group]] of the extension into consideration. At present, there is very little data in degree 10, and imprimitive fields produce a large number of different Galois groups.<br /> <br /> One can also ask about asymptotics based on the set of ramifying primes. There is even less data currently available for investigating questions of this sort. Before one can seriously consider asymptotics, it is useful to know where the first examples lie. NumberFields@Home has helped establish the first known examples of imprimitive decic number fields with certain Galois groups. One can also consider ''first examples'' from the perspective of the '''Galois root discriminant (GRD)''' of the field. Some [http://hobbes.la.asu.edu/lowgrd/ results for low GRD fields can be found here].<br /> <br /> ==== Theoretical Physics ====<br /> <br /> The fields studied by this project have connections to the [[wikipedia:P-adic_number|p-adic fields]]. In recent years, p-adic analysis has been applied to problems in theoretical physics, including quantum mechanics and string theory. [[wikipedia:P-adic_quantum_mechanics|Here is a good introduction]] to the relevant concepts. It is too early to tell exactly how beneficial the tables of fields will be to the physics community.<br /> <br /> == Project team / Sponsors ==<br /> <br /> * '''Eric D. Driver''' - Project founder, administrator, developer, and scientist. [https://math.asu.edu/ School of Mathematics] at Arizona State University.<br /> * '''Greg Tucker''' - assists Driver with the project and its applications.{{cite web |title=NumberFields@home user profiles |url=https://numberfields.asu.edu/NumberFields/user_profile/profile_country_United_States_1.html |publisher=numberfields.asu.edu |access-date=2026-05-29}}<br /> <br /> The project is based at and was sponsored by the ASU School of Mathematics. Following the retirement of Driver's thesis advisor in May 2022, the primary institutional sponsorship ended, though ASU has permitted the project to continue on existing hardware.{{cite web |title=Future of the Project |url=https://numberfields.asu.edu/NumberFields/forum_thread.php?id=520 |publisher=numberfields.asu.edu |date=10 August 2022 |access-date=2026-05-29}}<br /> <br /> == Scientific results ==<br /> <br /> * Complete tables of imprimitive decic number fields with absolute discriminant &lt;math&gt;\leq 1.2 \times 10^{11}&lt;/math&gt; (completed May 2016).<br /> * First known examples of imprimitive decic fields for numerous Galois group types.<br /> * Tables of low Galois root discriminant (GRD) imprimitive decic fields: [http://hobbes.la.asu.edu/lowgrd/ results for low GRD fields].<br /> * Full results in table form: '''''https://numberfields.asu.edu/NumberFields/FieldTables/FieldTables.html'''''<br /> * Searchable database integration with the LMFDB: [http://www.lmfdb.org/NumberField/ www.lmfdb.org/NumberField/]<br /> <br /> == Scientific publications ==<br /> <br /> # Driver, Eric D. and John W. Jones. [https://linkinghub.elsevier.com/retrieve/pii/S0022314X19300988 '''''Computing septic number fields''''']. ''Journal of Number Theory'' (2019). DOI: 10.1016/j.jnt.2019.02.022.<br /> # Driver, Eric D. and John W. Jones. [http://www.tandfonline.com/doi/abs/10.1080/10586458.2010.10390637 '''''Minimum Discriminants of Imprimitive Decic Fields''''']. ''Experimental Mathematics'' (2010). DOI: 10.1080/10586458.2010.10390637.<br /> # Driver, Eric D. and John W. Jones. [https://ui.adsabs.harvard.edu/abs/2009MaCom..78.1109D '''''A targeted Martinet search''''']. ''Mathematics of Computation'' (2009). DOI: 10.1090/S0025-5718-08-02178-9.<br /> # Jones, John W. and David P. Roberts. [https://doi.org/10.1112/S1461157014000424 '''''A database of number fields''''']. ''LMS Journal of Computation and Mathematics'' 17 (2014), pp. 595-618. DOI: 10.1112/S1461157014000424.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:Berkeley_Open_Infrastructure_for_Network_Computing|Berkeley Open Infrastructure for Network Computing (BOINC)]]<br /> * [[wikipedia:Algebraic_number_field|Algebraic number field]]<br /> * [[wikipedia:Discriminant_of_an_algebraic_number_field|Discriminant of an algebraic number field]]<br /> * [[wikipedia:Langlands_program|Langlands program]]<br /> * [[wikipedia:Volunteer_computing|Volunteer computing]]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> == External links ==<br /> <br /> * [https://numberfields.asu.edu/NumberFields/ NumberFields@Home official website]<br /> * [http://hobbes.la.asu.edu/NFDB/ ASU Number Fields Database]<br /> * [http://www.lmfdb.org/NumberField/ LMFDB Number Fields search]<br /> * [https://numberfields.asu.edu/NumberFields/Dissertation.pdf Eric D. Driver's doctoral dissertation (PDF)]<br /> * [http://hobbes.la.asu.edu/lowgrd/ Low Galois root discriminant results]<br /> * [https://pari.math.u-bordeaux.fr/Events/PARI2016/talks/NumberFields_PARIworkshop.pdf Eric D. Driver - A Number Fields Database (PARI workshop slides, 2016)]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1472 2026-05-30T11:24:35Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = NumberFields@home<br /> | logo = Nf.jpg<br /> | logo caption = NumberFields@home logo<br /> | status = Active<br /> | category = Mathematics / Algebraic Number Theory<br /> | compute = CPU &amp;amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Eric D. Driver<br /> | author = Eric D. Driver<br /> | sponsor = Arizona State University School of Mathematics<br /> | maintainer = Eric D. Driver, Greg Tucker<br /> | released = August 2011<br /> <br /> | programming language = C, C++ (PARI/GP, GMP)<br /> | operating system = Windows, Linux, macOS (x86)<br /> <br /> | stats as of = May 2026<br /> | average performance = ~47,566 GigaFLOPS<br /> | website = https://numberfields.asu.edu/NumberFields/<br /> }}<br /> <br /> BOINC project '''''[https://numberfields.asu.edu/NumberFields/ NumberFields@home]''''' is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that needs your help to search for fields with special properties.<br /> <br /> [[Image:Algebraicszoom.png|right|thumb|300px|A visualisation of the [[wikipedia:Algebraic_number|algebraic numbers]] in the [[wikipedia:Complex_plane|complex plane]]. Number fields are algebraic extensions of the rationals whose elements lie among these points.]]<br /> <br /> == Background ==<br /> <br /> Fields are important mathematical constructs with far-reaching applications across many branches of mathematics. Most people are familiar with everyday examples such as the field of [[wikipedia:Rational_number|rational numbers]] &lt;math&gt;\mathbf{Q}&lt;/math&gt;, the [[wikipedia:Real_number|real numbers]] &lt;math&gt;\mathbf{R}&lt;/math&gt;, and the [[wikipedia:Complex_number|complex numbers]] &lt;math&gt;\mathbf{C}&lt;/math&gt;. The fields studied by NumberFields@home are '''[[wikipedia:Algebraic_number_field|number fields]]''': algebraic extension fields of the rationals of finite degree. More precisely, a number field is a subset of &lt;math&gt;\mathbf{C}&lt;/math&gt; which contains the root &lt;math&gt;\alpha&lt;/math&gt; of a given polynomial and is minimal while remaining closed under addition, subtraction, multiplication, and division (excepting division by zero).{{cite web |title=What is NumberFields@home?|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> Formally, every number field &lt;math&gt;K&lt;/math&gt; of degree &lt;math&gt;n&lt;/math&gt; over &lt;math&gt;\mathbf{Q}&lt;/math&gt; may be written as<br /> <br /> <br /> &lt;math&gt;K = \mathbf{Q}(\alpha)&lt;/math&gt;<br /> <br /> where &lt;math&gt;\alpha&lt;/math&gt; is a root of some irreducible polynomial of degree &lt;math&gt;n&lt;/math&gt; with rational coefficients.{{cite web |title=Algebraic number field|publisher=Wikipedia |access-date=2026-05-29}} The project is principally interested in '''imprimitive degree-10 fields''' (called '''decic fields'''), which correspond to certain degree-10 polynomials. An imprimitive field is one that contains a proper intermediate subfield strictly between &lt;math&gt;\mathbf{Q}&lt;/math&gt; and itself, as opposed to primitive fields whose Galois closure has an irreducible Galois group.<br /> <br /> Number theorists can mine tabulated data for patterns to help formulate conjectures about number fields, leading to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Among the practical applications are [[wikipedia:Cryptography|'''''cryptography''''']], where number fields underpin sophisticated factoring algorithms and novel cryptosystems, and theoretical physics including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].{{cite web |title=NumberFields@home project description|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> == History ==<br /> <br /> The project was founded by '''Eric D. Driver''', a researcher associated with the School of Mathematics at '''[[wikipedia:Arizona_State_University|Arizona State University]]''' (ASU). Driver recognised that computing lower-degree number fields requires comparatively modest resources and that such fields had already been extensively tabulated, but the degree-10 case was the first case demanding a massively parallel computational solution. After reading an article in ''Linux Magazine'' about BOINC and knowing the mathematics department had access to a suitable workstation, he launched NumberFields@home to meet the computational demand.{{cite web |title=NumberFields@home - Methods|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> The project went online in '''August 2011'''. In an early forum post, Driver noted that the project had been under construction and work-generation processes still needed automation - yet the response from the distributed computing community was enthusiastic enough to quickly exhaust the initial work queue.{{cite web |title=NumberFields@home still under construction|publisher=numberfields.asu.edu |date=8 August 2011 |access-date=2026-05-29}}<br /> <br /> A significant milestone arrived in '''May 2016''', when the primary ''bounded'' application completed its multi-year search and found all imprimitive degree-10 fields with absolute discriminant less than or equal to &lt;math&gt;1.2 \times 10^{11}&lt;/math&gt;. In '''July 2016''', a focused special search located a particularly elusive hypothesised field: an &lt;math&gt;A_5&lt;/math&gt; extension of &lt;math&gt;\mathbf{Q}(\sqrt{421})&lt;/math&gt; ramified only at 2, after roughly ten months of intermittent searching.{{cite web |title=2016 year in review|publisher=numberfields.asu.edu |date=14 January 2017 |access-date=2026-05-29}}<br /> <br /> In '''August 2022''', Driver shared news that his doctoral thesis advisor - the project's primary institutional benefactor at ASU - had retired. While the university permitted the project to continue running, it would no longer fund hardware upgrades, meaning the project's lifespan is now tied to the longevity of the existing server hardware.{{cite web |title=Future of the Project|publisher=numberfields.asu.edu |date=10 August 2022 |access-date=2026-05-29}} As of 2026, NumberFields@home remains active, collaborating with the '''[[wikipedia:BOINC|BOINC]]'''-based Gerasim@Home project to cross-check and complete certain sub-searches.{{cite web |title=2025 Year End Summary|publisher=numberfields.asu.edu |date=1 January 2026 |access-date=2026-05-29}}<br /> <br /> == Why NumberFields@home? ==<br /> <br /> Fields are important mathematical constructs that have far-reaching applications to many branches of mathematics. Many people are familiar with the fields of rational numbers, real numbers, and complex numbers. The fields we are concerned with in this project are number fields: subsets of the complex numbers which contain the root of a given polynomial and are minimal for then being closed under addition, subtraction, multiplication, and division (except for division by 0). In particular, we are interested in imprimitive degree 10 fields (called decic fields), which correspond to certain degree 10 polynomials.<br /> <br /> Number theorists can mine the data for interesting patterns to help them formulate conjectures about number fields. Ultimately, this research will lead to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Another application of number fields is in [[wikipedia:Cryptography|'''''cryptography''''']], where they are used in sophisticated factoring algorithms and as the basis for new cryptosystems. There are also distant applications to mathematical physics, including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].<br /> <br /> == Goals ==<br /> <br /> One way to categorise fields is by the primes that ''ramify'' in them. For a given set of primes, the number of fields ramified at those primes is finite (a classical theorem of [[wikipedia:Charles_Hermite|Hermite]]). The primary goal of the project is to find this finite set of fields for various sets of primes. Since the number of combinations of primes is unlimited, the project will remain open-ended for the foreseeable future.<br /> <br /> Another way to categorise fields is by their '''[[wikipedia:Discriminant_of_an_algebraic_number_field|discriminant]]''', which is an important invariant. Given a fixed bound &lt;math&gt;B&lt;/math&gt;, there are only finitely many fields whose absolute discriminant does not exceed &lt;math&gt;B&lt;/math&gt;. A secondary goal of the project is to determine the finite set of ''minimum discriminant'' imprimitive decic fields for the bound<br /> <br /> <br /> &lt;math&gt;B = 1.2 \times 10^{11}&lt;/math&gt;<br /> <br /> This bound was chosen for its potential to find more fields while keeping the computational load manageable.{{cite web |title=NumberFields@home project description|publisher=Arizona State University |access-date=2026-05-29}} That search was completed in May 2016.{{cite web |title=2016 year in review|publisher=numberfields.asu.edu |date=14 January 2017 |access-date=2026-05-29}}<br /> <br /> [[Image:Polynomialdeg3.png|right|thumb|250px|The graph of a degree-3 polynomial. NumberFields@Home searches over polynomials of degree 10 whose roots generate number fields with prescribed properties.]]<br /> <br /> == Methods ==<br /> <br /> Computing lower-degree fields requires less processing power and such fields have been more extensively tabulated; the degree-10 case is the first case requiring a massively parallel solution. Finite extension fields are represented by polynomials - that is, they are of the form &lt;math&gt;\mathbf{Q}(\alpha)&lt;/math&gt;, where &lt;math&gt;\alpha&lt;/math&gt; is the root of a polynomial. Bounds on the field discriminant give rise to bounds on the polynomial coefficients, so there are a finite number of possible polynomials that can represent the fields being searched for.<br /> <br /> At the most basic level, the NumberFields@home algorithm searches over this finite set of polynomials, checking whether or not a given polynomial can represent a field with the desired discriminant and ramification properties. At a finer level, the algorithm uses theoretical arguments to reduce the polynomial search space. In addition, the targeted ramification structure gives rise to congruence relations on the polynomial coefficients, which further reduces the search space. Anybody interested in the finer details of the algorithm is encouraged to look through [numberfields.asu.edu/NumberFields/Dissertation.pdf Eric D. Driver's doctoral dissertation].{{cite web |title=Eric D. Driver's dissertation|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> === Software stack ===<br /> <br /> The application relies on two key open-source libraries:{{cite web |title=GPU app status update|publisher=The Scottish BOINC Team |access-date=2026-05-29}}<br /> <br /> * '''[[wikipedia:PARI/GP|PARI/GP]]''' - a computer algebra system widely used in number theory, providing polynomial arithmetic and discriminant computations.<br /> * '''[[wikipedia:GNU_Multiple_Precision_Arithmetic_Library|GMP]]''' (GNU Multiple Precision Arithmetic Library) - multi-precision integer arithmetic, necessary because the integers involved can exceed standard 64-bit representation.<br /> <br /> A significant technical challenge arose during GPU application development: both PARI/GP and GMP rely on dynamically allocated memory, which is incompatible with GPU kernels. Driver solved this by using a fixed-precision multi-precision library with precision hard-coded to the maximum required (approximately 750 bits), allowing compilation of a working GPU kernel.{{cite web |title=GPU app status update (The Scottish BOINC Team)|publisher=tsbt.co.uk |access-date=2026-05-29}}<br /> <br /> === Application versions ===<br /> <br /> The project currently distributes its '''Get Decic Fields''' application in multiple variants targeting different hardware:{{cite web |title=NumberFields@home Applications|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Platform !! Variant !! Notes<br /> |-<br /> | Windows x86-64 || Default (CPU) v4.00 || ~20,622 GigaFLOPS average<br /> |-<br /> | Windows x86-64 || OpenCL AMD || GPU variant<br /> |-<br /> | Windows x86-64 || OpenCL NVIDIA || GPU variant<br /> |-<br /> | Linux x86-64 || Default (CPU) v4.00 || ~8,860 GigaFLOPS average<br /> |-<br /> | Linux x86-64 || CUDA || NVIDIA GPU variant<br /> |-<br /> | Linux x86-64 || OpenCL AMD || AMD GPU variant<br /> |-<br /> | macOS (Intel) || Default (CPU) v3.00 || ~887 GigaFLOPS average<br /> |}<br /> <br /> The GPU application is reported to be roughly 20 to 30 times faster than the older CPU version, and 2 to 3 times faster than a newer optimised CPU version released alongside the GPU work.{{cite web |title=GPU app status update|publisher=The Scottish BOINC Team |access-date=2026-05-29}} The combined average computing across all platforms is approximately '''47,566 GigaFLOPS'''.{{cite web |title=NumberFields@home Applications|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> === Results database ===<br /> <br /> The results of NumberFields@home contribute to an online searchable number field database maintained jointly by John W. Jones and David P. Roberts at ASU. Tabulated results are also integrated into the '''[[wikipedia:L-functions_and_Modular_Forms_Database|LMFDB]]''' (L-functions and Modular Forms Database).{{cite web |title=NumberFields@home|publisher=Arizona State University |access-date=2026-05-29}}{{cite journal |last1=Jones |first1=John W. |last2=Roberts |first2=David P. |title=A database of number fields |journal=LMS Journal of Computation and Mathematics |year=2014 |volume=17 |pages=595-618 |doi=10.1112/S1461157014000424}}<br /> <br /> == Research areas ==<br /> <br /> The project as a whole is basic research - in effect, charting unknown mathematical territory. The following sections describe the broader research contexts to which the tabulated data contributes.<br /> <br /> ==== Automorphic Forms ====<br /> <br /> Number fields are related to [[wikipedia:Automorphic_form|'''''automorphic forms''''']], which form one side of the '''[[wikipedia:Langlands_program|Langlands program]]''' - a vast web of conjectures connecting number theory and representation theory. '''Explanations for the Langlands program'''. ('''See video: The Biggest Project in Modern Mathematics''')<br /> <br /> [[Image:Dedekind Eta.jpg|none|thumb|500px|The [[wikipedia:Dedekind_eta_function|'''''Dedekind eta-function''''']] is an automorphic form in the complex plane.]]<br /> <br /> There are deep connections between automorphic forms and number fields: knowing an automorphic form gives information about the ramifying primes of the corresponding number fields.<br /> <br /> ==== Cryptography ====<br /> <br /> Number fields are used in some modern factoring algorithms relevant to attacks on [[wikipedia:RSA_(cryptosystem)|RSA]]. Other researchers have investigated using properties of number fields as the basis for new cryptosystems. It is not clear which number fields will prove most useful in this research, but the more we know about the general landscape of number fields, the better.<br /> <br /> ==== Arithmetic Statistics ====<br /> <br /> There has been both progress and new conjectures in recent years on asymptotic questions about number fields. If one fixes the degree &lt;math&gt;n&lt;/math&gt; and a bound &lt;math&gt;B&lt;/math&gt;, there are finitely many degree-''n'' number fields with absolute discriminant at most &lt;math&gt;B&lt;/math&gt;. One can then ask how this count grows as a function of &lt;math&gt;B&lt;/math&gt;.<br /> <br /> Researchers have also been factoring the [[wikipedia:Galois_group|Galois group]] of the extension into consideration. At present, there is very little data in degree 10, and imprimitive fields produce a large number of different Galois groups.<br /> <br /> One can also ask about asymptotics based on the set of ramifying primes. There is even less data currently available for investigating questions of this sort. Before one can seriously consider asymptotics, it is useful to know where the first examples lie. NumberFields@home has helped establish the first known examples of imprimitive decic number fields with certain Galois groups. One can also consider ''first examples'' from the perspective of the '''Galois root discriminant (GRD)''' of the field. Some results for low GRD fields can be found here.<br /> <br /> ==== Theoretical Physics ====<br /> <br /> The fields studied by this project have connections to the [[wikipedia:P-adic_number|p-adic fields]]. In recent years, p-adic analysis has been applied to problems in theoretical physics, including quantum mechanics and string theory. [[wikipedia:P-adic_quantum_mechanics|Here is a good introduction]] to the relevant concepts. It is too early to tell exactly how beneficial the tables of fields will be to the physics community.<br /> <br /> == Project team / Sponsors ==<br /> <br /> * '''Eric D. Driver''' - Project founder, administrator, developer, and scientist. School of Mathematics at Arizona State University.<br /> * '''Greg Tucker''' - assists Driver with the project and its applications.{{cite web |title=NumberFields@home user profiles|publisher=numberfields.asu.edu |access-date=2026-05-29}}<br /> <br /> The project is based at and was sponsored by the ASU School of Mathematics. Following the retirement of Driver's thesis advisor in May 2022, the primary institutional sponsorship ended, though ASU has permitted the project to continue on existing hardware.{{cite web |title=Future of the Project|publisher=numberfields.asu.edu |date=10 August 2022 |access-date=2026-05-29}}<br /> <br /> == Scientific results ==<br /> <br /> * Complete tables of imprimitive decic number fields with absolute discriminant &lt;math&gt;\leq 1.2 \times 10^{11}&lt;/math&gt; (completed May 2016).<br /> * First known examples of imprimitive decic fields for numerous Galois group types.<br /> * Tables of low Galois root discriminant (GRD) imprimitive decic fields: results for low GRD fields.<br /> * Full results in table form: numberfields.asu.edu/NumberFields/FieldTables/FieldTables.html<br /> * Searchable database integration with the LMFDB: www.lmfdb.org/NumberField/<br /> <br /> == Scientific publications ==<br /> <br /> # Driver, Eric D. and John W. Jones. '''''Computing septic number fields'''''. ''Journal of Number Theory'' (2019). DOI: 10.1016/j.jnt.2019.02.022.<br /> # Driver, Eric D. and John W. Jones. '''''Minimum Discriminants of Imprimitive Decic Fields'''''. ''Experimental Mathematics'' (2010). DOI: 10.1080/10586458.2010.10390637.<br /> # Driver, Eric D. and John W. Jones. '''''A targeted Martinet search'''''. ''Mathematics of Computation'' (2009). DOI: 10.1090/S0025-5718-08-02178-9.<br /> # Jones, John W. and David P. Roberts. '''''A database of number fields'''''. ''LMS Journal of Computation and Mathematics'' 17 (2014), pp. 595-618. DOI: 10.1112/S1461157014000424.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:Berkeley_Open_Infrastructure_for_Network_Computing|Berkeley Open Infrastructure for Network Computing (BOINC)]]<br /> * [[wikipedia:Algebraic_number_field|Algebraic number field]]<br /> * [[wikipedia:Discriminant_of_an_algebraic_number_field|Discriminant of an algebraic number field]]<br /> * [[wikipedia:Langlands_program|Langlands program]]<br /> * [[wikipedia:Volunteer_computing|Volunteer computing]]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> == External links ==<br /> <br /> * NumberFields@home official website: numberfields.asu.edu/NumberFields/<br /> * ASU Number Fields Database<br /> * LMFDB Number Fields search<br /> * Eric D. Driver's doctoral dissertation (PDF): numberfields.asu.edu/NumberFields/Dissertation.pdf<br /> * Low Galois root discriminant results<br /> * Eric D. Driver - A Number Fields Database (PARI workshop slides, 2016)</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1470 2026-05-30T03:01:59Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = NumberFields@home<br /> | logo = Nf.jpg<br /> | logo caption = NumberFields@home logo<br /> | status = Active<br /> | category = Mathematics / Algebraic Number Theory<br /> | compute = CPU &amp;amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Eric D. Driver<br /> | author = Eric D. Driver<br /> | sponsor = Arizona State University School of Mathematics<br /> | maintainer = Eric D. Driver, Greg Tucker<br /> | released = August 2011<br /> <br /> | programming language = C, C++ (PARI/GP, GMP)<br /> | operating system = Windows, Linux, macOS (x86)<br /> <br /> | stats as of = May 2026<br /> | average performance = ~47,566 GigaFLOPS<br /> | website = numberfields.asu.edu/NumberFields/<br /> }}<br /> <br /> BOINC project '''''NumberFields@home''''' is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that needs your help to search for fields with special properties.<br /> <br /> [[Image:Algebraicszoom.png|right|thumb|300px|A visualisation of the [[wikipedia:Algebraic_number|algebraic numbers]] in the [[wikipedia:Complex_plane|complex plane]]. Number fields are algebraic extensions of the rationals whose elements lie among these points.]]<br /> <br /> == Background ==<br /> <br /> Fields are important mathematical constructs with far-reaching applications across many branches of mathematics. Most people are familiar with everyday examples such as the field of [[wikipedia:Rational_number|rational numbers]] &lt;math&gt;\mathbf{Q}&lt;/math&gt;, the [[wikipedia:Real_number|real numbers]] &lt;math&gt;\mathbf{R}&lt;/math&gt;, and the [[wikipedia:Complex_number|complex numbers]] &lt;math&gt;\mathbf{C}&lt;/math&gt;. The fields studied by NumberFields@home are '''[[wikipedia:Algebraic_number_field|number fields]]''': algebraic extension fields of the rationals of finite degree. More precisely, a number field is a subset of &lt;math&gt;\mathbf{C}&lt;/math&gt; which contains the root &lt;math&gt;\alpha&lt;/math&gt; of a given polynomial and is minimal while remaining closed under addition, subtraction, multiplication, and division (excepting division by zero).{{cite web |title=What is NumberFields@home?|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> Formally, every number field &lt;math&gt;K&lt;/math&gt; of degree &lt;math&gt;n&lt;/math&gt; over &lt;math&gt;\mathbf{Q}&lt;/math&gt; may be written as<br /> <br /> <br /> &lt;math&gt;K = \mathbf{Q}(\alpha)&lt;/math&gt;<br /> <br /> where &lt;math&gt;\alpha&lt;/math&gt; is a root of some irreducible polynomial of degree &lt;math&gt;n&lt;/math&gt; with rational coefficients.{{cite web |title=Algebraic number field|publisher=Wikipedia |access-date=2026-05-29}} The project is principally interested in '''imprimitive degree-10 fields''' (called '''decic fields'''), which correspond to certain degree-10 polynomials. An imprimitive field is one that contains a proper intermediate subfield strictly between &lt;math&gt;\mathbf{Q}&lt;/math&gt; and itself, as opposed to primitive fields whose Galois closure has an irreducible Galois group.<br /> <br /> Number theorists can mine tabulated data for patterns to help formulate conjectures about number fields, leading to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Among the practical applications are [[wikipedia:Cryptography|'''''cryptography''''']], where number fields underpin sophisticated factoring algorithms and novel cryptosystems, and theoretical physics including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].{{cite web |title=NumberFields@home project description|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> == History ==<br /> <br /> The project was founded by '''Eric D. Driver''', a researcher associated with the School of Mathematics at '''[[wikipedia:Arizona_State_University|Arizona State University]]''' (ASU). Driver recognised that computing lower-degree number fields requires comparatively modest resources and that such fields had already been extensively tabulated, but the degree-10 case was the first case demanding a massively parallel computational solution. After reading an article in ''Linux Magazine'' about BOINC and knowing the mathematics department had access to a suitable workstation, he launched NumberFields@home to meet the computational demand.{{cite web |title=NumberFields@home - Methods|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> The project went online in '''August 2011'''. In an early forum post, Driver noted that the project had been under construction and work-generation processes still needed automation - yet the response from the distributed computing community was enthusiastic enough to quickly exhaust the initial work queue.{{cite web |title=NumberFields@home still under construction|publisher=numberfields.asu.edu |date=8 August 2011 |access-date=2026-05-29}}<br /> <br /> A significant milestone arrived in '''May 2016''', when the primary ''bounded'' application completed its multi-year search and found all imprimitive degree-10 fields with absolute discriminant less than or equal to &lt;math&gt;1.2 \times 10^{11}&lt;/math&gt;. In '''July 2016''', a focused special search located a particularly elusive hypothesised field: an &lt;math&gt;A_5&lt;/math&gt; extension of &lt;math&gt;\mathbf{Q}(\sqrt{421})&lt;/math&gt; ramified only at 2, after roughly ten months of intermittent searching.{{cite web |title=2016 year in review|publisher=numberfields.asu.edu |date=14 January 2017 |access-date=2026-05-29}}<br /> <br /> In '''August 2022''', Driver shared news that his doctoral thesis advisor - the project's primary institutional benefactor at ASU - had retired. While the university permitted the project to continue running, it would no longer fund hardware upgrades, meaning the project's lifespan is now tied to the longevity of the existing server hardware.{{cite web |title=Future of the Project|publisher=numberfields.asu.edu |date=10 August 2022 |access-date=2026-05-29}} As of 2026, NumberFields@home remains active, collaborating with the '''[[wikipedia:BOINC|BOINC]]'''-based Gerasim@Home project to cross-check and complete certain sub-searches.{{cite web |title=2025 Year End Summary|publisher=numberfields.asu.edu |date=1 January 2026 |access-date=2026-05-29}}<br /> <br /> == Why NumberFields@home? ==<br /> <br /> Fields are important mathematical constructs that have far-reaching applications to many branches of mathematics. Many people are familiar with the fields of rational numbers, real numbers, and complex numbers. The fields we are concerned with in this project are number fields: subsets of the complex numbers which contain the root of a given polynomial and are minimal for then being closed under addition, subtraction, multiplication, and division (except for division by 0). In particular, we are interested in imprimitive degree 10 fields (called decic fields), which correspond to certain degree 10 polynomials.<br /> <br /> Number theorists can mine the data for interesting patterns to help them formulate conjectures about number fields. Ultimately, this research will lead to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Another application of number fields is in [[wikipedia:Cryptography|'''''cryptography''''']], where they are used in sophisticated factoring algorithms and as the basis for new cryptosystems. There are also distant applications to mathematical physics, including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].<br /> <br /> == Goals ==<br /> <br /> One way to categorise fields is by the primes that ''ramify'' in them. For a given set of primes, the number of fields ramified at those primes is finite (a classical theorem of [[wikipedia:Charles_Hermite|Hermite]]). The primary goal of the project is to find this finite set of fields for various sets of primes. Since the number of combinations of primes is unlimited, the project will remain open-ended for the foreseeable future.<br /> <br /> Another way to categorise fields is by their '''[[wikipedia:Discriminant_of_an_algebraic_number_field|discriminant]]''', which is an important invariant. Given a fixed bound &lt;math&gt;B&lt;/math&gt;, there are only finitely many fields whose absolute discriminant does not exceed &lt;math&gt;B&lt;/math&gt;. A secondary goal of the project is to determine the finite set of ''minimum discriminant'' imprimitive decic fields for the bound<br /> <br /> <br /> &lt;math&gt;B = 1.2 \times 10^{11}&lt;/math&gt;<br /> <br /> This bound was chosen for its potential to find more fields while keeping the computational load manageable.{{cite web |title=NumberFields@home project description|publisher=Arizona State University |access-date=2026-05-29}} That search was completed in May 2016.{{cite web |title=2016 year in review|publisher=numberfields.asu.edu |date=14 January 2017 |access-date=2026-05-29}}<br /> <br /> [[Image:Polynomialdeg3.png|right|thumb|250px|The graph of a degree-3 polynomial. NumberFields@Home searches over polynomials of degree 10 whose roots generate number fields with prescribed properties.]]<br /> <br /> == Methods ==<br /> <br /> Computing lower-degree fields requires less processing power and such fields have been more extensively tabulated; the degree-10 case is the first case requiring a massively parallel solution. Finite extension fields are represented by polynomials - that is, they are of the form &lt;math&gt;\mathbf{Q}(\alpha)&lt;/math&gt;, where &lt;math&gt;\alpha&lt;/math&gt; is the root of a polynomial. Bounds on the field discriminant give rise to bounds on the polynomial coefficients, so there are a finite number of possible polynomials that can represent the fields being searched for.<br /> <br /> At the most basic level, the NumberFields@home algorithm searches over this finite set of polynomials, checking whether or not a given polynomial can represent a field with the desired discriminant and ramification properties. At a finer level, the algorithm uses theoretical arguments to reduce the polynomial search space. In addition, the targeted ramification structure gives rise to congruence relations on the polynomial coefficients, which further reduces the search space. Anybody interested in the finer details of the algorithm is encouraged to look through [numberfields.asu.edu/NumberFields/Dissertation.pdf Eric D. Driver's doctoral dissertation].{{cite web |title=Eric D. Driver's dissertation|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> === Software stack ===<br /> <br /> The application relies on two key open-source libraries:{{cite web |title=GPU app status update|publisher=The Scottish BOINC Team |access-date=2026-05-29}}<br /> <br /> * '''[[wikipedia:PARI/GP|PARI/GP]]''' - a computer algebra system widely used in number theory, providing polynomial arithmetic and discriminant computations.<br /> * '''[[wikipedia:GNU_Multiple_Precision_Arithmetic_Library|GMP]]''' (GNU Multiple Precision Arithmetic Library) - multi-precision integer arithmetic, necessary because the integers involved can exceed standard 64-bit representation.<br /> <br /> A significant technical challenge arose during GPU application development: both PARI/GP and GMP rely on dynamically allocated memory, which is incompatible with GPU kernels. Driver solved this by using a fixed-precision multi-precision library with precision hard-coded to the maximum required (approximately 750 bits), allowing compilation of a working GPU kernel.{{cite web |title=GPU app status update (The Scottish BOINC Team)|publisher=tsbt.co.uk |access-date=2026-05-29}}<br /> <br /> === Application versions ===<br /> <br /> The project currently distributes its '''Get Decic Fields''' application in multiple variants targeting different hardware:{{cite web |title=NumberFields@home Applications|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Platform !! Variant !! Notes<br /> |-<br /> | Windows x86-64 || Default (CPU) v4.00 || ~20,622 GigaFLOPS average<br /> |-<br /> | Windows x86-64 || OpenCL AMD || GPU variant<br /> |-<br /> | Windows x86-64 || OpenCL NVIDIA || GPU variant<br /> |-<br /> | Linux x86-64 || Default (CPU) v4.00 || ~8,860 GigaFLOPS average<br /> |-<br /> | Linux x86-64 || CUDA || NVIDIA GPU variant<br /> |-<br /> | Linux x86-64 || OpenCL AMD || AMD GPU variant<br /> |-<br /> | macOS (Intel) || Default (CPU) v3.00 || ~887 GigaFLOPS average<br /> |}<br /> <br /> The GPU application is reported to be roughly 20 to 30 times faster than the older CPU version, and 2 to 3 times faster than a newer optimised CPU version released alongside the GPU work.{{cite web |title=GPU app status update|publisher=The Scottish BOINC Team |access-date=2026-05-29}} The combined average computing across all platforms is approximately '''47,566 GigaFLOPS'''.{{cite web |title=NumberFields@home Applications|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> === Results database ===<br /> <br /> The results of NumberFields@home contribute to an online searchable number field database maintained jointly by John W. Jones and David P. Roberts at ASU. Tabulated results are also integrated into the '''[[wikipedia:L-functions_and_Modular_Forms_Database|LMFDB]]''' (L-functions and Modular Forms Database).{{cite web |title=NumberFields@home|publisher=Arizona State University |access-date=2026-05-29}}{{cite journal |last1=Jones |first1=John W. |last2=Roberts |first2=David P. |title=A database of number fields |journal=LMS Journal of Computation and Mathematics |year=2014 |volume=17 |pages=595-618 |doi=10.1112/S1461157014000424}}<br /> <br /> == Research areas ==<br /> <br /> The project as a whole is basic research - in effect, charting unknown mathematical territory. The following sections describe the broader research contexts to which the tabulated data contributes.<br /> <br /> ==== Automorphic Forms ====<br /> <br /> Number fields are related to [[wikipedia:Automorphic_form|'''''automorphic forms''''']], which form one side of the '''[[wikipedia:Langlands_program|Langlands program]]''' - a vast web of conjectures connecting number theory and representation theory. '''Explanations for the Langlands program'''. ('''See video: The Biggest Project in Modern Mathematics''')<br /> <br /> [[Image:Dedekind Eta.jpg|none|thumb|500px|The [[wikipedia:Dedekind_eta_function|'''''Dedekind eta-function''''']] is an automorphic form in the complex plane.]]<br /> <br /> There are deep connections between automorphic forms and number fields: knowing an automorphic form gives information about the ramifying primes of the corresponding number fields.<br /> <br /> ==== Cryptography ====<br /> <br /> Number fields are used in some modern factoring algorithms relevant to attacks on [[wikipedia:RSA_(cryptosystem)|RSA]]. Other researchers have investigated using properties of number fields as the basis for new cryptosystems. It is not clear which number fields will prove most useful in this research, but the more we know about the general landscape of number fields, the better.<br /> <br /> ==== Arithmetic Statistics ====<br /> <br /> There has been both progress and new conjectures in recent years on asymptotic questions about number fields. If one fixes the degree &lt;math&gt;n&lt;/math&gt; and a bound &lt;math&gt;B&lt;/math&gt;, there are finitely many degree-''n'' number fields with absolute discriminant at most &lt;math&gt;B&lt;/math&gt;. One can then ask how this count grows as a function of &lt;math&gt;B&lt;/math&gt;.<br /> <br /> Researchers have also been factoring the [[wikipedia:Galois_group|Galois group]] of the extension into consideration. At present, there is very little data in degree 10, and imprimitive fields produce a large number of different Galois groups.<br /> <br /> One can also ask about asymptotics based on the set of ramifying primes. There is even less data currently available for investigating questions of this sort. Before one can seriously consider asymptotics, it is useful to know where the first examples lie. NumberFields@home has helped establish the first known examples of imprimitive decic number fields with certain Galois groups. One can also consider ''first examples'' from the perspective of the '''Galois root discriminant (GRD)''' of the field. Some results for low GRD fields can be found here.<br /> <br /> ==== Theoretical Physics ====<br /> <br /> The fields studied by this project have connections to the [[wikipedia:P-adic_number|p-adic fields]]. In recent years, p-adic analysis has been applied to problems in theoretical physics, including quantum mechanics and string theory. [[wikipedia:P-adic_quantum_mechanics|Here is a good introduction]] to the relevant concepts. It is too early to tell exactly how beneficial the tables of fields will be to the physics community.<br /> <br /> == Project team / Sponsors ==<br /> <br /> * '''Eric D. Driver''' - Project founder, administrator, developer, and scientist. School of Mathematics at Arizona State University.<br /> * '''Greg Tucker''' - assists Driver with the project and its applications.{{cite web |title=NumberFields@home user profiles|publisher=numberfields.asu.edu |access-date=2026-05-29}}<br /> <br /> The project is based at and was sponsored by the ASU School of Mathematics. Following the retirement of Driver's thesis advisor in May 2022, the primary institutional sponsorship ended, though ASU has permitted the project to continue on existing hardware.{{cite web |title=Future of the Project|publisher=numberfields.asu.edu |date=10 August 2022 |access-date=2026-05-29}}<br /> <br /> == Scientific results ==<br /> <br /> * Complete tables of imprimitive decic number fields with absolute discriminant &lt;math&gt;\leq 1.2 \times 10^{11}&lt;/math&gt; (completed May 2016).<br /> * First known examples of imprimitive decic fields for numerous Galois group types.<br /> * Tables of low Galois root discriminant (GRD) imprimitive decic fields: results for low GRD fields.<br /> * Full results in table form: numberfields.asu.edu/NumberFields/FieldTables/FieldTables.html<br /> * Searchable database integration with the LMFDB: www.lmfdb.org/NumberField/<br /> <br /> == Scientific publications ==<br /> <br /> # Driver, Eric D. and John W. Jones. '''''Computing septic number fields'''''. ''Journal of Number Theory'' (2019). DOI: 10.1016/j.jnt.2019.02.022.<br /> # Driver, Eric D. and John W. Jones. '''''Minimum Discriminants of Imprimitive Decic Fields'''''. ''Experimental Mathematics'' (2010). DOI: 10.1080/10586458.2010.10390637.<br /> # Driver, Eric D. and John W. Jones. '''''A targeted Martinet search'''''. ''Mathematics of Computation'' (2009). DOI: 10.1090/S0025-5718-08-02178-9.<br /> # Jones, John W. and David P. Roberts. '''''A database of number fields'''''. ''LMS Journal of Computation and Mathematics'' 17 (2014), pp. 595-618. DOI: 10.1112/S1461157014000424.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:Berkeley_Open_Infrastructure_for_Network_Computing|Berkeley Open Infrastructure for Network Computing (BOINC)]]<br /> * [[wikipedia:Algebraic_number_field|Algebraic number field]]<br /> * [[wikipedia:Discriminant_of_an_algebraic_number_field|Discriminant of an algebraic number field]]<br /> * [[wikipedia:Langlands_program|Langlands program]]<br /> * [[wikipedia:Volunteer_computing|Volunteer computing]]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> == External links ==<br /> <br /> * NumberFields@home official website: numberfields.asu.edu/NumberFields/<br /> * ASU Number Fields Database<br /> * LMFDB Number Fields search<br /> * Eric D. Driver's doctoral dissertation (PDF): numberfields.asu.edu/NumberFields/Dissertation.pdf<br /> * Low Galois root discriminant results<br /> * Eric D. Driver - A Number Fields Database (PARI workshop slides, 2016)</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Main_Page&diff=1469 2026-05-30T02:20:11Z

<p>Al Piskun: </p> <hr /> <div>{{SEO|description=BOINC Projects - a directory and reference for all BOINC volunteer computing projects, past and present.}}<br /> __NOTOC__<br /> __NOEDITSECTION__<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> HERO BANNER<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> &lt;div class=&quot;bs-hero&quot;&gt;[[File:Banner.png|center|frameless|250x250px]]<br /> &lt;div class=&quot;bs-hero-title&quot;&gt;BOINC Projects&lt;/div&gt;<br /> &lt;div class=&quot;bs-hero-subtitle&quot;&gt;The most comprehensive encyclopedia of BOINC volunteer computing projects on the web&lt;/div&gt;<br /> &lt;div class=&quot;bs-hero-btn&quot;&gt;'''[[BOINC projects|➜ Browse the Complete BOINC Projects Table]]'''&lt;/div&gt;<br /> &lt;div class=&quot;bs-hero-note&quot;&gt;The definitive, community-maintained table documenting every known active and retired BOINC project. The most comprehensive BOINC project list anywhere on the internet.&lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> QUICK-STATS RIBBON<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> &lt;div class=&quot;bs-stats&quot;&gt;<br /> &lt;div class=&quot;bs-stat bs-stat-purple&quot;&gt;<br /> &lt;div class=&quot;bs-stat-number&quot;&gt;51&lt;/div&gt;<br /> &lt;div class=&quot;bs-stat-label&quot;&gt;Projects documented&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-stat bs-stat-teal&quot;&gt;<br /> &lt;div class=&quot;bs-stat-number&quot;&gt;334&lt;/div&gt;<br /> &lt;div class=&quot;bs-stat-label&quot;&gt;Projects listed&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-stat bs-stat-coral&quot;&gt;<br /> &lt;div class=&quot;bs-stat-number&quot;&gt;10+&lt;/div&gt;<br /> &lt;div class=&quot;bs-stat-label&quot;&gt;Research fields&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-stat bs-stat-blue&quot;&gt;<br /> &lt;div class=&quot;bs-stat-number&quot;&gt;{{CURRENTYEAR}}&lt;/div&gt;<br /> &lt;div class=&quot;bs-stat-label&quot;&gt;Continuously updated&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> WHAT IS A BOINC PROJECT?<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> &lt;div class=&quot;bs-definition&quot;&gt;<br /> &lt;span class=&quot;bs-definition-label&quot;&gt;What is a BOINC project?&lt;/span&gt;<br /> '''A BOINC project''' is a website and associated server set up by an individual or group to distribute applications to [https://boinc.berkeley.edu/ BOINC] volunteer computing devices. Those devices deliberately attach to receive, process, and return results for further scientific research — at no cost to the researcher, and no cost to the volunteer beyond electricity.<br /> <br /> ''BOINC'' stands for '''Berkeley Open Infrastructure for Network Computing''', developed at the University of California, Berkeley. Any researcher can create a BOINC project; any person can donate their idle CPU or GPU time to one.<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> PRIMARY CTA — TABLE LINK<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> &lt;div class=&quot;bs-cta&quot;&gt;<br /> &lt;div class=&quot;bs-cta-title&quot;&gt;📋 The BOINC Projects Master Table&lt;/div&gt;<br /> &lt;div class=&quot;bs-cta-body&quot;&gt;The [[BOINC projects|List of all BOINC projects]] table is the heart of this wiki — a structured, sortable reference covering project name, research field, institution, supported platforms, active status, GPU support, and more. It is the primary reason this resource exists and the most complete registry of BOINC projects available anywhere.&lt;/div&gt;<br /> &lt;big&gt;'''[[BOINC projects|View the complete list of BOINC projects →]]'''&lt;/big&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> LOCAL PROJECT PAGES<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> == Local BOINC project wiki pages ==<br /> <br /> Each project below has its own dedicated article on this wiki. Projects are grouped by research domain and activity status.<br /> <br /> === ✦ Active BOINC projects ===<br /> <br /> &lt;div class=&quot;bs-group bs-group-teal mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🔭 Astrophysics, Cosmology &amp; Space&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[Einstein@Home]] gravitational wave and pulsar detection<br /> | * [[MilkyWay@home]] mapping the Milky Way's structure<br /> |-<br /> | * [[LHC@home]] CERN particle physics simulations<br /> | * [[Gaia@home]] ESA Gaia mission data reduction<br /> |-<br /> | colspan=&quot;2&quot; | * [[SPACIOUS@home]] space situational awareness<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-purple mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🧬 Biology, Medicine &amp; Biochemistry&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[GPUGRID]] GPU-accelerated biomolecular simulations<br /> | * [[TN-Grid]] neurological research<br /> |-<br /> | * [[Rosetta@home]] protein structure prediction<br /> |<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-blue mw-collapsible&quot;&gt;&lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🔢 Mathematics, Number Theory &amp; Cryptography&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |* [[Gerasim@home]] multi-project. number field sieve factorisation<br /> |<br /> |-<br /> | * [[PrimeGrid]] prime number searches across many sub-projects<br /> | * [[NFS@Home]] number field sieve factorisation<br /> |-<br /> | * [[SRBase]] Sierpinski-Riesel base search<br /> | * [[NumberFields@Home]] algebraic number field tables<br /> |-<br /> | * [[YAFU]] yet another factorisation utility<br /> | * [[LODA]] integer sequence program synthesis<br /> |-<br /> | * [[Moo! Wrapper]] distributed.net RC5-72 wrapper<br /> | * [[ODLK]] orthogonal diagonal Latin squares<br /> |-<br /> | * [[ODLK1]] ODLK variant 1<br /> | * [[ODLK2025]] ODLK 2025 campaign<br /> |-<br /> | * [[Rakesearch]] Latin square searches<br /> | * [[SPT]] Symmetric Prime Tuples<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-green mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🌍 Climate, Environment &amp; Earth Sciences&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[Climateprediction.net|climate''prediction''.net]] global climate ensemble modelling<br /> | * [[Asteroids@home]] asteroid orbit determination<br /> |-<br /> | * [[Radioactive@home]] background radiation monitoring<br /> |<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-amber mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🤖 Artificial Intelligence, Computing &amp; Infrastructure&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[IThena.Computational]] computational measurement network<br /> | * [[IThena.Measurements]] network performance metrics<br /> |-<br /> | * [[BOINC Central]] BOINC infrastructure project<br /> | * [[WUProp@Home]] work unit propagation statistics<br /> |-<br /> |* [[Yoyo@home]] scientific and mathematical subprojects<br /> |<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-coral mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🧪 Physics, Chemistry &amp; Materials Science&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[USPEX@HOME]] crystal structure prediction<br /> | * [[World Community Grid]] multi-domain humanitarian research<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-gray mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🕹️ Community, Recreation &amp; Miscellaneous&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[Minecraft@Home]] Minecraft world-seed research<br /> | * [[PRIVATE GFN SERVER]] private Generalized Fermat Number server<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-pink mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🧫 Test &amp; Development Projects&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> &lt;div class=&quot;bs-group-note&quot;&gt;These projects serve as active testing and development platforms for BOINC software and infrastructure rather than primary research goals.&lt;/div&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | colspan=&quot;2&quot; | * [[Cpdnboinc dev]] cpdn development and testing server<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> === ✦ Paused BOINC projects ===<br /> <br /> &lt;div class=&quot;bs-group bs-group-amber mw-collapsible mw-collapsed&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;⏯ Paused projects (expand)&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> &lt;div class=&quot;bs-group-note&quot;&gt;These projects are temporarily suspended but have not formally closed. Work may resume in future.&lt;/div&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[DENIS@home]] cardiac electrophysiology research, currently paused<br /> |* [[SiDock@home]] drug candidate screening<br /> |}<br /> &lt;div class=&quot;bs-group-footer&quot;&gt;''See the [[BOINC projects|master BOINC projects table]] for the most current status of all projects.''&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> === ✦ Retired &amp; inactive BOINC projects ===<br /> <br /> &lt;div class=&quot;bs-group bs-group-gray mw-collapsible mw-collapsed&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;⏸ Retired projects (expand)&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> &lt;div class=&quot;bs-group-note&quot;&gt;These projects have suspended operations or are no longer accepting new work units. Their pages are preserved here for historical reference and research continuity.&lt;/div&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[Albert@Home]] developement site for Einstein@Home<br /> | * [[Amicable Numbers]] amicable pair enumeration<br /> |-<br /> | * [[Axiom Distributed AI]] distributed AI model training<br /> | * [[BlackHoles@Home]] black hole binary merger waveforms<br /> |-<br /> | * [[Data freezer]] long-term data archival research<br /> | * [[GoofyxGrid@Home NCI]] non-covalent interaction analysis<br /> |-<br /> | * [[nanoHUB@Home]] nanotechnology simulation<br /> | * [[Parlea]] RNA 3D structure motif analysis<br /> |-<br /> | * [[RALPH@home]] developement site for Rosetta@home<br /> | * [[Ramanujan Machine]] conjectured mathematical identities<br /> |-<br /> | * [[Universe@Home]] stellar evolution modelling<br /> | * [[WEP-M+2 Project]] Mersenne-related prime search<br /> |-<br /> |[[RNA World (beta)]] RNA folding and molecular evolution<br /> |* [[SETI@home]] search for extraterrestrial intelligence<br /> |}<br /> &lt;div class=&quot;bs-group-footer&quot;&gt;''See the [[BOINC projects|master BOINC projects table]] for definitive active/inactive status on all documented projects.''&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> HOW TO PARTICIPATE<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> == How to participate in BOINC projects ==<br /> <br /> &lt;div class=&quot;bs-steps&quot;&gt;<br /> &lt;div class=&quot;bs-step bs-step-purple&quot;&gt;<br /> &lt;div class=&quot;bs-step-title&quot;&gt;1. Download BOINC&lt;/div&gt;<br /> &lt;div class=&quot;bs-step-body&quot;&gt;Get the free BOINC client from [https://boinc.berkeley.edu/download.php boinc.berkeley.edu]. Available for Windows, macOS, Linux, and Android.&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-step bs-step-teal&quot;&gt;<br /> &lt;div class=&quot;bs-step-title&quot;&gt;2. Choose a project&lt;/div&gt;<br /> &lt;div class=&quot;bs-step-body&quot;&gt;Browse the [[BOINC projects|complete BOINC projects list]] on this wiki. Filter by research field, platform support, or GPU availability.&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-step bs-step-blue&quot;&gt;<br /> &lt;div class=&quot;bs-step-title&quot;&gt;3. Attach &amp; contribute&lt;/div&gt;<br /> &lt;div class=&quot;bs-step-body&quot;&gt;Register on the project's website, attach via the BOINC client, and your idle computer begins processing work units automatically.&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> ABOUT THIS WIKI<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> == About this wiki ==<br /> <br /> This ''BOINC projects'' MediaWiki is researched, written, and maintained by [https://boincsynergy.ca/ BOINC Synergy] — a volunteer initiative dedicated to documenting the global BOINC ecosystem. The [[BOINC projects|projects table]] is considered the flagship resource: a single, structured, continuously-updated registry of every known BOINC project, past and present.<br /> <br /> Corrections, additions, and edits are welcome. If you know of a BOINC project not yet listed, please use the talk page or contact [https://boincsynergy.ca/ BOINC Synergy] directly.<br /> <br /> &lt;div class=&quot;bs-footer-bar&quot;&gt;<br /> &lt;small&gt;'''''BOINC projects''''' MediaWiki is developed by [https://boincsynergy.ca/ BOINC Synergy] &amp;nbsp;·&amp;nbsp; Content reflects the state of the BOINC ecosystem as of {{CURRENTYEAR}} &amp;nbsp;·&amp;nbsp; [[BOINC projects|Full projects table →]]&lt;/small&gt;<br /> &lt;/div&gt;<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:Distributed computing]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1468 2026-05-30T02:17:19Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = NumberFields@Home<br /> | logo = NumberFields logo.png<br /> | logo caption = NumberFields@Home logo<br /> | status = Active<br /> | category = Mathematics / Algebraic Number Theory<br /> | compute = CPU &amp;amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Eric D. Driver<br /> | author = Eric D. Driver<br /> | sponsor = Arizona State University School of Mathematics<br /> | maintainer = Eric D. Driver, Greg Tucker<br /> | released = August 2011<br /> <br /> | programming language = C, C++ (PARI/GP, GMP)<br /> | operating system = Windows, Linux, macOS (x86)<br /> <br /> | stats as of = May 2026<br /> | average performance = ~47,566 GigaFLOPS<br /> | website = numberfields.asu.edu/NumberFields/<br /> }}<br /> <br /> BOINC project '''''NumberFields@Home''''' is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that needs your help to search for fields with special properties.<br /> <br /> [[Image:Algebraicszoom.png|right|thumb|300px|A visualisation of the [[wikipedia:Algebraic_number|algebraic numbers]] in the [[wikipedia:Complex_plane|complex plane]]. Number fields are algebraic extensions of the rationals whose elements lie among these points.]]<br /> <br /> == Background ==<br /> <br /> Fields are important mathematical constructs with far-reaching applications across many branches of mathematics. Most people are familiar with everyday examples such as the field of [[wikipedia:Rational_number|rational numbers]] &lt;math&gt;\mathbf{Q}&lt;/math&gt;, the [[wikipedia:Real_number|real numbers]] &lt;math&gt;\mathbf{R}&lt;/math&gt;, and the [[wikipedia:Complex_number|complex numbers]] &lt;math&gt;\mathbf{C}&lt;/math&gt;. The fields studied by NumberFields@Home are '''[[wikipedia:Algebraic_number_field|number fields]]''': algebraic extension fields of the rationals of finite degree. More precisely, a number field is a subset of &lt;math&gt;\mathbf{C}&lt;/math&gt; which contains the root &lt;math&gt;\alpha&lt;/math&gt; of a given polynomial and is minimal while remaining closed under addition, subtraction, multiplication, and division (excepting division by zero).{{cite web |title=What is NumberFields@home?|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> Formally, every number field &lt;math&gt;K&lt;/math&gt; of degree &lt;math&gt;n&lt;/math&gt; over &lt;math&gt;\mathbf{Q}&lt;/math&gt; may be written as<br /> <br /> <br /> &lt;math&gt;K = \mathbf{Q}(\alpha)&lt;/math&gt;<br /> <br /> where &lt;math&gt;\alpha&lt;/math&gt; is a root of some irreducible polynomial of degree &lt;math&gt;n&lt;/math&gt; with rational coefficients.{{cite web |title=Algebraic number field|publisher=Wikipedia |access-date=2026-05-29}} The project is principally interested in '''imprimitive degree-10 fields''' (called '''decic fields'''), which correspond to certain degree-10 polynomials. An imprimitive field is one that contains a proper intermediate subfield strictly between &lt;math&gt;\mathbf{Q}&lt;/math&gt; and itself, as opposed to primitive fields whose Galois closure has an irreducible Galois group.<br /> <br /> Number theorists can mine tabulated data for patterns to help formulate conjectures about number fields, leading to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Among the practical applications are [[wikipedia:Cryptography|'''''cryptography''''']], where number fields underpin sophisticated factoring algorithms and novel cryptosystems, and theoretical physics including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].{{cite web |title=NumberFields@home project description|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> == History ==<br /> <br /> The project was founded by '''Eric D. Driver''', a researcher associated with the School of Mathematics at '''[[wikipedia:Arizona_State_University|Arizona State University]]''' (ASU). Driver recognised that computing lower-degree number fields requires comparatively modest resources and that such fields had already been extensively tabulated, but the degree-10 case was the first case demanding a massively parallel computational solution. After reading an article in ''Linux Magazine'' about BOINC and knowing the mathematics department had access to a suitable workstation, he launched NumberFields@Home to meet the computational demand.{{cite web |title=NumberFields@home - Methods|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> The project went online in '''August 2011'''. In an early forum post, Driver noted that the project had been under construction and work-generation processes still needed automation - yet the response from the distributed computing community was enthusiastic enough to quickly exhaust the initial work queue.{{cite web |title=NumberFields@home still under construction|publisher=numberfields.asu.edu |date=8 August 2011 |access-date=2026-05-29}}<br /> <br /> A significant milestone arrived in '''May 2016''', when the primary ''bounded'' application completed its multi-year search and found all imprimitive degree-10 fields with absolute discriminant less than or equal to &lt;math&gt;1.2 \times 10^{11}&lt;/math&gt;. In '''July 2016''', a focused special search located a particularly elusive hypothesised field: an &lt;math&gt;A_5&lt;/math&gt; extension of &lt;math&gt;\mathbf{Q}(\sqrt{421})&lt;/math&gt; ramified only at 2, after roughly ten months of intermittent searching.{{cite web |title=2016 year in review|publisher=numberfields.asu.edu |date=14 January 2017 |access-date=2026-05-29}}<br /> <br /> In '''August 2022''', Driver shared news that his doctoral thesis advisor - the project's primary institutional benefactor at ASU - had retired. While the university permitted the project to continue running, it would no longer fund hardware upgrades, meaning the project's lifespan is now tied to the longevity of the existing server hardware.{{cite web |title=Future of the Project|publisher=numberfields.asu.edu |date=10 August 2022 |access-date=2026-05-29}} As of 2026, NumberFields@Home remains active, collaborating with the '''[[wikipedia:BOINC|BOINC]]'''-based Gerasim@Home project to cross-check and complete certain sub-searches.{{cite web |title=2025 Year End Summary|publisher=numberfields.asu.edu |date=1 January 2026 |access-date=2026-05-29}}<br /> <br /> == Why NumberFields@Home? ==<br /> <br /> Fields are important mathematical constructs that have far-reaching applications to many branches of mathematics. Many people are familiar with the fields of rational numbers, real numbers, and complex numbers. The fields we are concerned with in this project are number fields: subsets of the complex numbers which contain the root of a given polynomial and are minimal for then being closed under addition, subtraction, multiplication, and division (except for division by 0). In particular, we are interested in imprimitive degree 10 fields (called decic fields), which correspond to certain degree 10 polynomials.<br /> <br /> Number theorists can mine the data for interesting patterns to help them formulate conjectures about number fields. Ultimately, this research will lead to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Another application of number fields is in [[wikipedia:Cryptography|'''''cryptography''''']], where they are used in sophisticated factoring algorithms and as the basis for new cryptosystems. There are also distant applications to mathematical physics, including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].<br /> <br /> == Goals ==<br /> <br /> One way to categorise fields is by the primes that ''ramify'' in them. For a given set of primes, the number of fields ramified at those primes is finite (a classical theorem of [[wikipedia:Charles_Hermite|Hermite]]). The primary goal of the project is to find this finite set of fields for various sets of primes. Since the number of combinations of primes is unlimited, the project will remain open-ended for the foreseeable future.<br /> <br /> Another way to categorise fields is by their '''[[wikipedia:Discriminant_of_an_algebraic_number_field|discriminant]]''', which is an important invariant. Given a fixed bound &lt;math&gt;B&lt;/math&gt;, there are only finitely many fields whose absolute discriminant does not exceed &lt;math&gt;B&lt;/math&gt;. A secondary goal of the project is to determine the finite set of ''minimum discriminant'' imprimitive decic fields for the bound<br /> <br /> <br /> &lt;math&gt;B = 1.2 \times 10^{11}&lt;/math&gt;<br /> <br /> This bound was chosen for its potential to find more fields while keeping the computational load manageable.{{cite web |title=NumberFields@home project description|publisher=Arizona State University |access-date=2026-05-29}} That search was completed in May 2016.{{cite web |title=2016 year in review|publisher=numberfields.asu.edu |date=14 January 2017 |access-date=2026-05-29}}<br /> <br /> [[Image:Polynomialdeg3.png|right|thumb|250px|The graph of a degree-3 polynomial. NumberFields@Home searches over polynomials of degree 10 whose roots generate number fields with prescribed properties.]]<br /> <br /> == Methods ==<br /> <br /> Computing lower-degree fields requires less processing power and such fields have been more extensively tabulated; the degree-10 case is the first case requiring a massively parallel solution. Finite extension fields are represented by polynomials - that is, they are of the form &lt;math&gt;\mathbf{Q}(\alpha)&lt;/math&gt;, where &lt;math&gt;\alpha&lt;/math&gt; is the root of a polynomial. Bounds on the field discriminant give rise to bounds on the polynomial coefficients, so there are a finite number of possible polynomials that can represent the fields being searched for.<br /> <br /> At the most basic level, the NumberFields@Home algorithm searches over this finite set of polynomials, checking whether or not a given polynomial can represent a field with the desired discriminant and ramification properties. At a finer level, the algorithm uses theoretical arguments to reduce the polynomial search space. In addition, the targeted ramification structure gives rise to congruence relations on the polynomial coefficients, which further reduces the search space. Anybody interested in the finer details of the algorithm is encouraged to look through [numberfields.asu.edu/NumberFields/Dissertation.pdf Eric D. Driver's doctoral dissertation].{{cite web |title=Eric D. Driver's dissertation|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> === Software stack ===<br /> <br /> The application relies on two key open-source libraries:{{cite web |title=GPU app status update|publisher=The Scottish BOINC Team |access-date=2026-05-29}}<br /> <br /> * '''[[wikipedia:PARI/GP|PARI/GP]]''' - a computer algebra system widely used in number theory, providing polynomial arithmetic and discriminant computations.<br /> * '''[[wikipedia:GNU_Multiple_Precision_Arithmetic_Library|GMP]]''' (GNU Multiple Precision Arithmetic Library) - multi-precision integer arithmetic, necessary because the integers involved can exceed standard 64-bit representation.<br /> <br /> A significant technical challenge arose during GPU application development: both PARI/GP and GMP rely on dynamically allocated memory, which is incompatible with GPU kernels. Driver solved this by using a fixed-precision multi-precision library with precision hard-coded to the maximum required (approximately 750 bits), allowing compilation of a working GPU kernel.{{cite web |title=GPU app status update (The Scottish BOINC Team)|publisher=tsbt.co.uk |access-date=2026-05-29}}<br /> <br /> === Application versions ===<br /> <br /> The project currently distributes its '''Get Decic Fields''' application in multiple variants targeting different hardware:{{cite web |title=NumberFields@home Applications|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Platform !! Variant !! Notes<br /> |-<br /> | Windows x86-64 || Default (CPU) v4.00 || ~20,622 GigaFLOPS average<br /> |-<br /> | Windows x86-64 || OpenCL AMD || GPU variant<br /> |-<br /> | Windows x86-64 || OpenCL NVIDIA || GPU variant<br /> |-<br /> | Linux x86-64 || Default (CPU) v4.00 || ~8,860 GigaFLOPS average<br /> |-<br /> | Linux x86-64 || CUDA || NVIDIA GPU variant<br /> |-<br /> | Linux x86-64 || OpenCL AMD || AMD GPU variant<br /> |-<br /> | macOS (Intel) || Default (CPU) v3.00 || ~887 GigaFLOPS average<br /> |}<br /> <br /> The GPU application is reported to be roughly 20 to 30 times faster than the older CPU version, and 2 to 3 times faster than a newer optimised CPU version released alongside the GPU work.{{cite web |title=GPU app status update|publisher=The Scottish BOINC Team |access-date=2026-05-29}} The combined average computing across all platforms is approximately '''47,566 GigaFLOPS'''.{{cite web |title=NumberFields@home Applications|publisher=Arizona State University |access-date=2026-05-29}}<br /> <br /> === Results database ===<br /> <br /> The results of NumberFields@Home contribute to an online searchable number field database maintained jointly by John W. Jones and David P. Roberts at ASU. Tabulated results are also integrated into the '''[[wikipedia:L-functions_and_Modular_Forms_Database|LMFDB]]''' (L-functions and Modular Forms Database).{{cite web |title=NumberFields@home|publisher=Arizona State University |access-date=2026-05-29}}{{cite journal |last1=Jones |first1=John W. |last2=Roberts |first2=David P. |title=A database of number fields |journal=LMS Journal of Computation and Mathematics |year=2014 |volume=17 |pages=595-618 |doi=10.1112/S1461157014000424}}<br /> <br /> == Research areas ==<br /> <br /> The project as a whole is basic research - in effect, charting unknown mathematical territory. The following sections describe the broader research contexts to which the tabulated data contributes.<br /> <br /> ==== Automorphic Forms ====<br /> <br /> Number fields are related to [[wikipedia:Automorphic_form|'''''automorphic forms''''']], which form one side of the '''[[wikipedia:Langlands_program|Langlands program]]''' - a vast web of conjectures connecting number theory and representation theory. '''Explanations for the Langlands program'''. ('''See video: The Biggest Project in Modern Mathematics''')<br /> <br /> [[Image:Dedekind Eta.jpg|none|thumb|500px|The [[wikipedia:Dedekind_eta_function|'''''Dedekind eta-function''''']] is an automorphic form in the complex plane.]]<br /> <br /> There are deep connections between automorphic forms and number fields: knowing an automorphic form gives information about the ramifying primes of the corresponding number fields.<br /> <br /> ==== Cryptography ====<br /> <br /> Number fields are used in some modern factoring algorithms relevant to attacks on [[wikipedia:RSA_(cryptosystem)|RSA]]. Other researchers have investigated using properties of number fields as the basis for new cryptosystems. It is not clear which number fields will prove most useful in this research, but the more we know about the general landscape of number fields, the better.<br /> <br /> ==== Arithmetic Statistics ====<br /> <br /> There has been both progress and new conjectures in recent years on asymptotic questions about number fields. If one fixes the degree &lt;math&gt;n&lt;/math&gt; and a bound &lt;math&gt;B&lt;/math&gt;, there are finitely many degree-''n'' number fields with absolute discriminant at most &lt;math&gt;B&lt;/math&gt;. One can then ask how this count grows as a function of &lt;math&gt;B&lt;/math&gt;.<br /> <br /> Researchers have also been factoring the [[wikipedia:Galois_group|Galois group]] of the extension into consideration. At present, there is very little data in degree 10, and imprimitive fields produce a large number of different Galois groups.<br /> <br /> One can also ask about asymptotics based on the set of ramifying primes. There is even less data currently available for investigating questions of this sort. Before one can seriously consider asymptotics, it is useful to know where the first examples lie. NumberFields@Home has helped establish the first known examples of imprimitive decic number fields with certain Galois groups. One can also consider ''first examples'' from the perspective of the '''Galois root discriminant (GRD)''' of the field. Some results for low GRD fields can be found here.<br /> <br /> ==== Theoretical Physics ====<br /> <br /> The fields studied by this project have connections to the [[wikipedia:P-adic_number|p-adic fields]]. In recent years, p-adic analysis has been applied to problems in theoretical physics, including quantum mechanics and string theory. [[wikipedia:P-adic_quantum_mechanics|Here is a good introduction]] to the relevant concepts. It is too early to tell exactly how beneficial the tables of fields will be to the physics community.<br /> <br /> == Project team / Sponsors ==<br /> <br /> * '''Eric D. Driver''' - Project founder, administrator, developer, and scientist. School of Mathematics at Arizona State University.<br /> * '''Greg Tucker''' - assists Driver with the project and its applications.{{cite web |title=NumberFields@home user profiles|publisher=numberfields.asu.edu |access-date=2026-05-29}}<br /> <br /> The project is based at and was sponsored by the ASU School of Mathematics. Following the retirement of Driver's thesis advisor in May 2022, the primary institutional sponsorship ended, though ASU has permitted the project to continue on existing hardware.{{cite web |title=Future of the Project|publisher=numberfields.asu.edu |date=10 August 2022 |access-date=2026-05-29}}<br /> <br /> == Scientific results ==<br /> <br /> * Complete tables of imprimitive decic number fields with absolute discriminant &lt;math&gt;\leq 1.2 \times 10^{11}&lt;/math&gt; (completed May 2016).<br /> * First known examples of imprimitive decic fields for numerous Galois group types.<br /> * Tables of low Galois root discriminant (GRD) imprimitive decic fields: results for low GRD fields.<br /> * Full results in table form: numberfields.asu.edu/NumberFields/FieldTables/FieldTables.html<br /> * Searchable database integration with the LMFDB: www.lmfdb.org/NumberField/<br /> <br /> == Scientific publications ==<br /> <br /> # Driver, Eric D. and John W. Jones. '''''Computing septic number fields'''''. ''Journal of Number Theory'' (2019). DOI: 10.1016/j.jnt.2019.02.022.<br /> # Driver, Eric D. and John W. Jones. '''''Minimum Discriminants of Imprimitive Decic Fields'''''. ''Experimental Mathematics'' (2010). DOI: 10.1080/10586458.2010.10390637.<br /> # Driver, Eric D. and John W. Jones. '''''A targeted Martinet search'''''. ''Mathematics of Computation'' (2009). DOI: 10.1090/S0025-5718-08-02178-9.<br /> # Jones, John W. and David P. Roberts. '''''A database of number fields'''''. ''LMS Journal of Computation and Mathematics'' 17 (2014), pp. 595-618. DOI: 10.1112/S1461157014000424.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:Berkeley_Open_Infrastructure_for_Network_Computing|Berkeley Open Infrastructure for Network Computing (BOINC)]]<br /> * [[wikipedia:Algebraic_number_field|Algebraic number field]]<br /> * [[wikipedia:Discriminant_of_an_algebraic_number_field|Discriminant of an algebraic number field]]<br /> * [[wikipedia:Langlands_program|Langlands program]]<br /> * [[wikipedia:Volunteer_computing|Volunteer computing]]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> == External links ==<br /> <br /> * NumberFields@Home official website: numberfields.asu.edu/NumberFields/<br /> * ASU Number Fields Database<br /> * LMFDB Number Fields search<br /> * Eric D. Driver's doctoral dissertation (PDF): numberfields.asu.edu/NumberFields/Dissertation.pdf<br /> * Low Galois root discriminant results<br /> * Eric D. Driver - A Number Fields Database (PARI workshop slides, 2016)</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1467 2026-05-30T02:12:48Z

<p>Al Piskun: </p> <hr /> <div>{{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1466 2026-05-30T02:12:26Z

<p>Al Piskun: </p> <hr /> <div>{{cite web |title=Test |publisher=Test |access-date=2026-05-29}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1465 2026-05-30T02:12:09Z

<p>Al Piskun: </p> <hr /> <div>[[wikipedia:Volunteer_computing|volunteer computing]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1464 2026-05-30T02:11:54Z

<p>Al Piskun: Replaced content with &quot;Hello world&quot;</p> <hr /> <div>Hello world</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1463 2026-05-30T02:05:20Z

<p>Al Piskun: </p> <hr /> <div>BOINC project [ '''''NumberFields@Home''''']<br /> [[Image:Algebraicszoom.png|right|thumb|300px|A visualisation of the [[wikipedia:Algebraic_number|algebraic numbers]] in the [[wikipedia:Complex_plane|complex plane]]. Number fields are algebraic extensions of the rationals whose elements lie among these points.]]<br /> <br /> == Background ==<br /> <br /> Fields are important mathematical constructs with far-reaching applications across many branches of mathematics.</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1462 2026-05-30T02:02:37Z

<p>Al Piskun: </p> <hr /> <div>[[Image:Algebraicszoom.png|right|thumb|300px|A visualisation of the [[wikipedia:Algebraic_number|algebraic numbers]] in the [[wikipedia:Complex_plane|complex plane]]. Number fields are algebraic extensions of the rationals whose elements lie among these points.]]<br /> <br /> == Background ==<br /> <br /> Fields are important mathematical constructs with far-reaching applications across many branches of mathematics.</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1461 2026-05-30T01:50:28Z

<p>Al Piskun: </p> <hr /> <div>== Background ==<br /> <br /> Fields are important mathematical constructs with far-reaching applications across many branches of mathematics.</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1460 2026-05-30T01:40:17Z

<p>Al Piskun: </p> <hr /> <div>test</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1459 2026-05-30T01:03:40Z

<p>Al Piskun: Replaced content with &quot;&lt;math&gt;x^2&lt;/math&gt;&quot;</p> <hr /> <div>&lt;math&gt;x^2&lt;/math&gt;</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Template:Infobox_software&diff=1458 2026-05-30T00:34:27Z

<p>Al Piskun: </p> <hr /> <div>&lt;includeonly&gt;&lt;table class=&quot;infobox bs-infobox&quot; style=&quot;width:300px; float:right; clear:right; margin:0 0 1em 1em; border-radius:6px; font-size:13px; line-height:1.5; border-collapse:separate; border-spacing:0; overflow:hidden;&quot;&gt;<br /> &lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-title&quot;&gt;{{{name|{{PAGENAME}}}}}&lt;/th&gt;&lt;/tr&gt;<br /> {{#if:{{{logo|}}}|&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;bs-infobox-logo&quot;&gt;[[File:{{{logo}}}|180px|center]]{{#if:{{{logo caption|}}}|&lt;div class=&quot;bs-infobox-caption&quot;&gt;{{{logo caption}}}&lt;/div&gt;}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{screenshot|}}}|&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;bs-infobox-screenshot&quot;&gt;[[File:{{{screenshot}}}|250px|center]]{{#if:{{{caption|}}}|&lt;div class=&quot;bs-infobox-caption&quot;&gt;{{{caption}}}&lt;/div&gt;}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{status|}}}{{{category|}}}{{{compute|}}}{{{dependencies|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Project&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{status|}}}|{{#ifeq:{{{status}}}|Active|&lt;tr class=&quot;bs-infobox-active&quot;&gt;&lt;th class=&quot;bs-infobox-active&quot;&gt;Status&lt;/th&gt;&lt;td class=&quot;bs-infobox-active&quot; style=&quot;font-weight:600;&quot;&gt;{{{status}}}&lt;/td&gt;&lt;/tr&gt;|&lt;tr class=&quot;bs-infobox-inactive&quot;&gt;&lt;th class=&quot;bs-infobox-inactive&quot;&gt;Status&lt;/th&gt;&lt;td class=&quot;bs-infobox-inactive&quot; style=&quot;font-weight:600;&quot;&gt;{{{status}}}&lt;/td&gt;&lt;/tr&gt;}}}}<br /> {{#if:{{{category|}}}|&lt;tr&gt;&lt;th&gt;Category&lt;/th&gt;&lt;td&gt;{{{category}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{compute|}}}|&lt;tr&gt;&lt;th&gt;Compute&lt;/th&gt;&lt;td&gt;{{{compute}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{dependencies|}}}|&lt;tr&gt;&lt;th&gt;Requires&lt;/th&gt;&lt;td&gt;{{{dependencies}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{developer|}}}{{{author|}}}{{{sponsor|}}}{{{maintainer|}}}{{{released|}}}{{{completed|}}}{{{discontinued|}}}{{{repository|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Development&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{developer|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot;&gt;Developer&lt;/th&gt;&lt;td&gt;{{{developer}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{author|}}}|&lt;tr&gt;&lt;th&gt;Author&lt;/th&gt;&lt;td&gt;{{{author}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{sponsor|}}}|&lt;tr&gt;&lt;th&gt;Sponsor&lt;/th&gt;&lt;td&gt;{{{sponsor}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{maintainer|}}}|&lt;tr&gt;&lt;th&gt;Maintainer&lt;/th&gt;&lt;td&gt;{{{maintainer}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{released|}}}|&lt;tr&gt;&lt;th&gt;Initial release&lt;/th&gt;&lt;td&gt;{{{released}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{completed|}}}|&lt;tr&gt;&lt;th&gt;Completed&lt;/th&gt;&lt;td class=&quot;bs-infobox-ended&quot;&gt;{{{completed}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{discontinued|}}}|&lt;tr&gt;&lt;th&gt;Discontinued&lt;/th&gt;&lt;td class=&quot;bs-infobox-ended&quot;&gt;{{{discontinued}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{repository|}}}|&lt;tr&gt;&lt;th&gt;Repository&lt;/th&gt;&lt;td&gt;{{{repository}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{programming language|}}}{{{operating system|}}}{{{size|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Software&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{programming language|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot;&gt;Written in&lt;/th&gt;&lt;td&gt;{{{programming language}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{operating system|}}}|&lt;tr&gt;&lt;th&gt;Operating system&lt;/th&gt;&lt;td&gt;{{{operating system}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{size|}}}|&lt;tr&gt;&lt;th&gt;Size&lt;/th&gt;&lt;td&gt;{{{size}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{stats as of|}}}{{{average performance|}}}{{{active users|}}}{{{total users|}}}{{{active hosts|}}}{{{total hosts|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;BOINC statistics&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{stats as of|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot; class=&quot;bs-infobox-statsdate&quot;&gt;Stats as of&lt;/th&gt;&lt;td class=&quot;bs-infobox-statsdate&quot; style=&quot;font-weight:600;&quot;&gt;{{{stats as of}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{average performance|}}}|&lt;tr&gt;&lt;th&gt;Performance&lt;/th&gt;&lt;td&gt;{{{average performance}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{active users|}}}|&lt;tr&gt;&lt;th&gt;Active users&lt;/th&gt;&lt;td&gt;{{formatnum:{{{active users}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{total users|}}}|&lt;tr&gt;&lt;th&gt;Total users&lt;/th&gt;&lt;td&gt;{{formatnum:{{{total users}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{active hosts|}}}|&lt;tr&gt;&lt;th&gt;Active hosts&lt;/th&gt;&lt;td&gt;{{formatnum:{{{active hosts}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{total hosts|}}}|&lt;tr&gt;&lt;th&gt;Total hosts&lt;/th&gt;&lt;td&gt;{{formatnum:{{{total hosts}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{rac|}}}{{{credit per day|}}}{{{gpu performance|}}}{{{cpu performance|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Analytics&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{rac|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot;&gt;RAC&lt;/th&gt;&lt;td&gt;{{formatnum:{{{rac}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{credit per day|}}}|&lt;tr&gt;&lt;th&gt;Credit/day&lt;/th&gt;&lt;td&gt;{{formatnum:{{{credit per day}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{gpu performance|}}}|&lt;tr&gt;&lt;th&gt;GPU performance&lt;/th&gt;&lt;td&gt;{{{gpu performance}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{cpu performance|}}}|&lt;tr&gt;&lt;th&gt;CPU performance&lt;/th&gt;&lt;td&gt;{{{cpu performance}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{website|}}}{{{license|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Metadata&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{website|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot;&gt;Website&lt;/th&gt;&lt;td&gt;{{{website}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{license|}}}|&lt;tr&gt;&lt;th&gt;License&lt;/th&gt;&lt;td&gt;{{{license}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> &lt;/table&gt;{{#seo:<br /> |title={{{name|{{PAGENAME}}}}}<br /> |image={{{logo|{{{screenshot|}}}}}}<br /> |description={{#if:{{{description|}}}|{{{description}}}|{{PAGENAME}}{{#if:{{{category|}}}| is a {{{category}}} project}}{{#if:{{{compute|}}}| using {{{compute}}} computing}}{{#if:{{{status|}}}| (Status: {{{status}}})}}{{#if:{{{developer|}}}|, developed by {{{developer}}}}}{{#if:{{{sponsor|}}}|, sponsored by {{{sponsor}}}}}{{#if:{{{website|}}}|.}}}}<br /> }}&lt;/includeonly&gt;&lt;noinclude&gt;<br /> == Template:Infobox software ==<br /> <br /> Modern BOINC-oriented infobox template for distributed computing and software project articles.<br /> Includes automatic WikiSEO meta tags (title, image, description) for every page using this template.<br /> An optional &lt;code&gt;description&lt;/code&gt; parameter lets you override the auto-generated meta description.<br /> <br /> === Parameters ===<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Parameter !! Description !! Required<br /> |-<br /> | &lt;code&gt;name&lt;/code&gt; || Software name (defaults to page name) || No<br /> |-<br /> | &lt;code&gt;logo&lt;/code&gt; || Logo filename || No<br /> |-<br /> | &lt;code&gt;logo caption&lt;/code&gt; || Caption below logo || No<br /> |-<br /> | &lt;code&gt;screenshot&lt;/code&gt; || Screenshot filename || No<br /> |-<br /> | &lt;code&gt;caption&lt;/code&gt; || Caption below screenshot || No<br /> |-<br /> | &lt;code&gt;description&lt;/code&gt; || Custom SEO meta description (overrides auto-generated one) || No<br /> |-<br /> | colspan=&quot;3&quot; class=&quot;bs-infobox-section&quot; | '''Project'''<br /> |-<br /> | &lt;code&gt;status&lt;/code&gt; || Active, Completed, etc. Green background when &quot;Active&quot;, red otherwise || No<br /> |-<br /> | &lt;code&gt;category&lt;/code&gt; || Research category (e.g. Astrophysics, Mathematics) || No<br /> |-<br /> | &lt;code&gt;compute&lt;/code&gt; || Processing type: CPU, GPU, or CPU &amp; GPU || No<br /> |-<br /> | &lt;code&gt;dependencies&lt;/code&gt; || Additional software required (e.g. VirtualBox, CUDA, Git) || No<br /> |-<br /> | colspan=&quot;3&quot; class=&quot;bs-infobox-section&quot; | '''Development'''<br /> |-<br /> | &lt;code&gt;developer&lt;/code&gt; || Developer name || No<br /> |-<br /> | &lt;code&gt;author&lt;/code&gt; || Original author || No<br /> |-<br /> | &lt;code&gt;sponsor&lt;/code&gt; || Sponsoring organization || No<br /> |-<br /> | &lt;code&gt;maintainer&lt;/code&gt; || Current maintainer || No<br /> |-<br /> | &lt;code&gt;released&lt;/code&gt; || Initial release date || No<br /> |-<br /> | &lt;code&gt;completed&lt;/code&gt; || Completion date or status (shown in red) || No<br /> |-<br /> | &lt;code&gt;discontinued&lt;/code&gt; || Discontinuation date (shown in red) || No<br /> |-<br /> | &lt;code&gt;repository&lt;/code&gt; || Source code repository link || No<br /> |-<br /> | colspan=&quot;3&quot; class=&quot;bs-infobox-section&quot; | '''Software'''<br /> |-<br /> | &lt;code&gt;programming language&lt;/code&gt; || Language(s) the software is written in || No<br /> |-<br /> | &lt;code&gt;operating system&lt;/code&gt; || Supported operating systems || No<br /> |-<br /> | &lt;code&gt;size&lt;/code&gt; || Download/install size || No<br /> |-<br /> | colspan=&quot;3&quot; class=&quot;bs-infobox-section&quot; | '''BOINC statistics'''<br /> |-<br /> | &lt;code&gt;stats as of&lt;/code&gt; || Date the statistics below were recorded || No<br /> |-<br /> | &lt;code&gt;average performance&lt;/code&gt; || Average FLOPS or equivalent || No<br /> |-<br /> | &lt;code&gt;active users&lt;/code&gt; || Current active user count || No<br /> |-<br /> | &lt;code&gt;total users&lt;/code&gt; || All-time total users || No<br /> |-<br /> | &lt;code&gt;active hosts&lt;/code&gt; || Current active host count || No<br /> |-<br /> | &lt;code&gt;total hosts&lt;/code&gt; || All-time total hosts || No<br /> |-<br /> | colspan=&quot;3&quot; class=&quot;bs-infobox-section&quot; | '''Analytics'''<br /> |-<br /> | &lt;code&gt;rac&lt;/code&gt; || Recent Average Credit || No<br /> |-<br /> | &lt;code&gt;credit per day&lt;/code&gt; || Credits granted per day || No<br /> |-<br /> | &lt;code&gt;gpu performance&lt;/code&gt; || GPU-specific performance metric || No<br /> |-<br /> | &lt;code&gt;cpu performance&lt;/code&gt; || CPU-specific performance metric || No<br /> |-<br /> | colspan=&quot;3&quot; class=&quot;bs-infobox-section&quot; | '''Metadata'''<br /> |-<br /> | &lt;code&gt;website&lt;/code&gt; || Official website URL || No<br /> |-<br /> | &lt;code&gt;license&lt;/code&gt; || Software license || No<br /> |}<br /> <br /> === Full example ===<br /> <br /> &lt;pre&gt;<br /> {{Infobox software<br /> | name = Einstein@Home<br /> | logo = Ein.jpg<br /> | logo caption = Einstein@Home logo<br /> | screenshot = Einstein@Home.gif<br /> | caption = Einstein@Home screensaver<br /> | description = Einstein@Home is an active Astrophysics BOINC project searching for gravitational waves and pulsars, developed by Bruce Allen and sponsored by the Max Planck Society.<br /> <br /> | status = Active<br /> | category = Astrophysics<br /> | compute = CPU &amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Bruce Allen<br /> | author = Bruce Allen<br /> | sponsor = Max Planck Society<br /> | maintainer = Einstein@Home team<br /> | released = {{Start date and age|2005|02|19}}<br /> | completed = No<br /> | discontinued =<br /> | repository = {{URL|https://git.ligo.org/einsteinathome}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS, Android<br /> | size = ~50 MB<br /> <br /> | stats as of = {{Start date and age|2026|05|19}}<br /> | average performance = 21 PFLOPS<br /> | active users = 14531<br /> | total users = 1061585<br /> | active hosts = 24489<br /> | total hosts = 8237726<br /> <br /> | rac = 18500000<br /> | credit per day = 950000<br /> | gpu performance = 15 PFLOPS<br /> | cpu performance = 6 PFLOPS<br /> <br /> | website = {{URL|https://einsteinathome.org/}}<br /> | license = GPL-2.0-or-later<br /> }}<br /> &lt;/pre&gt;<br /> <br /> === Minimal example ===<br /> <br /> &lt;pre&gt;<br /> {{Infobox software<br /> | name = My Project<br /> | status = Active<br /> | category = Mathematics<br /> | compute = CPU<br /> <br /> | developer = Jane Smith<br /> | released = {{Start date and age|2020|01|01}}<br /> <br /> | operating system = Windows, Linux, macOS<br /> <br /> | website = {{URL|https://example.org/}}<br /> | license = MIT<br /> }}<br /> &lt;/pre&gt;<br /> <br /> [[Category:Infobox templates]]<br /> &lt;/noinclude&gt;</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Template:Infobox_software&diff=1457 2026-05-30T00:28:23Z

<p>Al Piskun: </p> <hr /> <div>&lt;includeonly&gt;&lt;table class=&quot;infobox bs-infobox&quot; style=&quot;width:300px; float:right; clear:right; margin:0 0 1em 1em; border-radius:6px; font-size:13px; line-height:1.5; border-collapse:separate; border-spacing:0; overflow:hidden;&quot;&gt;<br /> &lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-title&quot;&gt;{{{name|{{PAGENAME}}}}}&lt;/th&gt;&lt;/tr&gt;<br /> {{#if:{{{logo|}}}|&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;bs-infobox-logo&quot;&gt;[[File:{{{logo}}}|180px|center]]{{#if:{{{logo caption|}}}|&lt;div class=&quot;bs-infobox-caption&quot;&gt;{{{logo caption}}}&lt;/div&gt;}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{screenshot|}}}|&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;bs-infobox-screenshot&quot;&gt;[[File:{{{screenshot}}}|250px|center]]{{#if:{{{caption|}}}|&lt;div class=&quot;bs-infobox-caption&quot;&gt;{{{caption}}}&lt;/div&gt;}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{status|}}}{{{category|}}}{{{compute|}}}{{{dependencies|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Project&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{status|}}}|{{#ifeq:{{{status}}}|Active|&lt;tr class=&quot;bs-infobox-active&quot;&gt;&lt;th class=&quot;bs-infobox-active&quot;&gt;Status&lt;/th&gt;&lt;td class=&quot;bs-infobox-active&quot; style=&quot;font-weight:600;&quot;&gt;{{{status}}}&lt;/td&gt;&lt;/tr&gt;|&lt;tr class=&quot;bs-infobox-inactive&quot;&gt;&lt;th class=&quot;bs-infobox-inactive&quot;&gt;Status&lt;/th&gt;&lt;td class=&quot;bs-infobox-inactive&quot; style=&quot;font-weight:600;&quot;&gt;{{{status}}}&lt;/td&gt;&lt;/tr&gt;}}}}<br /> {{#if:{{{category|}}}|&lt;tr&gt;&lt;th&gt;Category&lt;/th&gt;&lt;td&gt;{{{category}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{compute|}}}|&lt;tr&gt;&lt;th&gt;Compute&lt;/th&gt;&lt;td&gt;{{{compute}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{dependencies|}}}|&lt;tr&gt;&lt;th&gt;Requires&lt;/th&gt;&lt;td&gt;{{{dependencies}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{developer|}}}{{{author|}}}{{{sponsor|}}}{{{maintainer|}}}{{{released|}}}{{{completed|}}}{{{discontinued|}}}{{{repository|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Development&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{developer|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot;&gt;Developer&lt;/th&gt;&lt;td&gt;{{{developer}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{author|}}}|&lt;tr&gt;&lt;th&gt;Author&lt;/th&gt;&lt;td&gt;{{{author}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{sponsor|}}}|&lt;tr&gt;&lt;th&gt;Sponsor&lt;/th&gt;&lt;td&gt;{{{sponsor}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{maintainer|}}}|&lt;tr&gt;&lt;th&gt;Maintainer&lt;/th&gt;&lt;td&gt;{{{maintainer}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{released|}}}|&lt;tr&gt;&lt;th&gt;Initial release&lt;/th&gt;&lt;td&gt;{{{released}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{completed|}}}|&lt;tr&gt;&lt;th&gt;Completed&lt;/th&gt;&lt;td class=&quot;bs-infobox-ended&quot;&gt;{{{completed}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{discontinued|}}}|&lt;tr&gt;&lt;th&gt;Discontinued&lt;/th&gt;&lt;td class=&quot;bs-infobox-ended&quot;&gt;{{{discontinued}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{repository|}}}|&lt;tr&gt;&lt;th&gt;Repository&lt;/th&gt;&lt;td&gt;{{{repository}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{programming language|}}}{{{operating system|}}}{{{size|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Software&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{programming language|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot;&gt;Written in&lt;/th&gt;&lt;td&gt;{{{programming language}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{operating system|}}}|&lt;tr&gt;&lt;th&gt;Operating system&lt;/th&gt;&lt;td&gt;{{{operating system}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{size|}}}|&lt;tr&gt;&lt;th&gt;Size&lt;/th&gt;&lt;td&gt;{{{size}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{stats as of|}}}{{{average performance|}}}{{{active users|}}}{{{total users|}}}{{{active hosts|}}}{{{total hosts|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;BOINC statistics&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{stats as of|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot; class=&quot;bs-infobox-statsdate&quot;&gt;Stats as of&lt;/th&gt;&lt;td class=&quot;bs-infobox-statsdate&quot; style=&quot;font-weight:600;&quot;&gt;{{{stats as of}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{average performance|}}}|&lt;tr&gt;&lt;th&gt;Performance&lt;/th&gt;&lt;td&gt;{{{average performance}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{active users|}}}|&lt;tr&gt;&lt;th&gt;Active users&lt;/th&gt;&lt;td&gt;{{formatnum:{{{active users}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{total users|}}}|&lt;tr&gt;&lt;th&gt;Total users&lt;/th&gt;&lt;td&gt;{{formatnum:{{{total users}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{active hosts|}}}|&lt;tr&gt;&lt;th&gt;Active hosts&lt;/th&gt;&lt;td&gt;{{formatnum:{{{active hosts}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{total hosts|}}}|&lt;tr&gt;&lt;th&gt;Total hosts&lt;/th&gt;&lt;td&gt;{{formatnum:{{{total hosts}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{rac|}}}{{{credit per day|}}}{{{gpu performance|}}}{{{cpu performance|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Analytics&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{rac|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot;&gt;RAC&lt;/th&gt;&lt;td&gt;{{formatnum:{{{rac}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{credit per day|}}}|&lt;tr&gt;&lt;th&gt;Credit/day&lt;/th&gt;&lt;td&gt;{{formatnum:{{{credit per day}}}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{gpu performance|}}}|&lt;tr&gt;&lt;th&gt;GPU performance&lt;/th&gt;&lt;td&gt;{{{gpu performance}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{cpu performance|}}}|&lt;tr&gt;&lt;th&gt;CPU performance&lt;/th&gt;&lt;td&gt;{{{cpu performance}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{website|}}}{{{license|}}}|&lt;tr&gt;&lt;th colspan=&quot;2&quot; class=&quot;bs-infobox-section&quot;&gt;Metadata&lt;/th&gt;&lt;/tr&gt;}}<br /> {{#if:{{{website|}}}|&lt;tr&gt;&lt;th style=&quot;width:110px;&quot;&gt;Website&lt;/th&gt;&lt;td&gt;{{{website}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> {{#if:{{{license|}}}|&lt;tr&gt;&lt;th&gt;License&lt;/th&gt;&lt;td&gt;{{{license}}}&lt;/td&gt;&lt;/tr&gt;}}<br /> &lt;/table&gt;{{#seo:<br /> |title={{{name|{{PAGENAME}}}}}<br /> |image={{{logo|{{{screenshot|}}}}}}<br /> |description={{#if:{{{description|}}}|{{{description}}}|{{PAGENAME}}{{#if:{{{category|}}}| is a {{{category}}} project}}{{#if:{{{compute|}}}| using {{{compute}}} computing}}{{#if:{{{status|}}}| (Status: {{{status}}})}}{{#if:{{{developer|}}}|, developed by {{{developer}}}}}{{#if:{{{sponsor|}}}|, sponsored by {{{sponsor}}}}}{{#if:{{{website|}}}|.}}}}<br /> }}&lt;/includeonly&gt;&lt;noinclude&gt;<br /> == Template:Infobox software ==<br /> <br /> Modern BOINC-oriented infobox template for distributed computing and software project articles.<br /> Includes automatic WikiSEO meta tags (title, image, description) for every page using this template.<br /> An optional &lt;code&gt;description&lt;/code&gt; parameter lets you override the auto-generated meta description.<br /> <br /> === Parameters ===<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Parameter !! Description !! Required<br /> |-<br /> | &lt;code&gt;name&lt;/code&gt; || Software name (defaults to page name) || No<br /> |-<br /> | &lt;code&gt;logo&lt;/code&gt; || Logo filename || No<br /> |-<br /> | &lt;code&gt;logo caption&lt;/code&gt; || Caption below logo || No<br /> |-<br /> | &lt;code&gt;screenshot&lt;/code&gt; || Screenshot filename || No<br /> |-<br /> | &lt;code&gt;caption&lt;/code&gt; || Caption below screenshot || No<br /> |-<br /> | &lt;code&gt;description&lt;/code&gt; || Custom SEO meta description (overrides auto-generated one) || No<br /> |-<br /> | colspan=&quot;3&quot; style=&quot;background:#0a0e4a; text-align:center;&quot; | '''Project'''<br /> |-<br /> | &lt;code&gt;status&lt;/code&gt; || Active, Completed, etc. Green background when &quot;Active&quot;, red otherwise || No<br /> |-<br /> | &lt;code&gt;category&lt;/code&gt; || Research category (e.g. Astrophysics, Mathematics) || No<br /> |-<br /> | &lt;code&gt;compute&lt;/code&gt; || Processing type: CPU, GPU, or CPU &amp; GPU || No<br /> |-<br /> | &lt;code&gt;dependencies&lt;/code&gt; || Additional software required (e.g. VirtualBox, CUDA, Git) || No<br /> |-<br /> | colspan=&quot;3&quot; style=&quot;background:#eaecf0; text-align:center;&quot; | '''Development'''<br /> |-<br /> | &lt;code&gt;developer&lt;/code&gt; || Developer name || No<br /> |-<br /> | &lt;code&gt;author&lt;/code&gt; || Original author || No<br /> |-<br /> | &lt;code&gt;sponsor&lt;/code&gt; || Sponsoring organization || No<br /> |-<br /> | &lt;code&gt;maintainer&lt;/code&gt; || Current maintainer || No<br /> |-<br /> | &lt;code&gt;released&lt;/code&gt; || Initial release date || No<br /> |-<br /> | &lt;code&gt;completed&lt;/code&gt; || Completion date or status (shown in red) || No<br /> |-<br /> | &lt;code&gt;discontinued&lt;/code&gt; || Discontinuation date (shown in red) || No<br /> |-<br /> | &lt;code&gt;repository&lt;/code&gt; || Source code repository link || No<br /> |-<br /> | colspan=&quot;3&quot; style=&quot;background:#eaecf0; text-align:center;&quot; | '''Software'''<br /> |-<br /> | &lt;code&gt;programming language&lt;/code&gt; || Language(s) the software is written in || No<br /> |-<br /> | &lt;code&gt;operating system&lt;/code&gt; || Supported operating systems || No<br /> |-<br /> | &lt;code&gt;size&lt;/code&gt; || Download/install size || No<br /> |-<br /> | colspan=&quot;3&quot; style=&quot;background:#eaecf0; text-align:center;&quot; | '''BOINC statistics'''<br /> |-<br /> | &lt;code&gt;stats as of&lt;/code&gt; || Date the statistics below were recorded || No<br /> |-<br /> | &lt;code&gt;average performance&lt;/code&gt; || Average FLOPS or equivalent || No<br /> |-<br /> | &lt;code&gt;active users&lt;/code&gt; || Current active user count || No<br /> |-<br /> | &lt;code&gt;total users&lt;/code&gt; || All-time total users || No<br /> |-<br /> | &lt;code&gt;active hosts&lt;/code&gt; || Current active host count || No<br /> |-<br /> | &lt;code&gt;total hosts&lt;/code&gt; || All-time total hosts || No<br /> |-<br /> | colspan=&quot;3&quot; style=&quot;background:#eaecf0; text-align:center;&quot; | '''Analytics'''<br /> |-<br /> | &lt;code&gt;rac&lt;/code&gt; || Recent Average Credit || No<br /> |-<br /> | &lt;code&gt;credit per day&lt;/code&gt; || Credits granted per day || No<br /> |-<br /> | &lt;code&gt;gpu performance&lt;/code&gt; || GPU-specific performance metric || No<br /> |-<br /> | &lt;code&gt;cpu performance&lt;/code&gt; || CPU-specific performance metric || No<br /> |-<br /> | colspan=&quot;3&quot; style=&quot;background:#eaecf0; text-align:center;&quot; | '''Metadata'''<br /> |-<br /> | &lt;code&gt;website&lt;/code&gt; || Official website URL || No<br /> |-<br /> | &lt;code&gt;license&lt;/code&gt; || Software license || No<br /> |}<br /> <br /> === Full example ===<br /> <br /> &lt;pre&gt;<br /> {{Infobox software<br /> | name = Einstein@Home<br /> | logo = Ein.jpg<br /> | logo caption = Einstein@Home logo<br /> | screenshot = Einstein@Home.gif<br /> | caption = Einstein@Home screensaver<br /> | description = Einstein@Home is an active Astrophysics BOINC project searching for gravitational waves and pulsars, developed by Bruce Allen and sponsored by the Max Planck Society.<br /> <br /> | status = Active<br /> | category = Astrophysics<br /> | compute = CPU &amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Bruce Allen<br /> | author = Bruce Allen<br /> | sponsor = Max Planck Society<br /> | maintainer = Einstein@Home team<br /> | released = {{Start date and age|2005|02|19}}<br /> | completed = No<br /> | discontinued =<br /> | repository = {{URL|https://git.ligo.org/einsteinathome}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS, Android<br /> | size = ~50 MB<br /> <br /> | stats as of = {{Start date and age|2026|05|19}}<br /> | average performance = 21 PFLOPS<br /> | active users = 14531<br /> | total users = 1061585<br /> | active hosts = 24489<br /> | total hosts = 8237726<br /> <br /> | rac = 18500000<br /> | credit per day = 950000<br /> | gpu performance = 15 PFLOPS<br /> | cpu performance = 6 PFLOPS<br /> <br /> | website = {{URL|https://einsteinathome.org/}}<br /> | license = GPL-2.0-or-later<br /> }}<br /> &lt;/pre&gt;<br /> <br /> === Minimal example ===<br /> <br /> &lt;pre&gt;<br /> {{Infobox software<br /> | name = My Project<br /> | status = Active<br /> | category = Mathematics<br /> | compute = CPU<br /> <br /> | developer = Jane Smith<br /> | released = {{Start date and age|2020|01|01}}<br /> <br /> | operating system = Windows, Linux, macOS<br /> <br /> | website = {{URL|https://example.org/}}<br /> | license = MIT<br /> }}<br /> &lt;/pre&gt;<br /> <br /> [[Category:Infobox templates]]<br /> &lt;/noinclude&gt;</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=IThena.Measurements&diff=1447 2026-05-29T15:28:13Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = iThena.Measurements<br /> | logo = IThena_Logo.png<br /> | logo caption = iThena project logo<br /> <br /> | status = Active<br /> | category = Network science<br /> | compute = CPU<br /> | dependencies = [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]]<br /> <br /> | developer = Łukasz Świerczewski<br /> | author = Łukasz Świerczewski<br /> | released = {{Start date and age|2019|08|29}}<br /> | repository = <br /> | programming language = C, C++<br /> | operating system = Linux, Windows<br /> | stats as of = {{Start date and age|2026|03|12}}<br /> | average performance = 924.04 GigaFLOPS<br /> | active users = 292<br /> | total users = 1143<br /> | active hosts = 2852<br /> | total hosts = 106124<br /> <br /> | rac = 18500000<br /> | credit per day = 950000<br /> | gpu performance = <br /> | cpu performance = 6 PFLOPS<br /> <br /> | website = {{URL|https://root.ithena.net/usr/}}<br /> | license = Proprietary<br /> }}<br /> <br /> [https://root.ithena.net/usr/ '''''iThena.Measurements'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project based on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform. The project is part of the broader '''iThena''' initiative, which focuses on experimental mapping and analysis of the global Internet infrastructure through distributed measurements performed by volunteer computers.&lt;ref name=&quot;about&quot;&gt;{{cite web |url=https://root.ithena.net/usr/about.php |title=iThena.Measurements - Description |publisher=iThena.Measurements |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project performs large-scale Internet measurements including latency testing, bandwidth analysis, packet routing studies, and traceroute-based topology discovery. Data gathered by volunteers is used to model Internet network structures at multiple levels including routers, points of presence (PoPs), and autonomous systems (ASes).&lt;ref name=&quot;everipedia&quot;&gt;{{cite web |url=https://everipedia.org/wiki/lang_en/ithena |title=iThena |publisher=Everipedia |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == History ==<br /> <br /> The first test activities related to the iThena project began on 29 August 2019.&lt;ref name=&quot;everipedia&quot; /&gt; Public announcements regarding the project appeared in September 2019 as the developers prepared BOINC applications for distributed Internet measurements.&lt;ref&gt;{{cite web |url=https://www.boincitaly.org/forum/matematica/114943-thread-ufficiale-ithena.html |title=[Thread Ufficiale] iThena.Measurements |publisher=BOINC.Italy |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project was divided into two major components:<br /> <br /> * '''iThena.Measurements''' — the measurement subsystem performing distributed network diagnostics and Internet mapping.<br /> * '''iThena.Computational''' — a computational subsystem responsible for post-processing and graph analysis of collected measurement data.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> The project experienced several periods of instability and intermittent downtime during its operation, including SSL certificate issues and server outages discussed by BOINC community members on the official BOINC forums.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/forum_thread.php?id=14504 |title=iThena.Measurements &amp; iThena.Computation are timing out with SSL errors |publisher=BOINC forums |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Why iThena.Measurements? ==<br /> <br /> Modern Internet infrastructure is extremely complex and constantly changing. Large-scale mapping of routing paths, latency characteristics, and bandwidth relationships requires measurements from geographically distributed systems. Traditional centralized measurement systems are limited in scope and perspective.<br /> <br /> iThena.Measurements attempts to solve this problem using volunteer computing. By distributing lightweight network-measurement applications to thousands of volunteer computers around the world, the project can gather data from many regions and Internet providers simultaneously.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> The collected information can help researchers better understand:<br /> <br /> * Internet topology<br /> * Routing efficiency<br /> * Packet loss patterns<br /> * Network latency<br /> * Bandwidth limitations<br /> * Connectivity between autonomous systems<br /> == Goal ==<br /> [[File:IThena Project in BOINC Manager.png|thumb|iThena Project in BOINC Manager - adding the project to the client]]<br /> <br /> The primary objective of iThena.Measurements is to build realistic models of the global Internet infrastructure using data gathered from distributed volunteer hosts.&lt;ref name=&quot;everipedia&quot; /&gt;<br /> <br /> The project aims to:<br /> <br /> * Perform large-scale network measurements<br /> * Analyze Internet routing structures<br /> * Create topology maps of Internet infrastructure<br /> * Study latency and packet-loss relationships<br /> * Measure network bandwidth between distributed endpoints<br /> * Provide datasets for later computational graph analysis<br /> <br /> According to the project developers, the resulting datasets may be used for future research into Internet structure visualization and analysis.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> == Methods ==<br /> <br /> [[File:IThena kiosk Animation (minimal).gif|alt=Simplified iThena Project visualization|thumb|Simplified iThena Project visualization|600x600px]]<br /> <br /> iThena.Measurements uses the BOINC middleware platform to distribute measurement tasks to volunteer computers around the world.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/projects.php |title=BOINC projects list |publisher=BOINC |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project currently includes several applications:<br /> <br /> === CNode ===<br /> <br /> The '''iThena CNode''' application performs sequences of traceroute procedures from volunteer computers. The resulting routing information is returned to the project servers and incorporated into the central database for further analysis.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> === PERF ===<br /> <br /> The '''iThena PERF''' application performs bandwidth testing and network performance analysis between volunteer systems and designated endpoints.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> === OONI Probe ===<br /> <br /> The project also distributed an '''OONI Probe''' wrapper application intended for Internet measurement and network-observability tasks.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> === Why BOINC? ===<br /> <br /> The project relies on BOINC because distributed volunteer computing enables measurements from a very large number of geographically dispersed systems. Unlike centralized measurement servers, BOINC volunteers provide many independent network vantage points, allowing broader Internet visibility and more realistic network mapping.&lt;ref&gt;{{cite web |url=https://www.reddit.com/r/COVID19/comments/f5as77/ |title=Distributed computing project discussion |publisher=Reddit |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The BOINC infrastructure also provides:<br /> <br /> * Cross-platform application distribution<br /> * Secure task validation<br /> * Volunteer account management<br /> * Credit and statistics systems<br /> * Scalable task scheduling<br /> == Applications ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Application<br /> ! Purpose<br /> ! Platform support<br /> |-<br /> | CNode<br /> | Traceroute and routing analysis<br /> | Linux, Windows<br /> |-<br /> | PERF<br /> | Bandwidth and performance testing<br /> | Linux, Windows<br /> |-<br /> | OONI Probe<br /> | Internet observability measurements<br /> | Primarily Linux<br /> |}<br /> <br /> == Platform support ==<br /> <br /> The project primarily supports Linux systems, especially x86_64 Linux platforms. Some applications are also available for Microsoft Windows.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> According to the project website, some applications are distributed as beta applications and require volunteers to enable test applications in their BOINC preferences.&lt;ref name=&quot;search0&quot;&gt;{{cite web |url=https://root.ithena.net/ |title=What is iThena.Measurements? |publisher=iThena.Measurements |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Statistics ==<br /> [[File:A rackmount Dell R710 11th-generation server powering the iThena.Measurements and iThena.Computational projects.jpg|thumb|A rackmount Dell R710 11th-generation server powering the iThena.Measurements and iThena.Computational projects]]<br /> <br /> As of March 2026, the project reported:<br /> <br /> * More than 521,000 registered users<br /> * More than 134,000 hosts<br /> * Participation from over 14,000 teams&lt;ref name=&quot;search0&quot; /&gt;<br /> <br /> The largest contributor countries by total credit included Ukraine, the United States, Japan, and Germany.&lt;ref name=&quot;search0&quot; /&gt;<br /> <br /> == Project team / Sponsors ==<br /> <br /> The project administrator and lead developer is '''Łukasz Świerczewski'''.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> The project appears to operate independently without a major institutional sponsor publicly listed on the project website.<br /> <br /> == Scientific results ==<br /> <br /> The project has primarily focused on infrastructure development and collection of Internet measurement datasets. Publicly available scientific publications directly associated with iThena.Measurements remain limited as of 2026.<br /> <br /> The broader iThena initiative has emphasized future graph-analysis and network-modeling work using datasets gathered by the measurement subsystem.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> == Community and reception ==<br /> <br /> The project attracted interest within the BOINC community because of its focus on Internet topology and network measurement rather than traditional scientific simulations.&lt;ref&gt;{{cite web |url=https://boincatpoland.org/smf/index.php?topic=11612.0 |title=iThena.Measurements discussion thread |publisher=BOINC@Poland |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> Community discussions also noted periods of instability, intermittent outages, and maintenance interruptions throughout the project's operation.&lt;ref&gt;{{cite web |url=https://boinc.n-helix.com/forum_thread.php?id=15512 |title=iThena.Measurements discussion |publisher=BOINC.N-Helix |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]]<br /> * [[wikipedia:Distributed computing|Distributed computing]]<br /> * [[wikipedia:Network science|Network science]]<br /> * [[wikipedia:Traceroute|Traceroute]]<br /> <br /> == External links ==<br /> <br /> * [https://root.ithena.net/usr/ Official iThena.Measurements website]<br /> * [https://vi.ithena.net iThena visualization portal]<br /> * [https://boincstats.com/en/stats/176/project/detail BOINCstats project statistics]<br /> <br /> == References ==<br /> <br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Yoyo@home&diff=1446 2026-05-29T15:27:07Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Yoyo@home<br /> | logo = Yoyo.jpg<br /> | logo caption = Yoyo@home logo<br /> | screenshot = Evolution@Home.gif<br /> | caption = Evolution@home screensaver<br /> <br /> | status = Active<br /> | category = Mathematics, Biology, Cryptography, Computer science<br /> | compute = CPU<br /> | dependencies = BOINC<br /> <br /> | developer = Rechenkraft.net e.V.<br /> | author = Uwe Beckert<br /> | sponsor = [[wikipedia:Rechenkraft.net|Rechenkraft.net e.V.]]<br /> | maintainer = yoyo<br /> | released = {{Start date and age|2007|01|01}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS, FreeBSD, Solaris<br /> | size = Varies by application<br /> <br /> | stats as of = {{Start date and age|2026|05|25}}<br /> | active users = 1200<br /> | total users = 90000<br /> | active hosts = 2500<br /> | total hosts = 180000<br /> <br /> | website = {{URL|https://www.rechenkraft.net/yoyo/}}<br /> | license = Mixed free software licenses<br /> }}<br /> <br /> [https://www.rechenkraft.net/yoyo/ '''''Yoyo@home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project based on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform. The project is operated by [[wikipedia:Rechenkraft.net|Rechenkraft.net e.V.]], a German non profit organization dedicated to distributed computing and public participation in scientific research.&lt;ref&gt;{{cite web |url=https://www.rechenkraft.net/yoyo/ |title=Yoyo@home |publisher=Rechenkraft.net |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> Yoyo@home serves as a multi application BOINC platform hosting a variety of scientific and mathematical subprojects. The project is especially known for porting existing standalone distributed computing applications into the BOINC ecosystem using the BOINC Wrapper technology. Through this approach, applications originally designed outside BOINC can benefit from BOINC's scheduling, validation, credit, and volunteer management infrastructure.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/trac/wiki/WrapperApp |title=BOINC Wrapper Application |publisher=University of California, Berkeley |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> The project has hosted workloads in areas including evolutionary biology, number theory, cryptography, combinatorics, optimization, and algebraic computation. Over time, Yoyo@home has become one of the most diverse BOINC projects in terms of application variety.<br /> <br /> == MediaWiki page ==<br /> <br /> https://www.rechenkraft.net/wiki/Yoyo@home<br /> <br /> == History ==<br /> <br /> Yoyo@home was launched during the late 2000s as part of the effort by Rechenkraft.net to expand volunteer computing participation beyond traditional academic supercomputing environments. The project was designed to make it easier for independent researchers and small scientific teams to use BOINC without having to develop a complete BOINC native application from scratch.<br /> <br /> A major technical feature of the project is its use of the BOINC Wrapper. The wrapper allows external executables to run inside the BOINC client environment while still supporting checkpointing, validation, work distribution, and credit assignment.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC official website |publisher=University of California, Berkeley |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> Yoyo@home has periodically hosted many different subprojects, some long term and others experimental. These have included:<br /> <br /> * Evolution@home<br /> * Optimal Golomb Rulers<br /> * Distributed Rainbow Table Generator<br /> * Muon<br /> * Harmonious Trees<br /> * ECM<br /> * OGR<br /> * Sudoku<br /> * Cruncher OGR<br /> * SR5<br /> * Chess960 analysis<br /> <br /> Several applications originated from independent research communities and were adapted for BOINC distribution through Yoyo@home.<br /> <br /> == Why Yoyo@home? ==<br /> <br /> Yoyo@home was created to provide a flexible volunteer computing environment capable of supporting projects that might otherwise lack the infrastructure or funding required to maintain a standalone distributed computing platform.<br /> <br /> Many scientific and mathematical problems require extremely large search spaces or repeated simulations. In some cases, the computational complexity grows exponentially with the input size. Volunteer distributed computing allows these workloads to be divided into smaller tasks and processed in parallel across thousands of participating computers worldwide.<br /> <br /> For example, several Yoyo@home applications search for solutions to large combinatorial or number theoretic problems where brute force approaches may require evaluating extremely large sets of candidates:<br /> <br /> &lt;math&gt;N \approx k^n&lt;/math&gt;<br /> <br /> where &lt;math&gt;k&lt;/math&gt; represents the branching factor and &lt;math&gt;n&lt;/math&gt; the search depth.<br /> <br /> The distributed model allows many independent calculations to be processed simultaneously, greatly reducing the effective completion time.<br /> <br /> == Goal ==<br /> <br /> The primary goal of Yoyo@home is to support scientific and mathematical research by providing computing power contributed voluntarily by the public. The project also aims to preserve and extend older distributed computing applications by integrating them into the BOINC infrastructure.<br /> <br /> Yoyo@home focuses particularly on:<br /> <br /> * Porting non BOINC applications into BOINC<br /> * Supporting independent scientific research<br /> * Large scale mathematical searches<br /> * Evolutionary and population genetics simulations<br /> * Public participation in science<br /> * Efficient use of idle computing resources<br /> <br /> The project additionally serves as a testing environment for experimental BOINC applications and wrapper technologies.<br /> <br /> == Methods ==<br /> <br /> Yoyo@home distributes computational work units to volunteers running the BOINC client software on their computers. Each work unit contains a small portion of a larger scientific or mathematical calculation. Results are returned to the project servers where they are validated and incorporated into the broader computation.<br /> <br /> The project primarily uses CPU based applications and generally emphasizes portability across multiple operating systems.<br /> <br /> [[File:Evolution@Home.gif|alt=Evolution@Home screensaver|right|thumb|300px|Evolution@home screensaver]]<br /> <br /> Several subprojects use exhaustive or semi exhaustive searches involving discrete mathematics and combinatorics. For example, the Optimal Golomb Ruler project investigates rulers where all pairwise distances are unique. A Golomb ruler with marks at positions &lt;math&gt;a_1, a_2, ..., a_n&lt;/math&gt; satisfies:<br /> <br /> &lt;math&gt;a_i - a_j \neq a_k - a_l&lt;/math&gt;<br /> <br /> for all distinct pairs.<br /> <br /> Other projects study evolutionary dynamics and mutation accumulation using stochastic population models related to Muller's ratchet. In population genetics, mutation accumulation may be approximated through probabilistic simulation models involving mutation rate &lt;math&gt;\mu&lt;/math&gt;, selection coefficient &lt;math&gt;s&lt;/math&gt;, and population size &lt;math&gt;N&lt;/math&gt;.<br /> <br /> The project relies on BOINC because volunteer computing provides a cost effective way to perform very large computations without requiring dedicated supercomputers. This model allows researchers with limited funding to access substantial computational resources.<br /> <br /> Yoyo@home has also contributed to preserving distributed computing projects that might otherwise disappear due to lack of infrastructure support.<br /> <br /> == Subprojects ==<br /> <br /> === Evolution@home ===<br /> <br /> Evolution@home is one of the best known Yoyo@home applications. It simulates evolutionary processes and mutation accumulation in biological populations. Research has focused on Muller's ratchet, a process describing the irreversible accumulation of deleterious mutations in finite asexual populations.<br /> <br /> The expected accumulation of mutations can be studied using stochastic simulation techniques and probabilistic models involving mutation rates and selective pressure.<br /> <br /> === Optimal Golomb Rulers ===<br /> <br /> The Optimal Golomb Rulers application searches for minimal Golomb rulers using distributed exhaustive search techniques. A Golomb ruler is considered optimal when no shorter ruler exists for the same number of marks.<br /> <br /> The search complexity increases rapidly as the number of marks increases, making volunteer computing useful for narrowing the solution space.<br /> <br /> === Muon ===<br /> <br /> The Muon application investigated calculations related to muon capture systems and neutrino factory research. The project assisted with simulations connected to accelerator physics and beam transport studies.<br /> <br /> === Harmonious Trees ===<br /> <br /> Harmonious Trees explored graph theoretic problems related to harmonious labeling of trees. The application used parallelized tree search methods distributed across volunteer computers.<br /> <br /> === Distributed Rainbow Table Generator ===<br /> <br /> This application generated rainbow tables used in cryptographic research and password recovery analysis. The project demonstrated BOINC's suitability for large scale cryptographic precomputation workloads.<br /> <br /> == Volunteer computing ==<br /> <br /> Like other BOINC projects, Yoyo@home depends on volunteers donating unused processing power from personal computers. Participants install the BOINC client and attach to the project server to download computational tasks.<br /> <br /> Volunteer computing projects such as Yoyo@home allow scientific institutions and independent researchers to access aggregate computational performance comparable to large clusters or supercomputers. The combined throughput of distributed systems may be expressed as:<br /> <br /> &lt;math&gt;P_{total} = \sum_{i=1}^{n} P_i&lt;/math&gt;<br /> <br /> where &lt;math&gt;P_i&lt;/math&gt; represents the computational performance contributed by each participating host.<br /> <br /> The BOINC infrastructure additionally provides redundancy and result validation by sending identical work units to multiple hosts.<br /> <br /> == Project team / Sponsors ==<br /> <br /> The Yoyo@home project has been maintained by volunteers associated with Rechenkraft.net.<br /> <br /> Known contributors include:<br /> <br /> * '''yoyo''' , project administrator<br /> * '''Rebirther''' , graphics and logos<br /> * '''scsimodo''' , compiling and testing the macOS version<br /> * '''Cody''' , enhancements and testing for the Windows version<br /> * '''Dotsch''' , compiling and testing on Linux 64, Solaris, PlayStation 3, FreeBSD, and AIX<br /> * '''Alderan''' , OpenGL screensaver development<br /> <br /> The project is sponsored and hosted by [[wikipedia:Rechenkraft.net|Rechenkraft.net e.V.]].<br /> <br /> == Scientific results ==<br /> <br /> Yoyo@home computations have contributed to published research in evolutionary biology, combinatorics, graph theory, cryptography, and number theory.<br /> <br /> [[File:BOINC logo.png|left|frameless|150x150px|The BOINC platform powers Yoyo@home.]]<br /> The project has been especially notable for supporting studies related to Muller's ratchet and extinction dynamics in small populations. Other computations have contributed to searches for solutions of high degree Diophantine equations and graph theoretic labeling problems.<br /> Some Yoyo@home subprojects have also served as case studies in volunteer computing scalability and distributed search efficiency.<br /> <br /> Some Yoyo@home subprojects have also served as case studies in volunteer computing scalability and distributed search efficiency.<br /> <br /> == Scientific publications ==<br /> <br /> === Yoyo@home (Evolution@home) ===<br /> <br /> # Waxman, D. and L. Loewe. [https://linkinghub.elsevier.com/retrieve/pii/S0022519310001372 A stochastic model for a single click of Muller's ratchet]. ''Journal of Theoretical Biology'' (2010). {{doi|10.1016/j.jtbi.2010.03.014}}<br /> # Loewe, Laurence and Asher D Cutter. [http://bmcevolbiol.biomedcentral.com/articles/10.1186/1471-2148-8-125 On the potential for extinction by Muller's Ratchet in Caenorhabditis elegans]. ''BMC Evolutionary Biology'' (2008). {{doi|10.1186/1471-2148-8-125}}<br /> # Loewe, Laurence and Dunja K Lamatsch. [http://bmcevolbiol.biomedcentral.com/articles/10.1186/1471-2148-8-88 Quantifying the threat of extinction from Muller's ratchet in the diploid Amazon molly (Poecilia formosa)]. ''BMC Evolutionary Biology'' (2008). {{doi|10.1186/1471-2148-8-88}}<br /> # Loewe, Laurence. [https://onlinelibrary.wiley.com/doi/10.1002/spe.806 Evolution@home: observations on participant choice, work unit variation and low-effort global computing]. ''Software: Practice and Experience'' (2007). {{doi|10.1002/spe.806}}<br /> # Loewe, Laurence. [https://www.cambridge.org/core/product/identifier/S0016672306008123/type/journal_article Quantifying the genomic decay paradox due to Muller's ratchet in human mitochondrial DNA]. ''Genetical Research'' (2006). {{doi|10.1017/S0016672306008123}}<br /> # Loewe, Laurence. Evolution@home: [https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-6-S3-P18 Global computing quantifies evolution due to Muller's ratchet]. ''BMC Bioinformatics'' (2005). {{doi|10.1186/1471-2105-6-S3-P18}}<br /> <br /> === Yoyo@home (Harmonious Trees) ===<br /> <br /> # Fang, Wenjie and Uwe Beckert. [http://link.springer.com/10.1007/s10723-017-9411-5 Parallel Tree Search in Volunteer Computing: a Case Study]. ''Journal of Grid Computing'' (2018). {{doi|10.1007/s10723-017-9411-5}}<br /> <br /> === Yoyo@home (Muon) ===<br /> <br /> # Brooks, S. [https://ora.ouls.ox.ac.uk/objects/uuid:7b724028-e4ef-4248-9d42-505e571c9e19 Muon capture schemes for the neutrino factory]. (2010).<br /> <br /> === Yoyo@home (ORG) ===<br /> <br /> # Gerbicz, Robert, Jean Charles Meyrignac and Uwe Beckert. [https://arxiv.org/abs/1108.0462 All solutions of the Diophantine equation &lt;math&gt;a^6+b^6=c^6+d^6+e^6+f^6+g^6&lt;/math&gt; for &lt;math&gt;a,b,c,d,e,f,g &lt; 250000&lt;/math&gt; found with a distributed BOINC project]. (2011). {{doi|10.48550/arXiv.1108.0462}}<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:Distributed computing|Distributed computing]]<br /> * [[wikipedia:Rechenkraft.net|Rechenkraft.net]]<br /> * [[wikipedia:Muller's ratchet|Muller's ratchet]]<br /> * [[wikipedia:Golomb ruler|Golomb ruler]]<br /> <br /> == External links ==<br /> <br /> * [https://www.rechenkraft.net/yoyo/ Official Yoyo@home website]<br /> * [https://www.rechenkraft.net/wiki/Yoyo@home Yoyo@home wiki]<br /> * [https://boinc.berkeley.edu/ BOINC official website]<br /> * [https://www.rechenkraft.net/ Rechenkraft.net]<br /> <br /> == References ==<br /> <br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NumberFields@Home&diff=1445 2026-05-29T13:53:28Z

<p>Al Piskun: </p> <hr /> <div>BOINC project [https://numberfields.asu.edu/NumberFields/ '''''NumberFields@Home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that needs your help to search for fields with special properties.<br /> <br /> == Why NumberFields@Home? ==<br /> Fields are important mathematical constructs that have far reaching applications to many branches of mathematics. Many people are familiar with the fields of rational numbers, real numbers, and complex numbers. The fields we are concerned with in this project are number fields: subsets of the complex numbers which contain the root of a given polynomial and are minimal for then being closed under addition, subtraction, multiplication, and division (except for division by 0). In particular, we are interested in imprimitive degree 10 fields (called decic fields), which correspond to certain degree 10 polynomials.<br /> <br /> Number theorists can mine the data for interesting patterns to help them formulate conjectures about number fields. Ultimately, this research will lead to a deeper understanding of the properties of numbers, the basic building blocks of all mathematics. Another application of number fields is in [[wikipedia:Cryptography|'''''cryptography''''']], where they are used in sophisticated factoring algorithms and as the basis for new cryptosystems. There are also distant applications to mathematical physics, including [[wikipedia:Quantum_mechanics|'''''quantum mechanics''''']] and [[wikipedia:String_theory|'''''string theory''''']].<br /> <br /> == Goals ==<br /> One way to categorize fields is by the primes that ramify in them. For a given set of primes, the number of fields ramified at those primes is finite. The primary goal of the project is to find this finite set of fields for various sets of primes. Since the number of combinations of primes is unlimited, the project will remain open-ended for the foreseeable future.<br /> <br /> Another way to categorize fields is by their discriminant, which is an important invariant for a field. Given a fixed bound , there are only a finite number of fields whose discriminant is less than this bound. A secondary goal of the project is to determine the finite set of &quot;minimum discriminant&quot; imprimitive decic fields for the bound &lt;math&gt;B=1.2 \times 10^{11}&lt;/math&gt;. This bound was chosen for it's potential to find more fields while keeping the computational load manageable.<br /> <br /> == Methods ==<br /> Computing lower degree fields requires less processing power and have been more extensively tabulated but the degree 10 case is the first case requiring a massively parallel solution. After recalling this [https://www.linux-magazine.com/Issues/2006/71/BOINC/ '''''article in Linux Magazine'''''], and knowing that the math department had limited resources (but access to a suitable workstation), Eric Driver launched NumberFields@Home to meet the computational demand.<br /> <br /> Finite extension fields are represented by polynomials (i.e. they are of the form &lt;math&gt;\mathbb{Q}(\alpha)&lt;/math&gt; where &lt;math&gt;\alpha&lt;/math&gt; is the root of a polynomial). Bounds on the field discriminant give rise to bounds on the polynomial coefficients, so there are a finite number of possible polynomials that can represent the fields we are searching for. At the most basic level, the NumberFields@Home algorithm searches over this finite set of polynomials, checking whether or not a polynomial can represent a field with the desired discriminant and ramification properties. At a finer level, the algorithm uses some tricky theoretical arguments to reduce the polynomial search space. In addition, the targeted ramification structure gives rise to congruence relations on the polynomial coefficients, which further reduces the search space. Anybody interested in the finer details of the algorithm is encouraged to look through [https://numberfields.asu.edu/NumberFields/Dissertation.pdf '''''Eric D. Driver's dissertation'''''].<br /> <br /> The project as a whole is basic research, in effect, charting unknown territory. In the future, this may have a bearing on a number of questions.<br /> <br /> ==== Automorphic Forms ====<br /> Number fields are related to [[wikipedia:Automorphic_form|'''''automorphic forms''''']], which are part of the Langlands program. '''[https://www.quantamagazine.org/what-is-the-langlands-program-20220601/ ''Explanations for the Langlands program'']'''''. ('''[https://youtu.be/_bJeKUosqoY See video: The Biggest Project in Modern Mathematics]''')''[[Image:Dedekind Eta.jpg|none|thumb|500px|The [[wikipedia:Dedekind_eta_function|'''''Dedekind eta-function''''']] is an automorphic form in the complex plane.]]The theory of automorphic forms is an important topic within mathematics. They provide one side of the Langlands program, a set of sweeping conjectures in number theory. There are deep connections between automorphic forms and number fields, and knowing an automorphic form will give information about the ramifying primes of corresponding number fields.<br /> <br /> ==== Cryptography ====<br /> Number fields are used in some modern factoring algorithms which are relevant to attacks on RSA. Other researchers have investigated using properties of number fields as the basis of new cryptosystems. It is not clear what number fields will be useful in this research, but the more we know about the general landscape of number fields, the better.<br /> <br /> ==== Arithmetic Statistics ====<br /> There has been both progress and new conjectures in recent years on asymptotic questions about number fields. If one fixes the degree &lt;math&gt;n&lt;/math&gt; and has a bound &lt;math&gt;B&lt;/math&gt;, there are finitely many degree &lt;math&gt;n&lt;/math&gt; number fields with absolute discriminant less than or equal to &lt;math&gt;B&lt;/math&gt;. One can then ask how this count grows as a function of &lt;math&gt;B&lt;/math&gt;.<br /> <br /> Recently, researchers have been factoring the Galois group of the extension. At present, there is very little data in degree 10, and imprimitive fields produce a large number of different Galois groups.<br /> <br /> One can also ask about asymptotics based on the set of ramifying primes. There is even less data currently available for investigating questions of this sort.<br /> <br /> Before one can seriously consider asymptotics, it is useful to know where the first examples lie. This project has helped establish the first examples of imprimitive decic number fields with certain Galois groups. One can also consider &quot;first examples&quot; from another perspective, namely by the Galois root discriminant (GRD) of the field. We compute the GRD of the fields found there, looking for fields with especially small GRD. Some [http://hobbes.la.asu.edu/lowgrd/ '''''results for low GRD fields can be found here'''''].<br /> <br /> ==== Theoretical Physics ====<br /> The fields concerned with in this project have connections to the p-adic fields. In recent years, p-adic analysis has been applied to problems in theoretical physics, including quantum mechanics and string theory. [[wikipedia:P-adic_quantum_mechanics |'''''Here is a good introduction''''']] to the relevant concepts.<br /> <br /> It is too early to tell exactly how beneficial our tables of fields will be to the physics community.<br /> <br /> == Project team / Sponsors ==<br /> Eric D. Driver. [https://math.asu.edu/ '''''school of mathematics'''''] at Arizona State University.<br /> <br /> == Scientific results ==<br /> * '''''https://numberfields.asu.edu/NumberFields/FieldTables/FieldTables.html'''''<br /> <br /> == Scientific publications ==<br /> <br /> # Driver, Eric D. and John W. Jones. [https://linkinghub.elsevier.com/retrieve/pii/S0022314X19300988 '''''Computing septic number fields''''']. Journal of Number Theory (2019). DOI: 10.1016/j.jnt.2019.02.022.<br /> # Driver, Eric D. and John W. Jones. [http://www.tandfonline.com/doi/abs/10.1080/10586458.2010.10390637 '''''Minimum Discriminants of Imprimitive Decic Fields''''']. Experimental Mathematics (2010). DOI: 10.1080/10586458.2010.10390637.<br /> # Driver, Eric D. and John W. Jones. [https://ui.adsabs.harvard.edu/abs/2009MaCom..78.1109D '''''A targeted Martinet search''''']. Mathematics of Computation (2009). DOI: 10.1090/S0025-5718-08-02178-9.</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=ODLK2025&diff=1444 2026-05-29T13:51:28Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = ODLK2025<br /> | logo = Odlk2025.jpg<br /> | logo caption = ODLK2025 project logo<br /> <br /> | status = Active<br /> | category = Mathematics / Number Theory<br /> | compute = CPU<br /> <br /> | author = Natalia Makarova<br /> | developer = Natalia Makarova, termit<br /> | maintainer = termit<br /> | released = 13 February 2025<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux<br /> <br /> | stats as of = 22 May 2026<br /> | active users = 100<br /> | total users = 251<br /> | active hosts = 307<br /> | total hosts = 1553<br /> <br /> | average performance = ~1,869 GigaFLOPS (current); ~2,239 GigaFLOPS (total across apps)<br /> <br /> | website = {{URL|https://boinc.mak.termit.me/odlk2025/}}<br /> }}<br /> <br /> [https://boinc.mak.termit.me/odlk2025/ '''''ODLK2025'''''] is a [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]]-based '''''[[wikipedia:Volunteer computing|volunteer computing]]''''' project that searches for symmetric [[wikipedia:Prime k-tuple|''k''-tuples]] of consecutive prime numbers. It was launched on 13 February 2025 by mathematician Natalia Makarova and server administrator termit, as a continuation and extension of earlier distributed-computing efforts on the same mathematical problem.&lt;ref name=&quot;tbrada_launch&quot;&gt;{{cite web |url=https://boinc.tbrada.eu/old_news.php |title=News archive — T.Brada Experimental Grid |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> == Background ==<br /> <br /> === Volunteer computing and BOINC ===<br /> <br /> [[wikipedia:Volunteer computing|Volunteer computing]] is an arrangement in which members of the public donate idle CPU cycles on their personal computers to scientific research projects.&lt;ref name=&quot;boinc_paper&quot;&gt;{{cite journal |author=Anderson, David P. |title=BOINC: A Platform for Volunteer Computing |journal=Journal of Grid Computing |year=2019 |doi=10.1007/s10723-019-09497-9}}&lt;/ref&gt; The [[wikipedia:Berkeley Open Infrastructure for Network Computing|Berkeley Open Infrastructure for Network Computing]] (BOINC) is an open-source middleware system, developed at the University of California, Berkeley, that is the most widely-used platform for such projects.&lt;ref name=&quot;boinc_wiki&quot;&gt;{{cite web |url=https://en.wikipedia.org/wiki/Berkeley_Open_Infrastructure_for_Network_Computing |title=Berkeley Open Infrastructure for Network Computing — Wikipedia |accessdate=2026-05-22}}&lt;/ref&gt; Volunteers install the BOINC client on their computers; the project server then distributes work units, collects results, and awards credits.<br /> <br /> === Project lineage ===<br /> <br /> ODLK2025 is the latest in a chain of related projects all aimed at symmetric prime tuples:<br /> <br /> * '''T.Brada Experimental Grid''' (TBEG) — hosted the original &quot;Symmetric Prime Tuples&quot; sub-project, created by Tomáš Brada, which ran until it was discontinued in late 2022.&lt;ref name=&quot;tbrada_launch&quot;/&gt;<br /> * '''Symmetric Prime Tuples (SPT)''' — a new BOINC project at &lt;code&gt;boinc.termit.me/adsl&lt;/code&gt; that continued the work. The SPT application uses the open-source [[wikipedia:primesieve|primesieve]] library to construct a sieve of primes in memory, consuming roughly 1.3 GB RAM per task, then searches for symmetric tuples within the range up to &lt;math&gt;2^{64}&lt;/math&gt;.&lt;ref name=&quot;boincsynergy_spt&quot;&gt;{{cite web |url=https://boincsynergy.ca/wiki/index.php?title=SPT |title=SPT — BOINC Synergy Wiki |accessdate=2026-05-22}}&lt;/ref&gt;<br /> * '''ODLK2025''' — launched when the need arose to search beyond the &lt;math&gt;2^{64}&lt;/math&gt; limit that constrains SPT, and when disagreements over adding a new application algorithm to SPT led Makarova and termit to establish an independent project.&lt;ref name=&quot;formulaboinc&quot;&gt;{{cite web |url=https://www.formula-boinc.org/forum/viewtopic.php?t=418&amp;start=20 |title=Marathon 2025 — FormulaBoinc Forum |date=2025-01-25 |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> ODLK2025 also continues work previously done in '''ODLK''' (&lt;code&gt;boinc.progger.info/odlk&lt;/code&gt;) and is described on its own homepage as &quot;a new fork from&quot; TBEG, SPT, and ODLK.&lt;ref name=&quot;odlk2025_home&quot;&gt;{{cite web |url=https://boinc.mak.termit.me/odlk2025/ |title=ODLK2025 — What is ODLK2025? |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> Note: BOINC's creator, David Anderson, declined to add ODLK2025 to the official BOINC project list, citing a preference against &quot;overlapping&quot; projects.&lt;ref name=&quot;boinc_berkeley_thread&quot;&gt;{{cite web |url=https://boinc.berkeley.edu/forum_thread.php?id=15423 |title=Thread: New project ODLK2025 — BOINC message boards |date=2025-01-20 |accessdate=2026-05-22}}&lt;/ref&gt; The project is therefore independently hosted and listed on community sites such as BOINC Synergy.<br /> <br /> == Why ODLK2025? ==<br /> [[File:Spirale Ulam 150.jpg|thumb|305x305px|The [[wikipedia:Ulam spiral|Ulam spiral]], a visualisation of the distribution of prime numbers, illustrating the clustering phenomena that motivate the search for prime tuples.]]<br /> ODLK2025 is a subproject of the BOINC project [https://boinc.termit.me/adsl/ Symmetric Prime Tuples (SPT)].<br /> <br /> ODLK2025 solves the problem of finding symmetric tuples of consecutive prime numbers which cannot be found in the BOINC project SPT due to the search range limitation to &lt;math&gt;2^{64}&lt;/math&gt;.<br /> <br /> In particular, the problem of finding symmetric tuples of length 17 of consecutive prime numbers according to the following pattern:<br /> <br /> : &lt;math&gt;0, 6, 24, 36, 66, 84, 90, 114, 120, 126, 150, 156, 174, 204, 216, 234, 240&lt;/math&gt;<br /> <br /> The existence of such tuples is a necessary condition for the existence of a symmetric tuple of length 19 of consecutive prime numbers with a minimum diameter of 252.<br /> <br /> Currently, this sub-problem is also being discussed in a non-BOINC context at the [https://dxdy.ru/topic100750.html dxdy.ru forum topic &quot;Symmetric tuples of consecutive prime numbers&quot;].<br /> <br /> == Goal ==<br /> <br /> The primary goal of ODLK2025 is to find symmetric [[wikipedia:Prime k-tuple|''k''-tuples]] of consecutive prime numbers in search ranges that exceed &lt;math&gt;2^{64}&lt;/math&gt;, which is the limit of the parent SPT project. The project pursues the following concrete targets:<br /> <br /> * Find symmetric 17-tuples of consecutive primes matching the pattern &lt;math&gt;0, 6, 24, 36, 66, 84, 90, 114, 120, 126, 150, 156, 174, 204, 216, 234, 240&lt;/math&gt; — a necessary precondition for demonstrating the existence of a symmetric 19-tuple with minimum diameter 252.<br /> * Search for symmetric 19-tuples (''Calc19Tuples'' application) and 21-tuples (''Calc21Tuples'') in higher ranges.<br /> * Search for symmetric 15-tuples via the ''Calc15Tuples'' application, which uses an algorithm by Makarova that allows the search to be completed exhaustively over a defined range.&lt;ref name=&quot;odlk2025_news&quot;&gt;{{cite web |url=https://boinc.mak.termit.me/odlk2025/ |title=ODLK2025 News — Calc15Tuples launched |date=2025-07-12 |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> == Mathematical background ==<br /> [[File:PrimePi.svg|thumb|305x305px|The [[wikipedia:Prime-counting function|prime-counting function]] &lt;math&gt;\pi(x)&lt;/math&gt;, illustrating the density of primes - the raw material for prime tuple searches.]]<br /> The mathematical foundations of ODLK2025 rest on the theory of [[wikipedia:Prime k-tuple|prime ''k''-tuples]] and the [[wikipedia:First Hardy–Littlewood conjecture|Hardy–Littlewood conjectures]].&lt;ref name=&quot;hl_conjecture&quot;&gt;{{cite web |url=https://en.wikipedia.org/wiki/First_Hardy%E2%80%93Littlewood_conjecture |title=First Hardy–Littlewood conjecture — Wikipedia |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> === The Hardy–Littlewood conjecture ===<br /> <br /> In 1923, G. H. Hardy and J. E. Littlewood proposed a conjecture giving the asymptotic density of admissible prime ''k''-tuples.&lt;ref name=&quot;hl_original&quot;&gt;{{cite journal |author=Hardy, G. H.; Littlewood, J. E. |title=Some Problems of 'Partitio Numerorum.' III. On the Expression of a Number as a Sum of Primes |journal=Acta Mathematica |volume=44 |pages=1–70 |year=1923}}&lt;/ref&gt; If &lt;math&gt;\mathcal{H} = (a_1, a_2, \ldots, a_k)&lt;/math&gt; is an admissible pattern (one that does not cover all residues for any prime), the conjecture predicts that the count of primes &lt;math&gt;p \leq n&lt;/math&gt; for which &lt;math&gt;p+a_1, \ldots, p+a_k&lt;/math&gt; are all prime is asymptotically<br /> <br /> :&lt;math&gt;\pi_{\mathcal{H}}(n) \sim \mathfrak{S}(\mathcal{H}) \int_2^n \frac{dt}{(\log t)^{k+1}}&lt;/math&gt;<br /> <br /> where &lt;math&gt;\mathfrak{S}(\mathcal{H})&lt;/math&gt; is the Hardy–Littlewood singular series (a product over primes reflecting local density corrections). This conjecture remains unproven but is strongly supported by numerical evidence.&lt;ref name=&quot;toth_arxiv&quot;&gt;{{cite web |url=https://arxiv.org/abs/1910.02636 |title=On The Asymptotic Density Of Prime k-tuples and a Conjecture of Hardy and Littlewood |author=Tóth, László |year=2019 |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> === Problem 62 ===<br /> <br /> The specific research problem addressed by ODLK2025 was originally formulated by Natalia Makarova and published as &quot;Problem 62. Symmetric k-tuples of consecutive primes&quot; on the PrimePuzzles.net website.&lt;ref name=&quot;prob62&quot;&gt;{{cite web |url=https://www.primepuzzles.net/problems/prob_062.htm |title=Problem 62. Symmetric k-tuples of consecutive primes — primepuzzles.net |accessdate=2026-05-22}}&lt;/ref&gt; The definitions below are taken from that problem statement.<br /> <br /> == Methods ==<br /> <br /> === Definition 1: Prime ''k''-tuple ===<br /> <br /> A prime ''k''-tuple is a finite collection of values &lt;math&gt;(p + a_1,\; p + a_2,\; p + a_3,\; \ldots,\; p + a_k)&lt;/math&gt;, where &lt;math&gt;p,\; p + a_1,\; p + a_2,\; \ldots,\; p + a_k&lt;/math&gt; are prime numbers and &lt;math&gt;(a_1, a_2, a_3, \ldots, a_k)&lt;/math&gt; is called the '''pattern'''. Typically the first value in the pattern is 0 and the rest are distinct positive even numbers.&lt;ref name=&quot;prob62&quot;/&gt; We consider the ''k''-tuple where &lt;math&gt;p + a_1, p + a_2, \ldots, p + a_k&lt;/math&gt; are '''consecutive''' primes.<br /> <br /> === Definition 2: Symmetric ''k''-tuple (even length) ===<br /> <br /> A ''k''-tuple &lt;math&gt;(p + a_1,\; p + a_2,\; \ldots,\; p + a_{k/2},\; p + a_{k/2+1},\; \ldots,\; p + a_{k-1},\; p + a_k)&lt;/math&gt; for even &lt;math&gt;k&lt;/math&gt; is called '''symmetric''' if<br /> <br /> :&lt;math&gt;a_1 + a_k \;=\; a_2 + a_{k-1} \;=\; a_3 + a_{k-2} \;=\; \cdots \;=\; a_{k/2} + a_{k/2+1}.&lt;/math&gt;<br /> <br /> '''Example''' — symmetric 8-tuple:<br /> <br /> :&lt;math&gt;17:\; 0,\; 2,\; 6,\; 12,\; 14,\; 20,\; 24,\; 26&lt;/math&gt;<br /> <br /> which is short for &lt;math&gt;(17+0,\; 17+2,\; 17+6,\; 17+12,\; 17+14,\; 17+20,\; 17+24,\; 17+26)&lt;/math&gt;.<br /> <br /> === Definition 3: Symmetric ''k''-tuple (odd length) ===<br /> <br /> A ''k''-tuple for odd &lt;math&gt;k&lt;/math&gt; is called '''symmetric''' if<br /> <br /> :&lt;math&gt;a_1 + a_k \;=\; a_2 + a_{k-1} \;=\; \cdots \;=\; a_{(k-1)/2} + a_{(k-1)/2+2} \;=\; 2\,a_{(k-1)/2+1}.&lt;/math&gt;<br /> <br /> '''Example''' — symmetric 5-tuple:<br /> <br /> :&lt;math&gt;18713:\; 0,\; 6,\; 18,\; 30,\; 36&lt;/math&gt;<br /> <br /> === Definition 4: Diameter ===<br /> <br /> The '''diameter''' &lt;math&gt;d&lt;/math&gt; of a ''k''-tuple is the difference between its largest and smallest elements.&lt;ref name=&quot;prob62&quot;/&gt;<br /> <br /> '''Example''' — the 8-tuple &lt;math&gt;17:\; 0, 2, 6, 12, 14, 20, 24, 26&lt;/math&gt; has diameter &lt;math&gt;d = 26&lt;/math&gt;.<br /> <br /> == Applications ==<br /> <br /> The project currently runs four CPU-only applications for Windows (x86-64) and Linux (x86-64):&lt;ref name=&quot;apps&quot;&gt;{{cite web |url=https://boinc.mak.termit.me/odlk2025/apps.php |title=ODLK2025 Applications |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Application !! Description !! Version !! Avg. performance (Windows / Linux)<br /> |-<br /> | '''Calculate Tuples''' || Original symmetric-tuple search application (now suspended to save resources) || 2.95 || 182 / 122 GigaFLOPS<br /> |-<br /> | '''Calc19Tuples''' || Searches for symmetric 19-tuples || 2.18 || 629 / 169 GigaFLOPS<br /> |-<br /> | '''Calc21Tuples''' || Searches for symmetric 21-tuples || 1.16 || 862 / 203 GigaFLOPS<br /> |-<br /> | '''Calc15Tuples''' || Searches for 15-tuples (and sub-tuples 9, 11, 13) using Makarova's exhaustive algorithm || 1.05 || 38 / 35 GigaFLOPS<br /> |}<br /> <br /> The total average computing power across all applications is approximately '''2,239 GigaFLOPS'''.<br /> <br /> All applications are CPU-only. GPU support is not currently offered.<br /> <br /> == Server status (as of 22 May 2026) ==<br /> <br /> The following statistics were read directly from the [https://boinc.mak.termit.me/odlk2025/server_status.php project server status page]:&lt;ref name=&quot;server_status&quot;&gt;{{cite web |url=https://boinc.mak.termit.me/odlk2025/server_status.php |title=ODLK2025 Project Status |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Metric !! Value<br /> |-<br /> | Users with credit || 251<br /> |-<br /> | Users with recent credit || 100<br /> |-<br /> | Computers with credit || 1,553<br /> |-<br /> | Computers with recent credit || 307<br /> |-<br /> | Current performance || ~1,869 GigaFLOPS<br /> |-<br /> | Tasks in progress || 12,098<br /> |-<br /> | Tasks ready to send || 8,207<br /> |}<br /> <br /> All server daemons (scheduler, feeder, transitioner, validators, assimilators, file deleter) are reported as '''Running'''.<br /> <br /> == How to participate ==<br /> <br /> # Download and install the [https://boinc.berkeley.edu/download.php BOINC client] for your operating system (Windows or Linux).<br /> # In the BOINC Manager, choose '''Add Project''' and enter the URL: &lt;code&gt;https://boinc.mak.termit.me/odlk2025/&lt;/code&gt;<br /> # Create an account, and BOINC will automatically download work units and begin computing.<br /> <br /> Each task currently runs for an average of 1.5–3 hours depending on application. Tasks are CPU-only and require no GPU.<br /> <br /> == Project team / Sponsors ==<br /> <br /> * '''Natalia (Nataliya) Makarova''' — Project scientist; originator of Problem 62 and the underlying algorithms.&lt;ref name=&quot;prob62&quot;/&gt;<br /> * '''termit''' — Project administrator; operates the server infrastructure.<br /> <br /> == Related projects ==<br /> <br /> * [https://boinc.termit.me/adsl/ Symmetric Prime Tuples (SPT)] — the parent BOINC project; searches up to &lt;math&gt;2^{64}&lt;/math&gt;<br /> * [https://boinc.progger.info/odlk/ ODLK] — earlier project at progger.info hosting related tuple work<br /> * [[wikipedia:PrimeGrid|PrimeGrid]] — a major BOINC project searching for prime numbers of various forms<br /> * [https://gerasim.boinc.ru/ Gerasim@Home] — also runs a &quot;Get Symmetrical Tuples&quot; application using a different algorithm (odd-length tuples only)&lt;ref name=&quot;boinc_australia&quot;&gt;{{cite web |url=http://forum.boinc-australia.net/index.php?board=223.0 |title=Symmetric Prime Tuples (SPT) — BOINC Australia Forum |accessdate=2026-05-22}}&lt;/ref&gt;<br /> <br /> == Results repository ==<br /> <br /> Computed results (found tuples) are stored in the project's public database:<br /> <br /> * [https://boinc.mak.termit.me:5000/ ODLK2025 Results Repository]<br /> <br /> == Related scientific papers ==<br /> <br /> * {{cite web |author=Volfson, Victor |title=Dependencies of prime numbers in a tuple |url=https://arxiv.org/pdf/2601.08889 |year=2026 |publisher=arXiv}} — Analyses the Hardy–Littlewood constant for symmetric tuples and proves that it decreases monotonically as tuple length decreases, reflecting weakening inter-prime dependence.<br /> * {{cite web |author=Tóth, László |title=On The Asymptotic Density Of Prime k-tuples and a Conjecture of Hardy and Littlewood |url=https://arxiv.org/abs/1910.02636 |year=2019 |publisher=arXiv}} — Computes &quot;Skewes numbers&quot; for nine prime k-tuples and provides numerical support for the Hardy–Littlewood conjecture.<br /> * {{cite journal |author=Anderson, David P. |title=BOINC: A Platform for Volunteer Computing |journal=Journal of Grid Computing |year=2019 |doi=10.1007/s10723-019-09497-9}} — Describes the BOINC platform on which ODLK2025 runs.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:Prime k-tuple|Prime ''k''-tuple]]<br /> * [[wikipedia:First Hardy–Littlewood conjecture|First Hardy–Littlewood conjecture]]<br /> * [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:PrimeGrid|PrimeGrid]]<br /> * [[wikipedia:Twin prime|Twin prime]]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> == External links ==<br /> <br /> * [https://boinc.mak.termit.me/odlk2025/ ODLK2025 official project page]<br /> * [https://boinc.mak.termit.me/odlk2025/server_status.php ODLK2025 server status]<br /> * [https://boinc.mak.termit.me:5000/ Results repository]<br /> * [https://www.primepuzzles.net/problems/prob_062.htm Problem 62: Symmetric k-tuples of consecutive primes] (primepuzzles.net)<br /> * [https://dxdy.ru/topic100750.html Symmetric tuples of consecutive prime numbers] (dxdy.ru forum, in Russian)<br /> * [https://boinc.termit.me/adsl/ Symmetric Prime Tuples (SPT)] — parent BOINC project<br /> * [https://boincsynergy.ca/wiki/ODLK2025/ ODLK2025 on BOINC Synergy]<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Mathematics]]<br /> [[Category:Number theory]]<br /> [[Category:Prime numbers]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=NFS@Home&diff=1443 2026-05-29T13:44:05Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = NFS@Home<br /> | logo = Nfs.jpg<br /> | logo caption = NFS@Home logo<br /> | screenshot = <br /> | caption = <br /> <br /> | status = Active<br /> | category = Mathematics<br /> | compute = CPU<br /> | dependencies = <br /> <br /> | developer = Greg Childers<br /> | author = Greg Childers<br /> | sponsor = California State University, Fullerton<br /> | maintainer = NFS@Home team<br /> | released = {{Start date and age|2010|01|01}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS<br /> | repository = {{URL|https://github.com/childers}}<br /> <br /> | stats as of = {{Start date and age|2026|01|23}}<br /> | average performance = 67.27 TFLOPS<br /> | active users = 1505<br /> | total users = 21193<br /> | active hosts = 5314<br /> | total hosts = 352727<br /> <br /> | credit per day = 12342466<br /> <br /> | cpu performance = 67.27 TFLOPS<br /> <br /> | website = {{URL|https://escatter11.fullerton.edu/nfs/}}<br /> | license = GNU General Public License<br /> }}<br /> <br /> [https://escatter11.fullerton.edu/nfs/ '''''NFS@Home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project based on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform. The project performs the lattice sieving stage of the [[wikipedia:General_number_field_sieve|General Number Field Sieve]] (GNFS), currently the fastest known classical algorithm for factoring large integers.&lt;ref name=&quot;home&quot;&gt;[https://escatter11.fullerton.edu/nfs/ NFS@Home project website]&lt;/ref&gt;<br /> <br /> The project is operated by Dr. Greg Childers at [[wikipedia:California State University, Fullerton|California State University, Fullerton]]. NFS@Home allows volunteers around the world to contribute unused CPU time toward large-scale integer factorization efforts related to mathematical research and cryptography.&lt;ref&gt;[https://escatter11.fullerton.edu/nfs/server_status.php NFS@Home server status]&lt;/ref&gt;<br /> [[File:Sieve of Eratosthenes animation.gif|thumb|300x300px|Animation that visualizes the &quot;Sieve of Eratosthenes&quot; algorithm]]<br /> <br /> == History ==<br /> <br /> NFS@Home originated from interest within the distributed computing community in applying volunteer computing resources to integer factorization problems. Prior work included development of the GGNFS and msieve software packages, which implemented variants of the Number Field Sieve algorithm.&lt;ref&gt;[https://www.math.ttu.edu/~cmonico/software/ggnfs/ GGNFS project]&lt;/ref&gt;<br /> <br /> Before NFS@Home launched, a BOINC-based project called RSA Lattice Siever distributed sieving work related to the factorization of cryptographic signing keys used in Texas Instruments graphing calculators.&lt;ref&gt;[https://web.archive.org/web/20140913231024/http://boinc.unsads.com/rsals/ RSA Lattice Siever archived website]&lt;/ref&gt;<br /> <br /> Greg Childers contributed to the RSA Lattice Siever project and later used experience gained from that effort to launch NFS@Home in 2010.&lt;ref&gt;[https://www.mersenneforum.org/showthread.php?t=12388 NFS@Home launch discussion on Mersenne Forum]&lt;/ref&gt;<br /> <br /> After RSA Lattice Siever ceased operations, some of its workloads and methodologies were merged into NFS@Home, expanding the project to support a broader range of factorization tasks.&lt;ref&gt;[https://www.mersenneforum.org/showthread.php?t=12388 Mersenne Forum discussion]&lt;/ref&gt;<br /> <br /> == Research goals ==<br /> <br /> NFS@Home focuses on the lattice sieving stage of the Number Field Sieve algorithm. This stage is computationally intensive and highly parallelizable, making it suitable for volunteer distributed computing.&lt;ref&gt;[https://escatter11.fullerton.edu/nfs/overview.php NFS@Home overview]&lt;/ref&gt;<br /> <br /> The project has contributed to:<br /> <br /> * Cunningham Project factorizations<br /> * Large composite integer factorizations<br /> * Aliquot sequence research<br /> * Mathematical and cryptographic investigations involving large semiprimes<br /> <br /> Results generated by NFS@Home are often published to the Cunningham tables and related mathematical databases.&lt;ref&gt;[https://homes.cerias.purdue.edu/~ssw/cun/ Cunningham Project]&lt;/ref&gt;<br /> <br /> == Project applications ==<br /> <br /> NFS@Home distributes several applications to volunteers, each targeting different sieve sizes and workloads.&lt;ref&gt;[https://escatter11.fullerton.edu/nfs/server_status.php NFS@Home server status]&lt;/ref&gt;<br /> <br /> {| class=&quot;wikitable sortable&quot;<br /> ! Application<br /> ! Purpose<br /> |-<br /> | lasieved<br /> | 14e lattice sieving<br /> |-<br /> | lasievee<br /> | 15e lattice sieving<br /> |-<br /> | lasieve5f<br /> | 16e lattice sieving version 5<br /> |-<br /> | lasievee_small<br /> | Smaller-number 15e sieving<br /> |-<br /> | lasievef_small<br /> | Smaller-number 16e sieving<br /> |}<br /> <br /> == Scientific results ==<br /> <br /> All project results are published through the NFS@Home website and associated mathematical databases.<br /> <br /> === Current project statistics ===<br /> <br /> As of January 2026, the project reported:&lt;ref&gt;[https://escatter11.fullerton.edu/nfs/server_status.php NFS@Home server status]&lt;/ref&gt;<br /> <br /> * Over 21,000 registered users<br /> * More than 352,000 participating computers<br /> * Approximately 67 TFLOPS of computing performance<br /> * More than 12 million BOINC credits granted daily<br /> <br /> === Result databases ===<br /> <br /> * [https://escatter11.fullerton.edu/nfs/crunching.php Detailed status of lasieved]<br /> * [https://escatter11.fullerton.edu/nfs/crunching_es.php Detailed status of lasievee_small]<br /> * [https://escatter11.fullerton.edu/nfs/crunching_e.php Detailed status of lasievee]<br /> * [https://escatter11.fullerton.edu/nfs/crunching_fs.php Detailed status of lasievef_small]<br /> <br /> == Project team and sponsorship ==<br /> <br /> NFS@Home is developed and maintained by Dr. Greg Childers at California State University, Fullerton.&lt;ref&gt;[https://escatter11.fullerton.edu/nfs/team.php NFS@Home team]&lt;/ref&gt;<br /> <br /> The project has received infrastructure and computational support through programs funded by the [[wikipedia:National Science Foundation|National Science Foundation]] and ACCESS cooperative infrastructure initiatives.&lt;ref&gt;[https://access-ci.org/ ACCESS program]&lt;/ref&gt;<br /> [[File:Humanities and Social Sciences May 2010 Commencement (cropped).jpg|thumb|'''California State University, Fullerton.''' Humanities and Social Sciences May 2010 Commencement. This is a view of the front entrance of the Humanities and Social Sciences building.]]<br /> <br /> == Software ==<br /> <br /> NFS@Home applications are based primarily on the following software packages:<br /> <br /> * [[wikipedia:Msieve|Msieve]]<br /> * GGNFS<br /> * BOINC middleware<br /> <br /> The project primarily distributes CPU-based workloads and does not currently provide native GPU applications.&lt;ref&gt;[https://escatter11.fullerton.edu/nfs/apps.php NFS@Home applications]&lt;/ref&gt;<br /> <br /> == Scientific papers and publications ==<br /> <br /> Several papers and references related to distributed integer factorization and BOINC infrastructure are associated with NFS@Home and related research.<br /> <br /> * D. Anderson, &quot;BOINC: A System for Public-Resource Computing and Storage&quot;, Fifth IEEE/ACM International Workshop on Grid Computing, 2004.<br /> * Greg Childers et al., papers and reports related to large integer factorization and lattice sieving.<br /> * [https://boinc.berkeley.edu/pubs.php BOINC publications database]<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:General_number_field_sieve|General Number Field Sieve]]<br /> * [[wikipedia:Integer factorization|Integer factorization]]<br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Cunningham_project|Cunningham Project]]<br /> * [[wikipedia:Distributed computing|Distributed computing]]<br /> <br /> == External links ==<br /> <br /> * [https://escatter11.fullerton.edu/nfs/ Official website]<br /> * [https://escatter11.fullerton.edu/nfs/server_status.php Server status]<br /> * [https://www.mersenneforum.org/forumdisplay.php?f=89 NFS@Home forum on Mersenne Forum]<br /> * [https://boinc.berkeley.edu/ BOINC official website]<br /> <br /> == References ==<br /> {{Reflist}}<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Mathematics software]]<br /> [[Category:Volunteer computing projects]]<br /> [[Category:Cryptographic research]]<br /> [[Category:California State University, Fullerton]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=TN-Grid&diff=1442 2026-05-29T13:43:07Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = TN-Grid<br /> | logo = Tn-grid.jpg<br /> | logo caption = TN-Grid logo<br /> | screenshot = <br /> | caption = TN-Grid BOINC screensaver<br /> <br /> | status = Active<br /> | category = Bioinformatics, Genetics, Drug discovery<br /> | compute = CPU<br /> | dependencies = <br /> <br /> | developer = Department of Information Engineering and Computer Science (DISI), [[wikipedia:University of Trento|University of Trento]]<br /> | sponsor = [[wikipedia:University of Trento|University of Trento]], National Research Council of Italy (CNR), BOINC.Italy<br /> | maintainer = TN-Grid team<br /> | released = {{Start date and age|2014|01|01}}<br /> | repository = {{URL|https://gene.disi.unitn.it/test/}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS<br /> | size = ~10 MB<br /> <br /> | stats as of = {{Start date and age|2026|05|23}}<br /> | average performance = 94.71 GigaFLOPS<br /> | active users = 63<br /> | total users = 3513<br /> | active hosts = 165<br /> | total hosts = 69613<br /> <br /> | website = {{URL|https://gene.disi.unitn.it/test/}}<br /> | license = Mixed; based on BOINC infrastructure<br /> }}<br /> <br /> BOINC based [https://gene.disi.unitn.it/test/ '''''TN-Grid'''''] is a '''''[[wikipedia:Volunteer computing|volunteer computing]]''''' project focused on bioinformatics, computational biology, and gene network analysis. The project uses the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] distributed computing platform to harness unused processing power donated by volunteers around the world. TN-Grid is operated by the Department of Information Engineering and Computer Science (DISI) at the [[wikipedia:University of Trento|University of Trento]] in Italy in collaboration with several scientific institutions and research groups.&lt;ref&gt;{{cite web |url=https://gene.disi.unitn.it/test/ |title=TN-Grid |publisher=University of Trento |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> The project is best known for its ''gene@home'' sub-project, which studies gene regulatory networks and causal relationships between genes in order to improve biological understanding and support applications such as disease research and drug repositioning.&lt;ref&gt;{{cite journal |last=Blanzieri |first=Enrico |title=A Computing System for Discovering Causal Relationships Among Human Genes to Improve Drug Repositioning |journal=IEEE Transactions on Emerging Topics in Computing |year=2021 |doi=10.1109/TETC.2020.3031024}}&lt;/ref&gt;<br /> <br /> == History ==<br /> <br /> TN-Grid was launched during the 2010s as an academic volunteer computing initiative developed at the [[wikipedia:University of Trento|University of Trento]]. The project was designed to provide researchers with access to large-scale computational resources without requiring dedicated supercomputers. Instead, computations are distributed among thousands of volunteer computers connected through the Internet using BOINC.&lt;ref&gt;{{cite conference |last=Asnicar |first=F. |title=TN-Grid and gene@home project: volunteer computing for bioinformatics |book-title=International Conference on High Performance Computing |year=2015}}&lt;/ref&gt;<br /> <br /> The project gained visibility within the BOINC community because of its focus on bioinformatics and causal inference in genetics, areas that require substantial computational resources for statistical analysis and network reconstruction.<br /> <br /> During the [[wikipedia:COVID-19 pandemic|COVID-19 pandemic]], TN-Grid received support from the AMD HPC Fund, which provided computing resources for scientific research initiatives.&lt;ref&gt;{{cite web |url=https://community.amd.com/t5/corporate/amd-hpc-fund-supports-covid-19-research/ba-p/414414 |title=AMD HPC Fund Supports COVID-19 Research |publisher=AMD |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> == Why TN-Grid? ==<br /> <br /> Modern biology produces enormous quantities of genomic and transcriptomic data. Understanding how genes interact with one another is one of the major challenges in bioinformatics and systems biology. Many diseases, developmental processes, and responses to environmental stress are controlled not by single genes, but by large interacting networks of genes and proteins.<br /> <br /> Constructing and analyzing these networks requires large-scale statistical computation. The computational complexity of many network inference algorithms grows rapidly with the number of genes involved. In simplified form, the number of possible interactions between genes may scale approximately as:<br /> <br /> &lt;math&gt;\frac{n(n-1)}{2}&lt;/math&gt;<br /> <br /> where &lt;math&gt;n&lt;/math&gt; represents the number of genes being analyzed.<br /> <br /> For modern genomic datasets involving thousands of genes, the number of possible relationships becomes extremely large. TN-Grid distributes these calculations across volunteer computers, significantly reducing the time required to analyze complex biological systems.<br /> <br /> == Goal ==<br /> <br /> The primary goal of TN-Grid is to support scientific research in bioinformatics through volunteer distributed computing. The project focuses on identifying causal relationships among genes, expanding gene regulatory networks, and improving computational methods for biological data analysis.<br /> <br /> TN-Grid researchers aim to:<br /> <br /> * discover new relationships between genes<br /> * improve understanding of cellular regulatory systems<br /> * assist drug repositioning and biomedical research<br /> * analyze large biological datasets efficiently<br /> * develop scalable algorithms for systems biology<br /> <br /> The project also serves as an example of citizen science and volunteer computing in academic research, allowing members of the public to contribute directly to scientific discovery.<br /> <br /> == Volunteer computing ==<br /> [[File:Gene expression matrix.jpg|thumb|300x300px|Gene expression matrix]]<br /> TN-Grid operates using the BOINC middleware platform developed at the [[wikipedia:University of California, Berkeley|University of California, Berkeley]]. Volunteers install the BOINC client software, attach to the TN-Grid project, and receive computational work units from project servers.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC |publisher=University of California, Berkeley |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> The computations are generally CPU-based and run in the background while the volunteer's computer is idle. Results are returned to project servers for validation and scientific analysis.<br /> <br /> Like many BOINC projects, TN-Grid awards participants credit points based on completed work units. These credits are used primarily for community statistics and competition among volunteers and teams.<br /> <br /> == Sub-projects ==<br /> <br /> === gene@home ===<br /> <br /> ''gene@home'' is the principal scientific application of TN-Grid. The project studies gene regulatory networks (GRNs), which describe causal and regulatory relationships among genes inside living organisms.<br /> <br /> Every living organism contains genes that encode the information necessary to produce proteins. Gene expression involves the transcription and translation of genetic information into functional biological molecules. Regulatory proteins and signaling pathways influence when genes are activated or suppressed.<br /> <br /> Gene regulatory networks are often represented mathematically as graphs:<br /> <br /> &lt;math&gt;G = (V,E)&lt;/math&gt;<br /> <br /> where:<br /> <br /> * &lt;math&gt;V&lt;/math&gt; represents genes<br /> * &lt;math&gt;E&lt;/math&gt; represents regulatory or causal relationships<br /> <br /> The goal of ''gene@home'' is to expand known GRNs by identifying additional genes that may participate in regulatory interactions.<br /> <br /> The project uses an algorithm called PC-IM, an iterative implementation derived from the PC algorithm used in causal inference and probabilistic graphical models.&lt;ref&gt;{{cite conference |last=Asnicar |first=Francesco |title=OneGenE: Regulatory Gene Network Expansion via Distributed Volunteer Computing on BOINC |book-title=2019 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing |year=2019 |doi=10.1109/EMPDP.2019.8671629}}&lt;/ref&gt;<br /> <br /> The algorithm partitions candidate genes into blocks, merges them with existing regulatory networks, and evaluates possible causal relationships. Iterative refinement is used to improve prediction quality and reduce false positives.<br /> <br /> Research has included studies on:<br /> <br /> * human gene interaction networks<br /> * grapevine gene regulation<br /> * plant biology<br /> * drug repositioning<br /> * causal inference in genomic data<br /> <br /> The project has collaborated with Fondazione Edmund Mach (FEM) and other Italian research institutions.&lt;ref&gt;{{cite web |url=https://gene.disi.unitn.it/test/genehome/en/description/basic-description.php |title=gene@home basic description |publisher=TN-Grid |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> == Scientific results ==<br /> <br /> [[File:BOINC_logo.png|right|150x150px|TN-Grid uses the BOINC volunteer computing platform.|frameless]]<br /> <br /> === gene@home ===<br /> <br /> The PC-IM algorithm has been evaluated using both synthetic and real biological datasets, including expression data from ''[[wikipedia:Arabidopsis thaliana|Arabidopsis thaliana]]'' and grapevine regulatory networks.<br /> <br /> Several experimental evaluations have been reported:<br /> <br /> ==== Preliminary evaluation ====<br /> <br /> Researchers compared ''in silico'' generated datasets with ''in vivo'' biological data from public databases. While simulated data provided higher sensitivity under some conditions, real biological datasets were considered more reliable for practical analysis.<br /> <br /> The project also compared the PC algorithm with ARACNE, another network inference algorithm. The PC algorithm demonstrated better performance on real expression datasets and improved positive predictive value (PPV).&lt;ref&gt;{{cite web |url=https://gene.disi.unitn.it/test/genehome/en/description/results.php |title=gene@home results |publisher=TN-Grid |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> ==== PC-IM evaluation ====<br /> <br /> Experiments analyzed several factors affecting PC-IM performance:<br /> <br /> * block size optimization<br /> * iteration count<br /> * robustness against non-real GRNs<br /> * comparison with competing methods such as GENIES<br /> <br /> The best performance was obtained using approximately 1000 genes per block and around 100 iterations.<br /> <br /> ==== Biological validation ====<br /> <br /> Researchers validated many predicted gene relationships through bibliographic analysis and comparison with known biological literature. Significant enrichment was observed relative to randomly selected genes, suggesting that the algorithm successfully identifies biologically meaningful relationships.<br /> <br /> == COVID-19 research ==<br /> <br /> During the COVID-19 pandemic, TN-Grid participated in computational efforts related to biomedical research and received support through AMD's HPC Fund initiative.&lt;ref&gt;{{cite web |url=https://community.amd.com/t5/corporate/amd-hpc-fund-supports-covid-19-research/ba-p/414414 |title=AMD HPC Fund Supports COVID-19 Research |publisher=AMD |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> The availability of volunteer computing resources allowed researchers to continue large-scale computational analysis during a period of increased global scientific collaboration.<br /> <br /> == Project team / Sponsors ==<br /> <br /> TN-Grid is operated primarily by researchers affiliated with:<br /> <br /> * National Research Council of Italy (CNR)<br /> * [[wikipedia:University of Trento|University of Trento]] (UniTN)<br /> * Department of Information Engineering and Computer Science (DISI)<br /> * BOINC.Italy<br /> * Fondazione Edmund Mach (FEM)<br /> <br /> The project also received support from AMD through the COVID-19 AMD HPC Fund initiative.<br /> <br /> == Scientific publications ==<br /> <br /> === gene@home ===<br /> <br /> # {{cite journal |last=Pilati |first=Stefania |title=Vitis OneGenE: A Causality-Based Approach to Generate Gene Networks in Vitis vinifera Sheds Light on the Laccase and Dirigent Gene Families |journal=Biomolecules |year=2021 |doi=10.3390/biom11121744}}<br /> # {{cite journal |last=Blanzieri |first=Enrico |title=A Computing System for Discovering Causal Relationships Among Human Genes to Improve Drug Repositioning |journal=IEEE Transactions on Emerging Topics in Computing |year=2021 |doi=10.1109/TETC.2020.3031024}}<br /> # {{cite conference |last=Asnicar |first=Francesco |title=OneGenE: Regulatory Gene Network Expansion via Distributed Volunteer Computing on BOINC |book-title=2019 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing |year=2019 |doi=10.1109/EMPDP.2019.8671629}}<br /> # {{cite journal |last=Malacarne |first=Giulia |title=Discovering Causal Relationships in Grapevine Expression Data to Expand Gene Networks |journal=Frontiers in Plant Science |year=2018 |doi=10.3389/fpls.2018.01385}}<br /> # {{cite journal |last=Asnicar |first=Francesco |title=NES 2 RA: Network expansion by stratified variable subsetting and ranking aggregation |journal=The International Journal of High Performance Computing Applications |year=2018 |doi=10.1177/1094342016662508}}<br /> # {{cite conference |last=Asnicar |first=Francesco |title=Discovering Candidates for Gene Network Expansion by Distributed Volunteer Computing |book-title=2015 IEEE Trustcom/BigDataSE/ISPA |year=2015 |doi=10.1109/Trustcom.2015.640}}<br /> # {{cite journal |last=Erculiani |first=Luca |title=Discovering candidates for gene network expansion by variable subsetting and ranking aggregation |journal=F1000Research |year=2015 |doi=10.7490/F1000RESEARCH.1110311.1}}<br /> # {{cite conference |last=Asnicar |first=F. |title=TN-Grid and gene@home project: volunteer computing for bioinformatics |book-title=International Conference on High Performance Computing |year=2015}}<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:Distributed computing|Distributed computing]]<br /> * [[wikipedia:Bioinformatics|Bioinformatics]]<br /> * [[wikipedia:Gene regulatory network|Gene regulatory network]]<br /> * [[wikipedia:Citizen science|Citizen science]]<br /> <br /> == External links ==<br /> <br /> * [https://gene.disi.unitn.it/test/ Official TN-Grid website]<br /> * [https://gene.disi.unitn.it/test/genehome/en/ gene@home]<br /> * [https://boinc.berkeley.edu/ BOINC]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:Bioinformatics]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Citizen science]]<br /> [[Category:University of Trento]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=GPUGRID&diff=1441 2026-05-29T13:41:38Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = GPUGRID<br /> | logo = Gpugrid logo.png<br /> | logo caption = GPUGRID project logo<br /> | screenshot = Gpugrid.png<br /> | caption = <br /> <br /> | status = Active<br /> | category = Biology, Molecular dynamics, Biomedical research<br /> | compute = GPU<br /> | dependencies = CUDA or OpenCL compatible graphics processor<br /> <br /> | developer = GPUGRID Team<br /> | author = Gianni De Fabritiis<br /> | sponsor = Universitat Pompeu Fabra<br /> | maintainer = GPUGRID Team<br /> | released = {{Start date and age|2007|10|16}}<br /> | repository =<br /> <br /> | programming language = C, C++, CUDA<br /> | operating system = Windows, Linux<br /> | size = ~100 MB<br /> <br /> | stats as of = {{Start date and age|2026|05|20}}<br /> | average performance = Multi-petaflop distributed GPU performance<br /> | active users = 3123<br /> | total users = 106215<br /> | active hosts = 6625<br /> | total hosts = 214544<br /> <br /> | gpu performance = GPU accelerated molecular dynamics simulations<br /> <br /> | website = {{URL|https://www.gpugrid.net/}}<br /> | license = Proprietary scientific software<br /> }}<br /> <br /> [https://www.gpugrid.net/ '''''GPUGRID'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project using the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform to perform large-scale [[wikipedia:Molecular dynamics|molecular dynamics]] simulations on graphics processing units (GPUs). The project is operated by researchers at [[wikipedia:Universitat Pompeu Fabra|Universitat Pompeu Fabra]] in Barcelona, Spain, and focuses primarily on biomedical research involving protein dynamics, drug discovery, and computational biology.&lt;ref name=&quot;gpugrid_about&quot;&gt;{{cite web |url=https://www.gpugrid.net/ |title=GPUGRID |publisher=GPUGRID |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> Originally launched as '''PS3GRID''' in 2007, the project initially used the [[wikipedia:PlayStation 3|PlayStation 3]] Cell processor for distributed molecular simulations before transitioning toward GPU computing under the name GPUGRID.&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20080514070943/http://www.ps3grid.net/ |title=PS3GRID archived website |publisher=Internet Archive |access-date=2026-05-20}}&lt;/ref&gt; GPUGRID became one of the earliest BOINC projects designed specifically for GPU acceleration and high-performance scientific computing.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC platform |publisher=University of California, Berkeley |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Why GPUGRID? ==<br /> <br /> Understanding the motion and interaction of biological molecules is one of the major challenges in modern computational biology. Proteins constantly change shape while carrying out functions essential to life, including signaling, metabolism, and DNA replication. Many diseases, including cancer, Alzheimer's disease, and viral infections, are linked to abnormal protein behavior.&lt;ref&gt;{{cite journal |last=Shaw |first=David E. |title=Atomic-Level Characterization of the Structural Dynamics of Proteins |journal=Science |volume=330 |issue=6002 |pages=341–346 |year=2010 |doi=10.1126/science.1187409}}&lt;/ref&gt;<br /> <br /> Traditional molecular dynamics simulations require enormous computational resources because they calculate the forces and interactions between thousands or millions of atoms over time. GPUGRID distributes these workloads across thousands of volunteer computers equipped with modern GPUs, enabling simulations that would otherwise require expensive supercomputers.&lt;ref&gt;{{cite web |url=https://www.gpugrid.net/gpugrid/forum_thread.php?id=3303 |title=GPUGRID and GPU computing discussion |publisher=GPUGRID Forums |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project focuses on long-timescale simulations of proteins and biomolecular systems, allowing researchers to study folding, conformational changes, ligand binding, and other complex biological phenomena that are difficult to capture experimentally.&lt;ref&gt;{{cite journal |last=Doerr |first=Stefan |title=HTMD: High-Throughput Molecular Dynamics for Molecular Discovery |journal=Journal of Chemical Theory and Computation |volume=12 |issue=4 |pages=1845–1852 |year=2016 |doi=10.1021/acs.jctc.6b00049}}&lt;/ref&gt;<br /> <br /> == Goal ==<br /> <br /> The primary goal of GPUGRID is to accelerate biomedical and biochemical research using distributed GPU computing. The project performs extensive molecular dynamics simulations to better understand:<br /> <br /> * Protein folding and structural stability<br /> * Drug binding mechanisms<br /> * Protein-protein interactions<br /> * Enzyme dynamics<br /> * Viral protein behavior<br /> * Biomolecular conformational changes<br /> <br /> By combining volunteer computing with GPU acceleration, GPUGRID enables simulations on timescales that are often inaccessible to conventional laboratory environments.&lt;ref&gt;{{cite journal |last=Harvey |first=Matthew J. |title=ACEMD: Accelerating Biomolecular Dynamics in the Microsecond Time Scale |journal=Journal of Chemical Theory and Computation |volume=5 |issue=6 |pages=1632–1639 |year=2009 |doi=10.1021/ct9000685}}&lt;/ref&gt;<br /> <br /> The project has contributed to computational approaches used in drug discovery and structural biology research, particularly through long-timescale simulations of biologically important proteins.&lt;ref&gt;{{cite web |url=https://www.boincstats.com/stats/52/project/detail |title=GPUGRID project statistics |publisher=BOINCstats |access-date=2026-05-20}}&lt;/ref&gt;<br /> [[File:Simulated structure of the water hexane interface.png|thumb|Visualization of a molecular dynamics simulation similar to workloads processed by GPUGRID.]]<br /> <br /> == Methods ==<br /> <br /> GPUGRID uses the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] middleware platform to distribute scientific workloads to volunteer computers over the Internet. Participants install the BOINC client and attach to the GPUGRID project server, which assigns simulation tasks optimized for GPU hardware.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/wiki/User_manual |title=BOINC User Manual |publisher=University of California, Berkeley |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> Unlike many traditional BOINC projects that primarily use CPUs, GPUGRID was specifically designed around GPU acceleration using [[wikipedia:Nvidia CUDA|CUDA]] and related technologies. GPUs are highly effective for molecular dynamics because they can perform many parallel floating-point operations simultaneously.&lt;ref&gt;{{cite journal |last=Stone |first=John E. |title=Accelerating Molecular Modeling Applications with Graphics Processors |journal=Journal of Computational Chemistry |volume=28 |issue=16 |pages=2618–2640 |year=2007 |doi=10.1002/jcc.20829}}&lt;/ref&gt;<br /> <br /> The project primarily runs molecular dynamics applications such as ACEMD and related simulation frameworks developed by the research group at Universitat Pompeu Fabra.&lt;ref&gt;{{cite journal |last=Harvey |first=Matthew J. |title=ACEMD: Accelerating Biomolecular Dynamics in the Microsecond Time Scale |journal=Journal of Chemical Theory and Computation |volume=5 |issue=6 |pages=1632–1639 |year=2009 |doi=10.1021/ct9000685}}&lt;/ref&gt;<br /> <br /> GPUGRID demonstrated that volunteer GPU computing could provide supercomputer-class performance for scientific research at relatively low operational cost, helping establish GPU acceleration as a major direction for distributed scientific computing.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/pubs.php |title=BOINC publications |publisher=University of California, Berkeley |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == History ==<br /> <br /> === PS3GRID ===<br /> <br /> The project began in 2007 under the name '''PS3GRID''', targeting the [[wikipedia:PlayStation 3|PlayStation 3]] gaming console and its [[wikipedia:Cell (microprocessor)|Cell processor]]. The objective was to harness the computational power of distributed PlayStation systems for molecular dynamics simulations.&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20071115050922/http://www.ps3grid.net/ |title=PS3GRID archived homepage |publisher=Internet Archive |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> As GPU computing rapidly advanced, the project transitioned away from the PlayStation 3 architecture and adopted general-purpose GPU computing technologies such as CUDA. The project was subsequently renamed GPUGRID.&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20090201052348/http://www.gpugrid.net/ |title=Early GPUGRID archived homepage |publisher=Internet Archive |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> === GPU computing era ===<br /> <br /> GPUGRID became one of the pioneering BOINC projects focused almost entirely on GPU acceleration. During the late 2000s and early 2010s, the project demonstrated the viability of GPUs for large-scale scientific simulations.&lt;ref&gt;{{cite journal |last=Owens |first=John D. |title=GPU Computing |journal=Proceedings of the IEEE |volume=96 |issue=5 |pages=879–899 |year=2008 |doi=10.1109/JPROC.2008.917757}}&lt;/ref&gt;<br /> <br /> The project community became known for benchmarking and optimizing high-end NVIDIA graphics hardware for scientific workloads, and GPUGRID often served as a showcase for distributed GPU performance within the BOINC ecosystem.&lt;ref&gt;{{cite web |url=https://gpugrid.net/gpugrid/forum_index.php |title=GPUGRID forums |publisher=GPUGRID |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Project team / Sponsors ==<br /> <br /> The GPUGRID project is operated by researchers associated with [[wikipedia:Universitat Pompeu Fabra|Universitat Pompeu Fabra]] in Barcelona, Spain.<br /> <br /> Project members have included:<br /> <br /> * '''Gianni De Fabritiis, PhD''' – Principal Investigator<br /> * '''Toni Giorgino, PhD''' – Scientist<br /> * '''Stefan Doerr''' – Researcher and developer<br /> * '''Adrià Pérez''' – Researcher<br /> <br /> The project has also collaborated with researchers involved in molecular simulation software development and computational drug discovery.&lt;ref name=&quot;gpugrid_about&quot; /&gt;<br /> <br /> == Scientific results ==<br /> [[File:BOINC logo.png|right|frameless|200x200px]]<br /> GPUGRID simulations have contributed to research in computational chemistry, protein dynamics, and molecular modeling. The project has supported studies involving:<br /> <br /> * Protein folding pathways<br /> * Drug-target interactions<br /> * Molecular conformational analysis<br /> * High-throughput molecular dynamics<br /> * Biomolecular kinetics<br /> <br /> Research associated with GPUGRID has been published in peer-reviewed scientific journals and conference proceedings.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/pubs.php#GPUGrid.net |title=GPUGRID publications |publisher=University of California, Berkeley |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Scientific publications ==<br /> <br /> Selected publications associated with GPUGRID and related software include:<br /> <br /> * Harvey MJ, Giupponi G, De Fabritiis G. ''ACEMD: Accelerating Biomolecular Dynamics in the Microsecond Time Scale.'' Journal of Chemical Theory and Computation, 2009.<br /> * Doerr S, Harvey MJ, Noé F, De Fabritiis G. ''HTMD: High-Throughput Molecular Dynamics for Molecular Discovery.'' Journal of Chemical Theory and Computation, 2016.<br /> * De Fabritiis G. ''Performance of GPU-accelerated molecular dynamics simulations.'' Various conference proceedings and BOINC-related publications.<br /> * Stone JE et al. ''Accelerating Molecular Modeling Applications with Graphics Processors.'' Journal of Computational Chemistry, 2007.<br /> <br /> Additional publications are listed at:<br /> * https://boinc.berkeley.edu/pubs.php#GPUGrid.net<br /> <br /> == Hardware requirements ==<br /> <br /> GPUGRID primarily supports modern NVIDIA GPUs capable of running CUDA-based applications. Historically, the project required relatively powerful graphics hardware compared to CPU-oriented BOINC projects.&lt;ref&gt;{{cite web |url=https://www.gpugrid.net/gpugrid/apps.php |title=GPUGRID applications |publisher=GPUGRID |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> Supported operating systems have included:<br /> <br /> * Microsoft Windows<br /> * Linux<br /> <br /> MacOS support has historically been limited or unavailable for most GPUGRID applications.&lt;ref&gt;{{cite web |url=https://www.gpugrid.net/gpugrid/help.php |title=GPUGRID help pages |publisher=GPUGRID |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Community ==<br /> <br /> GPUGRID maintains an active volunteer community through BOINC statistics sites and its official discussion forums. Users frequently discuss GPU optimization, hardware performance, overclocking stability, and scientific progress.&lt;ref&gt;{{cite web |url=https://www.boincstats.com/stats/52/user/list/0/0 |title=GPUGRID user statistics |publisher=BOINCstats |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project has historically attracted enthusiasts interested in high-performance GPU computing and biomedical research.&lt;ref&gt;{{cite web |url=https://www.reddit.com/r/BOINC/ |title=r/BOINC discussions |publisher=Reddit |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == External links ==<br /> <br /> * [https://www.gpugrid.net/ Official website]<br /> * [https://www.gpugrid.net/gpugrid/server_status.php Server status]<br /> * [https://www.gpugrid.net/gpugrid/forum_index.php Official forums]<br /> * [https://boinc.berkeley.edu/ BOINC]<br /> * [https://boinc.berkeley.edu/pubs.php#GPUGrid.net BOINC publications related to GPUGRID]<br /> * [https://www.boincstats.com/stats/52/project/detail BOINCstats project statistics]<br /> <br /> == References ==<br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Rosetta@home&diff=1440 2026-05-29T13:37:31Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Rosetta@home<br /> | logo = Rosettahome.png<br /> | logo caption = Rosetta@home logo<br /> | screenshot = Rosetta.gif<br /> | caption = Rosetta@home screensaver showing protein folding simulations<br /> | status = Active<br /> | category = Bioinformatics, Protein structure prediction, Distributed computing<br /> | compute = CPU<br /> | dependencies = [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]]<br /> <br /> | developer = Baker Laboratory<br /> | author = [[wikipedia:David Baker (biochemist)|David Baker]] and collaborators<br /> | sponsor = [[wikipedia:University of Washington|University of Washington]]<br /> | maintainer = Baker Laboratory and RosettaCommons<br /> | released = {{Start date and age|2005|06|06}}<br /> | repository = https://github.com/RosettaCommons<br /> <br /> | programming language = C++, C<br /> | operating system = Windows, Linux, macOS<br /> | size = Varies by work unit<br /> <br /> | stats as of = {{Start date and age|2026|05|22}}<br /> | average performance = Several PFLOPS distributed across volunteer hosts<br /> | active users = 25000<br /> | total users = 1000000<br /> | active hosts = 45000<br /> | total hosts = 3000000<br /> <br /> | cpu performance = Large-scale distributed CPU processing<br /> <br /> | website = https://boinc.bakerlab.org/rosetta/<br /> | license = Mixed proprietary and academic research licensing<br /> }}<br /> <br /> [https://boinc.bakerlab.org/rosetta/ '''''Rosetta@home'''''] is a '''[[wikipedia:Volunteer computing|volunteer distributed computing]]''' project that uses the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform to help researchers predict and design the three-dimensional structures of proteins. The project is operated by the [[wikipedia:David Baker (biochemist)|Baker Laboratory]] at the [[wikipedia:University of Washington|University of Washington]] in Seattle, Washington, and is considered one of the most scientifically successful and widely recognized BOINC projects.&lt;ref&gt;{{cite web|url=https://boinc.bakerlab.org/rosetta/|title=Rosetta@home}}&lt;/ref&gt;&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Rosetta@home|title=Rosetta@home}}&lt;/ref&gt;<br /> <br /> Rosetta@home officially launched in 2005 as a public volunteer computing extension of the Rosetta protein modeling software suite. Volunteers donate spare CPU resources from personal computers to perform large-scale molecular simulations involving protein folding, protein docking, and protein design.&lt;ref&gt;{{cite journal|last=Das|first=Rhiju|last2=Baker|first2=David|title=Macromolecular Modeling with Rosetta|journal=Annual Review of Biochemistry|year=2008|volume=77|pages=363–382|doi=10.1146/annurev.biochem.77.062906.171838}}&lt;/ref&gt;<br /> <br /> == Overview ==<br /> <br /> Proteins are biological macromolecules composed of amino acid chains that fold into highly complex three-dimensional structures. The function of a protein depends heavily on its final folded conformation, and predicting how proteins fold from their amino acid sequence remains one of the central problems in computational biology and biochemistry.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Protein_folding|title=Protein folding}}&lt;/ref&gt;<br /> <br /> Rosetta@home allows volunteers around the world to contribute spare computing power toward scientific research involving protein structure prediction, protein docking, computational enzyme design, and the study of molecular interactions. The project has also been used in vaccine research, antiviral therapeutic development, cancer-related protein analysis, and studies involving neurodegenerative disorders such as [[wikipedia:Alzheimer's disease|Alzheimer's disease]], [[wikipedia:Parkinson's disease|Parkinson's disease]], and [[wikipedia:Huntington's disease|Huntington's disease]]. By distributing millions of calculations across volunteer computers, Rosetta@home enables scientific simulations that would otherwise require extremely large supercomputing facilities.<br /> <br /> == Scientific basis ==<br /> <br /> Protein folding is governed by thermodynamics and molecular interactions. Rosetta software attempts to identify energetically favorable conformations by minimizing an approximate free-energy function while exploring large numbers of possible molecular arrangements.<br /> <br /> The Rosetta platform combines several computational approaches, including Monte Carlo sampling, energy minimization, fragment assembly, comparative modeling, ab initio structure prediction, and protein docking simulations. Modern Rosetta methods also incorporate statistical and machine-learning-assisted scoring functions to improve prediction accuracy.<br /> <br /> The Rosetta energy function attempts to minimize the free energy of candidate structures:<br /> <br /> &lt;math&gt;E_{total} = \sum_i w_iE_i&lt;/math&gt;<br /> <br /> where &lt;math&gt;E_i&lt;/math&gt; represents individual energy terms and &lt;math&gt;w_i&lt;/math&gt; represents weighting coefficients applied to those terms.<br /> <br /> The project also uses stochastic Monte Carlo methods that accept or reject conformational changes according to probabilities derived from statistical thermodynamics:<br /> <br /> &lt;math&gt;P = e^{-\Delta E / kT}&lt;/math&gt;<br /> <br /> where &lt;math&gt;\Delta E&lt;/math&gt; is the change in energy, &lt;math&gt;k&lt;/math&gt; is the Boltzmann constant, and &lt;math&gt;T&lt;/math&gt; is temperature.<br /> <br /> [[File:Protein_structure_examples.png|thumb|Examples of protein structures]]<br /> <br /> == History ==<br /> <br /> The Rosetta software project originated during the late 1990s at the Baker Laboratory under the leadership of Professor [[wikipedia:David Baker (biochemist)|David Baker]]. Early versions of Rosetta focused primarily on ab initio protein structure prediction and rapidly gained recognition within computational biology research communities.&lt;ref&gt;{{cite journal|last=Simons|first=K. T.|last2=Kooperberg|first2=C.|last3=Huang|first3=E.|last4=Baker|first4=D.|title=Assembly of protein tertiary structures from fragments with similar local sequences using simulated annealing and Bayesian scoring functions|journal=Journal of Molecular Biology|year=1997|volume=268|issue=1|pages=209–225|doi=10.1006/jmbi.1997.0959}}&lt;/ref&gt;<br /> <br /> Rosetta@home became publicly available through BOINC in 2005 and quickly attracted a large international volunteer community. During the late 2000s and early 2010s, the project became one of the flagship scientific applications within the BOINC ecosystem.&lt;ref&gt;{{cite web|url=https://web.archive.org/web/*/https://boinc.bakerlab.org/rosetta/|title=Archived Rosetta@home pages}}&lt;/ref&gt;<br /> <br /> The project experienced substantial growth during major scientific initiatives involving influenza and HIV research, CASP protein structure prediction competitions, and the development of computational protein design methods. Public participation increased dramatically again during the COVID-19 pandemic as global attention focused on antiviral research and computational biology.<br /> <br /> == CASP participation ==<br /> <br /> Rosetta methods achieved significant success in the [[wikipedia:Critical Assessment of protein Structure Prediction|CASP]] competitions, which evaluate computational protein structure prediction methods using experimentally determined structures that have not yet been publicly released.<br /> <br /> Performance in CASP competitions helped establish Rosetta as one of the leading protein prediction frameworks in computational biology.&lt;ref&gt;{{cite journal|last=Moult|first=John|title=Critical assessment of methods of protein structure prediction (CASP): Round XIII|journal=Proteins|year=2019|volume=87|issue=12|pages=1011–1020|doi=10.1002/prot.25823}}&lt;/ref&gt;<br /> <br /> == Methods ==<br /> <br /> [[File:PDB 1p5t EBI.jpg|thumb|Protein docking simulation example]]<br /> <br /> Rosetta@home distributes small computational tasks known as ''work units'' to volunteer computers through BOINC. Each work unit evaluates different possible conformations or molecular interactions involving proteins, with completed results returned to project servers for further scientific analysis.<br /> <br /> The Rosetta software suite contains multiple specialized scientific modules for different forms of biomolecular modeling. Ab initio methods attempt to predict protein structures directly from amino acid sequences without relying entirely on experimentally solved templates. Protein docking simulations study how proteins interact with other proteins or molecules, while RosettaDesign allows researchers to computationally create entirely new proteins not found in nature.&lt;ref&gt;{{cite journal|last=Gray|first=Jeffrey J.|title=Protein-protein docking with simultaneous optimization of rigid-body displacement and side-chain conformations|journal=Journal of Molecular Biology|year=2003|volume=331|issue=1|pages=281–299|doi=10.1016/S0022-2836(03)00670-3}}&lt;/ref&gt;&lt;ref&gt;{{cite journal|last=Kuhlman|first=Brian|title=Design of a novel globular protein fold with atomic-level accuracy|journal=Science|year=2003|volume=302|issue=5649|pages=1364–1368|doi=10.1126/science.1089427}}&lt;/ref&gt;<br /> <br /> Many Rosetta methods use libraries of experimentally observed protein fragments during conformational searches. This fragment-based approach significantly reduces the complexity of the protein-folding problem while improving the likelihood of identifying physically realistic structures.<br /> <br /> == COVID-19 research ==<br /> <br /> [[File:Protein_folding.png|thumb|Illustration of protein folding pathways]]<br /> <br /> Rosetta@home became heavily involved in COVID-19 research beginning in early 2020. Public awareness of the project increased dramatically during the pandemic as volunteers contributed substantial additional computing power toward urgent SARS-CoV-2 research efforts.&lt;ref&gt;{{cite web|url=https://www.ipd.uw.edu/covid-19/|title=Institute for Protein Design COVID-19 research}}&lt;/ref&gt;<br /> <br /> Researchers used Rosetta software to study viral protein structures, investigate spike-protein interactions, and design synthetic mini-proteins capable of binding tightly to the SARS-CoV-2 spike protein. Some of these engineered proteins demonstrated strong neutralizing capabilities in laboratory studies and were investigated as potential antiviral therapeutics and diagnostic tools.&lt;ref&gt;{{cite journal|last=Cao|first=Longxing|title=De novo design of picomolar SARS-CoV-2 miniprotein inhibitors|journal=Nature|year=2021|volume=595|issue=7867|pages=551–556|doi=10.1038/s41586-021-03819-2}}&lt;/ref&gt;<br /> <br /> The project received substantial international media coverage during this period, resulting in large increases in volunteer participation and overall BOINC activity.&lt;ref&gt;{{cite web|url=https://www.reddit.com/r/BOINC/|title=r/BOINC discussions}}&lt;/ref&gt;<br /> <br /> == RosettaCommons ==<br /> <br /> [[File:SARS-CoV-2_without_background.png|thumb|Illustration of SARS-CoV-2]]<br /> <br /> The broader Rosetta software ecosystem is maintained by [[wikipedia:RosettaCommons|RosettaCommons]], an international consortium of universities, medical research institutes, and scientific organizations collaborating on computational structural biology software development.&lt;ref&gt;{{cite web|url=https://www.rosettacommons.org/about|title=About RosettaCommons}}&lt;/ref&gt;<br /> <br /> RosettaCommons coordinates development of the Rosetta biomolecular modeling framework and supports scientific workshops, educational resources, and collaborative research initiatives. The consortium has played a major role in advancing computational protein design and structural bioinformatics, and Rosetta software is now widely used throughout the international molecular biology research community.<br /> <br /> == Project team and sponsors ==<br /> <br /> [[File:University of Washington Red Square golden hour Seattle Washington.jpg|thumb|University of Washington campus]]<br /> <br /> Rosetta@home is operated primarily by the [https://www.bakerlab.org/ Baker Laboratory] at the [[wikipedia:University of Washington|University of Washington]] in Seattle, Washington. The project was founded by Professor [[wikipedia:David Baker (biochemist)|David Baker]], whose research group became internationally recognized for advances in protein structure prediction and computational protein design.<br /> <br /> In addition to the Baker Laboratory, Rosetta@home benefits from contributions by RosettaCommons scientists and researchers from numerous universities and scientific institutions around the world. The collaborative nature of the project has made Rosetta one of the largest and most influential computational biology frameworks developed through academic research partnerships.<br /> <br /> == System requirements ==<br /> <br /> Rosetta@home supports Microsoft Windows, Linux, and macOS operating systems and primarily performs CPU-based scientific calculations rather than GPU acceleration. Work units may run for several hours depending on processor performance and user-selected runtime settings, and some tasks can require moderate to high levels of system memory.<br /> <br /> The BOINC platform allows volunteers to configure CPU utilization, network scheduling, temperature limits, disk usage quotas, and other operational settings. Rosetta@home applications also support checkpointing, allowing computations to resume after interruptions or system restarts.<br /> <br /> == Community ==<br /> <br /> Rosetta@home has maintained a large and active international volunteer community since its launch in 2005. Volunteers commonly participate through BOINC teams, distributed computing forums, Reddit communities, and statistics aggregation websites such as BOINCstats and Free-DC.<br /> <br /> The project has historically been one of the most visible and competitive projects within the BOINC ecosystem, with many volunteer teams contributing substantial computing resources during community competitions and distributed computing challenges. Historical BOINC forums and archived discussions show Rosetta@home frequently ranking among the largest volunteer computing projects of its era.<br /> <br /> == Scientific impact ==<br /> <br /> Rosetta@home has contributed to major scientific advances in protein structure prediction, computational enzyme engineering, structural bioinformatics, antiviral therapeutic design, and synthetic protein development. Research performed using Rosetta methods has helped establish computational protein design as a major field within modern molecular biology.<br /> <br /> The project achieved particular recognition through strong performances in CASP protein structure prediction competitions and through the development of novel synthetic proteins and antiviral binders. During the COVID-19 pandemic, Rosetta-related research became widely known for its work involving SARS-CoV-2 spike-protein inhibitors and de novo designed mini-proteins.<br /> <br /> Scientific publications related to Rosetta@home and the Rosetta software suite are archived through BOINC and RosettaCommons publication databases.&lt;ref&gt;{{cite web|url=https://boinc.berkeley.edu/pubs.php#Rosetta@home|title=BOINC scientific publications}}&lt;/ref&gt;<br /> <br /> [[File:Protein_structure.jpg|thumb|Rendered protein structure]]<br /> <br /> == Scientific publications ==<br /> <br /> Rosetta-related research has produced hundreds of peer-reviewed scientific papers published in journals including ''Nature'', ''Science'', ''Proceedings of the National Academy of Sciences'', ''Journal of Molecular Biology'', and ''Proteins''.<br /> <br /> Selected publications include:<br /> <br /> * {{cite journal|last=Simons|first=K. T.|title=Assembly of protein tertiary structures from fragments with similar local sequences using simulated annealing and Bayesian scoring functions|journal=Journal of Molecular Biology|year=1997|doi=10.1006/jmbi.1997.0959}}<br /> * {{cite journal|last=Kuhlman|first=Brian|title=Design of a novel globular protein fold with atomic-level accuracy|journal=Science|year=2003|doi=10.1126/science.1089427}}<br /> * {{cite journal|last=Gray|first=Jeffrey J.|title=Protein-protein docking with simultaneous optimization of rigid-body displacement and side-chain conformations|journal=Journal of Molecular Biology|year=2003|doi=10.1016/S0022-2836(03)00670-3}}<br /> * {{cite journal|last=Das|first=Rhiju|title=Macromolecular Modeling with Rosetta|journal=Annual Review of Biochemistry|year=2008|doi=10.1146/annurev.biochem.77.062906.171838}}<br /> * {{cite journal|last=Cao|first=Longxing|title=De novo design of picomolar SARS-CoV-2 miniprotein inhibitors|journal=Nature|year=2021|doi=10.1038/s41586-021-03819-2}}<br /> <br /> Additional publication lists are available through the BOINC publications archive and the RosettaCommons publications database.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Protein folding|Protein folding]]<br /> * [[wikipedia:RosettaCommons|RosettaCommons]]<br /> * [[wikipedia:Distributed computing|Distributed computing]]<br /> * [[wikipedia:Computational biology|Computational biology]]<br /> * [[wikipedia:David Baker (biochemist)|David Baker]]<br /> <br /> == External links ==<br /> <br /> * [https://boinc.bakerlab.org/rosetta/ Official Rosetta@home website]<br /> * [https://www.bakerlab.org/ Baker Laboratory]<br /> * [https://www.rosettacommons.org/ RosettaCommons]<br /> * [https://en.wikipedia.org/wiki/Rosetta@home Rosetta@home on Wikipedia]<br /> * [https://boinc.berkeley.edu/ BOINC]<br /> * [https://boincstats.com/en/stats/145/project/detail BOINCstats project statistics]<br /> * [https://boinc.berkeley.edu/pubs.php#Rosetta@home BOINC scientific publications]<br /> <br /> [[File:BOINC Logo custom.png|BOINC logo|center|frameless|150x150px]]<br /> <br /> == References ==<br /> <br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Gaia@home&diff=1439 2026-05-29T13:36:41Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Gaia@home<br /> | logo = Gaia@home.jpg<br /> | screenshot =<br /> | caption =<br /> <br /> | status = Active<br /> | category = Astronomy<br /> | compute = CPU<br /> | dependencies = BOINC<br /> <br /> | author = Astronomical Observatory Institute, Faculty of Physics, Adam Mickiewicz University<br /> | developer = Gaia@home project team<br /> | released = {{Start date and age|2019|08|21}}<br /> | completed = No<br /> | discontinued =<br /> <br /> | programming language = C, C++<br /> | operating system = Linux, Windows, macOS<br /> <br /> | stats as of = {{Start date and age|2026|05|19}}<br /> | average performance = 6653.65 GigaFLOPS<br /> | active users = 199<br /> | total users = 631<br /> | active hosts = 579<br /> | total hosts = 3609<br /> <br /> | rac = <br /> | credit per day = <br /> | gpu performance = <br /> | cpu performance = <br /> <br /> | website = {{URL|https://gaiaathome.eu/}}<br /> | license = Free software<br /> }}<br /> <br /> [http://gaiaathome.eu/gaiaathome/ '''''Gaia@home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project based on the BOINC middleware platform. The project was created by researchers from the Astronomical Observatory Institute at [[wikipedia:Adam Mickiewicz University in Poznań|Adam Mickiewicz University]] in Poland to support astronomical research using data from the [[wikipedia:Gaia (spacecraft)|Gaia]] space observatory mission operated by the [[wikipedia:European Space Agency|European Space Agency]] (ESA).&lt;ref&gt;{{cite web |url=http://gaiaathome.eu/gaiaathome/ |title=Gaia@home |publisher=Gaia@home |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> The project distributes computationally intensive astronomical calculations to volunteers around the world using the BOINC infrastructure. Gaia@home focuses primarily on celestial mechanics, stellar dynamics, and the study of long-period comets and stellar encounters with the Solar System.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/projects.php |title=BOINC Projects List |publisher=University of California, Berkeley |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> == History ==<br /> <br /> Gaia@home was launched as a scientific BOINC project to exploit the precise astrometric measurements produced by ESA's Gaia mission. The Gaia spacecraft was launched in 2013 and has produced highly accurate positional and velocity measurements for more than a billion stars in the Milky Way.&lt;ref&gt;{{cite web |url=https://www.cosmos.esa.int/web/gaia |title=Gaia Mission |publisher=European Space Agency |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> The Gaia@home infrastructure allows researchers to run large ensembles of numerical integrations and Monte Carlo simulations that would otherwise require substantial dedicated supercomputing resources. Volunteer computers process orbital integrations, clone simulations, and stellar encounter calculations in parallel.<br /> <br /> The project has periodically expanded its scientific applications as new Gaia data releases became available, including Gaia DR2 and Gaia DR3.&lt;ref&gt;{{cite journal |last1=Gaia Collaboration |title=Gaia Data Release 2: Summary of the contents and survey properties |journal=Astronomy &amp; Astrophysics |volume=616 |year=2018 |pages=A1 |doi=10.1051/0004-6361/201833051}}&lt;/ref&gt;<br /> <br /> == Why Gaia@home? ==<br /> <br /> The Gaia@home project is designed to give scientists another layer of computational freedom. The project allows calculations which demand a large amount of CPU time to be distributed across thousands of volunteer computers, reducing the computational workload for researchers and enabling large-scale processing operations.<br /> <br /> Volunteer distributed computing is especially useful for orbital integrations involving large numbers of cloned trajectories and long timescales. These calculations often require repeated numerical integrations across millions of orbital configurations.<br /> <br /> == Goal ==<br /> <br /> The goal of Gaia@home is to create a huge number of small jobs consisting of Gaia observational data and scientific code, then distribute these jobs to BOINC volunteers for processing and collection of results for further scientific analysis.<br /> <br /> The project aims to:<br /> <br /> * Study the dynamical evolution of long-period comets<br /> * Investigate stellar close encounters with the Solar System<br /> * Analyze perturbations caused by Galactic tides and passing stars<br /> * Improve understanding of the Oort cloud and cometary origins<br /> * Use Gaia astrometric data for precision celestial mechanics calculations<br /> <br /> == Scientific background ==<br /> [[File:Gaia rotation.jpg|thumb|300x300px|The [[wikipedia:Gaia (spacecraft)|Gaia]] spacecraft operated by the European Space Agency collects astrometric data used by Gaia@home researchers.]]<br /> <br /> The [[wikipedia:Gaia (spacecraft)|Gaia]] mission is one of the most important astrometric missions ever conducted. Its measurements allow astronomers to determine precise positions, distances, and motions for stars throughout the Milky Way galaxy.&lt;ref&gt;{{cite web |url=https://www.esa.int/Science_Exploration/Space_Science/Gaia_overview |title=Gaia Overview |publisher=European Space Agency |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> The Gaia@home project uses these measurements to improve calculations involving stellar encounters and cometary orbits. Small changes in stellar positions and velocities can significantly affect long-term orbital predictions for objects in the outer Solar System.<br /> <br /> The project's calculations frequently involve:<br /> <br /> * Numerical N-body integrations<br /> * Monte Carlo simulations<br /> * Covariance matrix sampling<br /> * Galactic gravitational potential models<br /> * Stellar perturbation analysis<br /> <br /> == Subprojects ==<br /> [[File:Gaia2 1.png|thumb|The cloud of 13517 clones of the star Gliese 710 drawn according to the covariance matrix taken from the Gaia DR2 catalogue. This cloud is projected onto the maximum scatter plane X'Y', coordinates are expressed in parsecs. The red dot is the Sun position, the green dot is the star nominal position during an encounter and the orange cross is the centroid of the clone cloud. The blue dotted circle shows the approximate extend of the cometary Oort cloud. This star parameters are known with a good precision so the cloud of clones is rather compact..]]<br /> <br /> === Long period comets ===<br /> <br /> Calculating long-period comet orbits under simultaneous Galactic and stellar perturbations. The calculations involve solving an N-body problem with approximately 400 perturbing bodies.&lt;ref&gt;{{cite journal<br /> |last1=Królikowska<br /> |first1=M.<br /> |last2=Dybczyński<br /> |first2=P. A.<br /> |title=The catalogue of cometary orbits and their dynamical evolution<br /> |journal=Astronomy &amp; Astrophysics<br /> |volume=640<br /> |year=2020<br /> |pages=A97<br /> |doi=10.1051/0004-6361/202038451<br /> }}&lt;/ref&gt;<br /> <br /> The subproject investigates the dynamical evolution of long-period comets originating from the [[wikipedia:Oort cloud|Oort cloud]]. Researchers analyze how Galactic tides and close stellar passages perturb cometary orbits over millions of years.<br /> <br /> more details: [https://www.aanda.org/articles/aa/pdf/2020/08/aa38451-20.pdf '''''Królikowska, M and Dybczynski, P.A., 2020: The catalogue of cometary orbits and their dynamical evolution''''']<br /> <br /> Orbital changes of C/2002 T7 projected on its original orbit plane that described by five snapshots in CODE catalogue. Red line depicts the past motion of this comet while the blue line depicts its future evolution. Five epochs (snapshots) when orbital elements are recorded are marked: 1 - osculating heliocentric orbit near the centre of the observational interval (typically near the perihelion); 2 - original barycentric orbit recorded in the past at 250 au from the Sun; 3 - future barycentric orbit recorded in the future at 250 au from the Sun; 4 - previous orbit, recorded at the previous perihelion; 5 - next orbit, in this case recorded at the escape border at 120 000 au from the Sun, but for many other comets recorded in the next perihelion.<br /> === Stellar close approaches ===<br /> <br /> The stellar close approaches subproject investigates the proximity parameters and influence of stars passing near the Solar System using Gaia DR2 and DR3 astrometric data.&lt;ref&gt;{{cite journal<br /> |last1=Berski<br /> |first1=F.<br /> |last2=Dybczyński<br /> |first2=P. A.<br /> |title=Close approach parameters recalculated based on the first Gaia data release<br /> |journal=Astronomy &amp; Astrophysics<br /> |volume=595<br /> |year=2016<br /> |pages=L10<br /> |doi=10.1051/0004-6361/201629835<br /> }}&lt;/ref&gt;<br /> <br /> Using numerical integration within an axisymmetric Galactic model, researchers determine the parameters of close stellar encounters with the Solar System. The calculations estimate the most probable positions and velocities of stars during their minimum-distance approach to the Sun.<br /> <br /> The project additionally generates thousands of orbital clones using covariance matrices to estimate uncertainties in stellar trajectories.<br /> <br /> more details: [https://www.aanda.org/articles/aa/full_html/2016/11/aa29835-16/aa29835-16.html '''''Berski, F and Dybczynski, P.A., 2020: Close approach parameters recalculated based on the first Gaia data release''''']<br /> <br /> === Future and experimental applications ===<br /> <br /> The Gaia@home infrastructure has also been discussed within the BOINC community as a framework for additional astronomical and astrodynamics applications using Gaia datasets. The flexible BOINC architecture allows researchers to add new computational tasks as additional Gaia catalogues become available.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC |publisher=University of California, Berkeley |access-date=2026-05-18}}&lt;/ref&gt;<br /> [[File:Gaia2 2.png|thumb|The cloud of 11327 clones of the star ALS 9243 drawn according to the covariance matrix taken from the Gaia DR2 catalogue. This cloud is projected onto the maximum scatter plane X'Y', coordinates are expressed in parsecs. The red dot is the Sun position, the green dot is the star nominal position during an encounter and the orange cross is the centroid of the clone cloud. The blue dotted circle shows the approximate extend of the cometary Oort cloud. This star parameters have the poor accuracy but the star must be studied in detail since it might have a large mass, even grater than 10 solar masses. Gliese 710 will pass the Sun even closer.]]<br /> <br /> == Software and infrastructure ==<br /> <br /> Gaia@home uses the [[Wikipedia:BOINC|BOINC]] middleware system developed at the [[wikipedia:University of California, Berkeley|University of California, Berkeley]]. BOINC enables volunteers to contribute unused CPU resources from personal computers to scientific research projects.&lt;ref&gt;{{cite journal<br /> |last1=Anderson<br /> |first1=David P.<br /> |title=BOINC: A System for Public-Resource Computing and Storage<br /> |journal=5th IEEE/ACM International Workshop on Grid Computing<br /> |year=2004<br /> |doi=10.1109/GRID.2004.14<br /> }}&lt;/ref&gt;<br /> <br /> The project supports multiple operating systems commonly supported by BOINC, including:<br /> <br /> * Microsoft Windows<br /> * Linux<br /> * macOS<br /> <br /> Volunteer participants attach the Gaia@home project to their BOINC clients and automatically download work units for processing.<br /> == Scientific publications ==<br /> <br /> Research associated with Gaia@home and related calculations includes:<br /> <br /> * Królikowska, M. &amp; Dybczyński, P. A. (2020). ''The catalogue of cometary orbits and their dynamical evolution''. ''Astronomy &amp; Astrophysics'', 640, A97.&lt;ref&gt;{{cite journal |last1=Królikowska |first1=M. |last2=Dybczyński |first2=P. A. |title=The catalogue of cometary orbits and their dynamical evolution |journal=Astronomy &amp; Astrophysics |volume=640 |year=2020 |pages=A97 |doi=10.1051/0004-6361/202038451}}&lt;/ref&gt;<br /> <br /> * Berski, F. &amp; Dybczyński, P. A. (2016). ''Close approach parameters recalculated based on the first Gaia data release''. ''Astronomy &amp; Astrophysics'', 595, L10.&lt;ref&gt;{{cite journal |last1=Berski |first1=F. |last2=Dybczyński |first2=P. A. |title=Close approach parameters recalculated based on the first Gaia data release |journal=Astronomy &amp; Astrophysics |volume=595 |year=2016 |pages=L10 |doi=10.1051/0004-6361/201629835}}&lt;/ref&gt;<br /> <br /> * Dybczyński, P. A. &amp; Królikowska, M. Various studies involving long-period comet dynamics, Galactic perturbations, and stellar encounters.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/pubs.php |title=Publications using BOINC |publisher=University of California, Berkeley |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> == Project team / Sponsors ==<br /> <br /> The project is operated by the Astronomical Observatory Institute, Faculty of Physics, [[wikipedia:Adam Mickiewicz University in Poznań|Adam Mickiewicz University]] in Poznań, Poland.&lt;ref&gt;{{cite web |url=http://gaiaathome.eu/gaiaathome/ |title=Gaia@home |publisher=Gaia@home |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> The scientific leadership includes researchers specializing in celestial mechanics, cometary dynamics, and stellar perturbation studies.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Gaia (spacecraft)|Gaia spacecraft]]<br /> * [[wikipedia:Oort cloud|Oort cloud]]<br /> * [[wikipedia:Long-period comet|Long-period comet]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:Distributed computing|Distributed computing]]<br /> <br /> == External links ==<br /> <br /> * [http://gaiaathome.eu/gaiaathome/ Official Gaia@home website]<br /> * [https://boinc.berkeley.edu/ BOINC official website]<br /> * [https://www.cosmos.esa.int/web/gaia ESA Gaia mission]<br /> * [https://boinc.berkeley.edu/pubs.php BOINC scientific publications]<br /> <br /> == References ==<br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Minecraft@Home&diff=1438 2026-05-29T13:35:35Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Minecraft@Home<br /> | logo = Minecraft@Home logo.png<br /> | logo caption = Minecraft@Home logo<br /> <br /> | status = Active<br /> | category = Gaming / Computational Research<br /> | compute = GPU<br /> | dependencies = OpenCL 2.0+<br /> <br /> | developer = Minecraft@Home community (philipp_de, maintainer)<br /> | author = Tomlacko, Earthcomputer, Cortex, Neil, DutChen18, PseudoGravity, Philipp_DE, and others<br /> | released = {{Start date and age|2020|06|24}}<br /> | repository = {{URL|https://github.com/minecrafthome/minecrafthome}}<br /> <br /> | operating system = Windows, Linux<br /> <br /> | stats as of = 24 May 2026<br /> | average performance = 10,385 TFLOPS (recent)<br /> | active users = 655<br /> | total users = 6639<br /> | active hosts = 1650<br /> | total hosts = 13567<br /> <br /> | website = {{URL|https://minecraftathome.com/minecrafthome/}}<br /> | license = Open source (server: PHP/Docker; applications vary)<br /> }}<br /> <br /> [https://minecraftathome.com/minecrafthome/ '''''Minecraft@Home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer computing]]''''' project on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform that enlists the idle processing power of volunteers' computers to research questions related to [[wikipedia:Minecraft|Minecraft]]. &lt;ref&gt;{{cite web |url=https://minecraftathome.com/minecrafthome/ |title=Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt; It is widely regarded as the only volunteer computing project to emerge organically from a video-game fan community rather than from an academic or research institution.&lt;ref&gt;{{cite web |url=https://vcomp.org/en/projects/minecraft-at-home |title=Minecraft@Home - Volunteer Computing for Everyone |access-date=2026-05-24}}&lt;/ref&gt; The project officially launched on 24 June 2020&lt;ref name=&quot;boinclaunch&quot;&gt;{{cite web |url=https://boinc.berkeley.edu/forum_thread.php?id=13807 |title=Thread: Minecraft@Home launched |website=BOINC |date=2020-06-24 |access-date=2026-05-24}}&lt;/ref&gt; and has since attracted thousands of volunteers who have collectively delivered hundreds of petaFLOPS of compute time toward recovering lost Minecraft world seeds and probing the mathematical limits of the game's world generation.<br /> <br /> == Background ==<br /> <br /> === Minecraft world seeds ===<br /> <br /> Every Minecraft world is generated deterministically from a single integer called a ''seed''. Internally, Java Edition stores the seed as a [[wikipedia:64-bit computing|64-bit]] signed integer, giving a total seed space ranging from &lt;math&gt;-9{,}223{,}372{,}036{,}854{,}775{,}808&lt;/math&gt; to &lt;math&gt;9{,}223{,}372{,}036{,}854{,}775{,}807&lt;/math&gt; — over 18.4 quintillion distinct worlds.&lt;ref&gt;{{cite web |url=https://www.alanzucconi.com/2022/06/05/minecraft-world-generation/ |title=The World Generation of Minecraft |last=Zucconi |first=Alan |date=2022-06-05 |access-date=2026-05-24}}&lt;/ref&gt;&lt;ref&gt;{{cite web |url=https://minecraft.wiki/w/World_seed |title=World seed - Minecraft Wiki |access-date=2026-05-24}}&lt;/ref&gt; The game uses this seed to initialize a [[wikipedia:pseudorandom number generator|pseudorandom number generator]] (PRNG), specifically Java's [[wikipedia:Linear congruential generator|linear congruential generator]] (LCG) with the recurrence relation:<br /> <br /> :&lt;math&gt;s_{n+1} = (25{,}214{,}903{,}917 \cdot s_n + 11) \bmod 2^{48}&lt;/math&gt;<br /> <br /> Although the seed itself spans 64 bits, only the lower 48 bits drive most terrain generation, which means the effective brute-force search space for many seedcracking problems is &lt;math&gt;2^{48} \approx 281&lt;/math&gt; trillion candidate seeds.&lt;ref&gt;{{cite web |url=https://www.cs.columbia.edu/~sedwards/classes/2021/4995-fall/reports/SeedCracker.pdf |title=SeedCracker: A Parallel Minecraft Seed Reverse Engineering Tool |last1=Gonzalez |first1=Federick |last2=Chen |first2=Justin |publisher=Columbia University |year=2021 |access-date=2026-05-24}}&lt;/ref&gt; The game's world-generation algorithm (based on [[wikipedia:Perlin noise|Perlin noise]] and a chain of biome and terrain rules) is fully deterministic: the same seed, version, and settings always produce identical terrain. Because Minecraft is written in Java and has been fully decompiled, researchers can reverse-engineer the generation logic and use it to filter candidate seeds against observed landmarks — a perfect workload for distributed computing.<br /> <br /> When the original seed of a screenshot or panorama is unknown, recovering it amounts to a brute-force search problem. Two worlds can appear nearly identical to a player yet originate from entirely different seeds; recovering the exact seed from a screenshot requires testing billions of candidates against terrain features (mountain profiles, biome boundaries, structure positions) extracted from the image.&lt;ref name=&quot;vcomp&quot;&gt;{{cite web |url=https://vcomp.org/en/projects/minecraft-at-home |title=Minecraft@Home |website=Volunteer Computing for Everyone |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> == Why Minecraft@Home? ==<br /> <br /> Searching the full &lt;math&gt;2^{48}&lt;/math&gt; seed space sequentially on a single modern computer would take on the order of months to years for many projects.&lt;ref&gt;{{cite web |url=https://minecraftathome.com/projects/packpng.html |title=Pack.PNG - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt; BOINC transforms that obstacle into a tractable problem by distributing the search across thousands of volunteers' machines running in parallel. Each volunteer's GPU or CPU processes a slice of candidate seeds, uploading results to the central server, which assembles and validates them. This is exactly the kind of [[wikipedia:embarrassingly parallel|embarrassingly parallel]] workload for which volunteer computing is ideally suited.<br /> <br /> Beyond raw compute power, BOINC provides the project with a trusted framework for result validation (redundant replication guards against errors and cheating), cross-platform client support, and a credit system that recognizes volunteer contributions. As BOINC's creator David P. Anderson has documented, the platform harnesses idle consumer hardware that collectively delivers compute throughput that would be prohibitively expensive to purchase commercially.&lt;ref&gt;{{cite web |url=https://arxiv.org/pdf/1903.01699 |title=BOINC: A Platform for Volunteer Computing |last=Anderson |first=David P. |year=2019 |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> Minecraft@Home is notable in the BOINC ecosystem for being a community-run project with no institutional sponsor, funded entirely by volunteer effort and donations, and for targeting a cultural and gaming domain rather than traditional scientific research.&lt;ref name=&quot;boincaustralia&quot;&gt;{{cite web |url=https://forum.boinc-australia.net/ |title=BOINC-AUSTRALIA FORUM - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt; The project demonstrates that distributed computing methods pioneered for astrophysics and biomedicine transfer cleanly to reverse-engineering problems in computational game research.<br /> <br /> == History ==<br /> [[File:SEED of Minecraft's title-screen background PANORAMA.jpg|thumb|SEED of Minecraft's title-screen background PANORAMA]]<br /> Minecraft@Home grew out of a broader community effort to recover famous Minecraft world seeds that was catalysed in early 2020 by YouTuber SalC1. &lt;ref name=&quot;packpng_project&quot;&gt;{{cite web |url=https://minecraftathome.com/projects/packpng.html |title=Pack.PNG - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt; On 14 January 2020, SalC1 uploaded a video asking about the origin of ''pack.png'', which sparked serious seedfinding work across several Discord communities.&lt;ref name=&quot;packpng_project&quot;/&gt; Community member Tomlacko simultaneously began researching the game's title-screen panorama, determining the game version and the exact Z coordinate from cloud patterns. His findings were shared on SalC1's Discord server, and a dedicated channel in a newly created ''Minecraft@Home'' Discord server was set up to coordinate the effort.&lt;ref name=&quot;panorama&quot;&gt;{{cite web |url=https://minecraftathome.com/projects/beta-panorama.html |title=Beta Panorama - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> The BOINC-backed Minecraft@Home project went live on 24 June 2020,&lt;ref name=&quot;boinclaunch&quot;/&gt; with the panorama application as its inaugural workload. At launch it was GPU-only, with OpenCL support for NVIDIA hardware; AMD support followed within days.&lt;ref name=&quot;boinclaunch&quot;/&gt; The panorama seed was found in under 24 hours of distributed runtime, representing approximately 93 days of single-machine processing time compressed into one day — a total of 54.5 exaFLOPs of computation.&lt;ref name=&quot;panorama&quot;/&gt;<br /> <br /> Following the panorama success, the community turned to ''pack.png'' and multiple other targets. By 2021 the project had recovered seeds for the Herobrine screenshot, the Skull-on-Fire painting, and several Minecraft menu backgrounds. The project continues to run as of 2026, with active applications searching for large veins of diamond ore in Minecraft 1.21.<br /> <br /> == Goal ==<br /> <br /> Minecraft@Home aims to answer fundamental questions about Minecraft's world generation by:<br /> <br /> * Recovering the original seeds of famous Minecraft worlds, screenshots, and panoramas that have been lost or were never publicly known.<br /> * Exploring the absolute statistical limits of world generation, such as the tallest cactus that can naturally generate, or the largest natural ore veins.<br /> * Recreating iconic Minecraft scenes from cultural history for the community to revisit.<br /> <br /> == Methods ==<br /> <br /> [[File:Tinkers_Construct_smeltery.png|alt=An example of Minecraft's procedurally generated terrain|right|frameless|220px]]<br /> <br /> Each Minecraft@Home project follows a broadly similar workflow. Researchers first study the target — a screenshot, video frame, or in-game image — to extract constraints on the world: the probable game version, biome type, exact coordinates derived from cloud positions or grass colour data, and characteristic terrain features such as tree arrangements or block proportions. These constraints are encoded into a filtering application that can rapidly reject candidate seeds that cannot match, before running a final terrain-check against the handful of survivors.<br /> <br /> The filtering applications are compiled as GPU kernels (using [[wikipedia:OpenCL|OpenCL]]), because GPU parallelism is ideally suited to testing billions of simple mathematical operations per second. The BOINC server distributes work units — each covering a contiguous range of candidate seeds — to volunteers, collects the results, and validates them through redundant replication.&lt;ref name=&quot;boincaustralia&quot;/&gt; Source code for the server infrastructure is publicly available on GitHub and uses Docker containers to allow community members to run a local replica of the full server stack.&lt;ref&gt;{{cite web |url=https://github.com/minecrafthome/minecrafthome |title=minecrafthome/minecrafthome on GitHub |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> For projects where a brute-force sweep of all &lt;math&gt;2^{48}&lt;/math&gt; seeds is needed, the work is divided into segments distributed as individual BOINC work units. The ''pack.png'' project, for example, exhausted all segments and found its target in the final 5% of the search space.&lt;ref name=&quot;packpng_project&quot;/&gt;<br /> <br /> == Results ==<br /> <br /> Since its launch in 2020, Minecraft@Home has completed or advanced the following notable projects:<br /> <br /> === Main Menu Panorama (Beta 1.7.3) ===<br /> <br /> The rotating background that greeted Minecraft players on the title screen from version Beta 1.8 through Release 1.13.2 was the project's first and founding target. Tomlacko identified the panorama's version (Beta 1.7.3) and Z coordinate from cloud metadata; the BOINC application found the seed in under 24 hours after launch on 24 June 2020, compressing roughly 93 days of single-machine work into one distributed day.&lt;ref name=&quot;panorama&quot;/&gt;&lt;ref&gt;{{cite web |url=https://www.minecraftforum.net/forums/minecraft-java-edition/seeds/3029589-minecraft-home-have-found-the-seed-of-minecrafts-title-screen |title=Minecraft@Home have found the seed of Minecraft's title-screen background panorama |website=Minecraft Forum |date=2020-07-18 |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> === Pack.PNG (Alpha 1.2.2) ===<br /> <br /> ''Pack.png'' is the small hill-and-waterfall image that served as Minecraft's default texture-pack icon from Alpha 1.2.2 (November 2010) through Release 1.13.2, and continues to be used as the default server icon.&lt;ref&gt;{{cite web |url=https://minecraft.wiki/w/Java_Edition_Alpha_v1.2.2 |title=Java Edition Alpha v1.2.2 - Minecraft Wiki |access-date=2026-05-24}}&lt;/ref&gt; The search began in January 2020 and involved extensive reverse-engineering of block proportions, dirt-layer thickness, sand-distribution patterns, and AI-upscaled versions of the low-resolution source image.&lt;ref name=&quot;packpng_project&quot;/&gt; After eight months of work by two teams, the seed was found on 5 September 2020 — in the last 5% of the search space — by BOINC volunteers ''niraami'' and ''zombie67'', whose machines processed the decisive work unit at 04:04 UTC.&lt;ref&gt;{{cite web |url=https://www.pcgamer.com/the-iconic-minecraft-world-of-the-packpng-image-has-been-found/ |title=The iconic Minecraft world of the Pack.png image has been found |last=Brown |first=Fraser |website=PC Gamer |date=2020-09-05 |access-date=2026-05-24}}&lt;/ref&gt; The seed is &lt;code&gt;3257840388504953787&lt;/code&gt;, and the hill can be found at coordinates X=49, Z=0 in Alpha 1.2.2a.&lt;ref&gt;{{cite web |url=https://minecraft.wiki/w/World_seed |title=World seed - Minecraft Wiki |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> Even Minecraft creator Markus &quot;Notch&quot; Persson and technical director Nathan &quot;Dinnerbone&quot; Adams attempted to assist the search but were unable to recall the original seed.&lt;ref name=&quot;packpng_project&quot;/&gt;<br /> <br /> === Skull-on-Fire Painting (Alpha 1.1.2_01) ===<br /> <br /> Minecraft's craftable &quot;Skull on Fire&quot; painting, created by artist Kristoffer Zetterstrand and added in Beta 1.3, depicts a mountain scene from an actual Minecraft world. Zetterstrand shared his original screenshot (taken 12 October 2010 at 13:22 UTC+2) directly with the Minecraft@Home team.&lt;ref&gt;{{cite web |url=https://minecraftathome.com/projects/skull-painting.html |title=Skull-on-Fire - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt; Using that screenshot and reverse-engineering the terrain, community member andrew_555 (Kminster) independently derived the seed and shared it with the project on 10 September 2020, just five days after the ''pack.png'' announcement. Two valid seeds reproduce the terrain: &lt;code&gt;-1044887956651363087&lt;/code&gt; and &lt;code&gt;-6984854390176336655&lt;/code&gt;, both in Alpha 1.1.2_01, at coordinates X=-249.65, Y=91, Z=-29.04.&lt;ref&gt;{{cite web |url=https://screenrant.com/minecraft-world-seeds-discovered-herobrine-title-screen-iconic/ |title=Every Iconic Minecraft World Seed Discovered So Far |last=Gravelle |first=Cody |website=Screen Rant |date=2021-03-21 |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> === The Herobrine World (Alpha 1.0.16_02) ===<br /> <br /> [[wikipedia:Herobrine|Herobrine]] is a long-running Minecraft creepypasta — a supposed ghost of Notch's brother, depicted in an eerie screenshot circulated from around 2010. A project to find the original screenshot's world seed began on 5 September 2020. After months of debugging (including discovering that a mismatched leaf block in the terrain recreation had been causing the filter to fail), andrew_555 (Kminster) found the seed on 16 January 2021.&lt;ref&gt;{{cite web |url=https://www.pcgamer.com/minecrafts-infamous-herobrine-world-seed-has-been-found/ |title=Minecraft's infamous 'Herobrine' world seed has been found |last=Chalk |first=Andy |website=PC Gamer |date=2021-01-22 |access-date=2026-05-24}}&lt;/ref&gt; The seed is &lt;code&gt;478868574082066804&lt;/code&gt;, in Alpha 1.0.16_02, at coordinates X=5.06, Y=71, Z=-298.54.&lt;ref&gt;{{cite web |url=https://minecraft.wiki/w/Herobrine |title=Herobrine - Minecraft Wiki |access-date=2026-05-24}}&lt;/ref&gt;&lt;ref&gt;{{cite web |url=https://news.nixinova.com/news/2021/01/minecraft-herobrine-hoax-image-world-seed-found |title=Minecraft World Seed of Herobrine Hoax Image Found |website=Nixinova News |date=2021-01-23 |access-date=2026-05-24}}&lt;/ref&gt; Because Alpha 1.0.16_02 predates Minecraft's in-game seed-entry feature, visiting the world requires manually editing the &lt;code&gt;level.dat&lt;/code&gt; save file.<br /> <br /> In the changelog of Minecraft Launcher version 2.2.176x, released shortly after the seed was discovered, Mojang included their traditional joke entry: &quot;Removed Herobrine from Java Alpha 1.0.16_02.&quot;&lt;ref&gt;{{cite web |url=https://minecraft.wiki/w/Herobrine |title=Herobrine - Minecraft Wiki |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> === 1.13-1.16 Menu Backgrounds ===<br /> <br /> Following the Beta 1.7.3 panorama discovery, Minecraft@Home located the seeds for all four remaining menu background panoramas introduced in versions 1.13 through 1.16, completing the set of known Minecraft title-screen worlds.&lt;ref&gt;{{cite web |url=https://minecraftathome.com/projects/1-13-1-16-panoramas.html |title=1.13-1.16 Backgrounds - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> === Tallest Cactus ===<br /> <br /> Cacti in Minecraft normally generate between one and three blocks tall; occasionally two cacti can spawn in adjacent chunks and, due to growth mechanics, effectively &quot;stack.&quot; Minecraft@Home's ''Kaktwoos'' (and ''Kaktoos'') applications systematically search all chunk seeds for unusually tall stacked cacti. The current confirmed records are a 22-block-tall cactus in normal overworld generation (seed &lt;code&gt;11343195073417814&lt;/code&gt;, version 1.14.4, at coordinates 14,955,936 / 64 / -3,750,655, found by volunteer SirNapkin1334)&lt;ref&gt;{{cite web |url=https://minecraftathome.com/projects/tallcactus.html |title=Tallest Cactus - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt;&lt;ref&gt;{{cite web |url=https://nsonews.com/minecrafthome/ |title=Minecraft@Home - NSO News |date=2020-07-03 |access-date=2026-05-24}}&lt;/ref&gt; and a 24-block-tall cactus on a superflat desert world (seed &lt;code&gt;93257619645605&lt;/code&gt;).&lt;ref&gt;{{cite web |url=https://minecraftathome.com/projects/tallcactus.html |title=Tallest Cactus - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> === Smash Backgrounds ===<br /> <br /> When Nintendo added Steve (from Minecraft) to ''Super Smash Bros. Ultimate'', the in-game Minecraft World stage featured six background images. Minecraft@Home launched a project to recover the original Minecraft world seeds behind each of those six backgrounds.&lt;ref&gt;{{cite web |url=https://minecraftathome.com/projects/smash-backgrounds.html |title=Smash Backgrounds - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> === Minecraft Trailer Recreation ===<br /> <br /> The original Minecraft promotional trailer, one of the most-watched pieces of Minecraft content ever created, is being recreated scene by scene by locating the exact in-game seeds and camera positions used in each shot.&lt;ref&gt;{{cite web |url=https://minecraftathome.com/projects/official-trailer.html |title=Minecraft Trailer - Minecraft@Home |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> === Large Diamond Vein Search (Active, 2026) ===<br /> <br /> As of May 2026, the active BOINC application is &quot;1.21 Find large veins of diamond ore,&quot; which searches Minecraft 1.21 world seeds for exceptionally large naturally generated diamond ore formations. The application had over 718,000 unsent tasks queued and was being processed by nearly 200 active users per day at the time of writing.&lt;ref&gt;{{cite web |url=https://minecraftathome.com/minecrafthome/server_status.php |title=Minecraft@Home - Project Status |date=2026-05-24 |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> == BOINC statistics ==<br /> [[File:Screenshot from the Minecraft End.png|thumb|Screenshot from the Minecraft End]]<br /> The following figures were recorded from the Minecraft@Home server status page on 24 May 2026:&lt;ref&gt;{{cite web |url=https://minecraftathome.com/minecrafthome/server_status.php |title=Minecraft@Home - Project Status |date=2026-05-24 |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Statistic !! Value<br /> |-<br /> | Users with credit || 6,639<br /> |-<br /> | Users with recent credit || 655<br /> |-<br /> | Computers with credit || 13,567<br /> |-<br /> | Computers with recent credit || 1,650<br /> |-<br /> | Recent compute throughput || 10,385.26 TFLOPS<br /> |-<br /> | Total historic compute || 241,900.05 TFLOPS-days<br /> |-<br /> | New users (last 24 h) || 19<br /> |-<br /> | New computers (last 24 h) || 8<br /> |}<br /> <br /> == Technical notes ==<br /> <br /> The Minecraft@Home server is implemented as a set of [[wikipedia:Docker (software)|Docker]] containers that together constitute a standard BOINC server environment (scheduler, feeder, transitioner, file-deleter, per-application assimilators, and result validators).&lt;ref&gt;{{cite web |url=https://github.com/minecrafthome/minecrafthome |title=minecrafthome/minecrafthome - GitHub |access-date=2026-05-24}}&lt;/ref&gt; The server software runs BOINC server release 1.2.0. Applications are GPU-accelerated via OpenCL (requiring at minimum OpenCL 2.0 and the &lt;code&gt;cl_khr_fp64&lt;/code&gt; double-precision extension) and target Windows and Linux; CPU fallback modes are not generally offered, as the GPU kernels provide orders-of-magnitude higher throughput for the seed-testing workloads.<br /> <br /> The project's source repositories under the [https://github.com/minecrafthome GitHub organization] include the server stack, the individual research applications (such as ''kaktwoos'', ''kaktoos'', and ''OneChunk''), and a branding repository for project assets.<br /> <br /> == Project team ==<br /> <br /> Minecraft@Home is a volunteer community project with no single institutional home. Key contributors to the founding projects include:<br /> <br /> * '''Tomlacko''' — project originator; identified panorama version and coordinates<br /> * '''Earthcomputer, Cortex, Neil''' — wrote biome and terrain-checking code; located the panorama seed<br /> * '''DutChen18''' — built tools and mods for data gathering and seed-checking recreation<br /> * '''PseudoGravity''' — reversed tallgrass colour data to identify biome values in the panorama<br /> * '''Philipp_DE''' — hosts the server infrastructure; operates the recreation Minecraft server and screenshotting bot; maintains the BOINC project<br /> * '''andrew_555 (Kminster)''' — independently derived both the Skull-on-Fire seed and (after months of debugging) the Herobrine seed&lt;ref&gt;{{cite web |url=https://www.pcgamer.com/minecrafts-infamous-herobrine-world-seed-has-been-found/ |title=Minecraft's infamous 'Herobrine' world seed has been found |website=PC Gamer |date=2021-01-22 |access-date=2026-05-24}}&lt;/ref&gt;<br /> <br /> The full list of contributors to each project is documented in credits spreadsheets linked from the individual project pages on the Minecraft@Home website.&lt;ref name=&quot;panorama&quot;/&gt;<br /> <br /> Community discussion and coordination takes place primarily on the [https://discord.gg/FVM4SPp Minecraft@Home Discord server]. The GitHub organization is at [https://github.com/minecrafthome github.com/minecrafthome].<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:Minecraft|Minecraft]]<br /> * [[wikipedia:Procedural generation|Procedural generation]]<br /> * [[wikipedia:Pseudorandom number generator|Pseudorandom number generator]]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:Minecraft]]<br /> [[Category:Gaming research]]<br /> [[Category:Distributed computing projects]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Data_freezer&diff=1437 2026-05-29T13:33:52Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Data freezer<br /> | logo = freezer.png<br /> | logo caption = Data freezer project logo<br /> | screenshot = <br /> | caption =<br /> | developer = Serge Stu<br /> | released = {{Start date and age|2024|6|11}}<br /> | discontinued = Yes<br /> | programming language = [[C++]]<br /> | operating system = Cross-platform<br /> <br /> | website = [https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/ Archived website]<br /> | license = Proprietary<br /> }}<br /> <br /> '''''[https://frostydata.com/0Kdata/ Data freezer]''''' was a BOINC-based [[wikipedia:Volunteer computing|volunteer computing]] project focused on experimental distributed data storage and data deduplication using consumer hardware. The project proposed building a decentralized storage warehouse using spare capacity on devices such as old SSDs, smartphones, and MicroSD cards.&lt;ref name=&quot;about&quot;&gt;{{cite web |url=https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/about.php |title=About Data freezer |website=Data freezer |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> The project operated during 2024 and later became inactive. Archived versions of the website remain available through the [[Wikipedia:Wayback Machine|Wayback Machine]].&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/ |title=Archived Data freezer homepage |website=Wayback Machine |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> == History ==<br /> Data freezer appeared as an experimental BOINC project during 2024. The project was hosted on the domain ''frostydata.com'' and used the standard BOINC server infrastructure developed by the [[Wikipedia:University of California, Berkeley|University of California, Berkeley]].&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC official website |publisher=University of California, Berkeley |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> Unlike traditional BOINC scientific projects that focus on simulations or mathematical analysis, Data freezer attempted to use volunteer computing resources for distributed data storage and integrity verification.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> The project described itself as an attempt to create a future commercial distributed storage and deduplication platform powered by volunteer hardware.&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/forum_thread.php?id=4 |title=Project methods discussion |website=Data freezer forums |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> == Why Data freezer? ==<br /> According to the project website, the goal was:<br /> <br /> {{Quote|<br /> &quot;To find a technical group of enthusiasts who will understand the meaning and be inspired!&quot;<br /> |source=Data freezer project description&lt;ref name=&quot;about&quot; /&gt;<br /> }}<br /> <br /> == Goal ==<br /> The main objective of the project was to build a large-scale distributed data warehouse using consumer hardware that would otherwise remain unused.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> The project specifically mentioned the following types of hardware:<br /> <br /> * Old SSD drives<br /> * Smartphones<br /> * MicroSD cards<br /> * Consumer storage devices<br /> <br /> The project developers proposed that, if successful, participants could either earn revenue from the system or donate storage resources to charitable causes.&lt;ref name=&quot;about&quot; /&gt;<br /> [[File:BOINC logo.png|thumb|250x250px|[[BOINC]] logo]]<br /> <br /> == Methods ==<br /> Data freezer proposed several technical mechanisms for distributed storage and deduplication:&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/forum_thread.php?id=4 |title=Methods and technical description |website=Data freezer forums |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> * Storage of data blocks on distributed SSD devices<br /> * Continuous verification of data integrity<br /> * Calculation of cryptographic hashes on random data blocks<br /> * Deduplication using calculated hashes<br /> * Creation of large-scale key-value storage systems<br /> <br /> The project described an architecture where cryptographic hashes served as keys and data blocks served as values in a distributed storage database.&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/forum_thread.php?id=4 |title=Deduplication system description |website=Data freezer forums |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> === Redundancy and recovery ===<br /> The project proposed using multiple replicas of stored data to improve reliability. The website claimed that even if copies were lost, reconstruction techniques could potentially restore information using stored metadata and hashes.&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/forum_thread.php?id=4 |title=Reliability discussion |website=Data freezer forums |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> Some of the concepts described by the project were experimental and theoretical in nature, particularly discussions regarding reconstruction of original data from cryptographic information under limited circumstances.<br /> <br /> == BOINC integration ==<br /> Data freezer used the BOINC middleware platform for distributing workloads to volunteer computers.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/trac/wiki/ProjectMain |title=BOINC Project documentation |publisher=University of California, Berkeley |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> [[Wikipedia:BOINC|BOINC]] is an open-source volunteer computing framework originally developed at the University of California, Berkeley and used by many scientific computing projects worldwide.&lt;ref&gt;{{cite journal<br /> |last1=Anderson<br /> |first1=David P.<br /> |title=BOINC: A System for Public-Resource Computing and Storage<br /> |journal=Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing<br /> |year=2004<br /> |doi=10.1109/GRID.2004.14<br /> }}&lt;/ref&gt;<br /> <br /> == Scientific and technical relevance ==<br /> [[File:2023 Napęd SSD Lexar NM620 1TB (2).jpg|thumb|The project aimed to use unused consumer SSD storage devices]]<br /> Although Data freezer was not a traditional scientific simulation project, it explored several concepts related to distributed systems research:<br /> <br /> * Distributed storage systems<br /> * Data deduplication<br /> * Cryptographic verification<br /> * Consumer hardware reuse<br /> * Decentralized infrastructure<br /> <br /> The project also reflected broader interest within the BOINC ecosystem in expanding volunteer computing beyond numerical scientific calculations.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/pubs.php |title=BOINC publications and papers |publisher=University of California, Berkeley |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> == Project closure ==<br /> By late 2024, the project website became inactive. Archived snapshots remain available through the Wayback Machine.&lt;ref&gt;{{cite web |url=https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/ |title=Archived Data freezer website |website=Wayback Machine |access-date=2026-05-19}}&lt;/ref&gt;<br /> <br /> No official announcement regarding long-term continuation or commercial deployment was published in the archived materials.<br /> [[File:NOIRLab HQ Server Racks (6V6A0395-CC).jpg|thumb|250x250px|Data freezer attempted to create a distributed storage infrastructure using volunteer hardware]]<br /> <br /> == Project team / Sponsors ==<br /> * Serge Stu<br /> <br /> == See also ==<br /> * [[Wikipedia:BOINC|BOINC]]<br /> * [[Wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[Wikipedia:Distributed storage|Distributed storage]]<br /> * [[Wikipedia:Data deduplication|Data deduplication]]<br /> <br /> == External links ==<br /> * [https://web.archive.org/web/20240915225040/https://frostydata.com/0Kdata/ Archived official website]<br /> * [https://boinc.berkeley.edu/ BOINC official website]<br /> * [https://boinc.berkeley.edu/pubs.php BOINC scientific publications]<br /> <br /> == References ==<br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Albert@Home&diff=1436 2026-05-29T13:32:43Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Albert@Home<br /> | logo = Alberthome.png<br /> | screenshot = <br /> | caption = The Albert@Home project banner<br /> <br /> | status = Completed<br /> | category = Testing<br /> | compute = CPU &amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Einstein@Home development team<br /> | sponsor = [[wikipedia:Max Planck Institute for Gravitational Physics|Max Planck Institute for Gravitational Physics (Albert Einstein Institute)]]<br /> | released = {{Start date and age|2011|11|15}}<br /> | completed = {{Start date and age|2024|09|25}}<br /> <br /> | programming language = C++, PHP, OpenCL, CUDA<br /> | operating system = Windows, macOS, Linux, Android, FreeBSD<br /> <br /> | website = [https://albertathome.org albertathome.org]<br /> | license = [[wikipedia:GNU Lesser General Public License|LGPL-3.0-or-later]] (BOINC core components)<br /> }}<br /> <br /> [[File:Albert Einstein Head.jpg|thumb|right|250px|[[wikipedia:Albert Einstein|Albert Einstein]], namesake of the [[wikipedia:Albert Einstein Institute|Albert Einstein Institute]].]]<br /> [[File:BOINC logo.png|thumb|180x180px|The [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] logo.]]<br /> <br /> [https://albertathome.org '''''Albert@Home'''''] was a volunteer distributed computing project operating on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] (Berkeley Open Infrastructure for Network Computing) platform.&lt;ref&gt;{{Cite web<br /> |title=Albert@Home<br /> |url=https://albertathome.org/<br /> |website=Albert@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> The project functioned as the official public alpha-testing and development branch for [[wikipedia:Einstein@Home|Einstein@Home]], allowing developers to evaluate experimental scientific applications, client software, database transitions, and server-side configurations before deploying them into a live production environment.&lt;ref&gt;{{Cite web<br /> |title=Einstein@Home<br /> |url=https://einsteinathome.org/<br /> |website=Einstein@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> Albert@Home was operated by researchers at the [[wikipedia:Max Planck Institute for Gravitational Physics|Max Planck Institute for Gravitational Physics (Albert Einstein Institute)]] in Hannover, Germany. The project officially launched its testing phase on November 15, 2011, and was permanently shut down on September 25, 2024.&lt;ref&gt;{{Cite web<br /> |title=Albert@Home shutdown announcement<br /> |url=https://albertathome.org/<br /> |website=Albert@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> == History ==<br /> Albert@Home was introduced on November 15, 2011, by the Einstein@Home development team as a dedicated public testing network for experimental BOINC applications and infrastructure changes.&lt;ref&gt;{{Cite web<br /> |title=Albert@Home project information<br /> |url=https://albertathome.org/<br /> |website=Albert@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> Because Einstein@Home processes large quantities of scientific data from gravitational-wave observatories and radio telescopes, developers used Albert@Home to validate new software before deploying it on the primary Einstein@Home infrastructure.&lt;ref&gt;{{Cite web<br /> |title=About Einstein@Home<br /> |url=https://einsteinathome.org/content/about-us<br /> |website=Einstein@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> Initially, the project was used to stress-test OpenCL and CUDA applications across a wide variety of CPU and GPU configurations, including Binary Radio Pulsar (BRP) search applications.&lt;ref&gt;{{Cite web<br /> |title=Einstein@Home Applications<br /> |url=https://einsteinathome.org/content/applications<br /> |website=Einstein@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> Throughout its operational lifetime, Albert@Home was also used to evaluate database migrations, scheduler behavior, credit calculations, and new BOINC server software revisions before they were introduced into production environments.&lt;ref&gt;{{Cite web<br /> |title=BOINC server software<br /> |url=https://boinc.berkeley.edu/trac/wiki/ServerIntro<br /> |website=BOINC<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> On September 25, 2024, project administrator Bernd Machenschalk announced the permanent suspension of Albert@Home. The project was retired after virtualization and local testing environments reduced the need for a publicly accessible alpha-testing platform.&lt;ref&gt;{{Cite web<br /> |title=Albert@Home<br /> |url=https://albertathome.org/<br /> |website=Albert@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> == Purpose ==<br /> Albert@Home served as an isolated public testing environment for Einstein@Home and related BOINC infrastructure projects. The project allowed developers to safely identify software defects and hardware compatibility problems before rolling updates into production systems.<br /> <br /> Key functions of the project included:<br /> <br /> * '''Alpha testing''' of unstable experimental applications.<br /> * '''Validation of new credit systems''' and runtime estimation algorithms.<br /> * '''Testing database migrations''' and scheduler changes.<br /> * '''Cross-platform verification''' across Windows, Linux, macOS, Android, and FreeBSD clients.<br /> * '''GPU application testing''' using OpenCL and CUDA technologies.<br /> <br /> Unlike production scientific projects, Albert@Home primarily focused on software validation and infrastructure reliability rather than publishing independent scientific discoveries.&lt;ref&gt;{{Cite web<br /> |title=BOINC<br /> |url=https://boinc.berkeley.edu/<br /> |website=University of California, Berkeley<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> == Methods ==<br /> Albert@Home used the standard BOINC client-server architecture. Volunteers downloaded work units through the BOINC client manager, processed them locally using unused CPU or GPU resources, and returned completed results to project servers for validation.<br /> <br /> Testing areas included:<br /> <br /> * '''Heterogeneous computing''' using different GPU architectures.<br /> * '''Scheduler stress testing''' under heavy workloads.<br /> * '''Database performance profiling''' and scalability analysis.<br /> * '''Application benchmarking''' across different operating systems and hardware platforms.<br /> * '''Client emulation''' to reproduce edge-case failures and network communication problems.<br /> <br /> The project frequently distributed intentionally experimental or unstable workloads to help developers locate rare compatibility problems that could not easily be reproduced in laboratory conditions.&lt;ref&gt;{{Cite web<br /> |title=BOINC client software<br /> |url=https://boinc.berkeley.edu/download.php<br /> |website=BOINC<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> == Relationship to Einstein@Home ==<br /> [[File:LIGO Hanford aerial 05.jpg|thumb|300px|The [[wikipedia:LIGO|LIGO]] Hanford Observatory, part of the gravitational-wave research infrastructure supported by Einstein@Home.]]<br /> <br /> Albert@Home operated as a direct pre-production mirror for [[wikipedia:Einstein@Home|Einstein@Home]]. Software and infrastructure changes were commonly tested on Albert@Home before deployment onto Einstein@Home production servers.<br /> <br /> Einstein@Home scientific applications analyze:<br /> <br /> * Data from the [[wikipedia:LIGO|LIGO]] and [[wikipedia:Virgo interferometer|Virgo]] gravitational-wave observatories.<br /> * Radio pulsar survey data from the [[wikipedia:Arecibo Observatory|Arecibo Observatory]] and [[wikipedia:Parkes Observatory|Parkes Observatory]].<br /> * Gamma-ray observations from the [[wikipedia:Fermi Gamma-ray Space Telescope|Fermi Gamma-ray Space Telescope]].&lt;ref&gt;{{Cite web<br /> |title=Scientific results<br /> |url=https://einsteinathome.org/science<br /> |website=Einstein@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> Experimental application builds were validated on Albert@Home before being distributed to the significantly larger Einstein@Home volunteer network.<br /> <br /> == Scientific and technical importance ==<br /> Although Albert@Home itself did not publish independent scientific discoveries, its testing infrastructure contributed indirectly to the stability and performance of Einstein@Home scientific applications.<br /> <br /> Research supported through Einstein@Home computing infrastructure has included:<br /> <br /> * Searches for continuous gravitational waves from supernova remnants such as Cassiopeia A and Vela Jr.&lt;ref&gt;{{Cite journal<br /> |last1=Ming<br /> |first1=J.<br /> |last2=Papa<br /> |first2=M. A.<br /> |title=Deep Einstein@Home search for continuous gravitational waves from Cassiopeia A and Vela Jr.<br /> |journal=The Astrophysical Journal<br /> |year=2024<br /> }}&lt;/ref&gt;<br /> <br /> * Radio pulsar searches using data from the Arecibo PALFA survey.&lt;ref&gt;{{Cite journal<br /> |last1=Allen<br /> |first1=B.<br /> |title=The Einstein@Home search for radio pulsars in Arecibo PALFA Survey data<br /> |journal=The Astrophysical Journal<br /> |year=2013<br /> }}&lt;/ref&gt;<br /> <br /> The project also served as an example of large-scale volunteer computing quality assurance and distributed infrastructure testing within the BOINC ecosystem.<br /> <br /> == Project team and sponsors ==<br /> The project was operated by staff and researchers associated with the [[wikipedia:Max Planck Institute for Gravitational Physics|Max Planck Institute for Gravitational Physics (Albert Einstein Institute)]].&lt;ref&gt;{{Cite web<br /> |title=Albert Einstein Institute<br /> |url=https://www.aei.mpg.de/<br /> |website=Max Planck Society<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> Additional institutional support was provided by:<br /> <br /> * The Max Planck Society.<br /> * [[wikipedia:University of Wisconsin–Milwaukee|The University of Wisconsin–Milwaukee]].<br /> * The National Science Foundation (NSF).<br /> <br /> == Completion ==<br /> On September 25, 2024, Albert@Home was permanently decommissioned. Public project services, including scheduler daemons, statistics exports, and discussion forums, were subsequently taken offline.&lt;ref&gt;{{Cite web<br /> |title=Albert@Home<br /> |url=https://albertathome.org/<br /> |website=Albert@Home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> The project remains notable within the BOINC community as a long-running public beta-testing environment for distributed computing infrastructure.<br /> <br /> == Contributing ==<br /> During active operation, volunteers connected to the project through the BOINC client software using the following project URL:<br /> <br /> &lt;code&gt;https://albertathome.org&lt;/code&gt;<br /> <br /> Participants frequently enabled advanced BOINC debugging flags such as &lt;code&gt;&amp;lt;work_fetch_debug&amp;gt;&lt;/code&gt; and &lt;code&gt;&amp;lt;app_version_debug&amp;gt;&lt;/code&gt; inside the local &lt;code&gt;cc_config.xml&lt;/code&gt; configuration file to help developers diagnose scheduler and application issues.<br /> <br /> == See also ==<br /> * [[wikipedia:Einstein@Home|Einstein@Home]]<br /> * [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:Distributed computing|Distributed computing]]<br /> * [[wikipedia:Max Planck Institute for Gravitational Physics|Max Planck Institute for Gravitational Physics]]<br /> <br /> == External links ==<br /> * [https://albertathome.org Official Albert@Home website]<br /> * [https://einsteinathome.org Official Einstein@Home website]<br /> * [https://boinc.berkeley.edu BOINC official website]<br /> * [https://www.aei.mpg.de/ Max Planck Institute for Gravitational Physics]<br /> <br /> == References ==<br /> &lt;references /&gt;</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=IThena.Computational&diff=1435 2026-05-29T13:30:52Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = iThena.Computational<br /> | logo = IThena_Logo.png<br /> | logo caption = iThena project logo<br /> <br /> | status = Active<br /> | category = Network science / Internet infrastructure mapping<br /> | compute = CPU<br /> | dependencies = BOINC<br /> <br /> | developer = Łukasz Świerczewski<br /> | author = Łukasz Świerczewski<br /> | released = {{Start date and age|2019|09|26}}<br /> <br /> | programming language = C, C++<br /> | operating system = Linux, Windows<br /> <br /> | stats as of = {{Start date and age|2026|02|17}}<br /> | average performance = 924.04 GigaFLOPS<br /> | active users = 292<br /> | active hosts = 2852<br /> | total users = 1143<br /> | total hosts = 106124<br /> <br /> | rac = 18500000<br /> | credit per day = 950000<br /> | gpu performance = 15 PFLOPS<br /> | cpu performance = 6 PFLOPS<br /> <br /> | website = {{URL|https://comp.ithena.net/usr/}}<br /> | license = Mixed / proprietary BOINC applications<br /> }}<br /> <br /> [https://comp.ithena.net/usr/ '''''iThena.Computational'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project based on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform. The project focuses on experimental mapping and analysis of Internet network structures using volunteered computing resources from participants around the world.&lt;ref name=&quot;about&quot;&gt;{{cite web<br /> |url=https://comp.ithena.net/usr/about.php<br /> |title=About iThena.Computational<br /> |website=iThena.Computational<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> The project is part of the broader '''iThena''' initiative, which is divided into two major subsystems:<br /> <br /> * '''iThena.Computational''' – computational analysis and post-processing<br /> * '''iThena.Measurements''' – active network measurement and traceroute collection&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> The project's goal is to create increasingly accurate models of the global Internet infrastructure, including routers, autonomous systems, points of presence (PoPs), latency relationships, and network topology characteristics.&lt;ref&gt;{{cite web<br /> |url=https://everipedia.org/wiki/lang_en/ithena<br /> |title=iThena<br /> |website=Everipedia<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> == History ==<br /> <br /> The first test activities associated with the iThena project reportedly began on 29 August 2019.&lt;ref&gt;{{cite web<br /> |url=https://everipedia.org/wiki/lang_en/ithena<br /> |title=iThena<br /> |website=Everipedia<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> The first public announcement regarding the project was published on 26 September 2019.&lt;ref&gt;{{cite web<br /> |url=https://everipedia.org/wiki/lang_en/ithena<br /> |title=iThena<br /> |website=Everipedia<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> The name ''iThena'' is derived from a combination of the words ''Internet'' and ''Athena''.&lt;ref&gt;{{cite web<br /> |url=https://everipedia.org/wiki/lang_en/ithena<br /> |title=iThena<br /> |website=Everipedia<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;[[File:IThena kiosk Animation (minimal).gif|center|thumb|500x500px|Simplified iThena Project visualization (animation) available at the address: https://vi.ithena.net]]<br /> <br /> == Why iThena.Computational? ==<br /> <br /> Modern Internet infrastructure is extremely large, decentralized, and constantly changing. Mapping relationships between routers, autonomous systems, bandwidth paths, and latency characteristics requires massive numbers of distributed measurements and computational analysis steps.<br /> <br /> The iThena project attempts to address these challenges by combining active network measurements with distributed post-processing using BOINC volunteers.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> Unlike many BOINC projects focused on astronomy or biomedical research, iThena concentrates on network science and Internet topology analysis. The project gathers traceroute and bandwidth data from volunteer hosts distributed across many countries and network providers, allowing researchers to observe Internet structures from geographically diverse perspectives.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> == Goal ==<br /> <br /> The primary objective of iThena.Computational is to analyze and transform data collected by the iThena.Measurements subsystem into usable network models and graph structures.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> Specific goals include:<br /> <br /> * Mapping Internet infrastructure topology<br /> * Studying relationships between routers and autonomous systems<br /> * Measuring latency and bandwidth characteristics<br /> * Building graph-based representations of network structures<br /> * Performing large-scale distributed graph computations<br /> * Processing high-precision numerical transformations using volunteer computing resources&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> The project also aims to demonstrate how volunteer computing can be applied outside traditional scientific domains such as astrophysics or molecular biology.<br /> == Methods ==<br /> <br /> [[File:Internet map 1024.jpg|thumb|300px|'''A high‑level visualization illustrating worldwide Internet interconnections and structural network topology.''']]<br /> <br /> The project uses the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] middleware platform to distribute workloads to volunteer computers.&lt;ref&gt;{{cite web<br /> |url=https://boinc.org/<br /> |title=BOINC<br /> |website=BOINC<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> BOINC enables large computational tasks to be split into smaller work units which are processed independently on participant computers and later returned to project servers for validation and aggregation.&lt;ref&gt;{{cite web<br /> |url=https://arxiv.org/abs/1903.01699<br /> |title=BOINC: A Platform for Volunteer Computing<br /> |last=Anderson<br /> |first=David P.<br /> |website=arXiv<br /> |year=2019<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> The iThena project contains several applications and subsystems:<br /> <br /> === GRAPH ===<br /> <br /> The GRAPH application performs graph-processing operations on data collected from network measurements. It executes graph algorithms intended to analyze the structure of Internet infrastructure datasets.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> Generation of new tasks for GRAPH has periodically been paused according to the project website.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> === HEX ===<br /> <br /> HEX is a post-processing application that performs dynamic transformations on network measurement datasets. The application also performs calculations using the GNU MPFR high-precision arithmetic library.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> HEX tasks use BOINC's quorum-based validation system, requiring agreement between multiple hosts before results are accepted.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> === CNODE ===<br /> <br /> The CNODE application performs distributed traceroute operations from volunteer computers. Resulting data is uploaded back to project servers and integrated into the project's measurement database.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> === PERF ===<br /> <br /> PERF performs bandwidth and network performance analyses using volunteer hosts.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> === OONI Probe integration ===<br /> <br /> The project has also incorporated support for OONI Probe wrappers to assist with Internet measurement and network analysis activities.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> [[File:IThena Project SectionA Graph 1000x1000.png|alt=example mediawiki image|thumb|'''Section A Graph (IThena Project)''' Shows the computed results contributed by the network of BOINC volunteer clients.]]<br /> <br /> The project's distributed approach allows measurements and analyses to be performed from many geographic regions simultaneously, providing broader visibility into Internet connectivity patterns.<br /> <br /> == Supported platforms ==<br /> <br /> The project primarily supports x86_64 Linux systems, although some applications are also available for Microsoft Windows.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> Participants may need to enable BOINC beta or test applications in their account preferences to receive certain workloads such as CNODE.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> == Statistics ==<br /> <br /> Archived project statistics from October 2025 reported:<br /> <br /> * 182,763 registered users<br /> * 2,842 teams<br /> * 4,907 hosts<br /> * More than 238 million total credits awarded&lt;ref&gt;{{cite web<br /> |url=https://comp.ithena.net/<br /> |title=iThena.Computational<br /> |website=iThena.Computational<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> The project attracted volunteers from many countries, including the United States, Germany, Ukraine, Switzerland, Taiwan, Canada, and the United Kingdom.&lt;ref&gt;{{cite web<br /> |url=https://comp.ithena.net/<br /> |title=iThena.Computational<br /> |website=iThena.Computational<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> == Project team / Sponsors ==<br /> <br /> The project administrator is Łukasz Świerczewski.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> The project has also maintained an ORCID researcher profile associated with the administrator.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> == Scientific results ==<br /> <br /> The iThena project has focused primarily on Internet topology mapping, network graph analysis, and distributed measurement infrastructure. Public summaries and visualizations of collected data have periodically been made available through project-operated visualization services.&lt;ref name=&quot;about&quot; /&gt;<br /> <br /> As of 2026, limited peer-reviewed publications specifically dedicated to iThena.Computational had been publicly indexed compared to longer-running BOINC projects.<br /> <br /> == Related BOINC research ==<br /> <br /> The project operates within the wider BOINC volunteer computing ecosystem, which has been the subject of numerous academic publications regarding distributed computing infrastructure and large-scale volunteer processing.&lt;ref&gt;{{cite web<br /> |url=https://arxiv.org/abs/1903.01699<br /> |title=BOINC: A Platform for Volunteer Computing<br /> |last=Anderson<br /> |first=David P.<br /> |website=arXiv<br /> |year=2019<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> Additional research on BOINC-based distributed systems includes virtualization approaches and specialized scientific BOINC deployments.&lt;ref&gt;{{cite web<br /> |url=https://arxiv.org/abs/1306.0846<br /> |title=V-BOINC: The Virtualization of BOINC<br /> |website=arXiv<br /> |year=2013<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:Network science|Network science]]<br /> * [[wikipedia:Traceroute|Traceroute]]<br /> * [[wikipedia:Internet topology|Internet topology]]<br /> <br /> == External links ==<br /> <br /> * [https://comp.ithena.net/usr/ Official iThena.Computational website]<br /> * [https://root.ithena.net/usr/ iThena.Measurements]<br /> * [https://vi.ithena.net/ iThena visualization portal]<br /> * [https://boinc.berkeley.edu/ BOINC official website]<br /> <br /> == References ==<br /> <br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=SPACIOUS@home&diff=1434 2026-05-29T13:29:42Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = SPACIOUS@home<br /> | logo = Spacious-home-logo.png<br /> | logo caption = SPACIOUS@home logo<br /> <br /> | status = Active<br /> | category = Astronomy, Astrophysics<br /> | compute = CPU<br /> | dependencies = <br /> <br /> | developer = Astronomical Observatory Institute, Adam Mickiewicz University<br /> | sponsor = Adam Mickiewicz University in Poznań<br /> | released = {{Start date and age|2025|03|20}}<br /> <br /> | operating system = Linux<br /> | programming language = C, C++, BOINC middleware<br /> <br /> | website = {{URL|https://spaciousathome.eu/spaciousathome/}}<br /> | license = Mixed; BOINC middleware uses the LGPL<br /> <br /> | stats as of = {{Start date and age|2026|05|22}}<br /> }}<br /> <br /> '''SPACIOUS@home''' is a volunteer distributed computing project based on the [[Wikipedia:BOINC|BOINC]] platform that assists astronomers in processing and analyzing large astronomical datasets generated by modern space missions and sky surveys.&lt;ref&gt;{{cite web |url=https://spaciousathome.eu/spaciousathome/ |title=SPACIOUS@home |access-date=2026-05-22}}&lt;/ref&gt; The project enables volunteers around the world to donate unused CPU processing power from their personal computers to support research in astronomy, astrophysics, stellar dynamics, and statistical analysis of large observational datasets.&lt;ref&gt;{{cite web |url=https://spacious.ub.edu/2025/03/20/spacioushome-help-explore-the-universe-from-home/ |title=SPACIOUS@home: Help Explore the Universe from Home |publisher=SPACIOUS |access-date=2026-05-22}}&lt;/ref&gt;<br /> <br /> Like many BOINC projects, SPACIOUS@home distributes scientific calculations across a large network of volunteer computers connected through the internet. This approach allows researchers to access substantial computing power without relying entirely on centralized supercomputers or institutional computing clusters.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC Official Website |publisher=University of California, Berkeley |access-date=2026-05-22}}&lt;/ref&gt;<br /> <br /> Official website: [https://spaciousathome.eu/spaciousathome/ SPACIOUS@home]<br /> <br /> == Overview ==<br /> <br /> Modern astronomical observatories and space missions generate enormous amounts of scientific data. Missions such as the European Space Agency's [[Wikipedia:Gaia (spacecraft)|Gaia]] spacecraft continuously collect highly precise measurements involving stellar positions, motion, brightness, and galactic structure.&lt;ref&gt;{{cite web |url=https://spacious.ub.edu/2025/03/20/spacioushome-help-explore-the-universe-from-home/ |title=SPACIOUS@home: Help Explore the Universe from Home |publisher=SPACIOUS |access-date=2026-05-22}}&lt;/ref&gt; Analyzing these datasets requires extensive computational resources and sophisticated numerical processing techniques.<br /> <br /> SPACIOUS@home was developed to help address these computational demands through volunteer computing. Rather than processing all calculations on a single centralized system, the project divides scientific workloads into smaller work units that can be processed independently by volunteers around the world. The completed results are then returned to the project servers for validation and scientific analysis.<br /> <br /> The project forms part of a broader international effort to use distributed computing technologies in support of large-scale scientific research.<br /> <br /> == History ==<br /> <br /> SPACIOUS@home was publicly announced in March 2025 through the SPACIOUS astronomy initiative.&lt;ref&gt;{{cite web |url=https://spacious.ub.edu/2025/03/20/spacioushome-help-explore-the-universe-from-home/ |title=SPACIOUS@home: Help Explore the Universe from Home |publisher=SPACIOUS |access-date=2026-05-22}}&lt;/ref&gt; The project emerged during a period of renewed interest in astronomy-focused BOINC applications and volunteer computing projects.<br /> <br /> Community discussions on Reddit and BOINC forums identified SPACIOUS@home as one of several newer BOINC projects introduced during the mid-2020s.&lt;ref&gt;{{cite web |url=https://www.reddit.com/r/BOINC/comments/1ogohc3/what_is_spacioushome_about/ |title=What is spacious@home about? |website=Reddit |access-date=2026-05-22}}&lt;/ref&gt;&lt;ref&gt;{{cite web |url=https://www.bc-team.org/viewtopic.php?t=1219 |title=spacious@home |publisher=BOINC Confederation |access-date=2026-05-22}}&lt;/ref&gt;<br /> <br /> The project appears closely connected to astronomical data analysis initiatives associated with the Gaia mission and related astrophysical research programs.<br /> <br /> == Scientific Goals ==<br /> <br /> The primary objective of SPACIOUS@home is to support professional astronomical research through volunteer distributed computing.&lt;ref&gt;{{cite web |url=https://spaciousathome.eu/spaciousathome/ |title=SPACIOUS@home |access-date=2026-05-22}}&lt;/ref&gt; Scientific work associated with the project includes processing large astronomical datasets, performing statistical analysis on stellar catalogs, studying galactic structure, and accelerating astrophysical computations that would otherwise require substantial dedicated infrastructure.<br /> <br /> The project also contributes to public engagement in science by allowing volunteers to directly participate in active astronomical research. Through the BOINC framework, participants become part of a global computing network assisting researchers in exploring the structure and evolution of the universe.<br /> <br /> == Gaia Mission Connection ==<br /> <br /> SPACIOUS@home is closely associated with scientific efforts related to the ESA [[Gaia (spacecraft)|Gaia]] mission.&lt;ref&gt;{{cite web |url=https://spacious.ub.edu/2025/03/20/spacioushome-help-explore-the-universe-from-home/ |title=SPACIOUS@home: Help Explore the Universe from Home |publisher=SPACIOUS |access-date=2026-05-22}}&lt;/ref&gt; Gaia is one of the most ambitious astronomical mapping missions ever launched and is constructing an extremely precise three-dimensional map of the [[Wikipedia:Milky Way|Milky Way]] galaxy.<br /> <br /> The Gaia spacecraft measures stellar positions, distances, proper motions, brightness, and spectral properties for billions of stars. The resulting datasets are extraordinarily large and computationally demanding. Many calculations associated with these observations involve numerical simulations, statistical analysis, and modeling of stellar and galactic dynamics.<br /> <br /> Astronomical calculations performed by projects such as SPACIOUS@home may involve large computational problems including:<br /> <br /> &lt;math&gt;N \text{-body gravitational simulations}&lt;/math&gt;<br /> <br /> and other numerical methods used in astrophysics and stellar dynamics.<br /> <br /> Distributed computing allows these large calculations to be divided into smaller independent tasks processed simultaneously by many volunteer systems.<br /> <br /> == Operation ==<br /> <br /> SPACIOUS@home uses the [[BOINC]] middleware platform to distribute scientific workloads to volunteers. Participants install the BOINC client software on their computers and attach the system to the project servers. The client downloads work units, processes them while the computer is idle or under low usage, and returns the completed results to the project servers.<br /> <br /> This architecture allows thousands of independent systems to cooperate as a distributed scientific computing platform. Volunteer computing is especially useful for problems that can be divided into many parallel calculations.<br /> <br /> Early community reports indicated that SPACIOUS@home initially focused on Linux systems running on AMD processors.&lt;ref&gt;{{cite web |url=https://www.reddit.com/r/BOINC/comments/1ogohc3/what_is_spacioushome_about/ |title=What is spacious@home about? |website=Reddit |access-date=2026-05-22}}&lt;/ref&gt; Early applications were also reported to be CPU-only workloads without native Microsoft Windows support.&lt;ref&gt;{{cite web |url=https://www.reddit.com/r/BOINC/comments/1olrigw/new_boinc_projects_in_the_last_6_months/ |title=New BOINC projects in the last 6 months? |website=Reddit |access-date=2026-05-22}}&lt;/ref&gt; As with many BOINC projects, platform compatibility may evolve as the software matures.<br /> <br /> == Relation to Gaia@home ==<br /> <br /> SPACIOUS@home shares similarities with the earlier [[Gaia@home]] BOINC project, which also focused on computations related to Gaia mission datasets.&lt;ref&gt;{{cite web |url=https://gaiaathome.eu/ |title=gaia@home |access-date=2026-05-22}}&lt;/ref&gt;<br /> <br /> Gaia@home was developed by the Astronomical Observatory Institute at Adam Mickiewicz University in Poznań under a European Space Agency contract.&lt;ref&gt;{{cite web |url=https://gaiaathome.eu/ |title=gaia@home |access-date=2026-05-22}}&lt;/ref&gt; Both projects illustrate the increasing importance of volunteer computing within modern astronomy and large-scale astrophysical data analysis.<br /> <br /> == Volunteer Computing ==<br /> <br /> SPACIOUS@home is part of the broader tradition of volunteer computing projects supported through the BOINC infrastructure. Volunteer computing allows individuals to contribute unused computing resources toward scientific research projects operating at global scale.<br /> <br /> Projects using BOINC and related distributed computing systems have contributed to research in astronomy, climate science, medicine, mathematics, physics, biology, and artificial intelligence. Collectively, volunteer computing networks have achieved levels of computational performance comparable to some of the world's largest supercomputers.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC Official Website |publisher=University of California, Berkeley |access-date=2026-05-22}}&lt;/ref&gt;<br /> <br /> The BOINC platform itself was originally developed at the University of California, Berkeley following the success of [[SETI@home]], one of the earliest and most influential volunteer computing projects.<br /> <br /> SPACIOUS@home demonstrates how distributed computing technologies allow ordinary computer users to directly assist professional scientific research while promoting public engagement with astronomy and space science.<br /> <br /> == Community Reception ==<br /> <br /> The BOINC community has shown interest in SPACIOUS@home as one of the newer astronomy-focused volunteer computing projects launched during the 2020s.&lt;ref&gt;{{cite web |url=https://www.reddit.com/r/BOINC/comments/1ogohc3/what_is_spacioushome_about/ |title=What is spacious@home about? |website=Reddit |access-date=2026-05-22}}&lt;/ref&gt;<br /> <br /> Discussions on Reddit, BOINC forums, and community statistics websites have highlighted the project's astronomy focus, Gaia-related research objectives, and Linux-based application support.&lt;ref&gt;{{cite web |url=https://www.bc-team.org/viewtopic.php?t=1219 |title=spacious@home |publisher=BOINC Confederation |access-date=2026-05-22}}&lt;/ref&gt;<br /> <br /> SPACIOUS@home has also appeared on community-maintained lists of active BOINC projects and volunteer computing statistics services.&lt;ref&gt;{{cite web |url=https://wiki.bc-team.org/index.php?title=BOINC-Projekte%2Fen |title=BOINC Projects |publisher=BC-Wiki |access-date=2026-05-22}}&lt;/ref&gt;&lt;ref&gt;{{cite web |url=https://boincstats.org/ |title=BOINCstats |access-date=2026-05-22}}&lt;/ref&gt;<br /> <br /> == See Also ==<br /> <br /> * [[Wikipedia:BOINC|BOINC]]<br /> * [[Wikipedia:Gaia (spacecraft)|Gaia (spacecraft)]]<br /> * [[Gaia@home]]<br /> * [[SETI@home]]<br /> * [[Wikipedia:Volunteer computing|Distributed computing]]<br /> * [[Wikipedia:Citizen science|Citizen science]]<br /> <br /> == External Links ==<br /> <br /> * [https://spaciousathome.eu/spaciousathome/ Official SPACIOUS@home Website]<br /> * [https://spacious.ub.edu/2025/03/20/spacioushome-help-explore-the-universe-from-home/ SPACIOUS@home Announcement]<br /> * [https://gaiaathome.eu/ gaia@home]<br /> * [https://boinc.berkeley.edu/ BOINC Official Website]<br /> * [https://boincstats.org/ BOINCstats]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Citizen science]]<br /> [[Category:Astronomy projects]]<br /> [[Category:Astrophysics]]<br /> [[Category:Volunteer computing projects]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=BlackHoles@Home&diff=1433 2026-05-29T13:28:13Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = BlackHoles@Home<br /> | logo = Bh.png<br /> | logo caption = <br /> | screenshot = <br /> | caption = Planned volunteer computing project for numerical relativity simulations<br /> <br /> | status = Not Started<br /> | category = Astrophysics<br /> | compute = <br /> | dependencies = <br /> <br /> | developer = Etienne Research Group (Prof. Z. Etienne)<br /> | released = Not released<br /> | repository = {{URL|https://github.com/nrpy/nrpy}}<br /> <br /> | programming language = C, C++, Python (NRPy+ framework)<br /> | operating system = <br /> <br /> | stats as of = <br /> | average performance = <br /> | active users = <br /> | total users = <br /> | active hosts = <br /> | total hosts = <br /> <br /> | rac = <br /> | credit per day = <br /> | gpu performance = <br /> | cpu performance = <br /> <br /> <br /> | website = {{URL|https://blackholesathome.net/}}<br /> | license = Open-source components (NRPy+, SymPy)&lt;ref&gt;{{cite web|url=https://www.sympy.org/|title=SymPy Computer Algebra System}}&lt;/ref&gt;<br /> <br /> }}<br /> <br /> [https://blackholesathome.net/ '''''BlackHoles@Home'''''] will be a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project seeking assistance in conducting black hole collision simulations. These simulations are intended to support analysis of gravitational wave observations of merging black holes. <br /> <br /> [[File:Image.png|thumb|Numerical relativity grid structure used in modern simulations of compact binaries (illustrative).]]<br /> <br /> __TOC__<br /> <br /> == Overview ==<br /> BlackHoles@Home is a proposed [[wikipedia:Volunteer computing|volunteer distributed computing]] project aimed at performing numerical simulations of binary black hole inspirals and mergers. The project is motivated by the need for large catalogs of gravitational waveform templates used in the interpretation of gravitational wave detections.<br /> <br /> The project builds conceptually on advances in [[wikipedia:numerical relativity|numerical relativity]], the field of solving Einstein’s field equations using high-performance computation. These simulations are essential for modeling the strong-field regime of general relativity where analytic solutions are not available.<br /> [[File:Black hole collision and merger releasing gravitational waves.jpg|thumb|Black hole collision and merger releasing gravitational waves]]<br /> <br /> == Scientific Context ==<br /> The two-body problem in general relativity—such as two orbiting black holes—requires solving Einstein’s field equations numerically. Unlike the Newtonian two-body problem, these systems emit gravitational waves, carrying away energy and angular momentum, causing the objects to inspiral and eventually merge.<br /> <br /> The first direct detection of gravitational waves in 2015 by the LIGO Scientific Collaboration confirmed long-standing predictions of general relativity and marked the beginning of gravitational wave astronomy&lt;ref&gt;{{cite web|url=https://www.ligo.caltech.edu/page/detection-companion-papers|title=LIGO Scientific Collaboration – GW150914 discovery papers}}&lt;/ref&gt;.<br /> <br /> == Why BlackHoles@Home? ==<br /> Accurate gravitational waveform catalogs are required to interpret signals detected by observatories such as LIGO and Virgo. These catalogs are typically generated using supercomputer-scale numerical relativity simulations.<br /> <br /> BlackHoles@Home is intended to reduce the computational cost of such simulations by approximately an order of magnitude or more through optimized numerical grids and efficient coordinate systems.<br /> <br /> == Methods ==<br /> The proposed system relies on modern formulations of the Einstein field equations implemented in curvilinear coordinate systems, including spherical-like coordinates, which can improve computational efficiency in compact binary systems.<br /> <br /> The project is closely associated with the NRPy+ framework, an open-source symbolic code generation system that converts tensorial expressions into optimized C code using the SymPy computer algebra system&lt;ref&gt;{{cite web|url=https://github.com/nrpy/nrpy|title=NRPy+ Numerical Relativity Code Generation Framework}}&lt;/ref&gt;.<br /> <br /> NRPy+ is designed to support numerical relativity research by automating derivation and optimization of evolution equations for Einstein’s equations.<br /> <br /> == Software and Infrastructure ==<br /> If implemented, BlackHoles@Home would operate on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform, allowing volunteer computers to contribute computational resources to large-scale simulations.<br /> <br /> BOINC has been widely used in scientific distributed computing projects such as SETI@home and Einstein@Home.<br /> <br /> == Project Status ==<br /> As of its last public description, BlackHoles@Home remains a planned project and has not yet been launched as an active BOINC project. Development efforts have focused primarily on the underlying numerical relativity software stack rather than a production volunteer computing deployment.<br /> <br /> == Team and Funding ==<br /> The project is associated with Prof. Z. Etienne and the Etienne Research Group. Funding sources have included NSF grant PHY-1806596, NSF EPSCoR Grant 1458952, and NASA grants 80NSSC18K0538 and 80NSSC18K1488.<br /> <br /> == Related Work ==<br /> * [[wikipedia:Numerical relativity]]<br /> * [[wikipedia:Gravitational wave]]<br /> * [[wikipedia:LIGO Scientific Collaboration]]<br /> * [[wikipedia:BOINC]]<br /> * [[wikipedia:Einstein@Home]]<br /> <br /> == External links ==<br /> * https://blackholesathome.net/<br /> * https://github.com/nrpy/nrpy<br /> * https://boinc.berkeley.edu/<br /> <br /> == References ==<br /> &lt;references /&gt;</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=BOINC_Central&diff=1432 2026-05-29T13:26:08Z

<p>Al Piskun: Infobox update with completed Boolean</p> <hr /> <div>{{Infobox software<br /> | name = BOINC Central<br /> | logo = BOINC_central.png<br /> | screenshot =<br /> | caption =<br /> <br /> | status = Active<br /> | category = Multi-project<br /> | compute = CPU<br /> | dependencies = BUDA<br /> <br /> | developer = [[wikipedia:David P. Anderson|David P. Anderson]], [[wikipedia:University of California, Berkeley|University of California, Berkeley]] Space Sciences Laboratory<br /> | released = {{Start date and age|2021|11|26}} <br /> <br /> | completed = Boolean Chains<br /> | discontinued =<br /> | repository = <br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS, Android<br /> | size = ~50 MB<br /> <br /> | stats as of = {{Start date and age|2026|02|25}}<br /> | average performance = 5721.89 GigaFLOPS<br /> | active users = 603<br /> | total users = 953<br /> | active hosts = 1139<br /> | total hosts = 2235<br /> <br /> | rac = <br /> | credit per day = <br /> | gpu performance = <br /> | cpu performance = <br /> <br /> | website = {{URL|https://boinc.berkeley.edu/central/}}<br /> | license = Open-source software ([[wikipedia:GNU Lesser General Public License|LGPL]])<br /> }}<br /> <br /> [https://boinc.berkeley.edu/central/ '''''BOINC Central'''''] is a BOINC project. A system for '''''[[Wikipedia:Volunteer computing|volunteer computing]]''''', allowing people around the world to donate computing power to science research.<br /> <br /> == Overview ==<br /> BOINC Central gives scientists access to the power of volunteer computing without having to operate a BOINC server. It was publicly launched on '''26 November 2021'''&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/central/ |title=Welcome to BOINC Central |publisher=University of California, Berkeley |date=26 November 2021 |access-date=2026-05-18}}&lt;/ref&gt; and is operated by the [[Wikipedia:University of California, Berkeley|University of California, Berkeley]] BOINC project, under the direction of research scientist [[Wikipedia:David P. Anderson|David P. Anderson]].<br /> [[File:BOINC Manager Screenshot.jpg|thumb|The BOINC platform, which BOINC Central runs on, was originally developed to support SETI@home.]]<br /> The project is one of approximately 26 projects listed on BOINC's official roster as of early 2026.&lt;ref name=boinc-wikipedia&gt;{{cite web |url=https://en.wikipedia.org/wiki/Berkeley_Open_Infrastructure_for_Network_Computing |title=Berkeley Open Infrastructure for Network Computing |publisher=Wikipedia |access-date=2026-05-18}}&lt;/ref&gt; Unlike other BOINC projects that serve a single research team, BOINC Central acts as a '''shared scientific computing service''' – a central hub where multiple independent scientists can submit workloads without having to build or maintain their own volunteer-computing infrastructure.<br /> <br /> == Why BOINC Central? ==<br /> BOINC Central gives scientists access to the power of volunteer computing without having to operate a BOINC server.<br /> <br /> Volunteer computing provides enormous computing power to science projects, but creating and operating such a project is expensive and requires resources that most scientists lack.&lt;ref name=about&gt;{{cite web |url=https://boinc.berkeley.edu/central/about.php |title=About BOINC Central |publisher=University of California, Berkeley |access-date=2026-05-18}}&lt;/ref&gt; BOINC itself – as an open-source middleware platform – has been used by about 100 projects across medicine, molecular biology, mathematics, linguistics, climatology, environmental science, and astrophysics since its founding in 2002, collectively contributing to over 1,000 research papers.&lt;ref&gt;{{cite web |url=https://continuum-hypothesis.com/boinc_history.php |title=A brief history of BOINC |author=David P. Anderson |date=26 January 2022 |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> BOINC Central was conceived to extend those benefits to researchers who lack the funding and technical staff to run their own BOINC project, including those whose need for high-throughput computing is sporadic rather than continuous.<br /> <br /> == Goal ==<br /> The goal of BOINC Central is to make the power of volunteer computing available to all scientists, including those with little money and technical resources and those whose need for computing is sporadic.<br /> <br /> == How It Works ==<br /> <br /> === Infrastructure ===<br /> * '''BOINC Central is a BOINC project.''' The BOINC team operates its own server and maintains the project's website, so scientists do not have to.&lt;ref name=about/&gt;<br /> * '''Supported applications.''' Initially BOINC Central supported [[Wikipedia:AutoDock Vina|AutoDock Vina]] from the [[Wikipedia:Scripps Research Institute|Scripps Research Institute]], a widely used open-source program for molecular docking and virtual drug screening.&lt;ref name=about/&gt; It now also accepts any science application packaged using Docker through the BUDA framework (see below).<br /> * '''Cross-platform executables.''' The team builds application versions for a range of computing platforms: different operating systems, CPU types, and GPU types, so that volunteers' machines can participate regardless of their hardware.<br /> * '''Web-based job submission.''' Scientists from academic research institutions can submit batches of jobs using a web interface by contacting the BOINC Central team to register.&lt;ref name=about/&gt;<br /> <br /> === BUDA: BOINC Universal Docker App ===<br /> BOINC Central's newer projects use '''BUDA''' (BOINC Universal Docker App), a framework developed by the BOINC project that allows scientists to run Docker-based applications across the volunteer network.&lt;ref&gt;{{cite web |url=https://github.com/BOINC/boinc/wiki/BUDA-overview |title=BUDA overview |publisher=BOINC/GitHub |access-date=2026-05-18}}&lt;/ref&gt; With BUDA, a scientist only needs to package their Linux-based application in a Docker container and submit jobs entirely through the web interface – no knowledge of BOINC internals is required.&lt;ref&gt;{{cite web |url=https://github.com/BOINC/boinc/wiki/Computing-with-boinc |title=Computing with BOINC |publisher=BOINC/GitHub |access-date=2026-05-18}}&lt;/ref&gt; Both completed BOINC Central sub-projects – Boolean Chains and Cislunar Orbit Stability Analyzer – used BUDA.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/central/ |title=BOINC Central news |publisher=University of California, Berkeley |date=24 March 2026 |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> === Supported Science Applications ===<br /> * Any application packaged with Docker<br /> * [[Wikipedia:AutoDock Vina|AutoDock]] from the Scripps Research Institute<br /> <br /> == Sub-Projects ==<br /> BOINC Central volunteers have provided computing power to the following projects:<br /> <br /> === Boolean Chains (completed) ===<br /> '''''Boolean chains'''''<br /> <br /> My name is Oliver, I'm interested in maths, computer science, and combinatorial problems.<br /> <br /> I've been studying [https://www.informit.com/store/art-of-computer-programming-volumes-1-4b-boxed-set-9780137935109 The Art of Computer Programming] by Donald E. Knuth, working on some of the exercises and some of the open problems. In Volume 4A, chapter 7.1.2 the topic of boolean chains comes up. Basically, it's about a chain of boolean operations on some input values x_1, ..., x_n and intermediate results of those operations, such that a set of desired functions f_1, ..., f_m on those inputs can be evaluated. The goal is to make such a chain as small as possible, because that makes for small circuitry with fewer parts.<br /> <br /> One example Knuth chose is the segments of a digital display, as we know it from (somewhat dated) alarm clocks or quartz watches. The inputs are the four bits of a number 0 to 15 (we want hexadecimal digits) and the seven output functions are whether each of the segments of the display should be turned on or off for that digit.[[File:16-digits-segments-small.png|frameless|The seven-segment display problem: a classic combinatorics challenge that motivated the Boolean Chains project.|center]]<br /> <br /> My goal is to find the minimal boolean chain for this problem, hoping to come up with some new algorithms or speed improvements to make this feasible; so that similar problems can be solved in the future. I've already found shorter boolean chains with an algorithm described on the website below, but to prove it is optimal I need to do an exhaustive search. I also suspect that there still are chains that are ONE step shorter than the one I found, based on the trajectory of smaller problems already solved, but for that I also need the exhaustive search.<br /> <br /> Details of the project: https://orunge.org/boolean-chains/<br /> <br /> I've already covered a large search space with my own machine and AWS Batch, but that approach will be too costly.<br /> <br /> That's where I hope BOINC Central can help!<br /> <br /> Results can be tracked here: https://orunge.org/boolean-chains/#results-full<br /> <br /> ==== Milestones and Results ====<br /> The Boolean Chains project reached a significant milestone in May 2025: the search space for N=15, L=21 was exhausted. Over the course of the project, '''37,444,981,252,103,000 chains were generated''', consuming 2,139 days of computing time.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/central/ |title=Boolean Chains project reaches milestone |publisher=BOINC Central |date=31 May 2025 |access-date=2026-05-18}}&lt;/ref&gt; The project was subsequently completed, with volunteers having supplied the equivalent of '''450 CPU-years''' of computing power.&lt;ref name=central-news&gt;{{cite web |url=https://boinc.berkeley.edu/central/ |title=BOINC Central project updates |publisher=University of California, Berkeley |date=24 March 2026 |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> == Technical Infrastructure ==<br /> <br /> === AutoDock Vina ===<br /> [[File:Cd20.png|thumb|AutoDock Vina is used for molecular docking and virtual drug screening.]]<br /> [[Wikipedia:AutoDock Vina|AutoDock Vina]] is an open-source program for molecular docking originally designed by Dr. Oleg Trott at the Molecular Graphics Lab (now the Center for Computational Structural Biology, CCSB) at [[Wikipedia:The Scripps Research Institute|The Scripps Research Institute]].&lt;ref&gt;{{cite web |url=https://vina.scripps.edu/ |title=AutoDock Vina |publisher=The Scripps Research Institute |access-date=2026-05-18}}&lt;/ref&gt; It is one of the most widely used tools in computational drug discovery, allowing researchers to predict how small molecules (potential drug candidates) bind to protein receptors. AutoDock Vina achieves roughly a two-orders-of-magnitude speed increase over earlier versions while improving the accuracy of binding mode predictions, and leverages multithreading across CPU cores.&lt;ref&gt;{{cite journal |url=https://pmc.ncbi.nlm.nih.gov/articles/PMC3041641/ |title=AutoDock Vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization and multithreading |journal=Journal of Computational Chemistry |year=2010 |volume=31 |pages=455–461 |doi=10.1002/jcc.21334}}&lt;/ref&gt;<br /> <br /> BOINC Central's distributed infrastructure allows researchers to run large virtual screening campaigns – docking thousands of compounds against a protein target – at no cost, using computing power donated by volunteers worldwide.<br /> <br /> === The BOINC Platform ===<br /> [[File:BOINC logo.png|thumb|The BOINC logo. BOINC has been in development since 2002.]]<br /> BOINC (pronounced {{IPAc-en|b|ɔɪ|ŋ|k}}, rhyming with &quot;oink&quot;) is an open-source middleware system for volunteer computing developed at the [[Wikipedia:UC Berkeley Space Sciences Laboratory|UC Berkeley Space Sciences Laboratory]]. As of 2021 it brought together 34,236 active participants employing 136,341 active computers worldwide, processing on average 20.164 [[Wikipedia:PetaFLOPS|PetaFLOPS]] daily.&lt;ref name=boinc-wikipedia/&gt; It supports applications across medicine, molecular biology, mathematics, linguistics, climatology, environmental science, and astrophysics. BOINC Central is listed among the projects available to the Android BOINC mobile client.&lt;ref name=boinc-wikipedia/&gt;<br /> <br /> == Researchers ==<br /> {| class=&quot;wikitable&quot;<br /> ! Name !! Research interests !! Location !! Project<br /> |-<br /> | Oliver Runge || Computer science, combinatorics || Germany || Boolean Chains<br /> |-<br /> | Lezhe Gao || Astrodynamics, cislunar mechanics || (Lawrence Livermore National Laboratory) || Cislunar Orbit Stability Analyzer<br /> |}<br /> <br /> == Project Team / Sponsors ==<br /> <br /> [[wikipedia:David_P._Anderson|'''''David P. Anderson''''']]. Operated by [https://boinc.berkeley.edu/ '''''B'''erkeley '''O'''pen '''I'''nfrastructure for '''N'''etwork '''C'''omputing'']<br /> <br /> David P. Anderson is an American research scientist at the UC Berkeley Space Sciences Laboratory and an adjunct professor of computer science at the [[Wikipedia:University of Houston|University of Houston]]. He received a BA in mathematics from [[Wikipedia:Wesleyan University|Wesleyan University]] and MS and PhD degrees in mathematics and computer science from the [[Wikipedia:University of Wisconsin–Madison|University of Wisconsin–Madison]].&lt;ref&gt;{{cite encyclopedia |url=https://en.wikipedia.org/wiki/David_P._Anderson |title=David P. Anderson |encyclopedia=Wikipedia |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> Anderson has been a pioneer of volunteer computing since the mid-1990s. He co-created [[Wikipedia:SETI@home|SETI@home]] in 1995 and in 2002 founded the BOINC project, which became the world's leading platform for volunteer computing, funded by the [[Wikipedia:National Science Foundation|National Science Foundation]].&lt;ref&gt;{{cite web |url=https://en.wikipedia.org/wiki/David_P._Anderson |title=David P. Anderson – Wikipedia |access-date=2026-05-18}}&lt;/ref&gt; BOINC Central is one of his most recent initiatives to make volunteer computing accessible without technical barriers.<br /> <br /> The project is operated by and funded through the University of California, Berkeley BOINC project. BOINC itself is supported by the National Science Foundation.<br /> <br /> == How to Participate ==<br /> Volunteers can contribute computing power by:<br /> # Downloading and installing the [https://boinc.berkeley.edu/ BOINC client]<br /> # Attaching to BOINC Central using its URL: &lt;code&gt;https://boinc.berkeley.edu/central/&lt;/code&gt;<br /> # The BOINC client will automatically receive, process, and return tasks<br /> <br /> BOINC Central is listed as one of the projects compatible with the Android BOINC app. Computing preferences, credit statistics, and GPU/CPU models are managed through the BOINC Central web portal.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/central/welcome.php |title=Welcome to BOINC Central |publisher=University of California, Berkeley |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> Scientists who wish to submit workloads should [https://boinc.berkeley.edu/anderson/ contact David P. Anderson] to register.<br /> <br /> == See Also ==<br /> * [[wikipedia:Berkeley Open Infrastructure for Network Computing]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:AutoDock VinaAutoDock Vina]]<br /> * [[wikipedia:David P. Anderson|David P. Anderson]]<br /> * [[SETI@home]]<br /> * [[Einstein@Home]]<br /> * [[Rosetta@home]]<br /> * [[World Community Grid]]<br /> <br /> == External Links ==<br /> * [https://boinc.berkeley.edu/central/ BOINC Central official website]<br /> * [https://boinc.berkeley.edu/ BOINC main website]<br /> * [https://orunge.org/boolean-chains/ Boolean Chains project website]<br /> * [https://boinc.berkeley.edu/central/projects.php BOINC Central computing projects]<br /> * [https://boinc.berkeley.edu/pubs.php Publications by BOINC projects]<br /> * [https://boinc.berkeley.edu/anderson/ David P. Anderson's homepage]<br /> * [https://github.com/BOINC/boinc/wiki/BUDA-overview BUDA framework documentation]<br /> <br /> == References ==<br /> {{Reflist}}<br /> <br /> [[Category:Volunteer computing]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:University of California, Berkeley]]<br /> [[Category:Science and technology in California]]<br /> [[Category:2021 establishments in California]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=BOINC_Central&diff=1431 2026-05-29T13:19:33Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = BOINC Central<br /> | logo = BOINC_central.png<br /> | screenshot =<br /> | caption =<br /> <br /> | status = Active<br /> | category = Multi-project<br /> | compute = CPU<br /> | dependencies = BUDA<br /> <br /> | developer = [[wikipedia:David P. Anderson|David P. Anderson]], [[wikipedia:University of California, Berkeley|University of California, Berkeley]] Space Sciences Laboratory<br /> | released = {{Start date and age|2021|11|26}} <br /> <br /> | completed = No<br /> | discontinued =<br /> | repository = <br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS, Android<br /> | size = ~50 MB<br /> <br /> | stats as of = {{Start date and age|2026|02|25}}<br /> | average performance = 5721.89 GigaFLOPS<br /> | active users = 603<br /> | total users = 953<br /> | active hosts = 1139<br /> | total hosts = 2235<br /> <br /> | rac = <br /> | credit per day = <br /> | gpu performance = <br /> | cpu performance = <br /> <br /> | website = {{URL|https://boinc.berkeley.edu/central/}}<br /> | license = Open-source software ([[wikipedia:GNU Lesser General Public License|LGPL]])<br /> }}<br /> <br /> [https://boinc.berkeley.edu/central/ '''''BOINC Central'''''] is a BOINC project. A system for '''''[[Wikipedia:Volunteer computing|volunteer computing]]''''', allowing people around the world to donate computing power to science research.<br /> <br /> == Overview ==<br /> BOINC Central gives scientists access to the power of volunteer computing without having to operate a BOINC server. It was publicly launched on '''26 November 2021'''&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/central/ |title=Welcome to BOINC Central |publisher=University of California, Berkeley |date=26 November 2021 |access-date=2026-05-18}}&lt;/ref&gt; and is operated by the [[Wikipedia:University of California, Berkeley|University of California, Berkeley]] BOINC project, under the direction of research scientist [[Wikipedia:David P. Anderson|David P. Anderson]].<br /> [[File:BOINC Manager Screenshot.jpg|thumb|The BOINC platform, which BOINC Central runs on, was originally developed to support SETI@home.]]<br /> The project is one of approximately 26 projects listed on BOINC's official roster as of early 2026.&lt;ref name=boinc-wikipedia&gt;{{cite web |url=https://en.wikipedia.org/wiki/Berkeley_Open_Infrastructure_for_Network_Computing |title=Berkeley Open Infrastructure for Network Computing |publisher=Wikipedia |access-date=2026-05-18}}&lt;/ref&gt; Unlike other BOINC projects that serve a single research team, BOINC Central acts as a '''shared scientific computing service''' – a central hub where multiple independent scientists can submit workloads without having to build or maintain their own volunteer-computing infrastructure.<br /> <br /> == Why BOINC Central? ==<br /> BOINC Central gives scientists access to the power of volunteer computing without having to operate a BOINC server.<br /> <br /> Volunteer computing provides enormous computing power to science projects, but creating and operating such a project is expensive and requires resources that most scientists lack.&lt;ref name=about&gt;{{cite web |url=https://boinc.berkeley.edu/central/about.php |title=About BOINC Central |publisher=University of California, Berkeley |access-date=2026-05-18}}&lt;/ref&gt; BOINC itself – as an open-source middleware platform – has been used by about 100 projects across medicine, molecular biology, mathematics, linguistics, climatology, environmental science, and astrophysics since its founding in 2002, collectively contributing to over 1,000 research papers.&lt;ref&gt;{{cite web |url=https://continuum-hypothesis.com/boinc_history.php |title=A brief history of BOINC |author=David P. Anderson |date=26 January 2022 |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> BOINC Central was conceived to extend those benefits to researchers who lack the funding and technical staff to run their own BOINC project, including those whose need for high-throughput computing is sporadic rather than continuous.<br /> <br /> == Goal ==<br /> The goal of BOINC Central is to make the power of volunteer computing available to all scientists, including those with little money and technical resources and those whose need for computing is sporadic.<br /> <br /> == How It Works ==<br /> <br /> === Infrastructure ===<br /> * '''BOINC Central is a BOINC project.''' The BOINC team operates its own server and maintains the project's website, so scientists do not have to.&lt;ref name=about/&gt;<br /> * '''Supported applications.''' Initially BOINC Central supported [[Wikipedia:AutoDock Vina|AutoDock Vina]] from the [[Wikipedia:Scripps Research Institute|Scripps Research Institute]], a widely used open-source program for molecular docking and virtual drug screening.&lt;ref name=about/&gt; It now also accepts any science application packaged using Docker through the BUDA framework (see below).<br /> * '''Cross-platform executables.''' The team builds application versions for a range of computing platforms: different operating systems, CPU types, and GPU types, so that volunteers' machines can participate regardless of their hardware.<br /> * '''Web-based job submission.''' Scientists from academic research institutions can submit batches of jobs using a web interface by contacting the BOINC Central team to register.&lt;ref name=about/&gt;<br /> <br /> === BUDA: BOINC Universal Docker App ===<br /> BOINC Central's newer projects use '''BUDA''' (BOINC Universal Docker App), a framework developed by the BOINC project that allows scientists to run Docker-based applications across the volunteer network.&lt;ref&gt;{{cite web |url=https://github.com/BOINC/boinc/wiki/BUDA-overview |title=BUDA overview |publisher=BOINC/GitHub |access-date=2026-05-18}}&lt;/ref&gt; With BUDA, a scientist only needs to package their Linux-based application in a Docker container and submit jobs entirely through the web interface – no knowledge of BOINC internals is required.&lt;ref&gt;{{cite web |url=https://github.com/BOINC/boinc/wiki/Computing-with-boinc |title=Computing with BOINC |publisher=BOINC/GitHub |access-date=2026-05-18}}&lt;/ref&gt; Both completed BOINC Central sub-projects – Boolean Chains and Cislunar Orbit Stability Analyzer – used BUDA.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/central/ |title=BOINC Central news |publisher=University of California, Berkeley |date=24 March 2026 |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> === Supported Science Applications ===<br /> * Any application packaged with Docker<br /> * [[Wikipedia:AutoDock Vina|AutoDock]] from the Scripps Research Institute<br /> <br /> == Sub-Projects ==<br /> BOINC Central volunteers have provided computing power to the following projects:<br /> <br /> === Boolean Chains (completed) ===<br /> '''''Boolean chains'''''<br /> <br /> My name is Oliver, I'm interested in maths, computer science, and combinatorial problems.<br /> <br /> I've been studying [https://www.informit.com/store/art-of-computer-programming-volumes-1-4b-boxed-set-9780137935109 The Art of Computer Programming] by Donald E. Knuth, working on some of the exercises and some of the open problems. In Volume 4A, chapter 7.1.2 the topic of boolean chains comes up. Basically, it's about a chain of boolean operations on some input values x_1, ..., x_n and intermediate results of those operations, such that a set of desired functions f_1, ..., f_m on those inputs can be evaluated. The goal is to make such a chain as small as possible, because that makes for small circuitry with fewer parts.<br /> <br /> One example Knuth chose is the segments of a digital display, as we know it from (somewhat dated) alarm clocks or quartz watches. The inputs are the four bits of a number 0 to 15 (we want hexadecimal digits) and the seven output functions are whether each of the segments of the display should be turned on or off for that digit.[[File:16-digits-segments-small.png|frameless|The seven-segment display problem: a classic combinatorics challenge that motivated the Boolean Chains project.|center]]<br /> <br /> My goal is to find the minimal boolean chain for this problem, hoping to come up with some new algorithms or speed improvements to make this feasible; so that similar problems can be solved in the future. I've already found shorter boolean chains with an algorithm described on the website below, but to prove it is optimal I need to do an exhaustive search. I also suspect that there still are chains that are ONE step shorter than the one I found, based on the trajectory of smaller problems already solved, but for that I also need the exhaustive search.<br /> <br /> Details of the project: https://orunge.org/boolean-chains/<br /> <br /> I've already covered a large search space with my own machine and AWS Batch, but that approach will be too costly.<br /> <br /> That's where I hope BOINC Central can help!<br /> <br /> Results can be tracked here: https://orunge.org/boolean-chains/#results-full<br /> <br /> ==== Milestones and Results ====<br /> The Boolean Chains project reached a significant milestone in May 2025: the search space for N=15, L=21 was exhausted. Over the course of the project, '''37,444,981,252,103,000 chains were generated''', consuming 2,139 days of computing time.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/central/ |title=Boolean Chains project reaches milestone |publisher=BOINC Central |date=31 May 2025 |access-date=2026-05-18}}&lt;/ref&gt; The project was subsequently completed, with volunteers having supplied the equivalent of '''450 CPU-years''' of computing power.&lt;ref name=central-news&gt;{{cite web |url=https://boinc.berkeley.edu/central/ |title=BOINC Central project updates |publisher=University of California, Berkeley |date=24 March 2026 |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> == Technical Infrastructure ==<br /> <br /> === AutoDock Vina ===<br /> [[File:Cd20.png|thumb|AutoDock Vina is used for molecular docking and virtual drug screening.]]<br /> [[Wikipedia:AutoDock Vina|AutoDock Vina]] is an open-source program for molecular docking originally designed by Dr. Oleg Trott at the Molecular Graphics Lab (now the Center for Computational Structural Biology, CCSB) at [[Wikipedia:The Scripps Research Institute|The Scripps Research Institute]].&lt;ref&gt;{{cite web |url=https://vina.scripps.edu/ |title=AutoDock Vina |publisher=The Scripps Research Institute |access-date=2026-05-18}}&lt;/ref&gt; It is one of the most widely used tools in computational drug discovery, allowing researchers to predict how small molecules (potential drug candidates) bind to protein receptors. AutoDock Vina achieves roughly a two-orders-of-magnitude speed increase over earlier versions while improving the accuracy of binding mode predictions, and leverages multithreading across CPU cores.&lt;ref&gt;{{cite journal |url=https://pmc.ncbi.nlm.nih.gov/articles/PMC3041641/ |title=AutoDock Vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization and multithreading |journal=Journal of Computational Chemistry |year=2010 |volume=31 |pages=455–461 |doi=10.1002/jcc.21334}}&lt;/ref&gt;<br /> <br /> BOINC Central's distributed infrastructure allows researchers to run large virtual screening campaigns – docking thousands of compounds against a protein target – at no cost, using computing power donated by volunteers worldwide.<br /> <br /> === The BOINC Platform ===<br /> [[File:BOINC logo.png|thumb|The BOINC logo. BOINC has been in development since 2002.]]<br /> BOINC (pronounced {{IPAc-en|b|ɔɪ|ŋ|k}}, rhyming with &quot;oink&quot;) is an open-source middleware system for volunteer computing developed at the [[Wikipedia:UC Berkeley Space Sciences Laboratory|UC Berkeley Space Sciences Laboratory]]. As of 2021 it brought together 34,236 active participants employing 136,341 active computers worldwide, processing on average 20.164 [[Wikipedia:PetaFLOPS|PetaFLOPS]] daily.&lt;ref name=boinc-wikipedia/&gt; It supports applications across medicine, molecular biology, mathematics, linguistics, climatology, environmental science, and astrophysics. BOINC Central is listed among the projects available to the Android BOINC mobile client.&lt;ref name=boinc-wikipedia/&gt;<br /> <br /> == Researchers ==<br /> {| class=&quot;wikitable&quot;<br /> ! Name !! Research interests !! Location !! Project<br /> |-<br /> | Oliver Runge || Computer science, combinatorics || Germany || Boolean Chains<br /> |-<br /> | Lezhe Gao || Astrodynamics, cislunar mechanics || (Lawrence Livermore National Laboratory) || Cislunar Orbit Stability Analyzer<br /> |}<br /> <br /> == Project Team / Sponsors ==<br /> <br /> [[wikipedia:David_P._Anderson|'''''David P. Anderson''''']]. Operated by [https://boinc.berkeley.edu/ '''''B'''erkeley '''O'''pen '''I'''nfrastructure for '''N'''etwork '''C'''omputing'']<br /> <br /> David P. Anderson is an American research scientist at the UC Berkeley Space Sciences Laboratory and an adjunct professor of computer science at the [[Wikipedia:University of Houston|University of Houston]]. He received a BA in mathematics from [[Wikipedia:Wesleyan University|Wesleyan University]] and MS and PhD degrees in mathematics and computer science from the [[Wikipedia:University of Wisconsin–Madison|University of Wisconsin–Madison]].&lt;ref&gt;{{cite encyclopedia |url=https://en.wikipedia.org/wiki/David_P._Anderson |title=David P. Anderson |encyclopedia=Wikipedia |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> Anderson has been a pioneer of volunteer computing since the mid-1990s. He co-created [[Wikipedia:SETI@home|SETI@home]] in 1995 and in 2002 founded the BOINC project, which became the world's leading platform for volunteer computing, funded by the [[Wikipedia:National Science Foundation|National Science Foundation]].&lt;ref&gt;{{cite web |url=https://en.wikipedia.org/wiki/David_P._Anderson |title=David P. Anderson – Wikipedia |access-date=2026-05-18}}&lt;/ref&gt; BOINC Central is one of his most recent initiatives to make volunteer computing accessible without technical barriers.<br /> <br /> The project is operated by and funded through the University of California, Berkeley BOINC project. BOINC itself is supported by the National Science Foundation.<br /> <br /> == How to Participate ==<br /> Volunteers can contribute computing power by:<br /> # Downloading and installing the [https://boinc.berkeley.edu/ BOINC client]<br /> # Attaching to BOINC Central using its URL: &lt;code&gt;https://boinc.berkeley.edu/central/&lt;/code&gt;<br /> # The BOINC client will automatically receive, process, and return tasks<br /> <br /> BOINC Central is listed as one of the projects compatible with the Android BOINC app. Computing preferences, credit statistics, and GPU/CPU models are managed through the BOINC Central web portal.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/central/welcome.php |title=Welcome to BOINC Central |publisher=University of California, Berkeley |access-date=2026-05-18}}&lt;/ref&gt;<br /> <br /> Scientists who wish to submit workloads should [https://boinc.berkeley.edu/anderson/ contact David P. Anderson] to register.<br /> <br /> == See Also ==<br /> * [[wikipedia:Berkeley Open Infrastructure for Network Computing]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:AutoDock VinaAutoDock Vina]]<br /> * [[wikipedia:David P. Anderson|David P. Anderson]]<br /> * [[SETI@home]]<br /> * [[Einstein@Home]]<br /> * [[Rosetta@home]]<br /> * [[World Community Grid]]<br /> <br /> == External Links ==<br /> * [https://boinc.berkeley.edu/central/ BOINC Central official website]<br /> * [https://boinc.berkeley.edu/ BOINC main website]<br /> * [https://orunge.org/boolean-chains/ Boolean Chains project website]<br /> * [https://boinc.berkeley.edu/central/projects.php BOINC Central computing projects]<br /> * [https://boinc.berkeley.edu/pubs.php Publications by BOINC projects]<br /> * [https://boinc.berkeley.edu/anderson/ David P. Anderson's homepage]<br /> * [https://github.com/BOINC/boinc/wiki/BUDA-overview BUDA framework documentation]<br /> <br /> == References ==<br /> {{Reflist}}<br /> <br /> [[Category:Volunteer computing]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:University of California, Berkeley]]<br /> [[Category:Science and technology in California]]<br /> [[Category:2021 establishments in California]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=YAFU&diff=1430 2026-05-29T13:18:17Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = YAFU<br /> | logo = Yafu.jpg<br /> | logo caption = YAFU project logo<br /> | screenshot = Aliquot.png<br /> | caption = Example aliquot sequence graph related to YAFU research<br /> <br /> | status = Active<br /> | category = Mathematics, Integer factorization<br /> | compute = CPU<br /> | dependencies = BOINC<br /> <br /> | developer = yoyo<br /> | sponsor = Rechenkraft.net e.V.<br /> | maintainer = YAFU project team<br /> | released = {{Start date and age|2012|01|01}}<br /> | repository = {{URL|https://sourceforge.net/projects/yafu/}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux<br /> | size = ~10 MB<br /> <br /> | stats as of = {{Start date and age|2026|05|25}}<br /> | average performance = 18406.63 GigaFLOPS<br /> | active users = 249<br /> | total users = 3020<br /> | active hosts = 1573<br /> | total hosts = 45148<br /> <br /> | rac = <br /> | credit per day = <br /> | gpu performance = <br /> | cpu performance = <br /> <br /> | website = {{URL|https://yafu.myfirewall.org/yafu/}}<br /> | license = GNU General Public License<br /> }}<br /> <br /> [https://yafu.myfirewall.org/yafu '''''YAFU'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project based on [https://boinc.berkeley.edu/ '''''BOINC'''''] that focuses on large scale integer factorization. The project is closely associated with the study of [[wikipedia:Aliquot_sequence|'''''aliquot sequences''''']] and uses donated computing power from volunteers around the world to factor composite numbers up to approximately 149 digits in length.<br /> <br /> The project uses the [[wikipedia:Yet Another Factoring Utility|'''''YAFU''''']] integer factorization software package developed by Ben Buhrow. YAFU integrates several advanced algorithms and external mathematics libraries to automatically select the most efficient factorization method for a given composite number.&lt;ref&gt;{{cite web |url=https://sourceforge.net/projects/yafu/ |title=YAFU project page |publisher=SourceForge |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> == Why YAFU? ==<br /> <br /> Integer factorization is an important problem in computational number theory. Many unsolved mathematical questions depend on the ability to decompose very large composite integers into their prime factors. Efficient factorization methods also have practical importance in cryptography, especially in systems such as [[wikipedia:RSA_(cryptosystem)|RSA]] where security depends on the difficulty of factoring large semiprime numbers.&lt;ref&gt;{{cite book |last=Crandall |first=Richard |last2=Pomerance |first2=Carl |title=Prime Numbers: A Computational Perspective |publisher=Springer |year=2005 |isbn=9780387252827}}&lt;/ref&gt;<br /> <br /> YAFU contributes to the mathematical study of aliquot sequences, which are iterative sequences formed by repeatedly applying the sum of proper divisors function:<br /> <br /> &lt;math&gt;s(n) = \sigma(n) - n&lt;/math&gt;<br /> <br /> where &lt;math&gt;\sigma(n)&lt;/math&gt; is the divisor sum function. Beginning with an integer &lt;math&gt;n&lt;/math&gt;, each subsequent term is generated by summing all proper divisors of the previous term.<br /> <br /> Some aliquot sequences terminate at 1, some enter cycles, and others appear to grow indefinitely. Understanding their long term behavior remains an open problem in number theory.&lt;ref&gt;{{cite journal |last=Guy |first=Richard K. |title=Unsolved Problems in Number Theory |publisher=Springer |year=2004 |isbn=9780387208602}}&lt;/ref&gt;<br /> <br /> == Goal ==<br /> <br /> YAFU's primary goal is to factorize composite numbers arising from ongoing aliquot sequence calculations. The project especially targets composite cofactors up to approximately 149 digits in size in order to extend and maintain known aliquot sequences.<br /> <br /> The long term objective is to assist collaborative efforts to bring all known aliquot sequences with starting values below several million to a minimum size threshold of 140 digits or greater. This helps mathematicians determine whether sequences terminate, merge with other sequences, or continue growing.&lt;ref&gt;{{cite web |url=https://www.rechenkraft.net/aliquot/AllSeq.html |title=Current status of aliquot sequences |publisher=Rechenkraft.net |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> == History ==<br /> <br /> The YAFU BOINC project was launched by the BOINC community member known as &quot;yoyo&quot;, who has also operated several other mathematics oriented BOINC projects. The project became associated with the German distributed computing organization Rechenkraft.net e.V., which supports collaborative computational mathematics and citizen science initiatives.&lt;ref&gt;{{cite web |url=https://www.rechenkraft.net/ |title=Rechenkraft.net e.V. |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> YAFU evolved from standalone factorization work into a BOINC enabled distributed system capable of processing very large batches of integer factorization tasks using volunteer CPU resources.<br /> <br /> == Methods ==<br /> <br /> YAFU uses several advanced integer factorization algorithms depending on the size and structure of the composite number being processed. These include:<br /> <br /> * [[wikipedia:Elliptic_curve_factorization|Elliptic Curve Method]] (ECM)<br /> * [[wikipedia:Multiple_polynomial_quadratic_sieve|Multiple Polynomial Quadratic Sieve]] (MPQS)<br /> * [[wikipedia:General_number_field_sieve|General Number Field Sieve]] (GNFS)<br /> * Pollard's rho algorithm<br /> *Trial division and primality testing<br /> <br /> For a composite integer &lt;math&gt;N&lt;/math&gt;, the project seeks a decomposition of the form:<br /> <br /> &lt;math&gt;N = p_1 p_2 p_3 \cdots p_n&lt;/math&gt;<br /> <br /> where each &lt;math&gt;p_i&lt;/math&gt; is prime.<br /> <br /> The General Number Field Sieve is currently the fastest known classical algorithm for factoring very large integers and is frequently required for the most difficult YAFU work units.&lt;ref&gt;{{cite journal |last=Lenstra |first=Arjen K. |last2=Lenstra |first2=Hendrik W. |title=The Development of the Number Field Sieve |publisher=Springer |year=1993 |isbn=9783540570769}}&lt;/ref&gt;<br /> <br /> YAFU uses BOINC because integer factorization workloads can be split into many independent tasks and distributed efficiently across thousands of volunteer computers. This allows the project to achieve computational throughput far beyond what would normally be available to individual researchers or small academic teams.<br /> <br /> Unlike many GPU accelerated BOINC projects, YAFU primarily relies on CPU computation because several factorization algorithms benefit heavily from large integer arithmetic performance, memory bandwidth, and highly optimized multi precision libraries.<br /> <br /> == Volunteer computing ==<br /> <br /> [[File:Aliquot.png|alt=Aliquot sequence image|thumb|right|300px|Visualization of an aliquot sequence related to the project.]]<br /> <br /> YAFU is part of the broader BOINC ecosystem of volunteer computing projects. Volunteers install the BOINC client software and receive work units automatically from the project's servers. Completed factorization results are returned to the server and incorporated into larger aliquot sequence databases and factorization records.<br /> <br /> The project demonstrates how distributed volunteer computing can contribute to pure mathematics research without requiring centralized supercomputing infrastructure. Participants also contribute to the preservation and extension of public mathematical databases such as [[wikipedia:FactorDB|FactorDB]].&lt;ref&gt;{{cite web |url=http://factordb.com/ |title=Factor Database |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> == Project team / Sponsors ==<br /> <br /> The project is operated primarily by the BOINC developer and administrator known as &quot;yoyo&quot; with support from '''Rechenkraft.net e.V.''', a German nonprofit organization dedicated to distributed computing and scientific volunteer projects.<br /> <br /> == Scientific significance ==<br /> <br /> Aliquot sequences have been studied since the time of ancient Greek mathematics and remain an active area of research in computational number theory. YAFU contributes computational resources toward understanding several unresolved mathematical questions related to sequence termination, cyclic behavior, and unbounded growth.<br /> <br /> The project also contributes benchmark data for evaluating the performance of modern integer factorization algorithms and large scale distributed mathematics applications.<br /> <br /> == Scientific papers and related publications ==<br /> <br /> Several publications and conference papers related to BOINC, distributed computing, and integer factorization are relevant to YAFU and its computational methods:<br /> <br /> * David P. Anderson. &quot;BOINC: A System for Public Resource Computing and Storage.&quot;&lt;ref&gt;{{cite journal |last=Anderson |first=David P. |title=BOINC: A System for Public Resource Computing and Storage |journal=Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing |year=2004 |doi=10.1109/GRID.2004.14}}&lt;/ref&gt;<br /> <br /> * Arjen K. Lenstra and Hendrik W. Lenstra Jr. &quot;The Development of the Number Field Sieve.&quot;&lt;ref&gt;{{cite book |last=Lenstra |first=Arjen K. |last2=Lenstra |first2=Hendrik W. |title=The Development of the Number Field Sieve |publisher=Springer |year=1993 |isbn=9783540570769}}&lt;/ref&gt;<br /> <br /> * Richard Crandall and Carl Pomerance. &quot;Prime Numbers: A Computational Perspective.&quot;&lt;ref&gt;{{cite book |last=Crandall |first=Richard |last2=Pomerance |first2=Carl |title=Prime Numbers: A Computational Perspective |publisher=Springer |year=2005 |isbn=9780387252827}}&lt;/ref&gt;<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Aliquot_sequence|Aliquot sequence]]<br /> * [[wikipedia:Integer_factorization|Integer factorization]]<br /> * [[wikipedia:General_number_field_sieve|General Number Field Sieve]]<br /> * [[wikipedia:FactorDB|FactorDB]]<br /> * [[wikipedia:Distributed computing|Distributed computing]]<br /> <br /> == External links ==<br /> <br /> * [https://yafu.myfirewall.org/yafu/ Official YAFU project website]<br /> * [https://www.rechenkraft.net/ Rechenkraft.net e.V.]<br /> * [http://factordb.com/ FactorDB]<br /> * [https://boinc.berkeley.edu/ BOINC]<br /> * [https://sourceforge.net/projects/yafu/ YAFU source code]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> [[Category:BOINC]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Mathematics projects]]<br /> [[Category:Number theory]]<br /> [[Category:Integer factorization]]<br /> [[Category:Volunteer computing]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=RNA_World_(beta)&diff=1429 2026-05-29T13:08:35Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = RNA World (beta)<br /> | logo = Rna.png<br /> | logo caption = RNA World logo<br /> | screenshot = <br /> | caption = RNA World BOINC application screenshot<br /> <br /> | status = Inactive<br /> | category = Bioinformatics, Molecular biology, RNA research<br /> | compute = CPU<br /> | dependencies = BOINC, VirtualBox (for some applications)<br /> <br /> | developer = Rechenkraft.net e.V.<br /> | sponsor = Rechenkraft.net e.V.<br /> | maintainer = Dr. Michael H. W. Weber and the RNA World team<br /> | released = {{Start date and age|2010|01|01}}<br /> | repository = https://www.rnaworld.de/rnaworld/<br /> <br /> | programming language = C, C++, Python<br /> | operating system = Windows, Linux, macOS<br /> | size = Variable depending on work unit and VirtualBox image<br /> <br /> | website = {{URL|https://www.rnaworld.de/rnaworld/}}<br /> | license = Open source components and scientific software<br /> }}<br /> <br /> [https://www.rnaworld.de/rnaworld/ '''''RNA World (beta)'''''] is a [[wikipedia:Volunteer computing|volunteer distributed computing]] project based on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform. The project is operated by the German non profit organization Rechenkraft.net e.V. and focuses on large scale computational analysis of ribonucleic acid (RNA) molecules and RNA related biological processes.&lt;ref&gt;{{cite web |url=https://www.rnaworld.de/rnaworld/ |title=RNA World |publisher=RNA World |access-date=2026-05-26}}&lt;/ref&gt;<br /> <br /> RNA World distributes scientific calculations to Internet connected volunteer computers around the world. Participants donate unused CPU processing time to help researchers identify, analyze, classify, and model biologically important RNA structures and sequences. The project collaborates with academic institutions including the Philipps University of Marburg and the Indian Institute of Science in Bangalore.&lt;ref&gt;{{cite web |url=https://www.rechenkraft.net/wiki/RNA_World/Project_description/en |title=RNA World Project Description |publisher=Rechenkraft.net Wiki |access-date=2026-05-26}}&lt;/ref&gt;<br /> <br /> == Overview ==<br /> <br /> RNA molecules perform a wide range of biological functions beyond their traditional role as intermediaries between DNA and proteins. Modern molecular biology has shown that RNA molecules can act as enzymes, regulators, structural elements, and signaling molecules. One of the most notable examples is the ribosome, a complex ribonucleoprotein assembly responsible for protein synthesis. The catalytic core of the ribosome is itself composed primarily of RNA, making it a natural ribozyme.&lt;ref&gt;{{cite journal<br /> |last1=Steitz<br /> |first1=Thomas A.<br /> |title=A structural understanding of the dynamic ribosome machine<br /> |journal=Nature Reviews Molecular Cell Biology<br /> |year=2008<br /> |volume=9<br /> |issue=3<br /> |pages=242–253<br /> |doi=10.1038/nrm2352<br /> }}&lt;/ref&gt;<br /> <br /> The project takes its name from the [[wikipedia:RNA world|RNA world hypothesis]], a scientific theory proposing that early life on Earth may have relied primarily on RNA molecules before the evolution of DNA and proteins. In this model, RNA would have served both as genetic material and as a catalytic molecule capable of supporting primitive biochemical reactions.&lt;ref&gt;{{cite journal<br /> |last1=Gilbert<br /> |first1=Walter<br /> |title=The RNA World<br /> |journal=Nature<br /> |year=1986<br /> |volume=319<br /> |issue=6055<br /> |pages=618<br /> |doi=10.1038/319618a0<br /> }}&lt;/ref&gt;<br /> <br /> Many RNA molecules fold into complex secondary and tertiary structures governed by base pairing interactions. RNA folding predictions frequently involve thermodynamic calculations that minimize free energy. Typical RNA folding algorithms attempt to minimize:<br /> <br /> &lt;math&gt;\Delta G = \Delta H - T\Delta S&lt;/math&gt;<br /> <br /> where &lt;math&gt;\Delta G&lt;/math&gt; is the Gibbs free energy of folding, &lt;math&gt;\Delta H&lt;/math&gt; is enthalpy, &lt;math&gt;T&lt;/math&gt; is temperature, and &lt;math&gt;\Delta S&lt;/math&gt; is entropy.&lt;ref&gt;{{cite journal<br /> |last1=Mathews<br /> |first1=David H.<br /> |title=Revolutions in RNA secondary structure prediction<br /> |journal=Journal of Molecular Biology<br /> |year=2006<br /> |volume=359<br /> |issue=3<br /> |pages=526–532<br /> |doi=10.1016/j.jmb.2006.01.067<br /> }}&lt;/ref&gt;<br /> <br /> == Scientific background ==<br /> <br /> Every protein in a living cell is synthesized from a messenger RNA molecule, commonly abbreviated as mRNA. During translation, ribosomes decode the nucleotide sequence of mRNA into a corresponding amino acid sequence. RNA molecules are therefore central to nearly all known biological systems.<br /> <br /> The sequencing of the human genome revealed that only a relatively small portion of human DNA directly encodes proteins. Subsequent research demonstrated that large regions of the genome produce non coding RNAs involved in regulation, cellular differentiation, and gene expression. Among the most important classes are microRNAs (miRNAs), short RNA molecules that regulate messenger RNA stability and translation.&lt;ref&gt;{{cite journal<br /> |last1=Bartel<br /> |first1=David P.<br /> |title=MicroRNAs: genomics, biogenesis, mechanism, and function<br /> |journal=Cell<br /> |year=2004<br /> |volume=116<br /> |issue=2<br /> |pages=281–297<br /> |doi=10.1016/S0092-8674(04)00045-5<br /> }}&lt;/ref&gt;<br /> <br /> MicroRNAs are now known to play important roles in development, cancer biology, viral infection, and cellular differentiation. Misregulation of miRNA expression has been associated with many diseases including leukemia, breast cancer, and neurological disorders.&lt;ref&gt;{{cite journal<br /> |last1=Calin<br /> |first1=George A.<br /> |last2=Croce<br /> |first2=Carlo M.<br /> |title=MicroRNA signatures in human cancers<br /> |journal=Nature Reviews Cancer<br /> |year=2006<br /> |volume=6<br /> |issue=11<br /> |pages=857–866<br /> |doi=10.1038/nrc1997<br /> }}&lt;/ref&gt;<br /> <br /> == Goals ==<br /> <br /> RNA World was designed as a distributed bioinformatics platform capable of performing large scale RNA analysis using volunteer computing resources contributed by the public. Unlike conventional centralized supercomputers, the project operates as a heterogeneous distributed cluster composed of thousands of independently managed computers across multiple operating systems and hardware configurations.&lt;ref&gt;{{cite web<br /> |url=https://www.rechenkraft.net/wiki/RNA_World/Scientific_objectives<br /> |title=RNA World Scientific Objectives<br /> |publisher=Rechenkraft.net Wiki<br /> |access-date=2026-05-26<br /> }}&lt;/ref&gt;<br /> <br /> The project aims to:<br /> <br /> * identify novel non coding RNA molecules<br /> * analyze RNA sequence conservation across species<br /> * predict RNA secondary structures<br /> * support comparative genomics studies<br /> * contribute results to established RNA databases such as [[wikipedia:Rfam|Rfam]]<br /> * provide computational resources for RNA related scientific investigations<br /> <br /> One major RNA World application uses the Infernal software suite, originally developed in the laboratory of Sean Eddy. Infernal uses covariance models to identify homologous RNA sequences and conserved secondary structures in genomic datasets.&lt;ref&gt;{{cite journal<br /> |last1=Nawrocki<br /> |first1=Eric P.<br /> |last2=Eddy<br /> |first2=Sean R.<br /> |title=Infernal 1.1: 100 fold faster RNA homology searches<br /> |journal=Bioinformatics<br /> |year=2013<br /> |volume=29<br /> |issue=22<br /> |pages=2933–2935<br /> |doi=10.1093/bioinformatics/btt509<br /> }}&lt;/ref&gt;<br /> <br /> Covariance models combine sequence conservation and structural conservation into probabilistic scoring systems. The probability of a sequence alignment may be represented by:<br /> <br /> &lt;math&gt;P(S,M) = \prod_i P(s_i \mid m_i)&lt;/math&gt;<br /> <br /> where &lt;math&gt;S&lt;/math&gt; represents the observed sequence and &lt;math&gt;M&lt;/math&gt; represents the covariance model state path.<br /> <br /> == Volunteer computing ==<br /> [[File:BOINC Manager Screenshot.jpg|thumb|467x467px|BOINC Manager software used to connect to RNA World]]<br /> RNA World uses the BOINC middleware platform developed at the [[wikipedia:University of California, Berkeley|University of California, Berkeley]]. BOINC enables scientific projects to distribute computational workloads to volunteer computers connected through the Internet.&lt;ref&gt;{{cite journal<br /> |last1=Anderson<br /> |first1=David P.<br /> |title=BOINC: A System for Public Resource Computing and Storage<br /> |journal=Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing<br /> |year=2004<br /> |doi=10.1109/GRID.2004.14<br /> }}&lt;/ref&gt;<br /> <br /> Participants install the BOINC client software and attach their computers to RNA World. Work units are downloaded automatically, processed locally, and returned to the project servers upon completion.<br /> <br /> The project has historically supported Linux, Microsoft Windows, and macOS systems. Some applications additionally require [[wikipedia:Oracle VM VirtualBox|VirtualBox]] virtualization support.<br /> <br /> == VirtualBox applications ==<br /> <br /> Several RNA World applications operate within virtualized environments using VirtualBox. These applications allow researchers to deploy complex Linux based bioinformatics pipelines independent of the volunteer's host operating system.<br /> <br /> Users participating in VirtualBox based applications must ensure that hardware virtualization extensions such as AMD V or Intel VT x are enabled in the system BIOS or UEFI firmware. Older RNA World applications also depended on specific VirtualBox versions for compatibility.<br /> <br /> Some cmsearch virtual machine tasks are known for extremely long runtimes exceeding 1000 hours. Deadlines may be automatically extended by the project server.&lt;ref&gt;{{cite web<br /> |url=https://www.rechenkraft.net/wiki/RNA_World/Project_description/en<br /> |title=RNA World Project Description<br /> |publisher=Rechenkraft.net Wiki<br /> |access-date=2026-05-26<br /> }}&lt;/ref&gt;<br /> <br /> == Project organization ==<br /> <br /> RNA World was created within the Rechenkraft.net e.V. volunteer computing community and is operated entirely by volunteers. The project infrastructure, software maintenance, and scientific administration are maintained collaboratively.<br /> <br /> === Active development team ===<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Role<br /> ! Staff<br /> |-<br /> | Project manager<br /> | Dr. Michael H. W. Weber<br /> |-<br /> | Server administration<br /> | Christian Beer and Uwe Beckert<br /> |-<br /> | Software development<br /> | Christian Beer, Tilman Giese, Volker Hatzenberger, Nico Mittenzwey, Stephan Ude<br /> |-<br /> | Graphics and design<br /> | Lasse J. Kolb, Rebirther, Dr. Michael H. W. Weber<br /> |}<br /> <br /> === Former contributors ===<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Contributor<br /> ! Contribution<br /> |-<br /> | Martin Bertheau<br /> | Linux checkpointing and BOINC progress bar improvements<br /> |-<br /> | Jacques Kühl<br /> | General checkpointing mechanisms<br /> |-<br /> | Maximilian Palm<br /> | Development of the user job submission interface<br /> |-<br /> | Andre Schmitz<br /> | ARM software development<br /> |}<br /> <br /> == Scientific publications ==<br /> <br /> Research associated with RNA World has contributed to multiple peer reviewed publications in molecular biology, RNA biochemistry, and ribosome research.<br /> <br /> # Hoch, Philipp G. ''et al.'' &quot;Phenotypic characterization and complementation analysis of ''Bacillus subtilis'' 6S RNA single and double deletion mutants.&quot; ''Biochimie'' (2015). DOI: 10.1016/j.biochi.2014.12.019.<br /> # Sinha, Akesh ''et al.'' &quot;Biochemical Characterization of Pathogenic Mutations in Human Mitochondrial Methionyl tRNA Formyltransferase.&quot; ''Journal of Biological Chemistry'' (2014). DOI: 10.1074/jbc.M114.610626.<br /> # Arora, Smriti ''et al.'' &quot;Role of the Ribosomal P Site Elements of m2G966, m5C967, and the S9 C Terminal Tail in Maintenance of the Reading Frame during Translational Elongation in ''Escherichia coli''.&quot; ''Journal of Bacteriology'' (2013). DOI: 10.1128/JB.00455-13.<br /> # Arora, Smriti ''et al.'' &quot;Distinctive contributions of the ribosomal P site elements m2G966, m5C967 and the C terminal tail of the S9 protein in the fidelity of initiation of translation in ''Escherichia coli''.&quot; ''Nucleic Acids Research'' (2013). DOI: 10.1093/nar/gkt175.<br /> # Seshadri, Anuradha ''et al.'' &quot;Impact of rRNA methylations on ribosome recycling and fidelity of initiation in ''Escherichia coli''.&quot; ''Molecular Microbiology'' (2009). DOI: 10.1111/j.1365-2958.2009.06685.x.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:RNA world|RNA world hypothesis]]<br /> * [[wikipedia:Bioinformatics|Bioinformatics]]<br /> * [[wikipedia:Rfam|Rfam]]<br /> * [[wikipedia:Infernal (software)|Infernal]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> <br /> == External links ==<br /> <br /> * [https://www.rnaworld.de/rnaworld/ Official RNA World website]<br /> * [https://www.rechenkraft.net/wiki/RNA_World/Project_description/en RNA World project description]<br /> * [https://www.rechenkraft.net/ Rechenkraft.net e.V.]<br /> * [https://boinc.berkeley.edu/ BOINC]<br /> <br /> == References ==<br /> <br /> {{Reflist}}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=LHC@home&diff=1428 2026-05-29T12:33:15Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = LHC@home<br /> | logo = LHC@home_logo.png<br /> | logo caption = LHC@home project logo<br /> | screenshot = LHC@home.gif<br /> | caption = LHC@home SixTrack screensaver<br /> <br /> | status = Active<br /> | category = Particle physics<br /> | compute = CPU &amp; GPU<br /> | dependencies = [[wikipedia:VirtualBox|VirtualBox]] (for some applications), Docker (optional for Theory tasks)<br /> <br /> | developer = [[wikipedia:CERN|CERN]]<br /> | author = CERN Accelerators and Beams Department<br /> | sponsor = CERN<br /> | maintainer = LHC@home team<br /> | released = {{Start date and age|2004|09|01}}<br /> | repository = {{URL|https://github.com/cern-it}}<br /> <br /> | programming language = C, C++, Python<br /> | operating system = Windows, Linux, macOS<br /> | size = Varies by application<br /> <br /> | stats as of = {{Start date and age|2026|05|21}}<br /> | average performance = 52 TFLOPS<br /> | active users = 1260<br /> | total users = 178244<br /> | active hosts = 3633<br /> | total hosts = 577548<br /> <br /> | website = {{URL|https://lhcathome.cern.ch/lhcathome/}}<br /> | license = Mixed free software licenses<br /> }}<br /> <br /> [https://lhcathome.cern.ch/lhcathome/ '''''LHC@home'''''] is a '''[[wikipedia:Volunteer computing|volunteer distributed computing]]''' project operated by [[wikipedia:CERN|CERN]] using the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform. The project allows volunteers worldwide to donate unused computing resources to help physicists study particle physics, accelerator physics, and simulations related to the [[wikipedia:Large Hadron Collider|Large Hadron Collider]] (LHC).&lt;ref&gt;{{Cite web |url=https://lhcathome.web.cern.ch/ |title=LHC@home official website |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> == Wikipedia page ==<br /> <br /> [[wikipedia:LHC@home|LHC@home]]<br /> <br /> == History ==<br /> <br /> LHC@home was launched on 1 September 2004 as one of the earliest large-scale scientific volunteer computing projects associated with CERN.&lt;ref&gt;{{Cite web |url=https://en.wikipedia.org/wiki/LHC@home |title=LHC@home |website=Wikipedia |access-date=2026-05-21}}&lt;/ref&gt; The original application, ''SixTrack'', was created to study the long-term stability of particle beams inside the Large Hadron Collider.<br /> <br /> The project rapidly attracted thousands of volunteers shortly after launch. CERN used the distributed simulations to validate beam stability calculations and machine configurations for the LHC before its activation.&lt;ref&gt;{{Cite web |url=https://lhcathome.cern.ch/lhcathome/ |title=LHC@home |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> Over time, additional applications were added to support detector simulations and theoretical physics workloads, many of which require virtualization technologies such as VirtualBox or Docker containers.<br /> <br /> == Goal ==<br /> <br /> The primary goal of LHC@home is to assist CERN physicists with computationally intensive simulations related to particle accelerators and detector experiments.&lt;ref&gt;{{Cite web |url=https://lhcathome.web.cern.ch/ |title=Welcome to LHC@home |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> Project objectives include:<br /> <br /> * Helping design, optimize, and maintain the Large Hadron Collider<br /> * Simulating particle beam dynamics<br /> * Supporting detector experiment simulations<br /> * Comparing theoretical predictions with experimental data<br /> * Assisting research into dark matter, antimatter, and fundamental particles<br /> <br /> == Applications ==<br /> <br /> === SixTrack ===<br /> <br /> ''SixTrack'' is the original LHC@home application and performs accelerator physics simulations to analyze the stability of proton beams circulating in the LHC.&lt;ref&gt;{{Cite web |url=https://lhcathome.web.cern.ch/projects/sixtrack |title=SixTrack |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> The software was developed by physicists in CERN's Accelerators and Beams Department. Results generated by volunteers have been used to improve understanding of beam dynamics and long-term particle stability inside accelerator rings.<br /> <br /> === ATLAS ===<br /> <br /> The ''ATLAS@home'' application allows volunteers to run simulations for the [[wikipedia:ATLAS experiment|ATLAS experiment]], one of the largest particle detector experiments at CERN.&lt;ref&gt;{{Cite web |url=https://lhcathome.web.cern.ch/projects/atlas |title=ATLAS@home |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> ATLAS tasks often use virtualization through VirtualBox or native Linux execution environments.<br /> <br /> === CMS ===<br /> <br /> ''CMS@home'' supports simulations for the [[wikipedia:Compact Muon Solenoid|Compact Muon Solenoid]] experiment.&lt;ref&gt;{{Cite web |url=https://lhcathome.web.cern.ch/projects/cms |title=CMS@home |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> The application processes Monte Carlo simulation workloads and event reconstruction tasks related to proton collision data.<br /> <br /> === LHCb / Beauty ===<br /> <br /> The ''LHCb'' (Beauty) application studied the decay properties of beauty quarks and antimatter asymmetry.&lt;ref&gt;{{Cite web |url=https://lhcathome.web.cern.ch/projects/beauty |title=LHCb project page |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> [[File:CERN logo outline.svg|thumb|The &lt;bdi&gt;CERN logo – international organization which operates the world's largest particle physics laboratory&lt;/bdi&gt;]]<br /> Volunteer participation for LHCb workloads was paused indefinitely in November 2018.&lt;ref&gt;{{Cite web |url=https://lhcathome.cern.ch/lhcathome/forum_thread.php?id=4853 |title=Pausing Submission of LHCb Applications |publisher=CERN |date=2018-11-19 |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> === Test4Theory ===<br /> <br /> ''Test4Theory'' was introduced in 2011 and uses virtualization technologies to run simulations of high-energy particle collisions.&lt;ref&gt;{{Cite web |url=https://lhcathome.web.cern.ch/projects/test4theory |title=Test4Theory |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> The application uses CERNVM and later Docker-based infrastructure to provide portable scientific environments across volunteer computers.<br /> <br /> === Xtrack ===<br /> <br /> In 2025 CERN introduced the experimental ''Xtrack'' application for beta testing on the LHC@home platform.&lt;ref&gt;{{Cite web |url=https://lhcathome.cern.ch/lhcathome/ |title=LHC@home News |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> Xtrack is intended as a next-generation beam dynamics simulation framework.<br /> <br /> == Technology ==<br /> <br /> LHC@home uses the BOINC middleware platform developed at the [[wikipedia:University of California, Berkeley|University of California, Berkeley]].&lt;ref&gt;{{Cite web |url=https://boinc.berkeley.edu/ |title=BOINC |publisher=University of California, Berkeley |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> Several applications require:<br /> <br /> * Hardware virtualization support<br /> * [[wikipedia:Oracle VM VirtualBox|VirtualBox]]<br /> * Docker containers<br /> * CERNVM virtual machine images<br /> <br /> Many workloads distribute large datasets and may require several gigabytes of storage and memory.<br /> <br /> [[File:CERN LHC.jpg|thumb|The [[wikipedia:Large Hadron Collider|Large Hadron Collider]] at CERN]]<br /> <br /> == Scientific impact ==<br /> <br /> The project has contributed to accelerator optimization and detector simulations associated with the Large Hadron Collider.&lt;ref&gt;{{Cite web |url=https://home.cern/science/computing/grid/ |title=The Worldwide LHC Computing Grid |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> Volunteer computing resources supplement CERN's Worldwide LHC Computing Grid infrastructure by providing additional computational power for simulation workloads.<br /> <br /> == Community ==<br /> <br /> LHC@home maintains active message boards and volunteer discussion forums where users discuss optimization, virtualization setup, workunit availability, and troubleshooting.&lt;ref&gt;{{Cite web |url=https://lhcathome.cern.ch/lhcathome/forum_index.php |title=LHC@home forums |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> Community discussions on Reddit and BOINC forums frequently cover VirtualBox compatibility, Docker support, Linux configuration, and long-running Theory tasks.&lt;ref&gt;{{Cite web |url=https://www.reddit.com/r/BOINC/comments/1s37rrw/lhchome_constant_computation_error_unstable/ |title=LHC@home constant computation error discussion |website=Reddit |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> == Project statistics ==<br /> [[File:CERN ATLAS Detector.jpg|thumb|The [[wikipedia:ATLAS experiment|ATLAS]] detector]]<br /> As of 2024–2026, LHC@home reported approximately:&lt;ref&gt;{{Cite web |url=https://lhcathome.cern.ch/lhcathome/server_status.php |title=LHC@home server status |publisher=CERN |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> * Over 178,000 registered users<br /> * More than 577,000 participating hosts<br /> * Around 52 TFLOPS of computing performance<br /> * Thousands of active volunteer systems worldwide<br /> <br /> == Scientific publications ==<br /> [[File:CMS station.jpg|thumb|The [[wikipedia:Compact Muon Solenoid|CMS]] detector]]<br /> The following publications and papers are associated with BOINC and LHC@home:<br /> <br /> * Anderson, D.P. ''BOINC: A System for Public-Resource Computing and Storage''. Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing, 2004.<br /> * C. Aguado Sanchez et al. ''LHC@home: Distributed Computing for LHC Accelerator Design''. CERN publications.<br /> * D. P. Anderson et al. ''Public-resource computing: Volunteer computing''. Communications of the ACM.<br /> * Test4Theory collaboration papers related to volunteer cloud computing and Monte Carlo event simulation.<br /> <br /> Additional publications are listed at:<br /> * {{URL|https://boinc.berkeley.edu/pubs.php#LHC@home}}<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:CERN|CERN]]<br /> * [[wikipedia:Large Hadron Collider|Large Hadron Collider]]<br /> * [[wikipedia:ATLAS experiment|ATLAS experiment]]<br /> * [[wikipedia:Compact Muon Solenoid|CMS]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> <br /> [[File:LHC@home.gif|alt=LHC@home SixTrack 4.67 Screensaver|thumb|'''LHC@home''' SixTrack screensaver]]<br /> <br /> == External links ==<br /> <br /> * [https://lhcathome.cern.ch/lhcathome/ Official LHC@home website]<br /> * [https://lhcathome.web.cern.ch/ LHC@home information portal]<br /> * [https://lhcathome.cern.ch/lhcathome/server_status.php Server status]<br /> * [https://boinc.berkeley.edu/ BOINC]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:CERN]]<br /> [[Category:Particle physics]]<br /> [[Category:Distributed computing projects]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=BOINC_Projects:Copyrights&diff=1427 2026-05-29T12:28:00Z

<p>Al Piskun: </p> <hr /> <div>©️ Copyright &amp; Licensing<br /> &lt;div style=&quot;border:1px solid #c8ccd1; padding:1em; margin:1em 0;&quot;&gt;<br /> This wiki is an open, community‑maintained resource. Unless otherwise noted, all original text contributions are released under a permissive license so the information can be freely shared and reused.<br /> &lt;/div&gt;<br /> <br /> == Open Content ==<br /> All original written content on this wiki is released under the following license:<br /> <br /> ; '''Creative Commons Attribution–ShareAlike 4.0 International (CC BY‑SA 4.0)'''<br /> <br /> This means you are free to:<br /> <br /> Share — copy and redistribute the material<br /> <br /> Adapt — remix, transform, and build upon it<br /> <br /> As long as you:<br /> <br /> Provide attribution to this wiki<br /> <br /> Release derivative works under the same license<br /> <br /> This ensures the information remains open and accessible to everyone.<br /> <br /> == User Contributions ==<br /> By editing or contributing to this wiki, you agree that:<br /> <br /> Your contributions are released under the CC BY‑SA 4.0 license<br /> <br /> Your edits may be edited, redistributed, or removed by others<br /> <br /> You do not submit copyrighted material without permission<br /> <br /> If you contribute content from another source, you must ensure it is compatible with CC BY‑SA or in the public domain.<br /> <br /> == Images, Logos, and Media ==<br /> Not all media files on this wiki are covered by the same license.<br /> <br /> Some images may be public domain<br /> <br /> Some may be CC‑licensed<br /> <br /> Some may be copyrighted and used under fair use or project‑specific permissions<br /> <br /> Each file should include a description page indicating its license.<br /> If a file lacks licensing information, please notify the administrator.<br /> <br /> == Trademarks ==<br /> Names, logos, and trademarks of BOINC projects or organizations remain the property of their respective owners.<br /> This wiki does not claim ownership of any third‑party trademarks.<br /> <br /> == Requests for Removal or Attribution Corrections ==<br /> If you believe:<br /> <br /> Your copyrighted work was used improperly<br /> <br /> Attribution is missing or incorrect<br /> <br /> A file violates licensing terms<br /> <br /> Please contact the site administrator for prompt correction.<br /> <br /> ; Email: '''alexcollect@outlook.com'''<br /> <br /> (Replace with your preferred address if needed.)<br /> <br /> == Why Open Licensing? ==<br /> Open licensing ensures that:<br /> <br /> Knowledge about BOINC remains accessible<br /> <br /> Community contributions are preserved<br /> <br /> Future volunteers can build on existing work<br /> <br /> Documentation can be reused by other BOINC‑related sites and tools<br /> <br /> This wiki exists to support the distributed computing community, and open licensing helps keep that mission alive.</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Einstein@Home&diff=1426 2026-05-29T12:26:29Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Einstein@Home<br /> | logo = Ein.jpg<br /> | logo caption = Einstein@Home logo<br /> | screenshot = Einstein@Home.gif<br /> | caption = Einstein@Home interactive screensaver<br /> <br /> | status = Active<br /> | category = Astrophysics<br /> | compute = CPU &amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Bruce Allen<br /> | author = Bruce Allen<br /> | sponsor = Max Planck Society<br /> | maintainer = Einstein@Home team<br /> | released = {{Start date and age|2005|02|19}}<br /> | completed = No<br /> | discontinued = <br /> | repository = {{URL|https://git.ligo.org/einsteinathome}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS, Android<br /> | size = ~50 MB<br /> <br /> | stats as of = {{Start date and age|2026|05|19}}<br /> | average performance = 21 PFLOPS<br /> | active users = 14531<br /> | total users = 1061585<br /> | active hosts = 24489<br /> | total hosts = 8237726<br /> <br /> | rac = 18500000<br /> | credit per day = 950000<br /> | gpu performance = 15 PFLOPS<br /> | cpu performance = 6 PFLOPS<br /> <br /> | website = {{URL|https://einsteinathome.org/}}<br /> | license = GPL-2.0-or-later<br /> }}<br /> <br /> [https://einsteinathome.org/ '''''Einstein@Home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that needs your help to find Neutron Stars via their electromagnetic and gravitational wave emission.<br /> == Wikipedia page ==<br /> [[wikipedia:Einstein@Home|Einstein@Home]]<br /> <br /> == Why Einstein@Home? ==<br /> During a lunchtime conversation in 1999, Bruce Allen and a friend were discussing an article that they read that day in The Los Angeles Times about SETI@home. The thought occurred that this would be a great way to supply computer cycles to tackle the data analysis problem that they had, but concluded that there would be very little public interest and the topic was dropped.<br /> <br /> In 2004, the idea was revisited due to the upcoming event [[wikipedia:World_Year_of_Physics_2005|'''''World Year of Physics 2005''''']]. The American Physical Society offered publicity and volunteers and after eventually connecting with David Anderson, who spread the excitement of BOINC, Einstein@Home was launched in February of 2005. [https://www.youtube.com/watch?v=MlCz_eNWEc4&amp;t=448s]<br /> <br /> Einstein@Home was officially launched on '''February 19, 2005''' at the annual meeting of the [[wikipedia:American Physical Society|American Physical Society]], making it one of the earliest projects to run on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform.&lt;ref&gt;{{cite web|url=https://einsteinathome.org/about|title=About Einstein@Home|publisher=Einstein@Home|accessdate=2025}}&lt;/ref&gt; The project has grown enormously since then — as of December 2023, more than '''492,000 volunteers''' in '''226 countries''' had participated, and users regularly contribute approximately '''7.7 petaFLOPS''' of computational power — enough to rank Einstein@Home among the top supercomputers on the [[wikipedia:TOP500|TOP500]] list.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> <br /> Since its founding, it has become one of the four largest volunteer computing projects in the world, by any metric: number of volunteers, computing power, or peer-reviewed scientific output.&lt;ref&gt;{{cite web|url=https://www.einstein-online.info/en/spotlight/eah/|title=Einstein@Home – gravitational waves for everybody|publisher=Einstein Online|accessdate=2025}}&lt;/ref&gt;<br /> <br /> == Goal ==<br /> Einstein@Home uses the idle time of computing devices to search for weak astrophysical signals from spinning [[wikipedia:Neutron_star|'''''neutron stars''''']] (often called pulsars) using data from the LIGO gravitational-wave detectors, the MeerKAT radio telescope, the Fermi gamma-ray satellite, as well as archival data from the Arecibo radio telescope.<br /> <br /> The long-term goal is to make the first direct detections of gravitational-wave emission from spinning neutron stars. Gravitational waves were predicted by Albert Einstein a century ago, and were directly seen for the first time on September 14, 2015. This observation of gravitational waves from a pair of merging black holes opens up a new window on the universe, and ushers in a new era in astronomy.<br /> <br /> Einstein@Home volunteers have already discovered more than '''90 new neutron stars'''.&lt;ref&gt;{{cite web|url=https://www.aei.mpg.de/43575/einstein-home|title=Einstein@Home|publisher=Max Planck Institute for Gravitational Physics|accessdate=2025}}&lt;/ref&gt;<br /> [[File:Neutron Star Illustration (2002-1132-more-1).jpg|left|thumb|251x251px|Neutron Star Illustration This artist's conception illustrates 1E 1207.4-5209, a neutron star with a polar hot spot and a strong magnetic field (purple lines).]]<br /> <br /> == Methods ==<br /> Einstein@Home employs the following search methods:<br /> * [https://einsteinathome.org/de/content/gravitational-wave-searches '''''Gravitational Wave search''''']<br /> <br /> The gravitational wave emitted by a deformed spinning neutron star is very simple. It is almost perfectly monochromatic. This means that it has a single frequency (twice the rotation frequency of the neutron star). This instantaneous frequency decreases slowly over time as the spinning neutron star loses energy through the emission of gravitational (and, if it is a pulsar, electromagnetic) waves. If one were to observe the gravitational-wave emission while floating in space at rest relative to the rotating deformed neutron star, things would be easy. Finding nearly monochromatic gravitational waves in a noisy detector is straightforward: A simple Fourier analysis would quickly reveal the periodicity. But in reality, the actual search is much more complicated and computationally demanding. One of the main reasons: Our detectors are not at rest relative to the neutron star. They sit on the surface of the Earth, which rotates daily and orbits the Sun once a year: The detectors are moving relative to the neutron star. This causes a Doppler shift in the gravitational-wave frequency observed by the detectors. The strength of the Doppler effect depends on time (during a day and within a year) and on the position of the neutron star in the sky. The plot on the right shows a simulation of a continuous gravitational-wave signal received on Earth. You can observe the annual and daily Doppler effect modulations.<br /> <br /> To describe a continuous gravitational-wave signal, four different parameters are required: the sky position (two parameters, for example: right ascension and declination), the gravitational-wave frequency (one parameter), and the change of the gravitational-wave frequency over time (one parameter, usually called spin-down). To search for a faint signal in noisy detector data, long stretches of data (covering months of observations) must be analyzed. If the parameters of the signal are unknown, many different possible parameter combinations must be tested: Suppose there's a signal with a certain frequency, spin-down, and position in the sky. This combination of parameters will tell you what the expected signal would look like. Now, check the detector data for the presence of the expected signal using Fourier analysis methods. If nothing is found, try again with a different combination of parameters. Such a search requires a very large number of parameter combinations. This is because, over time, even a tiny offset in one of the parameters would cause the search to potentially miss a signal hidden in the detector noise: Assume a frequency value just a little off from the true one, and the signal will not show up in the analysis. The same holds for offsets in sky position or spin-down. To minimize the chance of missing a hidden signal, the data is very finely combed using a large number of parameter combinations.<br /> <br /> Einstein@Home conducts the most sensitive all-sky searches for continuous gravitational waves in existence. While no continuous gravitational-wave signal from a spinning neutron star has yet been detected, even non-detections carry astrophysical significance: each search sets improved upper limits on the strain amplitude from spinning neutron stars across the Milky Way.&lt;ref&gt;{{cite web|url=https://www.einstein-online.info/en/spotlight/eah/|title=Einstein@Home – gravitational waves for everybody|publisher=Einstein Online|accessdate=2025}}&lt;/ref&gt;<br /> <br /> * [https://einsteinathome.org/de/content/fgrp '''''The Fermi Gamma-ray Pulsar search''''']<br /> Finding the periodic pulsations from gamma-ray pulsars is very difficult – even more so from the very fast millisecond pulsars. On average only 10 photons per day are detected from a typical pulsar by the LAT onboard the Fermi spacecraft. To detect periodicities, years of data must be analyzed, during which the pulsar might rotate tens of billions of times. For each photon one must determine exactly when during a single milliseconds rotation period it was emitted. This requires searching over long data sets with very fine resolution in order not to miss any signals. The computing power required for these &quot;blind searches&quot; – when little to no information about the pulsar is known beforehand – is enormous.<br /> <br /> Since mid-2011, Einstein@Home has also analyzed data from the [[wikipedia:Fermi Gamma-ray Space Telescope|Fermi Gamma-ray Space Telescope]]. As of December 2023, this search has uncovered '''39 previously unknown gamma-ray pulsars'''.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|accessdate=2025}}&lt;/ref&gt; The Fermi gamma-ray discoveries include the first [[wikipedia:Millisecond pulsar|millisecond pulsar]] visible only in gamma rays — a radio-quiet object that suggests an entirely new population of pulsars may exist hidden in unidentified Fermi sources.&lt;ref&gt;{{cite web|url=https://www.aei.mpg.de/172466/einstein-home-discovers-first-millisecond-pulsar-visible-only-in-gamma-rays|title=Einstein@Home discovers first millisecond pulsar visible only in gamma rays|publisher=Max Planck Institute for Gravitational Physics|accessdate=2025}}&lt;/ref&gt;<br /> <br /> * [https://einsteinathome.org/de/science/brp '''''Radio Pulsar search''''']<br /> The search is a &quot;blind search&quot; because we do not know the exact distance, spin frequency, and orbital parameters of the radio pulsar that might be hidden in a data set. A wide range in these parameters must be searched to maximize detection probability.<br /> <br /> Interstellar space is filled with clouds of gas and dust. Some of these clouds have temperatures of about 8,000 K and contain free electrons. These clouds will disperse radio waves travelling through them, meaning that higher radio frequencies arrive earlier than lower ones. The more electrons in the gas along the line of sight, the larger this time-delay. Radio telescopes observe a wide band of radio frequencies, so this dispersion has to be corrected for. Since the exact amount of dispersion depends on the unknown distance to the pulsar and the number of electrons along this distance we correct for 628 trial values of dispersion and search each of the resulting data sets independently. This process is called &quot;dedispersion&quot; and done on the Einstein@Home servers.<br /> <br /> Since we are ignorant of the orbital parameters of the binary we have to try thousands of possible orbital templates, each corresponding to a different pattern of Doppler spinup and spindown. For each of these templates the data are corrected for the full Doppler effect of the corresponding orbit. This is the first step done on the computers attached to the project. The next step is to test whether there is a radio pulsar present in that data set on that (or a similar) orbit. This is done by using a frequency analysis (Fourier transform) that will recover the spin frequency without smearing.<br /> <br /> Because the signals of radio pulsars are not sinusoidal but pulsed, the frequency analysis will show frequency components at the fundamental frequency (the intrinsic spin frequency) and at higher harmonics (integer multiples of the fundamental frequency). Summing these components is a well-known trick in pulsar searches and significantly increases the sensitivity of the search. This summation is the last step done on the users' computers. Finally a list of the most significant candidates is reported back to the Einstein@Home servers and analyzed by the project scientists.<br /> <br /> As of December 2023, the radio pulsar search has discovered '''55 previously unknown radio pulsars'''.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|accessdate=2025}}&lt;/ref&gt;[[File:Einstein@Home.gif|alt=Einstein@Home Screensaver|thumb|&lt;small&gt;Einstein@Home interactive screensaver showing some known pulsars and the [[wikipedia:Supernova|'''''Supernova''''']] that they came from&lt;/small&gt;]]<br /> <br /> == Data Sources ==<br /> Einstein@Home draws on data from several major observatories:<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! Observatory !! Type !! Role in Einstein@Home<br /> |-<br /> | [[wikipedia:Laser Interferometer Gravitational-Wave Observatory|LIGO]] (USA) || Gravitational-wave detector || Primary source for continuous gravitational-wave searches since 2005<br /> |-<br /> | [[wikipedia:MeerKAT|MeerKAT]] (South Africa) || Radio telescope || Current source of radio pulsar survey data<br /> |-<br /> | [[wikipedia:Fermi Gamma-ray Space Telescope|Fermi LAT]] (Space) || Gamma-ray telescope || Source for gamma-ray pulsar searches since 2011<br /> |-<br /> | [[wikipedia:Arecibo Observatory|Arecibo Observatory]] (Puerto Rico) || Radio telescope (decommissioned 2020) || Archival data; site of first E@H pulsar discovery in 2010<br /> |-<br /> | [[wikipedia:Parkes Observatory|Parkes Observatory]] (Australia) || Radio telescope || Past source; site of 24-pulsar discovery (2013)<br /> |}<br /> <br /> == Technical Infrastructure ==<br /> Einstein@Home runs on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|Berkeley Open Infrastructure for Network Computing (BOINC)]] platform, originally developed at the [[wikipedia:University of California, Berkeley|University of California, Berkeley]] by David Anderson. The BOINC software is released under the [[wikipedia:GNU General Public License|GNU General Public License]] version 2.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> <br /> At any given time, Einstein@Home features approximately a dozen server machines coordinating tens of thousands of active volunteer computers. The volunteer clients download observational data, run computationally intensive analysis, and return candidate lists to the project servers for further vetting by scientists.&lt;ref&gt;{{cite web|url=https://www.einstein-online.info/en/spotlight/eah/|title=Einstein@Home – gravitational waves for everybody|publisher=Einstein Online|accessdate=2025}}&lt;/ref&gt;<br /> <br /> '''Supported platforms include:'''<br /> * Windows<br /> * macOS<br /> * Linux<br /> * Android (via the BOINC app on Google Play or the Amazon Appstore for Kindle Fire)<br /> <br /> GPU computing is also supported, and in recent years GPU-accelerated searches have been used to discover new gamma-ray pulsars in binary systems.&lt;ref&gt;{{cite web|url=https://arxiv.org/abs/2009.01513|title=Discovery of a Gamma-ray Black Widow Pulsar by GPU-accelerated Einstein@Home|publisher=arXiv|year=2020}}&lt;/ref&gt;<br /> <br /> === Screensaver ===<br /> When a task is running on a volunteer's computer, an interactive 3D [[wikipedia:screensaver|screensaver]] can be displayed that shows the region of the sky currently being analyzed, plots the positions of known pulsars, and displays the supernovae remnants from which they originated. The screensaver is included in the BOINC client and requires no additional installation. Volunteers can activate it from the Tasks tab of the BOINC Manager using the &quot;Show Graphics&quot; option.&lt;ref&gt;{{cite web|url=https://einsteinathome.org/faq|title=Frequently Asked Questions|publisher=Einstein@Home|accessdate=2025}}&lt;/ref&gt;<br /> <br /> == How to Participate ==<br /> [[File:BOINC logo.png|right|frameless|150x150px|The [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform logo. Einstein@Home runs on BOINC, originally developed at UC Berkeley.]]<br /> Joining Einstein@Home is free and requires only a few steps:<br /> <br /> # Create a free account at [https://einsteinathome.org/ einsteinathome.org]<br /> # Download and install the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] client from [https://boinc.berkeley.edu boinc.berkeley.edu]<br /> # In the BOINC Manager, select '''Tools → Add Project''', then choose Einstein@Home or enter the URL: &lt;code&gt;https://einsteinathome.org&lt;/code&gt;<br /> <br /> Your computer will automatically download work units, perform calculations, and report results back to the project when an internet connection is available. Volunteers can configure how much CPU time and memory BOINC may use, and can opt to run only when the computer is idle or plugged into power.&lt;ref&gt;{{cite web|url=https://einsteinathome.org/join/boinc|title=I'm a BOINC user|publisher=Einstein@Home|accessdate=2025}}&lt;/ref&gt;<br /> <br /> Android users can participate via the BOINC app available on the Google Play Store and the Amazon Appstore. The app computes only when the device is plugged into a power source and the battery is sufficiently charged.&lt;ref&gt;{{cite web|url=https://github.com/BOINC/boinc/wiki/Installing-on-Android|title=Installing on Android|publisher=BOINC Wiki|accessdate=2025}}&lt;/ref&gt;<br /> <br /> == Project team / Sponsor ==<br /> Einstein@Home was founded and is directed by '''Bruce Allen''' of the [[wikipedia:Max Planck Institute for Gravitational Physics|Max Planck Institute for Gravitational Physics (Albert Einstein Institute)]], Hanover, Germany, and the [[wikipedia:University of Wisconsin–Milwaukee|University of Wisconsin–Milwaukee]].<br /> <br /> Einstein@Home is a World Year of Physics 2005 and an International Year of Astronomy 2009 project. It is supported by the American Physical Society (APS), the US National Science Foundation (NSF), the Max Planck Society (MPG), and a number of international organizations.<br /> <br /> See the list of [https://einsteinathome.org/science/contributors '''''contributors''''']<br /> <br /> One in six of Einstein@Home's neutron star discoveries were made by researchers at the Max Planck Institute for Gravitational Physics.&lt;ref&gt;{{cite web|url=https://www.aei.mpg.de/43575/einstein-home|title=Einstein@Home|publisher=Max Planck Institute for Gravitational Physics|accessdate=2025}}&lt;/ref&gt;<br /> <br /> == Scientific Discoveries ==<br /> [https://einsteinathome.org/science/discoveries '''''einsteinathome.org/science/discoveries''''']<br /> <br /> Einstein@Home has achieved numerous landmark scientific discoveries since its launch:<br /> <br /> === First Pulsar Discovery by Volunteer Computing (2010) ===<br /> On '''12 August 2010''', Einstein@Home announced the discovery of '''PSR J2007+2722''', a 40.8 Hz isolated pulsar found in archival data from the [[wikipedia:Arecibo Observatory|Arecibo Observatory]] taken in February 2007. This was the first genuine astronomical discovery by any public volunteer distributed computing project.&lt;ref&gt;{{cite journal|title=Pulsar Discovery by Global Volunteer Computing|journal=Science|volume=329|pages=1305|year=2010|author=B. Knispel ''et al.''|url=https://www.science.org/doi/10.1126/science.1195253|doi=10.1126/science.1195253}}&lt;/ref&gt; The lucky volunteers whose computers identified the pulsar were Chris and Helen Colvin of Ames, Iowa, and Daniel Gebhardt of Universität Münster, Germany.<br /> <br /> PSR J2007+2722 is most likely a disrupted recycled pulsar with a characteristic spin-down age of approximately 404 million years. Its pulse profile is remarkably wide, with emission over almost the entire spin period — making it a scientifically interesting object for understanding neutron star physics.&lt;ref&gt;{{cite web|url=https://arxiv.org/abs/1303.0028|title=The Einstein@Home Search for Radio Pulsars and PSR J2007+2722 Discovery|publisher=arXiv|year=2013}}&lt;/ref&gt;<br /> <br /> === 24 New Pulsars in Parkes Multi-beam Survey (2013) ===<br /> Using the combined computing power of 200,000 volunteer PCs, Einstein@Home discovered '''24 new pulsars''' in archival data from the [[wikipedia:Parkes Observatory|CSIRO Parkes radio telescope]] in Australia. These included 18 isolated pulsars and 6 in binary systems, some with orbital periods of only a few hours. The results were published in ''The Astrophysical Journal''.&lt;ref&gt;[https://arxiv.org/abs/1302.0467]{{cite journal|title=Einstein@Home Discovery of 24 Pulsars in the Parkes Multi-beam Pulsar Survey|journal=The Astrophysical Journal|volume=774|issue=2|year=2013|author=B. Knispel ''et al.''|url=https://iopscience.iop.org/article/10.1088/0004-637X/774/2/93|doi=10.1088/0004-637X/774/2/93}}&lt;/ref&gt;<br /> <br /> === First Gamma-ray Pulsars (2013) ===<br /> On '''26 November 2013''', Einstein@Home published the first results from its Fermi data analysis: the discovery of four young gamma-ray pulsars in data from the Fermi LAT. This opened a new search channel for the project.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> <br /> === 13 New Gamma-ray Pulsars (2017) ===<br /> A large blind survey of 118 unidentified Fermi-LAT sources — a search that would have taken over 1,000 years on a single computer — was completed within one year using Einstein@Home computing power. The result: '''13 new gamma-ray pulsars''' discovered, with two spinning slower than any previously known gamma-ray pulsar, and one having experienced a &quot;glitch&quot; — a sudden unexplained change in its rotation rate. The study was published in ''The Astrophysical Journal''.&lt;ref&gt;{{cite web|url=https://phys.org/news/2017-01-einsteinhome-gamma-ray-pulsars.html|title=Distributed computing project Einstein@Home discovers 13 new gamma-ray pulsars|publisher=Phys.org|year=2017}}&lt;/ref&gt;<br /> <br /> === Double Neutron Star Binary: PSR J1913+1102 (2016) ===<br /> Einstein@Home discovered '''PSR J1913+1102''', a 27.3 ms pulsar in a 4.95-hour double neutron star binary system found in Arecibo PALFA survey data. With a total system mass of approximately 2.875 solar masses, it is among the most massive double neutron star systems known. Its relatively low eccentricity indicates an unusual formation history and provides new tests of general relativity.&lt;ref&gt;{{cite web|url=https://arxiv.org/abs/1608.08211|title=Einstein@Home Discovery of a Double-Neutron Star Binary in the PALFA Survey|publisher=arXiv|year=2016}}&lt;/ref&gt;<br /> <br /> === First Radio-Quiet Millisecond Pulsar (2018) ===<br /> Einstein@Home discovered two millisecond pulsars — '''PSR J1035−6720''' (spinning 348 times per second) and '''PSR J1744−7619''' (213 times per second) — in Fermi-LAT data. Follow-up observations with the Parkes Radio Telescope revealed that PSR J1744−7619 emits absolutely no detectable radio waves, making it the first '''radio-quiet millisecond pulsar''' ever discovered. Published in ''Science Advances''.&lt;ref&gt;{{cite journal|title=Einstein@Home discovers a radio-quiet gamma-ray millisecond pulsar|journal=Science Advances|year=2018|author=C. J. Clark ''et al.''|url=https://www.science.org/doi/10.1126/sciadv.aao7228|doi=10.1126/sciadv.aao7228}}&lt;/ref&gt;<br /> <br /> === Gamma-ray Black Widow Pulsar: PSR J1653−0158 (2020) ===<br /> Using GPU-accelerated computing power donated by Einstein@Home volunteers, scientists discovered '''PSR J1653−0158''', a 1.97 ms gamma-ray pulsar in a remarkably compact 75-minute binary orbit. This &quot;black widow&quot; pulsar had been a long-suspected source within the Fermi catalog. The discovery was made possible by novel GPU search algorithms running on volunteers' graphics cards.&lt;ref&gt;{{cite web|url=https://arxiv.org/abs/2009.01513|title=Discovery of a Gamma-ray Black Widow Pulsar by GPU-accelerated Einstein@Home|publisher=arXiv|year=2020}}&lt;/ref&gt;<br /> <br /> === Running Total ===<br /> As of late 2023–2024:<br /> * '''55''' radio pulsars discovered<br /> * '''39''' gamma-ray pulsars discovered<br /> * '''90+''' new neutron stars in total<br /> <br /> == Scientific Publications ==<br /> [https://einsteinathome.org/de/science/publications '''''einsteinathome.org/de/science/publications''''']<br /> <br /> The following is a selection of key peer-reviewed publications arising from Einstein@Home. A comprehensive list of all BOINC project publications is maintained at [https://boinc.berkeley.edu/pubs.php boinc.berkeley.edu/pubs.php].<br /> <br /> === Landmark Papers ===<br /> <br /> * '''B. Knispel et al.''' (2010). &quot;Pulsar Discovery by Global Volunteer Computing.&quot; ''Science'' 329, 1305. [https://www.science.org/doi/10.1126/science.1195253 DOI: 10.1126/science.1195253] — First astronomical discovery by a volunteer computing project (PSR J2007+2722).<br /> <br /> * '''B. Allen et al.''' (2013). &quot;The Einstein@Home Search for Radio Pulsars and PSR J2007+2722 Discovery.&quot; ''The Astrophysical Journal'' 773(2). [https://arxiv.org/pdf/1303.0028 arXiv:1303.0028] — Full description of the radio pulsar search methodology and first discovery.<br /> <br /> * '''B. Knispel et al.''' (2013). &quot;Einstein@Home Discovery of 24 Pulsars in the Parkes Multi-beam Pulsar Survey.&quot; ''The Astrophysical Journal Letters'' 774(2). [https://iopscience.iop.org/article/10.1088/0004-637X/774/2/93 DOI: 10.1088/0004-637X/774/2/93]<br /> <br /> * '''B.P. Abbott et al.''' (2017). &quot;First low-frequency Einstein@Home all-sky search for continuous gravitational waves in Advanced LIGO data.&quot; ''Physical Review D'' 96, 122004. — First Einstein@Home search of Advanced LIGO O1 data.<br /> <br /> * '''C. J. Clark et al.''' (2017). &quot;The Einstein@Home Gamma-ray Pulsar Survey I: Search Methods, Sensitivity and Discovery of New Young Gamma-ray Pulsars.&quot; ''The Astrophysical Journal''. [https://arxiv.org/abs/1611.01015 arXiv:1611.01015]<br /> <br /> * '''J. Wu et al.''' (2018). &quot;The Einstein@Home Gamma-Ray Pulsar Survey II: Source Selection, Spectral Analysis and Multi-wavelength Follow-up.&quot; [https://arxiv.org/abs/1712.05395 arXiv:1712.05395]<br /> <br /> * '''C. J. Clark et al.''' (2018). &quot;Einstein@Home Discovers a Radio-quiet Gamma-ray Millisecond Pulsar.&quot; ''Science Advances''. [https://www.science.org/doi/10.1126/sciadv.aao7228 DOI: 10.1126/sciadv.aao7228]<br /> <br /> * '''B. Knispel et al.''' (2015). &quot;Einstein@Home Discovery of a PALFA Millisecond Pulsar in an Eccentric Binary Orbit.&quot; [https://arxiv.org/abs/1504.03684 arXiv:1504.03684] — Discovery of PSR J1950+2414, a 4.3 ms pulsar in an unusually eccentric 22-day orbit.<br /> <br /> * '''L. Nieder et al.''' (2020). &quot;Discovery of a Gamma-ray Black Widow Pulsar by GPU-accelerated Einstein@Home.&quot; [https://arxiv.org/abs/2009.01513 arXiv:2009.01513] — Discovery of PSR J1653−0158 using volunteer GPU computing.<br /> <br /> * '''P. C. C. Freire et al.''' (2016). &quot;Einstein@Home Discovery of a Double-Neutron Star Binary in the PALFA Survey.&quot; [https://arxiv.org/pdf/1608.08211 arXiv:1608.08211] — Discovery of PSR J1913+1102.<br /> <br /> == Recognition and Scale ==<br /> [[File:Litecones.png|thumb|150x150px|Einstein@Home was a flagship project of the [[wikipedia:World Year of Physics 2005|World Year of Physics 2005]].]]<br /> Einstein@Home holds several notable distinctions:<br /> * It was a flagship project of the [[wikipedia:World Year of Physics 2005|World Year of Physics 2005]], an international initiative marking the centenary of Einstein's ''annus mirabilis''.<br /> * It was also an official project of the [[wikipedia:International Year of Astronomy|International Year of Astronomy 2009]].<br /> * As of December 2023, it is the '''third-most-popular active BOINC application''' by volunteer participation.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> * Its combined computing power (~7.7 petaFLOPS) would rank it among the top 105 supercomputers on the [[wikipedia:TOP500|TOP500]] list.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> * It produced the first genuine astronomical discovery by any public volunteer distributed computing project — the radio pulsar PSR J2007+2722, announced in ''Science'' in 2010.&lt;ref&gt;{{cite web|url=https://news.berkeley.edu/2010/08/13/einstein_boinc/|title=Einstein@Home's pulsar discovery proves value of volunteer computing|publisher=Berkeley News|year=2010}}&lt;/ref&gt;<br /> <br /> == External Links ==<br /> * [https://einsteinathome.org/ Official Einstein@Home website]<br /> * [https://einsteinathome.org/science/discoveries Scientific discoveries]<br /> * [https://einsteinathome.org/de/science/publications Scientific publications]<br /> * [https://einsteinathome.org/science/contributors Contributors]<br /> * [[wikipedia:Einstein@Home|Einstein@Home on Wikipedia]]<br /> * [https://boinc.berkeley.edu/pubs.php Publications by BOINC Projects (boinc.berkeley.edu)]<br /> * [https://www.aei.mpg.de/43575/einstein-home Einstein@Home at the Max Planck Institute for Gravitational Physics]<br /> * [https://www.einstein-online.info/en/spotlight/eah/ Einstein@Home – gravitational waves for everybody (Einstein Online)]<br /> <br /> == References ==<br /> {{Reflist}}<br /> <br /> [[Category:Volunteer computing projects]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Citizen science]]<br /> [[Category:Gravitational-wave astronomy]]<br /> [[Category:Pulsar]]<br /> [[Category:Neutron stars]]<br /> [[Category:BOINC projects]]<br /> [[Category:2005 establishments]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Einstein@Home&diff=1425 2026-05-29T12:24:41Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Einstein@Home<br /> | logo = Ein.jpg<br /> | logo caption = Einstein@Home logo<br /> | screenshot = Einstein@Home.gif<br /> | caption = Einstein@Home interactive screensaver<br /> <br /> | status = Active<br /> | category = Astrophysics<br /> | compute = CPU &amp; GPU<br /> | dependencies = None<br /> <br /> | developer = Bruce Allen<br /> | author = Bruce Allen<br /> | sponsor = Max Planck Society<br /> | maintainer = Einstein@Home team<br /> | released = {{Start date and age|2005|02|19}}<br /> | completed = No<br /> | discontinued = <br /> | repository = {{URL|https://git.ligo.org/einsteinathome}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS, Android<br /> | size = ~50 MB<br /> <br /> | stats as of = {{Start date and age|2026|05|19}}<br /> | average performance = 21 PFLOPS<br /> | active users = 14531<br /> | total users = 1061585<br /> | active hosts = 24489<br /> | total hosts = 8237726<br /> <br /> | rac = 18500000<br /> | credit per day = 950000<br /> | gpu performance = 15 PFLOPS<br /> | cpu performance = 6 PFLOPS<br /> <br /> | website = {{URL|https://einsteinathome.org/}}<br /> | license = GPL-2.0-or-later<br /> }}<br /> <br /> [https://einsteinathome.org/ '''''Einstein@Home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that needs your help to find Neutron Stars via their electromagnetic and gravitational wave emission.<br /> == Wikipedia page ==<br /> [[wikipedia:Einstein@Home|Einstein@Home]]<br /> <br /> == Why Einstein@Home? ==<br /> During a lunchtime conversation in 1999, Bruce Allen and a friend were discussing an article that they read that day in The Los Angeles Times about SETI@home. The thought occurred that this would be a great way to supply computer cycles to tackle the data analysis problem that they had, but concluded that there would be very little public interest and the topic was dropped.<br /> <br /> In 2004, the idea was revisited due to the upcoming event [[wikipedia:World_Year_of_Physics_2005|'''''World Year of Physics 2005''''']]. The American Physical Society offered publicity and volunteers and after eventually connecting with David Anderson, who spread the excitement of BOINC, Einstein@Home was launched in February of 2005. [https://www.youtube.com/watch?v=MlCz_eNWEc4&amp;t=448s]<br /> <br /> Einstein@Home was officially launched on '''February 19, 2005''' at the annual meeting of the [[wikipedia:American Physical Society|American Physical Society]], making it one of the earliest projects to run on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform.&lt;ref&gt;{{cite web|url=https://einsteinathome.org/about|title=About Einstein@Home|publisher=Einstein@Home|accessdate=2025}}&lt;/ref&gt; The project has grown enormously since then — as of December 2023, more than '''492,000 volunteers''' in '''226 countries''' had participated, and users regularly contribute approximately '''7.7 petaFLOPS''' of computational power — enough to rank Einstein@Home among the top supercomputers on the [[wikipedia:TOP500|TOP500]] list.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> <br /> Since its founding, it has become one of the four largest volunteer computing projects in the world, by any metric: number of volunteers, computing power, or peer-reviewed scientific output.&lt;ref&gt;{{cite web|url=https://www.einstein-online.info/en/spotlight/eah/|title=Einstein@Home – gravitational waves for everybody|publisher=Einstein Online|accessdate=2025}}&lt;/ref&gt;<br /> <br /> == Goal ==<br /> Einstein@Home uses the idle time of computing devices to search for weak astrophysical signals from spinning [[wikipedia:Neutron_star|'''''neutron stars''''']] (often called pulsars) using data from the LIGO gravitational-wave detectors, the MeerKAT radio telescope, the Fermi gamma-ray satellite, as well as archival data from the Arecibo radio telescope.<br /> <br /> The long-term goal is to make the first direct detections of gravitational-wave emission from spinning neutron stars. Gravitational waves were predicted by Albert Einstein a century ago, and were directly seen for the first time on September 14, 2015. This observation of gravitational waves from a pair of merging black holes opens up a new window on the universe, and ushers in a new era in astronomy.<br /> <br /> Einstein@Home volunteers have already discovered more than '''90 new neutron stars'''.&lt;ref&gt;{{cite web|url=https://www.aei.mpg.de/43575/einstein-home|title=Einstein@Home|publisher=Max Planck Institute for Gravitational Physics|accessdate=2025}}&lt;/ref&gt;<br /> [[File:Neutron Star Illustration (2002-1132-more-1).jpg|left|thumb|251x251px|Neutron Star Illustration This artist's conception illustrates 1E 1207.4-5209, a neutron star with a polar hot spot and a strong magnetic field (purple lines).]]<br /> <br /> == Methods ==<br /> Einstein@Home employs the following search methods:<br /> * [https://einsteinathome.org/de/content/gravitational-wave-searches '''''Gravitational Wave search''''']<br /> <br /> The gravitational wave emitted by a deformed spinning neutron star is very simple. It is almost perfectly monochromatic. This means that it has a single frequency (twice the rotation frequency of the neutron star). This instantaneous frequency decreases slowly over time as the spinning neutron star loses energy through the emission of gravitational (and, if it is a pulsar, electromagnetic) waves. If one were to observe the gravitational-wave emission while floating in space at rest relative to the rotating deformed neutron star, things would be easy. Finding nearly monochromatic gravitational waves in a noisy detector is straightforward: A simple Fourier analysis would quickly reveal the periodicity. But in reality, the actual search is much more complicated and computationally demanding. One of the main reasons: Our detectors are not at rest relative to the neutron star. They sit on the surface of the Earth, which rotates daily and orbits the Sun once a year: The detectors are moving relative to the neutron star. This causes a Doppler shift in the gravitational-wave frequency observed by the detectors. The strength of the Doppler effect depends on time (during a day and within a year) and on the position of the neutron star in the sky. The plot on the right shows a simulation of a continuous gravitational-wave signal received on Earth. You can observe the annual and daily Doppler effect modulations.<br /> <br /> To describe a continuous gravitational-wave signal, four different parameters are required: the sky position (two parameters, for example: right ascension and declination), the gravitational-wave frequency (one parameter), and the change of the gravitational-wave frequency over time (one parameter, usually called spin-down). To search for a faint signal in noisy detector data, long stretches of data (covering months of observations) must be analyzed. If the parameters of the signal are unknown, many different possible parameter combinations must be tested: Suppose there's a signal with a certain frequency, spin-down, and position in the sky. This combination of parameters will tell you what the expected signal would look like. Now, check the detector data for the presence of the expected signal using Fourier analysis methods. If nothing is found, try again with a different combination of parameters. Such a search requires a very large number of parameter combinations. This is because, over time, even a tiny offset in one of the parameters would cause the search to potentially miss a signal hidden in the detector noise: Assume a frequency value just a little off from the true one, and the signal will not show up in the analysis. The same holds for offsets in sky position or spin-down. To minimize the chance of missing a hidden signal, the data is very finely combed using a large number of parameter combinations.<br /> <br /> Einstein@Home conducts the most sensitive all-sky searches for continuous gravitational waves in existence. While no continuous gravitational-wave signal from a spinning neutron star has yet been detected, even non-detections carry astrophysical significance: each search sets improved upper limits on the strain amplitude from spinning neutron stars across the Milky Way.&lt;ref&gt;{{cite web|url=https://www.einstein-online.info/en/spotlight/eah/|title=Einstein@Home – gravitational waves for everybody|publisher=Einstein Online|accessdate=2025}}&lt;/ref&gt;<br /> <br /> * [https://einsteinathome.org/de/content/fgrp '''''The Fermi Gamma-ray Pulsar search''''']<br /> Finding the periodic pulsations from gamma-ray pulsars is very difficult – even more so from the very fast millisecond pulsars. On average only 10 photons per day are detected from a typical pulsar by the LAT onboard the Fermi spacecraft. To detect periodicities, years of data must be analyzed, during which the pulsar might rotate tens of billions of times. For each photon one must determine exactly when during a single milliseconds rotation period it was emitted. This requires searching over long data sets with very fine resolution in order not to miss any signals. The computing power required for these &quot;blind searches&quot; – when little to no information about the pulsar is known beforehand – is enormous.<br /> <br /> Since mid-2011, Einstein@Home has also analyzed data from the [[wikipedia:Fermi Gamma-ray Space Telescope|Fermi Gamma-ray Space Telescope]]. As of December 2023, this search has uncovered '''39 previously unknown gamma-ray pulsars'''.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|accessdate=2025}}&lt;/ref&gt; The Fermi gamma-ray discoveries include the first [[wikipedia:Millisecond pulsar|millisecond pulsar]] visible only in gamma rays — a radio-quiet object that suggests an entirely new population of pulsars may exist hidden in unidentified Fermi sources.&lt;ref&gt;{{cite web|url=https://www.aei.mpg.de/172466/einstein-home-discovers-first-millisecond-pulsar-visible-only-in-gamma-rays|title=Einstein@Home discovers first millisecond pulsar visible only in gamma rays|publisher=Max Planck Institute for Gravitational Physics|accessdate=2025}}&lt;/ref&gt;<br /> <br /> * [https://einsteinathome.org/de/science/brp '''''Radio Pulsar search''''']<br /> The search is a &quot;blind search&quot; because we do not know the exact distance, spin frequency, and orbital parameters of the radio pulsar that might be hidden in a data set. A wide range in these parameters must be searched to maximize detection probability.<br /> <br /> Interstellar space is filled with clouds of gas and dust. Some of these clouds have temperatures of about 8,000 K and contain free electrons. These clouds will disperse radio waves travelling through them, meaning that higher radio frequencies arrive earlier than lower ones. The more electrons in the gas along the line of sight, the larger this time-delay. Radio telescopes observe a wide band of radio frequencies, so this dispersion has to be corrected for. Since the exact amount of dispersion depends on the unknown distance to the pulsar and the number of electrons along this distance we correct for 628 trial values of dispersion and search each of the resulting data sets independently. This process is called &quot;dedispersion&quot; and done on the Einstein@Home servers.<br /> <br /> Since we are ignorant of the orbital parameters of the binary we have to try thousands of possible orbital templates, each corresponding to a different pattern of Doppler spinup and spindown. For each of these templates the data are corrected for the full Doppler effect of the corresponding orbit. This is the first step done on the computers attached to the project. The next step is to test whether there is a radio pulsar present in that data set on that (or a similar) orbit. This is done by using a frequency analysis (Fourier transform) that will recover the spin frequency without smearing.<br /> <br /> Because the signals of radio pulsars are not sinusoidal but pulsed, the frequency analysis will show frequency components at the fundamental frequency (the intrinsic spin frequency) and at higher harmonics (integer multiples of the fundamental frequency). Summing these components is a well-known trick in pulsar searches and significantly increases the sensitivity of the search. This summation is the last step done on the users' computers. Finally a list of the most significant candidates is reported back to the Einstein@Home servers and analyzed by the project scientists.<br /> <br /> As of December 2023, the radio pulsar search has discovered '''55 previously unknown radio pulsars'''.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|accessdate=2025}}&lt;/ref&gt;[[File:Einstein@Home.gif|alt=Einstein@Home Screensaver|thumb|&lt;small&gt;Einstein@Home interactive screensaver showing some known pulsars and the [[wikipedia:Supernova|'''''Supernova''''']] that they came from&lt;/small&gt;]]<br /> <br /> == Data Sources ==<br /> Einstein@Home draws on data from several major observatories:<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! Observatory !! Type !! Role in Einstein@Home<br /> |-<br /> | [[wikipedia:Laser Interferometer Gravitational-Wave Observatory|LIGO]] (USA) || Gravitational-wave detector || Primary source for continuous gravitational-wave searches since 2005<br /> |-<br /> | [[wikipedia:MeerKAT|MeerKAT]] (South Africa) || Radio telescope || Current source of radio pulsar survey data<br /> |-<br /> | [[wikipedia:Fermi Gamma-ray Space Telescope|Fermi LAT]] (Space) || Gamma-ray telescope || Source for gamma-ray pulsar searches since 2011<br /> |-<br /> | [[wikipedia:Arecibo Observatory|Arecibo Observatory]] (Puerto Rico) || Radio telescope (decommissioned 2020) || Archival data; site of first E@H pulsar discovery in 2010<br /> |-<br /> | [[wikipedia:Parkes Observatory|Parkes Observatory]] (Australia) || Radio telescope || Past source; site of 24-pulsar discovery (2013)<br /> |}<br /> <br /> == Technical Infrastructure ==<br /> Einstein@Home runs on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|Berkeley Open Infrastructure for Network Computing (BOINC)]] platform, originally developed at the [[wikipedia:University of California, Berkeley|University of California, Berkeley]] by David Anderson. The BOINC software is released under the [[wikipedia:GNU General Public License|GNU General Public License]] version 2.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> <br /> At any given time, Einstein@Home features approximately a dozen server machines coordinating tens of thousands of active volunteer computers. The volunteer clients download observational data, run computationally intensive analysis, and return candidate lists to the project servers for further vetting by scientists.&lt;ref&gt;{{cite web|url=https://www.einstein-online.info/en/spotlight/eah/|title=Einstein@Home – gravitational waves for everybody|publisher=Einstein Online|accessdate=2025}}&lt;/ref&gt;<br /> <br /> '''Supported platforms include:'''<br /> * Windows<br /> * macOS<br /> * Linux<br /> * Android (via the BOINC app on Google Play or the Amazon Appstore for Kindle Fire)<br /> <br /> GPU computing is also supported, and in recent years GPU-accelerated searches have been used to discover new gamma-ray pulsars in binary systems.&lt;ref&gt;{{cite web|url=https://arxiv.org/abs/2009.01513|title=Discovery of a Gamma-ray Black Widow Pulsar by GPU-accelerated Einstein@Home|publisher=arXiv|year=2020}}&lt;/ref&gt;<br /> <br /> === Screensaver ===<br /> When a task is running on a volunteer's computer, an interactive 3D [[wikipedia:screensaver|screensaver]] can be displayed that shows the region of the sky currently being analyzed, plots the positions of known pulsars, and displays the supernovae remnants from which they originated. The screensaver is included in the BOINC client and requires no additional installation. Volunteers can activate it from the Tasks tab of the BOINC Manager using the &quot;Show Graphics&quot; option.&lt;ref&gt;{{cite web|url=https://einsteinathome.org/faq|title=Frequently Asked Questions|publisher=Einstein@Home|accessdate=2025}}&lt;/ref&gt;<br /> <br /> == How to Participate ==<br /> [[File:BOINC logo.png|thumb|150x150px|The [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform logo. Einstein@Home runs on BOINC, originally developed at UC Berkeley.]]<br /> <br /> Joining Einstein@Home is free and requires only a few steps:<br /> <br /> # Create a free account at [https://einsteinathome.org/ einsteinathome.org]<br /> # Download and install the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] client from [https://boinc.berkeley.edu boinc.berkeley.edu]<br /> # In the BOINC Manager, select '''Tools → Add Project''', then choose Einstein@Home or enter the URL: &lt;code&gt;https://einsteinathome.org&lt;/code&gt;<br /> <br /> Your computer will automatically download work units, perform calculations, and report results back to the project when an internet connection is available. Volunteers can configure how much CPU time and memory BOINC may use, and can opt to run only when the computer is idle or plugged into power.&lt;ref&gt;{{cite web|url=https://einsteinathome.org/join/boinc|title=I'm a BOINC user|publisher=Einstein@Home|accessdate=2025}}&lt;/ref&gt;<br /> <br /> Android users can participate via the BOINC app available on the Google Play Store and the Amazon Appstore. The app computes only when the device is plugged into a power source and the battery is sufficiently charged.&lt;ref&gt;{{cite web|url=https://github.com/BOINC/boinc/wiki/Installing-on-Android|title=Installing on Android|publisher=BOINC Wiki|accessdate=2025}}&lt;/ref&gt;<br /> <br /> == Project team / Sponsor ==<br /> Einstein@Home was founded and is directed by '''Bruce Allen''' of the [[wikipedia:Max Planck Institute for Gravitational Physics|Max Planck Institute for Gravitational Physics (Albert Einstein Institute)]], Hanover, Germany, and the [[wikipedia:University of Wisconsin–Milwaukee|University of Wisconsin–Milwaukee]].<br /> <br /> Einstein@Home is a World Year of Physics 2005 and an International Year of Astronomy 2009 project. It is supported by the American Physical Society (APS), the US National Science Foundation (NSF), the Max Planck Society (MPG), and a number of international organizations.<br /> <br /> See the list of [https://einsteinathome.org/science/contributors '''''contributors''''']<br /> <br /> One in six of Einstein@Home's neutron star discoveries were made by researchers at the Max Planck Institute for Gravitational Physics.&lt;ref&gt;{{cite web|url=https://www.aei.mpg.de/43575/einstein-home|title=Einstein@Home|publisher=Max Planck Institute for Gravitational Physics|accessdate=2025}}&lt;/ref&gt;<br /> <br /> == Scientific Discoveries ==<br /> [https://einsteinathome.org/science/discoveries '''''einsteinathome.org/science/discoveries''''']<br /> <br /> Einstein@Home has achieved numerous landmark scientific discoveries since its launch:<br /> <br /> === First Pulsar Discovery by Volunteer Computing (2010) ===<br /> On '''12 August 2010''', Einstein@Home announced the discovery of '''PSR J2007+2722''', a 40.8 Hz isolated pulsar found in archival data from the [[wikipedia:Arecibo Observatory|Arecibo Observatory]] taken in February 2007. This was the first genuine astronomical discovery by any public volunteer distributed computing project.&lt;ref&gt;{{cite journal|title=Pulsar Discovery by Global Volunteer Computing|journal=Science|volume=329|pages=1305|year=2010|author=B. Knispel ''et al.''|url=https://www.science.org/doi/10.1126/science.1195253|doi=10.1126/science.1195253}}&lt;/ref&gt; The lucky volunteers whose computers identified the pulsar were Chris and Helen Colvin of Ames, Iowa, and Daniel Gebhardt of Universität Münster, Germany.<br /> <br /> PSR J2007+2722 is most likely a disrupted recycled pulsar with a characteristic spin-down age of approximately 404 million years. Its pulse profile is remarkably wide, with emission over almost the entire spin period — making it a scientifically interesting object for understanding neutron star physics.&lt;ref&gt;{{cite web|url=https://arxiv.org/abs/1303.0028|title=The Einstein@Home Search for Radio Pulsars and PSR J2007+2722 Discovery|publisher=arXiv|year=2013}}&lt;/ref&gt;<br /> <br /> === 24 New Pulsars in Parkes Multi-beam Survey (2013) ===<br /> Using the combined computing power of 200,000 volunteer PCs, Einstein@Home discovered '''24 new pulsars''' in archival data from the [[wikipedia:Parkes Observatory|CSIRO Parkes radio telescope]] in Australia. These included 18 isolated pulsars and 6 in binary systems, some with orbital periods of only a few hours. The results were published in ''The Astrophysical Journal''.&lt;ref&gt;[https://arxiv.org/abs/1302.0467]{{cite journal|title=Einstein@Home Discovery of 24 Pulsars in the Parkes Multi-beam Pulsar Survey|journal=The Astrophysical Journal|volume=774|issue=2|year=2013|author=B. Knispel ''et al.''|url=https://iopscience.iop.org/article/10.1088/0004-637X/774/2/93|doi=10.1088/0004-637X/774/2/93}}&lt;/ref&gt;<br /> <br /> === First Gamma-ray Pulsars (2013) ===<br /> On '''26 November 2013''', Einstein@Home published the first results from its Fermi data analysis: the discovery of four young gamma-ray pulsars in data from the Fermi LAT. This opened a new search channel for the project.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> <br /> === 13 New Gamma-ray Pulsars (2017) ===<br /> A large blind survey of 118 unidentified Fermi-LAT sources — a search that would have taken over 1,000 years on a single computer — was completed within one year using Einstein@Home computing power. The result: '''13 new gamma-ray pulsars''' discovered, with two spinning slower than any previously known gamma-ray pulsar, and one having experienced a &quot;glitch&quot; — a sudden unexplained change in its rotation rate. The study was published in ''The Astrophysical Journal''.&lt;ref&gt;{{cite web|url=https://phys.org/news/2017-01-einsteinhome-gamma-ray-pulsars.html|title=Distributed computing project Einstein@Home discovers 13 new gamma-ray pulsars|publisher=Phys.org|year=2017}}&lt;/ref&gt;<br /> <br /> === Double Neutron Star Binary: PSR J1913+1102 (2016) ===<br /> Einstein@Home discovered '''PSR J1913+1102''', a 27.3 ms pulsar in a 4.95-hour double neutron star binary system found in Arecibo PALFA survey data. With a total system mass of approximately 2.875 solar masses, it is among the most massive double neutron star systems known. Its relatively low eccentricity indicates an unusual formation history and provides new tests of general relativity.&lt;ref&gt;{{cite web|url=https://arxiv.org/abs/1608.08211|title=Einstein@Home Discovery of a Double-Neutron Star Binary in the PALFA Survey|publisher=arXiv|year=2016}}&lt;/ref&gt;<br /> <br /> === First Radio-Quiet Millisecond Pulsar (2018) ===<br /> Einstein@Home discovered two millisecond pulsars — '''PSR J1035−6720''' (spinning 348 times per second) and '''PSR J1744−7619''' (213 times per second) — in Fermi-LAT data. Follow-up observations with the Parkes Radio Telescope revealed that PSR J1744−7619 emits absolutely no detectable radio waves, making it the first '''radio-quiet millisecond pulsar''' ever discovered. Published in ''Science Advances''.&lt;ref&gt;{{cite journal|title=Einstein@Home discovers a radio-quiet gamma-ray millisecond pulsar|journal=Science Advances|year=2018|author=C. J. Clark ''et al.''|url=https://www.science.org/doi/10.1126/sciadv.aao7228|doi=10.1126/sciadv.aao7228}}&lt;/ref&gt;<br /> <br /> === Gamma-ray Black Widow Pulsar: PSR J1653−0158 (2020) ===<br /> Using GPU-accelerated computing power donated by Einstein@Home volunteers, scientists discovered '''PSR J1653−0158''', a 1.97 ms gamma-ray pulsar in a remarkably compact 75-minute binary orbit. This &quot;black widow&quot; pulsar had been a long-suspected source within the Fermi catalog. The discovery was made possible by novel GPU search algorithms running on volunteers' graphics cards.&lt;ref&gt;{{cite web|url=https://arxiv.org/abs/2009.01513|title=Discovery of a Gamma-ray Black Widow Pulsar by GPU-accelerated Einstein@Home|publisher=arXiv|year=2020}}&lt;/ref&gt;<br /> <br /> === Running Total ===<br /> As of late 2023–2024:<br /> * '''55''' radio pulsars discovered<br /> * '''39''' gamma-ray pulsars discovered<br /> * '''90+''' new neutron stars in total<br /> <br /> == Scientific Publications ==<br /> [https://einsteinathome.org/de/science/publications '''''einsteinathome.org/de/science/publications''''']<br /> <br /> The following is a selection of key peer-reviewed publications arising from Einstein@Home. A comprehensive list of all BOINC project publications is maintained at [https://boinc.berkeley.edu/pubs.php boinc.berkeley.edu/pubs.php].<br /> <br /> === Landmark Papers ===<br /> <br /> * '''B. Knispel et al.''' (2010). &quot;Pulsar Discovery by Global Volunteer Computing.&quot; ''Science'' 329, 1305. [https://www.science.org/doi/10.1126/science.1195253 DOI: 10.1126/science.1195253] — First astronomical discovery by a volunteer computing project (PSR J2007+2722).<br /> <br /> * '''B. Allen et al.''' (2013). &quot;The Einstein@Home Search for Radio Pulsars and PSR J2007+2722 Discovery.&quot; ''The Astrophysical Journal'' 773(2). [https://arxiv.org/pdf/1303.0028 arXiv:1303.0028] — Full description of the radio pulsar search methodology and first discovery.<br /> <br /> * '''B. Knispel et al.''' (2013). &quot;Einstein@Home Discovery of 24 Pulsars in the Parkes Multi-beam Pulsar Survey.&quot; ''The Astrophysical Journal Letters'' 774(2). [https://iopscience.iop.org/article/10.1088/0004-637X/774/2/93 DOI: 10.1088/0004-637X/774/2/93]<br /> <br /> * '''B.P. Abbott et al.''' (2017). &quot;First low-frequency Einstein@Home all-sky search for continuous gravitational waves in Advanced LIGO data.&quot; ''Physical Review D'' 96, 122004. — First Einstein@Home search of Advanced LIGO O1 data.<br /> <br /> * '''C. J. Clark et al.''' (2017). &quot;The Einstein@Home Gamma-ray Pulsar Survey I: Search Methods, Sensitivity and Discovery of New Young Gamma-ray Pulsars.&quot; ''The Astrophysical Journal''. [https://arxiv.org/abs/1611.01015 arXiv:1611.01015]<br /> <br /> * '''J. Wu et al.''' (2018). &quot;The Einstein@Home Gamma-Ray Pulsar Survey II: Source Selection, Spectral Analysis and Multi-wavelength Follow-up.&quot; [https://arxiv.org/abs/1712.05395 arXiv:1712.05395]<br /> <br /> * '''C. J. Clark et al.''' (2018). &quot;Einstein@Home Discovers a Radio-quiet Gamma-ray Millisecond Pulsar.&quot; ''Science Advances''. [https://www.science.org/doi/10.1126/sciadv.aao7228 DOI: 10.1126/sciadv.aao7228]<br /> <br /> * '''B. Knispel et al.''' (2015). &quot;Einstein@Home Discovery of a PALFA Millisecond Pulsar in an Eccentric Binary Orbit.&quot; [https://arxiv.org/abs/1504.03684 arXiv:1504.03684] — Discovery of PSR J1950+2414, a 4.3 ms pulsar in an unusually eccentric 22-day orbit.<br /> <br /> * '''L. Nieder et al.''' (2020). &quot;Discovery of a Gamma-ray Black Widow Pulsar by GPU-accelerated Einstein@Home.&quot; [https://arxiv.org/abs/2009.01513 arXiv:2009.01513] — Discovery of PSR J1653−0158 using volunteer GPU computing.<br /> <br /> * '''P. C. C. Freire et al.''' (2016). &quot;Einstein@Home Discovery of a Double-Neutron Star Binary in the PALFA Survey.&quot; [https://arxiv.org/pdf/1608.08211 arXiv:1608.08211] — Discovery of PSR J1913+1102.<br /> <br /> == Recognition and Scale ==<br /> [[File:Litecones.png|thumb|150x150px|Einstein@Home was a flagship project of the [[wikipedia:World Year of Physics 2005|World Year of Physics 2005]].]]<br /> Einstein@Home holds several notable distinctions:<br /> * It was a flagship project of the [[wikipedia:World Year of Physics 2005|World Year of Physics 2005]], an international initiative marking the centenary of Einstein's ''annus mirabilis''.<br /> * It was also an official project of the [[wikipedia:International Year of Astronomy|International Year of Astronomy 2009]].<br /> * As of December 2023, it is the '''third-most-popular active BOINC application''' by volunteer participation.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> * Its combined computing power (~7.7 petaFLOPS) would rank it among the top 105 supercomputers on the [[wikipedia:TOP500|TOP500]] list.&lt;ref&gt;{{cite web|url=https://en.wikipedia.org/wiki/Einstein@Home|title=Einstein@Home|publisher=Wikipedia}}&lt;/ref&gt;<br /> * It produced the first genuine astronomical discovery by any public volunteer distributed computing project — the radio pulsar PSR J2007+2722, announced in ''Science'' in 2010.&lt;ref&gt;{{cite web|url=https://news.berkeley.edu/2010/08/13/einstein_boinc/|title=Einstein@Home's pulsar discovery proves value of volunteer computing|publisher=Berkeley News|year=2010}}&lt;/ref&gt;<br /> <br /> == External Links ==<br /> * [https://einsteinathome.org/ Official Einstein@Home website]<br /> * [https://einsteinathome.org/science/discoveries Scientific discoveries]<br /> * [https://einsteinathome.org/de/science/publications Scientific publications]<br /> * [https://einsteinathome.org/science/contributors Contributors]<br /> * [[wikipedia:Einstein@Home|Einstein@Home on Wikipedia]]<br /> * [https://boinc.berkeley.edu/pubs.php Publications by BOINC Projects (boinc.berkeley.edu)]<br /> * [https://www.aei.mpg.de/43575/einstein-home Einstein@Home at the Max Planck Institute for Gravitational Physics]<br /> * [https://www.einstein-online.info/en/spotlight/eah/ Einstein@Home – gravitational waves for everybody (Einstein Online)]<br /> <br /> == References ==<br /> {{Reflist}}<br /> <br /> [[Category:Volunteer computing projects]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Citizen science]]<br /> [[Category:Gravitational-wave astronomy]]<br /> [[Category:Pulsar]]<br /> [[Category:Neutron stars]]<br /> [[Category:BOINC projects]]<br /> [[Category:2005 establishments]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Gerasim@home&diff=1424 2026-05-29T12:16:27Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = Gerasim@home<br /> | logo = Gerasim.png<br /> | logo caption = Gerasim@home logo<br /> <br /> | status = Active<br /> | category = Discrete mathematics<br /> | compute = CPU &amp; GPU<br /> | dependencies = BOINC<br /> <br /> | developer = BOINC.ru community<br /> | author = Sergey Valyaev<br /> | released = {{Start date and age|2008|02|01}}<br /> <br /> | operating system = Windows, Linux<br /> | programming language = C, C++, ASP.NET<br /> | license = Mixed / proprietary server infrastructure<br /> <br /> | stats as of = {{Start date and age|2026|04|11}}<br /> | average performance = 7.54 TFLOPS<br /> | active users = 237<br /> | total users = 8279<br /> | active hosts = 237<br /> | total hosts = 13438<br /> <br /> | website = {{URL|https://gerasim.boinc.ru/}}<br /> }}<br /> <br /> [https://gerasim.boinc.ru/ '''''Gerasim@home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project based on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform. The project uses Internet-connected volunteer computers to perform research in discrete mathematics, combinatorial optimization, graph theory, Latin squares, and related computational problems.&lt;ref&gt;{{cite web |url=https://gerasim.boinc.ru/ |title=Gerasim@home |publisher=Gerasim@home |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project is one of the few long-running Russian BOINC projects and is operated through the BOINC.ru community.&lt;ref&gt;{{cite web |url=https://boinc.ru/proekty/proekt-gerasimhome/ |title=Проект Gerasim@Home |publisher=BOINC.RU |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == History ==<br /> <br /> Gerasim@home began in test operation in February 2008.&lt;ref&gt;{{cite web |url=https://www.rechenkraft.net/wiki/Gerasim%40Home/en |title=Gerasim@Home |publisher=Rechenkraft.net Wiki |access-date=2026-05-20}}&lt;/ref&gt; The project was initially created to study distributed computing technologies and heuristic algorithms for solving combinatorial problems.&lt;ref&gt;{{cite web |url=https://boinc.mundayweb.com/wiki/index.php?title=Gerasim%40Home |title=Gerasim@Home |publisher=BOINC Wiki |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> A notable technical feature of the project was its server implementation using Microsoft Windows Server, Microsoft SQL Server, and ASP.NET instead of the more common Linux/Unix BOINC server stack.&lt;ref&gt;{{cite web |url=https://ru.wikipedia.org/wiki/Gerasim%40Home |title=Gerasim@Home |publisher=Russian Wikipedia |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project experienced several outages and maintenance interruptions over its lifetime, including extended downtime during 2025 before services resumed.&lt;ref&gt;{{cite web |url=https://gerasim.boinc.ru/ |title=Project News |publisher=Gerasim@home |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Why Gerasim@home? ==<br /> <br /> Many problems in discrete mathematics and combinatorial optimization require enormous computational resources due to the explosive growth of possible combinations. Problems involving Latin squares, graph partitioning, and heuristic search methods often become computationally infeasible on conventional single-computer systems.<br /> <br /> Volunteer computing allows these problems to be divided into many smaller independent tasks and processed in parallel by thousands of volunteer computers worldwide.&lt;ref&gt;{{cite journal<br /> |last=Vatutin<br /> |first=Eduard<br /> |title=Using Volunteer Computing to Study Some Features of Diagonal Latin Squares<br /> |journal=Open Engineering<br /> |year=2017<br /> |doi=10.1515/eng-2017-0052<br /> }}&lt;/ref&gt;<br /> <br /> == Goal ==<br /> <br /> The project's primary goal is to investigate computational methods in discrete mathematics and optimization. Research topics have included:<br /> <br /> * Enumeration of diagonal Latin squares<br /> * Orthogonal diagonal Latin squares<br /> * Heuristic search algorithms<br /> * Graph partitioning problems<br /> * Parallel algorithm decomposition<br /> * Cube-and-conquer methods<br /> * Combinatorial optimization<br /> <br /> The project also serves as a practical platform for studying large-scale distributed volunteer computing systems and algorithm scalability.<br /> [[File:Most perfect magic square construction.svg|thumb|Construction of a fourth-order most-perfect magic square from a Latin square with distinct diagonals and its transpose by CMG Lee.]]<br /> <br /> == Methods ==<br /> <br /> Gerasim@home distributes computational work units to volunteers using the BOINC middleware framework. Participants install the BOINC client software, attach to the project, and automatically receive tasks for processing.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC official website |publisher=University of California, Berkeley |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project has historically focused on CPU-based computation but later added support for OpenCL GPU applications on NVIDIA and AMD hardware.&lt;ref&gt;{{cite web |url=https://gerasim.boinc.ru/users/viewApps.aspx |title=Applications |publisher=Gerasim@home |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> As of 2026, project applications include:<br /> <br /> * Decic Fields (CPU)<br /> * Decic Fields (OpenCL NVIDIA)<br /> * Decic Fields (OpenCL AMD)<br /> <br /> The project's infrastructure runs on Microsoft Windows Server and Microsoft SQL Server, which is relatively uncommon among BOINC projects.&lt;ref&gt;{{cite web |url=https://ru.wikipedia.org/wiki/Gerasim%40Home |title=Gerasim@Home |publisher=Russian Wikipedia |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Applications ==<br /> <br /> === Decic Fields ===<br /> <br /> The ''Decic Fields'' application is one of the active workloads distributed by the project. It is available for Windows and Linux platforms and supports CPU as well as OpenCL GPU computation.&lt;ref&gt;{{cite web |url=https://gerasim.boinc.ru/users/viewApps.aspx |title=Gerasim@home Applications |publisher=Gerasim@home |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Project team / Sponsors ==<br /> <br /> The project has been associated with the BOINC.ru volunteer computing community and contributors including:<br /> <br /> * Sergey Valyaev<br /> * Eduard Vatutin<br /> * Alexey Belyshev<br /> * Oleg Zaikin<br /> * Natalia Nikitina<br /> * Maxim Manzuk<br /> * Stepan Kochemazov<br /> <br /> Several scientific publications connected with the project were produced in collaboration with Southwest State University and other Russian research institutions.<br /> <br /> == Server statistics ==<br /> [[File:BOINC logo.png|thumb|180x180px|The project uses the BOINC volunteer computing platform.]]<br /> According to the project's server status page, the infrastructure included over 8,000 registered users and more than 13,000 host computers as of April 2026.&lt;ref&gt;{{cite web<br /> |url=https://gerasim.boinc.ru/server_status.php<br /> |title=Server status<br /> |publisher=Gerasim@home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> The project reported an average computing throughput of approximately 7.5 teraFLOPS.&lt;ref&gt;{{cite web<br /> |url=https://gerasim.boinc.ru/server_status.php<br /> |title=Server status<br /> |publisher=Gerasim@home<br /> |access-date=2026-05-20<br /> }}&lt;/ref&gt;<br /> <br /> == Scientific results ==<br /> <br /> The project has contributed computational resources toward studies in combinatorics, Latin squares, graph theory, and heuristic optimization methods.<br /> <br /> Research performed using Gerasim@home infrastructure has been presented at international conferences and published in peer-reviewed journals related to supercomputing and high-performance computing.<br /> <br /> == Scientific publications ==<br /> <br /> # Vatutin, Eduard, Alexey Belyshev, Natalia Nikitina and Maxum Manzuk. [http://www.nait.ru/journals/number.php?p_number_id=3440 USE OF X-BASED DIAGONAL FILLINGS AND ESODLS CMS SCHEMES FOR ENUMERATION OF MAIN CLASSES OF DIAGONAL LATIN SQUARES]. Telecommunications (2023). DOI: 10.31044/1684-2588-2023-0-1-2-16.<br /> # Vatutin, Eduard, Oleg Zaikin, Maxim Manzyuk and Natalia Nikitina. [https://link.springer.com/10.1007/978-3-030-92864-3_38 Searching for Orthogonal Latin Squares via Cells Mapping and BOINC-Based Cube-and-Conquer]. Supercomputing (2021).<br /> # Vatutin, Eduard and Alexey Belyshev. [https://link.springer.com/10.1007/978-3-030-64616-5_50 Enumerating the Orthogonal Diagonal Latin Squares of Small Order for Different Types of Orthogonality]. Supercomputing (2020).<br /> # Vatutin, Eduard, Alexey Belyshev, Natalia Nikitina and Maxim Manzuk. [http://link.springer.com/10.1007/978-3-030-66895-2_9 Evaluation of Efficiency of Using Simple Transformations When Searching for Orthogonal Diagonal Latin Squares of Order 10]. High-Performance Computing Systems and Technologies in Scientific Research, Automation of Control and Production (2020).<br /> # Vatutin, Eduard, Alexey Belyshev, Stepan Kochemazov, Oleg Zaikin and Natalia Nikitina. [http://link.springer.com/10.1007/978-3-030-05807-4_49 Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing]. Supercomputing (2019).<br /> # Southwest State University, Eduard Vatutin, Stepan Kochemazov ''et al''. [https://jpit.az/uploads/article/en/2019_2/CENTRAL_SYMMETRY_PROPERTIES_FOR_DIAGONAL_LATIN_SQUARES.pdf CENTRAL SYMMETRY PROPERTIES FOR DIAGONAL LATIN SQUARES]. Problems of Information Technology (2019). DOI: 10.25045/jpit.v10.i2.01.<br /> # Vatutin, Eduard, Oleg Zaikin, Stepan Kochemazov and Sergey Valyaev. [https://www.degruyter.com/document/doi/10.1515/eng-2017-0052/html Using Volunteer Computing to Study Some Features of Diagonal Latin Squares]. Open Engineering (2017). DOI: 10.1515/eng-2017-0052.<br /> # Vatutin, Eduard. [https://www.degruyter.com/document/doi/10.1515/eng-2017-0041/html Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem]. Open Engineering (2017). DOI: 10.1515/eng-2017-0041.<br /> # Vatutin, Eduard, Vitaly Titov and Alexander Belyaev. [http://www.matec-conferences.org/10.1051/matecconf/20167901084 On the Selection of Optimal Structure Organization of Logic Multicontrollers]. MATEC Web of Conferences (2016). DOI: 10.1051/matecconf/20167901084.<br /> <br /> == Hardware and software ==<br /> <br /> The project supports multiple operating systems and architectures through the BOINC platform.<br /> <br /> Supported platforms have included:<br /> <br /> * Windows x86_64<br /> * Linux x86_64<br /> * NVIDIA OpenCL GPUs<br /> * AMD OpenCL GPUs<br /> <br /> The server infrastructure has operated on Microsoft Windows Server with Microsoft SQL Server database backends.&lt;ref&gt;{{cite web |url=https://gerasim.boinc.ru/server_status.php |title=Server status |publisher=Gerasim@home |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == Community ==<br /> <br /> Gerasim@home maintains an international volunteer community through BOINC statistics services, teams, and forums. The project has participants from more than 100 countries.&lt;ref&gt;{{cite web |url=https://gerasim.boinc.ru/ |title=Gerasim@home |publisher=Gerasim@home |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> The project has also been discussed on BOINC community forums and Reddit, particularly during outages and infrastructure changes.&lt;ref&gt;{{cite web |url=https://www.reddit.com/r/BOINC/comments/1kulte8/gerasimhome_message_boards_not_working/ |title=Gerasim@Home - message boards not working |publisher=Reddit |access-date=2026-05-20}}&lt;/ref&gt;<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:Combinatorial optimization|Combinatorial optimization]]<br /> * [[wikipedia:Latin square|Latin square]]<br /> * [[wikipedia:Graph theory|Graph theory]]<br /> <br /> == External links ==<br /> <br /> * [https://gerasim.boinc.ru/ Official website]<br /> * [https://gerasim.boinc.ru/server_status.php Server status]<br /> * [https://gerasim.boinc.ru/users/viewApps.aspx Applications]<br /> * [https://boinc.berkeley.edu/ BOINC]<br /> * [https://boincstats.com/en/stats/163/project/detail BOINCstats project statistics]<br /> <br /> == Contributing ==<br /> <br /> If you're interested in supporting this project, download and install BOINC and attach to the project using its official URL:<br /> <br /> https://gerasim.boinc.ru/<br /> <br /> Your computer will perform calculations and report results back to the project servers automatically.<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:Mathematics software]]<br /> [[Category:Science websites]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=World_Community_Grid&diff=1423 2026-05-28T22:48:50Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = World Community Grid<br /> | logo = Worldcommunitygrid.png<br /> | logo caption = World Community Grid logo<br /> <br /> | status = Active<br /> | category = Biomedical / Humanitarian science<br /> | compute = CPU<br /> | dependencies = None<br /> <br /> | developer = United Devices (2004); IBM (2004–2022); Krembil Research Institute / UHN (2022–present)<br /> | author = IBM Corporate Social Responsibility<br /> | sponsor = University Health Network<br /> | maintainer = Dr. Igor Jurisica, Krembil Research Institute<br /> | released = {{Start date and age|2004|11|16}}<br /> <br /> | operating system = Windows, Linux, macOS, Android, Raspberry Pi OS<br /> <br /> | stats as of = {{Start date and age|2023|01|01}}<br /> | average performance = 402 TFLOPS<br /> | active users = 23248<br /> | total users = 79354<br /> | active hosts = 57672<br /> | total hosts = 5517865<br /> <br /> | website = {{URL|https://www.worldcommunitygrid.org/}}<br /> }}<br /> <br /> [https://www.worldcommunitygrid.org/ '''''World Community Grid'''''] uses [[BOINC]] to accelerate science by creating a supercomputer empowered by a global community of volunteers.<br /> [[File:Pandemics.gif|alt=Open Pandemics BOINC Screensaver|thumb|&lt;small&gt;Open Pandemics - COVID-19 BOINC Screensaver&lt;/small&gt;|350x350px]]<br /> <br /> '''World Community Grid''' ('''WCG''') is a [[volunteer computing]] platform dedicated to humanitarian and biomedical scientific research. It harnesses the idle processing power of everyday devices (personal computers, laptops, Android smartphones, and Raspberry Pi systems) to perform large-scale scientific calculations that would otherwise require decades of supercomputing time. Since its founding in 2004, the project has expanded to cover diseases including HIV/AIDS, cancer, tuberculosis, dengue fever, Ebola, Zika virus, and COVID-19, as well as research into clean energy, water purification, food security, and climate science.&lt;ref name=&quot;ibm-org&quot;&gt;{{cite web |url=https://www.worldcommunitygrid.org/about/about.s |title=About Us |publisher=World Community Grid |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> == Why World Community Grid? ==<br /> <br /> World Community Grid began on November 16, 2004, as a philanthropic initiative of '''IBM Corporate Social Responsibility''', the corporate social responsibility and philanthropy division of [[IBM]].&lt;ref name=&quot;wcg-launch&quot;&gt;{{cite web |url=https://en.wikipedia.org/wiki/World_Community_Grid |title=World Community Grid |publisher=Wikipedia |access-date=2026-05-25}}&lt;/ref&gt; The project was inspired by a successful predecessor: in 2003, IBM and other partners sponsored the '''United Devices Smallpox Research Grid Project''', which used a distributed computing grid to screen 35 million potential drug molecules against several smallpox proteins. In the first 72 hours alone, 100,000 results were returned, and by the project's end, 44 strong treatment candidates had been identified.&lt;ref name=&quot;smallpox&quot;&gt;{{cite web |url=https://en.wikipedia.org/wiki/World_Community_Grid |title=World Community Grid – Smallpox precursor |publisher=Wikipedia |access-date=2026-05-25}}&lt;/ref&gt; Encouraged by those results, IBM launched World Community Grid with the goal of creating a permanent technical environment where humanitarian research of this kind could be run continuously.<br /> <br /> Through Corporate Social Responsibility, IBM donated its technology and talent to address some of the world's most pressing social and environmental issues. The platform was initially Windows-only and used the proprietary [[Grid MP]] client software from [[United Devices]].&lt;ref name=&quot;handwiki&quot;&gt;{{cite web |url=https://handwiki.org/wiki/World_Community_Grid |title=World Community Grid |publisher=HandWiki |access-date=2026-05-25}}&lt;/ref&gt; Demand for broader platform support led to the addition of the open-source [[BOINC]] (Berkeley Open Infrastructure for Network Computing) framework in November 2005, bringing Mac OS X and Linux support to the project.&lt;ref name=&quot;handwiki&quot;/&gt; By 2007, the Grid MP client had been fully retired and the project consolidated entirely on BOINC.&lt;ref name=&quot;handwiki&quot;/&gt;<br /> <br /> In September 2021, IBM announced that it had transferred ownership of World Community Grid to the [https://www.uhn.ca/Research/Research_Institutes/Krembil '''Krembil Research Institute'''], part of the '''[https://www.uhn.ca/ University Health Network]''' (UHN) in Toronto, Ontario, Canada.&lt;ref name=&quot;transfer&quot;&gt;{{cite web |url=https://www.cs.toronto.edu/~juris/jlab/wcg.html |title=Jurisica Lab – WCG |publisher=University of Toronto |access-date=2026-05-25}}&lt;/ref&gt; Operational management formally transferred to Krembil in February 2022.<br /> <br /> == Goal ==<br /> <br /> The overarching goal of World Community Grid is to help scientists identify the most important results to study in the laboratory, bringing them one step closer to discoveries that save lives and address global problems. Rather than replacing lab research, WCG acts as a filter: by computationally screening millions — sometimes billions — of candidate molecules or parameter sets, researchers can focus their scarce lab resources on only the most promising leads.<br /> <br /> &lt;blockquote&gt;<br /> &quot;WCG continues to support open-source and open-data research and helps reduce computational time to allow scientists to address the world's most pressing questions at no cost to the researchers.&quot;&lt;ref name=&quot;transfer&quot;/&gt;<br /> &lt;/blockquote&gt;<br /> <br /> All data generated by World Community Grid volunteers must be released into the public domain and made freely available to the scientific community — a foundational requirement for any project accepted onto the platform.&lt;ref name=&quot;ibm-org&quot;/&gt;<br /> <br /> == How It Works ==<br /> <br /> World Community Grid runs on top of [[BOINC]], an open-source middleware system developed at the University of California, Berkeley, originally under a [[National Science Foundation]] grant.&lt;ref name=&quot;wcg-boinc-help&quot;&gt;{{cite web |url=https://worldcommunitygrid.org/help/topic.s?shortName=bnc |title=What is BOINC? |publisher=World Community Grid |access-date=2026-05-25}}&lt;/ref&gt; After downloading the WCG client (a pre-configured BOINC installer) from the official website, the software runs quietly in the background. It monitors available system resources and, when the device is idle, downloads a ''work unit'' from the WCG servers, performs the required calculations, and sends the results back.<br /> <br /> To ensure accuracy, the servers distribute multiple copies of each work unit to different volunteers. When results are returned, they are validated against each other, and statistical outliers are discarded before final data is accepted.&lt;ref name=&quot;wcg-wp&quot;&gt;{{cite web |url=https://en.wikipedia.org/wiki/World_Community_Grid |title=World Community Grid |publisher=Wikipedia |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> === Credits and Points ===<br /> <br /> Volunteer contributions are tracked using the [[BOINC Credit System]]. Upon completing a work unit, the BOINC client reports a point value based on software benchmarks (measured in '''cobblestones''', where &lt;math&gt;1\,\text{cobblestone} = \frac{1}{200}\,\text{GigaFLOP-day}&lt;/math&gt;). The WCG servers compare claims from each machine that processed the same work unit, discard outliers, and award the averaged value to each contributor.&lt;ref name=&quot;wcg-wp&quot;/&gt; Points allow users to track their personal contribution and compete on leaderboards.<br /> <br /> === Teams and Partners ===<br /> <br /> Users may join teams created by organizations or individuals, fostering community identity and friendly competition. As of April 2021, World Community Grid had 452 recognized partner organizations promoting the grid within their communities.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> <br /> === CPU Throttling ===<br /> <br /> The BOINC client is designed not to slow down the host computer. World Community Grid sets conservative defaults: the CPU throttle is 60% by default, meaning the client runs at full load for roughly 3 seconds, then pauses for 2 seconds, cycling continuously. This pattern avoids sustained heat buildup. Windows users can additionally install '''TThrottle''', a third-party add-on that reads CPU and GPU temperatures in real time and adjusts computation accordingly.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> <br /> == Methods ==<br /> [[File:Screensaver HUMAN PROTEOME FOLDING Phase2.png|thumb|350x350px|Screensaver HUMAN PROTEOME FOLDING Phase2. World Community Grid solving the Human Proteome Folding Project.]]<br /> [https://www.cs.toronto.edu/~juris/ '''Dr. Igor Jurisica's research'''] drives World Community Grid's current scientific direction. Dr. Jurisica is a Senior Scientist at the Krembil Research Institute and a Professor at the University of Toronto, with appointments at Toronto Western Hospital. His work focuses on '''integrative computational biology''' — combining large-scale data analysis, machine learning, and network biology to understand complex diseases.<br /> <br /> Research within Krembil is focused on the development of diagnostics, treatments and management strategies across three programmatic areas:<br /> <br /> # '''Chronic neurological and neurosurgical disorders''' — including Parkinson's disease, stroke, epilepsy, spinal cord injuries, dementia, concussion, pain, and depression.<br /> # '''Ophthalmologic disorders''' — including glaucoma, macular degeneration, and retinopathy.<br /> # '''Musculoskeletal system disorders''' — including osteoarthritis, rheumatoid arthritis, systemic lupus erythematosus, and ankylosing spondylitis.<br /> <br /> The primary computational technique used across WCG's biomedical projects is '''molecular docking''', in which candidate drug molecules are algorithmically fitted to target protein structures to predict binding affinity. A typical project may dock tens of millions of compounds against one or more proteins — a task that would require tens of thousands of years of computing time on a single machine, but can be completed in months across the volunteer grid.&lt;ref name=&quot;boincstats-forum&quot;&gt;{{cite web |url=https://www.boincstats.com/forum/10,1/3197,3 |title=WCG Project Progress |publisher=BOINCStats |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> == Project Team / Sponsors ==<br /> <br /> World Community Grid is currently managed by '''Dr. Igor Jurisica''' and his team at the '''Krembil Research Institute''', part of the '''University Health Network''' (UHN) in Toronto, Ontario, Canada.&lt;ref name=&quot;transfer&quot;/&gt;<br /> <br /> UHN has Canada's largest hospital-based research program, comprising four major teaching hospitals: '''Toronto Western Hospital''', '''Toronto General Hospital''', '''Princess Margaret Cancer Centre''', and '''Toronto Rehabilitation Institute''', as well as '''The Michener Institute of Education'''.&lt;ref name=&quot;medium&quot;&gt;{{cite web |url=https://medium.com/@alex40964096/world-community-grid-boinc-9cad98b9e456 |title=World Community Grid BOINC |publisher=Medium |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> Previously, the project was '''funded and operated by [[IBM]]''' from its launch in November 2004 through February 2022. IBM provided all server infrastructure, administrative overhead, and technical support during that nearly two-decade period. The project is grateful for IBM's extensive financial and operational support.&lt;ref name=&quot;transfer&quot;/&gt;<br /> <br /> == Research Overview ==<br /> <br /> World Community Grid operates as an umbrella platform hosting multiple research projects simultaneously. Users are enrolled in all active projects by default but may opt out of any they choose.&lt;ref name=&quot;wcg-wp&quot;/&gt; Over the life of the project, WCG volunteers have collectively donated the equivalent of more than '''2 million years''' of computing time and completed more than '''6 billion work units'''.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> <br /> === Active Research ===<br /> <br /> # [https://www.worldcommunitygrid.org/research/opn1/overview.s '''''OpenPandemics - COVID-19'''''] — Launched to enable a rapid-response platform for global disease outbreaks, the project uses molecular docking to screen drug candidates against SARS-CoV-2 proteins in partnership with scientists at [[Scripps Research]]. The goal is to identify compounds that could block viral replication, potentially forming the basis of antiviral drugs for COVID-19 and future pandemic pathogens.<br /> <br /> # [https://www.worldcommunitygrid.org/research/mcm1/overview.s '''''Mapping Cancer Markers'''''] — One of WCG's longest-running and most ambitious projects, this research aims to identify robust molecular [[biomarker|biomarkers]] associated with various cancer types. By decoding cancer-rewired biological networks, researchers hope to enable earlier detection and more personalized treatment strategies.<br /> <br /> === Intermittent Research ===<br /> <br /> # [https://www.worldcommunitygrid.org/research/arp1/overview.s '''''Africa Rainfall Project'''''] — Uses regional climate modelling to improve weather forecasts and agricultural planning across sub-Saharan Africa, where rain-fed agriculture supports the food supply for hundreds of millions of people.<br /> <br /> # [https://www.worldcommunitygrid.org/research/scc1/overview.s '''''Smash Childhood Cancer'''''] — An expansion of earlier WCG work on neuroblastoma, this project searches for the best drug candidates targeting key molecular proteins across a broader range of childhood cancers.<br /> <br /> # [https://www.worldcommunitygrid.org/research/hst1/overview.s '''''Help Stop TB'''''] — Focuses on finding new drug leads for tuberculosis (TB), which remains one of the world's leading infectious disease killers. The project performs virtual screening of millions of compounds against TB target proteins.<br /> <br /> === [https://www.worldcommunitygrid.org/research/projects.s?proj=comp Completed Research (28)] ===<br /> <br /> Over the course of the project's history, 28 research projects have been completed.&lt;ref name=&quot;wcg-comp&quot;&gt;{{cite web |url=https://www.worldcommunitygrid.org/research/projects.s?proj=comp |title=Completed Research |publisher=World Community Grid |access-date=2026-05-25}}&lt;/ref&gt; These include:<br /> <br /> {| class=&quot;wikitable sortable&quot;<br /> ! Project !! Focus Area !! Notable Outcome<br /> |-<br /> | Human Proteome Folding (Phase 1 &amp; 2) || Protein structure prediction || Produced a database of ~120,000 protein domain structures; computation that would have taken 100 years conventionally was done in one year.&lt;ref name=&quot;scripps2005&quot;&gt;{{cite web |url=https://www.scripps.edu/newsandviews/e_20051205/AIDS.html |title=FightAIDS@Home joins World Community Grid |publisher=Scripps Research |date=2005-12-05 |access-date=2026-05-25}}&lt;/ref&gt;<br /> |-<br /> | FightAIDS@Home (Phase 1 &amp; 2) || HIV/AIDS drug discovery || Discovered two compounds representing a potentially new class of AIDS-fighting drugs; identified new vulnerabilities on the HIV-1 capsid protein as a possible new drug target.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> |-<br /> | Help Fight Childhood Cancer || Neuroblastoma || Screened over 3 million drug candidates; identified 7 compounds that destroy neuroblastoma cells without apparent side effects.&lt;ref name=&quot;wcg-decade&quot;&gt;{{cite web |url=https://www.worldcommunitygrid.org/stat/tenthAnniversary.do |title=A Decade of Discovery |publisher=World Community Grid |access-date=2026-05-25}}&lt;/ref&gt;<br /> |-<br /> | The Clean Energy Project (Phase 1 &amp; 2) || Solar cell materials || Published a database of over 2.3 million organic molecules; identified 35,000 compounds with potential to double the efficiency of carbon-based organic solar cells.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> |-<br /> | OpenZika || Zika virus drug discovery || Identified compound FAM 3, which inhibits the NS3 Helicase protein of the Zika virus, reducing viral replication by up to 86%.&lt;ref name=&quot;openzika&quot;&gt;{{cite journal |author=Ekins S, Perryman AL, Andrade CH |title=OpenZika: An IBM World Community Grid Project to Accelerate Zika Virus Drug Discovery |journal=PLOS Neglected Tropical Diseases |volume=10 |issue=10 |pages=e0005023 |date=2016-10-20 |doi=10.1371/journal.pntd.0005023 |pmc=PMC5072634}}&lt;/ref&gt;<br /> |-<br /> | GO Fight Against Malaria || Malaria and drug-resistant TB || First WCG project to complete a billion docking calculations; discovered several molecules effective against malaria and drug-resistant tuberculosis including TDR-TB.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> |-<br /> | Discovering Dengue Drugs Together (Phase 1 &amp; 2) || Dengue fever and Flaviviridae || Identified several new dengue protease inhibitors, many of which also inhibit the West Nile virus protease.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> |-<br /> | Help Conquer Cancer || Protein crystallography for cancer || Analysis that would have taken 162 years on conventional computers was completed in under 2 years.&lt;ref name=&quot;ibm-history&quot;&gt;{{cite web |url=https://www.ibm.com/history/world-community-grid |title=World Community Grid |publisher=IBM |access-date=2026-05-25}}&lt;/ref&gt;<br /> |-<br /> | Nutritious Rice for the World || Food security / crop genetics || Predicted protein structures for major rice strains to help breed higher-yield, more disease-resistant varieties.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Computing for Clean Water || Nanotechnology / water filtration || Studied molecular-scale water flow through novel filter materials to guide development of low-cost water filters.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Drug Search for Leishmaniasis || Neglected tropical disease || Tested top 10 compounds in vivo; one compound induced near-complete curing of lesions in hamsters.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> |-<br /> | AfricanClimate@Home || Climate modelling || Developed more accurate regional climate models for Africa.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Outsmart Ebola Together || Ebola drug discovery || Screened millions of compounds against Ebola viral proteins to identify drug leads.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Microbiome Immunity Project || Human microbiome || Comprehensive study of the role of gut bacteria in human disease.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Uncovering Genome Mysteries || Genomics || Examined close to 200 million genes from diverse organisms.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Help Cure Muscular Dystrophy (Phase 1 &amp; 2) || Neuromuscular diseases || Investigated protein interactions for more than 2,200 structurally known proteins linked to muscular dystrophy and related diseases.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Influenza Antiviral Drug Search || Influenza || Searched for drugs effective against drug-resistant and novel influenza strains.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Smash Childhood Cancer || Pediatric cancers (broader) || Expanded neuroblastoma drug discovery to additional childhood cancer types.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Help Defeat Cancer || Tissue microarray analysis || Examined cancer tissue microarrays to improve precision medicine diagnosis and treatment.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Genome Comparison || Comparative genomics || Compared genomic information to improve biological data quality and host-pathogen understanding; led by Fiocruz (Oswaldo Cruz Institute), Brazil.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Say No to Schistosoma || Schistosomiasis || Identified potential drug candidates for schistosomiasis, a neglected tropical disease affecting hundreds of millions.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |-<br /> | Computing for Sustainable Water || Watershed ecology || Modelled nutrient flows and ecological responses across 64,000 km&lt;sup&gt;2&lt;/sup&gt; of the Chesapeake Bay watershed.&lt;ref name=&quot;wcg-comp&quot;/&gt;<br /> |}<br /> <br /> == Scientific Publications ==<br /> <br /> World Community Grid research teams have produced over 50 peer-reviewed scientific publications in journals including ''PLOS Neglected Tropical Diseases'', ''Cancer Medicine'', and others.&lt;ref name=&quot;wcg-submit&quot;&gt;{{cite web |url=https://www.worldcommunitygrid.org/research/viewSubmitAProposal.do |title=Submit a Proposal |publisher=World Community Grid |access-date=2026-05-25}}&lt;/ref&gt; A curated list of papers arising from BOINC-based computing — including World Community Grid — is maintained by BOINC at Berkeley.&lt;ref name=&quot;boinc-pubs&quot;&gt;{{cite web |url=https://boinc.berkeley.edu/pubs.php |title=Publications by BOINC Projects |publisher=BOINC / UC Berkeley |access-date=2026-05-25}}&lt;/ref&gt;<br /> <br /> Selected publications directly arising from World Community Grid research include:<br /> <br /> * Ekins S, Perryman AL, Andrade CH. '''OpenZika: An IBM World Community Grid Project to Accelerate Zika Virus Drug Discovery.''' ''PLOS Neglected Tropical Diseases.'' 2016;10(10):e0005023. DOI: [https://doi.org/10.1371/journal.pntd.0005023 10.1371/journal.pntd.0005023]&lt;ref name=&quot;openzika&quot;/&gt;<br /> <br /> * Surpeta B ''et al.'' '''FightAIDS@Home — Phase 2: Discovery of New HIV-1 Capsid Vulnerabilities.''' (Peer-reviewed; referenced in Wikipedia citations 10-13.)&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> <br /> * Hachmann AB ''et al.'' (Clean Energy Project). '''Large-scale computational screening of organic photovoltaic materials'''; database of 2.3+ million characterized organic molecules published 2013.&lt;ref name=&quot;wcg-wp&quot;/&gt;<br /> <br /> For the complete and current list of World Community Grid-related papers, see: [https://boinc.berkeley.edu/pubs.php#World BOINC Publications — World Community Grid].<br /> <br /> == See Also ==<br /> <br /> * [[BOINC]]<br /> * [[Volunteer computing]]<br /> * [[Folding@home]]<br /> * [[SETI@home]]<br /> * [[Rosetta@home]]<br /> * [[Krembil Research Institute]]<br /> * [[University Health Network]]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> == External Links ==<br /> <br /> * [https://www.worldcommunitygrid.org/ World Community Grid official website]<br /> * [https://www.cs.toronto.edu/~juris/jlab/wcg.html Jurisica Lab WCG page]<br /> * [https://www.uhn.ca/Research/Research_Institutes/Krembil Krembil Research Institute]<br /> * [https://boinc.berkeley.edu/pubs.php#World BOINC Publications list (World Community Grid section)]<br /> * [https://www.worldcommunitygrid.org/research/projects.s?proj=comp WCG Completed Projects]<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:Biomedical research]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:IBM]]<br /> [[Category:University Health Network]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=MilkyWay@home&diff=1422 2026-05-28T22:36:35Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = MilkyWay@home<br /> | logo = Mw.png<br /> | logo caption = MilkyWay@home logo<br /> | screenshot = Milkyway.gif<br /> | caption = A dwarf galaxy being disrupted by the Milky Way's gravity<br /> <br /> | status = Active<br /> | category = Astrophysics<br /> | compute = CPU<br /> | dependencies = <br /> <br /> | developer = Heidi Jo Newberg, Travis Desell, Carlos Varela<br /> | author = <br /> | sponsor = Rensselaer Polytechnic Institute<br /> | maintainer = MilkyWay@home team<br /> | released = {{Start date and age|2007|04|01}}<br /> | repository = {{URL|https://github.com/Milkyway-at-home}}<br /> <br /> | programming language = C, C++, OpenCL<br /> | operating system = Windows, Linux, macOS<br /> | size = ~50 MB<br /> <br /> | stats as of = {{Start date and age|2026|05|21}}<br /> | average performance = 200817.71 GigaFLOPS<br /> | active users = 19120<br /> | total users = 257894<br /> | active hosts = 61248<br /> | total hosts = 1543021<br /> <br /> | rac = 12400000<br /> | credit per day = 730000<br /> | gpu performance = <br /> | cpu performance = <br /> <br /> | website = {{URL|https://milkyway.cs.rpi.edu/milkyway/}}<br /> | license = GNU GPL<br /> }}<br /> <br /> [https://milkyway.cs.rpi.edu/milkyway/ '''''MilkyWay@home'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' and '''''[[wikipedia:Distributed computing|distributed computing]]''''' project operated by the [[wikipedia:Rensselaer Polytechnic Institute|Rensselaer Polytechnic Institute]] (RPI). The project uses the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform to harness unused processing power from volunteer computers around the world in order to study the structure and evolution of the [[wikipedia:Milky Way|Milky Way galaxy]], particularly the galactic halo and the distribution of [[wikipedia:Dark matter|dark matter]].&lt;ref&gt;{{cite web |url=https://milkyway.cs.rpi.edu/milkyway/ |title=MilkyWay@home |publisher=Rensselaer Polytechnic Institute |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> The project is known for extensive use of [[wikipedia:Graphics processing unit|GPU computing]], becoming one of the earliest BOINC projects to heavily support AMD and NVIDIA GPUs for scientific applications.&lt;ref&gt;{{cite conference |last=Desell |first=Travis |title=Accelerating the MilkyWay@Home volunteer computing project with GPUs |book-title=Parallel Processing and Applied Mathematics |year=2009}}&lt;/ref&gt;<br /> <br /> == History ==<br /> <br /> MilkyWay@home was launched in 2007 by researchers at RPI's Department of Computer Science and Department of Physics, Applied Physics, and Astronomy.&lt;ref&gt;{{cite web |url=https://boinc.berkeley.edu/pubs.php |title=BOINC Publications and Papers |publisher=University of California, Berkeley |access-date=2026-05-21}}&lt;/ref&gt; The project was created to combine astronomical data analysis with volunteer computing technologies developed through the BOINC middleware platform.<br /> <br /> The project originally focused on fitting models to the [[wikipedia:Sagittarius Dwarf Spheroidal Galaxy|Sagittarius tidal stream]], a stellar stream created by the interaction between the Milky Way and a dwarf galaxy. Later research expanded to additional tidal streams, dwarf galaxy simulations, and reconstruction of galactic structure using N-body simulations.&lt;ref&gt;{{cite journal |last=Cole |first=Nathan |title=Maximum Likelihood Fitting of Tidal Streams with Application to the Sagittarius Dwarf Tidal Tails |journal=Astrophysical Journal |volume=683 |pages=750–766 |year=2008}}&lt;/ref&gt;<br /> <br /> MilkyWay@home gained attention within the BOINC community because of its extremely high GPU utilization and optimized OpenCL applications, which allowed volunteers to achieve very high computational throughput compared to CPU-only projects.&lt;ref&gt;{{cite conference |last=Desell |first=Travis |title=Accelerating the MilkyWay@Home volunteer computing project with GPUs |book-title=PPAM 2009 |year=2009}}&lt;/ref&gt;<br /> <br /> == Scientific objectives ==<br /> <br /> The main scientific objective of MilkyWay@home is to better understand the structure and formation history of the Milky Way galaxy through analysis of stellar streams and dwarf galaxies. By modeling the motion and disruption of dwarf galaxies orbiting the Milky Way, researchers can estimate the shape and distribution of dark matter in the galactic halo.&lt;ref&gt;{{cite journal |last=Newberg |first=Heidi Jo |title=MilkyWay@home: Harnessing Volunteer Computers to Constrain Dark Matter in the Milky Way |journal=Proceedings of the International Astronomical Union |year=2014}}&lt;/ref&gt;<br /> <br /> The project primarily studies:<br /> <br /> * The structure of the Milky Way stellar halo<br /> * Tidal debris streams<br /> * Dwarf galaxy interactions<br /> * Galactic gravitational potential<br /> * Dark matter distribution<br /> * Stellar density substructures<br /> <br /> == Why MilkyWay@home? ==<br /> <br /> The N-body project on MilkyWay@home simulates dwarf galaxies colliding with or being disrupted by the Milky Way. The results help researchers understand how dwarf galaxies interact with the Milky Way under varying physical conditions and how these simulated interactions compare with observational astronomical data.<br /> <br /> == Goal ==<br /> <br /> The goal of the N-body project is to match simulated dwarf galaxies to real dwarf galaxy observations and thereby constrain the properties of the Milky Way galaxy's gravitational potential. Comparing observed baryonic matter distributions with calculated galactic potentials helps scientists estimate the distribution and density of dark matter within the Milky Way.&lt;ref&gt;{{cite journal |last=Mendelsohn |first=Eric J. |title=Estimate of the Mass and Radial Profile of the Orphan-Chenab Stream's Dwarf-galaxy Progenitor Using MilkyWay@home |journal=The Astrophysical Journal |year=2022}}&lt;/ref&gt;<br /> <br /> == Methods ==<br /> <br /> MilkyWay@home studies the history of the Milky Way galaxy by analyzing stars in the [[wikipedia:Galactic halo|galactic halo]]. Many observed stellar structures are believed to be remnants of dwarf galaxies torn apart by the Milky Way's gravitational field. These remnants form tidal debris streams that can be mapped and modeled computationally.&lt;ref&gt;{{cite journal |last=Weiss |first=Jake |title=A Tangle of Stellar Streams in the North Galactic Cap |journal=The Astrophysical Journal |year=2018}}&lt;/ref&gt;<br /> <br /> The project uses volunteer computing to process large numbers of simulations in parallel. The N-body subproject creates simulated dwarf galaxies and evolves them within a model of the Milky Way gravitational field. Parameters are adjusted iteratively until the simulations closely resemble observed stellar structures.&lt;ref&gt;{{cite journal |last=Shelton |first=Siddhartha |title=An Algorithm for Reconstructing the Orphan Stream Progenitor with MilkyWay@home Volunteer Computing |journal=The Astrophysical Journal |year=2021}}&lt;/ref&gt;<br /> [[File:Our best map of the Milky Way so far (the-milky-way-galaxy).jpg|thumb|Our best map of the Milky Way so far]]<br /> <br /> == Applications ==<br /> <br /> MilkyWay@home applications are distributed through the BOINC client and support multiple operating systems and hardware architectures. The project has historically supported:<br /> <br /> * CPU applications<br /> * NVIDIA GPU applications using CUDA and OpenCL<br /> * AMD GPU applications using OpenCL<br /> * Multi-threaded N-body simulations<br /> <br /> The GPU applications became particularly popular among volunteer computing enthusiasts due to their exceptionally high credit generation rates and strong floating point performance.&lt;ref&gt;{{cite web |url=https://milkyway.cs.rpi.edu/milkyway/apps.php |title=MilkyWay@home Applications |publisher=RPI |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> == Project team / Sponsors ==<br /> <br /> The project team has included:<br /> <br /> * Heidi Jo Newberg<br /> * Kevin Roux<br /> * Hiroka Warren<br /> * Travis Desell<br /> * Carlos Varela<br /> * Malik Magdon-Ismail<br /> * Boleslaw K. Szymanski<br /> <br /> The project is operated by [[wikipedia:Rensselaer Polytechnic Institute|Rensselaer Polytechnic Institute]].<br /> <br /> Supported by the [[wikipedia:National Science Foundation|National Science Foundation]] under Grant Numbers 0612213, 0607618, 0448407, 1009670, 1615688, and 1908653.<br /> <br /> # [https://www.nsf.gov/awardsearch/showAward?AWD_ID=1615688 Charting the Structure of the Milky Way Stellar Halo and Disk], NSF AST Grant #1615688, 09/15/2016 - 08/31/2019, Principal Investigator: Heidi Jo Newberg<br /> # [http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=1009670 Stars and Dark Matter in the Halo of the Milky Way], NSF AST Grant #1009670, started 09/15/2010<br /> # [http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0612213 Data-Driven Discovery of the Milky Way Origin and Evolution from the Sloan Digital Sky Survey], NSF IIS Grant #0612213<br /> # [https://milkyway.cs.rpi.edu/milkyway/publications/AAS_2014_posters/Weiss_AAS.pdf Revealing the Structure of the Galactic Halo through Statistical Analysis - Middle School Teacher Training]<br /> # [http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0448407 Middleware and Programming Technology for Grid Computing], NSF CAREER Grant #0448407<br /> <br /> [[File:Milkyway.gif|alt=Milky Way image|thumb|A dwarf galaxy being disrupted by the Milky Way's gravity (the Milky Way is not shown, and would be at the center of the picture)]]<br /> <br /> == BOINC statistics ==<br /> <br /> As of May 2026, MilkyWay@home remains one of the largest astronomy-focused BOINC projects. The project has historically maintained a strong GPU user base due to efficient OpenCL applications and high throughput workloads.&lt;ref&gt;{{cite web |url=https://milkyway.cs.rpi.edu/milkyway/server_status.php |title=Server Status |publisher=MilkyWay@home |access-date=2026-05-21}}&lt;/ref&gt;<br /> <br /> == Scientific publications ==<br /> <br /> === Major journal papers ===<br /> <br /> # Eric J. Mendelsohn. [https://milkyway.cs.rpi.edu/milkyway/publications/Eric.M_thesis.pdf Using MilkyWay@home to Measure the Mass of the Orphan-Chenab Stream Progenitor Dwarf Galaxy]. PhD thesis. Rensselaer Polytechnic Institute, 2022.<br /> # Eric J. Mendelsohn, Heidi Jo Newberg, Siddhartha Shelton, Lawrence M. Widrow, Jeffery M. Thompson, Carl J. Grillmair. [https://milkyway.cs.rpi.edu/milkyway/publications/Mendelsohn_2022.pdf Estimate of the Mass and Radial Profile of the Orphan-Chenab Stream's Dwarf-galaxy Progenitor Using MilkyWay@home]. ''The Astrophysical Journal'', 2022.<br /> # Siddhartha Shelton et al. [https://milkyway.cs.rpi.edu/milkyway/publications/Shelton_2021.pdf An Algorithm for Reconstructing the Orphan Stream Progenitor with MilkyWay@home Volunteer Computing]. ''The Astrophysical Journal'', 2021.<br /> # Heidi Jo Newberg et al. [https://milkyway.cs.rpi.edu/milkyway/publications/Newberg_2020.pdf Streams and the Milky Way Dark Matter Halo]. International Astronomical Union, 2020.<br /> # Jake Weiss, Heidi Jo Newberg, Travis Desell. [https://milkyway.cs.rpi.edu/milkyway/publications/Weiss_2018.pdf A Tangle of Stellar Streams in the North Galactic Cap]. ''The Astrophysical Journal'', 2018.<br /> # Jake Weiss, Heidi Jo Newberg, Matthew Newby, Travis Desell. [https://milkyway.cs.rpi.edu/milkyway/publications/Weiss_2018_ApJS_238_17.pdf Fitting the Density Substructure of the Stellar Halo with MilkyWay@home]. ''The Astrophysical Journal'', 2018.<br /> # Heidi Jo Newberg, Matthew Newby, Travis Desell, Malik Magdon-Ismail, Boleslaw Szymanski, Carlos Varela. [http://arxiv.org/pdf/1411.6003v1.pdf MilkyWay@home: Harnessing Volunteer Computers to Constrain Dark Matter in the Milky Way]. Proceedings of the International Astronomical Union, 2014.<br /> # Matthew Newby et al. [http://iopscience.iop.org/1538-3881/145/6/163/pdf/1538-3881_145_6_163.pdf Spatial Characterization of the Sagittarius Dwarf Galaxy Tidal Tails]. ''Astronomical Journal'', 2013.<br /> # Nathan Cole et al. [http://wcl.cs.rpi.edu/papers/cole-apj-2008.pdf Maximum Likelihood Fitting of Tidal Streams with Application to the Sagittarius Dwarf Tidal Tails]. ''Astrophysical Journal'', 2008.<br /> <br /> === Computer science and volunteer computing papers ===<br /> <br /> # Travis Desell et al. [http://wcl.cs.rpi.edu/papers/escience2009.pdf Robust Asynchronous Optimization for Volunteer Computing Grids]. IEEE e-Science 2009.<br /> # Travis Desell et al. [http://wcl.cs.rpi.edu/papers/ppam2009.pdf Accelerating the MilkyWay@Home volunteer computing project with GPUs]. PPAM 2009.<br /> # Travis Desell et al. [https://milkyway.cs.rpi.edu/milkyway/publications/desell_dais_2010.pdf Validating Evolutionary Algorithms on Volunteer Computing Grids]. DAIS 2010.<br /> # Travis Desell et al. [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5586073&amp;tag=1 An Analysis of Massively Distributed Evolutionary Algorithms]. IEEE CEC 2010.<br /> # Nathan Cole et al. [https://milkyway.cs.rpi.edu/milkyway/publications/cole2009.pdf A Study of the Sagittarius Tidal Stream Using Maximum Likelihood]. ADASS XVIII, 2009.<br /> <br /> == See also ==<br /> <br /> * [[wikipedia:BOINC|BOINC]]<br /> * [[wikipedia:Volunteer computing|Volunteer computing]]<br /> * [[wikipedia:SETI@home|SETI@home]]<br /> * [[wikipedia:Einstein@Home|Einstein@Home]]<br /> * [[wikipedia:GPU computing|GPU computing]]<br /> * [[wikipedia:Dark matter|Dark matter]]<br /> <br /> == External links ==<br /> <br /> * [https://milkyway.cs.rpi.edu/milkyway/ Official website]<br /> * [https://milkyway.cs.rpi.edu/milkyway/forum_index.php Project forums]<br /> * [https://milkyway.cs.rpi.edu/milkyway/server_status.php Server status]<br /> * [https://github.com/Milkyway-at-home GitHub repository]<br /> * [https://boinc.berkeley.edu/ BOINC]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Astronomy projects]]<br /> [[Category:Astrophysics]]<br /> [[Category:Dark matter]]<br /> [[Category:Rensselaer Polytechnic Institute]]<br /> [[Category:2007 software]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=SRBase&diff=1421 2026-05-28T22:33:10Z

<p>Al Piskun: </p> <hr /> <div>{{Infobox software<br /> | name = SRBase<br /> | logo = SRBase.jpg<br /> | logo caption = SRBase project logo<br /> <br /> | status = Active<br /> | category = Mathematics / Number Theory<br /> | compute = CPU &amp; GPU<br /> <br /> | developer = rebirther<br /> | author = rebirther<br /> | sponsor = [[wikipedia:Conjectures 'R Us|Conjectures 'R Us]] (CRUS), [[wikipedia:Great Internet Mersenne Prime Search|GIMPS]]<br /> | maintainer = rebirther<br /> | released = {{Start date and age|2013|01|02}}<br /> <br /> | programming language = C, C++<br /> | operating system = Windows, Linux, macOS<br /> <br /> | website = {{URL|https://srbase.my-firewall.org/sr5/}}<br /> | license = BOINC Confederation<br /> }}<br /> <br /> [https://srbase.my-firewall.org/sr5/ '''''SRBase'''''] is a [[wikipedia:BOINC|BOINC]]-based '''''[[wikipedia:Volunteer computing|volunteer computing]]''''' project focused on mathematical research in [[wikipedia:number theory|number theory]]. It enlists the spare processing power of volunteers' computers around the world to prove the generalized [[wikipedia:Sierpinski number|Sierpinski]] and [[wikipedia:Riesel number|Riesel]] conjectures for all integer bases &lt;math&gt;b \leq 1030&lt;/math&gt;, working on cases not currently addressed by other distributed computing efforts.&lt;ref&gt;{{cite web |url=https://srbase.my-firewall.org/sr5/ |title=SRBase |publisher=BOINC Confederation / rebirther |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> == Mathematical background ==<br /> <br /> === The Sierpinski conjecture ===<br /> [[File:Wacław Sierpiński.jpg|thumb|Wacław Sierpiński. (1882–1969), the Polish mathematician who proved the existence of infinitely many Sierpiński numbers in 1960.]]<br /> In [[wikipedia:number theory|number theory]], a Sierpiński number is an odd natural number &lt;math&gt;k&lt;/math&gt; such that &lt;math&gt;k \times 2^n + 1&lt;/math&gt; is [[wikipedia:composite number|composite]] for all natural numbers &lt;math&gt;n&lt;/math&gt;. In 1960, [[wikipedia:Wacław Sierpiński|Wacław Sierpiński]] proved that there are infinitely many odd integers &lt;math&gt;k&lt;/math&gt; which have this property. In other words, for a Sierpiński number &lt;math&gt;k&lt;/math&gt;, no matter what positive integer is substituted for &lt;math&gt;n&lt;/math&gt;, the result is always a composite (non-prime) number. &quot;There's no obvious reason why they should exist,&quot; as mathematician Chris Caldwell has noted; for most values of &lt;math&gt;k&lt;/math&gt;, primes appear quite regularly in the sequence &lt;math&gt;k \cdot 2^n + 1&lt;/math&gt;.<br /> <br /> The number 78,557 was proved to be a Sierpiński number by [[wikipedia:John Selfridge|John Selfridge]] in 1962, who showed that all numbers of the form &lt;math&gt;78557 \cdot 2^n + 1&lt;/math&gt; have a factor in the [[wikipedia:covering set|covering set]] &lt;math&gt;\{3, 5, 7, 13, 19, 37, 73\}&lt;/math&gt;. In 1967, it was conjectured by Sierpiński and Selfridge that 78,557 is the smallest Sierpiński number. To solve the Sierpiński problem fully, one needs to prove that for every odd number &lt;math&gt;k &lt; 78{,}557&lt;/math&gt;, there exists an &lt;math&gt;n&lt;/math&gt; such that &lt;math&gt;k \cdot 2^n + 1&lt;/math&gt; is a prime number.<br /> <br /> SRBase extends this classical question to all integer bases up to 1030, so for any base &lt;math&gt;b&lt;/math&gt; in the Sierpiński (+1) form, a conjectured minimum Sierpiński value is the smallest &lt;math&gt;k&lt;/math&gt; for which &lt;math&gt;k \cdot b^n + 1&lt;/math&gt; is composite for every &lt;math&gt;n \geq 1&lt;/math&gt;.<br /> <br /> === The Riesel conjecture ===<br /> <br /> Hans Ivar Riesel (28 May 1929 in [[wikipedia:Stockholm|Stockholm]] – 21 December 2014) was a [[wikipedia:Sweden|Swedish]] mathematician who discovered the 18th [[wikipedia:Mersenne prime|Mersenne prime]] in 1957 using the computer BESK: &lt;math&gt;2^{3217}-1&lt;/math&gt;, comprising 969 digits. Intrigued by numbers that resist such searches, he proved in 1956 that there exist odd integers &lt;math&gt;k&lt;/math&gt; for which &lt;math&gt;k \cdot 2^n - 1&lt;/math&gt; is [[wikipedia:composite number|composite]] for every &lt;math&gt;n \geq 1&lt;/math&gt;, inaugurating the study of what are now called Riesel numbers.<br /> <br /> Hans Riesel showed that there are an infinite number of integers &lt;math&gt;k&lt;/math&gt; such that &lt;math&gt;k \cdot 2^n - 1&lt;/math&gt; is not prime for any integer &lt;math&gt;n&lt;/math&gt;. He showed that the number 509,203 has this property. The Riesel problem consists in determining the smallest Riesel number. Because no covering set has been found for any &lt;math&gt;k&lt;/math&gt; less than 509,203, it is conjectured to be the smallest Riesel number.<br /> <br /> Analogously to the Sierpiński problem, SRBase generalizes this to the Riesel (−1) form &lt;math&gt;k \cdot b^n - 1&lt;/math&gt; for every base &lt;math&gt;b \leq 1030&lt;/math&gt;, seeking the conjectured minimum Riesel value for each base.<br /> <br /> === The generalized conjecture ===<br /> <br /> Conjectures 'R Us (CRUS) was established in 2007 by Gary Barnes. For every base &lt;math&gt;b \leq 1030&lt;/math&gt; for the forms &lt;math&gt;k \cdot b^n \pm 1&lt;/math&gt;, there is a &lt;math&gt;k&lt;/math&gt;-value for each form that has been conjectured to be the lowest &quot;Sierpiński value&quot; (+1 form) or &quot;Riesel value&quot; (−1 form) that is composite for all values of &lt;math&gt;n \geq 1&lt;/math&gt;. A conjecture is proven when a prime is found for every &lt;math&gt;k&lt;/math&gt; below the conjectured minimum value, eliminating each candidate in turn. SRBase serves as the BOINC-powered computational arm of this effort.<br /> <br /> == Goal ==<br /> <br /> The project's mission is to prove the Riesel and Sierpiński conjectures for all bases &lt;math&gt;b \leq 1030&lt;/math&gt; that are not already being worked on by other projects or efforts.&lt;ref&gt;{{cite web |url=https://srbase.my-firewall.org/sr5/ |title=SRBase Project Page |access-date=2026-05-23}}&lt;/ref&gt; For every base &lt;math&gt;b&lt;/math&gt;, the two target forms are:<br /> <br /> * Sierpiński (+1): &lt;math&gt;k \cdot b^n + 1&lt;/math&gt;<br /> * Riesel (−1): &lt;math&gt;k \cdot b^n - 1&lt;/math&gt;<br /> <br /> The project seeks the lowest value of &lt;math&gt;k&lt;/math&gt; in each form that is composite for all &lt;math&gt;n \geq 1&lt;/math&gt;, and then eliminates each smaller candidate by finding a prime. A base is declared &quot;proven&quot; when all such candidates have been eliminated.<br /> <br /> == History ==<br /> <br /> SRBase was launched in 2014, as indicated by its copyright notice &quot;© 2014–2026 BOINC Confederation / rebirther.&quot; It is administered by a volunteer known by the handle '''rebirther''', who runs the project server on a private computer inside a [[wikipedia:virtual machine|virtual machine]] — famously rumored to reside in a closet.<br /> <br /> The project has maintained a steady annual review of its progress since its founding. Over its first nine years, 28 bases were proven, with the number of unstarted bases declining from 314 in 2014–2015 to 69 by 2022–2023. The following table summarizes yearly progress through 2023:&lt;ref&gt;{{cite web |url=https://medium.com/@alex40964096/boinc-project-srbase-7c7bde38ae54 |title=Boinc Project: SRBase |publisher=Medium |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> {| class=&quot;wikitable&quot; style=&quot;margin:auto&quot;<br /> ! Year !! Bases proven !! Unstarted bases remaining<br /> |-<br /> | 2014–2015 || 1 || 314<br /> |-<br /> | 2015–2016 || 5 || 297<br /> |-<br /> | 2016–2017 || 5 || 282<br /> |-<br /> | 2017–2018 || 1 || 264<br /> |-<br /> | 2018–2019 || 6 || 218<br /> |-<br /> | 2019–2020 || 4 || 120<br /> |-<br /> | 2020–2021 || 3 || 101<br /> |-<br /> | 2021–2022 || 0 || 97<br /> |-<br /> | 2022–2023 || 3 || 69<br /> |-<br /> ! Total (9 years) || 28 || 69<br /> |}<br /> <br /> == Methods and technology ==<br /> <br /> === Applications ===<br /> <br /> SRBase distributes computational work to volunteers via the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] client. The core computation involves [[wikipedia:primality test|primality testing]] of candidate numbers of the forms &lt;math&gt;k \cdot b^n \pm 1&lt;/math&gt;. The project has migrated from the LLR2 application to PRST (a similar application already used at [[wikipedia:PrimeGrid|PrimeGrid]]), which was intended to replace LLR2 and brings performance improvements and better hardware support. Recent application milestones include updating to PRST v10, multi-GPU sieving, and support for [[wikipedia:Intel Arc|Intel Arc]] GPUs.<br /> <br /> Both CPU and GPU work units are available. The PRST application supports modern instruction sets including [[wikipedia:AVX-512|AVX-512]] for compatible processors, allowing significantly faster computations on modern hardware.<br /> <br /> === Sieving ===<br /> <br /> Before primality testing, candidate numbers are sieved to eliminate those with small factors, reducing the amount of expensive primality work. SRBase makes use of sieving in collaboration with the [[wikipedia:yoyo@home|yoyo@home]] project. It should be noted that SRBase is the BOINC side of the CRUS (Conjectures 'R Us) project, which is also connected with the sieve application at Yoyo. <br /> <br /> === Infrastructure ===<br /> <br /> The project server is hosted on a private machine running inside a virtual machine. This unconventional setup has become a point of gentle pride within the volunteer computing community. Work reservation and preparation are coordinated via the [[wikipedia:Mersenne Forum|Mersenne Forum]] at [http://www.mersenneforum.org/forumdisplay.php?f=81 mersenneforum.org], where users reserve bases to avoid duplicate effort. Results processing and prime removal from sieve files are handled using the &lt;code&gt;srfile&lt;/code&gt; application.<br /> <br /> == Collaborations ==<br /> <br /> SRBase operates in active collaboration with two major mathematical computing projects:<br /> <br /> === Conjectures 'R Us (CRUS) ===<br /> <br /> The Conjectures 'R Us project works to prove the Riesel and Sierpiński conjectures for all bases &lt;math&gt;\leq 1030&lt;/math&gt; that are not being handled by other projects. Testing is coordinated through the Mersenne forum at mersenneforum.org, where &lt;math&gt;k&lt;/math&gt;-values and bases can be reserved and tested. SRBase serves as the BOINC-powered computational engine for CRUS. Work reservations are filed through the Mersenne Forum to ensure no base is tested twice by different contributors.<br /> <br /> === Great Internet Mersenne Prime Search (GIMPS) ===<br /> <br /> SRBase has created a BOINC project to hand out trial factoring assignments on large Mersenne numbers. These are very quick work units. Specifically, SRBase's GPU trial factoring effort covers Mersenne numbers in the 100–1000 million exponent range and has progressed through successive bit levels of trial division, working collaboratively with the broader [[wikipedia:Great Internet Mersenne Prime Search|GIMPS]] effort coordinated through [[wikipedia:PrimeNet|PrimeNet]].<br /> <br /> == Project team ==<br /> <br /> SRBase is maintained by a small, dedicated team of volunteer contributors:<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Handle !! Role<br /> |-<br /> | '''rebirther''' || SRBase admin; server and application management<br /> |-<br /> | '''Gary''' (Gary Barnes) || Mersenne/CRUS admin; results processing<br /> |-<br /> | '''Prime95''' (George Woltman) || GIMPS admin; work distribution<br /> |-<br /> | '''Odicin''' || Scripts<br /> |-<br /> | '''walli''' || Coding<br /> |-<br /> | '''deletenull''' || GPU applications and compilation<br /> |}<br /> <br /> Gary Barnes founded the Conjectures 'R Us project in 2007&lt;ref&gt;{{cite web |url=https://www.rieselprime.de/ziki/Conjectures_'R_Us |title=Conjectures 'R Us – Prime-Wiki |access-date=2026-05-23}}&lt;/ref&gt; and coordinates the mathematical side of the collaboration. George Woltman, creator of the [[wikipedia:Prime95|Prime95]] software and co-founder of GIMPS in 1996, assists with work distribution for the trial factoring subproject.<br /> <br /> == Scientific results and notable finds ==<br /> <br /> === Proven bases and conjecture progress ===<br /> <br /> As of early 2021, SRBase had reported 400 of 1,031 Riesel bases proven and 390 of 1,032 Sierpiński bases proven, with 112 bases still unstarted. Progress statistics are maintained by the CRUS project at [http://www.noprimeleftbehind.net/crus/ noprimeleftbehind.net].<br /> <br /> * [http://www.noprimeleftbehind.net/crus/vstats_new/crus-stats.htm Overall CRUS statistics]<br /> * [http://www.noprimeleftbehind.net/crus/Riesel-conjecture-reserves.htm Riesel reservations]<br /> * [http://www.noprimeleftbehind.net/crus/Sierp-conjecture-reserves.htm Sierpiński reservations]<br /> <br /> === Megaprime discoveries ===<br /> <br /> SRBase participants have discovered numerous [[wikipedia:megaprime|megaprimes]] (primes with over one million decimal digits), which are automatically submitted to the [https://t5k.org/primes/ Top 5000 Largest Known Primes Database] (T5k PrimePages). Notable recent discoveries include:<br /> <br /> * '''163 * 778^424575 + 1''' (1,227,440 digits) — found by Nexhr of team Gridcoin, a megaprime for base S778. <br /> * '''84 * 730^560037 + 1''' (1,603,569 digits) — found by Oliver Kruse, a megaprime for base S730. <br /> * '''78 * 622^402915 - 1''' (1,125,662 digits) — found by IDEA of team Idea Digital Imaging; this find also proved base R622. <br /> * '''543131 * 2^3529754 - 1''' (1,062,568 digits) — found by zlodeck of team Russia, a megaprime for the R2 second conjecture. <br /> * '''1676 * 199^460981 - 1''' (1,059,731 digits) — found by Sightus@CAU of team Planet 3DNow!, entered the T5k PrimePages in February 2026. <br /> <br /> === Published guide ===<br /> <br /> The project has produced an internal reference document, '''''Behind SRBase — A Short Guide''''', available at the project website.&lt;ref&gt;{{cite web |url=https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf |title=Behind SRBase – A Short Guide |publisher=SRBase |access-date=2026-05-23}}&lt;/ref&gt; This guide chronicles BOINC server administration notes, work-unit generation procedures, and the workflow used to move bases from the CRUS reservation system through sieving and primality testing to a verified prime. It is described as a practical record of the operational knowledge built up over the project's lifetime.<br /> <br /> == Participation ==<br /> <br /> === Joining the project ===<br /> <br /> To join SRBase, participants download BOINC, select &quot;Add Project,&quot; and enter the URL https://srbase.my-firewall.org/sr5/. The project invitation code for creating new accounts is '''pillepalle'''. <br /> <br /> === BOINC Pentathlon ===<br /> <br /> SRBase has been selected multiple times as one of the five projects in the annual [[wikipedia:BOINC Pentathlon|BOINC Pentathlon]], a competitive volunteer computing event in which teams race to accumulate the most credit across several projects over a two-week period. In the 2025 BOINC Pentathlon, SRBase was selected for the three-day Sprint discipline. It was also the Sprint project for the 2022 Pentathlon.&lt;ref&gt;{{cite web |url=https://srbase.my-firewall.org/sr5/old_news.php |title=SRBase news archive |access-date=2026-05-23}}&lt;/ref&gt;<br /> <br /> === Gridcoin ===<br /> <br /> SRBase is whitelisted by the [[wikipedia:Gridcoin|Gridcoin]] network, allowing participants who hold Gridcoin cryptocurrency to earn rewards proportional to their verified scientific computing contributions to the project.<br /> <br /> == See also ==<br /> <br /> * [[PrimeGrid]]<br /> * [[wikipedia:Great Internet Mersenne Prime Search|Great Internet Mersenne Prime Search (GIMPS)]]<br /> * [[wikipedia:Sierpiński number|Sierpiński number]]<br /> * [[wikipedia:Riesel number|Riesel number]]<br /> * [[wikipedia:BOINC|Berkeley Open Infrastructure for Network Computing (BOINC)]]<br /> * [[wikipedia:Seventeen or Bust|Seventeen or Bust]]<br /> <br /> == External links ==<br /> <br /> * [https://srbase.my-firewall.org/sr5/ SRBase project homepage]<br /> * [http://www.noprimeleftbehind.net/crus/ Conjectures 'R Us project page]<br /> * [https://www.mersenneforum.org/forumdisplay.php?f=81 Mersenne Forum: CRUS base reservations]<br /> * [https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf Behind SRBase – A Short Guide (PDF)]<br /> * [https://www.boincstats.com/page/projectNews/157 SRBase news feed at BOINCstats]<br /> <br /> == References ==<br /> <br /> {{Reflist}}<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:Distributed computing projects]]<br /> [[Category:Number theory]]<br /> [[Category:Mathematics software]]<br /> [[Category:Prime numbers]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=BOINC_projects&diff=1420 2026-05-28T17:21:43Z

<p>Al Piskun: </p> <hr /> <div>{{SEO|description=BOINC Projects. A complete list of all active, private, and completed BOINC volunteer computing projects.}}<br /> This is a comprehensive and continually updating List of All [https://boinc.berkeley.edu/projects.php BOINC projects]<br /> <br /> '''''Q - What is a BOINC project?'''''<br /> <br /> '''''A - BOINC project definition:''''' A [https://boinc.berkeley.edu/ BOINC] project is a website and server set up by an individual or group to distribute applications (software which is a set of instructions for executing tasks in a computing device) to BOINC volunteer computing devices that are deliberately attached to receive, process and return the results of the application for further research.[[File:{{#setmainimage:Banner.png}}|right|frameless|100x63px|BOINC Projects]]<br /> {| align=&quot;center&quot;<br /> | __TOC__<br /> |}<br /> ====Active BOINC Projects====<br /> <br /> {| class=&quot;wikitable sortable&quot; style=&quot;font-size: 80%;&quot;<br /> |-<br /> !Project Name<br /> !Publications<br /> !Launched<br /> !Operating System<br /> !GPU App<br /> !Vbox<br /> !Screen saver<br /> !Sponsor<br /> !Category<br /> !BOINC Radio<br /> !Research Focus<br /> <br /> |-<br /> | [http://asteroidsathome.net/boinc/ Asteroids@home]<br /> | [https://boinc.berkeley.edu/pubs.php#Asteroids@home 10]<br /> | 2012-06-18<br /> | [https://asteroidsathome.net/boinc/apps.php Windows, Linux, ARM, MacOS, Free BSD, Android]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU NVIDIA<br /> | {{No}}<br /> |<br /> | Astronomical Institute, Charles University, Prague<br /> | Astronomy<br /> | [https://podcasts.apple.com/us/podcast/asteroids-home/id1492837872?i=1000467560195 Listen]<br /> | Derive shapes and spin for a significant part of the asteroid population. [[Asteroids@home|See more...]]<br /> <br /> |-<br /> | [https://boinc.berkeley.edu/central/ BOINC Central]<br /> |<br /> | 2023-02-04<br /> |<br /> | {{No}}t yet<br /> | {{No}}t yet<br /> |<br /> | University of California, Berkeley<br /> | Multiple applications<br /> |<br /> | Gives scientists access to the power of volunteer computing without having to operate a BOINC project. [[BOINC Central|See more...]]<br /> <br /> |-<br /> | [https://www.cpdn.org/cpdnboinc/ climate''prediction''.net]<br /> | [https://boinc.berkeley.edu/pubs.php#Climateprediction.net 152]<br /> | 2003-12-09<br /> | [https://www.cpdn.org/cpdnboinc/apps.php Windows, Linux, ARM, MacOS]<br /> | {{No}}<br /> | {{No}}<br /> | [https://youtu.be/Mae7JfL1giE view]<br /> | Oxford University<br /> | Climate study<br /> | [https://podcasts.apple.com/us/podcast/climate-prediction-dot-net/id1492837872?i=1000465982378 Listen]<br /> | Analyse ways to improve climate prediction models. [[Climateprediction.net|See more...]]<br /> <br /> |-<br /> | [https://dev.cpdn.org/ cpdnboinc dev]<br /> |<br /> |<br /> | [https://dev.cpdn.org/apps.php Windows, Linux, MacOS]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Oxford University<br /> | Software testing<br /> |<br /> | Test project for [[Climateprediction.net|climate''prediction''.net]]. [[Cpdnboinc dev|See more...]]<br /> <br /> |-<br /> | [https://denis.usj.es/denisathome/ DENIS@home]<br /> | [https://boinc.berkeley.edu/pubs.php#DENIS@home 6]<br /> | 2015-03-16<br /> | [https://480denis.usj.es/denisathome/apps.php Windows, Linux, ARM, MacOS]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Universidad San Jorge, Zaragoza, Spain<br /> | Medical physiology<br /> | [https://podcasts.apple.com/us/podcast/boinc-radio-project-brief-denis-home/id1492837872?i=1000576898376 Listen]<br /> | Cardiac electrophysiological simulations, studying the electrical activity of the heart. [[DENIS@home|See more...]]<br /> <br /> |-<br /> | [https://einsteinathome.org/ Einstein@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#Einstein@Home 42]<br /> | 2005-02-19<br /> | [https://einsteinathome.org/apps.php Windows, Linux, ARM, MacOS, Android]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> | [https://youtu.be/kGWsTnmk1lw view]<br /> | University of Wisconsin–Milwaukee, Max Planck Institute<br /> | Astrophysics<br /> | [https://podcasts.apple.com/us/podcast/einstein-home/id1492837872?i=1000470993092 Listen]<br /> | Search for pulsars using radio signals and gravitational wave data. [[Einstein@Home|See more...]]<br /> <br /> |-<br /> | [http://gaiaathome.eu/gaiaathome/ Gaia@home]<br /> |<br /> | 2019-08-21<br /> | [http://150.254.66.104/gaiaathome/apps.php Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Astronomical Observatory Institute, Faculty of Physics, Adam Mickiewicz University in Poznań<br /> | Astronomy<br /> |<br /> | Provide additional computing power to scientists studying the Gaia spacecraft data releases. [[Gaia@home|See more...]]<br /> <br /> |-<br /> | [https://gerasim.boinc.ru/ Gerasim@home]<br /> | [https://boinc.berkeley.edu/wiki/Publications_by_BOINC_projects#Gerasim.40home 9]<br /> | 2007-02-10<br /> | [https://gerasim.boinc.ru/apps.php Windows, Linux]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> | [https://youtu.be/cw7yBZ_KGGA view]<br /> | Southwest State University (Russia)<br /> | Multiple applications<br /> | [https://podcasts.apple.com/us/podcast/gerasim/id1492837872?i=1000515709940 Listen]<br /> | Research in discrete mathematics and logic control systems. [[Gerasim@home|See more...]]<br /> <br /> |-<br /> | [https://web.archive.org/web/20090210175851/http://www.ps3grid.net/ PS3GRID] became [https://gpugrid.net/gpugrid/ GPUGRID]<br /> | [https://boinc.berkeley.edu/pubs.php#GPUGrid.net 53]<br /> | 2007-12-05<br /> | [https://www.gpugrid.net/apps.php Windows, Linux]<br /> | style=&quot;vertical-align:center;text-align:center; background: cyan; color: black;&quot; | GPU only NVIDIA<br /> | {{No}}<br /> |<br /> | Barcelona Biomedical Research Park<br /> | Molecular biology<br /> |<br /> | Perform full-atom molecular simulations of proteins on Nvidia GPUs for biomedical research. [[GPUGRID|See more...]]<br /> <br /> |-<br /> | [https://comp.ithena.net/usr/ iThena.Computational]<br /> |<br /> | [https://comp.ithena.net/usr/forum_thread.php?id=4 2021-10-31]<br /> | [https://comp.ithena.net/usr/apps.php Windows, Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Cyber-Complex Foundation<br /> | Computer science<br /> | See below<br /> | A computational platform for analysis based on data extracted from iThena.Measurements project applications/sensors. [[IThena.Computational|See more...]]<br /> <br /> |-<br /> | [https://root.ithena.net/usr/ iThena.Measurements]<br /> |<br /> | [https://root.ithena.net/usr/forum_thread.php?id=5#17 2019-09-25]<br /> | [https://einsteinathome.org/apps.php Windows, Linux, ARM]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Cyber-Complex Foundation<br /> | Computer science<br /> | [https://podcasts.apple.com/us/podcast/boinc-radio-project-brief-ithena/id1492837872?i=1000580505988 Listen]<br /> | Generate a dynamic topological model of the Internet, based on measurements from distributed devices. [[IThena.Measurements|See more...]]<br /> <br /> |-<br /> | [https://lhcathome.cern.ch/lhcathome/ LHC@home]<br /> | [https://boinc.berkeley.edu/pubs.php#LHC@home 71]<br /> | 2004-01-09<br /> | [https://lhcathome.cern.ch/lhcathome/apps.php Windows, Linux, ARM, MacOS, Free BSD, Android]<br /> | {{No}}<br /> | {{Yes}}, Both<br /> | [https://youtu.be/0qbLDbsNO3w view]<br /> | CERN<br /> | Physics<br /> | [https://podcasts.apple.com/us/podcast/lhc-home/id1492837872?i=1000477722614 Listen]<br /> | Helping physicists compare theory with experiment, in the search for new fundamental particles and answers to questions about the Universe. [[LHC@home|See more...]]<br /> <br /> |-<br /> | [https://lhcathomedev.cern.ch/lhcathome-dev/ LHCathome-dev]<br /> |<br /> | 2014-08-01<br /> | [https://lhcathomedev.cern.ch/lhcathome-dev/apps.php Windows, Linux, ARM, MacOS, Free BSD, Android]<br /> | {{No}}<br /> | {{Yes}}, Both<br /> |<br /> | CERN<br /> | Software testing<br /> |<br /> | A BOINC server for LHC@home development.<br /> <br /> |-<br /> | [https://boinc.loda-lang.org/loda/ LODA]<br /> |<br /> | 2022-05-13<br /> | [https://boinc.thesonntags.com/collatz/apps.php Windows, Linux, ARM, MacOS]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> | [https://podcasts.apple.com/us/podcast/boinc-radio-project-brief-loda-18-6-2022/id1492837872?i=1000570153809 Listen]<br /> | Finds new formulas and more efficient algorithms for a wide range of non-trivial integer sequences. [[LODA|See more...]]<br /> <br /> |-<br /> | [https://milkyway.cs.rpi.edu/milkyway/ MilkyWay@home]<br /> | [https://boinc.berkeley.edu/pubs.php#Milkyway@home 35]<br /> | 2007-07-07<br /> | [https://milkyway.cs.rpi.edu/milkyway/apps.php Windows, Linux, MacOS]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Rensselaer Polytechnic Institute<br /> | Astronomy<br /> | [https://podcasts.apple.com/us/podcast/milkyway-home/id1492837872?i=1000468872520 Listen]<br /> | Create a highly accurate three-dimensional model of the Milky Way galaxy using data collected from the Sloan Digital Sky Survey. [[MilkyWay@home|See more...]]<br /> <br /> |-<br /> | [https://minecraftathome.com/minecrafthome/ Minecraft@Home]<br /> |<br /> | 2020-06-24<br /> | [https://comp.ithena.net/usr/apps.php Windows, Linux, ARM]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | Independent<br /> | Games<br /> | [https://podcasts.apple.com/us/podcast/minecraft-home/id1492837872?i=1000491697377 Listen]<br /> | Studies questions related to Minecraft, such as the properties of worlds that can be generated from different random seeds. [[Minecraft@Home|See more...]]<br /> <br /> |-<br /> | [https://moowrap.net/ Moo! Wrapper]<br /> |<br /> | 2011-02-05<br /> | [https://moowrap.net/apps.php Windows, Linux, ARM, MacOS]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | Independent<br /> | Cryptography<br /> | [https://www.youtube.com/watch?v=xZmTZJBh_D0 Watch]<br /> | Combines BOINC with distributed.net to try to break the RC5 cipher. [[Moo! Wrapper|See more...]]<br /> <br /> |-<br /> | [https://escatter11.fullerton.edu/nfs/ NFS@Home]<br /> |<br /> | 2009-09-05<br /> | [https://escatter11.fullerton.edu/nfs/apps.php Windows, Linux, MacOS, Free BSD]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | California State University, Fullerton<br /> | Integer factorization<br /> |<br /> | Performs parts of the number field sieve in the factorization of large integers. [[NFS@Home|See more...]]<br /> <br /> |-<br /> | [https://numberfields.asu.edu/NumberFields/ NumberFields@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#NumberFields@Home 3]<br /> | 2011-08-12<br /> | [https://numberfields.asu.edu/NumberFields/apps.php Windows, Linux, MacOS]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | Arizona State University's School of Mathematics<br /> | Number theory<br /> | [https://podcasts.apple.com/us/podcast/project-brief-numberfields-home-15-05-2021/id1492837872?i=1000570068591 Listen]<br /> | Search for number fields with special properties to assist with the formulation of mathematical conjectures. [[NumberFields@Home|See more...]]<br /> <br /> |-<br /> | [https://boinc.progger.info/odlk/ ODLK]<br /> |<br /> | 2017-04-06<br /> | [https://boinc.progger.info/odlk/apps.php Windows, Linux, MacOS, Free BSD]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> |<br /> | Compiles a database of canonical forms (CF) of 10th order diagonal Latin squares (DLS) with orthogonal diagonal Latin squares (ODLS). [[ODLK|See more...]]<br /> <br /> |-<br /> | [https://boinc.multi-pool.info/latinsquares/ ODLK1]<br /> |<br /> | 2017-10-22<br /> | [https://boinc.multi-pool.info/latinsquares/apps.php Windows, Linux, Free BSD]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> |<br /> | Generates a database of canonical forms (CF) of diagonal Latin squares (DLS) of order 10 having orthogonal diagonal Latin squares (ODLS). [[ODLK1|See more...]]<br /> <br /> |-<br /> | [https://boinc.mak.termit.me/odlk2025/ ODLK2025]<br /> |<br /> | 2024-12-18<br /> | [https://boinc.mak.termit.me/odlk2025/apps.php Windows]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> |<br /> | Find canonical forms of diagonal Latin squares of order 10 with orthogonal diagonal Latin squares, extending the search beyond the ranges covered by ODLK and ODLK1. [[ODLK2025|See more...]]<br /> <br /> |-<br /> | [https://www.primegrid.com/ PrimeGrid]<br /> | [https://boinc.berkeley.edu/pubs.php#PrimeGrid 3]<br /> | 2005-06-12<br /> | [https://www.primegrid.com/apps.php Windows, Linux, MacOS]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> | [https://youtu.be/rhZxqi9x7rI view]<br /> | Independent<br /> | Mathematics<br /> |<br /> | Search for world record sized prime numbers, search for particular types of primes such as 321 primes, Cullen-Woodall primes, Proth prime, prime Sierpinski numbers, and Sophie Germain primes. Subprojects also include Seventeen or Bust, and the Riesel problem. [[PrimeGrid|See more...]]<br /> <br /> |-<br /> | [https://dev.primegrid.com/ PrimeGrid dev]<br /> |<br /> | 2007-06-06<br /> | [https://dev.primegrid.com/apps.php Windows, Linux, MacOS]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | Independent<br /> | Software testing<br /> |<br /> | Test project for PrimeGrid.<br /> <br /> |-<br /> | [http://boincvm.proxyma.ru:30080/test4vm/ PRIVATE GFN SERVER]<br /> |<br /> | 2016-04-20<br /> | [http://boincvm.proxyma.ru:30080/test4vm/apps.php Windows, Linux]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> |<br /> | This is a PRIVATE SERVER to coordinate distribution of mathematical work on GFN. The server is open for everybody, but some BOINC experience is recommended. [[PRIVATE GFN SERVER|See more...]]<br /> <br /> |-<br /> | [http://radioactiveathome.org/boinc/ Radioactive@home]<br /> |<br /> | 2011-10-21<br /> | [http://radioactiveathome.org/boinc/apps.php Windows, Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Physics<br /> | [https://podcasts.apple.com/us/podcast/radioactive-home/id1492837872?i=1000463072395 Listen]<br /> | Real-time radiation monitoring, detected by gamma sensors connected to volunteer computers. [[Radioactive@home|See more...]]<br /> <br /> |-<br /> | [https://rake.boincfast.ru/rakesearch/ RakeSearch]<br /> | [https://boinc.berkeley.edu/pubs.php#Rakesearch 4]<br /> | 2017-08-11<br /> | [https://rake.boincfast.ru/rakesearch/apps.php Windows, Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> | [https://podcasts.apple.com/us/podcast/rakesearch/id1492837872?i=1000496377228 Listen]<br /> | Implement an application that picks up separate pairs of mutually orthogonal DLSs, which allows reconstructing the full graphs of their orthogonality. [[Rakesearch|See more...]]<br /> <br /> |-<br /> | [https://rnma.xyz/boinc/ Ramanujan Machine]<br /> | [https://boinc.berkeley.edu/pubs.php#Ramanujan 2]<br /> | 2021-10-14<br /> | [https://rnma.xyz/boinc/apps.php Windows, Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> | [https://podcasts.apple.com/us/podcast/project-brief-ramanujan-machine-5-2-2022/id1492837872?i=1000570072053 Listen]<br /> | Conjecturing new mathematical formulas. [[Ramanujan Machine|See more...]]<br /> <br /> |-<br /> | [https://boinc.bakerlab.org/rosetta/ Rosetta@home]<br /> | [https://boinc.berkeley.edu/pubs.php#Rosetta@home 234]<br /> | 2005-10-06<br /> | [https://boinc.bakerlab.org/rosetta/apps.php Windows, Linux, ARM, macOS, Android]<br /> | {{No}}<br /> | {{Yes}}, Both<br /> | [https://youtu.be/6o5yBfG_vss view]<br /> | University of Washington<br /> | Molecular biology<br /> | [https://podcasts.apple.com/us/podcast/rosetta-home/id1492837872?i=1000472931628 Listen]<br /> | Protein structure prediction for disease research. [[Rosetta@home|See more...]]<br /> <br /> |-<br /> | [https://www.sidock.si/sidock SiDock@home]<br /> |<br /> | 2020-12-19<br /> | [https://www.sidock.si/sidock/apps.php Windows, Linux+OpenWrt, ARM, macOS]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Russian Academy of Sciences<br /> | Molecular biology<br /> |<br /> | Independent decentralized drug design by volunteer computing. [[SiDock@home|See more...]]<br /> <br /> |-<br /> | [https://spaciousathome.eu/spaciousathome/ SPACIOUS@home]<br /> |<br /> | 2024-01-01<br /> | [https://spaciousathome.eu/spaciousathome/apps.php Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | European Union<br /> | Astrophysics<br /> |<br /> | Contribute to cutting-edge astronomy by sharing your idle computing time with professional astronomers. Space surveys such as the European Space Agency's Gaia telescope are generating large datasets of unprecedented high quality data. Astronomers need a huge amount of CPU power to model and analyse the data. [[SPACIOUS@home|See more...]]<br /> <br /> |-<br /> | [https://srbase.my-firewall.org/sr5/ SRBase]<br /> |<br /> | 2013-01-02<br /> | [https://srbase.my-firewall.org/sr5/apps.php Windows, Linux, MacOS]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> |<br /> | Trying to solve Sierpinski / Riesel Bases up to 1030. [[SRBase|See more...]]<br /> <br /> |-<br /> | [https://gene.disi.unitn.it/test/ TN-Grid]<br /> | [https://boinc.berkeley.edu/pubs.php#TN-Grid 8]<br /> | 2014-05-01<br /> | [https://gene.disi.unitn.it/test/apps.php Windows, Linux, ARM, macOS]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Research Area of Trento of the National Research Council of Italy, University of Trento<br /> | Genetics<br /> | [https://podcasts.apple.com/us/podcast/tn-grid/id1492837872?i=1000482396321 Listen]<br /> | ''Gene@home'' is a scientific project belonging to the infrastructure ''TrentoGrid''. It aims to expand networks of genes. [[TN-Grid|See more...]]<br /> <br /> |-<br /> | [https://uspex-at-home.ru/prediction/ USPEX@HOME]<br /> | [https://boinc.berkeley.edu/pubs.php#USPEX@HOME 2]<br /> | 2017-04 (Restart 2022-10-23)<br /> | [https://uspex-at-home.ru/prediction/apps.php Windows, Linux, macOS]<br /> | {{No}}<br /> | {{Yes}}, Both<br /> |<br /> | [https://uspex-team.org/en uspex-team.org]<br /> |<br /> |<br /> | Research in the field of computational materials design. [[USPEX@HOME|See more...]]<br /> <br /> |-<br /> | [https://www.worldcommunitygrid.org/ World Community Grid]<br /> | [https://www.worldcommunitygrid.org/about_us/news.s?filterCategory=1_0&amp;filterTags=14&amp;sortBy=&amp;pageNum=1 77]<br /> | 2004-11-16<br /> | [https://boinc.berkeley.edu/projects.php Windows, Linux, ARM, macOS, Android]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> | [https://www.youtube.com/playlist?list=PLblxpyGay1Q4PwdIlLTxko7jm9Jedv1ei view]<br /> | Krembil Research Institute<br /> | Multiple applications<br /> |<br /> | Disease research, various worldwide humanitarian problems. Subprojects include(d) GO Fight Against Malaria, Drug Search for Leishmaniasis, Computing for Clean Water, Clean Energy Project, Discovering Dengue Drugs - Together, Help Cure Muscular Dystrophy, Help Fight Childhood Cancer, Help Conquer Cancer, Mapping Cancer Markers, Human Proteome Folding Project, FightAIDS@Home, Uncovering Genome Mysteries, Let's outsmart Ebola together, Help Stop TB, OpenZika, Smash Childhood Cancer, Open Pandemics - COVID-19. [[World Community Grid|See more...]]<br /> <br /> |-<br /> | [https://wuprop.boinc-af.org/ WUProp@Home]<br /> |<br /> | 2010-03-27<br /> | [https://wuprop.boinc-af.org/apps.php Windows, Linux, ARM, MacOS, Android]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Statistics<br /> |<br /> | Collect various statistics about other BOINC projects. [[WUProp@Home|See more...]]<br /> <br /> |-<br /> | [https://yafu.myfirewall.org/yafu YAFU]<br /> |<br /> | 2011-09-01<br /> | [https://yafu.myfirewall.org/yafu/apps.php Windows, Linux]<br /> | {{No}}<br /> | {{No}}<br /> | [https://youtu.be/vEqImf6mtgE view]<br /> | Independent<br /> | Software testing, Mathematics<br /> |<br /> | Test BOINC server software, integer factorization. [[YAFU|See more...]]<br /> <br /> |-<br /> | [https://www.rechenkraft.net/yoyo/ yoyo@home]<br /> | [https://boinc.berkeley.edu/pubs.php#Yoyo@home 9]<br /> | 2007-07-19<br /> | [https://www.rechenkraft.net/yoyo/apps.php Windows, Linux, ARM, macOS]<br /> | {{No}}<br /> | {{No}}<br /> | [https://www.youtube.com/playlist?list=PLblxpyGay1Q4C8qBmkKkI0MpKMTof5Dhf view]<br /> | Independent<br /> | Mathematics, physics, evolution<br /> |<br /> | Data structure analysis to help prove a conjecture, elliptic curve factorization, pion creation in a particle accelerator, evolution research, find the shortest optimal Golomb ruler of length 28. [[Yoyo@home|See more...]]<br /> |}<br /> <br /> ==== Private BOINC Projects====<br /> <br /> {| class=&quot;wikitable sortable&quot; style=&quot;font-size: 80%;&quot;<br /> |-<br /> !Project Name<br /> !Publications<br /> !Launched<br /> !Operating System<br /> !GPU App<br /> !Vbox<br /> !Screen saver<br /> !Sponsor<br /> !Category<br /> !BOINC Radio<br /> !Research Focus<br /> <br /> |-<br /> | [https://boinc.berkeley.edu/alpha/ BOINC Alpha Test]<br /> |<br /> | 2004-02-16<br /> |<br /> |<br /> |<br /> | [https://youtu.be/9rRWAgpfMzg view]<br /> | University of California, Berkeley<br /> | Software testing<br /> |<br /> | BOINC Alpha Test allows volunteers to test new versions of BOINC client software on a wide range of computers, thereby increasing the stability and reliability of the software versions released to the public.<br /> <br /> |-<br /> | [http://mq232-80.ararangua.ufsc.br/boincufscara/ AraBOINC]<br /> |<br /> | 2012<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/https://boinc.moisescardona.me/ Distributed Data and Media Processing]<br /> |<br /> | 2018<br /> |<br /> |<br /> |<br /> |<br /> | Independent<br /> | Data processing<br /> |<br /> | A private data processing project where tasks like data compression and audio encoding are performed. The idea is to do data tasks in the background and in a distributed fashion.<br /> <br /> |-<br /> | [https://bioinfo.lifl.fr/yass/iedera_dominance/index_additional.html iedera]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Independent<br /> | Botany<br /> |<br /> | A program to select and design ''subset seed'' and ''vectorized subset seed'' patterns.<br /> <br /> |-<br /> | [http://boinc.mmon.co/boincserver/ Common Compute]<br /> |<br /> | 2024-05<br /> |<br /> |<br /> |<br /> |<br /> | Independent<br /> |<br /> |<br /> | Software testing.<br /> <br /> |-<br /> | [https://templet.ssau.ru/ Templet Project]<br /> | [https://boinc.berkeley.edu/pubs.php#Templet 1]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Samara National Research University<br /> | Education<br /> |<br /> | Teach parallel and distributed programming to undergraduate and graduate students of Samara National Research University.<br /> |}<br /> <br /> ====Completed BOINC Projects ====<br /> <br /> {| class=&quot;wikitable sortable&quot; style=&quot;font-size: 80%;&quot;<br /> |-<br /> !Project Name<br /> !Publications<br /> !Launched / Completed<br /> !Operating System<br /> !GPU App<br /> !Vbox<br /> !Screen saver<br /> !Sponsor<br /> !Category<br /> !BOINC Radio<br /> !Research Focus<br /> <br /> |-<br /> | [https://setiathome.berkeley.edu/ SETI@home]<br /> | [https://boinc.berkeley.edu/pubs.php#SETI@home 12]<br /> | 1999-05<br /> | [https://setiathome.berkeley.edu/apps.php Windows, Linux, MacOS, Solaris, Other]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> |<br /> | [https://youtu.be/IfeGNAZY92k view] and [https://youtu.be/5r-t8WQicqE view]<br /> | University of California, Berkeley<br /> | Astronomy<br /> | [https://podcasts.apple.com/us/podcast/tribute-to-seti-home-part-1/id1492837872?i=1000468003990 Part 1] of three and [https://podcasts.apple.com/us/podcast/tribute-to-seti-home-part-2-the-history-of-seti-home/id1492837872?i=1000468428937 Part 2]<br /> | In 1995, David Gedye proposed doing radio SETI using a virtual supercomputer composed of large numbers of Internet-connected computers, and he organized the SETI@home project to explore this. The search for extraterrestrial life by analyzing radio frequencies emanating from space.<br /> <br /> |-<br /> | [http://setiweb.ssl.berkeley.edu/beta/ SETI@home Beta]<br /> |<br /> | 2006-01-12<br /> | [https://setiweb.ssl.berkeley.edu/beta/apps.php Windows, Linux, MacOS, Solaris, Other]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> |<br /> | [https://youtu.be/buLKZnyzOdI view]<br /> | University of California, Berkeley<br /> | Software testing<br /> | [https://podcasts.apple.com/us/podcast/rosetta-home-covid19-and-tribute-to-seti-home-part-3/id1492837872?i=1000469085793 Part 3]<br /> | Test project for SETI@home.<br /> <br /> |-<br /> | [https://web.archive.org/web/20040615010643/http://predictor.scripps.edu/ Predictor@home]<br /> | [https://boinc.berkeley.edu/pubs.php#Predictor@Home 5]<br /> | 2004-05-04<br /> | WinXP-98, Linux, MacOS X (Not Intel)<br /> |<br /> |<br /> |<br /> | The Scripps Research Institute<br /> |<br /> |<br /> | A world-community experiment and effort to use distributed world-wide-web volunteer resources to assemble a supercomputer able to ''predict protein structure from protein sequence''. Our work is aimed at testing and evaluating new algorithms and methods of protein structure prediction in the context of the Sixth Biannual [https://web.archive.org/web/20040610024610/http://predictioncenter.llnl.gov/casp6/Casp6.html CASP] (Critical Assessment of Techniques for Protein Structure Prediction) experiment.<br /> <br /> |-<br /> | [https://web.archive.org/http://alifeathome.dyndns.org/ ALife@Home]<br /> |<br /> | 2004-07-19<br /> | WinXP-98<br /> |<br /> |<br /> |<br /> |<br /> | Artificial intelligence<br /> | [https://www.youtube.com/live/zstEf1dTm2I?feature=share Watch]<br /> | An effort to conduct scientific experiments regarding neural networks and evolution on the computers of volunteers.<br /> <br /> |-<br /> | [https://web.archive.org/web/20040829080146/http://pirates.vassar.edu:80/ Pirates@HomeMission1] [https://web.archive.org/web/20060117061652/http://pirates.spy-hill.net/ Pirates@Home] [http://primates.spy-hill.net/ Primates@Home]<br /> |<br /> | 2004 / 2006 / 2008-04-01<br /> | Windows, Linux, MacOS<br /> |<br /> |<br /> | [https://www.youtube.com/playlist?list=PLblxpyGay1Q4849w-GB4X7g07FNXTeMBb view]<br /> | Vassar College / Independent / Independent<br /> | Software testing<br /> | [https://www.youtube.com/live/qr-n6FziUeo?feature=share Watch]<br /> | Pirates@Home Mission 1 helped to develop the Einstein@Home screensaver. Pirates@Home tested BOINC's forum software for possible use by ''[http://i2u2.spy-hill.net/ Interactions in Understanding the Universe]''. Primates@Home tested the reaction of [https://web.archive.org/web/20060117061652/http://pirates.spy-hill.net/ Pirates@Home] users to a disturbance in their accustomed environment.<br /> <br /> |-<br /> | [https://web.archive.org/web/20060215003906/http://autotranslator.net:80/ translator@home]<br /> |<br /> | 2005-03-23<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | translator@home was in the process of creating new software linked to BOINC but never developed.<br /> <br /> |-<br /> | [https://web.archive.org/web/20051027013808/http://public.shoft.net/ Shoft@Home]<br /> |<br /> | 2005<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Independent<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://boinctest.axpr.net/ Break the Forum!]<br /> |<br /> | 2005<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> | Software testing<br /> |<br /> | Test BOINC forum software.<br /> <br /> |-<br /> | [https://web.archive.org/http://fsmtdist.ist.tu-graz.ac.at/dist/ dIST]<br /> |<br /> | 2005<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A Cape4 project.<br /> <br /> |-<br /> | [http://fsmtdist.ist.tu-graz.ac.at/cape4/index.php cape4]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Another Cape4 project.<br /> <br /> |-<br /> | [https://web.archive.org/http://grid-devel3.rocksclusters.org/boinc_gamess/ BOINC GAMESS]<br /> |<br /> | 2005<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Independent<br /> |<br /> |<br /> | Project never overcame '''Warning''': mysql_pconnect(): Can't connect to local MySQL server through socket.<br /> <br /> |-<br /> | [https://web.archive.org/web/20060103125636/http://bifi.unizar.es/research/computing/bah/ BIFI@home]<br /> |<br /> | {{No}}<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Solve calculations that contribute to the research carried out at the Institute of Biocomputing and Physics of Complex Systems at the University of Zaragoza (BIFI).<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc.azurite.co.uk/ IMP]<br /> |<br /> | 2005<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | The IMP Team<br /> | Software testing<br /> |<br /> | Internet Movie Project. Test Project copyright © 2005 The IMP Team.<br /> <br /> |-<br /> | [https://web.archive.org/http://lhcathome-alpha.cern.ch/ LHC@home Alpha]<br /> |<br /> | 2005<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> |<br /> | Software testing<br /> |<br /> | Test Project for LHC@home.<br /> <br /> |-<br /> | [https://web.archive.org/web/20071016235617/http://boinc.banaan.org:80/hashclash/ HashClash]<br /> | [https://boinc.berkeley.edu/pubs.php#HashClash 11]<br /> | 2005-11-24<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Using techniques from the attack from Wang et al., we are trying to find collisions which are more flexible. More concretely, we will allow the first blocks of two messages to be chosen at will. This attack is in ongoing research, however it is already clear that it requires large scale computational power. Therefore, project HashClash was started.<br /> <br /> |-<br /> | [https://web.archive.org/web/20060703095044/http://issofty17.is.noda.tus.ac.jp/index_E.php TANPAKU]<br /> | [https://boinc.berkeley.edu/pubs.php#TANPAKU 2]<br /> | 2005-08-02<br /> | WinXP, Linux<br /> |<br /> |<br /> |<br /> | Tokyo University of Science<br /> |<br /> |<br /> | Analyzed protein structure prediction.<br /> <br /> |-<br /> | [http://slawoo.homelinux.org/ Nagrzewanie stali@HOME]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://lattice.umiacs.umd.edu/boinc_public_oldschool/ The Lattice Project-original]<br /> | [https://boinc.berkeley.edu/pubs.php#The 16]<br /> | 2006<br /> | WinXP-98<br /> |<br /> |<br /> |<br /> | University of Maryland, College Park<br /> |<br /> |<br /> | The Cummings Laboratory is using ''gsi'' to assess the performance of the statistic in a variety of situations. Maile Neel and Joanna Grand are using Marxan to quantify the effects of poor and incomplete data on the ability to capture biological diversity in nature reserves. The Laboratory of David Fushman is running protein:protein docking algorithms on Lattice. Floyd Reed and Holly Mortensen from the Laboratory of Sarah Tishkoff have run a number of MDIV and IM simulations through The Lattice Project.<br /> <br /> |-<br /> | [https://web.archive.org/web/20060916002226/http://fah-boinc.stanford.edu/ Folding@home]<br /> |<br /> | 2006<br /> | WinXP<br /> |<br /> |<br /> |<br /> | Stanford University<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20060901142513/http://research.utep.edu/Default.aspx?alias=research.utep.edu/daplds Docking@Home-utep]<br /> |<br /> | {{No}}<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of Texas at El Paso<br /> |<br /> |<br /> | The goals of the project are to explore the multi-scale nature of algorithmic adaptations in protein-ligand docking and to develop cyber infrastructures based on computational methods and models that efficiently accommodate these adaptations.<br /> <br /> |-<br /> | [https://web.archive.org/http://ecc.crypto.ruhr-uni-bochum.de/ ECDLP PROJECT]<br /> |<br /> | 2006<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20070326165532/http://test.ntbz.com:80/ ntbz Test Project]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Software testing<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://debian.povaddict.com.ar/pov/ Renderfarm]<br /> |<br /> | 2006-08-10<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Another URL for the project: http://renderfarm.povaddict.com.ar/<br /> <br /> |-<br /> | [https://www.boincstats.com/stats/33/project/detail/ RenderFarm@Home]<br /> |<br /> | 2006-08-23<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://hashbreaker.com:8700/tmrldrtg/ Distributed Rainbow Table Generator]<br /> |<br /> | 2006<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> | The Minouche Research Laboratories<br /> |<br /> |<br /> | The '''Distributed Rainbow Table Generator''' project of '''The Minouche Research Laboratories'''; a community project dedicated to large scale distributed calculation of huge Rainbow Tables.<br /> <br /> |-<br /> | [https://web.archive.org/http://bebeer.dyndns.org:2222/bebeer/ Belgian Beer@Home]<br /> |<br /> | 2006-12-08<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> | [https://web.archive.org/web/20070630030320/http://www.boinc.be/vbulletin BOINC.BE]<br /> |<br /> |<br /> | An effort of people from the [https://web.archive.org/web/20070630030320/http://www.boinc.be/vbulletin BOINC.BE] team.<br /> <br /> |-<br /> | [http://www.enigmaathome.net/ Enigma@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#Enigma@Home 2]<br /> | 2007-08-24<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | An attempt to break 3 original Enigma messages that were intercepted in 1942.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080511223553/http://impfarm.imp.org/boinc/ Internet Movie Project]<br /> |<br /> | 2007-07-15<br /> | [https://web.archive.org/web/20080724214454/http://impfarm.imp.org/boinc/apps.php Windows, Linux, MacOS]<br /> |<br /> |<br /> |<br /> |<br /> | Software testing<br /> |<br /> | Setting up a renderfarm to power the [https://web.archive.org/web/20080511223553/http://www.imp.org/ Internet Movie Project]. Note that this project will never export credit stats.<br /> <br /> |-<br /> | [http://predictor.chem.lsa.umich.edu/pah/ Predictor@home Alpha]<br /> |<br /> | 2007 / 2009<br /> |<br /> |<br /> |<br /> |<br /> | The Scripps Research Institute<br /> |<br /> |<br /> | Test project for Predictor@home.<br /> <br /> |-<br /> | [https://web.archive.org/web/20071001120117/http://zivis.bifi.unizar.es:80/ Zivis Superordenador Ciudadano]<br /> |<br /> | 2007<br /> | [https://web.archive.org/web/20070823192420/http://zivis.bifi.unizar.es/apps.php WinXP, Linux]<br /> |<br /> |<br /> |<br /> |<br /> | Software testing<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://zebrabrute.ath.cx/zebrabrute/ Zebra RSA Brutforce]<br /> |<br /> | 2007<br /> | WinXP-98<br /> |<br /> |<br /> |<br /> | Darkscout - a Computer Science student.<br /> |<br /> |<br /> | The Project originates from an idea in a forum. An attempt to break the RSA-key for the checksum of RSA-Smart card by Brute-force search.<br /> <br /> |-<br /> | [http://web.archive.org/web/20090306065822/http://dist2.ist.tugraz.at/sudoku/ Sudoku project]<br /> |<br /> | 2007-08-27<br /> |<br /> |<br /> |<br /> |<br /> | Graz, University of Technology<br /> |<br /> |<br /> | Uses Internet-connected computers to search for the smallest possible start configuration of Sudoku.<br /> <br /> |-<br /> | [https://web.archive.org/web/20071128150637/http://eternity2.net:80/ Eternity2.net]<br /> |<br /> | 2007<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Dave Clark, Auckland<br /> |<br /> |<br /> | A project to try to solve the Eternity II puzzle™.<br /> <br /> |-<br /> | [http://roc.cs.berkeley.edu/projects/boinc/index.html ROC]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of California, Berkeley<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://neuron.mine.nu/neuron/ Project Neuron]<br /> |<br /> | 2007-11-25<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> | Independent<br /> |<br /> |<br /> | Provide a trial BOINC environment in which a set of dummy applications will run. The purpose of this being to record, observe and understand BOINC activity and data with a view to developing metrics that will establish or otherwise the quality/reliability/dependability of particular BOINC projects.<br /> <br /> |-<br /> | [https://web.archive.org/web/20071020023328/http://www.gridfinity.com:80/gridfinity/ Gridfinity]<br /> |<br /> | 2007<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://www.scilinc.org/SciLINC/ SciLINC]<br /> |<br /> | 2007-03-22<br /> | WinXP-98<br /> |<br /> |<br /> |<br /> | Missouri Botanical Garden<br /> |<br /> |<br /> | Increase public access to nationally significant scientific literature. Enhance the usefulness of digitized materials by creating a Web repository of scanned literature, keywords, and online resources with tools for searching and analysis. Create an educational tool for learning about plant life. Provide a model for adopting public-resource computing applications within the library community.<br /> <br /> |-<br /> | [http://isaac.ssl.berkeley.edu/sleeper/ Sleeper]<br /> |<br /> | 2007-03<br /> |<br /> |<br /> |<br /> |<br /> | University of California, Berkeley<br /> |<br /> |<br /> | Test project for BOINC Alpha Test.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080901231107/http://www.init1.net:80/pPotTables/ pPot Tables]<br /> |<br /> | 2008<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Independent<br /> |<br /> |<br /> | Computing relative hand strength and 1-card lookahead positive potential for all possible flop, turn and hole card combinations for 2 to 10 players in Texas hold 'em.<br /> <br /> |-<br /> | [https://web.archive.org/web/20121205084825/http://www.malariacontrol.net/ Malariacontrol.net]<br /> | [https://boinc.berkeley.edu/pubs.php#Malariacontrol.net 26]<br /> | 2006-03-01<br /> | WinXP-98, Linux<br /> |<br /> |<br /> | [https://youtu.be/4GAYKw5SakQ view]<br /> |<br /> |<br /> |<br /> | A project with an application that makes use of network computing for stochastic modelling of the clinical epidemiology and natural history of Plasmodium falciparum malaria.<br /> <br /> |-<br /> | [https://web.archive.org/web/20061206015653/http://biology.polytechnique.fr/proteinsathome/ proteins@home]<br /> | [https://boinc.berkeley.edu/pubs.php#Proteins@home 4]<br /> | 2006-09-15<br /> | WinXP<br /> |<br /> |<br /> | [https://youtu.be/aM6kiaM228Y view]<br /> |<br /> |<br /> |<br /> | A large-scale Protein structure prediction project to contribute to a better understanding of many diseases and pathologies, and to progress in both Medicine and Technology.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080517170329/http://www.depspid.net:80/ DepSpid]<br /> |<br /> | 2007<br /> | WinXP-98<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Every DepSpid task is processed in two phases: a networking phase (Phase One) in which the DepSpid spider scans a set of web pages and stores results in a temporary database; and a computational phase (Phase Two) which uses the collected data to calculate dependencies between all pages.<br /> <br /> |-<br /> | [https://web.archive.org/http://bob.myisland.as/tsp/ Traveling Salesman Problem (TSP)]<br /> |<br /> | 2007<br /> | WinXP, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | The Travelling salesman problem (TSP): for a given set of cities, visit each city once and only once and minimize the distance you travel.<br /> <br /> |-<br /> | [https://web.archive.org/web/20060412015807/http://xw01.lri.fr:4320/ XtremLab]<br /> |<br /> | 2005<br /> | WinXP, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Measuring the free resources available on personal computers involved in large-scale distributed computing.<br /> <br /> |-<br /> | [https://web.archive.org/web/20060903103622/http://bbc.cpdn.org/ BBC Climate Change Experiment]<br /> |<br /> |<br /> | WinXP, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20090107014341/http://allprojectstats.com/collatz/ 3x+1@home]<br /> |<br /> | 2008-02-18<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A non-profit project trying to find high 3x+1 conjecture stopping times. The 3x+1 conjecture is also known as the Collatz conjecture.<br /> <br /> |-<br /> | [https://web.archive.org/http://edges-local-devbnc-srv.ceta-ciemat.es/appexample/ Uppercase Application]<br /> |<br /> | 2008<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [http://193.144.240.190/nnsimu/ NNSIMU Project]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20090204215407/http://boinc.unex.es/extremadurathome/ Extremadura@Home]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20090528015437/http://boinc.isa.ru:80/russiadg/ Russian Desktop Grid]<br /> |<br /> | 2009<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/web/20110801221116/http://falua.cesfelipesegundo.com/VRS/ Virus Respiratorio Sincitial (VRS)]<br /> | [https://linkinghub.elsevier.com/retrieve/pii/S0895717710005595 1]<br /> | 2010<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | VRS (from the Spanish Virus Respiratorio Sincitial) is a BOINC-based project which main aim is to simulate the behaviour of the human Respiratory Syncytial Virus (RSV).<br /> <br /> |-<br /> | [https://web.archive.org/web/20081004231715/http://cels-at-home-dev.dyndns.org:80/test2/ &lt;nowiki&gt;Cels@Home [Second] Test Project&lt;/nowiki&gt;]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in cell adhesion.<br /> <br /> |-<br /> | [https://web.archive.org/web/20090925001717/http://boinc.vanderbilt.edu:80/test_setup Test Setup Project]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Vanderbilt<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/http://grid.ncssm.edu/ncssm_grid/ NCSSM Grid Computing Project]<br /> |<br /> | 2007-04-04<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20051226054712/http://www.cellcomputing.net/simple/ Cell Computing]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://arcoboinc.unex.es/rnd/ RND@home]<br /> |<br /> | 2007<br /> | WinXP, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Radio Network Design (RND) is a telecommunication problem which consists in covering a geographic area with radio signal using the fewer number of transmitters that cover the maximum area.<br /> <br /> |-<br /> | [https://web.archive.org/http://edges-local-testbnc-srv.ceta-ciemat.es/localtest EDGeS Local Test]<br /> |<br /> | 2007<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/http://sat.math.umu.se/sat/ Satisfaction@Home]<br /> |<br /> | 2007<br /> | WinXP, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20070505234056/http://www.nanohive-1.org:80/atHome/ NanoHive@Home]<br /> | [http://openurl.ingenta.com/content/xref?genre=article&amp;issn=1546-1955&amp;volume=8&amp;issue=7&amp;spage=1139 1]<br /> |<br /> | WinXP<br /> |<br /> |<br /> |<br /> | Nanorex, Inc.<br /> |<br /> |<br /> | NanoHive-1 is a modular simulator used for modeling the physical world at a nanometer scale. The intended purpose of the simulator is to act as a tool for the study, experimentation, and development of nanotech entities.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080711074723/http://boinc.iaik.tugraz.at:80/sha1_coll_search SHA 1 Collision Search Graz]<br /> |<br /> | 2007-08-08<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> | Graz University of Technology<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in cryptanalysis.<br /> <br /> |-<br /> | [https://web.archive.org/http://dist2.ist.tugraz.at/sudoku/ Project Sudoku]<br /> |<br /> | 2007-08-27<br /> | [https://web.archive.org/web/20080307034907/http://dist2.ist.tugraz.at/sudoku/apps.php WinXP-98, Linux, MacOS]<br /> |<br /> |<br /> |<br /> | Graz University of Technology<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to search for the smallest possible start configuration of Sudoku.<br /> <br /> |-<br /> | [https://web.archive.org/web/20071005080915/http://www.apsathome.org:80/ APS@Home]<br /> |<br /> | 2007-08-30<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> | University of Manchester<br /> |<br /> |<br /> | The effects that atmospheric dispersion has on the measurements used in climate prediction.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080806072857/http://dawn.ynet.sk:80/test1/ Reversi]<br /> |<br /> | 2008-05-16<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Independent<br /> |<br /> |<br /> | Determine who wins in Reversi game - first player, second player or if the game is tied.<br /> <br /> |-<br /> | [https://web.archive.org/http://www.ramseyathome.com/ramsey/ Ramsey@Home]<br /> |<br /> | 2008-06-14<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Nick Peterson<br /> |<br /> |<br /> | A volunteer computing project designed to find new lower bounds for various Ramsey numbers using a host of different techniques.<br /> <br /> |-<br /> | [http://canis.csc.ncsu.edu:8005/anansi/ Anansi]<br /> |<br /> | 2008<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://eaps-at-home-alpha.gotdns.org/eaps/ EAPS@HOME]<br /> |<br /> | 2008<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in Artificial Intelligence.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080703141019/http://boinc.vanderbilt.edu/CSB/ CSB@Home] / [https://web.archive.org/web/20080703141019/http://boinc.vanderbilt.edu/CSB/ BCL@Home]<br /> |<br /> | 2008-06-05 / 2008<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in '''Computational Structural Biochemistry'''.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080908061532/http://genlife.is-a-geek.org:80/genlife/ Genetic Life]<br /> |<br /> | 2008-06-18<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A not-for-profit research project that uses Internet-connected computers to do research into Genetic Algorithms.<br /> <br /> |-<br /> | [https://web.archive.org/web/20090506112112/http://africangridlab.net/ African Grid Lab ALPHA]<br /> |<br /> | 2008-10-05<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | An incubation laboratory environment for African based BOINC projects.<br /> <br /> |-<br /> | [https://web.archive.org/web/20090322190553/http://maxwell.dhcp.umsl.edu/brats/ BRaTS@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#BRaTS@Home 2]<br /> | 2007-06-05<br /> | WinXP-98, Linux, MacOS<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | BRaTS@Home is a research project that uses Internet-connected computers to do various calculations in Gravitational Ray Tracing. ''BRaTS'' stands for ''BRaTS Ray Trace Simulator''.<br /> <br /> |-<br /> | [https://web.archive.org/web/20090425124851/http://www.intelligencerealm.com/aisystem/system.php Artificial Intelligence System]<br /> |<br /> | 2007-09-05<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | The neural network simulator is an application that simulates neurons. Each downloaded work unit generates 500,000 biophysical neurons.<br /> <br /> |-<br /> | [https://web.archive.org/web/20090927062104/http://dynaping.com/ DynaPing]<br /> |<br /> | 2009<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Ensure highest availability of your web services. DynaPing uses computers around the world to monitor your web service availability and alerts you of any downtime.<br /> <br /> |-<br /> | [https://web.archive.org/web/20091130024643/http://nqueens.ing.udec.cl/ NQueens@Home]<br /> |<br /> | 2007-08-10<br /> | Windows<br /> |<br /> |<br /> |<br /> | University of Concepción<br /> |<br /> |<br /> | This project uses Internet-connected computers to solve the N Queens problem.<br /> <br /> |-<br /> | [https://web.archive.org/web/20141009194330/http://registro.ibercivis.es/ Ibercivis]<br /> | [https://boinc.berkeley.edu/pubs.php#Ibercivis 18]<br /> | 2007-11<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/RRPMDKPGt3A view]<br /> |<br /> |<br /> |<br /> | Ibercivis is a research project that uses Internet-connected computers to do research in physics, material science and biomedicines and is based at several institutes and universities; Zaragoza, CETA-CIEMAT, CSIC, Coimbra.<br /> <br /> |-<br /> | [https://web.archive.org/web/20201213215515/https://boinc.ibercivis.es/ibercivis/ Ibercivis BOINC]<br /> |<br /> | 2020-10<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | The Biophym Group of the CSIC Institute for the Structure of Matter has proposed to carry out simulations of the interaction of drugs used against Ebola, HIV infection, influenza or hepatitis B with the genome replication machinery of the SARS-Co-V virus.<br /> <br /> |-<br /> | [https://web.archive.org/http://evil.podzone.org/decs/ DECS]<br /> |<br /> | 2007-10-05<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | The Generic Distributed Exact Cover Solver (DECS) project uses Internet-connected computers to solve exact cover problems. Exact cover is a general type of problem which can be used to solve problems including n-queens, Latin Square puzzles, Sudoku, polyomino tiling, set packing and set partitioning.<br /> <br /> |-<br /> | [https://web.archive.org/http://boincsrv01.cern.ch/atlfast/ LHC Atlas Test]<br /> |<br /> | 2007-08-14<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Test project for LHC@home.<br /> <br /> |-<br /> | [https://web.archive.org/web/20070209051807/http://boinc.berkeley.edu/cplan/ Cunning Plan]<br /> |<br /> | 2007<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Was being used to test account creation.<br /> <br /> |-<br /> | [http://pcschmiede.pc.funpic.de/teah/html/user/ Test Project Christian Beer]<br /> |<br /> | 2007<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> | Software testing<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20110207203930/http://mapthegap.com/ MAPtheGAP]<br /> |<br /> | {{No}}<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Eliminating racial disparities in health.<br /> <br /> |-<br /> | [https://web.archive.org/http://dnahome.cs.rpi.edu/dna/ DNA@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#DNA@Home 2]<br /> | 2010-04-14<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | The new versions allow for different motif types which are different models for how a binding site could look. One is palindromic, where the nucleotides in the beginning of the model have their complement at the end of the model. The other model type is reverse complement, which doesn't assume the model to be palindromic, but looks for either the forward or reverse version of the model.<br /> <br /> |-<br /> | [https://web.archive.org/http://edges-local-devbnc-srv.ceta-ciemat.es/3gbp 3g Bridge Project]<br /> |<br /> | 2009<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/web/20071220210249/http://boincsrv01.cern.ch:80/lhcathome/ LHC@Home Experimental]<br /> |<br /> | 2007<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> | Software testing<br /> |<br /> | For internal testing only; any workunits issued are for testing and do not yet have any scientific value. Please remain attached to the official LHC@Home server!<br /> <br /> |-<br /> | [https://web.archive.org/http://cbl-link02.cs.technion.ac.il/cplan/ Superlink@EGEE queue]<br /> |<br /> | {{No}}<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20100324075245/http://boinc.cs.uct.ac.za:80/malaria/ UCT:malariacontrol.net]<br /> |<br /> | 2008-03-31<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> | Software testing<br /> |<br /> | A test project in collaboration with MalariaControl.net in Switzerland that aims to test the correct operation of our server for future BOINC-based projects.<br /> <br /> |-<br /> | [https://web.archive.org/http://dist.ist.tugraz.at/cape5/ Rectilinear Crossing Number]<br /> |<br /> | 2006-06-30<br /> | WinXP, Linux<br /> |<br /> |<br /> | [https://youtu.be/d03IUeQrDLQ view]<br /> |<br /> |<br /> |<br /> | Use sophisticated mathematical methods to determine the rectilinear crossing number for small values of n.<br /> <br /> |-<br /> | [https://web.archive.org/web/20091124095534/http://boinc.vtu.lt:80/vtuathome VTU@home], [https://web.archive.org/web/20090412025420/http://boinc.vgtu.lt/vtuathome/ VGTU@home]<br /> | [https://boinc.berkeley.edu/pubs.php#VGTU@home 2]<br /> | 2006-04-13<br /> | WinXP, Linux<br /> |<br /> |<br /> |<br /> | Vilnius Gediminas Technical University<br /> |<br /> |<br /> | The aim of this project is to provide a powerful distributed computing platform for scientists of Vilnius Gediminas Technical University (VGTU) as well as other Lithuanian academic institutions.<br /> <br /> |-<br /> | [https://web.archive.org/web/20090309055929/http://aqua.dwavesys.com/ AQUA@home]<br /> | [https://boinc.berkeley.edu/pubs.php#AQUA@home 4]<br /> |<br /> | &amp;nbsp;<br /> | {{Yes}}<br /> |<br /> | [https://youtu.be/VyQgGkj_Rss view]<br /> | dwavesys<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20060702175205/http://www.ufluids.net/ μFluids]<br /> | [https://boinc.berkeley.edu/wiki/Publications_by_BOINC_projects#.C2.B5Fluids.40Home 3]<br /> | 2005-09-19<br /> | WinXP-98<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Study fluid behavior in microgravity to design satellite propellant management devices.<br /> <br /> |-<br /> | [https://web.archive.org/web/20110817075110/http://boinc.run.montefiore.ulg.ac.be:80/evo/ Evo@home]<br /> |<br /> | 2010-11-22<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of Liège<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in Machine Learning. This project uses Evolutionary Algorithms to optimize the parameters of different kind of machine learning algorithms.<br /> <br /> |-<br /> | [http://gmdhgrid.com/mgua/index.php GMDHGrid]<br /> |<br /> | 2010<br /> |<br /> |<br /> |<br /> |<br /> | Kiev Polytechnic Institute<br /> |<br /> |<br /> | Data mining, knowledge discovery, prediction, complex systems modeling, optimization and pattern recognition.<br /> <br /> |-<br /> | [https://web.archive.org/web/20101025171952/http://project.czechnationalteam.cz/cplan/ Czech National Team project]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Czech National Team<br /> | Software testing<br /> |<br /> | A test project for our new BOINC server helping us to find and fix some bugs and create a new project which is being prepared.<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc.math.ucalgary.ca/sheti/ SHETI]<br /> |<br /> | 2009-01-08<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Sheti is a research project that uses Internet-connected computers to solve the [http://www.certicom.com/index.php/the-certicom-ecc-challenge 131-bit Certicom ECC Challenge].<br /> <br /> |-<br /> | [https://web.archive.org/web/20090331215945/http://mothershipathome.org/ Mothership@Home]<br /> |<br /> | 2008<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Mothership@Home is dedicated in loving memory of my mother Patricia Horner (1942-1987), my husband Joshua Resnick (1965-1999) and all others who have passed away prematurely due to medical conditions.<br /> <br /> |-<br /> | [https://web.archive.org/http://dart.cs.georgefox.edu/mcpi/ Monte Carlo Pi]<br /> |<br /> | 2008<br /> |<br /> |<br /> |<br /> |<br /> | George Fox University<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [http://cancergrid.lpds.sztaki.hu/cancergrid/ CancerGrid]<br /> |<br /> | 2008<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://stuff.povaddict.com.ar:8080/boinctest/ Silly Pi Calculation]<br /> |<br /> | 2008<br /> |<br /> |<br /> |<br /> |<br /> | Nicolas<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20130823010101/http://www.fpgaathome.org/ FPGA@Home]<br /> |<br /> | {{No}}<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | This is an open collaboration for porting Berkeley Open Infrastructure for Network Computing (BOINC) based volunteer computing projects on Field Programmable Gate Arrays (FPGAs).<br /> <br /> |-<br /> | [https://web.archive.org/web/20130528155906/http://boinc.hpc.utp.edu.my:80/utpdg/ UTP Desktop Grid]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Universiti Teknologi Petronas<br /> |<br /> |<br /> | UTP Desktop Grid (UTPDG) is a research project that uses Internet-connected computers to do research in various areas of parallel computational problems.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130302052041/http://boinc.ucd.ie/fmah/ FightMalaria@Home]<br /> |<br /> | 2012-07-20<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Dr Anthony Chubb<br /> |<br /> |<br /> | Perform docking simulations on malaria proteins.<br /> <br /> |-<br /> | [https://web.archive.org/http://107.21.228.163/VBOINC V-BOINC]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | The VBOINC project is the first attempt to use virtual machines with BOINC.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130501160927/http://oproject.info/ OProject@Home]<br /> | [https://arxiv.org/abs/1210.1593 1]<br /> | 2012-08-13<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Algorithm analysis. OProject@Home based at Olin Library (Rollins College).<br /> <br /> |-<br /> | [https://web.archive.org/https://climateathome.info/climateathome/ Climate@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | George Mason University, NASA<br /> |<br /> |<br /> | Research for spatiotemporal computing and climate predictions.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130701032038/http://bigdata.ihep.ac.cn/bigdata/stats.php BigData@home]<br /> |<br /> |<br /> | [https://web.archive.org/http://bigdata.ihep.ac.cn/bigdata/ Windows, Linux]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Crawl Internet New Media Information.<br /> <br /> |-<br /> | [https://quakecatcher.net/sensor/ Quake-Catcher Network]<br /> | [https://boinc.berkeley.edu/pubs.php#Quake-Catcher 13]<br /> | 2007-12-05 / 2023-06-01<br /> |<br /> |<br /> |<br /> | [https://youtu.be/SCv_W751m64 view]<br /> | Stanford University, then University of Southern California<br /> |<br /> |<br /> | Research, education, and outreach in seismology.<br /> <br /> |-<br /> | [https://web.archive.org/http://qcn.emsc-csem.org/sensor/ Quake-Catcher Network EMSC / CSEM]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/SCv_W751m64 view]<br /> |<br /> |<br /> |<br /> | Research, education, and outreach in seismology.<br /> <br /> |-<br /> | [https://web.archive.org/web/20110723205439/http://mersenneathome.net/ Mersenne@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://b25.interix.jp/b25/ B25@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://boinc.ryanteck.org.uk/boincPi/ boincPi]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://surveill.dei.uc.pt/surveill/ Surveill@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of Coimbra<br /> |<br /> |<br /> | Conduct end-to-end fine-grained monitoring of web sites.<br /> <br /> |-<br /> | [https://www.chess960athome.org/alpha/ Chess960athome]<br /> |<br /> | 2006-03-20<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Chess960 is a young innovative chess variant. In Chess960, just before the start of every game, the initial configuration of the chess pieces is determined randomly. In this project we try to combine Chess960 and the idea of distributed computing to give this chess variant some basics in theory.<br /> <br /> |-<br /> | [https://web.archive.org/web/20110801052639/http://www.freehal.net/freehal_at_home FreeHAL]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Tobias Schulz / Powered by SETI.Germany and Planet 3DNow!<br /> |<br /> |<br /> | FreeHAL@home is a research project that uses Internet-connected computers to parse and convert big open source semantic nets for use in FreeHAL.<br /> <br /> |-<br /> | [https://web.archive.org/web/20100430012556/http://goldbach.pl/ Goldbach's Conjecture Project]<br /> |<br /> | 2009-07-23<br /> | [https://web.archive.org/web/20100505082120/http://goldbach.pl/apps.php Windows, Linux]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Effectively proving Goldbach's weak conjecture.<br /> <br /> |-<br /> | [http://starmageddon.dyndns.org/ninjagrid/ NinjaGrid]<br /> |<br /> | 2009<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Mathematics<br /> |<br /> | 3x+1.<br /> <br /> |-<br /> | [https://web.archive.org/http://physicsathome.tk/physics/ physics@home]<br /> |<br /> | 2013-02-16<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Vasyl Kuzmenko<br /> |<br /> |<br /> | Research in Solid-state physics, Materials science, Optics and Chemistry.<br /> <br /> |-<br /> | [https://web.archive.org/http://vcsc.cs.uh.edu/second-computing/ UH Second Computing]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of Houston College of Technology<br /> |<br /> |<br /> | We are in the process to simulate macromolecular interactions in a living cell.<br /> <br /> |-<br /> | [http://babel.boinc.povaddict.com.ar/ Babel]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Testing translations of BOINC server and forum.<br /> <br /> |-<br /> | [https://web.archive.org/http://eon.raunvis.hi.is/EON2v1/ EON2v1@clusters]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://sctr.i3a.uclm.es/prob/ Prob]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://140.110.240.195/bioinfo/ Bioinfo@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/https://boinc.freerainbowtables.com/distrrtgen/ DistrRTgen]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | By distributing the generation of rainbow chains, we can generate HUGE rainbow tables that are able to crack longer passwords than ever seen before.<br /> <br /> |-<br /> | [https://web.archive.org/web/20100526004243/http://boinc.picevolvr.com:80/ Picevolvr]<br /> |<br /> | 2010<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | [http://cullen-online.com/ Michael Cullen]<br /> |<br /> |<br /> | Uses Internet-connected computers to generate artwork completely automatically.<br /> <br /> |-<br /> | [https://web.archive.org/http://cah.tcm.phy.cam.ac.uk/ QuantumFIRE alpha]<br /> |<br /> | 2010<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of Cambridge<br /> |<br /> |<br /> | Quantum foundations and Solid-state physics research.<br /> <br /> |-<br /> | [https://web.archive.org/http://boinctest.codeq.pl/boinctest/ Replace With Project Name]<br /> |<br /> | 2013<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | http://boinctest.codeq.pl/boinctest/<br /> <br /> |-<br /> | [http://web.archive.org/web/20131229164437/http://plagiarism.boincpolska.org/plagiarism/ Plagiarism@Home]<br /> |<br /> | 2013<br /> |<br /> |<br /> |<br /> |<br /> | Krzysztof Piszczek<br /> |<br /> |<br /> | Search given text for potential plagiarism in Internet resources.<br /> <br /> |-<br /> | [http://boinc.comcute.com/SIM/ Comcute emBOINC]<br /> |<br /> | 2012<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://boinc.comcute.com/cc_boinc/ Comcute Boinc]<br /> |<br /> | 2013<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://chess.qugate.org/ Chess@Home]<br /> |<br /> | 2014-01-05<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Michal Stanislaw Wojcik<br /> |<br /> |<br /> | Construct a chess winning position classifier based on simple features. The first goal is to establish how far we can get with relatively cheap methods of position evaluation. The second goal is to use more advanced machine learning techniques to emulate human behaviour of various levels of chess proficiency.<br /> <br /> |-<br /> | [https://web.archive.org/http://perft.computers-chess.com/ computers-chess]<br /> |<br /> | 2013<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [http://151.97.53.109/synchronised/ Synchronised]<br /> |<br /> | 2013 / 2014<br /> |<br /> |<br /> |<br /> |<br /> | University of Catania<br /> | Molecular Modelling<br /> |<br /> | Pharmaceutical chemistry research.<br /> <br /> |-<br /> | [https://web.archive.org/web/20090402124145/http://cleanenergy.harvard.edu/ The Clean Energy Project]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Harvard University<br /> |<br /> |<br /> | Merged into World Community Grid.<br /> <br /> |-<br /> | [https://web.archive.org/web/20150522195526/http://www.universeathometest.info/universe/ Universe@Home test project]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | University of Warsaw<br /> |<br /> |<br /> | Test project for Universe@Home.<br /> <br /> |-<br /> | [https://web.archive.org/http://eon.ices.utexas.edu/eon2/ eOn2]<br /> | [https://boinc.berkeley.edu/pubs.php#EOn 6]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A common problem in theoretical chemistry, condensed matter physics and materials science is the calculation of the time evolution of an atomic scale system where chemical reactions and/or diffusion occur.<br /> <br /> |-<br /> | [https://web.archive.org/http://mmgboinc.unimi.it/ SimOne@home]<br /> | [https://www.sciencedirect.com/science/article/pii/S000926141300763X 1]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | The project focuses on the osmoprotection phenomenon. In nature there are small molecules that are able to protect proteins from thermal stress. Answering this question could have a major impact in agriculture, e.g. developing plants that require less water intake.<br /> <br /> |-<br /> | [http://docking.cis.udel.edu/ Docking@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#Docking@home 20]<br /> | 2006-09-11 / 2014-05-23<br /> | WinXP-98, Linux, MacOS X/Intel<br /> |<br /> |<br /> | [https://youtu.be/gC_2zu2efY4 view]<br /> | University of Delaware<br /> |<br /> |<br /> | Perform scientific calculations that aid in the creation of new and improved medicines to help cure diseases such as HIV.<br /> <br /> |-<br /> | [http://boinc01.cern.ch/test4theory/ LHC Test4Theory]<br /> |<br /> | 2011<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20150731163559/http://lhcathome2.cern.ch/vLHCathome/ vLHCathome]<br /> |<br /> | 2011<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | This is a project that utilizes the CERN-developed CernVM virtual machine and the BOINC virtualization layer to harness volunteer cloud computing power for full-fledged LHC event physics simulation on volunteer computers.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120102114135/http://ui.hpc.iit.bme.hu/wc/ Web Computing]<br /> |<br /> | 2011<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130511025233/http://falua.cesfelipesegundo.com/Ideologias/ Ideologias@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Study how people in a certain region evolve ideologically over time with respect to an idea.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120302132650/http://alfa-bridge.ibercivis.es/puente/ alfa_puente]<br /> |<br /> | 2012<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/web/20121207151627/http://boinc.biruni.upm.my/putra/ DG@Putra]<br /> |<br /> | 2012-02-23<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Universiti Putra Malaysia<br /> |<br /> |<br /> | Putra Desktop Grid is UPM's implementation of a DesktopGrid network. The project is fully supported by the International Desktop Grid Federation (IDGF).<br /> <br /> |-<br /> | [https://web.archive.org/http://qcn.stanford.edu/continual/ QCN Continual Sensor Monitoring]<br /> |<br /> | 2012-04-18<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/SCv_W751m64 view]<br /> |<br /> |<br /> |<br /> | Research, education, and outreach in seismology.<br /> <br /> |-<br /> | [https://web.archive.org/http://qcn.twgrid.org/sensor/ QCN Taiwan]<br /> |<br /> | 2012-04-16<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/SCv_W751m64 view]<br /> |<br /> |<br /> |<br /> | Research, education, and outreach in seismology.<br /> <br /> |-<br /> | [https://web.archive.org/http://www.ras.unam.mx/sensor/ QCN Red Atrapa Sismos]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/SCv_W751m64 view]<br /> |<br /> |<br /> |<br /> | Research, education, and outreach in seismology.<br /> <br /> |-<br /> | [https://web.archive.org/http://bvp6.hpc.iit.bme.hu/w2g/ Web2Grid Development]<br /> |<br /> | 2012<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [http://bacalhau.lsd.ufcg.edu.br/table_transcriber/ TABLE TRANSCRIBER]<br /> |<br /> | 2012<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://boinc.rm-hs.de/test/ Replace With Project Name]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | http://boinc.rm-hs.de/test/<br /> <br /> |-<br /> | [http://150.186.92.236/boinctest/ boinctest]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://nanomodeling.molsim.ru/nanomodeling/ NanoModeling@home]<br /> |<br /> | 2012-05-03<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | For designing nanostructures and nanorobots. Our goal is molecular modeling of targeted drug delivery systems, nanorobots and related nanostructures.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120120081734/http://boinc.berkeley.edu:80/vbox/ CERNVM/Vboxwrapper Test Project]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/http://mishra.lpds.sztaki.hu/atticproxy/ Attic Proxy Project]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [http://95.56.231.137/norlist/view_profile.php?userid=806 NORLIST@HOME]<br /> |<br /> | 2014<br /> |<br /> |<br /> |<br /> |<br /> | Kazakhstan National Scientific Laboratory<br /> |<br /> |<br /> | Kazakh speech recognition.<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc.biruni.upm.my/pucbi/ PUCBi Desktop Grid]<br /> |<br /> | 2015<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Perdana University Centre for Bioinformatics (PU-CBi)<br /> |<br /> |<br /> | Provide education and training to support the development and continuity of in-house programmes, in particular to advance the translational bioinformatics skills of the next generation doctors and clinician scientists.<br /> <br /> |-<br /> | [https://web.archive.org/web/20160315063057/http://finance.gridcoin.us/finance/show_user.php?userid=885357 Gridcoin Finance]<br /> |<br /> | 2015<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | [https://wiki.bc-team.org/index.php?title=Gridcoin_Finance/en The project performs financial simulations, analysis of the block chain, consolidate humanitarian reports, calculate marketing strategies, perform stock option analysis, harvest business intelligence, and assimilate top level results for the crowdsourced web pages.]<br /> <br /> |-<br /> | [https://web.archive.org/web/20160831173736/http://nanosurf.kr.ua/nanos/ nanosurf]<br /> |<br /> | 2016-06-16<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Oleg Schevchenko<br /> |<br /> |<br /> | Researching surface physics. In particular, the development of optical devices. Theoretical modeling of surface quantum dots makes it possible to provide recommendations to a group of experimenters.<br /> <br /> |-<br /> | [https://www.boincstats.com/stats/167/project/detail/ BMG@Home]<br /> |<br /> | 2016-02-25<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> | Chemistry<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20170514021753/http://parlea.ru:80/andersonattack AndersonAttack@home]<br /> | [https://www.degruyter.com/document/doi/10.1515/eng-2018-0002/html 1]<br /> | 2017<br /> | &amp;nbsp;<br /> | {{Yes}}<br /> |<br /> |<br /> | Matrosov Institute for System Dynamics and Control Theory<br /> |<br /> |<br /> | Implement Anderson's attack on A5/1 GSM stream cipher.<br /> <br /> |-<br /> | [https://web.archive.org/web/20171114233820/http://stop.inferia.ru:80/ Stop@home]<br /> |<br /> | 2017-09-17<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | 256Ghz<br /> |<br /> |<br /> | Today we can't imagine our life without internet and its services. Our team wants to use distributed computing to solve mathematical tasks and improve algorithms.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130605030952/http://boinc.riojascience.com/ Riojascience@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Knet Communications and the University of La Rioja<br /> |<br /> |<br /> | A platform for biomedical research.<br /> <br /> |-<br /> | [https://web.archive.org/web/20141117215322/http://igemathome.org/ iGem@home]<br /> |<br /> | {{No}}<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20160629234412/http://www.bitcoinutopia.net/bitcoinutopia/ Bitcoin Utopia]<br /> |<br /> | 2013-06-05<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Mine cryptocurrencies for incentive awards and science projects.<br /> <br /> |-<br /> | [https://web.archive.org/http://59.78.96.61:8082/dhome/ Drug@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | School of Pharmacy, Ecust China University of Science &amp; Technology<br /> |<br /> |<br /> | This study applied an efficient virtual screening strategy integrating molecular docking with MM-GBSA rescoring to identify diverse human dihydroorotate dehydrogenase (hDHODH) inhibitors.<br /> <br /> |-<br /> | [http://edges-ext-dg.ceta-ciemat.es/3gbp/ Edges Bridge Production]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/web/20140913231024/http://boinc.unsads.com/rsals/ RSA Lattice Siever(2.0)]<br /> |<br /> | 2009-12-24 / 2012<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Help other factoring projects such as mersenneforum or XYYXf achieve their academic goals. Merged into [[NFS@Home]].<br /> <br /> |-<br /> | [https://web.archive.org/web/20120329124047/http://home.edges-grid.eu/home/ EDGeS@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#EDGeS@Home 12]<br /> | 2009-10-28<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | To support the execution of selected and validated scientific applications developed by the EGEE and EDGeS community.<br /> <br /> |-<br /> | [https://web.archive.org/web/20081008031648/http://cels-at-home-dev.dyndns.org:80/cels/ Cels@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/mzp2QBwvb2U view]<br /> |<br /> |<br /> |<br /> | Research in cell adhesion. One of the many applications of this is in cancer research, as the point at which cancerous cells quit staying in place is a critical event that makes the disease much harder to treat.<br /> <br /> |-<br /> | [http://77.48.48.82/jplan/ jplan]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://lhcbathome.cern.ch/Beauty/ Beauty@LHC]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Based at CERN and is a project of the LHCb experiment.<br /> <br /> |-<br /> | [https://web.archive.org/web/20140209200706/http://boinc.biruni.upm.my/putra/ Putra Desktop Grid]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/http://vcsc.cs.uh.edu/virtual-prairie/ Virtual Prairie]<br /> | [https://linkinghub.elsevier.com/retrieve/pii/S0304380010005557 1]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of Houston<br /> |<br /> |<br /> | Take into account plant vegetative reproduction e.g. the ability of each perennial grass to colonize space through cloning.<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc.med.usherbrooke.ca/nrg/ Najmanovich Research Group]<br /> | [https://boinc.berkeley.edu/pubs.php#Najmanovich 3]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in molecular recognition and computer-aided drug design.<br /> <br /> |-<br /> | [https://web.archive.org/http://www.sustainablegrid.org/ Sustainable Grid]<br /> |<br /> | 2012-01-11<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Enterprise Application Development Group at the University of Applied Sciences Zittau/Goerlitz<br /> |<br /> |<br /> | Bundles hardware resources of the university and provides this computational power to the scientists for their research purposes.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120312215655/http://mamarreis.lsd.ufcg.edu.br/ciencia-em-sua-casa/ Ciência Em Sua Casa]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Science in Your Home. Search for Wilson prime numbers and DNA sequencing.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120705003101/http://donateathome.org/ Donate@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Allows participants to donate towards funding by using their GPU to mine for BitCoins.<br /> <br /> |-<br /> | [https://web.archive.org/http://edges-local-devbnc-srv.ceta-ciemat.es/student01/ Student01]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/http://edges-local-devbnc-srv.ceta-ciemat.es/student02/ Student02]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [http://gf45.mp.tudelft.nl/psdm/ BIoS]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | TU Delft<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://mishra.lpds.sztaki.hu/edgidemo/ EDGI Demo Project]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/http://voldemort.cs.cf.ac.uk/attic_proxy/ AtticFS Proxy Application Project on BOINC]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | The AtticFS Proxy application acts as a translation layer between HTTP and the AtticFS. This allows BOINC Projects to utilise AtticFS easily.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130526001435/http://volunteer.cs.und.edu/subset_sum/ SubsetSum@Home]<br /> | [http://ieeexplore.ieee.org/document/7255176/ 1]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Computer Science Department of the University of North Dakota<br /> |<br /> |<br /> | See how far we can extend the empirical evidence of the Subset Sum problem. Find better ways to apply volunteer computing to combinatorial problems.<br /> <br /> |-<br /> | [https://web.archive.org/web/20100313233251/http://www.nicoschlitter.de/DistributedDataMining distributedDataMining]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in the various fields of Data Analysis and Machine Learning.<br /> <br /> |-<br /> | [https://web.archive.org/web/20101201205418/http://dnetc.net/ DNETC@HOME]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A wrapper between BOINC and distributed.net.<br /> <br /> |-<br /> | [https://web.archive.org/http://dg.imp.kiev.ua/slinca/ SLinCA]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | SLinCA (Scaling Laws in Cluster Aggregation) is involved with research in the field of materials science.<br /> <br /> |-<br /> | [https://web.archive.org/web/20110803231551/http://mishra.lpds.sztaki.hu:80/szdgr/ SZTAKI Desktop Grid Research Facility]<br /> |<br /> |<br /> | WinXP-98, Linux, MacOS X<br /> |<br /> |<br /> |<br /> | Hungarian Academy of Sciences<br /> |<br /> |<br /> | This project is the test &amp; research facility for SZTAKI Desktop Grid.<br /> <br /> |-<br /> | [https://web.archive.org/web/20081224080150/http://hydrogenathome.org/ Hydrogen@home]<br /> |<br /> |<br /> | [https://web.archive.org/web/20120111114110/http://hydrogenathome.org/apps.php WinXP-98, Linux, MacOS X (Not Intel)]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Enhance clean energy technology by improving hydrogen production and storage.<br /> <br /> |-<br /> | [https://web.archive.org/http://convector.fsv.cvut.cz/ convector@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Calculate global optimum of 52 bar truss.<br /> <br /> |-<br /> | [https://web.archive.org/web/20070202002920/http://spin.fh-bielefeld.de/ Spinhenge@home]<br /> | [https://boinc.berkeley.edu/pubs.php#Spinhenge@home 3]<br /> |<br /> | WinXP-98<br /> |<br /> |<br /> | [https://youtu.be/d-fafmtqE74 view]<br /> |<br /> |<br /> |<br /> | Support the research of nano-magnetic molecules. In the future these molecules will be used in the local tumor chemotherapy and to develop tiny memory-modules.<br /> <br /> |-<br /> | [https://web.archive.org/web/20140413155515/http://bealathome.com/ Beal@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Beal's conjecture is a conjecture in number theory: where A, B, C, x, y, and z are positive integers with x, y, z &gt; 2, then A, B, and C have a common prime factor. Beal initially offered a prize of US $5,000 in 1997, raising it to US $1,000,000.<br /> <br /> |-<br /> | [https://web.archive.org/web/20150816053811/http://bealf.pl/bealf BealF@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Part of the Master Thesis: '''''Testing Beal conjecture using supercomputers and distributed computing platform BOINC'''''. The predecessor of the project was ''Beal@Home''.<br /> <br /> |-<br /> | [https://web.archive.org/http://cbl-link02.cs.technion.ac.il/superlinkattechnion/ Superlink@Technion]<br /> | [https://boinc.berkeley.edu/pubs.php#Superlink@Technion 4]<br /> |<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Helps geneticists all over the world find disease-provoking genes causing some types of diabetes, hypertension (high blood pressure), cancer, schizophrenia and many others.<br /> <br /> |-<br /> | [https://web.archive.org/web/20110720105948/http://boinc.vanderbilt.edu/bcl/ Biochemical Library]<br /> |<br /> | 2011<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in Biochemical Library.<br /> <br /> |-<br /> | [http://falua.cesfelipesegundo.com/jarifa/ Jarifa]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://netmax.isa.ru/netmax/ NetMax@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in dynamic routing at telecommunication networks.<br /> <br /> |-<br /> | [https://web.archive.org/web/20140804215459/http://gilda117.ihep.ac.cn/ATLAS/ Replace With Project Name]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | https://web.archive.org/web/20140903030559/http://gilda117.ihep.ac.cn/ATLAS<br /> <br /> |-<br /> | [http://cvmathome.cern.ch/test4theory/ LHC+@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://isaac.ssl.berkeley.edu/test2/ Replace With Project Name]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | http://isaac.ssl.berkeley.edu/test2/<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc.fiit.stuba.sk/ BOINC@Fiit]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Slovak University of Technology, Bratislava<br /> |<br /> |<br /> | TBA.<br /> <br /> |-<br /> | [https://web.archive.org/https://v8boinc.fer.hr/v8boinc/ v8boinc]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20101203122655/http://glife.is-a-geek.org:80/ga/view_profile.php?userid=120 GA@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20101109123610/http://www.luxrenderfarm.de/luxfarm Luxrenderfarm@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Renderfarm for Luxrender.net.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130819173713/http://sudoku.nctu.edu.tw/joomla/ sudoku@vtaiwan]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Develop new techniques and use them to modify the program [https://web.archive.org/web/20130819173713/http://www.math.ie/checker.html Checker] (written by Gary McGuire).<br /> <br /> |-<br /> | [https://web.archive.org/http://poseidon.shacknet.nu:8080/MilestoneRSA/ MilestoneRSA]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Break a 1024 bit RSA key used by Motorola to sign the boot and recovery partitions on the Motorola Milestone.<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc01.uoc.edu/ILS-ESP-2014/ ILS-ESP-2014]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research for solving the permutation FLOW-SHOP problem.<br /> <br /> |-<br /> | [https://web.archive.org/http://wordcompatibility.com/words_compatibility/ Russian Words Compatibility]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in Russian computational linguistics.<br /> <br /> |-<br /> | [https://web.archive.org/web/20110816010257/http://falua.cesfelipesegundo.com/Neurona/ Neurona@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#Neurona@Home 2]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Simulating the behavior of a large assembly of cellular automata neurons connected in a complex network.<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc.isa.ru/dcsdg/ OPTIMA@HOME]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Solve challenging large-scale optimization problems.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130525113734/http://svahesrv2.bioquant.uni-heidelberg.de/correlizer/ Correlizer]<br /> | [https://boinc.berkeley.edu/pubs.php#Correlizer 5]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Revealing the mysteries of genome organization.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120825055512/http://vbridge.twgrid.org/asgcdg/ Taiwan Desktop Grid]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Support the drug discovery, earthquake simulation and climate change applications developing in Asia and also to support the applications developed by IDGF.<br /> <br /> |-<br /> | [https://web.archive.org/web/20110214000708/http://androinc.net:80/ AndrOINC]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | To break a 1024 bit RSA key used by Motorola to sign the boot and recovery partitions on the Motorola Milestone.<br /> <br /> |-<br /> | [https://web.archive.org/web/20141216004540/http://findah.ucd.ie/ FiND@Home]<br /> |<br /> | 2012-07-20<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Dr Anthony Chubb<br /> |<br /> |<br /> | A research project that uses donated CPU time to perform docking simulations on malaria proteins.<br /> <br /> |-<br /> | [https://web.archive.org/web/20140514143657/http://www.primaboinca.com/ Primaboinca]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | This project concerns itself with two hypotheses in number theory: Agrawal's Conjecture (the basis for the AKS algorithm) and Popovych's conjecture, which adds a further condition and could reduce the time of a deterministic prime test from O(log N)^6 to O(log N)^3.<br /> <br /> |-<br /> | [https://web.archive.org/web/20060723185510/http://attribution.cpdn.org/ Seasonal Attribution Project]<br /> |<br /> |<br /> | WinXP, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | By comparing the results of climate simulations, half of which will include the effects of human-induced climate change, and half of which will not, we will investigate the possible impact of human activity on extreme weather risk.<br /> <br /> |-<br /> | [https://web.archive.org/http://shasta.chem.uh.edu/SolarAtHome/ Solar@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Make more efficient solar cells.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080828221836/http://kinetic.dnsalias.org/magnetism/ Magnetism@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Explore the equilibrium, metastable and transient magnetization patterns in nano-scale magnetic elements and their arrays.<br /> <br /> |-<br /> | [https://web.archive.org/http://desktopgrid.hiast.edu.sy/hiastdg/ HIAST@HOME]<br /> |<br /> | 2013<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses Internet-connected computers to do research in XXX.<br /> <br /> |-<br /> | [https://web.archive.org/web/20140316201231/http://volunteer.cs.und.edu:80/dna/ DNA@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#DNA@Home 2]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Discover what regulates the genes in DNA.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120130113228/http://boinc.umiacs.umd.edu/ The Lattice Project]<br /> | [https://boinc.berkeley.edu/pubs.php#The 16]<br /> |<br /> | WinXP, Linux, Mac<br /> |<br /> |<br /> |<br /> | University of Maryland<br /> | Multiple applications<br /> |<br /> | Run legacy science applications: Phylogenetic Analysis (GARLI), Protein Sequence Comparison (HMMPfam), Conservation Reserve Network Design (MARXAN).<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc.fzk.de/poem/ POEM@HOME]<br /> | [https://boinc.berkeley.edu/pubs.php#POEM@HOME 5]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Protein structure prediction has been complemented by other nanoscale molecule simulations. Within the scope of polymer crystallography we are researching conformations of organic hydrocarbons.<br /> <br /> |-<br /> | [http://int-boinctest.int.kit.edu/poem/ POEM@TEST]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Test project for POEM@HOME.<br /> <br /> |-<br /> | [https://web.archive.org/http://199.26.254.190/qos/ Spatiotemporal Quality of Service (QoS)]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Perform distributed web service evaluation so that more accurate service quality information can be delivered to end users.<br /> <br /> |-<br /> | [https://web.archive.org/web/20070128212119/http://boinc.rieselsieve.com/ RieselSieve]<br /> |<br /> |<br /> | WinXP<br /> |<br /> |<br /> |<br /> |<br /> | Mathematics<br /> |<br /> | k+2n-1 problem, eventually merged with PrimeGrid.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130806073759/http://mopac.cadaster.eu/ mopac@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> | Chemistry<br /> |<br /> | Research in quantum chemistry.<br /> <br /> |-<br /> | [https://web.archive.org/web/20140419190153/http://volunteer.cs.und.edu/wildlife/ Wildlife@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of North Dakota<br /> |<br /> |<br /> | Analyze video gathered from various cameras recording wildlife.<br /> <br /> |-<br /> | [https://web.archive.org/web/20160120043345/http://volpexathome.cs.uh.edu/VolPEx/ Volpex@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#Volpex@Home 9]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of Houston<br /> |<br /> |<br /> | Research in creating effective parallel computing on multiple volatile nodes.<br /> <br /> |-<br /> | [https://web.archive.org/http://mindmodeling.org/palm_project/ MindModeling@Home (Palm)]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | University of Dayton Research Institute and Wright State University<br /> |<br /> |<br /> | Test project for MindModeling@Home.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080805160334/http://mindmodeling.org:80/beta/ MindModeling@Home (Beta)]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/3aJmm60Wgl8 view]<br /> | University of Dayton Research Institute and Wright State University<br /> |<br /> |<br /> | Test project for MindModeling@Home.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120215132304/http://boinc.almeregrid.nl/ AlmereGrid]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20090422205514/http://server1.almeregrid.nl/testgrid/ AlmereGrid TestGrid]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Test Grid of AlmereGrid.<br /> <br /> |-<br /> | [https://web.archive.org/http://server5.almeregrid.nl/almeregrid/ AlmereGrid Boinc testGrid]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | No independent verification that this was a BOINC project.<br /> <br /> |-<br /> | [https://web.archive.org/web/20181204215217/http://anthgrid.com/dbnupperbound/ DBN Upper Bound]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Polymath project related to the theory of the Riemann zeta function.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130331200159/http://abcathome.com/ ABC@home]<br /> | [https://arxiv.org/abs/1409.2974 1]<br /> |<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | An educational and non-profit volunteer computing project finding abc-triples related to the ABC conjecture.<br /> <br /> |-<br /> | [https://web.archive.org/web/20070206065801/http://abcathome.com/beta/ ABC@home beta]<br /> |<br /> |<br /> | WinXP-98, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Test project for ABC@home.<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc2.cs.hs-rm.de/abclll/ ABC Lattices @Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Searching for good abc-triples. Unlike ABC@Home, this project is not aiming for a thorough search of a certain range of numbers. Instead, we are trying to find good triples with the help of a specialized algorithm in areas beyond 2^100.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080801101300/http://cpdnbeta.oerc.ox.ac.uk/ CPDN Beta]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Test project for climate''prediction''.net.<br /> <br /> |-<br /> | [https://web.archive.org/web/20140703145955/http://atlasathome.cern.ch/ Atlas@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | A research project that uses volunteer computing to run simulations of the ATLAS experiment at CERN.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130302044909/http://boincsimap.org/boincsimap/ SIMAP]<br /> | [https://boinc.berkeley.edu/pubs.php#SIMAP 5]<br /> |<br /> | WinXP, Linux, Mac OS, Other<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Many computational methods in biology and medicine are based on protein sequence analysis, e.g. to predict the function and structure of genes and proteins. SIMAP facilitates these methods by providing pre-calculated protein similarities and protein domains.<br /> <br /> |-<br /> | [https://web.archive.org/web/20120214044716/http://boinc.gorlaeus.net/ Leiden Classical]<br /> | [https://boinc.berkeley.edu/pubs.php#Leiden 2]<br /> |<br /> | WinXP-98, Linux, MacOS X (Not Intel)<br /> |<br /> |<br /> | [https://youtu.be/co2SkwsvyOk view] and [https://youtu.be/ECAQC1mzMiM view]<br /> |<br /> |<br /> |<br /> | Dedicated to general Classical Dynamics for any scientist or science student.<br /> <br /> |-<br /> | [https://web.archive.org/web/20171217033707/http://szdg.lpds.sztaki.hu/szdg/ SZTAKI Desktop Grid]<br /> | [https://boinc.berkeley.edu/pubs.php#SZTAKI 5]<br /> | 2005-05-26<br /> | WinXP-98, Linux, MacOS X (Not Intel), Solaris<br /> |<br /> |<br /> |<br /> |<br /> | Multiple Applications<br /> |<br /> | The SZTAKI Desktop Grid and its applications are partly supported by the DEGISCO and the EDGI projects. The work leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreements n° RI-261561 and n° RI-261556.<br /> <br /> |-<br /> | [https://web.archive.org/web/20080926101459/http://orbit.psi.edu/oah/ Orbit@home]<br /> | [https://www.sciencedirect.com/science/article/abs/pii/S0019103516300914 1]<br /> |<br /> | Windows, Linux<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Produce an optimized search strategy for dedicated astronomical surveys to search for near-Earth asteroids.<br /> <br /> |-<br /> | [https://web.archive.org/web/20130725025029/http://pogs.theskynet.org/pogs/ theSkyNet POGS]<br /> | [https://boinc.berkeley.edu/pubs.php#TheSkyNet 3]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in astronomy. Combine the spectral coverage of GALEX, Pan-STARRS1, and WISE to generate a multi-wavelength UV-optical-NIR galaxy atlas for the nearby Universe.<br /> <br /> |-<br /> | [https://web.archive.org/web/20180205194455/https://sourcefinder.theskynet.org/duchamp/ theSkyNet Sourcefinder]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Provide a means to test the effectiveness of various astronomical sourcefinding applications.<br /> <br /> |-<br /> | [https://nickeycat.net/nic/ Nickeycat]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | No independent verification that this was a BOINC project.<br /> <br /> |-<br /> | [https://web.archive.org/http://xansons4cod.com/xansons4cod/ XANSONS for COD]<br /> | [https://boinc.berkeley.edu/pubs.php#XANSONS 2]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Create an open access database of simulated x-ray and neutron powder diffraction patterns for nanocrystalline phase of the materials presented in the '''Crystallography Open Database (COD)'''.<br /> <br /> |-<br /> | [https://web.archive.org/http://aerospaceresearch.net/constellation/ Constellation]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in various aerospace related sciences and engineering.<br /> <br /> |-<br /> | [https://web.archive.org/web/20190401042546/http://www.acousticsathome.ru/boinc/ Acoustics@home]<br /> | [https://boinc.berkeley.edu/pubs.php#Acoustics@home 2]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Matrosov Institute for System Dynamics and Control Theory of SB RAS<br /> |<br /> |<br /> | Solving inverse problems in underwater acoustics.<br /> <br /> |-<br /> | [https://web.archive.org/web/20100427212604/http://boinc.drugdiscoveryathome.com/ Drug Discovery@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Model the behavior of leading compounds that could be developed into new medicines.<br /> <br /> |-<br /> | [https://web.archive.org/http://sat.isa.ru/pdsat/ SAT@home]<br /> | [https://boinc.berkeley.edu/pubs.php#SAT@home 8]<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Solve hard and practically important problems (discrete functions inversion problems, discrete optimization, bioinformatics, etc) that can be effectively reduced to Boolean satisfiability problem.<br /> <br /> |-<br /> | [https://web.archive.org/web/20190606103241/https://www.dhep.ga/boinc/ Distributed Hardware Evolution Project]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Host an island running a population based metaheuristic stochastic optimisation algorithm in a coevolutionary setting synthesising future super-reliable electronics such as those used in autonomous vehicles, power stations, medical equipment, aerospace.<br /> <br /> |-<br /> | [https://charon.camras.nl/setiatcamras/ SETI@CAMRAS]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20180927092346/http://cpu.goofyxgridathome.net/ GoofyxGrid@Home CPU]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/http://usproteins-at-home.ru/usproteins/ usproteins@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://web.archive.org/web/20131022042932/http://qmcathome.org/ QMC@home]<br /> | [https://boinc.berkeley.edu/pubs.php#QMC@Home 7]<br /> |<br /> | Windows, Linux<br /> |<br /> |<br /> | [https://youtu.be/fNWUs9jRwSY view]<br /> |<br /> | Multiple applications<br /> |<br /> | Quantum-mechanical computations on medically relevant biomolecular systems, to help with developing quantum-mechanics-based approaches for computational drug design; and finding safer and greener materials for e-vehicle batteries.<br /> <br /> |-<br /> | [http://physiome.lf1.cuni.cz/ident3/physiome/ Physiome@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Research in human physiology.<br /> <br /> |-<br /> | [https://web.archive.org/http://casathome.ihep.ac.cn/ CAS@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/e-DUArD38Pw view]<br /> | Chinese Academy of Sciences<br /> |<br /> |<br /> | The main application is the TreeThreader which predicts protein structure.<br /> <br /> |-<br /> | [https://web.archive.org/web/20210417203758/http://boinc.scienterprise.cn/ scienterprise]<br /> |<br /> | 2020<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Enterprises own a lot of idle computing resources in their private cloud, while research projects are restricted by limited computing power. This project aims to decrease this imbalance by building CloudTides, an elastic platform on idle cloud resources.<br /> <br /> |-<br /> | [http://vath.xicp.cn/test/ volunteer@home]<br /> |<br /> | 2021<br /> |<br /> |<br /> |<br /> | [https://youtu.be/a4nO8ki2qR4 view]<br /> |<br /> |<br /> |<br /> | Very small test project, no information.<br /> <br /> |-<br /> | [https://web.archive.org/web/20191018200437/http://brainstormhome.org/ Brainstorm@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Investigate the molecular basis of brain-related diseases.<br /> <br /> |-<br /> | [http://hayes.nodium.net:8000/boincserver/ beef@home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Proof of concept temporary test project.<br /> <br /> |-<br /> | [https://web.archive.org/web/20170509144906/https://csgrid.org/csg/ Citizen Science Grid]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | UND's Computational Research Center and Information Technology Systems and Services<br /> | Multiple applications<br /> |<br /> | A wide range of research and educational projects using volunteer computing and citizen science, including DNA@Home, SubsetSum@Home, Climate Tweets, and Wildlife@Home.<br /> <br /> |-<br /> | [https://web.archive.org/web/20210125080541/https://www.kryptosathome.com/ Kryptos@Home]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Solving one of the most famous unsolved puzzles - the three-decade old Kryptos sculpture located on the grounds of the Central Intelligence Agency.<br /> <br /> |-<br /> | [https://web.archive.org/web/20200421212107/https://mindmodeling.org/ MindModeling@Home]<br /> | [https://boinc.berkeley.edu/wiki/Publications_by_BOINC_projects#MindModeling.40Home 6]<br /> | 2007-03-17<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/3aJmm60Wgl8 view]<br /> | University of Dayton Research Institute and Wright State University<br /> | Cognitive science<br /> |<br /> | Computational cognitive process modeling to better understand the human mind.<br /> <br /> |-<br /> | [https://web.archive.org/web/20210225002054/http://www.vdwnumbers.org/vdwnumbers/ Van Der Waerden Numbers]<br /> | [https://arxiv.org/abs/1603.03301 1]<br /> | 2021-02-02<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Daniel Monroe<br /> | Mathematics<br /> |<br /> | Van Der Waerden Numbers is a research project that uses Internet-connected computers to find better lower bounds for these numbers. Static mirror for this project: https://www.123numbers.org/<br /> <br /> |-<br /> | [http://burp.renderfarming.net/ Big and Ugly Rendering Project (BURP)]<br /> | [https://boinc.berkeley.edu/pubs.php#Big 2]<br /> |<br /> | Windows, Linux, Mac OS<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Render animated videos including [http://bbb3d.renderfarming.net/download.html Big Buck Bunny].<br /> <br /> |-<br /> | [https://boinc.berkeley.edu/test/ BOINC Test project]<br /> |<br /> | 2007-07-24<br /> | &amp;nbsp;<br /> |<br /> |<br /> | [https://youtu.be/e-DUArD38Pw view]<br /> | University of California, Berkeley<br /> | Software testing<br /> |<br /> | A test project for BOINC development.<br /> <br /> |-<br /> | [https://web.archive.org/web/20220711171713/https://boinc.tacc.utexas.edu/ BOINC@TACC]<br /> | [https://boinc.berkeley.edu/pubs.php#BOINC@TACC 3]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> | Texas Advanced Computing Center<br /> | Multiple applications<br /> |<br /> | Aerospace engineering, computational biology, and earthquake engineering.<br /> <br /> |-<br /> | [https://web.archive.org/http://boinc-dev.tacc.utexas.edu/boincserver/ BOINC@TACC dev]<br /> |<br /> |<br /> | &amp;nbsp;<br /> |<br /> |<br /> |<br /> | Texas Advanced Computing Center<br /> | Software testing<br /> |<br /> | Test project for BOINC@TACC.<br /> <br /> |-<br /> | [https://www.mlcathome.org/mlcathome/ MLC@Home]<br /> | [https://doi.org/10.48550/arXiv.2104.10555 1]<br /> | 2020-06-30 / 2022-08-02<br /> | [https://www.mlcathome.org/mlcathome/apps.php Windows, Linux, ARM]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | University of Maryland, Baltimore County<br /> | Cognitive science<br /> | [https://podcasts.apple.com/us/podcast/mlc-home/id1492837872?i=1000499605038 Listen]<br /> | Understanding and interpreting complex machine learning models.<br /> <br /> |-<br /> | [https://boinc.tbrada.eu/ T.Brada Experimental Grid]<br /> |<br /> | 2019-02-03 / 2022-12-24<br /> |<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> |<br /> | The PADLS Total subproject aims to find new pseudo-associative DLS.<br /> <br /> |-<br /> | [https://quchempedia.univ-angers.fr/athome/ QuChemPedIA@home]<br /> | [https://boinc.berkeley.edu/pubs.php#QuChemPedIA@home 4]<br /> | 2019-07-01 / 2022-09-29<br /> | [https://quchempedia.univ-angers.fr/athome/apps.php Windows, Linux, MacOS]<br /> | {{No}}<br /> | style=&quot;vertical-align:center;text-align:center; background: olive; color: black;&quot; | Vbox only<br /> |<br /> | Université Angers<br /> | Molecular Chemistry<br /> | [https://podcasts.apple.com/us/podcast/quchempedia/id1492837872?i=1000484760287 Listen]<br /> | Help chemical researchers around the world by building a unique collection of results and also help our AIs to propose much more new targets for the different applications we are addressing than we could do on our own.<br /> <br /> |-<br /> | [https://boinc.thesonntags.com/collatz/ Collatz Conjecture]<br /> | [https://link.springer.com/article/10.1007/s11227-020-03368-x 1]<br /> | 2009-01-06<br /> | [https://boinc.thesonntags.com/collatz/apps.php Windows, Linux, MacOS]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> |<br /> | Study the Collatz conjecture, an unsolved conjecture in mathematics.<br /> <br /> |-<br /> | [http://www.cosmologyathome.org/ Cosmology@Home]<br /> | [https://boinc.berkeley.edu/pubs.php#Cosmology@Home 5]<br /> | 2007-06-26 / 2024-01-10<br /> | [http://www.cosmologyathome.org/apps.php Windows, Linux, MacOS, Android]<br /> | {{No}}<br /> | {{Yes}}, Both<br /> |<br /> | Institut d'Astrophysique de Paris<br /> | Astronomy<br /> | [https://podcasts.apple.com/us/podcast/comology-home/id1492837872?i=1000521601975 Listen]<br /> | Find the most accurate models that best describe the universe.<br /> <br /> |-<br /> | [https://web.archive.org/web/20240118183120/http://bearnol.is-a-geek.com/wanless2/ WEP-M+2 Project]<br /> |<br /> | 2006-05-12 / 2024-01-18<br /> | [https://web.archive.org/web/20231126215917/http://bearnol.is-a-geek.com/wanless2/apps.php Linux, macOS]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | James Wanless, London, England<br /> | Mathematics<br /> | [https://www.youtube.com/live/9QexlknOdb0?feature=share Watch]<br /> | Factorization of Mersenneplustwo numbers. [[WEP-M+2 Project|See more...]]<br /> <br /> |-<br /> | [https://boinc.nanohub.org/nanoHUB_at_home/ nanoHUB@Home]<br /> |<br /> | 2012-07-26<br /> | [https://boinc.nanohub.org/nanoHUB_at_home/apps.php Windows, Linux, MacOS]<br /> | {{No}}<br /> | style=&quot;vertical-align:center;text-align:center; background: olive; color: black;&quot; | Vbox only<br /> |<br /> | Purdue University<br /> | Nanotechnology<br /> | [https://podcasts.apple.com/us/podcast/nanohub/id1492837872?i=1000488157528 Listen]<br /> | Research in nanoscience and nanotechnology. [[NanoHUB@Home|See more...]]<br /> <br /> |-<br /> | [http://link.springer.com/10.1007/978-3-540-30208-7_91 Unknown project]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://ieeexplore.ieee.org/document/1488682/ Unknown project]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://pubs.acs.org/doi/10.1021/jp806269w boinc@duq]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://www.comsol.com/paper/comsolgrid-a-framework-for-performing-large-scale-parameter-studies-using-comsol-8288 ComsolGrid]<br /> | [https://boinc.berkeley.edu/pubs.php#ComsolGrid 1]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://boinc.berkeley.edu/pubs.php#BOINC-MR BOINC-MR]<br /> | [https://boinc.berkeley.edu/pubs.php#BOINC-MR 2]<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [https://frostydata.com/0Kdata Data freezer]<br /> |<br /> | 2024-06-11<br /> | [https://frostydata.com/0Kdata/apps.php Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> | Storage<br /> |<br /> | Build a data warehouse on consumer hardware. [[Data freezer|See more...]]<br /> <br /> |-<br /> | [https://albertathome.org/ Albert@Home]<br /> |<br /> | 2011-12-23<br /> | [https://albertathome.org/apps.php Windows, Linux, MacOS, Android]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | University of Wisconsin–Milwaukee, Max Planck Institute<br /> | Software testing<br /> |<br /> | Test project for [[Einstein@Home]]. [[Albert@Home|See more...]]<br /> <br /> |-<br /> | [https://sech.me/boinc/Amicable/ Amicable Numbers]<br /> |<br /> | 2017-01-05<br /> | [https://sech.me/boinc/Amicable/apps.php Windows, Linux, ARM, MacOS]<br /> | style=&quot;vertical-align:center;text-align:center; background: yellow; color: black;&quot; | GPU CPU<br /> | {{No}}<br /> |<br /> | Independent<br /> | Mathematics<br /> | [https://podcasts.apple.com/us/podcast/boinc-radio-project-brief-amicable-numbers/id1492837872?i=1000581365935 Listen]<br /> | Amicable numbers are pairs where the sum of the proper divisors of each is equal to the other number. The goal of this project is to collect all amicable numbers up to a very large limit. [[Amicable Numbers|See more...]]<br /> <br /> |-<br /> | [https://blackholesathome.net/ BlackHoles@Home]<br /> |<br /> | {{No}}t yet<br /> |<br /> |<br /> |<br /> |<br /> | University of Idaho<br /> | Astrophysics<br /> | [https://podcasts.apple.com/us/podcast/boinc-radio-project-brief-blackholes-home/id1492837872?i=1000575215408 Listen]<br /> | Black hole collision simulations to maximize the science gained from gravitational wave observations. [[BlackHoles@Home|See more...]]<br /> <br /> |-<br /> | [https://team.dodoathome.com/dodo/ dodo@home]<br /> |<br /> | 2024-11-07<br /> | [https://team.dodoathome.com/dodo/apps.php Windows, Linux, MacOS]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> |<br /> |<br /> | We will bring the Dodo back from extinction (well, we will give it a damn good try!). [[Dodo@home|See more...]]<br /> <br /> |-<br /> | [https://nci.boinc.goofyx.pl/ goofyxGrid@Home NCI]<br /> |<br /> | 1) [https://web.archive.org/web/20191023104620/http://nci.goofyxgridathome.net:80/ 2015-11-09] / 2) 2024-06-20<br /> | [https://nci.boinc.goofyx.pl/apps.php Windows, Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Independent<br /> |<br /> | [https://podcasts.apple.com/us/podcast/goofyxgrid/id1492837872?i=1000490909639 Listen]<br /> | To simulate the infinite monkey theorem which states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type any given text, including the complete works of William Shakespeare. [[GoofyxGrid@Home NCI|See more...]]<br /> <br /> |-<br /> | [http://boinc.llmentor.org/LLMentorGrid/ LLMentorGrid]<br /> |<br /> | 2025-01-22<br /> | [http://boinc.llmentor.org/LLMentorGrid/apps.php Linux]<br /> |<br /> |<br /> |<br /> | Independent<br /> |<br /> |<br /> |<br /> <br /> |-<br /> | [http://parlea.ru/boinctest/ Parlea]<br /> |<br /> | 2022-12<br /> | [http://parlea.ru/boinctest/apps.php Windows, Android]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> |<br /> | Mathematics<br /> |<br /> | Investigate the efficiency and behavior of mobile devices as computing nodes on the BOINC platform for solving the Orthogonal Diagonal Latin Squares (ODLS) search problem. [[Parlea|See more...]]<br /> <br /> |-<br /> | [https://ralph.bakerlab.org/ RALPH@home]<br /> |<br /> | 2006-02-15<br /> | [https://ralph.bakerlab.org/apps.php Windows, Linux, ARM, macOS, Android]<br /> | {{No}}<br /> | {{Yes}}, Both<br /> | [https://youtu.be/W9fC5lv76T0 view]<br /> | University of Washington<br /> | Software testing<br /> |<br /> | Test project for [[Rosetta@home]]. [[RALPH@home|See more...]]<br /> <br /> |-<br /> | RNA World (computing project) | [https://www.rnaworld.de/rnaworld/ RNA World (beta)]<br /> | [https://boinc.berkeley.edu/pubs.php#RNA 5]<br /> | 2009-05-21<br /> | [https://www.rnaworld.de/rnaworld/apps.php Windows, Linux, MacOS]<br /> | {{No}}<br /> | style=&quot;vertical-align:center;text-align:center; background: olive; color: black;&quot; | Vbox only<br /> | [https://youtu.be/GHJ4KBdwVew view]<br /> | Independent research group in Marburg, Germany<br /> | Molecular biology<br /> | [https://podcasts.apple.com/us/podcast/rnaworld/id1492837872?i=1000496594043 Listen]<br /> | Uses bioinformatics software to study RNA structure. [[RNA World (beta)|See more...]]<br /> <br /> |-<br /> | [https://boinc.termit.me/adsl/ SPT@home]<br /> |<br /> | 2023-06-14<br /> | [https://boinc.termit.me/adsl/ Windows, Linux]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> |<br /> | Mathematics<br /> |<br /> | The Symmetric Prime Tuples (SPT) project is a continuation of the T. Brada Experimental Grid project. [[SPT|See more...]]<br /> <br /> |-<br /> | [https://universeathome.pl/universe/ Universe@Home]<br /> | [https://boinc.berkeley.edu/wiki/Publications_by_BOINC_projects#Universe.40home 14]<br /> | 2015-02-19<br /> | [https://universeathome.pl/universe/apps.php Windows, Linux, ARM]<br /> | {{No}}<br /> | {{No}}<br /> |<br /> | Nicolaus Copernicus Astronomical Center of the Polish Academy of Sciences<br /> | Astronomy<br /> |<br /> | Computational astrophysics, computer simulation of stars, galaxies and the Universe. [[Universe@Home|See more...]]<br /> |}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Main_Page&diff=1419 2026-05-28T16:33:17Z

<p>Al Piskun: add seo description</p> <hr /> <div>{{SEO|description=BOINC Projects - a directory and reference for all BOINC volunteer computing projects, past and present.}}<br /> __NOTOC__<br /> __NOEDITSECTION__<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> HERO BANNER<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> &lt;div class=&quot;bs-hero&quot;&gt;[[File:Banner.png|center|frameless|250x250px]]<br /> &lt;div class=&quot;bs-hero-title&quot;&gt;BOINC Projects&lt;/div&gt;<br /> &lt;div class=&quot;bs-hero-subtitle&quot;&gt;The most comprehensive encyclopedia of BOINC volunteer computing projects on the web&lt;/div&gt;<br /> &lt;div class=&quot;bs-hero-btn&quot;&gt;'''[[BOINC projects|➜ Browse the Complete BOINC Projects Table]]'''&lt;/div&gt;<br /> &lt;div class=&quot;bs-hero-note&quot;&gt;The definitive, community-maintained table documenting every known active and retired BOINC project. The most comprehensive BOINC project list anywhere on the internet.&lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> QUICK-STATS RIBBON<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> &lt;div class=&quot;bs-stats&quot;&gt;<br /> &lt;div class=&quot;bs-stat bs-stat-purple&quot;&gt;<br /> &lt;div class=&quot;bs-stat-number&quot;&gt;51&lt;/div&gt;<br /> &lt;div class=&quot;bs-stat-label&quot;&gt;Projects documented&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-stat bs-stat-teal&quot;&gt;<br /> &lt;div class=&quot;bs-stat-number&quot;&gt;334&lt;/div&gt;<br /> &lt;div class=&quot;bs-stat-label&quot;&gt;Projects listed&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-stat bs-stat-coral&quot;&gt;<br /> &lt;div class=&quot;bs-stat-number&quot;&gt;10+&lt;/div&gt;<br /> &lt;div class=&quot;bs-stat-label&quot;&gt;Research fields&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-stat bs-stat-blue&quot;&gt;<br /> &lt;div class=&quot;bs-stat-number&quot;&gt;{{CURRENTYEAR}}&lt;/div&gt;<br /> &lt;div class=&quot;bs-stat-label&quot;&gt;Continuously updated&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> WHAT IS A BOINC PROJECT?<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> &lt;div class=&quot;bs-definition&quot;&gt;<br /> &lt;span class=&quot;bs-definition-label&quot;&gt;What is a BOINC project?&lt;/span&gt;<br /> '''A BOINC project''' is a website and associated server set up by an individual or group to distribute applications to [https://boinc.berkeley.edu/ BOINC] volunteer computing devices. Those devices deliberately attach to receive, process, and return results for further scientific research — at no cost to the researcher, and no cost to the volunteer beyond electricity.<br /> <br /> ''BOINC'' stands for '''Berkeley Open Infrastructure for Network Computing''', developed at the University of California, Berkeley. Any researcher can create a BOINC project; any person can donate their idle CPU or GPU time to one.<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> PRIMARY CTA — TABLE LINK<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> &lt;div class=&quot;bs-cta&quot;&gt;<br /> &lt;div class=&quot;bs-cta-title&quot;&gt;📋 The BOINC Projects Master Table&lt;/div&gt;<br /> &lt;div class=&quot;bs-cta-body&quot;&gt;The [[BOINC projects|List of all BOINC projects]] table is the heart of this wiki — a structured, sortable reference covering project name, research field, institution, supported platforms, active status, GPU support, and more. It is the primary reason this resource exists and the most complete registry of BOINC projects available anywhere.&lt;/div&gt;<br /> &lt;big&gt;'''[[BOINC projects|View the complete list of BOINC projects →]]'''&lt;/big&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> LOCAL PROJECT PAGES<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> == Local BOINC project wiki pages ==<br /> <br /> Each project below has its own dedicated article on this wiki. Projects are grouped by research domain and activity status.<br /> <br /> === ✦ Active BOINC projects ===<br /> <br /> &lt;div class=&quot;bs-group bs-group-teal mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🔭 Astrophysics, Cosmology &amp; Space&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[Einstein@Home]] gravitational wave and pulsar detection<br /> | * [[MilkyWay@home]] mapping the Milky Way's structure<br /> |-<br /> | * [[LHC@home]] CERN particle physics simulations<br /> | * [[Gaia@home]] ESA Gaia mission data reduction<br /> |-<br /> | colspan=&quot;2&quot; | * [[SPACIOUS@home]] space situational awareness<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-purple mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🧬 Biology, Medicine &amp; Biochemistry&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[GPUGRID]] GPU-accelerated biomolecular simulations<br /> | * [[TN-Grid]] neurological research<br /> |-<br /> | * [[Rosetta@home]] protein structure prediction<br /> |<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-blue mw-collapsible&quot;&gt;&lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🔢 Mathematics, Number Theory &amp; Cryptography&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |* [[Gerasim@home]] multi-project. number field sieve factorisation<br /> |<br /> |-<br /> | * [[PrimeGrid]] prime number searches across many sub-projects<br /> | * [[NFS@Home]] number field sieve factorisation<br /> |-<br /> | * [[SRBase]] Sierpinski-Riesel base search<br /> | * [[NumberFields@Home]] algebraic number field tables<br /> |-<br /> | * [[YAFU]] yet another factorisation utility<br /> | * [[LODA]] integer sequence program synthesis<br /> |-<br /> | * [[Moo! Wrapper]] distributed.net RC5-72 wrapper<br /> | * [[ODLK]] orthogonal diagonal Latin squares<br /> |-<br /> | * [[ODLK1]] ODLK variant 1<br /> | * [[ODLK2025]] ODLK 2025 campaign<br /> |-<br /> | * [[Rakesearch]] Latin square searches<br /> | * [[SPT]] Subspace Polynomial Traversal<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-green mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🌍 Climate, Environment &amp; Earth Sciences&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[Climateprediction.net|climate''prediction''.net]] global climate ensemble modelling<br /> | * [[Asteroids@home]] asteroid orbit determination<br /> |-<br /> | * [[Radioactive@home]] background radiation monitoring<br /> |<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-amber mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🤖 Artificial Intelligence, Computing &amp; Infrastructure&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[IThena.Computational]] computational measurement network<br /> | * [[IThena.Measurements]] network performance metrics<br /> |-<br /> | * [[BOINC Central]] BOINC infrastructure project<br /> | * [[WUProp@Home]] work unit propagation statistics<br /> |-<br /> |* [[Yoyo@home]] scientific and mathematical subprojects<br /> |<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-coral mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🧪 Physics, Chemistry &amp; Materials Science&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[USPEX@HOME]] crystal structure prediction<br /> | * [[World Community Grid]] multi-domain humanitarian research<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-gray mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🕹️ Community, Recreation &amp; Miscellaneous&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[Minecraft@Home]] Minecraft world-seed research<br /> | * [[PRIVATE GFN SERVER]] private Generalized Fermat Number server<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;div class=&quot;bs-group bs-group-pink mw-collapsible&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;🧫 Test &amp; Development Projects&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> &lt;div class=&quot;bs-group-note&quot;&gt;These projects serve as active testing and development platforms for BOINC software and infrastructure rather than primary research goals.&lt;/div&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | colspan=&quot;2&quot; | * [[Cpdnboinc dev]] cpdn development and testing server<br /> |}<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> === ✦ Paused BOINC projects ===<br /> <br /> &lt;div class=&quot;bs-group bs-group-amber mw-collapsible mw-collapsed&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;⏯ Paused projects (expand)&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> &lt;div class=&quot;bs-group-note&quot;&gt;These projects are temporarily suspended but have not formally closed. Work may resume in future.&lt;/div&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[DENIS@home]] cardiac electrophysiology research, currently paused<br /> |* [[SiDock@home]] drug candidate screening<br /> |}<br /> &lt;div class=&quot;bs-group-footer&quot;&gt;''See the [[BOINC projects|master BOINC projects table]] for the most current status of all projects.''&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> === ✦ Retired &amp; inactive BOINC projects ===<br /> <br /> &lt;div class=&quot;bs-group bs-group-gray mw-collapsible mw-collapsed&quot;&gt;<br /> &lt;div class=&quot;bs-group-toggle mw-collapsible-toggle&quot;&gt;⏸ Retired projects (expand)&lt;/div&gt;<br /> &lt;div class=&quot;mw-collapsible-content&quot;&gt;<br /> &lt;div class=&quot;bs-group-note&quot;&gt;These projects have suspended operations or are no longer accepting new work units. Their pages are preserved here for historical reference and research continuity.&lt;/div&gt;<br /> {| class=&quot;bs-project-table&quot;<br /> |-<br /> | * [[Albert@Home]] developement site for Einstein@Home<br /> | * [[Amicable Numbers]] amicable pair enumeration<br /> |-<br /> | * [[Axiom Distributed AI]] distributed AI model training<br /> | * [[BlackHoles@Home]] black hole binary merger waveforms<br /> |-<br /> | * [[Data freezer]] long-term data archival research<br /> | * [[GoofyxGrid@Home NCI]] non-covalent interaction analysis<br /> |-<br /> | * [[nanoHUB@Home]] nanotechnology simulation<br /> | * [[Parlea]] RNA 3D structure motif analysis<br /> |-<br /> | * [[RALPH@home]] developement site for Rosetta@home<br /> | * [[Ramanujan Machine]] conjectured mathematical identities<br /> |-<br /> | * [[Universe@Home]] stellar evolution modelling<br /> | * [[WEP-M+2 Project]] Mersenne-related prime search<br /> |-<br /> |[[RNA World (beta)]] RNA folding and molecular evolution<br /> |* [[SETI@home]] search for extraterrestrial intelligence<br /> |}<br /> &lt;div class=&quot;bs-group-footer&quot;&gt;''See the [[BOINC projects|master BOINC projects table]] for definitive active/inactive status on all documented projects.''&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> HOW TO PARTICIPATE<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> == How to participate in BOINC projects ==<br /> <br /> &lt;div class=&quot;bs-steps&quot;&gt;<br /> &lt;div class=&quot;bs-step bs-step-purple&quot;&gt;<br /> &lt;div class=&quot;bs-step-title&quot;&gt;1. Download BOINC&lt;/div&gt;<br /> &lt;div class=&quot;bs-step-body&quot;&gt;Get the free BOINC client from [https://boinc.berkeley.edu/download.php boinc.berkeley.edu]. Available for Windows, macOS, Linux, and Android.&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-step bs-step-teal&quot;&gt;<br /> &lt;div class=&quot;bs-step-title&quot;&gt;2. Choose a project&lt;/div&gt;<br /> &lt;div class=&quot;bs-step-body&quot;&gt;Browse the [[BOINC projects|complete BOINC projects list]] on this wiki. Filter by research field, platform support, or GPU availability.&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;div class=&quot;bs-step bs-step-blue&quot;&gt;<br /> &lt;div class=&quot;bs-step-title&quot;&gt;3. Attach &amp; contribute&lt;/div&gt;<br /> &lt;div class=&quot;bs-step-body&quot;&gt;Register on the project's website, attach via the BOINC client, and your idle computer begins processing work units automatically.&lt;/div&gt;<br /> &lt;/div&gt;<br /> &lt;/div&gt;<br /> <br /> &lt;!-- ═══════════════════════════════════════════════════════<br /> ABOUT THIS WIKI<br /> ═══════════════════════════════════════════════════════ --&gt;<br /> == About this wiki ==<br /> <br /> This ''BOINC projects'' MediaWiki is researched, written, and maintained by [https://boincsynergy.ca/ BOINC Synergy] — a volunteer initiative dedicated to documenting the global BOINC ecosystem. The [[BOINC projects|projects table]] is considered the flagship resource: a single, structured, continuously-updated registry of every known BOINC project, past and present.<br /> <br /> Corrections, additions, and edits are welcome. If you know of a BOINC project not yet listed, please use the talk page or contact [https://boincsynergy.ca/ BOINC Synergy] directly.<br /> <br /> &lt;div class=&quot;bs-footer-bar&quot;&gt;<br /> &lt;small&gt;'''''BOINC projects''''' MediaWiki is developed by [https://boincsynergy.ca/ BOINC Synergy] &amp;nbsp;·&amp;nbsp; Content reflects the state of the BOINC ecosystem as of {{CURRENTYEAR}} &amp;nbsp;·&amp;nbsp; [[BOINC projects|Full projects table →]]&lt;/small&gt;<br /> &lt;/div&gt;<br /> <br /> [[Category:BOINC projects]]<br /> [[Category:Volunteer computing]]<br /> [[Category:Distributed computing]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=Template:SEO&diff=1418 2026-05-28T16:20:18Z

<p>Al Piskun: Created page with &quot;{{#seo: |title={{{title|{{PAGENAME}}}}} |image={{{image|}}} |description={{{description|}}} }}&quot;</p> <hr /> <div>{{#seo:<br /> |title={{{title|{{PAGENAME}}}}}<br /> |image={{{image|}}}<br /> |description={{{description|}}}<br /> }}</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=BOINC_projects/completed_projects.html&diff=1417 2026-05-28T15:36:28Z

<p>Al Piskun: Changed redirect target from BOINC projects#290 Completed BOINC Projects to BOINC projects#Completed BOINC Projects</p> <hr /> <div>#REDIRECT [[BOINC_projects#Completed_BOINC_Projects]]</div>

Al Piskun https://boincsynergy.ca/wiki/index.php?title=BOINC_projects/&diff=1416 2026-05-28T15:35:28Z

<p>Al Piskun: Changed redirect target from BOINC projects#38 Active BOINC Projects to BOINC projects#Active BOINC Projects</p> <hr /> <div>#REDIRECT [[BOINC projects#Active_BOINC_Projects]]</div>

Al Piskun