TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

GIMPS Discovers Largest Known Prime Number: 2^136279841 – 1

30 点作者 fuglede_7 个月前

6 条评论

sega_sai7 个月前
Given the number of machines Luke Durant is running <a href="https:&#x2F;&#x2F;www.mersenne.org&#x2F;report_recent_results&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.mersenne.org&#x2F;report_recent_results&#x2F;</a> it must cost a lot of money, given those are GPU nodes. I wonder what&#x27;s the story there. Also I think up till yesterday the name was not shown on his submissions, it was only shown as ANONYMOUS.
评论 #41956069 未加载
tromp7 个月前
The first Mersenne prime since 1996 not to be discovered on x86 hardware, but on an NVidia A100 [1].<p>[1] <a href="https:&#x2F;&#x2F;www.mersenne.org&#x2F;primes&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.mersenne.org&#x2F;primes&#x2F;</a>
评论 #41907913 未加载
fuglede_7 个月前
Earlier Hacker News discussion, after the announcement that a (then secret) number was a probable prime, yet to be verified prime: <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=41858024">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=41858024</a>
评论 #41905500 未加载
croemer7 个月前
I wonder where Luke Durant got the money from to fund the effort. He&#x27;s a former NVIDIA employee, I wouldn&#x27;t be surprised if this was funded by NVIDIA.
charlieyu17 个月前
Wonder why it took so long to find a new one. I get the time complexity is a bit more than O(p^2) by a Wikipedia search, but still, 6 years is a lot.
评论 #41905493 未加载
评论 #41910051 未加载
croemer7 个月前
Since the announcement a week ago I&#x27;ve started contributing to the project myself. It&#x27;s fun!