SRBase: Difference between revisions
fix refs |
update and add infobox |
||
| Line 7: | Line 7: | ||
| category = Mathematics / Number Theory | | category = Mathematics / Number Theory | ||
| compute = CPU & GPU | | compute = CPU & GPU | ||
| dependencies = | | 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 = | | 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. | 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. | 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 == | ||