@ixo/openhands-sdk 0.0.0-stage → 0.2.0

package/dist/cjs/rubric/leg.js

@@ -0,0 +1,147 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.OPENHANDS_CARD = exports.checkerPhotoUpay = exports.checkerAiUpay = exports.checkerBaseUpay = exports.PARTNER_STANDARD = void 0;
+exports.evaluationLegQuote = evaluationLegQuote;
+exports.evaluationLegFor = evaluationLegFor;
+exports.checkerLegBase = checkerLegBase;
+const given_ts_1 = require("../given.js");
+const envRead_ts_1 = require("../envRead.js");
+/** Their Partner Standard card, as published. Overridable by env at the caller. */
+exports.PARTNER_STANDARD = { baseUsd: 0.3, aiRuleUsd: 0.01, photoUsd: 0.1, agentClaimUsd: 0.05 };
+/** 1 PAY = 1 USD, six decimals — the whole reason this arithmetic closes. */
+const MICRO = 1_000_000;
+/**
+ * What one ask's evaluation leg should hold.
+ *
+ * `spots` is the ask's quota: the engine decides every claim, so a quota of
+ * three is three agent-claim charges even if only one is approved.
+ */
+function evaluationLegQuote(terms, spots = 1, price = exports.PARTNER_STANDARD) {
+    const criteria = (terms?.criteria ?? []);
+    const aiRules = criteria.filter((one) => one?.kind === "judge").length;
+    /* A pair is two screens per spot, because the judge looks at both. */
+    const deliverableType = terms?.deliverable?.type;
+    const photos = deliverableType === "photo-pair" ? spots * 2 : deliverableType === "photo" ? spots : 0;
+    const because = [`base $${price.baseUsd.toFixed(2)}`];
+    let usd = price.baseUsd;
+    const chargedAiRules = Math.max(0, aiRules - (price.includedAiRules ?? 0));
+    if (chargedAiRules > 0) {
+        usd += chargedAiRules * price.aiRuleUsd;
+        because.push(`${chargedAiRules} AI-judged ${chargedAiRules === 1 ? "rule" : "rules"} at $${price.aiRuleUsd.toFixed(2)}`);
+    }
+    if (photos > 0) {
+        usd += photos * price.photoUsd;
+        because.push(`${photos} ${photos === 1 ? "photo" : "photos"} screened at $${price.photoUsd.toFixed(2)}`);
+    }
+    if (price.agentClaimUsd > 0) {
+        usd += spots * price.agentClaimUsd;
+        because.push(`${spots} agent ${spots === 1 ? "claim" : "claims"} at $${price.agentClaimUsd.toFixed(2)} (partner relayer)`);
+    }
+    /* Rounded up to the cent. A leg a fraction under their price is a leg that
+       invoices somebody, which is the one outcome this whole function exists to
+       avoid — so the rounding goes their way, deliberately. The inner rounding
+       is not decoration: `0.10 + 0.02` is `0.12000000000000001` in floats, and a
+       bare ceil turns that dust into a real extra cent on every ask. Genuine
+       fractions of a cent still round up; noise does not. */
+    const cents = Math.ceil(Math.round(usd * 10_000) / 100);
+    return { base: String(cents * (MICRO / 100)), usd: cents / 100, because };
+}
+/**
+ * The same quote, or a refusal naming the reason.
+ *
+ * A `uixo` board cannot fund an engine-live ask at all: at market rate the leg
+ * would have to be hundreds of IXO to reach $0.30 of their credit, and the
+ * poster would be paying a checker fee nobody asked for. Refusing is the
+ * honest answer, and it is the whole finding of the engine audit's §13.
+ */
+function evaluationLegFor(denom, terms, spots = 1, price) {
+    if (denom !== "upay") {
+        throw new Error(`an engine-live ask must pay its evaluation leg in PAY, not ${denom}. Their FX values everything except USD-stables at market rate, so a ${denom} leg cannot cover their price`);
+    }
+    return evaluationLegQuote(terms, spots, price);
+}
+/**
+ * Our own checker's card — the evaluation leg as a priced service.
+ *
+ * The poster chooses their judge at posting time (themselves, this checker, or
+ * the ixo engine — the chain allows exactly one per claim), and the chosen
+ * judge's card prices the leg. This is ours, and its design argument is the
+ * opposite of a menu of tolls:
+ *
+ * **Everything deterministic rides in the base.** Location, weather, daylight,
+ * re-measuring a URL — these cost us arithmetic and one keyless HTTP call, and
+ * they are the product's differentiator. Priced as add-ons, posters would skip
+ * them and every answer would get worse by default. So the base *includes*
+ * them, plus the standard relevance judge, and the line items are only the
+ * things that genuinely cost per unit: extra AI-judged rules and photo
+ * screening.
+ *
+ * For comparison, read from their public card the same day this was written:
+ * theirs is $0.30 base + $0.01/AI rule + $0.10/photo + $0.05/agent claim, and
+ * their binder defers geo to a human. Same slot, richer checks, a third of the
+ * price — that is the sentence this card exists to make true.
+ */
+/* Read strictly: a mis-set variable used to become NaN, and a NaN base prices
+   every leg on the network at "NaN" — the composer's bill, the funding
+   target, the escrow the pass asks the chain for. Anything that is not a
+   whole, non-negative number of base units falls to the card's own figure. */
+/* Each price reads its variable by its literal name (`strictBase`, envRead.ts → network.ts).
+   They are getters so the card is read when it is priced, not when this
+   module loads — and so `configure({ checkerBaseUpay })` reaches it. */
+const checkerBaseUpay = () => (0, given_ts_1.givenConfig)().checkerBaseUpay ?? (0, envRead_ts_1.strictBase)((0, envRead_ts_1.hasEnv)() ? process.env.QI_CHECKER_BASE_UPAY : undefined, 100_000);
+exports.checkerBaseUpay = checkerBaseUpay;
+const checkerAiUpay = () => (0, given_ts_1.givenConfig)().checkerAiUpay ?? (0, envRead_ts_1.strictBase)((0, envRead_ts_1.hasEnv)() ? process.env.QI_CHECKER_AI_UPAY : undefined, 10_000);
+exports.checkerAiUpay = checkerAiUpay;
+const checkerPhotoUpay = () => (0, given_ts_1.givenConfig)().checkerPhotoUpay ?? (0, envRead_ts_1.strictBase)((0, envRead_ts_1.hasEnv)() ? process.env.QI_CHECKER_PHOTO_UPAY : undefined, 50_000);
+exports.checkerPhotoUpay = checkerPhotoUpay;
+exports.OPENHANDS_CARD = {
+    get baseUsd() {
+        return (0, exports.checkerBaseUpay)() / MICRO;
+    },
+    get aiRuleUsd() {
+        return (0, exports.checkerAiUpay)() / MICRO;
+    },
+    get photoUsd() {
+        return (0, exports.checkerPhotoUpay)() / MICRO;
+    },
+    /* We are our own relayer; nobody skims our claims. */
+    agentClaimUsd: 0,
+    includedAiRules: 1
+};
+/**
+ * What OUR checker's leg should hold for this ask, in base units of `denom`.
+ *
+ * On a PAY board the card prices it, because the card is in dollars and PAY is
+ * the only denom that honestly wears a dollar face. On anything else the flat
+ * fallback stands — pricing IXO from a USD card would need an exchange rate,
+ * and inventing one is how the engine audit's §13 mistake gets made in reverse.
+ */
+function checkerLegBase(denom, terms, flatFallbackBase) {
+    if (denom !== "upay")
+        return flatFallbackBase;
+    /*
+     * **Never below what the checker says it will take.**
+     *
+     * The card is our estimate of the work; the checker's own minimum is a
+     * refusal. The Openhands oracle answers any evaluation leg under its floor
+     * with a 402 at register, and an ask it will not register is judged by
+     * nobody and says so to nobody — the claims simply sit.
+     *
+     * This used to return the card's quote alone and discard `flatFallbackBase`
+     * on PAY. That was harmless while the card priced above the floor. It stopped
+     * being harmless the day the floor rose to 350000: OPENHANDS_CARD reads its
+     * base from `QI_CHECKER_BASE_UPAY` through a dynamic `process.env[name]`,
+     * which Next.js does not inline, so in the browser the composer priced every
+     * ask at the 100000 default — about 130000 a leg — while displaying the
+     * oracle's live 350000 beside it. Every ask posted through the UI was
+     * refused at register.
+     *
+     * Callers already pass the checker's price as the fallback — the composer
+     * the live /v1/info minimum, the scripts CHECK_REWARD_BASE — so taking the
+     * larger of the two makes the leg honest in every runtime, whether or not
+     * the card's env reached it.
+     */
+    const quoted = Number(evaluationLegQuote(terms, 1, exports.OPENHANDS_CARD).base);
+    return Math.max(quoted, flatFallbackBase);
+}
+//# sourceMappingURL=leg.js.map

package/dist/cjs/rubric/leg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"leg.js","sourceRoot":"","sources":["../../../src/rubric/leg.ts"],"names":[],"mappings":";;;AAuEA,gDAgCC;AAUD,4CAOC;AAyDD,wCA0BC;AA3MD,0CAA0C;AAC1C,8CAAmD;AAiDnD,mFAAmF;AACtE,QAAA,gBAAgB,GAAgB,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;AAEnH,6EAA6E;AAC7E,MAAM,KAAK,GAAG,SAAS,CAAC;AAWxB;;;;;GAKG;AACH,SAAgB,kBAAkB,CAAC,KAAkC,EAAE,KAAK,GAAG,CAAC,EAAE,QAAqB,wBAAgB;IACrH,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,QAAQ,IAAI,EAAE,CAAwB,CAAC;IAChE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,OAAO,CAAC,CAAC,MAAM,CAAC;IACvE,sEAAsE;IACtE,MAAM,eAAe,GAAI,KAAgE,EAAE,WAAW,EAAE,IAAI,CAAC;IAC7G,MAAM,MAAM,GAAG,eAAe,KAAK,YAAY,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtG,MAAM,OAAO,GAAG,CAAC,SAAS,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC;IAExB,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QACvB,GAAG,IAAI,cAAc,GAAG,KAAK,CAAC,SAAS,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC,GAAG,cAAc,cAAc,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,QAAQ,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3H,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACf,GAAG,IAAI,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,iBAAiB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3G,CAAC;IACD,IAAI,KAAK,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC;QAC5B,GAAG,IAAI,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,QAAQ,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC;IAC7H,CAAC;IAED;;;;;6DAKyD;IACzD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;IACxD,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,OAAO,EAAE,CAAC;AAC5E,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,gBAAgB,CAAC,KAAa,EAAE,KAAkC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAmB;IAChH,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CACb,8DAA8D,KAAK,wEAAwE,KAAK,+BAA+B,CAChL,CAAC;IACJ,CAAC;IACD,OAAO,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH;;;8EAG8E;AAC9E;;wEAEwE;AACjE,MAAM,eAAe,GAAG,GAAW,EAAE,CAAC,IAAA,sBAAW,GAAE,CAAC,eAAe,IAAI,IAAA,uBAAU,EAAC,IAAA,mBAAM,GAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;AAA9I,QAAA,eAAe,mBAA+H;AACpJ,MAAM,aAAa,GAAG,GAAW,EAAE,CAAC,IAAA,sBAAW,GAAE,CAAC,aAAa,IAAI,IAAA,uBAAU,EAAC,IAAA,mBAAM,GAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;AAAvI,QAAA,aAAa,iBAA0H;AAC7I,MAAM,gBAAgB,GAAG,GAAW,EAAE,CAAC,IAAA,sBAAW,GAAE,CAAC,gBAAgB,IAAI,IAAA,uBAAU,EAAC,IAAA,mBAAM,GAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;AAAhJ,QAAA,gBAAgB,oBAAgI;AAEhJ,QAAA,cAAc,GAAgB;IACzC,IAAI,OAAO;QACT,OAAO,IAAA,uBAAe,GAAE,GAAG,KAAK,CAAC;IACnC,CAAC;IACD,IAAI,SAAS;QACX,OAAO,IAAA,qBAAa,GAAE,GAAG,KAAK,CAAC;IACjC,CAAC;IACD,IAAI,QAAQ;QACV,OAAO,IAAA,wBAAgB,GAAE,GAAG,KAAK,CAAC;IACpC,CAAC;IACD,sDAAsD;IACtD,aAAa,EAAE,CAAC;IAChB,eAAe,EAAE,CAAC;CACnB,CAAC;AAEF;;;;;;;GAOG;AACH,SAAgB,cAAc,CAAC,KAAa,EAAE,KAAkC,EAAE,gBAAwB;IACxG,IAAI,KAAK,KAAK,MAAM;QAAE,OAAO,gBAAgB,CAAC;IAC9C;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,MAAM,MAAM,GAAG,MAAM,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC,EAAE,sBAAc,CAAC,CAAC,IAAI,CAAC,CAAC;IACzE,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;AAC5C,CAAC"}

package/dist/cjs/rubric/publish.d.ts

@@ -0,0 +1,39 @@
+import { type BridgeOptions, type FormBinding } from "./bridge.ts";
+import type { AskTerms, DoneMeans } from "./terms.ts";
+/**
+ * Putting the engine's copy of an ask's rules where its resolver can fetch it.
+ *
+ * The upload itself belongs to whoever calls this — the app has one store
+ * client and the worker another — so this owns only the part that must not
+ * vary: the same bytes are hashed and stored, and the address they end up at
+ * is the one the chain will point to.
+ *
+ * **Best effort, always.** An ask that could not publish a rubric is an ask
+ * the engine has no rules for, which is exactly what every ask was until
+ * today. An ask that fails to post because a file server was busy is a person
+ * not getting paid. The first is a missing convenience, the second is a bug.
+ * The one rubric that is *refused* rather than missed is an ask with an
+ * `attest` criterion: the poster judges those, and no oracle can.
+ */
+/** Where the bytes went. `proof` is a hex sha256 — not a CID (see `rubricDocument`). */
+export interface PublishedRubric {
+    url: string;
+    proof: string;
+}
+/** Uploads the exact bytes and answers with their public address, or null. */
+export type UploadText = (text: string, contentType: string) => Promise<{
+    url: string;
+} | null>;
+export declare function publishEngineRubric(terms: AskTerms | DoneMeans | null | undefined, binding: FormBinding | null, upload: UploadText, options?: BridgeOptions): Promise<PublishedRubric | null>;
+/** The `#rub` resource, ready for a `MsgCreateEntity`. Shape only — no SDK here. */
+export declare const engineRubricResource: (published: PublishedRubric) => {
+    type: string;
+    id: string;
+    description: string;
+    mediaType: string;
+    serviceEndpoint: string;
+    proof: string;
+    encrypted: string;
+    right: string;
+};
+//# sourceMappingURL=publish.d.ts.map

package/dist/cjs/rubric/publish.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"publish.d.ts","sourceRoot":"","sources":["../../../src/rubric/publish.ts"],"names":[],"mappings":"AAAA,OAAO,EAAkB,KAAK,aAAa,EAAE,KAAK,WAAW,EAAE,MAAM,aAAa,CAAC;AACnF,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAEtD;;;;;;;;;;;;;;GAcG;AAEH,wFAAwF;AACxF,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf;AAED,8EAA8E;AAC9E,MAAM,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,KAAK,OAAO,CAAC;IAAE,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAAC,CAAC;AAEhG,wBAAsB,mBAAmB,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC,CAYvM;AAED,oFAAoF;AACpF,eAAO,MAAM,oBAAoB,GAAI,WAAW,eAAe;;;;;;;;;CAW7D,CAAC"}

package/dist/cjs/rubric/publish.js

@@ -0,0 +1,34 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.engineRubricResource = void 0;
+exports.publishEngineRubric = publishEngineRubric;
+const bridge_ts_1 = require("./bridge.js");
+async function publishEngineRubric(terms, binding, upload, options = {}) {
+    /* No terms, or no published claim form to bind them to, means there is
+       nothing true to say — so nothing is said. */
+    if (!terms || !binding?.protocol || !binding?.proof)
+        return null;
+    try {
+        const { text, proof } = await (0, bridge_ts_1.rubricDocument)(terms, binding, options);
+        const stored = await upload(text, "application/ld+json");
+        return stored ? { url: stored.url, proof } : null;
+    }
+    catch {
+        return null;
+    }
+}
+/** The `#rub` resource, ready for a `MsgCreateEntity`. Shape only — no SDK here. */
+const engineRubricResource = (published) => ({
+    type: "rubric",
+    id: "{id}#rub",
+    description: "The same terms, in the evals-engine's rubric format",
+    mediaType: "application/ld+json",
+    serviceEndpoint: published.url,
+    /* Hex sha256 of the exact stored bytes — their resolver recomputes it and
+       fails closed on a mismatch. */
+    proof: published.proof,
+    encrypted: "false",
+    right: ""
+});
+exports.engineRubricResource = engineRubricResource;
+//# sourceMappingURL=publish.js.map

package/dist/cjs/rubric/publish.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"publish.js","sourceRoot":"","sources":["../../../src/rubric/publish.ts"],"names":[],"mappings":";;;AA4BA,kDAYC;AAxCD,2CAAmF;AA4B5E,KAAK,UAAU,mBAAmB,CAAC,KAA8C,EAAE,OAA2B,EAAE,MAAkB,EAAE,UAAyB,EAAE;IACpK;mDAC+C;IAC/C,IAAI,CAAC,KAAK,IAAI,CAAC,OAAO,EAAE,QAAQ,IAAI,CAAC,OAAO,EAAE,KAAK;QAAE,OAAO,IAAI,CAAC;IAEjE,IAAI,CAAC;QACH,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,IAAA,0BAAc,EAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACtE,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,EAAE,qBAAqB,CAAC,CAAC;QACzD,OAAO,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACpD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,oFAAoF;AAC7E,MAAM,oBAAoB,GAAG,CAAC,SAA0B,EAAE,EAAE,CAAC,CAAC;IACnE,IAAI,EAAE,QAAQ;IACd,EAAE,EAAE,UAAU;IACd,WAAW,EAAE,qDAAqD;IAClE,SAAS,EAAE,qBAAqB;IAChC,eAAe,EAAE,SAAS,CAAC,GAAG;IAC9B;qCACiC;IACjC,KAAK,EAAE,SAAS,CAAC,KAAK;IACtB,SAAS,EAAE,OAAO;IAClB,KAAK,EAAE,EAAE;CACV,CAAC,CAAC;AAXU,QAAA,oBAAoB,wBAW9B"}

package/dist/cjs/rubric/reanchor.d.ts

@@ -0,0 +1,79 @@
+import type { EngineRubric } from "./bridge.ts";
+/**
+ * The pure half of re-anchoring an ask's `#rub` (`scripts/reanchor-rubric.ts`).
+ *
+ * An ask's rubric is hashed into its entity at posting, and the only way a
+ * live ask ever reads a newer bridge is for its owner to swap that one linked
+ * resource. Two questions decide whether a swap is safe, and both are answered
+ * here without a network: WHICH resource is the ask's rubric, exactly as the
+ * chain stores its id, and WHAT the swap would change about how a claim is
+ * judged.
+ */
+export interface StoredResource {
+    id: string;
+    type?: string;
+    proof?: string;
+    serviceEndpoint?: string;
+    mediaType?: string;
+    description?: string;
+    encrypted?: string;
+    right?: string;
+}
+/**
+ * The one resource on an entity that answers to a fragment, with its id AS
+ * STORED.
+ *
+ * The chain keeps whatever id the entity was minted with: the literal
+ * `{id}#rub` on every ask this estate posted, the expanded `did:…#rub` on an
+ * entity somebody else's tooling made. `MsgDeleteLinkedResource` matches the
+ * stored string exactly, so the id is read and carried, never rebuilt. Two
+ * resources answering to one fragment is an entity nobody should guess about.
+ */
+export declare function resourceByFragment<T extends StoredResource>(resources: readonly T[] | null | undefined, entityDid: string, fragment: string): T | null;
+export interface NamedDiff {
+    added: string[];
+    removed: string[];
+    /** Same name, different body — a source whose `send` moved, a judge whose instructions were reworded. */
+    changed: string[];
+    unchanged: string[];
+}
+export interface GateDiff extends NamedDiff {
+    /** Same code and same rule, different `reason` text only. Harmless to a decision. */
+    reworded: string[];
+    /** Codes both rubrics carry whose order relative to each other differs. The first failed gate is terminal, so order is meaning. */
+    reordered: string[];
+}
+export interface RubricDiff {
+    sources: NamedDiff;
+    aiChecks: NamedDiff;
+    gates: GateDiff;
+    /** The form binding and the duplicate rule, which a re-anchor must never touch. */
+    claimSchemaSame: boolean;
+    uniqueSame: boolean;
+    /** Why this swap must not be signed. Empty means it may. */
+    refusals: string[];
+}
+/**
+ * What swapping `before` for `after` changes.
+ *
+ * **Existing gate codes must not move.** A code is what a decision already on
+ * the ledger names as its reason, what the app's refusal screens are keyed by,
+ * and what the oracle's receipts quote; a re-anchor that renumbered `OH-103`
+ * would make yesterday's refusals point at today's different rule. So a code
+ * the old rubric carries must still be there, read the same fact, fail the same
+ * way, and sit in the same order relative to the other old codes. New codes may
+ * appear anywhere.
+ */
+export declare function diffRubric(before: EngineRubric, after: EngineRubric): RubricDiff;
+/**
+ * Where two bodies of the same name differ: the top-level keys, and for a list
+ * the positions — `instructions[0]` is the guidance every judge shares,
+ * `instructions[1]` would be the poster's own sentence, and which of the two
+ * moved is the whole question a person reading the diff has.
+ */
+export declare function whereChanged(before: object, after: object): string[];
+/** True when the swap would change nothing a decision reads — the bytes may still differ (a title, key order). */
+export declare const sameRules: (diff: RubricDiff) => boolean;
+/** The diff as a person reads it in a terminal. */
+export declare function describeDiff(diff: RubricDiff): string[];
+//# sourceMappingURL=reanchor.d.ts.map

package/dist/cjs/rubric/reanchor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reanchor.d.ts","sourceRoot":"","sources":["../../../src/rubric/reanchor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD;;;;;;;;;GASG;AAEH,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,SAAS,cAAc,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,GAAG,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI,CAMtJ;AAED,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,yGAAyG;IACzG,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,QAAS,SAAQ,SAAS;IACzC,qFAAqF;IACrF,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,mIAAmI;IACnI,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,SAAS,CAAC;IACnB,QAAQ,EAAE,SAAS,CAAC;IACpB,KAAK,EAAE,QAAQ,CAAC;IAChB,mFAAmF;IACnF,eAAe,EAAE,OAAO,CAAC;IACzB,UAAU,EAAE,OAAO,CAAC;IACpB,4DAA4D;IAC5D,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAuBD;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,UAAU,CAqChF;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAapE;AAED,kHAAkH;AAClH,eAAO,MAAM,SAAS,GAAI,MAAM,UAAU,KAAG,OAGX,CAAC;AAInC,mDAAmD;AACnD,wBAAgB,YAAY,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,EAAE,CAkBvD"}

package/dist/cjs/rubric/reanchor.js

@@ -0,0 +1,154 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sameRules = void 0;
+exports.resourceByFragment = resourceByFragment;
+exports.diffRubric = diffRubric;
+exports.whereChanged = whereChanged;
+exports.describeDiff = describeDiff;
+/**
+ * The one resource on an entity that answers to a fragment, with its id AS
+ * STORED.
+ *
+ * The chain keeps whatever id the entity was minted with: the literal
+ * `{id}#rub` on every ask this estate posted, the expanded `did:…#rub` on an
+ * entity somebody else's tooling made. `MsgDeleteLinkedResource` matches the
+ * stored string exactly, so the id is read and carried, never rebuilt. Two
+ * resources answering to one fragment is an entity nobody should guess about.
+ */
+function resourceByFragment(resources, entityDid, fragment) {
+    const hash = fragment.startsWith("#") ? fragment : `#${fragment}`;
+    const accepted = new Set([`{id}${hash}`, `${entityDid}${hash}`, hash]);
+    const found = (resources ?? []).filter((resource) => typeof resource?.id === "string" && accepted.has(resource.id));
+    if (found.length > 1)
+        throw new Error(`${found.length} linked resources answer to ${hash}: ${found.map((one) => one.id).join(", ")}`);
+    return found[0] ?? null;
+}
+/** Key order is not meaning; two bodies that differ only in it are the same rule. */
+const canonical = (value) => JSON.stringify(value, (_key, inner) => inner && typeof inner === "object" && !Array.isArray(inner)
+    ? Object.fromEntries(Object.entries(inner).sort(([left], [right]) => (left < right ? -1 : left > right ? 1 : 0)))
+    : inner);
+function diffNamed(before, after, nameOf) {
+    const old = new Map(before.map((one) => [nameOf(one), one]));
+    const next = new Map(after.map((one) => [nameOf(one), one]));
+    const diff = { added: [], removed: [], changed: [], unchanged: [] };
+    for (const [name, one] of next) {
+        if (!old.has(name))
+            diff.added.push(name);
+        else if (canonical(old.get(name)) === canonical(one))
+            diff.unchanged.push(name);
+        else
+            diff.changed.push(name);
+    }
+    for (const name of old.keys())
+        if (!next.has(name))
+            diff.removed.push(name);
+    return diff;
+}
+/**
+ * What swapping `before` for `after` changes.
+ *
+ * **Existing gate codes must not move.** A code is what a decision already on
+ * the ledger names as its reason, what the app's refusal screens are keyed by,
+ * and what the oracle's receipts quote; a re-anchor that renumbered `OH-103`
+ * would make yesterday's refusals point at today's different rule. So a code
+ * the old rubric carries must still be there, read the same fact, fail the same
+ * way, and sit in the same order relative to the other old codes. New codes may
+ * appear anywhere.
+ */
+function diffRubric(before, after) {
+    const old = before.rubric;
+    const next = after.rubric;
+    const sources = diffNamed(old.sources ?? [], next.sources ?? [], (one) => one.name);
+    const aiChecks = diffNamed(old.aiChecks ?? [], next.aiChecks ?? [], (one) => one.name);
+    const withoutReason = (gate) => canonical({ ...gate, reason: undefined });
+    const oldGates = new Map(old.gates.map((gate) => [gate.code, gate]));
+    const gates = { added: [], removed: [], changed: [], unchanged: [], reworded: [], reordered: [] };
+    for (const gate of next.gates) {
+        const was = oldGates.get(gate.code);
+        if (!was)
+            gates.added.push(gate.code);
+        else if (canonical(was) === canonical(gate))
+            gates.unchanged.push(gate.code);
+        else if (withoutReason(was) === withoutReason(gate))
+            gates.reworded.push(gate.code);
+        else
+            gates.changed.push(gate.code);
+    }
+    const nextCodes = new Set(next.gates.map((gate) => gate.code));
+    for (const code of oldGates.keys())
+        if (!nextCodes.has(code))
+            gates.removed.push(code);
+    const kept = old.gates.map((gate) => gate.code).filter((code) => nextCodes.has(code));
+    const keptNow = next.gates.map((gate) => gate.code).filter((code) => oldGates.has(code));
+    gates.reordered = kept.filter((code, index) => keptNow[index] !== code);
+    const claimSchemaSame = canonical(old.claimSchema) === canonical(next.claimSchema);
+    const uniqueSame = canonical(old.unique ?? null) === canonical(next.unique ?? null);
+    const refusals = [];
+    if (gates.removed.length > 0)
+        refusals.push(`gate codes would disappear: ${gates.removed.join(", ")}`);
+    if (gates.changed.length > 0)
+        refusals.push(`gate codes would keep their number and change their rule: ${gates.changed.join(", ")}`);
+    if (gates.reordered.length > 0)
+        refusals.push(`gate codes would change order: ${gates.reordered.join(", ")}`);
+    if (sources.removed.length > 0)
+        refusals.push(`sources would disappear: ${sources.removed.join(", ")}`);
+    if (aiChecks.removed.length > 0)
+        refusals.push(`judges would disappear: ${aiChecks.removed.join(", ")}`);
+    if (!claimSchemaSame)
+        refusals.push("the claim-form binding would change");
+    if (!uniqueSame)
+        refusals.push("the duplicate rule would change");
+    return { sources, aiChecks, gates, claimSchemaSame, uniqueSame, refusals };
+}
+/**
+ * Where two bodies of the same name differ: the top-level keys, and for a list
+ * the positions — `instructions[0]` is the guidance every judge shares,
+ * `instructions[1]` would be the poster's own sentence, and which of the two
+ * moved is the whole question a person reading the diff has.
+ */
+function whereChanged(before, after) {
+    const old = before;
+    const next = after;
+    const places = [];
+    for (const key of [...new Set([...Object.keys(old), ...Object.keys(next)])]) {
+        const was = old[key];
+        const now = next[key];
+        if (canonical(was) === canonical(now))
+            continue;
+        if (Array.isArray(was) && Array.isArray(now)) {
+            for (let index = 0; index < Math.max(was.length, now.length); index += 1)
+                if (canonical(was[index]) !== canonical(now[index]))
+                    places.push(`${key}[${index}]`);
+        }
+        else
+            places.push(key);
+    }
+    return places;
+}
+/** True when the swap would change nothing a decision reads — the bytes may still differ (a title, key order). */
+const sameRules = (diff) => diff.refusals.length === 0 &&
+    [diff.sources, diff.aiChecks, diff.gates].every((one) => one.added.length === 0 && one.removed.length === 0 && one.changed.length === 0) &&
+    diff.gates.reworded.length === 0;
+exports.sameRules = sameRules;
+const line = (label, names) => `${label.padEnd(10)} ${names.length > 0 ? names.join(", ") : "—"}`;
+/** The diff as a person reads it in a terminal. */
+function describeDiff(diff) {
+    const block = (title, one, extra = []) => [
+        `${title}:`,
+        `  ${line("added", one.added)}`,
+        `  ${line("removed", one.removed)}`,
+        `  ${line("changed", one.changed)}`,
+        ...extra.map(([label, names]) => `  ${line(label, names)}`),
+        `  ${line("unchanged", one.unchanged)}`
+    ];
+    return [
+        ...block("sources", diff.sources),
+        ...block("aiChecks", diff.aiChecks),
+        ...block("gate codes", diff.gates, [
+            ["reworded", diff.gates.reworded],
+            ["reordered", diff.gates.reordered]
+        ]),
+        `claim-form binding: ${diff.claimSchemaSame ? "unchanged" : "CHANGED"} · duplicate rule: ${diff.uniqueSame ? "unchanged" : "CHANGED"}`
+    ];
+}
+//# sourceMappingURL=reanchor.js.map

package/dist/cjs/rubric/reanchor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reanchor.js","sourceRoot":"","sources":["../../../src/rubric/reanchor.ts"],"names":[],"mappings":";;;AAkCA,gDAMC;AA4DD,gCAqCC;AAQD,oCAaC;AAWD,oCAkBC;AAnKD;;;;;;;;;GASG;AACH,SAAgB,kBAAkB,CAA2B,SAA0C,EAAE,SAAiB,EAAE,QAAgB;IAC1I,MAAM,IAAI,GAAG,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE,CAAC;IAClE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,IAAI,EAAE,EAAE,GAAG,SAAS,GAAG,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,OAAO,QAAQ,EAAE,EAAE,KAAK,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IACpH,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,MAAM,+BAA+B,IAAI,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtI,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAC1B,CAAC;AA4BD,qFAAqF;AACrF,MAAM,SAAS,GAAG,CAAC,KAAc,EAAU,EAAE,CAC3C,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,KAAc,EAAE,EAAE,CAC7C,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;IACzD,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,KAAgC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5I,CAAC,CAAC,KAAK,CACV,CAAC;AAEJ,SAAS,SAAS,CAAI,MAAoB,EAAE,KAAmB,EAAE,MAA0B;IACzF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,IAAI,GAAc,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAC/E,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACrC,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAC3E,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,UAAU,CAAC,MAAoB,EAAE,KAAmB;IAClE,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;IAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;IAE1B,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpF,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAEvF,MAAM,aAAa,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,SAAS,CAAC,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAC1F,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,KAAK,GAAa,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAC5G,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG;YAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACjC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACxE,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,aAAa,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAC/E,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/D,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEvF,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACtF,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACzF,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAExE,MAAM,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,KAAK,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACnF,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC;IAEpF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,+BAA+B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvG,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,6DAA6D,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrI,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,kCAAkC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9G,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,4BAA4B,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxG,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,2BAA2B,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzG,IAAI,CAAC,eAAe;QAAE,QAAQ,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IAC3E,IAAI,CAAC,UAAU;QAAE,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;IAElE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,eAAe,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AAC7E,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,MAAc,EAAE,KAAa;IACxD,MAAM,GAAG,GAAG,MAAiC,CAAC;IAC9C,MAAM,IAAI,GAAG,KAAgC,CAAC;IAC9C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5E,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,GAAG,CAAC;YAAE,SAAS;QAChD,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;gBAAE,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,KAAK,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC;QACjK,CAAC;;YAAM,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,kHAAkH;AAC3G,MAAM,SAAS,GAAG,CAAC,IAAgB,EAAW,EAAE,CACrD,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;IAC1B,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;IACxI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;AAHtB,QAAA,SAAS,aAGa;AAEnC,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,KAAe,EAAU,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;AAE5H,mDAAmD;AACnD,SAAgB,YAAY,CAAC,IAAgB;IAC3C,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,GAAc,EAAE,QAA8B,EAAE,EAAY,EAAE,CAAC;QAC3F,GAAG,KAAK,GAAG;QACX,KAAK,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE;QAC/B,KAAK,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE;QACnC,KAAK,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE;QACnC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;QAC3D,KAAK,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,SAAS,CAAC,EAAE;KACxC,CAAC;IACF,OAAO;QACL,GAAG,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC;QACjC,GAAG,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC;QACnC,GAAG,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,EAAE;YACjC,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;YACjC,CAAC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;SACpC,CAAC;QACF,uBAAuB,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,sBAAsB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,EAAE;KACvI,CAAC;AACJ,CAAC"}

package/dist/cjs/rubric/receipt.d.ts

@@ -0,0 +1,96 @@
+import type { CriterionKind } from "./terms.ts";
+/**
+ * The shape of a check receipt — the document a verdict's `verificationProof`
+ * pointed at while this repo's own checker judged (2026-08 → 2026-09).
+ *
+ * The checker is retired: the Openhands oracle and the decision engine judge
+ * now, and their receipts are engine receipts (`packages/openhands-data`
+ * `proof.ts`, `kind: "engine"`). What is left here is the **reader's** half.
+ * Thousands of legacy verdicts still point at receipts of this shape, the
+ * thread and receipt pages render them, the MCP quotes their notes, and the
+ * hiring agent (`services/worker-agent/src/poster.ts`) still writes one for
+ * the sub-asks it judges itself. The decider that used to fill it in —
+ * `decide`, `decideTerms`, the gates — is gone with the checker; see
+ * docs/verified-work-oracle-migration-plan.md §4.1 T-A8.
+ */
+export type GateOutcome = "pass" | "fail" | "unverifiable";
+/** The chain's words for a verdict. `flagged` is legacy: nothing writes it since the migration (D6). */
+export type Verdict = "approved" | "rejected" | "flagged";
+/** What a checker measured, however it measured it. */
+export interface Measurement {
+    status: number | null;
+    ms: number;
+}
+/** One photograph of a pair, as the checker read it: when, where relative to the target, and on whose word. */
+export interface PairReading {
+    at: string | null;
+    inRadius: boolean | null;
+    metres: number | null;
+    source: "photo" | "reported" | null;
+}
+export interface TermsCheckReceipt {
+    v: 2;
+    rubric: string;
+    claim: string;
+    evidence?: string;
+    /** `note` is why — the sentence a reader needs to audit the outcome. */
+    criteria: {
+        id: string;
+        kind: CriterionKind;
+        outcome: GateOutcome;
+        note?: string;
+        confidence?: number;
+    }[];
+    verdict: Verdict;
+    reason: number;
+    measured?: Measurement;
+    /** What the map said, when the terms asked about one. */
+    osm?: {
+        username: string | null;
+        changesets: number;
+        edits: number;
+        featureDelta: number | null;
+    };
+    /** The two photographs of a cleanup as the checker read them, provenance included. */
+    pair?: {
+        before: PairReading;
+        after: PairReading;
+        unplaced?: true;
+    };
+    model?: string;
+    promptSha256?: string;
+    checker: string;
+    ts: string;
+}
+/**
+ * The note a receipt recorded for one gate — read back, later, by somebody
+ * who was not there.
+ *
+ * Two ids meet here and they are not the same id. The receipt files each line
+ * under the **criterion's** id (`c2`), because that is what the checker
+ * returned; the thing a reader wants is named by the **gate's** id
+ * (`before-after`), because that is what the check actually was. Only the
+ * terms hold the mapping, which is why all three are arguments.
+ *
+ * Matching on words in the note instead — `note.includes("apart")` — reads as
+ * simpler and is a trap: it silently starts finding nothing the first time a
+ * sentence is reworded, and the caller cannot tell that from "no such gate".
+ *
+ * Returns `null` unless the gate passed, so a failed or unsettled check never
+ * lends its sentence to something being presented as evidence.
+ */
+export declare function noteFor(gateId: string, terms: {
+    criteria?: {
+        id?: string;
+        gate?: {
+            id?: string;
+        };
+    }[];
+} | null | undefined, receipt: {
+    criteria?: {
+        id: string;
+        outcome?: string;
+        note?: string;
+    }[];
+} | null | undefined): string | null;
+//# sourceMappingURL=receipt.d.ts.map

package/dist/cjs/rubric/receipt.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"receipt.d.ts","sourceRoot":"","sources":["../../../src/rubric/receipt.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD;;;;;;;;;;;;;GAaG;AAEH,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,MAAM,GAAG,cAAc,CAAC;AAE3D,wGAAwG;AACxG,MAAM,MAAM,OAAO,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,CAAC;AAE1D,uDAAuD;AACvD,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,+GAA+G;AAC/G,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;IAClB,QAAQ,EAAE,OAAO,GAAG,IAAI,CAAC;IACzB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,MAAM,EAAE,OAAO,GAAG,UAAU,GAAG,IAAI,CAAC;CACrC;AAED,MAAM,WAAW,iBAAiB;IAChC,CAAC,EAAE,CAAC,CAAC;IACL,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,wEAAwE;IACxE,QAAQ,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,aAAa,CAAC;QAAC,OAAO,EAAE,WAAW,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC1G,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,yDAAyD;IACzD,GAAG,CAAC,EAAE;QAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;IAClG,sFAAsF;IACtF,IAAI,CAAC,EAAE;QAAE,MAAM,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,WAAW,CAAC;QAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;KAAE,CAAC;IACpE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,OAAO,CACrB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE;IAAE,QAAQ,CAAC,EAAE;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE;YAAE,EAAE,CAAC,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,EAAE,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,EAClF,OAAO,EAAE;IAAE,QAAQ,CAAC,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,GAC3F,MAAM,GAAG,IAAI,CAKf"}

package/dist/cjs/rubric/receipt.js

@@ -0,0 +1,28 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.noteFor = noteFor;
+/**
+ * The note a receipt recorded for one gate — read back, later, by somebody
+ * who was not there.
+ *
+ * Two ids meet here and they are not the same id. The receipt files each line
+ * under the **criterion's** id (`c2`), because that is what the checker
+ * returned; the thing a reader wants is named by the **gate's** id
+ * (`before-after`), because that is what the check actually was. Only the
+ * terms hold the mapping, which is why all three are arguments.
+ *
+ * Matching on words in the note instead — `note.includes("apart")` — reads as
+ * simpler and is a trap: it silently starts finding nothing the first time a
+ * sentence is reworded, and the caller cannot tell that from "no such gate".
+ *
+ * Returns `null` unless the gate passed, so a failed or unsettled check never
+ * lends its sentence to something being presented as evidence.
+ */
+function noteFor(gateId, terms, receipt) {
+    const criterionId = (terms?.criteria ?? []).find((one) => one.gate?.id === gateId)?.id;
+    if (!criterionId)
+        return null;
+    const line = (receipt?.criteria ?? []).find((one) => one.id === criterionId);
+    return line?.outcome === "pass" ? (line.note ?? null) : null;
+}
+//# sourceMappingURL=receipt.js.map

package/dist/cjs/rubric/receipt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"receipt.js","sourceRoot":"","sources":["../../../src/rubric/receipt.ts"],"names":[],"mappings":";;AAyEA,0BASC;AA1BD;;;;;;;;;;;;;;;;GAgBG;AACH,SAAgB,OAAO,CACrB,MAAc,EACd,KAAkF,EAClF,OAA4F;IAE5F,MAAM,WAAW,GAAG,CAAC,KAAK,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IACvF,IAAI,CAAC,WAAW;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC;IAC7E,OAAO,IAAI,EAAE,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/D,CAAC"}

package/dist/cjs/rubric/roundTrips.d.ts

@@ -0,0 +1,17 @@
+import { type AskTerms } from "./terms.ts";
+/**
+ * The round-trip guard the tests lean on: published terms must survive
+ * parsing, byte for byte, or a reader sees different terms than the poster
+ * signed. It is the drift trap's alarm — the one this estate has paid for
+ * twice, when `campaign` and then `followUp` joined the type and not the
+ * parser.
+ *
+ * **Its own module because `parseTerms` is expensive to carry.** This lived
+ * in `compose.ts`, which the composer imports for `formTerms` — so every
+ * phone that opened /ask downloaded the whole validation apparatus (every
+ * gate check, every trim, every field the parser rebuilds) to run a guard
+ * that only ever runs in tests. Measured: moving it here paid for the
+ * `+ Then` chip's kilobyte on three pages that had none to spare.
+ */
+export declare const roundTrips: (terms: AskTerms) => boolean;
+//# sourceMappingURL=roundTrips.d.ts.map