@telora/daemon 0.18.55 → 0.18.61

package/dist/reality-writeback.d.ts

@@ -0,0 +1,257 @@
+/**
+ * Reality-tree writeback: decide the per-node verify classification a landing
+ * stamps onto the nodes an injection owns.
+ *
+ * The differential problem this closes: a confident-but-wrong tree stays wrong
+ * because reality never writes back. When a delivery lands, the injection it
+ * materialized is flipped to `verified`, but the *targeted* UDE nodes are not
+ * told whether the asserted desired effect actually held. So a mistaken claim
+ * is frozen, not corrected. This module computes -- deterministically, from a
+ * small typed landing signal -- what status each targeted node should carry so
+ * a later reader can see which claims actually realized.
+ *
+ * Reuses the EXISTING node verify-classification model (no new status
+ * machinery, no migration):
+ *   - `classification`: 'match' | 'legitimate_divergence' | 'shortfall'
+ *     (mirrors reality_tree_nodes.verify_classification)
+ *   - `evidence`: rationale for a clean realization (-> node.evidence)
+ *   - `verifyDivergenceReason`: why the achieved effect differs
+ *     (-> node.verify_divergence_reason)
+ *
+ * The function is PURE: no DB, no I/O, no clock. The dispatcher (close-loop
+ * landing path) supplies the landing signal and applies the result via the
+ * existing callApi verify / node-update seam. Nothing here is destructive --
+ * the output only stamps status + evidence/reason on nodes the injection owns.
+ *
+ * @module reality-writeback
+ */
+/** The three verify outcomes a node can carry. Mirrors VerifyClassification
+ * in src/types/reality-tree.ts -- duplicated here only because the daemon
+ * cannot import the Vite app's types. */
+export type WritebackClassification = 'match' | 'legitimate_divergence' | 'shortfall';
+/**
+ * One node the injection targets, as seen at landing. Intentionally minimal --
+ * just enough to identify the node and, optionally, observe whether its UDE
+ * flipped and how the achieved effect compares to what was declared. We model
+ * the landing observation per-node so a partially-divergent landing (one UDE
+ * flipped, another did not) stamps each node correctly.
+ */
+export interface TargetedNodeLanding {
+    /** reality_tree_nodes.id of the UDE this injection targeted. */
+    nodeId: string;
+    /**
+     * The node's ACHIEVED desired-effect prose. For a clean `match`, this is the
+     * declared desired effect carried forward unchanged (achieved == declared).
+     * Carried into the writeback's `statement` so the apply step has non-empty
+     * prose -- the verify edge only stamps a node's classification when the
+     * restatement carries a non-empty statement (an empty statement is dropped
+     * whole, classification included). Optional: omit when no prose is available
+     * and the apply step will fall back to leaving the node un-stamped.
+     */
+    achievedStatement?: string;
+    /**
+     * Did the FRT cascade actually flip this targeted UDE (UDE -> DE)? A clean
+     * landing flips it; a divergent landing leaves it unflipped. Optional so a
+     * caller that only has a focus-wide clean/divergent signal can omit it and
+     * fall back to the landing-level `cascadeFlipped`.
+     */
+    flipped?: boolean;
+    /**
+     * Whether the achieved effect (what reality delivered) differs from the
+     * declared desired effect even though the UDE flipped. A flipped-but-different
+     * landing is a `legitimate_divergence`, not a `match`.
+     */
+    achievedDiffersFromDeclared?: boolean;
+    /**
+     * Free-text reason describing the divergence or shortfall. Carried verbatim
+     * into verifyDivergenceReason. Ignored for a clean match.
+     */
+    divergenceReason?: string;
+    /**
+     * The node's ORIGINAL claim -- its declared desired-effect prose
+     * (frt_statement, else statement) AS IT STOOD BEFORE this landing. Distinct
+     * from `achievedStatement` (what reality delivered). Carried onto the
+     * writeback so the inward-drift detector can frame the contradiction as the
+     * tree's claim (observedState) vs what reality showed (proposedCorrection).
+     * A confident-but-wrong assertion is corrected by surfacing the CLAIM the
+     * ratifier must reconsider, not the reality that already happened. Optional:
+     * absent, the inward detector falls back to a deterministic placeholder.
+     */
+    originalClaim?: string;
+}
+/**
+ * The landing signal for one injection. Deliberately NOT coupled to a live
+ * derive_frt run -- the caller distills derive_frt (or a simpler delivery
+ * close) into this typed shape and hands it in.
+ */
+export interface InjectionLanding {
+    /** reality_tree_nodes.id of the injection node that landed. */
+    injectionId: string;
+    /** The nodes this injection targets (the UDEs it claimed to dissolve). */
+    targetedNodes: readonly TargetedNodeLanding[];
+    /**
+     * Landing-wide flip signal: did the cascade flip the targeted UDEs as a
+     * whole? Used as the fallback when a `TargetedNodeLanding` does not carry its
+     * own per-node `flipped`. A clean landing is `true`; a divergent landing is
+     * `false`.
+     */
+    cascadeFlipped: boolean;
+    /**
+     * Did the injection deliver its effect at all? When false, the gap means the
+     * injection did not produce the intended change and the targeted nodes are
+     * stamped `shortfall` rather than `legitimate_divergence`. Defaults to true
+     * (the injection delivered something) when omitted.
+     */
+    delivered?: boolean;
+    /**
+     * Evidence text for a clean realization. Cited verbatim on each matched
+     * node's evidence field so an audit read can trace why the claim was
+     * accepted. Optional -- absent, the match carries no evidence string.
+     */
+    evidence?: string;
+}
+/**
+ * Per-node writeback decision. Shaped to feed straight into the existing
+ * verify/node-update seam:
+ *   - match               -> stamp evidence (the achieved effect held)
+ *   - legitimate_divergence | shortfall -> stamp verifyDivergenceReason
+ */
+export interface NodeWriteback {
+    nodeId: string;
+    classification: WritebackClassification;
+    /**
+     * The achieved desired-effect prose to stamp on the node alongside the
+     * classification, carried from the landing's `achievedStatement`. Required
+     * by the apply step for the classification to land (the verify edge drops a
+     * restatement with an empty statement). Absent when the landing supplied no
+     * prose -- the apply step then skips the node.
+     */
+    statement?: string;
+    /** Set only for `match`; the rationale the claim held. */
+    evidence?: string;
+    /** Set only for divergence/shortfall; why the achieved effect differs. */
+    verifyDivergenceReason?: string;
+    /**
+     * The node's ORIGINAL claim (declared desired-effect prose before this
+     * landing), carried from the landing's `originalClaim`. Distinct from
+     * `statement` (the ACHIEVED prose). Threaded so a contradicted node's inward
+     * drift proposal frames the tree's claim (observedState), not the reality
+     * that already happened. Absent when the landing supplied no original claim.
+     */
+    originalClaim?: string;
+    /**
+     * TEL-6: an `assumed` match is a clean landing that carries NO evidence.
+     * Recording it as a `verified` (`match`) stamp would assert an UNEARNED
+     * certainty -- the exact disease this writeback fights. So an unevidenced
+     * match is flagged `assumed` and the apply step does NOT persist a
+     * `verify_classification='match'` for it (it stays unstamped until grounded).
+     * Only ever true on a `match`.
+     */
+    assumed?: boolean;
+}
+/**
+ * Pure decision: given one injection's landing signal, decide the per-node
+ * writeback for each targeted node.
+ *
+ * Rules (deterministic, evaluated per node):
+ *   1. Empty target set            -> empty output.
+ *   2. Injection did not deliver    -> EVERY node 'shortfall' + reason.
+ *      (delivered === false; the gap means the injection produced nothing.)
+ *   3. Node flipped AND achieved == declared -> 'match' (+ evidence if any).
+ *      Flip is the node's own `flipped` when present, else the landing's
+ *      `cascadeFlipped`.
+ *   4. Node flipped BUT achieved differs     -> 'legitimate_divergence'
+ *      (+ verifyDivergenceReason).
+ *   5. Node did NOT flip                      -> 'legitimate_divergence'
+ *      (+ verifyDivergenceReason) -- the targeted UDE did not move as claimed,
+ *      but the injection still delivered (rule 2 already handled non-delivery).
+ *
+ * No side effects. The caller applies the result via callApi.
+ */
+export declare function decideNodeWriteback(landing: InjectionLanding): NodeWriteback[];
+/**
+ * True iff the landing realized cleanly: every targeted node matched. An
+ * empty target set is vacuously clean. Convenience predicate for callers that
+ * need a single clean/divergent bit (e.g. to choose whether to short-circuit
+ * the flip), derived from the same pure decision so the two never disagree.
+ */
+export declare function isCleanLanding(landing: InjectionLanding): boolean;
+/**
+ * One node's stamped verify status as the inward detector sees it. Mirrors the
+ * columns the writeback persists onto reality_tree_nodes
+ * (`verify_classification` / `verify_divergence_reason`) plus the node's own
+ * claim prose, so the detector can frame the contradiction as
+ * observedState (the claim) vs proposedCorrection (what reality showed).
+ *
+ * Deliberately decoupled from `NodeWriteback`: any caller with a stamped node
+ * row (a fresh DB read, or the writeback's own output) can satisfy this shape.
+ */
+export interface StampedNode {
+    /** reality_tree_nodes.id of the stamped node. */
+    nodeId: string;
+    /**
+     * The node's stamped verify classification. `null`/`undefined` = unstamped
+     * (reality has not written back yet) -> no inward proposal.
+     */
+    verifyClassification?: WritebackClassification | null;
+    /** The recorded reason the achieved effect diverged. */
+    verifyDivergenceReason?: string | null;
+    /**
+     * The tree's CLAIM about this node -- its declared desired-effect prose
+     * (frt_statement, else statement). Carried into the proposal's observedState
+     * as the assertion reality contradicted. Optional: absent, a deterministic
+     * placeholder is used so the proposal still frames the contradiction.
+     */
+    claimStatement?: string | null;
+}
+/**
+ * The inward drift-proposal payload, shaped to feed straight into the existing
+ * `crt_drift_proposal_create` edge action (snake-cased by the caller / edge).
+ * `proposalKind` is always `update_statement` -- a contradicted claim is a
+ * claim whose statement reality showed to be wrong; the human ratifier decides
+ * the actual correction. `proposedMetadata.inward` flags it as INWARD drift
+ * (vs outward audit drift) and `sourceNodeId` records the stamped node that
+ * produced it.
+ */
+export interface InwardDriftProposal {
+    nodeId: string;
+    proposalKind: 'update_statement';
+    /** The tree's claim about the node -- the assertion reality contradicted. */
+    observedState: string;
+    /** What realized reality showed (the divergence reason) -- the correction. */
+    proposedCorrection: string;
+    proposedMetadata: {
+        /** Distinguishes inward (reality-contradicts-tree) from outward audit drift. */
+        inward: true;
+        /** The stamped node id that produced this proposal. */
+        sourceNodeId: string;
+        /** The stamped classification that triggered it (legitimate_divergence | shortfall). */
+        verifyClassification: 'legitimate_divergence' | 'shortfall';
+    };
+}
+/**
+ * Pure inward-drift detector.
+ *
+ * Detection rule (deterministic): a node whose `verifyClassification` is
+ * `legitimate_divergence` or `shortfall` is a CONTRADICTED claim -- realized
+ * reality did not match what the tree asserted. It maps to one inward
+ * `update_statement` drift proposal carrying:
+ *   - observedState      = the tree's claim (claimStatement, else a placeholder)
+ *   - proposedCorrection = what reality showed (verifyDivergenceReason, else a
+ *                          placeholder)
+ *   - proposedMetadata   = { inward:true, sourceNodeId, verifyClassification }
+ *
+ * A node stamped `match` produces NO proposal (reality confirmed the claim).
+ * An unstamped node (null/undefined classification) produces NO proposal
+ * (reality has not written back yet, so there is nothing to contradict).
+ *
+ * No side effects. The caller surfaces the result via crt_drift_proposal_create
+ * -- never auto-applies it.
+ */
+export declare function detectInwardDrift(node: StampedNode): InwardDriftProposal | null;
+/**
+ * Batch convenience: run `detectInwardDrift` over many stamped nodes, dropping
+ * the nulls. Order-preserving; pure.
+ */
+export declare function detectInwardDriftForNodes(nodes: readonly StampedNode[]): InwardDriftProposal[];
+//# sourceMappingURL=reality-writeback.d.ts.map

package/dist/reality-writeback.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reality-writeback.d.ts","sourceRoot":"","sources":["../src/reality-writeback.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH;;yCAEyC;AACzC,MAAM,MAAM,uBAAuB,GAAG,OAAO,GAAG,uBAAuB,GAAG,WAAW,CAAC;AAEtF;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IAClC,gEAAgE;IAChE,MAAM,EAAE,MAAM,CAAC;IACf;;;;;;;;OAQG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B;;;;;OAKG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB;;;;OAIG;IACH,2BAA2B,CAAC,EAAE,OAAO,CAAC;IACtC;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;;;;;;;OASG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,+DAA+D;IAC/D,WAAW,EAAE,MAAM,CAAC;IACpB,0EAA0E;IAC1E,aAAa,EAAE,SAAS,mBAAmB,EAAE,CAAC;IAC9C;;;;;OAKG;IACH,cAAc,EAAE,OAAO,CAAC;IACxB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,cAAc,EAAE,uBAAuB,CAAC;IACxC;;;;;;OAMG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,0DAA0D;IAC1D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,0EAA0E;IAC1E,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC;;;;;;OAMG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAWD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,gBAAgB,GAAG,aAAa,EAAE,CAyE9E;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAEjE;AAqBD;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC1B,iDAAiD;IACjD,MAAM,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,oBAAoB,CAAC,EAAE,uBAAuB,GAAG,IAAI,CAAC;IACtD,wDAAwD;IACxD,sBAAsB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACvC;;;;;OAKG;IACH,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,mBAAmB;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,kBAAkB,CAAC;IACjC,6EAA6E;IAC7E,aAAa,EAAE,MAAM,CAAC;IACtB,8EAA8E;IAC9E,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE;QAChB,gFAAgF;QAChF,MAAM,EAAE,IAAI,CAAC;QACb,uDAAuD;QACvD,YAAY,EAAE,MAAM,CAAC;QACrB,wFAAwF;QACxF,oBAAoB,EAAE,uBAAuB,GAAG,WAAW,CAAC;KAC7D,CAAC;CACH;AAOD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,WAAW,GAAG,mBAAmB,GAAG,IAAI,CA2B/E;AAED;;;GAGG;AACH,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,SAAS,WAAW,EAAE,GAC5B,mBAAmB,EAAE,CAOvB"}

package/dist/reality-writeback.js

@@ -0,0 +1,179 @@
+/**
+ * Reality-tree writeback: decide the per-node verify classification a landing
+ * stamps onto the nodes an injection owns.
+ *
+ * The differential problem this closes: a confident-but-wrong tree stays wrong
+ * because reality never writes back. When a delivery lands, the injection it
+ * materialized is flipped to `verified`, but the *targeted* UDE nodes are not
+ * told whether the asserted desired effect actually held. So a mistaken claim
+ * is frozen, not corrected. This module computes -- deterministically, from a
+ * small typed landing signal -- what status each targeted node should carry so
+ * a later reader can see which claims actually realized.
+ *
+ * Reuses the EXISTING node verify-classification model (no new status
+ * machinery, no migration):
+ *   - `classification`: 'match' | 'legitimate_divergence' | 'shortfall'
+ *     (mirrors reality_tree_nodes.verify_classification)
+ *   - `evidence`: rationale for a clean realization (-> node.evidence)
+ *   - `verifyDivergenceReason`: why the achieved effect differs
+ *     (-> node.verify_divergence_reason)
+ *
+ * The function is PURE: no DB, no I/O, no clock. The dispatcher (close-loop
+ * landing path) supplies the landing signal and applies the result via the
+ * existing callApi verify / node-update seam. Nothing here is destructive --
+ * the output only stamps status + evidence/reason on nodes the injection owns.
+ *
+ * @module reality-writeback
+ */
+/**
+ * Default reason text used when a divergent/short landing carries no per-node
+ * reason. Deterministic so the output is stable for tests and audits.
+ */
+const DEFAULT_DIVERGENCE_REASON = 'Targeted effect did not flip cleanly on landing; recorded as divergence pending review.';
+const DEFAULT_SHORTFALL_REASON = 'Injection did not deliver its intended effect on landing; targeted UDE remains.';
+/**
+ * Pure decision: given one injection's landing signal, decide the per-node
+ * writeback for each targeted node.
+ *
+ * Rules (deterministic, evaluated per node):
+ *   1. Empty target set            -> empty output.
+ *   2. Injection did not deliver    -> EVERY node 'shortfall' + reason.
+ *      (delivered === false; the gap means the injection produced nothing.)
+ *   3. Node flipped AND achieved == declared -> 'match' (+ evidence if any).
+ *      Flip is the node's own `flipped` when present, else the landing's
+ *      `cascadeFlipped`.
+ *   4. Node flipped BUT achieved differs     -> 'legitimate_divergence'
+ *      (+ verifyDivergenceReason).
+ *   5. Node did NOT flip                      -> 'legitimate_divergence'
+ *      (+ verifyDivergenceReason) -- the targeted UDE did not move as claimed,
+ *      but the injection still delivered (rule 2 already handled non-delivery).
+ *
+ * No side effects. The caller applies the result via callApi.
+ */
+export function decideNodeWriteback(landing) {
+    const nodes = landing.targetedNodes;
+    if (nodes.length === 0)
+        return [];
+    const delivered = landing.delivered ?? true;
+    const withStatement = (out, node) => {
+        if (typeof node.achievedStatement === 'string' && node.achievedStatement.trim().length > 0) {
+            out.statement = node.achievedStatement;
+        }
+        // Carry the node's ORIGINAL claim (pre-landing prose) so a contradicted
+        // node's inward drift proposal can frame the tree's claim, not the achieved
+        // reality. Absent -> the inward detector uses a deterministic placeholder.
+        if (typeof node.originalClaim === 'string' && node.originalClaim.trim().length > 0) {
+            out.originalClaim = node.originalClaim;
+        }
+        return out;
+    };
+    return nodes.map((node) => {
+        // Rule 2: the injection delivered nothing -> shortfall for every node.
+        if (!delivered) {
+            return withStatement({
+                nodeId: node.nodeId,
+                classification: 'shortfall',
+                verifyDivergenceReason: node.divergenceReason ?? DEFAULT_SHORTFALL_REASON,
+            }, node);
+        }
+        const flipped = node.flipped ?? landing.cascadeFlipped;
+        // Rule 5: the targeted UDE did not flip -> legitimate divergence.
+        if (!flipped) {
+            return withStatement({
+                nodeId: node.nodeId,
+                classification: 'legitimate_divergence',
+                verifyDivergenceReason: node.divergenceReason ?? DEFAULT_DIVERGENCE_REASON,
+            }, node);
+        }
+        // Rule 4: flipped, but the achieved effect differs from declared.
+        if (node.achievedDiffersFromDeclared === true) {
+            return withStatement({
+                nodeId: node.nodeId,
+                classification: 'legitimate_divergence',
+                verifyDivergenceReason: node.divergenceReason ?? DEFAULT_DIVERGENCE_REASON,
+            }, node);
+        }
+        // Rule 3: clean match.
+        const out = { nodeId: node.nodeId, classification: 'match' };
+        const hasEvidence = typeof landing.evidence === 'string' && landing.evidence.trim().length > 0;
+        if (hasEvidence) {
+            out.evidence = landing.evidence;
+        }
+        else {
+            // TEL-6: a match with NO evidence is an UNEARNED 'verified' claim. Flag it
+            // `assumed` so the apply step does not persist verify_classification='match'
+            // -- we never record an unevidenced "verified" stamp (the disease this
+            // writeback fights). The node stays unstamped until grounded by evidence.
+            out.assumed = true;
+        }
+        return withStatement(out, node);
+    });
+}
+/**
+ * True iff the landing realized cleanly: every targeted node matched. An
+ * empty target set is vacuously clean. Convenience predicate for callers that
+ * need a single clean/divergent bit (e.g. to choose whether to short-circuit
+ * the flip), derived from the same pure decision so the two never disagree.
+ */
+export function isCleanLanding(landing) {
+    return decideNodeWriteback(landing).every((w) => w.classification === 'match');
+}
+const INWARD_OBSERVED_PLACEHOLDER = "The tree's claim for this node (statement not captured at detection time).";
+const INWARD_CORRECTION_PLACEHOLDER = 'Realized reality diverged from this claim on landing; reason not recorded.';
+/**
+ * Pure inward-drift detector.
+ *
+ * Detection rule (deterministic): a node whose `verifyClassification` is
+ * `legitimate_divergence` or `shortfall` is a CONTRADICTED claim -- realized
+ * reality did not match what the tree asserted. It maps to one inward
+ * `update_statement` drift proposal carrying:
+ *   - observedState      = the tree's claim (claimStatement, else a placeholder)
+ *   - proposedCorrection = what reality showed (verifyDivergenceReason, else a
+ *                          placeholder)
+ *   - proposedMetadata   = { inward:true, sourceNodeId, verifyClassification }
+ *
+ * A node stamped `match` produces NO proposal (reality confirmed the claim).
+ * An unstamped node (null/undefined classification) produces NO proposal
+ * (reality has not written back yet, so there is nothing to contradict).
+ *
+ * No side effects. The caller surfaces the result via crt_drift_proposal_create
+ * -- never auto-applies it.
+ */
+export function detectInwardDrift(node) {
+    const classification = node.verifyClassification;
+    if (classification !== 'legitimate_divergence' && classification !== 'shortfall') {
+        // 'match', null, undefined -> no contradiction to correct.
+        return null;
+    }
+    const claim = typeof node.claimStatement === 'string' && node.claimStatement.trim().length > 0
+        ? node.claimStatement
+        : INWARD_OBSERVED_PLACEHOLDER;
+    const correction = typeof node.verifyDivergenceReason === 'string' && node.verifyDivergenceReason.trim().length > 0
+        ? node.verifyDivergenceReason
+        : INWARD_CORRECTION_PLACEHOLDER;
+    return {
+        nodeId: node.nodeId,
+        proposalKind: 'update_statement',
+        observedState: claim,
+        proposedCorrection: correction,
+        proposedMetadata: {
+            inward: true,
+            sourceNodeId: node.nodeId,
+            verifyClassification: classification,
+        },
+    };
+}
+/**
+ * Batch convenience: run `detectInwardDrift` over many stamped nodes, dropping
+ * the nulls. Order-preserving; pure.
+ */
+export function detectInwardDriftForNodes(nodes) {
+    const out = [];
+    for (const node of nodes) {
+        const proposal = detectInwardDrift(node);
+        if (proposal)
+            out.push(proposal);
+    }
+    return out;
+}
+//# sourceMappingURL=reality-writeback.js.map

package/dist/reality-writeback.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reality-writeback.js","sourceRoot":"","sources":["../src/reality-writeback.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAkIH;;;GAGG;AACH,MAAM,yBAAyB,GAC7B,yFAAyF,CAAC;AAC5F,MAAM,wBAAwB,GAC5B,iFAAiF,CAAC;AAEpF;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAyB;IAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,CAAC;IACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAE5C,MAAM,aAAa,GAAG,CAAC,GAAkB,EAAE,IAAyB,EAAiB,EAAE;QACrF,IAAI,OAAO,IAAI,CAAC,iBAAiB,KAAK,QAAQ,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3F,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACzC,CAAC;QACD,wEAAwE;QACxE,4EAA4E;QAC5E,2EAA2E;QAC3E,IAAI,OAAO,IAAI,CAAC,aAAa,KAAK,QAAQ,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnF,GAAG,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QACzC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACxB,uEAAuE;QACvE,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,aAAa,CAClB;gBACE,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,cAAc,EAAE,WAAW;gBAC3B,sBAAsB,EAAE,IAAI,CAAC,gBAAgB,IAAI,wBAAwB;aAC1E,EACD,IAAI,CACL,CAAC;QACJ,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,cAAc,CAAC;QAEvD,kEAAkE;QAClE,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,aAAa,CAClB;gBACE,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,cAAc,EAAE,uBAAuB;gBACvC,sBAAsB,EAAE,IAAI,CAAC,gBAAgB,IAAI,yBAAyB;aAC3E,EACD,IAAI,CACL,CAAC;QACJ,CAAC;QAED,kEAAkE;QAClE,IAAI,IAAI,CAAC,2BAA2B,KAAK,IAAI,EAAE,CAAC;YAC9C,OAAO,aAAa,CAClB;gBACE,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,cAAc,EAAE,uBAAuB;gBACvC,sBAAsB,EAAE,IAAI,CAAC,gBAAgB,IAAI,yBAAyB;aAC3E,EACD,IAAI,CACL,CAAC;QACJ,CAAC;QAED,uBAAuB;QACvB,MAAM,GAAG,GAAkB,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC;QAC5E,MAAM,WAAW,GACf,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7E,IAAI,WAAW,EAAE,CAAC;YAChB,GAAG,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QAClC,CAAC;aAAM,CAAC;YACN,2EAA2E;YAC3E,6EAA6E;YAC7E,uEAAuE;YACvE,0EAA0E;YAC1E,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,OAAyB;IACtD,OAAO,mBAAmB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,OAAO,CAAC,CAAC;AACjF,CAAC;AA4ED,MAAM,2BAA2B,GAC/B,4EAA4E,CAAC;AAC/E,MAAM,6BAA6B,GACjC,4EAA4E,CAAC;AAE/E;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAiB;IACjD,MAAM,cAAc,GAAG,IAAI,CAAC,oBAAoB,CAAC;IACjD,IAAI,cAAc,KAAK,uBAAuB,IAAI,cAAc,KAAK,WAAW,EAAE,CAAC;QACjF,2DAA2D;QAC3D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GACT,OAAO,IAAI,CAAC,cAAc,KAAK,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAC9E,CAAC,CAAC,IAAI,CAAC,cAAc;QACrB,CAAC,CAAC,2BAA2B,CAAC;IAClC,MAAM,UAAU,GACd,OAAO,IAAI,CAAC,sBAAsB,KAAK,QAAQ,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAC9F,CAAC,CAAC,IAAI,CAAC,sBAAsB;QAC7B,CAAC,CAAC,6BAA6B,CAAC;IAEpC,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,YAAY,EAAE,kBAAkB;QAChC,aAAa,EAAE,KAAK;QACpB,kBAAkB,EAAE,UAAU;QAC9B,gBAAgB,EAAE;YAChB,MAAM,EAAE,IAAI;YACZ,YAAY,EAAE,IAAI,CAAC,MAAM;YACzB,oBAAoB,EAAE,cAAc;SACrC;KACF,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,yBAAyB,CACvC,KAA6B;IAE7B,MAAM,GAAG,GAA0B,EAAE,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,QAAQ;YAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/resolvers/shared/reality-tree.d.ts

@@ -43,6 +43,13 @@ export interface RealityNodeRow {
     injectionStatus: 'proposed' | 'in_progress' | 'realized' | 'verified' | null;
     dissolvesObstacle: string | null;
     enablesNodeId: string | null;
+    /**
+     * When a negative-branch reservation pass last completed for this injection
+     * node. null = never run (a surfaced doubt); set = a pass completed (clean or
+     * with candidates). Optional for back-compat with payloads predating the
+     * column. Only meaningful on injection nodes.
+     */
+    negativeBranchPassRanAt?: string | null;
     evidence: string | null;
 }
 export interface RealityEdgeRow {
@@ -61,6 +68,37 @@ export interface EdgeListResponse {
     totalCount: number;
 }
 export declare const CRT_DUMP_BUDGET_CHARS = 10000;
-export declare function renderRealityTreeDump(tree: RealityTreeRow, nodes: RealityNodeRow[], edges: RealityEdgeRow[], budgetChars: number): string;
+/**
+ * Deterministic presentability check (connectivity gate), daemon-local mirror
+ * of the canonical `validateTreeIntegrity` in src/lib/reality-tree/tree-integrity.ts.
+ *
+ * The daemon cannot import the canonical validator (it lives in the Vite
+ * workspace; the Deno `_shared` copy is generated, not importable from Node), so
+ * the SAME rule is inlined here: a node is an ORPHAN -- and the tree is NOT
+ * presentable -- when it has zero edges of ANY type touching it AND no evidence.
+ * A non-empty `evidence` string folds the node into its own basis. Only ACTIVE
+ * wiring counts: callers pass already-active nodes, and any edge whose endpoint
+ * is not in the active node set is ignored (it cannot rescue a node).
+ *
+ * Pure and order-independent. Returns the orphan seqs (ascending) so a refusal
+ * notice can name them, and `presentable` (no orphans).
+ */
+export declare function computeTreePresentability(nodes: RealityNodeRow[], edges: RealityEdgeRow[]): {
+    presentable: boolean;
+    orphanSeqs: number[];
+};
+export interface RenderRealityTreeDumpOptions {
+    /**
+     * When true, the connectivity gate is ENFORCED MECHANICALLY: a tree carrying
+     * an orphan (not presentable) is WITHHELD -- the node/edge body is replaced
+     * with a refusal notice naming the orphan seqs. Use this at a downstream
+     * DECISION seam (e.g. the ai_inspection runner) where a non-presentable tree
+     * must not silently become reasoning context. Default false: authoring /
+     * inspection surfaces render the full tree (with doubt surfaced) so an author
+     * can SEE the orphans and fix them -- the gate must never wedge editing.
+     */
+    enforcePresentable?: boolean;
+}
+export declare function renderRealityTreeDump(tree: RealityTreeRow, nodes: RealityNodeRow[], edges: RealityEdgeRow[], budgetChars: number, opts?: RenderRealityTreeDumpOptions): string;
 export declare const FOCUS_REALITY_TREE_EMPTY_STATE: string;
 //# sourceMappingURL=reality-tree.d.ts.map

package/dist/resolvers/shared/reality-tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reality-tree.d.ts","sourceRoot":"","sources":["../../../src/resolvers/shared/reality-tree.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,QAAQ,GAAG,UAAU,CAAC;CAC/B;AAED,MAAM,WAAW,uBAAuB;IACtC,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,aAAa,EAAE,MAAM,CAAC;IACtB,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,QAAQ,GAAG,kBAAkB,GAAG,gBAAgB,GAAG,WAAW,CAAC;IACzE,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B;;;;;OAKG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B;;;;OAIG;IACH,oBAAoB,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAAG,WAAW,GAAG,IAAI,CAAC;IAC9E,iGAAiG;IACjG,sBAAsB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACvC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,SAAS,EAAE,MAAM,GAAG,UAAU,GAAG,UAAU,CAAC;IAC5C,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAC;IAC7B,eAAe,EAAE,UAAU,GAAG,aAAa,GAAG,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC;IAC7E,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,YAAY,GAAG,KAAK,GAAG,cAAc,GAAG,SAAS,CAAC;CAC7D;AAED,MAAM,WAAW,gBAAgB;IAAG,KAAK,EAAE,cAAc,EAAE,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AACjF,MAAM,WAAW,gBAAgB;IAAG,KAAK,EAAE,cAAc,EAAE,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AAEjF,eAAO,MAAM,qBAAqB,QAAS,CAAC;AA2D5C,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,cAAc,EACpB,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,EACvB,WAAW,EAAE,MAAM,GAClB,MAAM,CAsER;AAED,eAAO,MAAM,8BAA8B,QAG0C,CAAC"}
+{"version":3,"file":"reality-tree.d.ts","sourceRoot":"","sources":["../../../src/resolvers/shared/reality-tree.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,QAAQ,GAAG,UAAU,CAAC;CAC/B;AAED,MAAM,WAAW,uBAAuB;IACtC,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,aAAa,EAAE,MAAM,CAAC;IACtB,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,QAAQ,GAAG,kBAAkB,GAAG,gBAAgB,GAAG,WAAW,CAAC;IACzE,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B;;;;;OAKG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B;;;;OAIG;IACH,oBAAoB,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAAG,WAAW,GAAG,IAAI,CAAC;IAC9E,iGAAiG;IACjG,sBAAsB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACvC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,SAAS,EAAE,MAAM,GAAG,UAAU,GAAG,UAAU,CAAC;IAC5C,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAC;IAC7B,eAAe,EAAE,UAAU,GAAG,aAAa,GAAG,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC;IAC7E,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B;;;;;OAKG;IACH,uBAAuB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACxC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,YAAY,GAAG,KAAK,GAAG,cAAc,GAAG,SAAS,CAAC;CAC7D;AAED,MAAM,WAAW,gBAAgB;IAAG,KAAK,EAAE,cAAc,EAAE,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AACjF,MAAM,WAAW,gBAAgB;IAAG,KAAK,EAAE,cAAc,EAAE,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AAEjF,eAAO,MAAM,qBAAqB,QAAS,CAAC;AA2D5C;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,GACtB;IAAE,WAAW,EAAE,OAAO,CAAC;IAAC,UAAU,EAAE,MAAM,EAAE,CAAA;CAAE,CAiBhD;AAED,MAAM,WAAW,4BAA4B;IAC3C;;;;;;;;OAQG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,cAAc,EACpB,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,EACvB,WAAW,EAAE,MAAM,EACnB,IAAI,GAAE,4BAAiC,GACtC,MAAM,CAyFR;AAED,eAAO,MAAM,8BAA8B,QAG0C,CAAC"}

package/dist/resolvers/shared/reality-tree.js

@@ -50,9 +50,59 @@ function renderEdgeLine(e, nodeBySeq) {
     const toRef = to ? `#${to.seq}` : '?';
     return `- ${fromRef} →[${e.edgeType}]→ ${toRef}`;
 }
-export function renderRealityTreeDump(tree, nodes, edges, budgetChars) {
+/**
+ * Deterministic presentability check (connectivity gate), daemon-local mirror
+ * of the canonical `validateTreeIntegrity` in src/lib/reality-tree/tree-integrity.ts.
+ *
+ * The daemon cannot import the canonical validator (it lives in the Vite
+ * workspace; the Deno `_shared` copy is generated, not importable from Node), so
+ * the SAME rule is inlined here: a node is an ORPHAN -- and the tree is NOT
+ * presentable -- when it has zero edges of ANY type touching it AND no evidence.
+ * A non-empty `evidence` string folds the node into its own basis. Only ACTIVE
+ * wiring counts: callers pass already-active nodes, and any edge whose endpoint
+ * is not in the active node set is ignored (it cannot rescue a node).
+ *
+ * Pure and order-independent. Returns the orphan seqs (ascending) so a refusal
+ * notice can name them, and `presentable` (no orphans).
+ */
+export function computeTreePresentability(nodes, edges) {
+    const activeIds = new Set(nodes.map((n) => n.id));
+    const touched = new Set();
+    for (const e of edges) {
+        // Only edges between two active nodes count as a real "touch".
+        if (activeIds.has(e.fromNodeId) && activeIds.has(e.toNodeId)) {
+            touched.add(e.fromNodeId);
+            touched.add(e.toNodeId);
+        }
+    }
+    const orphanSeqs = [];
+    for (const n of nodes) {
+        const grounded = typeof n.evidence === 'string' && n.evidence.trim().length > 0;
+        if (!touched.has(n.id) && !grounded)
+            orphanSeqs.push(n.seq);
+    }
+    orphanSeqs.sort((a, b) => a - b);
+    return { presentable: orphanSeqs.length === 0, orphanSeqs };
+}
+export function renderRealityTreeDump(tree, nodes, edges, budgetChars, opts = {}) {
     if (nodes.length === 0)
         return '';
+    // Mechanical connectivity gate at the downstream-decision seam: a
+    // non-presentable tree is REFUSED (withheld), not handed to a consumer with a
+    // prose warning it might ignore. This is code-branch enforcement, not advice.
+    if (opts.enforcePresentable) {
+        const { presentable, orphanSeqs } = computeTreePresentability(nodes, edges);
+        if (!presentable) {
+            const seqList = orphanSeqs.map((s) => '#' + s).join(', ');
+            return (`### Tree: ${tree.name}\n\n` +
+                `_NOT PRESENTABLE -- withheld._ This tree carries ${orphanSeqs.length} ` +
+                `orphan node(s) (${seqList}): each floats with zero active edges and no ` +
+                `evidence. A tree with unwired, unevidenced claims is reality with ` +
+                `nothing to measure it against; it is not safe to use as reasoning ` +
+                `context until every node is wired into the causal graph or grounded in ` +
+                `evidence.`);
+        }
+    }
     const nodeById = new Map();
     for (const n of nodes)
         nodeById.set(n.id, n);

package/dist/resolvers/shared/reality-tree.js.map

@@ -1 +1 @@
-{"version":3,"file":"reality-tree.js","sourceRoot":"","sources":["../../../src/resolvers/shared/reality-tree.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAyDH,MAAM,CAAC,MAAM,qBAAqB,GAAG,MAAM,CAAC;AAE5C,MAAM,kBAAkB,GAA+C;IACrE,MAAM,EAAE,UAAU;IAClB,gBAAgB,EAAE,0BAA0B;IAC5C,cAAc,EAAE,uBAAuB;IACvC,SAAS,EAAE,kBAAkB;CAC9B,CAAC;AAEF,MAAM,eAAe,GAAiC;IACpD,QAAQ;IACR,kBAAkB;IAClB,gBAAgB;IAChB,WAAW;CACZ,CAAC;AAIF,MAAM,sBAAsB,GAAsB;IAChD,UAAU;IACV,aAAa;IACb,UAAU;IACV,UAAU;CACX,CAAC;AAEF,MAAM,yBAAyB,GAAoC;IACjE,QAAQ,EAAE,uBAAuB;IACjC,WAAW,EAAE,0BAA0B;IACvC,QAAQ,EAAE,uBAAuB;IACjC,QAAQ,EAAE,uBAAuB;CAClC,CAAC;AAEF,SAAS,cAAc,CACrB,CAAiB,EACjB,OAAiD,EAAE;IAEnD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,CAAC,CAAC,eAAe,IAAI,CAAC,IAAI,CAAC,0BAA0B;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;IACxF,IAAI,CAAC,CAAC,SAAS,KAAK,MAAM;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IACjE,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACrF,MAAM,SAAS,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,iBAAiB,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACzG,MAAM,UAAU,GAAG,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,SAAS;QACjE,CAAC,CAAC,YAAY,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE;QAClD,CAAC,CAAC,EAAE,CAAC;IACP,OAAO,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS,GAAG,UAAU,EAAE,CAAC;AACtF,CAAC;AAED,SAAS,cAAc,CACrB,CAAiB,EACjB,SAAsC;IAEtC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IACtC,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,QAAQ,MAAM,KAAK,EAAE,CAAC;AACnD,CAAC;AAED,MAAM,UAAU,qBAAqB,CACnC,IAAoB,EACpB,KAAuB,EACvB,KAAuB,EACvB,WAAmB;IAEnB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;IACnD,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE7C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,QAAQ,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IACxC,IAAI,IAAI,CAAC,WAAW;QAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAEtD,MAAM,OAAO,GAAyD;QACpE,MAAM,EAAE,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE;KACpE,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAE9E,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAChC,IAAI,CAAC,KAAK,WAAW,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqC,CAAC;YAC9D,MAAM,UAAU,GAAqB,EAAE,CAAC;YACxC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;oBACxB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;oBACvD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACjB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC;gBAC5C,CAAC;qBAAM,CAAC;oBACN,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,MAAM,MAAM,IAAI,sBAAsB,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAC7C,QAAQ,CAAC,IAAI,CAAC,UAAU,yBAAyB,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAChF,QAAQ,CAAC,IAAI,CACX,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,0BAA0B,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACtF,CAAC;YACJ,CAAC;YACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,QAAQ,CAAC,IAAI,CAAC,mCAAmC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;gBACvE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACrE,CAAC;YACD,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,UAAU,kBAAkB,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAClE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAChC,CAAC,CAAC,QAAQ,KAAK,YAAY,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,CAChF,CAAC;QACF,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,QAAQ,CAAC,IAAI,CAAC,wBAAwB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACxD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,OAAO,EAAE,CAAC;QACpE,IAAI,SAAS,CAAC,MAAM,GAAG,WAAW,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrD,GAAG,IAAI,oCAAoC,CAAC;YAC5C,MAAM;QACR,CAAC;QACD,GAAG,GAAG,SAAS,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,CAAC,MAAM,8BAA8B,GACzC,oEAAoE;IACpE,6EAA6E;IAC7E,mFAAmF,CAAC"}
+{"version":3,"file":"reality-tree.js","sourceRoot":"","sources":["../../../src/resolvers/shared/reality-tree.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAgEH,MAAM,CAAC,MAAM,qBAAqB,GAAG,MAAM,CAAC;AAE5C,MAAM,kBAAkB,GAA+C;IACrE,MAAM,EAAE,UAAU;IAClB,gBAAgB,EAAE,0BAA0B;IAC5C,cAAc,EAAE,uBAAuB;IACvC,SAAS,EAAE,kBAAkB;CAC9B,CAAC;AAEF,MAAM,eAAe,GAAiC;IACpD,QAAQ;IACR,kBAAkB;IAClB,gBAAgB;IAChB,WAAW;CACZ,CAAC;AAIF,MAAM,sBAAsB,GAAsB;IAChD,UAAU;IACV,aAAa;IACb,UAAU;IACV,UAAU;CACX,CAAC;AAEF,MAAM,yBAAyB,GAAoC;IACjE,QAAQ,EAAE,uBAAuB;IACjC,WAAW,EAAE,0BAA0B;IACvC,QAAQ,EAAE,uBAAuB;IACjC,QAAQ,EAAE,uBAAuB;CAClC,CAAC;AAEF,SAAS,cAAc,CACrB,CAAiB,EACjB,OAAiD,EAAE;IAEnD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,CAAC,CAAC,eAAe,IAAI,CAAC,IAAI,CAAC,0BAA0B;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;IACxF,IAAI,CAAC,CAAC,SAAS,KAAK,MAAM;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IACjE,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACrF,MAAM,SAAS,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,iBAAiB,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACzG,MAAM,UAAU,GAAG,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,SAAS;QACjE,CAAC,CAAC,YAAY,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE;QAClD,CAAC,CAAC,EAAE,CAAC;IACP,OAAO,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS,GAAG,UAAU,EAAE,CAAC;AACtF,CAAC;AAED,SAAS,cAAc,CACrB,CAAiB,EACjB,SAAsC;IAEtC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IACtC,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,QAAQ,MAAM,KAAK,EAAE,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,yBAAyB,CACvC,KAAuB,EACvB,KAAuB;IAEvB,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,+DAA+D;QAC/D,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7D,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAC1B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;QAChF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ;YAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9D,CAAC;IACD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,OAAO,EAAE,WAAW,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;AAC9D,CAAC;AAeD,MAAM,UAAU,qBAAqB,CACnC,IAAoB,EACpB,KAAuB,EACvB,KAAuB,EACvB,WAAmB,EACnB,OAAqC,EAAE;IAEvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,kEAAkE;IAClE,8EAA8E;IAC9E,8EAA8E;IAC9E,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5B,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,yBAAyB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC5E,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1D,OAAO,CACL,aAAa,IAAI,CAAC,IAAI,MAAM;gBAC5B,oDAAoD,UAAU,CAAC,MAAM,GAAG;gBACxE,mBAAmB,OAAO,+CAA+C;gBACzE,oEAAoE;gBACpE,oEAAoE;gBACpE,yEAAyE;gBACzE,WAAW,CACZ,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;IACnD,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE7C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,QAAQ,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IACxC,IAAI,IAAI,CAAC,WAAW;QAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAEtD,MAAM,OAAO,GAAyD;QACpE,MAAM,EAAE,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE;KACpE,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAE9E,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAChC,IAAI,CAAC,KAAK,WAAW,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqC,CAAC;YAC9D,MAAM,UAAU,GAAqB,EAAE,CAAC;YACxC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;oBACxB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;oBACvD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACjB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC;gBAC5C,CAAC;qBAAM,CAAC;oBACN,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,MAAM,MAAM,IAAI,sBAAsB,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAC7C,QAAQ,CAAC,IAAI,CAAC,UAAU,yBAAyB,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAChF,QAAQ,CAAC,IAAI,CACX,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,0BAA0B,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACtF,CAAC;YACJ,CAAC;YACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,QAAQ,CAAC,IAAI,CAAC,mCAAmC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;gBACvE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACrE,CAAC;YACD,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,UAAU,kBAAkB,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAClE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAChC,CAAC,CAAC,QAAQ,KAAK,YAAY,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,CAChF,CAAC;QACF,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,QAAQ,CAAC,IAAI,CAAC,wBAAwB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACxD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,OAAO,EAAE,CAAC;QACpE,IAAI,SAAS,CAAC,MAAM,GAAG,WAAW,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrD,GAAG,IAAI,oCAAoC,CAAC;YAC5C,MAAM;QACR,CAAC;QACD,GAAG,GAAG,SAAS,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,CAAC,MAAM,8BAA8B,GACzC,oEAAoE;IACpE,6EAA6E;IAC7E,mFAAmF,CAAC"}

package/dist/review-defect-detector.d.ts

@@ -46,4 +46,37 @@ export declare function filterReviewFiledIssues(issues: FocusIssueInfo[], review
  * since the most recent review pass.
  */
 export declare function reviewFiledIssueExists(issues: FocusIssueInfo[], reviewRequestedAt: string | null): boolean;
+/**
+ * Whether a priority label is an explicit, low (deferrable) severity. Null,
+ * empty, P0, and P1 are all NOT deferrable.
+ */
+export declare function isLowPriority(priority: string | null | undefined): boolean;
+/**
+ * Whether an issue is a DEFERRABLE review note: a review-filed, still-open
+ * issue (per isReviewFiledIssue) whose priority is an explicit low severity
+ * (P2/P3). A deferrable note must NOT route a verify delivery to verify_failed
+ * -- the review should converge (approve) and leave the note tracked.
+ *
+ * Anything that is review-filed but P0/P1 or unprioritized is BLOCKING, and any
+ * open work that is NOT review-filed (e.g. pre-existing coding work) is also
+ * blocking. Deferrability is a property of low-severity review triage notes
+ * only.
+ */
+export declare function isDeferrableReviewNote(issue: Pick<FocusIssueInfo, 'createdByRoleId' | 'createdAt' | 'status' | 'priority'>, reviewRequestedAt: string | null): boolean;
+/**
+ * Filter a focus's issues to the open, review-filed notes that are deferrable
+ * (low severity). The caller uses the ids to mark the matching reconciler
+ * issues as `deferrable` so the verify-routing reconciler does not treat them
+ * as blocking open work.
+ */
+export declare function filterDeferrableReviewNotes(issues: FocusIssueInfo[], reviewRequestedAt: string | null): FocusIssueInfo[];
+/**
+ * Returns true when there is at least one BLOCKING review-filed issue since the
+ * most recent review pass -- a review-filed, still-open issue that is NOT a
+ * deferrable low-severity note (i.e. P0/P1 or unprioritized). This is the gate
+ * for the review_missing_report notice: a review that filed ONLY deferrable
+ * notes converged cleanly and must not raise the "review skipped its outcome"
+ * escalation.
+ */
+export declare function blockingReviewFiledIssueExists(issues: FocusIssueInfo[], reviewRequestedAt: string | null): boolean;
 //# sourceMappingURL=review-defect-detector.d.ts.map

package/dist/review-defect-detector.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"review-defect-detector.d.ts","sourceRoot":"","sources":["../src/review-defect-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAMjD;;;GAGG;AACH,eAAO,MAAM,wBAAwB,EAAE,MACU,CAAC;AAYlD,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAE5D;AAED,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAIlE;AAED,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAE5D;AAED,wCAAwC;AACxC,wBAAgB,iCAAiC,IAAI,IAAI,CAExD;AAID;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,IAAI,CAAC,cAAc,EAAE,iBAAiB,GAAG,WAAW,GAAG,QAAQ,CAAC,EACvE,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAMT;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,cAAc,EAAE,EACxB,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,cAAc,EAAE,CAElB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,cAAc,EAAE,EACxB,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAUT"}
+{"version":3,"file":"review-defect-detector.d.ts","sourceRoot":"","sources":["../src/review-defect-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAMjD;;;GAGG;AACH,eAAO,MAAM,wBAAwB,EAAE,MACU,CAAC;AAYlD,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAE5D;AAED,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAIlE;AAED,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAE5D;AAED,wCAAwC;AACxC,wBAAgB,iCAAiC,IAAI,IAAI,CAExD;AAID;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,IAAI,CAAC,cAAc,EAAE,iBAAiB,GAAG,WAAW,GAAG,QAAQ,CAAC,EACvE,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAMT;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,cAAc,EAAE,EACxB,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,cAAc,EAAE,CAElB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,cAAc,EAAE,EACxB,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAUT;AAcD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,OAAO,CAG1E;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,IAAI,CAAC,cAAc,EAAE,iBAAiB,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC,EACpF,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAET;AAED;;;;;GAKG;AACH,wBAAgB,2BAA2B,CACzC,MAAM,EAAE,cAAc,EAAE,EACxB,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,cAAc,EAAE,CAElB;AAED;;;;;;;GAOG;AACH,wBAAgB,8BAA8B,CAC5C,MAAM,EAAE,cAAc,EAAE,EACxB,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAIT"}