BOINC Projects - Recent changes [en]

LHC@home

Al Piskun — Fri, 12 Jun 2026 22:26:20 GMT

update

Show changes

PrimeGrid

Al Piskun — Fri, 12 Jun 2026 16:27:13 GMT

update information

Show changes

BOINC project screensavers

Al Piskun — Fri, 12 Jun 2026 16:08:31 GMT

BOINC projects

Al Piskun — Fri, 12 Jun 2026 15:51:26 GMT

← Older revision		Revision as of 15:51, 12 June 2026
(One intermediate revision by the same user not shown)
Line 4,044:		Line 4,044:
	\| [http://burp.renderfarming.net/ Big and Ugly Rendering Project (BURP)]		\| [http://burp.renderfarming.net/ Big and Ugly Rendering Project (BURP)]
	\| [https://boinc.berkeley.edu/pubs.php#Big 2]		\| [https://boinc.berkeley.edu/pubs.php#Big 2]
	\|		\|2004-06-17
			2020
	\| Windows, Linux, Mac OS		\| Windows, Linux, Mac OS
	\|		\|
	\|		\|
	\|		\|
			\|Janus Kristensen
			\|3D rendering
	\|		\|
	\|		\| Render animated videos including [http://bbb3d.renderfarming.net/download.html Big Buck Bunny]. [[Big and Ugly Rendering Project\|See more...]]
	\|
	\| Render animated videos including [http://bbb3d.renderfarming.net/download.html Big Buck Bunny].

	\|-		\|-

Main Page

Al Piskun — Fri, 12 Jun 2026 15:45:30 GMT

add Big and Ugly Rendering Project

← Older revision		Revision as of 15:45, 12 June 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">59</div>		<div class="bs-stat-number">60</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 230:		Line 230:
	\| * [[Axiom Distributed AI]] distributed AI model training		\| * [[Axiom Distributed AI]] distributed AI model training
	\| * [[BlackHoles@Home]] black hole binary merger waveforms		\| * [[BlackHoles@Home]] black hole binary merger waveforms
			\|-
			\|* [[Big and Ugly Rendering Project]] distributed video rendering
			\|
	\|-		\|-
	\| * [[Cosmology@Home]] astronomical research		\| * [[Cosmology@Home]] astronomical research

Big and Ugly Rendering Project

Al Piskun — Fri, 12 Jun 2026 15:33:54 GMT

← Older revision		Revision as of 15:33, 12 June 2026
(One intermediate revision by the same user not shown)
Line 5:		Line 5:
	\| screenshot = Big and Ugly Rendering Project.png		\| screenshot = Big and Ugly Rendering Project.png
	\| caption = BURP project interface		\| caption = BURP project interface
			\| description = Big and Ugly Rendering Project (BURP) is a non-commercial volunteer computing project built on BOINC, designed as an openly distributed render farm for 3D animations. It is best known for rendering the high-frame-rate 4K re-release of the Blender Foundation's open film Big Buck Bunny in 2013.

	\| status = Hibernation		\| status = Hibernation
Line 16:		Line 17:

	\| operating system = Windows, Linux		\| operating system = Windows, Linux

			\| stats as of = {{Start date and age\|2021\|06\|22}}
			\| average performance = 382.31 GigaFLOPS
			\| active users = 161
			\| total users = 7331
			\| active hosts = 526
			\| total hosts = 13042

	\| website = {{URL\|http://burp.renderfarming.net/}}		\| website = {{URL\|http://burp.renderfarming.net/}}
	\| license = GPL-3.0-or-later		\| license = GPL-3.0-or-later
	\| description = Big and Ugly Rendering Project (BURP) is a non-commercial volunteer computing project built on BOINC, designed as an openly distributed render farm for 3D animations. It is best known for rendering the high-frame-rate 4K re-release of the Blender Foundation's open film Big Buck Bunny in 2013.
	}}		}}

Line 27:		Line 34:

	== Background and motivation ==		== Background and motivation ==
			[[File:Blender 3.0.0 screenshot.png\|thumb\|[[Blender (software)\|Blender]], the open-source 3D creation suite that became BURP's primary supported renderer from late 2004 onward.]]
	[[File:~~Blender3D Carrot~~.~~jpg~~\|thumb~~\|right~~\|[[Blender (software)\|Blender]], the open-source 3D creation suite that became BURP's primary supported renderer from late 2004 onward.]]

	[[Rendering (computer graphics)\|Rendering]] is the process of generating a final 2D image or frame from a 3D scene description, accounting for lighting, materials, shadows, reflections, and depth. For photorealistic animation, each frame must be calculated individually, and a single high-quality frame can require anywhere from minutes to many hours of computation. A short animated film of ten minutes at 24 frames per second consists of 14,400 such frames. The resulting aggregate render time is typically measured in CPU-years, making the process practically impossible on a single workstation within any reasonable deadline.		[[Rendering (computer graphics)\|Rendering]] is the process of generating a final 2D image or frame from a 3D scene description, accounting for lighting, materials, shadows, reflections, and depth. For photorealistic animation, each frame must be calculated individually, and a single high-quality frame can require anywhere from minutes to many hours of computation. A short animated film of ten minutes at 24 frames per second consists of 14,400 such frames. The resulting aggregate render time is typically measured in CPU-years, making the process practically impossible on a single workstation within any reasonable deadline.

Line 86:		Line 91:

	== How BURP works ==		== How BURP works ==
			[[File:BOINC logo.png\|right\|frameless\|150x150px\|The [[BOINC]] logo. BURP used the standard BOINC client-server architecture to distribute rendering work units to volunteers.]]
	[[File:~~Boinc~~ logo.png\|~~thumb~~\|The [[BOINC]] logo. BURP used the standard BOINC client-server architecture to distribute rendering work units to volunteers.]]

	=== Architecture ===		=== Architecture ===
Line 156:		Line 160:

	== Renderfarm.fi ==		== Renderfarm.fi ==
			[[File:Laurea ammattikorkeakoulu tikkurila 250706.JPG\|thumb\|[[Laurea University of Applied Sciences]], the Finnish institution behind the Open Rendering Environment research project that produced Renderfarm.fi.]]
	[[File:Laurea~~-logo~~.~~jpg~~\|thumb~~\|right~~\|[[Laurea University of Applied Sciences]], the Finnish institution behind the Open Rendering Environment research project that produced Renderfarm.fi.]]

	Renderfarm.fi was a Finnish sister project to BURP that shared its back-end software. It was developed between 2007 and 2009 through the Open Rendering Environment (ORE) research initiative at [[Laurea University of Applied Sciences]], guided by Janus Kristensen and Julius Tuomisto, with a team of undergraduate students.<ref name="wikipedia-burp" /> An independent BURP server was set up in Finland to underpin the service.		Renderfarm.fi was a Finnish sister project to BURP that shared its back-end software. It was developed between 2007 and 2009 through the Open Rendering Environment (ORE) research initiative at [[Laurea University of Applied Sciences]], guided by Janus Kristensen and Julius Tuomisto, with a team of undergraduate students.<ref name="wikipedia-burp" /> An independent BURP server was set up in Finland to underpin the service.

Line 171:		Line 173:
	BURP's rendering engine support evolved over the project's lifetime:		BURP's rendering engine support evolved over the project's lifetime:

	* '''YafaRay''' (June to August 2004) ~~-- the~~ original supported renderer; found inadequate and replaced.		* '''YafaRay''' (June to August 2004) The original supported renderer; found inadequate and replaced.
	* '''Blender Internal''' (from August 2004) -- Blender's built-in scanline and ray-tracing renderer; used through most of the project's active life.		* '''Blender Internal''' (from August 2004) Blender's built-in scanline and ray-tracing renderer; used through most of the project's active life.
	* '''Cycles''' (from 2019 onward, in Blender 2.81a) -- Blender's [[path tracing\|path-traced]] physically-based renderer, added in what became the project's final active configuration.<ref name="burp-homepage" />		* '''Cycles''' (from 2019 onward, in Blender 2.81a) Blender's [[path tracing\|path-traced]] physically-based renderer, added in what became the project's final active configuration.<ref name="burp-homepage" />

	=== Licensing ===		=== Licensing ===
Line 199:		Line 201:
	* [[BOINC]]		* [[BOINC]]
	* [[BOINC projects\|List of BOINC projects]]		* [[BOINC projects\|List of BOINC projects]]
	* [[Blender (software)]]
	* [[Big Buck Bunny]]		* [[Big Buck Bunny]]
	* [[Render farm]]		* [[Render farm]]

Big and Ugly Rendering Project

Al Piskun — Thu, 11 Jun 2026 21:01:13 GMT

first light

New page

{{Infobox software
| name = Big and Ugly Rendering Project
| logo = Burp logo.png
| logo caption = BURP project logo
| screenshot = Big and Ugly Rendering Project.png
| caption = BURP project interface

| status = Hibernation
| category = 3D rendering
| compute = CPU

| developer = Janus Kristensen
| author = Janus Kristensen
| released = {{Start date and age|2004|06|17}}
| discontinued = c. 2020

| operating system = Windows, Linux

| website = {{URL|http://burp.renderfarming.net/}}
| license = GPL-3.0-or-later
| description = Big and Ugly Rendering Project (BURP) is a non-commercial volunteer computing project built on BOINC, designed as an openly distributed render farm for 3D animations. It is best known for rendering the high-frame-rate 4K re-release of the Blender Foundation's open film Big Buck Bunny in 2013.
}}

The '''Big and Ugly Rendering Project''' ('''BURP''') is a non-commercial [[volunteer computing]] project built on the [[BOINC]] (Berkeley Open Infrastructure for Network Computing) platform, conceived as a freely shared, community-operated [[render farm]] for [[3D computer graphics|3D animations]] and still images. The project was started in June 2004 by Danish developer Janus Kristensen and remained its de facto sole developer throughout its active life. Rather than pursuing a research goal, BURP pursued a creative one: to give artists access to amounts of rendering power that would be impossible on a single computer by pooling the idle CPU cycles of volunteers around the world.

BURP entered an extended period of hibernation around 2020 after years of low activity,<ref name="wikipedia-burp">{{cite web |title=Big and Ugly Rendering Project |url=https://en.wikipedia.org/wiki/Big_and_Ugly_Rendering_Project |website=Wikipedia |access-date=2025-06-11}}</ref> but its place in the history of [[open-source software|open-source]] creative production is secure. BURP provided the rendering infrastructure for the 2013 high-frame-rate, stereoscopic 4K re-release of ''[[Big Buck Bunny]]'', the Blender Foundation's beloved open-source animated short, with every contributing volunteer individually credited by name in the film's end titles.

== Background and motivation ==

[[File:Blender3D Carrot.jpg|thumb|right|[[Blender (software)|Blender]], the open-source 3D creation suite that became BURP's primary supported renderer from late 2004 onward.]]

[[Rendering (computer graphics)|Rendering]] is the process of generating a final 2D image or frame from a 3D scene description, accounting for lighting, materials, shadows, reflections, and depth. For photorealistic animation, each frame must be calculated individually, and a single high-quality frame can require anywhere from minutes to many hours of computation. A short animated film of ten minutes at 24 frames per second consists of 14,400 such frames. The resulting aggregate render time is typically measured in CPU-years, making the process practically impossible on a single workstation within any reasonable deadline.

Commercial animation studios address this by operating dedicated [[render farm]]s: large clusters of hundreds or thousands of computers all working in parallel. If the frames of a scene are distributed across <math>n</math> machines, and the total sequential CPU time required is <math>T_\text{total}</math>, the wall-clock duration is reduced to approximately:

:<math>T_\text{wall} \approx \frac{T_\text{total}}{n}</math>

A project requiring 1,000 CPU-hours spread across 1,000 computers could theoretically complete in a single hour. This parallelism is the economic logic behind render farms, and the social logic behind BURP: if enough volunteers donate their idle CPU time, independent artists gain access to the same order of magnitude of rendering power as professional studios, at no monetary cost.

BURP's design also incorporated a reciprocal credit model: volunteers who rendered frames for others accumulated credits that could be spent to have their own scenes rendered by the community.

== History ==

=== Founding (2004) ===

The very first test renders ran on BURP on 16 June 2004,<ref name="burp-homepage">{{cite web |title=BURP: Big and Ugly Rendering Project |url=http://burp.renderfarming.net/ |website=burp.renderfarming.net |access-date=2025-06-11}}</ref> and the project's public website went live on 17 June 2004.<ref name="isgtw-burp">{{cite web |title=iSGTW Link of the week - B.U.R.P |url=https://web.archive.org/web/20120131213344/http://www.isgtw.org/spotlight/isgtw-link-week-burp |website=iSGTW (via Wayback Machine) |date=2008-03-26 |access-date=2025-06-11}}</ref> The project was the creation of Janus Kristensen, a Danish developer who would remain its primary author throughout its active history.<ref name="alchetron">{{cite web |title=Big and Ugly Rendering Project |url=https://alchetron.com/Big-and-Ugly-Rendering-Project |website=Alchetron |access-date=2025-06-11}}</ref>

At launch, the only supported rendering engine was [[YafaRay]] (then known as Yafray, "Yet Another Free Raytracer"). By August 2004, it had become clear that YafaRay lacked the feature depth needed for general-purpose animation production, and development focus shifted to [[Blender (software)|Blender]], which offered a richer toolset and a significantly more compact file format that was better suited to the bandwidth constraints of distributing work units over the internet.<ref name="wikipedia-burp" />

By the end of October 2004, testing had demonstrated that distributed rendering of 3D animation was not only feasible but capable of throughput rivalling commercial render farms. The remainder of that year was spent improving the project's website frontend and data-transfer infrastructure.<ref name="wikipedia-burp" /> Through early 2005, major code overhauls were carried out for both the Linux and Windows clients, with a particular focus on estimating and improving data-transfer performance and developing a mirrored storage and distribution system for completed rendered output.<ref name="wikipedia-burp" />

=== Growth and the Renderfarm.fi connection (2007 to 2009) ===

Between 2007 and 2009, the '''Open Rendering Environment (ORE)''' project, run by [[Laurea University of Applied Sciences]] in Finland, conducted applied research into BURP's potential for use in Finnish small and medium-sized enterprises and higher education. The ORE project was developed under the guidance of Janus Kristensen and Julius Tuomisto, with a team composed largely of undergraduate students. As part of the initiative, an independent BURP server was established in Finland, operating under the domain name Renderfarm.fi.<ref name="wikipedia-burp" />

One output of this research was published as an academic thesis exploring distributed computing infrastructure for Renderfarm.fi, comparing BOINC-based volunteer computing with grid computing approaches and benchmarking their performance.<ref name="ore-thesis">{{cite web |title=Open Rendering Environment: Renderfarm.fi computing infrastructure |url=https://core.ac.uk/works/21913944 |website=CORE (Laurea University of Applied Sciences thesis) |access-date=2025-06-11}}</ref>

Upon opening to public beta in summer 2009, Renderfarm.fi described itself as the world's first publicly distributed render farm to advocate [[Creative Commons]] licensing for submitted content.<ref name="renderfarmfi-cc">{{cite web |title=What is Renderfarm.fi? |url=https://web.archive.org/web/20170521134108/https://www.youtube.com/watch?v=am9lYE9Tgew |website=YouTube (via Wayback Machine) |date=2009-09-01 |access-date=2025-06-11}}</ref> The main BURP project later adopted a similar Creative Commons licensing framework for content submitted through its beta phase.

Although the two projects shared a common back-end codebase, their front-end architectures differed: Renderfarm.fi used the open-source [[Django (web framework)|Django]] web application framework to manage its public-facing interface, while BURP relied on a custom solution built atop BOINC's own content management system.<ref name="wikipedia-burp" /> Renderfarm.fi operated until late 2014 before closing.

=== Beta transition and Blender integration (2010) ===

In May 2010, BURP transitioned from its long-running alpha status into a [[Software release life cycle|beta stage]], at which point users were required to agree to a new set of licensing rules aligned with [[Creative Commons]] terms.<ref name="burp-beta">{{cite web |title=BURP Forum: Beta is starting soon (Janus Kristensen) |url=https://web.archive.org/web/20110724032221/http://burp.renderfarming.net/forum_thread.php?id=1831 |website=BURP (via Wayback Machine) |access-date=2025-06-11}}</ref>

A practical barrier to wider adoption had always been the process of submitting a rendering job to BURP. To address this, a script was developed that allowed artists to send sessions to BURP directly from within the Blender application through an [[XML-RPC]] interface, without leaving their 3D workspace. From the release of Blender 2.5 Beta 3, this script was available as an officially bundled add-on within Blender's main source tree.<ref name="blender-addon">{{cite web |title=Blender 2.5 Extensions: Render Scripts (Renderfarm.fi) |url=https://web.archive.org/web/20100727080928/http://wiki.blender.org/index.php/Extensions:2.5/Py/Scripts/Release_Notes/2.53#Render_Scripts |website=Blender Wiki (via Wayback Machine) |access-date=2025-06-11}}</ref>

At the Assembly 2010 demoscene event, Kristensen was asked in an interview whether BURP encrypts or obscures the data it processes on volunteers' machines. His response captures the project's open philosophy:

{{quote|No. The whole system is based on open ideas. When you send files to people, they can look into the files and see what's inside. Actually that's part of what's cool about a project like this. It's community based and not closed down or [[Digital rights management|DRM]] protected in any way.|Janus Kristensen, AssemblyTV interview, August 2010<ref name="assemblytv">{{cite web |title=Renderfarm.fi, BURP and collaborative movie making on AssemblyTV |url=https://web.archive.org/web/20160413041028/https://www.youtube.com/watch?v=qaeq3oSs8qQ |website=AssemblyTV (via Wayback Machine) |date=2010-08-01 |access-date=2025-06-11}}</ref>}}

=== Community productions (2013 to 2015) ===

In the years following the beta launch, BURP served as the rendering engine for a small number of independently produced animated short films, most notably a series of films by animator Danan (of Thilakanathan Studios):

* '''''Tripping''''' (completed before 2013) -- a comedy-thriller about a business worker's misadventures at a hotel, described by the project as "a good example of the kind of indie production that the BURP service was originally created for."<ref name="burp-homepage" />
* '''''Theevan''''' -- a subsequent short from the same artist.
* '''''Vetri''''' -- Danan's third major production rendered through BURP.<ref name="burp-homepage" />
* '''''Uyir''''' (completed 3 December 2015) -- a fourth animated short from Danan, rendered on BURP with 657 individual contributors donating a combined total of approximately 690 CPU-months of computing time.<ref name="boincstats-news">{{cite web |title=BURP project news feed |url=https://www.boincstats.com/page/projectNews/6/ |website=BOINCstats/BAM! |access-date=2025-06-11}}</ref><ref name="burp-uyir">{{cite web |title=What "Uyir" is all about |url=http://thilakanathanstudios.com/2014/10/what-uyir-is-all-about/ |website=Thilakanathan Studios |date=2014-10-01 |access-date=2025-06-11}}</ref>

The ''Uyir'' figure of 690 CPU-months for a single short film illustrates the scale of compute resources BURP made accessible to independent artists. Rendered conventionally on a single machine, that volume of work would have taken nearly 58 years.

=== Hibernation (c. 2019 to present) ===

Forum activity on the BURP project dwindled through 2019, with the last substantive forum posts appearing around September of that year. By February 2020, the BOINC client was reporting scheduler failures when attempting to contact BURP, and the project's server status page was offline.<ref name="boincstats-forum">{{cite web |title=BURP: has it run out of air? |url=https://www.boincstats.com/forum/10/12425,1 |website=BOINCstats/BAM! |date=2020-05-17 |access-date=2025-06-11}}</ref> The project homepage at burp.renderfarming.net describes the situation as "extended maintenance" and listed an expected return date of 2027 as of the most recent retrievable snapshot.<ref name="wikipedia-burp" /> No official discontinuation announcement has been published by Kristensen.

== How BURP works ==

[[File:Boinc logo.png|thumb|The [[BOINC]] logo. BURP used the standard BOINC client-server architecture to distribute rendering work units to volunteers.]]

=== Architecture ===

BURP is built on top of the standard [[BOINC]] volunteer computing framework. An artist wishing to have a scene rendered submits a Blender project file to the BURP server via the web interface or, from 2010, via the bundled Blender add-on. The BURP server divides the animation into individual frames, each of which becomes a [[Work unit (BOINC)|work unit]] dispatched to a volunteer machine through the BOINC scheduling system.

The volunteer's BOINC client downloads the Blender file, runs the Blender rendering application locally, generates the output image frame, and returns it to the BURP server. Once all frames for a session are complete, the artist can download the finished rendered output.

=== Differences from scientific BOINC projects ===

BURP's operational model differs from scientific BOINC projects in a few significant ways:

'''Variable work availability.''' Unlike scientific projects such as [[Einstein@Home]] or [[SETI@home]], which maintain a continuous queue of work derived from the project's own research datasets, BURP depended on artists actively submitting sessions. When no sessions were queued, there was no work for volunteers. This caused the BOINC client to report "Got 0 new tasks" -- a message that was confusing to new users, as the client gave no contextual explanation.<ref name="alchetron" />

'''No redundant verification.''' Scientific BOINC projects typically send the same work unit to multiple volunteers and compare results to detect computational errors. Because BURP processed openly shared Blender source files and returned image frames that could be inspected visually, the community trust model described by Kristensen served in place of automated cryptographic verification.

'''Mutual exchange rather than donation.''' While volunteers in scientific projects donate cycles purely altruistically, BURP operated a credit exchange: participants earned credits for rendering other people's content and spent those credits to have their own content rendered by the collective.

=== Data transparency ===

All files submitted to BURP passed through volunteers' machines in plaintext, with no encryption or obfuscation. This was a deliberate design choice rather than an oversight, reflecting the Creative Commons ethos underpinning the project. Content submitted to BURP was required to be licensed under open terms compatible with this model.

== ''Big Buck Bunny'' ==

[[File:Big.Buck.Bunny.-.Opening.Screen.png|thumb|Opening frame of ''Big Buck Bunny'' (2008), the Blender Foundation's most widely distributed open-source animated short film, and the centrepiece of BURP's most celebrated project.]]

=== Background: the original film ===

''[[Big Buck Bunny]]'' (internally code-named Project Peach) is a 2008 animated comedy short film produced by the [[Blender Institute]], a division of the [[Blender Foundation]], directed by Sacha Goedegebure and produced by Ton Roosendaal. The ten-minute film follows a large, gentle rabbit who encounters three bullying rodents in a forest and ultimately outwits them using an elaborate series of slapstick traps. The film had its world premiere on 10 April 2008 at Cinema Studio in Amsterdam, with a budget of approximately €150,000.<ref name="bbb-wikipedia">{{cite web |title=Big Buck Bunny |url=https://en.wikipedia.org/wiki/Big_Buck_Bunny |website=Wikipedia |access-date=2025-06-11}}</ref>

Developed as a showcase for advancements in Blender and open-source production pipelines, the film was made entirely using free and open-source software and released under the [[Creative Commons Attribution]] 3.0 license. Both the final film and all production data including animation files, character rigs, and textures were published freely for anyone to use, modify, and redistribute.<ref name="bbb-wikipedia" /> ''Big Buck Bunny'' has since become one of the most widely distributed test files in the history of video technology, routinely used by hardware manufacturers, video codec developers, and streaming platforms to assess playback quality.<ref name="bbb-wikipedia" />

=== The Sunflower re-render project ===

The original 2008 release was produced in standard high definition (1920 x 1080 pixels) at 24 frames per second, the conventional cinema standard of the time. In the years that followed, Janus Kristensen undertook a personal project to re-render the film at specifications far exceeding the original, using BURP's volunteer network as the rendering engine. Kristensen codenamed this project '''Sunflower'''.<ref name="bbb3d-explore">{{cite web |title=Big Buck Bunny 3D: Explore |url=http://bbb3d.renderfarming.net/explore.html |website=bbb3d.renderfarming.net |access-date=2025-06-11}}</ref>

The Sunflower version delivered the following technical specifications:

{| class="wikitable"
! Parameter !! Original (2008) !! Sunflower / BURP (2013)
|-
| Resolution || 1920 x 1080 (Full HD) || 3840 x 2160 ([[4K resolution|4K UHD]])
|-
| Frame rate || 24 fps || 60 fps
|-
| Stereoscopy || None (flat 2D) || Stereoscopic 3D (left and right eye)
|-
| HDR lighting || No || Yes (HDRI)
|-
| Rendering || Blender Internal || [[Cycles (render engine)|Cycles]] path tracer
|}

The project took approximately three years of spare-time development to complete.<ref name="blendernation-bbb">{{cite web |title=Big Buck Bunny in 4K 3D Stereo 60fps |url=https://www.blendernation.com/2013/12/19/big-buck-bunny-in-4k-3d-stereo-60fps/ |website=BlenderNation |date=2013-12-19 |access-date=2025-06-11}}</ref> Converting the original film to stereoscopic 3D was particularly demanding: every scene had to be modified individually to function correctly in stereo, because the original compositions had been created for flat 2D projection. Similarly, the increase from 24 to 60 frames per second required corresponding changes to many animations to prevent motion artefacts at the higher frame rate.

The data volume of the finished render is substantial. A typical raw EXR frame from the project ranges from 20 to 40 megabytes per eye. A viewer watching the 60 fps stereoscopic version therefore sees approximately 3 gigabytes of image data stream past each second.<ref name="bbb3d-explore" /> The full output was released under the [[Creative Commons Attribution]] 3.0 license, with all source files including Blender project files, EXR frames, PNG stills, and MP4 encodes made freely available for download.<ref name="bbb3d-download">{{cite web |title=Big Buck Bunny 3D: Download |url=http://bbb3d.renderfarming.net/download.html |website=bbb3d.renderfarming.net |access-date=2025-06-11}}</ref>

=== Announcement and reception ===

The Sunflower version was completed and announced on 19 December 2013. David Anderson, the creator of BOINC at the University of California, Berkeley, posted the news to the official BOINC message board: "The animated short Big Buck Bunny has been released in hi-res (4K x 2K), high frame rate (60 FPS) and stereo. The rendering was done using BOINC by the Big and Ugly Rendering Project."<ref name="boinc-news">{{cite web |title=BOINC-rendered movie released |url=https://isaac.ssl.berkeley.edu/forum_thread.php?id=8792 |website=BOINC Project (Isaac) |date=2013-12-19 |access-date=2025-06-11}}</ref>

The release was covered by BlenderNation,<ref name="blendernation-bbb" /> Slashdot,<ref name="slashdot-bbb">{{cite web |title=Big Buck Bunny In 4K, 60 Fps and 3D-stereo |url=https://slashdot.org/story/13/12/21/199240/big-buck-bunny-in-4k-60-fps-and-3d-stereo |website=Slashdot |date=2013-12-21 |access-date=2025-06-11}}</ref> and the official Blender Foundation blog,<ref name="peach-release">{{cite web |title=High Frame Rate, 4K and Stereo 3D release |url=https://peach.blender.org/2013/12/high-frame-rate-4k-and-stereo-3d-release/ |website=Blender Foundation (peach.blender.org) |date=2013-12-19 |access-date=2025-06-11}}</ref> and attracted wide attention in the open-source and 3D graphics communities. The Sunflower release also served as a timing test for display technology: at the time of release, playing the full stereoscopic 60 fps 4K stream without dropped frames posed a meaningful challenge to consumer hardware.

=== Volunteer credits ===

BOINC volunteers who contributed CPU cycles to the ''Big Buck Bunny'' rendering work were individually acknowledged in the film's end titles. The credit block reads: "A Very Special Thanks To All of the Collaborative Online Renderfarm Contributors..." Each volunteer was asked whether they wished to be listed under their real name or their BOINC username.<ref name="boinc-synergy-forum">{{cite web |title=BURP forum thread: Big Buck Bunny |url=https://boincsynergy.ca/forum/viewtopic.php?t=89 |website=BOINC Synergy |access-date=2025-06-11}}</ref>

This personal acknowledgement was notable in the context of volunteer computing, where contributors typically receive no recognition beyond credits on a statistics leaderboard. Being named in the end titles of a Blender Foundation film distributed globally under a Creative Commons license represented a tangible and lasting form of recognition for the participants.

== Renderfarm.fi ==

[[File:Laurea-logo.jpg|thumb|right|[[Laurea University of Applied Sciences]], the Finnish institution behind the Open Rendering Environment research project that produced Renderfarm.fi.]]

Renderfarm.fi was a Finnish sister project to BURP that shared its back-end software. It was developed between 2007 and 2009 through the Open Rendering Environment (ORE) research initiative at [[Laurea University of Applied Sciences]], guided by Janus Kristensen and Julius Tuomisto, with a team of undergraduate students.<ref name="wikipedia-burp" /> An independent BURP server was set up in Finland to underpin the service.

Renderfarm.fi opened to public beta in summer 2009, positioning itself as the world's first publicly distributed render farm requiring submitted content to be licensed under Creative Commons terms.<ref name="renderfarmfi-cc" /> Unlike BURP's custom interface, Renderfarm.fi used the Django web framework to provide its public frontend, and it cultivated an active presence in the Blender creative community. The project attracted consistent work from artists while it operated.

Renderfarm.fi closed in late 2014. The closure was lamented within the BOINC volunteer community, with participants on the BOINCstats forum noting that the project had maintained a reliable supply of rendering work in a way that the original BURP project sometimes struggled to match due to the intermittent nature of session submissions.<ref name="boincstats-forum" />

== Technical details ==

=== Rendering engines ===

BURP's rendering engine support evolved over the project's lifetime:

* '''YafaRay''' (June to August 2004) -- the original supported renderer; found inadequate and replaced.
* '''Blender Internal''' (from August 2004) -- Blender's built-in scanline and ray-tracing renderer; used through most of the project's active life.
* '''Cycles''' (from 2019 onward, in Blender 2.81a) -- Blender's [[path tracing|path-traced]] physically-based renderer, added in what became the project's final active configuration.<ref name="burp-homepage" />

=== Licensing ===

The BURP software itself is distributed under the [[GNU General Public License]] version 3 (GPL-3.0-or-later).<ref name="burp-license">{{cite web |title=Licensing of BURP and related components |url=https://web.archive.org/web/20120510054504/http://development.burp.renderfarming.net/projects/burp/wiki/How_to_download_the_code |website=BURP development wiki (via Wayback Machine) |access-date=2025-06-11}}</ref> Content submitted to BURP during the beta phase was required to be compatible with Creative Commons licensing.

=== Operating systems ===

BURP's client application was available for Windows and Linux. The project's use of Blender as its rendering engine meant it could theoretically support macOS as well, though only Windows and Linux were officially maintained as BOINC application targets.

=== Naming ===

One point of potential confusion noted in documentation for the project is that the name "BURP" refers both to the BOINC project (the volunteer computing service) and to the underlying back-end software, which could be and was run independently on other servers such as Renderfarm.fi. Care is therefore needed when reading historical documentation to determine which sense of the name is in use.<ref name="wikipedia-burp" />

== Community and reception ==

Within the BOINC volunteer computing community, BURP occupied an unusual niche. While the overwhelming majority of BOINC projects directed computing power toward scientific research, BURP directed it toward creative production. This made it attractive to a somewhat different type of volunteer: people interested in open-source creative culture, animation, and 3D graphics, in addition to those already participating in science-oriented projects.

The project's dependency on artist submissions for work availability meant the experience of volunteering for BURP could be unpredictable. During periods when no sessions were queued, volunteers' machines sat idle on the project, occasionally prompting new users to assume the project was broken. Despite this friction, BURP retained a loyal following over many years, with longtime participants on BOINCstats describing it as a favourite project.<ref name="boincstats-forum" />

The Sunflower re-render of ''Big Buck Bunny'' demonstrated something not previously achieved in the BOINC ecosystem: a globally distributed volunteer network completing a major creative production at cinema-grade technical specifications. At the time of release, 4K at 60 fps stereoscopic 3D was ahead of what most commercial studios were delivering to consumer audiences, making the result a genuine technical landmark as well as a community achievement.

== See also ==

* [[BOINC]]
* [[BOINC projects|List of BOINC projects]]
* [[Blender (software)]]
* [[Big Buck Bunny]]
* [[Render farm]]
* [[Creative Commons]]
* [[SETI@home]]
* [[World Community Grid]]

== References ==

{{Reflist}}

== External links ==

* {{URL|http://burp.renderfarming.net/|BURP official website}}
* [https://web.archive.org/web/20160412011356/http://bbb3d.renderfarming.net/ Big Buck Bunny 3D Sunflower project page] (via Wayback Machine)
* [https://en.wikipedia.org/wiki/Big_and_Ugly_Rendering_Project Big and Ugly Rendering Project] on Wikipedia
* [https://www.boincstats.com/stats/6/project/detail BURP detailed statistics] on BOINCstats
* [https://boincsynergy.great-site.net/viewtopic.php?t=89 BURP discussion thread] on BOINC Synergy forum

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:3D rendering software]]
[[Category:Free software]]
[[Category:Volunteer computing]]
[[Category:Open-source culture]]

Main Page

Al Piskun — Thu, 11 Jun 2026 15:24:58 GMT

59 documented

← Older revision		Revision as of 15:24, 11 June 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">57</div>		<div class="bs-stat-number">59</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 254:		Line 254:
	\| * [[Proteins@home]] tackled the inverse protein folding problem		\| * [[Proteins@home]] tackled the inverse protein folding problem
	\| * [[QuChemPedIA@home]] run density functional theory (DFT) quantum chemistry calculations		\| * [[QuChemPedIA@home]] run density functional theory (DFT) quantum chemistry calculations
			\|-
			\|* [[Proteins@home\|T.Brada Experimental Grid]] the PADLS Total subproject aimed to find new pseudo-associative DLS
			\|* [[MLC@Home]] understanding and interpreting complex machine learning models
	\|}		\|}
	<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>

BOINC projects

Al Piskun — Thu, 11 Jun 2026 15:16:41 GMT

add See mores

← Older revision		Revision as of 15:16, 11 June 2026
Line 4,104:		Line 4,104:
	\| Cognitive science		\| Cognitive science
	\| [https://podcasts.apple.com/us/podcast/mlc-home/id1492837872?i=1000499605038 Listen]		\| [https://podcasts.apple.com/us/podcast/mlc-home/id1492837872?i=1000499605038 Listen]
	\| Understanding and interpreting complex machine learning models.		\| Understanding and interpreting complex machine learning models. [[MLC@Home\|See more...]]

	\|-		\|-
Line 4,117:		Line 4,117:
	\| Mathematics		\| Mathematics
	\|		\|
	\| The PADLS Total subproject aims to find new pseudo-associative DLS.		\| The PADLS Total subproject aims to find new pseudo-associative DLS. [[T.Brada Experimental Grid\|See more...]]

	\|-		\|-

MLC@Home

Al Piskun — Thu, 11 Jun 2026 12:17:16 GMT

first light

New page

{{Infobox software
| name = MLC@Home
| description = MLC@Home was a completed Artificial intelligence BOINC volunteer computing project dedicated to understanding and interpreting neural networks, developed by John Clemens of the CORAL Lab at the University of Maryland, Baltimore County.

| status = Completed
| category = Artificial intelligence
| compute = CPU & GPU

| developer = John Clemens
| author = John Clemens
| sponsor = Cognition, Robotics, and Learning (CORAL) Lab, University of Maryland, Baltimore County
| released = {{Start date and age|2020|07|04}}
| completed = October 2022

| programming language = C++17 (PyTorch C++ API)
| operating system = Windows (x64), Linux (AMD64, ARM, AARCH64)

| website = {{URL|https://www.mlcathome.org/}}
}}

'''MLC@Home''' ('''Machine Learning Comprehension @ Home''') was a [[BOINC|BOINC volunteer computing]] project dedicated to understanding and interpreting complex [[machine learning]] models, with an emphasis on [[neural network]]s. Launched in mid-2020 and hosted at the University of Maryland, Baltimore County (UMBC), it became the first [[Berkeley Open Infrastructure for Network Computing|BOINC]] project focused specifically on machine learning research.<ref name="mlds_paper">{{Cite arxiv |author=Clemens, John |year=2021 |title=MLDS: A Dataset for Weight-Space Analysis of Neural Networks |eprint=2104.10555 |access-date=2026-06-11}}</ref> The project completed its initial goals and shut down in October 2022, leaving behind several publicly available datasets and a published research paper.

[[File:Colored neural network.png|thumb|right|250px|A diagram of an [[artificial neural network]]. MLC@Home trained thousands of small neural networks to study how their weights differ when trained on similar or modified data.]]

== Background ==

Modern [[neural network]]s have driven remarkable progress in machine learning across fields as varied as image recognition, natural language processing, and autonomous vehicles. However, these models are often described as "black boxes": they may have hundreds of millions of parameters, making it extremely difficult to understand precisely why a given network produces a given output, or to detect when something has gone wrong internally.<ref name="mlcfaq">{{cite web |url=https://www.mlcathome.org/FAQ.html |title=MLC@Home: Frequently Asked Questions |publisher=MLC@Home Team |access-date=2026-06-11}}</ref>

This opacity is not merely a theoretical problem. As neural networks are deployed in safety-critical applications such as medical diagnosis and self-driving vehicles, researchers have growing need to detect "trojan" or backdoored networks — models that have been trained on maliciously modified data and may behave deceptively in certain circumstances.<ref name="mlds_paper"/> Traditional evaluation criteria such as [[loss function|training loss]] are inadequate for detecting such behavior, motivating the search for direct structural methods of inspecting trained models.

== Origins ==

MLC@Home was created by John Clemens, a doctoral candidate in computer science at [[UMBC]] and a member of the Cognition, Robotics, and Learning (CORAL) Lab.<ref name="mlcfaq"/> The project was publicly announced and made available to [[BOINCstats]] in early July 2020, with the admin noting at the time that it was initially a one-person effort.<ref name="boincstats_forum">{{cite web |url=https://www.boincstats.com/forum/11/12543,1 |title=New project: MLC@Home |publisher=BOINCstats |date=2020-07-04 |access-date=2026-06-11}}</ref> Shortly after its launch, MLC@Home was formally adopted as a project of the CORAL Lab at UMBC, giving it institutional backing and a longer-term home.<ref name="boincstats_forum"/>

The project described its mandate clearly from the start: to turn the tools of data science inward, and apply the same analytical techniques used to build machine learning models to understand those models from the inside. As stated on the project homepage:

{{blockquote|MLC@Home is a distributed computing project dedicated to understanding and interpreting complex machine learning models, with an emphasis on neural networks.|MLC@Home FAQ<ref name="mlcfaq"/>}}

MLC@Home is notable as the first BOINC project specifically devoted to machine learning research.<ref name="mlds_paper"/>

== Technical approach ==

=== BOINC infrastructure ===

Like other [[BOINC|BOINC volunteer computing]] projects such as [[SETI@home]] and [[Rosetta@home]], MLC@Home distributed computational work to volunteers whose computers ran the BOINC client in the background during idle time. Volunteers downloaded [[work unit]]s from the project server, processed them locally, and returned the results automatically.<ref name="mlcfaq"/>

The MLC@Home BOINC application was built using [[PyTorch]]'s C++ API, making it one of the first BOINC applications to leverage a modern deep learning framework at the infrastructure level.<ref name="mlds_paper"/> Computations were intentionally fixed at 32-bit [[floating point|floating-point]] precision to ensure consistent numerical results across CPUs and GPUs from different manufacturers.<ref name="mlds_paper"/> The client supported Windows (x64) and Linux (AMD64, ARM, and AARCH64) platforms, with optional [[GPU]] acceleration for NVIDIA and AMD graphics cards.<ref name="mlds_paper"/>

The application's source code was released publicly under an open-source license.<ref name="mlds_paper"/>

=== Weight-space analysis ===

The central scientific hypothesis motivating MLC@Home is that the ''weights'' of a trained neural network carry rich structural information about both the training process and the training data. A neural network with <math>N</math> parameters can be represented as a point in an <math>N</math>-dimensional weight space:

:<math>\mathbf{w} = (w_1, w_2, \ldots, w_N) \in \mathbb{R}^N</math>

If many networks are trained on identical data, they will converge to different points in this space due to random initialization and stochastic training, but those points should cluster together relative to networks trained on different data. MLC@Home sought to test this hypothesis empirically — and to determine whether networks containing hidden malicious behaviors (trojan networks) could be detected by their position in weight space, without running any examples through the network at all.<ref name="mlds_paper"/>

[[File:Gated Recurrent Unit, base type.png|thumb|right|220px|A [[Gated Recurrent Unit]] (GRU), the type of [[recurrent neural network]] layer used in the MLC@Home MLDS-DS1 and MLDS-DS2 datasets.]]

== Machine Learning Dataset Generator (MLDS) ==

The primary subproject run under MLC@Home was the '''Machine Learning Dataset Generator''' (MLDS), whose goal was to build one of the first and largest public collections of trained neural networks with carefully controlled training conditions.<ref name="mlds_home">{{cite web |url=https://www.mlcathome.org/mlds.html |title=MLC@Home: Machine Learning Dataset Generator |publisher=MLC@Home Team |access-date=2026-06-11}}</ref>

MLDS took a phased approach, releasing multiple datasets of increasing complexity. All datasets were published under a [[Creative Commons license|CC BY-SA 4.0]] license and remain available for download from the project website.<ref name="mlds_home"/>

=== MLDS-DS1: RNNs mimicking simple machines ===

The first dataset trained up to 50,000 [[recurrent neural network]] (RNN) models to mimic five simple abstract machines: the EightBitMachine, SingleDirectMachine, SingleInvertMachine, SimpleXORMachine, and ParityMachine.<ref name="mlds_home"/> These were originally described in the paper "Learning Device Models with Recurrent Neural Networks" (arXiv:1805.07869). Each network used four [[Gated Recurrent Unit|GRU]] layers followed by four linear layers, totalling 4,364 parameters, making them small enough to train efficiently on a standard CPU.<ref name="mlds_home"/> The dataset contains 10,000 examples of each of the five machine types. The full dataset (MLDS-DS1-10000) is approximately 3.5 GB.

=== MLDS-DS2: RNNs with a hidden trigger sequence ===

DS2 used networks with the same architecture as DS1, but with a critical modification: if a specific 3-command input sequence was present, the network's output would be inverted for the following 3 commands. This "magic sequence" created networks superficially identical to DS1 but with a hidden back-door behavior, directly simulating the kind of trojan functionality researchers want to detect.<ref name="mlds_home"/> Pairing DS1 and DS2 enables research into whether weight-space analysis can distinguish clean from compromised models.

=== MLDS-DS3: RNNs mimicking randomly-generated automata ===

DS3 stepped up significantly in complexity by training networks to mimic 100 different randomly-generated finite-state automata rather than the five fixed machines in DS1/DS2.<ref name="mlds_home"/> Each automaton was required to have at least one [[Hamiltonian path|Hamiltonian cycle]], valid transitions for all inputs, and some hidden internal states not reflected in the output. The networks trained for DS3 were correspondingly larger: 64-wide, 4-layer deep [[Long short-term memory|LSTM]] networks followed by 2 linear layers, totalling 136,846 parameters per network.<ref name="mlds_home"/> The full DS3 dataset (1,000,000 networks) occupies approximately 1.3 TB and is distributed via [[BitTorrent]] due to its size.

The progress milestones achieved under DS3 were:
* Milestone 1 (10,000 networks): Complete
* Milestone 2 (100,000 networks): Complete
* Milestone 3 (1,000,000 networks): Complete<ref name="mlchome_main">{{cite web |url=https://www.mlcathome.org/ |title=MLC@Home: Machine Learning Comprehension @ Home |publisher=MLC@Home Team |access-date=2026-06-11}}</ref>

=== MLDS-DS4: CNNs and TrojAI ===

A fourth dataset, DS4, was planned to expand beyond [[recurrent neural network|RNNs]] into [[convolutional neural network|CNNs]] and image classification, in collaboration with the [[DARPA]] [[TrojAI]] program.<ref name="mlds_home"/> The design called for training networks on both standard and adversarially poisoned image data to test whether insights from the RNN datasets generalized to the CNN domain. However, the admin noted that smaller LeCun-style CNNs proved fast enough to train locally without involving the volunteer network, and plans for distributing AlexNet-style CNNs were later dropped as their scientific marginal value over the existing datasets was unclear.<ref name="shutdown_announcement">{{cite web |url=https://boinc.netsoft-online.com/forum/general-discussion/1553/?p=1 |title=MLC@Home shutting down for now, and thank you! |date=2022-10-04 |publisher=BOINC Combined Statistics forum |access-date=2026-06-11}}</ref>

== Volunteer community ==

At the time of the MLDS paper's publication in April 2021, MLC@Home had attracted more than 2,200 volunteers contributing computing time across over 8,000 separate computers.<ref name="mlds_paper"/> Those volunteers had collectively trained more than 750,000 neural networks, at a rate of more than two newly completed models per minute.<ref name="mlds_paper"/> The project was listed and tracked by [[BOINCstats]], Free-DC, and other BOINC statistics platforms.

[[File:BOINC logo 2013.png|thumb|left|180px|The [[BOINC]] logo. MLC@Home used the BOINC platform, the same infrastructure as projects like [[SETI@home]] and [[Rosetta@home]].]]

== Research findings ==

The key findings reported in the 2021 MLDS paper were:

* Networks trained on identical data '''cluster together''' in weight space, forming distinct groupings even when initialized randomly and trained stochastically.
* Even a '''small change''' to the training data produces meaningful divergence in weight space, demonstrating that weight-space analysis is sensitive to differences in training data.
* '''Trojan networks''' (those trained on data with a hidden trigger) can be detected by their position in weight space, without running any test examples through the network at all.

These results suggested that weight-space analysis is a "viable and effective alternative to loss for evaluating neural networks,"<ref name="mlds_paper"/> opening a new avenue for interpretability and AI safety research.

The MLDS dataset has since been cited in subsequent research on trojan detection in neural networks, including work on linear weight classification methods for defeating backdoor-detection competitions.<ref name="trojan_detection">{{cite web |url=https://arxiv.org/abs/2411.03445 |title=Solving Trojan Detection Competitions with Linear Weight Classification |publisher=arXiv |access-date=2026-06-11}}</ref>

== Shutdown ==

In early October 2022, John Clemens announced that MLC@Home would be shutting down as a BOINC project. The announcement cited four completed datasets, the need to shift focus from data generation to analysis and paper writing, and the practical difficulty of attracting new research collaborators to generate new experiments.<ref name="shutdown_announcement"/> He wrote in part:

{{blockquote|We've achieved the goals I set out to accomplish (and more!) with 4 complete datasets comprising dozens of terabytes of data to analyze. Now we need to focus on analyzing the results and writing papers.|John Clemens, MLC@Home admin<ref name="shutdown_announcement"/>}}

The project homepage was updated to reflect the shutdown by October 2022, stating: "As of October 2022, the MLC@Home BOINC project has completed its initial goals and is shutting down until there are new experiments to run."<ref name="mlchome_main"/> The admin expressed hope that the project could be revived if other researchers came forward with new experiments, and that all datasets would remain publicly available.<ref name="shutdown_announcement"/>

== Publications ==

* {{Cite arxiv |author=Clemens, John |year=2021 |title=MLDS: A Dataset for Weight-Space Analysis of Neural Networks |eprint=2104.10555 |access-date=2026-06-11}}

MLC@Home is also cited as a case study in the broader volunteer computing literature, including:

* {{Cite arxiv |author=Diskin, Michael et al. |year=2021 |title=Distributed Deep Learning in Open Collaborations |eprint=2106.10207 |access-date=2026-06-11}} (cites MLC@Home as a notable example of applying volunteer computing to machine learning)
* {{Cite arxiv |author=Narayanan, Sridhar et al. |year=2021 |title=Distributed Deep Learning Using Volunteer Computing-Like Paradigm |eprint=2103.08894 |access-date=2026-06-11}} (discusses the MLDS project as a model for distributed ML data generation)

== See also ==

* [[BOINC]]
* [[SETI@home]]
* [[Rosetta@home]]
* [[World Community Grid]]
* [[BOINC projects]]

== References ==

{{Reflist}}

== External links ==

* {{URL|https://www.mlcathome.org/|MLC@Home official website}}
* {{URL|https://www.mlcathome.org/mlds.html|MLDS Datasets}}
* {{URL|https://arxiv.org/abs/2104.10555|MLDS paper on arXiv}}
* {{URL|https://coral-lab.umbc.edu|CORAL Lab, UMBC}}

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:Artificial intelligence]]
[[Category:Machine learning]]
[[Category:University of Maryland]]
[[Category:Volunteer computing]]
[[Category:2020 software]]

T.Brada Experimental Grid

Al Piskun — Thu, 11 Jun 2026 11:44:54 GMT

enter stats

← Older revision		Revision as of 11:44, 11 June 2026
(One intermediate revision by the same user not shown)
Line 6:		Line 6:
	\| category = Mathematics		\| category = Mathematics
	\| compute = CPU		\| compute = CPU
	\| dependencies = ~~None~~		\| dependencies =

	\| developer = Tomáš Brada		\| developer = Tomáš Brada
Line 14:		Line 14:

	\| operating system = Windows, Linux (64-bit)		\| operating system = Windows, Linux (64-bit)

			\| stats as of = {{Start date and age\|2022\|07\|16}}
			\| average performance = 1190.83 GigaFLOPS
			\| active users = 76
			\| total users = 521
			\| active hosts = 138
			\| total hosts = 659

	\| website = {{URL\|https://boinc.tbrada.eu/}}		\| website = {{URL\|https://boinc.tbrada.eu/}}
	}}		}}

	'''T.Brada Experimental Grid''' (abbreviated '''TBEG''') was a [[volunteer computing]] project built on the [[BOINC]] (Berkeley Open Infrastructure for Network Computing) platform. Founded in February 2019 by Slovak developer Tomáš Brada, the project served as both a personal BOINC development testbed and a home for several mathematical sub-projects in number theory and combinatorics. The project ran until December 2022, when its final administrator announced it would no longer distribute compute work.		'''[https://web.archive.org/web/20220816033844/https://boinc.tbrada.eu/ T.Brada Experimental Grid]''' (abbreviated '''TBEG''') was a [[volunteer computing]] project built on the [[BOINC]] (Berkeley Open Infrastructure for Network Computing) platform. Founded in February 2019 by Slovak developer Tomáš Brada, the project served as both a personal BOINC development testbed and a home for several mathematical sub-projects in number theory and combinatorics. The project ran until December 2022, when its final administrator announced it would no longer distribute compute work.

	~~[[File:Boinc logo.png\|right\|200px\|thumb\|The BOINC platform logo. T.Brada Experimental Grid ran on BOINC server software.]]~~

	== Background and founding ==		== Background and founding ==
Line 31:		Line 36:

	== Sub-projects ==		== Sub-projects ==
			[[File:Most perfect magic square construction.svg\|thumb\|435x435px\|An example of a diagonal Latin square. T.Brada Experimental Grid's PADLS Total sub-project searched for pseudo-associative variants of such structures.]]
	At its most active, T.Brada Experimental Grid ran three distinct sub-projects simultaneously, each tackling a different area of mathematics or software development.<ref name="boincsynergy-forum">{{Cite web \|url=https://boincsynergy.ca/forum/viewtopic.php?t=28 \|title=T.Brada Experimental Grid \|publisher=BOINC Synergy \|access-date=2026-06-11 }}</ref>		At its most active, T.Brada Experimental Grid ran three distinct sub-projects simultaneously, each tackling a different area of mathematics or software development.<ref name="boincsynergy-forum">{{Cite web \|url=https://boincsynergy.ca/forum/viewtopic.php?t=28 \|title=T.Brada Experimental Grid \|publisher=BOINC Synergy \|access-date=2026-06-11 }}</ref>

Line 67:		Line 72:

	The third sub-project, '''Lua Alfa''', was purely an experimental software development effort. Its application was used to test an in-development [[Lua (programming language)\|Lua]] runtime environment for BOINC. The goal was to expand what is possible under the BOINC platform and improve ease of deployment by enabling script-based applications rather than traditionally compiled binaries. The application was limited to Linux, and tasks took only a few minutes at most.<ref name="boincsynergy-forum" />		The third sub-project, '''Lua Alfa''', was purely an experimental software development effort. Its application was used to test an in-development [[Lua (programming language)\|Lua]] runtime environment for BOINC. The goal was to expand what is possible under the BOINC platform and improve ease of deployment by enabling script-based applications rather than traditionally compiled binaries. The application was limited to Linux, and tasks took only a few minutes at most.<ref name="boincsynergy-forum" />

	~~[[File:Latin-square-1.png\|right\|240px\|thumb\|An example of a diagonal Latin square. T.Brada Experimental Grid's PADLS Total sub-project searched for pseudo-associative variants of such structures.]]~~

	== Infrastructure and history ==		== Infrastructure and history ==
Line 91:		Line 94:

	== Legacy and continuation ==		== Legacy and continuation ==
			[[File:BOINC logo.png\|right\|frameless\|150x150px\|The BOINC platform logo. T.Brada Experimental Grid ran on BOINC server software.]]
	Following the project's closure, the volunteer community showed continued interest in preserving the SPT work. In June 2023, a call was posted on the T.Brada Experimental Grid front page from colleagues attempting to restore the Symmetric Prime Tuples project on a new BOINC server, using Brada's publicly available source code. As of the post, the code had not yet been successfully recompiled.<ref>{{Cite web \|url=https://boinc.tbrada.eu/ \|title=T.Brada Experimental Grid: We ask for help! \|publisher=T.Brada Experimental Grid \|date=2023-06-23 \|access-date=2026-06-11 }}</ref>		Following the project's closure, the volunteer community showed continued interest in preserving the SPT work. In June 2023, a call was posted on the T.Brada Experimental Grid front page from colleagues attempting to restore the Symmetric Prime Tuples project on a new BOINC server, using Brada's publicly available source code. As of the post, the code had not yet been successfully recompiled.<ref>{{Cite web \|url=https://boinc.tbrada.eu/ \|title=T.Brada Experimental Grid: We ask for help! \|publisher=T.Brada Experimental Grid \|date=2023-06-23 \|access-date=2026-06-11 }}</ref>

T.Brada Experimental Grid

Al Piskun — Thu, 11 Jun 2026 10:00:54 GMT

first light

New page

{{Infobox software
| name = T.Brada Experimental Grid
| description = T.Brada Experimental Grid was a completed Mathematics BOINC volunteer computing project running three sub-projects: Symmetric Prime Tuples, PADLS Total, and Lua Alfa, developed and administered by Tomáš Brada and later Veronika, active from February 2019 to December 2022.

| status = Completed
| category = Mathematics
| compute = CPU
| dependencies = None

| developer = Tomáš Brada
| author = Tomáš Brada
| released = {{Start date and age|2019|02|03}}
| discontinued = {{Start date and age|2022|12|24}}

| operating system = Windows, Linux (64-bit)

| website = {{URL|https://boinc.tbrada.eu/}}
}}

'''T.Brada Experimental Grid''' (abbreviated '''TBEG''') was a [[volunteer computing]] project built on the [[BOINC]] (Berkeley Open Infrastructure for Network Computing) platform. Founded in February 2019 by Slovak developer Tomáš Brada, the project served as both a personal BOINC development testbed and a home for several mathematical sub-projects in number theory and combinatorics. The project ran until December 2022, when its final administrator announced it would no longer distribute compute work.

[[File:Boinc logo.png|right|200px|thumb|The BOINC platform logo. T.Brada Experimental Grid ran on BOINC server software.]]

== Background and founding ==

T.Brada Experimental Grid was created by Tomáš Brada, a software developer from Slovakia, who described the project's primary purpose plainly on its home page: "This project serves as a development system for the project administrator."<ref>{{Cite web |url=https://boinc.tbrada.eu/ |title=T.Brada Experimental Grid |publisher=Tomáš Brada |access-date=2026-06-11 }}</ref> Rather than being organized around a single narrow research goal, the project was an experimental platform where Brada could develop and test new BOINC application technologies while simultaneously offering useful mathematical computation to the volunteer computing community.

The project launched under the name '''Pseudo Associative DLS''' before being renamed T.Brada Experimental Grid.<ref name="bcwiki">{{Cite web |url=https://wiki.bc-team.org/index.php?title=T.Brada_Experimental_Grid/en |title=T.Brada Experimental Grid |publisher=BC-Wiki |access-date=2026-06-11 }}</ref> By September 2019 the project's name had been officially updated in the BOINCstats database at the administrator's request.<ref name="boincstats-rename">{{Cite web |url=https://www.boincstats.com/forum/10/12312 |title=Forum: Tomáš Brada Experimental Grid |publisher=BOINCstats |access-date=2026-06-11 }}</ref>

The Scottish BOINC Team noted in January 2020 that T.Brada Experimental Grid had "been active since late spring 2019" and that it had become a marathon project in Formula BOINC 2020, though they described it candidly as "definitely an alpha project."<ref>{{Cite web |url=https://tsbt.co.uk/forum/viewtopic.php?t=17391 |title=T.Brada Experimental Grid |publisher=The Scottish BOINC Team |access-date=2026-06-11 }}</ref>

== Sub-projects ==

At its most active, T.Brada Experimental Grid ran three distinct sub-projects simultaneously, each tackling a different area of mathematics or software development.<ref name="boincsynergy-forum">{{Cite web |url=https://boincsynergy.ca/forum/viewtopic.php?t=28 |title=T.Brada Experimental Grid |publisher=BOINC Synergy |access-date=2026-06-11 }}</ref>

=== Symmetric Prime Tuples (SPT) ===

The most prominent sub-project was the search for '''Symmetric Prime Tuples''', launched on 18 October 2019.<ref name="tbrada-news">{{Cite web |url=https://boinc.tbrada.eu/old_news.php |title=News archive |publisher=T.Brada Experimental Grid |access-date=2026-06-11 }}</ref> This sub-project was a direct continuation of the defunct '''Stop@home''' project, which had been searching for symmetric prime ''k''-tuples of consecutive primes in the range from 0 up to <math>2^{64}</math>.<ref name="stopathome">{{Cite web |url=https://www.boincusa.com/forum/index.php?threads%2Fnew-project-stop-home.229%2F= |title=New Project: Stop@Home |publisher=BOINC Team USA |access-date=2026-06-11 }}</ref>

A '''symmetric prime tuple''' of length <math>k</math> with diameter <math>d</math> is a prime tuple with a pattern <math>H = (h_1, h_2, \ldots, h_k)</math> satisfying the condition:

:<math>h_i + h_{k+1-i} = d \quad \text{for all } i</math>

This means the prime elements of the tuple are distributed symmetrically about a common center. The '''diameter''' <math>d</math> of a ''k''-tuple is the difference between its largest and smallest elements.<ref>{{Cite web |url=https://www.primepuzzles.net/problems/prob_062.htm |title=Problem 62. Symmetric k-tuples of consecutive primes |publisher=Prime Puzzles |access-date=2026-06-11 }}</ref>

The Hardy-Littlewood constant for a pattern <math>\mathcal{H}</math> of length <math>k</math> is:

:<math>\mathfrak{S}(\mathcal{H}) = \prod_{p} \left( 1 - \frac{\nu_p(\mathcal{H})}{p} \right) \left( 1 - \frac{1}{p} \right)^{-k}</math>

where <math>\nu_p(\mathcal{H})</math> is the number of distinct residues modulo <math>p</math> covered by the pattern.<ref>{{Cite web |url=https://arxiv.org/pdf/2601.08889 |title=Dependencies of prime numbers in a tuple |publisher=arXiv |access-date=2026-06-11 }}</ref> The symmetry of the pattern imposes strict constraints on these residues: for <math>p = 2</math>, it is always the case that <math>\nu_2(\mathcal{H}) = 1</math>, since all elements of the tuple are odd.

The SPT application extended the original Stop@home search in several important ways. In addition to searching for symmetric prime tuples, it also searched for '''twin prime tuples''', '''symmetric twin prime tuples''', and '''prime tuple gaps''', and the search interval was extended beyond what Stop@home had covered.<ref name="boincsynergy-forum" /> An early result reported by Stop@home was the discovery of the minimal 17-tuple starting at 159,067,808,851,610,411 with offsets {0, 42, 60, 96, 102, 186, 210, 240, 246, 252, 282, 306, 390, 396, 432, 450, 492}.<ref>{{Cite web |url=https://www.primepuzzles.net/problems/prob_062.htm |title=Problem 62. Symmetric k-tuples of consecutive primes |publisher=Prime Puzzles |access-date=2026-06-11 }}</ref>

Once the SPT application had covered the full range previously handled by Stop@home while also scanning for the new tuple types up to the same range, Brada issued four new collector badges to thank contributors. He also announced plans to submit results to the [[OEIS|On-Line Encyclopedia of Integer Sequences (OEIS)]].<ref name="boincstats-news">{{Cite web |url=https://www.boincstats.com/page/projectNews/184/ |title=T.Brada Experimental Grid news feed |publisher=BOINCstats |access-date=2026-06-11 }}</ref> Later batches pushed the search interval up to <math>5 \times 10^{17}</math> and beyond.

The source code for the SPT application was developed by Tomáš Brada and is publicly available on GitHub.<ref>{{Cite web |url=https://github.com/tomasbrod/tbboinc/blob/primes/symprtu/spt.cpp |title=spt.cpp |publisher=GitHub / tomasbrod |access-date=2026-06-11 }}</ref>

=== PADLS Total ===

The second sub-project, '''PADLS Total''', aimed to find new '''pseudo-associative diagonal Latin squares''' (PADLS), a structure described by mathematician Natalia Makarova.<ref name="boincsynergy-forum" /> This work placed T.Brada Experimental Grid alongside related projects such as [[ODLK]] and [[ODLK1]], which searched for orthogonal diagonal Latin squares of order 10.

A '''diagonal Latin square''' is an <math>n \times n</math> Latin square in which both the main diagonal and the back diagonal are also transversals (containing each symbol exactly once).<ref>{{Cite web |url=https://mathworld.wolfram.com/LatinSquare.html |title=Latin Square |publisher=Wolfram MathWorld |access-date=2026-06-11 }}</ref> A pair of diagonal Latin squares is '''orthogonal''' (ODLS) if, when superimposed, each ordered pair of symbols appears exactly once.

Over the first three months of the PADLS Total rule 51 experiment, more than 700,000 unique canonical forms of orthogonal diagonal Latin squares were found, including five rare groups of ODLS pairs in groups of three and four.<ref name="boincstats-news" /> The PADLS Total sub-project remained running until the end of the project, though Brada throttled its workunit output in later years to conserve power while he focused on other areas.<ref name="boincstats-news" />

=== Lua Alfa ===

The third sub-project, '''Lua Alfa''', was purely an experimental software development effort. Its application was used to test an in-development [[Lua (programming language)|Lua]] runtime environment for BOINC. The goal was to expand what is possible under the BOINC platform and improve ease of deployment by enabling script-based applications rather than traditionally compiled binaries. The application was limited to Linux, and tasks took only a few minutes at most.<ref name="boincsynergy-forum" />

[[File:Latin-square-1.png|right|240px|thumb|An example of a diagonal Latin square. T.Brada Experimental Grid's PADLS Total sub-project searched for pseudo-associative variants of such structures.]]

== Infrastructure and history ==

=== Database crashes ===

The project experienced significant technical difficulties during its operation. Around 20 February 2020, a database crash occurred. Fortunately no data was lost, as all data had been backed up. Brada posted a news item titled "Database Crash and Recovery" to reassure volunteers, and the project came back online shortly afterward.<ref name="boincstats-rename" />

An expired SSL certificate in early 2020 (valid only from 5 January 2020 to 5 April 2020) caused connection problems for volunteers and led some in the community to assume the project had been abandoned.<ref>{{Cite web |url=https://www.boincstats.com/forum/10/12455 |title=Forum: T.Brada Experimental Grid: EXPIRED SECURITY CERTIFICATE |publisher=BOINCstats |access-date=2026-06-11 }}</ref>

=== COVID-19 response ===

On 16 March 2020, in response to the global COVID-19 pandemic, Brada disabled distribution of new PADLS Total workunits with a note to volunteers: "Because of the global situation, I am disabling distribution of new PADLS tot5 workunits in an attempt to divert the compute attention to Folding@Home."<ref name="boincstats-ssl">{{Cite web |url=https://www.boincstats.com/forum/10/12455 |title=Forum: T.Brada Experimental Grid certificate |publisher=BOINCstats |access-date=2026-06-11 }}</ref>

=== Closure ===

On 24 December 2022, an administrator signing as '''Veronika''' posted a farewell message to the project's community:

{{Quote|Dear Crunchers of this project. Let me wish you merry christmas and happy winter solstice. It weights my hearth to write this message, but things had come to a point where it is better to end things, rather than endlessly drag them out to no end. Since the summer, I have been hopelessly stomped by a stream of activity, both happy and necessary. It turned out to be impossible to care about this project... It is time to announce that this project will no longer provide any compute jobs. I will, of course, keep the site running, but since there is no work, no new users can get enough points to post, the forums will effectively be dead.<ref name="closure">{{Cite web |url=https://boinc.tbrada.eu/ |title=T.Brada Experimental Grid: Time to say goodbye |publisher=T.Brada Experimental Grid |date=2022-12-24 |access-date=2026-06-11 }}</ref>}}

The BOINCstats thread for the closure was reported in December 2022.<ref>{{Cite web |url=https://www.boincstats.com/forum/8/12881,1 |title=Forum: T.Brada Experimental Grid termination |publisher=BOINCstats |date=2022-12-25 |access-date=2026-06-11 }}</ref>

== Legacy and continuation ==

Following the project's closure, the volunteer community showed continued interest in preserving the SPT work. In June 2023, a call was posted on the T.Brada Experimental Grid front page from colleagues attempting to restore the Symmetric Prime Tuples project on a new BOINC server, using Brada's publicly available source code. As of the post, the code had not yet been successfully recompiled.<ref>{{Cite web |url=https://boinc.tbrada.eu/ |title=T.Brada Experimental Grid: We ask for help! |publisher=T.Brada Experimental Grid |date=2023-06-23 |access-date=2026-06-11 }}</ref>

The broader work on orthogonal diagonal Latin squares in the PADLS Total sub-project was carried forward by the continuing [[ODLK]] and [[ODLK1]] projects, and the newer [[ODLK2025]] project launched in December 2024. The SETI Germany wiki noted that T.Brada Experimental Grid was essentially the continuation of Stop@home in the area of prime tuple research.<ref>{{Cite web |url=https://www.seti-germany.de/wiki/T.Brada_Experimental_Grid |title=T.Brada Experimental Grid |publisher=SETI Germany Wiki |access-date=2026-06-11 }}</ref>

== Software and applications ==

The project supported 64-bit Windows and Linux platforms. The three application types were:<ref name="bcwiki" />

* '''PADLS Total 5.10''' for Windows and Linux (64-bit)
* '''Symmetric Prime Tuples 3.00''' for Windows and Linux (64-bit)
* '''Lua Alfa (beta) 0.04''' for Linux only

The project did not use GPU computing. Workunits for the SPT and PADLS sub-projects ran on CPU only, and tasks were designed to be short-running, especially for the Lua sub-project where completion times were described as taking "a few minutes at most."<ref name="boincsynergy-forum" />

== See also ==

* [[BOINC]]
* [[ODLK]]
* [[ODLK1]]
* [[ODLK2025]]
* [[PrimeGrid]]
* [[SRBase]]
* [[Gerasim@home]]
* [[RakeSearch]]
* [[BOINC projects]]

== References ==

{{Reflist}}

== External links ==

* {{URL|https://boinc.tbrada.eu/}} -- Official project website (no longer distributing work)
* [https://github.com/tomasbrod/tbboinc GitHub: tbboinc source code by Tomáš Brada]
* [https://wiki.bc-team.org/index.php?title=T.Brada_Experimental_Grid/en BC-Wiki entry (English)]
* [https://www.boincstats.com/page/projectNews/184/ BOINCstats project news archive]
* [https://www.seti-germany.de/wiki/T.Brada_Experimental_Grid SETI Germany Wiki entry]

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:Mathematics]]
[[Category:Number theory]]
[[Category:Volunteer computing]]
[[Category:2019 establishments]]
[[Category:2022 disestablishments]]

BOINC projects

Al Piskun — Wed, 10 Jun 2026 21:47:07 GMT

add QuChemPedIA@home See more...

← Older revision		Revision as of 21:47, 10 June 2026
Line 4,130:		Line 4,130:
	\| Molecular Chemistry		\| Molecular Chemistry
	\| [https://podcasts.apple.com/us/podcast/quchempedia/id1492837872?i=1000484760287 Listen]		\| [https://podcasts.apple.com/us/podcast/quchempedia/id1492837872?i=1000484760287 Listen]
	\| Help chemical researchers around the world by building a unique collection of results and also help our AIs to propose much more new targets for the different applications we are addressing than we could do on our own.		\| Help chemical researchers around the world by building a unique collection of results and also help our AIs to propose much more new targets for the different applications we are addressing than we could do on our own. [[QuChemPedIA@home\|See more...]]

	\|-		\|-

Main Page

Al Piskun — Wed, 10 Jun 2026 21:44:48 GMT

add QuChemPedIA@home

SPACIOUS@home

Al Piskun — Wed, 10 Jun 2026 17:49:13 GMT

QuChemPedIA@home

Al Piskun — Tue, 09 Jun 2026 12:48:21 GMT

formatting

← Older revision		Revision as of 12:48, 9 June 2026
Line 22:		Line 22:

	'''QuChemPedIA@home''' (short for '''Qu'''antum '''Chem'''istry Collaborative Encyclop'''edIA''', with a nod to ''Intelligence Artificielle'') was a [[volunteer computing]] project running on the [[BOINC]] platform, hosted at the [[University of Angers]] in France. Active from October 2019 to April 2023, the project recruited volunteers worldwide to donate idle CPU time to run [[density functional theory]] (DFT) quantum chemistry calculations on small organic molecules. Its ultimate goal was to build an open encyclopedia of quantum molecular chemistry results and to fuel artificial intelligence research aimed at drug discovery, materials science, and energy applications.		'''QuChemPedIA@home''' (short for '''Qu'''antum '''Chem'''istry Collaborative Encyclop'''edIA''', with a nod to ''Intelligence Artificielle'') was a [[volunteer computing]] project running on the [[BOINC]] platform, hosted at the [[University of Angers]] in France. Active from October 2019 to April 2023, the project recruited volunteers worldwide to donate idle CPU time to run [[density functional theory]] (DFT) quantum chemistry calculations on small organic molecules. Its ultimate goal was to build an open encyclopedia of quantum molecular chemistry results and to fuel artificial intelligence research aimed at drug discovery, materials science, and energy applications.

	[[File:Formaldehyde Molecular Orbitals.jpg\|thumb\|right\|200px\|Molecular orbitals of formaldehyde computed with quantum chemistry methods. QuChemPedIA@home computed similar properties for hundreds of thousands of small organic molecules.]]

	== Background and motivation ==		== Background and motivation ==
Line 43:		Line 41:

	== Scientific objectives ==		== Scientific objectives ==

			[[File:Formaldehyde Molecular Orbitals.jpg\|thumb\|383x383px\|Molecular orbitals of formaldehyde computed with quantum chemistry methods. QuChemPedIA@home computed similar properties for hundreds of thousands of small organic molecules.]]

	=== Building an open quantum chemistry encyclopedia ===		=== Building an open quantum chemistry encyclopedia ===
Line 71:		Line 71:
	* The energy of the Lowest Unoccupied Molecular Orbital (LUMO), <math>E_{\text{LUMO}}</math>		* The energy of the Lowest Unoccupied Molecular Orbital (LUMO), <math>E_{\text{LUMO}}</math>
	* The HOMO-LUMO gap, <math>\Delta E = E_{\text{LUMO}} - E_{\text{HOMO}}</math>, which describes the molecule's chemical reactivity and optical properties		* The HOMO-LUMO gap, <math>\Delta E = E_{\text{LUMO}} - E_{\text{HOMO}}</math>, which describes the molecule's chemical reactivity and optical properties

	[[File:Molecular Orbitals for Water.png\|thumb\|right\|200px\|Molecular orbital diagram for a water molecule. QuChemPedIA@home calculated similar frontier orbital properties (HOMO and LUMO energies) for hundreds of thousands of small organic molecules.]]

	=== Work unit distribution ===		=== Work unit distribution ===
Line 83:		Line 81:

	== Project history ==		== Project history ==

			[[File:Molecular Orbitals for Water.png\|thumb\|376x376px\|Molecular orbital diagram for a water molecule. QuChemPedIA@home calculated similar frontier orbital properties (HOMO and LUMO energies) for hundreds of thousands of small organic molecules.]]

	=== Launch (October 2019) ===		=== Launch (October 2019) ===
Line 131:		Line 131:

	== Context: the QM9 and PC9 benchmarks ==		== Context: the QM9 and PC9 benchmarks ==

			[[File:Gallic acid ESP.png\|thumb\|338x338px\|Electrostatic potential map (ESP) of gallic acid, a type of visualization generated from DFT output files like those collected by QuChemPedIA@home.]]

	QuChemPedIA@home's work was closely connected to two benchmark datasets used in molecular machine learning:		QuChemPedIA@home's work was closely connected to two benchmark datasets used in molecular machine learning:
Line 147:		Line 149:

	The molecular generator EvoMol, developed in conjunction with the project, is open-source and hosted on GitHub at {{URL\|https://github.com/jules-leguy/EvoMol}}. The related QuChemReport tool for reading and analyzing NWChem output logs is also open-source, available at {{URL\|https://github.com/tcauchy/quchemreport}}.		The molecular generator EvoMol, developed in conjunction with the project, is open-source and hosted on GitHub at {{URL\|https://github.com/jules-leguy/EvoMol}}. The related QuChemReport tool for reading and analyzing NWChem output logs is also open-source, available at {{URL\|https://github.com/tcauchy/quchemreport}}.

	~~[[File:Gallic acid ESP.png\|thumb\|right\|200px\|Electrostatic potential map (ESP) of gallic acid, a type of visualization generated from DFT output files like those collected by QuChemPedIA@home.]]~~

	The BOINC server ran on hardware maintained by the LERIA laboratory at the University of Angers. Computing tasks for Linux users ran natively, while Windows and macOS volunteers required VirtualBox to be installed to run the virtual machine wrapper.<ref name="bcwiki" />		The BOINC server ran on hardware maintained by the LERIA laboratory at the University of Angers. Computing tasks for Linux users ran natively, while Windows and macOS volunteers required VirtualBox to be installed to run the virtual machine wrapper.<ref name="bcwiki" />

QuChemPedIA@home

Al Piskun — Tue, 09 Jun 2026 12:45:09 GMT

first light

New page

{{Infobox software
| name = QuChemPedIA@home
| description = QuChemPedIA@home was a completed Chemistry BOINC project running DFT quantum chemistry calculations on volunteer computers, operated by the LERIA and MOLTECH-Anjou laboratories at the University of Angers, France.

| status = Completed
| category = Chemistry / Computational chemistry
| compute = CPU
| dependencies = VirtualBox (Windows, macOS); native (Linux)

| developer = Benoit Da Mota, Thomas Cauchy
| author = Benoit Da Mota, Thomas Cauchy
| sponsor = University of Angers
| maintainer = Benoit Da Mota (LERIA)
| released = {{Start date and age|2019|07|01}}
| completed = {{Start date and age|2022|09|29}}

| programming language = Python, Shell (wrapper); NWChem (computation)
| operating system = Windows, Linux, macOS

| website = {{URL|https://quchempedia.univ-angers.fr/athome/}}
}}

'''QuChemPedIA@home''' (short for '''Qu'''antum '''Chem'''istry Collaborative Encyclop'''edIA''', with a nod to ''Intelligence Artificielle'') was a [[volunteer computing]] project running on the [[BOINC]] platform, hosted at the [[University of Angers]] in France. Active from October 2019 to April 2023, the project recruited volunteers worldwide to donate idle CPU time to run [[density functional theory]] (DFT) quantum chemistry calculations on small organic molecules. Its ultimate goal was to build an open encyclopedia of quantum molecular chemistry results and to fuel artificial intelligence research aimed at drug discovery, materials science, and energy applications.

[[File:Formaldehyde Molecular Orbitals.jpg|thumb|right|200px|Molecular orbitals of formaldehyde computed with quantum chemistry methods. QuChemPedIA@home computed similar properties for hundreds of thousands of small organic molecules.]]

== Background and motivation ==

Quantum chemistry has become nearly indispensable in modern chemical research. By solving approximations to the [[Schrödinger equation]] for electrons in a molecule, researchers can predict properties such as total energy, molecular geometry, and frontier orbital energies (the [[HOMO]] and [[LUMO]]) without ever needing to synthesize the compound in a laboratory. Despite the importance of these calculations, the researchers behind QuChemPedIA@home observed that the raw data produced by such computations was almost never shared openly: files were kept in local lab storage or simply discarded after a paper was published.<ref name="project-about">{{cite web |title=What is QuChemPedIA@home? |url=https://quchempedia.univ-angers.fr/athome/ |publisher=University of Angers |accessdate=2025-05-01}}</ref>

At the same time, the field of [[machine learning]] was producing models capable of predicting molecular properties at a fraction of the cost of a full quantum chemical calculation, but only when trained on large, diverse, high-quality datasets. The bottleneck was computing power: generating hundreds of thousands of DFT-level results for novel molecules could require years on a typical academic cluster. QuChemPedIA@home addressed both problems at once by building a large, freely available dataset of quantum chemical results with the help of volunteer computing.<ref name="project-about" />

The name is a portmanteau of ''quantum chemistry'', ''encyclopedia'', and the French phrase ''intelligence artificielle'' (artificial intelligence), reflecting the project's dual mission of archiving and enabling AI-driven molecular exploration.<ref name="bcwiki">{{cite web |title=QuChemPedIA@home (English) |url=https://wiki.bc-team.org/index.php?title=QuChemPedIA@home/en |publisher=BC-Wiki |accessdate=2025-05-01}}</ref>

== Research team ==

The project was founded and operated by two researchers at the University of Angers:

* '''Benoit Da Mota''', an assistant professor of computer science at the [[LERIA]] laboratory (Laboratoire d'Etude et de Recherche en Informatique d'Angers), who handled the BOINC infrastructure, input generation, and AI/optimization aspects of the work.<ref name="github-report">{{cite web |title=quchemreport on GitHub |url=https://github.com/BenoitDamota/QuChemReport |accessdate=2025-05-01}}</ref>
* '''Thomas Cauchy''', an assistant professor of chemistry at the [[MOLTECH-Anjou]] laboratory (UMR CNRS 6200), who oversaw the computational chemistry and molecular generation aspects.<ref name="github-report" />

Other significant contributors to the associated research included Jules Leguy, Marta Glavatskikh, and Beatrice Duval, all affiliated with the University of Angers.<ref name="evomol-paper">{{cite journal |last1=Leguy |first1=Jules |last2=Cauchy |first2=Thomas |last3=Glavatskikh |first3=Marta |last4=Duval |first4=Beatrice |last5=Da Mota |first5=Benoit |year=2020 |title=EvoMol: a flexible and interpretable evolutionary algorithm for unbiased de novo molecular generation |journal=Journal of Cheminformatics |volume=12 |issue=1 |pages=55 |doi=10.1186/s13321-020-00458-z |pmid=33431049 |pmc=7494000}}</ref>

== Scientific objectives ==

=== Building an open quantum chemistry encyclopedia ===

The project's first and foundational goal was to create a large, openly accessible repository of quantum chemical calculation results. Every output file produced by a volunteer's computer was to be retained and made available for reuse, in contrast to the prevailing norm of discarding raw data after publication.<ref name="project-about" />

The philosophy was one of open science: if quantum mechanical models of molecules are used in virtually every major chemistry publication, then the computational results underpinning those models should be treated as a public scientific resource rather than a private lab asset.

=== Exploring chemical space with artificial intelligence ===

The project's second goal was to enable AI-driven exploration of chemical space. The space of theoretically possible small organic molecules is astronomically large: even restricting attention to molecules with up to nine non-hydrogen atoms drawn from carbon, oxygen, nitrogen, and fluorine, the combinatorial space is far beyond what any human can survey. Generative molecular models, which learn to propose new molecules with desired properties, were seen as a way to navigate this space efficiently.<ref name="project-about" />

Such models require large, diverse datasets of accurate molecular properties for training. QuChemPedIA@home was designed to be the engine that provided those properties at scale.

== Computing methodology ==

=== NWChem and density functional theory ===

All molecular calculations in the project were carried out with [[NWChem]], an open-source ab initio computational chemistry software package developed at the [[Environmental Molecular Sciences Laboratory]] of [[Pacific Northwest National Laboratory]] (PNNL) and distributed under the Educational Community License 2.0.<ref name="nwchem-wiki">{{cite web |title=NWChem |url=https://en.wikipedia.org/wiki/NWChem |publisher=Wikipedia |accessdate=2025-05-01}}</ref>

The primary level of theory used was [[Density functional theory|DFT]] with the [[B3LYP]] functional, a widely used hybrid exchange-correlation functional. The 3-21G basis set was used for lighter tasks (short work units), while the project later introduced longer tasks at higher accuracy levels.<ref name="evomol-paper" /><ref name="od9-paper">{{cite journal |last1=Leguy |first1=Jules |last2=Glavatskikh |first2=Marta |last3=Cauchy |first3=Thomas |last4=Da Mota |first4=Benoit |year=2021 |title=Scalable estimator of the diversity for de novo molecular generation resulting in a more robust QM dataset (OD9) and a more efficient molecular optimization |journal=Journal of Cheminformatics |volume=13 |issue=1 |pages=76 |doi=10.1186/s13321-021-00554-8 |pmid=34600576 |pmc=8487551}}</ref>

For each candidate molecule, the key quantities computed were:

* The total electronic energy <math>E_{\text{total}}</math>
* The geometry of the molecule at its energy minimum
* The energy of the Highest Occupied Molecular Orbital (HOMO), <math>E_{\text{HOMO}}</math>
* The energy of the Lowest Unoccupied Molecular Orbital (LUMO), <math>E_{\text{LUMO}}</math>
* The HOMO-LUMO gap, <math>\Delta E = E_{\text{LUMO}} - E_{\text{HOMO}}</math>, which describes the molecule's chemical reactivity and optical properties

[[File:Molecular Orbitals for Water.png|thumb|right|200px|Molecular orbital diagram for a water molecule. QuChemPedIA@home calculated similar frontier orbital properties (HOMO and LUMO energies) for hundreds of thousands of small organic molecules.]]

=== Work unit distribution ===

Input files for NWChem were generated automatically by scripts written by the team.<ref name="od9-paper" /> On Linux, a native wrapper ran NWChem directly. On Windows and macOS, the calculations ran inside a [[VirtualBox]] virtual machine to ensure consistent results across heterogeneous hardware.<ref name="bcwiki" />

The project offered two types of work unit: standard ("NWChem") tasks lasting several hours, and "NWChem long" tasks that could run for several dozen hours, intended for higher-accuracy calculations.<ref name="bcwiki" /> Because many candidate molecules are chemically unstable or otherwise unsuitable for the level of theory employed, a significant fraction of work units were expected to fail; the BOINC infrastructure resubmitted failed tasks to other hosts before declaring a definitive error.<ref name="od9-paper" />

To guard against cheating and erroneous results, redundancy and validation checks were built into the distribution system. Credits and rankings provided an incentive for volunteers to continue contributing.<ref name="od9-paper" />

== Project history ==

=== Launch (October 2019) ===

QuChemPedIA@home opened to the public in October 2019, following an earlier alpha/testing phase during which registration required an invitation code. Benoit Da Mota first announced the project to the BOINC community in September 2019 via the BOINCstats forum, noting that work units were challenging and could last several days apiece.<ref name="boincstats-forum">{{cite web |title=New projects: QuChemPedIA@home |url=https://www.boincstats.com/forum/11/12307 |publisher=BOINCstats/BAM! |date=2019-09-10 |accessdate=2025-05-01}}</ref> After working out early technical difficulties, the project opened fully, and statistics exports were made available for tracking sites.<ref name="boincstats-forum" />

=== First scientific publication (September 2020): EvoMol ===

In September 2020 the team published ''EvoMol: a flexible and interpretable evolutionary algorithm for unbiased de novo molecular generation'' in the ''Journal of Cheminformatics''. The paper described an open-source evolutionary algorithm that builds molecular graphs by applying a set of seven generic atomic-level mutations, starting from as simple a compound as methane, and can optimize molecules for multiple objectives simultaneously (for example, drug-likeness scores such as QED, synthesizability, or frontier orbital energies).<ref name="evomol-paper" />

QuChemPedIA@home's contribution to this paper was substantial: the BOINC community recalculated more than 200,000 compounds from the union of the QM9 and PC9 benchmark datasets at the B3LYP/3-21G level of theory, providing a consistent reference corpus for EvoMol's benchmarking.<ref name="evomol-paper" />

=== Server failure and resilience (March 2021) ===

In March 2021 the server hosting the project went offline for five days due to a failure on the system disks. The team worked to restore the server without data loss and brought disk redundancy back online.<ref name="project-about" />

=== Second scientific publication (October 2021): OD9 dataset ===

In October 2021 the team published a second open-access paper, ''Scalable estimator of the diversity for de novo molecular generation resulting in a more robust QM dataset (OD9) and a more efficient molecular optimization'', in the ''Journal of Cheminformatics''. This paper introduced both a fast, chemically meaningful diversity metric and a new quantum chemical dataset named OD9, containing 435,032 molecules.<ref name="od9-paper" />

The 435,032 NWChem log files that make up the OD9 dataset were all calculated by the QuChemPedIA@home BOINC project volunteers.<ref name="od9-paper" /> The dataset encompasses QM9 and PC9 molecules as well as approximately 250,000 new compounds generated by EvoMol with a chemical diversity objective, covering molecules with up to nine heavy atoms from carbon, oxygen, nitrogen, and fluorine. The OD9 dataset was released as an open-access Figshare collection.<ref name="od9-paper" />

The publication opened with the observation that the well-known QM9 benchmark dataset, used extensively in molecular machine learning, suffers from insufficient chemical diversity, which limits the generalizability of models trained on it. The OD9 dataset was designed to address this by incorporating molecularly diverse compounds generated specifically to fill gaps in chemical space.<ref name="od9-paper" />

=== Winding down (August 2022) ===

On 29 August 2022, Da Mota posted a message to project members explaining that the campaign was nearing its end. While the project could potentially submit many more calculations, the priority had shifted to analyzing and publishing the data already generated. He also noted that the team had developed a new approach to greatly reduce the rate of failed calculations on unstable molecules, which would appear in a future article.<ref name="project-about" />

He acknowledged that the project had been built and operated on a very limited budget and had not secured major external funding despite multiple grant applications, a situation he described as discouraging.<ref name="boinc-conf">{{cite web |title=QuChemPedIA project update (August 2022) |url=https://quchempedia.univ-angers.fr/athome/ |publisher=University of Angers |accessdate=2025-05-01}}</ref>

=== Retirement (April 2023) ===

QuChemPedIA@home retired in April 2023, as recorded by the BC-Wiki tracking database.<ref name="bcwiki" /> The project website and server remained accessible for some time after retirement.

== Datasets produced ==

The project produced two major publicly available quantum chemical datasets:

{| class="wikitable"
! Dataset !! Molecules !! Level of theory !! Notes
|-
| QM9 + PC9 recalculation || ~200,000 || B3LYP/3-21G || Recalculated reference corpus for EvoMol benchmarking; acknowledged in the EvoMol paper<ref name="evomol-paper" />
|-
| OD9 || 435,032 || B3LYP/3-21G (NWChem) || Released as open Figshare collection; includes QM9, PC9, and ~250k new diversity-optimized molecules<ref name="od9-paper" />
|}

The OD9 dataset is available at: {{URL|https://doi.org/10.6084/m9.figshare.c.5180513.v1}}

== Context: the QM9 and PC9 benchmarks ==

QuChemPedIA@home's work was closely connected to two benchmark datasets used in molecular machine learning:

* '''QM9''': A dataset of 133,885 small organic molecules, each with up to nine non-hydrogen atoms (C, H, N, O, F), with geometries optimized and properties computed at the B3LYP/6-31G(2df,p) level. QM9 became a standard benchmark for machine learning predictions of molecular properties.<ref name="pc9-paper">{{cite journal |last1=Glavatskikh |first1=Marta |last2=Leguy |first2=Jules |last3=Hunault |first3=Gilles |last4=Cauchy |first4=Thomas |last5=Da Mota |first5=Benoit |year=2019 |title=Dataset's chemical diversity limits the generalizability of machine learning predictions |journal=Journal of Cheminformatics |volume=11 |issue=1 |pages=69 |doi=10.1186/s13321-019-0391-2 |pmid=33430991 |pmc=6852905}}</ref>

* '''PC9''': A dataset of 99,234 molecules extracted from PubChem with the same heavy-atom constraints as QM9, computed at B3LYP/6-31G(d). PC9 was introduced by the Angers team in a 2019 paper co-authored by Glavatskikh, Leguy, Hunault, Cauchy, and Da Mota, which showed that PC9 encompassed greater chemical diversity than QM9 and that ML models trained on it generalised better across datasets.<ref name="pc9-paper" />

The central statistical quantity used in both DFT computations and ML model evaluation is the atomisation energy, defined as:

<math>E_{\text{atomisation}} = E_{\text{total}} - \sum_{A} E_A</math>

where <math>E_A</math> is the energy of each constituent atom in isolation.

== Software and infrastructure ==

The molecular generator EvoMol, developed in conjunction with the project, is open-source and hosted on GitHub at {{URL|https://github.com/jules-leguy/EvoMol}}. The related QuChemReport tool for reading and analyzing NWChem output logs is also open-source, available at {{URL|https://github.com/tcauchy/quchemreport}}.

[[File:Gallic acid ESP.png|thumb|right|200px|Electrostatic potential map (ESP) of gallic acid, a type of visualization generated from DFT output files like those collected by QuChemPedIA@home.]]

The BOINC server ran on hardware maintained by the LERIA laboratory at the University of Angers. Computing tasks for Linux users ran natively, while Windows and macOS volunteers required VirtualBox to be installed to run the virtual machine wrapper.<ref name="bcwiki" />

== Scientific publications ==

The following peer-reviewed papers were produced using data generated by or in connection with QuChemPedIA@home:

# {{cite journal |last1=Glavatskikh |first1=Marta |last2=Leguy |first2=Jules |last3=Hunault |first3=Gilles |last4=Cauchy |first4=Thomas |last5=Da Mota |first5=Benoit |year=2019 |title=Dataset's chemical diversity limits the generalizability of machine learning predictions |journal=Journal of Cheminformatics |volume=11 |issue=1 |pages=69 |doi=10.1186/s13321-019-0391-2 |pmid=33430991 |pmc=6852905}}

# {{cite journal |last1=Leguy |first1=Jules |last2=Cauchy |first2=Thomas |last3=Glavatskikh |first3=Marta |last4=Duval |first4=Beatrice |last5=Da Mota |first5=Benoit |year=2020 |title=EvoMol: a flexible and interpretable evolutionary algorithm for unbiased de novo molecular generation |journal=Journal of Cheminformatics |volume=12 |issue=1 |pages=55 |doi=10.1186/s13321-020-00458-z |pmid=33431049 |pmc=7494000}}

# {{cite journal |last1=Leguy |first1=Jules |last2=Glavatskikh |first2=Marta |last3=Cauchy |first3=Thomas |last4=Da Mota |first4=Benoit |year=2021 |title=Scalable estimator of the diversity for de novo molecular generation resulting in a more robust QM dataset (OD9) and a more efficient molecular optimization |journal=Journal of Cheminformatics |volume=13 |issue=1 |pages=76 |doi=10.1186/s13321-021-00554-8 |pmid=34600576 |pmc=8487551}}

# {{cite book |last1=Leguy |first1=Jules |last2=Cauchy |first2=Thomas |last3=Duval |first3=Beatrice |last4=Da Mota |first4=Benoit |year=2022 |chapter=Predicting Interatomic Distances of Molecular Quantum Chemistry Calculations |title=Advances in Knowledge Discovery and Management |volume=1004 |series=Studies in Computational Intelligence |publisher=Springer |doi=10.1007/978-3-030-90287-2_8}}

# {{cite journal |last1=Cauchy |first1=Thomas |last2=Leguy |first2=Jules |last3=Da Mota |first3=Benoit |year=2023 |title=Definition and exploration of realistic chemical spaces using the connectivity and cyclic features of ChEMBL and ZINC |journal=Digital Discovery |publisher=Royal Society of Chemistry |doi=10.1039/D2DD00092J}}

== Legacy ==

QuChemPedIA@home demonstrated that volunteer distributed computing could meaningfully contribute to cutting-edge computational chemistry and machine learning research on a minimal budget. The OD9 dataset produced by the project's volunteers remains publicly available and has been cited in subsequent research on molecular generation and chemical space exploration.<ref name="od9-paper" />

The project is a notable example of the convergence of open science, volunteer computing, and AI-driven chemistry: raw quantum chemical data collected from thousands of volunteer computers around the world was transformed into freely available training material for molecular AI systems with potential applications in drug discovery, organic photovoltaics, and materials design.

== See also ==

* [[BOINC]]
* [[QMC@Home]]
* [[Volunteer computing]]
* [[Density functional theory]]
* [[NWChem]]

== References ==

{{Reflist}}

== External links ==

* {{URL|https://quchempedia.univ-angers.fr/athome/|QuChemPedIA@home official project page}}
* {{URL|https://github.com/jules-leguy/EvoMol|EvoMol source code on GitHub}}
* {{URL|https://github.com/tcauchy/quchemreport|QuChemReport source code on GitHub}}
* {{URL|https://doi.org/10.6084/m9.figshare.c.5180513.v1|OD9 dataset on Figshare}}
* {{URL|https://jcheminf.biomedcentral.com/articles/10.1186/s13321-021-00554-8|OD9 paper (open access)}}
* {{URL|https://jcheminf.biomedcentral.com/articles/10.1186/s13321-020-00458-z|EvoMol paper (open access)}}

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:Chemistry]]
[[Category:Computational chemistry]]
[[Category:Machine learning]]
[[Category:University of Angers]]
[[Category:Volunteer computing]]

BOINC Central

Al Piskun — Tue, 09 Jun 2026 12:21:21 GMT

formatting

← Older revision		Revision as of 12:21, 9 June 2026
Line 41:		Line 41:
	== Overview ==		== Overview ==
	BOINC Central gives scientists access to the power of volunteer computing without having to operate a BOINC server. It was publicly launched on '''26 November 2021'''<ref>{{cite web \|url=https://boinc.berkeley.edu/central/ \|title=Welcome to BOINC Central \|publisher=University of California, Berkeley \|date=26 November 2021 \|access-date=2026-05-18}}</ref> and is operated by the [[Wikipedia:University of California, Berkeley\|University of California, Berkeley]] BOINC project, under the direction of research scientist [[Wikipedia:David P. Anderson\|David P. Anderson]].		BOINC Central gives scientists access to the power of volunteer computing without having to operate a BOINC server. It was publicly launched on '''26 November 2021'''<ref>{{cite web \|url=https://boinc.berkeley.edu/central/ \|title=Welcome to BOINC Central \|publisher=University of California, Berkeley \|date=26 November 2021 \|access-date=2026-05-18}}</ref> and is operated by the [[Wikipedia:University of California, Berkeley\|University of California, Berkeley]] BOINC project, under the direction of research scientist [[Wikipedia:David P. Anderson\|David P. Anderson]].
	[[File:BOINC Manager Screenshot.jpg\|thumb\|The BOINC platform, which BOINC Central runs on, was originally developed to support SETI@home.]]		[[File:BOINC Manager Screenshot.jpg\|thumb\|The BOINC platform, which BOINC Central runs on, was originally developed to support SETI@home.\|514x514px]]
	The project is one of approximately 26 projects listed on BOINC's official roster as of early 2026.<ref name=boinc-wikipedia>{{cite web \|url=https://en.wikipedia.org/wiki/Berkeley_Open_Infrastructure_for_Network_Computing \|title=Berkeley Open Infrastructure for Network Computing \|publisher=Wikipedia \|access-date=2026-05-18}}</ref> Unlike other BOINC projects that serve a single research team, BOINC Central acts as a '''shared scientific computing service''' – a central hub where multiple independent scientists can submit workloads without having to build or maintain their own volunteer-computing infrastructure.		The project is one of approximately 26 projects listed on BOINC's official roster as of early 2026.<ref name=boinc-wikipedia>{{cite web \|url=https://en.wikipedia.org/wiki/Berkeley_Open_Infrastructure_for_Network_Computing \|title=Berkeley Open Infrastructure for Network Computing \|publisher=Wikipedia \|access-date=2026-05-18}}</ref> Unlike other BOINC projects that serve a single research team, BOINC Central acts as a '''shared scientific computing service''' – a central hub where multiple independent scientists can submit workloads without having to build or maintain their own volunteer-computing infrastructure.

Line 95:		Line 95:

	== Technical Infrastructure ==		== Technical Infrastructure ==
			[[File:Cd20.png\|thumb\|AutoDock Vina is used for molecular docking and virtual drug screening.\|330x330px]]
	=== AutoDock Vina ===		=== AutoDock Vina ===
	~~[[File:Cd20.png\|thumb\|AutoDock Vina is used for molecular docking and virtual drug screening.]]~~
	[[Wikipedia:AutoDock Vina\|AutoDock Vina]] is an open-source program for molecular docking originally designed by Dr. Oleg Trott at the Molecular Graphics Lab (now the Center for Computational Structural Biology, CCSB) at [[Wikipedia:The Scripps Research Institute\|The Scripps Research Institute]].<ref>{{cite web \|url=https://vina.scripps.edu/ \|title=AutoDock Vina \|publisher=The Scripps Research Institute \|access-date=2026-05-18}}</ref> It is one of the most widely used tools in computational drug discovery, allowing researchers to predict how small molecules (potential drug candidates) bind to protein receptors. AutoDock Vina achieves roughly a two-orders-of-magnitude speed increase over earlier versions while improving the accuracy of binding mode predictions, and leverages multithreading across CPU cores.<ref>{{cite journal \|url=https://pmc.ncbi.nlm.nih.gov/articles/PMC3041641/ \|title=AutoDock Vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization and multithreading \|journal=Journal of Computational Chemistry \|year=2010 \|volume=31 \|pages=455–461 \|doi=10.1002/jcc.21334}}</ref>		[[Wikipedia:AutoDock Vina\|AutoDock Vina]] is an open-source program for molecular docking originally designed by Dr. Oleg Trott at the Molecular Graphics Lab (now the Center for Computational Structural Biology, CCSB) at [[Wikipedia:The Scripps Research Institute\|The Scripps Research Institute]].<ref>{{cite web \|url=https://vina.scripps.edu/ \|title=AutoDock Vina \|publisher=The Scripps Research Institute \|access-date=2026-05-18}}</ref> It is one of the most widely used tools in computational drug discovery, allowing researchers to predict how small molecules (potential drug candidates) bind to protein receptors. AutoDock Vina achieves roughly a two-orders-of-magnitude speed increase over earlier versions while improving the accuracy of binding mode predictions, and leverages multithreading across CPU cores.<ref>{{cite journal \|url=https://pmc.ncbi.nlm.nih.gov/articles/PMC3041641/ \|title=AutoDock Vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization and multithreading \|journal=Journal of Computational Chemistry \|year=2010 \|volume=31 \|pages=455–461 \|doi=10.1002/jcc.21334}}</ref>

Line 103:		Line 102:

	=== The BOINC Platform ===		=== The BOINC Platform ===
	~~[[File:BOINC logo.png\|thumb\|The BOINC logo. BOINC has been in development since 2002.]]~~
	BOINC (pronounced {{IPAc-en\|b\|ɔɪ\|ŋ\|k}}, rhyming with "oink") is an open-source middleware system for volunteer computing developed at the [[Wikipedia:UC Berkeley Space Sciences Laboratory\|UC Berkeley Space Sciences Laboratory]]. As of 2021 it brought together 34,236 active participants employing 136,341 active computers worldwide, processing on average 20.164 [[Wikipedia:PetaFLOPS\|PetaFLOPS]] daily.<ref name=boinc-wikipedia/> It supports applications across medicine, molecular biology, mathematics, linguistics, climatology, environmental science, and astrophysics. BOINC Central is listed among the projects available to the Android BOINC mobile client.<ref name=boinc-wikipedia/>		BOINC (pronounced {{IPAc-en\|b\|ɔɪ\|ŋ\|k}}, rhyming with "oink") is an open-source middleware system for volunteer computing developed at the [[Wikipedia:UC Berkeley Space Sciences Laboratory\|UC Berkeley Space Sciences Laboratory]]. As of 2021 it brought together 34,236 active participants employing 136,341 active computers worldwide, processing on average 20.164 [[Wikipedia:PetaFLOPS\|PetaFLOPS]] daily.<ref name=boinc-wikipedia/> It supports applications across medicine, molecular biology, mathematics, linguistics, climatology, environmental science, and astrophysics. BOINC Central is listed among the projects available to the Android BOINC mobile client.<ref name=boinc-wikipedia/>

Line 126:		Line 124:

	== How to Participate ==		== How to Participate ==
			[[File:BOINC logo.png\|right\|frameless\|150x150px]]
	Volunteers can contribute computing power by:		Volunteers can contribute computing power by:
	# Downloading and installing the [https://boinc.berkeley.edu/ BOINC client]		# Downloading and installing the [https://boinc.berkeley.edu/ BOINC client]

MilkyWay@home

Al Piskun — Mon, 08 Jun 2026 17:34:30 GMT

update info

Show changes

BlackHoles@Home

Al Piskun — Mon, 08 Jun 2026 17:17:52 GMT

← Older revision		Revision as of 17:17, 8 June 2026
(One intermediate revision by the same user not shown)
Line 77:		Line 77:

	== Related Work ==		== Related Work ==
	* [[wikipedia:Numerical relativity]]		* [[wikipedia:Numerical relativity\|Numerical relativity]]
	* [[wikipedia:Gravitational wave]]		* [[wikipedia:Gravitational wave\|Gravitational wave]]
	* [[wikipedia:LIGO Scientific Collaboration]]		* [[wikipedia:LIGO Scientific Collaboration\|LIGO Scientific Collaboration]]
	* [[wikipedia:BOINC]]		* [[wikipedia:Berkeley_Open_Infrastructure_for_Network_Computing\|BOINC]]
	* [[~~wikipedia:~~Einstein@Home]]		* [[Einstein@Home]]

	== External links ==		== External links ==
	* https://blackholesathome.net/		* {{URL\|https://blackholesathome.net/}}
	* https://github.com/nrpy/nrpy		* {{URL\|https://github.com/nrpy/nrpy}}
	* https://boinc.berkeley.edu/		* {{URL\|https://boinc.berkeley.edu/}}

	== References ==		== References ==
	<references />		<references />

Template:Cite encyclopedia

Al Piskun — Mon, 08 Jun 2026 17:08:28 GMT

← Older revision		Revision as of 17:08, 8 June 2026
Line 4:		Line 4:
	\| encyclopedia= {{{encyclopedia\|{{{work\|}}}}}}		\| encyclopedia= {{{encyclopedia\|{{{work\|}}}}}}
	\| url = {{{url\|}}}		\| url = {{{url\|}}}
	\| access-date = {{{access-date\|{{{accessdate\|}}}}}}}		\| access-date = {{{access-date\|{{{accessdate\|}}}}}}
	\| author = {{{author\|{{{last\|}}}}}}		\| author = {{{author\|{{{last\|}}}}}}
	\| first = {{{first\|}}}		\| first = {{{first\|}}}
Line 18:		Line 18:
	== Template:Cite encyclopedia ==		== Template:Cite encyclopedia ==
	Formats a citation to an encyclopedia or reference work entry.		Formats a citation to an encyclopedia or reference work entry.

	=== Parameters ===		=== Parameters ===
	{\| class="wikitable"		{\| class="wikitable"
Line 43:		Line 42:
	\| <code>isbn</code> \|\| ISBN of the work		\| <code>isbn</code> \|\| ISBN of the work
	\|}		\|}
			[[Category:Citation templates]]
			</noinclude>

Template:Citation

Al Piskun — Mon, 08 Jun 2026 16:54:44 GMT

← Older revision		Revision as of 16:54, 8 June 2026
Line 1:		Line 1:
	<includeonly>{{#if:{{{author\|{{{last\|}}}}}}\|{{{last\|{{{author\|}}}}}}{{#if:{{{first\|}}}\|, {{{first\|}}}}}. \|}}{{#if:{{{date\|{{{year\|}}}}}}\|({{{date\|{{{year\|}}}}}}}). \|}}{{#if:{{{url\|}}}\|[{{{url}}} {{{title\|}}}]\|{{{title\|}}}}}{{#if:{{{encyclopedia\|{{{work\|{{{journal\|}}}}}}}}}\|. ''{{{encyclopedia\|{{{work\|{{{journal\|}}}}}}}}}''\|}}{{#if:{{{publisher\|}}}\|. {{{publisher\|}}}\|}}{{#if:{{{pages\|}}}\|. pp. {{{pages\|}}}\|}}{{#if:{{{doi\|}}}\|. DOI: {{{doi\|}}}\|}}{{#if:{{{isbn\|}}}\|. ISBN {{{isbn\|}}}\|}}{{#if:{{{access-date\|{{{accessdate\|}}}}}}\|. Retrieved {{{access-date\|{{{accessdate\|}}}}}}}.\|.}}</includeonly><noinclude>		<includeonly>{{#if:{{{author\|{{{last\|}}}}}}\|{{{last\|{{{author\|}}}}}}{{#if:{{{first\|}}}\|, {{{first\|}}}}}. \|}}{{#if:{{{date\|{{{year\|}}}}}}\|({{{date\|{{{year\|}}}}}}). \|}}{{#if:{{{url\|}}}\|[{{{url}}} {{{title\|}}}]\|{{{title\|}}}}}{{#if:{{{encyclopedia\|{{{work\|{{{journal\|}}}}}}}}}\|. ''{{{encyclopedia\|{{{work\|{{{journal\|}}}}}}}}}''\|}}{{#if:{{{publisher\|}}}\|. {{{publisher\|}}}\|}}{{#if:{{{pages\|}}}\|. pp. {{{pages\|}}}\|}}{{#if:{{{doi\|}}}\|. DOI: {{{doi\|}}}\|}}{{#if:{{{isbn\|}}}\|. ISBN {{{isbn\|}}}\|}}{{#if:{{{access-date\|{{{accessdate\|}}}}}}\|. Retrieved {{{access-date\|{{{accessdate\|}}}}}}.\|.}}</includeonly><noinclude>
	== Template:Citation ==		== Template:Citation ==
	A general-purpose citation template. Called by {{tl\|Cite web}}, {{tl\|Cite journal}}, {{tl\|Cite encyclopedia}}, and others.		A general-purpose citation template. Called by {{tl\|Cite web}}, {{tl\|Cite journal}}, {{tl\|Cite encyclopedia}}, and others.

Proteins@home

Al Piskun — Mon, 08 Jun 2026 16:13:27 GMT

External links

Show changes

Universe@Home

Al Piskun — Mon, 08 Jun 2026 14:14:03 GMT

← Older revision		Revision as of 14:14, 8 June 2026
Line 38:		Line 38:
	\| license = Mixed / research software		\| license = Mixed / research software
	}}		}}

	~~[[File:{{#setmainimage:Universe@home.jpg}}\|alt=Universe@home logo image\|center\|frameless]]~~

	BOINC project '''''[https://universeathome.pl/universe/ Universe@Home]''''' is a '''[[wikipedia:Volunteer computing\|volunteer computing]]''' project focused on astrophysics, stellar evolution, compact objects, and gravitational-wave astronomy. The project uses the computing power donated by volunteers around the world through the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|BOINC]] platform to simulate some of the most extreme events in the Universe.<ref>{{cite web \|url=https://universeathome.pl/universe/ \|title=Universe@Home \|publisher=Universe@Home}}</ref>		BOINC project '''''[https://universeathome.pl/universe/ Universe@Home]''''' is a '''[[wikipedia:Volunteer computing\|volunteer computing]]''' project focused on astrophysics, stellar evolution, compact objects, and gravitational-wave astronomy. The project uses the computing power donated by volunteers around the world through the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|BOINC]] platform to simulate some of the most extreme events in the Universe.<ref>{{cite web \|url=https://universeathome.pl/universe/ \|title=Universe@Home \|publisher=Universe@Home}}</ref>

BOINC project screensavers

Al Piskun — Mon, 08 Jun 2026 13:13:12 GMT

External links: better link

← Older revision		Revision as of 13:13, 8 June 2026
Line 387:		Line 387:
	* [https://www.youtube.com/playlist?list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy BOINC Screensavers — full YouTube playlist]		* [https://www.youtube.com/playlist?list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy BOINC Screensavers — full YouTube playlist]
	* [https://github.com/BOINC/boinc/wiki/BOINC-screensaver BOINC screensaver technical documentation (GitHub)]		* [https://github.com/BOINC/boinc/wiki/BOINC-screensaver BOINC screensaver technical documentation (GitHub)]
	* [[commons:Category:~~Berkeley_Open_Infrastructure_for_Network_Computing~~\|BOINC media on Wikimedia Commons]]		* [[commons:Category:Berkeley_Open_Infrastructure_for_Network_Computing_projects\|BOINC media on Wikimedia Commons]]

	[[Category:BOINC]]		[[Category:BOINC]]

Main Page

Al Piskun — Mon, 08 Jun 2026 12:14:50 GMT

add Proteins@home

← Older revision		Revision as of 12:14, 8 June 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">55</div>		<div class="bs-stat-number">56</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 251:		Line 251:
	\|* [[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
			\|
	\|}		\|}
	<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>

Template:Small

Al Piskun — Mon, 08 Jun 2026 12:07:38 GMT

first light

New page

<includeonly><span style="font-size:85%;">{{{1}}}</span></includeonly><noinclude>
Wraps inline text in a smaller font size (85% of the surrounding text).

Usage: <code><nowiki>{{small|your text here}}</nowiki></code>

[[Category:Formatting templates]]
</noinclude>

Proteins@home

Al Piskun — Mon, 08 Jun 2026 12:03:26 GMT

first light

New page

{{Infobox software
| name = Proteins@home
| screenshot = Proteins.gif
| caption = The Proteins@home screensaver, visualising a rotating protein structure
| description = Proteins@home was a completed Biochemistry BOINC project that tackled the inverse protein folding problem, operated by the Laboratoire de Biochimie at École Polytechnique, Palaiseau, France, from December 2006 to June 2008.

| status = Completed
| category = Biochemistry
| compute = CPU
| dependencies = None

| developer = Thomas Simonson et al., École Polytechnique
| author = Thomas Simonson
| sponsor = Laboratoire de Biochimie (CNRS UMR 7654), École Polytechnique
| released = {{Start date and age|2006|12|28}}
| completed = June 2008

| operating system = Windows, Linux, macOS

| website = {{URL|http://biology.polytechnique.fr/proteinsathome/}} {{small|(archived)}}
}}

'''Proteins@home''' (styled ''proteins@home'') was a non-profit [[volunteer computing]] project built on the [[Berkeley Open Infrastructure for Network Computing]] (BOINC) platform.<ref name="wikipedia">{{cite encyclopedia |title=Proteins@home |encyclopedia=Wikipedia |url=https://en.wikipedia.org/wiki/Proteins@home |access-date=2026-06-08}}</ref> The project ran from December 28, 2006 to June 2008 and was operated by the Laboratoire de Biochimie (CNRS UMR 7654) in the Department of Biology at [[École Polytechnique]], located in Palaiseau, near Paris, France.<ref name="boinc-news">{{cite web |url=https://boinc.berkeley.edu/forum_thread.php?id=5136 |title=The Proteins@Home project is now open |publisher=BOINC Message Boards |date=2006-12-28 |access-date=2026-06-08}}</ref> Its scientific goal was to map the ''inverse protein folding problem'' across approximately 1,500 representative [[protein fold|protein folds]], building a database of pairwise energy functions that could be used to predict protein structure, understand protein evolution, and design new proteins with potential biomedical applications.<ref name="projdescription">{{cite web |url=https://web.archive.org/web/20070601000000*/http://biology.polytechnique.fr/proteinsathome/ |title=proteins@home |publisher=Wayback Machine |access-date=2026-06-08}}</ref>

[[File:Protein-structure.png|thumb|250px|right|The four levels of protein structure — from the primary amino-acid sequence through to a tertiary fold. The relationship between sequence and fold was at the heart of the Proteins@home project.<ref>{{cite web |url=https://commons.wikimedia.org/wiki/File:Protein-structure.png |title=File:Protein-structure.png |publisher=Wikimedia Commons |access-date=2026-06-08}}</ref>]]

== Background ==

=== Protein folding and the inverse problem ===

Every [[protein]] is a chain of [[amino acid]]s. The linear sequence of the chain — the ''primary structure'' — ultimately determines the protein's three-dimensional shape, or ''fold''. Formally, a protein of length <math>n</math> has a primary structure <math>s = (a_1, a_2, \ldots, a_n)</math> where each <math>a_i</math> belongs to the set of 20 standard amino acids. The chain folds by minimising its free energy, which includes contributions from electrostatics, van der Waals forces, and interactions with the solvent.

The ''inverse'' of this prediction problem asks: given a known three-dimensional fold, which amino acid sequences are compatible with it? This is known as the '''inverse protein folding problem''' or '''computational protein design''' (CPD). It has applications in understanding protein evolution, identifying stabilising mutations, and engineering entirely new proteins for biomedical or industrial purposes.

A key feature that made the problem tractable for distributed computing is that the energy can be expressed as a sum over all pairs of residue positions:

:<math>E_\text{total} = \sum_{i < j} E(a_i, r_i,\, a_j, r_j)</math>

where <math>E(a_i, r_i, a_j, r_j)</math> is the pairwise interaction energy between amino acid types <math>a_i</math> and <math>a_j</math> at positions <math>i</math> and <math>j</math> in rotamer conformations <math>r_i</math> and <math>r_j</math>. Because each pairwise term is independent of all others, the energy table can be precomputed in parallel across thousands of volunteer computers with almost no communication required.<ref name="jcc2008">{{cite journal |last1=Schmidt Am Busch |first1=Marcel |last2=Lopes |first2=Anne |last3=Mignon |first3=David |last4=Simonson |first4=Thomas |date=2008-05-29 |title=Computational protein design: software implementation, parameter optimization, and performance of a simple model |journal=Journal of Computational Chemistry |volume=29 |issue=7 |pages=1092–1102 |doi=10.1002/jcc.20870 |pmid=18069664 |issn=1096-987X |s2cid=890739}}</ref>

== Project description ==

=== Launch and operation ===

Proteins@home was formally announced as open on December 28, 2006, when BOINC project administrator David Anderson posted on the BOINC message boards that the project was "now open" and "based at the École Polytechnique in Paris."<ref name="boinc-news"/> Volunteers could register and download the BOINC client to begin donating CPU cycles to the project.

[[File:Ecole Polytechnique France seen from lake DSC03389.JPG|thumb|250px|left|The campus of [[École Polytechnique]] at Palaiseau, France, home of the Laboratoire de Biochimie (CNRS UMR 7654) that ran Proteins@home.<ref>{{cite web |url=https://commons.wikimedia.org/wiki/File:Ecole_Polytechnique_France_seen_from_lake_DSC03389.JPG |title=File:Ecole Polytechnique France seen from lake DSC03389.JPG |publisher=Wikimedia Commons |access-date=2026-06-08}}</ref>]]

The research team was led by '''Thomas Simonson''', with contributions from '''Marcel Schmidt am Busch''', '''Anne Lopes''', '''David Mignon''', '''Thomas Gaillard''', '''Najette Amara''', and '''Christine Bathelt''', all based at the Laboratoire de Biochimie (CNRS UMR 7654), Department of Biology, École Polytechnique, 91128 Palaiseau, France.<ref name="bmc2008">{{cite journal |last1=Schmidt am Busch |first1=Marcel |last2=Lopes |first2=Anne |last3=Amara |first3=Najette |last4=Bathelt |first4=Christine |last5=Simonson |first5=Thomas |date=2008-03-13 |title=Testing the Coulomb/Accessible Surface Area solvent model for protein stability, ligand binding, and protein design |journal=BMC Bioinformatics |volume=9 |page=148 |doi=10.1186/1471-2105-9-148 |pmid=18366628 |pmc=2292695}}</ref><ref name="proteus">{{cite web |url=https://proteus.polytechnique.fr/ |title=The Proteus software for computational protein design |publisher=École Polytechnique |access-date=2026-06-08}}</ref>

The BOINC news feed recorded on February 7, 2008 that "Proteins@Home has resumed operations",<ref name="boinc-newsfeed">{{cite web |url=https://github.com/BOINC/boinc-site/blob/master/boinc_news.php |title=boinc_news.php (BOINC site source) |publisher=GitHub / BOINC |access-date=2026-06-08}}</ref> indicating a temporary interruption before the project reopened to participants. The project concluded in June 2008.

During its operational period, the Proteins@home distributed computing platform was used by volunteers in over 100 countries.<ref name="plosone2010">{{cite journal |last1=Schmidt am Busch |first1=Marcel |last2=Sedano |first2=Audrey |last3=Simonson |first3=Thomas |date=2010-05-05 |title=Computational Protein Design: Validation and Possible Relevance as a Tool for Homology Searching and Fold Recognition |journal=PLOS ONE |volume=5 |issue=5 |page=e10410 |doi=10.1371/journal.pone.0010410 |pmid=20463972 |pmc=2864755}}</ref>

=== Computational methodology ===

Each work unit sent to a volunteer computer contained the structural coordinates of one or more protein backbone templates drawn from a representative subset of the [[Structural Classification of Proteins]] (SCOP) database. For each template, the XPLOR molecular modelling program was used to precompute the pairwise interaction energy between all pairs of residue positions, considering all possible amino acid types and [[rotamer]] conformations at each position.<ref name="plosone2010"/>

The interaction energy used a classical molecular mechanics model that combined a Coulomb electrostatics term with an accessible surface area (ASA) implicit solvation correction. Protein stability was estimated by comparing the energy of the folded state to that of an extended, unfolded-state model constructed from a library of tripeptide structures.<ref name="bmc2008"/> An effective estimate of folding free energy change upon mutation is:

:<math>\Delta\Delta G_\text{fold} \approx E_\text{folded}(s') - E_\text{folded}(s) - \bigl[E_\text{unfolded}(s') - E_\text{unfolded}(s)\bigr]</math>

where <math>s</math> and <math>s'</math> are the wild-type and mutant sequences respectively.

Once all energy tables for a given backbone were returned from volunteers and assembled, a heuristic search algorithm rapidly explored the full sequence and conformational space, generating between 200,000 and 300,000 candidate sequences per backbone template and retaining the lowest-energy ones.<ref name="plosone2010"/>

=== The BOINC infrastructure ===

The project leveraged BOINC's client-server model. The Proteins@home server distributed work units (protein backbone files plus parameter inputs) to volunteers, who ran the energy table precomputation using idle CPU time. Completed energy tables were validated by quorum (comparing results from multiple independent hosts) before being accepted and assembled into the central database.<ref name="jcc2008"/> The project was listed among BOINC's official project directory at the URL <code>http://biology.polytechnique.fr/proteinsathome</code>.<ref name="boinc-oldprojects">{{cite web |url=https://github.com/BOINC/boinc-site/blob/master/old_projects.inc |title=old_projects.inc |publisher=GitHub / BOINC |access-date=2026-06-08}}</ref>

=== Comparison with related BOINC protein projects ===

Proteins@home was one of several BOINC-based projects focused on protein science active in the mid-2000s. [[Rosetta@home]], operated by the Baker Lab at the University of Washington, focused on forward structure prediction and protein-protein docking, and is still active. [[Predictor@home]], based at the Burnham Institute, was the first independent BOINC project ever launched and entered predictions in the [[CASP]] biennial evaluation of protein structure prediction methods.<ref>{{cite encyclopedia |title=Predictor@home |encyclopedia=Wikipedia |url=https://en.wikipedia.org/wiki/Predictor@home |access-date=2026-06-08}}</ref> [[POEM@Home]], hosted at the Karlsruhe Institute of Technology, modelled protein folding dynamics using [[Anfinsen's dogma]] and ran from 2007 to 2016.<ref>{{cite encyclopedia |title=POEM@Home |encyclopedia=Wikipedia |url=https://en.wikipedia.org/wiki/POEM@Home |access-date=2026-06-08}}</ref>

What distinguished Proteins@home from these projects was its focus on the ''inverse'' problem — designing sequences to fit given folds — rather than predicting folds from sequences. It also aimed to cover a large, systematic slice of protein fold space (roughly 1,500 folds) rather than working on individual targets or a specific set of challenge proteins.

== Scientific publications ==

The Proteins@home computing platform directly enabled several peer-reviewed publications from the Simonson group.

=== Computational protein design: software and benchmarks (2008) ===

The primary methods paper describing the Proteins@home software pipeline, parameter optimisation, and performance on a simple molecular mechanics model was published in the ''Journal of Computational Chemistry'' in 2008.<ref name="jcc2008"/> The paper validated the approach against experimental data and described the BOINC-distributed workflow in detail.

=== Testing the Coulomb/ASA solvent model (2008) ===

A companion study in ''BMC Bioinformatics'' used the Proteins@home platform to evaluate the Coulomb/accessible-surface-area implicit solvent model for protein stability, ligand binding free energies, and protein design.<ref name="bmc2008"/> The calculations were performed using volunteer computers in over 70 countries. The model was benchmarked against experimental mutation free energies and binding affinities across a range of proteins and peptides.

=== Fold recognition via computational design (2010) ===

A follow-up study published in ''PLOS ONE'' after the project's conclusion used the Proteins@home-generated sequence libraries to investigate whether computationally designed sequences could supplement natural sequences for protein fold recognition and homology searching.<ref name="plosone2010"/> Four [[SCOP]] families were redesigned — Small Kunitz-type inhibitors, Interleukin-8 chemokines, PDZ domains, and Caspase catalytic subunits — across 43 backbone templates. The SUPERFAMILY profile Hidden Markov Model library recognised 85% of the low-energy designed sequences as native-like, supporting the utility of designed sequences as diverse complements to experimental databases.

== Legacy and successor work ==

Although the volunteer computing phase of the project ran for only about 18 months, its distributed energy table calculations made possible a systematic exploration of protein sequence space at a scale that would not have been feasible on the group's local hardware alone.

The insights and code base from Proteins@home fed directly into the '''Proteus''' software package, developed by the same group at École Polytechnique and their collaborators.<ref name="proteus"/> Proteus extended the pairwise decomposition framework with additional energy terms including generalised Born solvation, Monte Carlo simulation at constant pH, and improved rotamer libraries, and has been applied to problems such as enzyme active site redesign and aminoacyl-tRNA synthetase specificity engineering. The first full description of Proteus was published in the ''Journal of Computational Chemistry'' in 2013.<ref>{{cite journal |last1=Simonson |first1=Thomas |last2=Gaillard |first2=Thomas |last3=Mignon |first3=David |last4=Schmidt am Busch |first4=Marcel |last5=Lopes |first5=Anne |last6=Amara |first6=Najette |last7=Polydorides |first7=Savvas |last8=Sedano |first8=Audrey |last9=Druart |first9=Karen |last10=Archontis |first10=Georgios |year=2013 |title=Computational protein design: the Proteus software and selected applications |journal=Journal of Computational Chemistry |volume=34 |issue=28 |pages=2472–2484 |doi=10.1002/jcc.23418 |pmid=24038178}}</ref>

[[File:Protein Structure Gif.gif|thumb|250px|right|A rotating 3D protein structure, illustrating the kind of tertiary fold geometry that Proteins@home worked to map using distributed volunteer computing.<ref>{{cite web |url=https://commons.wikimedia.org/wiki/File:Protein_Structure_Gif.gif |title=File:Protein Structure Gif.gif |publisher=Wikimedia Commons |access-date=2026-06-08}}</ref>]]

== See also ==

* [[BOINC]]
* [[Rosetta@home]]
* [[Predictor@home]]
* [[POEM@Home]]
* [[Protein structure prediction]]
* [[Computational protein design]]
* [[Folding@home]]
* [[École Polytechnique]]

== References ==

{{Reflist}}

== External links ==

* [https://web.archive.org/web/20080101000000*/http://biology.polytechnique.fr/proteinsathome/ Proteins@home official website (Wayback Machine)]
* [https://boinc.berkeley.edu/wiki/Proteins@Home Proteins@Home] at the BOINC wiki
* [https://proteus.polytechnique.fr/ Proteus] — successor software package, École Polytechnique
* [https://commons.wikimedia.org/wiki/Category:Proteins@home Proteins@home] at Wikimedia Commons
* [https://boinc.berkeley.edu/pubs.php Publications by BOINC Projects] at boinc.berkeley.edu

[[Category:BOINC projects]]
[[Category:Completed BOINC projects]]
[[Category:Biochemistry]]
[[Category:Computational biology]]
[[Category:Protein structure]]
[[Category:École Polytechnique]]
[[Category:Science and technology in France]]
[[Category:2006 establishments in France]]
[[Category:2008 disestablishments]]

BOINC project screensavers

Al Piskun — Mon, 08 Jun 2026 11:45:11 GMT

fix rna link

← Older revision		Revision as of 11:45, 8 June 2026
(4 intermediate revisions by the same user not shown)
Line 1:		Line 1:
			{{#seo:
			\|title=BOINC project screensavers
			\|description=A complete archive of 71 BOINC project screensavers — animated recordings of real-time scientific visualisations from SETI@home, Einstein@Home, Rosetta@home, Pirates@Home, World Community Grid, and dozens more volunteer computing projects.
			\|keywords=BOINC screensaver, BOINC project screensaver, SETI@home screensaver, Einstein@Home screensaver, Rosetta@home screensaver, Pirates@Home screensaver, World Community Grid screensaver, volunteer computing screensaver, distributed computing screensaver, BOINC history, screensaver archive, OpenGL screensaver, BOINC graphics
			\|image=Boinc-projects-seo.png
			}}
	{{DISPLAYTITLE:BOINC Project Screensavers}}		{{DISPLAYTITLE:BOINC Project Screensavers}}
	__NOTOC__		__NOTOC__
Line 167:		Line 173:

	[https://www.youtube.com/watch?v=GHJ4KBdwVew&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ cmsearch 0.13]		[https://www.youtube.com/watch?v=GHJ4KBdwVew&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ cmsearch 0.13]
	\| style="vertical-align:top; padding:6px;" \| '''[[RNA World (~~BOINC~~)~~\|RNA World~~]]'''<br/><small>Biology / RNA research</small>		\| style="vertical-align:top; padding:6px;" \| '''[[RNA World (beta)]]'''<br/><small>Biology / RNA research</small>
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| Searched for functional RNA molecules using the cmsearch algorithm from the Infernal software package~~. Run by the Karlsruhe Institute of Technology~~.		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| Searched for functional RNA molecules using the cmsearch algorithm from the Infernal software package.
	\|-		\|-
	\| style="text-align:center; padding:6px; vertical-align:top;" \| —		\| style="text-align:center; padding:6px; vertical-align:top;" \| —
Line 225:		Line 231:
	[https://www.youtube.com/watch?v=a4nO8ki2qR4&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Example Application 224.89]		[https://www.youtube.com/watch?v=a4nO8ki2qR4&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Example Application 224.89]
	\| style="vertical-align:top; padding:6px;" \| '''[[Volunteer@home]]'''<br/><small>Test / Example</small>		\| style="vertical-align:top; padding:6px;" \| '''[[Volunteer@home]]'''<br/><small>Test / Example</small>
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| A ~~demonstration or~~ test project running a generic example BOINC application.		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| A test project running a generic example BOINC application.
	\|-		\|-
	\| style="text-align:center; padding:6px; vertical-align:top;" \| [[File:Pirates@Home screensaver Scroll 4.53.gif\|140px]]		\| style="text-align:center; padding:6px; vertical-align:top;" \| [[File:Pirates@Home screensaver Scroll 4.53.gif\|140px]]
Line 259:		Line 265:

	[https://www.youtube.com/watch?v=yq6odp-rhao&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Cube 6.05]		[https://www.youtube.com/watch?v=yq6odp-rhao&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Cube 6.05]
	\| style="vertical-align:top; padding:6px;" \| '''[[Pirates@Home]]'''<br/><small>~~Astronomy / SETI~~</small>		\| style="vertical-align:top; padding:6px;" \| '''[[Pirates@Home]]'''<br/><small>Developement</small>
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| ~~Connected~~ to ~~the Planetary Society~~'s ~~radio telescope at Arecibo. Pre-processed raw telescope data before distribution to SETI@home~~. Produced more screensaver variants than any other BOINC project, spanning multiple themes (Lalane/Lalanne, Scroll, Sextant, Cube, Starboard) across versions 3.x–6.x.		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| Contributed to Einstein@Home's screensaver developement. Produced more screensaver variants than any other BOINC project, spanning multiple themes (Lalane/Lalanne, Scroll, Sextant, Cube, Starboard) across versions 3.x–6.x.
	\|-		\|-
	\| style="text-align:center; padding:6px; vertical-align:top;" \| [[File:Primates@Home screensaver Starboard 5.21.gif\|140px]]		\| style="text-align:center; padding:6px; vertical-align:top;" \| [[File:Primates@Home screensaver Starboard 5.21.gif\|140px]]
Line 266:		Line 272:

	[https://www.youtube.com/watch?v=NTeYa66qkxc&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Starboard 5.21]		[https://www.youtube.com/watch?v=NTeYa66qkxc&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Starboard 5.21]
	\| style="vertical-align:top; padding:6px;" \| '''[[Primates@Home]]'''<br/>~~<small>Biology / Primatology</small>~~		\| style="vertical-align:top; padding:6px;" \| '''[[Primates@Home]]'''<br/>Playing around
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| ~~Analysed video footage from camera traps to detect and classify primate behaviour in the wild.~~ The Starboard screensaver variant echoes the Pirates@Home ~~family of projects.~~		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| The Starboard screensaver variant echoes the Pirates@Home fun atmosphere with secret messages
	\|-		\|-
	\| style="text-align:center; padding:6px; vertical-align:top;" \| [[File:Help Conquer Cancer.gif\|140px]]		\| style="text-align:center; padding:6px; vertical-align:top;" \| [[File:Help Conquer Cancer.gif\|140px]]
Line 301:		Line 307:

	[https://www.youtube.com/watch?v=vLbgNxlP5w4&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Smash Childhood Cancer]		[https://www.youtube.com/watch?v=vLbgNxlP5w4&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Smash Childhood Cancer]
	\| style="vertical-align:top; padding:6px;" \| '''[[World Community Grid]]'''<br/><small>Multiple / ~~IBM-~~hosted</small>		\| style="vertical-align:top; padding:6px;" \| '''[[World Community Grid]]'''<br/><small>Multiple projects. IBM/Krembil hosted</small>
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| IBM-sponsored grid running multiple humanitarian research sub-projects on a shared BOINC platform. Each sub-project had its own screensaver variant, all archived here.		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| Formerly IBM and now Krembil Institute-sponsored grid running multiple humanitarian research sub-projects on a shared BOINC platform. Each sub-project had its own screensaver variant, all archived here.
	\|-		\|-
	\| style="text-align:center; padding:6px; vertical-align:top;" \| —		\| style="text-align:center; padding:6px; vertical-align:top;" \| —
Line 363:		Line 369:
	* '''Project graphics''' — a separate OpenGL executable shipped by each project, rendering the computation in real time via shared memory with the work unit.		* '''Project graphics''' — a separate OpenGL executable shipped by each project, rendering the computation in real time via shared memory with the work unit.

	Not all projects shipped graphics applications. Projects without one fell back to the overview screensaver. The graphics application literally showed the live computation in progress, which distinguished BOINC from most other screensaver-based ~~distributed~~ computing platforms of the era.		Not all projects shipped graphics applications. Projects without one fell back to the overview screensaver. The graphics application literally showed the live computation in progress, which distinguished BOINC from most other screensaver-based volunteer computing platforms of the era.

	=== Preservation ===		=== Preservation ===
Line 375:		Line 381:
	* [[BOINC]] the volunteer computing platform underlying all projects on this wiki		* [[BOINC]] the volunteer computing platform underlying all projects on this wiki
	* [[BOINC Manager]] the desktop client that hosted the screensaver coordinator		* [[BOINC Manager]] the desktop client that hosted the screensaver coordinator
	* [[~~List of~~ BOINC projects]] ~~comprehensive project index~~		* [[BOINC projects]] the complete list of all BOINC projects

	== External links ==		== External links ==
Line 381:		Line 387:
	* [https://www.youtube.com/playlist?list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy BOINC Screensavers — full YouTube playlist]		* [https://www.youtube.com/playlist?list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy BOINC Screensavers — full YouTube playlist]
	* [https://github.com/BOINC/boinc/wiki/BOINC-screensaver BOINC screensaver technical documentation (GitHub)]		* [https://github.com/BOINC/boinc/wiki/BOINC-screensaver BOINC screensaver technical documentation (GitHub)]
	* [~~https~~:~~//commons.wikimedia.org/wiki/~~Category:~~BOINC~~ BOINC media on Wikimedia Commons]		* [[commons:Category:Berkeley_Open_Infrastructure_for_Network_Computing\|BOINC media on Wikimedia Commons]]

	[[Category:BOINC]]		[[Category:BOINC]]

Main Page

Al Piskun — Sun, 07 Jun 2026 19:06:32 GMT

fix link

← Older revision		Revision as of 19:06, 7 June 2026
Line 69:		Line 69:
	<div class="bs-cta-title">📺 BOINC Project Screensaver Archive</div>		<div class="bs-cta-title">📺 BOINC Project Screensaver Archive</div>
	<div class="bs-cta-body">Before modern power management made them obsolete, every BOINC project shipped a real-time animated screensaver showing the computation in progress, including protein chains folding, star fields sweeping and climate models spinning. All 71 known screensaver recordings, spanning projects from SETI@home to Pirates@Home, are now preserved in one place.</div>		<div class="bs-cta-body">Before modern power management made them obsolete, every BOINC project shipped a real-time animated screensaver showing the computation in progress, including protein chains folding, star fields sweeping and climate models spinning. All 71 known screensaver recordings, spanning projects from SETI@home to Pirates@Home, are now preserved in one place.</div>
	<big>'''[[BOINC ~~Screensavers~~\|View the BOINC Screensaver Archive →]]'''</big>		<big>'''[[BOINC project screensavers\|View the BOINC Screensaver Archive →]]'''</big>
	</div>		</div>

BOINC project screensavers

Al Piskun — Sun, 07 Jun 2026 19:02:24 GMT

Full Playlist

← Older revision		Revision as of 19:02, 7 June 2026
(2 intermediate revisions by the same user not shown)
Line 1:		Line 1:
	{{DISPLAYTITLE:BOINC Project Screensavers}}		{{DISPLAYTITLE:BOINC Project Screensavers}}
	__NOTOC__		__NOTOC__
	~~== Overview ==~~

	One of the distinctive features of early [[BOINC]] projects was the '''project screensaver.''' Many screensavers featured a real-time animated display showing the volunteer's computer actively contributing to science. When a BOINC-attached machine sat idle, the screensaver would launch and visualise the underlying computation: radio telescope signals sweeping across a star field for [[SETI@home]], protein chains folding in three dimensions for [[Rosetta@home]], or a climate model globe spinning for [[Climateprediction.net]].		One of the distinctive features of early [[BOINC]] projects was the '''project screensaver.''' Many screensavers featured a real-time animated display showing the volunteer's computer actively contributing to science. When a BOINC-attached machine sat idle, the screensaver would launch and visualise the underlying computation: radio telescope signals sweeping across a star field for [[SETI@home]], protein chains folding in three dimensions for [[Rosetta@home]], or a climate model globe spinning for [[Climateprediction.net]].
Line 11:		Line 10:
	== Full Playlist ==		== Full Playlist ==

	The complete collection of ~~all~~ 71 ~~known~~ BOINC screensaver recordings is available as a YouTube playlist. Use the player below to browse all videos, or jump to individual project entries in the gallery beneath it.		The complete collection of 71 BOINC screensaver recordings is available as a YouTube playlist. Use the player below to browse all videos, or jump to individual project entries in the gallery beneath it.

	{{#ev:youtube\|pZ1fSYpwhYA\|700\|center\|BOINC Project Screensavers – Full Playlist\|start=0&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy}}		{{#ev:youtube\|pZ1fSYpwhYA\|700\|center\|BOINC Project Screensavers – Full Playlist\|start=0&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy}}
Line 18:		Line 17:

	== Screensaver Gallery ==		== Screensaver Gallery ==

	Thumbnail images link to individual YouTube recordings. Animated GIF previews (where available) are from [[Wikimedia Commons]]. Requires <code>$wgAllowExternalImagesFrom = [ 'https://img.youtube.com/' ];</code> in <code>LocalSettings.php</code> to display thumbnails.

	{\| class="wikitable sortable" style="width:100%; vertical-align:top;"		{\| class="wikitable sortable" style="width:100%; vertical-align:top;"

RALPH@home

Al Piskun — Sun, 07 Jun 2026 18:27:52 GMT

← Older revision		Revision as of 18:27, 7 June 2026
Line 30:		Line 30:
	\| license = Mixed; Rosetta software license with BOINC components under LGPL		\| license = Mixed; Rosetta software license with BOINC components under LGPL
	}}		}}

	~~[[File:{{#setmainimage:Ralph.gif}}\|alt=screensaver\|center\|frameless]]~~

	[https://ralph.bakerlab.org/ '''''RALPH@home'''''] is a '''[[wikipedia:Volunteer computing\|volunteer distributed computing]]''' project based on the [https://boinc.berkeley.edu/ '''BOINC'''] middleware platform. The project is operated by the Baker Laboratory at the [[wikipedia:University of Washington\|University of Washington]] and serves as the public alpha and beta testing platform for Rosetta@home.<ref name="ralph-home">{{cite web		[https://ralph.bakerlab.org/ '''''RALPH@home'''''] is a '''[[wikipedia:Volunteer computing\|volunteer distributed computing]]''' project based on the [https://boinc.berkeley.edu/ '''BOINC'''] middleware platform. The project is operated by the Baker Laboratory at the [[wikipedia:University of Washington\|University of Washington]] and serves as the public alpha and beta testing platform for Rosetta@home.<ref name="ralph-home">{{cite web

← Older revision		Revision as of 17:49, 10 June 2026
(One intermediate revision by the same user not shown)
Line 19:		Line 19:
	\| license = Mixed; BOINC middleware uses the LGPL		\| license = Mixed; BOINC middleware uses the LGPL

	\| stats as of = {{Start date and age\|2026\|05\|22}}		\| stats as of = {{Start date and age\|2026\|06\|10}}
			\| average performance = 14021.38 GigaFLOPS
			\| active users = 213
			\| total users = 335
			\| active hosts = 638
			\| total hosts = 1257
	}}		}}

Line 102:		Line 107:
	* [[Gaia@home]]		* [[Gaia@home]]
	* [[SETI@home]]		* [[SETI@home]]
	* [[Wikipedia:Volunteer computing\|~~Distributed~~ computing]]		* [[Wikipedia:Volunteer computing\|Volunteer computing]]
	* [[Wikipedia:Citizen science\|Citizen science]]		* [[Wikipedia:Citizen science\|Citizen science]]

← Older revision		Revision as of 16:08, 12 June 2026
(One intermediate revision by the same user not shown)
Line 80:		Line 80:

	[https://www.youtube.com/watch?v=aM6kiaM228Y&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Boinc Xplor 7.41]		[https://www.youtube.com/watch?v=aM6kiaM228Y&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Boinc Xplor 7.41]
	\| style="vertical-align:top; padding:6px;" \| '''[[~~Proteins~~@home]]'''<br/><small>Biochemistry / Protein folding</small>		\| style="vertical-align:top; padding:6px;" \| '''[[proteins@home]]'''<br/><small>Biochemistry / Protein folding</small>
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| An early protein structure prediction project. The screensaver displayed evolving protein geometry using the Boinc Xplor visualiser.		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| An early protein structure prediction project. The screensaver displayed evolving protein geometry using the Boinc Xplor visualiser.
	\|-		\|-
Line 87:		Line 87:

	[https://www.youtube.com/watch?v=Mae7JfL1giE&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ HadSM3 Slab Model]		[https://www.youtube.com/watch?v=Mae7JfL1giE&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ HadSM3 Slab Model]
	\| style="vertical-align:top; padding:6px;" \| '''[[~~Climateprediction~~.net]]'''<br/><small>Climate science</small>		\| style="vertical-align:top; padding:6px;" \| '''[[climateprediction.net]]'''<br/><small>Climate science</small>
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| Displays an animated global climate model: a spinning Earth overlaid with colour-coded temperature anomaly, cloud cover, and atmospheric flow vectors. One of the oldest continuous BOINC projects (launched 2003), still active.		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| Displays an animated global climate model: a spinning Earth overlaid with colour-coded temperature anomaly, cloud cover, and atmospheric flow vectors. One of the oldest continuous BOINC projects (launched 2003), still active.
	\|-		\|-
Line 321:		Line 321:

	[https://www.youtube.com/watch?v=1RVFLPdrwiA&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Version 7.00]		[https://www.youtube.com/watch?v=1RVFLPdrwiA&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ Version 7.00]
	\| style="vertical-align:top; padding:6px;" \| '''[[BOINC]]'''<br/><small>Infrastructure / Testing</small>		\| style="vertical-align:top; padding:6px;" \| '''[[BOINC]] test project'''<br/><small>Infrastructure / Testing</small>
	\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| Generic BOINC test project screensaver used for client validation.		\| style="vertical-align:top; padding:6px; font-size:0.9em;" \| Generic BOINC test project screensaver used for client validation.
	\|-		\|-
Line 344:		Line 344:

	[https://www.youtube.com/watch?v=f6ugQIq7Zao&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ General]		[https://www.youtube.com/watch?v=f6ugQIq7Zao&list=PLblxpyGay1Q7Bp3Mx2GACRc2XU6F0Yduy ▶ General]
	\| style="vertical-align:top; padding:6px;" \| '''[[BOINC]]'''<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.
	\|}		\|}

← Older revision		Revision as of 21:44, 10 June 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">56</div>		<div class="bs-stat-number">57</div>
	<div class="bs-stat-label">Projects documented</div>		<div class="bs-stat-label">Projects documented</div>
	</div>		</div>
Line 231:		Line 231:
	\| * [[BlackHoles@Home]] black hole binary merger waveforms		\| * [[BlackHoles@Home]] black hole binary merger waveforms
	\|-		\|-
	\|* [[Cosmology@Home]] astronomical research		\| * [[Cosmology@Home]] astronomical research
	\|* [[Collatz Conjecture]] testing the 3x+1 conjecture		\| * [[Collatz Conjecture]] testing the 3x+1 conjecture
	\|-		\|-
	\| * [[Data freezer]] long-term data archival research		\| * [[Data freezer]] long-term data archival research
Line 246:		Line 246:
	\| * [[WEP-M+2 Project]] mersenne-related prime search		\| * [[WEP-M+2 Project]] mersenne-related prime search
	\|-		\|-
	\|* [[RNA World (beta)]] RNA folding and molecular evolution		\| * [[RNA World (beta)]] RNA folding and molecular evolution
	\|* [[SETI@home]] search for extraterrestrial intelligence		\| * [[SETI@home]] search for extraterrestrial intelligence
	\|-		\|-
	\|* [[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		\| * [[Proteins@home]] tackled the inverse protein folding problem
	\|		\| * [[QuChemPedIA@home]] run density functional theory (DFT) quantum chemistry calculations
	\|}		\|}
	<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>