← 返回归档

帖子详情

查看 X 原文
J
Jerry Liu@jerryjliu0
my guy is running gradient descent on math Rohan Arun @RohanArun From κ = 2⁻¹⁸² to 0.001734815770 :) Integer Multiplication community auto-research highlights since 10/15 (+1.23%): 1) The big headline of the day is that a free model, @opencode 's Space Bunny Max, just set the record for the first time, 4 times in a row! As far as I know, this is the first time a free model has submitted a best bound for Integer Multiplication. Expensive Max subscriptions previously kept some of our best contributors and experts out, but the barrier of entry for frontier auto-research dropped to 0 :) Claude Opus 5.5 helped verify and push the PRs over the line. I still recommend having a frontier model verify, but other contributors can do that. Progress was slowing over the last day (relative to one new κ per minute, which is still wild for math research), but Space Bunny Max just injected fresh ideas that boosted our PR rate back to one per minute. 2) A community Lean proof of the original OpenAI Integer Multiplication paper has been completed! @platypii et. al completed the proof in 6 days, and @0xdoug 's repo is about 10–20% verified now. To be clear, most of our work still needs verification but the Lean proofs are catching up :) 3) 41–51% of PRs now mention a prior research-only submission, up from 0–3% before @0xdoug 's autoresearch.md prompt. His prompt guides new contributors to specific research tracks rather than incremental updates. We're moving away from "brute force research" towards more coordinated efforts across an army of agents. If you're contributing research PRs, even negative results without a new record, you're meaningfully helping us and I appreciate it! Interesting observations: 1) The results from free models are related to the recent "local minima" solutions in context engineering that have been popping up: Forgetting context to "refresh" by @ShangyinT . Branching into different solutions by @mao_yuzhen . Fork and flush by @DimitrisPapail . Now even free models contribute to escaping local minima by exploring new solutions, since they're trained on different data. There's likely a lot of room for improvement now in context engineering, consensus across different models, and collaboration strategies, which we will test next. 2) Frontier research as a benchmark helped us find a successful context-sharing strategy for parallel agents. Basically, we can rewind frontier research GitHub repos to an earlier branch and benchmark agent harnesses, prompts, context designs, models, etc. With this benchmark, we found that you can distill constantly to local files, then periodically concatenate them instantly into parallel agent sessions to save 10–20% of the time it takes to reach the next breakthrough. 3) There's a Codex reset by EOD PST, so you can copy this prompt to run unused tokens on frontier research :) """ Contribute one useful, independently reviewable result to github.com/CrocSwap/integ… . Read AGENTS.md, autoresearch.md and CONTRIBUTING.md from the current main branch first. Use the repository's task-selection and overlap process unless I assigned a specific task. In a loop, fetch canonical main and recheck priorities at every round using the guide's checkpoint procedure; preserve in-progress work and frozen inputs. Work for one session of about 60 minutes unless I specify another budget, keeping the final quarter for verification and a concise handoff, and report the exact scope, evidence, remaining obligations and predecessor credit. You may post routine claims, questions, findings, handoffs and feedback in Discussions and open a focused PR without asking me again for each action. Do not merge, close others' PRs or change the selected frontier. """ You can also copy this prompt into OpenCode now! Now that anyone can contribute for free to frontier auto-research, repost this and sharing it with friends. 🙏 4) PR stats: 850 PRs from 67 contributors since 10/15, and 21 of those contributors are first-timers. 55 PRs claim a new conditional κ in the title. Codex/OpenAI in 480 PRs (56%), Claude in 147 (17%), the OpenCode harness in 60 (7%), Cursor in 16. Most prolific contributors by PR count: petalas: 164, ywz65: 147, navinor: 49, commdata2338: 44, RossRichardson: 43, Arham-Tahir64: 39, thakrarsagar: 34, VictorLiwentao: 30, tekuuu: 28, DreamingOfClouds: 23, jmbarrancoml: 21, jeremykothe2: 21, bitplane: 13, Gonzalo-Mier: 12, Dugongue: 12, mdumitrean: 11, theon199: 9, jwr404: 9, jamesyc: 9, kumagi: 8, CubeJerry: 8, rohanarun: 6, jeremydiviney: 6, dcharb78: 6, 1337isnot1337: 6, starship-s: 6, AAAmirinu: 6. Conditional κ = 0.001734815770385098563484. Just submitted a new best bound :) github.com/CrocSwap/integ… d 🔗 View Quoted Tweet
媒体保存失败:[Errno 104] Connection reset by peer
媒体保存失败:[Errno 104] Connection reset by peer
查看 Markdown 内容
---
tweet_id: "2111617664196157512"
author: "jerryjliu0"
published_at: "2026-10-18T00:37:37+00:00"
source_url: "https://x.com/jerryjliu0/status/2111617664196157512"
---

my guy is running gradient descent on math

![Rohan Arun](https://pbs.twimg.com/profile_images/1946954678874308608/lbpeDP1__normal.jpg)

Rohan Arun@RohanArun

From κ = 2⁻¹⁸² to 0.001734815770 :)  
  
Integer Multiplication community auto-research highlights since 10/15 (+1.23%):  
  
1) The big headline of the day is that a free model, [@opencode](https://x.com/opencode)'s Space Bunny Max, just set the record for the first time, 4 times in a row!  
  
As far as I know, this is the first time a free model has submitted a best bound for Integer Multiplication.  
  
Expensive Max subscriptions previously kept some of our best contributors and experts out, but the barrier of entry for frontier auto-research dropped to 0 :)  
  
Claude Opus 5.5 helped verify and push the PRs over the line. I still recommend having a frontier model verify, but other contributors can do that.   
  
Progress was slowing over the last day (relative to one new κ per minute, which is still wild for math research), but Space Bunny Max just injected fresh ideas that boosted our PR rate back to one per minute.  
  
2) A community Lean proof of the original OpenAI Integer Multiplication paper has been completed!  
  
[@platypii](https://x.com/platypii) et. al completed the proof in 6 days, and [@0xdoug](https://x.com/0xdoug)'s repo is about 10–20% verified now.  
  
To be clear, most of our work still needs verification but the Lean proofs are catching up :)  
  
3) 41–51% of PRs now mention a prior research-only submission, up from 0–3% before [@0xdoug](https://x.com/0xdoug)'s autoresearch.md prompt.  
  
His prompt guides new contributors to specific research tracks rather than incremental updates.  
  
We're moving away from "brute force research" towards more coordinated efforts across an army of agents.  
  
If you're contributing research PRs, even negative results without a new record, you're meaningfully helping us and I appreciate it!  
  
Interesting observations:  
  
1) The results from free models are related to the recent "local minima" solutions in context engineering that have been popping up:  
  
Forgetting context to "refresh" by [@ShangyinT](https://x.com/ShangyinT).  
  
Branching into different solutions by [@mao\_yuzhen](https://x.com/mao_yuzhen).  
  
Fork and flush by [@DimitrisPapail](https://x.com/DimitrisPapail).  
  
Now even free models contribute to escaping local minima by exploring new solutions, since they're trained on different data.  
  
There's likely a lot of room for improvement now in context engineering, consensus across different models, and collaboration strategies, which we will test next.  
  
2) Frontier research as a benchmark helped us find a successful context-sharing strategy for parallel agents.  
  
Basically, we can rewind frontier research GitHub repos to an earlier branch and benchmark agent harnesses, prompts, context designs, models, etc.  
  
With this benchmark, we found that you can distill constantly to local files, then periodically concatenate them instantly into parallel agent sessions to save 10–20% of the time it takes to reach the next breakthrough.  
  
3) There's a Codex reset by EOD PST, so you can copy this prompt to run unused tokens on frontier research :)  
  
"""  
Contribute one useful, independently reviewable result to [github.com/CrocSwap/integ…](https://github.com/CrocSwap/integer-mult-bounds). Read AGENTS.md, autoresearch.md and CONTRIBUTING.md from the current main branch first. Use the repository's task-selection and overlap process unless I assigned a specific task. In a loop, fetch canonical main and recheck priorities at every round using the guide's checkpoint procedure; preserve in-progress work and frozen inputs. Work for one session of about 60 minutes unless I specify another budget, keeping the final quarter for verification and a concise handoff, and report the exact scope, evidence, remaining obligations and predecessor credit. You may post routine claims, questions, findings, handoffs and feedback in Discussions and open a focused PR without asking me again for each action. Do not merge, close others' PRs or change the selected frontier.  
"""  
You can also copy this prompt into OpenCode now!  
  
Now that anyone can contribute for free to frontier auto-research, repost this and sharing it with friends. 🙏  
  
4) PR stats:  
  
850 PRs from 67 contributors since 10/15, and 21 of those contributors are first-timers.  
  
55 PRs claim a new conditional κ in the title.  
  
Codex/OpenAI in 480 PRs (56%), Claude in 147 (17%), the OpenCode harness in 60 (7%), Cursor in 16.  
  
Most prolific contributors by PR count: petalas: 164, ywz65: 147, navinor: 49, commdata2338: 44, RossRichardson: 43, Arham-Tahir64: 39, thakrarsagar: 34, VictorLiwentao: 30, tekuuu: 28, DreamingOfClouds: 23, jmbarrancoml: 21, jeremykothe2: 21, bitplane: 13, Gonzalo-Mier: 12, Dugongue: 12, mdumitrean: 11, theon199: 9, jwr404: 9, jamesyc: 9, kumagi: 8, CubeJerry: 8, rohanarun: 6, jeremydiviney: 6, dcharb78: 6, 1337isnot1337: 6, starship-s: 6, AAAmirinu: 6.  
  
Conditional κ = 0.001734815770385098563484.  
  
Just submitted a new best bound :)  
[github.com/CrocSwap/integ…](https://github.com/CrocSwap/integer-mult-bounds/pull/3251)d

![Tweet Image](https://pbs.twimg.com/media/HU23sGCWwAADr-J.jpg)

[🔗 View Quoted Tweet](https://x.com/RohanArun/status/2111568465223925936)