@elicitkit/server 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 2026 the Elicitkit authors
+
+   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/dist/bin.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=bin.d.ts.map

package/dist/bin.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin.d.ts","sourceRoot":"","sources":["../src/bin.ts"],"names":[],"mappings":""}

package/dist/bin.js

@@ -0,0 +1,19 @@
+#!/usr/bin/env node
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import { createElicitServer } from "./server.js";
+/**
+ * stdio entrypoint — the universal MCP transport (Claude Code, Codex CLI,
+ * Cursor, …). HTTP/SDK and CLI surfaces land in Task #6.
+ */
+async function main() {
+    const server = createElicitServer();
+    const transport = new StdioServerTransport();
+    await server.connect(transport);
+    // stderr only: stdout is the MCP wire.
+    process.stderr.write("elicitkit MCP server ready (stdio)\n");
+}
+main().catch((err) => {
+    process.stderr.write(`elicitkit fatal: ${String(err)}\n`);
+    process.exit(1);
+});
+//# sourceMappingURL=bin.js.map

package/dist/bin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin.js","sourceRoot":"","sources":["../src/bin.ts"],"names":[],"mappings":";AACA,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAEjD;;;GAGG;AACH,KAAK,UAAU,IAAI;IACjB,MAAM,MAAM,GAAG,kBAAkB,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAChC,uCAAuC;IACvC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;AAC/D,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;IACnB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1D,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,8 @@
+export { createElicitServer } from "./server.js";
+export type { ElicitServerOptions } from "./server.js";
+export { negotiateTier, setFloor, TIER_ORDER } from "./tiers.js";
+export type { TierChoice } from "./tiers.js";
+export { renderPanel } from "./render.js";
+export { openRound, peekRound, closeRound } from "./submit.js";
+export type { SubmitResult } from "./submit.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,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,YAAY,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACjE,YAAY,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC/D,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC"}

package/dist/index.js

@@ -0,0 +1,5 @@
+export { createElicitServer } from "./server.js";
+export { negotiateTier, setFloor, TIER_ORDER } from "./tiers.js";
+export { renderPanel } from "./render.js";
+export { openRound, peekRound, closeRound } from "./submit.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,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAEjD,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAEjE,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC"}

package/dist/render.d.ts

@@ -0,0 +1,10 @@
+import type { AskSet, Tier } from "@elicitkit/core";
+import { type RenderedPanel } from "@elicitkit/renderers";
+/**
+ * Dispatch the panel tiers (`apps` / `url` / `tui`). The `elicitation` tier is
+ * NOT here: it resolves inline against the host's native elicitation primitive
+ * and is driven directly by the server (see server.ts), with no panel or
+ * `elicit_submit` round-trip.
+ */
+export declare function renderPanel(set: AskSet, tier: Tier, token: string): Promise<RenderedPanel>;
+//# sourceMappingURL=render.d.ts.map

package/dist/render.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"render.d.ts","sourceRoot":"","sources":["../src/render.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,EAIL,KAAK,aAAa,EACnB,MAAM,sBAAsB,CAAC;AAE9B;;;;;GAKG;AACH,wBAAsB,WAAW,CAC/B,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,aAAa,CAAC,CAKxB"}

package/dist/render.js

@@ -0,0 +1,16 @@
+import { renderApps, renderUrl, renderTui, } from "@elicitkit/renderers";
+/**
+ * Dispatch the panel tiers (`apps` / `url` / `tui`). The `elicitation` tier is
+ * NOT here: it resolves inline against the host's native elicitation primitive
+ * and is driven directly by the server (see server.ts), with no panel or
+ * `elicit_submit` round-trip.
+ */
+export async function renderPanel(set, tier, token) {
+    if (tier === "apps")
+        return renderApps(set, token);
+    if (tier === "url")
+        return renderUrl(set, token);
+    // "tui" — and the safe sink for anything unexpected.
+    return renderTui(set, token);
+}
+//# sourceMappingURL=render.js.map

package/dist/render.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"render.js","sourceRoot":"","sources":["../src/render.ts"],"names":[],"mappings":"AACA,OAAO,EACL,UAAU,EACV,SAAS,EACT,SAAS,GAEV,MAAM,sBAAsB,CAAC;AAE9B;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,GAAW,EACX,IAAU,EACV,KAAa;IAEb,IAAI,IAAI,KAAK,MAAM;QAAE,OAAO,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACnD,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACjD,qDAAqD;IACrD,OAAO,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC"}

package/dist/server.d.ts

@@ -0,0 +1,37 @@
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { type Tier } from "@elicitkit/core";
+export interface ElicitServerOptions {
+    name?: string;
+    version?: string;
+    /**
+     * Hosts known to render the `apps`/`url` UI panels. No standard MCP
+     * capability advertises HTML rendering, so the server will NOT serve a
+     * UI tier to a plain terminal client just because the agent asked for it
+     * (that produces a dead "fill out the panel" message with no panel).
+     * Opt in here, or via ELICITKIT_UI_TIERS=apps,url, for a host you know
+     * supports mcp-ui / MCP Apps.
+     */
+    uiTiers?: Tier[];
+}
+/**
+ * Build the Elicitkit MCP reference server.
+ *
+ *  - `elicit`        — the agent submits an AskSet; the server validates it
+ *                      against the v0.1 schema and negotiates the render tier
+ *                      against the host's capabilities. EVERY tier returns
+ *                      fast: panel tiers (apps / url / tui) return a
+ *                      rendering plus a round token; the elicitation tier
+ *                      issues the FIRST native elicitInput inline, awaits
+ *                      ONE user answer, and returns `pending: true` so the
+ *                      per-call MCP timeout is never the gating factor.
+ *  - `elicit_next`   — NEW. Drives the next elicitInput for an open
+ *                      elicitation-tier round. Returns `pending:true`
+ *                      until the last ask is answered, then `pending:false`
+ *                      with the validated answers.
+ *  - `elicit_submit` — the panel (or the agent, in `tui`/`url`) returns the
+ *                      user's answers; validated per-type, handed back clean.
+ *
+ * The spec is the product; this server is its reference implementation.
+ */
+export declare function createElicitServer(opts?: ElicitServerOptions): McpServer;
+//# sourceMappingURL=server.d.ts.map

package/dist/server.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAGpE,OAAO,EAA+B,KAAK,IAAI,EAAyB,MAAM,iBAAiB,CAAC;AAqBhG,MAAM,WAAW,mBAAmB;IAClC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC;CAClB;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,GAAE,mBAAwB,GAAG,SAAS,CAmV5E"}

package/dist/server.js

@@ -0,0 +1,442 @@
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { z } from "zod";
+import { validateAskSet } from "@elicitkit/core";
+import { buildPanelHtml, compileAskToInputs, decodeAskAnswer, } from "@elicitkit/renderers";
+import { negotiateTier, slowAskRoute, TIER_ORDER } from "./tiers.js";
+import { renderPanel } from "./render.js";
+import { appendCollected, closeCollected, closeRound, openRound, peekRoundState, } from "./submit.js";
+const TIER_VALUES = TIER_ORDER;
+/**
+ * Build the Elicitkit MCP reference server.
+ *
+ *  - `elicit`        — the agent submits an AskSet; the server validates it
+ *                      against the v0.1 schema and negotiates the render tier
+ *                      against the host's capabilities. EVERY tier returns
+ *                      fast: panel tiers (apps / url / tui) return a
+ *                      rendering plus a round token; the elicitation tier
+ *                      issues the FIRST native elicitInput inline, awaits
+ *                      ONE user answer, and returns `pending: true` so the
+ *                      per-call MCP timeout is never the gating factor.
+ *  - `elicit_next`   — NEW. Drives the next elicitInput for an open
+ *                      elicitation-tier round. Returns `pending:true`
+ *                      until the last ask is answered, then `pending:false`
+ *                      with the validated answers.
+ *  - `elicit_submit` — the panel (or the agent, in `tui`/`url`) returns the
+ *                      user's answers; validated per-type, handed back clean.
+ *
+ * The spec is the product; this server is its reference implementation.
+ */
+export function createElicitServer(opts = {}) {
+    const server = new McpServer({
+        name: opts.name ?? "elicitkit",
+        version: opts.version ?? "0.1.0",
+    });
+    // Bridge the renderers' narrow ElicitFn to the SDK's elicitation primitive.
+    const elicit = (params) => server.server.elicitInput({
+        mode: "form",
+        message: params.message,
+        requestedSchema: params.requestedSchema,
+    });
+    server.registerTool("elicit", {
+        title: "Elicit structured input",
+        description: "Render an Elicitkit AskSet to the user and obtain typed answers. " +
+            "Returns FAST: panel tiers return a token + rendering; the " +
+            "elicitation tier issues ONE native prompt inline and returns " +
+            "`pending:true` so the per-call MCP timeout is never blown by " +
+            "human-think time. If `pending:true` and tier === 'elicitation', " +
+            "call `elicit_next(token)` until `pending:false`; otherwise " +
+            "collect answers per the rendering and call " +
+            "`elicit_submit(token, answers)`. Never fabricate answers.",
+        inputSchema: {
+            askSet: z
+                .unknown()
+                .describe("A v0.1 Elicitkit AskSet: { specVersion, asks: [...] }"),
+            supportedTiers: z
+                .array(z.enum(TIER_VALUES))
+                .optional()
+                .describe("Render tiers this host supports, richest first. Omit if unknown " +
+                "(the server then uses the universal 'tui' text tier)."),
+        },
+    }, async ({ askSet, supportedTiers }) => {
+        // Some MCP clients serialize complex object args as a JSON string.
+        // Coerce back to an object before schema validation.
+        if (typeof askSet === "string") {
+            try {
+                askSet = JSON.parse(askSet);
+            }
+            catch {
+                /* leave as-is; validateAskSet will reject it */
+            }
+        }
+        const v = validateAskSet(askSet);
+        if (!v.ok) {
+            return {
+                isError: true,
+                content: [
+                    {
+                        type: "text",
+                        text: "AskSet failed v0.1 schema validation:\n- " +
+                            v.errors.join("\n- "),
+                    },
+                ],
+            };
+        }
+        const set = askSet;
+        // The connected MCP CLIENT is the authority on what can render — NOT
+        // the agent (an LLM guessing "apps" in a terminal is how you get a
+        // dead panel). Derive what the host can actually do:
+        const caps = server.server.getClientCapabilities();
+        const clientElicitation = !!caps?.elicitation;
+        const exp = (caps?.experimental ?? {});
+        const uiOptIn = opts.uiTiers ??
+            process.env.ELICITKIT_UI_TIERS?.split(",").map((s) => s.trim()).filter(Boolean);
+        // Positive evidence only: an operator opt-in, or the client itself
+        // advertising a UI extension. Never the agent's say-so.
+        const uiOk = (uiOptIn && uiOptIn.length > 0) ||
+            !!(exp["mcp-ui"] || exp["apps"] || exp["ui"] || exp["io.modelcontextprotocol/apps"]);
+        const hostTiers = new Set(["tui"]);
+        if (clientElicitation)
+            hostTiers.add("elicitation");
+        if (uiOk) {
+            hostTiers.add("apps");
+            hostTiers.add("url");
+        }
+        // Slow-ask auto-router: if any ask in the set is likely-slow on the
+        // per-prompt elicitation primitive (long text, big code diff, large
+        // rank), drop `elicitation` from the candidates so we degrade to a
+        // panel tier (apps/url) where the user can take as long as they
+        // want, or to tui where the agent collects the answers in chat.
+        const slow = slowAskRoute(set);
+        const candidates = new Set(hostTiers);
+        if (slow.routed)
+            candidates.delete("elicitation");
+        // The agent's supportedTiers may only NARROW within the host's real
+        // set — it can't grant a tier the host can't do. If its narrowing
+        // leaves nothing, ignore it and trust the host.
+        let effective = [...candidates];
+        const requested = supportedTiers;
+        if (requested && requested.length > 0) {
+            const r = new Set(requested);
+            const narrowed = effective.filter((t) => r.has(t));
+            if (narrowed.length > 0)
+                effective = narrowed;
+        }
+        // If filtering / routing emptied the set, fall back to the universal
+        // sink so we never hard-fail at negotiation.
+        if (effective.length === 0)
+            effective = ["tui"];
+        const { tier, negotiated } = negotiateTier(set, effective);
+        const baseMeta = {
+            renderedTier: tier,
+            tierNegotiated: negotiated,
+            hostTiers: [...hostTiers],
+            ...(slow.routed
+                ? { routedAwayFromElicitation: true, routeReason: slow.reason }
+                : {}),
+        };
+        // ── elicitation tier: open round, issue FIRST elicitInput inline,
+        // await ONE answer, return pending:true. The rest of the round is
+        // driven by elicit_next so each tool call is bounded by one user
+        // answer (a Codex-realistic 14-question set never trips a per-call
+        // MCP timeout).
+        if (tier === "elicitation") {
+            const token = openRound(set, { tier: "elicitation" });
+            const out = await driveOneStep(token, elicit);
+            if (!out.ok) {
+                return {
+                    isError: true,
+                    content: [{ type: "text", text: out.error }],
+                };
+            }
+            return out.result(token, baseMeta);
+        }
+        // ── panel tiers (tui/url/apps): return panel ref + token IMMEDIATELY,
+        // no await. The user fills the panel; the agent calls elicit_submit.
+        const token = openRound(set, {
+            tier,
+            ...(slow.routed ? { routedAwayFromElicitation: { reason: slow.reason ?? "" } } : {}),
+        });
+        const out = await renderPanel(set, tier, token);
+        const content = [
+            { type: "text", text: out.text },
+        ];
+        if (out.ui) {
+            content.push(out.ui);
+        }
+        return {
+            content,
+            structuredContent: {
+                pending: true,
+                token,
+                tier,
+                ...(tier === "url" || tier === "apps"
+                    ? { panelUri: out.ui?.resource.uri }
+                    : {}),
+            },
+            _meta: {
+                elicitkit: {
+                    token,
+                    pending: true,
+                    ...baseMeta,
+                    renderedTier: out.tier,
+                    requestedTier: tier,
+                    ...(out.ui ? {} : {}),
+                },
+                ...(out.ui ? { ui: { resourceUri: out.ui.resource.uri } } : {}),
+            },
+        };
+    });
+    server.registerTool("elicit_next", {
+        title: "Advance an open elicitation-tier round",
+        description: "Drive the next native elicitInput for an open elicitation-tier " +
+            "round. Returns `pending:true` (more asks to come) or " +
+            "`pending:false` with the validated `answers`. Only valid for the " +
+            "elicitation tier — panel tiers (tui/url/apps) complete via " +
+            "elicit_submit instead.",
+        inputSchema: {
+            token: z
+                .string()
+                .describe("The round token from a prior elicit / elicit_next result."),
+        },
+    }, async ({ token }) => {
+        const st = peekRoundState(token);
+        if (!st) {
+            return {
+                isError: true,
+                content: [{ type: "text", text: "unknown or expired token" }],
+            };
+        }
+        if (st.tier !== "elicitation") {
+            return {
+                isError: true,
+                content: [
+                    {
+                        type: "text",
+                        text: `round token is for tier ${st.tier}; use elicit_submit instead`,
+                    },
+                ],
+            };
+        }
+        if (st.index >= st.set.asks.length) {
+            return {
+                isError: true,
+                content: [
+                    { type: "text", text: "round already complete; no more asks" },
+                ],
+            };
+        }
+        const out = await driveOneStep(token, elicit);
+        if (!out.ok) {
+            return { isError: true, content: [{ type: "text", text: out.error }] };
+        }
+        return out.result(token, {
+            renderedTier: "elicitation",
+            hostTiers: [],
+        });
+    });
+    server.registerTool("elicit_submit", {
+        title: "Submit elicited answers",
+        description: "Return the user's answers for an open elicitation round. Called by " +
+            "the interactive panel; in the tui/url tiers the agent calls it with " +
+            "answers the user provided (e.g. a payload pasted back from the url " +
+            "panel — forward it verbatim).",
+        inputSchema: {
+            token: z.string().describe("The round token from the elicit result _meta."),
+            answers: z
+                .array(z.unknown())
+                .describe("One Answer per ask: " +
+                '{ id, type, status: "answered"|"declined"|"deferred", value? }'),
+        },
+    }, async ({ token, answers }) => {
+        const r = closeRound(token, answers);
+        if (!r.ok) {
+            return {
+                isError: true,
+                content: [
+                    {
+                        type: "text",
+                        text: "Answers rejected — re-ask (SPEC.md §5):\n- " +
+                            r.errors.join("\n- "),
+                    },
+                ],
+            };
+        }
+        return {
+            content: [{ type: "text", text: JSON.stringify(r.answers, null, 2) }],
+            structuredContent: { answers: r.answers, pending: false },
+            _meta: { elicitkit: { token, ok: true, pending: false } },
+        };
+    });
+    server.registerTool("elicit_render", {
+        title: "Render an AskSet to a standalone HTML panel",
+        description: "Return a self-contained HTML panel for an AskSet as a one-shot " +
+            "deliverable. Use when the user wants HTML / a file / a " +
+            "questionnaire / a shareable panel. This is NOT an interactive " +
+            "round: save the returned HTML to a .html file, give the user the " +
+            "path, and STOP — do not also call `elicit`, do not wait for or " +
+            "prompt for answers, do not treat a round as pending. The panel can " +
+            "still produce a copy-paste payload, but feeding it to " +
+            "elicit_submit is OPTIONAL and only if the user later chooses to " +
+            "return one. `elicit` is the interactive ask; this is just the file.",
+        inputSchema: {
+            askSet: z
+                .unknown()
+                .describe("A v0.1 Elicitkit AskSet: { specVersion, asks: [...] }"),
+        },
+    }, async ({ askSet }) => {
+        if (typeof askSet === "string") {
+            try {
+                askSet = JSON.parse(askSet);
+            }
+            catch {
+                /* leave as-is; validateAskSet will reject it */
+            }
+        }
+        const v = validateAskSet(askSet);
+        if (!v.ok) {
+            return {
+                isError: true,
+                content: [
+                    { type: "text", text: "AskSet failed v0.1 schema validation:\n- " + v.errors.join("\n- ") },
+                ],
+            };
+        }
+        const set = askSet;
+        // A real round token so the panel's copy-paste payload validates
+        // through elicit_submit just like any other round.
+        const token = openRound(set, { tier: "url" });
+        const html = buildPanelHtml(set, token, "url");
+        return {
+            content: [
+                {
+                    type: "text",
+                    text: `Deliverable: save the following to a .html file, give the ` +
+                        `user the path, and stop — this is not an interactive round, ` +
+                        `do not wait for answers. (If the user later returns the ` +
+                        `panel's copy-paste JSON, it may optionally be forwarded to ` +
+                        `elicit_submit; the round token is embedded.)\n\n` +
+                        html,
+                },
+            ],
+            _meta: { elicitkit: { token, rendered: "url", bytes: html.length } },
+        };
+    });
+    return server;
+}
+async function driveOneStep(token, elicit) {
+    const st = peekRoundState(token);
+    if (!st)
+        return { ok: false, error: "unknown or expired token" };
+    const stateAny = st;
+    if (!stateAny.subResponses)
+        stateAny.subResponses = [];
+    const askIdx = stateAny.index;
+    const ask = stateAny.set.asks[askIdx];
+    if (!ask) {
+        return { ok: false, error: "round already complete; no more asks" };
+    }
+    const inputs = compileAskToInputs(ask);
+    const subStep = stateAny.subResponses.length;
+    const params = inputs[subStep];
+    if (!params) {
+        return { ok: false, error: "no elicitInput compiled for ask" };
+    }
+    const r = await elicit(params);
+    stateAny.subResponses.push(r);
+    // For ask_code_diff, a non-accept on any hunk ends the ask. For other
+    // asks there's only one input anyway.
+    const moreSubSteps = inputs.length > stateAny.subResponses.length;
+    const continueAsk = moreSubSteps && (ask.type !== "ask_code_diff" || r.action === "accept");
+    if (continueAsk) {
+        // Still inside the current ask. Return pending:true with progress.
+        return {
+            ok: true,
+            result: (tok, extra) => ({
+                content: [
+                    {
+                        type: "text",
+                        text: JSON.stringify({ pending: true, token: tok, completed: stateAny.index, total: stateAny.set.asks.length }, null, 2),
+                    },
+                ],
+                structuredContent: {
+                    pending: true,
+                    token: tok,
+                    tier: "elicitation",
+                    completed: stateAny.index,
+                    total: stateAny.set.asks.length,
+                },
+                _meta: {
+                    elicitkit: {
+                        token: tok,
+                        pending: true,
+                        completed: stateAny.index,
+                        total: stateAny.set.asks.length,
+                        ...extra,
+                    },
+                },
+            }),
+        };
+    }
+    // The ask is done — decode its accumulated responses into an Answer.
+    const answer = decodeAskAnswer(ask, stateAny.subResponses);
+    const counters = appendCollected(token, answer);
+    stateAny.subResponses = [];
+    if (counters.completed < counters.total) {
+        return {
+            ok: true,
+            result: (tok, extra) => ({
+                content: [
+                    {
+                        type: "text",
+                        text: JSON.stringify({ pending: true, token: tok, completed: counters.completed, total: counters.total }, null, 2),
+                    },
+                ],
+                structuredContent: {
+                    pending: true,
+                    token: tok,
+                    tier: "elicitation",
+                    completed: counters.completed,
+                    total: counters.total,
+                },
+                _meta: {
+                    elicitkit: {
+                        token: tok,
+                        pending: true,
+                        completed: counters.completed,
+                        total: counters.total,
+                        ...extra,
+                    },
+                },
+            }),
+        };
+    }
+    // Last ask — finalise the round.
+    const final = closeCollected(token);
+    if (!final.ok) {
+        return {
+            ok: false,
+            error: "Answers rejected — re-ask (SPEC.md §5):\n- " + final.errors.join("\n- "),
+        };
+    }
+    return {
+        ok: true,
+        result: (tok, extra) => ({
+            content: [{ type: "text", text: JSON.stringify(final.answers, null, 2) }],
+            structuredContent: {
+                pending: false,
+                token: tok,
+                tier: "elicitation",
+                answers: final.answers,
+            },
+            _meta: {
+                elicitkit: {
+                    token: tok,
+                    pending: false,
+                    inline: true,
+                    ...extra,
+                },
+            },
+        }),
+    };
+}
+//# sourceMappingURL=server.js.map

package/dist/server.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"server.js","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAEpE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,cAAc,EAAiD,MAAM,iBAAiB,CAAC;AAChG,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,eAAe,GAIhB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EACL,eAAe,EACf,cAAc,EACd,UAAU,EACV,SAAS,EACT,cAAc,GACf,MAAM,aAAa,CAAC;AAErB,MAAM,WAAW,GAAG,UAAwC,CAAC;AAgB7D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAA4B,EAAE;IAC/D,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC;QAC3B,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW;QAC9B,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,OAAO;KACjC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,MAAM,MAAM,GAAa,CAAC,MAAM,EAAE,EAAE,CAClC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC;QACxB,IAAI,EAAE,MAAM;QACZ,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,eAAe,EAAE,MAAM,CAAC,eAAe;KACW,CAAyB,CAAC;IAEhF,MAAM,CAAC,YAAY,CACjB,QAAQ,EACR;QACE,KAAK,EAAE,yBAAyB;QAChC,WAAW,EACT,mEAAmE;YACnE,4DAA4D;YAC5D,+DAA+D;YAC/D,+DAA+D;YAC/D,kEAAkE;YAClE,6DAA6D;YAC7D,6CAA6C;YAC7C,2DAA2D;QAC7D,WAAW,EAAE;YACX,MAAM,EAAE,CAAC;iBACN,OAAO,EAAE;iBACT,QAAQ,CAAC,uDAAuD,CAAC;YACpE,cAAc,EAAE,CAAC;iBACd,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;iBAC1B,QAAQ,EAAE;iBACV,QAAQ,CACP,kEAAkE;gBAChE,uDAAuD,CAC1D;SACJ;KACF,EACD,KAAK,EAAE,EAAE,MAAM,EAAE,cAAc,EAAE,EAA2B,EAAE;QAC5D,mEAAmE;QACnE,qDAAqD;QACrD,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC;gBACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9B,CAAC;YAAC,MAAM,CAAC;gBACP,gDAAgD;YAClD,CAAC;QACH,CAAC;QACD,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACV,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,OAAO,EAAE;oBACP;wBACE,IAAI,EAAE,MAAM;wBACZ,IAAI,EACF,2CAA2C;4BAC3C,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;qBACxB;iBACF;aACF,CAAC;QACJ,CAAC;QAED,MAAM,GAAG,GAAG,MAAgB,CAAC;QAE7B,qEAAqE;QACrE,mEAAmE;QACnE,qDAAqD;QACrD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC;QACnD,MAAM,iBAAiB,GAAG,CAAC,CAAC,IAAI,EAAE,WAAW,CAAC;QAC9C,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,YAAY,IAAI,EAAE,CAA4B,CAAC;QAClE,MAAM,OAAO,GACX,IAAI,CAAC,OAAO;YACX,OAAO,CAAC,GAAG,CAAC,kBAAkB,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAEjE,CAAC;QACjB,mEAAmE;QACnE,wDAAwD;QACxD,MAAM,IAAI,GACR,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/B,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,8BAA8B,CAAC,CAAC,CAAC;QAEvF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QACzC,IAAI,iBAAiB;YAAE,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QACpD,IAAI,IAAI,EAAE,CAAC;YACT,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtB,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QAED,oEAAoE;QACpE,oEAAoE;QACpE,mEAAmE;QACnE,gEAAgE;QAChE,gEAAgE;QAChE,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,MAAM;YAAE,UAAU,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAElD,oEAAoE;QACpE,kEAAkE;QAClE,gDAAgD;QAChD,IAAI,SAAS,GAAW,CAAC,GAAG,UAAU,CAAC,CAAC;QACxC,MAAM,SAAS,GAAG,cAAoC,CAAC;QACvD,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;YAC7B,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS,GAAG,QAAQ,CAAC;QAChD,CAAC;QACD,qEAAqE;QACrE,6CAA6C;QAC7C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS,GAAG,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,aAAa,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAE3D,MAAM,QAAQ,GAA4B;YACxC,YAAY,EAAE,IAAI;YAClB,cAAc,EAAE,UAAU;YAC1B,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,MAAM;gBACb,CAAC,CAAC,EAAE,yBAAyB,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE;gBAC/D,CAAC,CAAC,EAAE,CAAC;SACR,CAAC;QAEF,mEAAmE;QACnE,kEAAkE;QAClE,iEAAiE;QACjE,mEAAmE;QACnE,gBAAgB;QAChB,IAAI,IAAI,KAAK,aAAa,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;YACtD,MAAM,GAAG,GAAG,MAAM,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC9C,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;gBACZ,OAAO;oBACL,OAAO,EAAE,IAAI;oBACb,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;iBAC7C,CAAC;YACJ,CAAC;YACD,OAAO,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACrC,CAAC;QAED,uEAAuE;QACvE,qEAAqE;QACrE,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE;YAC3B,IAAI;YACJ,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,yBAAyB,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACrF,CAAC,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAEhD,MAAM,OAAO,GAA8B;YACzC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SACjC,CAAC;QACF,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC;YACX,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAkD,CAAC,CAAC;QACvE,CAAC;QAED,OAAO;YACL,OAAO;YACP,iBAAiB,EAAE;gBACjB,OAAO,EAAE,IAAI;gBACb,KAAK;gBACL,IAAI;gBACJ,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,MAAM;oBACnC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,GAAG,EAAE;oBACpC,CAAC,CAAC,EAAE,CAAC;aACR;YACD,KAAK,EAAE;gBACL,SAAS,EAAE;oBACT,KAAK;oBACL,OAAO,EAAE,IAAI;oBACb,GAAG,QAAQ;oBACX,YAAY,EAAE,GAAG,CAAC,IAAI;oBACtB,aAAa,EAAE,IAAI;oBACnB,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACtB;gBACD,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAChE;SACF,CAAC;IACJ,CAAC,CACF,CAAC;IAEF,MAAM,CAAC,YAAY,CACjB,aAAa,EACb;QACE,KAAK,EAAE,wCAAwC;QAC/C,WAAW,EACT,iEAAiE;YACjE,uDAAuD;YACvD,mEAAmE;YACnE,6DAA6D;YAC7D,wBAAwB;QAC1B,WAAW,EAAE;YACX,KAAK,EAAE,CAAC;iBACL,MAAM,EAAE;iBACR,QAAQ,CAAC,2DAA2D,CAAC;SACzE;KACF,EACD,KAAK,EAAE,EAAE,KAAK,EAAE,EAA2B,EAAE;QAC3C,MAAM,EAAE,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,0BAA0B,EAAE,CAAC;aAC9D,CAAC;QACJ,CAAC;QACD,IAAI,EAAE,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YAC9B,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,OAAO,EAAE;oBACP;wBACE,IAAI,EAAE,MAAM;wBACZ,IAAI,EACF,2BAA2B,EAAE,CAAC,IAAI,6BAA6B;qBAClE;iBACF;aACF,CAAC;QACJ,CAAC;QACD,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACnC,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,OAAO,EAAE;oBACP,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,sCAAsC,EAAE;iBAC/D;aACF,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YACZ,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;QACzE,CAAC;QACD,OAAO,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE;YACvB,YAAY,EAAE,aAAa;YAC3B,SAAS,EAAE,EAAE;SACd,CAAC,CAAC;IACL,CAAC,CACF,CAAC;IAEF,MAAM,CAAC,YAAY,CACjB,eAAe,EACf;QACE,KAAK,EAAE,yBAAyB;QAChC,WAAW,EACT,qEAAqE;YACrE,sEAAsE;YACtE,qEAAqE;YACrE,+BAA+B;QACjC,WAAW,EAAE;YACX,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+CAA+C,CAAC;YAC3E,OAAO,EAAE,CAAC;iBACP,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;iBAClB,QAAQ,CACP,sBAAsB;gBACpB,gEAAgE,CACnE;SACJ;KACF,EACD,KAAK,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAA2B,EAAE;QACpD,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACrC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACV,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,OAAO,EAAE;oBACP;wBACE,IAAI,EAAE,MAAM;wBACZ,IAAI,EACF,6CAA6C;4BAC7C,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;qBACxB;iBACF;aACF,CAAC;QACJ,CAAC;QACD,OAAO;YACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACrE,iBAAiB,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE;YACzD,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE;SAC1D,CAAC;IACJ,CAAC,CACF,CAAC;IAEF,MAAM,CAAC,YAAY,CACjB,eAAe,EACf;QACE,KAAK,EAAE,6CAA6C;QACpD,WAAW,EACT,iEAAiE;YACjE,yDAAyD;YACzD,gEAAgE;YAChE,mEAAmE;YACnE,iEAAiE;YACjE,qEAAqE;YACrE,wDAAwD;YACxD,kEAAkE;YAClE,qEAAqE;QACvE,WAAW,EAAE;YACX,MAAM,EAAE,CAAC;iBACN,OAAO,EAAE;iBACT,QAAQ,CAAC,uDAAuD,CAAC;SACrE;KACF,EACD,KAAK,EAAE,EAAE,MAAM,EAAE,EAA2B,EAAE;QAC5C,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC;gBACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9B,CAAC;YAAC,MAAM,CAAC;gBACP,gDAAgD;YAClD,CAAC;QACH,CAAC;QACD,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACV,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,OAAO,EAAE;oBACP,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,2CAA2C,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;iBAC5F;aACF,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,MAAgB,CAAC;QAC7B,iEAAiE;QACjE,mDAAmD;QACnD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/C,OAAO;YACL,OAAO,EAAE;gBACP;oBACE,IAAI,EAAE,MAAM;oBACZ,IAAI,EACF,4DAA4D;wBAC5D,8DAA8D;wBAC9D,0DAA0D;wBAC1D,6DAA6D;wBAC7D,kDAAkD;wBAClD,IAAI;iBACP;aACF;YACD,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;SACrE,CAAC;IACJ,CAAC,CACF,CAAC;IAEF,OAAO,MAAM,CAAC;AAChB,CAAC;AAkBD,KAAK,UAAU,YAAY,CAAC,KAAa,EAAE,MAAgB;IACzD,MAAM,EAAE,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACjC,IAAI,CAAC,EAAE;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,0BAA0B,EAAE,CAAC;IAEjE,MAAM,QAAQ,GAAG,EAKhB,CAAC;IACF,IAAI,CAAC,QAAQ,CAAC,YAAY;QAAE,QAAQ,CAAC,YAAY,GAAG,EAAE,CAAC;IAEvD,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC;IAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,sCAAsC,EAAE,CAAC;IACtE,CAAC;IAED,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAU,CAAC,CAAC;IAC9C,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC;IAC7C,MAAM,MAAM,GAA6B,MAAM,CAAC,OAAO,CAAC,CAAC;IACzD,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC;IACjE,CAAC;IAED,MAAM,CAAC,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/B,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE9B,sEAAsE;IACtE,sCAAsC;IACtC,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC;IAClE,MAAM,WAAW,GACf,YAAY,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,eAAe,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;IAE1E,IAAI,WAAW,EAAE,CAAC;QAChB,mEAAmE;QACnE,OAAO;YACL,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CACrB,CAAC;gBACC,OAAO,EAAE;oBACP;wBACE,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAClB,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,EACzF,IAAI,EACJ,CAAC,CACF;qBACF;iBACF;gBACD,iBAAiB,EAAE;oBACjB,OAAO,EAAE,IAAI;oBACb,KAAK,EAAE,GAAG;oBACV,IAAI,EAAE,aAAa;oBACnB,SAAS,EAAE,QAAQ,CAAC,KAAK;oBACzB,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM;iBAChC;gBACD,KAAK,EAAE;oBACL,SAAS,EAAE;wBACT,KAAK,EAAE,GAAG;wBACV,OAAO,EAAE,IAAI;wBACb,SAAS,EAAE,QAAQ,CAAC,KAAK;wBACzB,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM;wBAC/B,GAAG,KAAK;qBACT;iBACF;aACF,CAA0B;SAC9B,CAAC;IACJ,CAAC;IAED,qEAAqE;IACrE,MAAM,MAAM,GAAG,eAAe,CAAC,GAAU,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IAClE,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,EAAE,MAAM,CAAE,CAAC;IACjD,QAAQ,CAAC,YAAY,GAAG,EAAE,CAAC;IAE3B,IAAI,QAAQ,CAAC,SAAS,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;QACxC,OAAO;YACL,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CACrB,CAAC;gBACC,OAAO,EAAE;oBACP;wBACE,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAClB,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,EACnF,IAAI,EACJ,CAAC,CACF;qBACF;iBACF;gBACD,iBAAiB,EAAE;oBACjB,OAAO,EAAE,IAAI;oBACb,KAAK,EAAE,GAAG;oBACV,IAAI,EAAE,aAAa;oBACnB,SAAS,EAAE,QAAQ,CAAC,SAAS;oBAC7B,KAAK,EAAE,QAAQ,CAAC,KAAK;iBACtB;gBACD,KAAK,EAAE;oBACL,SAAS,EAAE;wBACT,KAAK,EAAE,GAAG;wBACV,OAAO,EAAE,IAAI;wBACb,SAAS,EAAE,QAAQ,CAAC,SAAS;wBAC7B,KAAK,EAAE,QAAQ,CAAC,KAAK;wBACrB,GAAG,KAAK;qBACT;iBACF;aACF,CAA0B;SAC9B,CAAC;IACJ,CAAC;IAED,iCAAiC;IACjC,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;QACd,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,6CAA6C,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;SACjF,CAAC;IACJ,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CACrB,CAAC;YACC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACzE,iBAAiB,EAAE;gBACjB,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,GAAG;gBACV,IAAI,EAAE,aAAa;gBACnB,OAAO,EAAE,KAAK,CAAC,OAAO;aACvB;YACD,KAAK,EAAE;gBACL,SAAS,EAAE;oBACT,KAAK,EAAE,GAAG;oBACV,OAAO,EAAE,KAAK;oBACd,MAAM,EAAE,IAAI;oBACZ,GAAG,KAAK;iBACT;aACF;SACF,CAA0B;KAC9B,CAAC;AACJ,CAAC"}

package/dist/submit.d.ts

@@ -0,0 +1,57 @@
+import { type Answer, type AskSet, type Tier } from "@elicitkit/core";
+/**
+ * In-memory store of pending AskSets, keyed by an opaque token handed to the
+ * UI. The token scopes a submission to exactly one elicitation round. A real
+ * deployment would back this with the security envelope (Task #7); for the
+ * v0.1 reference impl an in-process map is sufficient and honest. Answer
+ * validation itself lives in @elicitkit/core (shared with the HTTP surface).
+ *
+ * Rounds carry tier metadata + (for the elicitation tier) the per-ask
+ * progress so a `elicit` → `elicit_next` … sequence resolves one ask per
+ * tool call. Panel tiers (tui/url/apps) still complete in a single
+ * `elicit_submit` call; the multi-step state is only consulted by the
+ * elicitation path.
+ */
+export interface RoundState {
+    set: AskSet;
+    tier: Tier;
+    /** Index of the NEXT ask to issue an elicitInput for. */
+    index: number;
+    /** Answers collected so far (elicitation-tier multi-step path). */
+    collected: Answer[];
+    /** When set, the round was routed away from elicitation; reason is
+     *  exposed in `_meta.elicitkit.routedAwayFromElicitation` so the
+     *  decision is debuggable + testable. */
+    routedAwayFromElicitation?: {
+        reason: string;
+    };
+}
+export interface OpenRoundOpts {
+    tier?: Tier;
+    routedAwayFromElicitation?: {
+        reason: string;
+    };
+}
+export declare function openRound(set: AskSet, opts?: OpenRoundOpts): string;
+export declare function peekRound(token: string): AskSet | undefined;
+export declare function peekRoundState(token: string): RoundState | undefined;
+/** Append one answer to the elicitation-tier round and advance the cursor.
+ *  Returns the updated counters so the server can decide whether to
+ *  return `pending:true` (more asks) or the final `pending:false`. */
+export declare function appendCollected(token: string, answer: Answer): {
+    completed: number;
+    total: number;
+} | undefined;
+/** Validate the collected answers as a batch (same path as elicit_submit)
+ *  and discard the round. Used at the end of the elicitation-tier
+ *  multi-step loop. */
+export declare function closeCollected(token: string): SubmitResult;
+export interface SubmitResult {
+    ok: boolean;
+    answers: Answer[];
+    errors: string[];
+}
+/** Validate raw answers against the pending AskSet for `token`. The
+ *  panel-tier submission path (tui/url/apps). */
+export declare function closeRound(token: string, raw: unknown): SubmitResult;
+//# sourceMappingURL=submit.d.ts.map

package/dist/submit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"submit.d.ts","sourceRoot":"","sources":["../src/submit.ts"],"names":[],"mappings":"AACA,OAAO,EAAmB,KAAK,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAEvF;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,IAAI,CAAC;IACX,yDAAyD;IACzD,KAAK,EAAE,MAAM,CAAC;IACd,mEAAmE;IACnE,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB;;6CAEyC;IACzC,yBAAyB,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CAChD;AAID,MAAM,WAAW,aAAa;IAC5B,IAAI,CAAC,EAAE,IAAI,CAAC;IACZ,yBAAyB,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CAChD;AAED,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,GAAE,aAAkB,GAAG,MAAM,CAYvE;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAE3D;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,CAEpE;AAED;;sEAEsE;AACtE,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAAG,SAAS,CAM/G;AAED;;uBAEuB;AACvB,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,CAQ1D;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;iDACiD;AACjD,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,GAAG,YAAY,CAQpE"}

package/dist/submit.js

@@ -0,0 +1,59 @@
+import { randomUUID } from "node:crypto";
+import { validateAnswers } from "@elicitkit/core";
+const pending = new Map();
+export function openRound(set, opts = {}) {
+    const token = randomUUID();
+    pending.set(token, {
+        set,
+        tier: opts.tier ?? "tui",
+        index: 0,
+        collected: [],
+        ...(opts.routedAwayFromElicitation
+            ? { routedAwayFromElicitation: opts.routedAwayFromElicitation }
+            : {}),
+    });
+    return token;
+}
+export function peekRound(token) {
+    return pending.get(token)?.set;
+}
+export function peekRoundState(token) {
+    return pending.get(token);
+}
+/** Append one answer to the elicitation-tier round and advance the cursor.
+ *  Returns the updated counters so the server can decide whether to
+ *  return `pending:true` (more asks) or the final `pending:false`. */
+export function appendCollected(token, answer) {
+    const st = pending.get(token);
+    if (!st)
+        return undefined;
+    st.collected.push(answer);
+    st.index += 1;
+    return { completed: st.collected.length, total: st.set.asks.length };
+}
+/** Validate the collected answers as a batch (same path as elicit_submit)
+ *  and discard the round. Used at the end of the elicitation-tier
+ *  multi-step loop. */
+export function closeCollected(token) {
+    const st = pending.get(token);
+    if (!st) {
+        return { ok: false, answers: [], errors: ["unknown or expired token"] };
+    }
+    const r = validateAnswers(st.set, st.collected);
+    if (r.ok)
+        pending.delete(token);
+    return r;
+}
+/** Validate raw answers against the pending AskSet for `token`. The
+ *  panel-tier submission path (tui/url/apps). */
+export function closeRound(token, raw) {
+    const st = pending.get(token);
+    if (!st) {
+        return { ok: false, answers: [], errors: ["unknown or expired token"] };
+    }
+    const r = validateAnswers(st.set, raw);
+    if (r.ok)
+        pending.delete(token);
+    return r;
+}
+//# sourceMappingURL=submit.js.map

package/dist/submit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"submit.js","sourceRoot":"","sources":["../src/submit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,eAAe,EAAuC,MAAM,iBAAiB,CAAC;AA4BvF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;AAO9C,MAAM,UAAU,SAAS,CAAC,GAAW,EAAE,OAAsB,EAAE;IAC7D,MAAM,KAAK,GAAG,UAAU,EAAE,CAAC;IAC3B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE;QACjB,GAAG;QACH,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,KAAK;QACxB,KAAK,EAAE,CAAC;QACR,SAAS,EAAE,EAAE;QACb,GAAG,CAAC,IAAI,CAAC,yBAAyB;YAChC,CAAC,CAAC,EAAE,yBAAyB,EAAE,IAAI,CAAC,yBAAyB,EAAE;YAC/D,CAAC,CAAC,EAAE,CAAC;KACR,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED;;sEAEsE;AACtE,MAAM,UAAU,eAAe,CAAC,KAAa,EAAE,MAAc;IAC3D,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,CAAC,EAAE;QAAE,OAAO,SAAS,CAAC;IAC1B,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1B,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC;IACd,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;AACvE,CAAC;AAED;;uBAEuB;AACvB,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,0BAA0B,CAAC,EAAE,CAAC;IAC1E,CAAC;IACD,MAAM,CAAC,GAAG,eAAe,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;IAChD,IAAI,CAAC,CAAC,EAAE;QAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAChC,OAAO,CAAC,CAAC;AACX,CAAC;AAQD;iDACiD;AACjD,MAAM,UAAU,UAAU,CAAC,KAAa,EAAE,GAAY;IACpD,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,0BAA0B,CAAC,EAAE,CAAC;IAC1E,CAAC;IACD,MAAM,CAAC,GAAG,eAAe,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACvC,IAAI,CAAC,CAAC,EAAE;QAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAChC,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/tiers.d.ts

@@ -0,0 +1,42 @@
+import type { AskSet, Tier } from "@elicitkit/core";
+/** Richest → poorest. The spec's normative ordering (SPEC.md §4). */
+export declare const TIER_ORDER: readonly Tier[];
+/**
+ * The poorest `minTier` across all asks in the set bounds how rich a tier the
+ * whole panel may use — every ask must still be faithful at the chosen tier.
+ * An ask with `minTier: "url"` cannot degrade below `url`; the set inherits
+ * that floor. Default floor is `tui` (the universal sink — never hard-fails).
+ */
+export declare function setFloor(set: AskSet): Tier;
+export interface TierChoice {
+    tier: Tier;
+    /** True when the host advertised tiers and the floor still fit. */
+    negotiated: boolean;
+}
+/**
+ * Pick the richest tier the host supports that is still ≥ the set's floor
+ * (SPEC.md §4). If the host advertises nothing, assume `tui` — the one tier
+ * every client can render and the spec guarantees never hard-fails.
+ */
+export declare function negotiateTier(set: AskSet, hostSupported: readonly Tier[] | undefined): TierChoice;
+/**
+ * Slow-ask auto-router. The elicitation tier is one-question-at-a-time
+ * over a per-tool-call MCP timeout — fine for quick asks (ask_confirm, a
+ * short ask_select, a number) but cliff-edge for any ask that needs
+ * actual thought time (a multiline essay, a many-hunk code diff, a long
+ * ranking). For those, a panel tier (apps/url) — or, failing those, tui
+ * with a single round-trip — keeps the call bounded while letting the
+ * user take as long as they want.
+ *
+ * The router is conservative: a single slow-likely ask in the set is
+ * enough to drop elicitation from the candidate tier list. The host's
+ * other tiers (apps/url/tui) still negotiate normally. If elicitation
+ * was the only tier the host offered, the safe sink ("tui") still wins
+ * because the spec guarantees every type renders there.
+ */
+export interface SlowAskDecision {
+    routed: boolean;
+    reason?: string;
+}
+export declare function slowAskRoute(set: AskSet): SlowAskDecision;
+//# sourceMappingURL=tiers.d.ts.map

package/dist/tiers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiers.d.ts","sourceRoot":"","sources":["../src/tiers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAO,MAAM,EAAE,IAAI,EAAiC,MAAM,iBAAiB,CAAC;AAExF,qEAAqE;AACrE,eAAO,MAAM,UAAU,EAAE,SAAS,IAAI,EAA0C,CAAC;AASjF;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAO1C;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,IAAI,CAAC;IACX,mEAAmE;IACnE,UAAU,EAAE,OAAO,CAAC;CACrB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,GAAG,EAAE,MAAM,EACX,aAAa,EAAE,SAAS,IAAI,EAAE,GAAG,SAAS,GACzC,UAAU,CAmBZ;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,eAAe,CAMzD"}

package/dist/tiers.js

@@ -0,0 +1,91 @@
+/** Richest → poorest. The spec's normative ordering (SPEC.md §4). */
+export const TIER_ORDER = ["apps", "url", "elicitation", "tui"];
+const RANK = { apps: 0, url: 1, elicitation: 2, tui: 3 };
+/** A higher rank number = poorer tier. `a` is at least as rich as `b`. */
+function atLeastAsRich(a, b) {
+    return RANK[a] <= RANK[b];
+}
+/**
+ * The poorest `minTier` across all asks in the set bounds how rich a tier the
+ * whole panel may use — every ask must still be faithful at the chosen tier.
+ * An ask with `minTier: "url"` cannot degrade below `url`; the set inherits
+ * that floor. Default floor is `tui` (the universal sink — never hard-fails).
+ */
+export function setFloor(set) {
+    let floor = "tui";
+    for (const ask of set.asks) {
+        const m = ask.meta?.minTier;
+        if (m && atLeastAsRich(m, floor) === false)
+            floor = m;
+    }
+    return floor;
+}
+/**
+ * Pick the richest tier the host supports that is still ≥ the set's floor
+ * (SPEC.md §4). If the host advertises nothing, assume `tui` — the one tier
+ * every client can render and the spec guarantees never hard-fails.
+ */
+export function negotiateTier(set, hostSupported) {
+    const floor = setFloor(set);
+    if (!hostSupported || hostSupported.length === 0) {
+        // No capabilities advertised: the safe universal sink.
+        return { tier: "tui", negotiated: false };
+    }
+    const supported = new Set(hostSupported);
+    for (const tier of TIER_ORDER) {
+        // richest → poorest: first supported tier that is still ≥ the floor
+        if (supported.has(tier) && atLeastAsRich(tier, floor)) {
+            return { tier, negotiated: true };
+        }
+    }
+    // Host supports nothing at or above the floor — fall back to tui, which
+    // the spec defines for every type so the panel still renders.
+    return { tier: "tui", negotiated: false };
+}
+export function slowAskRoute(set) {
+    for (const ask of set.asks) {
+        const r = isSlowAsk(ask);
+        if (r)
+            return { routed: true, reason: r };
+    }
+    return { routed: false };
+}
+function isSlowAsk(ask) {
+    switch (ask.type) {
+        case "ask_text": {
+            const s = ask.spec ?? {};
+            if (s.multiline === true)
+                return "ask_text.multiline";
+            // No bound = free-form; we treat unset as "could be long". 200 chars
+            // is roughly the limit at which typing time exceeds typical per-call
+            // MCP timeouts on a slow human.
+            if (typeof s.maxLen === "number") {
+                if (s.maxLen >= 200)
+                    return "ask_text.maxLen>=200";
+            }
+            else {
+                return "ask_text.maxLen-unset";
+            }
+            return null;
+        }
+        case "ask_code_diff": {
+            const files = ask.spec.files ?? [];
+            const hunks = files.reduce((n, f) => n + (f.hunks?.length ?? 0), 0);
+            if (hunks > 2)
+                return "ask_code_diff.hunks>2";
+            return null;
+        }
+        case "ask_rank": {
+            const items = ask.spec.items ?? [];
+            if (items.length > 4)
+                return "ask_rank.items>4";
+            return null;
+        }
+        // Reserved hooks for v0.1 (ask_form / ask_table land later):
+        // the names are listed in the SPEC additive so a forward-compatible
+        // implementation could plug them in here without a major bump.
+        default:
+            return null;
+    }
+}
+//# sourceMappingURL=tiers.js.map

package/dist/tiers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiers.js","sourceRoot":"","sources":["../src/tiers.ts"],"names":[],"mappings":"AAEA,qEAAqE;AACrE,MAAM,CAAC,MAAM,UAAU,GAAoB,CAAC,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;AAEjF,MAAM,IAAI,GAAyB,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAE/E,0EAA0E;AAC1E,SAAS,aAAa,CAAC,CAAO,EAAE,CAAO;IACrC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAW;IAClC,IAAI,KAAK,GAAS,KAAK,CAAC;IACxB,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAI,GAAW,CAAC,IAAI,EAAE,OAAO,CAAC;QACrC,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,KAAK;YAAE,KAAK,GAAG,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAQD;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAC3B,GAAW,EACX,aAA0C;IAE1C,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAE5B,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjD,uDAAuD;QACvD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC5C,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,oEAAoE;QACpE,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACtD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QACpC,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,8DAA8D;IAC9D,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AAC5C,CAAC;AAsBD,MAAM,UAAU,YAAY,CAAC,GAAW;IACtC,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC5C,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED,SAAS,SAAS,CAAC,GAAQ;IACzB,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAI,GAAe,CAAC,IAAI,IAAI,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,SAAS,KAAK,IAAI;gBAAE,OAAO,oBAAoB,CAAC;YACtD,qEAAqE;YACrE,qEAAqE;YACrE,gCAAgC;YAChC,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACjC,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG;oBAAE,OAAO,sBAAsB,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACN,OAAO,uBAAuB,CAAC;YACjC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,MAAM,KAAK,GAAI,GAAmB,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACpD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpE,IAAI,KAAK,GAAG,CAAC;gBAAE,OAAO,uBAAuB,CAAC;YAC9C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,KAAK,GAAI,GAAe,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YAChD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,kBAAkB,CAAC;YAChD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,6DAA6D;QAC7D,oEAAoE;QACpE,+DAA+D;QAC/D;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC"}

package/package.json

@@ -0,0 +1,34 @@
+{
+  "name": "@elicitkit/server",
+  "version": "0.1.0",
+  "description": "Elicitkit MCP reference implementation — serves the question catalog over MCP with progressive 4-tier rendering on @mcp-ui/server.",
+  "license": "Apache-2.0",
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "bin": {
+    "elicitkit-server": "dist/bin.js"
+  },
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "test": "tsc -p tsconfig.json && node test/smoke.mjs"
+  },
+  "dependencies": {
+    "@elicitkit/core": "workspace:*",
+    "@elicitkit/renderers": "workspace:*",
+    "@modelcontextprotocol/sdk": "^1.29.0",
+    "zod": "^3.25.1"
+  },
+  "publishConfig": {
+    "access": "public"
+  }
+}