跳到正文
Rohan Paul· @rohanpaul_ai · X·· 3 小时前AI 评分35
AI 导读

数学从这里开始将以极快的速度发展。 在短短数小时内,研究人员就在不断发现新方法/新证明。 这是乘法超长数字的新方法,比之前最佳理论少浪费一点力气。 @0xdoug: 我们正在发布 OpenAI 问题 #109(整数乘法)的更新,进一步大幅收紧: κ = 2⁻⁵⁹(相比 OpenAI 最初的 κ = 2⁻¹⁸²) 相比我们之前的结果提升了约 50 万倍,相比 OpenAI 最初结果提升了 2¹²³ 倍。 最新方案重新设计了有限网络以共享中间计算和暂存空间,然后收紧了递归和高斯估计。

正文

Math will progress at a breakneck speed from here on.

in matter of hours researchers are finding new methods/proofs

Here's the new way for multiplying absurdly long numbers to waste a little less effort than the previous best theory allowed.

引用Doug Colkitt@0xdoug
We are publishing an update to OpenAI problem #109 Integer multiplication) with another substantial further tightening: κ = 2⁻⁵⁹ (from OpenAI’s original κ = 2⁻¹⁸²) Approximately 500 thousand fold improvement over our previous result and a 2¹²³ fold improvement over the original OAI result. The latest redesigned the finite network to share intermediate computations and scratch space, then tightened the recursion and Gaussian estimates.
在 X 查看被引用的帖子

来源:Rohan Paul · x.com