Show HN: D-Engine – deterministic LLM code edits, 42× fewer tokens than an agent
The model proposes SEARCH/REPLACE blocks; a local runtime applies them in a shadow git worktree, checks the result with tsc --noEmit, and merges only if compilation passes. D-Engine removes the loop for the bounded-edit case: one prompt, one patch set, one deterministic gate. Same task, same model (V4.1-Flash), same literal prompt: Runtime Tokens Time D-Engine v0.2.2 2,552 ~4 s dsh Minimal (single shell tool) 34,600 1m04s dsh, effort off 37,100 6 s dsh factory defaults (thinking High) 107,000 28 s The toolbox is not the cost — the agentic loop is.
- ▪The model proposes SEARCH/REPLACE blocks; a local runtime applies them in a shadow git worktree, checks the result with tsc --noEmit, and merges only if compilation passes.
- ▪D-Engine removes the loop for the bounded-edit case: one prompt, one patch set, one deterministic gate.
- ▪Same task, same model (V4.1-Flash), same literal prompt: Runtime Tokens Time D-Engine v0.2.2 2,552 ~4 s dsh Minimal (single shell tool) 34,600 1m04s dsh, effort off 37,100 6 s dsh factory defaults (thinking High) 107,000 28 s The toolbox is
Hacker News (AI / LLM) files mainly under ai. We currently carry 7,218 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | GitHub |
| Canonical URL | https://github.com/corruchaga/D-Engine |
| Publication time | Thu, 01 Oct 2026 18:52:26 +0000 |
| Retrieval time | 2026-10-01T19:12:21.143Z |
| Last seen | 2026-10-01T19:12:21.143Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | 5PSQQTjym5wM · 1 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
D-Engine The AI thinks, the gate decides. A deterministic harness for LLM code edits. The model proposes SEARCH/REPLACE blocks; a local runtime applies them in a shadow git worktree, checks the result with tsc --noEmit, and merges only if compilation passes. The LLM never writes to your real branch. 📄 Read the full story: The AI thinks, the gate decides — how I made LLM code edits deterministic (42× fewer tokens) 🇪🇸 README en español Why Agentic coding loops pay their token bill twice: every turn re-sends the whole trajectory (files, tool results, reasoning) to the model, and "thinking" modes multiply both the tokens per turn and the number of turns. D-Engine removes the loop for the bounded-edit case: one prompt, one patch set, one deterministic gate.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at GitHub.