@oortmem/decide-jev 0.0.0-stage → 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,3 +1,15 @@
-# Temporary Holding Version
+# @oortmem/decide-jev
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+Decides what happens to each new fact: add, update, supersede or skip. It uses TypeSafe Jev, which returns typed answers with probabilities.
+
+```sh
+npm install @oortmem/decide-jev
+```
+
+```ts
+import { jevDecider } from '@oortmem/decide-jev';
+
+const decide = jevDecider({ apiKey: process.env.TYPESAFE_API_KEY });
+```
+
+Part of [Oort](https://github.com/oortmem/oort), open-source memory for AI agents. See the [main README](https://github.com/oortmem/oort#readme) for how the pieces fit. Apache-2.0.

package/dist/index.d.ts

@@ -0,0 +1,47 @@
+import { type DecisionController } from '@oortmem/core';
+/** The slice of the TypeSafe client this adapter uses; inject a stub in tests. */
+export interface SystemOneClient {
+    systemOne(req: {
+        state: unknown;
+        questions: Record<string, unknown>;
+        model?: string;
+    }): Promise<{
+        answers: Record<string, any>;
+    }>;
+}
+export type DecideErrorKind = 'auth' | 'rate-limit' | 'server' | 'network' | 'timeout' | 'bad-response';
+/** A failed Jev call. The message never includes state, observation text, candidate text or the key. */
+export declare class DecideError extends Error {
+    readonly kind: DecideErrorKind;
+    readonly status: number | undefined;
+    /** The Oort Pro relay's own message for a refusal (relay mode only); never a vendor body. */
+    readonly relayMessage: string | undefined;
+    constructor(kind: DecideErrorKind, status?: number, relayMessage?: string);
+}
+/**
+ * The Jev model the Oort Pro relay serves (`MODELS.decide` in apps/relay/src/relay.ts): the SDK's
+ * own default. Relay mode pins it, so `TYPESAFE_DEFAULT_MODEL` cannot pick a model the relay refuses.
+ */
+export declare const RELAY_MODEL = "jev-latest";
+export interface JevDeciderOptions {
+    /** Defaults to `process.env.TYPESAFE_API_KEY`. Ignored when `client` is given. */
+    apiKey?: string;
+    client?: SystemOneClient;
+    model?: string;
+    /**
+     * The TypeSafe SDK's `baseURL` (its default is `https://api.typesafe.ai`, or
+     * `TYPESAFE_BASE_URL`). The Oort Pro relay is `https://relay.oortcloud.dev/v1/typesafe`,
+     * with an Oort key as `apiKey` (the SDK sends `Authorization: Bearer`). Ignored with `client`.
+     */
+    baseURL?: string;
+    /** The SDK's fetch, for tests. Ignored with `client`. */
+    fetch?: typeof fetch;
+    /**
+     * The calls go through the Oort Pro relay. A 429 with `Retry-After` is retried once, as
+     * before; a 429 without it (the monthly cap) is not retried, and the relay's message is kept on
+     * the error as `relayMessage`.
+     */
+    relay?: boolean;
+}
+/** System One controller backed by TypeSafe's Jev model. One `systemOne` call per stage. */
+export declare function jevDecider(opts?: JevDeciderOptions): DecisionController;

package/dist/index.js

@@ -0,0 +1,300 @@
+import { APIConnectionError, APITimeoutError, AuthenticationError, InternalServerError, PermissionDeniedError, RateLimitError, TypeSafeClient, choice, noul, score, } from '@typesafe-ai/sdk';
+import { MissingCredentialError, TOOL_SUMMARIES_MAX, TOOL_SUMMARY_MAX_BYTES, capUtf8, truncateUtf8, } from '@oortmem/core';
+import { NOVEL_CRITERIA, NOVEL_INSTRUCTIONS, RECONCILE_CRITERIA, SALIENCE_INSTRUCTIONS, SALIENCE_LEVELS, SALIENCE_NAMES, SHOULD_STORE_INSTRUCTIONS, TYPE_INSTRUCTIONS, novelManyInstructions, reconcileInstructions, reconcileManyInstructions, } from './questions.js';
+/** A failed Jev call. The message never includes state, observation text, candidate text or the key. */
+export class DecideError extends Error {
+    kind;
+    status;
+    /** The Oort Pro relay's own message for a refusal (relay mode only); never a vendor body. */
+    relayMessage;
+    constructor(kind, status, relayMessage) {
+        super(relayMessage ??
+            `Jev decision call failed (${kind}${status === undefined ? '' : `, HTTP ${status}`})`);
+        this.name = 'DecideError';
+        this.kind = kind;
+        this.status = status;
+        this.relayMessage = relayMessage;
+    }
+}
+/** The `error` string of a relay refusal body, cleaned and cut short; undefined for anything else. */
+function relayMessageOf(body) {
+    const msg = body?.error;
+    if (typeof msg !== 'string')
+        return undefined;
+    const clean = msg.replace(/[\u0000-\u001f\u007f]+/g, ' ').trim();
+    return clean === '' ? undefined : clean.slice(0, 400);
+}
+/**
+ * The Jev model the Oort Pro relay serves (`MODELS.decide` in apps/relay/src/relay.ts): the SDK's
+ * own default. Relay mode pins it, so `TYPESAFE_DEFAULT_MODEL` cannot pick a model the relay refuses.
+ */
+export const RELAY_MODEL = 'jev-latest';
+/** HTTP statuses the SDK retries on its own in relay mode: its default set, minus 429. */
+const RELAY_RETRY_STATUSES = new Set([408, ...Array.from({ length: 100 }, (_, i) => 500 + i)]);
+const MAX_RETRY_AFTER_MS = 5_000;
+function fromStatus(status) {
+    if (status === 401 || status === 403)
+        return new DecideError('auth', status);
+    if (status === 429)
+        return new DecideError('rate-limit', status);
+    if (status >= 500)
+        return new DecideError('server', status);
+    return new DecideError('bad-response', status);
+}
+/** Maps anything the SDK or client throws to a DecideError, dropping its message and cause. */
+function wrap(e, relay = false) {
+    if (e instanceof DecideError)
+        return e;
+    if (e instanceof RateLimitError && relay) {
+        return new DecideError('rate-limit', e.status, relayMessageOf(e.body));
+    }
+    if (e instanceof AuthenticationError || e instanceof PermissionDeniedError) {
+        return new DecideError('auth', e.status);
+    }
+    if (e instanceof RateLimitError)
+        return new DecideError('rate-limit', e.status);
+    if (e instanceof InternalServerError)
+        return new DecideError('server', e.status);
+    if (e instanceof APITimeoutError)
+        return new DecideError('timeout');
+    if (e instanceof APIConnectionError)
+        return new DecideError('network');
+    if (typeof e === 'object' && e !== null) {
+        const status = e.status;
+        if (typeof status === 'number')
+            return fromStatus(status);
+        const name = e.name;
+        if (name === 'TimeoutError' || name === 'AbortError')
+            return new DecideError('timeout');
+    }
+    return new DecideError('network');
+}
+const bad = () => new DecideError('bad-response');
+function isObj(x) {
+    return typeof x === 'object' && x !== null;
+}
+const isProb = (x) => typeof x === 'number' && Number.isFinite(x);
+function noulOf(answers, id) {
+    const a = answers[id];
+    if (!isObj(a) || a['type'] !== 'noul' || !isProb(a['noul']))
+        throw bad();
+    return a['noul'];
+}
+function scoreOf(answers, id) {
+    const a = answers[id];
+    if (!isObj(a) || a['type'] !== 'score' || !isProb(a['score']) || !isObj(a['probabilities'])) {
+        throw bad();
+    }
+    return { score: a['score'], probabilities: a['probabilities'] };
+}
+const ACTIONS = new Set(['NOOP', 'REINFORCE', 'ADD', 'UPDATE', 'SUPERSEDE']);
+function choiceOf(answers, id) {
+    const a = answers[id];
+    if (!isObj(a) || a['type'] !== 'choice' || !isObj(a['probabilities']))
+        throw bad();
+    const c = a['choice'];
+    if (typeof c !== 'string' || !ACTIONS.has(c))
+        throw bad();
+    const p = a['probabilities'][c];
+    if (!isProb(p))
+        throw bad();
+    return { action: c, probability: p };
+}
+const clamp = (x, lo, hi) => Math.min(hi, Math.max(lo, x));
+const MEMORY_TYPES = ['semantic', 'episodic', 'procedural', 'preference'];
+/**
+ * Keeps one Jev request body well under the relay's 64 KB limit (56 KB with the questions):
+ * user and assistant text 16 KB each (head and tail), a candidate memory's text 1 KB.
+ */
+const STATE_TEXT_MAX_BYTES = 16 * 1024;
+const CANDIDATE_TEXT_MAX_BYTES = 1024;
+function obsState(obs) {
+    return {
+        user: capUtf8(obs.userText, STATE_TEXT_MAX_BYTES),
+        assistant: capUtf8(obs.assistantText, STATE_TEXT_MAX_BYTES),
+        tools: obs.toolSummaries
+            .slice(0, TOOL_SUMMARIES_MAX)
+            .map((t) => truncateUtf8(t, TOOL_SUMMARY_MAX_BYTES)),
+        at: obs.at,
+    };
+}
+/** System One controller backed by TypeSafe's Jev model. One `systemOne` call per stage. */
+export function jevDecider(opts = {}) {
+    let client = opts.client;
+    if (client === undefined) {
+        const apiKey = opts.apiKey ?? process.env['TYPESAFE_API_KEY'];
+        if (apiKey === undefined || apiKey === '') {
+            throw new MissingCredentialError('TYPESAFE_API_KEY', 'decide.apiKey');
+        }
+        client = new TypeSafeClient({
+            apiKey,
+            ...(opts.baseURL !== undefined && { baseURL: opts.baseURL }),
+            ...(opts.fetch !== undefined && { fetch: opts.fetch }),
+            // The SDK would retry every 429 (twice); here a cap 429 must not be retried. It keeps its
+            // retries for 408 and 5xx, and `ask` makes the one retry for a 429 with Retry-After.
+            // The relay checks the body, so it takes only plain JSON (no zstd) and its pinned model.
+            ...(opts.relay === true && {
+                retry: { httpStatuses: RELAY_RETRY_STATUSES },
+                compression: false,
+                defaultModel: RELAY_MODEL,
+            }),
+        });
+    }
+    const c = client;
+    async function ask(state, questions) {
+        try {
+            const req = { state, questions, ...(opts.model === undefined ? {} : { model: opts.model }) };
+            let res;
+            try {
+                res = await c.systemOne(req);
+            }
+            catch (e) {
+                const wait = e instanceof RateLimitError && opts.relay === true ? e.retryAfterMs : undefined;
+                if (wait === undefined)
+                    throw e;
+                await new Promise((r) => setTimeout(r, Math.min(wait, MAX_RETRY_AFTER_MS)));
+                res = await c.systemOne(req);
+            }
+            if (!isObj(res) || !isObj(res.answers))
+                throw bad();
+            return res.answers;
+        }
+        catch (e) {
+            throw wrap(e, opts.relay === true);
+        }
+    }
+    return {
+        async gate(obs) {
+            const questions = {
+                should_store: noul(SHOULD_STORE_INSTRUCTIONS),
+                salience: score(SALIENCE_INSTRUCTIONS, [...SALIENCE_LEVELS]),
+            };
+            for (const t of MEMORY_TYPES)
+                questions[`type_${t}`] = noul(TYPE_INSTRUCTIONS[t]);
+            const answers = await ask(obsState(obs), questions);
+            const decisions = [];
+            const yesNo = (question, p) => decisions.push({
+                stage: 'gate',
+                question,
+                answer: p >= 0.5 ? 'yes' : 'no',
+                probability: p,
+            });
+            const shouldStore = noulOf(answers, 'should_store');
+            yesNo('should_store', shouldStore);
+            const sal = scoreOf(answers, 'salience');
+            const s = clamp(sal.score, 0, 3);
+            const level = Math.round(s);
+            const lp = sal.probabilities[String(level)];
+            if (!isProb(lp))
+                throw bad();
+            decisions.push({
+                stage: 'gate',
+                question: 'salience',
+                answer: SALIENCE_NAMES[level],
+                probability: lp,
+            });
+            const types = {};
+            for (const t of MEMORY_TYPES) {
+                const p = noulOf(answers, `type_${t}`);
+                types[t] = p;
+                yesNo(`type_${t}`, p);
+            }
+            return { shouldStore, salience: 0.1 + 0.3 * s, types, decisions };
+        },
+        async reconcile(obs, candidates) {
+            const one = (question, candidateId, a) => ({
+                candidateId,
+                action: a.action,
+                probability: a.probability,
+                decisions: [{ stage: 'reconcile', question, answer: a.action, probability: a.probability }],
+            });
+            if (candidates.length === 0) {
+                const answers = await ask({ observation: obsState(obs), candidates: [] }, { novel: choice(NOVEL_INSTRUCTIONS, NOVEL_CRITERIA) });
+                return [one('novel', null, choiceOf(answers, 'novel'))];
+            }
+            const questions = {};
+            candidates.forEach((_, i) => {
+                questions[`c${i}`] = choice(reconcileInstructions(i), RECONCILE_CRITERIA);
+            });
+            const state = {
+                observation: obsState(obs),
+                candidates: candidates.map((m) => ({
+                    id: m.id,
+                    text: truncateUtf8(m.text, CANDIDATE_TEXT_MAX_BYTES),
+                    type: m.type,
+                    validFrom: m.validFrom,
+                })),
+            };
+            const answers = await ask(state, questions);
+            return candidates.map((m, i) => one(`c${i}`, m.id, choiceOf(answers, `c${i}`)));
+        },
+        async reconcileMany(items) {
+            // One call for several facts, split where one request would outgrow the size cap.
+            const out = [];
+            let chunk = [];
+            const flush = async () => {
+                if (chunk.length === 0)
+                    return;
+                out.push(...(await reconcileChunk(chunk.map((j) => items[j]))));
+                chunk = [];
+            };
+            for (let j = 0; j < items.length; j++) {
+                const next = [...chunk, j].map((k) => items[k]);
+                if (chunk.length > 0 && requestBytes(manyRequest(next)) > MANY_REQUEST_MAX_BYTES)
+                    await flush();
+                chunk.push(j);
+            }
+            await flush();
+            return out;
+        },
+    };
+    async function reconcileChunk(items) {
+        const { state, questions } = manyRequest(items);
+        const answers = await ask(state, questions);
+        return items.map((it, j) => {
+            const one = (question, candidateId) => {
+                const a = choiceOf(answers, question);
+                return {
+                    candidateId,
+                    action: a.action,
+                    probability: a.probability,
+                    decisions: [
+                        { stage: 'reconcile', question, answer: a.action, probability: a.probability },
+                    ],
+                };
+            };
+            if (it.candidates.length === 0)
+                return [one(`f${j}_novel`, null)];
+            return it.candidates.map((m, i) => one(`f${j}_c${i}`, m.id));
+        });
+    }
+}
+/** Keeps a batched reconcile body under the relay's 56 KB, with room for the request envelope. */
+const MANY_REQUEST_MAX_BYTES = 48 * 1024;
+const requestBytes = (r) => new TextEncoder().encode(JSON.stringify(r)).byteLength;
+function manyRequest(items) {
+    const questions = {};
+    items.forEach((it, j) => {
+        if (it.candidates.length === 0) {
+            questions[`f${j}_novel`] = choice(novelManyInstructions(j), NOVEL_CRITERIA);
+        }
+        else {
+            it.candidates.forEach((_, i) => {
+                questions[`f${j}_c${i}`] = choice(reconcileManyInstructions(j, i), RECONCILE_CRITERIA);
+            });
+        }
+    });
+    const state = {
+        facts: items.map((it) => ({
+            observation: obsState(it.obs),
+            candidates: it.candidates.map((m) => ({
+                id: m.id,
+                text: truncateUtf8(m.text, CANDIDATE_TEXT_MAX_BYTES),
+                type: m.type,
+                validFrom: m.validFrom,
+            })),
+        })),
+    };
+    return { state, questions };
+}
+//# sourceMappingURL=index.js.map

package/dist/questions.d.ts

@@ -0,0 +1,33 @@
+/**
+ * The questions Jev answers. Question ids are not sent to the model, so every
+ * instruction must stand on its own. Later calibration work tunes this file.
+ */
+export declare const SHOULD_STORE_INSTRUCTIONS = "Does this exchange between a developer and an AI coding assistant contain a fact, decision, preference, or reusable procedure that would be useful to remember in a future session? Small talk, acknowledgements, and transient progress updates are not.";
+export declare const SALIENCE_INSTRUCTIONS = "How important would it be for the assistant to remember this in future sessions?";
+/** Ordered low to high; the gate maps score 0..3 to salience 0.1..1.0. */
+export declare const SALIENCE_LEVELS: readonly ['trivial: no lasting value', 'useful: nice to recall but not essential', 'important: changes how future work should be done', 'critical: forgetting it would cause a mistake or repeated work'];
+/** Short names of the salience levels, in the same order as SALIENCE_LEVELS. */
+export declare const SALIENCE_NAMES: readonly ['trivial', 'useful', 'important', 'critical'];
+export declare const TYPE_INSTRUCTIONS: {
+    readonly semantic: 'Does this exchange contain a durable fact about a codebase, system, product or person that would stay true across sessions?';
+    readonly episodic: 'Does this exchange describe a specific event or incident at a point in time, such as a debugging session or a decision made on a particular day?';
+    readonly procedural: 'Does this exchange contain a reusable how-to, such as a command sequence, workflow or playbook for getting something done?';
+    readonly preference: 'Does this exchange contain a stated preference or rule for style, tools or communication that the assistant should follow in future?';
+};
+export declare function reconcileInstructions(i: number): string;
+/** `reconcileInstructions` for fact `j` of a batched request (CON-56). */
+export declare function reconcileManyInstructions(j: number, i: number): string;
+/** `NOVEL_INSTRUCTIONS` for fact `j` of a batched request. */
+export declare function novelManyInstructions(j: number): string;
+export declare const RECONCILE_CRITERIA: {
+    readonly NOOP: 'unrelated: the observation is about something else';
+    readonly REINFORCE: 'restates or confirms the memory with no new information';
+    readonly UPDATE: 'adds detail to or refines the memory without contradicting it';
+    readonly SUPERSEDE: 'states that the memory is no longer true; the situation changed or the memory was wrong';
+    readonly ADD: 'touches the same subject but carries a separate new fact that should be stored on its own';
+};
+export declare const NOVEL_INSTRUCTIONS = "Does the new observation contain information worth storing as a new memory?";
+export declare const NOVEL_CRITERIA: {
+    readonly ADD: 'yes, it contains a new fact, decision, preference or procedure';
+    readonly NOOP: 'no, nothing new worth storing';
+};

package/dist/questions.js

@@ -0,0 +1,45 @@
+/**
+ * The questions Jev answers. Question ids are not sent to the model, so every
+ * instruction must stand on its own. Later calibration work tunes this file.
+ */
+export const SHOULD_STORE_INSTRUCTIONS = 'Does this exchange between a developer and an AI coding assistant contain a fact, decision, preference, or reusable procedure that would be useful to remember in a future session? Small talk, acknowledgements, and transient progress updates are not.';
+export const SALIENCE_INSTRUCTIONS = 'How important would it be for the assistant to remember this in future sessions?';
+/** Ordered low to high; the gate maps score 0..3 to salience 0.1..1.0. */
+export const SALIENCE_LEVELS = [
+    'trivial: no lasting value',
+    'useful: nice to recall but not essential',
+    'important: changes how future work should be done',
+    'critical: forgetting it would cause a mistake or repeated work',
+];
+/** Short names of the salience levels, in the same order as SALIENCE_LEVELS. */
+export const SALIENCE_NAMES = ['trivial', 'useful', 'important', 'critical'];
+export const TYPE_INSTRUCTIONS = {
+    semantic: 'Does this exchange contain a durable fact about a codebase, system, product or person that would stay true across sessions?',
+    episodic: 'Does this exchange describe a specific event or incident at a point in time, such as a debugging session or a decision made on a particular day?',
+    procedural: 'Does this exchange contain a reusable how-to, such as a command sequence, workflow or playbook for getting something done?',
+    preference: 'Does this exchange contain a stated preference or rule for style, tools or communication that the assistant should follow in future?',
+};
+export function reconcileInstructions(i) {
+    return `How does the new observation relate to the existing memory at \`candidates[${i}]\`? Judge only this one memory.`;
+}
+/** `reconcileInstructions` for fact `j` of a batched request (CON-56). */
+export function reconcileManyInstructions(j, i) {
+    return `How does the new fact at \`facts[${j}].observation\` relate to the existing memory at \`facts[${j}].candidates[${i}]\`? Judge only this fact and this one memory.`;
+}
+/** `NOVEL_INSTRUCTIONS` for fact `j` of a batched request. */
+export function novelManyInstructions(j) {
+    return `Does the new fact at \`facts[${j}].observation\` contain information worth storing as a new memory?`;
+}
+export const RECONCILE_CRITERIA = {
+    NOOP: 'unrelated: the observation is about something else',
+    REINFORCE: 'restates or confirms the memory with no new information',
+    UPDATE: 'adds detail to or refines the memory without contradicting it',
+    SUPERSEDE: 'states that the memory is no longer true; the situation changed or the memory was wrong',
+    ADD: 'touches the same subject but carries a separate new fact that should be stored on its own',
+};
+export const NOVEL_INSTRUCTIONS = 'Does the new observation contain information worth storing as a new memory?';
+export const NOVEL_CRITERIA = {
+    ADD: 'yes, it contains a new fact, decision, preference or procedure',
+    NOOP: 'no, nothing new worth storing',
+};
+//# sourceMappingURL=questions.js.map

package/package.json

@@ -1,6 +1,59 @@
 {
   "name": "@oortmem/decide-jev",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
+  "version": "0.1.0",
+  "description": "Oort decisions: add, update, supersede or skip, using TypeSafe Jev.",
+  "keywords": [
+    "oort",
+    "agent-memory",
+    "ai-agents",
+    "llm-memory",
+    "typesafe",
+    "jev",
+    "decision"
+  ],
+  "homepage": "https://oortcloud.dev",
+  "bugs": {
+    "url": "https://github.com/oortmem/oort/issues",
+    "email": "hello@oortcloud.dev"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/oortmem/oort.git",
+    "directory": "packages/decide-jev"
+  },
+  "license": "Apache-2.0",
+  "author": "Oort <hello@oortcloud.dev>",
+  "type": "module",
+  "engines": {
+    "node": ">=22.15.0"
+  },
+  "sideEffects": false,
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "!dist/**/*.map",
+    "README.md",
+    "LICENSE"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "dependencies": {
+    "@oortmem/core": "0.1.0",
+    "@typesafe-ai/sdk": "0.7.0"
+  },
+  "devDependencies": {
+    "vitest": "^5.0.5"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "typecheck": "tsc -p tsconfig.typecheck.json"
+  }
 }