BOINC Projects - Recent changes [en]

Virtual Prairie

Al Piskun — Sun, 26 Jul 2026 15:15:11 GMT

add links

← Older revision		Revision as of 15:15, 26 July 2026
Line 90:		Line 90:
	; Using BOINC-computed data		; Using BOINC-computed data
	* Cendrine Mony, Marc Garbey, Malek Smaoui, Marie-Lise Benot. "Large scale parameter study of an individual-based model of clonal plant with volunteer computing." ''Ecological Modelling'', vol. 222, no. 4, 2011, pp. 935–946. {{doi\|10.1016/j.ecolmodel.2010.10.014}}<ref name="ecolmodel2011" />		* Cendrine Mony, Marc Garbey, Malek Smaoui, Marie-Lise Benot. "Large scale parameter study of an individual-based model of clonal plant with volunteer computing." ''Ecological Modelling'', vol. 222, no. 4, 2011, pp. 935–946. {{doi\|10.1016/j.ecolmodel.2010.10.014}}<ref name="ecolmodel2011" />
	* Malek Smaoui, Marc Garbey. "Parallel Genetic Algorithm Implementation for BOINC." ''Parallel Computing: From Multicores and GPU's to Petascale'', vol. 19, IOS Press, 2010, pp. 212–219 (Proceedings of the International Conference on Parallel Computing, ParCo, 1–4 September 2009, Lyon, France).<ref name="parco2009" />		* Malek Smaoui, Marc Garbey. "[https://web.archive.org/web/20100724031842/http://vcsc.cs.uh.edu/virtual-prairie/pages_site_aurelie/ParCo09Smaoui_Garbey.pdf Parallel Genetic Algorithm Implementation for BOINC.]" ''Parallel Computing: From Multicores and GPU's to Petascale'', vol. 19, IOS Press, 2010, pp. 212–219 (Proceedings of the International Conference on Parallel Computing, ParCo, 1–4 September 2009, Lyon, France).<ref name="parco2009" />
	* Malek Smaoui, Marc Garbey, Cendrine Mony. "Virtual Prairie: Going green with volunteer computing." ''Proceedings of the IEEE Asia-Pacific Services Computing Conference'' (APSCC), 9–12 December 2008, Yilan, Taiwan, pp. 427–434.<ref name="apscc2008">{{cite conference \|authors=Malek Smaoui, Marc Garbey, Cendrine Mony \|title=Virtual Prairie: Going green with volunteer computing \|booktitle=Proceedings of the IEEE Asia-Pacific Services Computing Conference \|pages=427–434 \|date=2008 \|conference=APSCC, 9–12 December 2008, Yilan, Taiwan}}</ref>		* Malek Smaoui, Marc Garbey, Cendrine Mony. "[https://www.academia.edu/75230011/Virtual_Prairie_Going_Green_with_Volunteer_Computing Virtual Prairie: Going green with volunteer computing.]" ''Proceedings of the IEEE Asia-Pacific Services Computing Conference'' (APSCC), 9–12 December 2008, Yilan, Taiwan, pp. 427–434.<ref name="apscc2008">{{cite conference \|authors=Malek Smaoui, Marc Garbey, Cendrine Mony \|title=Virtual Prairie: Going green with volunteer computing \|booktitle=Proceedings of the IEEE Asia-Pacific Services Computing Conference \|pages=427–434 \|date=2008 \|conference=APSCC, 9–12 December 2008, Yilan, Taiwan}}</ref>
	* Marc Garbey, Cendrine Mony, Malek Smaoui. "Fluid flow, agent based hybrid model for the simulation of virtual prairies." ''Lecture Notes in Computational Science and Engineering'', vol. 74, part 10, 2011, pp. 369–376 (Proceedings of the Parallel Computational Fluid Dynamics Conference, ParCFD, 18–22 May 2008, Lyon, France).<ref name="parcfd2008">{{cite conference \|authors=Marc Garbey, Cendrine Mony, Malek Smaoui \|title=Fluid flow, agent based hybrid model for the simulation of virtual prairies \|booktitle=Lecture Notes in Computational Science and Engineering \|volume=74 \|pages=369–376 \|date=2011 \|conference=Parallel Computational Fluid Dynamics Conference (ParCFD), 18–22 May 2008, Lyon, France}}</ref>		* Marc Garbey, Cendrine Mony, Malek Smaoui. "[https://web.archive.org/web/20110830131424/http://vcsc.cs.uh.edu/virtual-prairie/pages_site_aurelie/ParCFD4.pdf Fluid flow, agent based hybrid model for the simulation of virtual prairies.]" ''Lecture Notes in Computational Science and Engineering'', vol. 74, part 10, 2011, pp. 369–376 (Proceedings of the Parallel Computational Fluid Dynamics Conference, ParCFD, 18–22 May 2008, Lyon, France).<ref name="parcfd2008">{{cite conference \|authors=Marc Garbey, Cendrine Mony, Malek Smaoui \|title=Fluid flow, agent based hybrid model for the simulation of virtual prairies \|booktitle=Lecture Notes in Computational Science and Engineering \|volume=74 \|pages=369–376 \|date=2011 \|conference=Parallel Computational Fluid Dynamics Conference (ParCFD), 18–22 May 2008, Lyon, France}}</ref>

	; Other project-related publications		; Other project-related publications
	* Marc Garbey, Malek Smaoui, Waree Rinsurongkawong, Cendrine Mony. "The Virtual Prairie Project." Invited plenary lecture, 2nd International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering, Ajaccio, Corsica, April 2011, Civil-Comp Press.<ref name="civilcomp2011">{{cite conference \|authors=Marc Garbey, Malek Smaoui, Waree Rinsurongkawong, Cendrine Mony \|title=The Virtual Prairie Project \|booktitle=2nd International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering \|publisher=Civil-Comp Press \|date=April 2011 \|conference=Ajaccio, Corsica}}</ref>		* Marc Garbey, Malek Smaoui, Waree Rinsurongkawong, Cendrine Mony. "The Virtual Prairie Project." Invited plenary lecture, 2nd International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering, Ajaccio, Corsica, April 2011, Civil-Comp Press.<ref name="civilcomp2011">{{cite conference \|authors=Marc Garbey, Malek Smaoui, Waree Rinsurongkawong, Cendrine Mony \|title=The Virtual Prairie Project \|booktitle=2nd International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering \|publisher=Civil-Comp Press \|date=April 2011 \|conference=Ajaccio, Corsica}}</ref>
	* Cendrine Mony, Marc Garbey. "Updates on the Virtual Prairie Project." 5th Pan-Galactic BOINC Workshop, 22–23 October 2009, Barcelona, Spain.<ref name="workshop2009">{{cite conference \|authors=Cendrine Mony, Marc Garbey \|title=Updates on the Virtual Prairie Project \|conference=5th Pan-Galactic BOINC Workshop, 22–23 October 2009, Barcelona, Spain}}</ref>		* Cendrine Mony, Marc Garbey. "[https://web.archive.org/web/20100724032022/http://vcsc.cs.uh.edu/virtual-prairie/pages_site_aurelie/Boinc_workshop_Marc_Garbey_2.pdf Updates on the Virtual Prairie Project.]" 5th Pan-Galactic BOINC Workshop, 22–23 October 2009, Barcelona, Spain.<ref name="workshop2009">{{cite conference \|authors=Cendrine Mony, Marc Garbey \|title=Updates on the Virtual Prairie Project \|conference=5th Pan-Galactic BOINC Workshop, 22–23 October 2009, Barcelona, Spain}}</ref>
	* Marc Garbey. "Virtual Prairies with BOINC." 4th Pan-Galactic BOINC Workshop, 11–12 September 2008, INRIA, Grenoble, France.<ref name="workshop2008">{{cite conference \|authors=Marc Garbey \|title=Virtual Prairies with BOINC \|conference=4th Pan-Galactic BOINC Workshop, 11–12 September 2008, INRIA, Grenoble, France}}</ref>		* Marc Garbey. "[https://web.archive.org/web/20100724031558/http://vcsc.cs.uh.edu/virtual-prairie/pages_site_aurelie/Grenoble.pdf Virtual Prairies with BOINC.]" 4th Pan-Galactic BOINC Workshop, 11–12 September 2008, INRIA, Grenoble, France.<ref name="workshop2008">{{cite conference \|authors=Marc Garbey \|title=Virtual Prairies with BOINC \|conference=4th Pan-Galactic BOINC Workshop, 11–12 September 2008, INRIA, Grenoble, France}}</ref>
	* Cendrine Mony, Marc Garbey, Malek Smaoui. "Using modelling to understand clonal strategies in optimal growing conditions." 51st Annual Symposium of the International Association for Vegetation Science, 7–12 September 2008, South Africa.<ref name="iavs2008">{{cite conference \|authors=Cendrine Mony, Marc Garbey, Malek Smaoui \|title=Using modelling to understand clonal strategies in optimal growing conditions \|conference=51st Annual Symposium of the International Association for Vegetation Science, 7–12 September 2008, South Africa}}</ref>		* Cendrine Mony, Marc Garbey, Malek Smaoui. "Using modelling to understand clonal strategies in optimal growing conditions." 51st Annual Symposium of the International Association for Vegetation Science, 7–12 September 2008, South Africa.<ref name="iavs2008">{{cite conference \|authors=Cendrine Mony, Marc Garbey, Malek Smaoui \|title=Using modelling to understand clonal strategies in optimal growing conditions \|conference=51st Annual Symposium of the International Association for Vegetation Science, 7–12 September 2008, South Africa}}</ref>

Virtual Prairie

Al Piskun — Sun, 26 Jul 2026 14:55:18 GMT

first light

New page

{{Infobox software
| name = Virtual Prairie
| logo =
| logo caption =
| screenshot =
| caption =
| description = Virtual Prairie (ViP) was a completed BOINC volunteer computing project run by the University of Houston and the University of Rennes 1 that used individual-based simulations of clonal plant growth to inform the ecological design of sustainable prairie ecosystems.
| status = Completed
| category = Ecology
| compute = CPU
| dependencies = None
| developer = University of Houston Department of Computer Science; University of Rennes 1 (UMR CNRS ECOBIO)
| author = Marc Garbey, Cendrine Mony
| sponsor = [[wikipedia:Agence Nationale de la Recherche|Agence Nationale de la Recherche]] (ANR), [[wikipedia:Centre national de la recherche scientifique|CNRS]], Cemagref, [[wikipedia:French Institute for Research in Computer Science and Automation|INRIA]]
| maintainer =
| released = 2008
| completed = 2011
| discontinued =
| repository =
| programming language =
| operating system =
| size =
| stats as of =
| average performance =
| active users =
| total users =
| active hosts =
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|http://vcsc.cs.uh.edu/virtual-prairie/}} (defunct)
| license =
}}

'''Virtual Prairie''' (also referred to as '''ViP''') was a completed [[BOINC]] [[wikipedia:volunteer computing|volunteer computing]] project that studied the ecology of [[wikipedia:prairie|prairie]] and [[wikipedia:grassland|grassland]] ecosystems through large-scale individual-based simulation of [[wikipedia:clonal colony|clonal plant]] growth.<ref name="uh2009">{{cite web |authors=University of Houston |title=Virtual Prairie Project With Garbey as PI Taking Off |url=https://www.uh.edu/nsm/computer-science/news-events/stories/2009/0422_garbey_02.php |website=University of Houston |date=22 April 2009 |access-date=26 July 2026}}</ref> The project was jointly led by Professor Marc Garbey of the [[wikipedia:University of Houston|University of Houston]] Department of Computer Science and Assistant Professor Cendrine Mony of the [[wikipedia:University of Rennes 1|University of Rennes 1]], and combined high-performance computing with BOINC-based volunteer computing to model how agricultural and land-management practices affect plant competition and genetic structure within prairies.<ref name="sicortex2009">{{cite press release |authors=SiCortex, Inc. |title=Leading International Universities Use SiCortex Computers to Protect Prairial Systems |date=17 February 2009 |location=Maynard, Massachusetts}}</ref>

The project's goal was to help design new grassland systems that balance water purification, biodiversity conservation, and carbon storage.<ref name="sicortex2009" /> At the time it was described by its organizers as the world's largest ecological simulation.<ref name="sicortex2009" />

[[File:Restored tallgrass prairie in DuPage County, Illinois.jpg|thumb|right|Prairie grassland ecosystems, like this restored tallgrass prairie in Illinois, provide ecological services such as water purification, biodiversity support, and carbon storage that the Virtual Prairie project sought to help optimize.]]

== Background ==
Environmental policy developments of the 2000s, including the European [[wikipedia:Common Agricultural Policy|Common Agricultural Policy]] reforms of 2005 and France's Grenelle Environment Forum of 2007, focused new attention on the ecological services provided by grassland ecosystems, particularly the availability of unpolluted fresh water and the regulation of carbon emissions.<ref name="uh2009" /> Natural prairies had historically been studied mainly for their agricultural productivity, but researchers increasingly sought to understand and reproduce their broader ecological functions, including nitrate pollution remediation, erosion prevention, and habitat stability for vulnerable species.<ref name="uh2011">{{cite web |authors=University of Houston |title=Protecting Ecosystems, Pollution Remediation Goals of Research at UH |url=https://www.uh.edu/nsm/news-events/stories/2011/0307_ecosystems.php |website=University of Houston |date=7 March 2011 |access-date=26 July 2026}}</ref>

Virtual Prairie approached this problem computationally: since a prairie is a complex system with emergent properties arising from the interaction of many individual plants, the project's researchers built an [[wikipedia:individual-based model|individual-based model]] (IBM), sometimes described as an [[wikipedia:agent-based model|agent-based model]], to simulate the growth of clonal plants at the level of individual ramets (the repeated modular units of a clonal plant network) and to test which combinations of plant traits and management strategies produced the best ecological outcomes.<ref name="ecolmodel2011" />

== Research design and computational methods ==

=== Individual-based clonal plant model ===
The core simulation, referred to in publications as the CLONAL model, represented a clonal plant as a network of interconnected ramets that could share and store resources.<ref name="ecolmodel2011">{{cite journal |authors=Cendrine Mony, Marc Garbey, Malek Smaoui, Marie-Lise Benot |title=Large scale parameter study of an individual-based model of clonal plant with volunteer computing |journal=Ecological Modelling |volume=222 |issue=4 |pages=935–946 |date=2011 |doi=10.1016/j.ecolmodel.2010.10.014}}</ref> The model incorporated nine growth rules governing metabolic processes, plant architecture, and resource sharing and storage, controlled by nineteen input parameters.<ref name="researchgate-smaoui">{{cite web |authors=Malek Smaoui |title=Research works (profile excerpt discussing the CLONAL model parameter study) |url=https://www.researchgate.net/scientific-contributions/Malek-Smaoui-74531876 |website=ResearchGate |access-date=26 July 2026}}</ref>

Rather than testing only a small, expert-selected subset of parameter combinations, as was typical in earlier ecological modelling literature, the project's researchers chose two to four candidate values for each of the nineteen parameters and tested essentially all resulting combinations, an approach only made tractable through volunteer computing:<ref name="researchgate-smaoui" />

<math>N = \prod_{i=1}^{19} k_i \approx 2 \times 10^{7}</math>

where <math>k_i</math> is the number of candidate values tested for parameter <math>i</math>. Sources close to the project reported the resulting simulation count slightly differently depending on the run being described, with the February 2009 project press release citing more than 22 million completed simulations in the first phase of the project<ref name="sicortex2009" /> and the project's 2011 journal paper describing roughly 20 million parameter combinations tested overall.<ref name="researchgate-smaoui" />

=== Two-phase simulation strategy ===
The project ran in two broad phases. In the first phase, researchers modeled individual plant space colonization through clonal reproduction to generate initial hypotheses about competitive strategies between plant types; this phase alone produced more than 22 million simulation runs and found that prairie growth was best explained not by a single dominant strategy but by a small number of distinct viable strategies.<ref name="sicortex2009" /> The second, more ambitious phase aimed to run thousands of combinations of plant types together in a single master simulation across an entire growing season, in order to identify optimal species combinations for long-term prairie sustainability under varying conditions.<ref name="sicortex2009" />

To manage the scale of the second phase, the team developed a parallel multi-objective [[wikipedia:genetic algorithm|genetic algorithm]] (PGA) that could run on top of BOINC to fine-tune the optimization process, described in a 2009 conference paper by PhD student Malek Smaoui and Garbey.<ref name="parco2009">{{cite conference |authors=Malek Smaoui, Marc Garbey |title=Parallel Genetic Algorithm Implementation for BOINC |booktitle=Parallel Computing: From Multicores and GPU's to Petascale |volume=19 |pages=212–219 |publisher=IOS Press |date=2010 |conference=International Conference on Parallel Computing (ParCo), 1–4 September 2009, Lyon, France}}</ref>

=== Computing infrastructure ===
[[File:UH Science and Engineering Research and Classroom Complex.jpg|thumb|right|The University of Houston, whose Department of Computer Science and Research Computing Center hosted Virtual Prairie's local computing infrastructure.]]

Early, computationally intensive runs used local high-performance computing (HPC) hardware at the University of Houston. The department's third such system, provided by [[wikipedia:SiCortex|SiCortex]], was a single-cabinet 2.1 [[wikipedia:FLOPS|TFLOPS]] cluster built around 648 [[wikipedia:64-bit computing|64-bit]] processors, acquired as a joint venture between the university's Department of Computer Science and its Research Computing Center (RCC).<ref name="sicortex2009" /> SiCortex, which marketed itself on the energy efficiency of its systems, ceased operations in May 2009, a few months after this system was highlighted in connection with the project.<ref name="sicortex-shutdown">{{cite web |authors=HPCwire staff |title=SiCortex Meets an Untimely End |url=https://www.hpcwire.com/2009/05/28/sicortex_meets_an_untimely_end/ |website=HPCwire |date=28 May 2009 |access-date=26 July 2026}}</ref>

[[File:Beaulieu 1 Université de Rennes.JPG|thumb|left|The Beaulieu campus of the University of Rennes 1 in France, home to the UMR CNRS ECOBIO laboratory that led the project's ecological modelling work.]]

For the larger, second-phase master simulations, the project moved to BOINC-based volunteer computing, distributing work to home and lab computers around the world.<ref name="parco2009" /> By 2011, the university reported that more than 10,000 volunteers in 90 countries had contributed computing time to the project.<ref name="uh2011" /> The project's BOINC application was hosted at {{URL|http://vcsc.cs.uh.edu/virtual-prairie/}}, run as a Virtual Campus Supercomputing Center (VCSC) project of the University of Houston.<ref name="vcsc-wiki">{{cite web |authors=BOINC project |title=VirtualCampusSupercomputerCenter |url=https://github.com/BOINC/boinc/wiki/VirtualCampusSupercomputerCenter |website=BOINC wiki (GitHub) |access-date=26 July 2026}}</ref>

== Project team ==
Virtual Prairie was a joint effort between two university research groups:
* At the University of Houston, principal investigator Marc Garbey, chair of the Department of Computer Science, worked with PhD students Malek Smaoui, who focused on volunteer computing, evolutionary algorithms, and Monte Carlo methods, and Waree Rinsurongkawong, who worked on parallel data mining methods.<ref name="uh2009" /><ref name="sciencedirect-smaoui">{{cite web |authors=ScienceDirect |title=Improving volunteer computing scheduling for evolutionary algorithms (author biography excerpt) |url=https://www.sciencedirect.com/science/article/abs/pii/S0167739X12000921 |website=ScienceDirect |access-date=26 July 2026}}</ref> Multicore and software optimization researcher [[wikipedia:Barbara Chapman (computer scientist)|Barbara Chapman]] also contributed to the project's computing infrastructure work.<ref name="sicortex2009" />
* At the University of Rennes 1, Cendrine Mony led a team that included Professor Bernard Clement and PhD candidates Marie-Lise Benot and Anne-Kristel Bittebiere.<ref name="uh2011" /> Benot later became a post-doctoral researcher at the Laboratory of Alpine Ecology in Grenoble, France.<ref name="uh2011" />

== Funding ==
The project was funded by several French national research agencies, including the Agence Nationale de la Recherche (ANR, under grant ANR-08-SYSC-012), the Centre national de la recherche scientifique (CNRS), Cemagref (the Institute for Research in Science and Technology for the Environment, later merged into [[wikipedia:Irstea|Irstea]]), and INRIA (the National Institute for Research in Computer Science and Control).<ref name="uh2009" /><ref name="uh2011" /><ref name="anr-grant">{{cite web |authors=BOINC message boards |title=Virtual Prairie results published (forum thread quoting ANR-08-SYSC-012 grant acknowledgement) |url=https://boinc.berkeley.edu/forum_thread.php?id=6607 |website=BOINC |date=June 2011 |access-date=26 July 2026}}</ref>

== Results and publications impact ==
The project's central ecological finding, drawn from its large-scale parameter study, was that high plant performance in prairie conditions was reached through several distinct combinations of traits, such as high metabolic gain paired with low resource storage, or short branch spacing, rather than through a single optimal strategy.<ref name="researchgate-smaoui" /> Interactive effects between more than half of the tested input parameters were also demonstrated, providing a level of insight into clonal plant growth strategies that the researchers argued would not have been feasible without volunteer computing.<ref name="researchgate-smaoui" />

== Current status ==
Virtual Prairie's BOINC servers stopped issuing new work sometime around mid-2011, shortly after the project's main results were published in ''Ecological Modelling''; a project administrator confirmed on the BOINC message boards in June 2011 that the servers appeared to have gone silent.<ref name="anr-grant" /> The project's original website, vcsc.cs.uh.edu, no longer hosts Virtual Prairie content.<ref name="surly">{{cite web |title=vcsc.cs.uh.edu site scan |url=https://sur.ly/i/vcsc.cs.uh.edu/ |website=Sur.ly |access-date=26 July 2026}}</ref> The BOINC project maintains an entry for Virtual Prairie in its historical list of retired projects.<ref name="boinc-oldprojects">{{cite web |authors=BOINC |title=old_projects.inc |url=https://github.com/BOINC/boinc-site/blob/master/old_projects.inc |website=GitHub |access-date=26 July 2026}}</ref>

== Publications ==
The project produced the following peer-reviewed and conference publications, drawn from the project's archived publications page:<ref name="vip-pubs">{{cite web |title=Virtual Prairie: Publications (archived) |url=https://web.archive.org/web/20130528055610/http://vcsc.cs.uh.edu/virtual-prairie/ |website=Wayback Machine |access-date=26 July 2026}}</ref>

; Using BOINC-computed data
* Cendrine Mony, Marc Garbey, Malek Smaoui, Marie-Lise Benot. "Large scale parameter study of an individual-based model of clonal plant with volunteer computing." ''Ecological Modelling'', vol. 222, no. 4, 2011, pp. 935–946. {{doi|10.1016/j.ecolmodel.2010.10.014}}<ref name="ecolmodel2011" />
* Malek Smaoui, Marc Garbey. "Parallel Genetic Algorithm Implementation for BOINC." ''Parallel Computing: From Multicores and GPU's to Petascale'', vol. 19, IOS Press, 2010, pp. 212–219 (Proceedings of the International Conference on Parallel Computing, ParCo, 1–4 September 2009, Lyon, France).<ref name="parco2009" />
* Malek Smaoui, Marc Garbey, Cendrine Mony. "Virtual Prairie: Going green with volunteer computing." ''Proceedings of the IEEE Asia-Pacific Services Computing Conference'' (APSCC), 9–12 December 2008, Yilan, Taiwan, pp. 427–434.<ref name="apscc2008">{{cite conference |authors=Malek Smaoui, Marc Garbey, Cendrine Mony |title=Virtual Prairie: Going green with volunteer computing |booktitle=Proceedings of the IEEE Asia-Pacific Services Computing Conference |pages=427–434 |date=2008 |conference=APSCC, 9–12 December 2008, Yilan, Taiwan}}</ref>
* Marc Garbey, Cendrine Mony, Malek Smaoui. "Fluid flow, agent based hybrid model for the simulation of virtual prairies." ''Lecture Notes in Computational Science and Engineering'', vol. 74, part 10, 2011, pp. 369–376 (Proceedings of the Parallel Computational Fluid Dynamics Conference, ParCFD, 18–22 May 2008, Lyon, France).<ref name="parcfd2008">{{cite conference |authors=Marc Garbey, Cendrine Mony, Malek Smaoui |title=Fluid flow, agent based hybrid model for the simulation of virtual prairies |booktitle=Lecture Notes in Computational Science and Engineering |volume=74 |pages=369–376 |date=2011 |conference=Parallel Computational Fluid Dynamics Conference (ParCFD), 18–22 May 2008, Lyon, France}}</ref>

; Other project-related publications
* Marc Garbey, Malek Smaoui, Waree Rinsurongkawong, Cendrine Mony. "The Virtual Prairie Project." Invited plenary lecture, 2nd International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering, Ajaccio, Corsica, April 2011, Civil-Comp Press.<ref name="civilcomp2011">{{cite conference |authors=Marc Garbey, Malek Smaoui, Waree Rinsurongkawong, Cendrine Mony |title=The Virtual Prairie Project |booktitle=2nd International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering |publisher=Civil-Comp Press |date=April 2011 |conference=Ajaccio, Corsica}}</ref>
* Cendrine Mony, Marc Garbey. "Updates on the Virtual Prairie Project." 5th Pan-Galactic BOINC Workshop, 22–23 October 2009, Barcelona, Spain.<ref name="workshop2009">{{cite conference |authors=Cendrine Mony, Marc Garbey |title=Updates on the Virtual Prairie Project |conference=5th Pan-Galactic BOINC Workshop, 22–23 October 2009, Barcelona, Spain}}</ref>
* Marc Garbey. "Virtual Prairies with BOINC." 4th Pan-Galactic BOINC Workshop, 11–12 September 2008, INRIA, Grenoble, France.<ref name="workshop2008">{{cite conference |authors=Marc Garbey |title=Virtual Prairies with BOINC |conference=4th Pan-Galactic BOINC Workshop, 11–12 September 2008, INRIA, Grenoble, France}}</ref>
* Cendrine Mony, Marc Garbey, Malek Smaoui. "Using modelling to understand clonal strategies in optimal growing conditions." 51st Annual Symposium of the International Association for Vegetation Science, 7–12 September 2008, South Africa.<ref name="iavs2008">{{cite conference |authors=Cendrine Mony, Marc Garbey, Malek Smaoui |title=Using modelling to understand clonal strategies in optimal growing conditions |conference=51st Annual Symposium of the International Association for Vegetation Science, 7–12 September 2008, South Africa}}</ref>

Archived copies of several of these papers and a related workshop video are held via the Wayback Machine on the project's former publications page.<ref name="vip-pubs" />

== See also ==
* [[BOINC]]

== External links ==
* {{URL|http://vcsc.cs.uh.edu/virtual-prairie/|Virtual Prairie project website (defunct)}}
* {{URL|https://web.archive.org/web/20130528055610/http://vcsc.cs.uh.edu/virtual-prairie/|Archived Virtual Prairie website}}

== References ==
{{Reflist}}

[[Category:Completed BOINC projects]]
[[Category:Ecology]]
[[Category:Volunteer computing]]

Kryptos@Home

Al Piskun — Sun, 26 Jul 2026 12:03:14 GMT

← Older revision		Revision as of 12:03, 26 July 2026
Line 35:		Line 35:
	}}		}}

	'''Kryptos@Home''' was a [[BOINC]] [[wikipedia:Volunteer computing\|volunteer computing]] project that applied [[wikipedia:Genetic algorithm\|genetic algorithms]] to the search for [[wikipedia:Hill cipher\|Hill cipher]] keys, in an attempt to decrypt the unsolved fourth passage, known as K4, of the [[wikipedia:Kryptos\|Kryptos]] sculpture at the grounds of the [[wikipedia:Central Intelligence Agency\|Central Intelligence Agency]] (CIA) headquarters in Langley, Virginia.<ref name="kh-launch">{{Cite web \|title=Project launch \|url=https://web.archive.org/web/20210517151345/https://www.kryptosathome.com/forum_thread.php?id=1 \|website=Kryptos@Home Wayback Archive \|date=January 8, 2021 \|access-date=July 26, 2026}}</ref> It was launched in January 2021, and it operated for approximately eight months before its servers went offline and the project was abandoned by its volunteer developer.<ref name="boincstats-dead">{{Cite web \|title=Kryptos@Home Dead? \|url=https://www.boincstats.com/forum/10/12718,1 \|website=BOINCstats/BAM! Forum \|access-date=July 26, 2026}}</ref>		'''[https://web.archive.org/web/20210125080541/https://www.kryptosathome.com/ Kryptos@Home]''' was a [[BOINC]] [[wikipedia:Volunteer computing\|volunteer computing]] project that applied [[wikipedia:Genetic algorithm\|genetic algorithms]] to the search for [[wikipedia:Hill cipher\|Hill cipher]] keys, in an attempt to decrypt the unsolved fourth passage, known as K4, of the [[wikipedia:Kryptos\|Kryptos]] sculpture at the grounds of the [[wikipedia:Central Intelligence Agency\|Central Intelligence Agency]] (CIA) headquarters in Langley, Virginia.<ref name="kh-launch">{{Cite web \|title=Project launch \|url=https://web.archive.org/web/20210517151345/https://www.kryptosathome.com/forum_thread.php?id=1 \|website=Kryptos@Home Wayback Archive \|date=January 8, 2021 \|access-date=July 26, 2026}}</ref> It was launched in January 2021, and it operated for approximately eight months before its servers went offline and the project was abandoned by its volunteer developer.<ref name="boincstats-dead">{{Cite web \|title=Kryptos@Home Dead? \|url=https://www.boincstats.com/forum/10/12718,1 \|website=BOINCstats/BAM! Forum \|access-date=July 26, 2026}}</ref>

	The project never publicly credited a named individual as its developer; community discussion described it as a one-person effort, reportedly run by a university-affiliated volunteer.<ref name="boincstats-dead"/> Kryptos@Home is not to be confused with the unrelated K4 auction and archival discovery that ultimately disclosed the plaintext of the same cipher in 2025, several years after the project's own computations had ceased.<ref name="sciam2025"/>		The project never publicly credited a named individual as its developer; community discussion described it as a one-person effort, reportedly run by a university-affiliated volunteer.<ref name="boincstats-dead"/> Kryptos@Home is not to be confused with the unrelated K4 auction and archival discovery that ultimately disclosed the plaintext of the same cipher in 2025, several years after the project's own computations had ceased.<ref name="sciam2025"/>

	== Background: the Kryptos sculpture ==		== Background: the Kryptos sculpture ==
	[[File:Kryptos sculptor.jpg\|thumb~~\|right~~\|The S-shaped copper screen bearing the Kryptos ciphertexts, in the courtyard of the CIA's George Bush Center for Intelligence]]		[[File:Kryptos sculptor.jpg\|thumb\|The S-shaped copper screen bearing the Kryptos ciphertexts, in the courtyard of the CIA's George Bush Center for Intelligence\|326x326px]]
	Kryptos is a sculpture by American artist [[wikipedia:Jim Sanborn\|Jim Sanborn]], dedicated on November 3, 1990, on the grounds of CIA headquarters at the main entrance to the New Headquarters Building and in the courtyard between that building and the Original Headquarters Building cafeteria.<ref name="kryptos-home">{{Cite web \|title=Kryptos@Home – Project Overview \|url=https://web.archive.org/web/20210125080541/https://www.kryptosathome.com/ \|website=Kryptos@Home \|archive-url=https://web.archive.org/web/20210125080541/https://www.kryptosathome.com/ \|archive-date=January 25, 2021 \|url-status=dead \|access-date=July 26, 2026}}</ref> The centerpiece is a large, vertical S-shaped copper screen bearing four separate encrypted passages, referred to as K1, K2, K3, and K4.<ref name="kryptos-home"/> Sanborn worked for four months with Ed Scheidt, then the retired chairman of the CIA's Office of Communications, to devise the encryption schemes used in the piece.<ref name="kryptos-home"/> The sculpture's name derives from the ancient Greek word for "hidden," and its overall theme is intelligence gathering.<ref name="kryptos-home"/> The design and installation, commissioned through the GSA Art-in-Architecture program, cost $250,000 in 1988 dollars.<ref name="kryptos-home"/>		Kryptos is a sculpture by American artist [[wikipedia:Jim Sanborn\|Jim Sanborn]], dedicated on November 3, 1990, on the grounds of CIA headquarters at the main entrance to the New Headquarters Building and in the courtyard between that building and the Original Headquarters Building cafeteria.<ref name="kryptos-home">{{Cite web \|title=Kryptos@Home – Project Overview \|url=https://web.archive.org/web/20210125080541/https://www.kryptosathome.com/ \|website=Kryptos@Home \|archive-url=https://web.archive.org/web/20210125080541/https://www.kryptosathome.com/ \|archive-date=January 25, 2021 \|url-status=dead \|access-date=July 26, 2026}}</ref> The centerpiece is a large, vertical S-shaped copper screen bearing four separate encrypted passages, referred to as K1, K2, K3, and K4.<ref name="kryptos-home"/> Sanborn worked for four months with Ed Scheidt, then the retired chairman of the CIA's Office of Communications, to devise the encryption schemes used in the piece.<ref name="kryptos-home"/> The sculpture's name derives from the ancient Greek word for "hidden," and its overall theme is intelligence gathering.<ref name="kryptos-home"/> The design and installation, commissioned through the GSA Art-in-Architecture program, cost $250,000 in 1988 dollars.<ref name="kryptos-home"/>

Line 62:		Line 62:

	== Software and applications ==		== Software and applications ==
	~~[[File:Kryptos01 1, background removed.png\|thumb\|right\|The encrypted copper screen of the Kryptos sculpture, isolated from its background]]~~
	The project distributed its computational application, referred to in configuration files by the internal name <code>kryptos-plato</code>, as an [[wikipedia:VM (BOINC)\|Oracle VM VirtualBox]]-based virtual machine application rather than a native executable, running under the BOINC Virtualbox wrapper.<ref name="tsbt-thread"/> Work was available for 64-bit Windows (AMD64/Intel EM64T), 64-bit Linux (AMD64/Intel EM64T), and 64-bit Intel-based macOS 10.5 or later; no GPU-accelerated application was offered.<ref name="amdusers"/> The project's own documentation indicated that a native (non-virtualized) application was planned for at least the Windows platform, though it is not confirmed whether such a native client was ever released before the project went offline.<ref name="tsbt-thread"/>		The project distributed its computational application, referred to in configuration files by the internal name <code>kryptos-plato</code>, as an [[wikipedia:VM (BOINC)\|Oracle VM VirtualBox]]-based virtual machine application rather than a native executable, running under the BOINC Virtualbox wrapper.<ref name="tsbt-thread"/> Work was available for 64-bit Windows (AMD64/Intel EM64T), 64-bit Linux (AMD64/Intel EM64T), and 64-bit Intel-based macOS 10.5 or later; no GPU-accelerated application was offered.<ref name="amdusers"/> The project's own documentation indicated that a native (non-virtualized) application was planned for at least the Windows platform, though it is not confirmed whether such a native client was ever released before the project went offline.<ref name="tsbt-thread"/>

Kryptos@Home

Al Piskun — Sun, 26 Jul 2026 11:59:30 GMT

first light

New page

{{Infobox software
| name = Kryptos@Home
| logo = Kryptos-logo.jpg
| logo caption = Kryptos@Home logo
| screenshot =
| caption =
| description = Kryptos@Home was a short-lived BOINC volunteer computing project that used genetic algorithms to search Hill cipher key space in an attempt to decrypt K4, the unsolved fourth passage of the Kryptos sculpture at CIA headquarters.
| status = Discontinued
| category = Cryptography
| compute = CPU
| dependencies = Oracle VM VirtualBox
| developer =
| author =
| sponsor =
| maintainer =
| released = {{Start date and age|2021|01|12}}
| completed = No
| discontinued = c. September 2021
| repository =
| programming language =
| operating system = Windows, Linux, macOS (64-bit only)
| size =
| stats as of = {{Start date and age|2021|05|17}}
| average performance = 648.87 GigaFLOPS
| active users = 123
| total users = 201
| active hosts = 285
| total hosts = 582
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|https://www.kryptosathome.com/}}
| license =
}}

'''Kryptos@Home''' was a [[BOINC]] [[wikipedia:Volunteer computing|volunteer computing]] project that applied [[wikipedia:Genetic algorithm|genetic algorithms]] to the search for [[wikipedia:Hill cipher|Hill cipher]] keys, in an attempt to decrypt the unsolved fourth passage, known as K4, of the [[wikipedia:Kryptos|Kryptos]] sculpture at the grounds of the [[wikipedia:Central Intelligence Agency|Central Intelligence Agency]] (CIA) headquarters in Langley, Virginia.<ref name="kh-launch">{{Cite web |title=Project launch |url=https://web.archive.org/web/20210517151345/https://www.kryptosathome.com/forum_thread.php?id=1 |website=Kryptos@Home Wayback Archive |date=January 8, 2021 |access-date=July 26, 2026}}</ref> It was launched in January 2021, and it operated for approximately eight months before its servers went offline and the project was abandoned by its volunteer developer.<ref name="boincstats-dead">{{Cite web |title=Kryptos@Home Dead? |url=https://www.boincstats.com/forum/10/12718,1 |website=BOINCstats/BAM! Forum |access-date=July 26, 2026}}</ref>

The project never publicly credited a named individual as its developer; community discussion described it as a one-person effort, reportedly run by a university-affiliated volunteer.<ref name="boincstats-dead"/> Kryptos@Home is not to be confused with the unrelated K4 auction and archival discovery that ultimately disclosed the plaintext of the same cipher in 2025, several years after the project's own computations had ceased.<ref name="sciam2025"/>

== Background: the Kryptos sculpture ==
[[File:Kryptos sculptor.jpg|thumb|right|The S-shaped copper screen bearing the Kryptos ciphertexts, in the courtyard of the CIA's George Bush Center for Intelligence]]
Kryptos is a sculpture by American artist [[wikipedia:Jim Sanborn|Jim Sanborn]], dedicated on November 3, 1990, on the grounds of CIA headquarters at the main entrance to the New Headquarters Building and in the courtyard between that building and the Original Headquarters Building cafeteria.<ref name="kryptos-home">{{Cite web |title=Kryptos@Home – Project Overview |url=https://web.archive.org/web/20210125080541/https://www.kryptosathome.com/ |website=Kryptos@Home |archive-url=https://web.archive.org/web/20210125080541/https://www.kryptosathome.com/ |archive-date=January 25, 2021 |url-status=dead |access-date=July 26, 2026}}</ref> The centerpiece is a large, vertical S-shaped copper screen bearing four separate encrypted passages, referred to as K1, K2, K3, and K4.<ref name="kryptos-home"/> Sanborn worked for four months with Ed Scheidt, then the retired chairman of the CIA's Office of Communications, to devise the encryption schemes used in the piece.<ref name="kryptos-home"/> The sculpture's name derives from the ancient Greek word for "hidden," and its overall theme is intelligence gathering.<ref name="kryptos-home"/> The design and installation, commissioned through the GSA Art-in-Architecture program, cost $250,000 in 1988 dollars.<ref name="kryptos-home"/>

K1, K2, and K3 were solved by cryptanalysts within a few years of the sculpture's dedication, but K4, a 97-character passage beginning with the letters "OBKR," resisted every public cryptanalytic attempt for more than three decades and became one of the best-known unsolved ciphers in the world.<ref name="wp-kryptos">{{Cite web |title=Kryptos |url=https://en.wikipedia.org/wiki/Kryptos |website=Wikipedia |access-date=July 26, 2026}}</ref> Sanborn has stated that solving K4 does not require physical access to the sculpture, which is located on CIA property that is off-limits to the public.<ref name="kryptos-home"/> In addition to the main screen, the installation includes a related Morse code message and a compass rose pointing to a lodestone, along with an adjacent reflecting pool; these elements have long been the subject of speculation about hidden clues, though no solution to K1 through K3 was found to depend on them.<ref name="kryptos-home"/>

== History ==
The projects first post announced the launch of Kryptos@Home on January 8, 2021.<ref name="kh-launch"/> At launch, the project was explicitly labeled as being in a beta-testing stage, and the announcement noted that upload errors were occurring during the initial rollout.<ref name="bs-launch">{{Cite web |title=Project launch |url=https://boincsynergy.ca/blog/kryptoshome/ |website=BOINC Synergy |date=January 12, 2021 |access-date=July 26, 2026}}</ref> For security reasons, new accounts could only be created through the project website rather than directly through the BOINC client.<ref name="bs-launch"/> The project maintained a Twitter account (@kryptosathome) and, shortly after launch, added a public Trello board so that participants could track reported issues, requested features, and ongoing development work.<ref name="tsbt-trello">{{Cite web |title=Kryptos@home Trello board added |url=https://tsbt.co.uk/forum/viewtopic.php?t=29343 |website=The Scottish Boinc Team Forum |access-date=July 26, 2026}}</ref>

The project attracted attention from volunteer computing communities within days of launch, including teams such as [[wikipedia:AMD|AMD]] Users and The Scottish Boinc Team, whose members reported early experiences running its work units.<ref name="amdusers">{{Cite web |title=New Project: Kryptos@Home |url=http://www.amdusers.com/forum/showthread.php/11910-New-Project-Kryptos-Home |website=AMDusers Forum |access-date=July 26, 2026}}</ref><ref name="tsbt-thread">{{Cite web |title=Kryptos@Home |url=https://tsbt.co.uk/forum/viewtopic.php?t=28643 |website=The Scottish Boinc Team Forum |access-date=July 26, 2026}}</ref> Multiple contemporaneous forum reports flagged frequent [[wikipedia:VirtualBox|VirtualBox]] hypervisor instability under the project's virtual-machine application, with some volunteers finding that rolling back to an older VirtualBox release (5.2.x) reduced work unit failure rates compared to the then-current 6.1.x branch.<ref name="tsbt-thread"/>

== Computational approach ==
Kryptos@Home's stated research goal was to use genetic algorithms to search for [[wikipedia:Hill cipher|Hill cipher]] keys capable of producing a meaningful decryption of K4.<ref name="tsbt-thread"/> The Hill cipher encrypts a block of plaintext letters, represented as a vector <math>P</math>, by multiplying it against a square key matrix <math>K</math> modulo 26:

<math>C \equiv K P \pmod{26}</math>

Decryption requires the modular inverse of the key matrix:

<math>P \equiv K^{-1} C \pmod{26}</math>

which exists only when <math>K</math> is invertible modulo 26, that is, when <math>\gcd(\det K,\ 26) = 1</math>. Kryptos@Home's applications searched the space of invertible candidate matrices for keys that, when applied to K4, matched a set of cryptographic cribs, fragments of suspected plaintext that Sanborn himself had released to the Kryptos-solving community, while also producing plausible decryptions across the rest of the passage.<ref name="tsbt-thread"/> This distinguished the project's approach from simple brute-force keyspace enumeration, since a genetic algorithm's fitness function could be tuned against partial crib matches to guide the search toward more promising candidate keys.<ref name="tsbt-thread"/>

== Software and applications ==
[[File:Kryptos01 1, background removed.png|thumb|right|The encrypted copper screen of the Kryptos sculpture, isolated from its background]]
The project distributed its computational application, referred to in configuration files by the internal name <code>kryptos-plato</code>, as an [[wikipedia:VM (BOINC)|Oracle VM VirtualBox]]-based virtual machine application rather than a native executable, running under the BOINC Virtualbox wrapper.<ref name="tsbt-thread"/> Work was available for 64-bit Windows (AMD64/Intel EM64T), 64-bit Linux (AMD64/Intel EM64T), and 64-bit Intel-based macOS 10.5 or later; no GPU-accelerated application was offered.<ref name="amdusers"/> The project's own documentation indicated that a native (non-virtualized) application was planned for at least the Windows platform, though it is not confirmed whether such a native client was ever released before the project went offline.<ref name="tsbt-thread"/>

Volunteers could tune concurrency through a standard BOINC <code>app_config.xml</code> entry limiting the number of concurrent <code>kryptos-plato</code> tasks per host, a workaround commonly used to manage the resource demands of the VirtualBox-based application.<ref name="tsbt-thread"/>

== Decline and discontinuation ==
Kryptos@Home's public presence began to lapse in mid-2021. By early October 2021, participants on the BOINCstats/BAM! forums noted that the project's last confirmed server contact had been on July 1, 2021, and that its website had subsequently become unreachable, with its TLS certificate misconfigured to present a certificate for an unrelated domain.<ref name="boincstats-dead"/> Community speculation attributed the outage variously to the developer's academic obligations and to the project being a one-person operation without backup maintainers, though no official explanation was ever published.<ref name="boincstats-dead"/> Forum participants ultimately recommended that the project be treated as discontinued and removed from BOINC project-tracking tools after its website remained unreachable for an extended period with no further communication from its developer.<ref name="boincstats-dead"/>

No official statistics archive, final work unit counts, or closure announcement from the Kryptos@Home team is known to survive; the project's disappearance was documented primarily through third-party community forums rather than through any statement from BOINC Synergy or the project's developer.<ref name="boincstats-dead"/>

== K4's eventual disclosure ==
K4 remained unsolved by any public cryptanalytic method, including efforts such as Kryptos@Home's, for the following several years. In 2025, journalists Jarett Kobek and Richard Byrne reported that they had located the plaintext of K4 among archival material related to Sanborn held by the [[wikipedia:Smithsonian Institution|Smithsonian Institution]], rather than through cryptanalysis of the ciphertext itself.<ref name="sciam2025">{{Cite web |title=A Solution to the CIA's Kryptos Code Is Found after 35 Years |url=https://www.scientificamerican.com/article/a-solution-to-the-cias-kryptos-code-is-found-after-35-years/ |website=Scientific American |date=2025 |access-date=July 26, 2026}}</ref> Some members of the Kryptos-solving community disputed whether an archival discovery of this kind constituted a genuine "solution" in the cryptanalytic sense, since it did not involve deriving the plaintext from the ciphertext and key alone.<ref name="sciam2025"/> Later in 2025, Sanborn, citing health concerns, put the original K4 solution materials up for public auction through RR Auction, with the intent of naming a new designated keeper of the sculpture's secret.<ref name="aol-auction">{{Cite web |title=Solution goes on auction for CIA HQ's 'Kryptos' sculpture that has stumped code breakers for decades |url=https://www.aol.com/solution-goes-auction-cia-hqs-050030992.html |website=Associated Press via AOL |date=2025 |access-date=July 26, 2026}}</ref> These developments occurred well after Kryptos@Home's own computations had ceased, and there is no indication that the project's search results contributed to, or anticipated, the archival plaintext later reported.

== See also ==
* [[BOINC]]
* [[Enigma@Home]]

== References ==
{{Reflist}}

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:Cryptography]]

File:Kryptos-logo.jpg

Al Piskun — Sun, 26 Jul 2026 11:10:38 GMT

Al Piskun uploaded File:Kryptos-logo.jpg Kryptos@Home logo

New page

== Summary ==
Kryptos@Home logo

BOINC projects

Al Piskun — Sat, 25 Jul 2026 11:23:03 GMT

add Taiwan Desktop Grid and eOn See more...

← Older revision		Revision as of 11:23, 25 July 2026
Line 2,353:		Line 2,353:
	\|		\|
	\|		\|
	\| ~~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~~.		\| Simulate long timescale evolution of atomic scale systems in chemistry and materials science. [[EOn\|See more...]]

	\|-		\|-
Line 3,329:		Line 3,329:
	\|		\|
	\|		\|
	\| ~~Support the drug discovery, earthquake simulation and climate change applications developing in Asia and also~~ to ~~support the applications developed by IDGF~~.		\| Bridging Taiwanese volunteer computers to European e-Science service grid infrastructure. [[Taiwan Desktop Grid\|See more...]]

	\|-		\|-

Main Page

Al Piskun — Sat, 25 Jul 2026 10:48:12 GMT

← Older revision		Revision as of 10:48, 25 July 2026
(One intermediate revision by the same user not shown)
Line 27:		Line 27:
	</div>		</div>
	<div class="bs-stat bs-stat-purple">		<div class="bs-stat bs-stat-purple">
	<div class="bs-stat-number">87</div>		<div class="bs-stat-number">89</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 253:		Line 253:
	\|-		\|-
	\|* [[Docking@Home]] CHARMM-based protein-ligand docking simulations to search for new pharmaceutical drugs		\|* [[Docking@Home]] CHARMM-based protein-ligand docking simulations to search for new pharmaceutical drugs
			\|
			\|-
			\|* [[eOn]] simulate long timescale evolution of atomic scale systems in chemistry and materials science
	\|* [[Enigma@Home]] break unsolved German Kriegsmarine Enigma M4 radio messages from the Second World War		\|* [[Enigma@Home]] break unsolved German Kriegsmarine Enigma M4 radio messages from the Second World War
	\|-		\|-
Line 292:		Line 295:
	\|-		\|-
	\|* [[SPT]] Symmetric Prime Tuples		\|* [[SPT]] Symmetric Prime Tuples
	\|		\|* [[Taiwan Desktop Grid]] bridging Taiwanese volunteer computers to European e-Science service grid infrastructure
	\|-		\|-
	\|* [[TANPAKU]] used a Brownian dynamics method to study protein folding		\|* [[TANPAKU]] used a Brownian dynamics method to study protein folding

EOn

Al Piskun — Sat, 25 Jul 2026 10:22:59 GMT

← Older revision		Revision as of 10:22, 25 July 2026
Line 31:		Line 31:
	\| gpu performance =		\| gpu performance =
	\| cpu performance =		\| cpu performance =
	\| website = {{URL\|~~https://web.archive.org/~~http://eon.ices.utexas.edu/eon2/}}		\| website = {{URL\|http://eon.ices.utexas.edu/eon2/}}
	\| license = GPL-3.0		\| license = GPL-3.0
	}}		}}
Line 37:		Line 37:
	{{Lowercase title}}		{{Lowercase title}}

	'''eOn''' (styled '''eOn2''' during its time on the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|BOINC]] platform) was a completed [[wikipedia:volunteer computing\|volunteer computing]] project of the Henkelman Research Group at the [[wikipedia:University of Texas at Austin\|University of Texas at Austin]], run out of the university's [[wikipedia:Institute for Computational Engineering and Sciences\|Institute for Computational Engineering and Sciences]] (ICES).<ref name="wiki-eon">Chill, Samuel T., Matthew Welborn, Rye Terrell, Liang Zhang, Jean-Claude Berthet, Andreas Pedersen, Hannes Jónsson, Graeme Henkelman. [https://iopscience.iop.org/article/10.1088/0965-0393/22/5/055002 EON: software for long time simulations of atomic scale systems]. ''Modelling and Simulation in Materials Science and Engineering'' 22(5), 055002 (2014). {{DOI\|10.1088/0965-0393/22/5/055002}}.</ref> The project applied [[wikipedia:theoretical chemistry\|theoretical chemistry]] methods, chiefly [[wikipedia:transition state theory\|transition state theory]] combined with [[wikipedia:kinetic Monte Carlo\|kinetic Monte Carlo]], to model the evolution of atomic scale systems over timescales far longer than those reachable with conventional [[wikipedia:molecular dynamics\|molecular dynamics]]. Its name is drawn from ''[[wikipedia:aeon\|eon]]'', a reference to the immeasurably long timescales the software was built to reach.<ref name="bcteam">[https://www.bc-team.org/viewtopic.php?t=595 eOn]. BOINC Confederation forum. Posted 1 September 2010.</ref>		'''[https://web.archive.org/http://eon.ices.utexas.edu/eon2/ eOn]''' (styled '''eOn2''' during its time on the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|BOINC]] platform) was a completed [[wikipedia:volunteer computing\|volunteer computing]] project of the Henkelman Research Group at the [[wikipedia:University of Texas at Austin\|University of Texas at Austin]], run out of the university's [[wikipedia:Institute for Computational Engineering and Sciences\|Institute for Computational Engineering and Sciences]] (ICES).<ref name="wiki-eon">Chill, Samuel T., Matthew Welborn, Rye Terrell, Liang Zhang, Jean-Claude Berthet, Andreas Pedersen, Hannes Jónsson, Graeme Henkelman. [https://iopscience.iop.org/article/10.1088/0965-0393/22/5/055002 EON: software for long time simulations of atomic scale systems]. ''Modelling and Simulation in Materials Science and Engineering'' 22(5), 055002 (2014). {{DOI\|10.1088/0965-0393/22/5/055002}}.</ref> The project applied [[wikipedia:theoretical chemistry\|theoretical chemistry]] methods, chiefly [[wikipedia:transition state theory\|transition state theory]] combined with [[wikipedia:kinetic Monte Carlo\|kinetic Monte Carlo]], to model the evolution of atomic scale systems over timescales far longer than those reachable with conventional [[wikipedia:molecular dynamics\|molecular dynamics]]. Its name is drawn from ''[[wikipedia:aeon\|eon]]'', a reference to the immeasurably long timescales the software was built to reach.<ref name="bcteam">[https://www.bc-team.org/viewtopic.php?t=595 eOn]. BOINC Confederation forum. Posted 1 September 2010.</ref>

	eOn joined the BOINC network in September 2010 and ran until it was retired in May 2014. The underlying EON research code, distinct from the retired volunteer computing project, continues to be developed and used within the [[wikipedia:computational chemistry\|computational chemistry]] community.		eOn joined the BOINC network in September 2010 and ran until it was retired in May 2014. The underlying EON research code, distinct from the retired volunteer computing project, continues to be developed and used within the [[wikipedia:computational chemistry\|computational chemistry]] community.
Line 51:		Line 51:
	Early participants reported a bumpy rollout, including client crashes on Mac OS X and complaints about long-running, unchecked work units, alongside genuine enthusiasm from teams that had followed the Henkelman group's earlier, non-BOINC eOn effort.<ref name="boinc-launch" /><ref name="eonclient400">eOn Client 4.00. UT theoretical chemistry code forum. Posted February 2012.</ref>		Early participants reported a bumpy rollout, including client crashes on Mac OS X and complaints about long-running, unchecked work units, alongside genuine enthusiasm from teams that had followed the Henkelman group's earlier, non-BOINC eOn effort.<ref name="boinc-launch" /><ref name="eonclient400">eOn Client 4.00. UT theoretical chemistry code forum. Posted February 2012.</ref>

	[[File:UT Tower, University of Texas in Austin.jpg\|thumb\|The University of Texas at Austin, home to the Institute for Computational Engineering and Sciences, where eOn was developed and hosted.]]		[[File:UT Tower, University of Texas in Austin.jpg\|thumb\|The University of Texas at Austin, home to the Institute for Computational Engineering and Sciences, where eOn was developed and hosted.\|658x658px]]

	== Scientific method ==		== Scientific method ==
Line 67:		Line 67:

	The dimer is rotated to align with this minimum mode and then walked uphill along it until it converges on a saddle point.<ref name="dimer1999" /> Besides aKMC, the EON software also implemented [[wikipedia:parallel replica dynamics\|parallel replica dynamics]], [[wikipedia:hyperdynamics\|hyperdynamics]], and global optimization methods including [[wikipedia:simulated annealing\|simulated annealing]], [[wikipedia:basin hopping\|basin hopping]], and minima hopping.<ref name="wiki-eon" />		The dimer is rotated to align with this minimum mode and then walked uphill along it until it converges on a saddle point.<ref name="dimer1999" /> Besides aKMC, the EON software also implemented [[wikipedia:parallel replica dynamics\|parallel replica dynamics]], [[wikipedia:hyperdynamics\|hyperdynamics]], and global optimization methods including [[wikipedia:simulated annealing\|simulated annealing]], [[wikipedia:basin hopping\|basin hopping]], and minima hopping.<ref name="wiki-eon" />

	[[File:Potential Energy Surface and Corresponding Reaction Coordinate Diagram.png\|thumb\|A potential energy surface with a saddle point separating two minima, the kind of feature EON's dimer method searches for.]]

	== Software architecture ==		== Software architecture ==
	EON used a client/server design: computationally intensive force and energy evaluations ran on volunteer client machines, while a central server managed the overall state-to-state evolution of the simulation, for example driving the kinetic Monte Carlo bookkeeping in aKMC runs. The server was written in [[wikipedia:Python (programming language)\|Python]] and the client in [[wikipedia:C++\|C++]], the latter chosen so that a self-contained compiled executable could be distributed easily to volunteers.<ref name="wiki-eon" /> Beyond BOINC, the same codebase could also run on a single workstation, on cluster queuing systems, and on large parallel machines via [[wikipedia:Message Passing Interface\|MPI]].<ref name="ltd-docs" /> The code was released under version 3 of the [[wikipedia:GNU General Public License\|GNU General Public License]].<ref name="wiki-eon" />		[[File:Potential Energy Surface and Corresponding Reaction Coordinate Diagram.png\|thumb\|A potential energy surface with a saddle point separating two minima, the kind of feature EON's dimer method searches for.\|left\|344x344px]]EON used a client/server design: computationally intensive force and energy evaluations ran on volunteer client machines, while a central server managed the overall state-to-state evolution of the simulation, for example driving the kinetic Monte Carlo bookkeeping in aKMC runs. The server was written in [[wikipedia:Python (programming language)\|Python]] and the client in [[wikipedia:C++\|C++]], the latter chosen so that a self-contained compiled executable could be distributed easily to volunteers.<ref name="wiki-eon" /> Beyond BOINC, the same codebase could also run on a single workstation, on cluster queuing systems, and on large parallel machines via [[wikipedia:Message Passing Interface\|MPI]].<ref name="ltd-docs" /> The code was released under version 3 of the [[wikipedia:GNU General Public License\|GNU General Public License]].<ref name="wiki-eon" />

	== Discontinuation ==		== Discontinuation ==
Line 80:		Line 78:

	== Publications ==		== Publications ==
	The Berkeley BOINC project maintains a list of [https://boinc.berkeley.edu/pubs.php#EOn publications with results arising from BOINC-based computing], including work that made use of the eOn volunteer computing project:<ref name="pubs-boinc">Publications by BOINC Projects. boinc.berkeley.edu/pubs.php. Maintained by Alex Piskun.</ref>		[[File:TiltAndTwistBoundaries remade.JPG\|thumb\|Illustration of tilt and twist grain boundaries, the kind of defect studied in the 2009 EON simulation of a copper grain boundary.\|439x439px]]The Berkeley BOINC project maintains a list of [https://boinc.berkeley.edu/pubs.php#EOn publications with results arising from BOINC-based computing], including work that made use of the eOn volunteer computing project:<ref name="pubs-boinc">Publications by BOINC Projects. boinc.berkeley.edu/pubs.php. Maintained by Alex Piskun.</ref>

	# Chill, Samuel T., Matthew Welborn, Rye Terrell, Liang Zhang, Jean-Claude Berthet, Andreas Pedersen, Hannes Jónsson, Graeme Henkelman. [https://iopscience.iop.org/article/10.1088/0965-0393/22/5/055002 EON: software for long time simulations of atomic scale systems]. ''Modelling and Simulation in Materials Science and Engineering'' 22(5), 055002 (2014). {{DOI\|10.1088/0965-0393/22/5/055002}}.		# Chill, Samuel T., Matthew Welborn, Rye Terrell, Liang Zhang, Jean-Claude Berthet, Andreas Pedersen, Hannes Jónsson, Graeme Henkelman. [https://iopscience.iop.org/article/10.1088/0965-0393/22/5/055002 EON: software for long time simulations of atomic scale systems]. ''Modelling and Simulation in Materials Science and Engineering'' 22(5), 055002 (2014). {{DOI\|10.1088/0965-0393/22/5/055002}}.
Line 88:		Line 86:
	# Xu, Lijun, Graeme Henkelman. [http://aip.scitation.org/doi/10.1063/1.2976010 Adaptive kinetic Monte Carlo for first-principles accelerated dynamics]. ''The Journal of Chemical Physics'' (2008). {{DOI\|10.1063/1.2976010}}.		# Xu, Lijun, Graeme Henkelman. [http://aip.scitation.org/doi/10.1063/1.2976010 Adaptive kinetic Monte Carlo for first-principles accelerated dynamics]. ''The Journal of Chemical Physics'' (2008). {{DOI\|10.1063/1.2976010}}.
	# Henkelman, Graeme, Hannes Jónsson. [https://link.aps.org/doi/10.1103/PhysRevLett.90.116101 Multiple Time Scale Simulations of Metal Crystal Growth Reveal the Importance of Multiatom Surface Processes]. ''Physical Review Letters'' (2003). {{DOI\|10.1103/PhysRevLett.90.116101}}.		# Henkelman, Graeme, Hannes Jónsson. [https://link.aps.org/doi/10.1103/PhysRevLett.90.116101 Multiple Time Scale Simulations of Metal Crystal Growth Reveal the Importance of Multiatom Surface Processes]. ''Physical Review Letters'' (2003). {{DOI\|10.1103/PhysRevLett.90.116101}}.

	~~[[File:TiltAndTwistBoundaries remade.JPG\|thumb\|Illustration of tilt and twist grain boundaries, the kind of defect studied in the 2009 EON simulation of a copper grain boundary.]]~~

	No additional eOn-specific publications beyond these six were found in the BOINC publications registry at the time of writing.		No additional eOn-specific publications beyond these six were found in the BOINC publications registry at the time of writing.

EOn

Al Piskun — Sat, 25 Jul 2026 10:17:01 GMT

first light

New page

{{Infobox software
| name = eOn
| logo =
| logo caption =
| screenshot =
| caption =
| description = eOn (also known as eOn2 on BOINC) was a completed volunteer computing project run by the Henkelman Research Group at the University of Texas at Austin. It used adaptive kinetic Monte Carlo and dimer method saddle point searches to simulate the long timescale evolution of atomic scale systems in chemistry and materials science.
| status = Completed
| category = Materials Science
| compute = CPU
| dependencies = None
| developer = Henkelman Research Group, University of Texas at Austin, in collaboration with the Jónsson Research Group, University of Iceland
| author = Graeme Henkelman and Hannes Jónsson
| sponsor = Institute for Computational Engineering and Sciences (ICES), University of Texas at Austin
| maintainer = Discontinued as a BOINC project; the underlying EON software is maintained independently (see [[#Legacy|Legacy]])
| released = {{Start date and age|2010|09|07}}
| completed = Yes
| discontinued = {{Start date and age|2014|05|26}}
| repository = {{URL|https://github.com/TheochemUI/eOn}}
| programming language = C++ (client), Python (server)
| operating system = Windows, Linux, macOS
| size = Not documented
| stats as of =
| average performance =
| active users =
| total users =
| active hosts =
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|https://web.archive.org/http://eon.ices.utexas.edu/eon2/}}
| license = GPL-3.0
}}

{{Lowercase title}}

'''eOn''' (styled '''eOn2''' during its time on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform) was a completed [[wikipedia:volunteer computing|volunteer computing]] project of the Henkelman Research Group at the [[wikipedia:University of Texas at Austin|University of Texas at Austin]], run out of the university's [[wikipedia:Institute for Computational Engineering and Sciences|Institute for Computational Engineering and Sciences]] (ICES).<ref name="wiki-eon">Chill, Samuel T., Matthew Welborn, Rye Terrell, Liang Zhang, Jean-Claude Berthet, Andreas Pedersen, Hannes Jónsson, Graeme Henkelman. [https://iopscience.iop.org/article/10.1088/0965-0393/22/5/055002 EON: software for long time simulations of atomic scale systems]. ''Modelling and Simulation in Materials Science and Engineering'' 22(5), 055002 (2014). {{DOI|10.1088/0965-0393/22/5/055002}}.</ref> The project applied [[wikipedia:theoretical chemistry|theoretical chemistry]] methods, chiefly [[wikipedia:transition state theory|transition state theory]] combined with [[wikipedia:kinetic Monte Carlo|kinetic Monte Carlo]], to model the evolution of atomic scale systems over timescales far longer than those reachable with conventional [[wikipedia:molecular dynamics|molecular dynamics]]. Its name is drawn from ''[[wikipedia:aeon|eon]]'', a reference to the immeasurably long timescales the software was built to reach.<ref name="bcteam">[https://www.bc-team.org/viewtopic.php?t=595 eOn]. BOINC Confederation forum. Posted 1 September 2010.</ref>

eOn joined the BOINC network in September 2010 and ran until it was retired in May 2014. The underlying EON research code, distinct from the retired volunteer computing project, continues to be developed and used within the [[wikipedia:computational chemistry|computational chemistry]] community.

== History ==

=== Origins ===
The EON software grew out of long-running work in the Henkelman group (University of Texas at Austin) and the Jónsson group (then at the University of Iceland) on methods for simulating rare-event dynamics in solids, building on the [[wikipedia:dimer method|dimer method]] the two researchers had developed for locating [[wikipedia:saddle point|saddle points]] on potential energy surfaces without needing a known final state.<ref name="dimer1999">Henkelman, Graeme, Hannes Jónsson. [https://henkelmanlab.org/pubs/henkelman99_7010.pdf A dimer method for finding saddle points on high dimensional potential surfaces using only first derivatives]. ''The Journal of Chemical Physics'' 111(15), 7010 (1999). {{DOI|10.1063/1.480097}}.</ref> Before it was ported to BOINC, the group ran an earlier, home-built distributed computing system under the name eOn; forum members reported that the "old eOn client application" was subsequently rebuilt on BOINC's client/server architecture as eOn2, with the intention of later adding dynamics trajectories and ''[[wikipedia:ab initio quantum chemistry methods|ab initio]]'' ([[wikipedia:density functional theory|density functional theory]]) work units.<ref name="welcome-eon2">Welcome to the world, eOn2. UT theoretical chemistry code forum. Posted September 2010.</ref> For a time two separate project addresses existed, one on the group's older ''cm.utexas.edu'' domain and one on ''ices.utexas.edu''; volunteers were directed to the ICES address as the project's active server.<ref name="two-eon-sites">Two eon web sites. UT theoretical chemistry code forum. Posted 22 November 2011.</ref>

=== Launch on BOINC ===
eOn was announced as a new BOINC project on 7 September 2010 by [[wikipedia:David P. Anderson|David P. Anderson]], describing it as a study of "the dynamic simulation of physical and chemical processes over a time scale which is much longer than can be reached with traditional molecular dynamics."<ref name="boinc-launch">Anderson, David P. New project: eOn. BOINC News forum, message 34564. Posted 7 September 2010.</ref> Because the generation of new work units depended on the results already returned by earlier ones, eOn could typically only keep a handful of tasks in flight on any one host at a time, a workflow characteristic of its [[#Scientific method|adaptive kinetic Monte Carlo]] approach.<ref name="wiki-eon" />

Early participants reported a bumpy rollout, including client crashes on Mac OS X and complaints about long-running, unchecked work units, alongside genuine enthusiasm from teams that had followed the Henkelman group's earlier, non-BOINC eOn effort.<ref name="boinc-launch" /><ref name="eonclient400">eOn Client 4.00. UT theoretical chemistry code forum. Posted February 2012.</ref>

[[File:UT Tower, University of Texas in Austin.jpg|thumb|The University of Texas at Austin, home to the Institute for Computational Engineering and Sciences, where eOn was developed and hosted.]]

== Scientific method ==
eOn's simulations targeted ''rare event'' systems, ones in which the interesting physics, such as [[wikipedia:diffusion|diffusion]] in solids or [[wikipedia:chemical reaction|chemical reactions]] at surfaces, consists of infrequent transitions between long-lived stable states, separated by fast atomic vibrations that are many orders of magnitude quicker than the transitions themselves. A direct [[wikipedia:molecular dynamics|molecular dynamics]] simulation tracking every vibration would need to run for a computationally unreasonable length of time before a single event of interest occurred.<ref name="ltd-docs">EON: Long Timescale Dynamics. Henkelman Research Group documentation. henkelmanlab.org/research/ltd/.</ref>

To get around this, EON combines transition state theory with kinetic Monte Carlo in an approach called adaptive kinetic Monte Carlo (aKMC). Rather than drawing transition rates from a predefined table of possible events, aKMC discovers the available transitions on the fly by searching for first-order saddle points around the current state.<ref name="akmc-docs">Adaptive kinetic Monte Carlo. EON documentation. henkelmanlab.org/eon/akmc.html.</ref> Under the harmonic approximation to transition state theory, the rate of an individual transition takes the Arrhenius-like form

<math>k = \nu \, e^{-\Delta E_a / k_B T}</math>

where <math>\Delta E_a</math> is the energy barrier between the initial minimum and the saddle point, <math>T</math> is the temperature, <math>k_B</math> is the [[wikipedia:Boltzmann constant|Boltzmann constant]], and the prefactor <math>\nu</math> is calculated from the [[wikipedia:normal mode|vibrational modes]] at the minimum and the saddle point.<ref name="akmc-docs" />

Saddle points themselves were located with the dimer method, in which two closely spaced replicas of the system ("the dimer") are used to estimate the direction of lowest curvature on the potential energy surface using only first derivatives of the energy, avoiding the cost of computing a full [[wikipedia:Hessian matrix|Hessian]]:

<math>\mathbf{R}_{1,2} = \mathbf{R}_0 \pm \Delta R\,\hat{N}</math>

The dimer is rotated to align with this minimum mode and then walked uphill along it until it converges on a saddle point.<ref name="dimer1999" /> Besides aKMC, the EON software also implemented [[wikipedia:parallel replica dynamics|parallel replica dynamics]], [[wikipedia:hyperdynamics|hyperdynamics]], and global optimization methods including [[wikipedia:simulated annealing|simulated annealing]], [[wikipedia:basin hopping|basin hopping]], and minima hopping.<ref name="wiki-eon" />

[[File:Potential Energy Surface and Corresponding Reaction Coordinate Diagram.png|thumb|A potential energy surface with a saddle point separating two minima, the kind of feature EON's dimer method searches for.]]

== Software architecture ==
EON used a client/server design: computationally intensive force and energy evaluations ran on volunteer client machines, while a central server managed the overall state-to-state evolution of the simulation, for example driving the kinetic Monte Carlo bookkeeping in aKMC runs. The server was written in [[wikipedia:Python (programming language)|Python]] and the client in [[wikipedia:C++|C++]], the latter chosen so that a self-contained compiled executable could be distributed easily to volunteers.<ref name="wiki-eon" /> Beyond BOINC, the same codebase could also run on a single workstation, on cluster queuing systems, and on large parallel machines via [[wikipedia:Message Passing Interface|MPI]].<ref name="ltd-docs" /> The code was released under version 3 of the [[wikipedia:GNU General Public License|GNU General Public License]].<ref name="wiki-eon" />

== Discontinuation ==
On 26 May 2014, the eOn team posted to the BOINC forums that the project was being retired from the BOINC network.<ref name="discontinuation">Announcement that the eOn project has been discontinued. BOINC Forums, thread 9281. {{Webarchive|url=https://web.archive.org/web/20140714231802/http://boinc.berkeley.edu/dev/forum_thread.php?id=9281|date=14 July 2014}}.</ref> Volunteer forums reported that the eOn server was taken offline shortly afterward, with one community post noting that it had been "retired" with little fanfare and that "the server has been switched off already."<ref name="tsbt-retired">eOn retired. The Scottish BOINC Team forum. May 2014.</ref> A follow-up post from the project team described the decision as a practical one: the project had been useful but had become increasingly cumbersome to maintain relative to the group's other computational resources.<ref name="tsbt-retired" />

== Legacy ==
The retirement of the BOINC-facing eOn2 project did not end development of the underlying EON software. Around 2018, the codebase was relicensed from GPL-3.0 to the [[wikipedia:BSD licenses|BSD 3-Clause license]] so that it could be incorporated into the Amsterdam Modeling Suite, a commercial computational chemistry platform.<ref name="goswami-blog">Goswami, Rohit. [https://rgoswami.me/posts/eon-acad-foss/ Reconciling eOn for Academia and Open Source]. Personal blog. Retrieved 2026.</ref> From 2019 onward, the code was migrated from its original Subversion repository to GitHub, and it continues to be maintained as an open-source research code, including a Gaussian process-accelerated dimer method contributed as part of doctoral work associated with the University of Iceland.<ref name="goswami-blog" /> This ongoing development is separate from the discontinued volunteer computing project and does not distribute work to BOINC volunteers.

== Publications ==
The Berkeley BOINC project maintains a list of [https://boinc.berkeley.edu/pubs.php#EOn publications with results arising from BOINC-based computing], including work that made use of the eOn volunteer computing project:<ref name="pubs-boinc">Publications by BOINC Projects. boinc.berkeley.edu/pubs.php. Maintained by Alex Piskun.</ref>

# Chill, Samuel T., Matthew Welborn, Rye Terrell, Liang Zhang, Jean-Claude Berthet, Andreas Pedersen, Hannes Jónsson, Graeme Henkelman. [https://iopscience.iop.org/article/10.1088/0965-0393/22/5/055002 EON: software for long time simulations of atomic scale systems]. ''Modelling and Simulation in Materials Science and Engineering'' 22(5), 055002 (2014). {{DOI|10.1088/0965-0393/22/5/055002}}.
# Pedersen, Andreas, Graeme Henkelman, Jakob Schiøtz, Hannes Jónsson. [https://iopscience.iop.org/article/10.1088/1367-2630/11/7/073034 Long time scale simulation of a grain boundary in copper]. ''New Journal of Physics'' 11(7), 073034 (2009). {{DOI|10.1088/1367-2630/11/7/073034}}.
# Mei, Donghai, Lijun Xu, Graeme Henkelman. [https://pubs.acs.org/doi/10.1021/jp808211q Potential Energy Surface of Methanol Decomposition on Cu(110)]. ''The Journal of Physical Chemistry C'' (2009). {{DOI|10.1021/jp808211q}}.
# Xu, Lijun, Donghai Mei, Graeme Henkelman. [http://aip.scitation.org/doi/10.1063/1.3281688 Adaptive kinetic Monte Carlo simulation of methanol decomposition on Cu(100)]. ''The Journal of Chemical Physics'' (2009). {{DOI|10.1063/1.3281688}}.
# Xu, Lijun, Graeme Henkelman. [http://aip.scitation.org/doi/10.1063/1.2976010 Adaptive kinetic Monte Carlo for first-principles accelerated dynamics]. ''The Journal of Chemical Physics'' (2008). {{DOI|10.1063/1.2976010}}.
# Henkelman, Graeme, Hannes Jónsson. [https://link.aps.org/doi/10.1103/PhysRevLett.90.116101 Multiple Time Scale Simulations of Metal Crystal Growth Reveal the Importance of Multiatom Surface Processes]. ''Physical Review Letters'' (2003). {{DOI|10.1103/PhysRevLett.90.116101}}.

[[File:TiltAndTwistBoundaries remade.JPG|thumb|Illustration of tilt and twist grain boundaries, the kind of defect studied in the 2009 EON simulation of a copper grain boundary.]]

No additional eOn-specific publications beyond these six were found in the BOINC publications registry at the time of writing.

== See also ==
* [[BOINC projects]]
* [[Einstein@Home]]
* [[The Lattice Project]]

== References ==
{{Reflist}}

== External links ==
* {{URL|https://web.archive.org/http://eon.ices.utexas.edu/eon2/|Archived eOn2 project homepage}}
* {{URL|https://github.com/TheochemUI/eOn|EON software repository (post-BOINC continuation)}}
* {{URL|https://henkelmanlab.org/research/ltd/|Henkelman Research Group: Long Timescale Dynamics}}

[[Category:Completed BOINC projects]]
[[Category:Chemistry]]
[[Category:Materials science]]
[[Category:University of Texas at Austin]]

Taiwan Desktop Grid

Al Piskun — Sat, 25 Jul 2026 09:40:13 GMT

first light

New page

{{Infobox software
| name = Taiwan Desktop Grid
| logo =
| logo caption =
| screenshot =
| caption =
| description = Taiwan Desktop Grid was a completed BOINC-based desktop grid project operated by the Academia Sinica Grid Computing Centre, bridging Taiwanese volunteer computers to European e-Science service grid infrastructure.
| status = Completed
| category = Multiple applications
| compute = CPU
| dependencies =
| developer = Academia Sinica Grid Computing Centre (ASGC)
| author =
| sponsor = [[wikipedia:Academia Sinica|Academia Sinica]]
| maintainer =
| released = {{Start date and age|2010|10|28}}<ref name="launch-note">The exact launch date of Taiwan Desktop Grid is not documented. This date reflects the earliest application installation timestamp recorded on the project's archived application list, the 3D Rendering Application, installed 28 October 2010, used here as the best available proxy for the project becoming operational. {{Cite web |url=http://vbridge.twgrid.org/asgcdg/apps.php |title=Applications | Taiwan Desktop Grid |publisher=Academia Sinica Grid Computing Centre |archive-url=https://web.archive.org/web/20120730171203/http://vbridge.twgrid.org/asgcdg/apps.php |archive-date=30 July 2012 |url-status=dead |access-date=25 July 2026}}</ref>
| completed = No
| discontinued = Between April 2014 and February 2015<ref name="shutdown-note">The project's homepage was still loading normally in a Wayback Machine snapshot dated 23 April 2014, the last confirmed working capture. A later snapshot from around 23 February 2015 shows only a database connection error, indicating the underlying BOINC server had gone offline sometime in the intervening months. {{Cite web |url=https://web.archive.org/web/*/http://vbridge.twgrid.org/asgcdg/ |title=Wayback Machine capture history for vbridge.twgrid.org/asgcdg |publisher=Internet Archive |access-date=25 July 2026}}</ref>
| repository =
| programming language =
| operating system = Windows, Linux, macOS
| size =
| stats as of =
| average performance =
| active users =
| total users =
| active hosts =
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|http://vbridge.twgrid.org/asgcdg/}} (no longer active)
| license =
}}

'''[https://web.archive.org/web/20120825055512/http://vbridge.twgrid.org/asgcdg/ Taiwan Desktop Grid]''' was a [[wikipedia:BOINC|BOINC]]-based [[wikipedia:desktop grid computing|desktop grid]] and volunteer computing project operated by the Academia Sinica Grid Computing Centre (ASGC) in [[wikipedia:Taipei|Taipei]], Taiwan. Rather than developing a single dedicated scientific application of its own, the project functioned as a Taiwanese bridging node in a wider international infrastructure, connecting volunteered Asian and European desktop computers to applications supporting drug discovery, earthquake simulation and climate change research, among others, that had been ported to run across linked desktop and service grids.<ref name="asgcdg-about">{{Cite web |url=http://vbridge.twgrid.org/asgcdg/ |title=Taiwan Desktop Grid |publisher=Academia Sinica Grid Computing Centre |archive-url=https://web.archive.org/web/20120825055512/http://vbridge.twgrid.org/asgcdg/ |archive-date=25 August 2012 |url-status=dead |access-date=25 July 2026}}</ref> Volunteers attached to the project by pointing the BOINC client at the address <code>http://vbridge.twgrid.org/asgcdg/</code>.<ref name="asgcdg-about" /> The project appears to have gone offline sometime between April 2014 and February 2015 and has not since been restored.<ref name="shutdown-note" />

== History ==

=== Background: the Academia Sinica Grid Computing Centre ===
[[File:Academia Sinica.JPG|thumb|The main gate of [[wikipedia:Academia Sinica|Academia Sinica]] in Taipei. Its Grid Computing Centre (ASGC) operated Taiwan Desktop Grid.]]
[[wikipedia:Academia Sinica|Academia Sinica]], Taiwan's national academy, joined the [[wikipedia:Worldwide LHC Computing Grid|Worldwide LHC Computing Grid]] (WLCG) project in 2002. The Academia Sinica Grid Computing Centre (ASGC) was subsequently established to provide grid computing services to scientists from various domains across Asia-Pacific countries.<ref name="asgcdg-about" /> Since 2005, ASGC has operated the only WLCG Tier-1 centre in Asia and has served as the [[wikipedia:Enabling Grids for E-sciencE|Enabling Grids for E-sciencE]] (EGEE) Federation Coordinator, providing service, coordination and support to e-Science applications worldwide.<ref name="asgcdg-about" />

=== Founding and DEGISCO ===
ASGC became a member of the International Desktop Grid Federation (IDGF), an organisation bringing together companies, universities and institutes involved in desktop grid computing, and represented Taiwan in the [[wikipedia:European Union|European Union]]-funded Desktop Grids for International Scientific Collaboration (DEGISCO) project.<ref name="asgcdg-about" /><ref name="idgf-members">{{Cite web |url=http://desktopgridfederation.org/members |title=Members |publisher=International Desktop Grid Federation |access-date=25 July 2026}}</ref> DEGISCO, funded under the EU's Seventh Framework Programme (grant agreement 261561) and coordinated by the Hungarian research institute MTA SZTAKI, ran from 1 June 2010 to 31 May 2012.<ref name="degisco-cordis">{{Cite web |url=https://cordis.europa.eu/project/id/261561/results |title=Desktop Grids for International Scientific Collaboration (DEGISCO) |publisher=European Commission, CORDIS |access-date=25 July 2026}}</ref> Building on the earlier EDGeS project, DEGISCO used what was known as 3G Bridge technology to extend the existing European desktop-grid-to-service-grid infrastructure to International Cooperation Partner Countries, of which Taiwan was one, connecting local desktop grids to European service grids such as EGEE.<ref name="degisco-cordis" /> Taiwan Desktop Grid, run on BOINC server software from the address <code>http://vbridge.twgrid.org/asgcdg/</code>, was ASGC's contribution to this effort.<ref name="asgcdg-about" />

The earliest applications recorded on the project's archived application list, a 3D rendering application and a laser simulation application, were installed on the server on 28 and 29 October 2010 respectively, marking the earliest confirmed activity on the project.<ref name="asgcdg-apps">{{Cite web |url=http://vbridge.twgrid.org/asgcdg/apps.php |title=Applications | Taiwan Desktop Grid |publisher=Academia Sinica Grid Computing Centre |archive-url=https://web.archive.org/web/20120730171203/http://vbridge.twgrid.org/asgcdg/apps.php |archive-date=30 July 2012 |url-status=dead |access-date=25 July 2026}}</ref> Over the following two years, the project accumulated more than a dozen further applications bridged in from the shared EDGeS/DEGISCO application repository, spanning fields including molecular docking, particle physics simulation, materials science and cosmic ray simulation.<ref name="asgcdg-apps" /> The project's own homepage carried news items relating to DEGISCO project meetings, including the ISGC 2012 DEGISCO Workshop, held 27 February to 2 March 2012, and the DEGISCO project's fifth consortium meeting, held 28 to 30 May 2012 in Zaragoza, Spain.<ref name="asgcdg-about" />

=== Discontinuation ===
The project's homepage was still functioning normally in an archived snapshot dated 23 April 2014, the last confirmed working capture of the site. A later snapshot from around 23 February 2015 instead returns only a database connection error, indicating the underlying BOINC server had gone offline sometime in the intervening months.<ref name="shutdown-note" /> No working snapshot of the project has been found after this point, and Taiwan Desktop Grid is treated here as a completed, discontinued BOINC project.

== Purpose ==
Because Taiwan Desktop Grid functioned primarily as a bridging node rather than hosting a single dedicated in-house research application, its research focus was largely defined by whichever applications were routed to it through the shared EDGeS, DEGISCO and IDGF infrastructure. According to the project's own description, this included applications supporting drug discovery, earthquake simulation and climate change research developed in Asia, as well as applications developed more broadly by IDGF members.<ref name="asgcdg-about" />

== Applications ==
The following applications were recorded on Taiwan Desktop Grid's application list as of an archived snapshot dated 25 August 2012. Installation dates refer to when each application version was first made available on the server, not necessarily when it remained actively assigning work; by the project's own account, many of these applications may not have stayed active for long.<ref name="asgcdg-apps" />

{| class="wikitable"
! Application !! Earliest recorded installation !! Supported platforms
|-
| upperCASE || — || —
|-
| Protein Molecule Simulation Application || 12 April 2011 || Linux (x86, x86_64/EM64T)
|-
| 3D Rendering Application || 28 October 2010 || Windows, Linux (x86, x86_64/EM64T)
|-
| Laser Application || 29 October 2010 || Windows, Linux (x86, x86_64/EM64T)
|-
| BinSys || 17 February 2011 || Windows (x86, x86_64/EM64T), Linux (x86), macOS (10.4+ Intel, 10.5+ 64-bit)
|-
| Patient Readmission Application || 21 February 2011 || Windows, Linux (x86)
|-
| Digital Alias-free Signal Processing Application || 17 February 2011 || Windows, Linux (x86, x86_64/EM64T)
|-
| [[SIMAP|SIMAP Utility Application]] || 17 February 2011 || Windows, Linux (x86, x86_64/EM64T)
|-
| UC-Explorer || 17 February 2011 || Windows, Linux (x86), macOS (10.4+ Intel, 10.5+ 64-bit)
|-
| VisIVO Server Application || 17 February 2011 || Windows, Linux (x86, x86_64/EM64T)
|-
| X-Ray Application || 17 February 2011 || Windows, Linux (x86, x86_64/EM64T)
|-
| merlin || 17 February 2011 || Linux (x86)
|-
| E-Marketplace Model Integrated with Logistics DG || 17 February 2011 || Windows, Linux (x86)
|-
| Fusion ITER || 3 May 2011 || Windows, Linux (x86, x86_64/EM64T)
|-
| AutoDock3 on cell worker || 11 April 2011 || Linux (x86, x86_64/EM64T)
|-
| CORSIKA Application || 17 June 2011 || Windows, Linux (x86)
|-
| AutoDock 3 || 18 May 2012 || Windows, Linux (x86, x86_64/EM64T)
|-
| Grid Virtual Screening Service || 20 April 2012 || Windows, Linux (x86, x86_64/EM64T)
|}

Several of these, including the CORSIKA cosmic ray shower simulator, the AutoDock molecular docking tools and Fusion ITER, correspond to standard applications distributed through the EDGeS/DEGISCO shared application repository, and were also bridged to other desktop grids connected to the same European service grid infrastructure rather than being developed specifically for Taiwan Desktop Grid.<ref name="degisco-cordis" />

== See also ==
* [[wikipedia:BOINC|BOINC]]
* [[wikipedia:Desktop grid computing|Desktop grid computing]]
* [[wikipedia:Worldwide LHC Computing Grid|Worldwide LHC Computing Grid]]
* [[LHC@home]]

==References==
{{Reflist}}

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:Grid computing]]
[[Category:2010 establishments in Taiwan]]

Main Page

Al Piskun — Fri, 24 Jul 2026 21:46:40 GMT

← Older revision		Revision as of 21:46, 24 July 2026
Line 27:		Line 27:
	</div>		</div>
	<div class="bs-stat bs-stat-purple">		<div class="bs-stat bs-stat-purple">
	<div class="bs-stat-number">86</div>		<div class="bs-stat-number">87</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>

BOINC projects

Al Piskun — Fri, 24 Jul 2026 21:45:46 GMT

Add BOINC@TACC See more...

← Older revision		Revision as of 21:45, 24 July 2026
Line 4,073:		Line 4,073:
	\| Multiple applications		\| Multiple applications
	\|		\|
	\| Aerospace engineering, computational biology, and earthquake engineering.		\| Aerospace engineering, computational biology, and earthquake engineering. [[BOINC@TACC\|See more...]]

	\|-		\|-

Main Page

Al Piskun — Fri, 24 Jul 2026 21:39:51 GMT

add BOINC@TACC

← Older revision		Revision as of 21:39, 24 July 2026
Line 235:		Line 235:
	\|-		\|-
	\|* [[Big and Ugly Rendering Project]] distributed video rendering		\|* [[Big and Ugly Rendering Project]] distributed video rendering
			\|* [[BOINC@TACC]] routes computing jobs from TACC supercomputers to volunteer devices
			\|-
	\|* [[CAS@home]] hosted by the Chinese Academy of Sciences, best known for running the TreeThreader protein structure		\|* [[CAS@home]] hosted by the Chinese Academy of Sciences, best known for running the TreeThreader protein structure
			\|
	\|-		\|-
	\|* [[Chess960@home]] an effort to build the beginnings of an opening theory for the variant		\|* [[Chess960@home]] an effort to build the beginnings of an opening theory for the variant

BOINC projects

Al Piskun — Fri, 24 Jul 2026 21:34:25 GMT

← Older revision		Revision as of 21:34, 24 July 2026
Line 3,326:		Line 3,326:
	\|		\|
	\|		\|
	\|		\|Academia Sinica Grid Computing
	\|		\|
	\|		\|

BOINC@TACC

Al Piskun — Wed, 22 Jul 2026 14:57:02 GMT

← Older revision		Revision as of 14:57, 22 July 2026
(2 intermediate revisions by the same user not shown)
Line 6:		Line 6:
	\| caption = The University of Texas at Austin, home to the Texas Advanced Computing Center		\| caption = The University of Texas at Austin, home to the Texas Advanced Computing Center
	\| description = BOINC@TACC is a volunteer computing project operated by the Texas Advanced Computing Center at the University of Texas at Austin that routes high-throughput computing jobs from TACC supercomputers to volunteered desktops, laptops, tablets, and cloud virtual machines.		\| description = BOINC@TACC is a volunteer computing project operated by the Texas Advanced Computing Center at the University of Texas at Austin that routes high-throughput computing jobs from TACC supercomputers to volunteered desktops, laptops, tablets, and cloud virtual machines.
	\| status = ~~Complete~~		\| status = Completed
	\| category = Multidisciplinary (aerospace engineering, computational biology, earthquake engineering, bioinformatics)		\| category = Multidisciplinary (aerospace engineering, computational biology, earthquake engineering, bioinformatics)
	\| compute = CPU & GPU		\| compute = CPU & GPU
Line 15:		Line 15:
	\| maintainer = BOINC@TACC project team, Texas Advanced Computing Center		\| maintainer = BOINC@TACC project team, Texas Advanced Computing Center
	\| released = 2017 (as TACC-2-BOINC); renamed BOINC@TACC on {{Start date and age\|2019\|01\|01}}		\| released = 2017 (as TACC-2-BOINC); renamed BOINC@TACC on {{Start date and age\|2019\|01\|01}}
	\| completed = No		\| completed =
	\| discontinued = {{Start date and age\|2022\|07\|11}}		\| discontinued = {{Start date and age\|2022\|07\|11}}
	\| repository = {{URL\|https://github.com/ritua2/BOINCatTACC}}		\| repository = {{URL\|https://github.com/ritua2/BOINCatTACC}}
Line 35:		Line 35:
	}}		}}

	'''BOINC@TACC''' is a [[volunteer computing]] project operated by the [[Texas Advanced Computing Center]] (TACC) at the [[University of Texas at Austin]] that integrates [[BOINC]]-based volunteer computing with supercomputing and cloud computing.<ref>{{Cite web \|authors=Texas Advanced Computing Center \|title=About BOINC@TACC \|url=https://boinc.tacc.utexas.edu/about.php \|work=boinc.tacc.utexas.edu \|access-date=2026-07-22}}</ref> Rather than running scientific applications directly on TACC's supercomputers, the project routes qualified High-Throughput Computing (HTC) jobs from TACC systems such as [[Stampede2]] to computing resources donated by volunteers, including desktops, laptops, tablets, and cloud-based virtual machines.<ref>{{Cite web \|authors=Texas Advanced Computing Center \|title=BOINC@TACC \|url=https://boinc.tacc.utexas.edu/ \|work=boinc.tacc.utexas.edu \|access-date=2026-07-22}}</ref> Launched in 2017, BOINC@TACC was the first use of volunteer computing by a major high-performance computing center.<ref name="hpcwire">{{Cite web \|authors=Iriarte, Mariana \|title=Science Enthusiasts, Researchers, Students Benefit from Volunteer Computing Using BOINC@TACC \|url=https://www.hpcwire.com/off-the-wire/science-enthusiasts-researchers-students-benefit-from-wolunteer-computing-using-boinctacc/ \|work=HPCwire \|date=2019-06-25 \|access-date=2026-07-22}}</ref>		'''[https://web.archive.org/web/20220711171713/https://boinc.tacc.utexas.edu/ BOINC@TACC]''' is a [[volunteer computing]] project operated by the [[Texas Advanced Computing Center]] (TACC) at the [[University of Texas at Austin]] that integrates [[BOINC]]-based volunteer computing with supercomputing and cloud computing.<ref>{{Cite web \|authors=Texas Advanced Computing Center \|title=About BOINC@TACC \|url=https://boinc.tacc.utexas.edu/about.php \|work=boinc.tacc.utexas.edu \|access-date=2026-07-22}}</ref> Rather than running scientific applications directly on TACC's supercomputers, the project routes qualified High-Throughput Computing (HTC) jobs from TACC systems such as [[Stampede2]] to computing resources donated by volunteers, including desktops, laptops, tablets, and cloud-based virtual machines.<ref>{{Cite web \|authors=Texas Advanced Computing Center \|title=BOINC@TACC \|url=https://boinc.tacc.utexas.edu/ \|work=boinc.tacc.utexas.edu \|access-date=2026-07-22}}</ref> Launched in 2017, BOINC@TACC was the first use of volunteer computing by a major high-performance computing center.<ref name="hpcwire">{{Cite web \|authors=Iriarte, Mariana \|title=Science Enthusiasts, Researchers, Students Benefit from Volunteer Computing Using BOINC@TACC \|url=https://www.hpcwire.com/off-the-wire/science-enthusiasts-researchers-students-benefit-from-wolunteer-computing-using-boinctacc/ \|work=HPCwire \|date=2019-06-25 \|access-date=2026-07-22}}</ref>

	== Overview ==		== Overview ==
Line 43:		Line 43:

	== History ==		== History ==
	After several live iterations, the project began operating in 2017 under the name '''TACC-2-BOINC'''.<ref name="github">{{Cite web \|authors=Arora, Ritu \|title=ritua2/BOINCatTACC \|url=https://github.com/ritua2/BOINCatTACC \|work=GitHub \|access-date=2026-07-22}}</ref> To get started, the TACC team deployed an instance of a BOINC server on a cloud computing platform and then developed the software needed to integrate BOINC with TACC's supercomputing and cloud computing platforms.<ref name="hpcwire" /> On ~~July 30~~, ~~2018~~, the project was renamed BOINC@TACC and moved to its current project URL.<ref name="github" /> The project is funded primarily through [[National Science Foundation\|NSF]] award #1664022, with additional support from [[XSEDE]], TACC, and the Science Gateway Community Institute.<ref>{{Cite web \|authors=Arora, Ritu, Carlos Redondo and Gerald Joshua \|title=Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing \|url=http://link.springer.com/10.1007/978-981-13-7729-7_8 \|work=Software Challenges to Exascale Computing \|date=2019 \|access-date=2026-07-22}}</ref> Contributors to the BOINC@TACC codebase have included Carlos Redondo, an aerospace engineering student and developer on the project, along with Thomas Johnson and Anubhaw Nand, with additional input from [[BOINC]] founder [[David P. Anderson\|David Anderson]].<ref>{{Cite web \|authors=Arora, Ritu, Carlos Redondo and Gerald Joshua \|title=Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing \|url=http://link.springer.com/10.1007/978-981-13-7729-7_8 \|work=Software Challenges to Exascale Computing \|date=2019 \|access-date=2026-07-22}}</ref>		After several live iterations, the project began operating in 2017 under the name '''TACC-2-BOINC'''.<ref name="github">{{Cite web \|authors=Arora, Ritu \|title=ritua2/BOINCatTACC \|url=https://github.com/ritua2/BOINCatTACC \|work=GitHub \|access-date=2026-07-22}}</ref> To get started, the TACC team deployed an instance of a BOINC server on a cloud computing platform and then developed the software needed to integrate BOINC with TACC's supercomputing and cloud computing platforms.<ref name="hpcwire" /> On Jan 1, 2019, the project was renamed BOINC@TACC and moved to its current project URL.<ref name="github" /> The project is funded primarily through [[National Science Foundation\|NSF]] award #1664022, with additional support from [[XSEDE]], TACC, and the Science Gateway Community Institute.<ref>{{Cite web \|authors=Arora, Ritu, Carlos Redondo and Gerald Joshua \|title=Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing \|url=http://link.springer.com/10.1007/978-981-13-7729-7_8 \|work=Software Challenges to Exascale Computing \|date=2019 \|access-date=2026-07-22}}</ref> Contributors to the BOINC@TACC codebase have included Carlos Redondo, an aerospace engineering student and developer on the project, along with Thomas Johnson and Anubhaw Nand, with additional input from [[BOINC]] founder [[David P. Anderson\|David Anderson]].<ref>{{Cite web \|authors=Arora, Ritu, Carlos Redondo and Gerald Joshua \|title=Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing \|url=http://link.springer.com/10.1007/978-981-13-7729-7_8 \|work=Software Challenges to Exascale Computing \|date=2019 \|access-date=2026-07-22}}</ref>

	== Software infrastructure ==		== Software infrastructure ==
Line 64:		Line 64:
	Volunteers can join BOINC@TACC either by attaching the standard [[BOINC]] client to the project (requiring [[VirtualBox]] for virtual-machine-based tasks), or, for donors offering cloud-based virtual machines, by using the project's alternative VolCon software.<ref>{{Cite web \|authors=Texas Advanced Computing Center \|title=About BOINC@TACC \|url=https://boinc.tacc.utexas.edu/about.php \|work=boinc.tacc.utexas.edu \|access-date=2026-07-22}}</ref> Researchers eligible to submit jobs include TACC users, researchers from any of the 14 University of Texas System institutions, and, historically, researchers accessing TACC resources through [[XSEDE]].<ref name="hpcwire" />		Volunteers can join BOINC@TACC either by attaching the standard [[BOINC]] client to the project (requiring [[VirtualBox]] for virtual-machine-based tasks), or, for donors offering cloud-based virtual machines, by using the project's alternative VolCon software.<ref>{{Cite web \|authors=Texas Advanced Computing Center \|title=About BOINC@TACC \|url=https://boinc.tacc.utexas.edu/about.php \|work=boinc.tacc.utexas.edu \|access-date=2026-07-22}}</ref> Researchers eligible to submit jobs include TACC users, researchers from any of the 14 University of Texas System institutions, and, historically, researchers accessing TACC resources through [[XSEDE]].<ref name="hpcwire" />

	[[File:Boinc client rosetta climateprediction net.jpg\|thumb\|A BOINC Manager client showing tasks attached from multiple BOINC projects; volunteers use the same client software to contribute to BOINC@TACC]]		[[File:Boinc client rosetta climateprediction net.jpg\|thumb\|A BOINC Manager client showing tasks attached from multiple BOINC projects; volunteers use the same client software to contribute to BOINC@TACC\|364x364px]]

	== Publications ==		== Publications ==
Line 73:		Line 73:
	# Arora, Ritu, Carlos Redondo and Gerald Joshua. [http://link.springer.com/10.1007/978-981-13-7729-7_8 Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing]. ''Software Challenges to Exascale Computing'' (2019).		# Arora, Ritu, Carlos Redondo and Gerald Joshua. [http://link.springer.com/10.1007/978-981-13-7729-7_8 Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing]. ''Software Challenges to Exascale Computing'' (2019).
	# Wilson, Lucas A and David P Anderson. [http://rgdoi.net/10.13140/RG.2.2.28139.64805 VAST: Integrating Volunteer Computing into Existing Cyberinfrastructure]. (2017). DOI: 10.13140/RG.2.2.28139.64805.		# Wilson, Lucas A and David P Anderson. [http://rgdoi.net/10.13140/RG.2.2.28139.64805 VAST: Integrating Volunteer Computing into Existing Cyberinfrastructure]. (2017). DOI: 10.13140/RG.2.2.28139.64805.

	~~=== Other publications ===~~
	No additional peer-reviewed publications specifically about BOINC@TACC were identified beyond the three listed above and on the BOINC project publications page as of this writing. Related conference material by the project team, including presentations on the ''nanoHUB@home'' collaboration and general TACC volunteer-computing outreach, has appeared in TACC and NSF project reports but does not constitute a separate peer-reviewed publication about BOINC@TACC itself.<ref>{{Cite web \|authors=NSF Public Access Repository \|title=nanoHUB@home: Expanding nanoHUB Through Volunteer Computing \|url=https://par.nsf.gov/biblio/10143977-nanohub-home-expanding-nanohubthroughvolunteer-computing \|work=par.nsf.gov \|access-date=2026-07-22}}</ref>

	== See also ==		== See also ==

BOINC@TACC

Al Piskun — Wed, 22 Jul 2026 11:32:55 GMT

first light

New page

{{Infobox software
| name = BOINC@TACC
| logo = Boinc-tacc.jpg
| logo caption = BOINC@TACC logo
| screenshot = UT Tower, University of Texas in Austin.jpg
| caption = The University of Texas at Austin, home to the Texas Advanced Computing Center
| description = BOINC@TACC is a volunteer computing project operated by the Texas Advanced Computing Center at the University of Texas at Austin that routes high-throughput computing jobs from TACC supercomputers to volunteered desktops, laptops, tablets, and cloud virtual machines.
| status = Complete
| category = Multidisciplinary (aerospace engineering, computational biology, earthquake engineering, bioinformatics)
| compute = CPU & GPU
| dependencies = VirtualBox, Docker
| developer = [[Texas Advanced Computing Center]], University of Texas at Austin
| author = Ritu Arora
| sponsor = [[National Science Foundation]] (award #1664022)
| maintainer = BOINC@TACC project team, Texas Advanced Computing Center
| released = 2017 (as TACC-2-BOINC); renamed BOINC@TACC on {{Start date and age|2019|01|01}}
| completed = No
| discontinued = {{Start date and age|2022|07|11}}
| repository = {{URL|https://github.com/ritua2/BOINCatTACC}}
| programming language = PHP, Python, Shell, C++
| operating system = Windows, Linux, macOS (BOINC client); Docker-based for cloud volunteers
| size =
| stats as of =
| average performance =
| active users =
| total users =
| active hosts =
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|https://boinc.tacc.utexas.edu/}}
| license = LGPL-3.0
}}

'''BOINC@TACC''' is a [[volunteer computing]] project operated by the [[Texas Advanced Computing Center]] (TACC) at the [[University of Texas at Austin]] that integrates [[BOINC]]-based volunteer computing with supercomputing and cloud computing.<ref>{{Cite web |authors=Texas Advanced Computing Center |title=About BOINC@TACC |url=https://boinc.tacc.utexas.edu/about.php |work=boinc.tacc.utexas.edu |access-date=2026-07-22}}</ref> Rather than running scientific applications directly on TACC's supercomputers, the project routes qualified High-Throughput Computing (HTC) jobs from TACC systems such as [[Stampede2]] to computing resources donated by volunteers, including desktops, laptops, tablets, and cloud-based virtual machines.<ref>{{Cite web |authors=Texas Advanced Computing Center |title=BOINC@TACC |url=https://boinc.tacc.utexas.edu/ |work=boinc.tacc.utexas.edu |access-date=2026-07-22}}</ref> Launched in 2017, BOINC@TACC was the first use of volunteer computing by a major high-performance computing center.<ref name="hpcwire">{{Cite web |authors=Iriarte, Mariana |title=Science Enthusiasts, Researchers, Students Benefit from Volunteer Computing Using BOINC@TACC |url=https://www.hpcwire.com/off-the-wire/science-enthusiasts-researchers-students-benefit-from-wolunteer-computing-using-boinctacc/ |work=HPCwire |date=2019-06-25 |access-date=2026-07-22}}</ref>

== Overview ==
BOINC@TACC allows researchers with TACC or [[XSEDE]] allocations to run small, loosely coupled high-throughput jobs on volunteered hardware instead of spending their supercomputer allocation time on them.<ref>{{Cite web |authors=XSEDE |title=User News: BOINC@TACC |url=https://www.xsede.org/news/user-news/-/news/item/11493 |work=xsede.org |access-date=2026-07-22}}</ref> The project's stated goal is to free up TACC's supercomputers for tightly coupled, compute- and memory-intensive parallel jobs by offloading independent, "embarrassingly parallel" work to a [[BOINC]] server that, in turn, distributes it to volunteer clients.<ref name="hpcwire" /> The project's lead is Ritu Arora, a research scientist at TACC.<ref name="hpcwire" /> BOINC@TACC has supported research spanning aerospace engineering, computational biology, and earthquake engineering, among other domains.<ref>{{Cite web |authors=Texas Advanced Computing Center |title=About BOINC@TACC |url=https://boinc.tacc.utexas.edu/about.php |work=boinc.tacc.utexas.edu |access-date=2026-07-22}}</ref>

Volunteers can contribute either by running the standard [[BOINC]] client (which requires VirtualBox for the project's virtual-machine-based jobs) or, for institutional donors with cloud virtual machines, an alternative Docker-based mechanism developed specifically for the project.<ref>{{Cite web |authors=Arora, Ritu |title=ritua2/BOINCatTACC |url=https://github.com/ritua2/BOINCatTACC |work=GitHub |access-date=2026-07-22}}</ref> Task availability on BOINC@TACC has historically been intermittent, since work is generated only as TACC researchers submit qualifying jobs rather than on a continuous schedule; during the COVID-19 pandemic, for example, volunteers reported a batch of virtual-machine-based tasks related to COVID-19 research becoming briefly available.<ref>{{Cite web |authors=AnandTech Forums |title=BOINC@TACC has work |url=https://forums.anandtech.com/threads/boinc-tacc-has-work.2579094/ |work=AnandTech Forums |date=2020-04-06 |access-date=2026-07-22}}</ref>

== History ==
After several live iterations, the project began operating in 2017 under the name '''TACC-2-BOINC'''.<ref name="github">{{Cite web |authors=Arora, Ritu |title=ritua2/BOINCatTACC |url=https://github.com/ritua2/BOINCatTACC |work=GitHub |access-date=2026-07-22}}</ref> To get started, the TACC team deployed an instance of a BOINC server on a cloud computing platform and then developed the software needed to integrate BOINC with TACC's supercomputing and cloud computing platforms.<ref name="hpcwire" /> On July 30, 2018, the project was renamed BOINC@TACC and moved to its current project URL.<ref name="github" /> The project is funded primarily through [[National Science Foundation|NSF]] award #1664022, with additional support from [[XSEDE]], TACC, and the Science Gateway Community Institute.<ref>{{Cite web |authors=Arora, Ritu, Carlos Redondo and Gerald Joshua |title=Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing |url=http://link.springer.com/10.1007/978-981-13-7729-7_8 |work=Software Challenges to Exascale Computing |date=2019 |access-date=2026-07-22}}</ref> Contributors to the BOINC@TACC codebase have included Carlos Redondo, an aerospace engineering student and developer on the project, along with Thomas Johnson and Anubhaw Nand, with additional input from [[BOINC]] founder [[David P. Anderson|David Anderson]].<ref>{{Cite web |authors=Arora, Ritu, Carlos Redondo and Gerald Joshua |title=Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing |url=http://link.springer.com/10.1007/978-981-13-7729-7_8 |work=Software Challenges to Exascale Computing |date=2019 |access-date=2026-07-22}}</ref>

== Software infrastructure ==
The BOINC@TACC codebase, hosted on [[GitHub]] under the LGPL-3.0 license, builds on the ''boinc-server-docker'' software originally developed by Marius Millea and extends it with several project-specific components.<ref name="github" />

=== Job routing and application deployment ===
A command-line back-end, ''stampede2-backend'', runs on Stampede2 and other TACC [[SLURM]]-scheduled Linux systems to determine whether a submitted job is eligible to run on volunteered BOINC clients rather than on TACC resources.<ref name="github" /> Researchers can also submit and track jobs through a web-based user interface built for the project.<ref name="github" /> Applications are packaged as Docker images through a component called MIDAS, which automatically generates Docker containers from source code so they can run either inside [[VirtualBox]] on traditional BOINC clients or directly inside Docker on volunteered cloud virtual machines through a mechanism called VolCon.<ref name="github" /> Pre-built Docker images maintained by the project team have included [[AutoDock]] Vina, [[BEDTools]], [[BLAST (biotechnology)|BLAST]], [[Bowtie (sequence analysis)|Bowtie]], [[GROMACS]], HTSeq, [[LAMMPS]], [[NAMD]], and [[OpenSees]].<ref>{{Cite web |authors=Texas Advanced Computing Center |title=About BOINC@TACC |url=https://boinc.tacc.utexas.edu/about.php |work=boinc.tacc.utexas.edu |access-date=2026-07-22}}</ref>

=== Reef cloud storage ===
Result files produced by BOINC@TACC jobs are stored using ''Reef'', a lightweight, reusable cloud storage component built for the project (also described in the literature under the name ''Greyfish''). Reef can be deployed either as a single storage node ("pocket Reef") or, for larger workloads, as a distributed system with a manager node and one or more remote storage nodes.<ref name="github" />

=== Credit system ===
Like other BOINC projects, BOINC@TACC computes each volunteer's Recent Average Credit (RAC) as an exponentially weighted moving average that gives more weight to recently granted credit and decays older contributions with a half-life of one week. Following BOINC's general credit-accounting scheme, whenever new credit <math>c</math> is granted at a time interval <math>\Delta t</math> after the previous update, the RAC is recalculated as

<math>\text{RAC}_{\text{new}} = \text{RAC}_{\text{old}} \cdot e^{-\Delta t \ln 2 / T} + \frac{c}{T}\left(1 - e^{-\Delta t \ln 2 / T}\right)</math>

where <math>T</math> is the credit half-life (seven days).<ref>{{Cite web |authors=Anderson, David P. |title=BOINC: A Platform for Volunteer Computing |url=https://arxiv.org/abs/1903.01699 |work=arXiv |date=2019 |access-date=2026-07-22}}</ref><ref>{{Cite web |authors=BOINC |title=CreditStats |url=https://github.com/BOINC/boinc/wiki/CreditStats |work=GitHub |access-date=2026-07-22}}</ref> As with several smaller BOINC projects, BOINC@TACC has not published its statistics through third-party aggregators such as [[BOINCstats]] or Free-DC, so detailed current figures for active users, hosts, and average performance are not publicly available.<ref>{{Cite web |authors=AnandTech Forums |title=BOINC@TACC has work |url=https://forums.anandtech.com/threads/boinc-tacc-has-work.2579094/ |work=AnandTech Forums |date=2020-04-06 |access-date=2026-07-22}}</ref>

== Volunteering ==
Volunteers can join BOINC@TACC either by attaching the standard [[BOINC]] client to the project (requiring [[VirtualBox]] for virtual-machine-based tasks), or, for donors offering cloud-based virtual machines, by using the project's alternative VolCon software.<ref>{{Cite web |authors=Texas Advanced Computing Center |title=About BOINC@TACC |url=https://boinc.tacc.utexas.edu/about.php |work=boinc.tacc.utexas.edu |access-date=2026-07-22}}</ref> Researchers eligible to submit jobs include TACC users, researchers from any of the 14 University of Texas System institutions, and, historically, researchers accessing TACC resources through [[XSEDE]].<ref name="hpcwire" />

[[File:Boinc client rosetta climateprediction net.jpg|thumb|A BOINC Manager client showing tasks attached from multiple BOINC projects; volunteers use the same client software to contribute to BOINC@TACC]]

== Publications ==
The following papers, describing the BOINC@TACC project and its software infrastructure, are listed on the official [[BOINC]] project publications page.<ref>{{Cite web |authors=Piskun, Alex |title=Publications by BOINC Projects: BOINC@TACC |url=https://boinc.berkeley.edu/pubs.php |work=boinc.berkeley.edu |access-date=2026-07-22}}</ref>

=== Papers describing the project ===
# Redondo, Carlos and Ritu Arora. [https://dl.acm.org/doi/10.1145/3332186.3333055 Greyfish: An Out-of-the-Box, Reusable, Portable Cloud Storage Service]. ''PEARC '19: Practice and Experience in Advanced Research Computing'' (2019). DOI: 10.1145/3332186.3333055.
# Arora, Ritu, Carlos Redondo and Gerald Joshua. [http://link.springer.com/10.1007/978-981-13-7729-7_8 Scalable Software Infrastructure for Integrating Supercomputing with Volunteer Computing and Cloud Computing]. ''Software Challenges to Exascale Computing'' (2019).
# Wilson, Lucas A and David P Anderson. [http://rgdoi.net/10.13140/RG.2.2.28139.64805 VAST: Integrating Volunteer Computing into Existing Cyberinfrastructure]. (2017). DOI: 10.13140/RG.2.2.28139.64805.

=== Other publications ===
No additional peer-reviewed publications specifically about BOINC@TACC were identified beyond the three listed above and on the BOINC project publications page as of this writing. Related conference material by the project team, including presentations on the ''nanoHUB@home'' collaboration and general TACC volunteer-computing outreach, has appeared in TACC and NSF project reports but does not constitute a separate peer-reviewed publication about BOINC@TACC itself.<ref>{{Cite web |authors=NSF Public Access Repository |title=nanoHUB@home: Expanding nanoHUB Through Volunteer Computing |url=https://par.nsf.gov/biblio/10143977-nanohub-home-expanding-nanohubthroughvolunteer-computing |work=par.nsf.gov |access-date=2026-07-22}}</ref>

== See also ==
* [[BOINC]]
* [[Texas Advanced Computing Center]]
* [[Volunteer computing]]
* [[World Community Grid]]

==References==
{{Reflist}}

[[Category:BOINC projects]]
[[Category:Volunteer computing]]
[[Category:Texas Advanced Computing Center]]

File:Boinc-tacc.jpg

Al Piskun — Wed, 22 Jul 2026 11:12:28 GMT

Al Piskun uploaded File:Boinc-tacc.jpg BOINC@TACC logo

New page

== Summary ==
BOINC@TACC logo

SPT

Al Piskun — Tue, 21 Jul 2026 13:48:17 GMT

← Older revision		Revision as of 13:48, 21 July 2026
(One intermediate revision by the same user not shown)
Line 4:		Line 4:
	\| logo caption = SPT project logo		\| logo caption = SPT project logo

	\| status = ~~Active~~		\| status = Inactive
	\| category = Mathematics / Number Theory		\| category = Mathematics / Number Theory
	\| compute = CPU		\| compute = CPU
Line 12:		Line 12:
	\| sponsor = Natalia Makarova, Alex Belyshev, Tomáš Brada		\| sponsor = Natalia Makarova, Alex Belyshev, Tomáš Brada
	\| maintainer = Natalia Makarova, Alex Belyshev, Tomáš Brada		\| maintainer = Natalia Makarova, Alex Belyshev, Tomáš Brada
	\| released = 2023		\| released = {{Start date and age\|2023\|06\|14}}
			\| completed = No
			\| discontinued = {{Start date and age\|2025\|02\|19}}

	\| programming language = C, C++		\| programming language = C, C++
Line 25:		Line 27:
	\| website = {{URL\|https://boinc.termit.me/adsl/}}		\| website = {{URL\|https://boinc.termit.me/adsl/}}
	}}		}}

	~~[[File:BOINC logo.png\|right\|frameless\|150x150px\|BOINC, the Berkeley Open Infrastructure for Network Computing, is the platform that powers SPT.]]~~

	[https://boinc.termit.me/adsl/ '''''SPT'''''] ('''Symmetric Prime Tuples''') is a [[wikipedia:BOINC\|BOINC]]-based [[wikipedia:Volunteer computing\|volunteer computing]] project dedicated to researching symmetric [[wikipedia:Prime k-tuple\|prime k-tuples]] of consecutive primes, a topic in [[wikipedia:Number theory\|number theory]]. Volunteers donate idle CPU time on their personal computers to help systematically search for symmetric prime k-tuples, advancing an open mathematical problem first formally presented by mathematician Natalia Makarova. The project is hosted at <code>boinc.termit.me/adsl/</code> and serves as the direct continuation of an earlier lineage of BOINC projects pursuing the same mathematical goal.		[https://boinc.termit.me/adsl/ '''''SPT'''''] ('''Symmetric Prime Tuples''') is a [[wikipedia:BOINC\|BOINC]]-based [[wikipedia:Volunteer computing\|volunteer computing]] project dedicated to researching symmetric [[wikipedia:Prime k-tuple\|prime k-tuples]] of consecutive primes, a topic in [[wikipedia:Number theory\|number theory]]. Volunteers donate idle CPU time on their personal computers to help systematically search for symmetric prime k-tuples, advancing an open mathematical problem first formally presented by mathematician Natalia Makarova. The project is hosted at <code>boinc.termit.me/adsl/</code> and serves as the direct continuation of an earlier lineage of BOINC projects pursuing the same mathematical goal.
Line 32:		Line 32:
	== Background and History ==		== Background and History ==

	[[File:Ulam 1.png\|thumb\|~~right\|220px~~\|The [[wikipedia:Ulam spiral\|Ulam spiral]], a visualisation of the distribution of prime numbers. SPT investigates a specific structural property of consecutive primes: whether they can be arranged in symmetric patterns.]]		[[File:Ulam 1.png\|thumb\|296x296px\|The [[wikipedia:Ulam spiral\|Ulam spiral]], a visualisation of the distribution of prime numbers. SPT investigates a specific structural property of consecutive primes: whether they can be arranged in symmetric patterns.]]

	The search for symmetric prime tuples has a rich history within the volunteer computing community. The research lineage traces back to '''Stop@Home''', an early BOINC project that searched for symmetric prime sequences.<ref>{{cite web \|url=http://www.primepuzzles.net/problems/prob_062.htm \|title=Problem 62. Symmetric k-tuples of consecutive primes \|publisher=primepuzzles.net \|access-date=2026-05-23}}</ref> Stop@Home achieved a notable result: in April 2017, the project's volunteers discovered a minimal symmetric 17-tuple with starting prime <math>p = 159{,}067{,}808{,}851{,}610{,}411</math> and offsets 0, 42, 60, 96, 102, 186, 210, 240, 246, 252, 282, 306, 390, 396, 432, 450, 492.<ref>{{cite web \|url=http://www.primepuzzles.net/problems/prob_062.htm \|title=Problem 62. Symmetric k-tuples of consecutive primes \|publisher=primepuzzles.net \|access-date=2026-05-23}}</ref>		The search for symmetric prime tuples has a rich history within the volunteer computing community. The research lineage traces back to '''Stop@Home''', an early BOINC project that searched for symmetric prime sequences.<ref>{{cite web \|url=http://www.primepuzzles.net/problems/prob_062.htm \|title=Problem 62. Symmetric k-tuples of consecutive primes \|publisher=primepuzzles.net \|access-date=2026-05-23}}</ref> Stop@Home achieved a notable result: in April 2017, the project's volunteers discovered a minimal symmetric 17-tuple with starting prime <math>p = 159{,}067{,}808{,}851{,}610{,}411</math> and offsets 0, 42, 60, 96, 102, 186, 210, 240, 246, 252, 282, 306, 390, 396, 432, 450, 492.<ref>{{cite web \|url=http://www.primepuzzles.net/problems/prob_062.htm \|title=Problem 62. Symmetric k-tuples of consecutive primes \|publisher=primepuzzles.net \|access-date=2026-05-23}}</ref>
Line 91:		Line 91:

	=== Definition 4: Diameter ===		=== Definition 4: Diameter ===

			[[File:BOINC logo.png\|right\|frameless\|150x150px\|BOINC, the Berkeley Open Infrastructure for Network Computing, is the platform that powers SPT.]]

	The '''diameter''' <math>d</math> of a k-tuple is the difference between its largest and smallest offsets:<ref>{{cite web \|url=http://oeis.org/A055380 \|title=OEIS A055380 \|publisher=The OEIS Foundation \|access-date=2026-05-23}}</ref>		The '''diameter''' <math>d</math> of a k-tuple is the difference between its largest and smallest offsets:<ref>{{cite web \|url=http://oeis.org/A055380 \|title=OEIS A055380 \|publisher=The OEIS Foundation \|access-date=2026-05-23}}</ref>
Line 109:		Line 111:
	== Known Solutions ==		== Known Solutions ==

	[[File:Sieve of Eratosthenes animation.gif\|thumb\|~~right\|220px~~\|The [[wikipedia:Sieve of Eratosthenes\|Sieve of Eratosthenes]], the classical prime-finding algorithm underlying the modern primesieve library used by SPT.]]		[[File:Sieve of Eratosthenes animation.gif\|thumb\|296x296px\|The [[wikipedia:Sieve of Eratosthenes\|Sieve of Eratosthenes]], the classical prime-finding algorithm underlying the modern primesieve library used by SPT.]]

	The table below summarises the best known solutions for various values of <math>k</math>, as published on the project's reference page.<ref>{{cite web \|url=http://www.primepuzzles.net/problems/prob_062.htm \|title=Problem 62. Symmetric k-tuples of consecutive primes \|publisher=primepuzzles.net \|access-date=2026-05-23}}</ref> Solutions marked "not minimal" indicate that a smaller starting prime <math>p</math> or smaller diameter may still exist. Results were discovered across Stop@Home, TBEG, manual computation by contributors such as J. Wroblewski and two anonymous Russian contributors, and the ongoing SPT project.		The table below summarises the best known solutions for various values of <math>k</math>, as published on the project's reference page.<ref>{{cite web \|url=http://www.primepuzzles.net/problems/prob_062.htm \|title=Problem 62. Symmetric k-tuples of consecutive primes \|publisher=primepuzzles.net \|access-date=2026-05-23}}</ref> Solutions marked "not minimal" indicate that a smaller starting prime <math>p</math> or smaller diameter may still exist. Results were discovered across Stop@Home, TBEG, manual computation by contributors such as J. Wroblewski and two anonymous Russian contributors, and the ongoing SPT project.

BOINC projects

Al Piskun — Mon, 20 Jul 2026 19:05:43 GMT

add BOINC Alpha Test See more...

← Older revision		Revision as of 19:05, 20 July 2026
Line 538:		Line 538:
	\| Software testing		\| Software testing
	\|		\|
	\| 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.		\| 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. [[BOINC Alpha Test\|See more...]]

	\|-		\|-

Main Page

Al Piskun — Mon, 20 Jul 2026 18:26:11 GMT

add BOINC Alpha Test

← Older revision		Revision as of 18:26, 20 July 2026
Line 27:		Line 27:
	</div>		</div>
	<div class="bs-stat bs-stat-purple">		<div class="bs-stat bs-stat-purple">
	<div class="bs-stat-number">85</div>		<div class="bs-stat-number">86</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 156:		Line 156:
	<div class="mw-collapsible-content">		<div class="mw-collapsible-content">
	{\| class="bs-project-table"		{\| class="bs-project-table"
			\|-
			\| * [[BOINC Alpha Test]] test new versions of the BOINC client software on a wide range of hardware and operating systems
			\| * [[BOINC Central]] BOINC infrastructure project
	\|-		\|-
	\| * [[IThena.Computational]] computational measurement network		\| * [[IThena.Computational]] computational measurement network
	\| * [[IThena.Measurements]] network performance metrics		\| * [[IThena.Measurements]] network performance metrics
	\|-
	~~\| * [[BOINC Central]] BOINC infrastructure project~~
	~~\| * [[WUProp@Home]] work unit propagation statistics~~
	\|-		\|-
	\|* [[Yoyo@home]] scientific and mathematical subprojects		\|* [[Yoyo@home]] scientific and mathematical subprojects
	\|		\|* [[WUProp@Home]] work unit propagation statistics
	\|}		\|}
	</div>		</div>

BOINC Alpha Test

Al Piskun — Mon, 20 Jul 2026 18:18:51 GMT

add url

← Older revision		Revision as of 18:18, 20 July 2026
Line 35:		Line 35:
	}}		}}

	'''BOINC Alpha Test''' is the official quality assurance project for the [[wikipedia:BOINC\|BOINC]] middleware itself. Rather than distributing scientific workunits, it exists purely so that volunteers can install experimental builds of the BOINC client software and report back whether they work correctly across the enormous variety of hardware, operating systems, and configurations found on real volunteers' computers. It has been operated by the [[wikipedia:University of California, Berkeley\|University of California, Berkeley]] since 2004 and remains active today, run out of the same Space Sciences Laboratory group that maintains BOINC and [[SETI@home]].		'''[https://boinc.berkeley.edu/alpha/ BOINC Alpha Test]''' is the official quality assurance project for the [[wikipedia:BOINC\|BOINC]] middleware itself. Rather than distributing scientific workunits, it exists purely so that volunteers can install experimental builds of the BOINC client software and report back whether they work correctly across the enormous variety of hardware, operating systems, and configurations found on real volunteers' computers. It has been operated by the [[wikipedia:University of California, Berkeley\|University of California, Berkeley]] since 2004 and remains active today, run out of the same Space Sciences Laboratory group that maintains BOINC and [[SETI@home]].

	== Overview ==		== Overview ==

BOINC Alpha Test

Al Piskun — Mon, 20 Jul 2026 18:11:54 GMT

first light

New page

{{Infobox software
| name = BOINC Alpha Test
| logo = BOINC logo.png
| logo caption = The BOINC logo, submitted by volunteer Michal Krakowiak
| screenshot =
| caption =
| description = BOINC Alpha Test is the official pre-release testing project operated by the BOINC development team at the University of California, Berkeley. It is used to test new versions of the BOINC client software on a wide range of computer hardware and operating systems before they are released to the public.
| status = Active
| category = Software testing
| compute = CPU
| dependencies = A test build of the BOINC client for the platform being tested
| developer = University of California, Berkeley
| author = David P. Anderson
| sponsor = University of California, Berkeley
| maintainer = BOINC development team
| released = {{Start date and age|2004|02|16}}
| completed = No
| discontinued =
| repository = {{URL|https://github.com/BOINC/boinc}}
| programming language = C++, PHP
| operating system = Windows, Linux, macOS, Android
| size =
| stats as of =
| average performance =
| active users =
| total users =
| active hosts =
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|https://boinc.berkeley.edu/alpha/}}
| license = LGPL-3.0-or-later
}}

'''BOINC Alpha Test''' is the official quality assurance project for the [[wikipedia:BOINC|BOINC]] middleware itself. Rather than distributing scientific workunits, it exists purely so that volunteers can install experimental builds of the BOINC client software and report back whether they work correctly across the enormous variety of hardware, operating systems, and configurations found on real volunteers' computers. It has been operated by the [[wikipedia:University of California, Berkeley|University of California, Berkeley]] since 2004 and remains active today, run out of the same Space Sciences Laboratory group that maintains BOINC and [[SETI@home]].

== Overview ==
BOINC Alpha Test does not conduct scientific research of its own. Instead, it functions as a controlled proving ground for new releases of the BOINC client, letting developers gather structured feedback from volunteer testers before a version is pushed to the general public through projects such as [[Rosetta@home]], [[Einstein@Home]], and [[Climateprediction.net]].<ref name="alphahome">{{Cite web |title=BOINC Alpha Test |url=https://boinc.berkeley.edu/alpha/ |publisher=University of California, Berkeley |access-date=2026-07-20}}</ref> Testers download a candidate release, exercise it against a checklist of test cases covering installation, project attachment, and everyday operation, and submit their results through a web-based reporting interface. Anyone willing to help is welcome to sign up, but participants are asked not to remain permanently attached to the project, since its purpose is short-term verification rather than ongoing computation.<ref name="instructions">{{Cite web |title=Instructions for alpha testers |url=https://boinc.berkeley.edu/wiki/Instructions_for_alpha_testers |publisher=University of California, Berkeley |access-date=2026-07-20}}</ref>

For tasks that specifically exercise file transfer, the project issues small workunits with large (4.5 MB) input and output files that require about one minute of <math>\text{CPU time}</math> to process, letting testers verify upload, download, and completion handling without needing to keep the client attached for long.<ref name="instructions" />

== History ==
BOINC itself was created by computer scientist [[wikipedia:David P. Anderson|David P. Anderson]], who had previously directed [[SETI@home]] beginning in 1998. Anderson wrote the first version of the BOINC client, server, and web code in late 2001 and early 2002, choosing C++ for the client and server and PHP for the web components, and arranged for the resulting code to be owned by the University of California and released under the [[wikipedia:GNU Lesser General Public License|GNU Lesser General Public License]].<ref name="history">{{Cite web |title=A brief history of BOINC |url=https://continuum-hypothesis.com/boinc_history.php |author=David P. Anderson |date=2022-01-26 |access-date=2026-07-20}}</ref>

In BOINC's earliest years, quality assurance was informal: a new client build would run on the developers' own machines for a day or two, and if no serious problems turned up it would simply be announced and released. This approach repeatedly failed, since bugs specific to first-time installs or uncommon configurations often did not surface until after a version had already reached the public. By 2004, Anderson concluded that BOINC needed systematic testing across a much wider "parameter space" of CPUs, GPUs, operating-system versions, drivers, and configuration options than the small development team could cover on their own.<ref name="history" />

The solution was to recruit a large pool of volunteer testers, define an explicit list of test cases covering installation, project attachment, and configuration changes, and have testers report pass/fail results through a web interface, producing a "test matrix" of tests against computer types. Once a version's matrix was filled in with positive results, it could be released with confidence. Anderson launched this as an '''Alpha Test Project''' and reported that the approach worked well, attracting a couple of hundred testers in its early years, although the number of consistently active testers dwindled over time as BOINC's volunteer base declined from later peaks.<ref name="history" /> Longtime BOINC developer Rom Walton was put in charge of day-to-day client testing on the project.<ref name="history" />

The project's server was originally hosted at <code>isaac.ssl.berkeley.edu/alpha</code>, alongside other Space Sciences Laboratory infrastructure, before later moving to its current home at <code>boinc.berkeley.edu/alpha</code>.<ref name="adminalpha">{{Cite web |title=AdminAlphaTest |url=https://github.com/BOINC/boinc/wiki/AdminAlphaTest |publisher=BOINC |access-date=2026-07-20}}</ref> Records from the project's own user database show accounts dating back to at least December 2004, consistent with its establishment earlier that year.<ref name="alphahome" />

== Purpose and methodology ==
[[File:BOINC account manager architecture.png|thumb|right|BOINC's client/server architecture separates the client, the manager, and the project server, the kind of modular design that made systematic alpha testing practical.]]

The rationale behind BOINC Alpha Test reflects a broader design philosophy behind BOINC: because developers cannot practically own and test every combination of hardware and software that volunteers might use, an absence of bug reports cannot be taken as an absence of bugs.<ref name="history" /> A dedicated testing project addresses this by turning testers' varied machines into an informal but wide-reaching test lab.

Testing proceeds in cycles. Periodically, usually every few weeks to a few months, the BOINC development team announces a new candidate client version on the '''boinc_alpha''' mailing list and asks testers to download and exercise it.<ref name="alphatesting">{{Cite web |title=Alpha testing |url=https://github.com/BOINC/boinc/wiki/Alpha-testing |publisher=BOINC |access-date=2026-07-20}}</ref> For each release, testers are asked to complete a set of "General" tests plus as many of the additional, more specialized tests as their time and hardware allow.<ref name="alphainstructions">{{Cite web |title=AlphaInstructions |url=https://github.com/BOINC/boinc/wiki/AlphaInstructions |publisher=BOINC |access-date=2026-07-20}}</ref> Results, including negative ones, are submitted through the project's web-based reporting interface, and testers are encouraged to file detailed bug reports for anything unexpected, either to the BOINC bug database or directly to the relevant developer.<ref name="instructions" />

Server-side, the testing schedule is configured through a file that lists each supported hardware/OS combination along with a "target number" of test reports needed for adequate coverage; more popular platforms are assigned higher targets. As bugs are found and fixed during a testing cycle, the BOINC team can progressively narrow the set of tests and platforms still required for the remaining sub-releases.<ref name="adminalpha" />

As of {{Start date and age|2026|07|20}}, the project's home page reported the version currently under test, the list of platforms being covered, which spans Windows, macOS, Linux, and Android, and an overall completion percentage indicating how much of the test matrix had been filled in.<ref name="alphahome" /> Top testers for the preceding thirty days are listed publicly, a small nod to the volunteers who keep the process running.<ref name="alphahome" />

== Related tools and satellite projects ==
Because scheduling and work-fetch bugs are notoriously hard to reproduce on a machine the developer cannot access, the BOINC team also built the '''BOINC Client Emulator''', a companion tool linked from the Alpha Test site that lets a tester's uploaded client state files be replayed and studied on a developer's own computer, reproducing scheduling problems without a live back-and-forth over email.<ref name="alphahome" /><ref name="history" />

BOINC Alpha Test has also been associated over the years with a small family of throwaway internal test projects used for narrower experiments. '''Cunning Plan''' was used to test the account-creation process without risking disruption to the Alpha Test project itself,<ref name="instructions" /> while a project called '''Sleeper''' served as a further test bed for the Alpha Test infrastructure.<ref name="synergylist">{{Cite web |title=BOINC projects |url=https://boincsynergy.ca/wiki/BOINC_projects |publisher=BOINC Synergy |access-date=2026-07-20}}</ref> Testers have also historically been directed to use ordinary science projects such as [[SETI@home]], [[Einstein@Home]], and [[Climateprediction.net]] for tests that fall outside the scope of the dedicated Alpha Test workunits.<ref name="instructions" />

== Significance ==
BOINC Alpha Test predates almost every science project running on the platform today; among the very first BOINC-based science projects to launch was [[Predictor@home]], developed by Michela Taufer at the Scripps Research Institute in mid-2004, just months after the Alpha Test project itself began operating.<ref name="history" /> The testing discipline it introduced, recruiting a volunteer pool broad enough to substitute for hardware the development team could never own itself, became one of BOINC's more durable pieces of process, continuing in essentially the same form for more than two decades even as the surrounding BOINC ecosystem has changed considerably.<ref name="history" />

== See also ==
* [[wikipedia:BOINC|BOINC]]
* [[SETI@home]]
* [[Predictor@home]]
* [[Pirates@Home]]
* [[BOINC Central]]

== References ==
{{Reflist}}

Main Page

Al Piskun — Mon, 20 Jul 2026 10:07:09 GMT

Add Chess960@home and Chess960@home

← Older revision		Revision as of 10:07, 20 July 2026
Line 27:		Line 27:
	</div>		</div>
	<div class="bs-stat bs-stat-purple">		<div class="bs-stat bs-stat-purple">
	<div class="bs-stat-number">83</div>		<div class="bs-stat-number">85</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 236:		Line 236:
	\|* [[Big and Ugly Rendering Project]] distributed video rendering		\|* [[Big and Ugly Rendering Project]] distributed video rendering
	\|* [[CAS@home]] hosted by the Chinese Academy of Sciences, best known for running the TreeThreader protein structure		\|* [[CAS@home]] hosted by the Chinese Academy of Sciences, best known for running the TreeThreader protein structure
			\|-
			\|* [[Chess960@home]] an effort to build the beginnings of an opening theory for the variant
			\|* [[Chess@Home]] build a labeled dataset intended for training a machine-learned classifier of winning position
	\|-		\|-
	\|* [[CAS@home\|Cels@Home]] hosted by the Chinese Academy of Sciences, best known for running the TreeThreader protein structure		\|* [[CAS@home\|Cels@Home]] hosted by the Chinese Academy of Sciences, best known for running the TreeThreader protein structure

BOINC projects

Al Piskun — Mon, 20 Jul 2026 10:01:29 GMT

Add Chess960@home and Chess960@home See more...

← Older revision		Revision as of 10:01, 20 July 2026
Line 2,066:		Line 2,066:
	\|		\|
	\|		\|
	\| ~~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~~.		\| used Stockfish to evaluate tens of millions of chess positions, building a labeled dataset intended for training a machine-learned classifier of winning positions. [[Chess960@home\|See more...]]

	\|-		\|-
Line 2,280:		Line 2,280:
	\|		\|
	\| 2014-01-05		\| 2014-01-05
			2014-03-01
	\|		\|
	\|		\|
Line 2,287:		Line 2,288:
	\|		\|
	\|		\|
	\| ~~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~~.		\| play large numbers of Chess960 (Fischer Random Chess) games, in an effort to build the beginnings of an opening theory for the variant. [[Chess@Home\|See more...]]

	\|-		\|-

Chess@Home

Al Piskun — Mon, 20 Jul 2026 09:46:39 GMT

add archive link

← Older revision		Revision as of 09:46, 20 July 2026
Line 35:		Line 35:
	}}		}}

	'''Chess@Home''' was a short-lived [[BOINC]] volunteer computing project that set out to build a large, machine-evaluated database of chess positions as the first step toward training a classifier able to estimate which side stood better in a given position. The project was run from chess.qugate.org and was maintained by Michal Stanislaw Wojcik, a Polish BOINC community member, with early technical support from the Poland BOINC Foundation.<ref name="about">{{Cite web \|title=About Chess@Home \|url=http://chess.qugate.org/ \|archive-url=https://web.archive.org/web/20140208000329/http://chess.qugate.org/ \|archive-date=8 February 2014 \|website=Chess@Home \|access-date=19 July 2026 \|url-status=dead}}</ref>		'''[https://web.archive.org/http://chess.qugate.org/ Chess@Home]''' was a short-lived [[BOINC]] volunteer computing project that set out to build a large, machine-evaluated database of chess positions as the first step toward training a classifier able to estimate which side stood better in a given position. The project was run from chess.qugate.org and was maintained by Michal Stanislaw Wojcik, a Polish BOINC community member, with early technical support from the Poland BOINC Foundation.<ref name="about">{{Cite web \|title=About Chess@Home \|url=http://chess.qugate.org/ \|archive-url=https://web.archive.org/web/20140208000329/http://chess.qugate.org/ \|archive-date=8 February 2014 \|website=Chess@Home \|access-date=19 July 2026 \|url-status=dead}}</ref>

	== Overview ==		== Overview ==

Chess960@home

Al Piskun — Mon, 20 Jul 2026 09:43:07 GMT

add links

← Older revision		Revision as of 09:43, 20 July 2026
Line 35:		Line 35:
	}}		}}

	'''Chess960@home''' (also styled '''Chess960athome''') was a [[BOINC]] volunteer computing project that studied [[wikipedia:Chess960\|Chess960]], also known as Fischer Random Chess, a chess variant invented by former world chess champion [[wikipedia:Bobby Fischer\|Bobby Fischer]]. Rather than searching for a scientific result in the physical sciences, Chess960@home asked volunteers' idle computers to play out and record large numbers of Chess960 games, with the stated goal of assembling a database large enough to begin identifying sound opening moves for a game whose starting position is chosen at random from 960 possibilities.<ref name="boincitaly">{{Cite web \|title=Chess960@home \|url=https://www.boincitaly.org/progetti/progetti-boinc/progetti-chiusi-o-terminati/chess960home.html?showall=1 \|website=BOINC.Italy \|access-date=19 July 2026}}</ref><ref name="oldprojects">{{Cite web \|title=old_projects.inc \|url=https://github.com/BOINC/boinc-site/blob/master/old_projects.inc \|website=BOINC/boinc-site, GitHub \|publisher=University of California, Berkeley \|access-date=19 July 2026}}</ref>		'''[https://web.archive.org/web/20090328144612/https://www.chess960athome.org/alpha/ Chess960@home]''' (also styled '''Chess960athome''') was a [[BOINC]] volunteer computing project that studied [[wikipedia:Chess960\|Chess960]], also known as Fischer Random Chess, a chess variant invented by former world chess champion [[wikipedia:Bobby Fischer\|Bobby Fischer]]. Rather than searching for a scientific result in the physical sciences, Chess960@home asked volunteers' idle computers to play out and record large numbers of Chess960 games, with the stated goal of assembling a database large enough to begin identifying sound opening moves for a game whose starting position is chosen at random from 960 possibilities.<ref name="boincitaly">{{Cite web \|title=Chess960@home \|url=https://www.boincitaly.org/progetti/progetti-boinc/progetti-chiusi-o-terminati/chess960home.html?showall=1 \|website=BOINC.Italy \|access-date=19 July 2026}}</ref><ref name="oldprojects">{{Cite web \|title=old_projects.inc \|url=https://github.com/BOINC/boinc-site/blob/master/old_projects.inc \|website=BOINC/boinc-site, GitHub \|publisher=University of California, Berkeley \|access-date=19 July 2026}}</ref>

	== Overview ==		== Overview ==
Line 57:		Line 57:

	=== Relationship to a later, unrelated project ===		=== Relationship to a later, unrelated project ===
	Chess960@home should not be confused with a later, independently created BOINC project also concerned with chess, Chess@Home (chess.qugate.org), which aimed to construct a chess-position classifier. When the newer project was announced in 2014, a BOINCstats forum participant asked whether it had any connection to "the old Chess960@Home"; the project's founder confirmed it did not, and that permission to use a similar name had been separately sought.<ref name="chessathome">{{Cite web \|title=Forum::New projects::Chess@Home \|url=https://www.boincstats.com/forum/11/9016,1 \|website=BOINCstats/BAM! \|access-date=19 July 2026}}</ref>		Chess960@home should not be confused with a later, independently created BOINC project also concerned with chess, [[Chess@Home]] (chess.qugate.org), which aimed to construct a chess-position classifier. When the newer project was announced in 2014, a BOINCstats forum participant asked whether it had any connection to "the old Chess960@Home"; the project's founder confirmed it did not, and that permission to use a similar name had been separately sought.<ref name="chessathome">{{Cite web \|title=Forum::New projects::Chess@Home \|url=https://www.boincstats.com/forum/11/9016,1 \|website=BOINCstats/BAM! \|access-date=19 July 2026}}</ref>

	== See also ==		== See also ==

Chess@Home

Al Piskun — Mon, 20 Jul 2026 09:28:24 GMT

first light

New page

{{Infobox software
| name = Chess@Home
| logo =
| logo caption =
| screenshot = Stockfish icon (2010-2020).png
| caption = The icon of Stockfish, the open-source chess engine Chess@Home used to evaluate positions
| description = Chess@Home was a short-lived BOINC volunteer computing project that used Stockfish to evaluate tens of millions of chess positions, building a labeled dataset intended for training a machine-learned classifier of winning positions.
| status = Completed
| category = Computer science, Machine learning
| compute = CPU
| dependencies = Stockfish (bundled)
| developer = Michal Stanislaw Wojcik
| author = Michal Stanislaw Wojcik
| sponsor = Poland BOINC Foundation
| maintainer = Michal Stanislaw Wojcik
| released = {{Start date and age|2014|01|10}}
| completed = Yes
| discontinued = c. March 2014
| repository =
| programming language =
| operating system = Windows
| size =
| stats as of = {{Start date and age|2014|02|08}}
| average performance =
| active users =
| total users =
| active hosts =
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|http://chess.qugate.org/}}
| license =
}}

'''Chess@Home''' was a short-lived [[BOINC]] volunteer computing project that set out to build a large, machine-evaluated database of chess positions as the first step toward training a classifier able to estimate which side stood better in a given position. The project was run from chess.qugate.org and was maintained by Michal Stanislaw Wojcik, a Polish BOINC community member, with early technical support from the Poland BOINC Foundation.<ref name="about">{{Cite web |title=About Chess@Home |url=http://chess.qugate.org/ |archive-url=https://web.archive.org/web/20140208000329/http://chess.qugate.org/ |archive-date=8 February 2014 |website=Chess@Home |access-date=19 July 2026 |url-status=dead}}</ref>

== Overview ==
The project's stated goal was to construct a chess winning-position classifier, or score estimator, built on simple positional features such as material count, the number of squares controlled by each side, and the number of checks available in a position. The first phase aimed to establish how well relatively cheap evaluation methods and standard data mining techniques, including logistic regression, k-nearest neighbors, support vector machines, and decision trees, could perform at this task. A longer-term goal was to apply more advanced machine learning methods to approximate different levels of human chess proficiency, by tuning a search heuristic between more and less thoroughly trained states.<ref name="about" />

To build the underlying dataset, the project first assembled a large collection of positions taken from games played by titled players, and planned to add further positions from weaker amateur games sourced from the [[wikipedia:Free Internet Chess Server|Free Internet Chess Server]] games archive, in order to represent a wider range of playing strength.<ref name="about" /> Each position was to be evaluated by [[wikipedia:Stockfish (chess)|Stockfish]], an open-source chess engine, with the resulting centipawn score (or mate distance, where a forced mate was found) and best move recorded for later analysis.<ref name="about" />

== Scale of the task ==
The project's own estimate, published on its about page, illustrates why the work needed distributed computing rather than a single machine. Evaluating one position to a fixed node budget of five million nodes took roughly five to six seconds on a single core running at approximately 2.5 GHz. Applied across an initial collection of 25 million positions, that works out to:

<math>6\ \text{s} \times 25{,}000{,}000 \approx 1.5 \times 10^{8}\ \text{s} \approx 41{,}666\ \text{hours} \approx 1{,}736\ \text{days}</math>

on one CPU core alone, and the project expected its full dataset, once amateur games were added, to grow to hundreds of millions of positions.<ref name="about" /> By the time of the 8 February 2014 snapshot of the project's homepage, volunteers had already evaluated 30,301,792 positions.<ref name="about" />

== Technical details ==
The BOINC client application distributed to volunteers was named chessathome, for example ''chessathome_1_windows_intelx86.exe'' on Windows, and served as a wrapper that launched the bundled Stockfish engine to perform the actual position evaluation; Stockfish's search was the sole consumer of CPU time on the volunteer's machine.<ref name="about" /> Completed tasks were credited at 9 BOINC credits each, corresponding to roughly ten minutes of work on a 2.5 GHz core.<ref name="about" />

== History ==
Chess@Home was announced to the BOINC community on 10 January 2014, described in the announcement simply as a new project related to the game of chess.<ref name="announce">{{Cite web |title=Thread 'Chess@Home' |url=https://boinc.n-helix.com/forum_thread.php?id=8842 |website=BOINC combined message boards |access-date=19 July 2026}}</ref> Its administrator described himself as new to running a BOINC project and credited Krzysztof Piszczek of the Poland BOINC Foundation as a mentor who helped set up the project's server.<ref name="about" />

The project's active life was brief. By 17 March 2014, a volunteer reported that the project had been offline for more than a week; another community member confirmed that the project had finished, adding that the administrator himself was not certain whether further work would be issued in the future.<ref name="announce" /> No further tasks were subsequently issued, and the project is understood within the BOINC community to have concluded at that point.

=== Relationship to Chess960@home ===
Despite the similar name, Chess@Home was not connected to the earlier, unrelated project [[Chess960@home]]. When Chess@Home was announced, a member of the BOINCstats community asked directly whether the two were related; the response confirmed they were separate projects, and that permission to use a similarly chess-themed name had been sought beforehand.<ref name="boincstats">{{Cite web |title=Forum::New projects::Chess@Home |url=https://www.boincstats.com/forum/11/9016,1 |website=BOINCstats/BAM! |access-date=19 July 2026}}</ref>

== See also ==
* [[Chess960@home]]
* [[wikipedia:Stockfish (chess)|Stockfish]]
* [[wikipedia:BOINC|BOINC]]

== References ==
{{Reflist}}

Chess960@home

Al Piskun — Sun, 19 Jul 2026 11:49:28 GMT

first light

New page

{{Infobox software
| name = Chess960@home
| logo = Chess960.png
| logo caption = Chess960@home banner
| screenshot = Chess960 example init position.png
| caption = An example Chess960 starting position, one of the 960 legal setups the project's client played and analyzed
| description = Chess960@home was a completed BOINC volunteer computing project that used donated processor time to play large numbers of Chess960 (Fischer Random Chess) games, in an effort to build the beginnings of an opening theory for the variant.
| status = Completed
| category = Game study, Mathematics
| compute = CPU
| dependencies = None
| developer =
| author =
| sponsor =
| maintainer =
| released = {{Start date and age|2006|03|20}}
| completed = Yes
| discontinued = c. 2012 (informal; see [[#History|History]])
| repository =
| programming language =
| operating system =
| size =
| stats as of = {{Start date and age|2011|07|03}}
| average performance =
| active users = 7455
| total users =
| active hosts = 829
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|https://www.chess960athome.org/}}
| license =
}}

'''Chess960@home''' (also styled '''Chess960athome''') was a [[BOINC]] volunteer computing project that studied [[wikipedia:Chess960|Chess960]], also known as Fischer Random Chess, a chess variant invented by former world chess champion [[wikipedia:Bobby Fischer|Bobby Fischer]]. Rather than searching for a scientific result in the physical sciences, Chess960@home asked volunteers' idle computers to play out and record large numbers of Chess960 games, with the stated goal of assembling a database large enough to begin identifying sound opening moves for a game whose starting position is chosen at random from 960 possibilities.<ref name="boincitaly">{{Cite web |title=Chess960@home |url=https://www.boincitaly.org/progetti/progetti-boinc/progetti-chiusi-o-terminati/chess960home.html?showall=1 |website=BOINC.Italy |access-date=19 July 2026}}</ref><ref name="oldprojects">{{Cite web |title=old_projects.inc |url=https://github.com/BOINC/boinc-site/blob/master/old_projects.inc |website=BOINC/boinc-site, GitHub |publisher=University of California, Berkeley |access-date=19 July 2026}}</ref>

== Overview ==
Chess960 replaces the fixed classical chess starting position with one of 960 legal arrangements of the back-rank pieces, subject to the rule that a player's bishops must occupy opposite-colored squares and that the king must stand between the two rooks.<ref name="oldprojects" /> The number of legal arrangements follows directly from these constraints:

<math>4 \times 4 \times 6 \times \binom{5}{2} = 960</math>

Four choices exist for a light-squared bishop and four for a dark-squared bishop, the queen may then occupy any of the six remaining squares, and the two identical knights fill two of the five squares left over, with the king and the two rooks filling the final three squares in a single valid order.

Because the starting position changes with every game, memorized classical opening theory is of little use in Chess960. Chess960@home's project idea was to let the [[BOINC]] client generate and play through very large numbers of these positions on volunteers' computers, accumulating a database of games that could then be analyzed for patterns of sound early play, an early attempt to bootstrap something resembling opening theory for the variant using distributed computing rather than manual analysis by strong players.<ref name="boincitaly" />

== History ==
Chess960@home's [[Wikidata]] entry records its inception as 20 March 2006, with the official website listed as chess960athome.org.<ref name="wikidata">{{Cite web |title=Chess960@home |url=https://www.wikidata.org/wiki/Q3667263 |website=Wikidata |access-date=19 July 2026}}</ref> The project was listed among candidate and alpha-stage projects on BOINC's own project pages, described there simply as a study of "Chess-960.org", categorized under game study.<ref name="oldprojects" /> For much of its life the project ran from an "alpha" branch of its website, and volunteer communities such as BOINC.Italy directed participants to attach to it at chess960athome.org/alpha/ rather than the plain domain.<ref name="boincitalyforum">{{Cite web |title=[Thread Ufficiale] Chess960@home |url=https://www.boincitaly.org/forum/chiusi/43315-thread-ufficiale-chess960-home.html |website=BOINC.Italy |access-date=19 July 2026}}</ref>

The project found an audience within established BOINC volunteer communities; members of groups such as the UK BOINC Team listed Chess960@Home among the projects they contributed to alongside more established efforts like [[Einstein@Home]] and [[SETI@home]].<ref name="bam">{{Cite web |title=Profiles |url=https://boincstats.com/en/page/profiles/user/!/Detai |website=BOINCstats/BAM! |access-date=19 July 2026}}</ref>

=== Decline ===
Volunteer reviewers writing in 2010 noted that the project's official forum saw an almost total absence of the administrators, leaving participants with little information about the state of the underlying research, even as the project continued to send out work intermittently.<ref name="boincitaly" /> According to the same community record, this pattern continued until February 2012, after which no further workunits were generated and the site displayed only a message indicating the project remained in a testing phase.<ref name="boincitaly" />

The chess960athome.org website nonetheless stayed reachable for many years afterward. As late as its most recent recorded state, the homepage still described the project as being in a state of "productive tests" with account creation, workunit creation, and the scheduler all nominally enabled, while reporting zero units queued to crunch and listing a recent-activity figure of 7,501 users and 211 active hosts.<ref name="homepage">{{Cite web |title=Chess960athome |url=https://www.chess960athome.org/ |website=Chess960athome |access-date=19 July 2026}}</ref> News posts on the site trailed off across the following decade; the most recent, dated 10 January 2022, thanked a new advertising sponsor for helping cover the cost of server backups.<ref name="homepage" />

=== Relationship to a later, unrelated project ===
Chess960@home should not be confused with a later, independently created BOINC project also concerned with chess, Chess@Home (chess.qugate.org), which aimed to construct a chess-position classifier. When the newer project was announced in 2014, a BOINCstats forum participant asked whether it had any connection to "the old Chess960@Home"; the project's founder confirmed it did not, and that permission to use a similar name had been separately sought.<ref name="chessathome">{{Cite web |title=Forum::New projects::Chess@Home |url=https://www.boincstats.com/forum/11/9016,1 |website=BOINCstats/BAM! |access-date=19 July 2026}}</ref>

== See also ==
* [[Einstein@Home]]
* [[SETI@home]]
* [[World Community Grid]]
* [[wikipedia:Chess960|Chess960]]
* [[wikipedia:Fischer random chess numbering scheme|Fischer random chess numbering scheme]]

== References ==
{{Reflist}}

File:Chess960.png

Al Piskun — Sun, 19 Jul 2026 11:02:25 GMT

Al Piskun uploaded File:Chess960.png Chess960@home logo

New page

== Summary ==
Chess960@home logo

Main Page

Al Piskun — Sat, 18 Jul 2026 23:05:15 GMT

add ABC@home and POEM@HOME

← Older revision		Revision as of 23:05, 18 July 2026
Line 27:		Line 27:
	</div>		</div>
	<div class="bs-stat bs-stat-purple">		<div class="bs-stat bs-stat-purple">
	<div class="bs-stat-number">81</div>		<div class="bs-stat-number">83</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 225:		Line 225:
	{\| class="bs-project-table"		{\| class="bs-project-table"
	\|-		\|-
			\| * [[ABC@home]] searched for abc-triples related to the abc conjecture in number theory
	\| * [[Albert@Home]] developement site for Einstein@Home		\| * [[Albert@Home]] developement site for Einstein@Home
	~~\| * [[Amicable Numbers]] amicable pair enumeration~~
	\|-		\|-
			\|* [[Amicable Numbers]] amicable pair enumeration
	\|* [[AQUA@home]] model the performance of superconducting adiabatic quantum computers		\|* [[AQUA@home]] model the performance of superconducting adiabatic quantum computers
	\|
	\|-		\|-
	\| * [[Axiom Distributed AI]] distributed AI model training		\| * [[Axiom Distributed AI]] distributed AI model training
Line 257:		Line 257:
	\| * [[nanoHUB@Home]] nanotechnology simulation		\| * [[nanoHUB@Home]] nanotechnology simulation
	\| * [[Parlea]] RNA 3D structure motif analysis		\| * [[Parlea]] RNA 3D structure motif analysis
			\|-
			\|* [[POEM@HOME]] all-atom free-energy simulations to predict protein structure and folding
			\|
	\|-		\|-
	\|* [[Malariacontrol.net]] simulate the transmission dynamics and health effects of malaria		\|* [[Malariacontrol.net]] simulate the transmission dynamics and health effects of malaria

BOINC projects

Al Piskun — Sat, 18 Jul 2026 22:55:47 GMT

add ABC@home and POEM@HOME See more...

← Older revision		Revision as of 22:55, 18 July 2026
Line 3,458:		Line 3,458:
	\|		\|
	\|		\|
	\| Protein structure prediction has been complemented by other nanoscale molecule simulations. Within the scope of polymer crystallography we are researching conformations of organic hydrocarbons.		\| Protein structure prediction has been complemented by other nanoscale molecule simulations. Within the scope of polymer crystallography we are researching conformations of organic hydrocarbons. [[POEM@HOME\|See more...]]

	\|-		\|-
Line 3,627:		Line 3,627:
	\|		\|
	\|		\|
	\| ~~An educational and non-profit volunteer computing project finding~~ abc-triples related to the ABC conjecture.		\| Finding abc-triples related to the ABC conjecture. [[ABC@home\|See more...]]

	\|-		\|-

POEM@HOME

Al Piskun — Sat, 18 Jul 2026 19:24:04 GMT

add archive link

← Older revision		Revision as of 19:24, 18 July 2026
Line 35:		Line 35:
	}}		}}

	'''POEM@HOME''' (also written '''POEM@Home''') was a [[wikipedia:volunteer computing\|volunteer computing]] project running on the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|Berkeley Open Infrastructure for Network Computing (BOINC)]] platform.<ref name="wp-newsarchive">{{Cite web \|url=http://boinc.fzk.de/poem/old_news.php \|title=News archive \|website=boinc.fzk.de \|publisher=Karlsruhe Institute of Technology \|archive-url=https://web.archive.org/web/20140224005936/http://boinc.fzk.de/poem/old_news.php \|archive-date=2014-02-24 \|url-status=dead \|access-date=2026-07-18}}</ref><ref name="end-announcement">{{Cite web \|url=http://boinc.fzk.de/poem/forum_thread.php?id=1280 \|title=The Future of POEM@HOME \|website=boinc.fzk.de \|publisher=Karlsruhe Institute of Technology \|date=2016-10-04 \|archive-url=https://web.archive.org/web/20161009200537/http://boinc.fzk.de/poem/forum_thread.php?id=1280 \|archive-date=2016-10-09 \|url-status=dead \|access-date=2026-07-18}}</ref> The project was hosted by the [[wikipedia:Karlsruhe Institute of Technology\|Karlsruhe Institute of Technology (KIT)]], specifically the Institute of Nanotechnology (INT), in the research group of Prof. Dr. Wolfgang Wenzel.<ref name="strunk-bio">{{Cite web \|url=http://www.timo-strunk.de/?page_id=4 \|title=About Me \|website=timo-strunk.de \|author=Strunk, Timo \|access-date=2026-07-18}}</ref> POEM@HOME used [[wikipedia:volunteer computing\|volunteers']] idle computer time to simulate [[wikipedia:protein folding\|protein folding]] and predict [[wikipedia:protein structure prediction\|protein structure]] from [[wikipedia:amino acid\|amino acid]] sequence, based on [[wikipedia:Anfinsen's dogma\|Anfinsen's dogma]], the hypothesis that a protein's biologically active, native conformation corresponds to the global minimum of its [[wikipedia:Gibbs free energy\|free energy]] landscape.<ref name="wp-newsarchive" /><ref name="verma-pff02">{{Cite journal \|authors=Verma, A., Wenzel, W. \|title=A Free-Energy Approach for All-Atom Protein Simulation \|journal=Biophysical Journal \|volume=96 \|issue=9 \|pages=3483-3494 \|date=2009 \|doi=10.1016/j.bpj.2008.12.3921}}</ref> The project ran from 2007 until it was formally retired in October 2016, after advances in GPU-accelerated simulation reduced its need for volunteered CPU time.<ref name="wp-newsarchive" /><ref name="end-announcement" />		'''[https://web.archive.org/http://boinc.fzk.de/poem/ POEM@HOME]''' (also written '''POEM@Home''') was a [[wikipedia:volunteer computing\|volunteer computing]] project running on the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|Berkeley Open Infrastructure for Network Computing (BOINC)]] platform.<ref name="wp-newsarchive">{{Cite web \|url=http://boinc.fzk.de/poem/old_news.php \|title=News archive \|website=boinc.fzk.de \|publisher=Karlsruhe Institute of Technology \|archive-url=https://web.archive.org/web/20140224005936/http://boinc.fzk.de/poem/old_news.php \|archive-date=2014-02-24 \|url-status=dead \|access-date=2026-07-18}}</ref><ref name="end-announcement">{{Cite web \|url=http://boinc.fzk.de/poem/forum_thread.php?id=1280 \|title=The Future of POEM@HOME \|website=boinc.fzk.de \|publisher=Karlsruhe Institute of Technology \|date=2016-10-04 \|archive-url=https://web.archive.org/web/20161009200537/http://boinc.fzk.de/poem/forum_thread.php?id=1280 \|archive-date=2016-10-09 \|url-status=dead \|access-date=2026-07-18}}</ref> The project was hosted by the [[wikipedia:Karlsruhe Institute of Technology\|Karlsruhe Institute of Technology (KIT)]], specifically the Institute of Nanotechnology (INT), in the research group of Prof. Dr. Wolfgang Wenzel.<ref name="strunk-bio">{{Cite web \|url=http://www.timo-strunk.de/?page_id=4 \|title=About Me \|website=timo-strunk.de \|author=Strunk, Timo \|access-date=2026-07-18}}</ref> POEM@HOME used [[wikipedia:volunteer computing\|volunteers']] idle computer time to simulate [[wikipedia:protein folding\|protein folding]] and predict [[wikipedia:protein structure prediction\|protein structure]] from [[wikipedia:amino acid\|amino acid]] sequence, based on [[wikipedia:Anfinsen's dogma\|Anfinsen's dogma]], the hypothesis that a protein's biologically active, native conformation corresponds to the global minimum of its [[wikipedia:Gibbs free energy\|free energy]] landscape.<ref name="wp-newsarchive" /><ref name="verma-pff02">{{Cite journal \|authors=Verma, A., Wenzel, W. \|title=A Free-Energy Approach for All-Atom Protein Simulation \|journal=Biophysical Journal \|volume=96 \|issue=9 \|pages=3483-3494 \|date=2009 \|doi=10.1016/j.bpj.2008.12.3921}}</ref> The project ran from 2007 until it was formally retired in October 2016, after advances in GPU-accelerated simulation reduced its need for volunteered CPU time.<ref name="wp-newsarchive" /><ref name="end-announcement" />

	The POEM@HOME client applications were proprietary and were not released as open-source software.<ref name="wp-newsarchive" />		The POEM@HOME client applications were proprietary and were not released as open-source software.<ref name="wp-newsarchive" />

POEM@HOME

Al Piskun — Sat, 18 Jul 2026 19:23:10 GMT

first light

New page

{{Infobox software
| name = POEM@HOME
| logo =POEM@HOME.jpg
| logo caption =POEM@HOME logo
| screenshot =
| caption =
| description = POEM@HOME was a completed BOINC volunteer computing project hosted by the Karlsruhe Institute of Technology that used all-atom free-energy simulations to predict protein structure and folding, running from 2007 to 2016.
| status = Completed
| category = Biochemistry
| compute = CPU & GPU
| dependencies = None
| developer = Institute of Nanotechnology (INT), Karlsruhe Institute of Technology
| author = Timo Strunk
| sponsor =
| maintainer = POEM@HOME team (Wenzel Group, INT, KIT)
| released = {{Start date and age|2007}}
| completed = {{Start date and age|2016|10|04}}
| discontinued =
| repository =
| programming language =
| operating system = Windows, Linux
| size =
| stats as of =
| average performance =
| active users =
| total users =
| active hosts =
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|http://boinc.fzk.de/poem/}} (defunct)
| license = Proprietary
}}

'''POEM@HOME''' (also written '''POEM@Home''') was a [[wikipedia:volunteer computing|volunteer computing]] project running on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|Berkeley Open Infrastructure for Network Computing (BOINC)]] platform.<ref name="wp-newsarchive">{{Cite web |url=http://boinc.fzk.de/poem/old_news.php |title=News archive |website=boinc.fzk.de |publisher=Karlsruhe Institute of Technology |archive-url=https://web.archive.org/web/20140224005936/http://boinc.fzk.de/poem/old_news.php |archive-date=2014-02-24 |url-status=dead |access-date=2026-07-18}}</ref><ref name="end-announcement">{{Cite web |url=http://boinc.fzk.de/poem/forum_thread.php?id=1280 |title=The Future of POEM@HOME |website=boinc.fzk.de |publisher=Karlsruhe Institute of Technology |date=2016-10-04 |archive-url=https://web.archive.org/web/20161009200537/http://boinc.fzk.de/poem/forum_thread.php?id=1280 |archive-date=2016-10-09 |url-status=dead |access-date=2026-07-18}}</ref> The project was hosted by the [[wikipedia:Karlsruhe Institute of Technology|Karlsruhe Institute of Technology (KIT)]], specifically the Institute of Nanotechnology (INT), in the research group of Prof. Dr. Wolfgang Wenzel.<ref name="strunk-bio">{{Cite web |url=http://www.timo-strunk.de/?page_id=4 |title=About Me |website=timo-strunk.de |author=Strunk, Timo |access-date=2026-07-18}}</ref> POEM@HOME used [[wikipedia:volunteer computing|volunteers']] idle computer time to simulate [[wikipedia:protein folding|protein folding]] and predict [[wikipedia:protein structure prediction|protein structure]] from [[wikipedia:amino acid|amino acid]] sequence, based on [[wikipedia:Anfinsen's dogma|Anfinsen's dogma]], the hypothesis that a protein's biologically active, native conformation corresponds to the global minimum of its [[wikipedia:Gibbs free energy|free energy]] landscape.<ref name="wp-newsarchive" /><ref name="verma-pff02">{{Cite journal |authors=Verma, A., Wenzel, W. |title=A Free-Energy Approach for All-Atom Protein Simulation |journal=Biophysical Journal |volume=96 |issue=9 |pages=3483-3494 |date=2009 |doi=10.1016/j.bpj.2008.12.3921}}</ref> The project ran from 2007 until it was formally retired in October 2016, after advances in GPU-accelerated simulation reduced its need for volunteered CPU time.<ref name="wp-newsarchive" /><ref name="end-announcement" />

The POEM@HOME client applications were proprietary and were not released as open-source software.<ref name="wp-newsarchive" />

[[File:Karlsruhe Uni Hauptgebaeude.jpg|thumb|The main building of the Karlsruhe Institute of Technology, the project's host institution]]

== Overview ==

POEM@HOME investigated how [[wikipedia:protein structure|protein structure]] determines protein function, attempted to predict a protein's three-dimensional structure directly from its amino acid sequence, studied how [[wikipedia:protein-protein interaction|proteins interact]] with one another, and examined how malfunctioning proteins can give rise to functional disorders, with the eventual goal of supporting the development of medical treatments.<ref name="wp-newsarchive" /> The BOINC server component of POEM@HOME was developed by Timo Strunk as part of his diploma thesis in the Wenzel group, building on an existing Monte Carlo simulation package known as ''jpoem''.<ref name="strunk-bio" />

== Scientific approach ==

The scientific core of POEM@HOME was an all-atom [[wikipedia:force field (chemistry)|free-energy force field]], developed over several years by the Wenzel group and referred to in successive versions as PFF01 and PFF02.<ref name="verma-pff02" /> Rather than simulating the physical, time-resolved dynamics of folding as [[wikipedia:molecular dynamics|molecular dynamics]] methods do, the force field approach evaluated a free-energy function for a very large number of candidate conformations and searched for the conformation of lowest free energy using stochastic optimization techniques such as basin-hopping and evolutionary algorithms.<ref name="verma-pff02" /> This is the computational expression of Anfinsen's dogma: the predicted native structure <math>x^*</math> is the conformation that minimizes the free energy function <math>E(x)</math> over the space of possible conformations,

<math>x^* = \arg\min_{x} E(x)</math>

where the free-energy function itself was built up from several physical contributions, schematically

<math>E(x) = E_{\text{LJ}}(x) + E_{\text{elec}}(x) + E_{\text{HB}}(x) + E_{\text{solv}}(x)</math>

combining a [[wikipedia:Lennard-Jones potential|Lennard-Jones]] term, an atomically resolved electrostatic term, a hydrogen-bonding term, and an implicit solvation term based on solvent-accessible surface area.<ref name="verma-pff02" /> Distributing this exhaustive conformational search across thousands of volunteered computers was the central reason the project was built on BOINC.<ref name="strunk-simona">{{Cite journal |authors=Strunk, T., Wolf, M., Brieg, M., Klenin, K., Biewer, A., Tristram, F., Ernst, M., Kleine, P. J., Heilmann, N., Kondov, I., Wenzel, W. |title=SIMONA 1.0: An efficient and versatile framework for stochastic simulations of molecular and nanoscale systems |journal=Journal of Computational Chemistry |volume=33 |issue=32 |pages=2602-2613 |date=2012 |doi=10.1002/jcc.23089 |url=https://onlinelibrary.wiley.com/doi/10.1002/jcc.23089}}</ref>

[[File:Protein structure (1).png|thumb|Illustration of a folded protein tertiary structure, the kind of conformation POEM@HOME attempted to predict from sequence]]

== Software framework ==

In its later years the project's simulations were run on '''SIMONA''' (SImulation of MOlecular and NAnoscale systems), a generic Monte Carlo based simulation framework developed at the Institute of Nanotechnology, KIT, and described in a 2012 paper by Strunk, Wolf, Brieg, Klenin and colleagues.<ref name="strunk-simona" /> SIMONA was built to be usable through a graphical interface for standard runs while also being parallelized across [[wikipedia:Message Passing Interface|MPI]] and [[wikipedia:graphics processing unit|GPU]] resources, and was applied not only to protein conformational sampling but also to protein-protein association, small-molecule protein docking, and simulation of nanoscale organic molecule clusters.<ref name="strunk-simona" /><ref name="simona-int">{{Cite web |url=https://www.int.kit.edu/1636.php |title=SIMONA (SImulation of MOlecular and NAnoscale systems) |website=int.kit.edu |publisher=Institute of Nanotechnology, Karlsruhe Institute of Technology |access-date=2026-07-18}}</ref> A GPU-optimized version of SIMONA was completed in 2015, which the project team reported sped up calculations "by various magnitudes" compared to the CPU-only workflow that BOINC volunteers had been supporting.<ref name="end-announcement" /> Around the same period the project also released [[wikipedia:OpenCL|OpenCL]]-based GPU applications for AMD/ATI hardware, distributing separate CPU workunits (branded "firstdrug") and GPU workunits (branded "gpucrystal") aimed at drug-development calculations.<ref name="bcteam-forum">{{Cite web |url=https://www.bc-team.org/viewtopic.php?f=23&t=321 |title=POEM@home |website=bc-team.org |publisher=BOINC Confederation |access-date=2026-07-18}}</ref>

== Participation in CASP ==

POEM@HOME took part in [[wikipedia:CASP|CASP]] (Critical Assessment of Techniques for Protein Structure Prediction), including CASP8 in 2008, submitting predictions generated with volunteer-computed workunits.<ref name="bcteam-forum" /> According to the project team's own retrospective, the CASP experience showed that POEM's forcefield-based approach was particularly effective at ''quality assessment'', that is, the biophysical evaluation and ranking of candidate protein structures, rather than at generating entirely new folds from scratch (''de novo'' modelling).<ref name="bcteam-forum" />

== Applications and outcomes ==

The project team reported using POEM@HOME's methods to help identify a gene associated with a rare, late-stage developmental disorder said to affect roughly 1 in 10,000 births, an outcome the team highlighted in project communications as a direct application of the project's computational biology work to human disease.<ref name="bcteam-forum" /> The project's underlying force-field and simulation methods were also applied by the Wenzel group and collaborators to problems including protein-protein interface analysis, small-peptide receptor binding, and protein engineering, several examples of which are listed in [[#Publications|Publications]] below.

== History ==

POEM@HOME began operating in 2007.<ref name="wp-newsarchive" /> Over the following years its BOINC volunteer base contributed CPU time toward the group's protein folding and structure-prediction studies, including the CASP8 competition in 2008.<ref name="bcteam-forum" /> Following the development of a GPU-accelerated version of the SIMONA simulation framework in 2015, the project's in-house computational capacity grew so large that it "did not require [volunteers'] large and generous contributions" to continue its science.<ref name="end-announcement" /> On 4 October 2016, the project team posted "The Future of POEM@HOME," thanking contributors and announcing the project's retirement after eight years of operation, while encouraging volunteers to redirect their computing time to other, smaller BOINC projects with greater need.<ref name="end-announcement" /> The project's closure was independently noted by BOINC volunteers on other project forums shortly afterward.<ref name="foldingforum">{{Cite web |url=https://foldingforum.org/viewtopic.php?p=289540 |title=Can Folding@home be added as a BOINC project? |website=foldingforum.org |date=2016-10-17 |access-date=2026-07-18}}</ref>

== See also ==

* [[Predictor@home]]
* [[wikipedia:BOINC|BOINC]]
* [[wikipedia:Protein structure prediction|Protein structure prediction]]
* [[wikipedia:CASP|CASP]]

== Publications ==

This is a list papers containing scientific results arising, directly or indirectly, from BOINC-based computing. See https://boinc.berkeley.edu/pubs.php#POEM@HOME
# {{Cite journal |authors=Strunk, T., Wolf, M., Wenzel, W. |title=Peptide structure prediction using distributed volunteer computing networks |journal=Journal of Mathematical Chemistry |date=2012 |doi=10.1007/s10910-011-9937-x |url=http://link.springer.com/10.1007/s10910-011-9937-x}}
# {{Cite journal |authors=Strunk, T., Wolf, M., Brieg, M., Klenin, K., Biewer, A., Tristram, F., Ernst, M., Kleine, P. J., Heilmann, N., Kondov, I., Wenzel, W. |title=SIMONA 1.0: An efficient and versatile framework for stochastic simulations of molecular and nanoscale systems |journal=Journal of Computational Chemistry |volume=33 |issue=32 |pages=2602-2613 |date=2012 |doi=10.1002/jcc.23089 |url=https://onlinelibrary.wiley.com/doi/10.1002/jcc.23089}}
# {{Cite journal |authors=Meliciani, I., Klenin, K., Strunk, T., Schmitz, K., Wenzel, W. |title=Probing hot spots on protein-protein interfaces with all-atom free-energy simulation |journal=The Journal of Chemical Physics |date=2009 |doi=10.1063/1.3177008 |url=http://aip.scitation.org/doi/10.1063/1.3177008}}
# {{Cite journal |authors=Girrbach, M., Meliciani, I., Waterkotte, B. et al. |title=A fluorescence polarization assay for the experimental validation of an in silico model of the chemokine CXCL8 binding to receptor-derived peptides |journal=Physical Chemistry Chemical Physics |date=2014 |doi=10.1039/C3CP53850H |url=https://pubs.rsc.org/en/content/articlelanding/2014/cp/c3cp53850h}}
# {{Cite journal |authors=Boeuf, S., Throm, T., Gutt, B. et al. |title=Engineering hydrophobin DewA to generate surfaces that enhance adhesion of human but not bacterial cells |journal=Acta Biomaterialia |date=2012 |doi=10.1016/j.actbio.2011.11.022 |url=https://linkinghub.elsevier.com/retrieve/pii/S1742706111005253}}

== References ==
{{Reflist}}

[[Category:Completed BOINC projects]]
[[Category:Biochemistry]]

File:POEM@HOME.jpg

Al Piskun — Sat, 18 Jul 2026 19:07:44 GMT

Al Piskun uploaded File:POEM@HOME.jpg POEM@HOME logo

New page

== Summary ==
POEM@HOME logo

ABC@home

Al Piskun — Sat, 18 Jul 2026 13:54:42 GMT

add archive link

← Older revision		Revision as of 13:54, 18 July 2026
Line 35:		Line 35:
	}}		}}

	'''ABC@home''' was a [[wikipedia:volunteer computing\|volunteer computing]] project running on the [[BOINC]] platform that searched for '''abc-triples''', sets of numbers related to the [[wikipedia:abc conjecture\|abc conjecture]], one of the best known open problems in [[wikipedia:number theory\|number theory]].<ref name="wikipedia">{{Cite web\|title=ABC@Home\|url=https://en.wikipedia.org/wiki/ABC@Home\|website=Wikipedia\|access-date=2026-07-18}}</ref> The project was organized by the Mathematical Institute of [[wikipedia:Leiden University\|Leiden University]] in the Netherlands, together with the Dutch Kennislink science communication institute, and ran from 2006 until it ceased operations in 2015.<ref name="palenstijn2023">{{Cite journal\|last=Alvarez-Salazar\|first=Elise\|last2=Barrios\|first2=Alexander J.\|last3=Henaku\|first3=Calvin\|last4=Soller\|first4=Summer\|title=On abc triples of the form (1, c − 1, c)\|journal=arXiv preprint\|year=2023\|arxiv=2301.01376}}</ref>		'''[https://web.archive.org/web/20130331200159/http://abcathome.com/ ABC@home]''' was a [[wikipedia:volunteer computing\|volunteer computing]] project running on the [[BOINC]] platform that searched for '''abc-triples''', sets of numbers related to the [[wikipedia:abc conjecture\|abc conjecture]], one of the best known open problems in [[wikipedia:number theory\|number theory]].<ref name="wikipedia">{{Cite web\|title=ABC@Home\|url=https://en.wikipedia.org/wiki/ABC@Home\|website=Wikipedia\|access-date=2026-07-18}}</ref> The project was organized by the Mathematical Institute of [[wikipedia:Leiden University\|Leiden University]] in the Netherlands, together with the Dutch Kennislink science communication institute, and ran from 2006 until it ceased operations in 2015.<ref name="palenstijn2023">{{Cite journal\|last=Alvarez-Salazar\|first=Elise\|last2=Barrios\|first2=Alexander J.\|last3=Henaku\|first3=Calvin\|last4=Soller\|first4=Summer\|title=On abc triples of the form (1, c − 1, c)\|journal=arXiv preprint\|year=2023\|arxiv=2301.01376}}</ref>

	== Background ==		== Background ==

ABC@home

Al Piskun — Sat, 18 Jul 2026 13:53:26 GMT

first light

New page

{{Infobox software
| name = ABC@home
| logo = Abclogo.jpg
| logo caption = ABC@home project logo
| screenshot = ABC@Home.png
| caption =
| description = ABC@home was a completed Mathematics BOINC project run by Leiden University that searched for abc-triples related to the abc conjecture in number theory.
| status = Completed
| category = Mathematics
| compute = CPU
| dependencies = None
| developer = Mathematical Institute, Leiden University
| author = Bart de Smit
| sponsor = Dutch Kennislink Science Institute
| maintainer = Bart de Smit
| released = {{Start date and age|2006|11|02}}
| completed = {{Start date and age|2015|11|30}}
| discontinued =
| repository =
| programming language =
| operating system = Cross-platform
| size =
| stats as of = {{Start date and age|2011|03|15}}
| average performance = ~10 teraflops
| active users = 7,300
| total users =
| active hosts =
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance = ~10 teraflops
| website = {{URL|http://www.abcathome.com/}}
| license = Proprietary
}}

'''ABC@home''' was a [[wikipedia:volunteer computing|volunteer computing]] project running on the [[BOINC]] platform that searched for '''abc-triples''', sets of numbers related to the [[wikipedia:abc conjecture|abc conjecture]], one of the best known open problems in [[wikipedia:number theory|number theory]].<ref name="wikipedia">{{Cite web|title=ABC@Home|url=https://en.wikipedia.org/wiki/ABC@Home|website=Wikipedia|access-date=2026-07-18}}</ref> The project was organized by the Mathematical Institute of [[wikipedia:Leiden University|Leiden University]] in the Netherlands, together with the Dutch Kennislink science communication institute, and ran from 2006 until it ceased operations in 2015.<ref name="palenstijn2023">{{Cite journal|last=Alvarez-Salazar|first=Elise|last2=Barrios|first2=Alexander J.|last3=Henaku|first3=Calvin|last4=Soller|first4=Summer|title=On abc triples of the form (1, c − 1, c)|journal=arXiv preprint|year=2023|arxiv=2301.01376}}</ref>

== Background ==
The abc conjecture, proposed by [[wikipedia:Joseph Oesterlé|Joseph Oesterlé]] and [[wikipedia:David Masser|David Masser]] in 1985, concerns triples of positive, pairwise coprime integers <math>a</math>, <math>b</math>, and <math>c</math> satisfying

<math>a + b = c.</math>

For such a triple, the '''radical''' of the product <math>abc</math> is defined as the product of the distinct prime factors of <math>abc</math>:

<math>\operatorname{rad}(abc) = \prod_{p \mid abc} p.</math>

A triple is called an '''abc-triple''' if <math>\operatorname{rad}(abc) < c</math>. The '''quality''' of an abc-triple is defined as

<math>q(a,b,c) = \frac{\log c}{\log \operatorname{rad}(abc)}.</math>

The abc conjecture states that for every <math>\varepsilon > 0</math>, only finitely many abc-triples satisfy <math>q(a,b,c) > 1 + \varepsilon</math>.<ref name="alvarez2023-full">{{Cite journal|last=Alvarez-Salazar|first=Elise|last2=Barrios|first2=Alexander J.|last3=Henaku|first3=Calvin|last4=Soller|first4=Summer|title=On abc triples of the form (1, c − 1, c)|journal=arXiv preprint|year=2023|arxiv=2301.01376}}</ref> A proof of the conjecture would have far-reaching consequences for number theory, including an asymptotic version of [[wikipedia:Fermat's Last Theorem|Fermat's Last Theorem]] and [[wikipedia:Faltings's theorem|Faltings's theorem]].

Cataloguing abc-triples by brute-force search, and studying their quality distribution, is one of the main ways mathematicians have gathered empirical evidence about the conjecture. ABC@home was created to carry out such a search at scale using volunteered computing power.<ref name="boincwiki">{{Cite web|title=ABC@home|url=https://boinc.berkeley.edu/wiki/ABC@home|website=BOINC|publisher=University of California, Berkeley|access-date=2026-07-18}}</ref>

== History ==
[[File:Leiden University Seal.png|thumb|right|Seal of Leiden University, whose Mathematical Institute organized ABC@home]]
The roots of ABC@home lie in the Intercity Number Theory Seminar held in Leiden in September 2005, where researchers including [[wikipedia:Hendrik Lenstra|Hendrik Lenstra]] discussed algorithms for enumerating abc-triples.<ref name="icseminar">{{Cite web|title=Intercity Number Theory Seminar|url=http://pub.math.leidenuniv.nl/~brightmj/ic/20050909.html|website=Universiteit Leiden|access-date=2026-07-18}}</ref> In 2006, the Mathematical Institute launched a public science outreach initiative called "Reken mee met ABC" ("Count along with ABC"), which combined public education about the abc conjecture with a distributed computing search for triples. The project and its educational aims were described by Bart de Smit and Gillien Geuze in a 2007 article for ''Nieuw Archief voor Wiskunde''.<ref name="geuze2007">{{Cite journal|last=Geuze|first=Gillien|last2=de Smit|first2=Bart|title=Reken mee met ABC|journal=Nieuw Archief voor Wiskunde|series=5th series|volume=8|issue=1|year=2007|pages=26–30|url=http://www.nieuwarchief.nl/serie5/pdf/naw5-2007-08-1-026.pdf}}</ref>

The distributed computing side of the project was launched as ABC@home on the BOINC platform, allowing volunteers to donate spare CPU time toward searching for abc-triples below successively larger bounds.<ref name="wikipedia" /> By March 2011, the project had more than 7,300 active participants from 114 countries, with a combined [[wikipedia:BOINC Credit System|BOINC credit]] total exceeding 2.9 billion and an aggregate throughput of roughly 10 teraflops.<ref name="statsarchive">{{Cite web|title=Detailed user, host, team and country statistics with graphs for BOINC|url=https://web.archive.org/web/20101120150315/http://boincstats.com/stats/project_graph.php?pr=abc_main|website=BOINCstats|archive-url=https://web.archive.org/web/20101120150315/http://boincstats.com/stats/project_graph.php?pr=abc_main|archive-date=2010-11-20|access-date=2026-07-18}}</ref>

In 2011, the project reached a major milestone: it completed an exhaustive search finding all abc-triples <math>(a,b,c)</math> with <math>c < 10^{18}</math>, a total of 14,482,065 triples.<ref name="palenstijn2023" /> The project continued searching for larger triples with <math>10^{18} \le c < 2^{63}</math> from 2012 to 2015, though this later phase was not exhaustive. By the time it ceased operations in 2015, ABC@home had found a total of 23,827,716 abc-triples.<ref name="palenstijn2023" /><ref name="desmit">{{Cite web|last=de Smit|first=Bart|title=ABC Triples|url=https://www.math.leidenuniv.nl/~desmit/abc/index.php?set=1|website=Universiteit Leiden|access-date=2026-07-18}}</ref>

== Data and results ==
The full lists of triples found by ABC@home, along with derived lists of high-quality and unbeaten triples, were made available by Bart de Smit on a Leiden University web page.<ref name="desmit" /> The description and analysis of the search algorithm, along with observations about the resulting list of triples, form the final chapter of Willem Jan Palenstijn's 2014 PhD thesis, ''Radicals in Arithmetic''.<ref name="palenstijnthesis">{{Cite web|last=Palenstijn|first=Willem Jan|title=Radicals in Arithmetic|url=https://hdl.handle.net/1887/25833|website=Leiden University Scholarly Publications|type=PhD thesis|publisher=Universiteit Leiden|date=2014-05-22|access-date=2026-07-18}}</ref> The implementation of the BOINC client-side search application was separately addressed in a bachelor thesis by Thijs van Dijk in 2011.<ref name="desmit" />

The abc-triple with the highest known quality, <math>(2,\, 3^{10} \cdot 109,\, 23^5)</math>, has a quality of approximately 1.6299 and remains one of the most frequently cited examples in the literature on the conjecture.<ref name="alvarez2023-full" />

== Related projects ==
A separate, unrelated project called '''ABC Lattices@Home''' also searched for abc-triples using BOINC, but took a different approach: rather than an exhaustive search of a numerical range, it used a specialized lattice-based algorithm and educated guesses to look for good triples beyond <math>2^{100}</math>.<ref name="lattices">{{Cite web|title=ABC LATTICES@HOME|url=https://forum.boinc-australia.net/index.php?board=176.0|website=BOINC-Australia Forum|access-date=2026-07-18}}</ref>

== Publications ==

=== Papers based on ABC@home data ===
* {{Cite journal|last=Martin|first=Greg|last2=Miao|first2=Winnie|title=abc triples|journal=Functiones et Approximatio Commentarii Mathematici|volume=55|issue=2|year=2016|pages=145–176|arxiv=1409.2974}} A catalog of known abc-triples, both computational examples and theoretically constructed infinite families, together with a survey of the heuristics, refinements, and progress on the abc conjecture. [https://arxiv.org/abs/1409.2974 arXiv:1409.2974]
* {{Cite journal|last=Alvarez-Salazar|first=Elise|last2=Barrios|first2=Alexander J.|last3=Henaku|first3=Calvin|last4=Soller|first4=Summer|title=On abc triples of the form (1, c − 1, c)|journal=arXiv preprint|year=2023|arxiv=2301.01376}} Proves general results for constructing infinite families of abc-triples of the form <math>(1, c-1, c)</math>, and applies them to a direct statistical analysis of the 45,604 such triples with <math>c < 10^{18}</math> found by ABC@home.

=== Project documentation ===
* {{Cite web|last=Palenstijn|first=Willem Jan|title=Radicals in Arithmetic|url=https://hdl.handle.net/1887/25833|website=Leiden University Scholarly Publications|type=PhD thesis|publisher=Universiteit Leiden|date=2014-05-22|access-date=2026-07-18}} Chapter 5 describes the algorithm used by ABC@home to enumerate abc-triples and reports results from the project.
* {{Cite journal|last=Geuze|first=Gillien|last2=de Smit|first2=Bart|title=Reken mee met ABC|journal=Nieuw Archief voor Wiskunde|series=5th series|volume=8|issue=1|year=2007|pages=26–30|url=http://www.nieuwarchief.nl/serie5/pdf/naw5-2007-08-1-026.pdf}} Describes the founding and educational goals of the Reken mee met ABC project, of which ABC@home was the computational component.

== See also ==
* [[SRBase]]
* [[RakeSearch]]
* [[NumberFields@Home]]
* [[Ramanujan Machine]]

== References ==
{{Reflist}}

[[Category:Completed BOINC projects]]
[[Category:Mathematics BOINC projects]]

File:Abclogo.jpg

Al Piskun — Sat, 18 Jul 2026 13:41:28 GMT

Al Piskun uploaded File:Abclogo.jpg ABC@home logo

New page

== Summary ==
ABC@home logo

Main Page

Al Piskun — Sat, 18 Jul 2026 12:32:42 GMT

move SiDock

← Older revision		Revision as of 12:32, 18 July 2026
(One intermediate revision by the same user not shown)
Line 106:		Line 106:
	\|-		\|-
	\| * [[Rosetta@home]] protein structure prediction		\| * [[Rosetta@home]] protein structure prediction
	\|		\|* [[SiDock@home]] drug candidate screening
	\|}		\|}
	</div>		</div>
Line 133:		Line 133:
	\|-		\|-
	\| * [[Rakesearch]] Latin square searches		\| * [[Rakesearch]] Latin square searches
	\| * [[SPT]] Symmetric Prime Tuples		\|
	\|}		\|}
	</div>		</div>
Line 211:		Line 211:
	\|-		\|-
	\| * [[DENIS@home]] cardiac electrophysiology research, currently paused		\| * [[DENIS@home]] cardiac electrophysiology research, currently paused
	\|* [[SiDock@home]] drug candidate screening		\|
	\|}		\|}
	<div class="bs-group-footer">''See the [[BOINC projects\|master BOINC projects table]] for the most current status of all projects.''</div>		<div class="bs-group-footer">''See the [[BOINC projects\|master BOINC projects table]] for the most current status of all projects.''</div>
Line 281:		Line 281:
	\|* [[Spinhenge@home]] simulating spin dynamics in nanoscale molecular magnets		\|* [[Spinhenge@home]] simulating spin dynamics in nanoscale molecular magnets
	\|* [[SZTAKI Desktop Grid]] MTA SZTAKI in Budapest, running mathematics, physics, and digital humanities applications		\|* [[SZTAKI Desktop Grid]] MTA SZTAKI in Budapest, running mathematics, physics, and digital humanities applications
			\|-
			\|* [[SPT]] Symmetric Prime Tuples
			\|
	\|-		\|-
	\|* [[TANPAKU]] used a Brownian dynamics method to study protein folding		\|* [[TANPAKU]] used a Brownian dynamics method to study protein folding

BOINC projects

Al Piskun — Sat, 18 Jul 2026 12:26:26 GMT

add μFluids@Home and DepSpid See more...

← Older revision		Revision as of 12:26, 18 July 2026
Line 1,167:		Line 1,167:
	\|		\|
	\|		\|
	\| 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.		\| 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. [[DepSpid\|See more...]]

	\|-		\|-
Line 1,770:		Line 1,770:

	\|-		\|-
	\| [https://web.archive.org/web/20060702175205/http://www.ufluids.net/ μFluids]		\| [https://web.archive.org/web/20060702175205/http://www.ufluids.net/ μFluids@Home]
	\| [https://boinc.berkeley.edu/wiki/Publications_by_BOINC_projects#.C2.B5Fluids.40Home 3]		\| [https://boinc.berkeley.edu/wiki/Publications_by_BOINC_projects#.C2.B5Fluids.40Home 3]
	\| 2005-09-19		\| 2005-09-19
Line 1,780:		Line 1,780:
	\|		\|
	\|		\|
	\| Study fluid behavior in microgravity to design satellite propellant management devices.		\| Study fluid behavior in microgravity to design satellite propellant management devices. [[UFluids@Home\|See more...]]

	\|-		\|-

Main Page

Al Piskun — Sat, 18 Jul 2026 12:15:42 GMT

add UFluids@Home and DepSpid

← Older revision		Revision as of 12:15, 18 July 2026
Line 27:		Line 27:
	</div>		</div>
	<div class="bs-stat bs-stat-purple">		<div class="bs-stat bs-stat-purple">
	<div class="bs-stat-number">79</div>		<div class="bs-stat-number">81</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 244:		Line 244:
	\|-		\|-
	\| * [[Data freezer]] long-term data archival research		\| * [[Data freezer]] long-term data archival research
	\| * [[~~Docking@Home~~]] ~~CHARMM-based protein-ligand docking simulations to search for new pharmaceutical drugs~~		\| * [[DepSpid]] build a database of dependency relationships between web servers and domain
	\|-		\|-
			\|* [[Docking@Home]] CHARMM-based protein-ligand docking simulations to search for new pharmaceutical drugs
	\|* [[Enigma@Home]] break unsolved German Kriegsmarine Enigma M4 radio messages from the Second World War		\|* [[Enigma@Home]] break unsolved German Kriegsmarine Enigma M4 radio messages from the Second World War
	\|
	\|-		\|-
	\|* [[GoofyxGrid@Home NCI]] non-covalent interaction analysis		\|* [[GoofyxGrid@Home NCI]] non-covalent interaction analysis
Line 289:		Line 289:
	\|-		\|-
	\|* [[MLC@Home]] understanding and interpreting complex machine learning models		\|* [[MLC@Home]] understanding and interpreting complex machine learning models
	\|		\|* [[Universe@Home]] stellar evolution modelling
	\|-		\|-
	~~\| * [[Universe@Home]] stellar evolution modelling~~
	\| * [[WEP-M+2 Project]] mersenne-related prime search		\| * [[WEP-M+2 Project]] mersenne-related prime search
			\| * [[uFluids@Home]] support research into satellite propellant management and lab-on-a-chip devices
	\|}		\|}
	<div class="bs-group-footer">''See the [[BOINC projects\|master BOINC projects table]] for definitive active/inactive status on all documented projects.''</div>		<div class="bs-group-footer">''See the [[BOINC projects\|master BOINC projects table]] for definitive active/inactive status on all documented projects.''</div>

File:Fluids.gif

Admin — Sat, 18 Jul 2026 11:41:57 GMT

Admin deleted page File:Fluids.gif content was: "== Summary == μFluids@Home logo", and the only contributor was "Al Piskun" (talk)

UFluids@Home

Al Piskun — Sat, 18 Jul 2026 11:40:32 GMT

add archive link

← Older revision		Revision as of 11:40, 18 July 2026
Line 37:		Line 37:
	{{Lowercase title}}		{{Lowercase title}}

	'''μFluids@Home''' (also written '''uFluids@Home''') was a [[wikipedia:Volunteer computing\|volunteer computing]] project built on the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|BOINC]] platform, operated by [[wikipedia:Purdue University\|Purdue University]]'s School of Aeronautics and Astronautics. The project used the [[wikipedia:Surface Evolver\|Surface Evolver]] program, a finite-element package for modeling surfaces shaped by [[wikipedia:Surface tension\|surface tension]], to simulate [[wikipedia:Two-phase flow\|two-phase flow]] behavior in [[wikipedia:Microgravity\|microgravity]] and [[wikipedia:Microfluidics\|microfluidics]] problems.<ref name="wp">{{Cite web\|url=https://en.wikipedia.org/wiki/UFluids@Home\|title=UFluids@Home\|website=Wikipedia\|access-date=2026-07-18}}</ref><ref name="official">{{Cite web\|url=http://www.ufluids.net/\|title=What is μFluids?\|website=ufluids.net\|publisher=Purdue University\|access-date=2026-07-18}}</ref>		'''[https://web.archive.org/web/20120722101023/http://www.ufluids.net/ μFluids@Home]''' (also written '''uFluids@Home''') was a [[wikipedia:Volunteer computing\|volunteer computing]] project built on the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|BOINC]] platform, operated by [[wikipedia:Purdue University\|Purdue University]]'s School of Aeronautics and Astronautics. The project used the [[wikipedia:Surface Evolver\|Surface Evolver]] program, a finite-element package for modeling surfaces shaped by [[wikipedia:Surface tension\|surface tension]], to simulate [[wikipedia:Two-phase flow\|two-phase flow]] behavior in [[wikipedia:Microgravity\|microgravity]] and [[wikipedia:Microfluidics\|microfluidics]] problems.<ref name="wp">{{Cite web\|url=https://en.wikipedia.org/wiki/UFluids@Home\|title=UFluids@Home\|website=Wikipedia\|access-date=2026-07-18}}</ref><ref name="official">{{Cite web\|url=http://www.ufluids.net/\|title=What is μFluids?\|website=ufluids.net\|publisher=Purdue University\|access-date=2026-07-18}}</ref>

	[[File:Neil Armstrong Hall of Engineering Purdue University 2016 04.jpg\|thumb\|The Neil Armstrong Hall of Engineering at Purdue University, home to the School of Aeronautics and Astronautics.]]		[[File:Neil Armstrong Hall of Engineering Purdue University 2016 04.jpg\|thumb\|The Neil Armstrong Hall of Engineering at Purdue University, home to the School of Aeronautics and Astronautics.]]

UFluids@Home

Al Piskun — Sat, 18 Jul 2026 11:39:21 GMT

first light

New page

{{Infobox software
| name = μFluids@Home
| logo = Ufluids.jpg
| logo caption =
| screenshot =
| caption =
| description = μFluids@Home was a completed BOINC volunteer computing project run by Purdue University's School of Aeronautics and Astronautics, using the Surface Evolver program to simulate two-phase fluid behavior in microgravity and microfluidics, in support of research into satellite propellant management and lab-on-a-chip devices.
| status = Completed
| category = Engineering
| compute = CPU
| dependencies = None
| developer = Steven H. Collicott
| author = Steven H. Collicott
| sponsor = [[wikipedia:Purdue University|Purdue University]] School of Aeronautics and Astronautics
| maintainer = μFluids@Home team (inactive)
| released = {{Start date and age|2005|09|19}}
| completed =
| discontinued = {{Start date and age|2012|07|22}}
| repository =
| programming language =
| operating system = Cross-platform (Windows, Linux, macOS)
| size = ~500 kB per work unit
| stats as of = {{Start date and age|2011|06|29}}
| average performance =
| active users =
| total users =
| active hosts = 2340
| total hosts =
| rac =
| credit per day =
| gpu performance =
| cpu performance =
| website = {{URL|http://www.ufluids.net/}}
| license = Unknown
}}

{{Lowercase title}}

'''μFluids@Home''' (also written '''uFluids@Home''') was a [[wikipedia:Volunteer computing|volunteer computing]] project built on the [[wikipedia:Berkeley Open Infrastructure for Network Computing|BOINC]] platform, operated by [[wikipedia:Purdue University|Purdue University]]'s School of Aeronautics and Astronautics. The project used the [[wikipedia:Surface Evolver|Surface Evolver]] program, a finite-element package for modeling surfaces shaped by [[wikipedia:Surface tension|surface tension]], to simulate [[wikipedia:Two-phase flow|two-phase flow]] behavior in [[wikipedia:Microgravity|microgravity]] and [[wikipedia:Microfluidics|microfluidics]] problems.<ref name="wp">{{Cite web|url=https://en.wikipedia.org/wiki/UFluids@Home|title=UFluids@Home|website=Wikipedia|access-date=2026-07-18}}</ref><ref name="official">{{Cite web|url=http://www.ufluids.net/|title=What is μFluids?|website=ufluids.net|publisher=Purdue University|access-date=2026-07-18}}</ref>

[[File:Neil Armstrong Hall of Engineering Purdue University 2016 04.jpg|thumb|The Neil Armstrong Hall of Engineering at Purdue University, home to the School of Aeronautics and Astronautics.]]

== Overview ==
According to the project's own description, μFluids was <nowiki>"</nowiki>a massively distributed computer simulation of two-phase fluid behavior in microgravity and microfluidics problems.<nowiki>"</nowiki> Its stated goal was to design better satellite propellant management devices and to address two-phase flow in microchannel and [[wikipedia:Microelectromechanical systems|MEMS]] devices.<ref name="official" /> Volunteers contributed idle CPU time on their home computers to run the Surface Evolver simulations that underpinned this research.<ref name="official" />

The project's purpose, as summarized by Wikipedia, was to develop better methods for managing [[wikipedia:Liquid rocket propellant|liquid rocket propellants]] in microgravity, and to investigate two-phase flow in MEMS devices, taking into account factors such as surface tension.<ref name="wp" /> Systems using [[wikipedia:Electrowetting|electrowetting]], channel [[wikipedia:Geometry|geometry]], and [[wikipedia:Hydrophobe|hydrophobic]] or [[wikipedia:Hydrophile|hydrophilic]] coatings to allow the smooth passage of fluids could then be designed, with potential applications in compact [[wikipedia:Medical device|medical devices]], [[wikipedia:Biosensor|biosensors]], and [[wikipedia:Fuel cell|fuel cells]].<ref name="wp" />

== History ==
μFluids@Home was developed at Purdue University under [[Steven H. Collicott|Professor Steven H. Collicott]] of the School of Aeronautics and Astronautics. Collicott's research group specializes in the use of the Surface Evolver code for capillary fluid statics problems, work that traces back to support for the Gravity Probe-B satellite beginning in 1993.<ref name="collicott-profile">{{Cite web|url=https://engineering.purdue.edu/AAE/people/ptProfile?resource_id=1370|title=Steven Collicott|website=Our People, School of Aeronautics and Astronautics|publisher=Purdue University|access-date=2026-07-18}}</ref>

[[wikipedia:Wikidata|Wikidata]] records the project's inception as 19 September 2005.<ref name="wikidata">{{Cite web|url=https://www.wikidata.org/wiki/Q3266554|title=μFluids@Home|website=Wikidata|access-date=2026-07-18}}</ref> Community discussion of the project on BOINC-oriented forums is documented from at least 2007, when the project was still described as being in a testing phase with no [[wikipedia:XML|XML]] statistics feed yet available.<ref name="mundayweb">{{Cite web|url=https://mundayweb.com/forum/viewtopic.php?p=457|title=uFluids@Home|website=MundayWeb.com forum|access-date=2026-07-18}}</ref> Volunteers continued to join BOINC teams for μFluids into 2011.<ref name="setiusa">{{Cite web|url=https://www.setiusa.us/showthread.php?518-Welcome-New-members-For-January-2011!/page4&p=6268|title=Welcome New members For January 2011!|website=SETI.USA Forums|access-date=2026-07-18}}</ref>

The project's official domain, ufluids.net, was still being referenced in project listings as late as 2012.<ref name="handwiki">{{Cite web|url=https://handwiki.org/wiki/List_of_distributed_computing_projects|title=List of distributed computing projects|website=HandWiki|access-date=2026-07-18}}</ref> No BOINC work distribution has been documented since. As of 2026 the domain still resolves and serves a static description page, but its backing database is offline, returning a MySQL connection error rather than live project statistics.<ref name="official" /> No archived RAC, host count, or user count statistics for μFluids appear to have survived on third-party BOINC statistics aggregators, and the project's precise shutdown date does not appear to have been formally documented.

== Research goals ==
Purdue's aerospace engineering program, through Professor Collicott's group, has long focused on [[wikipedia:Capillary action|capillary]] effects in weightless environments, including designing propellant gauging and management systems for satellites.<ref name="purdue-satellite">{{Cite web|url=http://news.uns.purdue.edu/x/2007b/070905CollicottSatellites.html|archive-url=https://web.archive.org/web/20110615122243/http://news.uns.purdue.edu/x/2007b/070905CollicottSatellites.html|archive-date=2011-06-15|title=Engineers rescue aging satellites, saving millions|website=Purdue News|date=2007-09-05|access-date=2026-07-18}}</ref> Related Purdue research covered by the university's news service examined fuel injection behavior in rocket engines,<ref name="purdue-rocket">{{Cite web|url=http://news.uns.purdue.edu/insidepurdue/2009/090716_ResearchCollicott.html|archive-url=https://web.archive.org/web/20110615122836/http://news.uns.purdue.edu/insidepurdue/2009/090716_ResearchCollicott.html|archive-date=2011-06-15|title=Research focuses on fuel injection in rockets|website=Purdue News|date=2009-07-16|access-date=2026-07-18}}</ref> and lower-cost approaches to lab-on-a-chip device fabrication.<ref name="purdue-labchip">{{Cite web|url=http://news.uns.purdue.edu/x/2009a/090421WereleyChips.html|archive-url=https://web.archive.org/web/20110615122410/http://news.uns.purdue.edu/x/2009a/090421WereleyChips.html|archive-date=2011-06-15|title=Innovation could make lab-on-a-chip devices easier to use, cheaper to make|website=Purdue News|date=2009-04-21|access-date=2026-07-18}}</ref>

These themes, propellant management, MEMS two-phase flow, and low-cost microfluidic devices, map directly onto the stated goals of the μFluids@Home project.<ref name="wp" /><ref name="official" />

A central physical relationship in this class of problem is the [[wikipedia:Young–Laplace equation|Young-Laplace equation]], which relates the pressure difference across a curved liquid interface to its surface tension and curvature:

<math>\Delta p = \gamma \left( \frac{1}{R_1} + \frac{1}{R_2} \right)</math>

where <math>\Delta p</math> is the pressure difference across the interface, <math>\gamma</math> is the surface tension, and <math>R_1</math> and <math>R_2</math> are the principal radii of curvature of the surface. In microgravity, where body forces on a fluid are negligible, this capillary pressure term dominates fluid shape and behavior, which is precisely the regime the Surface Evolver software is designed to model.<ref name="se-wp">{{Cite web|url=https://en.wikipedia.org/wiki/Surface_Evolver|title=Surface Evolver|website=Wikipedia|access-date=2026-07-18}}</ref>

[[File:KC-135A NASA (16783001558).jpg|thumb|A NASA KC-135 reduced-gravity aircraft. Parabolic flights of this kind have historically been used by Purdue aerospace researchers to test low-gravity fluid behavior experimentally.]]

== Software and technology ==
μFluids@Home distributed [[wikipedia:Surface Evolver|Surface Evolver]] simulation runs to volunteers' computers via the standard BOINC client. [[wikipedia:Surface Evolver|Surface Evolver]] itself is an interactive finite-element program, originally written by Kenneth Brakke at [[wikipedia:The Geometry Center|The Geometry Center]] with support from the [[wikipedia:National Science Foundation|National Science Foundation]], that represents a surface as a union of triangular facets and evolves it toward minimal energy by a [[wikipedia:Gradient descent|gradient descent]] method.<ref name="se-wp" />

Per the project's own application notes, μFluids had no BOINC screensaver component. Individual work unit CPU times were generally less than 20 hours, and work units averaged around 500 kB in size. Because of the relatively small and infrequent nature of the work units compared to higher-profile projects, volunteers were advised that many work units would be needed to accumulate credit comparable to projects such as [[SETI@home]] or [[wikipedia:Climateprediction.net|climateprediction.net]].<ref name="wp" />

== Community ==
μFluids attracted small dedicated crunching teams on general-purpose BOINC community sites. The Australian technology community Whirlpool maintained a team page and statistics link for μFluids@Home participants,<ref name="whirlpool">{{Cite web|url=https://whirlpool.net.au/wiki/ufluids|title=uFluids@home - BOINC Project|website=Whirlpool Wiki|access-date=2026-07-18}}</ref> and the project was tracked on the SETI.USA forums, where new volunteers reported joining μFluids alongside other contemporary BOINC projects into 2011.<ref name="setiusa" />

== Publications ==
The following papers, authored by researchers associated with Professor Collicott's group at Purdue, cover the capillary fluids and two-phase flow problems that μFluids@Home was built to help investigate:

# Manning, Robert and Steven Collicott. "[https://arc.aiaa.org/doi/10.2514/6.2010-1476 Liquid Plugs in Rectangular Channels Under a Transverse Gravity Field]". ''48th AIAA Aerospace Sciences Meeting Including the New Horizons Forum and Aerospace Exposition'' (2010). DOI 10.2514/6.2010-1476.
# Braun, Jonathan and Steven Collicott. "[https://arc.aiaa.org/doi/10.2514/6.2006-732 Zero-Gravity Stability of Droplets in a Bent Circular Cylinder]". ''44th AIAA Aerospace Sciences Meeting and Exhibit'' (2006). DOI 10.2514/6.2006-732.
# Manning, Robert and Steven Collicott. "[https://arc.aiaa.org/doi/10.2514/6.2006-736 Bubble Penetration Through a Single Layer Sphere Bed]". ''44th AIAA Aerospace Sciences Meeting and Exhibit'' (2006). DOI 10.2514/6.2006-736.

[[File:Surface Tension 01.jpg|thumb|Surface tension shapes a liquid interface, the same physics that Surface Evolver models numerically and that μFluids@Home computed at scale.]]

== See also ==
* [[wikipedia:BOINC|BOINC]]
* [[SETI@home]]
* [[wikipedia:Surface Evolver|Surface Evolver]]
* [[wikipedia:Purdue University|Purdue University]]

== References ==
{{Reflist}}

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:Purdue University]]

File:Ufluids.jpg

Al Piskun — Sat, 18 Jul 2026 11:38:08 GMT

Al Piskun uploaded File:Ufluids.jpg uFluids@Home logo

New page

== Summary ==
uFluids@Home logo

File:Fluids.gif

Al Piskun — Sat, 18 Jul 2026 11:30:54 GMT

Al Piskun uploaded File:Fluids.gif μFluids@Home logo

New page