dialai 0.1.0 → 1.0.0

package/LICENSE

@@ -1,55 +1,21 @@
-Business Source License 1.1
+MIT License
 
 Copyright (c) 2025 DialAI Contributors
 
-Licensor: DialAI Contributors
-
-Licensed Work: DialAI
-The Licensed Work is (c) 2025 DialAI Contributors
-
-Additional Use Grant: You may not use the Licensed Work to provide a service to third parties, including but not limited to:
-- Offering the Licensed Work as a hosted or managed service
-- Using the Licensed Work in a production environment to provide services to third parties
-- Using the Licensed Work as part of a commercial offering that competes with the Licensed Work
-
-However, the following uses are permitted:
-- Using the Licensed Work for development, testing, or evaluation purposes
-- Using the Licensed Work in a non-production environment
-- Using the Licensed Work internally within your organization
-- Contributing to the Licensed Work
-
-Change Date: 2029-01-01
-
-Change License: Apache License 2.0
-
-On the Change Date specified above, the Licensed Work will automatically convert to the Change License, and You may use the Licensed Work under the terms of the Change License.
-
-NOTICE: The Business Source License is not an Open Source license. However, the Licensed Work will eventually be licensed under the Apache License 2.0 after the Change Date.
-
----
-
-Business Source License 1.1
-
-Terms and Conditions
-
-This Business Source License (this "License") applies to the Licensed Work. Each licensee is addressed as "you" or "Licensee."
-
-"Licensor" means the individual or entity that creates or contributes to the creation of the Licensed Work.
-
-"Licensed Work" means the work of authorship, whether in Source or Object form, made available under this License, as indicated by a copyright notice that is included in or attached to the work.
-
-"Derivative Works" means any work, whether in Source or Object form, that is based on (or derived from) the Licensed Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship.
-
-"Contribution" means any work of authorship, including the original version of the Licensed Work and any modifications or additions to that Licensed Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Licensed Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner.
-
-"Grant of Copyright License" means 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 Licensed Work and such Derivative Works in Source or Object form.
-
-"Grant of Patent License" means 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 Licensed 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 Licensed Work to which such Contribution(s) was submitted.
-
-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 Licensed Work and such Derivative Works in Source or Object form.
-
-The above grant is subject to the Additional Use Grant specified in the header of this License.
-
-If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Licensed Work or a Contribution incorporated within the Licensed Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Licensed Work shall terminate as of the date such litigation is filed.
-
-THE LICENSED WORK IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE LICENSED WORK OR THE USE OR OTHER DEALINGS IN THE LICENSED WORK.
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -4,15 +4,20 @@
   <p><strong>Dynamic Integration between AI and Labor</strong></p>
   <p>A coordination framework for AI and human specialists making<br>decisions together within state machines.</p>
   <br>
+
+  [![MIT License](https://img.shields.io/badge/license-MIT-blue.svg)](LICENSE)
+  [![npm version](https://img.shields.io/npm/v/dialai.svg)](https://www.npmjs.com/package/dialai)
+  [![CI](https://github.com/eloquentanalytics/dialai/actions/workflows/ci.yml/badge.svg)](https://github.com/eloquentanalytics/dialai/actions/workflows/ci.yml)
+
   <a href="https://eloquentanalytics.github.io/dialai/"><strong>Documentation</strong></a> · <a href="https://eloquentanalytics.github.io/dialai/docs/getting-started/installation"><strong>Get Started</strong></a> · <a href="https://github.com/eloquentanalytics/dialai/issues"><strong>Issues</strong></a>
   <br><br>
 </div>
 
 ## Overview
 
-DialAI provides a framework for answering a fundamental question: *Given any task modeled as a state machine, how do you know — in dollars, time, and quality — exactly what it would cost to turn that task over to a minimally competent AI decision-maker?*
+DIAL provides a framework for answering a fundamental question: *Given any task modeled as a state machine, how do you know — in dollars, time, and quality — exactly what it would cost to turn that task over to a minimally competent AI decision-maker?*
 
-DialAI starts from a deliberately pessimistic assumption: **AI has no role.** LLM specialists begin with weight 0.0. The default assumption is that the task is too difficult for AI and only humans can navigate it. DialAI then provides the mechanism to prove otherwise, one decision at a time.
+DIAL starts from a deliberately pessimistic assumption: **AI has no role.** The default is that the task is too difficult for AI and only humans can navigate it. DIAL then provides the mechanism to prove otherwise, one decision at a time.
 
 ## Key Principles
 
@@ -20,30 +25,40 @@ DialAI starts from a deliberately pessimistic assumption: **AI has no role.** LL
 - **Progressive Collapse**: Over repeated decision cycles, measuring how well AI predicts human choices causes the multi-agent deliberation structure to progressively collapse into deterministic execution.
 - **Empirical Trust**: Trust is earned through demonstrated alignment with human decisions, not assumed.
 
-## Quick Start
+## Install
 
 ```bash
 npm install dialai
 ```
 
+## Quick Start
+
 ```typescript
 import { createSession, registerSpecialist } from "dialai";
 
 // Create a session with a state machine
 const session = createSession({
-  sessionTypeName: "my-task",
-  initialState: "idle"
+  machineName: "my-task",
+  initialState: "idle",
 });
 
 // Register an AI specialist
 await registerSpecialist({
   specialistId: "specialist.my-task.proposer.gpt-4",
-  sessionTypeName: "my-task",
+  machineName: "my-task",
   specialistRole: "proposer",
-  modelId: "gpt-4"
+  modelId: "gpt-4",
 });
 ```
 
+## Packages
+
+| Package | Description |
+|---|---|
+| `dialai` | Core library — engine, types, in-memory store, CLI, MCP server |
+| `dialai/store-postgres` | PostgreSQL store implementation (Kysely) |
+| `dialai/migrations` | Database migration runner for PostgreSQL |
+
 ## Documentation
 
 Full documentation is available at [https://eloquentanalytics.github.io/dialai/](https://eloquentanalytics.github.io/dialai/).
@@ -51,39 +66,18 @@ Full documentation is available at [https://eloquentanalytics.github.io/dialai/]
 ## Development
 
 ```bash
-# Install dependencies
-npm install
-
-# Run tests
-npm test
-
-# Build
-npm run build
-
-# Type check
-npm run typecheck
-
-# Lint
-npm run lint
+npm install          # Install dependencies
+npm test             # Run tests
+npm run build        # Build
+npm run typecheck    # Type check
+npm run lint         # Lint
+npm run ci           # Full CI pipeline
 ```
 
-## License
-
-DialAI is licensed under the Business Source License 1.1 (BUSL-1.1). This license allows free use for development, testing, evaluation, and internal use, but restricts commercial use, particularly by cloud providers offering DialAI as a hosted or managed service.
-
-**Key restrictions:**
-- You may not use DialAI to provide a service to third parties
-- You may not offer DialAI as a hosted or managed service
-- You may not use DialAI in a production environment to provide services to third parties
+## Contributing
 
-**Permitted uses:**
-- Development, testing, and evaluation
-- Internal use within your organization
-- Contributing to the project
+See [CONTRIBUTING.md](CONTRIBUTING.md) for development workflow and guidelines.
 
-**Change Date:** January 1, 2029  
-**Change License:** Apache License 2.0
-
-On the Change Date, DialAI will automatically convert to the Apache License 2.0, making it fully open source. This approach protects the project from cloud provider exploitation while ensuring eventual open source availability.
+## License
 
-See [LICENSE](LICENSE) for full terms.
+[MIT](LICENSE)

package/dist/dialai/alignment.d.ts

@@ -0,0 +1,51 @@
+/**
+ * DIAL AI Alignment System
+ *
+ * Tracks how well AI specialists align with human decisions.
+ * Alignment scores are used for weighted consensus and progressive collapse.
+ */
+import type { AlignmentRecord, Proposal } from "./types.js";
+/**
+ * Wilson score lower bound for a binomial proportion.
+ * Returns the lower bound of a confidence interval, naturally penalizing
+ * small sample sizes. Used instead of naive `matches/total` so that
+ * 1/1 ≈ 0.21 (not 1.0) and confidence grows with evidence.
+ *
+ * @param matches - Number of successes
+ * @param total - Total number of trials
+ * @param z - Z-score for confidence level (default 1.96 = 95%)
+ */
+export declare function wilsonLowerBound(matches: number, total: number, z?: number): number;
+/**
+ * Checks whether a specialist is human by looking at the isHuman flag
+ * on the registered specialist. No string matching on specialistId.
+ */
+export declare function isHumanSpecialist(specialistId: string): Promise<boolean>;
+/**
+ * Returns the alignment score for a specialist on a machine.
+ * Returns 1.0 for human specialists (always perfectly aligned).
+ * Returns 0 for unknown specialists.
+ */
+export declare function getAlignmentScore(specialistId: string, machineName: string, state?: string): Promise<number>;
+/**
+ * Updates the alignment record for a specialist after a single comparison.
+ */
+export declare function updateAlignment(specialistId: string, machineName: string, matched: boolean, state?: string): Promise<void>;
+/**
+ * Pure function: computes alignment updates for all specialists given a human decision.
+ * Returns an array of { specialistId, matched } without touching the store.
+ */
+export declare function computeAlignmentUpdates(humanTransitionName: string, proposals: Proposal[], humanSpecialistIds: Set<string>): Array<{
+    specialistId: string;
+    matched: boolean;
+}>;
+/**
+ * Updates alignment for all specialists after a human forces a decision.
+ * Thin wrapper: builds the human IDs set, calls the pure function, applies results.
+ */
+export declare function updateAlignmentAfterHumanDecision(machineName: string, humanTransitionName: string, proposals: Proposal[], state?: string): Promise<void>;
+/**
+ * Returns all alignment records for a machine.
+ */
+export declare function getAllAlignmentRecords(machineName: string, state?: string): Promise<AlignmentRecord[]>;
+//# sourceMappingURL=alignment.d.ts.map

package/dist/dialai/alignment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"alignment.d.ts","sourceRoot":"","sources":["../../src/dialai/alignment.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAE5D;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,SAAO,GAAG,MAAM,CAOjF;AAED;;;GAGG;AACH,wBAAsB,iBAAiB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAI9E;AAED;;;;GAIG;AACH,wBAAsB,iBAAiB,CACrC,YAAY,EAAE,MAAM,EACpB,WAAW,EAAE,MAAM,EACnB,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,MAAM,CAAC,CAWjB;AAED;;GAEG;AACH,wBAAsB,eAAe,CACnC,YAAY,EAAE,MAAM,EACpB,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,OAAO,EAChB,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC,CA2Bf;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,mBAAmB,EAAE,MAAM,EAC3B,SAAS,EAAE,QAAQ,EAAE,EACrB,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,GAC9B,KAAK,CAAC;IAAE,YAAY,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAAC,CAWnD;AAED;;;GAGG;AACH,wBAAsB,iCAAiC,CACrD,WAAW,EAAE,MAAM,EACnB,mBAAmB,EAAE,MAAM,EAC3B,SAAS,EAAE,QAAQ,EAAE,EACrB,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC,CAmBf;AAED;;GAEG;AACH,wBAAsB,sBAAsB,CAC1C,WAAW,EAAE,MAAM,EACnB,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,eAAe,EAAE,CAAC,CAE5B"}

package/dist/dialai/alignment.js

@@ -0,0 +1,125 @@
+/**
+ * DIAL AI Alignment System
+ *
+ * Tracks how well AI specialists align with human decisions.
+ * Alignment scores are used for weighted consensus and progressive collapse.
+ */
+import { getStore } from "./store.js";
+/**
+ * Wilson score lower bound for a binomial proportion.
+ * Returns the lower bound of a confidence interval, naturally penalizing
+ * small sample sizes. Used instead of naive `matches/total` so that
+ * 1/1 ≈ 0.21 (not 1.0) and confidence grows with evidence.
+ *
+ * @param matches - Number of successes
+ * @param total - Total number of trials
+ * @param z - Z-score for confidence level (default 1.96 = 95%)
+ */
+export function wilsonLowerBound(matches, total, z = 1.96) {
+    if (total === 0)
+        return 0;
+    const phat = matches / total;
+    const z2 = z * z;
+    const numerator = phat + z2 / (2 * total) - z * Math.sqrt((phat * (1 - phat) + z2 / (4 * total)) / total);
+    const denominator = 1 + z2 / total;
+    return Math.max(0, numerator / denominator);
+}
+/**
+ * Checks whether a specialist is human by looking at the isHuman flag
+ * on the registered specialist. No string matching on specialistId.
+ */
+export async function isHumanSpecialist(specialistId) {
+    const specialist = await getStore().getSpecialist(specialistId);
+    if (!specialist)
+        return false;
+    return "isHuman" in specialist && specialist.isHuman === true;
+}
+/**
+ * Returns the alignment score for a specialist on a machine.
+ * Returns 1.0 for human specialists (always perfectly aligned).
+ * Returns 0 for unknown specialists.
+ */
+export async function getAlignmentScore(specialistId, machineName, state) {
+    if (await isHumanSpecialist(specialistId)) {
+        return 1.0;
+    }
+    const key = state
+        ? `${specialistId}:${machineName}:${state}`
+        : `${specialistId}:${machineName}`;
+    const record = await getStore().getAlignmentRecord(key);
+    if (!record)
+        return 0;
+    return record.alignmentScore;
+}
+/**
+ * Updates the alignment record for a specialist after a single comparison.
+ */
+export async function updateAlignment(specialistId, machineName, matched, state) {
+    // Don't track alignment for human specialists
+    if (await isHumanSpecialist(specialistId))
+        return;
+    const key = state
+        ? `${specialistId}:${machineName}:${state}`
+        : `${specialistId}:${machineName}`;
+    const existing = await getStore().getAlignmentRecord(key);
+    if (existing) {
+        existing.matchingChoices += matched ? 1 : 0;
+        existing.totalComparisons += 1;
+        existing.alignmentScore =
+            wilsonLowerBound(existing.matchingChoices, existing.totalComparisons);
+        existing.lastUpdated = new Date();
+        await getStore().setAlignmentRecord(key, existing);
+    }
+    else {
+        await getStore().setAlignmentRecord(key, {
+            specialistId,
+            machineName,
+            state,
+            matchingChoices: matched ? 1 : 0,
+            totalComparisons: 1,
+            alignmentScore: wilsonLowerBound(matched ? 1 : 0, 1),
+            lastUpdated: new Date(),
+        });
+    }
+}
+/**
+ * Pure function: computes alignment updates for all specialists given a human decision.
+ * Returns an array of { specialistId, matched } without touching the store.
+ */
+export function computeAlignmentUpdates(humanTransitionName, proposals, humanSpecialistIds) {
+    const results = [];
+    // Check proposers: did they propose the same transition?
+    for (const proposal of proposals) {
+        if (humanSpecialistIds.has(proposal.specialistId))
+            continue;
+        const matched = proposal.transitionName === humanTransitionName;
+        results.push({ specialistId: proposal.specialistId, matched });
+    }
+    return results;
+}
+/**
+ * Updates alignment for all specialists after a human forces a decision.
+ * Thin wrapper: builds the human IDs set, calls the pure function, applies results.
+ */
+export async function updateAlignmentAfterHumanDecision(machineName, humanTransitionName, proposals, state) {
+    // Build set of human specialist IDs
+    const allSpecialistIds = new Set();
+    for (const p of proposals)
+        allSpecialistIds.add(p.specialistId);
+    const humanSpecialistIds = new Set();
+    for (const id of allSpecialistIds) {
+        if (await isHumanSpecialist(id))
+            humanSpecialistIds.add(id);
+    }
+    const updates = computeAlignmentUpdates(humanTransitionName, proposals, humanSpecialistIds);
+    for (const { specialistId, matched } of updates) {
+        await updateAlignment(specialistId, machineName, matched, state);
+    }
+}
+/**
+ * Returns all alignment records for a machine.
+ */
+export async function getAllAlignmentRecords(machineName, state) {
+    return getStore().getAlignmentRecordsByMachine(machineName, state);
+}
+//# sourceMappingURL=alignment.js.map

package/dist/dialai/alignment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"alignment.js","sourceRoot":"","sources":["../../src/dialai/alignment.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAGtC;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe,EAAE,KAAa,EAAE,CAAC,GAAG,IAAI;IACvE,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,MAAM,IAAI,GAAG,OAAO,GAAG,KAAK,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAC1G,MAAM,WAAW,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;IACnC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,WAAW,CAAC,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,YAAoB;IAC1D,MAAM,UAAU,GAAG,MAAM,QAAQ,EAAE,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;IAChE,IAAI,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAC9B,OAAO,SAAS,IAAI,UAAU,IAAI,UAAU,CAAC,OAAO,KAAK,IAAI,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,YAAoB,EACpB,WAAmB,EACnB,KAAc;IAEd,IAAI,MAAM,iBAAiB,CAAC,YAAY,CAAC,EAAE,CAAC;QAC1C,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,GAAG,GAAG,KAAK;QACf,CAAC,CAAC,GAAG,YAAY,IAAI,WAAW,IAAI,KAAK,EAAE;QAC3C,CAAC,CAAC,GAAG,YAAY,IAAI,WAAW,EAAE,CAAC;IACrC,MAAM,MAAM,GAAG,MAAM,QAAQ,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACxD,IAAI,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,MAAM,CAAC,cAAc,CAAC;AAC/B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,YAAoB,EACpB,WAAmB,EACnB,OAAgB,EAChB,KAAc;IAEd,8CAA8C;IAC9C,IAAI,MAAM,iBAAiB,CAAC,YAAY,CAAC;QAAE,OAAO;IAElD,MAAM,GAAG,GAAG,KAAK;QACf,CAAC,CAAC,GAAG,YAAY,IAAI,WAAW,IAAI,KAAK,EAAE;QAC3C,CAAC,CAAC,GAAG,YAAY,IAAI,WAAW,EAAE,CAAC;IACrC,MAAM,QAAQ,GAAG,MAAM,QAAQ,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;IAE1D,IAAI,QAAQ,EAAE,CAAC;QACb,QAAQ,CAAC,eAAe,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,QAAQ,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAC/B,QAAQ,CAAC,cAAc;YACrB,gBAAgB,CAAC,QAAQ,CAAC,eAAe,EAAE,QAAQ,CAAC,gBAAgB,CAAC,CAAC;QACxE,QAAQ,CAAC,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC;QAClC,MAAM,QAAQ,EAAE,CAAC,kBAAkB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACrD,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,EAAE,CAAC,kBAAkB,CAAC,GAAG,EAAE;YACvC,YAAY;YACZ,WAAW;YACX,KAAK;YACL,eAAe,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,gBAAgB,EAAE,CAAC;YACnB,cAAc,EAAE,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpD,WAAW,EAAE,IAAI,IAAI,EAAE;SACxB,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,mBAA2B,EAC3B,SAAqB,EACrB,kBAA+B;IAE/B,MAAM,OAAO,GAAsD,EAAE,CAAC;IAEtE,yDAAyD;IACzD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC;YAAE,SAAS;QAC5D,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,KAAK,mBAAmB,CAAC;QAChE,OAAO,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,iCAAiC,CACrD,WAAmB,EACnB,mBAA2B,EAC3B,SAAqB,EACrB,KAAc;IAEd,oCAAoC;IACpC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAEhE,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC7C,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAClC,IAAI,MAAM,iBAAiB,CAAC,EAAE,CAAC;YAAE,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,MAAM,OAAO,GAAG,uBAAuB,CACrC,mBAAmB,EACnB,SAAS,EACT,kBAAkB,CACnB,CAAC;IAEF,KAAK,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,OAAO,EAAE,CAAC;QAChD,MAAM,eAAe,CAAC,YAAY,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IACnE,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,WAAmB,EACnB,KAAc;IAEd,OAAO,QAAQ,EAAE,CAAC,4BAA4B,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;AACrE,CAAC"}

package/dist/dialai/api.d.ts

@@ -0,0 +1,131 @@
+/**
+ * DIAL AI Core API
+ *
+ * Core API functions for session management, specialist registration,
+ * and the decision cycle.
+ */
+import type { MachineDefinition, Session, Proposal, Proposer, Arbiter, Specialist, RegisterProposerOptions, RegisterArbiterOptions, ProposerContext, ArbiterContext, ConsensusResult, ArbitrationResult, ArbitrationPath, SubmitProposalOptions, SubmitArbitrationOptions } from "./types.js";
+/**
+ * Creates a new session instance from a machine definition.
+ *
+ * @param machine - The machine definition to instantiate
+ * @returns The created session
+ */
+export declare function createSession(machine: MachineDefinition, metaJson?: Record<string, unknown>): Promise<Session>;
+/**
+ * Retrieves a session by its ID.
+ *
+ * @param sessionId - The session ID to look up
+ * @returns The session
+ * @throws If session not found
+ */
+export declare function getSession(sessionId: string): Promise<Session>;
+/**
+ * Returns all stored sessions.
+ *
+ * @returns Array of all sessions
+ */
+export declare function getSessions(): Promise<Session[]>;
+/**
+ * Registers a proposer specialist for a machine.
+ *
+ * @param opts - Registration options
+ * @returns The registered proposer
+ */
+export declare function registerProposer(opts: RegisterProposerOptions): Promise<Proposer>;
+/**
+ * Registers an arbiter specialist for a machine.
+ *
+ * @param opts - Registration options
+ * @returns The registered arbiter
+ */
+export declare function registerArbiter(opts: RegisterArbiterOptions): Promise<Arbiter>;
+/**
+ * Gets a specialist by ID.
+ */
+export declare function getSpecialist(specialistId: string): Promise<(Specialist | Arbiter) | undefined>;
+/**
+ * Gets all proposers for a machine.
+ */
+export declare function getProposers(machineName: string): Promise<Proposer[]>;
+/**
+ * Gets the arbiter for a machine.
+ */
+export declare function getArbiter(machineName: string): Promise<Arbiter | undefined>;
+/**
+ * Enables a specialist (sets enabled = true).
+ */
+export declare function enableSpecialist(specialistId: string): Promise<void>;
+/**
+ * Disables a specialist (sets enabled = false).
+ */
+export declare function disableSpecialist(specialistId: string): Promise<void>;
+/**
+ * Gets enabled proposers for a machine (enabled is true or undefined).
+ */
+export declare function getEnabledProposers(machineName: string): Promise<Proposer[]>;
+/**
+ * Gets the enabled arbiter for a machine.
+ */
+export declare function getEnabledArbiter(machineName: string): Promise<Arbiter | undefined>;
+/**
+ * Gets proposers declared in the current state's specialists array.
+ * Falls back to getProposers(machineName) if state has no specialists.
+ * Respects both state-level `disabled` and global `enabled` flags.
+ */
+export declare function getProposersForState(session: Session): Promise<Proposer[]>;
+/**
+ * Gets enabled proposers for the current state.
+ * Filters out specialists that are disabled at the state level or globally.
+ */
+export declare function getEnabledProposersForState(session: Session): Promise<Proposer[]>;
+/**
+ * Gets the arbiter declared in the current state's specialists array.
+ * Falls back to getArbiter(machineName).
+ */
+export declare function getArbiterForState(session: Session): Promise<Arbiter | undefined>;
+/**
+ * Gets the effective consensus threshold for a session's current state.
+ * Priority: state > machine > arbiter. Returns undefined if none configured.
+ */
+export declare function getEffectiveThreshold(session: Session): Promise<number | undefined>;
+/**
+ * Resolves a proposer's local strategy function, or null for side-effectful modes.
+ */
+export declare function resolveProposerStrategy(proposer: Proposer): ((ctx: ProposerContext) => Promise<{
+    transitionName: string;
+    toState: string;
+    reasoning: string;
+}>) | null;
+/**
+ * Resolves an arbiter's local strategy function, or null for side-effectful modes.
+ */
+export declare function resolveArbiterStrategy(arbiter: Arbiter): ((ctx: ArbiterContext) => Promise<ConsensusResult>) | null;
+/**
+ * Creates and stores a proposal.
+ * If transitionName is omitted, invokes the specialist's registered strategy.
+ */
+export declare function submitProposal(opts: SubmitProposalOptions): Promise<Proposal>;
+/**
+ * Gets all proposals for a session's current round.
+ */
+export declare function getProposalsForRound(sessionId: string, roundId: string): Promise<Proposal[]>;
+/**
+ * Evaluates whether consensus has been reached for a session.
+ * Read-only operation - does not execute any transition.
+ */
+export declare function evaluateConsensus(sessionId: string): Promise<ConsensusResult>;
+/**
+ * Pure function: classifies which path submitArbitration should take
+ * based on round staleness, human status, transition validity, and proposal count.
+ */
+export declare function classifyArbitration(currentRoundId: string, effectiveRoundId: string, isHuman: boolean, transitionName: string | undefined, currentStateTransitions: Record<string, string> | undefined, proposalCount: number, currentState: string): ArbitrationPath;
+/**
+ * Evaluates consensus and optionally executes the winning transition.
+ */
+export declare function submitArbitration(opts: SubmitArbitrationOptions): Promise<ArbitrationResult>;
+/**
+ * Executes a state transition on a session.
+ */
+export declare function executeTransition(sessionId: string, transitionName: string, toState: string, reasoning?: string): Promise<Session>;
+//# sourceMappingURL=api.d.ts.map

package/dist/dialai/api.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"api.d.ts","sourceRoot":"","sources":["../../src/dialai/api.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAaH,OAAO,KAAK,EACV,iBAAiB,EACjB,OAAO,EACP,QAAQ,EACR,QAAQ,EACR,OAAO,EACP,UAAU,EACV,uBAAuB,EACvB,sBAAsB,EACtB,eAAe,EACf,cAAc,EACd,eAAe,EACf,iBAAiB,EACjB,eAAe,EAGf,qBAAqB,EACrB,wBAAwB,EACzB,MAAM,YAAY,CAAC;AAMpB;;;;;GAKG;AACH,wBAAsB,aAAa,CACjC,OAAO,EAAE,iBAAiB,EAC1B,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACjC,OAAO,CAAC,OAAO,CAAC,CAgDlB;AAED;;;;;;GAMG;AACH,wBAAsB,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAMpE;AAED;;;;GAIG;AACH,wBAAsB,WAAW,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC,CAEtD;AAyID;;;;;GAKG;AACH,wBAAsB,gBAAgB,CACpC,IAAI,EAAE,uBAAuB,GAC5B,OAAO,CAAC,QAAQ,CAAC,CA4BnB;AAED;;;;;GAKG;AACH,wBAAsB,eAAe,CACnC,IAAI,EAAE,sBAAsB,GAC3B,OAAO,CAAC,OAAO,CAAC,CAwBlB;AAED;;GAEG;AACH,wBAAsB,aAAa,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,UAAU,GAAG,OAAO,CAAC,GAAG,SAAS,CAAC,CAErG;AAED;;GAEG;AACH,wBAAsB,YAAY,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAG3E;AAED;;GAEG;AACH,wBAAsB,UAAU,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,GAAG,SAAS,CAAC,CAGlF;AAMD;;GAEG;AACH,wBAAsB,gBAAgB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAO1E;AAED;;GAEG;AACH,wBAAsB,iBAAiB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAO3E;AAED;;GAEG;AACH,wBAAsB,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAGlF;AAED;;GAEG;AACH,wBAAsB,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,GAAG,SAAS,CAAC,CAIzF;AAMD;;;;GAIG;AACH,wBAAsB,oBAAoB,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAchF;AAED;;;GAGG;AACH,wBAAsB,2BAA2B,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAgBvF;AAED;;;GAGG;AACH,wBAAsB,kBAAkB,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,OAAO,GAAG,SAAS,CAAC,CAevF;AAED;;;GAGG;AACH,wBAAsB,qBAAqB,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAazF;AA2CD;;GAEG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,QAAQ,GACjB,CAAC,CAAC,GAAG,EAAE,eAAe,KAAK,OAAO,CAAC;IAAE,cAAc,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC,GAAG,IAAI,CAU5G;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,OAAO,GACf,CAAC,CAAC,GAAG,EAAE,cAAc,KAAK,OAAO,CAAC,eAAe,CAAC,CAAC,GAAG,IAAI,CAU5D;AAgED;;;GAGG;AACH,wBAAsB,cAAc,CAClC,IAAI,EAAE,qBAAqB,GAC1B,OAAO,CAAC,QAAQ,CAAC,CAqEnB;AAED;;GAEG;AACH,wBAAsB,oBAAoB,CACxC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,QAAQ,EAAE,CAAC,CAErB;AAED;;;GAGG;AACH,wBAAsB,iBAAiB,CACrC,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,eAAe,CAAC,CA6B1B;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,cAAc,EAAE,MAAM,EACtB,gBAAgB,EAAE,MAAM,EACxB,OAAO,EAAE,OAAO,EAChB,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,uBAAuB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,EAC3D,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GACnB,eAAe,CA2BjB;AA+CD;;GAEG;AACH,wBAAsB,iBAAiB,CACrC,IAAI,EAAE,wBAAwB,GAC7B,OAAO,CAAC,iBAAiB,CAAC,CAkM5B;AAED;;GAEG;AACH,wBAAsB,iBAAiB,CACrC,SAAS,EAAE,MAAM,EACjB,cAAc,EAAE,MAAM,EACtB,OAAO,EAAE,MAAM,EACf,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC,OAAO,CAAC,CAwClB"}