## Preface | 前言

Hello everyone, I am A.P., the project administrator of this website. Since the recent server migration and the launch of our brand-new client, the project has been running smoothly for one week, while various supporting features have continued to improve steadily. Today, we are officially launching the announcement system, which will serve as the primary channel for future project update announcements and site-wide notifications. In the following sections, I will provide a systematic introduction to the project.

大家好，我是本网站的项目管理员 A.P.。自近期完成服务器迁移并启用全新客户端以来，项目已平稳运行一周，各项附属功能均在稳步完善。今日，我们正式推出公告系统，其将承载以后每次项目更新的宣布和全站消息通知的功能。接下来我将系统介绍本项目。

## Project Purpose | 项目目的

PrimeSeeker (hereinafter referred to as “the Site”) is a small-to-medium-scale distributed computing project dedicated to searching for primes of various forms. Unlike projects that focus primarily on traditional `k*b^n±1` or `b^2^n±1` forms, the Site aims to explore a broader variety of prime forms. This differentiated focus is mainly based on two practical considerations: first, computer hardware prices have risen significantly in recent years, increasing the cost of acquiring computing power; second, the entry threshold for the T5K (Top 5000 Primes) list has continued to rise year after year. At the time of writing, the threshold has already reached approximately 920,000 digits and is expected to surpass one million digits in the near future.

PrimeSeeker（以下简称“本站”）是一个专注于多类型质数搜索的中小型分布式计算项目。与仅聚焦于传统`k*b^n±1`或`b^2^n±1`形式的项目不同，本站致力于探索更广泛的质数形态。做出这一差异化定位，主要基于两点现实考量：一是近年来计算机硬件价格大幅上涨，算力获取成本增加；二是 T5K（世界前5000大质数）榜单的收录门槛逐年攀升（撰文时已达 92 万位，预计不久将突破百万大关）。

Therefore, we believe that the number of digits of a prime should not be the sole measure of its value. Primes with distinctive forms and mathematical interest are equally worthy of being discovered, recorded, and studied. Based on this philosophy, the Site currently provides the following prime-search projects:

因此，我们认为质数的“位数”不应成为衡量价值的唯一标尺，那些形式独特、具有数学趣味的质数同样值得被记录与研究。基于此理念，本站目前提供以下形式的质数搜索项目：

- GFPS-15halfM (Generalized Fermat (Near) Half Mega Prime Search with n = 15): a search for (near-)half-million-digit generalized Fermat primes of the form `b^2^15±1`, as exponent equals 32768.

  GFPS-15halfM（Generalized Fermat (Near) Half Mega Prime Search with n = 15，指数为 32768 的（近）半百万位 `b^2^15±1` 形式广义费马质数搜索）

- GFPS-16M (Generalized Fermat (Near) Mega Prime Search with n = 16): a search for (near-)million-digit generalized Fermat primes of the form `b^2^16±1`, as exponent equals 65536.

  GFPS-16M（Generalized Fermat (Near) Mega Prime Search with n = 16，指数为 65536 的（近）百万位 `b^2^16±1` 形式广义费马质数搜索）

- GFPS-17dualM (Generalized Fermat (Near) Dual Mega Prime Search with n = 17): a search for (near-)dual-million-digit generalized Fermat primes of the form `b^2^17±1`, as exponent equals 131072.

  GFPS-17dualM（Generalized Fermat (Near) Dual Mega Prime Search with n = 17，指数为 131072 的（近）二百万位 `b^2^17±1` 形式广义费马质数搜索）

- GFPS-18quadM (Generalized Fermat (Near) Dual Mega Prime Search with n = 18): a search for (near-)quad-million-digit generalized Fermat primes of the form `b^2^18±1`, as exponent equals 262144.

  GFPS-18quadM（Generalized Fermat (Near) Dual Mega Prime Search with n = 18，指数为 262144 的（近）四百万位 `b^2^18±1` 形式广义费马质数搜索）

- GPRPS (Generalized Proth / Riesel Prime Search): a search for primes in the typical `k*b^n±1` form.

  GPRPS（Generalized Proth / Riesel Prime Search，典型的 `k*b^n±1` 形式质数搜索）

- KBBPS (KBB Prime Search): a search for primes whose expressions follow the form `k*b^b±1`.

  KBBPS（KBB Prime Search，表达式满足 `k*b^b±1` 格式的质数搜索）

- CSPS (Catena Siderum Prime Search): a search for primes whose expressions follow the form `(k^(k+1))*((k+1)^(k+2))*...*((k+n)^(k+n+1))±1` or `(k^(k+1))*((k+2)^(k+3))*...*((k+n)^(k+n+1))±1`.

  CSPS（Catena Siderum Prime Search，表达式满足 `(k^(k+1))*((k+1)^(k+2))*...*((k+n)^(k+n+1))±1` 或 `(k^(k+1))*((k+2)^(k+3))*...*((k+n)^(k+n+1))±1` 格式的质数搜索）

- GNCWPS (Generalized (Near) Cullen / Woodall Prime Search): a search for primes of the form `(b(±1))*n^b±1`.

  GNCWPS（Generalized (Near) Cullen / Woodall Prime Search，形式为 `(b(±1))*n^b±1` 的质数搜索）

- GHCWPS (Generalized Hyper-Cullen / Woodall Prime Search): a search for primes of the form `b^n*n^b±1`.

  GHCWPS（Generalized Hyper-Cullen / Woodall Prime Search，形式为 `b^n*n^b±1` 的质数搜索）

- GFPPS-MUL (Generalized Factorial / Primorial Prime (Multiply Form) Search): a search for primes of the forms `k*n!±1` and `k*n#±1`.

  GFPPS-MUL（Generalized Factorial / Primorial Prime (Multiply Form) Search，形式为 `k*n!±1` 或 `k*n#±1` 的质数搜索）

- GFPPS-DIV (Generalized Factorial / Primorial Prime (Division Form) Search): a search for primes of the forms `k*n!±1` and `k*n#±1`.

  GFPPS-DIV（Generalized Factorial / Primorial Prime (Division Form) Search，形式为 `n!/k±1` 或 `n#/k±1` 的质数搜索）

- RGFPS (Recursive Generalized Fermat Prime Search): a search for primes whose expressions follow the recursive form `P_(n+1) = (2*m*(P_n))^2+1` with minimum `m`. More details are at [here](https://csic.som.emory.edu/~lzhou/blogs/?p=187). This is an internal test project; you must apply to the administrator and receive approval before you can participate.

  RGFPS（Recursive Generalized Fermat Prime Search，表达式满足递归形式 `P_(n+1) = (2*m*(P_n))^2+1` 且 `m` 最小的质数搜索，更多详情可参考[这里](https://csic.som.emory.edu/~lzhou/blogs/?p=187)，这是一个内部测试项目，你需要向管理员申请并得到批准后才能参加）

Each search project currently has a certain amount of work prepared in advance, including large numbers of candidates that have already been sieved but not yet uploaded, as well as ranges that are still undergoing sieving. Whenever the current batch of tasks is completed, a new batch will be released.

各搜索项目目前均有一定的任务筹备，存在大量已经筛分完成但未上传的候选或仍在筛分中的区域。每次当期任务批次完成后，都会上新下一批次的任务。

## Prime Reporting Rules | 质数上报规则

The Site currently implements only basic Fermat probable-prime testing. Candidates that pass this test cannot yet be conclusively proven prime and are therefore referred to as PRPs (probable primes). Unless special circumstances apply, any PRP discovered through the Site will be subjected to rigorous primality verification by the administrator as soon as possible. Once it passes verification, it will be officially confirmed as a prime.

本站只实现了基本的费马素性检验（通过检验的候选无法确证为质数，称为 PRP），任何被发现的 PRP 如无特殊情况将会第一时间被管理员进行严格的素性验证，通过验证后将被确认为质数。

Any prime discovered through the Site that either belongs to a special form (such as GNCWPS or GHCWPS) or reaches a certain size threshold (such as 100,000 digits in GPRPS or KBBPS) will be submitted to the prime database [pzktupel](https://pzktupel.de/ktuplets.php). If the prime is large enough to qualify for the T5K list, it will also be submitted there.

凡是在本站找到的质数，若符合特殊形式（如 GNCWPS、GHCWPS）或达到一定位数（如在 GPRPS 和 KBBPS 达到 100000 位），将上报给质数数据库 [pzktupel](https://pzktupel.de/ktuplets.php)，若能入围 T5K，也将一并上报。

Prime submissions often require the discoverer’s real name. If you prefer not to provide it, you may choose to submit anonymously or have the prime submitted under the administrator’s name. Regardless of your choice, the Site will faithfully record the username of the actual discoverer. If a prime requires external submission, the administrator may contact you via private message.

上报时往往需要提供您的真实姓名，若您不愿提供，也可以选择以匿名上报，或使用管理员的名字进行上报。无论您如何选择，本站会真实记录质数发现者的用户名。若出现需要上报的情况，管理员可能会与你进行私信沟通。

## Project Computing Software | 项目计算程序

The Site primarily uses our self-developed, high-efficiency CUDA programs for computation. The software is available in our [public GitHub repository](https://github.com/AstralPrisma/cuda-PRP-sieve-and-check-tools). If your computer does not support CUDA, or if you prefer not to use a GPU for computation, the Site also provides a CPU-based program (PRST).

本站主要使用自研的高效率 CUDA 程序进行计算，计算程序来自 [Github 上的公开仓库](https://github.com/AstralPrisma/cuda-PRP-sieve-and-check-tools)。若您的电脑不支持 CUDA 或您不愿使用显卡进行计算，本站也提供了 CPU 程序（PRST）。

## Client Usage Guide | 客户端使用说明

Please refer to the [Client Usage Guide](https://prpnet.astralprisma.top/docs/prime-seeker/).

请查阅[客户端使用说明](https://prpnet.astralprisma.top/docs/prime-seeker/)。

## Points System, Badges, and Leaderboard | 积分系统，奖章与排行榜

Please refer to the [Contribution Leaderboard](https://prpnet.astralprisma.top/rank) and the [Badge Gallery](https://prpnet.astralprisma.top/badges?family=total).

请查看[贡献排行榜](https://prpnet.astralprisma.top/rank)和[奖章图鉴](https://prpnet.astralprisma.top/badges?family=total)。

## Functions and Settings in User Personal Interface | 用户个人界面的功能与设置

The user profile page (accessible by clicking your avatar in the top-right corner of the site) offers a wide range of features and settings. Here, you can view your private message inbox and daily points, adjust machine settings, and manage tasks. You can also link an email address to receive notifications, as well as update your avatar and password.

用户个人界面（点击网站右上角头像进入）提供了丰富的功能与设置，您可在此页查看私信收件箱、每日积分、调整机器设置和进行任务管理。您也可以添加邮箱，设置邮箱接受信息，以及自由修改用户头像和密码。

Further clarification regarding machine and task management is necessary. You can enable "Remote Control Mode" in the client on each machine to synchronize with the website settings every 60 seconds. On the machine management page, you can directly modify the projects assigned to the controlled machines, freely pause and resume task processing, or configure the system to stop once computation is complete.

对于机器与任务管理，有必要进行进一步的说明。您可以在每台机器的客户端勾选远控模式，以此和网站设置进行每60秒一次的同步。在机器管理页面，您可以直接修改受控制的机器上所加入的项目，以及自由地暂停和恢复任务的计算，或设置算完停止。

If a machine is no longer in use and you wish to cancel your claim on a task early (rather than waiting for it to be automatically released), or if you want to delete an ongoing task from a machine with remote control mode enabled, you can go to the task management page to release the corresponding task. The next time the machine communicates with the server, it will immediately stop processing the released task and fetch a new one; the released task will return to the queue. Since releasing a task is a manual action initiated by the user, the server will not accept the task upon its completion, regardless of the reason (e.g., remote control was not enabled, or the task finished before synchronization could occur). If the task is subsequently picked up and completed by another user, you will not receive the corresponding points, nor will you be credited with the discovery of any prime number found during that task.

若一台机器不再使用且您想提前取消对该任务的申领（而不是等待其被自动释放），或是您想删除开启远控模式的机器上正在进行的任务，可以进入任务管理页面，释放对应的任务。此时当下一次机器与服务器通讯时，将立即停止计算被释放的任务并重新获取新任务，被释放的任务将回到队列中。由于释放任务是用户自己手动的行为，不管出于什么原因（如机器未开启远控，或还未能等到同步就已经完成了任务），该任务在完成时均不会被服务器接受。如果该任务后续被他人接收并完成，您将不能得到该任务的对应积分，若该任务发现质数，所发现的质数归属也不属于您。

## Forum & Private Messaging | 论坛与私信

All users will be able to create public posts on the forum, and anyone will also be able to contact the administrator directly through private messages. For security reasons, private messaging between non-administrator users will not be permitted.

允许所有人在论坛创建公开帖子，任何人也可以直接和管理员进行私信。出于安全考虑，不允许非管理员用户之间相互私信。

## Assisting with Sieving | 筛分工作协助

At times, the Site may encounter situations where the progress of sieving cannot keep pace with the consumption of available tasks. You are welcome to assist the project with sieving work. Please contact the administrator via private message to apply for sieving work. Sieving contributions are rewarded with additional special points.

本站有时会遇到筛分工作速度无法跟进任务推进速度的情况。您当然可以协助本站进行筛分工作，请与管理员进行私信以申请筛分工作。筛分工作有额外的特殊积分。

## Upcoming Features | 未来功能预告

- Competition System. Competitions will be held from time to time, with varying durations. During each competition, one or more projects will be designated as competition projects. Participants who earn the most points and those who discover the most primes, where applicable, will be recognized as winners and awarded special commemorative badges.

  **竞赛功能。**竞赛将不定期开放，开放时长不等，届时某个项目或某几个项目将成为竞赛项目，在竞赛期间获得最多积分和找到最多质数的人（如有）将获胜，胜者将被颁发特殊纪念章。

## Conclusion | 结语

Prime numbers are beautiful and mysterious. PrimeSeeker will continue to uphold an enduring spirit of exploration as we discover more primes, larger primes, and more interesting primes. If you have any further suggestions for the Site, please contact the administrator as soon as the private messaging feature becomes available. We will carefully consider every valuable suggestion we receive.

质数是美丽又神秘的数字。PrimeSeeker 将秉持永恒的探索精神，发现更多，更大，更有趣的质数。若您对本站有更多建议，请在私信功能上线后第一时间私信本站管理员，我们会积极考虑每一条宝贵的建议。