HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
openai
math
Lean2026–2026
openai / math

math

Discover this repository through its Hacker News conversations.

Explore on GitHubRead Hacker News discussions
47Distinct people
50Mentions
0Explicit recommenders
17.5KGitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A public description has not been verified.

Where it is used

  • OpenAI Math Explorer — OpenAI Math Explorer uses data from the github.com/openai/math repository to populate its content. The site’s map, related results, search, and indexes are Emergent Mind’s features built on that data. Source

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 8–Nov 15 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/15/2026, 9:28:18 AM UTC.

Ask HN: Can anyone name anything new that AI has done? direct repository linkDebated

Participants debate whether current AI systems have produced genuinely novel achievements or merely reassembled existing data, with some citing mathematical proofs and protein folding as evidence of new capabilities while others argue these are just correlations. The strongest disagreement centers on the definition of novelty, contrasting the view that AI synthesizes known information against the counter-argument that such synthesis constitutes a new form of discovery comparable to human intellectual work.

28 readable replies · Supporting reply 1 · Supporting reply 2 · Supporting reply 3 · Supporting reply 4

Mentions over time

HN mentions by day50 dated mentions

Observed mentions: 2026-10-06 22:17:21 UTC to 2026-11-01 20:29:36 UTC.

0510152026-10-06 00:00:00 UTC to 2026-10-07 00:00:00 UTC (exclusive): 14 mentions; 6 submissions, 8 commentsOct 62026-10-07 00:00:00 UTC to 2026-10-08 00:00:00 UTC (exclusive): 14 mentions; 2 submissions, 12 comments2026-10-08 00:00:00 UTC to 2026-10-09 00:00:00 UTC (exclusive): 6 mentions; 4 submissions, 2 comments2026-10-09 00:00:00 UTC to 2026-10-10 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2026-10-10 00:00:00 UTC to 2026-10-11 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-11 00:00:00 UTC to 2026-10-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-12 00:00:00 UTC to 2026-10-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-13 00:00:00 UTC to 2026-10-14 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2026-10-14 00:00:00 UTC to 2026-10-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-15 00:00:00 UTC to 2026-10-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-16 00:00:00 UTC to 2026-10-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-17 00:00:00 UTC to 2026-10-18 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-18 00:00:00 UTC to 2026-10-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-19 00:00:00 UTC to 2026-10-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsOct 192026-10-20 00:00:00 UTC to 2026-10-21 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2026-10-21 00:00:00 UTC to 2026-10-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-22 00:00:00 UTC to 2026-10-23 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-23 00:00:00 UTC to 2026-10-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-24 00:00:00 UTC to 2026-10-25 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-25 00:00:00 UTC to 2026-10-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-26 00:00:00 UTC to 2026-10-27 00:00:00 UTC (exclusive): 9 mentions; 3 submissions, 6 comments2026-10-27 00:00:00 UTC to 2026-10-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-28 00:00:00 UTC to 2026-10-29 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-29 00:00:00 UTC to 2026-10-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-30 00:00:00 UTC to 2026-10-31 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-31 00:00:00 UTC to 2026-11-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-11-01 00:00:00 UTC to 2026-11-02 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsNov 1

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Oct 62026-10-06 00:00:00 UTC2026-10-07 00:00:00 UTC1468
Oct 72026-10-07 00:00:00 UTC2026-10-08 00:00:00 UTC14212
Oct 82026-10-08 00:00:00 UTC2026-10-09 00:00:00 UTC642
Oct 92026-10-09 00:00:00 UTC2026-10-10 00:00:00 UTC404
Oct 102026-10-10 00:00:00 UTC2026-10-11 00:00:00 UTC000
Oct 112026-10-11 00:00:00 UTC2026-10-12 00:00:00 UTC000
Oct 122026-10-12 00:00:00 UTC2026-10-13 00:00:00 UTC000
Oct 132026-10-13 00:00:00 UTC2026-10-14 00:00:00 UTC101
Oct 142026-10-14 00:00:00 UTC2026-10-15 00:00:00 UTC000
Oct 152026-10-15 00:00:00 UTC2026-10-16 00:00:00 UTC000
Oct 162026-10-16 00:00:00 UTC2026-10-17 00:00:00 UTC000
Oct 172026-10-17 00:00:00 UTC2026-10-18 00:00:00 UTC000
Oct 182026-10-18 00:00:00 UTC2026-10-19 00:00:00 UTC000
Oct 192026-10-19 00:00:00 UTC2026-10-20 00:00:00 UTC000
Oct 202026-10-20 00:00:00 UTC2026-10-21 00:00:00 UTC110
Oct 212026-10-21 00:00:00 UTC2026-10-22 00:00:00 UTC000
Oct 222026-10-22 00:00:00 UTC2026-10-23 00:00:00 UTC000
Oct 232026-10-23 00:00:00 UTC2026-10-24 00:00:00 UTC000
Oct 242026-10-24 00:00:00 UTC2026-10-25 00:00:00 UTC000
Oct 252026-10-25 00:00:00 UTC2026-10-26 00:00:00 UTC000
Oct 262026-10-26 00:00:00 UTC2026-10-27 00:00:00 UTC936
Oct 272026-10-27 00:00:00 UTC2026-10-28 00:00:00 UTC000
Oct 282026-10-28 00:00:00 UTC2026-10-29 00:00:00 UTC000
Oct 292026-10-29 00:00:00 UTC2026-10-30 00:00:00 UTC000
Oct 302026-10-30 00:00:00 UTC2026-10-31 00:00:00 UTC000
Oct 312026-10-31 00:00:00 UTC2026-11-01 00:00:00 UTC000
Nov 12026-11-01 00:00:00 UTC2026-11-02 00:00:00 UTC101

What Hacker News says

14 sources
NotOscarWilde·Oct 6, 2026
As a TCS/scheduling person, this one is definitely of lesser importance than UGC, but it has been an open problem since the book of Garey and Johnson in 1979: A Polynomial-Time Algorithm for Three-Machine Unit-Job Scheduling [1] Since some people talk about small numbers that pop up in integer multiplication results, here a completely different number appears: Theorem 1.1. Let an explicitly listed finite directed acyclic graph specify the precedence constraints on n >= 1 nonpreemptive unit-length jobs on three identical machines. There is a uniform deterministic algorithm that constructs a feasible schedule of minimum makespan. Given also an integer deadline 1 <= T <= n, it decides feasibility exactly and returns a schedule whenever the answer is affirmative. Both tasks can be performed in O((L + 2)^150020) steps on a deterministic multit
Read the rest
ape Turing machine, where L is the total binary input length. That is some crazy exponent -- plus an interestingly old computational model to boot; not something that is natural to most of us. I have no capacity to check its correctness today, but I hope it is true purely for the exponent. [1]: https://github.com/openai/math/blob/main/preprints/A-polynom...
In Sharing AI progress in mathematics

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.