@bastani/atomic 0.9.11-alpha.1 → 0.9.11-alpha.11

package/dist/core/compaction/deleted-ranges.js.map

@@ -1 +1 @@
-{"version":3,"file":"deleted-ranges.js","sourceRoot":"","sources":["../../../src/core/compaction/deleted-ranges.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAE/D,SAAS,cAAc,CAAC,KAAkC;IACzD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7B,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACjE,CAAC;AAED,SAAS,WAAW,CAAC,MAAmB;IACvC,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,OAAO,IAAI,KAAK,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,GAAG,CAAC;YAAE,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;;YACzF,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAgB,EAAE,cAAmC;IAClF,MAAM,SAAS,GAAgB,EAAE,CAAC;IAClC,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IACxB,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;QACxD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACxC,IAAI,KAAK,GAAG,IAAI;YAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3D,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,KAAK,IAAI,KAAK,CAAC,GAAG;QAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;IAClE,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,qBAAqB,CAAC,GAAmB,EAAE,MAAsB;IAChF,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;IACvC,MAAM,UAAU,GAAgB,EAAE,CAAC;IACnC,KAAK,MAAM,SAAS,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,KAAK,GAAG,cAAc,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,GAAG,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QACvD,IAAI,KAAK,GAAG,GAAG;YAAE,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC3B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,KAAK,IAAI,GAAG;YAAE,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IACnD,CAAC;IACD,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAEnF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,oBAAoB,IAAI,EAAE,CAAC,CAAC;IAClE,MAAM,KAAK,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC;IACtG,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,iBAA0B,EAAE,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,oBAAoB,CAAC,MAAuB,EAAE,SAAiB;IACvE,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;IAC/D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE;YAAE,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IAClF,CAAC;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAsB,EAAE,MAAuB;IAC3E,MAAM,OAAO,GAAG,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QAChB,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;YACtD,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;YAC7B,IAAI,OAAO,CAAC,KAAK,CAAC;gBAAE,SAAS;YAC7B,MAAM,eAAe,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC1E,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACvF,IAAI,eAAe,IAAI,WAAW,EAAE,CAAC;gBACpC,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;gBACtB,OAAO,GAAG,IAAI,CAAC;YAChB,CAAC;QACF,CAAC;IACF,CAAC;IAED,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,IAAI,KAAyB,CAAC;IAC9B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACtD,4EAA4E;QAC5E,oEAAoE;QACpE,MAAM,SAAS,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC7E,IAAI,SAAS,IAAI,KAAK,KAAK,SAAS;YAAE,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;QACxD,IAAI,CAAC,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;YACnC,KAAK,GAAG,SAAS,CAAC;QACnB,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,sBAAsB,CAAC,MAAsB,EAAE,KAAgB;IACvE,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IACxC,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;QACxD,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,UAAU,KAAK,SAAS;YAAE,KAAK,IAAI,UAAU,GAAG,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,8BAA8B,CAC7C,MAAsB,EACtB,MAAuB;IAEvB,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QACjC,OAAO,IAAI,GAAG,KAAK,CAAC,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAsB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM;QAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAE1E,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAClG,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,MAAM,gBAAgB,GACrB,MAAM,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACnG,OAAO;QACN,IAAI;QACJ,MAAM,EAAE,WAAW;QACnB,KAAK,EAAE;YACN,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;YAChC,YAAY;YACZ,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,YAAY;YAC7C,UAAU,EAAE,WAAW,CAAC,MAAM;YAC9B,YAAY,EAAE,MAAM,CAAC,aAAa;YAClC,WAAW;YACX,gBAAgB;SAChB;KACD,CAAC;AACH,CAAC","sourcesContent":["import type {\n\tCompactedTranscript,\n\tLineRange,\n\tNumberedRegion,\n\tRawLineEndpoint,\n\tRawLineRange,\n\tValidatedRanges,\n} from \"./compaction-types.js\";\nimport { filteredMarker } from \"./transcript-serialization.js\";\n\nfunction coerceEndpoint(value: RawLineEndpoint | undefined): number | undefined {\n\tif (value === undefined) return undefined;\n\tconst number = Number(value);\n\treturn Number.isFinite(number) ? Math.trunc(number) : undefined;\n}\n\nfunction mergeRanges(ranges: LineRange[]): LineRange[] {\n\tconst merged: LineRange[] = [];\n\tfor (const range of ranges) {\n\t\tconst current = merged[merged.length - 1];\n\t\tif (current && range.start <= current.end + 1) current.end = Math.max(current.end, range.end);\n\t\telse merged.push({ ...range });\n\t}\n\treturn merged;\n}\n\nfunction splitAroundProtected(range: LineRange, protectedLines: ReadonlySet<number>): LineRange[] {\n\tconst fragments: LineRange[] = [];\n\tlet start = range.start;\n\tfor (let line = range.start; line <= range.end; line++) {\n\t\tif (!protectedLines.has(line)) continue;\n\t\tif (start < line) fragments.push({ start, end: line - 1 });\n\t\tstart = line + 1;\n\t}\n\tif (start <= range.end) fragments.push({ start, end: range.end });\n\treturn fragments;\n}\n\n/** Normalize untrusted model ranges into the sole range type accepted by reconstruction. */\nexport function validateDeletedRanges(raw: RawLineRange[], region: NumberedRegion): ValidatedRanges {\n\tconst totalLines = region.lines.length;\n\tconst normalized: LineRange[] = [];\n\tfor (const candidate of raw) {\n\t\tlet start = coerceEndpoint(candidate.start);\n\t\tlet end = coerceEndpoint(candidate.end);\n\t\tif (start === undefined || end === undefined) continue;\n\t\tif (start > end) [start, end] = [end, start];\n\t\tstart = Math.max(1, start);\n\t\tend = Math.min(totalLines, end);\n\t\tif (start <= end) normalized.push({ start, end });\n\t}\n\tnormalized.sort((left, right) => left.start - right.start || left.end - right.end);\n\n\tconst protectedLines = new Set(region.protectedLineNumbers ?? []);\n\tconst split = mergeRanges(normalized).flatMap((range) => splitAroundProtected(range, protectedLines));\n\treturn Object.assign(split, { __brand: \"ValidatedRanges\" as const });\n}\n\nfunction rangesToDeletedLines(ranges: ValidatedRanges, lineCount: number): boolean[] {\n\tconst deleted = Array.from({ length: lineCount }, () => false);\n\tfor (const range of ranges) {\n\t\tfor (let line = range.start; line <= range.end; line++) deleted[line - 1] = true;\n\t}\n\treturn deleted;\n}\n\nfunction foldAdjacentMarkers(region: NumberedRegion, ranges: ValidatedRanges): LineRange[] {\n\tconst deleted = rangesToDeletedLines(ranges, region.lines.length);\n\tlet changed = true;\n\twhile (changed) {\n\t\tchanged = false;\n\t\tfor (const lineNumber of region.priorMarkerNs.keys()) {\n\t\t\tconst index = lineNumber - 1;\n\t\t\tif (deleted[index]) continue;\n\t\t\tconst previousDeleted = index > 0 ? (deleted[index - 1] ?? false) : false;\n\t\t\tconst nextDeleted = index + 1 < deleted.length ? (deleted[index + 1] ?? false) : false;\n\t\t\tif (previousDeleted || nextDeleted) {\n\t\t\t\tdeleted[index] = true;\n\t\t\t\tchanged = true;\n\t\t\t}\n\t\t}\n\t}\n\n\tconst folded: LineRange[] = [];\n\tlet start: number | undefined;\n\tfor (let index = 0; index <= deleted.length; index++) {\n\t\t// Sentinel iteration at index === deleted.length: treat as not deleted so a\n\t\t// trailing open range closes without reading past the array bounds.\n\t\tconst isDeleted = index < deleted.length ? (deleted[index] ?? false) : false;\n\t\tif (isDeleted && start === undefined) start = index + 1;\n\t\tif (!isDeleted && start !== undefined) {\n\t\t\tfolded.push({ start, end: index });\n\t\t\tstart = undefined;\n\t\t}\n\t}\n\treturn folded;\n}\n\nfunction cumulativeDeletedCount(region: NumberedRegion, range: LineRange): number {\n\tlet count = range.end - range.start + 1;\n\tfor (let line = range.start; line <= range.end; line++) {\n\t\tconst priorCount = region.priorMarkerNs.get(line);\n\t\tif (priorCount !== undefined) count += priorCount - 1;\n\t}\n\treturn count;\n}\n\n/** Rebuild a compacted transcript mechanically from validated ranges. */\nexport function reconstructCompactedTranscript(\n\tregion: NumberedRegion,\n\tranges: ValidatedRanges,\n): CompactedTranscript {\n\tconst finalRanges = foldAdjacentMarkers(region, ranges);\n\tconst output: string[] = [];\n\tlet line = 1;\n\tfor (const range of finalRanges) {\n\t\twhile (line < range.start) output.push(region.lines[line++ - 1]);\n\t\toutput.push(filteredMarker(cumulativeDeletedCount(region, range)));\n\t\tline = range.end + 1;\n\t}\n\twhile (line <= region.lines.length) output.push(region.lines[line++ - 1]);\n\n\tconst text = output.join(\"\\n\");\n\tconst linesDeleted = finalRanges.reduce((total, range) => total + range.end - range.start + 1, 0);\n\tconst tokensAfter = Math.ceil(text.length / 4);\n\tconst percentReduction =\n\t\tregion.tokenEstimate === 0 ? 0 : Math.round((1 - tokensAfter / region.tokenEstimate) * 1000) / 10;\n\treturn {\n\t\ttext,\n\t\tranges: finalRanges,\n\t\tstats: {\n\t\t\tlinesBefore: region.lines.length,\n\t\t\tlinesDeleted,\n\t\t\tlinesKept: region.lines.length - linesDeleted,\n\t\t\trangeCount: finalRanges.length,\n\t\t\ttokensBefore: region.tokenEstimate,\n\t\t\ttokensAfter,\n\t\t\tpercentReduction,\n\t\t},\n\t};\n}\n"]}
+{"version":3,"file":"deleted-ranges.js","sourceRoot":"","sources":["../../../src/core/compaction/deleted-ranges.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAE/D,SAAS,cAAc,CAAC,KAAkC;IACzD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7B,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACjE,CAAC;AAED,SAAS,WAAW,CAAC,MAAmB;IACvC,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,OAAO,IAAI,KAAK,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,GAAG,CAAC;YAAE,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;;YACzF,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAgB,EAAE,cAAmC;IAClF,MAAM,SAAS,GAAgB,EAAE,CAAC;IAClC,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IACxB,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;QACxD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACxC,IAAI,KAAK,GAAG,IAAI;YAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3D,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,KAAK,IAAI,KAAK,CAAC,GAAG;QAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;IAClE,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,qBAAqB,CAAC,GAAmB,EAAE,MAAsB;IAChF,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;IACvC,MAAM,UAAU,GAAgB,EAAE,CAAC;IACnC,KAAK,MAAM,SAAS,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,KAAK,GAAG,cAAc,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,GAAG,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QACvD,IAAI,KAAK,GAAG,GAAG;YAAE,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC3B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,KAAK,IAAI,GAAG;YAAE,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IACnD,CAAC;IACD,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAEnF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,oBAAoB,IAAI,EAAE,CAAC,CAAC;IAClE,MAAM,KAAK,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC;IACtG,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,iBAA0B,EAAE,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,oBAAoB,CAAC,MAAuB,EAAE,SAAiB;IACvE,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;IAC/D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE;YAAE,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IAClF,CAAC;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAsB,EAAE,MAAuB;IAC3E,MAAM,OAAO,GAAG,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QAChB,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;YACtD,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;YAC7B,IAAI,OAAO,CAAC,KAAK,CAAC;gBAAE,SAAS;YAC7B,MAAM,eAAe,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC1E,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACvF,IAAI,eAAe,IAAI,WAAW,EAAE,CAAC;gBACpC,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;gBACtB,OAAO,GAAG,IAAI,CAAC;YAChB,CAAC;QACF,CAAC;IACF,CAAC;IAED,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,IAAI,KAAyB,CAAC;IAC9B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACtD,4EAA4E;QAC5E,oEAAoE;QACpE,MAAM,SAAS,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC7E,IAAI,SAAS,IAAI,KAAK,KAAK,SAAS;YAAE,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;QACxD,IAAI,CAAC,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;YACnC,KAAK,GAAG,SAAS,CAAC;QACnB,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,sBAAsB,CAAC,MAAsB,EAAE,KAAgB;IACvE,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IACxC,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;QACxD,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,UAAU,KAAK,SAAS;YAAE,KAAK,IAAI,UAAU,GAAG,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,8BAA8B,CAAC,MAAsB,EAAE,MAAuB;IAC7F,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QACjC,OAAO,IAAI,GAAG,KAAK,CAAC,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAsB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM;QAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAE1E,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAClG,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,MAAM,gBAAgB,GACrB,MAAM,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACnG,OAAO;QACN,IAAI;QACJ,MAAM,EAAE,WAAW;QACnB,KAAK,EAAE;YACN,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;YAChC,YAAY;YACZ,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,YAAY;YAC7C,UAAU,EAAE,WAAW,CAAC,MAAM;YAC9B,YAAY,EAAE,MAAM,CAAC,aAAa;YAClC,WAAW;YACX,gBAAgB;SAChB;KACD,CAAC;AACH,CAAC","sourcesContent":["import type {\n\tCompactedTranscript,\n\tLineRange,\n\tNumberedRegion,\n\tRawLineEndpoint,\n\tRawLineRange,\n\tValidatedRanges,\n} from \"./compaction-types.js\";\nimport { filteredMarker } from \"./transcript-serialization.js\";\n\nfunction coerceEndpoint(value: RawLineEndpoint | undefined): number | undefined {\n\tif (value === undefined) return undefined;\n\tconst number = Number(value);\n\treturn Number.isFinite(number) ? Math.trunc(number) : undefined;\n}\n\nfunction mergeRanges(ranges: LineRange[]): LineRange[] {\n\tconst merged: LineRange[] = [];\n\tfor (const range of ranges) {\n\t\tconst current = merged[merged.length - 1];\n\t\tif (current && range.start <= current.end + 1) current.end = Math.max(current.end, range.end);\n\t\telse merged.push({ ...range });\n\t}\n\treturn merged;\n}\n\nfunction splitAroundProtected(range: LineRange, protectedLines: ReadonlySet<number>): LineRange[] {\n\tconst fragments: LineRange[] = [];\n\tlet start = range.start;\n\tfor (let line = range.start; line <= range.end; line++) {\n\t\tif (!protectedLines.has(line)) continue;\n\t\tif (start < line) fragments.push({ start, end: line - 1 });\n\t\tstart = line + 1;\n\t}\n\tif (start <= range.end) fragments.push({ start, end: range.end });\n\treturn fragments;\n}\n\n/** Normalize untrusted model ranges into the sole range type accepted by reconstruction. */\nexport function validateDeletedRanges(raw: RawLineRange[], region: NumberedRegion): ValidatedRanges {\n\tconst totalLines = region.lines.length;\n\tconst normalized: LineRange[] = [];\n\tfor (const candidate of raw) {\n\t\tlet start = coerceEndpoint(candidate.start);\n\t\tlet end = coerceEndpoint(candidate.end);\n\t\tif (start === undefined || end === undefined) continue;\n\t\tif (start > end) [start, end] = [end, start];\n\t\tstart = Math.max(1, start);\n\t\tend = Math.min(totalLines, end);\n\t\tif (start <= end) normalized.push({ start, end });\n\t}\n\tnormalized.sort((left, right) => left.start - right.start || left.end - right.end);\n\n\tconst protectedLines = new Set(region.protectedLineNumbers ?? []);\n\tconst split = mergeRanges(normalized).flatMap((range) => splitAroundProtected(range, protectedLines));\n\treturn Object.assign(split, { __brand: \"ValidatedRanges\" as const });\n}\n\nfunction rangesToDeletedLines(ranges: ValidatedRanges, lineCount: number): boolean[] {\n\tconst deleted = Array.from({ length: lineCount }, () => false);\n\tfor (const range of ranges) {\n\t\tfor (let line = range.start; line <= range.end; line++) deleted[line - 1] = true;\n\t}\n\treturn deleted;\n}\n\nfunction foldAdjacentMarkers(region: NumberedRegion, ranges: ValidatedRanges): LineRange[] {\n\tconst deleted = rangesToDeletedLines(ranges, region.lines.length);\n\tlet changed = true;\n\twhile (changed) {\n\t\tchanged = false;\n\t\tfor (const lineNumber of region.priorMarkerNs.keys()) {\n\t\t\tconst index = lineNumber - 1;\n\t\t\tif (deleted[index]) continue;\n\t\t\tconst previousDeleted = index > 0 ? (deleted[index - 1] ?? false) : false;\n\t\t\tconst nextDeleted = index + 1 < deleted.length ? (deleted[index + 1] ?? false) : false;\n\t\t\tif (previousDeleted || nextDeleted) {\n\t\t\t\tdeleted[index] = true;\n\t\t\t\tchanged = true;\n\t\t\t}\n\t\t}\n\t}\n\n\tconst folded: LineRange[] = [];\n\tlet start: number | undefined;\n\tfor (let index = 0; index <= deleted.length; index++) {\n\t\t// Sentinel iteration at index === deleted.length: treat as not deleted so a\n\t\t// trailing open range closes without reading past the array bounds.\n\t\tconst isDeleted = index < deleted.length ? (deleted[index] ?? false) : false;\n\t\tif (isDeleted && start === undefined) start = index + 1;\n\t\tif (!isDeleted && start !== undefined) {\n\t\t\tfolded.push({ start, end: index });\n\t\t\tstart = undefined;\n\t\t}\n\t}\n\treturn folded;\n}\n\nfunction cumulativeDeletedCount(region: NumberedRegion, range: LineRange): number {\n\tlet count = range.end - range.start + 1;\n\tfor (let line = range.start; line <= range.end; line++) {\n\t\tconst priorCount = region.priorMarkerNs.get(line);\n\t\tif (priorCount !== undefined) count += priorCount - 1;\n\t}\n\treturn count;\n}\n\n/** Rebuild a compacted transcript mechanically from validated ranges. */\nexport function reconstructCompactedTranscript(region: NumberedRegion, ranges: ValidatedRanges): CompactedTranscript {\n\tconst finalRanges = foldAdjacentMarkers(region, ranges);\n\tconst output: string[] = [];\n\tlet line = 1;\n\tfor (const range of finalRanges) {\n\t\twhile (line < range.start) output.push(region.lines[line++ - 1]);\n\t\toutput.push(filteredMarker(cumulativeDeletedCount(region, range)));\n\t\tline = range.end + 1;\n\t}\n\twhile (line <= region.lines.length) output.push(region.lines[line++ - 1]);\n\n\tconst text = output.join(\"\\n\");\n\tconst linesDeleted = finalRanges.reduce((total, range) => total + range.end - range.start + 1, 0);\n\tconst tokensAfter = Math.ceil(text.length / 4);\n\tconst percentReduction =\n\t\tregion.tokenEstimate === 0 ? 0 : Math.round((1 - tokensAfter / region.tokenEstimate) * 1000) / 10;\n\treturn {\n\t\ttext,\n\t\tranges: finalRanges,\n\t\tstats: {\n\t\t\tlinesBefore: region.lines.length,\n\t\t\tlinesDeleted,\n\t\t\tlinesKept: region.lines.length - linesDeleted,\n\t\t\trangeCount: finalRanges.length,\n\t\t\ttokensBefore: region.tokenEstimate,\n\t\t\ttokensAfter,\n\t\t\tpercentReduction,\n\t\t},\n\t};\n}\n"]}

package/dist/core/compaction/fallback-planner.d.ts

@@ -0,0 +1,64 @@
+/**
+ * Borrow a configured fallback model for one compaction planner request.
+ *
+ * This is deliberately a *weaker* capability than main-chat model fallback. The
+ * borrowing door returns a `BorrowedPlanner` **value**: it holds no session
+ * handle, so it cannot write `agent.state.model`, append a model-change entry,
+ * change the session thinking level, refresh the system prompt, emit
+ * `model_changed`/`model_select`, or call `agent.continue()`.
+ * `_trySwitchToFallbackModel` does all of those and is not reused or modified.
+ *
+ * The attempted-key set belongs to the compaction run and is read-only here, so
+ * borrowing never touches the main chat's `_fallbackAttemptedKeys`.
+ */
+import type { ThinkingLevel } from "@earendil-works/pi-agent-core";
+import type { Api, Model } from "@earendil-works/pi-ai/compat";
+import { type FallbackModelLookup } from "../fallback-models.js";
+import type { BorrowedPlanner, PlannerAuth } from "./compaction-types.js";
+/**
+ * Everything candidate selection needs.
+ *
+ * The RFC's §5.1 signature takes only `attempted` and `resolveAuth`, which
+ * cannot select a candidate on its own: it names no fallback list, no model
+ * registry, no preferred provider, and no inherited reasoning level. Those
+ * inputs travel in this context object rather than through hidden state.
+ */
+export interface FallbackPlannerContext {
+    /** The session's effective `fallbackModels`, in configured order. */
+    readonly fallbackModels: readonly string[];
+    /** Model registry used to resolve and authenticate candidates. */
+    readonly registry: FallbackModelLookup;
+    /** Provider preferred when an unqualified entry is ambiguous. */
+    readonly preferredProvider: string | undefined;
+    /** Session level inherited when a candidate carries no `:level` suffix. */
+    readonly sessionThinkingLevel: ThinkingLevel | undefined;
+}
+/**
+ * Identity of one planner attempt: `provider/model:<effective reasoning>`.
+ *
+ * The key must be derived from the *effective* level the request will carry,
+ * not from the raw optional `model:level` suffix. An unsuffixed entry for the
+ * session model inherits the session level, so keying it as `provider/model:`
+ * would let the identical request run a second time.
+ */
+export declare function plannerAttemptKey(planner: BorrowedPlanner): string;
+/** The exact two-argument borrowing door, bound to one run's configuration. */
+export type BorrowFallbackPlanner = (attempted: ReadonlySet<string>, resolveAuth: (model: Model<Api>) => Promise<PlannerAuth | undefined>) => Promise<BorrowedPlanner | undefined>;
+/**
+ * Build the borrowing door for one compaction run.
+ *
+ * The RFC's top-level two-argument signature names no fallback list, registry,
+ * preferred provider, inherited reasoning level, or traversal cursor, so a
+ * stateless exported function cannot select a candidate without hidden shared
+ * state — unsafe under concurrent compactions. Binding the configuration and the
+ * run-local cursor in a closure keeps the returned door exactly two arguments
+ * while `attempted` stays a `ReadonlySet` the borrower never writes.
+ *
+ * The walk is one monotonic pass. Each list position is inspected at most once,
+ * whether it fails to resolve, has no usable credentials, duplicates an earlier
+ * identity, or yields a planner. Without the cursor, an entry that could not
+ * resolve earlier could be returned after a later candidate once the registry
+ * changed, producing a B→A order the configured list never asked for.
+ */
+export declare function createFallbackPlannerBorrower(context: FallbackPlannerContext): BorrowFallbackPlanner;
+//# sourceMappingURL=fallback-planner.d.ts.map

package/dist/core/compaction/fallback-planner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fallback-planner.d.ts","sourceRoot":"","sources":["../../../src/core/compaction/fallback-planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AACnE,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,KAAK,mBAAmB,EAAqC,MAAM,uBAAuB,CAAC;AACpG,OAAO,KAAK,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAG1E;;;;;;;GAOG;AACH,MAAM,WAAW,sBAAsB;IACtC,qEAAqE;IACrE,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,kEAAkE;IAClE,QAAQ,CAAC,QAAQ,EAAE,mBAAmB,CAAC;IACvC,iEAAiE;IACjE,QAAQ,CAAC,iBAAiB,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/C,2EAA2E;IAC3E,QAAQ,CAAC,oBAAoB,EAAE,aAAa,GAAG,SAAS,CAAC;CACzD;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,eAAe,GAAG,MAAM,CAElE;AAeD,+EAA+E;AAC/E,MAAM,MAAM,qBAAqB,GAAG,CACnC,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,EAC9B,WAAW,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC,KAChE,OAAO,CAAC,eAAe,GAAG,SAAS,CAAC,CAAC;AAE1C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,6BAA6B,CAAC,OAAO,EAAE,sBAAsB,GAAG,qBAAqB,CA6BpG"}

package/dist/core/compaction/fallback-planner.js

@@ -0,0 +1,75 @@
+/**
+ * Borrow a configured fallback model for one compaction planner request.
+ *
+ * This is deliberately a *weaker* capability than main-chat model fallback. The
+ * borrowing door returns a `BorrowedPlanner` **value**: it holds no session
+ * handle, so it cannot write `agent.state.model`, append a model-change entry,
+ * change the session thinking level, refresh the system prompt, emit
+ * `model_changed`/`model_select`, or call `agent.continue()`.
+ * `_trySwitchToFallbackModel` does all of those and is not reused or modified.
+ *
+ * The attempted-key set belongs to the compaction run and is read-only here, so
+ * borrowing never touches the main chat's `_fallbackAttemptedKeys`.
+ */
+import { fallbackKey, resolveFallbackModel } from "../fallback-models.js";
+import { resolvePlannerRequest } from "./range-planner.js";
+/**
+ * Identity of one planner attempt: `provider/model:<effective reasoning>`.
+ *
+ * The key must be derived from the *effective* level the request will carry,
+ * not from the raw optional `model:level` suffix. An unsuffixed entry for the
+ * session model inherits the session level, so keying it as `provider/model:`
+ * would let the identical request run a second time.
+ */
+export function plannerAttemptKey(planner) {
+    return fallbackKey(planner.model, planner.budget.reasoning);
+}
+/**
+ * Build the borrowing door for one compaction run.
+ *
+ * The RFC's top-level two-argument signature names no fallback list, registry,
+ * preferred provider, inherited reasoning level, or traversal cursor, so a
+ * stateless exported function cannot select a candidate without hidden shared
+ * state — unsafe under concurrent compactions. Binding the configuration and the
+ * run-local cursor in a closure keeps the returned door exactly two arguments
+ * while `attempted` stays a `ReadonlySet` the borrower never writes.
+ *
+ * The walk is one monotonic pass. Each list position is inspected at most once,
+ * whether it fails to resolve, has no usable credentials, duplicates an earlier
+ * identity, or yields a planner. Without the cursor, an entry that could not
+ * resolve earlier could be returned after a later candidate once the registry
+ * changed, producing a B→A order the configured list never asked for.
+ */
+export function createFallbackPlannerBorrower(context) {
+    const walk = { nextIndex: 0, consumed: new Set() };
+    return async (attempted, resolveAuth) => {
+        while (walk.nextIndex < context.fallbackModels.length) {
+            const entry = context.fallbackModels[walk.nextIndex];
+            // Advance before any work: this list position is spent either way.
+            walk.nextIndex += 1;
+            const candidate = resolveFallbackModel(entry, context.registry, context.preferredProvider);
+            if (!candidate)
+                continue;
+            // Resolve the budget first: the identity depends on the effective
+            // reasoning level, which inheritance may supply.
+            const budget = resolvePlannerRequest(candidate.model, context.sessionThinkingLevel, candidate.thinkingLevel);
+            const key = fallbackKey(candidate.model, budget.reasoning);
+            if (attempted.has(key) || walk.consumed.has(key))
+                continue;
+            walk.consumed.add(key);
+            let auth;
+            try {
+                auth = await resolveAuth(candidate.model);
+            }
+            catch {
+                // A candidate whose credentials cannot be resolved is simply unusable.
+                auth = undefined;
+            }
+            if (!auth)
+                continue;
+            return { model: candidate.model, budget, auth };
+        }
+        return undefined;
+    };
+}
+//# sourceMappingURL=fallback-planner.js.map

package/dist/core/compaction/fallback-planner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fallback-planner.js","sourceRoot":"","sources":["../../../src/core/compaction/fallback-planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAA4B,WAAW,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAEpG,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAqB3D;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAwB;IACzD,OAAO,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;AAC7D,CAAC;AAqBD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,6BAA6B,CAAC,OAA+B;IAC5E,MAAM,IAAI,GAAwB,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAU,EAAE,CAAC;IAChF,OAAO,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE;QACvC,OAAO,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC;YACvD,MAAM,KAAK,GAAG,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrD,mEAAmE;YACnE,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;YAEpB,MAAM,SAAS,GAAG,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,iBAAiB,CAAC,CAAC;YAC3F,IAAI,CAAC,SAAS;gBAAE,SAAS;YACzB,kEAAkE;YAClE,iDAAiD;YACjD,MAAM,MAAM,GAAG,qBAAqB,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,oBAAoB,EAAE,SAAS,CAAC,aAAa,CAAC,CAAC;YAC7G,MAAM,GAAG,GAAG,WAAW,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;YAC3D,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC3D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEvB,IAAI,IAA6B,CAAC;YAClC,IAAI,CAAC;gBACJ,IAAI,GAAG,MAAM,WAAW,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC3C,CAAC;YAAC,MAAM,CAAC;gBACR,uEAAuE;gBACvE,IAAI,GAAG,SAAS,CAAC;YAClB,CAAC;YACD,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QACjD,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC,CAAC;AACH,CAAC","sourcesContent":["/**\n * Borrow a configured fallback model for one compaction planner request.\n *\n * This is deliberately a *weaker* capability than main-chat model fallback. The\n * borrowing door returns a `BorrowedPlanner` **value**: it holds no session\n * handle, so it cannot write `agent.state.model`, append a model-change entry,\n * change the session thinking level, refresh the system prompt, emit\n * `model_changed`/`model_select`, or call `agent.continue()`.\n * `_trySwitchToFallbackModel` does all of those and is not reused or modified.\n *\n * The attempted-key set belongs to the compaction run and is read-only here, so\n * borrowing never touches the main chat's `_fallbackAttemptedKeys`.\n */\n\nimport type { ThinkingLevel } from \"@earendil-works/pi-agent-core\";\nimport type { Api, Model } from \"@earendil-works/pi-ai/compat\";\nimport { type FallbackModelLookup, fallbackKey, resolveFallbackModel } from \"../fallback-models.js\";\nimport type { BorrowedPlanner, PlannerAuth } from \"./compaction-types.js\";\nimport { resolvePlannerRequest } from \"./range-planner.js\";\n\n/**\n * Everything candidate selection needs.\n *\n * The RFC's §5.1 signature takes only `attempted` and `resolveAuth`, which\n * cannot select a candidate on its own: it names no fallback list, no model\n * registry, no preferred provider, and no inherited reasoning level. Those\n * inputs travel in this context object rather than through hidden state.\n */\nexport interface FallbackPlannerContext {\n\t/** The session's effective `fallbackModels`, in configured order. */\n\treadonly fallbackModels: readonly string[];\n\t/** Model registry used to resolve and authenticate candidates. */\n\treadonly registry: FallbackModelLookup;\n\t/** Provider preferred when an unqualified entry is ambiguous. */\n\treadonly preferredProvider: string | undefined;\n\t/** Session level inherited when a candidate carries no `:level` suffix. */\n\treadonly sessionThinkingLevel: ThinkingLevel | undefined;\n}\n\n/**\n * Identity of one planner attempt: `provider/model:<effective reasoning>`.\n *\n * The key must be derived from the *effective* level the request will carry,\n * not from the raw optional `model:level` suffix. An unsuffixed entry for the\n * session model inherits the session level, so keying it as `provider/model:`\n * would let the identical request run a second time.\n */\nexport function plannerAttemptKey(planner: BorrowedPlanner): string {\n\treturn fallbackKey(planner.model, planner.budget.reasoning);\n}\n\n/**\n * Run-local traversal state for one compaction's fallback walk.\n *\n * Kept out of the borrower's arguments and out of module scope: concurrent\n * compactions each own one of these, so nothing is shared.\n */\ninterface FallbackPlannerWalk {\n\t/** Next configured list position to inspect. Only ever advances. */\n\tnextIndex: number;\n\t/** Effective `provider/model:level` identities already inspected this run. */\n\tconsumed: Set<string>;\n}\n\n/** The exact two-argument borrowing door, bound to one run's configuration. */\nexport type BorrowFallbackPlanner = (\n\tattempted: ReadonlySet<string>,\n\tresolveAuth: (model: Model<Api>) => Promise<PlannerAuth | undefined>,\n) => Promise<BorrowedPlanner | undefined>;\n\n/**\n * Build the borrowing door for one compaction run.\n *\n * The RFC's top-level two-argument signature names no fallback list, registry,\n * preferred provider, inherited reasoning level, or traversal cursor, so a\n * stateless exported function cannot select a candidate without hidden shared\n * state — unsafe under concurrent compactions. Binding the configuration and the\n * run-local cursor in a closure keeps the returned door exactly two arguments\n * while `attempted` stays a `ReadonlySet` the borrower never writes.\n *\n * The walk is one monotonic pass. Each list position is inspected at most once,\n * whether it fails to resolve, has no usable credentials, duplicates an earlier\n * identity, or yields a planner. Without the cursor, an entry that could not\n * resolve earlier could be returned after a later candidate once the registry\n * changed, producing a B→A order the configured list never asked for.\n */\nexport function createFallbackPlannerBorrower(context: FallbackPlannerContext): BorrowFallbackPlanner {\n\tconst walk: FallbackPlannerWalk = { nextIndex: 0, consumed: new Set<string>() };\n\treturn async (attempted, resolveAuth) => {\n\t\twhile (walk.nextIndex < context.fallbackModels.length) {\n\t\t\tconst entry = context.fallbackModels[walk.nextIndex];\n\t\t\t// Advance before any work: this list position is spent either way.\n\t\t\twalk.nextIndex += 1;\n\n\t\t\tconst candidate = resolveFallbackModel(entry, context.registry, context.preferredProvider);\n\t\t\tif (!candidate) continue;\n\t\t\t// Resolve the budget first: the identity depends on the effective\n\t\t\t// reasoning level, which inheritance may supply.\n\t\t\tconst budget = resolvePlannerRequest(candidate.model, context.sessionThinkingLevel, candidate.thinkingLevel);\n\t\t\tconst key = fallbackKey(candidate.model, budget.reasoning);\n\t\t\tif (attempted.has(key) || walk.consumed.has(key)) continue;\n\t\t\twalk.consumed.add(key);\n\n\t\t\tlet auth: PlannerAuth | undefined;\n\t\t\ttry {\n\t\t\t\tauth = await resolveAuth(candidate.model);\n\t\t\t} catch {\n\t\t\t\t// A candidate whose credentials cannot be resolved is simply unusable.\n\t\t\t\tauth = undefined;\n\t\t\t}\n\t\t\tif (!auth) continue;\n\t\t\treturn { model: candidate.model, budget, auth };\n\t\t}\n\t\treturn undefined;\n\t};\n}\n"]}

package/dist/core/compaction/index.d.ts

@@ -3,13 +3,16 @@
  */
 export * from "./branch-summarization.ts";
 export * from "./compaction.ts";
-export * from "./compaction-types.js";
-export * from "./compaction-parameters.js";
 export * from "./compaction-boundary.js";
-export * from "./range-planner.js";
-export * from "./range-planner-diagnostics.js";
+export * from "./compaction-parameters.js";
 export * from "./compaction-runner.js";
+export * from "./compaction-types.js";
 export * from "./deleted-ranges.js";
+export * from "./fallback-planner.js";
+export * from "./planner-outcome.js";
+export * from "./range-planner.js";
+export * from "./range-planner-diagnostics.js";
+export * from "./region-trimming.js";
 export * from "./transcript-serialization.js";
 export * from "./utils.ts";
 //# sourceMappingURL=index.d.ts.map

package/dist/core/compaction/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/compaction/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,2BAA2B,CAAC;AAC1C,cAAc,iBAAiB,CAAC;AAChC,cAAc,uBAAuB,CAAC;AACtC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,0BAA0B,CAAC;AACzC,cAAc,oBAAoB,CAAC;AACnC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,wBAAwB,CAAC;AACvC,cAAc,qBAAqB,CAAC;AACpC,cAAc,+BAA+B,CAAC;AAC9C,cAAc,YAAY,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/compaction/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,2BAA2B,CAAC;AAC1C,cAAc,iBAAiB,CAAC;AAChC,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,wBAAwB,CAAC;AACvC,cAAc,uBAAuB,CAAC;AACtC,cAAc,qBAAqB,CAAC;AACpC,cAAc,uBAAuB,CAAC;AACtC,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC;AACnC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,sBAAsB,CAAC;AACrC,cAAc,+BAA+B,CAAC;AAC9C,cAAc,YAAY,CAAC"}

package/dist/core/compaction/index.js

@@ -3,13 +3,16 @@
  */
 export * from "./branch-summarization.js";
 export * from "./compaction.js";
-export * from "./compaction-types.js";
-export * from "./compaction-parameters.js";
 export * from "./compaction-boundary.js";
-export * from "./range-planner.js";
-export * from "./range-planner-diagnostics.js";
+export * from "./compaction-parameters.js";
 export * from "./compaction-runner.js";
+export * from "./compaction-types.js";
 export * from "./deleted-ranges.js";
+export * from "./fallback-planner.js";
+export * from "./planner-outcome.js";
+export * from "./range-planner.js";
+export * from "./range-planner-diagnostics.js";
+export * from "./region-trimming.js";
 export * from "./transcript-serialization.js";
 export * from "./utils.js";
 //# sourceMappingURL=index.js.map

package/dist/core/compaction/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/compaction/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,2BAA2B,CAAC;AAC1C,cAAc,iBAAiB,CAAC;AAChC,cAAc,uBAAuB,CAAC;AACtC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,0BAA0B,CAAC;AACzC,cAAc,oBAAoB,CAAC;AACnC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,wBAAwB,CAAC;AACvC,cAAc,qBAAqB,CAAC;AACpC,cAAc,+BAA+B,CAAC;AAC9C,cAAc,YAAY,CAAC","sourcesContent":["/**\n * Compaction support utilities.\n */\n\nexport * from \"./branch-summarization.ts\";\nexport * from \"./compaction.ts\";\nexport * from \"./compaction-types.js\";\nexport * from \"./compaction-parameters.js\";\nexport * from \"./compaction-boundary.js\";\nexport * from \"./range-planner.js\";\nexport * from \"./range-planner-diagnostics.js\";\nexport * from \"./compaction-runner.js\";\nexport * from \"./deleted-ranges.js\";\nexport * from \"./transcript-serialization.js\";\nexport * from \"./utils.ts\";\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/compaction/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,2BAA2B,CAAC;AAC1C,cAAc,iBAAiB,CAAC;AAChC,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,wBAAwB,CAAC;AACvC,cAAc,uBAAuB,CAAC;AACtC,cAAc,qBAAqB,CAAC;AACpC,cAAc,uBAAuB,CAAC;AACtC,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC;AACnC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,sBAAsB,CAAC;AACrC,cAAc,+BAA+B,CAAC;AAC9C,cAAc,YAAY,CAAC","sourcesContent":["/**\n * Compaction support utilities.\n */\n\nexport * from \"./branch-summarization.ts\";\nexport * from \"./compaction.ts\";\nexport * from \"./compaction-boundary.js\";\nexport * from \"./compaction-parameters.js\";\nexport * from \"./compaction-runner.js\";\nexport * from \"./compaction-types.js\";\nexport * from \"./deleted-ranges.js\";\nexport * from \"./fallback-planner.js\";\nexport * from \"./planner-outcome.js\";\nexport * from \"./range-planner.js\";\nexport * from \"./range-planner-diagnostics.js\";\nexport * from \"./region-trimming.js\";\nexport * from \"./transcript-serialization.js\";\nexport * from \"./utils.ts\";\n"]}

package/dist/core/compaction/planner-outcome.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Typed outcomes for one compaction planner attempt.
+ *
+ * `planDeletedLineRanges` used to collapse ranked success, silent partial
+ * recovery, reasoning starvation, rate limiting, malformed output, and context
+ * overflow into "ranges or throw". Callers could not tell a throttle from
+ * garbage without string-matching an error message. This module makes each
+ * outcome a distinct value so the rung ladder, the `0600` diagnostic sidecar,
+ * and the UI can separate them.
+ *
+ * Cancellation is deliberately NOT a variant: an abort still throws.
+ */
+import type { Api, AssistantMessage } from "@earendil-works/pi-ai/compat";
+import type { RawLineRange } from "./compaction-types.js";
+import type { DiagnosticFailureCategory } from "./range-planner-diagnostics.js";
+/** Which limit a `rateLimited` outcome represents. */
+export type PlannerLimitClass = "quota" | "rate_limited";
+/** Every way one planner attempt can end. */
+export type PlannerOutcome = {
+    kind: "ranked";
+    ranges: RawLineRange[];
+} | {
+    kind: "recovered";
+    ranges: RawLineRange[];
+    recoveredCount: number;
+} | {
+    kind: "rateLimited";
+    /**
+     * Which limit this was, independent of retry activity. Quota/billing
+     * exhaustion and transient throttling are different facts and must stay
+     * separable in code and diagnostics; `exhausted` records only whether a
+     * retry was actually scheduled, which cannot tell them apart when retry
+     * is disabled.
+     */
+    category: PlannerLimitClass;
+    exhausted: boolean;
+    message: string;
+    diagnosticPath?: string;
+} | {
+    kind: "unusable";
+    category: DiagnosticFailureCategory;
+    excerpt: string;
+    diagnosticPath?: string;
+} | {
+    kind: "overflowed";
+    diagnosticPath?: string;
+} | {
+    kind: "providerError";
+    message: string;
+    diagnosticPath?: string;
+};
+/** A planner outcome that cannot produce a boundary and must advance the ladder. */
+export type TerminalPlannerOutcome = Extract<PlannerOutcome, {
+    kind: "rateLimited" | "unusable" | "overflowed" | "providerError";
+}>;
+/** Whether this outcome produced validated deletion ranges. */
+export declare function isPlannerSuccess(outcome: PlannerOutcome): outcome is Extract<PlannerOutcome, {
+    kind: "ranked" | "recovered";
+}>;
+/** How a failed planner response is classified before an outcome is built. */
+export type PlannerFailureClass = "overflow" | "quota" | "rate_limited" | "provider_error";
+/**
+ * Classify one failed planner response.
+ *
+ * Context overflow wins first because pi-ai's `isContextOverflow` already
+ * excludes rate/throttle text, and overflow is recoverable by trimming.
+ * Quota/billing exhaustion then wins over transient throttling, matching pi-ai's
+ * own precedence.
+ */
+export declare function classifyPlannerFailure(response: AssistantMessage, contextWindow: number): PlannerFailureClass;
+/** Build a synthetic error response so a thrown transport failure classifies identically. */
+export declare function syntheticErrorResponse(model: {
+    api: Api;
+    provider: string;
+    id: string;
+}, errorMessage: string): AssistantMessage;
+/**
+ * Reasoning starvation fingerprint: the response stopped at the output limit,
+ * produced no usable deletion record, and billed reasoning tokens.
+ *
+ * This is a diagnostic category only. Codex has no starvation concept and never
+ * retries one; neither does Atomic. A starved outcome advances the ladder
+ * exactly like any other `unusable` output.
+ */
+export declare function isReasoningStarved(response: AssistantMessage, hasUsableRanges: boolean): boolean;
+//# sourceMappingURL=planner-outcome.d.ts.map

package/dist/core/compaction/planner-outcome.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-outcome.d.ts","sourceRoot":"","sources":["../../../src/core/compaction/planner-outcome.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAE1E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AAEhF,sDAAsD;AACtD,MAAM,MAAM,iBAAiB,GAAG,OAAO,GAAG,cAAc,CAAC;AAEzD,6CAA6C;AAC7C,MAAM,MAAM,cAAc,GACvB;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,YAAY,EAAE,CAAA;CAAE,GAC1C;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,YAAY,EAAE,CAAC;IAAC,cAAc,EAAE,MAAM,CAAA;CAAE,GACrE;IACA,IAAI,EAAE,aAAa,CAAC;IACpB;;;;;;OAMG;IACH,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,SAAS,EAAE,OAAO,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,CAAC,EAAE,MAAM,CAAC;CACvB,GACD;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,EAAE,yBAAyB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,GACnG;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,GAC/C;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AAEvE,oFAAoF;AACpF,MAAM,MAAM,sBAAsB,GAAG,OAAO,CAC3C,cAAc,EACd;IAAE,IAAI,EAAE,aAAa,GAAG,UAAU,GAAG,YAAY,GAAG,eAAe,CAAA;CAAE,CACrE,CAAC;AAEF,+DAA+D;AAC/D,wBAAgB,gBAAgB,CAC/B,OAAO,EAAE,cAAc,GACrB,OAAO,IAAI,OAAO,CAAC,cAAc,EAAE;IAAE,IAAI,EAAE,QAAQ,GAAG,WAAW,CAAA;CAAE,CAAC,CAEtE;AA6DD,8EAA8E;AAC9E,MAAM,MAAM,mBAAmB,GAAG,UAAU,GAAG,OAAO,GAAG,cAAc,GAAG,gBAAgB,CAAC;AAE3F;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,GAAG,mBAAmB,CAM7G;AAED,6FAA6F;AAC7F,wBAAgB,sBAAsB,CACrC,KAAK,EAAE;IAAE,GAAG,EAAE,GAAG,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,EACjD,YAAY,EAAE,MAAM,GAClB,gBAAgB,CAmBlB;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,eAAe,EAAE,OAAO,GAAG,OAAO,CAEhG"}

package/dist/core/compaction/planner-outcome.js

@@ -0,0 +1,122 @@
+/**
+ * Typed outcomes for one compaction planner attempt.
+ *
+ * `planDeletedLineRanges` used to collapse ranked success, silent partial
+ * recovery, reasoning starvation, rate limiting, malformed output, and context
+ * overflow into "ranges or throw". Callers could not tell a throttle from
+ * garbage without string-matching an error message. This module makes each
+ * outcome a distinct value so the rung ladder, the `0600` diagnostic sidecar,
+ * and the UI can separate them.
+ *
+ * Cancellation is deliberately NOT a variant: an abort still throws.
+ */
+import { isContextOverflow } from "@earendil-works/pi-ai/compat";
+/** Whether this outcome produced validated deletion ranges. */
+export function isPlannerSuccess(outcome) {
+    return outcome.kind === "ranked" || outcome.kind === "recovered";
+}
+function buildProviderErrorPattern(patterns) {
+    return new RegExp(patterns.join("|"), "i");
+}
+/**
+ * Quota/billing exhaustion. Mirrors pi-ai's
+ * `NON_RETRYABLE_PROVIDER_LIMIT_ERROR_PATTERN` (`utils/retry.js`), which takes
+ * precedence over the transient patterns and never spends backoff.
+ */
+const QUOTA_EXHAUSTED_PATTERN = buildProviderErrorPattern([
+    "GoUsageLimitError",
+    "FreeUsageLimitError",
+    "Monthly usage limit reached",
+    "available balance",
+    "insufficient_quota",
+    "out of budget",
+    "quota exceeded",
+    "billing",
+]);
+/**
+ * Generic usage-limit wording, e.g. Codex's "The usage limit has been reached".
+ *
+ * This is a deliberate **local addition**, not a mirror: pi-ai lists it in
+ * neither its non-retryable nor its retryable pattern, so `retryAssistantCall`
+ * never schedules a backoff for it. Classifying it as transient throttling would
+ * report `exhausted: true` for a retry budget that was never spent, so Atomic
+ * treats it as quota exhaustion (`exhausted: false`). pi-ai's own
+ * `Monthly usage limit reached` entry above already covers the specific form.
+ */
+const LOCAL_USAGE_LIMIT_PATTERN = /usage.?limit/i;
+/**
+ * Transient throttling and provider-load failures. This is the rate-limit
+ * subset of pi-ai's `RETRYABLE_PROVIDER_ERROR_PATTERN`, minus the individual
+ * status codes, which `HTTP_5XX_PATTERN` generalizes below.
+ */
+const RATE_LIMITED_PATTERN = buildProviderErrorPattern([
+    "overloaded",
+    "rate.?limit",
+    "too many requests",
+    "429",
+    "service.?unavailable",
+    "server.?error",
+    "internal.?error",
+    "ResourceExhausted",
+]);
+/**
+ * The whole HTTP 5xx class, bounded so it cannot match inside a longer number.
+ *
+ * A deliberate local broadening: the RFC and the acceptance contract enumerate
+ * `5xx`, while pi-ai lists only 500/502/503/504/524, so a `501` would otherwise
+ * fall through to `providerError`. The consequence is that pi-ai may schedule no
+ * backoff for a status Atomic types as rate limiting — which is exactly why
+ * `exhausted` reports *observed* retry activity rather than assuming it.
+ */
+const HTTP_5XX_PATTERN = /(?<![\d.])5\d\d(?![\d.])/;
+/**
+ * Classify one failed planner response.
+ *
+ * Context overflow wins first because pi-ai's `isContextOverflow` already
+ * excludes rate/throttle text, and overflow is recoverable by trimming.
+ * Quota/billing exhaustion then wins over transient throttling, matching pi-ai's
+ * own precedence.
+ */
+export function classifyPlannerFailure(response, contextWindow) {
+    if (isContextOverflow(response, contextWindow))
+        return "overflow";
+    const message = response.errorMessage ?? "";
+    if (QUOTA_EXHAUSTED_PATTERN.test(message) || LOCAL_USAGE_LIMIT_PATTERN.test(message))
+        return "quota";
+    if (RATE_LIMITED_PATTERN.test(message) || HTTP_5XX_PATTERN.test(message))
+        return "rate_limited";
+    return "provider_error";
+}
+/** Build a synthetic error response so a thrown transport failure classifies identically. */
+export function syntheticErrorResponse(model, errorMessage) {
+    return {
+        role: "assistant",
+        content: [],
+        api: model.api,
+        provider: model.provider,
+        model: model.id,
+        usage: {
+            input: 0,
+            output: 0,
+            cacheRead: 0,
+            cacheWrite: 0,
+            totalTokens: 0,
+            cost: { input: 0, output: 0, cacheRead: 0, cacheWrite: 0, total: 0 },
+        },
+        stopReason: "error",
+        errorMessage,
+        timestamp: Date.now(),
+    };
+}
+/**
+ * Reasoning starvation fingerprint: the response stopped at the output limit,
+ * produced no usable deletion record, and billed reasoning tokens.
+ *
+ * This is a diagnostic category only. Codex has no starvation concept and never
+ * retries one; neither does Atomic. A starved outcome advances the ladder
+ * exactly like any other `unusable` output.
+ */
+export function isReasoningStarved(response, hasUsableRanges) {
+    return response.stopReason === "length" && !hasUsableRanges && (response.usage?.reasoning ?? 0) > 0;
+}
+//# sourceMappingURL=planner-outcome.js.map

package/dist/core/compaction/planner-outcome.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-outcome.js","sourceRoot":"","sources":["../../../src/core/compaction/planner-outcome.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAmCjE,+DAA+D;AAC/D,MAAM,UAAU,gBAAgB,CAC/B,OAAuB;IAEvB,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,CAAC;AAClE,CAAC;AAED,SAAS,yBAAyB,CAAC,QAA2B;IAC7D,OAAO,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,MAAM,uBAAuB,GAAG,yBAAyB,CAAC;IACzD,mBAAmB;IACnB,qBAAqB;IACrB,6BAA6B;IAC7B,mBAAmB;IACnB,oBAAoB;IACpB,eAAe;IACf,gBAAgB;IAChB,SAAS;CACT,CAAC,CAAC;AAEH;;;;;;;;;GASG;AACH,MAAM,yBAAyB,GAAG,eAAe,CAAC;AAElD;;;;GAIG;AACH,MAAM,oBAAoB,GAAG,yBAAyB,CAAC;IACtD,YAAY;IACZ,aAAa;IACb,mBAAmB;IACnB,KAAK;IACL,sBAAsB;IACtB,eAAe;IACf,iBAAiB;IACjB,mBAAmB;CACnB,CAAC,CAAC;AAEH;;;;;;;;GAQG;AACH,MAAM,gBAAgB,GAAG,0BAA0B,CAAC;AAKpD;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,QAA0B,EAAE,aAAqB;IACvF,IAAI,iBAAiB,CAAC,QAAQ,EAAE,aAAa,CAAC;QAAE,OAAO,UAAU,CAAC;IAClE,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,IAAI,EAAE,CAAC;IAC5C,IAAI,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,yBAAyB,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IACrG,IAAI,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,cAAc,CAAC;IAChG,OAAO,gBAAgB,CAAC;AACzB,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,sBAAsB,CACrC,KAAiD,EACjD,YAAoB;IAEpB,OAAO;QACN,IAAI,EAAE,WAAW;QACjB,OAAO,EAAE,EAAE;QACX,GAAG,EAAE,KAAK,CAAC,GAAG;QACd,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,KAAK,EAAE,KAAK,CAAC,EAAE;QACf,KAAK,EAAE;YACN,KAAK,EAAE,CAAC;YACR,MAAM,EAAE,CAAC;YACT,SAAS,EAAE,CAAC;YACZ,UAAU,EAAE,CAAC;YACb,WAAW,EAAE,CAAC;YACd,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;SACpE;QACD,UAAU,EAAE,OAAO;QACnB,YAAY;QACZ,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;KACD,CAAC;AACvB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAA0B,EAAE,eAAwB;IACtF,OAAO,QAAQ,CAAC,UAAU,KAAK,QAAQ,IAAI,CAAC,eAAe,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACrG,CAAC","sourcesContent":["/**\n * Typed outcomes for one compaction planner attempt.\n *\n * `planDeletedLineRanges` used to collapse ranked success, silent partial\n * recovery, reasoning starvation, rate limiting, malformed output, and context\n * overflow into \"ranges or throw\". Callers could not tell a throttle from\n * garbage without string-matching an error message. This module makes each\n * outcome a distinct value so the rung ladder, the `0600` diagnostic sidecar,\n * and the UI can separate them.\n *\n * Cancellation is deliberately NOT a variant: an abort still throws.\n */\n\nimport type { Api, AssistantMessage } from \"@earendil-works/pi-ai/compat\";\nimport { isContextOverflow } from \"@earendil-works/pi-ai/compat\";\nimport type { RawLineRange } from \"./compaction-types.js\";\nimport type { DiagnosticFailureCategory } from \"./range-planner-diagnostics.js\";\n\n/** Which limit a `rateLimited` outcome represents. */\nexport type PlannerLimitClass = \"quota\" | \"rate_limited\";\n\n/** Every way one planner attempt can end. */\nexport type PlannerOutcome =\n\t| { kind: \"ranked\"; ranges: RawLineRange[] }\n\t| { kind: \"recovered\"; ranges: RawLineRange[]; recoveredCount: number }\n\t| {\n\t\t\tkind: \"rateLimited\";\n\t\t\t/**\n\t\t\t * Which limit this was, independent of retry activity. Quota/billing\n\t\t\t * exhaustion and transient throttling are different facts and must stay\n\t\t\t * separable in code and diagnostics; `exhausted` records only whether a\n\t\t\t * retry was actually scheduled, which cannot tell them apart when retry\n\t\t\t * is disabled.\n\t\t\t */\n\t\t\tcategory: PlannerLimitClass;\n\t\t\texhausted: boolean;\n\t\t\tmessage: string;\n\t\t\tdiagnosticPath?: string;\n\t  }\n\t| { kind: \"unusable\"; category: DiagnosticFailureCategory; excerpt: string; diagnosticPath?: string }\n\t| { kind: \"overflowed\"; diagnosticPath?: string }\n\t| { kind: \"providerError\"; message: string; diagnosticPath?: string };\n\n/** A planner outcome that cannot produce a boundary and must advance the ladder. */\nexport type TerminalPlannerOutcome = Extract<\n\tPlannerOutcome,\n\t{ kind: \"rateLimited\" | \"unusable\" | \"overflowed\" | \"providerError\" }\n>;\n\n/** Whether this outcome produced validated deletion ranges. */\nexport function isPlannerSuccess(\n\toutcome: PlannerOutcome,\n): outcome is Extract<PlannerOutcome, { kind: \"ranked\" | \"recovered\" }> {\n\treturn outcome.kind === \"ranked\" || outcome.kind === \"recovered\";\n}\n\nfunction buildProviderErrorPattern(patterns: readonly string[]): RegExp {\n\treturn new RegExp(patterns.join(\"|\"), \"i\");\n}\n\n/**\n * Quota/billing exhaustion. Mirrors pi-ai's\n * `NON_RETRYABLE_PROVIDER_LIMIT_ERROR_PATTERN` (`utils/retry.js`), which takes\n * precedence over the transient patterns and never spends backoff.\n */\nconst QUOTA_EXHAUSTED_PATTERN = buildProviderErrorPattern([\n\t\"GoUsageLimitError\",\n\t\"FreeUsageLimitError\",\n\t\"Monthly usage limit reached\",\n\t\"available balance\",\n\t\"insufficient_quota\",\n\t\"out of budget\",\n\t\"quota exceeded\",\n\t\"billing\",\n]);\n\n/**\n * Generic usage-limit wording, e.g. Codex's \"The usage limit has been reached\".\n *\n * This is a deliberate **local addition**, not a mirror: pi-ai lists it in\n * neither its non-retryable nor its retryable pattern, so `retryAssistantCall`\n * never schedules a backoff for it. Classifying it as transient throttling would\n * report `exhausted: true` for a retry budget that was never spent, so Atomic\n * treats it as quota exhaustion (`exhausted: false`). pi-ai's own\n * `Monthly usage limit reached` entry above already covers the specific form.\n */\nconst LOCAL_USAGE_LIMIT_PATTERN = /usage.?limit/i;\n\n/**\n * Transient throttling and provider-load failures. This is the rate-limit\n * subset of pi-ai's `RETRYABLE_PROVIDER_ERROR_PATTERN`, minus the individual\n * status codes, which `HTTP_5XX_PATTERN` generalizes below.\n */\nconst RATE_LIMITED_PATTERN = buildProviderErrorPattern([\n\t\"overloaded\",\n\t\"rate.?limit\",\n\t\"too many requests\",\n\t\"429\",\n\t\"service.?unavailable\",\n\t\"server.?error\",\n\t\"internal.?error\",\n\t\"ResourceExhausted\",\n]);\n\n/**\n * The whole HTTP 5xx class, bounded so it cannot match inside a longer number.\n *\n * A deliberate local broadening: the RFC and the acceptance contract enumerate\n * `5xx`, while pi-ai lists only 500/502/503/504/524, so a `501` would otherwise\n * fall through to `providerError`. The consequence is that pi-ai may schedule no\n * backoff for a status Atomic types as rate limiting — which is exactly why\n * `exhausted` reports *observed* retry activity rather than assuming it.\n */\nconst HTTP_5XX_PATTERN = /(?<![\\d.])5\\d\\d(?![\\d.])/;\n\n/** How a failed planner response is classified before an outcome is built. */\nexport type PlannerFailureClass = \"overflow\" | \"quota\" | \"rate_limited\" | \"provider_error\";\n\n/**\n * Classify one failed planner response.\n *\n * Context overflow wins first because pi-ai's `isContextOverflow` already\n * excludes rate/throttle text, and overflow is recoverable by trimming.\n * Quota/billing exhaustion then wins over transient throttling, matching pi-ai's\n * own precedence.\n */\nexport function classifyPlannerFailure(response: AssistantMessage, contextWindow: number): PlannerFailureClass {\n\tif (isContextOverflow(response, contextWindow)) return \"overflow\";\n\tconst message = response.errorMessage ?? \"\";\n\tif (QUOTA_EXHAUSTED_PATTERN.test(message) || LOCAL_USAGE_LIMIT_PATTERN.test(message)) return \"quota\";\n\tif (RATE_LIMITED_PATTERN.test(message) || HTTP_5XX_PATTERN.test(message)) return \"rate_limited\";\n\treturn \"provider_error\";\n}\n\n/** Build a synthetic error response so a thrown transport failure classifies identically. */\nexport function syntheticErrorResponse(\n\tmodel: { api: Api; provider: string; id: string },\n\terrorMessage: string,\n): AssistantMessage {\n\treturn {\n\t\trole: \"assistant\",\n\t\tcontent: [],\n\t\tapi: model.api,\n\t\tprovider: model.provider,\n\t\tmodel: model.id,\n\t\tusage: {\n\t\t\tinput: 0,\n\t\t\toutput: 0,\n\t\t\tcacheRead: 0,\n\t\t\tcacheWrite: 0,\n\t\t\ttotalTokens: 0,\n\t\t\tcost: { input: 0, output: 0, cacheRead: 0, cacheWrite: 0, total: 0 },\n\t\t},\n\t\tstopReason: \"error\",\n\t\terrorMessage,\n\t\ttimestamp: Date.now(),\n\t} as AssistantMessage;\n}\n\n/**\n * Reasoning starvation fingerprint: the response stopped at the output limit,\n * produced no usable deletion record, and billed reasoning tokens.\n *\n * This is a diagnostic category only. Codex has no starvation concept and never\n * retries one; neither does Atomic. A starved outcome advances the ladder\n * exactly like any other `unusable` output.\n */\nexport function isReasoningStarved(response: AssistantMessage, hasUsableRanges: boolean): boolean {\n\treturn response.stopReason === \"length\" && !hasUsableRanges && (response.usage?.reasoning ?? 0) > 0;\n}\n"]}

package/dist/core/compaction/range-planner-diagnostics.d.ts

@@ -10,7 +10,15 @@
  */
 import type { Api, AssistantMessage, Model, Usage } from "@earendil-works/pi-ai/compat";
 /** Failure categories emitted in diagnostic sidecars. */
-export type DiagnosticFailureCategory = "malformed_output" | "no_usable_ranges" | "provider_error" | "stream_error";
+export type DiagnosticFailureCategory = "malformed_output" | "no_usable_ranges" | "provider_error" | "stream_error"
+/** Length stop, no usable record, and billed reasoning tokens. */
+ | "starved"
+/** Transient throttling, whether or not a retry was actually scheduled. */
+ | "rate_limited"
+/** Quota, billing, or usage-limit exhaustion; never spends backoff. */
+ | "quota"
+/** The planner request itself exceeded the model's context window. */
+ | "context_overflow";
 /** Recovery categories emitted in recovery diagnostic sidecars. */
 export type DiagnosticRecoveryCategory = "partial_length_recovery";
 /** Safe model metadata subset (no credentials, no headers). */
@@ -31,7 +39,14 @@ export interface CompactionDiagnostic {
     stopReason: string | undefined;
     providerError: string | undefined;
     usage: Usage | undefined;
-    requestMaxTokens: number;
+    /** Undefined since the planner sends no output cap. */
+    requestMaxTokens: number | undefined;
+    /**
+     * Whether a retry was actually scheduled before the final failure. It records
+     * retry activity, not the failure identity: a `rate_limited` record with retry
+     * disabled is `false`, and `quota` is always `false`.
+     */
+    rateLimitExhausted?: boolean;
     model: DiagnosticModelMeta;
 }
 /** Recovery diagnostic payload written on successful partial recovery. */
@@ -42,7 +57,7 @@ export interface RecoveryDiagnostic {
     rawResponse: string;
     stopReason: string | undefined;
     usage: Usage | undefined;
-    requestMaxTokens: number;
+    requestMaxTokens: number | undefined;
     model: DiagnosticModelMeta;
     recoveredRangeCount: number;
 }
@@ -51,8 +66,8 @@ export interface DiagnosticContext {
     sessionFilePath: string | undefined;
     /** The model used for the planner request. */
     model: Model<Api>;
-    /** The maxTokens value sent in the planner request. */
-    requestMaxTokens: number;
+    /** The maxTokens value sent in the planner request; undefined when no cap is sent. */
+    requestMaxTokens: number | undefined;
     /** The full assistant response message, if one was received. */
     response: AssistantMessage | undefined;
     /** The full raw text extracted from the response. */
@@ -61,6 +76,8 @@ export interface DiagnosticContext {
     failureCategory: DiagnosticFailureCategory;
     /** The user-facing failure message. */
     failureMessage: string;
+    /** Retry activity for a limit failure; see CompactionDiagnostic. */
+    rateLimitExhausted?: boolean;
 }
 declare function buildDiagnosticPayload(ctx: DiagnosticContext): CompactionDiagnostic;
 /**
@@ -84,7 +101,7 @@ export { buildDiagnosticPayload };
 export interface RecoveryDiagnosticContext {
     sessionFilePath: string | undefined;
     model: Model<Api>;
-    requestMaxTokens: number;
+    requestMaxTokens: number | undefined;
     response: AssistantMessage;
     rawResponseText: string;
     recoveryCategory: DiagnosticRecoveryCategory;
@@ -98,4 +115,39 @@ declare function buildRecoveryPayload(ctx: RecoveryDiagnosticContext): RecoveryD
  */
 export declare function writeRecoveryDiagnosticSidecar(ctx: RecoveryDiagnosticContext): string | undefined;
 export { buildRecoveryPayload };
+/** Success categories emitted in success diagnostic sidecars. */
+export type DiagnosticSuccessCategory = "borrowed_planner";
+/**
+ * Success diagnostic payload written when a *borrowed* fallback model ranked
+ * the lines. The RFC requires the borrowed identity to appear in diagnostics but
+ * defines no payload; this is the chosen shape, and it carries only safe data —
+ * no key, headers, auth, prompt, or transcript.
+ */
+export interface SuccessDiagnostic {
+    version: 1;
+    timestamp: string;
+    successCategory: DiagnosticSuccessCategory;
+    /** Effective reasoning level of the successful planner request, when it had one. */
+    thinkingLevel?: string;
+    /** Undefined since the planner sends no output cap. */
+    requestMaxTokens: number | undefined;
+    model: DiagnosticModelMeta;
+}
+export interface SuccessDiagnosticContext {
+    sessionFilePath: string | undefined;
+    /** The model that actually produced the accepted ranking. */
+    model: Model<Api>;
+    successCategory: DiagnosticSuccessCategory;
+    thinkingLevel?: string;
+}
+declare function buildSuccessPayload(ctx: SuccessDiagnosticContext): SuccessDiagnostic;
+/**
+ * Write a success sidecar naming the borrowed model that ranked the lines.
+ *
+ * Best-effort: an in-memory session or a write failure never changes compaction
+ * success. The filename uses a distinct `-compaction-success-<ts>.json` suffix so
+ * it cannot collide with the primary model's failure sidecar.
+ */
+export declare function writeSuccessDiagnosticSidecar(ctx: SuccessDiagnosticContext): string | undefined;
+export { buildSuccessPayload };
 //# sourceMappingURL=range-planner-diagnostics.d.ts.map