@miller-tech/uap 1.175.13 → 1.178.0

package/dist/memory/reconstruct.js

@@ -0,0 +1,552 @@
+/**
+ * Active memory reconstruction over a Cue–Tag–Content graph
+ * (harness plan area E, 2026-07-31).
+ *
+ * UAP's memory retrieval is passive: embed the query, pull the top-k, reason
+ * once. "Memory is Reconstructed, Not Retrieved" (arXiv 2606.06036) shows that
+ * paradigm is strictly less expressive than letting the model traverse memory
+ * WHILE it reasons — it proves active policies solve a binary-tree
+ * needle-in-a-haystack with zero error where passive policies need an
+ * exponential budget — and measures the practical gap at up to +23% on LoCoMo
+ * with 118k tokens per query against A-Mem's 632k and LangMem's 3.26M.
+ *
+ * THE TAG LAYER IS THE CONTRIBUTION. Their ablation: cue -> content direct
+ * indexing recalls ~65%; cue -> TAG -> content with multi-turn reasoning recalls
+ * ~90%. A "graph memory" that skips the associative tag bridge gets none of the
+ * benefit, so the schema here makes tags mandatory rather than an optimisation.
+ *
+ * Off by default. The literature's numbers are theirs, not ours: this ships
+ * behind `UAP_MEMORY_ACTIVE=1` until `uap bench paired` measures the lift on our
+ * own suite (harness plan constraint 3).
+ */
+import Database from 'better-sqlite3';
+import { mkdirSync } from 'node:fs';
+import { dirname } from 'node:path';
+/**
+ * A tag linking at least this share of the corpus relates everything and so
+ * discriminates nothing — a hub, not a bridge.
+ */
+const HUB_RATIO = 0.6;
+/** Below this many contents the ratio is noise, so no tag counts as a hub. */
+const HUB_RATIO_MIN_CONTENTS = 20;
+/**
+ * Zero-LLM policy: lexical overlap for routing, breadth-first for expansion.
+ *
+ * Not a toy — it is the honest default. An active traversal driven by a cheap
+ * heuristic is still active (it prunes on accumulated evidence, which is the
+ * mechanism the paper isolates); wiring an LLM in raises the ceiling but is not
+ * required for the structure to pay off, and a deterministic policy is what
+ * makes the loop unit-testable.
+ */
+export function heuristicPolicy(opts = {}) {
+    const keepThreshold = opts.keepThreshold ?? 0.12;
+    // 3 was too eager: on any realistic graph step 1 admits >=3 nodes, the loop
+    // stops immediately, and the multi-hop discovery that IS the contribution
+    // never runs — the shipped default would have been passive retrieval with a
+    // worse ranker. 12 lets the second hop happen while staying under maxContext.
+    const sufficientAt = opts.sufficientAt ?? 12;
+    // Expansion MUST be bounded. Discovery reseeds the active set from every cue
+    // sharing a productive tag, so on a real store step 2 expanded 453 cues —
+    // effectively a full scan, which would make this slower AND more expensive
+    // than the passive top-k it replaces, inverting the paper's whole result.
+    const maxExpand = opts.maxExpandPerStep ?? 24;
+    const maxAssociative = opts.maxAssociativePerStep ?? 3;
+    const maxBridgeTagSize = opts.maxBridgeTagSize ?? 12;
+    return {
+        selectCues(query, activeCues, context) {
+            if (activeCues.length <= maxExpand)
+                return [...activeCues];
+            // Rank by relevance to the query first, then to evidence already
+            // accumulated — the second term is what makes this reconstruction rather
+            // than retrieval: what to look at next depends on what was just found.
+            const q = tokenize(query);
+            const ctx = tokenize(context.map((c) => c.text).join(' '));
+            const scored = activeCues.map((cue) => {
+                const t = tokenize(cue);
+                return { cue, score: overlap(t, q) * 2 + overlap(t, ctx) };
+            });
+            scored.sort((a, b) => b.score - a.score || a.cue.localeCompare(b.cue));
+            return scored.slice(0, maxExpand).map((s) => s.cue);
+        },
+        route(query, candidates, context, hops) {
+            const q = tokenize(query);
+            const direct = candidates.filter((c) => overlap(q, tokenize(c.text)) >= keepThreshold);
+            const keep = new Set(direct.map((c) => c.id));
+            const deferred = [];
+            // ASSOCIATIVE PASS. A tag that has produced admitted evidence is a
+            // known-good bridge, so a candidate reached through one earns a lower bar.
+            // That is what "associative" means — and without it a lexical router
+            // discards exactly the hops the graph exists to make, because the far side
+            // of a bridge does not resemble the query by construction.
+            //
+            // Still a bar, not a free pass: the candidate must relate to the query or
+            // to evidence already admitted.
+            if (hops && maxAssociative > 0) {
+                // Only tags proven in an EARLIER step. Folding in this step's own direct
+                // hits would let a bridge admit a sibling the router is rejecting in the
+                // very same pass — which is not an associative hop, it is bypassing the
+                // pruning. A bridge earns its keep across hops, not within one.
+                const productive = hops.productiveTags;
+                if (productive.size > 0) {
+                    const ctx = tokenize([...context, ...direct].map((c) => c.text).join(' '));
+                    // NO lexical minimum here, deliberately. The far side of a bridge does
+                    // not resemble the query by construction — that is precisely the
+                    // evidence retrieval cannot reach — so requiring word overlap would
+                    // make the tag layer decorative and this whole structure a slower
+                    // top-k. The PROVEN TAG is the evidence of relatedness.
+                    //
+                    // Bounded instead of filtered: at most `maxAssociative` per step, from
+                    // tags that have already produced admitted evidence, ranked by how
+                    // much they add to what is known. A cap is an honest way to buy recall
+                    // with a known amount of noise; a lexical bar here would buy neither.
+                    const eligible = candidates
+                        .filter((c) => !keep.has(c.id) &&
+                        (hops.tagsFor.get(c.id) ?? []).some((t) => productive.has(t)))
+                        .map((c) => ({ c, score: Math.max(overlap(q, tokenize(c.text)), overlap(tokenize(c.text), ctx)) }))
+                        // A floor of >0, not a lexical bar. Without ANY floor the slice still
+                        // admits `maxAssociative` when every candidate scores zero, and the
+                        // id tie-break then picks the three oldest memories in the store —
+                        // deterministic noise. "No lexical minimum" and "no bar at all" are
+                        // different things.
+                        .map((x) => ({
+                        ...x,
+                        // Smallest productive tag this candidate came through.
+                        specificity: Math.min(...(hops.tagsFor.get(x.c.id) ?? [])
+                            .filter((t) => productive.has(t))
+                            .map((t) => hops.tagSize(t))),
+                    }))
+                        // Zero lexical score is EXPECTED for a real associative hop, so it
+                        // cannot be the filter. Tag specificity is: a bridge from a 3-member
+                        // tag asserts a relation, one from a 300-member tag asserts noise.
+                        .filter((x) => x.score > 0 || x.specificity <= maxBridgeTagSize)
+                        .sort((a, b) => b.score - a.score || a.specificity - b.specificity || a.c.id - b.c.id);
+                    for (const { c } of eligible.slice(0, maxAssociative))
+                        keep.add(c.id);
+                    for (const { c } of eligible.slice(maxAssociative))
+                        deferred.push(c.id);
+                }
+            }
+            return { keep: [...keep], sufficient: context.length + keep.size >= sufficientAt, deferred };
+        },
+    };
+}
+function tokenize(s) {
+    return new Set(s
+        .toLowerCase()
+        .split(/[^a-z0-9]+/)
+        .filter((t) => t.length > 2));
+}
+function overlap(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let shared = 0;
+    for (const t of a)
+        if (b.has(t))
+            shared++;
+    return shared / a.size;
+}
+/**
+ * The Cue–Tag–Content graph.
+ *
+ * Its own SQLite file rather than a table in the semantic store: the traversal
+ * is a different access pattern (many small keyed hops, no vector math) and
+ * keeping it separate means enabling the feature cannot slow the existing
+ * retrieval path.
+ */
+export class MemoryGraph {
+    db;
+    constructor(dbPath) {
+        mkdirSync(dirname(dbPath), { recursive: true });
+        this.db = new Database(dbPath);
+        this.db.pragma('journal_mode = WAL');
+        this.db.pragma('synchronous = NORMAL');
+        this.db.pragma('busy_timeout = 5000');
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS mg_contents (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        layer TEXT NOT NULL,
+        text TEXT NOT NULL,
+        occurred_at TEXT
+      );
+      CREATE TABLE IF NOT EXISTS mg_triples (
+        cue TEXT NOT NULL,
+        tag TEXT NOT NULL,
+        content_id INTEGER NOT NULL,
+        PRIMARY KEY (cue, tag, content_id)
+      );
+      CREATE INDEX IF NOT EXISTS idx_mg_triples_cue ON mg_triples(cue);
+      CREATE INDEX IF NOT EXISTS idx_mg_triples_cue_tag ON mg_triples(cue, tag);
+      -- cuesForTag filters on tag ALONE and runs once per productive tag per
+      -- step; without this it full-scans mg_triples in the discovery hot path.
+      CREATE INDEX IF NOT EXISTS idx_mg_triples_tag ON mg_triples(tag);
+      -- Source keys already ingested. Durable dedupe lives WITH the graph so a
+      -- rebuild is incremental and a deleted graph cannot leave a stale ledger
+      -- behind claiming everything is already indexed.
+      CREATE TABLE IF NOT EXISTS mg_sources (
+        key TEXT PRIMARY KEY,
+        ingested_at TEXT NOT NULL DEFAULT (datetime('now'))
+      );
+      -- Graph-level metadata. last_refresh_at exists because staleness must
+      -- NOT be derived from mg_sources: a refresh that finds nothing new writes
+      -- no source rows, so the timestamp never moves, the TTL never clears, and
+      -- the index rebuilds on every single retrieval. That is the common case
+      -- (idle project, unreachable long-term store, misconfigured project id),
+      -- and on the agent path it would be a full corpus scan per model turn.
+      CREATE TABLE IF NOT EXISTS mg_meta (
+        key TEXT PRIMARY KEY,
+        value TEXT NOT NULL
+      );
+    `);
+    }
+    /**
+     * Add one memory item and its (cue, tag) index entries.
+     *
+     * Tags are REQUIRED: an item indexed by cue alone is the ~65%-recall
+     * configuration the paper ablates away. Callers with no tags should supply a
+     * coarse one (the layer name) rather than none.
+     */
+    addContent(params) {
+        const info = this.db
+            .prepare('INSERT INTO mg_contents (layer, text, occurred_at) VALUES (?, ?, ?)')
+            .run(params.layer, params.text, params.occurredAt ?? null);
+        const id = Number(info.lastInsertRowid);
+        const stmt = this.db.prepare('INSERT OR IGNORE INTO mg_triples (cue, tag, content_id) VALUES (?, ?, ?)');
+        const tags = params.tags.length > 0 ? params.tags : [params.layer];
+        const insert = this.db.transaction(() => {
+            for (const cue of params.cues) {
+                for (const tag of tags)
+                    stmt.run(norm(cue), norm(tag), id);
+            }
+        });
+        insert();
+        return id;
+    }
+    /** φ_{c→g}: the associative tags a cue activates. */
+    tagsForCue(cue) {
+        const rows = this.db
+            .prepare('SELECT DISTINCT tag FROM mg_triples WHERE cue = ?')
+            .all(norm(cue));
+        return rows.map((r) => r.tag);
+    }
+    /** φ_{(c,g)→v}: contents reachable from a cue THROUGH a specific tag. */
+    contentsFor(cue, tag) {
+        const rows = this.db
+            .prepare(`SELECT c.id, c.layer, c.text, c.occurred_at
+         FROM mg_triples t JOIN mg_contents c ON c.id = t.content_id
+         WHERE t.cue = ? AND t.tag = ?`)
+            .all(norm(cue), norm(tag));
+        return rows.map(toNode);
+    }
+    /**
+     * Tags too broad to be bridges: attached to >= 60% of all content. Reuses the
+     * discriminativeness rule `stats()` already applies, because a tag that links
+     * everything relates nothing — and on the short-term tier EVERY item is tagged
+     * with one of ~6 type values, so without this the "bridge" is the whole store.
+     */
+    hubTags() {
+        // The ratio only means something once there is a corpus to take a ratio of:
+        // on three memories a two-member tag is 67% and obviously a real bridge, and
+        // calling it a hub would stop every traversal in a small store.
+        const rows = this.db
+            .prepare(`SELECT tag FROM mg_triples GROUP BY tag
+         HAVING (SELECT COUNT(*) FROM mg_contents) >= ${HUB_RATIO_MIN_CONTENTS}
+            AND COUNT(DISTINCT content_id) >= ${HUB_RATIO} * (SELECT COUNT(*) FROM mg_contents)`)
+            .all();
+        return new Set(rows.map((r) => r.tag));
+    }
+    tagSizeCache = new Map();
+    /** How many distinct contents a tag links. Cached — hot in the route loop. */
+    tagSize(tag) {
+        const key = norm(tag);
+        const hit = this.tagSizeCache.get(key);
+        if (hit !== undefined)
+            return hit;
+        const row = this.db
+            .prepare('SELECT COUNT(DISTINCT content_id) AS n FROM mg_triples WHERE tag = ?')
+            .get(key);
+        const n = row?.n ?? 0;
+        this.tagSizeCache.set(key, n);
+        return n;
+    }
+    /** Cues that co-occur with a tag — how traversal discovers NEW clues. */
+    cuesForTag(tag) {
+        const rows = this.db
+            .prepare('SELECT DISTINCT cue FROM mg_triples WHERE tag = ?')
+            .all(norm(tag));
+        return rows.map((r) => r.cue);
+    }
+    /** Source keys already ingested, for incremental rebuilds. */
+    ingestedKeys() {
+        const rows = this.db.prepare('SELECT key FROM mg_sources').all();
+        return new Set(rows.map((r) => r.key));
+    }
+    /** Record that a refresh COMPLETED, whether or not it stored anything. */
+    markRefreshed(nowIso) {
+        this.db
+            .prepare("INSERT INTO mg_meta (key, value) VALUES ('last_refresh_at', ?) " +
+            'ON CONFLICT(key) DO UPDATE SET value = excluded.value')
+            .run(nowIso);
+    }
+    /** ISO timestamp of the last completed refresh, or null if never refreshed. */
+    lastRefreshedAt() {
+        const row = this.db.prepare("SELECT value FROM mg_meta WHERE key = 'last_refresh_at'").get();
+        return row?.value ?? null;
+    }
+    /**
+     * Best-effort single-flight guard around a build.
+     *
+     * Two agents retrieving at once both see a stale graph, both build, and both
+     * insert the same items under fresh ids — permanent duplicates, since the
+     * ledger then reports them indexed. Returns false when another build holds the
+     * lock; a lock older than `staleMs` is taken over so a crashed build cannot
+     * wedge refreshes forever.
+     */
+    acquireBuildLock(nowMs, staleMs = 120_000) {
+        try {
+            const row = this.db.prepare("SELECT value FROM mg_meta WHERE key = 'build_lock'").get();
+            if (row) {
+                const held = Number(row.value);
+                if (Number.isFinite(held) && nowMs - held < staleMs)
+                    return false;
+            }
+            this.db
+                .prepare("INSERT INTO mg_meta (key, value) VALUES ('build_lock', ?) " +
+                'ON CONFLICT(key) DO UPDATE SET value = excluded.value')
+                .run(String(nowMs));
+            return true;
+        }
+        catch {
+            return false;
+        }
+    }
+    releaseBuildLock() {
+        try {
+            this.db.prepare("DELETE FROM mg_meta WHERE key = 'build_lock'").run();
+        }
+        catch {
+            /* best-effort */
+        }
+    }
+    /** ISO timestamp of the most recent ingest, or null if never built. */
+    lastIngestedAt() {
+        const row = this.db.prepare('SELECT MAX(ingested_at) AS t FROM mg_sources').get();
+        return row?.t ?? null;
+    }
+    /** Mark source keys as ingested. */
+    markIngested(keys) {
+        const stmt = this.db.prepare('INSERT OR IGNORE INTO mg_sources (key) VALUES (?)');
+        const tx = this.db.transaction((ks) => {
+            for (const k of ks)
+                stmt.run(k);
+        });
+        tx([...keys]);
+    }
+    /**
+     * Cheap emptiness probe. `stats()` runs five aggregates including two
+     * COUNT(DISTINCT) and a GROUP BY — far too expensive for the "should I route
+     * here" check that runs on every single query.
+     */
+    isEmpty() {
+        const row = this.db.prepare('SELECT 1 AS n FROM mg_contents LIMIT 1').get();
+        return row === undefined;
+    }
+    /** Delete everything — the truncate half of a real rebuild. */
+    clear() {
+        this.db.exec('DELETE FROM mg_triples; DELETE FROM mg_contents; DELETE FROM mg_sources;');
+    }
+    /** Shape of the graph, for `uap memory graph status` and honest reporting. */
+    stats() {
+        const one = (sql) => (this.db.prepare(sql).get()?.n ?? 0);
+        return {
+            contents: one('SELECT COUNT(*) AS n FROM mg_contents'),
+            cues: one('SELECT COUNT(DISTINCT cue) AS n FROM mg_triples'),
+            tags: one('SELECT COUNT(DISTINCT tag) AS n FROM mg_triples'),
+            triples: one('SELECT COUNT(*) AS n FROM mg_triples'),
+            // Tags linking >1 content node are the ones doing associative work — but
+            // a tag attached to EVERY memory (a type enum, a month bucket) links
+            // everything and discriminates nothing, so counting it as a bridge
+            // reports health while the graph is a hairball. Require >1 and <60% of
+            // all contents.
+            bridgingTags: one(`SELECT COUNT(*) AS n FROM (
+           SELECT tag FROM mg_triples
+           GROUP BY tag
+           HAVING COUNT(DISTINCT content_id) > 1
+              AND (
+                (SELECT COUNT(*) FROM mg_contents) < ${HUB_RATIO_MIN_CONTENTS}
+                OR COUNT(DISTINCT content_id) < ${HUB_RATIO} * (SELECT COUNT(*) FROM mg_contents)
+              )
+         )`),
+        };
+    }
+    /** Every cue in the graph — the seed set when the query matches nothing. */
+    allCues() {
+        const rows = this.db.prepare('SELECT DISTINCT cue FROM mg_triples').all();
+        return rows.map((r) => r.cue);
+    }
+    close() {
+        try {
+            this.db.close();
+        }
+        catch {
+            /* ignore */
+        }
+    }
+}
+function norm(s) {
+    return s.trim().toLowerCase();
+}
+function toNode(r) {
+    return {
+        id: r.id,
+        layer: r.layer,
+        text: r.text,
+        occurredAt: r.occurred_at ?? undefined,
+    };
+}
+/**
+ * Reconstruct an answer context by traversing the graph while reasoning.
+ *
+ * The loop is the paper's three-step iteration: select actions over the active
+ * set, traverse (cue -> tags -> contents), then route/prune and update state.
+ * The essential difference from retrieval is that step N+1's expansion depends
+ * on what step N actually found — cues discovered mid-traversal become new
+ * entry points, and weak paths are killed before they consume context.
+ */
+export function reconstruct(graph, query, options = {}) {
+    const maxSteps = options.maxSteps ?? 5;
+    const maxContext = options.maxContext ?? 24;
+    const maxExpand = options.maxExpandPerStep ?? 24;
+    const policy = options.policy ?? heuristicPolicy();
+    const seeds = options.seedCues ?? seedCuesFromQuery(graph, query, options.maxSeeds);
+    let active = new Set(seeds.map(norm));
+    const visitedCues = new Set();
+    const context = [];
+    const admitted = new Set();
+    // Content the router judged irrelevant. A rejection is DURABLE: the router
+    // ruled on the merits, and a later bridge must not resurrect it — otherwise a
+    // single mis-tagged memory re-enters on every hop that touches its tag.
+    const rejected = new Set();
+    const steps = [];
+    // Tags that have produced admitted evidence, accumulated across steps.
+    const productiveTags = new Set();
+    // ...minus the ones too broad to mean anything.
+    const hubs = graph.hubTags();
+    let converged = false;
+    let stopReason = 'step-budget';
+    for (let step = 1; step <= maxSteps; step++) {
+        const toExpand = policy
+            .selectCues(query, [...active], context)
+            .map(norm)
+            // Intersect with the ACTIVE set: a policy may only expand cues the
+            // traversal actually reached, never ones it invented.
+            .filter((c) => active.has(c) && !visitedCues.has(c))
+            .slice(0, maxExpand);
+        if (toExpand.length === 0) {
+            stopReason = 'exhausted';
+            break;
+        }
+        const tags = new Set();
+        const candidates = [];
+        const seenThisStep = new Set();
+        // Which tags each candidate was reached through — the router needs it to
+        // tell an associative hop from an unrelated match.
+        const provenance = new Map();
+        for (const cue of toExpand) {
+            visitedCues.add(cue);
+            active.delete(cue);
+            for (const tag of graph.tagsForCue(cue)) {
+                tags.add(tag);
+                for (const node of graph.contentsFor(cue, tag)) {
+                    provenance.set(node.id, [...(provenance.get(node.id) ?? []), tag]);
+                    // Already in context, or already a candidate this step — the graph is
+                    // many-to-many, so the same content is reached by several paths.
+                    if (admitted.has(node.id) || rejected.has(node.id) || seenThisStep.has(node.id))
+                        continue;
+                    seenThisStep.add(node.id);
+                    candidates.push(node);
+                }
+            }
+        }
+        const { keep, sufficient, deferred } = policy.route(query, candidates, context, {
+            tagsFor: provenance,
+            productiveTags,
+            tagSize: (t) => graph.tagSize(t),
+        });
+        const bridgedButCapped = new Set(deferred ?? []);
+        const keepSet = new Set(keep);
+        const kept = [];
+        const pruned = [];
+        const dropped = [];
+        for (const node of candidates) {
+            if (!keepSet.has(node.id)) {
+                // Pruned BEFORE it costs context — the token saving the paper measures.
+                pruned.push(node.id);
+                // Only a candidate the router actually SAW and declined is blacklisted.
+                // An associative candidate that merely missed the per-step cap was never
+                // judged on the merits, and must stay reachable by a later, stronger
+                // bridge.
+                if (!bridgedButCapped.has(node.id))
+                    rejected.add(node.id);
+                continue;
+            }
+            if (context.length >= maxContext) {
+                dropped.push(node.id);
+                continue;
+            }
+            context.push(node);
+            admitted.add(node.id);
+            kept.push(node.id);
+            // This tag is now a proven bridge for the rest of the traversal — unless
+            // it is a hub, in which case it "bridges" to the entire corpus.
+            for (const t of provenance.get(node.id) ?? [])
+                if (!hubs.has(t))
+                    productiveTags.add(t);
+        }
+        // Discovery: tags reached by KEPT evidence surface new cues to expand. Only
+        // productive tags propagate, or a pruned branch would keep reseeding itself.
+        if (kept.length > 0) {
+            // Reuse the tags just proven, rather than re-issuing every tagsForCue and
+            // contentsFor query the expansion above already made.
+            for (const tag of productiveTags) {
+                for (const cue of graph.cuesForTag(tag)) {
+                    if (!visitedCues.has(cue))
+                        active.add(cue);
+                }
+            }
+        }
+        steps.push({ step, expandedCues: toExpand, tags: [...tags], kept, pruned, dropped, sufficient });
+        if (sufficient || context.length >= maxContext) {
+            converged = sufficient;
+            stopReason = sufficient ? 'sufficient' : 'context-full';
+            break;
+        }
+        if (active.size === 0) {
+            stopReason = 'exhausted';
+            break;
+        }
+    }
+    return { context, steps, converged, stopReason };
+}
+/**
+ * Seed cues = query tokens present in the graph.
+ *
+ * When nothing matches we fall back to a BOUNDED sample rather than every cue
+ * in the graph: an off-topic query would otherwise load the entire content
+ * table on step 1, which is the opposite of what this is for.
+ */
+export function seedCuesFromQuery(graph, query, maxSeeds = 32) {
+    const tokens = [...tokenize(query)];
+    const known = new Set(graph.allCues());
+    const hits = tokens.filter((t) => known.has(t));
+    if (hits.length > 0)
+        return hits;
+    return [...known].sort().slice(0, maxSeeds);
+}
+/**
+ * Is active reconstruction enabled? Off by default — the lift is measured on our
+ * own suite before it becomes the default retrieval path.
+ */
+export function activeReconstructionEnabled() {
+    return process.env.UAP_MEMORY_ACTIVE === '1';
+}
+//# sourceMappingURL=reconstruct.js.map

package/dist/memory/reconstruct.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconstruct.js","sourceRoot":"","sources":["../../src/memory/reconstruct.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACpC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC;;;GAGG;AACH,MAAM,SAAS,GAAG,GAAG,CAAC;AACtB,8EAA8E;AAC9E,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAoHlC;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAC7B,OAWI,EAAE;IAEN,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC;IACjD,4EAA4E;IAC5E,0EAA0E;IAC1E,4EAA4E;IAC5E,8EAA8E;IAC9E,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC;IAC7C,6EAA6E;IAC7E,0EAA0E;IAC1E,2EAA2E;IAC3E,0EAA0E;IAC1E,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,IAAI,EAAE,CAAC;IAC9C,MAAM,cAAc,GAAG,IAAI,CAAC,qBAAqB,IAAI,CAAC,CAAC;IACvD,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,IAAI,EAAE,CAAC;IACrD,OAAO;QACL,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO;YACnC,IAAI,UAAU,CAAC,MAAM,IAAI,SAAS;gBAAE,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC;YAC3D,iEAAiE;YACjE,yEAAyE;YACzE,uEAAuE;YACvE,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3D,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;gBACpC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxB,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YAC7D,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI;YACpC,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC1B,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC;YACvF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAa,EAAE,CAAC;YAE9B,mEAAmE;YACnE,2EAA2E;YAC3E,qEAAqE;YACrE,2EAA2E;YAC3E,2DAA2D;YAC3D,EAAE;YACF,0EAA0E;YAC1E,gCAAgC;YAChC,IAAI,IAAI,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;gBAC/B,yEAAyE;gBACzE,yEAAyE;gBACzE,wEAAwE;gBACxE,gEAAgE;gBAChE,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC;gBACvC,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC3E,uEAAuE;oBACvE,iEAAiE;oBACjE,oEAAoE;oBACpE,kEAAkE;oBAClE,wDAAwD;oBACxD,EAAE;oBACF,uEAAuE;oBACvE,mEAAmE;oBACnE,uEAAuE;oBACvE,sEAAsE;oBACtE,MAAM,QAAQ,GAAG,UAAU;yBACxB,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBACf,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAChE;yBACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;wBACnG,sEAAsE;wBACtE,oEAAoE;wBACpE,mEAAmE;wBACnE,oEAAoE;wBACpE,oBAAoB;yBACnB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBACX,GAAG,CAAC;wBACJ,uDAAuD;wBACvD,WAAW,EAAE,IAAI,CAAC,GAAG,CACnB,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;6BAChC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;6BAChC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAC/B;qBACF,CAAC,CAAC;wBACH,mEAAmE;wBACnE,qEAAqE;wBACrE,mEAAmE;yBAClE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,WAAW,IAAI,gBAAgB,CAAC;yBAC/D,IAAI,CACH,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CACxE,CAAC;oBACJ,KAAK,MAAM,EAAE,CAAC,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;wBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACtE,KAAK,MAAM,EAAE,CAAC,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC;wBAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC1E,CAAC;YACH,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,IAAI,YAAY,EAAE,QAAQ,EAAE,CAAC;QAC/F,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,IAAI,GAAG,CACZ,CAAC;SACE,WAAW,EAAE;SACb,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,CAAc,EAAE,CAAc;IAC7C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,EAAE,CAAC;IAC1C,OAAO,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC;AACzB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IACd,EAAE,CAAoB;IAE9B,YAAY,MAAc;QACxB,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QACrC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC;QACvC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;QACtC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAmCZ,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,MAMV;QACC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,qEAAqE,CAAC;aAC9E,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC1B,0EAA0E,CAC3E,CAAC;QACF,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnE,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACtC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC9B,KAAK,MAAM,GAAG,IAAI,IAAI;oBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC,CAAC,CAAC;QACH,MAAM,EAAE,CAAC;QACT,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,qDAAqD;IACrD,UAAU,CAAC,GAAW;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,mDAAmD,CAAC;aAC5D,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAA2B,CAAC;QAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,yEAAyE;IACzE,WAAW,CAAC,GAAW,EAAE,GAAW;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CACN;;uCAE+B,CAChC;aACA,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAKzB,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,OAAO;QACL,4EAA4E;QAC5E,6EAA6E;QAC7E,gEAAgE;QAChE,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CACN;wDACgD,sBAAsB;gDAC9B,SAAS,uCAAuC,CACzF;aACA,GAAG,EAA4B,CAAC;QACnC,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IAEO,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEjD,8EAA8E;IAC9E,OAAO,CAAC,GAAW;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aAChB,OAAO,CAAC,sEAAsE,CAAC;aAC/E,GAAG,CAAC,GAAG,CAA8B,CAAC;QACzC,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,yEAAyE;IACzE,UAAU,CAAC,GAAW;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,mDAAmD,CAAC;aAC5D,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAA2B,CAAC;QAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,8DAA8D;IAC9D,YAAY;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAAC,GAAG,EAA4B,CAAC;QAC3F,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,0EAA0E;IAC1E,aAAa,CAAC,MAAc;QAC1B,IAAI,CAAC,EAAE;aACJ,OAAO,CAAC,iEAAiE;YACjE,uDAAuD,CAAC;aAChE,GAAG,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC;IAED,+EAA+E;IAC/E,eAAe;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,yDAAyD,CAAC,CAAC,GAAG,EAE7E,CAAC;QACd,OAAO,GAAG,EAAE,KAAK,IAAI,IAAI,CAAC;IAC5B,CAAC;IAED;;;;;;;;OAQG;IACH,gBAAgB,CAAC,KAAa,EAAE,OAAO,GAAG,OAAO;QAC/C,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,oDAAoD,CAAC,CAAC,GAAG,EAExE,CAAC;YACd,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC/B,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,GAAG,OAAO;oBAAE,OAAO,KAAK,CAAC;YACpE,CAAC;YACD,IAAI,CAAC,EAAE;iBACJ,OAAO,CAAC,4DAA4D;gBAC5D,uDAAuD,CAAC;iBAChE,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACtB,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,gBAAgB;QACd,IAAI,CAAC;YACH,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC,GAAG,EAAE,CAAC;QACxE,CAAC;QAAC,MAAM,CAAC;YACP,iBAAiB;QACnB,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,cAAc;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC,GAAG,EAElE,CAAC;QACd,OAAO,GAAG,EAAE,CAAC,IAAI,IAAI,CAAC;IACxB,CAAC;IAED,oCAAoC;IACpC,YAAY,CAAC,IAAsB;QACjC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC;QAClF,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,EAAY,EAAE,EAAE;YAC9C,KAAK,MAAM,CAAC,IAAI,EAAE;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAE5D,CAAC;QACd,OAAO,GAAG,KAAK,SAAS,CAAC;IAC3B,CAAC;IAED,+DAA+D;IAC/D,KAAK;QACH,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;IAC3F,CAAC;IAED,8EAA8E;IAC9E,KAAK;QACH,MAAM,GAAG,GAAG,CAAC,GAAW,EAAU,EAAE,CAClC,CAAE,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAgC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACtE,OAAO;YACL,QAAQ,EAAE,GAAG,CAAC,uCAAuC,CAAC;YACtD,IAAI,EAAE,GAAG,CAAC,iDAAiD,CAAC;YAC5D,IAAI,EAAE,GAAG,CAAC,iDAAiD,CAAC;YAC5D,OAAO,EAAE,GAAG,CAAC,sCAAsC,CAAC;YACpD,yEAAyE;YACzE,qEAAqE;YACrE,mEAAmE;YACnE,uEAAuE;YACvE,gBAAgB;YAChB,YAAY,EAAE,GAAG,CACf;;;;;uDAK+C,sBAAsB;kDAC3B,SAAS;;WAEhD,CACJ;SACF,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,OAAO;QACL,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,EAA4B,CAAC;QACpG,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,KAAK;QACH,IAAI,CAAC;YACH,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QAAC,MAAM,CAAC;YACP,YAAY;QACd,CAAC;IACH,CAAC;CACF;AAED,SAAS,IAAI,CAAC,CAAS;IACrB,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AAChC,CAAC;AAED,SAAS,MAAM,CAAC,CAA0E;IACxF,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,KAAoB;QAC7B,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,UAAU,EAAE,CAAC,CAAC,WAAW,IAAI,SAAS;KACvC,CAAC;AACJ,CAAC;AA0BD;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CACzB,KAAkB,EAClB,KAAa,EACb,UAA8B,EAAE;IAEhC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;IACvC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC;IAC5C,MAAM,SAAS,GAAG,OAAO,CAAC,gBAAgB,IAAI,EAAE,CAAC;IACjD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,eAAe,EAAE,CAAC;IAEnD,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,IAAI,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;IACpF,IAAI,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,2EAA2E;IAC3E,8EAA8E;IAC9E,wEAAwE;IACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,uEAAuE;IACvE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,gDAAgD;IAChD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;IAC7B,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,UAAU,GAAuC,aAAa,CAAC;IAEnE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,MAAM;aACpB,UAAU,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,OAAO,CAAC;aACvC,GAAG,CAAC,IAAI,CAAC;YACV,mEAAmE;YACnE,sDAAsD;aACrD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACnD,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QACvB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,UAAU,GAAG,WAAW,CAAC;YACzB,MAAM;QACR,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,yEAAyE;QACzE,mDAAmD;QACnD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC/C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACrB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;oBAC/C,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;oBACnE,sEAAsE;oBACtE,iEAAiE;oBACjE,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBAAE,SAAS;oBAC1F,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC1B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE;YAC9E,OAAO,EAAE,UAAU;YACnB,cAAc;YACd,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;SACjC,CAAC,CAAC;QACH,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,wEAAwE;gBACxE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,wEAAwE;gBACxE,yEAAyE;gBACzE,qEAAqE;gBACrE,UAAU;gBACV,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC1D,SAAS;YACX,CAAC;YACD,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU,EAAE,CAAC;gBACjC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtB,SAAS;YACX,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,yEAAyE;YACzE,gEAAgE;YAChE,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzF,CAAC;QAED,4EAA4E;QAC5E,6EAA6E;QAC7E,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,0EAA0E;YAC1E,sDAAsD;YACtD,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;gBACjC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;wBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;QACjG,IAAI,UAAU,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU,EAAE,CAAC;YAC/C,SAAS,GAAG,UAAU,CAAC;YACvB,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC;YACxD,MAAM;QACR,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,UAAU,GAAG,WAAW,CAAC;YACzB,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;AACnD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAkB,EAAE,KAAa,EAAE,QAAQ,GAAG,EAAE;IAChF,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACjC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,2BAA2B;IACzC,OAAO,OAAO,CAAC,GAAG,CAAC,iBAAiB,KAAK,GAAG,CAAC;AAC/C,CAAC"}

package/dist/policies/schemas/policy.d.ts

@@ -21,10 +21,10 @@ export declare const PolicySchema: z.ZodObject<{
     version: number;
     createdAt: string;
     category: "custom" | "code" | "security" | "workflow" | "release" | "testing" | "infrastructure" | "ui" | "image" | "automation" | "quality" | "safety";
+    tags: string[];
     level: "REQUIRED" | "RECOMMENDED" | "OPTIONAL";
     enforcementStage: "review" | "always" | "pre-exec" | "post-exec";
     rawMarkdown: string;
-    tags: string[];
     updatedAt: string;
     isActive: boolean;
     convertedFormat?: string | null | undefined;
@@ -35,9 +35,9 @@ export declare const PolicySchema: z.ZodObject<{
     version: number;
     createdAt: string;
     category: "custom" | "code" | "security" | "workflow" | "release" | "testing" | "infrastructure" | "ui" | "image" | "automation" | "quality" | "safety";
+    tags: string[];
     level: "REQUIRED" | "RECOMMENDED" | "OPTIONAL";
     rawMarkdown: string;
-    tags: string[];
     updatedAt: string;
     isActive: boolean;
     priority?: number | undefined;

package/dist/self-harness/evidence-proposer.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Evidence-driven proposer — the D -> B connection (harness plan, 2026-07-31).
+ *
+ * The plan's load-bearing sequence is D (evidence corpus) THEN B (tool search
+ * space): record what the tool layer actually does, then mutate the knobs the
+ * evidence implicates. Shipping both halves without this module would leave the
+ * corpus written but unread and `ToolMod` defined but never emitted — a search
+ * space with nothing searching it.
+ *
+ * Unlike `heuristicProposer`, which maps a run-level FailureKind to an
+ * inference-server knob, this reads per-tool-call outcomes. That is the level
+ * the tool layer fails at: an `edit-miss` never surfaces as a run-level failure
+ * kind, it just quietly costs a turn, which is exactly why the loop could not
+ * see the surface the literature says matters most (tools +3.3pp, arXiv
+ * 2604.25850).
+ *
+ * Every proposal is a HYPOTHESIS with a measurable prediction, not a fix. The
+ * paired validator decides, and the change manifest falsifies it next round.
+ */
+import { Mod } from './mods.js';
+import type { Proposer } from './propose.js';
+import type { HarnessProfile } from './profile.js';
+import { type EvidenceSummary } from '../telemetry/tool-calls.js';
+/** Thresholds at which a signal is strong enough to be worth a bench run. */
+export interface EvidenceThresholds {
+    /** Minimum edit attempts before edit health means anything. */
+    minEditAttempts?: number;
+    /** Edit success rate below which the edit surface is implicated. */
+    editSuccessFloor?: number;
+    /** Share of edit attempts landing only via tolerance, above which anchors are stale. */
+    tolerantShareCeiling?: number;
+}
+/**
+ * Propose tool-layer Mods from the evidence corpus.
+ *
+ * `summary` is injected so this is testable without a database, and so a caller
+ * can scope it to one run.
+ */
+export declare function proposeFromEvidence(summary: EvidenceSummary, profile: HarnessProfile, thresholds?: EvidenceThresholds): Mod[];
+/**
+ * A `Proposer` that reads the live corpus.
+ *
+ * It ignores `weaknesses` by design: those are run-level failure kinds mined
+ * from bench records, and this proposer's whole point is the signal that never
+ * reaches that level.
+ */
+export declare function evidenceProposer(opts?: {
+    runId?: string;
+    thresholds?: EvidenceThresholds;
+    summary?: EvidenceSummary;
+}): Proposer;
+/**
+ * Run several proposers and concatenate, de-duplicated by structural identity.
+ * Lets the loop search the tool layer AND the server layer in one iteration
+ * without either proposer knowing about the other.
+ */
+export declare function combineProposers(id: string, proposers: Proposer[]): Proposer;
+//# sourceMappingURL=evidence-proposer.d.ts.map

package/dist/self-harness/evidence-proposer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evidence-proposer.d.ts","sourceRoot":"","sources":["../../src/self-harness/evidence-proposer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,GAAG,EAAwD,MAAM,WAAW,CAAC;AACtF,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAEnD,OAAO,EAAsB,KAAK,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAiBtF,6EAA6E;AAC7E,MAAM,WAAW,kBAAkB;IACjC,+DAA+D;IAC/D,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,oEAAoE;IACpE,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,wFAAwF;IACxF,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,eAAe,EACxB,OAAO,EAAE,cAAc,EACvB,UAAU,GAAE,kBAAuB,GAClC,GAAG,EAAE,CAiDP;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,kBAAkB,CAAC;IAAC,OAAO,CAAC,EAAE,eAAe,CAAA;CAAO,GACxF,QAAQ,CAQV;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAiB5E"}