@discretion/core 0.1.0

package/dist/src/checksums/digits.js

@@ -0,0 +1,114 @@
+/**
+ * Digit and character helpers shared by every checksum implementation.
+ *
+ * These exist so that the algorithm modules (luhn, mod97, verhoeff, …) deal
+ * only in `number[]` and never re-implement parsing. Every function here is
+ * total: it returns `null` on malformed input rather than throwing, because
+ * checksum code runs on arbitrary user text where malformed input is the
+ * common case, not an exceptional one.
+ */
+/** ASCII '0'–'9'. */
+const ZERO = 0x30;
+const NINE = 0x39;
+/**
+ * Parse a string of ASCII digits into numeric digit values.
+ *
+ * Returns `null` if the string is empty or contains any non-digit character.
+ * Deliberately rejects non-ASCII digits (Arabic-Indic ٤, fullwidth ４, …):
+ * Stage 0 normalization already folds fullwidth forms to ASCII, and a
+ * genuinely non-ASCII digit run is not an identifier in any scheme we
+ * validate.
+ */
+export function toDigits(value) {
+    if (value.length === 0)
+        return null;
+    const digits = new Array(value.length);
+    for (let i = 0; i < value.length; i++) {
+        const code = value.charCodeAt(i);
+        if (code < ZERO || code > NINE)
+            return null;
+        digits[i] = code - ZERO;
+    }
+    return digits;
+}
+/**
+ * Remove every character in `separators` from `value`.
+ *
+ * Identifiers are routinely written with grouping punctuation (`4111 1111
+ * 1111 1111`, `123-45-6789`, `AB-12-CD`). Detectors strip before validating
+ * and keep the raw span for offset reporting.
+ */
+export function stripSeparators(value, separators = ' \t-.–—/') {
+    let out = '';
+    for (const ch of value) {
+        if (!separators.includes(ch))
+            out += ch;
+    }
+    return out;
+}
+/**
+ * Value of an alphanumeric character in base 36: '0'–'9' → 0–9,
+ * 'A'/'a'–'Z'/'z' → 10–35. Returns `null` for anything else.
+ *
+ * This is the mapping IBAN's mod-97 and several VAT schemes use to fold
+ * letters into the numeric checksum.
+ */
+export function alphanumericValue(ch) {
+    if (ch.length !== 1)
+        return null;
+    const code = ch.charCodeAt(0);
+    if (code >= ZERO && code <= NINE)
+        return code - ZERO;
+    if (code >= 0x41 && code <= 0x5a)
+        return code - 0x41 + 10; // A-Z
+    if (code >= 0x61 && code <= 0x7a)
+        return code - 0x61 + 10; // a-z
+    return null;
+}
+/**
+ * Expand every character of `value` to its base-36 value and concatenate the
+ * decimal representations, the transformation IBAN mod-97 requires.
+ *
+ * "GB82" → "161182"  (G=16, B=11, 8, 2)
+ *
+ * Returns `null` if any character is not alphanumeric.
+ */
+export function toNumericString(value) {
+    let out = '';
+    for (const ch of value) {
+        const v = alphanumericValue(ch);
+        if (v === null)
+            return null;
+        out += v.toString(10);
+    }
+    return out;
+}
+/** True when every character is an ASCII digit and the string is non-empty. */
+export function isAllDigits(value) {
+    if (value.length === 0)
+        return false;
+    for (let i = 0; i < value.length; i++) {
+        const code = value.charCodeAt(i);
+        if (code < ZERO || code > NINE)
+            return false;
+    }
+    return true;
+}
+/**
+ * True when every digit is identical ("0000000000", "1111111111").
+ *
+ * Repdigits pass several national checksums by construction (a weighted sum
+ * of identical digits often lands on a valid remainder) yet are never issued.
+ * Schemes that exclude them say so in their own validator.
+ */
+export function isRepdigit(digits) {
+    if (digits.length === 0)
+        return false;
+    const first = digits[0];
+    for (let i = 1; i < digits.length; i++) {
+        if (digits[i] !== first)
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=digits.js.map

package/dist/src/checksums/digits.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"digits.js","sourceRoot":"","sources":["../../../src/checksums/digits.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,qBAAqB;AACrB,MAAM,IAAI,GAAG,IAAI,CAAC;AAClB,MAAM,IAAI,GAAG,IAAI,CAAC;AAElB;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAa;IACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,MAAM,GAAa,IAAI,KAAK,CAAS,KAAK,CAAC,MAAM,CAAC,CAAC;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI;YAAE,OAAO,IAAI,CAAC;QAC5C,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;IAC1B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa,EAAE,UAAU,GAAG,UAAU;IACpE,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,GAAG,IAAI,EAAE,CAAC;IAC1C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,EAAU;IAC1C,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACjC,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,GAAG,IAAI,CAAC;IACrD,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,MAAM;IACjE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,MAAM;IACjE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC5B,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,WAAW,CAAC,KAAa;IACvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI;YAAE,OAAO,KAAK,CAAC;IAC/C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,MAAyB;IAClD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/src/checksums/icao9303.d.ts

@@ -0,0 +1,29 @@
+/**
+ * ICAO 9303 machine-readable-zone check digits.
+ *
+ * One weighting for every MRZ field on every document type: cycle the
+ * weights 7, 3, 1 across the field, mapping '0'–'9' to their value, 'A'–'Z'
+ * to 10–35, and the filler '<' to 0; the check digit is the sum mod 10.
+ *
+ * Lives in the checksum library rather than in the MRZ detector because
+ * SPEC.md wants each algorithm implemented and tested once, and TD1, TD2,
+ * TD3 and the composite check all call it with different slices.
+ */
+/**
+ * Character value under the MRZ scheme: digits are themselves, letters are
+ * 10 + their alphabet position, '<' is 0. Returns null for anything else.
+ */
+export declare function mrzCharValue(ch: string): number | null;
+/**
+ * The ICAO check digit for a field. Returns null if the field contains a
+ * character outside the MRZ alphabet.
+ */
+export declare function mrzCheckDigit(field: string): number | null;
+/**
+ * Verify a field against its trailing check character.
+ *
+ * The check character may itself be '<' in the optional-data field of some
+ * documents, which ICAO treats as zero — handled by `mrzCharValue`.
+ */
+export declare function mrzCheckValid(field: string, check: string): boolean;
+//# sourceMappingURL=icao9303.d.ts.map

package/dist/src/checksums/icao9303.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"icao9303.d.ts","sourceRoot":"","sources":["../../../src/checksums/icao9303.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH;;;GAGG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAMtD;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAQ1D;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAMnE"}

package/dist/src/checksums/icao9303.js

@@ -0,0 +1,56 @@
+/**
+ * ICAO 9303 machine-readable-zone check digits.
+ *
+ * One weighting for every MRZ field on every document type: cycle the
+ * weights 7, 3, 1 across the field, mapping '0'–'9' to their value, 'A'–'Z'
+ * to 10–35, and the filler '<' to 0; the check digit is the sum mod 10.
+ *
+ * Lives in the checksum library rather than in the MRZ detector because
+ * SPEC.md wants each algorithm implemented and tested once, and TD1, TD2,
+ * TD3 and the composite check all call it with different slices.
+ */
+const WEIGHTS = [7, 3, 1];
+/**
+ * Character value under the MRZ scheme: digits are themselves, letters are
+ * 10 + their alphabet position, '<' is 0. Returns null for anything else.
+ */
+export function mrzCharValue(ch) {
+    if (ch === '<')
+        return 0;
+    const code = ch.charCodeAt(0);
+    if (code >= 0x30 && code <= 0x39)
+        return code - 0x30;
+    if (code >= 0x41 && code <= 0x5a)
+        return code - 0x41 + 10;
+    return null;
+}
+/**
+ * The ICAO check digit for a field. Returns null if the field contains a
+ * character outside the MRZ alphabet.
+ */
+export function mrzCheckDigit(field) {
+    let sum = 0;
+    for (let i = 0; i < field.length; i++) {
+        const v = mrzCharValue(field[i]);
+        if (v === null)
+            return null;
+        sum += v * WEIGHTS[i % 3];
+    }
+    return sum % 10;
+}
+/**
+ * Verify a field against its trailing check character.
+ *
+ * The check character may itself be '<' in the optional-data field of some
+ * documents, which ICAO treats as zero — handled by `mrzCharValue`.
+ */
+export function mrzCheckValid(field, check) {
+    if (check.length !== 1)
+        return false;
+    const expected = mrzCheckDigit(field);
+    if (expected === null)
+        return false;
+    const actual = mrzCharValue(check);
+    return actual !== null && actual === expected;
+}
+//# sourceMappingURL=icao9303.js.map

package/dist/src/checksums/icao9303.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"icao9303.js","sourceRoot":"","sources":["../../../src/checksums/icao9303.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,MAAM,OAAO,GAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAE7C;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,EAAU;IACrC,IAAI,EAAE,KAAK,GAAG;QAAE,OAAO,CAAC,CAAC;IACzB,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,GAAG,IAAI,CAAC;IACrD,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;IAC1D,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC5B,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;IAC7B,CAAC;IACD,OAAO,GAAG,GAAG,EAAE,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,KAAa;IACxD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,OAAO,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,QAAQ,CAAC;AAChD,CAAC"}

package/dist/src/checksums/index.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Shared checksum library.
+ *
+ * SPEC.md, Stage 1: "implement with full checksum validation, not pattern
+ * matching". These are the algorithms the identifier validators are built
+ * from — each implemented once here, tested once in
+ * `test/checksums.test.ts`, and reused by every detector that needs it.
+ *
+ * Nothing in this directory knows what a detector or an entity type is. These
+ * are pure functions over strings and digit arrays, which is what makes them
+ * cheap to property-test exhaustively.
+ */
+export { toDigits, stripSeparators, alphanumericValue, toNumericString, isAllDigits, isRepdigit } from './digits.js';
+export { weightedSum, weightedMod, weightedModBy, cyclicWeightedMod, complement } from './weighted.js';
+export { luhnValid, luhnCheckDigit } from './luhn.js';
+export { verhoeffValid, verhoeffCheckDigit } from './verhoeff.js';
+export { modString, ibanMod97Valid, ibanCheckDigits, mod97Key } from './mod97.js';
+export { iso7064PureCheckValue, iso7064PureValid, mod11_2Valid, mod11_2CheckChar, mod37_36Valid, mod11_10CheckDigit, mod11_10Valid, } from './iso7064.js';
+export { abaValid, abaCheckDigit } from './aba.js';
+export { mrzCharValue, mrzCheckDigit, mrzCheckValid } from './icao9303.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/checksums/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/checksums/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,iBAAiB,EAAE,eAAe,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAErH,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAEvG,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAEtD,OAAO,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAElE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAElF,OAAO,EACL,qBAAqB,EACrB,gBAAgB,EAChB,YAAY,EACZ,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,aAAa,GACd,MAAM,cAAc,CAAC;AAEtB,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEnD,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC"}

package/dist/src/checksums/index.js

@@ -0,0 +1,21 @@
+/**
+ * Shared checksum library.
+ *
+ * SPEC.md, Stage 1: "implement with full checksum validation, not pattern
+ * matching". These are the algorithms the identifier validators are built
+ * from — each implemented once here, tested once in
+ * `test/checksums.test.ts`, and reused by every detector that needs it.
+ *
+ * Nothing in this directory knows what a detector or an entity type is. These
+ * are pure functions over strings and digit arrays, which is what makes them
+ * cheap to property-test exhaustively.
+ */
+export { toDigits, stripSeparators, alphanumericValue, toNumericString, isAllDigits, isRepdigit } from './digits.js';
+export { weightedSum, weightedMod, weightedModBy, cyclicWeightedMod, complement } from './weighted.js';
+export { luhnValid, luhnCheckDigit } from './luhn.js';
+export { verhoeffValid, verhoeffCheckDigit } from './verhoeff.js';
+export { modString, ibanMod97Valid, ibanCheckDigits, mod97Key } from './mod97.js';
+export { iso7064PureCheckValue, iso7064PureValid, mod11_2Valid, mod11_2CheckChar, mod37_36Valid, mod11_10CheckDigit, mod11_10Valid, } from './iso7064.js';
+export { abaValid, abaCheckDigit } from './aba.js';
+export { mrzCharValue, mrzCheckDigit, mrzCheckValid } from './icao9303.js';
+//# sourceMappingURL=index.js.map

package/dist/src/checksums/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/checksums/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,iBAAiB,EAAE,eAAe,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAErH,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAEvG,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAEtD,OAAO,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAElE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAElF,OAAO,EACL,qBAAqB,EACrB,gBAAgB,EAChB,YAAY,EACZ,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,aAAa,GACd,MAAM,cAAc,CAAC;AAEtB,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEnD,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC"}

package/dist/src/checksums/iso7064.d.ts

@@ -0,0 +1,67 @@
+/**
+ * ISO/IEC 7064 check character systems.
+ *
+ * A family of standardized checksums, of which Stage 1 needs several:
+ *   • MOD 11-2  — China's Resident Identity Card (check char 0-9 or 'X')
+ *   • MOD 97-10 — the system underlying IBAN and several VAT schemes
+ *   • MOD 37-36 — alphanumeric identifiers
+ *   • MOD 11-10 — a hybrid system used by some national registries
+ *
+ * The "pure" systems (MOD M-R, where R is a power used as a multiplier) all
+ * share one recurrence, so it is written once here and parameterized by
+ * modulus and radix. That is exactly the reuse SPEC.md asks for: these are
+ * the same algorithm with different constants, and implementing MOD 11-2 by
+ * hand per country is how transcription bugs get in.
+ *
+ * Pure system recurrence, over the payload characters:
+ *     P ← ((P + aᵢ) × R) mod M
+ * The check value is then (M + 1 − P) mod M. Verification appends the check
+ * value with a final addition instead of a multiplication and requires the
+ * result to be 1.
+ */
+/**
+ * The check value for a payload under a pure ISO 7064 system.
+ *
+ * Returns a number in `[0, modulus)`. Callers map it to a character according
+ * to their scheme's alphabet (10 → 'X' for MOD 11-2, for instance).
+ */
+export declare function iso7064PureCheckValue(values: readonly number[], modulus: number, radix: number): number;
+/**
+ * Verify a payload plus its check value under a pure ISO 7064 system.
+ *
+ * The standard verification processes the payload with the multiplying
+ * recurrence, then adds the check value once and requires a result of 1.
+ */
+export declare function iso7064PureValid(payloadValues: readonly number[], checkValue: number, modulus: number, radix: number): boolean;
+/**
+ * ISO 7064 MOD 11-2 over a decimal payload.
+ *
+ * `payload` must be all ASCII digits; `check` is the trailing check character,
+ * either a digit or 'X'/'x' representing 10. This is China's Resident
+ * Identity Card checksum.
+ */
+export declare function mod11_2Valid(payload: string, check: string): boolean;
+/**
+ * The MOD 11-2 check character for a decimal payload: '0'–'9' or 'X'.
+ * Returns `null` if the payload contains a non-digit.
+ */
+export declare function mod11_2CheckChar(payload: string): string | null;
+/**
+ * ISO 7064 MOD 37-36 over an alphanumeric payload, with a check character
+ * drawn from 0-9, A-Z, '*'.
+ */
+export declare function mod37_36Valid(payload: string, check: string): boolean;
+/**
+ * ISO 7064 MOD 11-10, a hybrid system. Unlike the pure systems this carries
+ * the running value through a different recurrence and closes with a single
+ * decimal check digit.
+ *
+ *     P ← 10  (seed)
+ *     for each digit d:  P ← ((P mod 11) + d) mod 10, folding 0 to 10, ×2 mod 11
+ *
+ * Expressed in the standard's own terms below.
+ */
+export declare function mod11_10CheckDigit(payload: string): number | null;
+/** Verify a decimal payload plus trailing check digit under MOD 11-10. */
+export declare function mod11_10Valid(payload: string, check: string): boolean;
+//# sourceMappingURL=iso7064.d.ts.map

package/dist/src/checksums/iso7064.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"iso7064.d.ts","sourceRoot":"","sources":["../../../src/checksums/iso7064.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAmBH;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,GACZ,MAAM,CAER;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,aAAa,EAAE,SAAS,MAAM,EAAE,EAChC,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,GACZ,OAAO,CAGT;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAapE;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAU/D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAarE;AAED;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAWjE;AAED,0EAA0E;AAC1E,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAKrE"}

package/dist/src/checksums/iso7064.js

@@ -0,0 +1,159 @@
+/**
+ * ISO/IEC 7064 check character systems.
+ *
+ * A family of standardized checksums, of which Stage 1 needs several:
+ *   • MOD 11-2  — China's Resident Identity Card (check char 0-9 or 'X')
+ *   • MOD 97-10 — the system underlying IBAN and several VAT schemes
+ *   • MOD 37-36 — alphanumeric identifiers
+ *   • MOD 11-10 — a hybrid system used by some national registries
+ *
+ * The "pure" systems (MOD M-R, where R is a power used as a multiplier) all
+ * share one recurrence, so it is written once here and parameterized by
+ * modulus and radix. That is exactly the reuse SPEC.md asks for: these are
+ * the same algorithm with different constants, and implementing MOD 11-2 by
+ * hand per country is how transcription bugs get in.
+ *
+ * Pure system recurrence, over the payload characters:
+ *     P ← ((P + aᵢ) × R) mod M
+ * The check value is then (M + 1 − P) mod M. Verification appends the check
+ * value with a final addition instead of a multiplication and requires the
+ * result to be 1.
+ */
+import { alphanumericValue } from './digits.js';
+/** Character set for MOD 37-36: 0-9, A-Z, then '*' for the value 36. */
+const MOD37_ALPHABET = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ*';
+/**
+ * Run the pure-system recurrence over a sequence of character values.
+ * Returns the interim value P after the final multiplication.
+ */
+function pureInterim(values, modulus, radix) {
+    let p = 0;
+    for (const v of values) {
+        p = ((p + v) * radix) % modulus;
+    }
+    return p;
+}
+/**
+ * The check value for a payload under a pure ISO 7064 system.
+ *
+ * Returns a number in `[0, modulus)`. Callers map it to a character according
+ * to their scheme's alphabet (10 → 'X' for MOD 11-2, for instance).
+ */
+export function iso7064PureCheckValue(values, modulus, radix) {
+    return (modulus + 1 - pureInterim(values, modulus, radix)) % modulus;
+}
+/**
+ * Verify a payload plus its check value under a pure ISO 7064 system.
+ *
+ * The standard verification processes the payload with the multiplying
+ * recurrence, then adds the check value once and requires a result of 1.
+ */
+export function iso7064PureValid(payloadValues, checkValue, modulus, radix) {
+    const p = pureInterim(payloadValues, modulus, radix);
+    return (p + checkValue) % modulus === 1;
+}
+/**
+ * ISO 7064 MOD 11-2 over a decimal payload.
+ *
+ * `payload` must be all ASCII digits; `check` is the trailing check character,
+ * either a digit or 'X'/'x' representing 10. This is China's Resident
+ * Identity Card checksum.
+ */
+export function mod11_2Valid(payload, check) {
+    const values = [];
+    for (const ch of payload) {
+        const v = alphanumericValue(ch);
+        if (v === null || v > 9)
+            return false; // digits only
+        values.push(v);
+    }
+    if (values.length === 0)
+        return false;
+    const checkValue = parseCheckChar(check, 11);
+    if (checkValue === null)
+        return false;
+    return iso7064PureValid(values, checkValue, 11, 2);
+}
+/**
+ * The MOD 11-2 check character for a decimal payload: '0'–'9' or 'X'.
+ * Returns `null` if the payload contains a non-digit.
+ */
+export function mod11_2CheckChar(payload) {
+    const values = [];
+    for (const ch of payload) {
+        const v = alphanumericValue(ch);
+        if (v === null || v > 9)
+            return null;
+        values.push(v);
+    }
+    if (values.length === 0)
+        return null;
+    const check = iso7064PureCheckValue(values, 11, 2);
+    return check === 10 ? 'X' : check.toString(10);
+}
+/**
+ * ISO 7064 MOD 37-36 over an alphanumeric payload, with a check character
+ * drawn from 0-9, A-Z, '*'.
+ */
+export function mod37_36Valid(payload, check) {
+    const values = [];
+    for (const ch of payload) {
+        const v = alphanumericValue(ch);
+        if (v === null)
+            return false;
+        values.push(v);
+    }
+    if (values.length === 0)
+        return false;
+    const checkValue = MOD37_ALPHABET.indexOf(check.toUpperCase());
+    if (checkValue < 0)
+        return false;
+    return iso7064PureValid(values, checkValue, 37, 36);
+}
+/**
+ * ISO 7064 MOD 11-10, a hybrid system. Unlike the pure systems this carries
+ * the running value through a different recurrence and closes with a single
+ * decimal check digit.
+ *
+ *     P ← 10  (seed)
+ *     for each digit d:  P ← ((P mod 11) + d) mod 10, folding 0 to 10, ×2 mod 11
+ *
+ * Expressed in the standard's own terms below.
+ */
+export function mod11_10CheckDigit(payload) {
+    let p = 10;
+    for (const ch of payload) {
+        const v = alphanumericValue(ch);
+        if (v === null || v > 9)
+            return null;
+        let sum = (p + v) % 10;
+        if (sum === 0)
+            sum = 10;
+        p = (sum * 2) % 11;
+    }
+    const check = (11 - p) % 10;
+    return check;
+}
+/** Verify a decimal payload plus trailing check digit under MOD 11-10. */
+export function mod11_10Valid(payload, check) {
+    const expected = mod11_10CheckDigit(payload);
+    if (expected === null)
+        return false;
+    const actual = parseCheckChar(check, 10);
+    return actual !== null && actual === expected;
+}
+/**
+ * Parse a single check character to its numeric value.
+ * 'X'/'x' maps to 10 only when the modulus admits it (MOD 11-2).
+ */
+function parseCheckChar(check, modulus) {
+    if (check.length !== 1)
+        return null;
+    if (modulus === 11 && (check === 'X' || check === 'x'))
+        return 10;
+    const v = alphanumericValue(check);
+    if (v === null || v >= modulus || v > 9)
+        return null;
+    return v;
+}
+//# sourceMappingURL=iso7064.js.map

package/dist/src/checksums/iso7064.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iso7064.js","sourceRoot":"","sources":["../../../src/checksums/iso7064.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEhD,wEAAwE;AACxE,MAAM,cAAc,GAAG,uCAAuC,CAAC;AAE/D;;;GAGG;AACH,SAAS,WAAW,CAAC,MAAyB,EAAE,OAAe,EAAE,KAAa;IAC5E,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,CAAC;IAClC,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAAyB,EACzB,OAAe,EACf,KAAa;IAEb,OAAO,CAAC,OAAO,GAAG,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC;AACvE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,aAAgC,EAChC,UAAkB,EAClB,OAAe,EACf,KAAa;IAEb,MAAM,CAAC,GAAG,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IACrD,OAAO,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe,EAAE,KAAa;IACzD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,cAAc;QACrD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEtC,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC7C,IAAI,UAAU,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAEtC,OAAO,gBAAgB,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,MAAM,KAAK,GAAG,qBAAqB,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe,EAAE,KAAa;IAC1D,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEtC,MAAM,UAAU,GAAG,cAAc,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;IAC/D,IAAI,UAAU,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAEjC,OAAO,gBAAgB,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAe;IAChD,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACrC,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,GAAG,KAAK,CAAC;YAAE,GAAG,GAAG,EAAE,CAAC;QACxB,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IACrB,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAC5B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,aAAa,CAAC,OAAe,EAAE,KAAa;IAC1D,MAAM,QAAQ,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC7C,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACzC,OAAO,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,QAAQ,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,KAAa,EAAE,OAAe;IACpD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,IAAI,OAAO,KAAK,EAAE,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAClE,MAAM,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACrD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/src/checksums/luhn.d.ts

@@ -0,0 +1,32 @@
+/**
+ * The Luhn algorithm (ISO/IEC 7812-1), also called mod-10 double-add-double.
+ *
+ * Used by far more than credit cards: Canada's SIN, Sweden's Personnummer,
+ * South Africa's ID number, Israel's Teudat Zehut, the US NPI (over a
+ * prefixed string), Greece's AFM and IMEI all close with a Luhn digit.
+ *
+ * The algorithm, right to left over the FULL number including its check
+ * digit: double every second digit, subtract 9 from any result above 9, sum
+ * everything. The number is valid when that total is divisible by 10.
+ *
+ * Luhn catches every single-digit error and every adjacent transposition
+ * except 09↔90 — a property the tests assert directly rather than trusting.
+ */
+/**
+ * Validate a digit string against Luhn.
+ *
+ * `value` must already be stripped of separators and contain only ASCII
+ * digits; anything else returns `false`. A single digit is rejected: a
+ * one-character "identifier" carries no payload, and accepting "0" would make
+ * every scheme that closes with Luhn match a bare zero.
+ */
+export declare function luhnValid(value: string): boolean;
+/**
+ * The Luhn check digit for a payload that does NOT yet include one.
+ *
+ * Returns `null` if the payload is not all digits. Used by the test-vector
+ * generators — and later by M4's surrogate substitution, which must emit
+ * replacement values that still pass the validator.
+ */
+export declare function luhnCheckDigit(payload: string): number | null;
+//# sourceMappingURL=luhn.d.ts.map

package/dist/src/checksums/luhn.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"luhn.d.ts","sourceRoot":"","sources":["../../../src/checksums/luhn.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAIhD;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAM7D"}

package/dist/src/checksums/luhn.js

@@ -0,0 +1,66 @@
+/**
+ * The Luhn algorithm (ISO/IEC 7812-1), also called mod-10 double-add-double.
+ *
+ * Used by far more than credit cards: Canada's SIN, Sweden's Personnummer,
+ * South Africa's ID number, Israel's Teudat Zehut, the US NPI (over a
+ * prefixed string), Greece's AFM and IMEI all close with a Luhn digit.
+ *
+ * The algorithm, right to left over the FULL number including its check
+ * digit: double every second digit, subtract 9 from any result above 9, sum
+ * everything. The number is valid when that total is divisible by 10.
+ *
+ * Luhn catches every single-digit error and every adjacent transposition
+ * except 09↔90 — a property the tests assert directly rather than trusting.
+ */
+import { toDigits } from './digits.js';
+/**
+ * Validate a digit string against Luhn.
+ *
+ * `value` must already be stripped of separators and contain only ASCII
+ * digits; anything else returns `false`. A single digit is rejected: a
+ * one-character "identifier" carries no payload, and accepting "0" would make
+ * every scheme that closes with Luhn match a bare zero.
+ */
+export function luhnValid(value) {
+    const digits = toDigits(value);
+    if (digits === null || digits.length < 2)
+        return false;
+    return luhnSum(digits) % 10 === 0;
+}
+/**
+ * The Luhn check digit for a payload that does NOT yet include one.
+ *
+ * Returns `null` if the payload is not all digits. Used by the test-vector
+ * generators — and later by M4's surrogate substitution, which must emit
+ * replacement values that still pass the validator.
+ */
+export function luhnCheckDigit(payload) {
+    const digits = toDigits(payload);
+    if (digits === null)
+        return null;
+    // Append a placeholder 0, compute the sum, and take the complement.
+    const sum = luhnSum([...digits, 0]);
+    return (10 - (sum % 10)) % 10;
+}
+/**
+ * Sum the Luhn-transformed digits of a complete number.
+ *
+ * Doubling starts at the second digit from the right, i.e. positions of the
+ * same parity as the check digit are NOT doubled.
+ */
+function luhnSum(digits) {
+    let sum = 0;
+    let double = false;
+    for (let i = digits.length - 1; i >= 0; i--) {
+        let d = digits[i];
+        if (double) {
+            d *= 2;
+            if (d > 9)
+                d -= 9;
+        }
+        sum += d;
+        double = !double;
+    }
+    return sum;
+}
+//# sourceMappingURL=luhn.js.map

package/dist/src/checksums/luhn.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"luhn.js","sourceRoot":"","sources":["../../../src/checksums/luhn.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACvD,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe;IAC5C,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IACjC,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACjC,oEAAoE;IACpE,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,SAAS,OAAO,CAAC,MAAyB;IACxC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACnB,IAAI,MAAM,EAAE,CAAC;YACX,CAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,GAAG,CAAC;gBAAE,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QACD,GAAG,IAAI,CAAC,CAAC;QACT,MAAM,GAAG,CAAC,MAAM,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}