<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: Sai_Praneeth</title><link>https://news.ycombinator.com/user?id=Sai_Praneeth</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 13 Jul 2026 07:26:25 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=Sai_Praneeth" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Show HN: Lazarus, a coding agent for long-horizon tasks]]></title><description><![CDATA[
<p>I have been interested in long-horizon coding tasks for a while, especially with benchmarks like FrontierSWE, where even the best coding agents like Codex and Claude Code struggle to complete tasks.<p>These agents come with a collection of tools like bash, file edits, grep, glob, etc.<p>Lazarus takes a different approach. The idea is to give the model exactly one tool: a persistent Python runtime.<p>Model writes Python code, executes it, and receives stdout/stderr. Through Python it inspects repos, reads and edits files, runs builds, executes tests, invokes linters, even build custom harnesses and automate whatever workflows it needs.<p>The motivation for this was:
- Tool selection itself is a planning problem.<p>- Specialized tools are often difficult to compose together efficiently.<p>- Long-horizon tasks frequently require custom workflows that predefined tools don't provide.<p>- Python is expressive enough for the model to build those workflows itself.<p>Another decision is avoid agent hierarchies. Lazarus runs a single tool-calling loop rather than managers, planners, and worker agents.<p>The intuition being current models are much better at writing code than coordinating fleets of agents. Agent orchestration consumes context, introduces extra modes of failure, and adds complexity.<p>How does Lazarus manage context? When the "usable" context window of a model is nearly exhausted, the model gets one final opportunity to execute a Python tool call, containing anything it wants to preserve: notes, plans, functions, summaries, partial results, etc.<p>The loop is then restarted with only:<p>- The original user task<p>- The carryover cell<p>- The carryover cell's output<p>This allows the agent to periodically compress its own state and continue working without requiring an ever-growing context window.<p>I evaluated Lazarus on two FrontierSWE tasks:
- git-to-zig (rewriting git in zig)
- dart-style-haskell (rewriting dart-style formatter in haskell)<p>The runs with scores are available here: <a href="https://github.com/ExpressGradient/frontier-swe-lazarus-runs" rel="nofollow">https://github.com/ExpressGradient/frontier-swe-lazarus-runs</a><p>Using GPT-5.5 at medium reasoning effort, Lazarus achieved scores comparable to reported GPT-5.5 in Codex with xhigh reasoning.<p>The runs were not completed to exhaustion, I stopped them because I ran out of OpenAI credits. So I suspect there is still room for improvement from longer runtimes and higher reasoning.<p>The project is still early, but the results made me wonder whether coding agents have become over-specialized around tool collections and orchestration systems, while under-investing in giving models a programmable environment they can shape themselves.<p>Lazarus: <a href="https://github.com/ExpressGradient/lazarus" rel="nofollow">https://github.com/ExpressGradient/lazarus</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48416473">https://news.ycombinator.com/item?id=48416473</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 05 Jun 2026 18:37:18 +0000</pubDate><link>https://github.com/ExpressGradient/lazarus</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=48416473</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48416473</guid></item><item><title><![CDATA[New comment by Sai_Praneeth in "Ask HN: Share your personal website"]]></title><description><![CDATA[
<p><a href="https://saipraneeth.in" rel="nofollow">https://saipraneeth.in</a></p>
]]></description><pubDate>Thu, 15 Jan 2026 09:43:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=46630301</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=46630301</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46630301</guid></item><item><title><![CDATA[Show HN: Laser, a minimal coding agent whose only tool is the terminal]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/ExpressGradient/laser">https://github.com/ExpressGradient/laser</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46576440">https://news.ycombinator.com/item?id=46576440</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sun, 11 Jan 2026 15:17:32 +0000</pubDate><link>https://github.com/ExpressGradient/laser</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=46576440</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46576440</guid></item><item><title><![CDATA[Show HN: modal-cuda – CLI to run CUDA .cu programs on Modal GPUs]]></title><description><![CDATA[
<p>I use a MacBook (no NVIDIA GPU) but still like experimenting with CUDA kernels.<p>I didn’t want to spin up a VM every time or use browser-only tools, so I built a tiny CLI that runs local .cu files on Modal GPUs with a single command.<p>Modal gives around $30 in free credits when you sign up, so the CLI is built around that. You can run simple kernels on smaller GPUs (like T4) for very little. I ran multiple tests for under $1.<p>What it does:
- Sends your .cu file to a Modal container with a GPU image (you can override it)
- Compiles it with nvcc (supports nvcc args)
- Runs it on any GPU you choose (T4 through B200)
- Streams output/error back to your terminal<p>Usage:
    uv add modal-cuda<p><pre><code>    mcc myKernel.cu --gpu H100

    # or:
    uvx --from modal-cuda mcc myKernel --nvcc-arg=-Xptas --nvcc-arg=-v
</code></pre>
Links:
GitHub: <a href="https://github.com/ExpressGradient/modal-cuda" rel="nofollow">https://github.com/ExpressGradient/modal-cuda</a>
PyPI: <a href="https://pypi.org/project/modal-cuda" rel="nofollow">https://pypi.org/project/modal-cuda</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45910713">https://news.ycombinator.com/item?id=45910713</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 13 Nov 2025 04:41:36 +0000</pubDate><link>https://github.com/ExpressGradient/modal-cuda</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=45910713</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45910713</guid></item><item><title><![CDATA[Show HN: Elliot – my coding agent that helps me code, and sometimes helps itself]]></title><description><![CDATA[
<p>Built a coding agent that's actually useful for working with existing codebases - the kind where you need to understand structure, not just append code.<p>Key capabilities:<p>- Structural code search via ast-grep: Searches by AST patterns, not text. Finds all implementations of an interface, all callers of a function, etc. Treats code as structure.<p>- Planning before execution: Writes a plan, ticks off tasks, tracks dependencies. Keeps the agent coherent across multi-file changes instead of thrashing.<p>- Specialized sub-agents: One searches code, one edits, one handles git, one runs tests. Division of labor instead of one confused god-agent.<p>- Human-in-the-loop that adapts: Confirms before writes, but if denied, tries different approach.<p>Useful for: surfing large repos, implementing features that touch multiple files, fixing bugs where you need to understand call chains.<p>I used it to add tools, refactor architecture, improve workflows. If it can navigate its own codebase and improve itself, maybe it can handle yours. Check commits prefixed "made by elliot:" for proof.
Python 3.12+, runs locally, built on openai-agents-python.<p>GitHub: <a href="https://github.com/think-a-tron/elliot" rel="nofollow">https://github.com/think-a-tron/elliot</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45634471">https://news.ycombinator.com/item?id=45634471</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Sun, 19 Oct 2025 14:39:02 +0000</pubDate><link>https://github.com/Think-a-Tron/elliot</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=45634471</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45634471</guid></item><item><title><![CDATA[Building a better LLM augmented Search Engine (Blog)]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.saipraneeth.in/ml/atreya">https://www.saipraneeth.in/ml/atreya</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45265999">https://news.ycombinator.com/item?id=45265999</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 16 Sep 2025 18:30:47 +0000</pubDate><link>https://www.saipraneeth.in/ml/atreya</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=45265999</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45265999</guid></item><item><title><![CDATA[New comment by Sai_Praneeth in "Ask HN: Anyone struggling to get value out of coding LLMs?"]]></title><description><![CDATA[
<p>i haven't used cursor or codex or any system that says "agentic coding experience"<p>i speak in thoughts in my head and it is better to just translate those thoughts to code directly.<p>putting them into a language for LLMs to make sense and understanding the output is oof... too much overhead. and yeah the micromanagement, correcting mistakes, miscommunications, its shit<p>i just code like the old days and if i need any assistance, i use chatgpt</p>
]]></description><pubDate>Mon, 26 May 2025 12:20:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=44096738</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=44096738</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44096738</guid></item><item><title><![CDATA[New comment by Sai_Praneeth in "Show HN: Evolving Text Compression Algorithms by Mutating Code with LLMs"]]></title><description><![CDATA[
<p>I built this as a weekend experiment to see how far you can push a basic LZ-style compressor using LLM-guided code mutations. No fancy ML models here—just a simple loop: mutate, evaluate, keep what works.<p>The LLM (GPT-4.1) suggests small code changes to improve compression ratio. Mutations are applied and tested on a real input file (big.txt). If the round-trip decompress fails, it's discarded. Everything is logged in a local SQLite DB.<p>Selection is dumb but effective: top 3 elites + 2 random survivors per generation. Each spawns 4 children. Repeat for N generations or until stagnation.
At around 30 generations, I hit a compression ratio of 1.85×. Still decent, considering the starting baseline.<p>It's not a framework, it's not Pareto, and there's no multi-objective fluff. Just a tiny search loop hacking away at code. Curious if others have tried something similar with code-evolving setups.</p>
]]></description><pubDate>Sun, 25 May 2025 14:02:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=44087914</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=44087914</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44087914</guid></item><item><title><![CDATA[Show HN: Evolving Text Compression Algorithms by Mutating Code with LLMs]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/Think-a-Tron/minevolve/blob/main/main.py">https://github.com/Think-a-Tron/minevolve/blob/main/main.py</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44087887">https://news.ycombinator.com/item?id=44087887</a></p>
<p>Points: 2</p>
<p># Comments: 1</p>
]]></description><pubDate>Sun, 25 May 2025 13:57:48 +0000</pubDate><link>https://github.com/Think-a-Tron/minevolve/blob/main/main.py</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=44087887</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44087887</guid></item><item><title><![CDATA[Show HN: Zeno – A framework for verifiable RL rewards (code, math, and more)]]></title><description><![CDATA[
<p>With TRL, it's now straightforward to RL-finetune LLMs, but picking good reward functions is still the weakest link.<p>Zeno is an open-source toolkit for verifiable, deterministic reward functions for RL on LLMs.<p>While the initial release focuses on Python code generation, the goal is broader: make RL reward design for LLMs transparent, modular, and extendable across domains (math, retrieval, reasoning, tool-use, etc.)<p>What's in Zeno for now?
- Auditable, stateless reward functions for Python code - docstrings, ruff linting, type hints, recursion, and more
- Works directly with Huggingface's TRL or any RL loop - plug reward functions in as needed.
- MIT licensed and minimal.<p>Roadmap:
Python code is just the starting point. Extensions for math problem solving, planning and agentic behaviors are in todo.<p>Repo: <a href="https://github.com/think-a-tron/zeno">https://github.com/think-a-tron/zeno</a><p>Docs and more details in the README<p>Comments, critiques, and real-world use cases encouraged, especially if you want to push beyond code.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44041043">https://news.ycombinator.com/item?id=44041043</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 20 May 2025 12:56:48 +0000</pubDate><link>https://github.com/Think-a-Tron/zeno</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=44041043</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44041043</guid></item><item><title><![CDATA[Show HN: Open-Source AlphaEvolve Clone Using GPT-4.1 and Genetic Programming]]></title><description><![CDATA[
<p>Everyone saw the AlphaEvolve hype. I got obsessed with how it might work under the hood and decided to just build it myself.<p>My setup uses GPT-4.1 to mutate matrix multiplication code, guided by a bunch of hand-crafted mutation strategies (loop reordering, tiling, Strassen, etc.). Each candidate is evaluated on both speed and accuracy. Then I apply Pareto selection with crowding distance to evolve better ones over generations.<p>I ran into all the usual LLM reward hacks-returning the input, calling np.dot, etc. So I forced primitive-only implementations and tightly constrained the mutation space.<p>After some struggle (and OpenAI credits vanishing), I ended up with a system that can actually evolve fast, correct implementations starting from a naive baseline.<p>Full story here (with all the failures and design hacks):
<a href="https://saipraneeth.in/ml/building-evolve" rel="nofollow">https://saipraneeth.in/ml/building-evolve</a><p>Code’s public. Roast it, fork it, or try evolving your own.
<a href="https://github.com/think-a-tron/evolve">https://github.com/think-a-tron/evolve</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44028640">https://news.ycombinator.com/item?id=44028640</a></p>
<p>Points: 20</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 19 May 2025 11:28:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=44028640</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=44028640</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44028640</guid></item><item><title><![CDATA[Show HN: Raman-01 – A Pocket Physics Solver LLM]]></title><description><![CDATA[
<p>I built a tiny physics solver LLM that performs surprisingly well on easy-to-medium difficulty physics problems. Most LLMs today still struggle with physics QA (as PhyBench recently highlighted), so I wanted to see how far I could push a small model with careful data and minimal compute.<p>Model: Qwen3-1.7B<p>Supervised Finetuning: ~1500 curated examples spanning kinematics, EM, acoustics, and more<p>RL Fine-tuning: GRPO, 1-shot RLVR style (single example, 70 steps)<p>Total cost: ~$5 on H100<p>It started with a cold-start SFT (~3 epochs, loss to 0.3), then I ran RL with accuracy reward that climbed from 0.1 → 0.8.<p>Goal: Create a lightweight physics solver that’s small enough to deploy anywhere—think of it as a "pocket tutor" for foundational physics.<p>Still working on evaluations—most benchmarks focus on very hard problems, while I want something that evaluates basic correctness, reasoning, and unit sense on easy/medium problems. If anyone has suggestions, I’d love to hear them.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43892365">https://news.ycombinator.com/item?id=43892365</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 05 May 2025 06:13:12 +0000</pubDate><link>https://huggingface.co/think-a-tron/raman-01-1.7B</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=43892365</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43892365</guid></item><item><title><![CDATA[New comment by Sai_Praneeth in "Sycophancy in GPT-4o"]]></title><description><![CDATA[
<p>idk if this is only for me or happened to others as well, apart from the glaze, the model also became a lot more confident, it didn't use the web search tool when something out of its training data is asked, it straight up hallucinated multiple times.<p>i've been talking to chatgpt about rl and grpo especially in about 10-12 chats, opened a new chat, and suddenly it starts to hallucinate (it said grpo is generalized relativistic policy optimization, when i spoke to it about group relative policy optimization)<p>reran the same prompt with web search, it then said goods receipt purchase order.<p>absolute close the laptop and throw it out of the window moment.<p>what is the point of having "memory"?</p>
]]></description><pubDate>Wed, 30 Apr 2025 03:44:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=43841060</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=43841060</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43841060</guid></item><item><title><![CDATA[You are just a fancy reward function, bro]]></title><description><![CDATA[
<p>Article URL: <a href="https://saipraneeth.in/ml/fancy-reward-function">https://saipraneeth.in/ml/fancy-reward-function</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43783130">https://news.ycombinator.com/item?id=43783130</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 24 Apr 2025 14:19:15 +0000</pubDate><link>https://saipraneeth.in/ml/fancy-reward-function</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=43783130</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43783130</guid></item><item><title><![CDATA[Show HN: Showdown of Titans: GPT-4o vs. DeepSeek V3 in AI Debate Arena]]></title><description><![CDATA[
<p>Just launched AI Agents Debate Arena – a battleground where OpenAI’s GPT-4o and DeepSeek’s V3 go head-to-head in real-time debates! Users can either pick from AI-suggested topics or enter a custom challenge and watch the models argue their cases. Built using V0, this project explores how different LLMs handle reasoning, persuasion, and counterarguments. Who makes the stronger case? Test it out and let me know which model wins!<p><a href="https://v0-ai-debate.vercel.app/" rel="nofollow">https://v0-ai-debate.vercel.app/</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42886989">https://news.ycombinator.com/item?id=42886989</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 31 Jan 2025 12:28:54 +0000</pubDate><link>https://v0-ai-debate.vercel.app/</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=42886989</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42886989</guid></item><item><title><![CDATA[New comment by Sai_Praneeth in "Show HN: Retro text adventure game built using V0 and OpenAI"]]></title><description><![CDATA[
<p>wow nice</p>
]]></description><pubDate>Mon, 27 Jan 2025 14:01:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=42841227</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=42841227</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42841227</guid></item><item><title><![CDATA[Show HN: Built a retro text adventure using V0 and OpenAI]]></title><description><![CDATA[
<p>I created a classic text-based adventure game inspired by Zork using Vercel's v0. Each refresh generates a unique game title, setting, and context, with AI handling the dynamic storytelling and gameplay. It features a retro terminal-style UI, simple text commands, and endless possibilities for exploration. Check it out and let me know what you think: <a href="https://uj0gnt8ewsnqdwnf.vercel.app/" rel="nofollow">https://uj0gnt8ewsnqdwnf.vercel.app/</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42840668">https://news.ycombinator.com/item?id=42840668</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 27 Jan 2025 12:59:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=42840668</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=42840668</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42840668</guid></item><item><title><![CDATA[New comment by Sai_Praneeth in "Show HN: Retro text adventure game built using V0 and OpenAI"]]></title><description><![CDATA[
<p>aahh damn, thanks<p>i just typed the objective, it solved the game, stupid openai<p>fixing it</p>
]]></description><pubDate>Mon, 27 Jan 2025 12:53:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=42840618</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=42840618</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42840618</guid></item><item><title><![CDATA[New comment by Sai_Praneeth in "Show HN: Retro text adventure game built using V0 and OpenAI"]]></title><description><![CDATA[
<p>Updated link to the game: <a href="https://uj0gnt8ewsnqdwnf.vercel.app/" rel="nofollow">https://uj0gnt8ewsnqdwnf.vercel.app/</a></p>
]]></description><pubDate>Mon, 27 Jan 2025 12:45:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=42840551</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=42840551</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42840551</guid></item><item><title><![CDATA[New comment by Sai_Praneeth in "Show HN: Retro text adventure game built using V0 and OpenAI"]]></title><description><![CDATA[
<p>hi, thanks for trying it out, redeployed after fixing the error<p>check it out here: <a href="https://awng08bk1cxj8ydx.vercel.app/" rel="nofollow">https://awng08bk1cxj8ydx.vercel.app/</a></p>
]]></description><pubDate>Mon, 27 Jan 2025 12:40:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=42840519</link><dc:creator>Sai_Praneeth</dc:creator><comments>https://news.ycombinator.com/item?id=42840519</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42840519</guid></item></channel></rss>