<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>VerMCTS: Synthesizing Multi-Step Programs using a Verifier, a Large Language Model, and Tree Search · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.08147/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2402.08147/feed.xml" rel="self" type="application/rss+xml" /><item><title>VerMCTS: Synthesizing Multi-Step Programs using a Verifier, a Large Language Model, and Tree Search — HN submission</title><link>https://news.ycombinator.com/item?id=39475580</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.08147:39475580</guid><pubDate>Fri, 23 Feb 2024 01:04:56 GMT</pubDate><description>&lt;p&gt;Show HN: Verified Multi-Step Synthesis Using LLMs and MCTS&lt;/p&gt;&lt;p&gt;3 months ago, I submitted a hack on using Monte Carlo Tree Search (MCTS) with an LLM guided by a program verifier: https://news.ycombinator.com/item?id=38235407 I just wanted to send this update, because we now have a paper that explains the hack in detail. We also show the use of verifiers with ChatGPT (implemented as actions within GPTs), and our method makes open models like Phind Code Llama competitive with ChatGPT augmented with verifier feedback and step by step instructions. Happy to answer any questions!&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.08147/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item></channel></rss>
