SRBase - Revision history

Al Piskun at 22:33, 28 May 2026

2026-05-28T22:33:10Z

← Older revision		Revision as of 22:33, 28 May 2026
Line 20:		Line 20:
	\| license = BOINC Confederation		\| license = BOINC Confederation
	}}		}}

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

	[https://srbase.my-firewall.org/sr5/ '''''SRBase'''''] is a [[wikipedia:BOINC\|BOINC]]-based '''''[[wikipedia:Volunteer computing\|volunteer computing]]''''' project focused on mathematical research in [[wikipedia:number theory\|number theory]]. It enlists the spare processing power of volunteers' computers around the world to prove the generalized [[wikipedia:Sierpinski number\|Sierpinski]] and [[wikipedia:Riesel number\|Riesel]] conjectures for all integer bases <math>b \leq 1030</math>, working on cases not currently addressed by other distributed computing efforts.<ref>{{cite web \|url=https://srbase.my-firewall.org/sr5/ \|title=SRBase \|publisher=BOINC Confederation / rebirther \|access-date=2026-05-23}}</ref>		[https://srbase.my-firewall.org/sr5/ '''''SRBase'''''] is a [[wikipedia:BOINC\|BOINC]]-based '''''[[wikipedia:Volunteer computing\|volunteer computing]]''''' project focused on mathematical research in [[wikipedia:number theory\|number theory]]. It enlists the spare processing power of volunteers' computers around the world to prove the generalized [[wikipedia:Sierpinski number\|Sierpinski]] and [[wikipedia:Riesel number\|Riesel]] conjectures for all integer bases <math>b \leq 1030</math>, working on cases not currently addressed by other distributed computing efforts.<ref>{{cite web \|url=https://srbase.my-firewall.org/sr5/ \|title=SRBase \|publisher=BOINC Confederation / rebirther \|access-date=2026-05-23}}</ref>

Al Piskun at 23:48, 24 May 2026

2026-05-24T23:48:52Z

← Older revision		Revision as of 23:48, 24 May 2026
Line 7:		Line 7:
	\| category = Mathematics / Number Theory		\| category = Mathematics / Number Theory
	\| compute = CPU & GPU		\| compute = CPU & GPU
	~~\| dependencies =~~

	\| developer = rebirther		\| developer = rebirther

Al Piskun: update and add infobox

2026-05-23T11:55:51Z

update and add infobox

← Older revision		Revision as of 11:55, 23 May 2026
Line 7:		Line 7:
	\| category = Mathematics / Number Theory		\| category = Mathematics / Number Theory
	\| compute = CPU & GPU		\| compute = CPU & GPU
	\| dependencies = ~~None~~		\| dependencies =

	\| developer = rebirther		\| developer = rebirther
Line 13:		Line 13:
	\| sponsor = [[wikipedia:Conjectures 'R Us\|Conjectures 'R Us]] (CRUS), [[wikipedia:Great Internet Mersenne Prime Search\|GIMPS]]		\| sponsor = [[wikipedia:Conjectures 'R Us\|Conjectures 'R Us]] (CRUS), [[wikipedia:Great Internet Mersenne Prime Search\|GIMPS]]
	\| maintainer = rebirther		\| maintainer = rebirther
	\| released = ~~2014~~		\| released = {{Start date and age\|2013\|01\|02}}

	\| programming language = C, C++		\| programming language = C, C++
Line 29:		Line 29:

	=== The Sierpinski conjecture ===		=== The Sierpinski conjecture ===
	[[File:Wacław Sierpiński.jpg\|thumb\|Wacław Sierpiński (1882–1969), the Polish mathematician who proved the existence of infinitely many Sierpiński numbers in 1960.]]		[[File:Wacław Sierpiński.jpg\|thumb\|Wacław Sierpiński. (1882–1969), the Polish mathematician who proved the existence of infinitely many Sierpiński numbers in 1960.]]
	In [[wikipedia:number theory\|number theory]], a Sierpiński number is an odd natural number <math>k</math> such that <math>k \times 2^n + 1</math> is [[wikipedia:composite number\|composite]] for all natural numbers <math>n</math>. In 1960, [[wikipedia:Wacław Sierpiński\|Wacław Sierpiński]] proved that there are infinitely many odd integers <math>k</math> which have this property. In other words, for a Sierpiński number <math>k</math>, no matter what positive integer is substituted for <math>n</math>, the result is always a composite (non-prime) number. "There's no obvious reason why they should exist," as mathematician Chris Caldwell has noted; for most values of <math>k</math>, primes appear quite regularly in the sequence <math>k \cdot 2^n + 1</math>.		In [[wikipedia:number theory\|number theory]], a Sierpiński number is an odd natural number <math>k</math> such that <math>k \times 2^n + 1</math> is [[wikipedia:composite number\|composite]] for all natural numbers <math>n</math>. In 1960, [[wikipedia:Wacław Sierpiński\|Wacław Sierpiński]] proved that there are infinitely many odd integers <math>k</math> which have this property. In other words, for a Sierpiński number <math>k</math>, no matter what positive integer is substituted for <math>n</math>, the result is always a composite (non-prime) number. "There's no obvious reason why they should exist," as mathematician Chris Caldwell has noted; for most values of <math>k</math>, primes appear quite regularly in the sequence <math>k \cdot 2^n + 1</math>.

Line 59:		Line 59:
	== History ==		== History ==

	SRBase was launched in 2014, as indicated by its copyright notice "© 2014–2026 BOINC Confederation / rebirther." It is administered by a volunteer known by the handle '''rebirther''', who runs the project server on a private computer inside a [[wikipedia:virtual machine\|virtual machine]] — famously rumored to reside in a closet.~~<ref>{{cite web \|url=https://boincsynergy.ca/wiki/SRBase/ \|title=SRBase \|publisher=BOINC Synergy \|access-date=2026-05-23}}</ref>~~		SRBase was launched in 2014, as indicated by its copyright notice "© 2014–2026 BOINC Confederation / rebirther." It is administered by a volunteer known by the handle '''rebirther''', who runs the project server on a private computer inside a [[wikipedia:virtual machine\|virtual machine]] — famously rumored to reside in a closet.

	The project has maintained a steady annual review of its progress since its founding. Over its first nine years, 28 bases were proven, with the number of unstarted bases declining from 314 in 2014–2015 to 69 by 2022–2023. The following table summarizes yearly progress through 2023:<ref>{{cite web \|url=https://medium.com/@alex40964096/boinc-project-srbase-7c7bde38ae54 \|title=Boinc Project: SRBase \|publisher=Medium \|access-date=2026-05-23}}</ref>		The project has maintained a steady annual review of its progress since its founding. Over its first nine years, 28 bases were proven, with the number of unstarted bases declining from 314 in 2014–2015 to 69 by 2022–2023. The following table summarizes yearly progress through 2023:<ref>{{cite web \|url=https://medium.com/@alex40964096/boinc-project-srbase-7c7bde38ae54 \|title=Boinc Project: SRBase \|publisher=Medium \|access-date=2026-05-23}}</ref>
Line 101:		Line 101:
	=== Infrastructure ===		=== Infrastructure ===

	The project server is hosted on a private machine running inside a virtual machine. This unconventional setup has become a point of gentle pride within the volunteer computing community.~~<ref>{{cite web \|url=https://boincsynergy.ca/blog/srbase/ \|title=SRBase \|publisher=BOINC Synergy \|access-date=2026-05-23}}</ref>~~ Work reservation and preparation are coordinated via the [[wikipedia:Mersenne Forum\|Mersenne Forum]] at [http://www.mersenneforum.org/forumdisplay.php?f=81 mersenneforum.org], where users reserve bases to avoid duplicate effort. Results processing and prime removal from sieve files are handled using the <code>srfile</code> application.		The project server is hosted on a private machine running inside a virtual machine. This unconventional setup has become a point of gentle pride within the volunteer computing community. Work reservation and preparation are coordinated via the [[wikipedia:Mersenne Forum\|Mersenne Forum]] at [http://www.mersenneforum.org/forumdisplay.php?f=81 mersenneforum.org], where users reserve bases to avoid duplicate effort. Results processing and prime removal from sieve files are handled using the <code>srfile</code> application.

	== Collaborations ==		== Collaborations ==

Al Piskun: fix refs

2026-05-23T11:44:40Z

fix refs

← Older revision		Revision as of 11:44, 23 May 2026
Line 91:		Line 91:
	=== Applications ===		=== Applications ===

	SRBase distributes computational work to volunteers via the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|BOINC]] client. The core computation involves [[wikipedia:primality test\|primality testing]] of candidate numbers of the forms <math>k \cdot b^n \pm 1</math>. The project has migrated from the LLR2 application to PRST (a similar application already used at [[wikipedia:PrimeGrid\|PrimeGrid]]), which was intended to replace LLR2 and brings performance improvements and better hardware support. Recent application milestones include updating to PRST v10, multi-GPU sieving, and support for [[wikipedia:Intel Arc\|Intel Arc]] GPUs.~~<ref>{{cite web \|url=https://boincsynergy.ca/wiki/SRBase/ \|title=SRBase – BOINC Synergy \|access-date=2026-05-23}}</ref>~~		SRBase distributes computational work to volunteers via the [[wikipedia:Berkeley Open Infrastructure for Network Computing\|BOINC]] client. The core computation involves [[wikipedia:primality test\|primality testing]] of candidate numbers of the forms <math>k \cdot b^n \pm 1</math>. The project has migrated from the LLR2 application to PRST (a similar application already used at [[wikipedia:PrimeGrid\|PrimeGrid]]), which was intended to replace LLR2 and brings performance improvements and better hardware support. Recent application milestones include updating to PRST v10, multi-GPU sieving, and support for [[wikipedia:Intel Arc\|Intel Arc]] GPUs.

	Both CPU and GPU work units are available. The PRST application supports modern instruction sets including [[wikipedia:AVX-512\|AVX-512]] for compatible processors, allowing significantly faster computations on modern hardware.		Both CPU and GPU work units are available. The PRST application supports modern instruction sets including [[wikipedia:AVX-512\|AVX-512]] for compatible processors, allowing significantly faster computations on modern hardware.
Line 141:		Line 141:
	=== Proven bases and conjecture progress ===		=== Proven bases and conjecture progress ===

	As of early 2021, SRBase had reported 400 of 1,031 Riesel bases proven and 390 of 1,032 Sierpiński bases proven, with 112 bases still unstarted.~~<ref>{{cite web \|url=https://boincsynergy.ca/blog/srbase/ \|title=SRBase – BOINC Synergy \|access-date=2026-05-23}}</ref>~~ Progress statistics are maintained by the CRUS project at [http://www.noprimeleftbehind.net/crus/ noprimeleftbehind.net].		As of early 2021, SRBase had reported 400 of 1,031 Riesel bases proven and 390 of 1,032 Sierpiński bases proven, with 112 bases still unstarted. Progress statistics are maintained by the CRUS project at [http://www.noprimeleftbehind.net/crus/ noprimeleftbehind.net].

	* [http://www.noprimeleftbehind.net/crus/vstats_new/crus-stats.htm Overall CRUS statistics]		* [http://www.noprimeleftbehind.net/crus/vstats_new/crus-stats.htm Overall CRUS statistics]

Al Piskun at 11:42, 23 May 2026

2026-05-23T11:42:03Z

Show changes

Al Piskun: /* Methods */ clarify

2024-04-07T21:07:51Z

Methods: clarify

← Older revision		Revision as of 21:07, 7 April 2024
Line 10:		Line 10:

	== Methods ==		== Methods ==
	The server is famously running on a private computer in a VM and may, or may not, be located in a closet. Recent advancements include updating the application from LLR2 to PRST v10, Multi GPU sieving and Intel® Arc support.		The project server is famously running on a private computer in a VM and may, or may not, be located in a closet. Recent advancements include updating the application from LLR2 to PRST v10, Multi GPU sieving and Intel® Arc support.

	The project is in collaboration with:		The project is in collaboration with:
Line 20:		Line 20:
	* Check results - merge all results to lresults.txt		* Check results - merge all results to lresults.txt
	* Remove primes from a sievefile with the srfile app		* Remove primes from a sievefile with the srfile app
	* [https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE''''']		[https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE''''']

	== Project team / Sponsors ==		== Project team / Sponsors ==

Al Piskun: /* Methods */

2024-04-07T20:17:15Z

Methods

← Older revision		Revision as of 20:17, 7 April 2024
Line 14:		Line 14:
	The project is in collaboration with:		The project is in collaboration with:

	# '''''[https://www.mersenne.org/ Great Internet Mersenne Prime Search]''''' where SRBase's Trial Factoring sieving on GPU is working on the 100-1000M range and ~~have~~ almost completed the 74-75 bit level.		# '''''[https://www.mersenne.org/ Great Internet Mersenne Prime Search]''''' where SRBase's Trial Factoring sieving on GPU is working on the 100-1000M range and has almost completed the 74-75 bit level.
	# [https://www.mersenneforum.org/showthread.php?t=9738 '''''Mersenne CRUS project''''']		# [https://www.mersenneforum.org/showthread.php?t=9738 '''''Mersenne CRUS project''''']
	* Work reservation and preparation - '''''http://www.mersenneforum.org/forumdisplay.php?f=81''''' The link is used for any base reservation. This avoids any duplicate work from other users		* Work reservation and preparation - '''''http://www.mersenneforum.org/forumdisplay.php?f=81''''' The link is used for any base reservation. This avoids any duplicate work from other users

Al Piskun: clarify methods

2024-04-07T20:13:50Z

clarify methods

← Older revision		Revision as of 20:13, 7 April 2024
Line 10:		Line 10:

	== Methods ==		== Methods ==
	The project is in collaboration with the [https://www.mersenneforum.org/showthread.php?t=9738 '''''Mersenne CRUS project'''''] and '''''[https://www.mersenne.org/ Great Internet Mersenne Prime Search]''''' where SRBase's Trial Factoring sieving on GPU is working on the 100-1000M range and have almost completed the 74-75 bit level.

	The server is famously running on a private computer in a VM and may, or may not, be located in a closet. Recent advancements include updating the application from LLR2 to PRST v10, Multi GPU sieving and Intel® Arc support.		The server is famously running on a private computer in a VM and may, or may not, be located in a closet. Recent advancements include updating the application from LLR2 to PRST v10, Multi GPU sieving and Intel® Arc support.

	~~[https~~:~~//srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE''''']~~		The project is in collaboration with:

			# '''''[https://www.mersenne.org/ Great Internet Mersenne Prime Search]''''' where SRBase's Trial Factoring sieving on GPU is working on the 100-1000M range and have almost completed the 74-75 bit level.
			# [https://www.mersenneforum.org/showthread.php?t=9738 '''''Mersenne CRUS project''''']
	* Work reservation and preparation - '''''http://www.mersenneforum.org/forumdisplay.php?f=81''''' The link is used for any base reservation. This avoids any duplicate work from other users		* Work reservation and preparation - '''''http://www.mersenneforum.org/forumdisplay.php?f=81''''' The link is used for any base reservation. This avoids any duplicate work from other users
	* Work creation - All bases over 1M tests (lower ranges) will be split into pieces. Normally there are 2-3 batches, 25-50k, 50-60k, 60-100k. Most of the work is done in Excel		* Work creation - All bases over 1M tests (lower ranges) will be split into pieces. Normally there are 2-3 batches, 25-50k, 50-60k, 60-100k. Most of the work is done in Excel
	* Check results - merge all results to lresults.txt		* Check results - merge all results to lresults.txt
	* Remove primes from a sievefile with the srfile app		* Remove primes from a sievefile with the srfile app
			* [https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE''''']

	== Project team / Sponsors ==		== Project team / Sponsors ==

Al Piskun: additional info

2024-04-07T19:26:42Z

additional info

← Older revision		Revision as of 19:26, 7 April 2024
Line 1:		Line 1:
	~~<div style="background-color: #D4E2FC; border-top: 1px solid #5F92F2; font-size: bigger; padding-left: 15px; margin: 12px -5px -5px -5px;">'''BOINC project page template'''</div>~~		[[File:{{#setmainimage:SRBase.jpg}}\|alt=SRBase logo image\|center\|frameless]]

	[[File:{{#setmainimage:~~SRbase~~.~~png~~}}\|alt=~~SRbase~~ logo image\|center\|frameless]]

	[https://srbase.my-firewall.org/sr5/ '''''SRBase'''''] is a BOINC platform '''''[[wikipedia:Volunteer computing\|volunteer computing]]''''' project and needs your help to advance mathematical research.		[https://srbase.my-firewall.org/sr5/ '''''SRBase'''''] is a BOINC platform '''''[[wikipedia:Volunteer computing\|volunteer computing]]''''' project and needs your help to advance mathematical research.
Line 12:		Line 10:

	== Methods ==		== Methods ==
	The project is in collaboration with the [https://www.mersenneforum.org/showthread.php?t=9738 '''''Mersenne CRUS project''''']. The server is running on a private computer in a VM.		The project is in collaboration with the [https://www.mersenneforum.org/showthread.php?t=9738 '''''Mersenne CRUS project'''''] and '''''[https://www.mersenne.org/ Great Internet Mersenne Prime Search]''''' where SRBase's Trial Factoring sieving on GPU is working on the 100-1000M range and have almost completed the 74-75 bit level.

			The server is famously running on a private computer in a VM and may, or may not, be located in a closet. Recent advancements include updating the application from LLR2 to PRST v10, Multi GPU sieving and Intel® Arc support.

	[https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE''''']		[https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE''''']
Line 24:		Line 24:

	* Gary - Mersenne/CRUS admin - results		* Gary - Mersenne/CRUS admin - results
			* Prime95 - GIMPS admin - work distribution
	* Odicin - scripts		* Odicin - scripts
	* walli - coding		* walli - coding
			* deletenull - GPU apps and compiling
	* rebirther - SRBase admin		* rebirther - SRBase admin

Al Piskun: link

2024-03-23T19:51:09Z

link

← Older revision		Revision as of 19:51, 23 March 2024
Line 6:		Line 6:

	== Why SRBase? ==		== Why SRBase? ==
			For every base (b) for the forms kb^n+1 and kb^n-1, there is a k-value for each form that has been conjectured to be the lowest 'Sierpinski value' (+1 form) or 'Riesel value' (-1 form) that is composite for all values of n >= 1.
	* ~~why this topic/object~~ of ~~study?~~

	== Goal ==		== Goal ==
	~~Solve~~ Sierpinski ~~/ Riesel Bases up to~~ 1030.		Prove Riesel and Sierpinski conjectures for bases <= 1030 that are not currently being worked on by other projects or efforts.

	== Methods ==		== Methods ==
	The project is in collaboration with the Mersenne CRUS project. The server is running on a private computer in a VM.		The project is in collaboration with the [https://www.mersenneforum.org/showthread.php?t=9738 '''''Mersenne CRUS project''''']. The server is running on a private computer in a VM.

	[https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE''''']		[https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE''''']