@azure-id/orc 2.1.1 → 2.2.0

package/bin/graph-resolve.js

@@ -53,7 +53,7 @@ const G = require("./graph.js");
 
 // 3 (v1.8.2 W1): ROUTE rows. A 1.8.1 cache is refused by the schema check and
 // recomputed on read until the next `update` rewrites it — no answer changes.
-const RESOLVE_SCHEMA = 3;
+const RESOLVE_SCHEMA = 4;
 const CONFIDENT = new Set(["LOCAL", "IMPORT", "UNIQUE", "ROUTE"]);
 const NAMES_PER_KEY = 5;
 

package/bin/graph-shard.js

@@ -279,13 +279,36 @@ function fastModel(claudeDir, root, query, opts) {
   };
 
   // The target's own shard holds its callers AND its ambiguous-caller counts.
-  // `ctx` asks for callers of the TARGET and of nothing else, so one shard is
-  // the whole reverse half of this card.
   const s0 = shardFor(rel);
-  const callersCache = Object.create(null);
-  const maybeCache = Object.create(null);
-  for (const [k, v] of Object.entries(s0.callers)) callersCache[k] = v;
-  for (const [k, v] of Object.entries(s0.maybe || {})) maybeCache[k] = v;
+  const callersRows = Object.create(null);
+  const maybeRows = Object.create(null);
+  const merged = new Set();
+  const merge = (r, sh) => {
+    merged.add(r);
+    for (const [k, v] of Object.entries(sh.callers || {})) callersRows[k] = v;
+    for (const [k, v] of Object.entries(sh.maybe || {})) maybeRows[k] = v;
+  };
+  merge(rel, s0);
+  // R11 (v2.2.0): the card also asks for the callers of the target's CALLERS
+  // (the tests that reach it through one). Those rows live in the shard of the
+  // caller's file, so that shard is read on first ask. A shard that will not
+  // read sends the whole card back to the full model, never a shorter card.
+  const ensure = (k) => {
+    if (typeof k !== "string" || !k.includes("#")) return;
+    const r = k.split("#")[0];
+    if (merged.has(r) || !files[r]) return;
+    const sh = shardFor(r);
+    if (!sh) throw new FastUnavailable("shard-stale:" + r);
+    merge(r, sh);
+  };
+  const lazy = (t) =>
+    new Proxy(t, {
+      get: (o, k) => (ensure(k), o[k]),
+      has: (o, k) => (ensure(k), k in o),
+      getOwnPropertyDescriptor: (o, k) => (ensure(k), Reflect.getOwnPropertyDescriptor(o, k)),
+    });
+  const callersCache = lazy(callersRows);
+  const maybeCache = lazy(maybeRows);
 
   return {
     model: {

package/bin/graph-signals.js

@@ -489,12 +489,14 @@ function complexityOf(claudeDir, root, model, rels, opts) {
     callerFiles.size >= COMPLEXITY_CALLER_FILES || callersOutside >= COMPLEXITY_CALLERS || risk.length > 0 || cochange.length > 0 ? "recommend-orc" : "mini-ok";
 
   const riskText = risk.length ? risk.map((x) => `${x.class}${x.at ? ` (${x.at})` : ""}`).join(", ") : riskGiven ? "none" : "not given";
-  const cochangeText = cochange.length ? cochange.map((x) => `${x.path} x${x.count} not in plan`).join(", ") : "none";
+  // v2.2.0 (G-15): no co-change row is no segment — `cochange none` was a
+  // line about nothing.
+  const cochangeText = cochange.length ? ` · cochange ${cochange.map((x) => `${x.path} x${x.count} not in plan`).join(", ")}` : "";
   const maybeText = maybe ? ` · maybe ${maybe}` : "";
   const line =
     verdict === "mini-ok"
-      ? `complexity: mini-ok — ${rels.length} files · confident callers ${callersOutside} in ${callerFiles.size} files${maybeText} · tests reach ${testsReaching} · risk ${riskText} · cochange ${cochangeText}`
-      : `complexity: recommend /orc — ${rels.length} files · callers ${callersOutside} in ${callerFiles.size} files${maybeText} · tests reach ${testsReaching} · risk ${riskText} · cochange ${cochangeText}`;
+      ? `complexity: mini-ok — ${rels.length} files · confident callers ${callersOutside} in ${callerFiles.size} files${maybeText} · tests reach ${testsReaching} · risk ${riskText}${cochangeText}`
+      : `complexity: recommend /orc — ${rels.length} files · callers ${callersOutside} in ${callerFiles.size} files${maybeText} · tests reach ${testsReaching} · risk ${riskText}${cochangeText}`;
 
   return {
     verdict,

package/bin/graph.js

@@ -45,7 +45,7 @@ const SCHEMA = 1;
 //     symbols, and a `<script setup>` component is one `class`. No record FIELD
 //     changed: a 1.9.0 store reads DRIFTED and the next `status --heal`
 //     re-extracts once, the same path 1.8.1 → 1.8.2 took.
-const ENGINE = "graph@6";
+const ENGINE = "graph@7";
 const GIT_MAX_BUFFER = 256 * 1024 * 1024;
 const MAX_BYTES = 512 * 1024;
 const LOCK_STALE_MS = 10 * 60 * 1000;
@@ -514,7 +514,10 @@ function graphUpdate(claudeDir, root, opts) {
       // EW3: how long the last real update took, end to end. A read that may
       // heal uses it as the estimate for the next one — the only honest
       // estimate available, because an update cannot be stopped half way.
-      update_ms: unchanged && prevMeta ? prevMeta.update_ms || 0 : 0,
+      // v2.2.0 (G-13): a COLD build is not an estimate for an incremental
+      // update, so it writes `build_ms` and leaves `update_ms` absent.
+      ...(first ? {} : { update_ms: unchanged && prevMeta ? prevMeta.update_ms || 0 : 0 }),
+      ...(prevMeta && prevMeta.build_ms ? { build_ms: prevMeta.build_ms } : {}),
       // A1: computed from the index this update just built, so it costs one
       // pass over what is already in memory and no file is opened for it.
       density: unchanged && prevMeta && prevMeta.density ? prevMeta.density : densityOf(index, filesOut),
@@ -540,7 +543,8 @@ function graphUpdate(claudeDir, root, opts) {
     // so a crash between the two leaves a valid meta that only lacks an
     // estimate, and a missing estimate simply means "heal, and find out".
     if (!unchanged) {
-      meta.update_ms = Date.now() - t0;
+      if (first) meta.build_ms = Date.now() - t0;
+      else meta.update_ms = Date.now() - t0;
       atomicWrite(p.meta, JSON.stringify(meta, null, 2) + "\n");
     }
     return {

package/bin/habit.js

@@ -140,7 +140,7 @@ const QUESTION_RE = /(?:^|\s)QUESTION\s+count=(\d+)/;
 const AGENT_RE = /^[a-z0-9][a-z0-9.:-]*$/;
 
 // v2.1.0 (A1) — ONE agent, ONE spelling. A live gate wrote the same executor
-// three ways (`orc-executor-sonnet-4-6-med`, `sonnet-4-6-med`, `sonnet`), so a
+// three ways (`orc-executor-haiku-5-high`, `haiku-5-high`, `haiku`), so a
 // 15-of-15 choice read as 5/7 and was never proposed. A short form is mapped to
 // the full SHIPPED agent name only when it can mean exactly one agent of the
 // gate's role (a family word like `sonnet` is settled by the `offered=` list);

package/bin/pricing.json

@@ -28,7 +28,7 @@
     "it has no rate for. A pair with no rate reports `usd: null` forever, never a",
     "guess and never a family fallback."
   ],
-  "as_of": "2026-10-01",
+  "as_of": "2026-10-09",
   "currency": "USD",
   "unit": "per_million_tokens",
   "server_tools": {
@@ -84,6 +84,12 @@
       "cache_read": 0.3,
       "output": 15
     },
+    "claude-haiku-5-5": {
+      "input": 0.1,
+      "cache_write": 0.125,
+      "cache_read": 0.01,
+      "output": 0.5
+    },
     "claude-haiku-4-5": {
       "input": 1,
       "cache_write": 1.25,
@@ -151,6 +157,7 @@
     "claude-sonnet-5-5": 200000,
     "claude-sonnet-5": 200000,
     "claude-sonnet-4-6": 200000,
+    "claude-haiku-5-5": 1000000,
     "claude-haiku-4-5": 200000
   },
   "providers": {

package/bin/trace-write.js

@@ -6,10 +6,10 @@
 // halves of the trace pair — the `.txt` line and its `.jsonl` row — so the two
 // can never disagree about an event. W0 measured the Haiku writer at 92.4 %
 // (whole phase blocks missing from the `.jsonl`); here parity is by
-// construction. The writer agent `orc-trace-writer-haiku-4-5` stays as the
+// construction. The writer agent `orc-trace-writer-haiku-5-high` stays as the
 // FALLBACK: a lane dispatches it only when this command exits ≠ 0.
 //
-// The formats are the writer's, not new ones (`agents/orc-trace-writer-haiku-4-5.md`):
+// The formats are the writer's, not new ones (`agents/orc-trace-writer-haiku-5-high.md`):
 //   .txt    [<ts>] <actor padded to 8> <VERB> :: <tail>
 //   .jsonl  {"ts","actor","phase","verb","tail", …verbatim extra fields}
 //   NOTE    one line from `decisions`, actor `writer`, the last event's ts
@@ -179,6 +179,10 @@ function blockScalar(lines, i, style, parentIndent) {
   return [text, j - 1];
 }
 
+// v2.2.0 T13 — a parse error names the line it could not read (trimmed, ≤ 80 chars).
+const quoteLine = (l) => { const t = String(l).trim(); return JSON.stringify(t.length > 80 ? t.slice(0, 79) + "…" : t); };
+const PACKET_SHAPE_HINT = ' — a packet is YAML or JSON, e.g. {"phase":"entry 1","events":[{"ts":"DDMMYY HH:MM:SS.mmm","verb":"NOTE","tail":"…"}]}';
+
 function parseYaml(text) {
   const lines = text.split("\n");
   const out = {};
@@ -187,7 +191,7 @@ function parseYaml(text) {
     if (line.trim() === "" || line.trim()[0] === "#") continue;
     if (indentOf(line) !== 0) throw new PacketError(`line ${i + 1}: unexpected indentation`);
     const m = KEY_RE.exec(line);
-    if (!m) throw new PacketError(`line ${i + 1}: expected "key: value"`);
+    if (!m) throw new PacketError(`line ${i + 1}: expected "key: value", got ${quoteLine(line)}`);
     const key = m[1];
     const rest = stripComment(m[2] || "").trim();
     if (/^[>|][+-]?$/.test(rest)) {
@@ -250,7 +254,7 @@ function parseYaml(text) {
           }
           if (indentOf(n) <= itemIndent) break;
           const nm = KEY_RE.exec(n.trim());
-          if (!nm) throw new PacketError(`line ${k + 2}: expected "key: value" inside an item`);
+          if (!nm) throw new PacketError(`line ${k + 2}: expected "key: value" inside an item, got ${quoteLine(n)}`);
           k++;
           put(nm[1], nm[2], k);
         }
@@ -267,7 +271,7 @@ function parseYaml(text) {
       if (l.trim() === "" || l.trim()[0] === "#") continue;
       if (indentOf(l) === 0) break;
       const nm = KEY_RE.exec(l.trim());
-      if (!nm) throw new PacketError(`line ${k + 1}: expected "key: value" under ${key}`);
+      if (!nm) throw new PacketError(`line ${k + 1}: expected "key: value" under ${key}, got ${quoteLine(l)}`);
       map[nm[1]] = scalar(nm[2] || "");
     }
     out[key] = map;
@@ -381,7 +385,22 @@ function findingOutcomeError(verb, tail) {
 }
 
 // → { phase, run_meta, events: [{ts, actor, verb, tail, extra}], note } or throws.
-function validatePacket(pk, traceVerbs) {
+// v2.2.0 T13 — `laneVerbs(tokenOrLane)` → this lane's verb heads, or null; `laneHint`
+// is the lane token from the trace file name when the packet has no run_meta.
+function unknownVerbFix(pk, traceVerbs, laneVerbs, laneHint) {
+  const rm = pk && pk.run_meta && typeof pk.run_meta === "object" ? pk.run_meta : null;
+  const lane = (rm && rm.lane) || laneHint || null;
+  const own = lane && typeof laneVerbs === "function" ? laneVerbs(String(lane)) : null;
+  // T13b — PHASE and ASK are packet verbs for every lane, even when the grammar omits them.
+  if (own) {
+    if (!own.includes("PHASE")) own.push("PHASE");
+    if (!own.includes("ASK")) { const ln = String(lane); const name = /^orc(-|$)/.test(ln) ? ln : ln === "ultra" ? "orc" : `orc-${ln}`; own.push(`ASK <qid> (the ids: orc lane phases ${name} --json → ask_ids)`); }
+  }
+  const heads = own || Object.keys(traceVerbs).filter((v) => traceVerbs[v].emitter !== "hook" && traceVerbs[v].emitter !== "cli");
+  return ` — use "PHASE <name> start|end" for a phase, "NOTE" for free text; ${own ? "this lane's verbs" : "the packet verbs"}: ${heads.join(", ")}`;
+}
+
+function validatePacket(pk, traceVerbs, laneVerbs, laneHint) {
   if (!pk || typeof pk !== "object" || Array.isArray(pk)) throw new PacketError("the packet is not a map");
   const errs = [];
   const events = Array.isArray(pk.events) ? pk.events : [];
@@ -395,10 +414,11 @@ function validatePacket(pk, traceVerbs) {
     const word = verb.split(/\s+/)[0];
     if (!word) return errs.push(`${at} has no verb`);
     const d = Object.prototype.hasOwnProperty.call(traceVerbs, word) ? traceVerbs[word] : null;
-    if (!d) return errs.push(`${at}: unknown verb ${word} — not in the CLOSED set (trace-verbs.md)`);
+    if (!d) return errs.push(`${at}: unknown verb ${word} — not in the CLOSED set (trace-verbs.md)${unknownVerbFix(pk, traceVerbs, laneVerbs, laneHint)}`);
     if (d.emitter === "hook") return errs.push(`${at}: ${word} is written by the hook, never by a packet`);
-    // v2.1.0 W6 — `FIX` is written by `orc fix record` itself.
-    if (d.emitter === "cli") return errs.push(`${at}: ${word} is written by the CLI (\`orc fix record\`), never by a packet`);
+    // v2.1.0 W6 — `FIX` is written by `orc fix record` itself; v2.1.2 F11 —
+    // `WAIT` by `orc wait`. The verb's owner file says which command.
+    if (d.emitter === "cli") return errs.push(`${at}: ${word} is written by the CLI itself (see ${d.owner}), never by a packet`);
     const ts = e.ts == null ? "" : String(e.ts).trim();
     if (!TS_RE.test(ts)) errs.push(`${at} (${word}): ts "${ts}" is not DDMMYY HH:MM:SS.mmm — the event's REAL time, never "now"`);
     const actor = e.actor == null || e.actor === "" ? "orc" : String(e.actor).trim();
@@ -727,11 +747,20 @@ function traceCmd(deps) {
     return fail(1, "unreadable", `cannot read the packet (${e.code || e.message})`);
   }
   let v;
+  let laneHint = null;
+  try {
+    const ld0 = deps.resolveLogDir(deps.resolveClaudeDir());
+    const cur0 = fs.readFileSync(path.join(ld0, ".current"), "utf8").trim();
+    laneHint = (/(?:^|[\/])run-([a-z0-9]+)-/.exec(cur0) || [])[1] || null;
+  } catch (_) {}
   try {
-    v = validatePacket(parsePacket(text), deps.TRACE_VERBS);
+    const pk0 = parsePacket(text);
+    if (!laneHint && pk0 && typeof pk0.run === "string") laneHint = (/(?:^|[\/])run-([a-z0-9]+)-/.exec(pk0.run) || [])[1] || null;
+    v = validatePacket(pk0, deps.TRACE_VERBS, deps.laneVerbsFor, laneHint);
   } catch (e) {
     if (!(e instanceof PacketError)) throw e;
-    return fail(2, "invalid", `${e.message} — nothing written`, { errors: e.errors || [e.message] });
+    const hint = /expected "key: value"|not valid JSON|unexpected indentation/.test(e.message) ? PACKET_SHAPE_HINT : "";
+    return fail(2, "invalid", `${e.message} — nothing written${hint}`, { errors: e.errors || [e.message] });
   }
   // An ASK is checked against the habit registry AS IT ARRIVES (eval E2): a live lane
   // wrote its own option names and extra text, and the habit engine then counted