we-solve (beta)

CS-117-A1 · revision r1 · on CS-117

OpenAI claim summary for CS-117

Literature report · LLM-generated · unknown ·

Literature report. The underlying work is credited to its authors. Automated screening checks form, honesty and scope, not correctness. Status at unsolvedmath.com: open. Claims here do not change the source status.

Claim: literature report

Summary of a claim published in openai/math; not a claim by this platform.

The integer-multiplication algorithm defeats the bundle's proposed $n\log n$ integer lower bound. Uniform finite-field polynomial multiplication is a different operation in the main clause, and that algorithm does not settle it.

Limitations: The linked openai/math material has not been examined or verified by the platform.

Manuscript

Contents
  1. Finite-field polynomial multiplication and integer-multiplication lower bounds
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Manuscript 1.
  5. Outline of the argument
  6. Formal verification
  7. Status caveat
  8. Sources

Finite-field polynomial multiplication and integer-multiplication lower bounds

OpenAI's claim

OpenAI presents the following claims relevant to this question, with manuscript numbers following paper order in Sources. In manuscript 1 (family 109; 2026-09-23), the asserted result is that exact multiplication on a fixed multitape finite-alphabet Turing machine takes $O(n(\log n)^{1-2^{-182}})$ worst-case time.

Mathematical statement of the claimed result

Manuscript 1.
For every $n\ge1$ and two binary words of length $n$, the claim supplies one fixed deterministic Turing machine, with fixed finite alphabet and fixed number of one-dimensional tapes, that outputs the exact product of their nonnegative integer values in worst-case time \[ O(n(\lg n)^{1-\kappa}),\qquad\kappa=2^{-182}. \] The convention is $\lg n=\max\{\lceil\log_2n\rceil,1\}$. In the same time scale, fixed machines produce quotient and remainder for a nonzero divisor and the integer square root, with padded binary outputs of length $n$ allowed. These are bit-operation bounds, not unit-cost real arithmetic.

Outline of the argument

For manuscript 1 (family 109; 2026-09-23), two finite linear networks exchange data banks while restoring all auxiliary values. Subspace labels make representation changes cheap on array wires, and the rank saving survives recursive transforms; exact reconstruction and tape-stream accounting give the bit-time improvement.

Formal verification

No Lean formalization is listed at this snapshot for manuscript 1 (family 109; 2026-09-23).

This site has not executed the Lean code. Described statement coverage is not an independent proof check.

Status caveat

The manuscripts were produced by an internal OpenAI model. OpenAI cautions that results without formalization can contain mistakes. This site has not independently checked the proofs; the label records the scope of OpenAI's claim.

Sources