@hoilab/ada-cli 0.85.0 → 0.85.3

package/dist/core/secretos/replacement.js

@@ -0,0 +1,211 @@
+import * as crypto from "node:crypto";
+// ═══════════════════════════════════════════════════════════════════════════
+// Deterministic replacement generation
+// ═══════════════════════════════════════════════════════════════════════════
+export const REPLACEMENT_CHARS = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
+const NONMATCHING_REPLACEMENT_CHARS = `${REPLACEMENT_CHARS}!#$%&()*+,-./:;<=>?@[]^_{|}~`;
+// Whitespace bytes used to build last-resort redactions for a default replace
+// regex that matches every non-whitespace candidate (e.g. `\S{n}`). Only
+// `space`/`tab` are used — never a line terminator — so a `.`-style
+// match-everything regex (which matches space and tab but not `\n`) still
+// exhausts to the sentinel instead of redacting to a newline run.
+const WHITESPACE_REPLACEMENT_CHARS = " \t";
+/** Generate a deterministic same-length replacement string from a secret value. */
+export function generateDeterministicReplacement(secret) {
+    if (secret.length === 0)
+        return "";
+    // Prefix generated chunks with a fixed `ZZ` so re-redacting an already-emitted
+    // 1–2 char chunk is a fixed point (the deterministic replacement of a <=2-char
+    // value is itself `Z`/`ZZ`), keeping short default-replacement remainders next
+    // to a reversible placeholder stable across an obfuscator restart.
+    // Equivalente determinista de Bun.hash (wyhash): 64 bits derivados de
+    // SHA-256 — estable entre procesos, que es lo único que la idempotencia
+    // across-restart exige.
+    const hash = BigInt(`0x${crypto.createHash("sha256").update(secret).digest().subarray(0, 8).toString("hex")}`);
+    const chars = secret.length === 1 ? ["Z"] : ["Z", "Z"];
+    let h = hash;
+    for (let i = chars.length; i < secret.length; i++) {
+        h = h ^ (BigInt(i + 1) * 0x9e3779b97f4a7c15n);
+        const idx = Number((h < 0n ? -h : h) % BigInt(REPLACEMENT_CHARS.length));
+        chars.push(REPLACEMENT_CHARS[idx]);
+    }
+    return chars.join("");
+}
+/**
+ * Force a length-preserving deterministic replacement to differ from the secret
+ * it stands in for. `generateDeterministicReplacement` seeds its first 1–2 chars
+ * with the `Z`/`ZZ` sentinel, so a whole configured value that is exactly `Z` or
+ * `ZZ` (or an astronomically unlikely longer hash collision) would otherwise be
+ * emitted unchanged and ship the raw secret to the provider. Flip the first char
+ * to a fixed different glyph: same length, still deterministic, guaranteed != the
+ * secret. Only safe for a whole CONFIGURED value (a plain secret matches its own
+ * literal, so the perturbed output is no longer matched and stays a fixed point);
+ * per-chunk remainders must keep the sentinel to remain idempotent across restart.
+ */
+export function ensureDistinctReplacement(replacement, secret) {
+    if (replacement.length === 0 || replacement !== secret)
+        return replacement;
+    const alt = replacement[0] === REPLACEMENT_CHARS[0] ? REPLACEMENT_CHARS[1] : REPLACEMENT_CHARS[0];
+    return alt + replacement.slice(1);
+}
+// How far left of the matched span the re-match scan begins looking for a match
+// that overlaps the candidate. This bounds ONLY the match-start search position,
+// never the lookbehind/lookahead context: the probe below substitutes the
+// candidate into the FULL text, so a regex's lookbehind/lookahead assertions
+// always evaluate against complete context regardless of width. The single
+// re-match this misses is one that begins more than this many bytes before the
+// span and extends into it (a single match longer than the window) — that only
+// churns the chosen redaction marker between candidates, never back to the raw
+// matched value, so it cannot leak a secret.
+const REGEX_REMATCH_BACKSCAN = 512;
+/**
+ * Whether `candidate`, substituted for the matched span in its surrounding text,
+ * is re-matched by `regex` at its own position. A replace-mode regex that depends
+ * on context (lookbehind/lookahead/`\b`) can match a candidate that does NOT match
+ * in isolation: e.g. `(?<=api=)[AZ]` never matches a bare `A`, but `api=A` does, so
+ * a candidate `A` chosen by an isolation test is re-redacted on the next obfuscate()
+ * pass and can oscillate back to the raw matched value. The probe substitutes the
+ * candidate into the FULL text — not a truncated window — so a wide lookbehind or
+ * lookahead (e.g. `(?<=A{600})`) still evaluates against the context that makes it
+ * match. Truncating that context dropped the assertion's reach and falsely
+ * accepted an oscillating, leaky candidate. The scan starts a bounded distance
+ * left of the span and stops once a match begins at/after the span's end (matches
+ * arrive in order), keeping per-candidate cost independent of total text length.
+ */
+export function regexRematchesInContext(candidate, regex, ctx) {
+    const probe = ctx.text.slice(0, ctx.start) + candidate + ctx.text.slice(ctx.end);
+    const spanStart = ctx.start;
+    const spanEnd = spanStart + candidate.length;
+    regex.lastIndex = Math.max(0, spanStart - REGEX_REMATCH_BACKSCAN);
+    for (let m = regex.exec(probe); m !== null; m = regex.exec(probe)) {
+        const matchStart = m.index;
+        const matchEnd = m.index + m[0].length;
+        // Matches arrive in increasing position; once one starts at or past the
+        // span's end it cannot cover the candidate, and neither can any later one.
+        if (matchStart >= spanEnd)
+            break;
+        // A match overlapping the candidate's own bytes means those bytes get
+        // re-redacted on a later pass — not a fixed point.
+        if (matchEnd > spanStart)
+            return true;
+        // Zero-width matches do not advance lastIndex; step past to avoid a loop.
+        if (m[0].length === 0)
+            regex.lastIndex++;
+    }
+    return false;
+}
+/**
+ * Search same-length replacements for one the regex does NOT match, so a default
+ * regex secret whose deterministic replacement collides with its own value (the
+ * `Z`/`ZZ` sentinel, or an astronomical hash collision) is still redacted to a
+ * STABLE nonmatching value instead of shipping the raw secret. A nonmatching
+ * candidate is a fixed point under re-obfuscation — the regex never re-matches it,
+ * so it cannot re-leak on a later pass. The search stays bounded to O(length *
+ * alphabet) regardless of value length: first exhaust every single-position
+ * substitution against a deterministic baseline (`AAAA…`, then `!AAA…`, `A!AA…`,
+ * …) so any regex that only needs one out-of-class byte — regardless of position —
+ * is found in a handful of probes rather than enumerating every combination (which
+ * for a 3-byte match-everything config, e.g. `[\s\S]{3}`, would otherwise run
+ * 90**3 = 729000 candidates through the regex on every single match, stalling
+ * provider requests). Candidates are enumerated deterministically over a stable
+ * ASCII alphabet: alphanumerics first (usually enough), then punctuation fallback
+ * bytes when the regex covers every alphanumeric candidate. When the regex still
+ * matches around a lone perturbed byte (for example `[A-Za-z0-9].*` matching the
+ * unperturbed tail), full-width same-byte candidates (`!!!!!`, `_____`, …) are
+ * tried next. When the regex covers every non-whitespace candidate (e.g. `\S{n}`),
+ * whitespace markers (a full space/tab run, then a single whitespace byte among
+ * non-whitespace filler) are tried as a last resort. A genuine match-everything
+ * regex (`.`/`[\s\S]`, which also matches space and tab) still exhausts this bounded
+ * sweep and returns undefined, letting the caller keep its own fixed-point fallback
+ * — bounded search can in principle miss an escape that depends jointly on
+ * multiple positions in a way no single-position swap reaches, but no realistic
+ * secret-redaction regex (character classes, literal matches, anchored/bounded
+ * repeats) has that shape.
+ */
+export function findNonMatchingReplacement(value, regex, context) {
+    const len = value.length;
+    if (len === 0)
+        return undefined;
+    // Exhaust every single-position substitution against the deterministic baseline
+    // first (covers the common case cheaply), then fall back to full-width same-byte
+    // candidates for a regex that only rejects a lone perturbed byte in context.
+    const baseline = NONMATCHING_REPLACEMENT_CHARS[0].repeat(len);
+    for (let position = 0; position < len; position++) {
+        for (const ch of NONMATCHING_REPLACEMENT_CHARS) {
+            const candidate = `${baseline.slice(0, position)}${ch}${baseline.slice(position + 1)}`;
+            if (candidate === value)
+                continue;
+            if (!regexRematchesInContext(candidate, regex, context))
+                return candidate;
+        }
+    }
+    // If the regex can still match around a lone punctuation byte (for example
+    // `[A-Za-z0-9].*` matching the `AAAA` tail of `!AAAA`), try full-width
+    // same-byte fallbacks like `!!!!!`, `_____`, etc. before giving up.
+    for (const ch of NONMATCHING_REPLACEMENT_CHARS) {
+        const candidate = ch.repeat(len);
+        if (candidate === value)
+            continue;
+        if (!regexRematchesInContext(candidate, regex, context))
+            return candidate;
+    }
+    return findWhitespaceFallbackReplacement(value, regex, context);
+}
+/**
+ * Last-resort fallback for a default replace regex that matches every
+ * non-whitespace candidate. Builds same-length whitespace markers the regex
+ * cannot match: first a full space/tab run (handles `\S`-class patterns), then a
+ * single whitespace byte among non-whitespace filler (` AAAA`, `A AAA`, …). The
+ * mixed marker defeats regexes that ALSO match all-space/all-tab runs, e.g.
+ * `(?:\S{n}| {n}|\t{n})`, because the lone whitespace byte breaks every
+ * fixed-length run. A genuine match-everything regex (`.`/`[\s\S]`) matches the
+ * filler and the whitespace alike, so this still returns undefined there, keeping
+ * the caller's sentinel as the sole fixed point.
+ */
+function findWhitespaceFallbackReplacement(value, regex, context) {
+    const len = value.length;
+    const filler = NONMATCHING_REPLACEMENT_CHARS[0];
+    for (const ws of WHITESPACE_REPLACEMENT_CHARS) {
+        const full = ws.repeat(len);
+        if (full !== value) {
+            if (!regexRematchesInContext(full, regex, context))
+                return full;
+        }
+        for (let pos = 0; pos < len; pos++) {
+            const candidate = `${filler.repeat(pos)}${ws}${filler.repeat(len - pos - 1)}`;
+            if (candidate === value)
+                continue;
+            if (!regexRematchesInContext(candidate, regex, context))
+                return candidate;
+        }
+    }
+    return undefined;
+}
+/**
+ * Whether a default (no custom `replacement`) replace-mode regex can never
+ * safely redact a 1-2 char match: `findNonMatchingReplacement`'s bounded
+ * search — the same search `#generateRegexReplacement` runs at match time —
+ * finds no candidate the regex fails to re-match. This holds independent of
+ * any actual per-install key: the search already exhausts every character in
+ * `REPLACEMENT_CHARS` (the alphabet `buildKeyedReplacementRun` draws its
+ * fallback marker from) plus punctuation and whitespace, so if none of those
+ * escape the regex, no key-derived marker drawn from the same alphabet can
+ * either — the marker is guaranteed to re-match too, making every such match
+ * unresolvable: the fallback could only ever emit the raw matched text
+ * unchanged. Probed with a value (`"\0".repeat(length)`) the bounded search
+ * never treats as a real candidate, so the result depends only on the
+ * regex's own matching behavior, not on this specific probe.
+ */
+export function regexHasUnresolvableShortMatchFallback(regex) {
+    return [1, 2].some((length) => {
+        const probe = "\u0000".repeat(length);
+        const savedLastIndex = regex.lastIndex;
+        try {
+            return findNonMatchingReplacement(probe, regex, { text: probe, start: 0, end: length }) === undefined;
+        }
+        finally {
+            regex.lastIndex = savedLastIndex;
+        }
+    });
+}
+//# sourceMappingURL=replacement.js.map

package/dist/core/secretos/replacement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replacement.js","sourceRoot":"","sources":["../../../src/core/secretos/replacement.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AACtC,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E,MAAM,CAAC,MAAM,iBAAiB,GAAG,gEAAgE,CAAC;AAClG,MAAM,6BAA6B,GAAG,GAAG,iBAAiB,8BAA8B,CAAC;AACzF,8EAA8E;AAC9E,yEAAyE;AACzE,oEAAoE;AACpE,0EAA0E;AAC1E,kEAAkE;AAClE,MAAM,4BAA4B,GAAG,KAAK,CAAC;AAE3C,mFAAmF;AACnF,MAAM,UAAU,gCAAgC,CAAC,MAAc;IAC9D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,+EAA+E;IAC/E,+EAA+E;IAC/E,+EAA+E;IAC/E,mEAAmE;IACnE,sEAAsE;IACtE,wEAAwE;IACxE,wBAAwB;IACxB,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC/G,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACvD,IAAI,CAAC,GAAG,IAAI,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnD,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC;QAC9C,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;QACzE,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,yBAAyB,CAAC,WAAmB,EAAE,MAAc;IAC5E,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,KAAK,MAAM;QAAE,OAAO,WAAW,CAAC;IAC3E,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAClG,OAAO,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,gFAAgF;AAChF,iFAAiF;AACjF,0EAA0E;AAC1E,6EAA6E;AAC7E,2EAA2E;AAC3E,+EAA+E;AAC/E,+EAA+E;AAC/E,+EAA+E;AAC/E,6CAA6C;AAC7C,MAAM,sBAAsB,GAAG,GAAG,CAAC;AAUnC;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,uBAAuB,CAAC,SAAiB,EAAE,KAAa,EAAE,GAAsB;IAC/F,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjF,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC;IAC5B,MAAM,OAAO,GAAG,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC;IAC7C,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,sBAAsB,CAAC,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACnE,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC;QAC3B,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACvC,wEAAwE;QACxE,2EAA2E;QAC3E,IAAI,UAAU,IAAI,OAAO;YAAE,MAAM;QACjC,sEAAsE;QACtE,mDAAmD;QACnD,IAAI,QAAQ,GAAG,SAAS;YAAE,OAAO,IAAI,CAAC;QACtC,0EAA0E;QAC1E,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,SAAS,EAAE,CAAC;IAC1C,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,UAAU,0BAA0B,CACzC,KAAa,EACb,KAAa,EACb,OAA0B;IAE1B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;IACzB,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAChC,gFAAgF;IAChF,iFAAiF;IACjF,6EAA6E;IAC7E,MAAM,QAAQ,GAAG,6BAA6B,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9D,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAC;QACnD,KAAK,MAAM,EAAE,IAAI,6BAA6B,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC;YACvF,IAAI,SAAS,KAAK,KAAK;gBAAE,SAAS;YAClC,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC;gBAAE,OAAO,SAAS,CAAC;QAC3E,CAAC;IACF,CAAC;IACD,2EAA2E;IAC3E,uEAAuE;IACvE,oEAAoE;IACpE,KAAK,MAAM,EAAE,IAAI,6BAA6B,EAAE,CAAC;QAChD,MAAM,SAAS,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,SAAS,KAAK,KAAK;YAAE,SAAS;QAClC,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC;YAAE,OAAO,SAAS,CAAC;IAC3E,CAAC;IACD,OAAO,iCAAiC,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AACjE,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,iCAAiC,CACzC,KAAa,EACb,KAAa,EACb,OAA0B;IAE1B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;IACzB,MAAM,MAAM,GAAG,6BAA6B,CAAC,CAAC,CAAC,CAAC;IAChD,KAAK,MAAM,EAAE,IAAI,4BAA4B,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACpB,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC;gBAAE,OAAO,IAAI,CAAC;QACjE,CAAC;QACD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;YAC9E,IAAI,SAAS,KAAK,KAAK;gBAAE,SAAS;YAClC,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC;gBAAE,OAAO,SAAS,CAAC;QAC3E,CAAC;IACF,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,sCAAsC,CAAC,KAAa;IACnE,OAAQ,CAAC,CAAC,EAAE,CAAC,CAAW,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE;QACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,cAAc,GAAG,KAAK,CAAC,SAAS,CAAC;QACvC,IAAI,CAAC;YACJ,OAAO,0BAA0B,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,KAAK,SAAS,CAAC;QACvG,CAAC;gBAAS,CAAC;YACV,KAAK,CAAC,SAAS,GAAG,cAAc,CAAC;QAClC,CAAC;IACF,CAAC,CAAC,CAAC;AACJ,CAAC"}

package/dist/core/sesion/cerrar-llamadas-abiertas.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cerrar-llamadas-abiertas.d.ts","sourceRoot":"","sources":["../../../src/core/sesion/cerrar-llamadas-abiertas.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AASH,UAAU,cAAc;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,SAAS,OAAO,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,cAAc,EAAE,CAgBnG;AAcD;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAIrF","sourcesContent":["/**\n * Cerrar las llamadas que un turno abortado deja a medias — desde el paquete\n * que sí llega al cliente.\n *\n * EL FALLO. Los proveedores rechazan un historial donde un `tool_use` no tiene\n * su `tool_result`. Si al abortar el par queda a medias, la conversación entera\n * deja de poder reanudarse: un Ctrl-C en el momento equivocado no estropea el\n * turno, estropea la sesión.\n *\n * Medido sobre el historial real, antes de arreglarlo:\n *\n *     user:text | assistant:toolCall            <- huérfana\n *\n * y después:\n *\n *     user:text | assistant:toolCall | toolResult:text\n *\n * POR QUÉ AQUÍ Y NO SOLO EN EL BUCLE. El arreglo existe también en\n * `packages/agent/src/agent-loop.ts`, pero ESE PAQUETE NO VIAJA: el tarball de\n * `@hoilab/ada-cli` resuelve `@earendil-works/pi-agent-core` del registro de\n * npm, así que quien instala recibe el de upstream, sin el arreglo. Medido con\n * `npm pack --dry-run`: cero ficheros de esos paquetes en el tarball.\n *\n * ES IDEMPOTENTE POR CONSTRUCCIÓN, que es lo que permite tener las dos. Solo\n * cierra lo que sigue abierto: si el bucle ya lo hizo —al ejecutar desde el\n * árbol de fuentes— no encuentra huérfanas y no añade nada. Nunca duplica.\n */\n\n/** Lo mínimo que hace falta de un mensaje para decidir. */\ninterface MensajeMinimo {\n\trole?: string;\n\ttoolCallId?: unknown;\n\tcontent?: unknown;\n}\n\ninterface LlamadaAbierta {\n\tid: string;\n\tnombre: string;\n}\n\n/**\n * Las llamadas de `mensaje` que el historial no ha cerrado todavía.\n *\n * OJO CON LA FORMA, porque la primera versión de esta comprobación miró la\n * equivocada y no medía nada: una llamada es un BLOQUE dentro del contenido de\n * un mensaje `assistant`, pero un resultado es un MENSAJE entero con\n * `role: \"toolResult\"` y su `toolCallId` al nivel del mensaje, no un bloque.\n */\nexport function llamadasSinCerrar(historial: readonly unknown[], mensaje: unknown): LlamadaAbierta[] {\n\tconst m = mensaje as MensajeMinimo;\n\tconst bloques = Array.isArray(m?.content) ? (m.content as Array<Record<string, unknown>>) : [];\n\tconst abiertas: LlamadaAbierta[] = [];\n\tfor (const b of bloques) {\n\t\tif (b.type === \"toolCall\" && typeof b.id === \"string\") {\n\t\t\tabiertas.push({ id: b.id, nombre: typeof b.name === \"string\" ? b.name : \"desconocida\" });\n\t\t}\n\t}\n\tif (abiertas.length === 0) return [];\n\n\tconst cerradas = new Set<string>();\n\tfor (const entrada of historial as MensajeMinimo[]) {\n\t\tif (entrada?.role === \"toolResult\" && typeof entrada.toolCallId === \"string\") cerradas.add(entrada.toolCallId);\n\t}\n\treturn abiertas.filter((l) => !cerradas.has(l.id));\n}\n\n/** El resultado sintético que habría producido la ejecución al ver la señal. */\nfunction resultadoDeAborto(llamada: LlamadaAbierta): Record<string, unknown> {\n\treturn {\n\t\trole: \"toolResult\",\n\t\ttoolCallId: llamada.id,\n\t\ttoolName: llamada.nombre,\n\t\tcontent: [{ type: \"text\", text: \"Operation aborted\" }],\n\t\tisError: true,\n\t\ttimestamp: Date.now(),\n\t};\n}\n\n/**\n * Cierra en `historial` las llamadas que `mensaje` dejó abiertas.\n *\n * Devuelve cuántas cerró: cero es la respuesta normal y significa que no había\n * nada que cerrar, no que no se haya mirado.\n */\nexport function cerrarLlamadasAbiertas(historial: unknown[], mensaje: unknown): number {\n\tconst abiertas = llamadasSinCerrar(historial, mensaje);\n\tfor (const llamada of abiertas) historial.push(resultadoDeAborto(llamada));\n\treturn abiertas.length;\n}\n"]}
+{"version":3,"file":"cerrar-llamadas-abiertas.d.ts","sourceRoot":"","sources":["../../../src/core/sesion/cerrar-llamadas-abiertas.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AASH,UAAU,cAAc;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,SAAS,OAAO,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,cAAc,EAAE,CAgBnG;AAcD;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAIrF"}

package/dist/core/sesion/cerrar-llamadas-abiertas.js.map

@@ -1 +1 @@
-{"version":3,"file":"cerrar-llamadas-abiertas.js","sourceRoot":"","sources":["../../../src/core/sesion/cerrar-llamadas-abiertas.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAcH;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,SAA6B,EAAE,OAAgB,EAAoB;IACpG,MAAM,CAAC,GAAG,OAAwB,CAAC;IACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,OAA0C,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/F,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;YACvD,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;QAC1F,CAAC;IACF,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,OAAO,IAAI,SAA4B,EAAE,CAAC;QACpD,IAAI,OAAO,EAAE,IAAI,KAAK,YAAY,IAAI,OAAO,OAAO,CAAC,UAAU,KAAK,QAAQ;YAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAChH,CAAC;IACD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,CACnD;AAED,oFAAgF;AAChF,SAAS,iBAAiB,CAAC,OAAuB,EAA2B;IAC5E,OAAO;QACN,IAAI,EAAE,YAAY;QAClB,UAAU,EAAE,OAAO,CAAC,EAAE;QACtB,QAAQ,EAAE,OAAO,CAAC,MAAM;QACxB,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,mBAAmB,EAAE,CAAC;QACtD,OAAO,EAAE,IAAI;QACb,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;KACrB,CAAC;AAAA,CACF;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAAC,SAAoB,EAAE,OAAgB,EAAU;IACtF,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACvD,KAAK,MAAM,OAAO,IAAI,QAAQ;QAAE,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3E,OAAO,QAAQ,CAAC,MAAM,CAAC;AAAA,CACvB","sourcesContent":["/**\n * Cerrar las llamadas que un turno abortado deja a medias — desde el paquete\n * que sí llega al cliente.\n *\n * EL FALLO. Los proveedores rechazan un historial donde un `tool_use` no tiene\n * su `tool_result`. Si al abortar el par queda a medias, la conversación entera\n * deja de poder reanudarse: un Ctrl-C en el momento equivocado no estropea el\n * turno, estropea la sesión.\n *\n * Medido sobre el historial real, antes de arreglarlo:\n *\n *     user:text | assistant:toolCall            <- huérfana\n *\n * y después:\n *\n *     user:text | assistant:toolCall | toolResult:text\n *\n * POR QUÉ AQUÍ Y NO SOLO EN EL BUCLE. El arreglo existe también en\n * `packages/agent/src/agent-loop.ts`, pero ESE PAQUETE NO VIAJA: el tarball de\n * `@hoilab/ada-cli` resuelve `@earendil-works/pi-agent-core` del registro de\n * npm, así que quien instala recibe el de upstream, sin el arreglo. Medido con\n * `npm pack --dry-run`: cero ficheros de esos paquetes en el tarball.\n *\n * ES IDEMPOTENTE POR CONSTRUCCIÓN, que es lo que permite tener las dos. Solo\n * cierra lo que sigue abierto: si el bucle ya lo hizo —al ejecutar desde el\n * árbol de fuentes— no encuentra huérfanas y no añade nada. Nunca duplica.\n */\n\n/** Lo mínimo que hace falta de un mensaje para decidir. */\ninterface MensajeMinimo {\n\trole?: string;\n\ttoolCallId?: unknown;\n\tcontent?: unknown;\n}\n\ninterface LlamadaAbierta {\n\tid: string;\n\tnombre: string;\n}\n\n/**\n * Las llamadas de `mensaje` que el historial no ha cerrado todavía.\n *\n * OJO CON LA FORMA, porque la primera versión de esta comprobación miró la\n * equivocada y no medía nada: una llamada es un BLOQUE dentro del contenido de\n * un mensaje `assistant`, pero un resultado es un MENSAJE entero con\n * `role: \"toolResult\"` y su `toolCallId` al nivel del mensaje, no un bloque.\n */\nexport function llamadasSinCerrar(historial: readonly unknown[], mensaje: unknown): LlamadaAbierta[] {\n\tconst m = mensaje as MensajeMinimo;\n\tconst bloques = Array.isArray(m?.content) ? (m.content as Array<Record<string, unknown>>) : [];\n\tconst abiertas: LlamadaAbierta[] = [];\n\tfor (const b of bloques) {\n\t\tif (b.type === \"toolCall\" && typeof b.id === \"string\") {\n\t\t\tabiertas.push({ id: b.id, nombre: typeof b.name === \"string\" ? b.name : \"desconocida\" });\n\t\t}\n\t}\n\tif (abiertas.length === 0) return [];\n\n\tconst cerradas = new Set<string>();\n\tfor (const entrada of historial as MensajeMinimo[]) {\n\t\tif (entrada?.role === \"toolResult\" && typeof entrada.toolCallId === \"string\") cerradas.add(entrada.toolCallId);\n\t}\n\treturn abiertas.filter((l) => !cerradas.has(l.id));\n}\n\n/** El resultado sintético que habría producido la ejecución al ver la señal. */\nfunction resultadoDeAborto(llamada: LlamadaAbierta): Record<string, unknown> {\n\treturn {\n\t\trole: \"toolResult\",\n\t\ttoolCallId: llamada.id,\n\t\ttoolName: llamada.nombre,\n\t\tcontent: [{ type: \"text\", text: \"Operation aborted\" }],\n\t\tisError: true,\n\t\ttimestamp: Date.now(),\n\t};\n}\n\n/**\n * Cierra en `historial` las llamadas que `mensaje` dejó abiertas.\n *\n * Devuelve cuántas cerró: cero es la respuesta normal y significa que no había\n * nada que cerrar, no que no se haya mirado.\n */\nexport function cerrarLlamadasAbiertas(historial: unknown[], mensaje: unknown): number {\n\tconst abiertas = llamadasSinCerrar(historial, mensaje);\n\tfor (const llamada of abiertas) historial.push(resultadoDeAborto(llamada));\n\treturn abiertas.length;\n}\n"]}
+{"version":3,"file":"cerrar-llamadas-abiertas.js","sourceRoot":"","sources":["../../../src/core/sesion/cerrar-llamadas-abiertas.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAcH;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,SAA6B,EAAE,OAAgB;IAChF,MAAM,CAAC,GAAG,OAAwB,CAAC;IACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,OAA0C,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/F,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;YACvD,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;QAC1F,CAAC;IACF,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,OAAO,IAAI,SAA4B,EAAE,CAAC;QACpD,IAAI,OAAO,EAAE,IAAI,KAAK,YAAY,IAAI,OAAO,OAAO,CAAC,UAAU,KAAK,QAAQ;YAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAChH,CAAC;IACD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,gFAAgF;AAChF,SAAS,iBAAiB,CAAC,OAAuB;IACjD,OAAO;QACN,IAAI,EAAE,YAAY;QAClB,UAAU,EAAE,OAAO,CAAC,EAAE;QACtB,QAAQ,EAAE,OAAO,CAAC,MAAM;QACxB,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,mBAAmB,EAAE,CAAC;QACtD,OAAO,EAAE,IAAI;QACb,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;KACrB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAAC,SAAoB,EAAE,OAAgB;IAC5E,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACvD,KAAK,MAAM,OAAO,IAAI,QAAQ;QAAE,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3E,OAAO,QAAQ,CAAC,MAAM,CAAC;AACxB,CAAC"}

package/dist/core/sesion/journal-tree.d.ts

@@ -0,0 +1,73 @@
+/**
+ * Journal arbolado atómico — A01/A02/A03 (Fase 2).
+ *
+ * Referencia omp: session/session-manager.ts (JournalTree / SessionIndex) y
+ * session/session-storage.ts (writeTextAtomic + commitGuard sin yield).
+ *
+ * Diseño:
+ * - Entradas forman árbol por (id, parentId), leaf mutable (puntero vivo).
+ * - Persistencia via atomic-write (temp + fsync + rename atómico + commitGuard).
+ * - fork/move/breadcrumb son operaciones de árbol puras, sin IO.
+ * - toJSONL/fromJSONL es el formato en disco: una entrada por línea JSON.
+ */
+export interface JournalEntry {
+    id: string;
+    parentId: string | null;
+    type: string;
+    data: unknown;
+    timestamp?: string;
+}
+export type JournalEntryInput = Omit<JournalEntry, "timestamp"> & {
+    timestamp?: string;
+};
+export declare class JournalTree {
+    #private;
+    get leafId(): string | null;
+    get size(): number;
+    append(entry: JournalEntryInput): JournalEntry;
+    getLeaf(): JournalEntry | undefined;
+    has(id: string): boolean;
+    get(id: string): JournalEntry | undefined;
+    /**
+     * Mueve el puntero leaf a fromId (branch). No crea entrada nueva.
+     * Retorna el newLeafId (el mismo fromId validado).
+     */
+    fork(fromId: string): string;
+    /**
+     * Re-parenta entryId bajo newParentId (null = raíz).
+     * Rechaza ciclos (newParentId no puede ser descendiente de entryId)
+     * y parent inexistente.
+     */
+    move(entryId: string, newParentId: string | null): void;
+    /**
+     * Camino de ids desde raíz hasta id (o leaf si no se da).
+     */
+    breadcrumb(id?: string): string[];
+    /**
+     * Serializa a JSONL: una entrada por línea, en orden de inserción.
+     */
+    toJSONL(): string;
+    /**
+     * Reconstruye desde JSONL. La leaf queda en la última entrada del fichero.
+     */
+    static fromJSONL(s: string): JournalTree;
+    fromJSONL(s: string): JournalTree;
+    /** Hijos directos de parentId */
+    childrenOf(parentId: string | null): JournalEntry[];
+    entries(): JournalEntry[];
+    /**
+     * Escribe el JSONL de forma atómica (temp + fsync + rename) con commitGuard.
+     * El guard se invoca sincrónicamente justo antes de publicar; si devuelve
+     * false el fichero queda intacto (contrato discard-on-abandon).
+     */
+    saveAtomic(filePath: string, commitGuard?: () => boolean): void;
+    /** Alias histórico — mismo contrato atómico. */
+    persist(filePath: string, commitGuard?: () => boolean): void;
+    /**
+     * Carga desde fichero (si existe) o retorna árbol vacío si no existe.
+     */
+    static loadAtomic(filePath: string): JournalTree;
+    /** Lector atómico desde disco hacia instancia. */
+    loadAtomic(filePath: string): JournalTree;
+}
+//# sourceMappingURL=journal-tree.d.ts.map

package/dist/core/sesion/journal-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"journal-tree.d.ts","sourceRoot":"","sources":["../../../src/core/sesion/journal-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAMH,MAAM,WAAW,YAAY;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,EAAE,WAAW,CAAC,GAAG;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AAMzF,qBAAa,WAAW;;IAKvB,IAAI,MAAM,IAAI,MAAM,GAAG,IAAI,CAE1B;IAED,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,MAAM,CAAC,KAAK,EAAE,iBAAiB,GAAG,YAAY;IAuB9C,OAAO,IAAI,YAAY,GAAG,SAAS;IAKnC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAIxB,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS;IAIzC;;;OAGG;IACH,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAM5B;;;;OAIG;IACH,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAqBvD;;OAEG;IACH,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAmBjC;;OAEG;IACH,OAAO,IAAI,MAAM;IAWjB;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,WAAW;IAuCxC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,WAAW;IAIjC,iCAAiC;IACjC,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,GAAG,YAAY,EAAE;IASnD,OAAO,IAAI,YAAY,EAAE;IAMzB;;;;OAIG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,OAAO,GAAG,IAAI;IAS/D,gDAAgD;IAChD,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,OAAO,GAAG,IAAI;IAI5D;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW;IAMhD,kDAAkD;IAClD,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW;CAGzC"}

package/dist/core/sesion/journal-tree.js

@@ -0,0 +1,241 @@
+/**
+ * Journal arbolado atómico — A01/A02/A03 (Fase 2).
+ *
+ * Referencia omp: session/session-manager.ts (JournalTree / SessionIndex) y
+ * session/session-storage.ts (writeTextAtomic + commitGuard sin yield).
+ *
+ * Diseño:
+ * - Entradas forman árbol por (id, parentId), leaf mutable (puntero vivo).
+ * - Persistencia via atomic-write (temp + fsync + rename atómico + commitGuard).
+ * - fork/move/breadcrumb son operaciones de árbol puras, sin IO.
+ * - toJSONL/fromJSONL es el formato en disco: una entrada por línea JSON.
+ */
+import * as fs from "node:fs";
+import { writeTextAtomicSync } from "../utils/atomic-write.js";
+function nowIso() {
+    return new Date().toISOString();
+}
+export class JournalTree {
+    #entries = new Map();
+    #order = [];
+    #leafId = null;
+    get leafId() {
+        return this.#leafId;
+    }
+    get size() {
+        return this.#entries.size;
+    }
+    append(entry) {
+        if (!entry.id || typeof entry.id !== "string")
+            throw new Error("append: id requerido");
+        if (this.#entries.has(entry.id))
+            throw new Error(`append: id duplicado ${entry.id}`);
+        if (entry.parentId !== null && entry.parentId !== undefined) {
+            if (!this.#entries.has(entry.parentId)) {
+                throw new Error(`append: parentId inexistente ${entry.parentId}`);
+            }
+            if (entry.parentId === entry.id)
+                throw new Error("append: parentId no puede ser el propio id");
+        }
+        const parentId = entry.parentId ?? null;
+        const stored = {
+            id: entry.id,
+            parentId,
+            type: entry.type,
+            data: entry.data,
+            timestamp: entry.timestamp ?? nowIso(),
+        };
+        this.#entries.set(stored.id, stored);
+        this.#order.push(stored.id);
+        this.#leafId = stored.id;
+        return stored;
+    }
+    getLeaf() {
+        if (this.#leafId === null)
+            return undefined;
+        return this.#entries.get(this.#leafId);
+    }
+    has(id) {
+        return this.#entries.has(id);
+    }
+    get(id) {
+        return this.#entries.get(id);
+    }
+    /**
+     * Mueve el puntero leaf a fromId (branch). No crea entrada nueva.
+     * Retorna el newLeafId (el mismo fromId validado).
+     */
+    fork(fromId) {
+        if (!this.#entries.has(fromId))
+            throw new Error(`fork: id inexistente ${fromId}`);
+        this.#leafId = fromId;
+        return fromId;
+    }
+    /**
+     * Re-parenta entryId bajo newParentId (null = raíz).
+     * Rechaza ciclos (newParentId no puede ser descendiente de entryId)
+     * y parent inexistente.
+     */
+    move(entryId, newParentId) {
+        const entry = this.#entries.get(entryId);
+        if (!entry)
+            throw new Error(`move: entry inexistente ${entryId}`);
+        if (newParentId !== null) {
+            if (!this.#entries.has(newParentId))
+                throw new Error(`move: newParent inexistente ${newParentId}`);
+            if (newParentId === entryId)
+                throw new Error("move: no puede ser padre de sí mismo");
+            // ciclo: si newParent desciende de entryId, rechazar
+            let cursor = newParentId;
+            const seen = new Set();
+            while (cursor !== null) {
+                if (cursor === entryId)
+                    throw new Error("move: ciclo — newParent es descendiente");
+                if (seen.has(cursor))
+                    break;
+                seen.add(cursor);
+                const cur = this.#entries.get(cursor);
+                if (!cur)
+                    break;
+                cursor = cur.parentId;
+            }
+        }
+        entry.parentId = newParentId;
+    }
+    /**
+     * Camino de ids desde raíz hasta id (o leaf si no se da).
+     */
+    breadcrumb(id) {
+        const target = id ?? this.#leafId;
+        if (target === null || target === undefined)
+            return [];
+        if (!this.#entries.has(target))
+            throw new Error(`breadcrumb: id inexistente ${target}`);
+        const chain = [];
+        const seen = new Set();
+        let cursor = target;
+        while (cursor !== null) {
+            if (seen.has(cursor))
+                throw new Error("breadcrumb: ciclo detectado");
+            seen.add(cursor);
+            chain.push(cursor);
+            const cur = this.#entries.get(cursor);
+            if (!cur)
+                break;
+            cursor = cur.parentId;
+        }
+        chain.reverse();
+        return chain;
+    }
+    /**
+     * Serializa a JSONL: una entrada por línea, en orden de inserción.
+     */
+    toJSONL() {
+        if (this.#order.length === 0)
+            return "";
+        let out = "";
+        for (const id of this.#order) {
+            const e = this.#entries.get(id);
+            if (!e)
+                continue;
+            out += `${JSON.stringify(e)}\n`;
+        }
+        return out;
+    }
+    /**
+     * Reconstruye desde JSONL. La leaf queda en la última entrada del fichero.
+     */
+    static fromJSONL(s) {
+        const tree = new JournalTree();
+        if (!s.trim())
+            return tree;
+        const lines = s.split("\n");
+        for (const line of lines) {
+            const t = line.trim();
+            if (!t)
+                continue;
+            let parsed;
+            try {
+                parsed = JSON.parse(t);
+            }
+            catch (_e) {
+                throw new Error(`fromJSONL: línea no es JSON válido: ${t.slice(0, 80)}`);
+            }
+            if (!parsed.id || typeof parsed.id !== "string")
+                throw new Error("fromJSONL: entrada sin id");
+            // Permitir reconstruir aunque parentId aún no esté insertado (orden puede variar tras move),
+            // pero validar que referencias finales sean coherentes.
+            const entry = {
+                id: parsed.id,
+                parentId: parsed.parentId ?? null,
+                type: parsed.type ?? "message",
+                data: parsed.data,
+                timestamp: parsed.timestamp ?? nowIso(),
+            };
+            if (tree.#entries.has(entry.id))
+                throw new Error(`fromJSONL: id duplicado ${entry.id}`);
+            tree.#entries.set(entry.id, entry);
+            tree.#order.push(entry.id);
+        }
+        // validar que todo parentId existe (o null)
+        for (const id of tree.#order) {
+            const e = tree.#entries.get(id);
+            if (e.parentId !== null && !tree.#entries.has(e.parentId)) {
+                throw new Error(`fromJSONL: parentId inexistente ${e.parentId} para ${e.id}`);
+            }
+        }
+        if (tree.#order.length > 0)
+            tree.#leafId = tree.#order[tree.#order.length - 1];
+        return tree;
+    }
+    // instancia delegada para ergonomía (spec la menciona como método)
+    fromJSONL(s) {
+        return JournalTree.fromJSONL(s);
+    }
+    /** Hijos directos de parentId */
+    childrenOf(parentId) {
+        const out = [];
+        for (const id of this.#order) {
+            const e = this.#entries.get(id);
+            if (e.parentId === parentId)
+                out.push(e);
+        }
+        return out;
+    }
+    entries() {
+        return this.#order.map((id) => this.#entries.get(id)).filter(Boolean);
+    }
+    // --- Persistencia atómica (commitGuard sin yield) -----------------------------
+    /**
+     * Escribe el JSONL de forma atómica (temp + fsync + rename) con commitGuard.
+     * El guard se invoca sincrónicamente justo antes de publicar; si devuelve
+     * false el fichero queda intacto (contrato discard-on-abandon).
+     */
+    saveAtomic(filePath, commitGuard) {
+        const content = this.toJSONL();
+        if (commitGuard) {
+            writeTextAtomicSync(filePath, content, { commitGuard });
+        }
+        else {
+            writeTextAtomicSync(filePath, content);
+        }
+    }
+    /** Alias histórico — mismo contrato atómico. */
+    persist(filePath, commitGuard) {
+        this.saveAtomic(filePath, commitGuard);
+    }
+    /**
+     * Carga desde fichero (si existe) o retorna árbol vacío si no existe.
+     */
+    static loadAtomic(filePath) {
+        if (!fs.existsSync(filePath))
+            return new JournalTree();
+        const s = fs.readFileSync(filePath, "utf-8");
+        return JournalTree.fromJSONL(s);
+    }
+    /** Lector atómico desde disco hacia instancia. */
+    loadAtomic(filePath) {
+        return JournalTree.loadAtomic(filePath);
+    }
+}
+//# sourceMappingURL=journal-tree.js.map

package/dist/core/sesion/journal-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"journal-tree.js","sourceRoot":"","sources":["../../../src/core/sesion/journal-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAE9B,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAY/D,SAAS,MAAM;IACd,OAAO,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AACjC,CAAC;AAED,MAAM,OAAO,WAAW;IACvB,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC3C,MAAM,GAAa,EAAE,CAAC;IACtB,OAAO,GAAkB,IAAI,CAAC;IAE9B,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED,MAAM,CAAC,KAAwB;QAC9B,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,QAAQ;YAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;QACvF,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QACrF,IAAI,KAAK,CAAC,QAAQ,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC7D,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CAAC,gCAAgC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YACnE,CAAC;YACD,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC,EAAE;gBAAE,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChG,CAAC;QACD,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC;QACxC,MAAM,MAAM,GAAiB;YAC5B,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,QAAQ;YACR,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,MAAM,EAAE;SACtC,CAAC;QACF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IACf,CAAC;IAED,OAAO;QACN,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5C,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAED,GAAG,CAAC,EAAU;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,GAAG,CAAC,EAAU;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,MAAc;QAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,MAAM,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,OAAe,EAAE,WAA0B;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,OAAO,EAAE,CAAC,CAAC;QAClE,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,WAAW,EAAE,CAAC,CAAC;YACnG,IAAI,WAAW,KAAK,OAAO;gBAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;YACrF,qDAAqD;YACrD,IAAI,MAAM,GAAkB,WAAW,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;YAC/B,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;gBACxB,IAAI,MAAM,KAAK,OAAO;oBAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;gBACnF,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,MAAM;gBAC5B,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACjB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACtC,IAAI,CAAC,GAAG;oBAAE,MAAM;gBAChB,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC;YACvB,CAAC;QACF,CAAC;QACD,KAAK,CAAC,QAAQ,GAAG,WAAW,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,EAAW;QACrB,MAAM,MAAM,GAAG,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC;QAClC,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,CAAC;QACvD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,MAAM,EAAE,CAAC,CAAC;QACxF,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,MAAM,GAAkB,MAAM,CAAC;QACnC,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;YACrE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,CAAC,GAAG;gBAAE,MAAM;YAChB,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC;QACvB,CAAC;QACD,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO;QACN,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACxC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,GAAG,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAS;QACzB,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE;YAAE,OAAO,IAAI,CAAC;QAC3B,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,IAAI,MAAoB,CAAC;YACzB,IAAI,CAAC;gBACJ,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAiB,CAAC;YACxC,CAAC;YAAC,OAAO,EAAE,EAAE,CAAC;gBACb,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1E,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,OAAO,MAAM,CAAC,EAAE,KAAK,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAC9F,6FAA6F;YAC7F,wDAAwD;YACxD,MAAM,KAAK,GAAiB;gBAC3B,EAAE,EAAE,MAAM,CAAC,EAAE;gBACb,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,IAAI;gBACjC,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,SAAS;gBAC9B,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,MAAM,EAAE;aACvC,CAAC;YACF,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YACxF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACnC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;QACD,4CAA4C;QAC5C,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACjC,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3D,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC,QAAQ,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/E,CAAC;QACF,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QAChF,OAAO,IAAI,CAAC;IACb,CAAC;IAED,mEAAmE;IACnE,SAAS,CAAC,CAAS;QAClB,OAAO,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,iCAAiC;IACjC,UAAU,CAAC,QAAuB;QACjC,MAAM,GAAG,GAAmB,EAAE,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACjC,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,OAAO;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACxE,CAAC;IAED,iFAAiF;IAEjF;;;;OAIG;IACH,UAAU,CAAC,QAAgB,EAAE,WAA2B;QACvD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC/B,IAAI,WAAW,EAAE,CAAC;YACjB,mBAAmB,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC;QACzD,CAAC;aAAM,CAAC;YACP,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACxC,CAAC;IACF,CAAC;IAED,gDAAgD;IAChD,OAAO,CAAC,QAAgB,EAAE,WAA2B;QACpD,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,QAAgB;QACjC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,WAAW,EAAE,CAAC;QACvD,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC7C,OAAO,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,kDAAkD;IAClD,UAAU,CAAC,QAAgB;QAC1B,OAAO,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;CACD"}

package/dist/core/sesion/turn-recovery.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Recuperación de turnos + rotación de credenciales — A01/A02/A03 (Fase 2).
+ *
+ * Referencia omp:
+ * - packages/coding-agent/src/session/turn-recovery.ts (retry, fallback, USAGE)
+ * - packages/ai/src/error/flags.ts (Transient / UsageLimit / resto = fatal)
+ *
+ * Contrato de este módulo:
+ * - classifyError(err): "retryable" | "fatal" | "quota"
+ *   retryable = transitorio digno de reintento (429 sin quota, 5xx, red, stall)
+ *   quota     = UsageLimit / 402 / "insufficient_quota" / "billing" / preflight
+ *   fatal     = resto (400 bad request estricto, 401/403 auth, gramática, bloqueo)
+ *   Precedencia: quota > retryable > fatal (una quota con 429 no es retryable).
+ *
+ * - nextCredential(current, policy): credential
+ *   policy puede ser: string[] | Credential[] | { credentials: (string|Credential)[] }
+ *   hermana logic: si la credencial actual tiene `account` y hay otra con la
+ *   misma cuenta, esa hermana va antes que cualquier otra cuenta (force-refresh
+ *   falló → rotar dentro de la misma cuenta). Si no hay hermana, round-robin.
+ */
+export type ErrorClass = "retryable" | "fatal" | "quota";
+export interface Credential {
+    id: string;
+    account?: string;
+    [key: string]: unknown;
+}
+export type CredentialLike = string | Credential;
+export type RotationPolicy = CredentialLike[] | {
+    credentials: CredentialLike[];
+    [k: string]: unknown;
+} | {
+    siblings?: unknown;
+    [k: string]: unknown;
+};
+export declare class TurnRecovery {
+    classifyError(err: unknown): ErrorClass;
+    /**
+     * Rotación a/b/c.
+     *
+     * - policy como array: ["a","b","c"] → round-robin.
+     * - policy con objetos {id, account}: misma cuenta force-refresh → hermana
+     *   antes que siguiente cuenta.
+     * - current puede ser string o {id, account}.
+     * - Retorna undefined si no hay alternativa distinta.
+     */
+    nextCredential(current: CredentialLike, policy: RotationPolicy): CredentialLike | undefined;
+}
+//# sourceMappingURL=turn-recovery.d.ts.map

package/dist/core/sesion/turn-recovery.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"turn-recovery.d.ts","sourceRoot":"","sources":["../../../src/core/sesion/turn-recovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,MAAM,MAAM,UAAU,GAAG,WAAW,GAAG,OAAO,GAAG,OAAO,CAAC;AAEzD,MAAM,WAAW,UAAU;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,UAAU,CAAC;AAEjD,MAAM,MAAM,cAAc,GACvB,cAAc,EAAE,GAChB;IAAE,WAAW,EAAE,cAAc,EAAE,CAAC;IAAC,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAA;CAAE,GACvD;IAAE,QAAQ,CAAC,EAAE,OAAO,CAAC;IAAC,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAA;CAAE,CAAC;AAsDhD,qBAAa,YAAY;IACxB,aAAa,CAAC,GAAG,EAAE,OAAO,GAAG,UAAU;IAgBvC;;;;;;;;OAQG;IACH,cAAc,CAAC,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,GAAG,cAAc,GAAG,SAAS;CA8C3F"}