On September 29, our GFPS project finally achieved its first gratifying result: after testing approximately 27,000 candidates, we finally found the largest GFN-16 prime with fewer than one million digits. 1814570322533286^65536+1 is a prime number. If our GFN screening and PRP testing procedures are free of errors, then all bases exceeding this value—and below one million digits—have already been tested. Due to its large number of digits, this prime has been submitted to the T5K database and has passed the primality proof; the link is https://t5k.org/primes/page.php?id=142483. Now that this prime number has been discovered, the focus of the GFPS project will shift; however, the specific new direction has not yet been determined, so please await further updates.
在9月29日，我们的GFPS项目终于取得了第一个可喜的结果：经过了多达约27000个候选的测试后，我们终于找到了最大的低于100万位的GFN-16质数：1814570322533286^65536+1 。如果我们的GFN筛分和PRP检测程序没有任何故障，那么所有高于这个且低于100万位的底数都已经过了测试。因为位数足够大，该质数已经提交至T5K数据库，且已经通过了素性证明，链接为https://t5k.org/primes/page.php?id=142483。鉴于这个质数已经被发现，接下来GFPS的项目重心将会发生转移，但暂时还未确定具体转向什么范围，请等待之后的进一步消息。