@polycode-projects/seonix 0.7.0 → 0.7.3

package/README.md

@@ -7,45 +7,25 @@ bounded **edit digest** you inject once at session start. Your agent edits from
 turn 1 without fishing through the repo.
 
 > **Headline.** Measured as **mean** input tokens per both-solved task (paired
-> arms, identical model pin). Under the shipped score-gap default (R1b), B017
-> re-tested across three models on a held-out TypeScript corpus and the existing
-> suites: two cells clear the ≥50% decision bar, both on exploration-bound
-> complex tasks — a TypeScript middleware task on **Haiku 4.5 at 59.6%** and a C#
-> service task on **Sonnet 4.6 at 53.5%** — with several more in the 35 to 48%
-> range. Across all measured cells the token cut tracks the turn cut
-> (Pearson 0.91): seonix saves tokens by removing exploration turns, so tasks
-> whose edit site is obvious change little. Indexing costs **$0**. The win is
-> task- and model-conditional; full method, numbers and the measurement contract
-> are in `BENCHMARK_017.md`.
+> arms, identical model pin). Under the shipped score-gap default, two cells clear
+> the ≥50% bar, both on exploration-bound complex tasks (a TypeScript middleware
+> task on **Haiku 4.5** and a C# service task on **Sonnet 4.6**), with several more
+> in the 35 to 48% range. The token cut tracks the turn cut: seonix saves tokens by
+> removing exploration turns, so tasks whose edit site is obvious change little.
+> Indexing costs **$0**. The win is task- and model-conditional. Full method,
+> numbers, and the measurement contract are in
+> [`BENCHMARKS.md`](https://gitlab.com/polycode-projects/seonix/-/blob/main/BENCHMARKS.md).
 
 - **Website / live demo:** https://seonix.polycode.co.uk
 - **Source + benchmarks:** https://gitlab.com/polycode-projects/seonix
 - **Licence:** AGPL-3.0-only
 
-## Cross-model comparison
-
-seonix on the cheaper **Sonnet 4.6** vs the flagship **Opus 4.8** out of the box,
-mean input tokens per solved run (N=3; N=5 where an otb cell reuses the B015
-baseline). `+` means seonix on Sonnet used fewer tokens.
-
-| full task name | otb / Opus 4.8 | solved | seonix / Sonnet 4.6 | solved | token change |
-| --- | --- | --- | --- | --- | --- |
-| ts-hono-utils-helper (simple) | 135k | 3/3 | 117k | 3/3 | +13% |
-| ts-hono-response-time-middleware | 345k | 3/3 | 555k | 3/3 | −61% |
-| ts-hono-json-envelope | 1,102k | 3/3 | 864k | 3/3 | +22% |
-| py-django-truncatelines-filter | 610k | 5/5 | 524k | 5/5 | +14% |
-| cs-eshoponweb-order-service-total | 318k | 5/5 | 154k | 3/3 | +51% |
-| cs-eshoponweb-basket-service-total | 353k | 5/5 | 255k | 3/3 | +28% |
-| js-express-request-id | 330k | 5/5 | 267k | 3/3 | +19% |
-| js-express-json-envelope | 174k | 5/5 | 185k | 3/3 | −7% |
-
-seonix on Sonnet used fewer input tokens than otb on Opus on six of these eight
-tasks, at equal correctness. This crosses model and arm together, so
-it is an illustration of practical value, not the paired within-model measurement
-the ≥50% decision rule uses. Across all 13 measured seonix cells the drop in input
-tokens is 0.91-correlated (Pearson) with the drop in turns (slope about 0.71):
-seonix saves tokens by letting the agent skip exploration turns, so where it
-removes no turns there is little to save.
+## A cheaper model, matched
+
+seonix on the cheaper **Sonnet 4.6** used fewer input tokens than out-of-the-box
+**Opus 4.8** on six of eight tasks, at equal correctness. The full cross-model
+table and the turns correlation (Pearson 0.91) are in
+[`BENCHMARKS.md`](https://gitlab.com/polycode-projects/seonix/-/blob/main/BENCHMARKS.md).
 
 ## Install
 
@@ -102,7 +82,10 @@ filesystem root). In the merged graph every module id and label is prefixed with
 the repo's directory basename (`mod:<repoName>/<relpath>`); when two repos share a
 basename the first in path sort order keeps the bare name and later ones get `-2`,
 `-3`, … appended. Each repo's git history and `.seonixignore` are handled per repo,
-exactly as in single mode. Cross-repo call edges only arise where a symbol name
+exactly as in single mode — a `.seonixignore` at the `multi_root` **parent** is NOT read
+(each sub-repo loads only its own). For an **estate-wide exclude**, put it in a `seonix.toml`
+at the directory you index from (`[index].exclude` / `secret_exclude`); that propagates to
+every sub-repo. Cross-repo call edges only arise where a symbol name
 resolves uniquely across the whole merged graph; ambiguous names are dropped, as
 within one repo. Query a merged graph by passing the merge root as `repo_path`
 (e.g. `seonix cli seonix_search '{"repo_path":"/abs/estate","query":"…"}'`).

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@polycode-projects/seonix",
-  "version": "0.7.0",
+  "version": "0.7.3",
   "private": false,
   "type": "module",
   "description": "SEONIX — a deterministic, offline, $0 code-graph tool that makes a cheap coding agent edit like an expensive one. Indexes a repo with Python ast + git (zero model calls) and renders a bounded edit-digest.",

package/src/ask.mjs

@@ -62,7 +62,9 @@ import { nlpAdapter } from "./ask-nlp.mjs";
  *  classification, so they cannot drift in meaning). */
 function edgesOfKind(graph, kind) {
   const out = [];
-  for (const g of graph.relations) if (relationKind(g) === kind) out.push(...g.edges);
+  // Append iteratively: `out.push(...g.edges)` spreads the group's edges as function arguments,
+  // overflowing the call stack on a large estate graph (mirrors the codegraph.mjs edgesOfKind fix).
+  for (const g of graph.relations) if (relationKind(g) === kind) for (const e of g.edges) out.push(e);
   return out;
 }
 

package/src/codegraph.mjs

@@ -1180,7 +1180,10 @@ export function renderSearch(graph, query, { limit = SEARCH_LIMIT, kind = "", de
  *  mechanical NL-query engine (PLAN_MECHANICAL_CHAT.md) to orchestrate rather than duplicate. */
 export function edgesOfKind(graph, kind) {
   const out = [];
-  for (const g of graph.relations) if (relationKind(g) === kind) out.push(...g.edges);
+  // NB: append iteratively — `out.push(...g.edges)` spreads the group's edges as function
+  // arguments, which overflows the call stack on a large estate graph (e.g. `defines` with
+  // 176k edges → "Maximum call stack size exceeded"). A plain loop has no argument-count limit.
+  for (const g of graph.relations) if (relationKind(g) === kind) for (const e of g.edges) out.push(e);
   return out;
 }