<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: namin</title><link>https://news.ycombinator.com/user?id=namin</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 19 Nov 2026 21:51:45 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=namin" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[LemmaScript: A Verification Toolchain for TypeScript via Dafny]]></title><description><![CDATA[
<p>Article URL: <a href="https://midspiral.com/blog/lemmascript-a-verification-toolchain-for-typescript/">https://midspiral.com/blog/lemmascript-a-verification-toolchain-for-typescript/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47869988">https://news.ycombinator.com/item?id=47869988</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 22 Apr 2026 22:14:08 +0000</pubDate><link>https://midspiral.com/blog/lemmascript-a-verification-toolchain-for-typescript/</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=47869988</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47869988</guid></item><item><title><![CDATA[Show HN: LemmaScript, a verification toolchain for TypeScript via Dafny]]></title><description><![CDATA[
<p>I created LemmaScript to compile TypeScript to a verification backend (Dafny or Lean) and prove properties on the systematically derived model. I'll keep developing this, but I have a few case studies already, and it looks quite promising, with the caveat that each case study pushed the development of the core further. I can support both greenfield and brownfield projects, and in many cases, verification can be in-place: the TypeScript source is just annotated and verified independently but runs as is.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47849102">https://news.ycombinator.com/item?id=47849102</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 21 Apr 2026 14:12:03 +0000</pubDate><link>https://github.com/midspiral/LemmaScript</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=47849102</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47849102</guid></item><item><title><![CDATA[Show HN: Guardians – Verify tool-using agent workflows before execution]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/metareflection/guardians">https://github.com/metareflection/guardians</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47700126">https://news.ycombinator.com/item?id=47700126</a></p>
<p>Points: 8</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 09 Apr 2026 06:47:45 +0000</pubDate><link>https://github.com/metareflection/guardians</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=47700126</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47700126</guid></item><item><title><![CDATA[New comment by namin in "Show HN: Lemmafit: Make agents prove that their code is correct"]]></title><description><![CDATA[
<p>Thanks, we will provide case studies. Already today, lemmafit doesn't need familiarity with Dafny. It is used under the hood, so you just use Claude Code normally and lemmafit adds the verification harness. You don't need to interact with Dafny or the proofs at all.</p>
]]></description><pubDate>Sun, 08 Mar 2026 19:44:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=47300540</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=47300540</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47300540</guid></item><item><title><![CDATA[New comment by namin in "Show HN: Lemmafit: Make agents prove that their code is correct"]]></title><description><![CDATA[
<p>Since around Opus 4.5, systems like Claude Code are very good at Dafny proofs. They don’t get everything right in one shot but can iterate with verifier feedback. Some proofs take over 20 minutes to complete. The system knows to put temporary axioms to tackle proofs step by step.</p>
]]></description><pubDate>Sun, 08 Mar 2026 18:54:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=47299951</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=47299951</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47299951</guid></item><item><title><![CDATA[New comment by namin in "Show HN: Lemmafit: Make agents prove that their code is correct"]]></title><description><![CDATA[
<p>Hey HN! We've been experimenting with Dafny formal verification in web apps. We've been using AI to write verified state machines, proving undo/redo preserves invariants, verifying business logic, and creating apps with this logic. That work has lived in blog posts and research experiments so far. lemmafit is the first time we've packaged it into something you can npm install.<p>lemmafit is an npm package that gives AI coding agents (currently only Claude Code) a formal verification loop. Any effect-free logic gets written in Dafny, verified on every save, and auto-compiled to TypeScript. The agent then hooks the logic up to a React UI, and you get an app with state transitions and business logic with guarantees of correctness.<p>Happy to answer questions about the verification pipeline or the Dafny integration.</p>
]]></description><pubDate>Sun, 08 Mar 2026 18:16:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=47299586</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=47299586</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47299586</guid></item><item><title><![CDATA[Show HN: Lemmafit: Make agents prove that their code is correct]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/midspiral/lemmafit">https://github.com/midspiral/lemmafit</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47298874">https://news.ycombinator.com/item?id=47298874</a></p>
<p>Points: 7</p>
<p># Comments: 5</p>
]]></description><pubDate>Sun, 08 Mar 2026 17:00:38 +0000</pubDate><link>https://github.com/midspiral/lemmafit</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=47298874</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47298874</guid></item><item><title><![CDATA[New comment by namin in "A Very Small SAT Solver (From Haskell) Now in Dafny, Proved Correct with LLMs"]]></title><description><![CDATA[
<p>Ha. At least you can check the theorem statements and see that the proofs verify :)</p>
]]></description><pubDate>Fri, 06 Feb 2026 02:11:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=46908125</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=46908125</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46908125</guid></item><item><title><![CDATA[A Very Small SAT Solver (From Haskell) Now in Dafny, Proved Correct with LLMs]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/namin/dafny-sandbox/blob/master/Sat.dfy">https://github.com/namin/dafny-sandbox/blob/master/Sat.dfy</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46907643">https://news.ycombinator.com/item?id=46907643</a></p>
<p>Points: 4</p>
<p># Comments: 2</p>
]]></description><pubDate>Fri, 06 Feb 2026 00:57:10 +0000</pubDate><link>https://github.com/namin/dafny-sandbox/blob/master/Sat.dfy</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=46907643</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46907643</guid></item><item><title><![CDATA[Verifying State and Reconciliation in Collaborative Web Apps]]></title><description><![CDATA[
<p>Article URL: <a href="https://midspiral.com/blog/verifying-state-reconciliation-in-collaborative-web-apps/">https://midspiral.com/blog/verifying-state-reconciliation-in-collaborative-web-apps/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46617316">https://news.ycombinator.com/item?id=46617316</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 14 Jan 2026 15:41:36 +0000</pubDate><link>https://midspiral.com/blog/verifying-state-reconciliation-in-collaborative-web-apps/</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=46617316</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46617316</guid></item><item><title><![CDATA[Show HN: Henri: a small, hackable agent CLI]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/metareflection/henri">https://github.com/metareflection/henri</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46593389">https://news.ycombinator.com/item?id=46593389</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 12 Jan 2026 19:57:00 +0000</pubDate><link>https://github.com/metareflection/henri</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=46593389</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46593389</guid></item><item><title><![CDATA[Show HN: Holey: Staged execution from Python to SMT for synthesis]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/namin/holey">https://github.com/namin/holey</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46592879">https://news.ycombinator.com/item?id=46592879</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 12 Jan 2026 19:16:02 +0000</pubDate><link>https://github.com/namin/holey</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=46592879</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46592879</guid></item><item><title><![CDATA[Building a React App with Formally Verified State]]></title><description><![CDATA[
<p>Article URL: <a href="https://midspiral.com/blog/building-a-react-app-with-formally-verified-state/">https://midspiral.com/blog/building-a-react-app-with-formally-verified-state/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46433192">https://news.ycombinator.com/item?id=46433192</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 30 Dec 2025 13:35:43 +0000</pubDate><link>https://midspiral.com/blog/building-a-react-app-with-formally-verified-state/</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=46433192</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46433192</guid></item><item><title><![CDATA[From Intent to Proof: Dafny Verification for Web Apps]]></title><description><![CDATA[
<p>Article URL: <a href="https://midspiral.com/blog/from-intent-to-proof-dafny-verification-for-web-apps/">https://midspiral.com/blog/from-intent-to-proof-dafny-verification-for-web-apps/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46393177">https://news.ycombinator.com/item?id=46393177</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 26 Dec 2025 15:45:23 +0000</pubDate><link>https://midspiral.com/blog/from-intent-to-proof-dafny-verification-for-web-apps/</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=46393177</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46393177</guid></item><item><title><![CDATA[New comment by namin in "Ask HN: Who is hiring? (November 2025)"]]></title><description><![CDATA[
<p>Harvard SEAS | <a href="https://metareflection.seas.harvard.edu" rel="nofollow">https://metareflection.seas.harvard.edu</a> and <a href="https://namin.seas.harvard.edu" rel="nofollow">https://namin.seas.harvard.edu</a> | Postdoctoral Fellow | Greater Boston Area | ONSITE<p>I am looking for a postdoctoral fellow interested in the intersection of programming languages and artificial intelligence, in particular verification and large language models.<p>Our main goal is to create a PL+AI system that is the best at verified program synthesis. We will use the verification-aware programming language Dafny and co-evolve an LLM and a discovery system for Dafny.<p>Please contact me at namin@seas.harvard.edu if interested. Include a CV and GitHub link.</p>
]]></description><pubDate>Mon, 03 Nov 2025 16:40:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=45801028</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=45801028</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45801028</guid></item><item><title><![CDATA[Show HN: Tiny Hoare logic verifier using SMT]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/namin/metaprogramming/tree/master/lectures/5-smt">https://github.com/namin/metaprogramming/tree/master/lectures/5-smt</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44305599">https://news.ycombinator.com/item?id=44305599</a></p>
<p>Points: 12</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 18 Jun 2025 00:49:47 +0000</pubDate><link>https://github.com/namin/metaprogramming/tree/master/lectures/5-smt</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=44305599</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44305599</guid></item><item><title><![CDATA[Show HN: Live software archaeology of FOL (theory of reasoning)]]></title><description><![CDATA[
<p>I want to share this live playground for FOL, an old system from the late 70s. It has many precursor ideas about reasoning at the meta-level, including the now common proof by reflection which turns proving in the object theory into evaluation in the meta theory, and is common in Rocq, Lean, and other proof assistants.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44214219">https://news.ycombinator.com/item?id=44214219</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sun, 08 Jun 2025 02:52:56 +0000</pubDate><link>https://io.livecode.ch/learn/namin/GETFOL</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=44214219</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44214219</guid></item><item><title><![CDATA[Work with Apps on macOS]]></title><description><![CDATA[
<p>Article URL: <a href="https://help.openai.com/en/articles/10119604-work-with-apps-on-macos">https://help.openai.com/en/articles/10119604-work-with-apps-on-macos</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42146176">https://news.ycombinator.com/item?id=42146176</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 15 Nov 2024 12:09:40 +0000</pubDate><link>https://help.openai.com/en/articles/10119604-work-with-apps-on-macos</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=42146176</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42146176</guid></item><item><title><![CDATA[A Scalable Communication Protocol for Networks of Large Language Models]]></title><description><![CDATA[
<p>Article URL: <a href="https://agoraprotocol.org/">https://agoraprotocol.org/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42073923">https://news.ycombinator.com/item?id=42073923</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 07 Nov 2024 06:14:58 +0000</pubDate><link>https://agoraprotocol.org/</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=42073923</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42073923</guid></item><item><title><![CDATA[New comment by namin in "Ask HN: Who is hiring? (July 2024)"]]></title><description><![CDATA[
<p>Harvard SEAS, ONSITE (Boston area, MA, US)<p>I have one opening in a new project around AI for precision medicine.
One thrust is about combining biomedical knowledge graphs and large language models into a biomedical-fluent core platform.
Another thrust is about UI for data-rich programmable systems.
The opening is for either a research engineer or a postdoc, with different criteria in each case.
The research engineer would be responsible for quarterly demo-driven deliverables.
The postdoc would be expected to develop a research agenda with these applications in mind.<p>Contact: namin@seas.harvard.edu</p>
]]></description><pubDate>Tue, 02 Jul 2024 03:01:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=40853192</link><dc:creator>namin</dc:creator><comments>https://news.ycombinator.com/item?id=40853192</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40853192</guid></item></channel></rss>