@swissspidy/belay-web 0.0.0-stage → 0.1.1

package/LICENSE

@@ -0,0 +1,201 @@
+                                 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,47 @@
-# Temporary Holding Version
+# @swissspidy/belay-web
 
-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.
+On-device runners for [Belay](https://github.com/swissspidy/belay#readme), built on the
+browser's built-in AI:
+
+- `classifierApi()`: classification with Chrome's Classifier API. The calibrated probability of
+  the returned label is the confidence.
+- `promptApi()`: structured (JSON) generation with Chrome's Prompt API.
+- `classifierJudge()`: scores a generated answer with a Classifier API question ("is this answer
+  correct?"), so generation tasks get a confidence too.
+
+They work with the native APIs and with polyfills that define the same globals, such as the
+[WebAI Studio extension](https://web-ai.studio/playgrounds/classifier).
+
+> **Status:** experimental (0.x). The built-in AI APIs are still behind flags in Chrome, and this
+> API may change between minor versions.
+
+## Install
+
+```sh
+npm install @swissspidy/belay-core @swissspidy/belay-web
+```
+
+## Usage
+
+```ts
+import { task, fetchAdapter } from '@swissspidy/belay-core';
+import { classifierApi } from '@swissspidy/belay-web';
+
+const moderate = task({
+  name: 'moderation',
+  schema: { type: 'binary', prompt: 'Is this comment abusive?' },
+  local: classifierApi(),
+  cloud: fetchAdapter({ url: '/api/belay' }),
+  threshold: 0.8,
+});
+
+// run() never downloads a model; call prepare() from a user gesture to download it.
+button.onclick = () => moderate.prepare({ onProgress: (p) => (progress.value = p) });
+```
+
+See the [project README](https://github.com/swissspidy/belay#readme) for generation tasks, model
+downloads and the full API.
+
+## License
+
+Apache-2.0

package/dist/classifier-types.d.ts

@@ -0,0 +1,63 @@
+/**
+ * Types for the proposed Classifier API (`window.Classifier`), as described in the explainer
+ * (https://github.com/michaelwasserman/classifier-api, the current revision of
+ * explainers-by-googlers/classifier-api) and implemented by Chrome behind `#classifier-api` and by
+ * the WebAI Studio extension polyfill (https://web-ai.studio/docs/classifier). The proposal is in
+ * flux: only the members Belay relies on are typed, and result fields are checked at runtime.
+ */
+import type { Availability } from '@swissspidy/belay-core';
+export type ClassifierQuestionType = 'binary' | 'categorical' | 'ordinal';
+export interface ClassifierOption {
+    label: string;
+    description?: string;
+}
+export interface ClassifierQuestion {
+    id: string;
+    type: ClassifierQuestionType;
+    prompt: string;
+    options?: ClassifierOption[];
+}
+export interface ClassifierExpectedInput {
+    type: 'text';
+    languages?: string[];
+}
+export interface ClassifierSchema {
+    context?: string;
+    questions: ClassifierQuestion[];
+    expectedInputs?: ClassifierExpectedInput[];
+}
+export interface ClassifierCreateOptions extends ClassifierSchema {
+    /** Same pattern as the other built-in AI APIs: `downloadprogress` events carry `loaded` in [0, 1]. */
+    monitor?: (monitor: EventTarget) => void;
+    signal?: AbortSignal;
+}
+export interface ClassifierClassifyOptions {
+    signal?: AbortSignal;
+    context?: string;
+}
+export interface ClassifierProbability {
+    label: string;
+    probability: number;
+}
+export interface ClassifierDecision {
+    id: string;
+    label: string;
+    /** Calibrated confidence in [0, 1]. */
+    confidence: number;
+    /** Binary questions only: calibrated P(true). */
+    probability?: number;
+    /** Ordinal questions only: E[S]. */
+    expectedScore?: number;
+    probabilities?: ClassifierProbability[];
+}
+/** Keyed by question `id`. */
+export type ClassifierResult = Record<string, ClassifierDecision>;
+export interface ClassifierInstance {
+    classify(input: string, options?: ClassifierClassifyOptions): Promise<ClassifierResult>;
+    destroy(): void;
+}
+export interface ClassifierStatic {
+    availability(options?: ClassifierSchema): Promise<Availability>;
+    create(options: ClassifierCreateOptions): Promise<ClassifierInstance>;
+}
+//# sourceMappingURL=classifier-types.d.ts.map

package/dist/classifier-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier-types.d.ts","sourceRoot":"","sources":["../src/classifier-types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAE3D,MAAM,MAAM,sBAAsB,GAAG,QAAQ,GAAG,aAAa,GAAG,SAAS,CAAC;AAE1E,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,sBAAsB,CAAC;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,gBAAgB,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,kBAAkB,EAAE,CAAC;IAChC,cAAc,CAAC,EAAE,uBAAuB,EAAE,CAAC;CAC5C;AAED,MAAM,WAAW,uBAAwB,SAAQ,gBAAgB;IAC/D,sGAAsG;IACtG,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,WAAW,KAAK,IAAI,CAAC;IACzC,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,yBAAyB;IACxC,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,qBAAqB;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,uCAAuC;IACvC,UAAU,EAAE,MAAM,CAAC;IACnB,iDAAiD;IACjD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,oCAAoC;IACpC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,aAAa,CAAC,EAAE,qBAAqB,EAAE,CAAC;CACzC;AAED,8BAA8B;AAC9B,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;AAElE,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,yBAAyB,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;IACxF,OAAO,IAAI,IAAI,CAAC;CACjB;AAED,MAAM,WAAW,gBAAgB;IAC/B,YAAY,CAAC,OAAO,CAAC,EAAE,gBAAgB,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;IAChE,MAAM,CAAC,OAAO,EAAE,uBAAuB,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAC;CACvE"}

package/dist/classifier-types.js

@@ -0,0 +1,9 @@
+/**
+ * Types for the proposed Classifier API (`window.Classifier`), as described in the explainer
+ * (https://github.com/michaelwasserman/classifier-api, the current revision of
+ * explainers-by-googlers/classifier-api) and implemented by Chrome behind `#classifier-api` and by
+ * the WebAI Studio extension polyfill (https://web-ai.studio/docs/classifier). The proposal is in
+ * flux: only the members Belay relies on are typed, and result fields are checked at runtime.
+ */
+export {};
+//# sourceMappingURL=classifier-types.js.map

package/dist/classifier-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier-types.js","sourceRoot":"","sources":["../src/classifier-types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/classifier.d.ts

@@ -0,0 +1,39 @@
+import type { BinarySchema, CategoricalSchema, LocalOutput, LocalRunner, OrdinalSchema, TaskSchema } from '@swissspidy/belay-core';
+import type { ClassifierDecision, ClassifierExpectedInput, ClassifierSchema, ClassifierStatic } from './classifier-types.js';
+export type ClassifierTaskSchema = BinarySchema | CategoricalSchema | OrdinalSchema;
+export interface ClassifierApiOptions {
+    /**
+     * Which number becomes the task confidence:
+     * - `label-probability` (default): the calibrated probability of the returned label
+     *   (the top option). For binary questions this is max(P(true), P(false)).
+     * - `model`: the decision's own `confidence` field.
+     * See ADR 0001 for why the default is the probability.
+     */
+    confidence?: 'label-probability' | 'model';
+    /** Defaults to `[{ type: 'text', languages: ['en'] }]`. */
+    expectedInputs?: ClassifierExpectedInput[];
+    /** Question id used in the Classifier schema. Defaults to "answer". */
+    questionId?: string;
+    /**
+     * The `Classifier` implementation. Defaults to `globalThis.Classifier` (Chrome's built-in API or
+     * the WebAI Studio extension polyfill). Injectable for tests and custom polyfills.
+     */
+    classifier?: ClassifierStatic;
+    /** Max number of cached sessions (one per distinct context). Defaults to 4. */
+    maxSessions?: number;
+}
+/** Maps a Belay schema to a Classifier API schema with a single question. */
+export declare function toClassifierSchema(schema: TaskSchema, options?: {
+    questionId?: string;
+    context?: string;
+    expectedInputs?: ClassifierExpectedInput[];
+}): ClassifierSchema;
+/** Extracts value, confidence and distribution from a Classifier decision. */
+export declare function readDecision(schema: ClassifierTaskSchema, decision: ClassifierDecision | undefined, mode?: 'label-probability' | 'model'): LocalOutput<string | boolean>;
+/**
+ * Local runner backed by the Classifier API. It never triggers a model download from `run()`:
+ * while the model is "downloadable" or "downloading" the task escalates with reason
+ * `local-unavailable`. Call `task.prepare()` from a user gesture to download the model.
+ */
+export declare function classifierApi(options?: ClassifierApiOptions): LocalRunner<any>;
+//# sourceMappingURL=classifier.d.ts.map

package/dist/classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier.d.ts","sourceRoot":"","sources":["../src/classifier.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAEV,YAAY,EACZ,iBAAiB,EACjB,WAAW,EACX,WAAW,EACX,aAAa,EAIb,UAAU,EACX,MAAM,wBAAwB,CAAC;AAChC,OAAO,KAAK,EACV,kBAAkB,EAClB,uBAAuB,EAEvB,gBAAgB,EAChB,gBAAgB,EACjB,MAAM,uBAAuB,CAAC;AAE/B,MAAM,MAAM,oBAAoB,GAAG,YAAY,GAAG,iBAAiB,GAAG,aAAa,CAAC;AAEpF,MAAM,WAAW,oBAAoB;IACnC;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,mBAAmB,GAAG,OAAO,CAAC;IAC3C,2DAA2D;IAC3D,cAAc,CAAC,EAAE,uBAAuB,EAAE,CAAC;IAC3C,uEAAuE;IACvE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;OAGG;IACH,UAAU,CAAC,EAAE,gBAAgB,CAAC;IAC9B,+EAA+E;IAC/E,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AASD,6EAA6E;AAC7E,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,UAAU,EAClB,OAAO,GAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,uBAAuB,EAAE,CAAA;CAAO,GAClG,gBAAgB,CA4BlB;AAED,8EAA8E;AAC9E,wBAAgB,YAAY,CAC1B,MAAM,EAAE,oBAAoB,EAC5B,QAAQ,EAAE,kBAAkB,GAAG,SAAS,EACxC,IAAI,GAAE,mBAAmB,GAAG,OAA6B,GACxD,WAAW,CAAC,MAAM,GAAG,OAAO,CAAC,CAgC/B;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,OAAO,GAAE,oBAAyB,GAAG,WAAW,CAAC,GAAG,CAAC,CA4FlF"}

package/dist/classifier.js

@@ -0,0 +1,160 @@
+import { BelayError, LocalUnavailableError, clamp01, normalizeOptions, topProbability, } from '@swissspidy/belay-core';
+const DEFAULT_PROMPTS = {
+    categorical: 'Which option best describes the input?',
+    ordinal: 'Which level best describes the input?',
+};
+/** Maps a Belay schema to a Classifier API schema with a single question. */
+export function toClassifierSchema(schema, options = {}) {
+    const id = options.questionId ?? 'answer';
+    const base = {
+        ...(options.context ? { context: options.context } : {}),
+        expectedInputs: options.expectedInputs ?? [{ type: 'text', languages: ['en'] }],
+    };
+    switch (schema.type) {
+        case 'binary':
+            return { ...base, questions: [{ id, type: 'binary', prompt: schema.prompt }] };
+        case 'categorical':
+        case 'ordinal':
+            return {
+                ...base,
+                questions: [
+                    {
+                        id,
+                        type: schema.type,
+                        prompt: schema.prompt ?? DEFAULT_PROMPTS[schema.type],
+                        options: normalizeOptions(schema.options),
+                    },
+                ],
+            };
+        default:
+            throw new BelayError('invalid-task', `the Classifier API runner supports binary, categorical and ordinal tasks, not "${schema.type}"`);
+    }
+}
+/** Extracts value, confidence and distribution from a Classifier decision. */
+export function readDecision(schema, decision, mode = 'label-probability') {
+    if (!decision || typeof decision !== 'object') {
+        throw new Error('Classifier result is missing the decision');
+    }
+    let probabilities = Array.isArray(decision.probabilities)
+        ? decision.probabilities.filter((p) => typeof p?.label === 'string' && typeof p.probability === 'number')
+        : undefined;
+    if (schema.type === 'binary' && typeof decision.probability === 'number') {
+        const pTrue = clamp01(decision.probability);
+        probabilities = [
+            { label: 'true', probability: pTrue },
+            { label: 'false', probability: 1 - pTrue },
+        ];
+    }
+    let label = typeof decision.label === 'string' ? decision.label : undefined;
+    if (label === undefined && probabilities?.length) {
+        label = probabilities.reduce((a, b) => (b.probability > a.probability ? b : a)).label;
+    }
+    if (label === undefined)
+        throw new Error('Classifier decision has no label');
+    let confidence;
+    if (mode === 'label-probability' && probabilities?.length) {
+        const own = probabilities.find((p) => p.label === label);
+        confidence = own ? clamp01(own.probability) : topProbability(probabilities);
+    }
+    if (confidence === undefined && typeof decision.confidence === 'number')
+        confidence = clamp01(decision.confidence);
+    if (confidence === undefined)
+        throw new Error('Classifier decision has neither probabilities nor confidence');
+    const value = schema.type === 'binary' ? label.trim().toLowerCase() === 'true' : label;
+    return { value, confidence, ...(probabilities ? { probabilities } : {}), raw: decision };
+}
+/**
+ * Local runner backed by the Classifier API. It never triggers a model download from `run()`:
+ * while the model is "downloadable" or "downloading" the task escalates with reason
+ * `local-unavailable`. Call `task.prepare()` from a user gesture to download the model.
+ */
+export function classifierApi(options = {}) {
+    const mode = options.confidence ?? 'label-probability';
+    const maxSessions = Math.max(1, options.maxSessions ?? 4);
+    const sessions = new Map();
+    const api = () => options.classifier ?? globalThis.Classifier;
+    const schemaFor = (ctx) => toClassifierSchema(ctx.schema, {
+        ...(options.questionId ? { questionId: options.questionId } : {}),
+        ...(ctx.context ? { context: ctx.context } : {}),
+        ...(options.expectedInputs ? { expectedInputs: options.expectedInputs } : {}),
+    });
+    const keyFor = (schema) => JSON.stringify(schema);
+    function session(ctx, prepare) {
+        const Classifier = api();
+        if (!Classifier)
+            return Promise.reject(new LocalUnavailableError('Classifier API is not available'));
+        const schema = schemaFor(ctx);
+        const key = keyFor(schema);
+        const cached = sessions.get(key);
+        if (cached) {
+            sessions.delete(key); // refresh LRU position
+            sessions.set(key, cached);
+            return cached;
+        }
+        // Only prepare()'s signal: the session is cached and shared, so a per-run abort must not destroy it.
+        const signal = prepare?.signal;
+        const created = Classifier.create({
+            ...schema,
+            ...(signal ? { signal } : {}),
+            ...(prepare?.onProgress
+                ? {
+                    monitor: (m) => m.addEventListener('downloadprogress', (e) => prepare.onProgress(e.loaded)),
+                }
+                : {}),
+        });
+        sessions.set(key, created);
+        created.catch(() => {
+            if (sessions.get(key) === created)
+                sessions.delete(key);
+        });
+        while (sessions.size > maxSessions) {
+            const [oldestKey, oldest] = sessions.entries().next().value;
+            sessions.delete(oldestKey);
+            oldest.then((s) => s.destroy(), () => { });
+        }
+        return created;
+    }
+    async function availability(ctx) {
+        const Classifier = api();
+        if (!Classifier)
+            return 'unavailable';
+        const schema = schemaFor(ctx); // throws for unsupported schemas
+        if (sessions.has(keyFor(schema)))
+            return 'available';
+        try {
+            return await Classifier.availability(schema);
+        }
+        catch {
+            return 'unavailable';
+        }
+    }
+    return {
+        id: 'classifier-api',
+        availability,
+        async run(input, ctx) {
+            const schema = schemaFor(ctx);
+            if (!sessions.has(keyFor(schema))) {
+                // Creating a session while the model is not downloaded would start a download.
+                const state = await availability(ctx);
+                if (state !== 'available')
+                    throw new LocalUnavailableError(`Classifier model is ${state}`);
+            }
+            const classifier = await session(ctx);
+            const result = await classifier.classify(input, ctx.signal ? { signal: ctx.signal } : {});
+            const questionId = schema.questions[0].id;
+            return readDecision(ctx.schema, result?.[questionId], mode);
+        },
+        async prepare(ctx, prepareOptions) {
+            const state = await availability(ctx);
+            if (state === 'unavailable')
+                throw new LocalUnavailableError('Classifier model is unavailable on this device');
+            await session(ctx, prepareOptions);
+        },
+        destroy() {
+            for (const s of sessions.values())
+                s.then((c) => c.destroy(), () => { });
+            sessions.clear();
+        },
+    };
+}
+//# sourceMappingURL=classifier.js.map

package/dist/classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier.js","sourceRoot":"","sources":["../src/classifier.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,UAAU,EACV,qBAAqB,EACrB,OAAO,EACP,gBAAgB,EAChB,cAAc,GACf,MAAM,wBAAwB,CAAC;AA+ChC,MAAM,eAAe,GAAG;IACtB,WAAW,EAAE,wCAAwC;IACrD,OAAO,EAAE,uCAAuC;CACxC,CAAC;AAEX,6EAA6E;AAC7E,MAAM,UAAU,kBAAkB,CAChC,MAAkB,EAClB,OAAO,GAA0F,EAAE;IAEnG,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,IAAI,QAAQ,CAAC;IAC1C,MAAM,IAAI,GAAG;QACX,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,cAAc,EAAE,OAAO,CAAC,cAAc,IAAI,CAAC,EAAE,IAAI,EAAE,MAAe,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;KACzF,CAAC;IACF,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ;YACX,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QACjF,KAAK,aAAa,CAAC;QACnB,KAAK,SAAS;YACZ,OAAO;gBACL,GAAG,IAAI;gBACP,SAAS,EAAE;oBACT;wBACE,EAAE;wBACF,IAAI,EAAE,MAAM,CAAC,IAAI;wBACjB,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;wBACrD,OAAO,EAAE,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC;qBAC1C;iBACF;aACF,CAAC;QACJ;YACE,MAAM,IAAI,UAAU,CAClB,cAAc,EACd,kFAAkF,MAAM,CAAC,IAAI,GAAG,CACjG,CAAC;IACN,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,YAAY,CAC1B,MAA4B,EAC5B,QAAwC,EACxC,IAAI,GAAkC,mBAAmB;IAEzD,IAAI,CAAC,QAAQ,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,aAAa,GAAmC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC;QACvF,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,CAAC;QACzG,CAAC,CAAC,SAAS,CAAC;IACd,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,QAAQ,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;QACzE,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC5C,aAAa,GAAG;YACd,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE;YACrC,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,GAAG,KAAK,EAAE;SAC3C,CAAC;IACJ,CAAC;IAED,IAAI,KAAK,GAAG,OAAO,QAAQ,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5E,IAAI,KAAK,KAAK,SAAS,IAAI,aAAa,EAAE,MAAM,EAAE,CAAC;QACjD,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACxF,CAAC;IACD,IAAI,KAAK,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IAE7E,IAAI,UAA8B,CAAC;IACnC,IAAI,IAAI,KAAK,mBAAmB,IAAI,aAAa,EAAE,MAAM,EAAE,CAAC;QAC1D,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;QACzD,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;IAC9E,CAAC;IACD,IAAI,UAAU,KAAK,SAAS,IAAI,OAAO,QAAQ,CAAC,UAAU,KAAK,QAAQ;QAAE,UAAU,GAAG,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IACnH,IAAI,UAAU,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;IAE9G,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;IACvF,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;AAC3F,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,OAAO,GAAyB,EAAE;IAC9D,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,IAAI,mBAAmB,CAAC;IACvD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuC,CAAC;IAEhE,MAAM,GAAG,GAAG,GAAiC,EAAE,CAC7C,OAAO,CAAC,UAAU,IAAK,UAAgD,CAAC,UAAU,CAAC;IAErF,MAAM,SAAS,GAAG,CAAC,GAAQ,EAAoB,EAAE,CAC/C,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE;QAC7B,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjE,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChD,GAAG,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9E,CAAC,CAAC;IAEL,MAAM,MAAM,GAAG,CAAC,MAAwB,EAAU,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAE5E,SAAS,OAAO,CAAC,GAAQ,EAAE,OAAwB;QACjD,MAAM,UAAU,GAAG,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,UAAU;YAAE,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,qBAAqB,CAAC,iCAAiC,CAAC,CAAC,CAAC;QACrG,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,MAAM,EAAE,CAAC;YACX,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,uBAAuB;YAC7C,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC1B,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,qGAAqG;QACrG,MAAM,MAAM,GAAG,OAAO,EAAE,MAAM,CAAC;QAC/B,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC;YAChC,GAAG,MAAM;YACT,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,GAAG,CAAC,OAAO,EAAE,UAAU;gBACrB,CAAC,CAAC;oBACE,OAAO,EAAE,CAAC,CAAc,EAAE,EAAE,CAC1B,CAAC,CAAC,gBAAgB,CAAC,kBAAkB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,UAAW,CAAE,CAAgC,CAAC,MAAM,CAAC,CAAC;iBAC/G;gBACH,CAAC,CAAC,EAAE,CAAC;SACR,CAAC,CAAC;QACH,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC3B,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE;YACjB,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,OAAO;gBAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QACH,OAAO,QAAQ,CAAC,IAAI,GAAG,WAAW,EAAE,CAAC;YACnC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAA8C,CAAC;YACrG,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,KAAK,UAAU,YAAY,CAAC,GAAQ;QAClC,MAAM,UAAU,GAAG,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,UAAU;YAAE,OAAO,aAAa,CAAC;QACtC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,iCAAiC;QAChE,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAAE,OAAO,WAAW,CAAC;QACrD,IAAI,CAAC;YACH,OAAO,MAAM,UAAU,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,aAAa,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO;QACL,EAAE,EAAE,gBAAgB;QACpB,YAAY;QAEZ,KAAK,CAAC,GAAG,CAAC,KAAa,EAAE,GAAQ;YAC/B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAClC,+EAA+E;gBAC/E,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,GAAG,CAAC,CAAC;gBACtC,IAAI,KAAK,KAAK,WAAW;oBAAE,MAAM,IAAI,qBAAqB,CAAC,uBAAuB,KAAK,EAAE,CAAC,CAAC;YAC7F,CAAC;YACD,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC;YACtC,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1F,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;YAC3C,OAAO,YAAY,CAAC,GAAG,CAAC,MAA8B,EAAE,MAAM,EAAE,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC;QACtF,CAAC;QAED,KAAK,CAAC,OAAO,CAAC,GAAQ,EAAE,cAA+B;YACrD,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,KAAK,KAAK,aAAa;gBAAE,MAAM,IAAI,qBAAqB,CAAC,gDAAgD,CAAC,CAAC;YAC/G,MAAM,OAAO,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;QACrC,CAAC;QAED,OAAO;YACL,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE;gBAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;YACxE,QAAQ,CAAC,KAAK,EAAE,CAAC;QACnB,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,9 @@
+export { classifierApi, readDecision, toClassifierSchema } from './classifier.js';
+export type { ClassifierApiOptions, ClassifierTaskSchema } from './classifier.js';
+export { promptApi } from './prompt.js';
+export type { PromptApiOptions } from './prompt.js';
+export { classifierJudge, DEFAULT_JUDGE_QUESTION } from './judge.js';
+export type { ClassifierJudgeOptions } from './judge.js';
+export type * from './classifier-types.js';
+export type * from './prompt-types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAClF,YAAY,EAAE,oBAAoB,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAClF,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,YAAY,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AACrE,YAAY,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AACzD,mBAAmB,uBAAuB,CAAC;AAC3C,mBAAmB,mBAAmB,CAAC"}

package/dist/index.js

@@ -0,0 +1,4 @@
+export { classifierApi, readDecision, toClassifierSchema } from './classifier.js';
+export { promptApi } from './prompt.js';
+export { classifierJudge, DEFAULT_JUDGE_QUESTION } from './judge.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAElF,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC,OAAO,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC"}

package/dist/judge.d.ts

@@ -0,0 +1,23 @@
+import type { Judge } from '@swissspidy/belay-core';
+import type { ClassifierExpectedInput, ClassifierStatic } from './classifier-types.js';
+export interface ClassifierJudgeOptions {
+    /** The yes/no question the Classifier answers about the (input, output) pair. */
+    question?: string;
+    /** Shared context for the judge, e.g. what a good answer looks like for this task. */
+    context?: string;
+    /** Serializes the pair for the Classifier. Defaults to "Input: … / Proposed answer: …". */
+    format?: (input: string, value: unknown) => string;
+    /** Truncation limits, because on-device classifiers have small windows (e.g. 256 tokens). */
+    maxInputChars?: number;
+    maxValueChars?: number;
+    classifier?: ClassifierStatic;
+    expectedInputs?: ClassifierExpectedInput[];
+}
+export declare const DEFAULT_JUDGE_QUESTION = "Is the proposed answer a correct and complete response to the input, with no invented facts?";
+/**
+ * A judge for generation tasks built on the Classifier API: one binary question over the input and
+ * the generated output. Its calibrated P(true) becomes the confidence (combined with schema
+ * validation by the task; see ADR 0001). Costs one classifier forward pass, not a second LLM call.
+ */
+export declare function classifierJudge(options?: ClassifierJudgeOptions): Judge<unknown>;
+//# sourceMappingURL=judge.d.ts.map

package/dist/judge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"judge.d.ts","sourceRoot":"","sources":["../src/judge.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAiC,MAAM,wBAAwB,CAAC;AAEnF,OAAO,KAAK,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEvF,MAAM,WAAW,sBAAsB;IACrC,iFAAiF;IACjF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,sFAAsF;IACtF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,2FAA2F;IAC3F,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,KAAK,MAAM,CAAC;IACnD,6FAA6F;IAC7F,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,UAAU,CAAC,EAAE,gBAAgB,CAAC;IAC9B,cAAc,CAAC,EAAE,uBAAuB,EAAE,CAAC;CAC5C;AAED,eAAO,MAAM,sBAAsB,iGAC6D,CAAC;AAIjG;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,GAAE,sBAA2B,GAAG,KAAK,CAAC,OAAO,CAAC,CA+BpF"}

package/dist/judge.js

@@ -0,0 +1,39 @@
+import { classifierApi } from './classifier.js';
+export const DEFAULT_JUDGE_QUESTION = 'Is the proposed answer a correct and complete response to the input, with no invented facts?';
+const truncate = (s, max) => (s.length > max ? `${s.slice(0, max - 1)}…` : s);
+/**
+ * A judge for generation tasks built on the Classifier API: one binary question over the input and
+ * the generated output. Its calibrated P(true) becomes the confidence (combined with schema
+ * validation by the task; see ADR 0001). Costs one classifier forward pass, not a second LLM call.
+ */
+export function classifierJudge(options = {}) {
+    const runner = classifierApi({
+        ...(options.classifier ? { classifier: options.classifier } : {}),
+        ...(options.expectedInputs ? { expectedInputs: options.expectedInputs } : {}),
+        questionId: 'judgement',
+    });
+    const schema = { type: 'binary', prompt: options.question ?? DEFAULT_JUDGE_QUESTION };
+    const maxInput = options.maxInputChars ?? 600;
+    const maxValue = options.maxValueChars ?? 400;
+    const format = options.format ??
+        ((input, value) => `Input:\n${truncate(input, maxInput)}\n\nProposed answer:\n${truncate(typeof value === 'string' ? value : JSON.stringify(value), maxValue)}`);
+    const ctx = (signal) => ({
+        task: 'belay-judge',
+        schema,
+        ...(options.context ? { context: options.context } : {}),
+        ...(signal ? { signal } : {}),
+    });
+    const judge = (async ({ input, value, signal }) => {
+        const out = await runner.run(format(input, value), ctx(signal));
+        const pTrue = out.probabilities?.find((p) => p.label === 'true')?.probability;
+        if (typeof pTrue === 'number')
+            return pTrue;
+        // Fall back to the returned label's probability.
+        return out.value === true ? out.confidence : 1 - out.confidence;
+    });
+    judge.availability = () => runner.availability(ctx());
+    judge.prepare = (prepareOptions) => runner.prepare(ctx(), prepareOptions);
+    judge.destroy = () => runner.destroy?.();
+    return judge;
+}
+//# sourceMappingURL=judge.js.map