<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: frunkp</title><link>https://news.ycombinator.com/user?id=frunkp</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 10 Sep 2026 15:02:20 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=frunkp" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by frunkp in "GPT-6 Astra, looped transformers, and hidden reasoning"]]></title><description><![CDATA[
<p>When I saw "hidden reasoning", it reminded me of diffusion models: generating a block spans many steps (with remasking), which hide the reasoning that led to the block.<p>I had not heard of looped transformers, but the engineering behind the number of loops per token / halting feels like trying to apply a diffusion process to a transformer while keeping the auto-regressive feature.</p>
]]></description><pubDate>Wed, 09 Sep 2026 19:46:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=49633051</link><dc:creator>frunkp</dc:creator><comments>https://news.ycombinator.com/item?id=49633051</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49633051</guid></item><item><title><![CDATA[New comment by frunkp in "1D Chess"]]></title><description><![CDATA[
<p>Those who play go may enjoy the variants: <a href="https://www.govariants.com/variants/rules-list" rel="nofollow">https://www.govariants.com/variants/rules-list</a>
Tetris is a fun one to try!</p>
]]></description><pubDate>Fri, 10 Apr 2026 20:10:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=47723056</link><dc:creator>frunkp</dc:creator><comments>https://news.ycombinator.com/item?id=47723056</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47723056</guid></item><item><title><![CDATA[Anna's Archive perd son domaine en .org mais reste debout]]></title><description><![CDATA[
<p>Article URL: <a href="https://korben.info/annas-archive-domaine-org-suspendu.html">https://korben.info/annas-archive-domaine-org-suspendu.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46716232">https://news.ycombinator.com/item?id=46716232</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Thu, 22 Jan 2026 07:22:07 +0000</pubDate><link>https://korben.info/annas-archive-domaine-org-suspendu.html</link><dc:creator>frunkp</dc:creator><comments>https://news.ycombinator.com/item?id=46716232</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46716232</guid></item><item><title><![CDATA[NN Interpretability]]></title><description><![CDATA[
<p>Article URL: <a href="https://openai.com/index/understanding-neural-networks-through-sparse-circuits/">https://openai.com/index/understanding-neural-networks-through-sparse-circuits/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45925606">https://news.ycombinator.com/item?id=45925606</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 14 Nov 2025 10:23:11 +0000</pubDate><link>https://openai.com/index/understanding-neural-networks-through-sparse-circuits/</link><dc:creator>frunkp</dc:creator><comments>https://news.ycombinator.com/item?id=45925606</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45925606</guid></item><item><title><![CDATA[New comment by frunkp in "Kimina-Prover: Applying Test-time RL Search on Large Formal Reasoning Models"]]></title><description><![CDATA[
<p>The model does well on highschool competition maths. Problems in the "Set Theory" and "Natural Numbers" chapters of Elements of Abstract Algebra may be doable with Kimina-Prover, nothing beyond because it doesn't know Sylow theorem etc. and hasn't used these objects with Lean 4 in practice.<p>You can start with a natural language description of the theorem: demo.projectnumina.ai and an autoformalizer will generate the formal statement. 
It's an additional click of a button to have it attempt to prove it.<p>For natural language interpretation of Lean proofs, the current LLMs (o4-mini-high, Claude 4, Gemini 2.5 Pro) do a decent job of walking you through.</p>
]]></description><pubDate>Thu, 10 Jul 2025 14:22:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=44521435</link><dc:creator>frunkp</dc:creator><comments>https://news.ycombinator.com/item?id=44521435</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44521435</guid></item><item><title><![CDATA[Kimina-Prover: Applying Test-time RL Search on Large Formal Reasoning Models]]></title><description><![CDATA[
<p>Article URL: <a href="https://huggingface.co/blog/AI-MO/kimina-prover">https://huggingface.co/blog/AI-MO/kimina-prover</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44520720">https://news.ycombinator.com/item?id=44520720</a></p>
<p>Points: 3</p>
<p># Comments: 2</p>
]]></description><pubDate>Thu, 10 Jul 2025 13:21:14 +0000</pubDate><link>https://huggingface.co/blog/AI-MO/kimina-prover</link><dc:creator>frunkp</dc:creator><comments>https://news.ycombinator.com/item?id=44520720</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44520720</guid></item></channel></rss>