@aldus-runtime/gate-engine 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,21 @@
+Aldus
+Copyright 2026 Jam Chen
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this software except in compliance with the License. You may obtain a copy of
+the License in the LICENSE file distributed with this software, or at:
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Aldus is currently owned as personal work and has not been assigned to a
+separate legal entity. If ownership is transferred, this file and the related
+copyright statements will be updated at that time.
+
+No third-party code is bundled, inlined, or vendored into any published Aldus
+package. Dependencies are resolved at install time and reach the consumer under
+their own licenses, from their own publishers. The dependency audit is recorded
+in THIRD-PARTY-NOTICES.md.
+
+This NOTICE file exists by the project's choice rather than by obligation:
+Apache-2.0 section 4(d) governs the preservation of a NOTICE file when the work
+already carries one, and does not itself require that one be created.

package/dist/binding.d.ts

@@ -0,0 +1,82 @@
+/**
+ * Binding a decision to exact inputs (architecture contract §13).
+ *
+ * Contract §3.6: a decision must be "tied to exact inputs". §13.1 and §13.2 turn that into a
+ * requirement — a Content Freeze is void once the content changes, and a TTS authorization "MUST
+ * be invalidated if any bound value changes". `GateDecision.subjectHashes` is the mechanism.
+ *
+ * Two design choices here are load-bearing.
+ *
+ * **The stored hashes are the raw content digests, not digests of `key + value`.** Hashing the
+ * pair would bind the key association more tightly, but it would also make a `subjectHash`
+ * unmatchable against an `ArtifactRef.sha256`, and §20 requires production trace to answer which
+ * inputs produced a result. Interoperability with the artifact record is worth more than the
+ * marginal strength, because the key association is recovered below anyway.
+ *
+ * **Comparison is over a sorted multiset, and there is no sidecar record of key-to-hash.** A
+ * separate record mapping keys to hashes could drift from the decision it describes, and a
+ * safety check that depends on two records agreeing fails open the day they disagree. Instead the
+ * check is a direct comparison against `subjectHashes`, and the key-level explanation is
+ * *derived* by diffing current subjects against that same list. If the explanation is imperfect
+ * the check is still exact — the ordering that matters.
+ */
+import type { GateDecision } from "@aldus-runtime/core";
+import type { ResolvedGateDefinition } from "./definition.js";
+/** One named input a gate binds, and the digest of its current value. */
+export interface GateSubject {
+    /**
+     * What this subject is, e.g. a spoken-text hash or a request plan (contract §13.2).
+     *
+     * An OPEN string. What a gate binds is adopter process (§4.3), so Core names no subject keys.
+     */
+    key: string;
+    /** Lowercase hex SHA-256 of the subject's current value. */
+    sha256: string;
+}
+/**
+ * Digest an arbitrary value for use as a subject.
+ *
+ * Serialisation is canonical — object keys sorted at every depth — so that two structurally
+ * identical settings objects produce the same digest regardless of how they were built. Without
+ * that, re-serialising an unchanged voice-settings object in a different key order would read as
+ * a changed bound value and void a valid authorization (§13.2).
+ */
+export declare function digestSubjectValue(value: unknown): string;
+/** Digest raw bytes or text for use as a subject. */
+export declare function digestBytes(value: string | Uint8Array): string;
+/**
+ * Check that the supplied subjects cover exactly what the gate binds, and are well formed.
+ *
+ * A missing subject is refused rather than treated as unchanged. §13.2 requires the operator to
+ * approve every listed value, so an authorization that silently omitted one would bind less than
+ * the contract requires while still reading as valid.
+ *
+ * @throws {AldusError} `ALDUS_GATE_SUBJECTS_INCOMPLETE`
+ */
+export declare function assertSubjectsCover(gate: ResolvedGateDefinition, subjects: readonly GateSubject[]): void;
+/**
+ * The canonical `subjectHashes` for a set of subjects.
+ *
+ * Sorted so that the order subjects were supplied in cannot change the stored value, and kept as
+ * a list rather than a set so two subjects that happen to share a value stay two subjects.
+ */
+export declare function toSubjectHashes(subjects: readonly GateSubject[]): string[];
+/** Why a decision no longer binds the current inputs. */
+export interface SubjectDrift {
+    /** Subject keys whose current digest is not among the approved hashes. */
+    changed: string[];
+    /** Approved hashes no longer matched by any current subject. */
+    orphanedHashes: string[];
+}
+/**
+ * Compare current subjects against what a decision approved.
+ *
+ * Returns `undefined` when they match exactly. Otherwise names the keys whose values moved, which
+ * is what an operator needs in order to know what to re-approve.
+ *
+ * The key attribution is best-effort by design: it is derived from the hashes rather than stored
+ * alongside them, so an exotic case — two subjects sharing one value, one of which changed — may
+ * name both. The *detection* is exact regardless, and detection is what §13.2 requires.
+ */
+export declare function detectDrift(decision: GateDecision, subjects: readonly GateSubject[]): SubjectDrift | undefined;
+//# sourceMappingURL=binding.d.ts.map

package/dist/binding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"binding.d.ts","sourceRoot":"","sources":["../src/binding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAExD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAG9D,yEAAyE;AACzE,MAAM,WAAW,WAAW;IAC1B;;;;OAIG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;CAChB;AAKD;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAEzD;AAED,qDAAqD;AACrD,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,MAAM,CAE9D;AAaD;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,sBAAsB,EAC5B,QAAQ,EAAE,SAAS,WAAW,EAAE,GAC/B,IAAI,CAoCN;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,GAAG,MAAM,EAAE,CAE1E;AAED,yDAAyD;AACzD,MAAM,WAAW,YAAY;IAC3B,0EAA0E;IAC1E,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,gEAAgE;IAChE,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CACzB,QAAQ,EAAE,YAAY,EACtB,QAAQ,EAAE,SAAS,WAAW,EAAE,GAC/B,YAAY,GAAG,SAAS,CAwB1B"}

package/dist/binding.js

@@ -0,0 +1,129 @@
+/**
+ * Binding a decision to exact inputs (architecture contract §13).
+ *
+ * Contract §3.6: a decision must be "tied to exact inputs". §13.1 and §13.2 turn that into a
+ * requirement — a Content Freeze is void once the content changes, and a TTS authorization "MUST
+ * be invalidated if any bound value changes". `GateDecision.subjectHashes` is the mechanism.
+ *
+ * Two design choices here are load-bearing.
+ *
+ * **The stored hashes are the raw content digests, not digests of `key + value`.** Hashing the
+ * pair would bind the key association more tightly, but it would also make a `subjectHash`
+ * unmatchable against an `ArtifactRef.sha256`, and §20 requires production trace to answer which
+ * inputs produced a result. Interoperability with the artifact record is worth more than the
+ * marginal strength, because the key association is recovered below anyway.
+ *
+ * **Comparison is over a sorted multiset, and there is no sidecar record of key-to-hash.** A
+ * separate record mapping keys to hashes could drift from the decision it describes, and a
+ * safety check that depends on two records agreeing fails open the day they disagree. Instead the
+ * check is a direct comparison against `subjectHashes`, and the key-level explanation is
+ * *derived* by diffing current subjects against that same list. If the explanation is imperfect
+ * the check is still exact — the ordering that matters.
+ */
+import { createHash } from "node:crypto";
+import { GateEngineErrorCodes, gateEngineError } from "./errors.js";
+/** Matches Core's `sha256Hex`: lowercase only, so digests compare by equality. */
+const SHA256_PATTERN = /^[0-9a-f]{64}$/;
+/**
+ * Digest an arbitrary value for use as a subject.
+ *
+ * Serialisation is canonical — object keys sorted at every depth — so that two structurally
+ * identical settings objects produce the same digest regardless of how they were built. Without
+ * that, re-serialising an unchanged voice-settings object in a different key order would read as
+ * a changed bound value and void a valid authorization (§13.2).
+ */
+export function digestSubjectValue(value) {
+    return createHash("sha256").update(canonicalJson(value), "utf8").digest("hex");
+}
+/** Digest raw bytes or text for use as a subject. */
+export function digestBytes(value) {
+    return createHash("sha256").update(value).digest("hex");
+}
+/** JSON with object keys sorted at every depth. */
+function canonicalJson(value) {
+    if (value === null || typeof value !== "object")
+        return JSON.stringify(value) ?? "null";
+    if (Array.isArray(value))
+        return `[${value.map(canonicalJson).join(",")}]`;
+    const entries = Object.entries(value)
+        .filter(([, entryValue]) => entryValue !== undefined)
+        .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))
+        .map(([key, entryValue]) => `${JSON.stringify(key)}:${canonicalJson(entryValue)}`);
+    return `{${entries.join(",")}}`;
+}
+/**
+ * Check that the supplied subjects cover exactly what the gate binds, and are well formed.
+ *
+ * A missing subject is refused rather than treated as unchanged. §13.2 requires the operator to
+ * approve every listed value, so an authorization that silently omitted one would bind less than
+ * the contract requires while still reading as valid.
+ *
+ * @throws {AldusError} `ALDUS_GATE_SUBJECTS_INCOMPLETE`
+ */
+export function assertSubjectsCover(gate, subjects) {
+    const supplied = new Map();
+    for (const subject of subjects) {
+        if (!SHA256_PATTERN.test(subject.sha256)) {
+            throw gateEngineError(GateEngineErrorCodes.GATE_SUBJECTS_INCOMPLETE, `Subject "${subject.key}" for gate "${gate.gateId}" is not a lowercase hex SHA-256. ` +
+                "Mixed-case or truncated digests would compare unequal to an identical value.", { category: "validation", details: { gateId: gate.gateId, key: subject.key } });
+        }
+        if (supplied.has(subject.key)) {
+            throw gateEngineError(GateEngineErrorCodes.GATE_SUBJECTS_INCOMPLETE, `Subject "${subject.key}" was supplied twice for gate "${gate.gateId}".`, { category: "validation", details: { gateId: gate.gateId, key: subject.key } });
+        }
+        supplied.set(subject.key, subject.sha256);
+    }
+    const missing = gate.binds.filter((key) => !supplied.has(key));
+    const unexpected = [...supplied.keys()].filter((key) => !gate.binds.includes(key));
+    if (missing.length > 0 || unexpected.length > 0) {
+        throw gateEngineError(GateEngineErrorCodes.GATE_SUBJECTS_INCOMPLETE, `Gate "${gate.gateId}" binds [${gate.binds.join(", ")}], but was given ` +
+            `[${[...supplied.keys()].join(", ")}]. Contract §13.2 requires an authorization to bind ` +
+            "every listed value; binding a different set is not the same approval.", {
+            category: "validation",
+            details: { gateId: gate.gateId, missing, unexpected, binds: [...gate.binds] },
+        });
+    }
+}
+/**
+ * The canonical `subjectHashes` for a set of subjects.
+ *
+ * Sorted so that the order subjects were supplied in cannot change the stored value, and kept as
+ * a list rather than a set so two subjects that happen to share a value stay two subjects.
+ */
+export function toSubjectHashes(subjects) {
+    return subjects.map((subject) => subject.sha256).sort();
+}
+/**
+ * Compare current subjects against what a decision approved.
+ *
+ * Returns `undefined` when they match exactly. Otherwise names the keys whose values moved, which
+ * is what an operator needs in order to know what to re-approve.
+ *
+ * The key attribution is best-effort by design: it is derived from the hashes rather than stored
+ * alongside them, so an exotic case — two subjects sharing one value, one of which changed — may
+ * name both. The *detection* is exact regardless, and detection is what §13.2 requires.
+ */
+export function detectDrift(decision, subjects) {
+    const approved = [...decision.subjectHashes].sort();
+    const current = toSubjectHashes(subjects);
+    if (approved.length === current.length && approved.every((hash, i) => hash === current[i])) {
+        return undefined;
+    }
+    const approvedCounts = new Map();
+    for (const hash of approved)
+        approvedCounts.set(hash, (approvedCounts.get(hash) ?? 0) + 1);
+    const changed = [];
+    for (const subject of subjects) {
+        const remaining = approvedCounts.get(subject.sha256) ?? 0;
+        if (remaining > 0)
+            approvedCounts.set(subject.sha256, remaining - 1);
+        else
+            changed.push(subject.key);
+    }
+    const orphanedHashes = [];
+    for (const [hash, count] of approvedCounts) {
+        for (let i = 0; i < count; i += 1)
+            orphanedHashes.push(hash);
+    }
+    return { changed, orphanedHashes: orphanedHashes.sort() };
+}
+//# sourceMappingURL=binding.js.map

package/dist/binding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binding.js","sourceRoot":"","sources":["../src/binding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAKzC,OAAO,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAcpE,kFAAkF;AAClF,MAAM,cAAc,GAAG,gBAAgB,CAAC;AAExC;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAc;IAC/C,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACjF,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,WAAW,CAAC,KAA0B;IACpD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC1D,CAAC;AAED,mDAAmD;AACnD,SAAS,aAAa,CAAC,KAAc;IACnC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC;IACxF,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAC3E,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAgC,CAAC;SAC7D,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,EAAE,CAAC,UAAU,KAAK,SAAS,CAAC;SACpD,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAChD,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACrF,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAClC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAA4B,EAC5B,QAAgC;IAEhC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACzC,MAAM,eAAe,CACnB,oBAAoB,CAAC,wBAAwB,EAC7C,YAAY,OAAO,CAAC,GAAG,eAAe,IAAI,CAAC,MAAM,oCAAoC;gBACnF,8EAA8E,EAChF,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,EAAE,CAC/E,CAAC;QACJ,CAAC;QACD,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9B,MAAM,eAAe,CACnB,oBAAoB,CAAC,wBAAwB,EAC7C,YAAY,OAAO,CAAC,GAAG,kCAAkC,IAAI,CAAC,MAAM,IAAI,EACxE,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,EAAE,CAC/E,CAAC;QACJ,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/D,MAAM,UAAU,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IAEnF,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,eAAe,CACnB,oBAAoB,CAAC,wBAAwB,EAC7C,SAAS,IAAI,CAAC,MAAM,YAAY,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB;YACtE,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,sDAAsD;YACzF,uEAAuE,EACzE;YACE,QAAQ,EAAE,YAAY;YACtB,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE;SAC9E,CACF,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,QAAgC;IAC9D,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;AAC1D,CAAC;AAUD;;;;;;;;;GASG;AACH,MAAM,UAAU,WAAW,CACzB,QAAsB,EACtB,QAAgC;IAEhC,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC;IACpD,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3F,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,QAAQ;QAAE,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE3F,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1D,IAAI,SAAS,GAAG,CAAC;YAAE,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC;;YAChE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,cAAc,EAAE,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC;YAAE,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;AAC5D,CAAC"}

package/dist/definition.d.ts

@@ -0,0 +1,187 @@
+/**
+ * Gate definitions (architecture contract §12, §13).
+ *
+ * A definition is **configuration**: what a gate binds to, what it depends on, how strongly it
+ * blocks, and who may decide it. A {@link GateDecision} is a **record**: what someone decided,
+ * when, and against which exact inputs. Keeping them apart is what lets a decision stay a
+ * faithful historical fact while the configuration around it evolves.
+ *
+ * Contract §13 names four gates — Content Freeze (§13.1), Performance Freeze (§13.2), Human Ear
+ * (§13.3), Final Release (§13.4). None of them is hardcoded here. §4.2 keeps show-specific
+ * process out of Core's reach and §4.3 gives adopters their own gates, so `gateId` and the
+ * subject keys are open strings and the contract's four gates are simply the definitions an
+ * adopter is most likely to write. The tests construct them to show the model expresses §13, not
+ * because the engine knows their names.
+ */
+import type { ActorKind } from "@aldus-runtime/core";
+/**
+ * The four quality levels of contract §12.
+ *
+ * These describe *what kind of judgement* a gate represents, which is independent of how
+ * strongly it blocks. §12's own table pairs them freely: a hard gate blocks, an advisory signal
+ * does not, and a model-assisted review may do either depending on whether it has been
+ * calibrated (§12.1).
+ */
+export declare const GATE_LEVELS: readonly [
+/** Blocks on an objectively testable failure (§12 level 1). */
+"hard_gate", 
+/** Reports a possible issue without blocking (§12 level 2). */
+"advisory_signal", 
+/** Evaluates meaning, stance, style, or claims under uncertainty (§12 level 3). */
+"model_assisted", 
+/** A human owns the judgement, because it is subjective or asymmetric-risk (§12 level 4). */
+"human_oracle"];
+/** @see GATE_LEVELS */
+export type GateLevel = (typeof GATE_LEVELS)[number];
+/**
+ * Whether a gate stops work or merely reports.
+ *
+ * Deliberately a two-state enumeration rather than a boolean. Contract §12.1 permits an
+ * evaluator to *become* blocking only after calibration, which makes this a promotion with
+ * evidence behind it — and a field named `blocking: boolean` invites someone to flip it in a
+ * config file without producing any.
+ */
+export declare const GATE_ENFORCEMENTS: readonly ["blocking", "advisory"];
+/** @see GATE_ENFORCEMENTS */
+export type GateEnforcement = (typeof GATE_ENFORCEMENTS)[number];
+/**
+ * Evidence that a model-assisted evaluator was calibrated before it was allowed to block.
+ *
+ * Contract §12.1: "An evaluator MAY become blocking only after it is calibrated against
+ * human-labeled examples." The metrics themselves belong to WP-10; this is the reference a
+ * definition must carry to claim they exist, and {@link validateGateDefinition} refuses a
+ * blocking model-assisted gate without one.
+ *
+ * `scope` matters as much as the numbers. §12.1 lists show, host, voice, model, and script-form
+ * scope among what promotion must consider, because an evaluator calibrated on one host says
+ * nothing about another. Dimensions are caller-supplied (§4.2), consistent with WP-09's packs.
+ */
+export interface PromotionEvidence {
+    /** Identifier of the calibration report that justified promotion (WP-10). */
+    reportRef: string;
+    /** Scope the calibration covers, e.g. `{ host: "example-host", voice: "voice-a" }`. */
+    scope: Record<string, string>;
+    /** Known blind spots recorded at promotion time (§12.1, §9.3). */
+    knownBlindSpots?: string[];
+}
+/**
+ * One configured gate.
+ *
+ * @see GateDecision for the record a decision on this gate produces.
+ */
+export interface GateDefinition {
+    /**
+     * Identity of the gate.
+     *
+     * An OPEN string. Contract §13's four gates are examples an adopter configures, not a set Core
+     * fixes (§4.2). Do not narrow this to a union.
+     */
+    gateId: string;
+    /** Operator-facing name. */
+    title?: string;
+    /** What kind of judgement this gate represents (§12). */
+    level: GateLevel;
+    /** Whether it stops work or merely reports (§12). */
+    enforcement: GateEnforcement;
+    /**
+     * Named subjects a decision on this gate must bind.
+     *
+     * For a Performance Freeze these are §13.2's list — spoken-text hash, PerformanceScript hash,
+     * voice/model/settings, request plan or segment scope, maximum authorized cost — but the keys
+     * are caller-supplied strings, because what a gate binds is adopter process (§4.3).
+     *
+     * A decision that does not cover every key here is refused: §13.2 requires the operator to
+     * approve *all* of the listed values, and an authorization missing one of them binds less than
+     * the contract requires.
+     */
+    binds: readonly string[];
+    /**
+     * Gates whose invalidation invalidates this one (contract §13.1).
+     *
+     * §13.1 requires a content-changing edit to invalidate the Content Freeze "and downstream
+     * approvals". This edge is what "downstream" means, stated per gate rather than inferred, so
+     * an adopter's own gates participate in the cascade without the engine guessing an order.
+     */
+    dependsOn?: readonly string[];
+    /**
+     * Actor kinds permitted to decide this gate.
+     *
+     * Defaults to human-only for `human_oracle`, and to any actor otherwise. §13.3 keeps final
+     * performance approval human-owned "until a scoped evaluator is demonstrably reliable", and
+     * §12 forbids presenting a machine pass as semantic correctness.
+     */
+    permittedActorKinds?: readonly ActorKind[];
+    /**
+     * Default for {@link GateDecision.expiresOnChange} on this gate.
+     *
+     * Defaults to `true`. §13.1 and §13.2 both require invalidation on change, and a gate that
+     * silently defaulted to carrying a stale approval forward would be the failure those sections
+     * exist to prevent.
+     */
+    expiresOnChange?: boolean;
+    /** Calibration evidence, required when a model-assisted gate is blocking (§12.1). */
+    promotionEvidence?: PromotionEvidence;
+    /**
+     * Operations this gate authorizes, if any.
+     *
+     * Contract §13.4: "Uploading and making public SHOULD be separate operations." Naming the
+     * operations a gate grants is how that separation is expressed — an approval on one gate
+     * authorizes exactly the operations it names and nothing else, so a single decision cannot
+     * quietly cover both upload and publication.
+     */
+    grants?: readonly string[];
+}
+/** A definition with every default resolved. */
+export interface ResolvedGateDefinition extends GateDefinition {
+    dependsOn: readonly string[];
+    permittedActorKinds: readonly ActorKind[];
+    expiresOnChange: boolean;
+    grants: readonly string[];
+}
+/**
+ * Resolve defaults and refuse an internally inconsistent definition.
+ *
+ * @throws {AldusError} `ALDUS_GATE_DEFINITION_INVALID`
+ */
+export declare function validateGateDefinition(definition: GateDefinition): ResolvedGateDefinition;
+/**
+ * A validated set of gates and the dependency graph between them.
+ *
+ * Built once and reused: cycle detection and unknown-dependency checks run at construction, so a
+ * misconfiguration surfaces when the registry is assembled rather than when an operator is
+ * waiting on an approval.
+ */
+export declare class GateRegistry {
+    #private;
+    private constructor();
+    /**
+     * Validate a set of definitions and the graph they form.
+     *
+     * @throws {AldusError} `ALDUS_GATE_DEFINITION_INVALID` for an invalid or duplicate definition,
+     * or an edge naming a gate that does not exist.
+     * @throws {AldusError} `ALDUS_GATE_DEPENDENCY_CYCLE` if the dependency edges form a cycle.
+     */
+    static from(definitions: readonly GateDefinition[]): GateRegistry;
+    /** Every gate, in definition order. */
+    list(): ResolvedGateDefinition[];
+    /** True if the gate is registered. */
+    has(gateId: string): boolean;
+    /** A gate definition, or `undefined` if it is not registered. */
+    get(gateId: string): ResolvedGateDefinition | undefined;
+    /**
+     * A gate definition.
+     *
+     * @throws {AldusError} `ALDUS_GATE_NOT_FOUND`
+     */
+    require(gateId: string): ResolvedGateDefinition;
+    /** Gates that directly depend on `gateId`. */
+    dependentsOf(gateId: string): ResolvedGateDefinition[];
+    /**
+     * Gates that transitively depend on `gateId`, nearest first, excluding `gateId` itself.
+     *
+     * This is the reach of contract §13.1's cascade: invalidating a Content Freeze invalidates
+     * every approval downstream of it.
+     */
+    downstreamOf(gateId: string): string[];
+}
+//# sourceMappingURL=definition.d.ts.map

package/dist/definition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"definition.d.ts","sourceRoot":"","sources":["../src/definition.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAIrD;;;;;;;GAOG;AACH,eAAO,MAAM,WAAW;AACtB,+DAA+D;AAC/D,WAAW;AACX,+DAA+D;AAC/D,iBAAiB;AACjB,mFAAmF;AACnF,gBAAgB;AAChB,6FAA6F;AAC7F,cAAc,CACN,CAAC;AAEX,uBAAuB;AACvB,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC;AAErD;;;;;;;GAOG;AACH,eAAO,MAAM,iBAAiB,YAAI,UAAU,EAAE,UAAU,CAAU,CAAC;AAEnE,6BAA6B;AAC7B,MAAM,MAAM,eAAe,GAAG,CAAC,OAAO,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEjE;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,iBAAiB;IAChC,6EAA6E;IAC7E,SAAS,EAAE,MAAM,CAAC;IAClB,uFAAuF;IACvF,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,kEAAkE;IAClE,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;OAKG;IACH,MAAM,EAAE,MAAM,CAAC;IACf,4BAA4B;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,yDAAyD;IACzD,KAAK,EAAE,SAAS,CAAC;IACjB,qDAAqD;IACrD,WAAW,EAAE,eAAe,CAAC;IAC7B;;;;;;;;;;OAUG;IACH,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB;;;;;;OAMG;IACH,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B;;;;;;OAMG;IACH,mBAAmB,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC;IAC3C;;;;;;OAMG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,qFAAqF;IACrF,iBAAiB,CAAC,EAAE,iBAAiB,CAAC;IACtC;;;;;;;OAOG;IACH,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5B;AAED,gDAAgD;AAChD,MAAM,WAAW,sBAAuB,SAAQ,cAAc;IAC5D,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7B,mBAAmB,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,eAAe,EAAE,OAAO,CAAC;IACzB,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CAC3B;AAUD;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,UAAU,EAAE,cAAc,GAAG,sBAAsB,CA8DzF;AAED;;;;;;GAMG;AACH,qBAAa,YAAY;;IAGvB,OAAO,eAEN;IAED;;;;;;OAMG;IACH,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,cAAc,EAAE,GAAG,YAAY,CAsChE;IAED,uCAAuC;IACvC,IAAI,IAAI,sBAAsB,EAAE,CAE/B;IAED,sCAAsC;IACtC,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAE3B;IAED,iEAAiE;IACjE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,sBAAsB,GAAG,SAAS,CAEtD;IAED;;;;OAIG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,sBAAsB,CAU9C;IAED,8CAA8C;IAC9C,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,sBAAsB,EAAE,CAErD;IAED;;;;;OAKG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAiBrC;CACF"}