<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: lukeundtrug</title><link>https://news.ycombinator.com/user?id=lukeundtrug</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 30 Apr 2026 10:44:50 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=lukeundtrug" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by lukeundtrug in "Show HN: OSS Agent I built topped the TerminalBench on Gemini-3-flash-preview"]]></title><description><![CDATA[
<p>That sounds great, thanks for sharing your thoughts!<p>It sure sounds like we have similar things in mind. I basically try to build the proper graph representation of the code during runtime, so all caller/callee relationships plus type inheritance chains etc. 
This is basically what I call a semantic code graph in the blog post.<p>From the things I tried with tree-sitter I think I would have a hard time achieving the same because by nature tree-sitter can only make educated guesses on real connections and will run into problems, if things are named ambiguously.<p>But yeah, will definitely reach out and am looking forward to chatting :) Hope I find the time during this week!</p>
]]></description><pubDate>Tue, 28 Apr 2026 17:54:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=47937995</link><dc:creator>lukeundtrug</dc:creator><comments>https://news.ycombinator.com/item?id=47937995</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47937995</guid></item><item><title><![CDATA[New comment by lukeundtrug in "Show HN: OSS Agent I built topped the TerminalBench on Gemini-3-flash-preview"]]></title><description><![CDATA[
<p>I definitely share the same sentiment. I don’t want to overload the llm with many tools. Better to have a few opinionated and flexible ones, but yeah, keeping the balance is hard.<p>I would say the main two tools are get-symbol-context and get-repository-overview. The latter is actually the more complex and sophisticated one. I’m running some graph algorithms to rank the symbols in terms of relative importance based on centrality metrics, I.e. how well connected they are in the symbol graph.<p>The idea behind that is to allow the llm to infer the general structure and architecture of the project with just one tool call.<p>I guess you could reach a similar thing if you had some good Agents.md or docs detailing that for your project, but this was more meant to reach that on the fly.<p>The symbol-context tool is basically a graph query tool (without a dsl or cipher support yet), but yeah here the question is also whether it makes more sense to give the ai the possibility to run cipher queries itself or abstract it away in a thinner api.<p>The main underlying factor of my tool is however the graph that I’m building and the metadata which can be extracted from that (connections, type of connection, etc. ) :)<p>Whats the metadata you have in mind?</p>
]]></description><pubDate>Tue, 28 Apr 2026 08:24:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=47931803</link><dc:creator>lukeundtrug</dc:creator><comments>https://news.ycombinator.com/item?id=47931803</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47931803</guid></item><item><title><![CDATA[New comment by lukeundtrug in "Show HN: OSS Agent I built topped the TerminalBench on Gemini-3-flash-preview"]]></title><description><![CDATA[
<p>Happened to have written both a tool and a blog post about the topic. It’s more about the different technical approaches you have in solving the problem but it might still interest you :)<p><a href="https://www.context-master.dev/blog/deterministic-semantic-code-graphs" rel="nofollow">https://www.context-master.dev/blog/deterministic-semantic-c...</a><p>Let me know, what you think</p>
]]></description><pubDate>Mon, 27 Apr 2026 19:43:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=47926361</link><dc:creator>lukeundtrug</dc:creator><comments>https://news.ycombinator.com/item?id=47926361</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47926361</guid></item><item><title><![CDATA[New comment by lukeundtrug in "1M context is now generally available for Opus 4.6 and Sonnet 4.6"]]></title><description><![CDATA[
<p>Thanks for taking the time to check it out and for the kind words! I really appreciate it.<p>I totally get sticking with your current approach. Your workflow sounds very intriguing as well. A combination of both approaches might really be very interesting :) Adding an LLM interpretation layer on top of my graph is also something I'm actively considering.<p>Thanks for the great discussion, and best of luck with your tool and workflow!</p>
]]></description><pubDate>Mon, 16 Mar 2026 21:38:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=47405289</link><dc:creator>lukeundtrug</dc:creator><comments>https://news.ycombinator.com/item?id=47405289</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47405289</guid></item><item><title><![CDATA[New comment by lukeundtrug in "1M context is now generally available for Opus 4.6 and Sonnet 4.6"]]></title><description><![CDATA[
<p>I built myself an AST based solution for that during the last 6 months roughly. I always wondered whether grep and agent-based discovery will be the end of it and thought it just has to be better with a more deterministic approach.<p>In the end it's hard to measure but personally I feel that my agent rarely misses any context for a given task, so I'm pretty happy with it.<p>I used a different approach than tree-sitter because I thought I found a nice way to get around having to write language-specific code. I basically use VSCode as a language backend and wrote some logic to basically rebuild the AST tree from VSCode's symbol data and other API.<p>That allows me to just install the correct language extension and thus enable support for that specific language. The extension has to provide symbol information which most do through LSP.<p>In the end it was way more effort than just using tree-sitter, however, and I'm thinking of doing a slow migration to that approach sooner or later.<p>Anyways, I created an extension that spins up an mcp server and provides several tools that basically replace the vanilla discovery tools in my workflow.<p>The approach is similar to yours, I have an overview tool which runs different centrality ranking metrics over the whole codebase to get the most important symbols and presents that as an architectural overview to the LLM.<p>Then I have a "get-symbol-context" tool which allows the AI to get all the information that the AST holds about a single symbol, including a parameter to include source code which completely replaces grepping and file reading for me.<p>The tool also specifies which other symbols call the one in question and which others it calls, respectively.<p>But yeah, sorry for this being already a quite long comment, if you want to give it a try, I published it on the VSCode marketplace a couple of days ago, and it's basically free right now, although I have to admit that I still want to try to earn a little bit of money with it at some point.<p>Right now, the daily usage limit is 2000 tool calls per day, which should be enough for anybody.<p>Would love to hear what you think :)<p><<a href="https://marketplace.visualstudio.com/items?itemName=LuGoSoft.context-master-vscode" rel="nofollow">https://marketplace.visualstudio.com/items?itemName=LuGoSoft...</a>></p>
]]></description><pubDate>Sat, 14 Mar 2026 19:52:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=47380471</link><dc:creator>lukeundtrug</dc:creator><comments>https://news.ycombinator.com/item?id=47380471</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47380471</guid></item></channel></rss>