A heuristic for boundedness of ranks of elliptic curves · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1602.01431/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTA heuristic for boundedness of ranks of elliptic curves — mentioned by impendiahttps://news.ycombinator.com/item?id=49376352urn:hackerpapers:mention:1602.01431:49376352Thu, 20 Aug 2026 15:53:03 GMT<p>&gt; The record before this morning was 29 and people suspected that was as high as it got. Exactly this. A fundamental question in the subject is, whether elliptic curve ranks are bounded. Contrast with e.g. prime numbers, of which are known to be infinitely many. If you set a new record for the largest known prime, then that&#x27;s cool but everyone knew there were plenty out there to discover. This paper, by leading experts, https://arxiv.org/abs/1602.01431 made a significant impact in the field, coming up with a heuristic argument for why ranks of elliptic curves should be bounded. The same…</p><p><a href="https://hackerpaper.kaipfister.de/p/1602.01431/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.NT