@remnic/core 9.34.0 → 9.35.0

package/dist/namespaces/search.js

@@ -2,16 +2,16 @@ import {
   NamespaceSearchRouter,
   namespaceCollectionName,
   normalizeQmdResultPath
-} from "../chunk-SUZI6BHQ.js";
-import "../chunk-Y6XRTQMV.js";
+} from "../chunk-IOQFPVGY.js";
+import "../chunk-UZQCNOPS.js";
+import "../chunk-ES36HTSC.js";
 import "../chunk-3Y224NYC.js";
 import "../chunk-H24WNPA2.js";
 import "../chunk-BLAKS3CP.js";
 import "../chunk-S2BBISHU.js";
-import "../chunk-CYEPCZN5.js";
-import "../chunk-ES36HTSC.js";
 import "../chunk-W7IGLX4G.js";
 import "../chunk-CINZGPSJ.js";
+import "../chunk-CYEPCZN5.js";
 import "../chunk-LEPOP46W.js";
 import "../chunk-72A4L5JJ.js";
 import "../chunk-A7Q43EUZ.js";

package/dist/operator-doctor-corpus.js

@@ -2,21 +2,21 @@ import {
   corpusWatermarksFromCheck,
   summarizeCorpusAndReplica,
   summarizeCorpusWatermark
-} from "./chunk-HULSU7PS.js";
+} from "./chunk-AHZYNPLX.js";
 import "./chunk-WDISJRMG.js";
 import "./chunk-XOQSEF7X.js";
-import "./chunk-WFYWGDM6.js";
-import "./chunk-KJT3PZAR.js";
-import "./chunk-SUZI6BHQ.js";
-import "./chunk-Y6XRTQMV.js";
+import "./chunk-SA3WJJF2.js";
+import "./chunk-2SHIWGY7.js";
+import "./chunk-IOQFPVGY.js";
+import "./chunk-UZQCNOPS.js";
+import "./chunk-ES36HTSC.js";
 import "./chunk-3Y224NYC.js";
 import "./chunk-H24WNPA2.js";
 import "./chunk-BLAKS3CP.js";
 import "./chunk-S2BBISHU.js";
-import "./chunk-CYEPCZN5.js";
-import "./chunk-ES36HTSC.js";
 import "./chunk-W7IGLX4G.js";
 import "./chunk-CINZGPSJ.js";
+import "./chunk-CYEPCZN5.js";
 import "./chunk-Y2ZD2RVG.js";
 import "./chunk-LEPOP46W.js";
 import "./chunk-72A4L5JJ.js";

package/dist/operator-toolkit.js

@@ -14,11 +14,11 @@ import {
   summarizeProvenanceCoverage,
   summarizeTierDistribution,
   summarizeTombstoneStatus
-} from "./chunk-RQBF54FC.js";
+} from "./chunk-TJLLYV2X.js";
 import "./chunk-TCIWHK3N.js";
 import "./chunk-KFY3SGN7.js";
 import "./chunk-CMTINOFS.js";
-import "./chunk-HULSU7PS.js";
+import "./chunk-AHZYNPLX.js";
 import "./chunk-WDISJRMG.js";
 import "./chunk-OZKOPQCM.js";
 import "./chunk-2DQ2XREU.js";
@@ -37,18 +37,18 @@ import "./chunk-KFZY2OFH.js";
 import "./chunk-J6SLNQRO.js";
 import "./chunk-ULARSG5Z.js";
 import "./chunk-XOQSEF7X.js";
-import "./chunk-WFYWGDM6.js";
-import "./chunk-KJT3PZAR.js";
-import "./chunk-SUZI6BHQ.js";
-import "./chunk-Y6XRTQMV.js";
+import "./chunk-SA3WJJF2.js";
+import "./chunk-2SHIWGY7.js";
+import "./chunk-IOQFPVGY.js";
+import "./chunk-UZQCNOPS.js";
+import "./chunk-ES36HTSC.js";
 import "./chunk-3Y224NYC.js";
 import "./chunk-H24WNPA2.js";
 import "./chunk-BLAKS3CP.js";
 import "./chunk-S2BBISHU.js";
-import "./chunk-CYEPCZN5.js";
-import "./chunk-ES36HTSC.js";
 import "./chunk-W7IGLX4G.js";
 import "./chunk-CINZGPSJ.js";
+import "./chunk-CYEPCZN5.js";
 import "./chunk-Y2ZD2RVG.js";
 import "./chunk-LEPOP46W.js";
 import "./chunk-72A4L5JJ.js";

package/dist/orchestrator.js

@@ -4,7 +4,7 @@ import {
   filterRecallCandidates,
   graphPathRelativeToStorage,
   mergeGraphExpandedResults
-} from "./chunk-RSFWAI4D.js";
+} from "./chunk-2NUC473W.js";
 import "./chunk-UV72DEZD.js";
 import "./chunk-I74SUMNI.js";
 import "./chunk-ILNPU5W5.js";
@@ -95,21 +95,21 @@ import "./chunk-VEWZZM3H.js";
 import "./chunk-Q6IP2ARR.js";
 import "./chunk-6HEM6HTQ.js";
 import "./chunk-3I4FUAVJ.js";
-import "./chunk-LRYAQGDR.js";
+import "./chunk-HEVWWPTL.js";
 import "./chunk-MMACM5G2.js";
 import "./chunk-54BGIBCR.js";
 import "./chunk-H4CKS5B2.js";
 import "./chunk-FXZTL7F7.js";
 import "./chunk-HDDRVXX4.js";
-import "./chunk-PYHOAXTI.js";
-import "./chunk-OWHERGF2.js";
-import "./chunk-UP6MOYCB.js";
-import "./chunk-BV2TIZ4F.js";
-import "./chunk-Z734BLO3.js";
+import "./chunk-LRGSLV7M.js";
 import "./chunk-OZKVVUJB.js";
 import "./chunk-2DL3OFLD.js";
 import "./chunk-G4IAEX6D.js";
+import "./chunk-2NLLXCJG.js";
+import "./chunk-UP6MOYCB.js";
 import "./chunk-765K3SAT.js";
+import "./chunk-BV2TIZ4F.js";
+import "./chunk-Z734BLO3.js";
 import "./chunk-FGDKJJZS.js";
 import "./chunk-AJVLDJU6.js";
 import "./chunk-XL24QQ63.js";
@@ -136,12 +136,12 @@ import "./chunk-ZRWB5D4H.js";
 import "./chunk-HYQJQGD3.js";
 import "./chunk-DMT2RGAZ.js";
 import "./chunk-33JBK2XP.js";
-import "./chunk-RQBF54FC.js";
+import "./chunk-TJLLYV2X.js";
 import "./chunk-TCIWHK3N.js";
 import "./chunk-KFY3SGN7.js";
 import "./chunk-3T74IZB3.js";
 import "./chunk-CMTINOFS.js";
-import "./chunk-HULSU7PS.js";
+import "./chunk-AHZYNPLX.js";
 import "./chunk-WDISJRMG.js";
 import "./chunk-UR6PBX2J.js";
 import "./chunk-6GUG4YNM.js";
@@ -183,7 +183,7 @@ import "./chunk-OO42R444.js";
 import "./chunk-PIG4WJFQ.js";
 import "./chunk-KFZY2OFH.js";
 import "./chunk-LBJBNWS2.js";
-import "./chunk-RLOVRJZN.js";
+import "./chunk-SLPLPGJQ.js";
 import "./chunk-V7IZKJI3.js";
 import "./chunk-SEDEKFYQ.js";
 import "./chunk-RKNJBZ55.js";
@@ -193,32 +193,32 @@ import "./chunk-42NQ7AVG.js";
 import "./chunk-TMSXWOBZ.js";
 import "./chunk-7RXCMVFQ.js";
 import "./chunk-MKQBXQKU.js";
-import "./chunk-FL3AM5KE.js";
+import "./chunk-5FHE4JI7.js";
 import "./chunk-57QKLRBV.js";
 import "./chunk-D24OXEPB.js";
-import "./chunk-QEPNZBBC.js";
-import "./chunk-OXBPHIKH.js";
+import "./chunk-GHR7WHZX.js";
+import "./chunk-T4HH5Q3U.js";
 import "./chunk-HNZKVLAN.js";
 import "./chunk-EQWEIIKQ.js";
-import "./chunk-WG5HSQ4P.js";
 import "./chunk-UTRO5UJU.js";
+import "./chunk-WG5HSQ4P.js";
 import "./chunk-35NN3ZFA.js";
 import "./chunk-CEN6DW6X.js";
 import "./chunk-T4WDJPEZ.js";
-import "./chunk-FYO2GAZJ.js";
+import "./chunk-3F2LKUMU.js";
 import "./chunk-56BSXSHC.js";
 import "./chunk-WWUVONGW.js";
 import "./chunk-5IVLTFOV.js";
 import "./chunk-VCD4PSK2.js";
 import "./chunk-OADWQ5CR.js";
-import "./chunk-6HXQ2YO5.js";
+import "./chunk-EH5U2YCX.js";
 import {
   hasIdentityRecoveryIntent,
   resolveEffectiveIdentityInjectionMode
-} from "./chunk-DG2R7M7K.js";
+} from "./chunk-5HTAJCTO.js";
 import "./chunk-GDASG7NC.js";
 import "./chunk-GDB4J2H3.js";
-import "./chunk-7CCVK67W.js";
+import "./chunk-65ZPVYTA.js";
 import "./chunk-VQ7B2Q6M.js";
 import "./chunk-PJSK6OJM.js";
 import "./chunk-GNVZQ5JN.js";
@@ -250,18 +250,18 @@ import "./chunk-NLE6TSLG.js";
 import "./chunk-QDW3E4RD.js";
 import "./chunk-PH3ZWL3W.js";
 import "./chunk-C37ZRXX7.js";
-import "./chunk-WFYWGDM6.js";
-import "./chunk-KJT3PZAR.js";
-import "./chunk-SUZI6BHQ.js";
-import "./chunk-Y6XRTQMV.js";
+import "./chunk-SA3WJJF2.js";
+import "./chunk-2SHIWGY7.js";
+import "./chunk-IOQFPVGY.js";
+import "./chunk-UZQCNOPS.js";
+import "./chunk-ES36HTSC.js";
 import "./chunk-3Y224NYC.js";
 import "./chunk-H24WNPA2.js";
 import "./chunk-BLAKS3CP.js";
 import "./chunk-S2BBISHU.js";
-import "./chunk-CYEPCZN5.js";
-import "./chunk-ES36HTSC.js";
 import "./chunk-W7IGLX4G.js";
 import "./chunk-CINZGPSJ.js";
+import "./chunk-CYEPCZN5.js";
 import "./chunk-Y2ZD2RVG.js";
 import "./chunk-LEPOP46W.js";
 import "./chunk-72A4L5JJ.js";
@@ -381,9 +381,9 @@ import "./chunk-6MKAMLQL.js";
 import "./chunk-JAKIDQB2.js";
 import "./chunk-TBBDFYXW.js";
 import "./chunk-ZBJMUXZH.js";
-import "./chunk-5W7CTZ2E.js";
-import "./chunk-UVYI6VIX.js";
+import "./chunk-KQAFEZQX.js";
 import "./chunk-WEHSQBFR.js";
+import "./chunk-X7Y7WX73.js";
 import "./chunk-J4EB7DNW.js";
 import "./chunk-BJMBJZ2Y.js";
 import "./chunk-UKJAGEXH.js";

package/dist/reconcile/plan.d.ts

@@ -0,0 +1,175 @@
+import { OfflineSyncFileState } from '../offline-sync.js';
+
+/**
+ * Bootstrap reconciliation planner for two peer daemons whose corpora have
+ * already diverged (issue #2150).
+ *
+ * The offline-sync protocol assumes a satellite that shares a common base with
+ * one daemon: every path it does not know about is a pull, and a conflict is
+ * rare. Two long-lived daemons are the opposite case — each side holds months
+ * of history the other never saw, both sides are authoritative, and there is
+ * NO common base on the first run. That is a different decision problem, so it
+ * gets its own planner rather than another mode flag inside `applyOfflineSync*`.
+ *
+ * This module is deliberately pure: it takes two file censuses and returns what
+ * to do. No I/O, no transport, no clock. Everything that makes reconciliation
+ * risky — which side wins, what counts as converged, what is reported — is
+ * decided here where it can be exhaustively tested, and the transport layer is
+ * left to carry out an already-settled plan.
+ */
+/** Which way a path must move for the two corpora to agree. */
+type ReconcileAction = "pull" | "push" | "identical" | "conflict" | "suppress";
+/**
+ * How a path present on BOTH sides with different content is settled.
+ *
+ * `manual` is the safe default: on a bootstrap merge the two sides are equally
+ * authoritative, so silently picking one is data loss with extra steps. An
+ * operator opts into an automatic rule once they know the shape of their split.
+ */
+type ReconcileConflictPolicy = "manual" | "newest-wins" | "keep-both";
+/**
+ * What the planner decided for a conflicting path.
+ *
+ * `keep-both` never overwrites: the older side is retained and linked as
+ * superseded by the newer one, which is the only resolution that cannot lose a
+ * fact neither corpus has seen.
+ */
+type ReconcileResolution = "local-wins" | "peer-wins" | "supersede-link" | "unresolved";
+interface ReconcilePlanEntry {
+    path: string;
+    namespace: string;
+    action: ReconcileAction;
+    /** Stable machine-readable cause, safe to assert on and to aggregate. */
+    reason: ReconcileReason;
+    localSha256?: string;
+    peerSha256?: string;
+    /** Present only when a prior converged run left a cursor covering this path. */
+    baseSha256?: string;
+    /** Set only when `action` is `conflict`. */
+    resolution?: ReconcileResolution;
+    /**
+     * Which side holds the retracted revision. Set only when `action` is
+     * `suppress`: with different digests on each side and only one retracted,
+     * the entry would otherwise be identical either way and transport could
+     * delete the live copy instead of the retracted one.
+     */
+    suppressSide?: "local" | "peer" | "both";
+    /**
+     * Which revision is newer, set only for a `supersede-link` resolution.
+     *
+     * The contract is that the older revision is linked as superseded by the
+     * newer one, so transport needs the direction. Absent when the timestamps
+     * cannot order the two - which is exactly when `newest-wins` degrades to
+     * `supersede-link` - and the link direction is then an operator decision.
+     */
+    newerSide?: "local" | "peer";
+}
+type ReconcileReason = "peer_only" | "local_only"
+/** Cursor showed only that side moved since agreement; both still hold the path. */
+ | "peer_changed" | "local_changed" | "same_content" | "both_modified" | "peer_deleted" | "local_deleted"
+/** Peer deleted it while this side edited it — the offline-sync delete/modify pair. */
+ | "local_modified_peer_deleted" | "local_deleted_peer_modified" | "tombstoned";
+interface ReconcileNamespaceReport {
+    namespace: string;
+    pull: number;
+    push: number;
+    identical: number;
+    conflict: number;
+    /** Local retractions the peer must be told about before the pair agrees. */
+    suppress: number;
+    /**
+     * Conflicts still needing an operator: those the policy declined to settle,
+     * plus supersede links whose direction could not be determined.
+     */
+    unresolved: number;
+}
+interface ReconcilePlan {
+    entries: ReconcilePlanEntry[];
+    byNamespace: ReconcileNamespaceReport[];
+    /**
+     * True when the two corpora already agree — every shared path matches and
+     * neither side holds a path the other lacks.
+     *
+     * This is the idempotency contract from #2150: running reconciliation against
+     * an already-converged peer must be a no-op, and a caller can skip the whole
+     * transfer phase on this flag alone.
+     */
+    converged: boolean;
+}
+/** Minimal shape the planner needs; `OfflineSyncFileState` satisfies it. */
+type ReconcileFileState = Pick<OfflineSyncFileState, "path" | "sha256"> & Partial<Pick<OfflineSyncFileState, "mtimeMs" | "bytes">>;
+interface ReconcileNamespaceInput {
+    namespace: string;
+    local: Iterable<ReconcileFileState>;
+    peer: Iterable<ReconcileFileState>;
+    /**
+     * File states agreed at the end of the last converged run with THIS peer.
+     * Absent on a bootstrap merge, which is why a path missing from one side is
+     * read as "never seen" rather than "deleted".
+     */
+    base?: Iterable<ReconcileFileState>;
+    /**
+     * Digests of FILES this side has retracted, in the same form as
+     * `ReconcileFileState.sha256` — a hash of the serialized file.
+     *
+     * Deliberately NOT `TombstoneEntry.contentHash`, which hashes the canonical
+     * raw fact text and therefore never equals a file digest (§13: one content
+     * form, everywhere). Mapping retracted fact hashes onto the file digests that
+     * carry them is the caller's job, because only the caller can read its own
+     * corpus; handing this the wrong form would silently plan `pull` and
+     * resurrect every retracted fact, so the parameter name states the form.
+     */
+    tombstonedFileSha256?: Iterable<string>;
+    /**
+     * Digests the PEER has retracted, same form.
+     *
+     * Without this a bootstrap merge cannot tell "the peer never had it" from
+     * "the peer deliberately retracted it": the peer census simply omits both,
+     * so a file we still hold is planned `push` and the peer's retraction is
+     * undone. Reconciliation is symmetric, so retraction has to be too.
+     *
+     * SCOPE: these sets decide what happens to files that still EXIST on one
+     * side. Sharing the retraction records themselves is not modelled here -
+     * tombstones are corpus files (`state/tombstones.jsonl`), so they reconcile
+     * as ordinary paths through this same plan. A digest both censuses have
+     * already dropped therefore produces no entry, by design: there is no file
+     * left to act on, and synthesizing a path-less entry would hand transport
+     * something it cannot apply.
+     */
+    peerTombstonedFileSha256?: Iterable<string>;
+}
+interface ReconcileOptions {
+    conflictPolicy?: ReconcileConflictPolicy;
+}
+/**
+ * A census the planner refuses to reason about.
+ *
+ * Dropping a malformed or contradictory record would let the planner return
+ * `converged: true` for a corpus it could not actually read, and transport is
+ * invited to skip everything on that flag — so bad input fails loudly instead
+ * (§1/§39).
+ */
+declare class ReconcilePlanInputError extends Error {
+    constructor(message: string);
+}
+/**
+ * Plan one namespace. Exposed for callers that stream namespaces one at a time.
+ *
+ * Residency is one peer index + a set of local paths + the entry list. The
+ * local census is consumed as a stream and never materialized, so a 100k-file
+ * corpus does not hold two full censuses at once — but this is NOT constant
+ * memory, and a caller holding its own census arrays adds to that.
+ */
+declare function planNamespaceReconciliation(input: ReconcileNamespaceInput, options?: ReconcileOptions): ReconcilePlanEntry[];
+/** Aggregate entries into the per-namespace convergence report (#2150). */
+declare function summarizeReconcilePlan(entries: readonly ReconcilePlanEntry[]): ReconcileNamespaceReport[];
+/**
+ * Plan a full reconciliation across namespaces.
+ *
+ * `converged` is an affirmative claim that nothing needs to move, so it is
+ * derived from the entries rather than tracked alongside them: any action other
+ * than `identical` disproves it.
+ */
+declare function planReconciliation(namespaces: readonly ReconcileNamespaceInput[], options?: ReconcileOptions): ReconcilePlan;
+
+export { type ReconcileAction, type ReconcileConflictPolicy, type ReconcileFileState, type ReconcileNamespaceInput, type ReconcileNamespaceReport, type ReconcileOptions, type ReconcilePlan, type ReconcilePlanEntry, ReconcilePlanInputError, type ReconcileReason, type ReconcileResolution, planNamespaceReconciliation, planReconciliation, summarizeReconcilePlan };