@godspeedai/cognate-capabilities 0.0.0-stage → 0.1.0

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,12 @@
-# Temporary Holding Version
+# @godspeedai/cognate-capabilities
 
-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.
+Two-phase capability selection (spec §3.6, §8.2, §17, §30): every `EligibilityRule` filters
+every candidate first, and every (provider, rule) result is recorded. Only the eligible set is
+exposed to an adaptive `Ranker`, which can narrow but never widen it — an unknown, ineligible,
+duplicated, or non-finite ranker entry is dropped, and a missing or throwing ranker falls back to
+deterministic `providerId` order.
+
+`recordSelection` / `recordOutcome` make selections and their outcomes durable facts on stream
+`selection-<id>`. `outcomeProjection()` derives a Laplace-smoothed success rate per
+`(capability, provider)`, and `createOutcomeRanker(store)` turns that into a `Ranker` so feedback
+only changes ranking after it is committed and projected (spec §15).

package/package.json

@@ -1,6 +1,33 @@
 {
   "name": "@godspeedai/cognate-capabilities",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
-}
+  "version": "0.1.0",
+  "description": "Two-phase capability selection: deterministic eligibility, then contained adaptive ranking with durable explanations (spec §8.2, §17, §30).",
+  "type": "module",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/GodSpeedAI/Cognate.git",
+    "directory": "packages/capabilities"
+  },
+  "engines": {
+    "bun": ">=1.4.0"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "files": [
+    "src"
+  ],
+  "exports": {
+    ".": "./src/index.ts"
+  },
+  "dependencies": {
+    "@godspeedai/cognate-events": "^0.1.0",
+    "@godspeedai/cognate-kernel-api": "^0.1.0",
+    "@godspeedai/cognate-projections": "^0.1.0"
+  },
+  "devDependencies": {
+    "@godspeedai/cognate-store-memory": "workspace:*",
+    "@godspeedai/cognate-store-sqlite": "workspace:*"
+  }
+}

package/src/index.ts

@@ -0,0 +1,3 @@
+export type * from "./types.ts";
+export { createSelector, compatibilityRule, recordSelection, recordOutcome, outcomeProjection, createOutcomeRanker, type SelectorOptions, type RecordContext } from "./selector.ts";
+export * from "./model.ts";

package/src/model.ts

@@ -0,0 +1,90 @@
+// Model provider contract (spec §26). Plain types: no LLM SDK is required by the kernel or this package.
+import type { Json } from "@godspeedai/cognate-events";
+import type { CapabilityContract } from "@godspeedai/cognate-kernel-api";
+
+export type ModelRole = "system" | "user" | "assistant" | "tool";
+
+export interface ModelMessage {
+  readonly role: ModelRole;
+  readonly content: string;
+  /** For role `tool`: the call this message answers. */
+  readonly toolCallId?: string;
+  /** For role `assistant`: tool calls it made. */
+  readonly toolCalls?: readonly ToolCall[];
+}
+
+export interface ToolDefinition {
+  readonly name: string;
+  readonly description: string;
+  /** JSON Schema of the tool input. */
+  readonly inputSchema: { readonly [key: string]: Json };
+}
+
+export interface ToolCall {
+  readonly id: string;
+  readonly name: string;
+  readonly arguments: Json;
+}
+
+export interface ModelRequest {
+  readonly messages: readonly ModelMessage[];
+  readonly tools?: readonly ToolDefinition[];
+  /** Stream ordered progress through the invoking capability context when supported. */
+  readonly stream?: boolean;
+  /** Request structured JSON output, optionally constrained by a JSON Schema. */
+  readonly responseFormat?: { readonly type: "json"; readonly schema?: { readonly [key: string]: Json } };
+  readonly maxTokens?: number;
+  readonly temperature?: number;
+}
+
+export interface ModelResponse {
+  readonly message: { readonly role: "assistant"; readonly content: string };
+  readonly toolCalls: readonly ToolCall[];
+  readonly finishReason: "stop" | "length" | "tool_calls" | "content_filter" | "error";
+  readonly usage?: { readonly inputTokens: number; readonly outputTokens: number };
+  readonly model: string;
+}
+
+export type ModelDelta =
+  | { readonly type: "text"; readonly text: string }
+  | { readonly type: "tool_call_start"; readonly callId: string; readonly name: string }
+  | { readonly type: "tool_call_args"; readonly callId: string; readonly delta: string }
+  | { readonly type: "tool_call_end"; readonly callId: string }
+  | { readonly type: "tool_call"; readonly call: ToolCall }
+  | { readonly type: "done"; readonly response: ModelResponse };
+
+/** Capability flags a provider declares; eligibility filters on them (spec §26, §8.2). */
+export interface ModelFeatures {
+  readonly generate: true;
+  readonly stream: boolean;
+  readonly tool_use: boolean;
+  readonly structured_output: boolean;
+  readonly multimodal_input: boolean;
+  readonly context_limit: number;
+}
+
+export class ModelProviderError extends Error {
+  override readonly name = "ModelProviderError";
+  constructor(
+    readonly kind: "unauthorized" | "rate_limited" | "invalid_request" | "unavailable" | "cancelled" | "malformed_response",
+    message: string,
+    readonly status?: number,
+  ) {
+    super(message);
+  }
+}
+
+export interface ModelProvider {
+  /** Provider instance id, e.g. `local` or `openai-compatible:gpt-4o-mini`. */
+  readonly id: string;
+  readonly model: string;
+  readonly features: ModelFeatures;
+  generate(request: ModelRequest, signal?: AbortSignal): Promise<ModelResponse>;
+  stream(request: ModelRequest, signal?: AbortSignal): AsyncIterable<ModelDelta>;
+}
+
+/** The capability contract a provider publishes: id `model.generate`, features as attributes. Never includes credentials. */
+export function modelContract(provider: ModelProvider): CapabilityContract {
+  const { generate: _generate, ...features } = provider.features;
+  return { id: "model.generate", version: "1.0.0", attributes: { ...features, provider: provider.id, model: provider.model } };
+}

package/src/selector.ts

@@ -0,0 +1,235 @@
+import { randomUUID } from "node:crypto";
+import { isCompatible } from "@godspeedai/cognate-kernel-api";
+import type { DurableStore, Json } from "@godspeedai/cognate-events";
+import type { Projection, ProjectionState } from "@godspeedai/cognate-projections";
+import type { Candidate, EligibilityRule, Outcome, Ranker, SelectionDecision, SelectionRequest } from "./types.ts";
+
+export interface SelectorOptions {
+  readonly rules: readonly EligibilityRule[];
+  readonly ranker?: Ranker;
+  readonly ids?: () => string;
+}
+
+function byProviderIdAsc(a: string, b: string): number {
+  return a < b ? -1 : a > b ? 1 : 0;
+}
+
+/**
+ * Two-phase selection (spec §3.6, §8.2): every rule filters first; the ranker orders only the eligible set.
+ * Unknown, duplicate, or non-finite ranker output is ignored; ranker failure falls back to deterministic order
+ * (lexicographic providerId). The selected provider is always eligible.
+ */
+export function createSelector(options: SelectorOptions): { select(request: SelectionRequest): Promise<SelectionDecision> } {
+  return {
+    async select(request: SelectionRequest): Promise<SelectionDecision> {
+      const candidates = request.candidates;
+      const filters: { providerId: string; ruleId: string; eligible: boolean; reason: string }[] = [];
+      const eligibleFlags = new Map<string, boolean>();
+      for (const candidate of candidates) eligibleFlags.set(candidate.providerId, true);
+
+      for (const rule of options.rules) {
+        for (const candidate of candidates) {
+          const result = rule.evaluate(candidate, request);
+          filters.push({ providerId: candidate.providerId, ruleId: rule.id, eligible: result.eligible, reason: result.reason });
+          if (!result.eligible) eligibleFlags.set(candidate.providerId, false);
+        }
+      }
+
+      const eligibleCandidates = candidates.filter((c) => eligibleFlags.get(c.providerId) === true);
+      const eligible = eligibleCandidates.map((c) => c.providerId);
+
+      let scores: readonly { readonly providerId: string; readonly score: number }[] = [];
+      let selected: string | null = null;
+      let rankerId: string | null = options.ranker?.id ?? null;
+      let fallback: string | null = null;
+
+      if (eligible.length === 0) {
+        // no eligible candidate: selected stays null, ranker is never called.
+      } else if (!options.ranker) {
+        fallback = "no ranker";
+        selected = [...eligible].sort(byProviderIdAsc)[0]!;
+      } else {
+        try {
+          const raw = await options.ranker.rank(eligibleCandidates, request);
+          const seen = new Set<string>();
+          const validated: { providerId: string; score: number }[] = [];
+          for (const entry of raw) {
+            if (!eligibleFlags.get(entry.providerId)) continue; // unknown or not eligible
+            if (seen.has(entry.providerId)) continue; // duplicate
+            if (!Number.isFinite(entry.score)) continue; // non-finite
+            seen.add(entry.providerId);
+            validated.push({ providerId: entry.providerId, score: entry.score });
+          }
+          scores = validated;
+
+          const ranked = [...validated].sort((a, b) => b.score - a.score || byProviderIdAsc(a.providerId, b.providerId));
+          const omitted = eligible.filter((id) => !seen.has(id)).sort(byProviderIdAsc);
+          const order = [...ranked.map((s) => s.providerId), ...omitted];
+          selected = order[0] ?? null;
+        } catch (error) {
+          fallback = `ranker failed: ${error instanceof Error ? error.message : String(error)}`;
+          scores = [];
+          selected = [...eligible].sort(byProviderIdAsc)[0]!;
+        }
+      }
+
+      return {
+        selectionId: options.ids ? options.ids() : randomUUID(),
+        requirement: request.requirement,
+        candidates: candidates.map((c) => c.providerId),
+        filters,
+        eligible,
+        scores,
+        selected,
+        ranker: rankerId,
+        fallback,
+      };
+    },
+  };
+}
+
+/** Built-in rule: contract compatibility with the requirement (identity, major version, attributes). */
+export const compatibilityRule: EligibilityRule = {
+  id: "compatibility",
+  evaluate(candidate, request) {
+    const ok = isCompatible(request.requirement, candidate.contract);
+    return { eligible: ok, reason: ok ? "compatible with requirement" : "incompatible with requirement" };
+  },
+};
+
+export interface RecordContext {
+  readonly tenant: string;
+  readonly scopeId: string;
+  readonly correlationId: string;
+  readonly runId: string | null;
+  readonly causationId?: string;
+}
+
+/** Append `capability.selected` with the full explanation (stream `selection-<selectionId>`). */
+export async function recordSelection(store: DurableStore, decision: SelectionDecision, context: RecordContext): Promise<void> {
+  const streamId = `selection-${decision.selectionId}`;
+  const expectedVersion = await store.streamVersion(streamId);
+  await store.commit({
+    appends: [
+      {
+        streamId,
+        expectedVersion,
+        events: [
+          {
+            eventType: "capability.selected",
+            schemaVersion: 1,
+            occurredAt: new Date().toISOString(),
+            tenant: context.tenant,
+            correlationId: context.correlationId,
+            causationId: context.causationId ?? null,
+            runId: context.runId,
+            scopeId: context.scopeId,
+            payload: decision as unknown as Json,
+          },
+        ],
+      },
+    ],
+  });
+}
+
+/** Append `capability.outcome` for a recorded selection. Must be durable before it can influence ranking (spec §15). */
+export async function recordOutcome(store: DurableStore, selectionId: string, outcome: Outcome, context: RecordContext): Promise<void> {
+  const streamId = `selection-${selectionId}`;
+  const expectedVersion = await store.streamVersion(streamId);
+  const payload: Json = {
+    selectionId,
+    success: outcome.success,
+    ...(outcome.latencyMs !== undefined ? { latencyMs: outcome.latencyMs } : {}),
+    ...(outcome.cost !== undefined ? { cost: outcome.cost } : {}),
+  };
+  await store.commit({
+    appends: [
+      {
+        streamId,
+        expectedVersion,
+        events: [
+          {
+            eventType: "capability.outcome",
+            schemaVersion: 1,
+            occurredAt: new Date().toISOString(),
+            tenant: context.tenant,
+            correlationId: context.correlationId,
+            causationId: context.causationId ?? null,
+            runId: context.runId,
+            scopeId: context.scopeId,
+            payload,
+          },
+        ],
+      },
+    ],
+  });
+}
+
+const OUTCOME_PROJECTION_NAME = "capability-outcomes";
+const OUTCOME_PROJECTION_VERSION = "1";
+
+interface SelectionStats {
+  readonly providerId: string;
+  readonly capability: string;
+}
+
+interface OutcomeStats {
+  readonly successes: number;
+  readonly total: number;
+}
+
+/**
+ * Cognate-owned outcome ranker (SONA was rejected, ADR-0005): a rebuildable projection over `capability.outcome`
+ * events counting each provider's successes and outcomes for a capability id.
+ */
+export function outcomeProjection(): Projection {
+  return {
+    name: OUTCOME_PROJECTION_NAME,
+    version: OUTCOME_PROJECTION_VERSION,
+    apply(event, state: ProjectionState) {
+      if (event.eventType === "capability.selected") {
+        const payload = event.payload as { selectionId: string; selected: string | null; requirement: { capability: string } } | null;
+        if (!payload || payload.selected === null) return [];
+        const value: SelectionStats = { providerId: payload.selected, capability: payload.requirement.capability };
+        return [{ key: `selection:${payload.selectionId}`, value: value as unknown as Json }];
+      }
+      if (event.eventType === "capability.outcome") {
+        const payload = event.payload as { selectionId: string; success: boolean } | null;
+        if (!payload) return [];
+        const selection = state.get(`selection:${payload.selectionId}`) as unknown as SelectionStats | undefined;
+        if (!selection) return [];
+        const statsKey = `stats:${selection.capability}:${selection.providerId}`;
+        const existing = (state.get(statsKey) as unknown as OutcomeStats | undefined) ?? { successes: 0, total: 0 };
+        const updated: OutcomeStats = { successes: existing.successes + (payload.success ? 1 : 0), total: existing.total + 1 };
+        return [{ key: statsKey, value: updated as unknown as Json }];
+      }
+      return [];
+    },
+  };
+}
+
+/**
+ * UCB1 over the eligible set (Auer et al., 2002): `successRate + sqrt(2 ln N / n)`, where `n` is a provider's recorded
+ * outcomes and `N` the total across the eligible providers. Untried providers score `Number.MAX_VALUE` (finite, so the
+ * selector accepts it) and are tried first; ties fall to provider-id order. Deterministic: a pure function of the
+ * projection, so replaying the same outcomes yields the same ranking.
+ */
+export function createOutcomeRanker(store: DurableStore): Ranker {
+  return {
+    id: "outcome-ranker",
+    async rank(eligible: readonly Candidate[], request: SelectionRequest) {
+      const capability = request.requirement.capability;
+      const stats = await Promise.all(
+        eligible.map(async (candidate) => {
+          const read = (await store.readProjection(OUTCOME_PROJECTION_NAME, `stats:${capability}:${candidate.providerId}`)) as unknown as OutcomeStats | undefined;
+          return { providerId: candidate.providerId, successes: read?.successes ?? 0, total: read?.total ?? 0 };
+        }),
+      );
+      const plays = stats.reduce((sum, s) => sum + s.total, 0);
+      return stats.map(({ providerId, successes, total }) => ({
+        providerId,
+        score: total === 0 ? Number.MAX_VALUE : successes / total + Math.sqrt((2 * Math.log(plays)) / total),
+      }));
+    },
+  };
+}

package/src/types.ts

@@ -0,0 +1,48 @@
+import type { Json } from "@godspeedai/cognate-events";
+import type { CapabilityContract, Principal, Requirement } from "@godspeedai/cognate-kernel-api";
+
+export interface Candidate {
+  readonly providerId: string;
+  readonly contract: CapabilityContract;
+}
+
+export interface SelectionRequest {
+  readonly requirement: Requirement;
+  readonly candidates: readonly Candidate[];
+  readonly principal: Principal;
+  readonly tenant: string;
+  /** Opaque task context for rankers (e.g. task kind); never used for eligibility. */
+  readonly context?: { readonly [key: string]: Json };
+}
+
+/** A deterministic eligibility rule (semantic, security, policy, compatibility). Must be pure. */
+export interface EligibilityRule {
+  readonly id: string;
+  evaluate(candidate: Candidate, request: SelectionRequest): { readonly eligible: boolean; readonly reason: string };
+}
+
+/** Adaptive ranking; sees only eligible candidates. May be unavailable or misbehave; it can never widen the set. */
+export interface Ranker {
+  readonly id: string;
+  rank(eligible: readonly Candidate[], request: SelectionRequest): Promise<readonly { readonly providerId: string; readonly score: number }[]>;
+}
+
+export interface SelectionDecision {
+  readonly selectionId: string;
+  readonly requirement: Requirement;
+  readonly candidates: readonly string[];
+  readonly filters: readonly { readonly providerId: string; readonly ruleId: string; readonly eligible: boolean; readonly reason: string }[];
+  readonly eligible: readonly string[];
+  readonly scores: readonly { readonly providerId: string; readonly score: number }[];
+  /** `null` when no candidate is eligible. */
+  readonly selected: string | null;
+  readonly ranker: string | null;
+  /** Why deterministic ordering was used instead of the ranker, if it was. */
+  readonly fallback: string | null;
+}
+
+export interface Outcome {
+  readonly success: boolean;
+  readonly latencyMs?: number;
+  readonly cost?: number;
+}