| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Twin Prime Search"
(Splitting variable-n drive info to separate page) |
(Adding links) |
||
| Line 2: | Line 2: | ||
==Drives== | ==Drives== | ||
| + | * [[TPS n=222333|{{Vn}}=222333 twin/Sophie Germain drive]] | ||
| + | * [[TPS n=333444|{{Vn}}=333444 twin/Sophie Germain drive]] | ||
* [[TPS n=480000-500000|{{Vn}}=480k-500k variable-{{Vn}} drive]] | * [[TPS n=480000-500000|{{Vn}}=480k-500k variable-{{Vn}} drive]] | ||
* [[TPS n=1000000|{{Vn}}=1.0M drive]] | * [[TPS n=1000000|{{Vn}}=1.0M drive]] | ||
Revision as of 18:43, 5 March 2024
The Twin Prime Search is a distributed computing project that looks for large twin primes (Riesel type k•2n-1) of world record size.
Drives
- n=222333 twin/Sophie Germain drive
- n=333444 twin/Sophie Germain drive
- n=480k-500k variable-n drive
- n=1.0M drive
- n=1.7M twin/Sophie Germain drive
- n=3.322M twin/Sophie Germain drive
External links
Projects
| Ongoing |
|
| Terminated |
