sortedcord/ren
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Aditya Gupta
2026-07-12 18:09:53 +05:30
parent 918e38504b
commit 7a7fe32874
1 changed files with 2 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@@ -2,6 +2,8 @@
**A self-optimizing agentic runtime for small language models**
> ren minimizes LLM calls by learning from its own successful executions, converting repeated tasks into deterministic, zero-inference scripts. So the small model is only invoked for genuinely novel work.
## 1. Vision
@@ -11,10 +13,6 @@ Every existing agentic coding tool — Claude Code, Hermes, Cursor, etc. — is
The core insight: **most of the cost in agentic systems isn't the task, it's re-deciding how to do the task every single time.** A model doesn't need to reason from scratch about "how do I check if a URL is reachable" every time a user asks — it needs to reason about it *once*, then remember.
### The one-sentence pitch
> ren minimizes LLM calls by learning from its own successful executions, converting repeated tasks into deterministic, zero-inference scripts — so the small model is only invoked for genuinely novel work.
## 2. The Problem