Everything about PrimeGrid
BOINC based volunteer computing project researching prime numbers
PrimeGrid is a volunteer computing project that searches for very large prime numbers whilst also aiming to solve long-standing mathematical conjectures. It uses the Berkeley Open Infrastructure for Network Computing (BOINC) platform. PrimeGrid offers a number of subprojects for prime-number sieving and discovery. Some of these are available through the BOINC client, others through the PRPNet client. Some of the work is manual, i.e. it requires manually starting work units and uploading results. Different subprojects may run on different operating systems, and may have executables for CPUs, GPUs, or both; while running the Lucas–Lehmer–Riesel test, CPUs with Advanced Vector Extensions and Fused Multiply-Add instruction sets will yield the fastest results for non-GPU accelerated workloads. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: PrimeGridA 5-minute orientation
- Go sideways: Riesel numberA closely related topic
- Go sideways: List of volunteer computing projectsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Riesel number In mathematics, a Riesel number is an odd natural number k for which k×2n−1 is composite for all natural numbers n (sequence A101036 in the OEIS). In other…
- List of volunteer computing projects Volunteer computing projects are a type of distributed computing where volunteers donate computing time to specific causes. The donated computing power…
- 509,203 509203 (five hundred [and] nine thousand two hundred [and] three) is the natural number following 509202 and preceding 509204. 509203 is the 42228th prime…
- Proth prime A Proth number is a natural number N of the form N=k×2n+1 where k and n are positive integers, k is odd and 2n>k. A Proth prime is a Proth number that…
- Sierpiński number In number theory, a Sierpiński number is an odd natural number k such that k×2n+1 is composite for all natural numbers n. In 1960, Wacław Sierpiński proved…
- Twin Prime Search Twin Prime Search (TPS) is a volunteer computing project that looks for large twin primes. It uses the programs LLR (for primality testing) and NewPGen…
- Berkeley Open Infrastructure for Network Computing The Berkeley Open Infrastructure for Network Computing (BOINC, pronounced /bɔɪŋk/ –rhymes with "oink") is an open-source middleware system for volunteer…
- Cullen number In mathematics, a Cullen number is a member of the integer sequence Cn=n⋅2n+1 (where n is a natural number). Cullen numbers were first studied by Irish…