<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2404.12534/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2404.12534/feed.xml" rel="self" type="application/rss+xml" /><item><title>Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean — mentioned by ogogmad</title><link>https://news.ycombinator.com/item?id=44071515</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.12534:44071515</guid><pubDate>Fri, 23 May 2025 10:17:51 GMT</pubDate><description>&lt;p&gt;The article also suggests that you could use a proof-verifier like Lean instead. Using that capability to generate synthetic data on which to train helps too. Very large context windows have been known to help with programming, and should help with mathematical reasoning too. None of this gives you AGI, I suppose, but the important thing is it makes LLMs more reliable at mathematics. Anyone have a link to an article exploring Lean plus MCP? EDIT: Here&amp;#x27;s a recent Arxiv paper: https://arxiv.org/abs/2404.12534v2, the keyword is &amp;quot;neural theorem proving&amp;quot; I&amp;#x27;ve just remembered: AlphaEvolve showed…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.12534/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean — HN submission</title><link>https://news.ycombinator.com/item?id=41517885</link><guid isPermaLink="false">urn:hackerpapers:submission:2404.12534:41517885</guid><pubDate>Thu, 12 Sep 2024 05:34:47 GMT</pubDate><description>&lt;p&gt;Towards Large Language Models as Copilots for Theorem Proving in Lean&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2404.12534/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
