BOINC Projects - Recent changes [en]

EDGeS@Home

Al Piskun — Sun, 16 Aug 2026 16:05:44 GMT

first light

New page

{{Infobox software
| name = EDGeS@Home
| logo = EDGeS logo.png
| logo caption = EDGeS@Home project logo
| screenshot = EDGeS@Home screenshot.png
| caption = EDGeS@Home project homepage (archived)
| description = EDGeS@Home was a completed BOINC-based volunteer computing project that bridged desktop grids and service grids to support scientific applications, primarily the ISDEP plasma fusion simulation code, developed by MTA SZTAKI and sponsored by the European Union Seventh Framework Programme.

| status = Completed
| category = Plasma physics, Grid computing
| compute = CPU
| dependencies = BOINC client

| developer = MTA SZTAKI Laboratory of Parallel and Distributed Systems
| author = Péter Kacsuk, Zoltán Farkas
| sponsor = European Union FP7 (grant 211727); DEGISCO (grant 261556)
| maintainer = EDGeS team
| released = {{Start date and age|2009|10|28}}
| completed = May 2011 (ISDEP phase)
| discontinued = ca. 2015
| repository =

| programming language = C
| operating system = Windows, Linux, macOS
| size = ~70 MB (ISDEP application)

| stats as of = {{Start date and age|2015|11|28}}
| average performance = 1.35 GFLOPS
| active users = 0
| total users = 11486
| active hosts = 0
| total hosts = 32308

| rac = 0
| credit per day = 0
| gpu performance =
| cpu performance = 1.35 GFLOPS

| website = {{URL|http://home.edges-grid.eu/home/}}
| license =
}}

'''EDGeS@Home''' ('''E'''nabling '''D'''esktop '''G'''rids for '''e'''-'''S'''cience) was a [[wikipedia:BOINC|BOINC]]-based [[wikipedia:Volunteer computing|volunteer computing]] project that aimed to bridge desktop grid (DG) and service grid (SG) infrastructures, enabling the execution of scientific applications developed by the [[wikipedia:EGEE|EGEE]] and EDGeS community on volunteer-contributed computing resources.<ref name="edgeshome">{{cite web |url=https://web.archive.org/web/20120329124047/http://home.edges-grid.eu/home/ |title=EDGeS@Home |publisher=EDGeS |accessdate=2026-08-16 |via=Wayback Machine}}</ref> The project was coordinated by the [[wikipedia:SZTAKI|MTA SZTAKI]] Laboratory of Parallel and Distributed Systems in Hungary and was part of the broader EDGeS [[wikipedia:European Union|European Union]] [[wikipedia:Seventh Framework Programme|Seventh Framework Programme]] (FP7) project.<ref name="boincwiki">{{cite web |url=https://boinc.berkeley.edu/wiki/EDGeS@Home |title=EDGeS@Home |publisher=BOINC |accessdate=2026-08-16}}</ref>

The project's primary production-level application was '''ISDEP''' (Integrator of Stochastic Differential Equations for Plasmas), a [[wikipedia:Monte Carlo method|Monte Carlo]] code that simulates [[wikipedia:Ion|ion]] transport in magnetized plasmas for [[wikipedia:Fusion power|fusion energy]] research.<ref name="velasco2012">{{cite journal |last1=Velasco |first1=J.L. |last2=Bustos |first2=A. |last3=Castejón |first3=F. |last4=Fernández |first4=L.A. |last5=Martin-Mayor |first5=V. |last6=Tarancón |first6=A. |title=ISDEP: Integrator of stochastic differential equations for plasmas |journal=Computer Physics Communications |volume=183 |issue=9 |pages=1877–1883 |year=2012 |doi=10.1016/j.cpc.2012.04.004}}</ref> EDGeS@Home also hosted several other applications at the beta (experimental) level.<ref name="edgeshome" />

== History ==

The EDGeS (Enabling Desktop Grids for e-Science) project was an [[wikipedia:European Union|European Union]] FP7 infrastructure project (grant agreement no. 211727) that ran from 2008 to 2010, with the goal of building technological bridges to facilitate [[wikipedia:Interoperability|interoperability]] between desktop grids and service grids.<ref name="urbah2009">{{cite journal |last1=Urbah |first1=E. |last2=Kacsuk |first2=P. |last3=Farkas |first3=Z. |display-authors=etal |title=EDGeS: Bridging EGEE to BOINC and XtremWeb |journal=Journal of Grid Computing |volume=7 |pages=335–354 |year=2009 |doi=10.1007/s10723-009-9137-0}}</ref> The EDGeS@Home BOINC project was launched on '''28 October 2009''' as the volunteer computing component of this infrastructure.<ref name="boincwiki" />

[[File:TJ-II model including plasma, coils and vacuum vessel.jpg|thumb|The [[wikipedia:TJ-II|TJ-II]] [[wikipedia:Stellarator|stellarator]] at [[wikipedia:CIEMAT|CIEMAT]], Madrid, the primary fusion device studied using ISDEP on EDGeS@Home.|alt=The TJ-II stellarator device]]

The EDGeS@Home desktop grid and its applications were partly supported by the follow-on '''DEGISCO''' project (Desktop Grid Initiatives for Scientific Collaboration), funded under EU FP7 grant agreement no. 261556.<ref name="edgeshome" /> The experts of the '''International Desktop Grid Federation''' (IDGF) provided further support for the EDGeS@Home infrastructure, its applications, and its integration into the DEGISCO infrastructure.<ref name="edgeshome" />

A server upgrade was performed in April 2011, after which the project continued operating.<ref name="edgeshome" /> The ISDEP computation phase was completed on '''21 May 2011'''.<ref name="boincruforum">{{cite web |url=https://boinc.ru/forum/topic/proekt-edgeshome-on-zhe-ibercivis/ |title=EDGeS@Home |publisher=BOINC.RU |accessdate=2026-08-16 |language=Russian}}</ref> After the ISDEP phase ended, the project briefly hosted an [[wikipedia:AutoDock|AutoDock]] application for [[wikipedia:Molecular docking|molecular docking]] computations at the beta level.<ref name="boincruforum" /> The project became inactive by approximately 2015, with the last statistics export occurring on 28 November 2015.<ref name="boincstats">{{cite web |url=https://www.boincstats.com/stats/89/project/detail |title=EDGeS@Home – Detailed stats |publisher=BOINCstats |accessdate=2026-08-16}}</ref>

== Scientific objectives ==

The aim of the EDGeS@Home project was to support the execution of selected and validated scientific applications developed by the EGEE and EDGeS community on [[wikipedia:Volunteer computing|volunteer computing]] resources.<ref name="edgeshome" /> The project served as a practical demonstration of the EDGeS bridging technology, which connected [[wikipedia:BOINC|BOINC]]-based and XtremWeb-based desktop grids with the EGEE service grid infrastructure, creating a seamless pool of over 250,000 processors from desktop grids combined with approximately 150,000 processors from service grids.<ref name="degisco">{{cite web |url=https://sztaki.hu/en/projects/degisco |title=DEGISCO |publisher=MTA SZTAKI |accessdate=2026-08-16}}</ref>

=== ISDEP ===

[[File:EDGeS Bridge diagram.jpg|thumb|The EDGeS 3G Bridge architecture connecting BOINC desktop grids with the EGEE service grid, enabling bidirectional job execution.|alt=EDGeS 3G Bridge architecture diagram]]

The principal application hosted on EDGeS@Home was '''ISDEP''' (Integrator of Stochastic Differential Equations for Plasmas), a Monte Carlo code developed under the collaboration between the '''National Fusion Laboratory''' at [[wikipedia:CIEMAT|CIEMAT]] (Madrid), the '''Institute of Biocomputation and Physics of Complex Systems''' (BIFI) at the [[wikipedia:University of Zaragoza|University of Zaragoza]], and the [[wikipedia:Complutense University of Madrid|Complutense University of Madrid]].<ref name="velasco2012" />

ISDEP solves the dynamics of a minority population of ions in a complex 3D fusion device, computing the [[wikipedia:Distribution function|distribution function]] by numerically integrating the [[wikipedia:Langevin equation|Langevin equation]]s equivalent to the [[wikipedia:Fokker–Planck equation|Fokker–Planck equation]].<ref name="velasco2012" /> The code takes into account:

* The full three-dimensional structure of fusion devices, avoiding common approximations such as Boozer coordinates and the neoclassical ordering
* The confining [[wikipedia:Electromagnetic field|electromagnetic field]]
* [[wikipedia:Collision|Collision]]s with other [[wikipedia:Plasma (physics)|plasma]] species (ions and electrons) using the Boozer–Kuo-Petravic collision operator
* The [[wikipedia:Electric potential|electrostatic potential]]

The Monte Carlo method used by ISDEP is based on the equivalence between the [[wikipedia:Fokker–Planck equation|Fokker–Planck]] and [[wikipedia:Langevin equation|Langevin equation]]s, which allows the code to run on [[wikipedia:Distributed computing|distributed computing]] platforms without [[wikipedia:Inter-process communication|communication between nodes]], achieving near-linear scaling.<ref name="velasco2012" /> Each computing node integrates one or more ion trajectories independently, with statistical independence guaranteed by reading the [[wikipedia:Random seed|random seed]] locally.<ref name="velasco2012" />

The primary fusion device studied with ISDEP on EDGeS@Home was the [[wikipedia:TJ-II|TJ-II]] [[wikipedia:Stellarator|stellarator]] at CIEMAT.<ref name="castejon2007">{{cite journal |last1=Castejón |first1=F. |last2=Fernández |first2=L.A. |last3=Guasp |first3=J. |last4=Martin-Mayor |first4=V. |last5=Tarancón |first5=A. |last6=Velasco |first6=J.L. |title=Ion kinetic transport in the presence of collisions and electric field in TJ-II ECRH plasmas |journal=Plasma Physics and Controlled Fusion |volume=49 |issue=6 |pages=753 |year=2007 |doi=10.1088/0741-3335/49/6/006}}</ref> ISDEP was also applied to study ion transport in [[wikipedia:ITER|ITER]]<ref name="bustos2010">{{cite journal |last1=Bustos |first1=A. |last2=Castejón |first2=F. |last3=Fernández |first3=L.A. |display-authors=etal |title=Impact of 3D features on ion collisional transport in ITER |journal=Nuclear Fusion |volume=50 |issue=12 |pages=125007 |year=2010 |doi=10.1088/0029-5515/50/12/125007}}</ref> and the [[wikipedia:Large Helical Device|Large Helical Device]] (LHD) stellarator.<ref name="velasco2012" />

ISDEP was programmed in [[wikipedia:C (programming language)|C]] to maximize performance and portability, and was designed from the outset to run on [[wikipedia:Grid computing|grid computing]] and volunteer computing platforms.<ref name="velasco2012" /> The application download size was approximately 70 MB, with input data per workunit of 212 bytes and output data of 500–700 KB.<ref name="ruwiki">{{cite web |url=https://ru.wikipedia.org/wiki/EDGeS@Home |title=EDGeS@Home |publisher=Wikipedia |accessdate=2026-08-16 |language=Russian}}</ref>

=== Other applications ===

In addition to ISDEP at production level, EDGeS@Home hosted several other applications at the beta (experimental) level:<ref name="edgeshome" />

* '''AutoDock''' – a [[wikipedia:Molecular docking|molecular docking]] application used in [[wikipedia:Biomedicine|biomedical]] research, which became the sole active application after the ISDEP phase ended in May 2011<ref name="boincruforum" />
* Applications from the broader EDGeS infrastructure, including those bridged from EGEE service grids via the 3G Bridge technology

The ISDEP application was also available through the Spanish volunteer computing project [[wikipedia:Ibercivis|Ibercivis]] and its predecessor ZIVIS (Zaragoza Institutional Volunteer Computing for Investigative Science), a city-wide computing platform deployed in [[wikipedia:Zaragoza|Zaragoza]], Spain.<ref name="zivis">{{cite conference |last1=Antolí |first1=B. |last2=Castejón |first2=F. |last3=Giner |first3=A. |display-authors=etal |title=ZIVIS: A City Computing Platform Based on Volunteer Computing |year=2007 |booktitle=International Conference on e-Science and Grid Computing}}</ref>

== Bridging technology ==

The core technical contribution of the EDGeS project was the development of '''3G Bridge''' (Generic Grid-to-Grid Bridge), a middleware-independent framework that enabled [[wikipedia:Interoperability|interoperability]] between desktop grids and service grids.<ref name="urbah2009" /> The bridge operated in two directions:

* '''BOINC → EGEE bridge''': A modified [[wikipedia:BOINC|BOINC]] client that represented itself as a powerful desktop PC with many CPU cores to the EGEE Workload Management System (WMS), pulling workunits from the BOINC server and executing them on EGEE resources. This was based on the super-worker approach.<ref name="fedak2008">{{cite conference |last1=Fedak |first1=Gilles |last2=He |first2=Haiwu |last3=Lodygensky |first3=Oleg |display-authors=etal |title=EDGeS: A Bridge between Desktop Grids and Service Grids |booktitle=2008 Third ChinaGrid Annual Conference (CHINAGRID) |year=2008 |doi=10.1109/ChinaGrid.2008.44}}</ref>
* '''EGEE → BOINC bridge''': Allowed EGEE users to submit jobs that were transparently forwarded to and executed on connected desktop grid systems, extending the capacity of EGEE [[wikipedia:Virtual organization|Virtual Organization]]s (VOs) with volunteer resources.<ref name="kacsuk2011">{{cite book |last1=Kacsuk |first1=P. |last2=Farkas |first2=Z. |last3=Balaton |first3=Z. |title=EDGeS Bridge Technologies to Interconnect Service and Desktop Grids |booktitle=Remote Instrumentation Services on the e-Infrastructure |year=2011 |publisher=Springer |doi=10.1007/978-1-4419-5574-6_5}}</ref>

The production infrastructure included the SZTAKI Desktop Grid, the Extremadura Desktop Grid, and the AlmereGrid, connected to EGEE service grids through the 3G Bridge.<ref name="urbah2009" />

== Volunteer participation ==

Volunteers participated in EDGeS@Home by installing the [[wikipedia:BOINC|BOINC]] client and attaching to the project URL <code>http://home.edges-grid.eu/home/</code>.<ref name="edgeshome" /> At its peak, the project reached approximately:

{| class="wikitable"
|-
! Metric !! Value
|-
| Total users || 11,486
|-
| Total hosts || 32,308
|-
| Total credit || 460,481,463
|-
| Peak estimated performance (48 h) || ~1.57 [[wikipedia:FLOPS|TFLOPS]]
|-
| Number of countries || 84
|-
| Number of teams || 684
|-
|}

As of March 2012, over 7,000 users from 84 countries had contributed more than 17,000 computers, providing an integrated performance of approximately 2.6 [[wikipedia:FLOPS|TFLOPS]].<ref name="boincruforum" /> The project had 11,032 users and 16,385 hosts as of March 2012, with an estimated 48-hour performance of 1,352.6 GFLOPS.<ref name="edgeshome" />

== Relationship to other projects ==

EDGeS@Home was closely related to several other grid and volunteer computing initiatives:

* '''[[wikipedia:Ibercivis|Ibercivis]]''' – A Spanish volunteer computing project that also hosted the ISDEP application. EDGeS@Home served as part of a unified European grid infrastructure that included Ibercivis as a sub-grid.<ref name="boincruforum" />
* '''SZTAKI Desktop Grid''' – A BOINC-based desktop grid developed at MTA SZTAKI using the DC-API (Distributed Computing Application Programming Interface), which was a foundational component of the EDGeS infrastructure.<ref name="urbah2009" />
* '''ZIVIS''' – A city-wide volunteer computing platform in Zaragoza, Spain, that served as a precursor to Ibercivis and hosted ISDEP as its pilot application.<ref name="zivis" />
* '''AlmereGrid''' – A Dutch desktop grid that was part of the EDGeS production infrastructure.<ref name="urbah2009" />
* '''DEGISCO''' – The follow-on project (FP7 grant 261556) that supported the EDGeS@Home infrastructure and promoted interoperation between desktop grid and service grid infrastructures on a global scale.<ref name="degisco" />

== Mathematical formulation ==

ISDEP solves the [[wikipedia:Fokker–Planck equation|Fokker–Planck equation]] for a minority ion population in a magnetized plasma:

:<math>\frac{\partial f}{\partial t} + \dot{\mathbf{x}} \cdot \nabla f + \dot{\mathbf{v}} \cdot \nabla_v f = C(f)</math>

where <math>f(\mathbf{x}, \mathbf{v}, t)</math> is the [[wikipedia:Distribution function|ion distribution function]], <math>\mathbf{x}</math> and <math>\mathbf{v}</math> are position and velocity in [[wikipedia:Cartesian coordinate system|Cartesian coordinates]], and <math>C(f)</math> is the collision operator (Boozer–Kuo-Petravic).<ref name="velasco2012" />

By exploiting the equivalence between the Fokker–Planck equation and the [[wikipedia:Langevin equation|Langevin equation]]s, ISDEP integrates the [[wikipedia:Stochastic differential equation|stochastic differential equation]]s:

:<math>d\mathbf{X} = \mathbf{a}(\mathbf{X}, t)\,dt + \mathbf{b}(\mathbf{X}, t)\,d\mathbf{W}</math>

where <math>\mathbf{a}</math> is the drift term (deterministic motion in the electromagnetic field), <math>\mathbf{b}</math> is the diffusion coefficient (collisional effects), and <math>\mathbf{W}</math> is a [[wikipedia:Wiener process|Wiener process]].<ref name="velasco2012" /> The numerical integration uses a [[wikipedia:Runge–Kutta method|Runge–Kutta method]] upgraded to handle [[wikipedia:Gaussian noise|Gaussian noise]] from collisional effects.<ref name="zivis" />

Since individual particle trajectories are statistically independent, no inter-node communication is required during computation, making the problem [[wikipedia:Embarrassingly parallel|embarrassingly parallel]] and well-suited for [[wikipedia:Volunteer computing|volunteer computing]] platforms.<ref name="velasco2012" />

== Publications ==

=== BOINC-listed publications ===

The following 12 publications are listed on the [[wikipedia:BOINC|BOINC]] publications page for EDGeS@Home:<ref name="boincpubs">{{cite web |url=https://boinc.berkeley.edu/pubs.php#EDGeS@Home |title=Publications by BOINC Projects – EDGeS@Home |publisher=BOINC |accessdate=2026-08-16}}</ref>

# Kacsuk, P., Z. Farkas, J. Kovács ''et al''. [https://www.researchgate.net/publication/296885066_Desktop_grid_in_the_era_of_cloud_computing Desktop grid in the era of cloud computing]. (2015).
# Fedak, Gilles. [https://hal.inria.fr/tel-01158462 Contributions to Desktop Grid Computing]. (2015). Habilitation à diriger des recherches.
# Delamare, Simon, Gilles Fedak, Derrick Kondo and Oleg Lodygensky. [http://link.springer.com/10.1007/s10586-013-0283-6 SpeQuloS: a QoS service for hybrid and elastic computing infrastructures]. ''Cluster Computing'' (2014). DOI: 10.1007/s10586-013-0283-6.
# Visegrádi, Ádám, J. Kovács and P. Kacsuk. [https://linkinghub.elsevier.com/retrieve/pii/S0167739X1300229X Efficient extension of gLite VOs with BOINC based desktop grids]. ''Future Generation Computer Systems'' (2014). DOI: 10.1016/j.future.2013.10.012.
# Marosi, Attila, J. Kovács and P. Kacsuk. [https://linkinghub.elsevier.com/retrieve/pii/S0167739X12000660 Towards a volunteer cloud system]. ''Future Generation Computer Systems'' (2013). DOI: 10.1016/j.future.2012.03.013.
# Delamare, Simon, Gilles Fedak, Derrick Kondo, O. Lodygensky, P. Kacsuk, J. Kovács and F. Araujo. [https://hal.inria.fr/hal-00819907 Advanced QoS Prototype for the EDGI Infrastructure]. (2013).
# Delamare, Simon, Gilles Fedak, Derrick Kondo, O. Lodygensky, P. Kacsuk, J. Kovács and F. Araujo. [https://www.researchgate.net/publication/278629554_Intermediate_QoS_Prototype_for_the_EDGI_Infrastructure Intermediate QoS Prototype for the EDGI Infrastructure]. (2013).
# Terstyanszky, Gabor, Tamas Kiss, Tamas Kukla, Zsolt Lichtenberger, Stephen Winter, Pamela Greenwell, Sharron McEldowney and Hans Heindl. [https://pubmed.ncbi.nlm.nih.gov/22942006/ Application repository and science gateway for running molecular docking and dynamics simulations]. ''Studies in Health Technology and Informatics'' (2012).
# Kacsuk, P., Z. Farkas and Z. Balaton. [http://link.springer.com/10.1007/978-1-4419-5574-6_5 EDGeS Bridge Technologies to Interconnect Service and Desktop Grids]. ''Remote Instrumentation Services on the e-Infrastructure'' (2011).
# Velasco, J. L., F. Castejón and A. Tarancón. [http://aip.scitation.org/doi/10.1063/1.3126583 Finite orbit width effect in ion collisional transport in TJ-II]. ''Physics of Plasmas'' (2009). DOI: 10.1063/1.3126583.
# Fedak, Gilles, Haiwu He, Oleg Lodygensky ''et al''. [http://ieeexplore.ieee.org/document/4624461/ EDGeS: A Bridge between Desktop Grids and Service Grids]. ''2008 Third ChinaGrid Annual Conference'' (2008). DOI: 10.1109/ChinaGrid.2008.44.
# Antolí, B., F. Castejón, A. Giner ''et al''. [https://www.researchgate.net/publication/242126353_ZIVIS_A_City_Computing_Platform_Based_on_Volunteer_Computing ZIVIS: A City Computing Platform Based on Volunteer Computing]. (2007).

=== Additional publications ===

The following additional publications are related to the ISDEP application and the EDGeS project but are not listed on the BOINC publications page:

# Urbah, E., P. Kacsuk, Z. Farkas ''et al''. [https://doi.org/10.1007/s10723-009-9137-0 EDGeS: Bridging EGEE to BOINC and XtremWeb]. ''Journal of Grid Computing'' '''7''', 335–354 (2009). DOI: 10.1007/s10723-009-9137-0.
# Velasco, J.L., A. Bustos, F. Castejón, L.A. Fernández, V. Martín-Mayor and A. Tarancón. [https://doi.org/10.1016/j.cpc.2012.04.004 ISDEP: Integrator of stochastic differential equations for plasmas]. ''Computer Physics Communications'' '''183'''(9), 1877–1883 (2012). DOI: 10.1016/j.cpc.2012.04.004.
# Bustos, A., F. Castejón, L.A. Fernández, J. García, V. Martín-Mayor, J.M. Reynolds, R. Seki and J.L. Velasco. [https://doi.org/10.1088/0029-5515/50/12/125007 Impact of 3D features on ion collisional transport in ITER]. ''Nuclear Fusion'' '''50'''(12), 125007 (2010). DOI: 10.1088/0029-5515/50/12/125007.
# Bustos, A., J.M. Fontdecaba, F. Castejón, J.L. Velasco, M. Tereshchenko and J. Arévalo. [https://doi.org/10.1063/1.4793731 Studies of the fast ion energy spectra in TJ-II]. ''Physics of Plasmas'' '''20'''(2), 022507 (2013). DOI: 10.1063/1.4793731.
# Castejón, F., L.A. Fernández, J. Guasp, V. Martín-Mayor, A. Tarancón and J.L. Velasco. [https://doi.org/10.1088/0741-3335/49/6/006 Ion kinetic transport in the presence of collisions and electric field in TJ-II ECRH plasmas]. ''Plasma Physics and Controlled Fusion'' '''49'''(6), 753 (2007). DOI: 10.1088/0741-3335/49/6/006.
# Rivero, A. and D. Ferrer. [https://www.academia.edu/758702/ISDEP_a_fusion_application_deployed_in_the_EDGeS_project ISDEP, a fusion application deployed in the EDGeS project]. EGEE User Forum, ''EnterTheGrid'' workshop (2010).
# Cárdenas-Montes, M., A. Emmen, A.C. Marosi ''et al''. EDGeS: bridging Desktop and Service Grids. ''EGEE User Forum'' (2008).

== See also ==

* [[wikipedia:BOINC|BOINC]]
* [[wikipedia:Volunteer computing|Volunteer computing]]
* [[wikipedia:Ibercivis|Ibercivis]]
* [[wikipedia:TJ-II|TJ-II stellarator]]
* [[wikipedia:ITER|ITER]]
* [[wikipedia:Stellarator|Stellarator]]
* [[wikipedia:Plasma (physics)|Plasma (physics)]]

==References==

{{Reflist}}

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:Volunteer computing]]
[[Category:Grid computing]]
[[Category:Plasma physics]]
[[Category:Fusion research]]
[[Category:European Union research projects]]

BOINC projects

Al Piskun — Sat, 15 Aug 2026 21:32:13 GMT

add Quake-Catcher Network See more...

← Older revision		Revision as of 21:32, 15 August 2026
Line 1,989:		Line 1,989:
	\|		\|
	\|		\|
	\| ~~Research~~, ~~education~~, and ~~outreach in seismology~~.		\| Used low-cost MEMS accelerometers in laptops, desktops, and USB sensors to build a distributed, community-based earthquake detection network. [[Quake-Catcher Network\|See more...]]

	\|-		\|-
Line 2,002:		Line 2,002:
	\|		\|
	\|		\|
	\| ~~Research~~, ~~education~~, and ~~outreach in seismology~~.		\| Used low-cost MEMS accelerometers in laptops, desktops, and USB sensors to build a distributed, community-based earthquake detection network.

	\|-		\|-

Main Page

Al Piskun — Sat, 15 Aug 2026 21:29:12 GMT

add Quake-Catcher Network

← Older revision		Revision as of 21:29, 15 August 2026
(3 intermediate revisions by the same user not shown)
Line 22:		Line 22:
	═══════════════════════════════════════════════════════ -->		═══════════════════════════════════════════════════════ -->
	<div class="bs-stats">		<div class="bs-stats">
	<div class="bs-stat bs-stat-teal">		<div class="bs-stat bs-stat-teal"><div class="bs-stat-number">335</div>
	<div class="bs-stat-number">335</div>
	<div class="bs-stat-label">[[BOINC projects\|Projects listed]]</div>		<div class="bs-stat-label">[[BOINC projects\|Projects listed]]</div>
	</div>		</div>
	<div class="bs-stat bs-stat-purple">		<div class="bs-stat bs-stat-purple"><div class="bs-stat-number">94</div>
	<div class="bs-stat-number">91</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
	<div class="bs-stat bs-stat-pink">		<div class="bs-stat bs-stat-pink">
	<div class="bs-stat-number">71</div>		<div class="bs-stat-number">72</div>
	<div class="bs-stat-label">[[BOINC project screensavers\|Screensavers archived]]</div>		<div class="bs-stat-label">[[BOINC project screensavers\|Screensavers archived]]</div>
	</div>		</div>
Line 265:		Line 263:
	\|-		\|-
	\|* [[Leiden Classical]] submit personal classical mechanics and molecular dynamics simulations		\|* [[Leiden Classical]] submit personal classical mechanics and molecular dynamics simulations
	\|		\|* [[NanoHive@Home]] used the NanoHive-1 nanospace simulator to search for failure modes in tooltips
			\|-
			\|* [[Malariacontrol.net]] simulate the transmission dynamics and health effects of malaria
			\|* [[MindModeling@Home]] computational cognitive modeling to study human performance and learning
	\|-		\|-
	\| * [[nanoHUB@Home]] nanotechnology simulation		\| * [[nanoHUB@Home]] nanotechnology simulation
Line 271:		Line 272:
	\|-		\|-
	\|* [[POEM@HOME]] all-atom free-energy simulations to predict protein structure and folding		\|* [[POEM@HOME]] all-atom free-energy simulations to predict protein structure and folding
	\|		\|* [[proteins@home]] tackled the inverse protein folding problem
	\|-
	\|* [[~~Malariacontrol.net~~]] ~~simulate~~ the ~~transmission dynamics and health effects of malaria~~
	~~\|* [[MindModeling@Home]] computational cognitive modeling to study human performance and learning~~
	\|-		\|-
	\| * [[Predictor@home]] protein folding and the first BOINC project		\| * [[Predictor@home]] protein folding and the first BOINC project
	\| * [[Pirates@Home]] help to develop Einstein@Home screensaver and test BOINC software		\| * [[Pirates@Home]] help to develop Einstein@Home screensaver and test BOINC software
	\|-		\|-
	\| * [[~~proteins@home~~]] ~~tackled the inverse protein folding problem~~		\| [[Quake-Catcher Network\|* Quake-Catcher Network]] used accelerometers in laptops and USB sensors to build a distributed earthquake detection network
	\| * [[QMC@Home]] develop and apply Quantum Monte Carlo (QMC) methods for use in quantum chemistry		\| * [[QMC@Home]] develop and apply Quantum Monte Carlo (QMC) methods for use in quantum chemistry
	\|-		\|-
Line 292:		Line 290:
	\|-		\|-
	\|* [[SAT@home]] solve hard instances of the Boolean satisfiability problem		\|* [[SAT@home]] solve hard instances of the Boolean satisfiability problem
			\|* [[SciLINC]] indexed digitized botanical literature
			\|-
	\|* [[SIMAP]] pre-calculated protein sequence similarities for a database used by bioinformaticians		\|* [[SIMAP]] pre-calculated protein sequence similarities for a database used by bioinformaticians
			\|
	\|-		\|-
	\|* [[Spinhenge@home]] simulating spin dynamics in nanoscale molecular magnets		\|* [[Spinhenge@home]] simulating spin dynamics in nanoscale molecular magnets

BOINC projects

Al Piskun — Fri, 14 Aug 2026 20:43:05 GMT

2 more See more...

← Older revision		Revision as of 20:43, 14 August 2026
Line 1,094:		Line 1,094:
	\|		\|
	\| 2007-03-22		\| 2007-03-22
			2009
	\| WinXP-98		\| WinXP-98
	\|		\|
Line 1,101:		Line 1,102:
	\|		\|
	\|		\|
	\| ~~Increase public access to nationally significant scientific~~ literature. ~~Enhance the usefulness of digitized materials by creating a Web repository of scanned literature, keywords, and online resources with tools for searching and analysis~~. ~~Create an educational tool for learning about plant life~~. ~~Provide a model for adopting public-resource computing applications within the library community~~.		\| Indexed digitized botanical literature. [[SciLINC\|See more...]]

	\|-		\|-
Line 1,388:		Line 1,389:
	\|		\|
	\|		\|
	\| NanoHive-1 ~~is a modular~~ simulator ~~used~~ for ~~modeling the physical world at a nanometer scale~~. ~~The intended purpose of the simulator is to act as a tool for the study, experimentation, and development of nanotech entities~~.		\| Used the NanoHive-1 nanospace simulator to search for failure modes in diamondoid mechanosynthesis tooltips. [[NanoHive@Home\|See more...]]

	\|-		\|-

BOINC project screensavers

Al Piskun — Fri, 14 Aug 2026 20:34:39 GMT

Full Playlist: add link

← Older revision		Revision as of 20:34, 14 August 2026
(One intermediate revision by the same user not shown)
Line 346:		Line 346:
	\| style="vertical-align:top; padding:6px;" \| '''[[BOINC]] processing for science Screensaver'''<br/><small>Promotional</small>		\| style="vertical-align:top; padding:6px;" \| '''[[BOINC]] processing for science Screensaver'''<br/><small>Promotional</small>
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| A promotional screensaver recording showing BOINC processing across multiple projects.		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| A promotional screensaver recording showing BOINC processing across multiple projects.
			\|-
			\|—
			\|[[File:NanoHive@Home Screensaver.png\|thumb\|Static image only]]
			\|'''[[NanoHive@Home]] Screensaver'''
			\|NanoHive@Home Screensaver with explanations.
	\|}		\|}

NanoHive@Home

Al Piskun — Fri, 14 Aug 2026 20:21:22 GMT

first light

Show changes

File:NanoHive@Home Screensaver.png

Al Piskun — Fri, 14 Aug 2026 20:05:11 GMT

Al Piskun uploaded File:NanoHive@Home Screensaver.png NanoHive@Home Screensaver

New page

== Summary ==
NanoHive@Home Screensaver

File:Header-nhah-house.png

Al Piskun — Fri, 14 Aug 2026 20:03:27 GMT

Al Piskun uploaded File:Header-nhah-house.png NanoHive@Home logo

New page

== Summary ==
NanoHive@Home logo

SciLINC

Al Piskun — Fri, 14 Aug 2026 18:31:45 GMT

← Older revision		Revision as of 18:31, 14 August 2026
(One intermediate revision by the same user not shown)
(No difference)

SciLINC

Al Piskun — Fri, 14 Aug 2026 18:29:45 GMT

first light

New page

{{Infobox software
| name = SciLINC
| logo =
| logo caption =
| screenshot =
| caption = The BOINC Manager client software used by SciLINC volunteers
| description = SciLINC (Scientific Literature Indexing on Networked Computers) was a short lived BOINC volunteer computing project run by the Missouri Botanical Garden that indexed digitized botanical literature on participants' computers between March and June 2007.
| status = Completed
| category = Biology
| compute = CPU
| dependencies = BOINC client
| developer = Missouri Botanical Garden
| author = Missouri Botanical Garden
| sponsor = Institute of Museum and Library Services
| maintainer =
| released = {{Start date and age|2007|03|22}}
| completed = June 2007
| discontinued = 2009
| repository =
| programming language =
| operating system = Microsoft Windows (98 or later), Linux
| size =
| stats as of = {{Start date and age|2007|07|24}}
| average performance = 0.0 GigaFLOPS
| active users = 0
| total users = 150
| active hosts = 0
| total hosts = 217
| rac = 0
| credit per day = 0
| gpu performance =
| cpu performance =
| website = {{URL|https://www.scilinc.org/}}
| license = Not published
}}

'''SciLINC''', an acronym for '''Sci'''entific '''L'''iterature '''I'''ndexing on '''N'''etworked '''C'''omputers, was a [[BOINC]] volunteer computing project operated by the Missouri Botanical Garden in St. Louis, Missouri.<ref name="botanicus">{{cite web |url=http://www.botanicus.org/Scilinc.aspx |title=Botanicus.org: SciLINC, Scientific Literature Indexing on Networked Computers |publisher=Missouri Botanical Garden |access-date=August 14, 2026 |archive-url=https://web.archive.org/web/20081212014154/http://www.botanicus.org/Scilinc.aspx |archive-date=December 12, 2008 |url-status=dead}}</ref> Volunteers attached their computers to the project so that pages of digitized botanical literature could be analyzed during idle time: each workunit bundled OCR text of scanned pages together with an algorithm for finding scientific names, and the results were used to build full text and keyword indexes for the Garden's Botanicus digital library.<ref name="freeland2011">{{cite web |url=http://blog.chrisfreeland.com/2011/12/boincing-angry-birds-for-bhl.html |title=BOINCing Angry Birds for BHL: Purposeful Gaming in Digital Libraries |first=Chris |last=Freeland |publisher=ChrisFreeland.com |date=December 2, 2011 |access-date=August 14, 2026 |archive-url=https://web.archive.org/web/20120313135210/http://blog.chrisfreeland.com/2011/12/boincing-angry-birds-for-bhl.html |archive-date=March 13, 2012 |url-status=live}}</ref> SciLINC went online on March 22, 2007 and sent out its first workunits on March 29, 2007.<ref name="oldnews">{{cite web |url=http://www.scilinc.org/old_news.php |title=SciLINC: News archive |first=Ron |last=Parker |publisher=Missouri Botanical Garden |date=June 19, 2007 |access-date=August 14, 2026 |archive-url=https://web.archive.org/web/20071223012202/http://www.scilinc.org/old_news.php |archive-date=December 23, 2007 |url-status=dead}}</ref> It was a pioneering effort, presented by its creators as the first attempt to apply public-resource computing within the library community.<ref name="botanicus"/>

Because text indexing demands very little computing per unit of data, the public phase of the project was brief: the available work was processed within days, and in June 2007 the team announced that all remaining SciLINC computation would be performed on the Garden's own servers.<ref name="june22">{{cite web |url=http://www.scilinc.org/ |title=SciLINC: SciLINC Update |first=Ron |last=Parker |publisher=Missouri Botanical Garden |date=June 22, 2007 |access-date=August 14, 2026 |archive-url=https://web.archive.org/web/20071023063008/http://www.scilinc.org/ |archive-date=October 23, 2007 |url-status=dead}}</ref> Statistics sites such as [[BOINCstats]] froze their SciLINC data on July 24, 2007, recording 150 registered users, 217 hosts and 2,093 total credits.<ref name="boincstats">{{cite web |url=https://boincstats.com/stats/project_graph.php?pr=scilinc |title=BOINCstats: SciLINC, Credit overview |publisher=BOINCstats |access-date=August 14, 2026 |archive-url=https://web.archive.org/web/20111012020502/http://boincstats.com/stats/project_graph.php?pr=scilinc |archive-date=October 12, 2011 |url-status=dead}}</ref> The project website remained online through 2009 and later went offline.<ref name="oldnews"/> Although short lived, SciLINC influenced later biodiversity informatics work, most notably the TaxonFinder name-finding service adopted by the Biodiversity Heritage Library.<ref name="freeland2011"/><ref name="idealstnr">{{cite web |url=https://www.ideals.illinois.edu/handle/2142/9140 |title=Taxonomic Name Recognition in Biodiversity Heritage Library |first1=Qin |last1=Wei |first2=Chris |last2=Freeland |first3=P. Bryan |last3=Heidorn |publisher=University of Illinois at Urbana-Champaign, IDEALS |date=October 17, 2008 |access-date=August 14, 2026}}</ref>

== Background and goals ==

The Missouri Botanical Garden, founded in 1859, is one of the oldest botanical institutions in the United States and maintains a major research library of rare botanical literature.<ref>{{cite web |url=https://en.wikipedia.org/wiki/Missouri_Botanical_Garden |title=Missouri Botanical Garden |publisher=Wikipedia |access-date=August 14, 2026}}</ref> Much of that literature is scarce or unique, and scientists have traditionally travelled to St. Louis to consult it. To make the collection widely available, the Garden digitizes books and journals through its Botanicus digital library, and in October 2005 it received a grant from the Institute of Museum and Library Services (IMLS), a United States federal agency, to build SciLINC as a three-year project.<ref name="botanicus"/><ref>{{cite web |url=http://www.chrisfreeland.com/Freeland_CV.pdf |title=Christopher David Freeland: Curriculum Vitae |publisher=ChrisFreeland.com |access-date=August 14, 2026}}</ref> Chris Freeland was the project's listed contact at the Garden, and Ron Parker wrote the project's news pages and development blog.<ref name="botanicus"/><ref name="june22"/><ref>{{cite web |url=https://scilincdev.blogspot.com/2006/10/boinc.html |title=SciLINC, Scientific Literature Indexing on Networked Computers |first=Ron |last=Parker |work=SciLINC Dev |date=October 3, 2006 |access-date=August 14, 2026}}</ref>

The project description on Botanicus set out four primary goals:<ref name="botanicus"/>

# Increase public access to nationally significant scientific literature held by the Missouri Botanical Garden Library.
# Enhance the usefulness of the digitized materials by creating a web repository of scanned literature, keywords and online resources with tools for searching and analysis.
# Create an educational tool for learning about plant life: while indexing keywords, the participant's computer would display information about each plant name being processed, including descriptive data, images, maps and annotated links.
# Provide a model for adopting public-resource computing applications within the library community, where such applications "have been successfully employed in research and museum communities" but "so far have not been applied within libraries".

The keywords identified by SciLINC were to be derived from the Garden's botanical databases and would include plant names, place names, authors and other phrases of interest to people studying plants, each annotated with links to related online resources.<ref name="botanicus"/>

[[File:Climatron, Missouri Botanical Gardens.jpg|thumb|The Climatron conservatory at the Missouri Botanical Garden, which developed and operated SciLINC.]]

== Design and operation ==

SciLINC used [[BOINC]], the Berkeley Open Infrastructure for Network Computing, the open-source volunteer computing platform developed at the University of California, Berkeley, which also powers projects such as [[SETI@home]] and [[World Community Grid]].<ref>{{cite web |url=https://boinc.berkeley.edu/ |title=BOINC: Open-source software for volunteer computing |publisher=University of California, Berkeley |access-date=August 14, 2026}}</ref> The project packaged OCR text of scanned botanical pages into workunits and sent them, along with a name-finding algorithm, to volunteers' computers, which then reported back the locations of scientific names and index terms found in the text.<ref name="freeland2011"/> Participants joined by installing the BOINC client and attaching to the project URL <code>http://www.scilinc.org/SciLINC/</code>.<ref name="june22"/>

The volunteer application was named TaxonGrab. As listed on the project's applications page, version 1.39 ran on Microsoft Windows 98 or later on Intel x86-compatible processors, while the first results reported on March 29, 2007 were produced by a Linux version.<ref name="oldnews"/><ref>{{cite web |url=http://www.scilinc.org/apps.php |title=SciLINC: Applications |publisher=Missouri Botanical Garden |date=June 27, 2007 |access-date=August 14, 2026 |archive-url=https://web.archive.org/web/20070627230850/http://www.scilinc.org/apps.php |archive-date=June 27, 2007 |url-status=dead}}</ref> Participants operated under standard BOINC rules and policies: the software had to be run only on authorized computers, volunteers could control how much CPU power, disk space and bandwidth SciLINC used, and account names, along with a summary of each computer's work, could be shown on the project website.<ref>{{cite web |url=http://www.scilinc.org/info.php |title=SciLINC: Read our rules and policies |publisher=Missouri Botanical Garden |access-date=August 14, 2026 |archive-url=https://web.archive.org/web/20071023063008/http://www.scilinc.org/info.php |archive-date=October 23, 2007 |url-status=dead}}</ref> Volunteers earned BOINC credit for completed work, though the team later acknowledged that "a relatively small amount of credit" was earned for "a comparatively large load" on participants' systems.<ref name="june22"/>

During 2006, Parker documented development on the SciLINC Dev blog, covering topics such as installing the BOINC server software on CentOS and Fedora Core Linux, running the server under Xen virtualization, and a summary of a BOINC community conference question and answer session with BOINC founder David P. Anderson and SETI@home scientist Eric Korpela.<ref>{{cite web |url=https://scilincdev.blogspot.com/2006/11/linux-boinc-server-centos-4.html |title=Linux BOINC Server CentOS-4 Installation |first=Ron |last=Parker |work=SciLINC Dev |date=November 19, 2006 |access-date=August 14, 2026}}</ref><ref>{{cite web |url=https://scilincdev.blogspot.com/2006/12/boinc-conference-summary.html |title=BOINC Conference Summary |first=Ron |last=Parker |work=SciLINC Dev |date=December 19, 2006 |access-date=August 14, 2026}}</ref> The blog also recorded the project's design philosophy, borrowed from the BOINC literature: to make efficient use of public-resource computing, the compute time of the client must be relatively large compared to the data-transfer time required, that is

<math>t_{\text{compute}} \gg t_{\text{transfer}}</math>

== History ==

SciLINC went online on March 22, 2007, with the project team expecting to "be processing work within a few days".<ref name="oldnews"/> On March 29, 2007 the server sent out its first set of workunits and received its first results, running on Linux, with a Windows version announced as coming shortly.<ref name="oldnews"/> The project had originally operated on the Garden's internal network, and on May 14, 2007 the server was moved to the public Internet at www.scilinc.org; a server outage followed a few days later, and the recovery process, which involved changing the BOINC server's name, was documented on the development blog.<ref name="oldnews"/><ref>{{cite web |url=https://scilincdev.blogspot.com/2007/05/problems-changing-boinc-servers-name.html |title=Problems changing a BOINC server's name |first=Ron |last=Parker |work=SciLINC Dev |date=May 21, 2007 |access-date=August 14, 2026}}</ref>

On June 1, 2007 the project announced that results from SciLINC were being passed to Botanicus.<ref name="oldnews"/> In mid June the project hit a series of setbacks: on June 15 the process that gathered work for SciLINC "filled the drive with everything it could find in the vaults" (images, PDFs and more); on June 16 an electrical transient in the building housing the server corrupted the MySQL database, including the SciLINC results table; and on June 18 new account creation was temporarily disabled.<ref name="oldnews"/> Around the same time, volunteers on the BOINCstats and BOINC forums reported that the roughly 50 files served per workunit were causing high CPU load in the core BOINC client.<ref name="oldnews"/> On June 19 the team restored the database but disabled the sending of new workunits, warning that pending results might never receive credit.<ref name="oldnews"/>

The decisive announcement came on June 22, 2007 in a news item titled "SciLINC Update". The team reported that goals 1, 2 and 4 had been met (Botanicus was processing SciLINC's output, and the project had demonstrated the library use of public-resource computing), but that "the workunits fly by so rapidly" that the educational screensaver of goal 3 had never become realistic. It also noted that the BOINC community had discovered the project before the team was ready to announce it. The update concluded that "for now all SciLINC computation will be performed internally", with hopes of returning to volunteers with more computationally intensive analyses and "a better credit-reward ratio (and nicer screensaver)".<ref name="june22"/> Internal testing continued at the end of June, with the scheduler briefly unavailable to Internet users on June 27, 2007.<ref name="june22"/>

Public participation wound down quickly after that. BOINCstats, which had last imported SciLINC's statistics on July 24, 2007, later labelled the project "no longer active" with its statistics "frozen on the day of the last update".<ref name="boincstats"/> The website, still bearing the June 2007 news, remained online through 2009, and was gone by the late 2010s.<ref name="oldnews"/>

== Data economics and the end of public computing ==

The June 22, 2007 update explained in unusual detail why text indexing was a poor fit for volunteer computing. The team calculated that SciLINC would have needed to transfer roughly 250 MiB of compressed data to occupy a modern CPU for one day; this would expand to nearly 660 MiB of input data, and the client would then upload about 44 MiB of results, which would compress to 17 MiB. The input data therefore expanded by a factor of

<math>660/250 = 2.64</math>

while the results compressed by a similar factor,

<math>44/17 \approx 2.59</math>

These numbers, the team said, "have only grown as SciLINC has been improved and made more efficient", and they were "not acceptable to the average BOINC user". The project lead's working rule, stated in the same update, was that from a technological and economic standpoint it makes sense to use public-resource computing in place of an internal grid architecture whenever less than a gigabyte of data is required per CPU-day of computation, that is

<math>D < 1\ \text{GiB per CPU-day}</math>

For a volunteer on dial-up giving SciLINC just 1% of their BOINC time, the daily computation would last

<math>0.01 \times 24 \times 60 = 14.4</math>

minutes, about 15 minutes, during which roughly 2.5 MiB would have to be downloaded; the team observed that for dial-up users "the transfer time would exceed the computation time". Even setting transfer concerns aside, the Garden simply did not have enough text to "realistically occupy hundred or thousands of BOINC enthusiasts for a lengthy period of time", and the work itself, "text-indexing and taxonomic analysis", had "a relatively low mathematical complexity". Freeland later summarized the experience: "we ran out of jobs in about 2 days because text indexing isn't processor intensive; the best BOINC projects take small inputs that require lots of computing resources."<ref name="june22"/><ref name="freeland2011"/>

== Project statistics ==

The following figures are the final values recorded by BOINCstats before the project's statistics were frozen on July 24, 2007:<ref name="boincstats"/>

{| class="wikitable"
|+ SciLINC statistics at BOINCstats (frozen)
! Metric !! Value
|-
| Total users || 150
|-
| Active users || 0
|-
| Total hosts || 217
|-
| Active hosts || 0
|-
| Teams || 35
|-
| Countries || 23
|-
| Total credit || 2,093
|-
| Recent average credit || 0
|-
| Average performance || 0.0 GigaFLOPS
|}

== Results and legacy ==

SciLINC's principal scientific output was the indexing of digitized botanical literature that fed the Garden's Botanicus portal, where full text searching and name-based discovery were integrated beginning in June 2007.<ref name="oldnews"/> By December 2008 Botanicus reported 577 titles (books and journals), 2,548 volumes and 1,079,660 pages online, along with 184,750 links to protologues (original species descriptions).<ref name="botanicus"/>

The project's longest lasting influence was methodological. Freeland wrote that SciLINC preceded the team's work on TaxonFinder, the algorithm and service, provided by uBio, that the Biodiversity Heritage Library (BHL) incorporated into its portal to identify and verify taxonomic name strings across its digitized corpus.<ref name="freeland2011"/><ref name="idealstnr"/> The experience also taught the team how jobs are packaged for distribution to volunteers "and the kinds of inputs and outputs that are successful in an asynchronous computing environment", a lesson Freeland later applied to proposals for "purposeful gaming" for the BHL, where human spare cycles, rather than CPU cycles, would improve digitized library metadata.<ref name="freeland2011"/> That idea grew into BHL's Purposeful Gaming project, funded by IMLS and run by the Garden's Center for Biodiversity Informatics from 2013 to 2015.<ref>{{cite web |url=https://about.biodiversitylibrary.org/projects/past-projects/purposeful-gaming/ |title=Purposeful Gaming |publisher=Biodiversity Heritage Library |access-date=August 14, 2026}}</ref> The team's lessons were collected in the unpublished IMLS final report, "SciLINC Final Report", with an appendix, linked from Freeland's 2011 blog post.<ref name="freeland2011"/>

[[File:Curtis's botanical magazine (Plate 3709) (8386433065).jpg|thumb|upright=0.75|A hand coloured plate from ''Curtis's Botanical Magazine'', typical of the historical botanical literature that Botanicus digitizes and that SciLINC indexed.]]

== Related publications ==

SciLINC itself did not publish scientific papers; its findings were reported to the funding agency and in blog posts. The techniques and systems it demonstrated appear in the following works. The first describes TaxonGrab, a rule-based technique for extracting taxonomic names from text; SciLINC's Windows volunteer application carried the same name.

* {{cite journal |last1=Koning |first1=Drew |last2=Sarkar |first2=Indra Neil |last3=Moritz |first3=Thomas |year=2005 |title=TaxonGrab: Extracting taxonomic names from text |journal=Biodiversity Informatics |volume=2 |pages=79-82 |doi=10.17161/bi.v2i0.17}}
* {{cite web |url=http://precedings.nature.com/documents/3372/version/1 |title=An evaluation of taxonomic name finding & next steps in Biodiversity Heritage Library (BHL) developments |first=Chris |last=Freeland |publisher=Nature Precedings |year=2009 |access-date=August 14, 2026 |archive-url=https://web.archive.org/web/20090723202516/http://precedings.nature.com/documents/3372/version/1 |archive-date=July 23, 2009 |url-status=dead}}
* {{cite web |url=https://www.ideals.illinois.edu/handle/2142/9140 |title=Taxonomic Name Recognition in Biodiversity Heritage Library |first1=Qin |last1=Wei |first2=Chris |last2=Freeland |first3=P. Bryan |last3=Heidorn |publisher=University of Illinois at Urbana-Champaign, IDEALS |date=October 17, 2008 |access-date=August 14, 2026}}
* {{cite web |url=https://www.researchgate.net/publication/41492665 |title=Name Matters: Taxonomic Name Recognition (TNR) in Biodiversity Heritage Library (BHL) |first1=Qin |last1=Wei |first2=P. Bryan |last2=Heidorn |first3=Chris |last3=Freeland |publisher=ResearchGate |date=February 2010 |access-date=August 14, 2026}}
* {{cite web |url=https://boinc.berkeley.edu/grid_paper_04.pdf |title=BOINC: A System for Public-Resource Computing and Storage |first=David P. |last=Anderson |work=5th IEEE/ACM International Workshop on Grid Computing |date=November 8, 2004 |access-date=August 14, 2026}}

The Anderson paper is included because it was the description of BOINC recommended by the SciLINC development blog as background reading for the project.<ref>{{cite web |url=https://scilincdev.blogspot.com/2006/10/boinc.html |title=SciLINC, Scientific Literature Indexing on Networked Computers |first=Ron |last=Parker |work=SciLINC Dev |date=October 3, 2006 |access-date=August 14, 2026}}</ref>

== See also ==

* [[BOINC]]
* [[BOINC Manager]]
* [[BOINCstats]]
* [[SETI@home]]
* [[World Community Grid]]

== References ==

{{Reflist}}

== External links ==

* [http://www.botanicus.org/Scilinc.aspx SciLINC project description] at Botanicus.org
* [https://scilincdev.blogspot.com/ SciLINC Dev] development blog by Ron Parker
* [https://web.archive.org/web/20071023063008/http://www.scilinc.org/ SciLINC website] at the Wayback Machine
* [https://web.archive.org/web/20111012020502/http://boincstats.com/stats/project_graph.php?pr=scilinc SciLINC statistics] at BOINCstats via the Wayback Machine

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

BOINC projects

Al Piskun — Tue, 04 Aug 2026 11:32:18 GMT

← Older revision		Revision as of 11:32, 4 August 2026
(One intermediate revision by the same user not shown)
Line 157:		Line 157:
	\| Computer science		\| Computer science
	\| See below		\| See below
	\| A computational platform for analysis based on data extracted from iThena.Measurements project applications~~/sensors~~. [[IThena.Computational\|See more...]]		\| A computational platform for analysis based on data extracted from iThena.Measurements project applications. [[IThena.Computational\|See more...]]

	\|-		\|-
Line 287:		Line 287:
	\| Mathematics		\| Mathematics
	\|		\|
	\| ~~Compiles~~ a database of canonical forms ~~(CF)~~ of 10th order diagonal Latin squares (DLS) with orthogonal diagonal Latin squares (ODLS). [[ODLK\|See more...]]		\| Compile a database of canonical forms of 10th order diagonal Latin squares (DLS) with orthogonal diagonal Latin squares (ODLS). [[ODLK\|See more...]]

	\|-		\|-
Line 2,835:		Line 2,835:
	\|		\|
	\|		\|
	\| ~~Take into account~~ plant ~~vegetative reproduction e~~.g. ~~the ability of each perennial grass to colonize space through cloning~~.		\| simulations of clonal plant growth to inform the ecological design of sustainable prairie ecosystems. [[Virtual Prairie\|See more...]]

	\|-		\|-
Line 4,007:		Line 4,007:
	\|		\|
	\|		\|
	\| Solving one of the most famous unsolved puzzles - the three-decade old Kryptos sculpture located on the grounds of the Central Intelligence Agency.		\| Solving one of the most famous unsolved puzzles - the three-decade old Kryptos sculpture located on the grounds of the Central Intelligence Agency. [[Kryptos@Home\|See more...]]

	\|-		\|-

Main Page

Al Piskun — Fri, 31 Jul 2026 11:02:12 GMT

add Virtual Prairie and Kryptos@Home

← Older revision		Revision as of 11:02, 31 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">89</div>		<div class="bs-stat-number">91</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 262:		Line 262:
	\|-		\|-
	\|* [[GoofyxGrid@Home NCI\|Ibercivis]] simulations in nuclear fusion, protein docking, materials science, and number theory		\|* [[GoofyxGrid@Home NCI\|Ibercivis]] simulations in nuclear fusion, protein docking, materials science, and number theory
			\|* [[Kryptos@Home]] attempt to decrypt K4, the unsolved fourth passage of the Kryptos sculpture at CIA headquarters
			\|-
	\|* [[Leiden Classical]] submit personal classical mechanics and molecular dynamics simulations		\|* [[Leiden Classical]] submit personal classical mechanics and molecular dynamics simulations
			\|
	\|-		\|-
	\| * [[nanoHUB@Home]] nanotechnology simulation		\| * [[nanoHUB@Home]] nanotechnology simulation
Line 306:		Line 309:
	\|* [[Universe@Home]] stellar evolution modelling		\|* [[Universe@Home]] stellar evolution modelling
	\|-		\|-
			\| * [[Virtual Prairie]] simulations of clonal plant growth to inform the ecological design of sustainable prairie ecosystems
	\| * [[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		\|-
			\|
			\|* [[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>

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}}