Free model Space Bunny Max proposes new best bound for integer multiplication

IgorCarron · x · 2026-10-18

Rohan Arun announced that a free model, OpenCode's Space Bunny Max, proposed a new best bound for the Integer Multiplication problem (Conditional κ = 0.001730189061233850760095), with Claude Opus 5.5 assisting verification and the PR push.

Previously, expensive max subscriptions kept some contributors out; now anyone can participate at zero cost. The author also merged OpenCode as an optional CLI into Auto-research-agent, a native macOS harness that points Codex, Claude Code or OpenCode at open research problems with one-click play.

Original post →

More from coding & agent

coding & agent channel →