Not evaluated
Deterministic polynomial factorization over prime fields (family 142)
The gist
On October 6, 2026, OpenAI released a manuscript on deterministic polynomial factorisation over prime fields.
DiscoverIA status on October 12, 2026: not evaluated, meaning no third-party evaluation found.
AI draft, not reviewedWhat has not been reviewed?
Text written by an AI (DiscoverIA pipeline), on . The status and its sources come from the registry; only the explanatory text has not been reviewed. A reported error is corrected, then the text is reviewed.
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-oai-fam-142-deterministic-polynomial-factorization-prime-r1
@misc{discoveria-oai-fam-142-deterministic-polynomial-factorization-prime-r1,
author = {{DiscoverIA}},
title = {Deterministic polynomial factorization over prime fields (family 142)},
howpublished = {DiscoverIA registry, entry oai-fam-142-deterministic-polynomial-factorization-prime},
note = {Status “Not evaluated”, snapshot 1, recorded on October 12, 2026. New result},
year = {2026},
url = {https://discoveria.ai/entry/oai-fam-142-deterministic-polynomial-factorization-prime#releve-1},
urldate = {2026-10-12}
}Dated link opens this snapshot in the history
To understand ≈ 30 s reading time, estimated
What it changes
If the manuscript held, it would bring a result on factorising a polynomial, that is, writing it as a product of simpler polynomials. The title specifies that the method is deterministic (no random draws) and that the coefficients live in a prime field. A prime field is here the set of integers counted modulo a prime number.
What remains unclear
No independent assessment is recorded, and OpenAI provides no Lean proof (Lean is a language in which a computer checks every step of a proof) for this family. The manuscript comes from an internal model that OpenAI has not released.
For experts
Sources, method, key facts, status history, report an error
Status
Not evaluated
Recorded on · github.com · README.md
Step 1 of 4 on the scale: not evaluated. Next step: under review.
- Announced
- Recordednot evaluated
- nextTo follow
What this status means
Source reading : Source read word for word (level 3 of 3)
The result is declared neither right nor wrong.
To move to “Under review”: a public review under way. To “Peer reviewed”: a journal publication or a review by named experts.
Sources
- Main sourcegithub.com · CONTENTS.mdlink only, reading not recorded
- Repositorygithub.com · Deterministic-Polynomial…link only, reading not recorded
Method
In the openai/math release, family 142 has a single manuscript, dated October 4, 2026: “Deterministic Polynomial Factorization over Prime Fields”. It is filed under the section “Theoretical computer science” of overview.tex; history.md reports no revision. DiscoverIA status: not evaluated, meaning that no third-party evaluation has been found in the sources read. Set on October 12, 2026 from github.com (page read, quotation checked word for word: “Not all have accompanying Lean formalizations.”).
Limits
DiscoverIA has not checked this result itself.
Key facts
- Claimed by
- OpenAI (unreleased internal model)
announced on Oct 6, 2026 - Nature
- new result
- Field
- Theoretical computer science
- In openai/math
- family 142, section “Theoretical computer science”, 1 manuscript dated Oct 4, 2026
- Lean proof
- none supplied
- Revisions
- none reported by the claimant
- Checked by
- no verifier identified
- Sources
- 2 : 2 links only
- This entry
- AI draft, not reviewed
Status history
Only one observation so far.
- 01
First observation:Not evaluatedCurrent status
Family with no Lean proof supplied. No third-party evaluation read.
Source: github.comread word for word
An observation is added; none is ever erased.
In the same set
openai/math: 719 manuscripts in 372 families from an unreleased internal model · entry 138 of 372, by family number
- Not evaluated : Subpolynomial queries for log-concave sampling (family 139)
- Not evaluated : Memory–sample lower bounds for noiseless Gaussian regression (family 140)
- Not evaluated : The existential theory of the reals and existential–universal sentences in the counting hierarchy (family 141)
- Not evaluated : Deterministic polynomial factorization over prime fields (family 142)
- Not evaluated : Uniform limit-cycle bounds in Hilbert's sixteenth problem (family 143)
- Not evaluated : Banach's simple Lebesgue-spectrum problem (family 144)
- Not evaluated : Rokhlin's multiple-mixing problem (family 145)
Report an error or suggest a source
Thank you, your message was sent.
Sending failed. Try again, or write to contact@discoveria.ai.
Is your result listed?What each status requires, correcting this entry, replying to it.