WRSWorld Research StateContribute
WORLD RESEARCH STATE

OpenAI: Integer multiplication below n log n

Reported result · significance if the exact claim is established

If verified · conditional significanceClaim scope and evidenceReported result · not independently verified.
If verified · reference score350,000Editorial revision range 200,000–600,000. Not a statistical interval. Included in rankings as an unverified reported result; excluded from achieved-science progress totals.

Provisional assessment of the stated contribution scope. Scientific evidence and contributor attribution are separate.

Scientific record data (JSON) · Challenge or correct a rating

What is claimed?

The paper claims one exact deterministic fixed finite-tape Turing-machine algorithm with worst-case O(n(log n)^(1-kappa)) time, kappa=2^(-182), for n-bit integer products. Reported result; not independently verified by WRS. Ranked using a provisional grade and reference estimate for the exact claimed result.

Scientific scope

The saving is asymptotic and thresholds are extremely large. The bit model matters; this is not a present-day performance benchmark. WRS inspected the selected opening statement and available scope note, not the full proof; independent formal replay was not run.

Evidence state

The source reports this result. WRS has not independently reconstructed the complete argument or validated the reported evidence. The grade and score here express conditional significance; they do not certify correctness. The provisional value enters the main reference rankings with an unverified label, but not achieved-science progress totals.

Full scientific record · Challenge or correct this assessment