@gate-forge/core 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 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 UKD
+
+   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/baselines/adoption.d.ts

@@ -0,0 +1,76 @@
+import { type AdoptionRecord } from '../schemas/adoption.js';
+/** The adoption record's fixed file name, beside the baseline document. */
+export declare const ADOPTION_RECORD_FILENAME = "adoption.json";
+/**
+ * Loads the adoption record for a repo.
+ *
+ * Args:
+ *   path: adoption-record file path (`.gateforge/baselines/adoption.json`).
+ *
+ * Returns:
+ *   AdoptionRecord | null: the validated record, or null when absent
+ *   (pre-adoption repo).
+ *
+ * Throws:
+ *   GateforgeBaselineError: when the file exists but is unparsable or
+ *   fails schema validation (fail closed — never silently unsanctioned).
+ */
+export declare function loadAdoptionRecord(path: string): AdoptionRecord | null;
+/**
+ * Writes an adoption record to disk, creating parent directories as
+ * needed. Serialized sorted 2-space JSON with a trailing newline
+ * (reviewable in diffs, like the baseline document).
+ *
+ * Args:
+ *   path: destination file path.
+ *   record: the validated adoption record.
+ *
+ * Throws:
+ *   GateforgeBaselineError: when the file cannot be written.
+ */
+export declare function writeAdoptionRecord(path: string, record: AdoptionRecord): void;
+/**
+ * The classification layer of the sanctioned bulk-add (two-layer
+ * adoption): normalizes the classification-blocked resource ids captured
+ * at adoption time into the receipt's canonical form — sorted, duplicate-
+ * free, schema-validated. Input order is irrelevant; duplicates are
+ * collapsed (the ids are collected from blocking entries, so exact
+ * duplicates are expected to be absent, not an error).
+ *
+ * Args:
+ *   resourceIds: the classification-blocked resource ids captured at
+ *     adoption time (entries with kind 'classification' and a derived id).
+ *
+ * Returns:
+ *   string[]: the validated, sorted, unique id list for the receipt.
+ *
+ * Throws:
+ *   GateforgeBaselineError: when any id fails schema validation.
+ */
+export declare function adoptClassificationBlocked(resourceIds: readonly string[]): string[];
+/**
+ * The classification set's ONLY mutation after adoption (the shrink path,
+ * mirroring `updateBaseline`'s GF-07/08 semantics): replaces the receipt's
+ * `classificationBlocked` with the given ids, which must be a STRICT
+ * SUBSET of the current set — every id kept must exist today AND at least
+ * one id must be removed. A resource leaves the set only when it gained a
+ * real classification; adding or re-listing ids fails closed (the adopted
+ * set can never grow, so new classification debt can never be laundered
+ * into the sanctioned starting point).
+ *
+ * Args:
+ *   current: the adopted record on disk (its effective classification set,
+ *     [] when the field is absent).
+ *   resourceIds: the ids to keep (duplicates are an error, as in
+ *     `updateBaseline`).
+ *
+ * Returns:
+ *   AdoptionRecord: the next record — identical to `current` except for
+ *   the (always-present, possibly empty) shrunk `classificationBlocked`.
+ *
+ * Throws:
+ *   GateforgeBaselineError: on duplicate input, schema-invalid ids, or a
+ *   non-strict-subset update (naming the added ids).
+ */
+export declare function shrinkClassificationBlocked(current: AdoptionRecord, resourceIds: readonly string[]): AdoptionRecord;
+//# sourceMappingURL=adoption.d.ts.map

package/dist/baselines/adoption.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"adoption.d.ts","sourceRoot":"","sources":["../../src/baselines/adoption.ts"],"names":[],"mappings":"AAgBA,OAAO,EAGL,KAAK,cAAc,EACpB,MAAM,wBAAwB,CAAC;AAEhC,2EAA2E;AAC3E,eAAO,MAAM,wBAAwB,kBAAkB,CAAC;AAExD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI,CAkBtE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,GAAG,IAAI,CAS9E;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,0BAA0B,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,CAmBnF;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,cAAc,EACvB,WAAW,EAAE,SAAS,MAAM,EAAE,GAC7B,cAAc,CA8BhB"}

package/dist/baselines/adoption.js

@@ -0,0 +1,163 @@
+/**
+ * Adoption record persistence (phase 8 workstream C): load/write
+ * `.gateforge/baselines/adoption.json` — the one-time, loud record that
+ * sanctions the baseline's initial bulk-add (see schemas/adoption.ts for
+ * the sibling-file decision). Loading and writing are synchronous,
+ * matching `loadBaseline`'s convention.
+ *
+ * Trust semantics (fail closed): a MISSING record is the legitimate
+ * pre-adoption state and loads as `null`; a PRESENT but unparsable or
+ * schema-violating record throws — the gate must never guess whether an
+ * unreadable adoption record does or does not sanction the baseline.
+ */
+import { existsSync, mkdirSync, readFileSync, writeFileSync } from 'node:fs';
+import { dirname } from 'node:path';
+import { compareStrings } from '../graph/util.js';
+import { GateforgeBaselineError } from './index.js';
+import { AdoptionRecordSchema, ClassificationBlockedIdsSchema, } from '../schemas/adoption.js';
+/** The adoption record's fixed file name, beside the baseline document. */
+export const ADOPTION_RECORD_FILENAME = 'adoption.json';
+/**
+ * Loads the adoption record for a repo.
+ *
+ * Args:
+ *   path: adoption-record file path (`.gateforge/baselines/adoption.json`).
+ *
+ * Returns:
+ *   AdoptionRecord | null: the validated record, or null when absent
+ *   (pre-adoption repo).
+ *
+ * Throws:
+ *   GateforgeBaselineError: when the file exists but is unparsable or
+ *   fails schema validation (fail closed — never silently unsanctioned).
+ */
+export function loadAdoptionRecord(path) {
+    if (!existsSync(path))
+        return null;
+    let document;
+    try {
+        document = JSON.parse(readFileSync(path, 'utf8'));
+    }
+    catch (error) {
+        throw new GateforgeBaselineError(`adoption record '${path}' could not be loaded: ${error instanceof Error ? error.message : String(error)}`);
+    }
+    const result = AdoptionRecordSchema.safeParse(document);
+    if (!result.success) {
+        const issues = result.error.issues
+            .map((issue) => `${issue.path.join('.') || '<adoption>'}: ${issue.message}`)
+            .join('; ');
+        throw new GateforgeBaselineError(`adoption record '${path}' failed validation: ${issues}`);
+    }
+    return result.data;
+}
+/**
+ * Writes an adoption record to disk, creating parent directories as
+ * needed. Serialized sorted 2-space JSON with a trailing newline
+ * (reviewable in diffs, like the baseline document).
+ *
+ * Args:
+ *   path: destination file path.
+ *   record: the validated adoption record.
+ *
+ * Throws:
+ *   GateforgeBaselineError: when the file cannot be written.
+ */
+export function writeAdoptionRecord(path, record) {
+    try {
+        mkdirSync(dirname(path), { recursive: true });
+        writeFileSync(path, `${JSON.stringify(record, null, 2)}\n`, 'utf8');
+    }
+    catch (error) {
+        throw new GateforgeBaselineError(`adoption record '${path}' could not be written: ${error instanceof Error ? error.message : String(error)}`);
+    }
+}
+/**
+ * The classification layer of the sanctioned bulk-add (two-layer
+ * adoption): normalizes the classification-blocked resource ids captured
+ * at adoption time into the receipt's canonical form — sorted, duplicate-
+ * free, schema-validated. Input order is irrelevant; duplicates are
+ * collapsed (the ids are collected from blocking entries, so exact
+ * duplicates are expected to be absent, not an error).
+ *
+ * Args:
+ *   resourceIds: the classification-blocked resource ids captured at
+ *     adoption time (entries with kind 'classification' and a derived id).
+ *
+ * Returns:
+ *   string[]: the validated, sorted, unique id list for the receipt.
+ *
+ * Throws:
+ *   GateforgeBaselineError: when any id fails schema validation.
+ */
+export function adoptClassificationBlocked(resourceIds) {
+    const seen = {};
+    const unique = [];
+    for (const id of resourceIds) {
+        if (id in seen)
+            continue;
+        seen[id] = true;
+        unique.push(id);
+    }
+    unique.sort(compareStrings);
+    const result = ClassificationBlockedIdsSchema.safeParse(unique);
+    if (!result.success) {
+        const issues = result.error.issues
+            .map((issue) => `${issue.path.join('.') || '<classificationBlocked>'}: ${issue.message}`)
+            .join('; ');
+        throw new GateforgeBaselineError(`adoption classification set failed validation: ${issues}`);
+    }
+    return result.data;
+}
+/**
+ * The classification set's ONLY mutation after adoption (the shrink path,
+ * mirroring `updateBaseline`'s GF-07/08 semantics): replaces the receipt's
+ * `classificationBlocked` with the given ids, which must be a STRICT
+ * SUBSET of the current set — every id kept must exist today AND at least
+ * one id must be removed. A resource leaves the set only when it gained a
+ * real classification; adding or re-listing ids fails closed (the adopted
+ * set can never grow, so new classification debt can never be laundered
+ * into the sanctioned starting point).
+ *
+ * Args:
+ *   current: the adopted record on disk (its effective classification set,
+ *     [] when the field is absent).
+ *   resourceIds: the ids to keep (duplicates are an error, as in
+ *     `updateBaseline`).
+ *
+ * Returns:
+ *   AdoptionRecord: the next record — identical to `current` except for
+ *   the (always-present, possibly empty) shrunk `classificationBlocked`.
+ *
+ * Throws:
+ *   GateforgeBaselineError: on duplicate input, schema-invalid ids, or a
+ *   non-strict-subset update (naming the added ids).
+ */
+export function shrinkClassificationBlocked(current, resourceIds) {
+    const seen = {};
+    const unique = [];
+    for (const id of resourceIds) {
+        if (id in seen)
+            continue;
+        seen[id] = true;
+        unique.push(id);
+    }
+    if (unique.length !== resourceIds.length) {
+        throw new GateforgeBaselineError('classification shrink input contains duplicate resource ids');
+    }
+    const currentSet = current.classificationBlocked ?? [];
+    const known = {};
+    for (const id of currentSet)
+        known[id] = true;
+    const unknown = unique.filter((id) => !(id in known));
+    if (unique.length >= currentSet.length || unknown.length > 0) {
+        throw new GateforgeBaselineError(`classification shrink rejected: not a strict subset of the adopted set ` +
+            `(the adopted classification set is shrink-only) — unknown or added id(s): ` +
+            `${(unknown.length > 0 ? unknown : unique).join(', ') || '<none>'}`);
+    }
+    const validated = adoptClassificationBlocked(unique);
+    const next = validated.length > 0
+        ? { ...current, classificationBlocked: validated }
+        : { ...current, classificationBlocked: [] };
+    return AdoptionRecordSchema.parse(next);
+}
+//# sourceMappingURL=adoption.js.map

package/dist/baselines/adoption.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"adoption.js","sourceRoot":"","sources":["../../src/baselines/adoption.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,EACL,oBAAoB,EACpB,8BAA8B,GAE/B,MAAM,wBAAwB,CAAC;AAEhC,2EAA2E;AAC3E,MAAM,CAAC,MAAM,wBAAwB,GAAG,eAAe,CAAC;AAExD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,IAAI,QAAiB,CAAC;IACtB,IAAI,CAAC;QACH,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,sBAAsB,CAC9B,oBAAoB,IAAI,0BAA0B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAC3G,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,oBAAoB,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACxD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM;aAC/B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,YAAY,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC;aAC3E,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,IAAI,sBAAsB,CAAC,oBAAoB,IAAI,wBAAwB,MAAM,EAAE,CAAC,CAAC;IAC7F,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC;AACrB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY,EAAE,MAAsB;IACtE,IAAI,CAAC;QACH,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9C,aAAa,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACtE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,sBAAsB,CAC9B,oBAAoB,IAAI,2BAA2B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAC5G,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,0BAA0B,CAAC,WAA8B;IACvE,MAAM,IAAI,GAAyB,EAAE,CAAC;IACtC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,IAAI,EAAE,IAAI,IAAI;YAAE,SAAS;QACzB,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAG,8BAA8B,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAChE,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM;aAC/B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,yBAAyB,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC;aACxF,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,IAAI,sBAAsB,CAC9B,kDAAkD,MAAM,EAAE,CAC3D,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC;AACrB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,2BAA2B,CACzC,OAAuB,EACvB,WAA8B;IAE9B,MAAM,IAAI,GAAyB,EAAE,CAAC;IACtC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,IAAI,EAAE,IAAI,IAAI;YAAE,SAAS;QACzB,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,IAAI,sBAAsB,CAC9B,6DAA6D,CAC9D,CAAC;IACJ,CAAC;IACD,MAAM,UAAU,GAAG,OAAO,CAAC,qBAAqB,IAAI,EAAE,CAAC;IACvD,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,KAAK,MAAM,EAAE,IAAI,UAAU;QAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IAC9C,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC;IACtD,IAAI,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,sBAAsB,CAC9B,yEAAyE;YACvE,4EAA4E;YAC5E,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,CACtE,CAAC;IACJ,CAAC;IACD,MAAM,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC,CAAC;IACrD,MAAM,IAAI,GACR,SAAS,CAAC,MAAM,GAAG,CAAC;QAClB,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,qBAAqB,EAAE,SAAS,EAAE;QAClD,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,qBAAqB,EAAE,EAAE,EAAE,CAAC;IAChD,OAAO,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AAC1C,CAAC"}

package/dist/baselines/index.d.ts

@@ -0,0 +1,102 @@
+import { type Baseline } from '../schemas/baseline.js';
+/**
+ * Error raised for any fail-closed baseline problem: missing file,
+ * unparsable JSON, schema violation, or a non-strict-subset update
+ * (GF-07's count-preserving debt laundering).
+ */
+export declare class GateforgeBaselineError extends Error {
+    constructor(message: string);
+}
+/**
+ * Loads and validates a baseline document. Fail-closed: a missing,
+ * unparsable, or schema-violating file throws — callers decide whether
+ * that means "no baseline yet" for their flow.
+ *
+ * Args:
+ *   path: baseline file path (default `.gateforge/baselines/obligations.json`).
+ *
+ * Returns:
+ *   Baseline: the validated document (sorted, duplicate-free fingerprints).
+ *
+ * Throws:
+ *   GateforgeBaselineError: on any load or validation failure.
+ */
+export declare function loadBaseline(path: string): Baseline;
+/**
+ * Whether a baseline update is a strict subset (invariant 4): every
+ * fingerprint in `next` exists in `current` AND at least one fingerprint
+ * is removed. `[A, B] → [A, B]` is not an update (nothing was resolved)
+ * and `[A, B] → [A, NEW]` fails (GF-07); `[A, B] → [A]` passes (GF-08).
+ *
+ * Args:
+ *   current: the baseline on disk.
+ *   next: the proposed replacement.
+ *
+ * Returns:
+ *   boolean: true only for a non-empty proper subset.
+ */
+export declare function canUpdate(current: Baseline, next: Baseline): boolean;
+/**
+ * THE ONE SANCTIONED BULK-ADD (phase 8 workstream C, `gateforge adopt`):
+ * builds the adoption baseline from every currently-unresolved
+ * fingerprint, WITHOUT the strict-subset check. This is the controlled
+ * escape GF-07/08's anti-laundering invariant demands: adoption is a
+ * dated, count-annotated, loudly-printed event recorded in
+ * `adoption.json` (see baselines/adoption.ts), and it happens at most
+ * once per repo — the adopt command refuses a second bulk-add and sends
+ * subsequent debt to `updateBaseline` (shrink-only) or the gate itself.
+ * The companion record gates enforcement: `check` honors a baseline only
+ * when its adoption record exists, so this function's output can never
+ * forgive silently. Input order is irrelevant; duplicates are collapsed
+ * (the red set is collected from disjoint sources — verdicts and
+ * blocking entries — so duplicates are expected to be absent, not an
+ * error like in `updateBaseline`).
+ *
+ * Args:
+ *   fingerprints: the unresolved fingerprints captured at adoption time.
+ *
+ * Returns:
+ *   Baseline: the validated initial baseline document (sorted, unique).
+ */
+export declare function adoptBaseline(fingerprints: readonly string[]): Baseline;
+/**
+ * Builds the next baseline from raw fingerprints, enforcing the strict-
+ * subset rule (invariant 4) against `current`. Input order is irrelevant:
+ * the result is sorted; duplicates in the input are an error.
+ *
+ * Args:
+ *   current: the baseline on disk.
+ *   fingerprints: the resolved fingerprints to keep.
+ *
+ * Returns:
+ *   Baseline: the validated next document.
+ *
+ * Throws:
+ *   GateforgeBaselineError: on duplicates or a non-strict-subset update
+ *   (naming the added fingerprints — GF-07's laundering attempt).
+ */
+export declare function updateBaseline(current: Baseline, fingerprints: readonly string[]): Baseline;
+/**
+ * Serializes a baseline for on-disk storage: sorted 2-space JSON with a
+ * trailing newline (reviewable in diffs; canonical hashing is a separate
+ * pin-#1 concern and does not apply to this file's formatting).
+ *
+ * Args:
+ *   baseline: the document to serialize.
+ *
+ * Returns:
+ *   string: the file content.
+ */
+export declare function serializeBaseline(baseline: Baseline): string;
+/**
+ * Writes a baseline to disk, creating parent directories as needed.
+ *
+ * Args:
+ *   path: destination file path.
+ *   baseline: the document to write.
+ *
+ * Throws:
+ *   GateforgeBaselineError: when the file cannot be written.
+ */
+export declare function writeBaseline(path: string, baseline: Baseline): void;
+//# sourceMappingURL=index.d.ts.map

package/dist/baselines/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/baselines/index.ts"],"names":[],"mappings":"AAWA,OAAO,EAAkB,KAAK,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAEvE;;;;GAIG;AACH,qBAAa,sBAAuB,SAAQ,KAAK;gBACnC,OAAO,EAAE,MAAM;CAI5B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAiBnD;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,OAAO,CAKpE;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,aAAa,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,GAAG,QAAQ,CAUvE;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,MAAM,EAAE,GAAG,QAAQ,CA0B3F;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAE5D;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI,CASpE"}