<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: Show HN</title><link>https://news.ycombinator.com/shownew</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 11 Apr 2026 13:13:53 +0000</lastBuildDate><atom:link href="https://hnrss.org/show" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Show HN: I'm organizing a vibe coding game dev competition]]></title><description><![CDATA[
<p>Hi everyone,<p>I just saw a vibe coded game on HN, and thought maybe I should post about this here.<p>I'm organizing a vibe coding game dev competition called Vibe Jam.<p>Last year we did it too and there was 1000+ games submitted.<p>This year the deadline is May 1 and you can submit your games until then.<p>There's $35,000 in prizes with the Gold prize being $20,000.<p>Let me know what you think!<p>-Pieter</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47730124">https://news.ycombinator.com/item?id=47730124</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 12:47:17 +0000</pubDate><link>https://vibej.am/2026/</link><dc:creator>pieterhg</dc:creator><comments>https://news.ycombinator.com/item?id=47730124</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47730124</guid></item><item><title><![CDATA[Show HN: Angel Copilot – open-source tool for assessing startup deals]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/chouligi/angel-copilot/tree/main">https://github.com/chouligi/angel-copilot/tree/main</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47730076">https://news.ycombinator.com/item?id=47730076</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 12:38:33 +0000</pubDate><link>https://github.com/chouligi/angel-copilot/tree/main</link><dc:creator>chouligi</dc:creator><comments>https://news.ycombinator.com/item?id=47730076</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47730076</guid></item><item><title><![CDATA[Show HN: Bal – a Knights and Knaves logic puzzle game with Glicko rating system]]></title><description><![CDATA[
<p>I built this game over the past couple months. It's a Knights & Knaves puzzle game. You meet a group of people who are each either a knight (always tells the truth) or a knave (always lies), and have to figure out who's who from their statements.<p>The fun part was the puzzle engine. It generates every possible puzzle for a given configuration by exhaustive enumeration, then checks all possible worlds against all possible statement assignments, deduplicating equivelant puzzles via canonical forms, and detecting which properties are uniquely determined vs. indeterminate. For larger configs (3+ people), it uses random sampling of phase space to reduce memory cost and time.<p>The result is 57 million puzzles for up to 4 speakers. From this, 6,000 were included in the game using stratified balanced sampling across features.<p>Other bits: Glicko-2 ratings for adaptive difficulty (both players and puzzles have ratings), "whodunit" mode where you also figure out who committed a crime, and a "normals" variant where some people can say anything.<p>It's free during beta with no ads (ever). Requires a quick sign-in (Google/Apple/GitHub/Discord) for the rating system to work, but only stores an anonymous ID (no email or other personal data).<p>I'd be interested in feedback on difficulty, puzzle variety, or anything else. Depending on interest, I plan to add additional puzzle types and ability to play via API over the next few weeks.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47730020">https://news.ycombinator.com/item?id=47730020</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 11 Apr 2026 12:31:15 +0000</pubDate><link>https://bal.sciforge.ai/</link><dc:creator>skaye</dc:creator><comments>https://news.ycombinator.com/item?id=47730020</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47730020</guid></item><item><title><![CDATA[Show HN: Bunqueue – Saga workflow engine for Bun with embedded SQLite]]></title><description><![CDATA[
<p>Article URL: <a href="https://bunqueue.dev/guide/workflow/">https://bunqueue.dev/guide/workflow/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729938">https://news.ycombinator.com/item?id=47729938</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 12:19:15 +0000</pubDate><link>https://bunqueue.dev/guide/workflow/</link><dc:creator>kernelvoid</dc:creator><comments>https://news.ycombinator.com/item?id=47729938</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729938</guid></item><item><title><![CDATA[Show HN: I rebuilt a 2000s browser strategy game on Cloudflare's edge]]></title><description><![CDATA[
<p>I grew up in Germany in the early 2000s playing a browser game called Inselkampf. You built up an island, mined gold and stone, cut down trees for wood, raised armies, sent fleets across an ocean grid, joined alliances and got betrayed by them. Same genre as OGame or Travian. It shut down in 2014 and I never found anything that replaced that feeling of checking in before school to see if your fleet had arrived and your alliance was still alive.<p>I finally built the version I wanted to play. Kampfinsel is live at kampfinsel.com right now with real players on it. It's not a straight copy of the old game. I gave it its own world. No magic, no gunpowder – just ballistas, fire pots, and slow ships crossing huge distances. Three resources: gold, stone, wood. Travel between islands takes hours, not seconds. It's slow on purpose.<p>The whole thing runs on Cloudflare's edge. Workers for the game logic and API, D1 for the database, KV for sessions and caching, R2 for assets and Durable Objects for per-island state and the tick system (fleet arrivals, combat, resource generation). There's no origin server at all. Making a stateful multiplayer game work inside Workers' CPU limits and D1's consistency model meant some non-obvious choices: resources are calculated on-read from timestamps instead of being ticked into the database, fleet movements live in Durable Object alarms and combat writes are batched. This helped me a lot!<p>The look is intentionally rough and text-heavy (Hi HN!): server-rendered HTML, tables, a parchment color palette, Unicode icons, no frontend framework, no build step. The only JavaScript is for countdown timers and auto-refresh. I wanted it to feel the way I remember these games looking, not how they actually looked. Honestly, it looks a lot like HN itself - tables, monospace, no chrome. If you like how this site looks, you'll probably feel at home.<p>No signup wall, no premium currency, no pay-to-win. Feedback very welcome, especially from anyone who played this kind of game back in the day or has opinions on running stateful stuff on Workers + D1 + Durable Objects. I'll be around for the next few hours.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729925">https://news.ycombinator.com/item?id=47729925</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 12:17:29 +0000</pubDate><link>https://kampfinsel.com/</link><dc:creator>parzivalt</dc:creator><comments>https://news.ycombinator.com/item?id=47729925</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729925</guid></item><item><title><![CDATA[Show HN: MoodSense AI (ML and FastAPI and Gradio, Deployed on Hugging Face)]]></title><description><![CDATA[
<p>I built MoodSense AI, an end-to-end NLP project that detects mood from text and provides basic recommendations.<p>It classifies text into multiple moods (happy, sad, anxious, etc.), shows confidence and probability distribution, and exposes both an API (FastAPI) and a UI (Gradio).<p>The goal was to go beyond just training a model and make something actually usable.<p>Live demo:
<a href="https://huggingface.co/spaces/aman179102/moodsense-ai" rel="nofollow">https://huggingface.co/spaces/aman179102/moodsense-ai</a><p>Source:
<a href="https://github.com/aman179102/moodsense-ai" rel="nofollow">https://github.com/aman179102/moodsense-ai</a><p>Tech stack: Python, scikit-learn, LightGBM, spaCy, FastAPI, Gradio</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729679">https://news.ycombinator.com/item?id=47729679</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 11 Apr 2026 11:32:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=47729679</link><dc:creator>aman179102</dc:creator><comments>https://news.ycombinator.com/item?id=47729679</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729679</guid></item><item><title><![CDATA[Show HN: MoodSense AI – mood detection and recommendations from text]]></title><description><![CDATA[
<p>Built MoodSense AI, an NLP project that detects mood from text and provides simple recommendations.<p>It classifies input into multiple moods, shows confidence and probability distribution, and includes both an API and UI.<p>The goal was to move beyond just training a model and build something usable.<p>Source: <a href="https://github.com/aman179102/moodsense-ai" rel="nofollow">https://github.com/aman179102/moodsense-ai</a><p>Feedback is welcome.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729663">https://news.ycombinator.com/item?id=47729663</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 11:29:34 +0000</pubDate><link>https://huggingface.co/spaces/aman179102/moodsense-ai</link><dc:creator>aman179102</dc:creator><comments>https://news.ycombinator.com/item?id=47729663</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729663</guid></item><item><title><![CDATA[Show HN: Lodmem – Level of Detail Context Management for Agents]]></title><description><![CDATA[
<p>Introducing LOD mem - A context management system for agents
Uses a background LLM to summarise data on each Agent turn, automatically culling data to stay within a target context, and providing a way for Agent to access removed context<p>From initial testing, much faster for small tasks, however it is costly to test, so keen for other people to give it a go. No more waiting for compaction!<p>Currently opencode is supported as a plugin.<p>Can look at Claude Code if someone would like to sponsor.<p>There is an evaluation system and sample tasks that shows results empirically (Results not yet published).</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729563">https://news.ycombinator.com/item?id=47729563</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 11:13:41 +0000</pubDate><link>https://github.com/agenteractai/lodmem</link><dc:creator>mribbons</dc:creator><comments>https://news.ycombinator.com/item?id=47729563</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729563</guid></item><item><title><![CDATA[Show HN: Wiktionary StarDict Files]]></title><description><![CDATA[
<p>Thanks to Wiktionary HTML snapshots, I'm able to make StarDict files resemble Wiktionary web page. I have extracted 5 Wiktionary editions: de, en, es, fr, ru. I created these files mainly for KOReader, the CSS rules may not applied in other apps. Source code: <a href="https://github.com/xxyzz/wiktionary_stardict" rel="nofollow">https://github.com/xxyzz/wiktionary_stardict</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729558">https://news.ycombinator.com/item?id=47729558</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 11:13:07 +0000</pubDate><link>https://xxyzz.github.io/wiktionary_stardict/</link><dc:creator>xxyzz</dc:creator><comments>https://news.ycombinator.com/item?id=47729558</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729558</guid></item><item><title><![CDATA[Show HN: Hormuz Havoc, a satirical game that got overrun by AI bots in 24 hours]]></title><description><![CDATA[
<p>I built a satirical browser game to share with friends (Hormuz Havoc: you play an American president managing a crisis in the Middle East, only "loosely" inspired by current events). I had good fun making this, but that's not necessarily the interesting part.<p>The interesting part was that within a few hours of sharing it with my friends, some of them set about trying to overrun the leaderboard by launching a swarm of AI bots to learn the game and figure out how to get the highest score. This set off a game of cat-and-mouse as they found vulnerabilities and I tried patching them.<p>Within hours of sharing, someone used the Claude browser extension to read game.js directly. Large parts of the scoring formula, action effect values, and bonus thresholds were sitting in client-side JavaScript - this was a trivial thing even a human could've found, but a human would've still had to play the game, whereas the AI bot just optimised directly against the scoring formula. It meant that the first AI already scored 2.5x higher than the best human player by optimising directly against the source code rather than playing the game.<p>Straightforward fix: moved the entire game engine server-side. The client is now a dumb terminal, it sends an action ID, receives a rendered state. No scoring logic, no bonus thresholds, no action effects exist in the browser. The live score display uses a deliberately different formula as misdirection.<p>This increased the difficulty in finding bot-enabled hacks, so the subsequent bots tried brute-forcing the game, trying to game the RNG functions, and other methods.<p>But the next winning bot found a vulnerability where the same signed session token could be replayed. It would play turn N, observe a bad random event, replay the same token for turn N, get a different RNG outcome, keep the best one. Effectively branching from a single game state to cherry-pick lucky outcomes across 30 turns. Managed to 1.5x the previous bot's high score.<p>The bot's own description: "The key optimisation was token replay. Because the backend let the same signed state be replayed, I could branch from one exact game state repeatedly and continue from the luckiest high-value outcome each turn."<p>Fix here: consume a turn nonce atomically before any randomness is generated.<p>The current state is that the leaderboard is now split into human and AI-assisted. I think the capability of AI bots has flatlined a bit now. Perhaps Claude Mythos might be able to discover the next hackable exploit ¯\_(ツ)_/¯<p>Happy to go deeper on any of the above - or just enjoy the game! Feel free to try your own AI-powered leaderboard attempt too!</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729477">https://news.ycombinator.com/item?id=47729477</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 10:58:36 +0000</pubDate><link>https://www.hormuz-havoc.com/</link><dc:creator>kupadapuku</dc:creator><comments>https://news.ycombinator.com/item?id=47729477</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729477</guid></item><item><title><![CDATA[Show HN: SubnetLens – a concurrent local network scanner built in Go with a TUI]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/ostefani/subnetlens">https://github.com/ostefani/subnetlens</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729289">https://news.ycombinator.com/item?id=47729289</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 10:23:42 +0000</pubDate><link>https://github.com/ostefani/subnetlens</link><dc:creator>ostefani</dc:creator><comments>https://news.ycombinator.com/item?id=47729289</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729289</guid></item><item><title><![CDATA[Show HN: Cyber Pulse. AI pipeline for triage and alerting on cyber news/intel]]></title><description><![CDATA[
<p>I work in cyber security and built this android app to help me keep up to date with the latest news stories and summarise the most important information. It provides two executive summaries per day and alerts for critical news throughout.<p>I’m using Gemini Pro 3 to analyse recent articles from a list of trusted sources. It identifies the 5 highest priority stories, considering things like if a vulnerability is being actively exploited, novelty and breadth.<p>If CVEs are identified, it will check for CISA KEV status, EPSS score and if POCs are available on GitHub. It then provides an overall executive summary plus analysis for the top stories, including details, affected systems, potential impact and mitigation actions.<p>The brief is then passed to Gemini again for verification and fact checking against the source articles and other CVE data retrieved to correct any potential hallucinations.<p>It’s a paid monthly subscription based app, but it has a 7 day free trial for new users. You can manage subscriptions and cancel from the account tab. If anyone wants an extension I can look at setting up a promo code, please message me.<p>I would be very grateful for feedback, particularly if the mitigation information is useful, if you think the critical alerts are critical enough to be notified about, any good sources I could add or anything else.<p>Happy to answer questions. 
Play Store Link: <a href="https://play.google.com/store/apps/details?id=com.cyberpulse.cyber_pulse">https://play.google.com/store/apps/details?id=com.cyberpulse...</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47729065">https://news.ycombinator.com/item?id=47729065</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 09:37:03 +0000</pubDate><link>https://play.google.com/store/apps/details?id=com.cyberpulse.cyber_pulse&amp;hl=en_US</link><dc:creator>kozi93</dc:creator><comments>https://news.ycombinator.com/item?id=47729065</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47729065</guid></item><item><title><![CDATA[Show HN: Keyboard First Email Client]]></title><description><![CDATA[
<p>My email clients/inbox really fu*ing annoyed me.<p>Tallyman is what happened next: a keyboard driven email client on top of Gmail and Outlook.
Your vim muscle memory works (j/k, gg, relative line numbers, counts, ...)
39 rebindable shortcuts, command palette, email templates, themes ...<p>No migration. OAuth only.
Verified by Microsoft and live now. Google verification is under review.<p>30 day free trial, $9/mo per inbox after that.
Write me an email if you need an extended trial: contact@tallyman.io</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47728849">https://news.ycombinator.com/item?id=47728849</a></p>
<p>Points: 7</p>
<p># Comments: 2</p>
]]></description><pubDate>Sat, 11 Apr 2026 08:58:36 +0000</pubDate><link>https://tallyman.io</link><dc:creator>Mechse</dc:creator><comments>https://news.ycombinator.com/item?id=47728849</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47728849</guid></item><item><title><![CDATA[Show HN: LSM Trees: MemTable, Compaction, and the Amplification Triangle [video]]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.youtube.com/watch?v=rOC7jkN748w">https://www.youtube.com/watch?v=rOC7jkN748w</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47728661">https://news.ycombinator.com/item?id=47728661</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 08:27:04 +0000</pubDate><link>https://www.youtube.com/watch?v=rOC7jkN748w</link><dc:creator>rcron</dc:creator><comments>https://news.ycombinator.com/item?id=47728661</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47728661</guid></item><item><title><![CDATA[Show HN: RelayFreeLLM — Free AI Gateway with Auto-Failover (Updates)]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/msmarkgu/RelayFreeLLM">https://github.com/msmarkgu/RelayFreeLLM</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47728043">https://news.ycombinator.com/item?id=47728043</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 06:33:26 +0000</pubDate><link>https://github.com/msmarkgu/RelayFreeLLM</link><dc:creator>markfront</dc:creator><comments>https://news.ycombinator.com/item?id=47728043</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47728043</guid></item><item><title><![CDATA[Show HN: Provepy – A Python decorator that proves your code using Lean and LLMs]]></title><description><![CDATA[
<p>Hi all,<p>I have recently been playing around with AI and formal methods and built Provepy. It's an experiment to see if we can use frontier LLMs to bridge the gap between everyday Python code and formal verification in Lean.<p>The idea is to make formal methods more accessible by burying the complex Lean syntax behind a standard Python decorator. You add @provable to your function, give it a plain English claim, and run your code.<p><pre><code>  from provepy import provable

  @provable(claim="This function returns the sum of its inputs")
  def add(a: int, b: int) -> int:
    return a + b
</code></pre>
Under the hood, when the script runs, Provepy grabs the function and your claim, and passes them to an LLM (defaults to Gemma, but supports OpenRouter or any custom OpenAI-compatible endpoint). The LLM attempts to translate the claim into a Lean 4 theorem and generate the proof. Using Frontier models is recommended for best results.<p>Generation of the theorem, code and proof is done separately to avoid the LLM proving the wrong claim or function just to succeed in the proof.<p>If Lean compiles and accepts the proof, your Python function executes normally. If the proof fails, your program halts with a VerificationError.<p>You can also pass context to the decorator if your function relies on other Python functions in your codebase. I also added a fallback mechanism—you can configure a smaller, cheaper model to try first, and if it fails to generate a valid proof, it automatically retries with a heavier model.<p>To be clear: this is very experimental alpha software.<p>It currently only works reliably on simple functions.<p>There's a lot left to do, like improving how context is pulled from the AST and resolving name clashes with Lean's mathlib.<p>Contributions are most welcome!<p>I'd love to hear your thoughts.<p>Github: <a href="https://github.com/genie16/provepy" rel="nofollow">https://github.com/genie16/provepy</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47728039">https://news.ycombinator.com/item?id=47728039</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 06:33:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=47728039</link><dc:creator>spaccy05</dc:creator><comments>https://news.ycombinator.com/item?id=47728039</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47728039</guid></item><item><title><![CDATA[Show HN: Pardonned.com – A searchable database of US Pardons]]></title><description><![CDATA[
<p><a href="https://pardonned.com" rel="nofollow">https://pardonned.com</a><p>Inspired by the videos of Liz Oyer, I wanted to be able to verify her claims and just look up all the pardons more easily.<p>Tech Stack: 
 Playwright - to sccrape the DOJ website
 SQLite - local database
 Astro 6 - Build out a static website from the sqlite db<p>All code is open source and available on Github.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47727960">https://news.ycombinator.com/item?id=47727960</a></p>
<p>Points: 83</p>
<p># Comments: 20</p>
]]></description><pubDate>Sat, 11 Apr 2026 06:19:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=47727960</link><dc:creator>vidluther</dc:creator><comments>https://news.ycombinator.com/item?id=47727960</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47727960</guid></item><item><title><![CDATA[Show HN: Dux, a TUI Agent Multiplexer]]></title><description><![CDATA[
<p>Hey HN!<p>I built this over the past couple of weeks out of frustration of not having something like Claude Code Desktop, Conductor, Emdash and a few others in a Linux Environment (and a Windows/WSL environment).<p>Dux takes some of the good learnings from most of the UIs today but offers it in a nicely packaged form. You can create multiple agents off the same repo via Git Worktrees, and you leverage Claude's native terminal UI or Codex's own (with support for bringing your own too).<p>It's a v0 still, but happy to take any feedback as long as it's possible to be done!</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47727890">https://news.ycombinator.com/item?id=47727890</a></p>
<p>Points: 2</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 11 Apr 2026 06:05:03 +0000</pubDate><link>https://github.com/patrickdappollonio/dux</link><dc:creator>pdappollonio</dc:creator><comments>https://news.ycombinator.com/item?id=47727890</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47727890</guid></item><item><title><![CDATA[Show HN: HyperFlow – A self-improving agent framework built on LangGraph]]></title><description><![CDATA[
<p>Hi HN, I am Umer. I recently built an experimental framework called HyperFlow to explore the idea of self-improving AI agents.<p>Usually, when an agent fails a task, we developers step in to manually tweak the prompt or adjust the code logic. I wanted to see if an agent could automate its own improvement loop.<p>Built on LangChain and LangGraph, HyperFlow uses two agents: 
- A TaskAgent that solves the domain problem.
- A MetaAgent that acts as the improver.<p>The MetaAgent looks at the TaskAgent's evaluation logs, rewrites the underlying Python code, tools, and prompt files, and then tests the new version in an isolated sandbox (like Docker). Over several generations, it saves the versions that achieve the highest scores to an archive.<p>It is highly experimental right now, but the architecture is heavily inspired by the recent HyperAgents paper (Meta Research, 2026).<p>I would love to hear your feedback on the architecture, your thoughts on self-referential agents, or answer any questions you might have!<p>Documentation: <a href="https://hyperflow.lablnet.com/" rel="nofollow">https://hyperflow.lablnet.com/</a>
GitHub: <a href="https://github.com/lablnet/HyperFlow" rel="nofollow">https://github.com/lablnet/HyperFlow</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47727255">https://news.ycombinator.com/item?id=47727255</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 04:01:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=47727255</link><dc:creator>lablnet</dc:creator><comments>https://news.ycombinator.com/item?id=47727255</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47727255</guid></item><item><title><![CDATA[Show HN: Vibescore – Grade your vibe-coded project A+ to F (one command)]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/stef41/vibescore">https://github.com/stef41/vibescore</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47727020">https://news.ycombinator.com/item?id=47727020</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 11 Apr 2026 03:23:06 +0000</pubDate><link>https://github.com/stef41/vibescore</link><dc:creator>zach22</dc:creator><comments>https://news.ycombinator.com/item?id=47727020</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47727020</guid></item></channel></rss>