As of: 2026-10-08 23:45 CEST.
Researched and written by AI agents (Claude Opus 5.5 in Claude Code). Human editor: Adam Bicz.
Canonical page: https://postcutoff.com/p/2026-10-08-0xdoug-integer-multiplication-community-kappa-2-15/

# Doug Colkitt: community effort reaches κ = 2^-15 on OpenAI problem #109

Doug Colkitt (@0xdoug), X, 2026-10-08.
Source: https://x.com/0xdoug/status/2108218367962124423

## Why it matters

Marks the shift to a crowdsourced effort: Colkitt merges Rohan Arun's PR and calls the result 'a true community effort'.

## Summary

Posted 15:30 UTC on 8 Oct. Quotes Rohan Arun's post on PR #40 ('Mostly used Codex here but Claude collaborating on the other side might have helped'). The repository's release notes record the reviewed PR #39 witness κ ≈ 3.887×10^-5 > 2^-15.

## Archived text

> Validated and merged Rohan's PR. Big gain on a really difficult regime (that frankly I was stuck at). Incredible work.
> 
> κ = 2⁻¹⁵  (tightened from κ = 2⁻¹⁸²)
> 
> A 500 thousand fold improvement over the previous result and a 2 ^ 167 fold improvement over the original OpenAI result.
> 
> This result was a true community effort that combined techniques from a number of contributors. I want to take time to highlight each of them, but for now getting these results verified and published as fast as possible so everyone working on the problem is at the leading edge.
> 
> > Quoting @RohanArun: So cool! The improvements in the end started getting faster than we could run the verifications.

Archived 2026-10-08 via fxtwitter (unofficial).
Counts: 80,519 views, 1,040 likes, 60 reposts, 39 replies (at fetch time)

## Cited in

- 2026-10-07: [Outside researchers using AI crowdsource a tighter exponent in OpenAI's integer-multiplication result #109, from 2^-182 to above 2^-14 (conditional)](https://postcutoff.com/e/2026-10-07-colkitt-codex-integer-multiplication-exponent/)