Conditional integer-multiplication bound κ ≈ 0.00139 (integer-mult-bounds PR #514)
Status
Not evaluated
Recorded on · github.com
- Announced
- Recordednot evaluated
- nextTo follow
What this status means
Source reading : Source read word for word (level 3 of 3)
No DiscoverIA status yet; this does not mean nobody has checked it.
To move to “Under review”: a public review under way. To “Peer reviewed”: a journal publication or a review by named experts.
The gist
On 11 October 2026, a contributor to the integer-mult-bounds project proposed a conditionally improved theoretical bound for multiplying very large integers.
Cite this entry
A single status snapshot since Oct 12, 2026: a citation always points to a dated snapshot.
Cite snapshot 1, Oct 12, 2026
APA citation with the dated link
BibTeX @misc, key discoveria-imb-pr514-kappa-2026-10-11-r1
@misc{discoveria-imb-pr514-kappa-2026-10-11-r1,
author = {{DiscoverIA}},
title = {Conditional integer-multiplication bound κ ≈ 0.00139 (integer-mult-bounds PR #514)},
howpublished = {DiscoverIA registry, entry imb-pr514-kappa-2026-10-11},
note = {Status « Not evaluated », snapshot 1, recorded on October 12, 2026. new result},
year = {2026},
url = {https://discoveria.ai/en/fiche/imb-pr514-kappa-2026-10-11/#releve-1},
urldate = {2026-10-12}
}Dated link opens this snapshot in the history
Text written by an AI (DiscoverIA pipeline), on Reviewed by: Antoine Olivier, Oct 18, 2026Report an error
What has not been reviewed?
The status and its sources come from the registry; the explanatory text has been reviewed by a human.
The status and its sources come from the registry; the explanatory text has been reviewed by a human.
Key facts
- Claimed by
- un contributeur (contributeur de CrocSwap/integer-mult-bounds) (Name replaced by a role)
announced on Oct 11, 2026 - Nature
- new result
- Field
- Theoretical computer science (complexity of integer multiplication)
- Checked by
- claimant
- Sources (domains)
- 3 : 3 read word for word
- This entry
- Reviewed by Antoine Olivier, Oct 18, 2026
To understand
Analogy
Like a journey time worked out from a set of assumptions: the conclusion depends on those assumptions, and the calculation still needs checking.
What it changes
κ appears in a theoretical bound on computing time, of the form n (log n)^(1-κ) for n-bit numbers (binary digits): the larger κ, the lower this bound as n grows, with no promise of a practical speed-up. If the bound held, it would improve, under the same assumptions, on the one in family #109 of the OpenAI release, where κ = 2^-182, a far smaller number.
What remains unclear
The result only stands if the framework of OpenAI family #109 and the interfaces listed by the PR (a change request on GitHub) are sound. No published independent evaluation is recorded and the request is not merged. No AI use is declared in this PR: the entry is tracked because it builds on that OpenAI result.
3 sources.
For experts
Sources(domains)
- primairegithub.compage read word for word · consulted on Oct 12, 2026
- depotgithub.compage read word for word · consulted on Oct 12, 2026 ·
Community research maintained by Douglas Colkitt — conditional on the original OpenAI #109 framework.
- articlegithub.compage read word for word · consulted on Oct 12, 2026 ·
109. Integer multiplication below $`n\log n`$. Multiplies two n-bit integers exactly at every input length in deterministic worst-case time $`O(n(\log n)^{1-\kappa})`$, with $`\kappa=2^{-182}`$
Method
The PR provides a finite certificate in exact rational numbers, which the verify.py script replays using only the Python standard library. κ is exactly 1391523459591829/1000000000000000000, under the assumptions of the OpenAI #109 framework adopted by the PR. Status “not evaluated” recorded on 12 October 2026 from github.com (page read, quotation checked word for word).
Limits
DiscoverIA has recorded no independent evaluation as of this date. Antoine Olivier contributed to the integer-mult-bounds repository (PR #214).
Like a journey time worked out from a set of assumptions: the conclusion depends on those assumptions, and the calculation still needs checking.
Status history
Only one observation so far.
An observation is added; none is ever erased.
Related frontiers
Report an error or suggest a source
Thank you, your message was sent.
Sending failed. Try again, or write to [email protected].