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

conway-refinement

A proof of Conway's refinement conjecture in Lean

2Distinct people
5Mentions
0Explicit recommenders
56GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A proof of Conway's refinement conjecture in Lean

GitHub

Where it is used

No documented product use has been verified yet.

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 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by day5 dated mentions

Observed mentions: 2026-09-02 12:16:10 UTC to 2026-09-19 20:59:17 UTC.

0122026-09-02 00:00:00 UTC to 2026-09-03 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsSep 22026-09-03 00:00:00 UTC to 2026-09-04 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-04 00:00:00 UTC to 2026-09-05 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2026-09-05 00:00:00 UTC to 2026-09-06 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-06 00:00:00 UTC to 2026-09-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-07 00:00:00 UTC to 2026-09-08 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-08 00:00:00 UTC to 2026-09-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-09 00:00:00 UTC to 2026-09-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-10 00:00:00 UTC to 2026-09-11 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsSep 102026-09-11 00:00:00 UTC to 2026-09-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-12 00:00:00 UTC to 2026-09-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-13 00:00:00 UTC to 2026-09-14 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-14 00:00:00 UTC to 2026-09-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-15 00:00:00 UTC to 2026-09-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-16 00:00:00 UTC to 2026-09-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-17 00:00:00 UTC to 2026-09-18 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-18 00:00:00 UTC to 2026-09-19 00:00:00 UTC (exclusive): 2 mentions; 1 submissions, 1 comments2026-09-19 00:00:00 UTC to 2026-09-20 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsSep 19

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
Sep 22026-09-02 00:00:00 UTC2026-09-03 00:00:00 UTC110
Sep 32026-09-03 00:00:00 UTC2026-09-04 00:00:00 UTC000
Sep 42026-09-04 00:00:00 UTC2026-09-05 00:00:00 UTC110
Sep 52026-09-05 00:00:00 UTC2026-09-06 00:00:00 UTC000
Sep 62026-09-06 00:00:00 UTC2026-09-07 00:00:00 UTC000
Sep 72026-09-07 00:00:00 UTC2026-09-08 00:00:00 UTC000
Sep 82026-09-08 00:00:00 UTC2026-09-09 00:00:00 UTC000
Sep 92026-09-09 00:00:00 UTC2026-09-10 00:00:00 UTC000
Sep 102026-09-10 00:00:00 UTC2026-09-11 00:00:00 UTC000
Sep 112026-09-11 00:00:00 UTC2026-09-12 00:00:00 UTC000
Sep 122026-09-12 00:00:00 UTC2026-09-13 00:00:00 UTC000
Sep 132026-09-13 00:00:00 UTC2026-09-14 00:00:00 UTC000
Sep 142026-09-14 00:00:00 UTC2026-09-15 00:00:00 UTC000
Sep 152026-09-15 00:00:00 UTC2026-09-16 00:00:00 UTC000
Sep 162026-09-16 00:00:00 UTC2026-09-17 00:00:00 UTC000
Sep 172026-09-17 00:00:00 UTC2026-09-18 00:00:00 UTC000
Sep 182026-09-18 00:00:00 UTC2026-09-19 00:00:00 UTC211
Sep 192026-09-19 00:00:00 UTC2026-09-20 00:00:00 UTC101

What Hacker News says

5 sources
>Your article only mentions nameless mathematicians, without really giving credit. I explicitly give credit to the papers the proof builds upon. Quoting from the article: >The proof was only possible thanks to the many existing results from [References](https://gaearon.github.io/conway-refinement/#/references). In particular, [A factorisation theory for generalised power series and omnific integers](https://doi.org/10.1016/j.aim.2024.109513) by S. L’Innocente and V. Mantova has played a crucial role in the proof. The project README (https://github.com/gaearon/conway-refinement) also states: >Over the years, Berarducci, Pitteloud, Pommersheim and Shahriari, and L'Innocente and Mantova developed increasingly strong results about exactly that. This proof builds on all of that work and claims to finish the refinement conjecture. It includes t
Read the rest
he same list of references: https://github.com/gaearon/conway-refinement#references Regarding who I've talked to over email, I wasn't sure I want to "out" them explicitly in the article due to the article's likely polarizing nature, but, since he already engaged in this thread, I can confirm that this person was Prof. Mantova (who is a co-author of the primary paper that the result I published rests upon, and who I did explicitly credit in the text of the article and in the references). You can read Prof. Mantova's own reflection here: https://news.ycombinator.com/item?id=49761718 I have not had an extended conversation with anyone else. >Following your analogy it is not a very fair game if it allows winning for those having access to latest exploits. Playing against skiddies who bought the hack kind of ruins it. You misunderstood the point of my analogy. The point was not that it is a game in which you "win" or "lose" and thus I have "won" or something like that. The point was that "obtaining a true proof without understanding it" doesn't imply "understanding has no value" any more than "completing a game in an unintended way" implies "playing has no value". You stated a false implication. That false implication is what I am highlighting with the analogy. Understanding has a societal value; doing something weird for the fun of it has value to the person doing it; sometimes people do things with no value at all, and that's okay too. Each individual act is not a statement about what kinds of things have value. Personally, I do not see mathematics as a game of "win" and "lose". If the broad value is primarily in understanding (which I think is correct), then my "contribution" doesn't make much dent in that. However, it might, as Prof. Mantova mentions, help show the way to an actually useful proof that improves collective understanding. That would please me beyond merely having had fun. In any case, I've enjoyed the experience of it in part due to the absurdity of it. Maybe it requires a certain kind of sense of humor. Regarding the models, as far as I know, all of the models I have used are currently broadly available. Yes, they require subscriptions so access is not democratized yet. There's nothing I can do about that. I think it's unreasonable to require that someone playing around with LLM's must use the inferior free models.
In I vibed a proof of Conway's conjecture
Author here. No one's asking mathematicians to check the generated proof. I explain it in this part: https://overreacted.io/how-i-vibed-a-proof-of-conways-conjec... The only thing that needs a check is this 500-line file: https://github.com/gaearon/conway-refinement/blob/264445c93b.... If this file is correct and Lean kernel is correct, the proof is correct. Moverover, the version I linked above is intentionally paranoid so it doesn't use any third-party code except Mathlib. If you allow usage of CombinatorialGames and trust its definitions, the part that needs to be checked narrows down to exactly 20 lines of code: https://github.com/gaearon/conway-refinement/blob/264445c93b...
In I vibed a proof of Conway's conjecture

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.