<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: zmccormick7</title><link>https://news.ycombinator.com/user?id=zmccormick7</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 14 Apr 2026 20:06:56 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=zmccormick7" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Context is the bottleneck for coding agents now]]></title><description><![CDATA[
<p>Article URL: <a href="https://runnercode.com/blog/context-is-the-bottleneck-for-coding-agents-now">https://runnercode.com/blog/context-is-the-bottleneck-for-coding-agents-now</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45387374">https://news.ycombinator.com/item?id=45387374</a></p>
<p>Points: 196</p>
<p># Comments: 187</p>
]]></description><pubDate>Fri, 26 Sep 2025 15:06:42 +0000</pubDate><link>https://runnercode.com/blog/context-is-the-bottleneck-for-coding-agents-now</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=45387374</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45387374</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: Runner – the anti-vibe coding agent"]]></title><description><![CDATA[
<p>Good to know. I've heard great things about Context7, but haven't experimented with it yet.</p>
]]></description><pubDate>Fri, 12 Sep 2025 14:10:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=45222344</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=45222344</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45222344</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: Runner – the anti-vibe coding agent"]]></title><description><![CDATA[
<p>As in the download itself didn't happen when you clicked the download button, or the installation failed?</p>
]]></description><pubDate>Fri, 12 Sep 2025 14:09:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=45222332</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=45222332</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45222332</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: Runner – the anti-vibe coding agent"]]></title><description><![CDATA[
<p>Cool, I hadn't heard of Traycer. That does look quite similar!<p>Completely agree. I basically built Runner to codify the process I was already using manually with Claude Code and Gemini. A lot of developers seem to be settling on a similar workflow, so I'm betting that something like Runner or Traycer will be useful for a lot of devs.<p>I'll be curious to see how far the existing players like Cursor push in this direction.</p>
]]></description><pubDate>Fri, 12 Sep 2025 14:08:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=45222324</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=45222324</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45222324</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: Runner – the anti-vibe coding agent"]]></title><description><![CDATA[
<p>I agree that's a major problem. It's not something I've solved yet. I suspect a web research sub-agent is likely what's needed, so it can pull in up-to-date docs for whatever library you need to work with.</p>
]]></description><pubDate>Thu, 11 Sep 2025 22:26:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=45216741</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=45216741</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45216741</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: Runner – the anti-vibe coding agent"]]></title><description><![CDATA[
<p>Gemini is required for the context management sub-agent. You can use any of OpenAI, Anthropic, or Gemini for the main planning and coding agents, but GPT-5 performs the best in my experience. Claude 4 Sonnet works well too, but it's about twice as expensive.</p>
]]></description><pubDate>Thu, 11 Sep 2025 22:22:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=45216718</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=45216718</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45216718</guid></item><item><title><![CDATA[Show HN: Runner – the anti-vibe coding agent]]></title><description><![CDATA[
<p>Now that AI is capable of writing large volumes of production-quality code, our role as developers is changing. Our primary job is no longer writing code. It’s planning and communicating software design and architecture. We have to do this collaboratively with agents and then review and iterate on their implementations.<p>IDEs were not built for this workflow. So about three months ago I decided to try to build what I thought this new interface should look like.<p>Runner is a coding agent purpose-built for this new “plan and review” workflow. It’s not for vibe coding. It’s for professional software developers who are responsible for the code they ship.<p>It encourages and supports a more structured and controlled workflow than other coding agents. It’s built around the concept of tasks. A task is a small, clearly scoped change. The planning agent creates and edits task specs, and then you can assign them to coding agents once you’re happy with the plan. When the coding agent finishes, you can review the changes via the built-in diff viewer. If you’re happy with them you can approve the changes, which will trigger a git commit.<p>Runner is available as a free BYOK beta for MacOS right now. You can learn more and download it here: <a href="https://runnercode.com/" rel="nofollow">https://runnercode.com/</a>. You will need at least a Gemini API key, and for best performance also an OpenAI API key.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45214955">https://news.ycombinator.com/item?id=45214955</a></p>
<p>Points: 22</p>
<p># Comments: 10</p>
]]></description><pubDate>Thu, 11 Sep 2025 18:59:40 +0000</pubDate><link>https://runnercode.com/</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=45214955</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45214955</guid></item><item><title><![CDATA[Bootstrapping a Coding Agent]]></title><description><![CDATA[
<p>Article URL: <a href="https://runnercode.com/blog/bootstrapping-a-coding-agent">https://runnercode.com/blog/bootstrapping-a-coding-agent</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45032676">https://news.ycombinator.com/item?id=45032676</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 26 Aug 2025 21:42:47 +0000</pubDate><link>https://runnercode.com/blog/bootstrapping-a-coding-agent</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=45032676</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45032676</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: MinDB – an extremely memory-efficient vector database"]]></title><description><![CDATA[
<p>The main thing we need to add is metadata filtering, as that's required for a lot of use cases. We're also thinking about adding hybrid search support and multi-factor ranking.</p>
]]></description><pubDate>Mon, 23 Sep 2024 01:02:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=41621461</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=41621461</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41621461</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: MinDB – an extremely memory-efficient vector database"]]></title><description><![CDATA[
<p>We've only done full benchmarking with the FIQA dataset, comparing minDB with Chroma. We're going to try it with Qdrant and Weaviate soon too, since they both have support for quantization, which will be a more apples-to-apples comparison with our approach.<p>We did test uploading and querying a Wikipedia dump, which was ~35M vectors. Query latency was around 150ms and peak memory usage was 1.5GB. We couldn't test recall, though, because we didn't have queries with ground truths.</p>
]]></description><pubDate>Fri, 20 Sep 2024 21:01:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=41605480</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=41605480</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41605480</guid></item><item><title><![CDATA[Show HN: MinDB – an extremely memory-efficient vector database]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/D-Star-AI/minDB">https://github.com/D-Star-AI/minDB</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=41599605">https://news.ycombinator.com/item?id=41599605</a></p>
<p>Points: 17</p>
<p># Comments: 5</p>
]]></description><pubDate>Fri, 20 Sep 2024 07:15:19 +0000</pubDate><link>https://github.com/D-Star-AI/minDB</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=41599605</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41599605</guid></item><item><title><![CDATA[Show HN: Retrieval engine with SOTA performance on challenging RAG benchmarks]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/D-Star-AI/dsRAG">https://github.com/D-Star-AI/dsRAG</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=41322022">https://news.ycombinator.com/item?id=41322022</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 22 Aug 2024 16:39:34 +0000</pubDate><link>https://github.com/D-Star-AI/dsRAG</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=41322022</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41322022</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Solving the out-of-context chunk problem for RAG"]]></title><description><![CDATA[
<p>Agreed that thresholds don't work when applied to the cosine similarity of embeddings. But I have found that the similarity score returned by high-quality rerankers, especially Cohere, are consistent and meaningful enough that using a threshold works well there.</p>
]]></description><pubDate>Thu, 25 Jul 2024 15:08:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=41069576</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=41069576</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41069576</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Solving the out-of-context chunk problem for RAG"]]></title><description><![CDATA[
<p>Agreed. Retrieval performance is very dependent on the quality of the search queries. Letting the LLM generate the search queries is much more reliable than just embedding the user input. Also, no retrieval system is going to return everything needed on the first try, so using a multi-step agent approach to retrieving information is the only way I've found to get extremely high accuracy.</p>
]]></description><pubDate>Wed, 24 Jul 2024 16:13:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=41058553</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=41058553</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41058553</guid></item><item><title><![CDATA[Solving the out-of-context chunk problem for RAG]]></title><description><![CDATA[
<p>Article URL: <a href="https://d-star.ai/solving-the-out-of-context-chunk-problem-for-rag">https://d-star.ai/solving-the-out-of-context-chunk-problem-for-rag</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=41034297">https://news.ycombinator.com/item?id=41034297</a></p>
<p>Points: 260</p>
<p># Comments: 89</p>
]]></description><pubDate>Mon, 22 Jul 2024 13:44:19 +0000</pubDate><link>https://d-star.ai/solving-the-out-of-context-chunk-problem-for-rag</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=41034297</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41034297</guid></item><item><title><![CDATA[Embeddings are not all you need]]></title><description><![CDATA[
<p>Article URL: <a href="https://d-star.ai/embeddings-are-not-all-you-need">https://d-star.ai/embeddings-are-not-all-you-need</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=40868547">https://news.ycombinator.com/item?id=40868547</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 03 Jul 2024 18:09:41 +0000</pubDate><link>https://d-star.ai/embeddings-are-not-all-you-need</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=40868547</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40868547</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: I made a search engine for Hacker News"]]></title><description><![CDATA[
<p>I had the same issue when searching for specific companies/products. It feels like a pretty basic vector search with no hybrid search component or reranking.</p>
]]></description><pubDate>Wed, 03 Jul 2024 16:29:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=40867532</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=40867532</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40867532</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: SpRAG – Open-source RAG implementation for challenging real-world tasks"]]></title><description><![CDATA[
<p>That should work well with the default parameters, so you shouldn't have to do anything special.</p>
]]></description><pubDate>Sun, 05 May 2024 18:06:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=40266858</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=40266858</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40266858</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: SpRAG – Open-source RAG implementation for challenging real-world tasks"]]></title><description><![CDATA[
<p>That description is a little vague, so I need to improve that. The use cases we're focused on are ones with 1) dense unstructured text, like legal documents, financial reports, and academic papers; and 2) challenging queries that go beyond simple factoid question answering. Those kinds of use cases are where we see existing RAG systems struggle the most.</p>
]]></description><pubDate>Fri, 03 May 2024 17:53:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=40250369</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=40250369</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40250369</guid></item><item><title><![CDATA[New comment by zmccormick7 in "Show HN: SpRAG – Open-source RAG implementation for challenging real-world tasks"]]></title><description><![CDATA[
<p>I think the difference is that they're building for end users, not developers.</p>
]]></description><pubDate>Fri, 03 May 2024 17:48:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=40250319</link><dc:creator>zmccormick7</dc:creator><comments>https://news.ycombinator.com/item?id=40250319</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40250319</guid></item></channel></rss>