@joystyk/content 0.0.0-stage → 0.2.0

package/CHANGELOG.md

@@ -0,0 +1,24 @@
+# @joystyk/content
+
+## 0.2.0
+
+### Patch Changes
+
+- Updated dependencies [bb095c7]
+- Updated dependencies [bb095c7]
+  - @joystyk/contracts@0.2.0
+  - @joystyk/daily@0.2.0
+  - @joystyk/kit@0.2.0
+
+## 0.1.0
+
+### Minor Changes
+
+- Prepare the first compiled library release: ESM and API declarations for every public entry point, runtime assets, and checks against installed npm tarballs. Games and applications remain private.
+
+### Patch Changes
+
+- Updated dependencies
+  - @joystyk/contracts@0.1.0
+  - @joystyk/kit@0.1.0
+  - @joystyk/daily@0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Joystyk contributors
+
+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/NOTICE

@@ -0,0 +1,36 @@
+Third-party material in the Joystyk library release
+
+This notice preserves third-party attribution. Original Joystyk code in the 17
+platform libraries under packages/ uses the MIT license in packages/LICENSE.
+That choice does not license the private applications, games or other repository
+material, and does not replace the third-party terms below.
+
+@joystyk/contracts
+------------------
+Standard Schema v1 type definitions from @standard-schema/spec 1.1.0:
+https://github.com/standard-schema/standard-schema
+https://standardschema.dev
+Copyright (c) 2024 Colin McDonnell. MIT License.
+The complete license and source/change notes accompany the distributed
+dist/standard-schema.d.ts definitions. Changes: individually exported declarations
+and formatting; the declarations themselves are unchanged.
+
+@joystyk/identity and @joystyk/content
+-----------------------------------
+Word blocklists derived from List of Dirty, Naughty, Obscene, and Otherwise Bad
+Words, copyright Shutterstock, Inc. and contributors:
+https://github.com/LDNOOBW/List-of-Dirty-Naughty-Obscene-and-Otherwise-Bad-Words
+Licensed under Creative Commons Attribution 4.0 International:
+https://creativecommons.org/licenses/by/4.0/
+Identity uses the English list at commit
+5faf2ba42d7b1c0977169ec3611df25a3c08eb13. Changes include reducing or dropping
+phrases, dropping words with everyday meanings, substituting stems for inflections
+and adding entries. Identity's README and content's lists/blocklist.txt retain
+their source-specific provenance and changes.
+
+@joystyk/content
+---------------
+SCOWL-derived common, vocabulary and ranked word lists use SCOWL 2020.12.07.
+Their complete source licenses and attribution accompany the package in
+lists/SCOWL-COPYRIGHT. Word-list transformations and build provenance are described
+in the package README. Preserve that copyright file when redistributing the lists.

package/README.md

@@ -1,3 +1,114 @@
-# Temporary Holding Version
+# @joystyk/content
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+The AI content pipeline, server only. It asks a model for the language parts of a daily
+puzzle, checks every reply, and publishes the files the `daily` package's client downloads.
+Nothing here runs in a browser. The design is
+content-pipeline.md (Joystyk host reference); its *Implemented* section
+lists where the build departs from it. Games plug in a generator from their `content/`
+folder; apps/content (Joystyk host reference) runs the pipeline on a schedule.
+
+## npm package
+
+The first `0.1.0` release is being prepared; it has not been published. Once available:
+
+```sh
+npm install @joystyk/content
+```
+
+Requires Node 24.15 or later. This package runs on the server.
+
+| Import | Format |
+| --- | --- |
+| `@joystyk/content` | ES module and TypeScript declarations |
+
+Only the entries listed above are public API. Installed packages contain compiled ESM,
+type declarations and runtime assets. Repository-relative links describe the Joystyk
+workspace and are not needed to use the npm package.
+
+## The run
+
+```text
+schedule ─▶ generate ─▶ schema ─▶ game validators ─▶ blocklist + sensitive list ─▶ model screen ─▶ validated ─▶ publish
+               ▲                                                                                       │
+               └──────── up to 3 attempts per item per run; each retry hears what was wrong ───────────┘
+                         past the deadline (48 h before release) and still failing: a bank item
+```
+
+```ts
+import { createModelClient, createPublisher, defaultFilter, openStore, runPipeline } from '@joystyk/content';
+
+const report = await runPipeline({
+  store: openStore('/data/content.db'),
+  generators: [wordOfTheDayGenerator()],
+  model: createModelClient({ baseUrl: process.env.CONTENT_MODEL_ORIGIN, key, model }),
+  filter: defaultFilter(),
+  publisher: createPublisher('/daily'),   // null for a dry run
+  daysAhead: 1,                           // today and tomorrow
+});
+```
+
+- **Idempotent.** A slot already validated or published is left alone; a run cut short (a
+  `signal`) leaves its slot `scheduled`, and the next run resumes it.
+- **Deterministic inputs.** A generator's `schedule` picks the slot's inputs (Word of the
+  Day's word, the answers' positions) from the date and the answers already used, so a rerun
+  asks for the same thing.
+- **Answer history.** A generator can set `historyDays` when its avoidance rules require
+  more than the default 365 days. Scheduling, validation and fallback selection receive
+  that window on either side of the slot, including withdrawn answers. Honeycomb requests
+  five years for its full-hive words.
+- **Circuit breaker.** Five endpoint errors in a row end generation for the run; banks cover
+  the slots past their deadline.
+- **Takedowns.** `withdrawItem` marks an item withdrawn with a reason code and actor, drops it
+  from the index at once, and leaves the slot for the next run. The withdrawn answer counts as
+  used, so the replacement differs. The old file stays for games already started on it.
+- **A game's own checks in the report.** `generate` receives `record(name, detail)`; what a
+  game records lands in that attempt's report as `checks[name]`, whether the attempt passes
+  or fails, and so in the item's provenance. Crossword records each variant's grids,
+  rewrites and fact-check verdicts this way.
+
+## Modules
+
+| Module | Contents |
+| --- | --- |
+| `model.ts` | `createModelClient`: an OpenAI-compatible chat completions client on plain `fetch`, with a Bearer key. `complete({ name, schema, messages })` sends `z.toJSONSchema(schema)` as the `json_schema` response format, finds the JSON in the reply (reasoning blocks, prose and code fences are tolerated), and decodes it through the schema's Standard Schema interface. Timeouts, network errors, 408, 429 and 5xx retry with exponential backoff and `Retry-After`. A base URL works with or without `/v1`. If the endpoint refuses `response_format`, the schema goes into the prompt instead. Errors carry a kind and a safe message: never the key, the address or the reply text. |
+| `pipeline.ts` | `runPipeline`, `rebuildIndex`, `withdrawItem`, and the `DailyGenerator` interface a game implements. |
+| `packs.ts` | The non-daily item type: `runPackPipeline`, `rebuildPackIndex`, `withdrawPack`, `createPackPublisher` and the `PackGenerator` interface, for content keyed by a curated slot such as a theme (Letter Drop's word packs and Word Flux's catalogs). Same checks as a daily item; files go to `<dir>/<game>/packs/`. |
+| `store.ts` | `openStore`: `content.db` on `node:sqlite` (WAL). Items with status, provenance (`source`, model, prompt version, seed, every attempt's report), runs, an event log, and the overlap lock (`tryLock`, `releaseLock`). Schema migrations by `user_version`; a database from a newer build is refused. |
+| `publish.ts` | `createPublisher`: `<dir>/<game>/<date>.<hash>.json` and `<dir>/<game>/index.json` in the `daily` package's formats, written atomically. |
+| `hash.ts` | `contentHash`: the first 12 hex digits of SHA-256 over the `daily` package's `canonicalJson`, the same digest the browser checks. |
+| `filter.ts` | The all-ages word lists: whole-word matching in regular plural and verb forms, `*` stems, phrases, and every straight line of a letter grid. |
+| `screen.ts` | The model screen, filter layer 3: `{ safe, reasons }`. It can only add a rejection. |
+| `vocabulary.ts` | `scowlVocabulary()`: `isCommon` (SCOWL ≤ 50 plus `common-extra.txt`) and `isKnown` (SCOWL ≤ 70). |
+| `ranked.ts` | `rankedWords()`: each word of `scowl-ranked.txt` with its SCOWL size; `scoreOfSize` turns a size into the crossword score (size 10 scores 100, size 60 scores 40). |
+| `text.ts` | Tokens, a word's regular forms, stems, and the leak checks (`mentions`, `leaksLetters`). |
+| `log.ts` | JSON-lines logger that redacts configured secrets (the key, the endpoint's origin and host) from every line. |
+
+## Word lists
+
+`lists/` holds data with licenses (content-pipeline.md, *Word lists and licensing*):
+
+| File | What | Source |
+| --- | --- | --- |
+| `scowl-common.txt`, `scowl-vocabulary.txt` | Words at SCOWL sizes 10–50, and 55–70 | SCOWL 2020.12.07, built by `node lists/build-lists.ts` from the pinned, checksummed release. Keep `SCOWL-COPYRIGHT` with them. Protected game names are left out. |
+| `scowl-ranked.txt` | Lowercase words of 3 to 12 letters at SCOWL sizes 10–60, each with its smallest size level; no names, abbreviations or contractions | The same release, built by `node lists/build-ranked.ts` (`pnpm --filter @joystyk/content build-ranked`). Grid games build answers from it (`rankedWords`, `scoreOfSize`). |
+| `common-extra.txt` | Everyday words SCOWL 2020 lacks ("app", "coder") | Original, hand-reviewed; keep it short |
+| `blocklist.txt` | Profanity, slurs, sexual, drug and graphic-violence terms | Curated from LDNOOBW (CC BY 4.0), plus original additions; see its header |
+| `sensitive.txt` | Topics wrong for a children's daily puzzle | Original |
+
+Rebuild the SCOWL lists with `pnpm --filter @joystyk/content build-lists`; never edit them by hand.
+
+Two games keep generated copies of `blocklist.txt`: Hangman's engine blocklist and Daily Word's
+accepted guesses. After editing the blocklist, rebuild them with
+`node games/hangman/src/content/build-blocklist.ts` and
+`node games/daily-word/src/content/build-words.ts`; their unit tests fail until you do.
+
+## Tests
+
+`src/*.test.ts` (Node), all against fakes; no test calls a real model. The model client against
+a scripted `fetch` (URLs, headers, the schema, fences and reasoning, malformed JSON, schema
+violations, truncation, retries and backoff, timeouts, aborts, the format fallback, no
+secrets in errors); the pipeline with a toy game and a fake model (success, idempotent
+reruns, each failure kind ending in a bank item, the screen, the circuit breaker, deadlines,
+the publishing horizon, shutdown and resume, takedowns, dry runs); the store and its lock
+across two connections; the hash against Web Crypto; the word lists. The live check against
+the real endpoint is `pnpm validate:content-live` (apps/content (Joystyk host reference)).

package/dist/banks.d.ts

@@ -0,0 +1,14 @@
+import type { Json } from '@joystyk/contracts';
+import type { DailyGenerator } from './pipeline.js';
+import type { PackGenerator } from './packs.js';
+import type { BankChange, ContentStore } from './store.js';
+export interface BankEntry {
+    readonly key: string;
+    readonly config: Json;
+    readonly retired: boolean;
+    readonly custom: boolean;
+}
+/** Stable keys keep retirement and edits attached to the original item, never its array rank. */
+export declare function dailyBankEntries(generator: DailyGenerator, changes: readonly BankChange[], puzzleId: string): BankEntry[];
+export declare function withDailyBank(store: ContentStore, generator: DailyGenerator): DailyGenerator;
+export declare function withPackBank(store: ContentStore, generator: PackGenerator): PackGenerator;

package/dist/banks.js

@@ -0,0 +1,55 @@
+//#region src/banks.ts
+var dated = (config, puzzleId) => typeof config === "object" && config !== null && !Array.isArray(config) && "puzzleId" in config ? {
+	...config,
+	puzzleId
+} : config;
+/** Stable keys keep retirement and edits attached to the original item, never its array rank. */
+function dailyBankEntries(generator, changes, puzzleId) {
+	const byKey = new Map(changes.map((change) => [change.key, change]));
+	return [...Array.from({ length: generator.bank.size }, (_, index) => {
+		const key = `base:${index}`;
+		const change = byKey.get(key);
+		return {
+			key,
+			config: dated(change?.config ?? generator.bank.config(index, puzzleId), puzzleId),
+			retired: change?.retired ?? false,
+			custom: false
+		};
+	}), ...changes.filter((change) => change.key.startsWith("staff:") && change.config !== null).map((change) => ({
+		key: change.key,
+		config: dated(change.config, puzzleId),
+		retired: change.retired,
+		custom: true
+	}))];
+}
+function withDailyBank(store, generator) {
+	const changes = store.bankChanges(generator.gameId);
+	if (changes.length === 0) return generator;
+	const byKey = new Map(changes.map((change) => [change.key, change]));
+	const keys = [...Array.from({ length: generator.bank.size }, (_, index) => `base:${index}`).filter((key) => byKey.get(key)?.retired !== true), ...changes.filter((change) => change.key.startsWith("staff:") && !change.retired && change.config !== null).map((change) => change.key)];
+	return {
+		...generator,
+		bank: {
+			size: keys.length,
+			config: (index, puzzleId) => {
+				const key = keys[index];
+				const replacement = byKey.get(key)?.config;
+				return replacement === void 0 || replacement === null ? generator.bank.config(Number(key.slice(5)), puzzleId) : dated(replacement, puzzleId);
+			}
+		}
+	};
+}
+function withPackBank(store, generator) {
+	const changes = new Map(store.bankChanges(generator.gameId).map((change) => [change.key, change]));
+	return {
+		...generator,
+		bank: (slot, itemId) => {
+			const change = changes.get(`pack:${slot.slug}`);
+			return change?.retired === true ? null : change?.config ?? generator.bank(slot, itemId);
+		}
+	};
+}
+//#endregion
+export { dailyBankEntries, withDailyBank, withPackBank };
+
+//# sourceMappingURL=banks.js.map

package/dist/banks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"banks.js","names":[],"sources":["../src/banks.ts"],"sourcesContent":["import type { Json } from '@joystyk/contracts';\nimport type { DailyGenerator } from './pipeline.ts';\nimport type { PackGenerator } from './packs.ts';\nimport type { BankChange, ContentStore } from './store.ts';\n\nexport interface BankEntry {\n  readonly key: string;\n  readonly config: Json;\n  readonly retired: boolean;\n  readonly custom: boolean;\n}\nconst dated = (config: Json, puzzleId: string): Json =>\n  typeof config === 'object' && config !== null && !Array.isArray(config) && 'puzzleId' in config\n    ? { ...config, puzzleId }\n    : config;\n\n/** Stable keys keep retirement and edits attached to the original item, never its array rank. */\nexport function dailyBankEntries(\n  generator: DailyGenerator,\n  changes: readonly BankChange[],\n  puzzleId: string,\n): BankEntry[] {\n  const byKey = new Map(changes.map((change) => [change.key, change]));\n  return [\n    ...Array.from({ length: generator.bank.size }, (_, index) => {\n      const key = `base:${index}`;\n      const change = byKey.get(key);\n      return {\n        key,\n        config: dated(change?.config ?? generator.bank.config(index, puzzleId), puzzleId),\n        retired: change?.retired ?? false,\n        custom: false,\n      };\n    }),\n    ...changes\n      .filter((change) => change.key.startsWith('staff:') && change.config !== null)\n      .map((change) => ({\n        key: change.key,\n        config: dated(change.config!, puzzleId),\n        retired: change.retired,\n        custom: true,\n      })),\n  ];\n}\n\nexport function withDailyBank(store: ContentStore, generator: DailyGenerator): DailyGenerator {\n  const changes = store.bankChanges(generator.gameId);\n  if (changes.length === 0) return generator;\n  const byKey = new Map(changes.map((change) => [change.key, change]));\n  const keys = [\n    ...Array.from({ length: generator.bank.size }, (_, index) => `base:${index}`).filter(\n      (key) => byKey.get(key)?.retired !== true,\n    ),\n    ...changes\n      .filter((change) => change.key.startsWith('staff:') && !change.retired && change.config !== null)\n      .map((change) => change.key),\n  ];\n  return {\n    ...generator,\n    bank: {\n      size: keys.length,\n      config: (index, puzzleId) => {\n        const key = keys[index]!;\n        const replacement = byKey.get(key)?.config;\n        return replacement === undefined || replacement === null\n          ? generator.bank.config(Number(key.slice(5)), puzzleId)\n          : dated(replacement, puzzleId);\n      },\n    },\n  };\n}\n\nexport function withPackBank(store: ContentStore, generator: PackGenerator): PackGenerator {\n  const changes = new Map(store.bankChanges(generator.gameId).map((change) => [change.key, change]));\n  return {\n    ...generator,\n    bank: (slot, itemId) => {\n      const change = changes.get(`pack:${slot.slug}`);\n      return change?.retired === true ? null : (change?.config ?? generator.bank(slot, itemId));\n    },\n  };\n}\n"],"mappings":";AAWA,IAAM,SAAS,QAAc,aAC3B,OAAO,WAAW,YAAY,WAAW,QAAQ,CAAC,MAAM,QAAQ,MAAM,KAAK,cAAc,SACrF;CAAE,GAAG;CAAQ;AAAS,IACtB;;AAGN,SAAgB,iBACd,WACA,SACA,UACa;CACb,MAAM,QAAQ,IAAI,IAAI,QAAQ,KAAK,WAAW,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;CACnE,OAAO,CACL,GAAG,MAAM,KAAK,EAAE,QAAQ,UAAU,KAAK,KAAK,IAAI,GAAG,UAAU;EAC3D,MAAM,MAAM,QAAQ;EACpB,MAAM,SAAS,MAAM,IAAI,GAAG;EAC5B,OAAO;GACL;GACA,QAAQ,MAAM,QAAQ,UAAU,UAAU,KAAK,OAAO,OAAO,QAAQ,GAAG,QAAQ;GAChF,SAAS,QAAQ,WAAW;GAC5B,QAAQ;EACV;CACF,CAAC,GACD,GAAG,QACA,QAAQ,WAAW,OAAO,IAAI,WAAW,QAAQ,KAAK,OAAO,WAAW,IAAI,CAAC,CAC7E,KAAK,YAAY;EAChB,KAAK,OAAO;EACZ,QAAQ,MAAM,OAAO,QAAS,QAAQ;EACtC,SAAS,OAAO;EAChB,QAAQ;CACV,EAAE,CACN;AACF;AAEA,SAAgB,cAAc,OAAqB,WAA2C;CAC5F,MAAM,UAAU,MAAM,YAAY,UAAU,MAAM;CAClD,IAAI,QAAQ,WAAW,GAAG,OAAO;CACjC,MAAM,QAAQ,IAAI,IAAI,QAAQ,KAAK,WAAW,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;CACnE,MAAM,OAAO,CACX,GAAG,MAAM,KAAK,EAAE,QAAQ,UAAU,KAAK,KAAK,IAAI,GAAG,UAAU,QAAQ,OAAO,CAAC,CAAC,QAC3E,QAAQ,MAAM,IAAI,GAAG,CAAC,EAAE,YAAY,IACvC,GACA,GAAG,QACA,QAAQ,WAAW,OAAO,IAAI,WAAW,QAAQ,KAAK,CAAC,OAAO,WAAW,OAAO,WAAW,IAAI,CAAC,CAChG,KAAK,WAAW,OAAO,GAAG,CAC/B;CACA,OAAO;EACL,GAAG;EACH,MAAM;GACJ,MAAM,KAAK;GACX,SAAS,OAAO,aAAa;IAC3B,MAAM,MAAM,KAAK;IACjB,MAAM,cAAc,MAAM,IAAI,GAAG,CAAC,EAAE;IACpC,OAAO,gBAAgB,KAAA,KAAa,gBAAgB,OAChD,UAAU,KAAK,OAAO,OAAO,IAAI,MAAM,CAAC,CAAC,GAAG,QAAQ,IACpD,MAAM,aAAa,QAAQ;GACjC;EACF;CACF;AACF;AAEA,SAAgB,aAAa,OAAqB,WAAyC;CACzF,MAAM,UAAU,IAAI,IAAI,MAAM,YAAY,UAAU,MAAM,CAAC,CAAC,KAAK,WAAW,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;CACjG,OAAO;EACL,GAAG;EACH,OAAO,MAAM,WAAW;GACtB,MAAM,SAAS,QAAQ,IAAI,QAAQ,KAAK,MAAM;GAC9C,OAAO,QAAQ,YAAY,OAAO,OAAQ,QAAQ,UAAU,UAAU,KAAK,MAAM,MAAM;EACzF;CACF;AACF"}

package/dist/extract-json.d.ts

@@ -0,0 +1,12 @@
+/** Removes reasoning blocks: <think>…</think>, and an unclosed leading block up to its end tag. */
+export declare const stripReasoning: (text: string) => string;
+/**
+ * The first JSON object (or array) in a model reply: the whole reply, then any fenced code
+ * block, then the first balanced `{…}` or `[…]` that parses. Undefined when there is none.
+ */
+export declare const extractJson: (reply: string) => {
+    ok: true;
+    value: unknown;
+} | {
+    ok: false;
+};

package/dist/extract-json.js

@@ -0,0 +1,59 @@
+//#region src/extract-json.ts
+/** Removes reasoning blocks: <think>…</think>, and an unclosed leading block up to its end tag. */
+var stripReasoning = (text) => text.replace(/<(think|thinking|reasoning)>[\s\S]*?<\/\1>/gi, "").replace(/^[\s\S]*?<\/(think|thinking|reasoning)>/i, "").trim();
+var tryParse = (text) => {
+	try {
+		return {
+			ok: true,
+			value: JSON.parse(text)
+		};
+	} catch {
+		return { ok: false };
+	}
+};
+/** The end index (exclusive) of the balanced object or array starting at `start`, or -1. */
+var balancedEnd = (text, start) => {
+	const stack = [];
+	let inString = false;
+	for (let i = start; i < text.length; i++) {
+		const ch = text[i];
+		if (inString) {
+			if (ch === "\\") i++;
+			else if (ch === "\"") inString = false;
+			continue;
+		}
+		if (ch === "\"") inString = true;
+		else if (ch === "{" || ch === "[") stack.push(ch === "{" ? "}" : "]");
+		else if (ch === "}" || ch === "]") {
+			if (stack.pop() !== ch) return -1;
+			if (stack.length === 0) return i + 1;
+		}
+	}
+	return -1;
+};
+/**
+* The first JSON object (or array) in a model reply: the whole reply, then any fenced code
+* block, then the first balanced `{…}` or `[…]` that parses. Undefined when there is none.
+*/
+var extractJson = (reply) => {
+	const text = stripReasoning(reply);
+	const whole = tryParse(text);
+	if (whole.ok && typeof whole.value === "object" && whole.value !== null) return whole;
+	for (const fence of text.matchAll(/```(?:json|JSON)?\s*\n?([\s\S]*?)```/g)) {
+		const parsed = tryParse((fence[1] ?? "").trim());
+		if (parsed.ok && typeof parsed.value === "object" && parsed.value !== null) return parsed;
+	}
+	for (let i = 0; i < text.length; i++) {
+		const ch = text[i];
+		if (ch !== "{" && ch !== "[") continue;
+		const end = balancedEnd(text, i);
+		if (end < 0) continue;
+		const parsed = tryParse(text.slice(i, end));
+		if (parsed.ok) return parsed;
+	}
+	return { ok: false };
+};
+//#endregion
+export { extractJson, stripReasoning };
+
+//# sourceMappingURL=extract-json.js.map

package/dist/extract-json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extract-json.js","names":[],"sources":["../src/extract-json.ts"],"sourcesContent":["// Finds the JSON value in a model reply. A JSON-schema response format usually yields bare\n// JSON, but some servers ignore it, and reasoning models may wrap the answer in a\n// <think>…</think> block, prose or a ```json code fence. This only *finds* the JSON; the\n// caller still decodes it through the item's schema (core belief 9), so nothing is guessed.\n\n/** Removes reasoning blocks: <think>…</think>, and an unclosed leading block up to its end tag. */\nexport const stripReasoning = (text: string): string =>\n  text\n    .replace(/<(think|thinking|reasoning)>[\\s\\S]*?<\\/\\1>/gi, '')\n    .replace(/^[\\s\\S]*?<\\/(think|thinking|reasoning)>/i, '')\n    .trim();\n\nconst tryParse = (text: string): { ok: true; value: unknown } | { ok: false } => {\n  try {\n    return { ok: true, value: JSON.parse(text) as unknown };\n  } catch {\n    return { ok: false };\n  }\n};\n\n/** The end index (exclusive) of the balanced object or array starting at `start`, or -1. */\nconst balancedEnd = (text: string, start: number): number => {\n  const stack: string[] = [];\n  let inString = false;\n  for (let i = start; i < text.length; i++) {\n    const ch = text[i];\n    if (inString) {\n      if (ch === '\\\\') i++;\n      else if (ch === '\"') inString = false;\n      continue;\n    }\n    if (ch === '\"') inString = true;\n    else if (ch === '{' || ch === '[') stack.push(ch === '{' ? '}' : ']');\n    else if (ch === '}' || ch === ']') {\n      if (stack.pop() !== ch) return -1;\n      if (stack.length === 0) return i + 1;\n    }\n  }\n  return -1;\n};\n\n/**\n * The first JSON object (or array) in a model reply: the whole reply, then any fenced code\n * block, then the first balanced `{…}` or `[…]` that parses. Undefined when there is none.\n */\nexport const extractJson = (reply: string): { ok: true; value: unknown } | { ok: false } => {\n  const text = stripReasoning(reply);\n  const whole = tryParse(text);\n  if (whole.ok && typeof whole.value === 'object' && whole.value !== null) return whole;\n  for (const fence of text.matchAll(/```(?:json|JSON)?\\s*\\n?([\\s\\S]*?)```/g)) {\n    const parsed = tryParse((fence[1] ?? '').trim());\n    if (parsed.ok && typeof parsed.value === 'object' && parsed.value !== null) return parsed;\n  }\n  for (let i = 0; i < text.length; i++) {\n    const ch = text[i];\n    if (ch !== '{' && ch !== '[') continue;\n    const end = balancedEnd(text, i);\n    if (end < 0) continue;\n    const parsed = tryParse(text.slice(i, end));\n    if (parsed.ok) return parsed;\n  }\n  return { ok: false };\n};\n"],"mappings":";;AAMA,IAAa,kBAAkB,SAC7B,KACG,QAAQ,gDAAgD,EAAE,CAAC,CAC3D,QAAQ,4CAA4C,EAAE,CAAC,CACvD,KAAK;AAEV,IAAM,YAAY,SAA+D;CAC/E,IAAI;EACF,OAAO;GAAE,IAAI;GAAM,OAAO,KAAK,MAAM,IAAI;EAAa;CACxD,QAAQ;EACN,OAAO,EAAE,IAAI,MAAM;CACrB;AACF;;AAGA,IAAM,eAAe,MAAc,UAA0B;CAC3D,MAAM,QAAkB,CAAC;CACzB,IAAI,WAAW;CACf,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,KAAK;EACxC,MAAM,KAAK,KAAK;EAChB,IAAI,UAAU;GACZ,IAAI,OAAO,MAAM;QACZ,IAAI,OAAO,MAAK,WAAW;GAChC;EACF;EACA,IAAI,OAAO,MAAK,WAAW;OACtB,IAAI,OAAO,OAAO,OAAO,KAAK,MAAM,KAAK,OAAO,MAAM,MAAM,GAAG;OAC/D,IAAI,OAAO,OAAO,OAAO,KAAK;GACjC,IAAI,MAAM,IAAI,MAAM,IAAI,OAAO;GAC/B,IAAI,MAAM,WAAW,GAAG,OAAO,IAAI;EACrC;CACF;CACA,OAAO;AACT;;;;;AAMA,IAAa,eAAe,UAAgE;CAC1F,MAAM,OAAO,eAAe,KAAK;CACjC,MAAM,QAAQ,SAAS,IAAI;CAC3B,IAAI,MAAM,MAAM,OAAO,MAAM,UAAU,YAAY,MAAM,UAAU,MAAM,OAAO;CAChF,KAAK,MAAM,SAAS,KAAK,SAAS,uCAAuC,GAAG;EAC1E,MAAM,SAAS,UAAU,MAAM,MAAM,GAAA,CAAI,KAAK,CAAC;EAC/C,IAAI,OAAO,MAAM,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,MAAM,OAAO;CACrF;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,OAAO,OAAO,KAAK;EAC9B,MAAM,MAAM,YAAY,MAAM,CAAC;EAC/B,IAAI,MAAM,GAAG;EACb,MAAM,SAAS,SAAS,KAAK,MAAM,GAAG,GAAG,CAAC;EAC1C,IAAI,OAAO,IAAI,OAAO;CACxB;CACA,OAAO,EAAE,IAAI,MAAM;AACrB"}

package/dist/filter.d.ts

@@ -0,0 +1,56 @@
+export type FilterList = 'blocklist' | 'sensitive';
+/** A text the filter reads, with a path that names it in reports ("entry.definition"). */
+export interface FieldText {
+    readonly path: string;
+    readonly text: string;
+}
+export interface FilterHit {
+    readonly path: string;
+    readonly list: FilterList;
+    /** The list entry that matched. Logged, never shown to players. */
+    readonly term: string;
+}
+export interface FilterReport {
+    readonly ok: boolean;
+    readonly hits: readonly FilterHit[];
+}
+interface Term {
+    readonly entry: string;
+    /** Tokens; the last may be a prefix. */
+    readonly tokens: readonly string[];
+    readonly prefix: boolean;
+    /** The forms each token matches (unused for a prefix token). */
+    readonly forms: readonly Set<string>[];
+}
+/**
+ * The forms a list entry matches: the word, its plural and its verb endings. Deliberately
+ * narrower than `formsOf` (no -er, -ly or -y), so "butt" never matches "butter".
+ */
+export declare const filterForms: (word: string) => Set<string>;
+export declare const parseList: (text: string) => Term[];
+export interface WordFilter {
+    /** The list entries a text contains. */
+    matches(text: string, list?: FilterList): {
+        list: FilterList;
+        term: string;
+    }[];
+    /** Layers 1 and 2 over every field. */
+    check(fields: readonly FieldText[]): FilterReport;
+    /** The blocklisted words of at least `minLength` letters along any straight line of a letter grid. */
+    checkGrid(rows: readonly string[], minLength?: number): FilterReport;
+    /** True when a single word (an answer, an option) is on either list. */
+    isListed(word: string): boolean;
+}
+/** A filter over the given list texts. `defaultFilter()` reads the repository's lists. */
+export declare const createWordFilter: (lists: {
+    readonly blocklist: string;
+    readonly sensitive: string;
+}) => WordFilter;
+/**
+ * Every straight line of a letter grid, read both ways: rows, columns and both diagonals.
+ * Non-letter cells (blocks, spaces) break a line.
+ */
+export declare const gridLines: (rows: readonly string[]) => string[];
+/** The filter over lists/blocklist.txt and lists/sensitive.txt. */
+export declare const defaultFilter: () => WordFilter;
+export {};

package/dist/filter.js

@@ -0,0 +1,127 @@
+import { fold, wordsOf } from "./text.js";
+import { readFileSync } from "node:fs";
+//#region src/filter.ts
+var VOWEL = /[aeiou]/;
+var consonant = (ch) => ch !== void 0 && /[a-z]/.test(ch) && !VOWEL.test(ch);
+/**
+* The forms a list entry matches: the word, its plural and its verb endings. Deliberately
+* narrower than `formsOf` (no -er, -ly or -y), so "butt" never matches "butter".
+*/
+var filterForms = (word) => {
+	const forms = /* @__PURE__ */ new Set([word, `${word}s`]);
+	const last = word.at(-1);
+	if (/(s|x|z|ch|sh)$/.test(word)) forms.add(`${word}es`);
+	if (word.length <= 4 && consonant(last) && VOWEL.test(word.at(-2) ?? "") && consonant(word.at(-3) ?? "b") && !/[wxy]/.test(last ?? "")) forms.add(`${word}${last}ed`).add(`${word}${last}ing`);
+	else if (last === "e") {
+		forms.add(`${word}d`);
+		if (word.length > 3) forms.add(`${word.slice(0, -1)}ing`);
+	} else if (last === "y" && consonant(word.at(-2))) forms.add(`${word.slice(0, -1)}ies`).add(`${word.slice(0, -1)}ied`).add(`${word}ing`);
+	else forms.add(`${word}ed`).add(`${word}ing`);
+	return forms;
+};
+var parseList = (text) => text.split("\n").map((line) => line.trim()).filter((line) => line !== "" && !line.startsWith("#")).map((entry) => {
+	const prefix = entry.endsWith("*");
+	const tokens = wordsOf(prefix ? entry.slice(0, -1) : entry);
+	return {
+		entry,
+		prefix,
+		tokens,
+		forms: tokens.map(filterForms)
+	};
+}).filter((term) => term.tokens.length > 0);
+var termAt = (tokens, i, term) => {
+	if (i + term.tokens.length > tokens.length) return false;
+	return term.tokens.every((word, k) => {
+		const token = tokens[i + k] ?? "";
+		return term.prefix && k === term.tokens.length - 1 ? token.startsWith(word) : term.forms[k]?.has(token) ?? false;
+	});
+};
+/** A filter over the given list texts. `defaultFilter()` reads the repository's lists. */
+var createWordFilter = (lists) => {
+	const terms = {
+		blocklist: parseList(lists.blocklist),
+		sensitive: parseList(lists.sensitive)
+	};
+	const matches = (text, only) => {
+		const tokens = wordsOf(text);
+		const found = [];
+		for (const list of ["blocklist", "sensitive"]) {
+			if (only !== void 0 && list !== only) continue;
+			for (const term of terms[list]) for (let i = 0; i < tokens.length; i++) if (termAt(tokens, i, term)) {
+				found.push({
+					list,
+					term: term.entry
+				});
+				break;
+			}
+		}
+		return found;
+	};
+	const singleBlocked = terms.blocklist.filter((term) => term.tokens.length === 1);
+	return {
+		matches,
+		check: (fields) => {
+			const hits = fields.flatMap((field) => matches(field.text).map((hit) => ({
+				path: field.path,
+				...hit
+			})));
+			return {
+				ok: hits.length === 0,
+				hits
+			};
+		},
+		checkGrid: (rows, minLength = 4) => {
+			const hits = [];
+			for (const [index, line] of gridLines(rows).entries()) for (const term of singleBlocked) {
+				const word = term.tokens[0] ?? "";
+				if (word.length >= minLength && line.includes(word)) hits.push({
+					path: `grid.line${String(index)}`,
+					list: "blocklist",
+					term: term.entry
+				});
+			}
+			return {
+				ok: hits.length === 0,
+				hits
+			};
+		},
+		isListed: (word) => matches(word).length > 0
+	};
+};
+/**
+* Every straight line of a letter grid, read both ways: rows, columns and both diagonals.
+* Non-letter cells (blocks, spaces) break a line.
+*/
+var gridLines = (rows) => {
+	const grid = rows.map((row) => [...fold(row)]);
+	const height = grid.length;
+	const width = Math.max(0, ...grid.map((row) => row.length));
+	const at = (r, c) => grid[r]?.[c] ?? " ";
+	const lines = [];
+	const walk = (r, c, dr, dc) => {
+		let line = "";
+		for (; r >= 0 && r < height && c >= 0 && c < width; r += dr, c += dc) line += at(r, c);
+		for (const run of line.split(/[^a-z]+/)) if (run.length > 1) lines.push(run, [...run].reverse().join(""));
+	};
+	for (let r = 0; r < height; r++) walk(r, 0, 0, 1);
+	for (let c = 0; c < width; c++) walk(0, c, 1, 0);
+	for (let c = 0; c < width; c++) walk(0, c, 1, 1);
+	for (let r = 1; r < height; r++) walk(r, 0, 1, 1);
+	for (let c = 0; c < width; c++) walk(0, c, 1, -1);
+	for (let r = 1; r < height; r++) walk(r, width - 1, 1, -1);
+	return lines;
+};
+var readList = (name) => readFileSync(new URL(`../lists/${name}`, import.meta.url), "utf8");
+var cached = null;
+/** The filter over lists/blocklist.txt and lists/sensitive.txt. */
+var defaultFilter = () => {
+	cached ??= createWordFilter({
+		blocklist: readList("blocklist.txt"),
+		sensitive: readList("sensitive.txt")
+	});
+	return cached;
+};
+//#endregion
+export { createWordFilter, defaultFilter, filterForms, gridLines, parseList };
+
+//# sourceMappingURL=filter.js.map

package/dist/filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.js","names":[],"sources":["../src/filter.ts"],"sourcesContent":["// The all-ages filter (content-pipeline.md, \"The all-ages filter\"). Layers 1 and 2 are word\n// lists in lists/: the blocklist and the sensitive list. Matching is whole-word, in the\n// regular plural and verb forms of each entry, so innocent words that merely contain a bad\n// substring pass (\"class\", \"scamper\"). An entry ending in \"*\" matches any word starting with\n// it; an entry with spaces matches as a phrase. Letter grids are also read along every\n// straight line, where a blocklisted word of four or more letters rejects the grid.\n// Layer 3, the model screen, is in screen.ts.\nimport { readFileSync } from 'node:fs';\nimport { fold, wordsOf } from './text.ts';\n\nexport type FilterList = 'blocklist' | 'sensitive';\n\n/** A text the filter reads, with a path that names it in reports (\"entry.definition\"). */\nexport interface FieldText {\n  readonly path: string;\n  readonly text: string;\n}\n\nexport interface FilterHit {\n  readonly path: string;\n  readonly list: FilterList;\n  /** The list entry that matched. Logged, never shown to players. */\n  readonly term: string;\n}\n\nexport interface FilterReport {\n  readonly ok: boolean;\n  readonly hits: readonly FilterHit[];\n}\n\ninterface Term {\n  readonly entry: string;\n  /** Tokens; the last may be a prefix. */\n  readonly tokens: readonly string[];\n  readonly prefix: boolean;\n  /** The forms each token matches (unused for a prefix token). */\n  readonly forms: readonly Set<string>[];\n}\n\nconst VOWEL = /[aeiou]/;\nconst consonant = (ch: string | undefined) => ch !== undefined && /[a-z]/.test(ch) && !VOWEL.test(ch);\n\n/**\n * The forms a list entry matches: the word, its plural and its verb endings. Deliberately\n * narrower than `formsOf` (no -er, -ly or -y), so \"butt\" never matches \"butter\".\n */\nexport const filterForms = (word: string): Set<string> => {\n  const forms = new Set([word, `${word}s`]);\n  const last = word.at(-1);\n  if (/(s|x|z|ch|sh)$/.test(word)) forms.add(`${word}es`);\n  if (\n    word.length <= 4 &&\n    consonant(last) &&\n    VOWEL.test(word.at(-2) ?? '') &&\n    consonant(word.at(-3) ?? 'b') &&\n    !/[wxy]/.test(last ?? '')\n  ) {\n    forms.add(`${word}${last}ed`).add(`${word}${last}ing`);\n  } else if (last === 'e') {\n    forms.add(`${word}d`);\n    if (word.length > 3) forms.add(`${word.slice(0, -1)}ing`);\n  } else if (last === 'y' && consonant(word.at(-2))) {\n    forms\n      .add(`${word.slice(0, -1)}ies`)\n      .add(`${word.slice(0, -1)}ied`)\n      .add(`${word}ing`);\n  } else {\n    forms.add(`${word}ed`).add(`${word}ing`);\n  }\n  return forms;\n};\n\nexport const parseList = (text: string): Term[] =>\n  text\n    .split('\\n')\n    .map((line) => line.trim())\n    .filter((line) => line !== '' && !line.startsWith('#'))\n    .map((entry) => {\n      const prefix = entry.endsWith('*');\n      const tokens = wordsOf(prefix ? entry.slice(0, -1) : entry);\n      return { entry, prefix, tokens, forms: tokens.map(filterForms) };\n    })\n    .filter((term) => term.tokens.length > 0);\n\nconst termAt = (tokens: readonly string[], i: number, term: Term): boolean => {\n  if (i + term.tokens.length > tokens.length) return false;\n  return term.tokens.every((word, k) => {\n    const token = tokens[i + k] ?? '';\n    return term.prefix && k === term.tokens.length - 1 ? token.startsWith(word) : (term.forms[k]?.has(token) ?? false);\n  });\n};\n\nexport interface WordFilter {\n  /** The list entries a text contains. */\n  matches(text: string, list?: FilterList): { list: FilterList; term: string }[];\n  /** Layers 1 and 2 over every field. */\n  check(fields: readonly FieldText[]): FilterReport;\n  /** The blocklisted words of at least `minLength` letters along any straight line of a letter grid. */\n  checkGrid(rows: readonly string[], minLength?: number): FilterReport;\n  /** True when a single word (an answer, an option) is on either list. */\n  isListed(word: string): boolean;\n}\n\n/** A filter over the given list texts. `defaultFilter()` reads the repository's lists. */\nexport const createWordFilter = (lists: { readonly blocklist: string; readonly sensitive: string }): WordFilter => {\n  const terms: Record<FilterList, Term[]> = {\n    blocklist: parseList(lists.blocklist),\n    sensitive: parseList(lists.sensitive),\n  };\n  const matches = (text: string, only?: FilterList) => {\n    const tokens = wordsOf(text);\n    const found: { list: FilterList; term: string }[] = [];\n    for (const list of ['blocklist', 'sensitive'] as const) {\n      if (only !== undefined && list !== only) continue;\n      for (const term of terms[list]) {\n        for (let i = 0; i < tokens.length; i++) {\n          if (termAt(tokens, i, term)) {\n            found.push({ list, term: term.entry });\n            break;\n          }\n        }\n      }\n    }\n    return found;\n  };\n  const singleBlocked = terms.blocklist.filter((term) => term.tokens.length === 1);\n  return {\n    matches,\n    check: (fields) => {\n      const hits = fields.flatMap((field) => matches(field.text).map((hit) => ({ path: field.path, ...hit })));\n      return { ok: hits.length === 0, hits };\n    },\n    checkGrid: (rows, minLength = 4) => {\n      const hits: FilterHit[] = [];\n      for (const [index, line] of gridLines(rows).entries()) {\n        for (const term of singleBlocked) {\n          const word = term.tokens[0] ?? '';\n          if (word.length >= minLength && line.includes(word))\n            hits.push({ path: `grid.line${String(index)}`, list: 'blocklist', term: term.entry });\n        }\n      }\n      return { ok: hits.length === 0, hits };\n    },\n    isListed: (word) => matches(word).length > 0,\n  };\n};\n\n/**\n * Every straight line of a letter grid, read both ways: rows, columns and both diagonals.\n * Non-letter cells (blocks, spaces) break a line.\n */\nexport const gridLines = (rows: readonly string[]): string[] => {\n  const grid = rows.map((row) => [...fold(row)]);\n  const height = grid.length;\n  const width = Math.max(0, ...grid.map((row) => row.length));\n  const at = (r: number, c: number) => grid[r]?.[c] ?? ' ';\n  const lines: string[] = [];\n  const walk = (r: number, c: number, dr: number, dc: number) => {\n    let line = '';\n    for (; r >= 0 && r < height && c >= 0 && c < width; r += dr, c += dc) line += at(r, c);\n    for (const run of line.split(/[^a-z]+/)) if (run.length > 1) lines.push(run, [...run].reverse().join(''));\n  };\n  for (let r = 0; r < height; r++) walk(r, 0, 0, 1);\n  for (let c = 0; c < width; c++) walk(0, c, 1, 0);\n  for (let c = 0; c < width; c++) walk(0, c, 1, 1);\n  for (let r = 1; r < height; r++) walk(r, 0, 1, 1);\n  for (let c = 0; c < width; c++) walk(0, c, 1, -1);\n  for (let r = 1; r < height; r++) walk(r, width - 1, 1, -1);\n  return lines;\n};\n\nconst readList = (name: 'blocklist.txt' | 'sensitive.txt'): string =>\n  readFileSync(new URL(`../lists/${name}`, import.meta.url), 'utf8');\n\nlet cached: WordFilter | null = null;\n\n/** The filter over lists/blocklist.txt and lists/sensitive.txt. */\nexport const defaultFilter = (): WordFilter => {\n  cached ??= createWordFilter({ blocklist: readList('blocklist.txt'), sensitive: readList('sensitive.txt') });\n  return cached;\n};\n"],"mappings":";;;AAuCA,IAAM,QAAQ;AACd,IAAM,aAAa,OAA2B,OAAO,KAAA,KAAa,QAAQ,KAAK,EAAE,KAAK,CAAC,MAAM,KAAK,EAAE;;;;;AAMpG,IAAa,eAAe,SAA8B;CACxD,MAAM,wBAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;CACxC,MAAM,OAAO,KAAK,GAAG,EAAE;CACvB,IAAI,iBAAiB,KAAK,IAAI,GAAG,MAAM,IAAI,GAAG,KAAK,GAAG;CACtD,IACE,KAAK,UAAU,KACf,UAAU,IAAI,KACd,MAAM,KAAK,KAAK,GAAG,EAAE,KAAK,EAAE,KAC5B,UAAU,KAAK,GAAG,EAAE,KAAK,GAAG,KAC5B,CAAC,QAAQ,KAAK,QAAQ,EAAE,GAExB,MAAM,IAAI,GAAG,OAAO,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,OAAO,KAAK,IAAI;MAChD,IAAI,SAAS,KAAK;EACvB,MAAM,IAAI,GAAG,KAAK,EAAE;EACpB,IAAI,KAAK,SAAS,GAAG,MAAM,IAAI,GAAG,KAAK,MAAM,GAAG,EAAE,EAAE,IAAI;CAC1D,OAAO,IAAI,SAAS,OAAO,UAAU,KAAK,GAAG,EAAE,CAAC,GAC9C,MACG,IAAI,GAAG,KAAK,MAAM,GAAG,EAAE,EAAE,IAAI,CAAC,CAC9B,IAAI,GAAG,KAAK,MAAM,GAAG,EAAE,EAAE,IAAI,CAAC,CAC9B,IAAI,GAAG,KAAK,IAAI;MAEnB,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,KAAK,IAAI;CAEzC,OAAO;AACT;AAEA,IAAa,aAAa,SACxB,KACG,MAAM,IAAI,CAAC,CACX,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,CAC1B,QAAQ,SAAS,SAAS,MAAM,CAAC,KAAK,WAAW,GAAG,CAAC,CAAC,CACtD,KAAK,UAAU;CACd,MAAM,SAAS,MAAM,SAAS,GAAG;CACjC,MAAM,SAAS,QAAQ,SAAS,MAAM,MAAM,GAAG,EAAE,IAAI,KAAK;CAC1D,OAAO;EAAE;EAAO;EAAQ;EAAQ,OAAO,OAAO,IAAI,WAAW;CAAE;AACjE,CAAC,CAAC,CACD,QAAQ,SAAS,KAAK,OAAO,SAAS,CAAC;AAE5C,IAAM,UAAU,QAA2B,GAAW,SAAwB;CAC5E,IAAI,IAAI,KAAK,OAAO,SAAS,OAAO,QAAQ,OAAO;CACnD,OAAO,KAAK,OAAO,OAAO,MAAM,MAAM;EACpC,MAAM,QAAQ,OAAO,IAAI,MAAM;EAC/B,OAAO,KAAK,UAAU,MAAM,KAAK,OAAO,SAAS,IAAI,MAAM,WAAW,IAAI,IAAK,KAAK,MAAM,EAAE,EAAE,IAAI,KAAK,KAAK;CAC9G,CAAC;AACH;;AAcA,IAAa,oBAAoB,UAAkF;CACjH,MAAM,QAAoC;EACxC,WAAW,UAAU,MAAM,SAAS;EACpC,WAAW,UAAU,MAAM,SAAS;CACtC;CACA,MAAM,WAAW,MAAc,SAAsB;EACnD,MAAM,SAAS,QAAQ,IAAI;EAC3B,MAAM,QAA8C,CAAC;EACrD,KAAK,MAAM,QAAQ,CAAC,aAAa,WAAW,GAAY;GACtD,IAAI,SAAS,KAAA,KAAa,SAAS,MAAM;GACzC,KAAK,MAAM,QAAQ,MAAM,OACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KACjC,IAAI,OAAO,QAAQ,GAAG,IAAI,GAAG;IAC3B,MAAM,KAAK;KAAE;KAAM,MAAM,KAAK;IAAM,CAAC;IACrC;GACF;EAGN;EACA,OAAO;CACT;CACA,MAAM,gBAAgB,MAAM,UAAU,QAAQ,SAAS,KAAK,OAAO,WAAW,CAAC;CAC/E,OAAO;EACL;EACA,QAAQ,WAAW;GACjB,MAAM,OAAO,OAAO,SAAS,UAAU,QAAQ,MAAM,IAAI,CAAC,CAAC,KAAK,SAAS;IAAE,MAAM,MAAM;IAAM,GAAG;GAAI,EAAE,CAAC;GACvG,OAAO;IAAE,IAAI,KAAK,WAAW;IAAG;GAAK;EACvC;EACA,YAAY,MAAM,YAAY,MAAM;GAClC,MAAM,OAAoB,CAAC;GAC3B,KAAK,MAAM,CAAC,OAAO,SAAS,UAAU,IAAI,CAAC,CAAC,QAAQ,GAClD,KAAK,MAAM,QAAQ,eAAe;IAChC,MAAM,OAAO,KAAK,OAAO,MAAM;IAC/B,IAAI,KAAK,UAAU,aAAa,KAAK,SAAS,IAAI,GAChD,KAAK,KAAK;KAAE,MAAM,YAAY,OAAO,KAAK;KAAK,MAAM;KAAa,MAAM,KAAK;IAAM,CAAC;GACxF;GAEF,OAAO;IAAE,IAAI,KAAK,WAAW;IAAG;GAAK;EACvC;EACA,WAAW,SAAS,QAAQ,IAAI,CAAC,CAAC,SAAS;CAC7C;AACF;;;;;AAMA,IAAa,aAAa,SAAsC;CAC9D,MAAM,OAAO,KAAK,KAAK,QAAQ,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;CAC7C,MAAM,SAAS,KAAK;CACpB,MAAM,QAAQ,KAAK,IAAI,GAAG,GAAG,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC;CAC1D,MAAM,MAAM,GAAW,MAAc,KAAK,EAAE,GAAG,MAAM;CACrD,MAAM,QAAkB,CAAC;CACzB,MAAM,QAAQ,GAAW,GAAW,IAAY,OAAe;EAC7D,IAAI,OAAO;EACX,OAAO,KAAK,KAAK,IAAI,UAAU,KAAK,KAAK,IAAI,OAAO,KAAK,IAAI,KAAK,IAAI,QAAQ,GAAG,GAAG,CAAC;EACrF,KAAK,MAAM,OAAO,KAAK,MAAM,SAAS,GAAG,IAAI,IAAI,SAAS,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,CAAC;CAC1G;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,KAAK,GAAG,GAAG,GAAG,CAAC;CAChD,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAK,GAAG,GAAG,GAAG,CAAC;CAC/C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAK,GAAG,GAAG,GAAG,CAAC;CAC/C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,KAAK,GAAG,GAAG,GAAG,CAAC;CAChD,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAK,GAAG,GAAG,GAAG,EAAE;CAChD,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,KAAK,GAAG,QAAQ,GAAG,GAAG,EAAE;CACzD,OAAO;AACT;AAEA,IAAM,YAAY,SAChB,aAAa,IAAI,IAAI,YAAY,QAAQ,YAAY,GAAG,GAAG,MAAM;AAEnE,IAAI,SAA4B;;AAGhC,IAAa,sBAAkC;CAC7C,WAAW,iBAAiB;EAAE,WAAW,SAAS,eAAe;EAAG,WAAW,SAAS,eAAe;CAAE,CAAC;CAC1G,OAAO;AACT"}

package/dist/games.d.ts

@@ -0,0 +1,9 @@
+import type { DailyGenerator } from './pipeline.js';
+/** One registry for scheduled content and staff moderation. No game code is imported here. */
+export declare const CONTENT_GAMES: {
+    readonly daily: readonly ["pipe-link", "mini-golf", "garden-crossing", "tower-stacker", "rock-field", "gem-swap", "map-guess", "equation", "word-hunt", "four-groups", "honeycomb", "word-of-the-day", "daily-word", "crossword", "word-flux", "freecell", "pyramid", "tripeaks", "golf", "code-breaker", "word-ladder", "queens", "tile-match"];
+    readonly packs: readonly ["letter-drop", "word-flux"];
+};
+export type DailyContentGame = (typeof CONTENT_GAMES.daily)[number];
+/** Apps supply the implementations; the shared registry determines the complete lineup. */
+export declare const dailyGenerators: (factories: Readonly<Record<DailyContentGame, () => DailyGenerator>>) => DailyGenerator[];

package/dist/games.js

@@ -0,0 +1,40 @@
+//#region src/games.ts
+/** One registry for scheduled content and staff moderation. No game code is imported here. */
+var CONTENT_GAMES = {
+	daily: [
+		"pipe-link",
+		"mini-golf",
+		"garden-crossing",
+		"tower-stacker",
+		"rock-field",
+		"gem-swap",
+		"map-guess",
+		"equation",
+		"word-hunt",
+		"four-groups",
+		"honeycomb",
+		"word-of-the-day",
+		"daily-word",
+		"crossword",
+		"word-flux",
+		"freecell",
+		"pyramid",
+		"tripeaks",
+		"golf",
+		"code-breaker",
+		"word-ladder",
+		"queens",
+		"tile-match"
+	],
+	packs: ["letter-drop", "word-flux"]
+};
+/** Apps supply the implementations; the shared registry determines the complete lineup. */
+var dailyGenerators = (factories) => CONTENT_GAMES.daily.map((id) => {
+	const generator = factories[id]();
+	if (generator.gameId !== id) throw new Error(`The ${id} content factory returned ${generator.gameId}.`);
+	return generator;
+});
+//#endregion
+export { CONTENT_GAMES, dailyGenerators };
+
+//# sourceMappingURL=games.js.map

package/dist/games.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"games.js","names":[],"sources":["../src/games.ts"],"sourcesContent":["import type { DailyGenerator } from './pipeline.ts';\n\n/** One registry for scheduled content and staff moderation. No game code is imported here. */\nexport const CONTENT_GAMES = {\n  daily: [\n    'pipe-link',\n    'mini-golf',\n    'garden-crossing',\n    'tower-stacker',\n    'rock-field',\n    'gem-swap',\n    'map-guess',\n    'equation',\n    'word-hunt',\n    'four-groups',\n    'honeycomb',\n    'word-of-the-day',\n    'daily-word',\n    'crossword',\n    'word-flux',\n    'freecell',\n    'pyramid',\n    'tripeaks',\n    'golf',\n    'code-breaker',\n    'word-ladder',\n    'queens',\n    'tile-match',\n  ],\n  packs: ['letter-drop', 'word-flux'],\n} as const;\n\nexport type DailyContentGame = (typeof CONTENT_GAMES.daily)[number];\n\n/** Apps supply the implementations; the shared registry determines the complete lineup. */\nexport const dailyGenerators = (\n  factories: Readonly<Record<DailyContentGame, () => DailyGenerator>>,\n): DailyGenerator[] =>\n  CONTENT_GAMES.daily.map((id) => {\n    const generator = factories[id]();\n    if (generator.gameId !== id) throw new Error(`The ${id} content factory returned ${generator.gameId}.`);\n    return generator;\n  });\n"],"mappings":";;AAGA,IAAa,gBAAgB;CAC3B,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;CACA,OAAO,CAAC,eAAe,WAAW;AACpC;;AAKA,IAAa,mBACX,cAEA,cAAc,MAAM,KAAK,OAAO;CAC9B,MAAM,YAAY,UAAU,GAAG,CAAC;CAChC,IAAI,UAAU,WAAW,IAAI,MAAM,IAAI,MAAM,OAAO,GAAG,4BAA4B,UAAU,OAAO,EAAE;CACtG,OAAO;AACT,CAAC"}

package/dist/hash.d.ts

@@ -0,0 +1,4 @@
+import type { Json } from '@joystyk/contracts';
+export declare const contentHash: (config: Json) => string;
+/** A stable unsigned 32-bit number from a string (FNV-1a), for deterministic picks such as the bank's. */
+export declare const stableIndex: (key: string, modulo: number) => number;