@discretion/core 0.1.0

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

@@ -0,0 +1,55 @@
+/**
+ * Mod-97 checksums.
+ *
+ * Two distinct users in Stage 1:
+ *   • IBAN (ISO 13616) — rearrange, transliterate, remainder must be 1.
+ *   • France's NIR and Belgium's Rijksregisternummer — a two-digit key that
+ *     is the complement of the payload mod 97.
+ *
+ * Both need modular arithmetic over numbers far wider than a JS `number`: a
+ * 34-character IBAN transliterates to as many as 68 decimal digits. Rather
+ * than reach for BigInt — which allocates per operation and is markedly
+ * slower in the hot path of scanning arbitrary text — this computes the
+ * remainder by streaming the digit string in chunks that always stay inside
+ * the 2^53 safe-integer range.
+ */
+/**
+ * Remainder of a decimal string modulo `modulus`, for arbitrarily long input.
+ *
+ * Processes at most 13 new digits per step. The running remainder is below
+ * `modulus` (≤ 97 here, but the bound holds for any modulus under 10^4), so
+ * `remainder × 10^13 + chunk` stays well under Number.MAX_SAFE_INTEGER.
+ *
+ * Returns `null` if the string is empty or contains a non-digit.
+ */
+export declare function modString(numeric: string, modulus: number): number | null;
+/**
+ * Validate an IBAN's mod-97 checksum (ISO 13616 / ISO 7064 MOD 97-10).
+ *
+ * Expects an IBAN already stripped of spaces and uppercased. Country-specific
+ * length and structure rules are NOT checked here — that is the IBAN
+ * detector's per-country table. This function answers exactly one question:
+ * does the checksum close?
+ *
+ * Procedure: move the first four characters (country code + check digits) to
+ * the end, replace each letter with its base-36 value, and take mod 97. A
+ * valid IBAN yields 1.
+ */
+export declare function ibanMod97Valid(iban: string): boolean;
+/**
+ * The two IBAN check digits for a country code and BBAN with no check digits
+ * yet. Returns a zero-padded two-character string, or `null` on bad input.
+ *
+ * Used by the test-vector generators and, from M4, by IBAN surrogate
+ * substitution — SPEC.md requires a substituted IBAN to have a "valid
+ * checksum, same country".
+ */
+export declare function ibanCheckDigits(countryCode: string, bban: string): string | null;
+/**
+ * The "97 minus remainder" key used by France's NIR and Belgium's national
+ * register number: `97 − (payload mod 97)`, in the range 1..97.
+ *
+ * Returns `null` if the payload is not a decimal string.
+ */
+export declare function mod97Key(payload: string): number | null;
+//# sourceMappingURL=mod97.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mod97.d.ts","sourceRoot":"","sources":["../../../src/checksums/mod97.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH;;;;;;;;GAQG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAazE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAMpD;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAQhF;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAIvD"}

package/dist/src/checksums/mod97.js

@@ -0,0 +1,94 @@
+/**
+ * Mod-97 checksums.
+ *
+ * Two distinct users in Stage 1:
+ *   • IBAN (ISO 13616) — rearrange, transliterate, remainder must be 1.
+ *   • France's NIR and Belgium's Rijksregisternummer — a two-digit key that
+ *     is the complement of the payload mod 97.
+ *
+ * Both need modular arithmetic over numbers far wider than a JS `number`: a
+ * 34-character IBAN transliterates to as many as 68 decimal digits. Rather
+ * than reach for BigInt — which allocates per operation and is markedly
+ * slower in the hot path of scanning arbitrary text — this computes the
+ * remainder by streaming the digit string in chunks that always stay inside
+ * the 2^53 safe-integer range.
+ */
+import { isAllDigits, toNumericString } from './digits.js';
+/**
+ * Remainder of a decimal string modulo `modulus`, for arbitrarily long input.
+ *
+ * Processes at most 13 new digits per step. The running remainder is below
+ * `modulus` (≤ 97 here, but the bound holds for any modulus under 10^4), so
+ * `remainder × 10^13 + chunk` stays well under Number.MAX_SAFE_INTEGER.
+ *
+ * Returns `null` if the string is empty or contains a non-digit.
+ */
+export function modString(numeric, modulus) {
+    if (modulus <= 0 || modulus > 10_000)
+        return null;
+    if (!isAllDigits(numeric))
+        return null;
+    const CHUNK = 13;
+    let remainder = 0;
+    let i = 0;
+    while (i < numeric.length) {
+        const slice = numeric.slice(i, i + CHUNK);
+        remainder = Number(`${remainder}${slice}`) % modulus;
+        i += slice.length;
+    }
+    return remainder;
+}
+/**
+ * Validate an IBAN's mod-97 checksum (ISO 13616 / ISO 7064 MOD 97-10).
+ *
+ * Expects an IBAN already stripped of spaces and uppercased. Country-specific
+ * length and structure rules are NOT checked here — that is the IBAN
+ * detector's per-country table. This function answers exactly one question:
+ * does the checksum close?
+ *
+ * Procedure: move the first four characters (country code + check digits) to
+ * the end, replace each letter with its base-36 value, and take mod 97. A
+ * valid IBAN yields 1.
+ */
+export function ibanMod97Valid(iban) {
+    if (iban.length < 5)
+        return false;
+    const rearranged = iban.slice(4) + iban.slice(0, 4);
+    const numeric = toNumericString(rearranged);
+    if (numeric === null)
+        return false;
+    return modString(numeric, 97) === 1;
+}
+/**
+ * The two IBAN check digits for a country code and BBAN with no check digits
+ * yet. Returns a zero-padded two-character string, or `null` on bad input.
+ *
+ * Used by the test-vector generators and, from M4, by IBAN surrogate
+ * substitution — SPEC.md requires a substituted IBAN to have a "valid
+ * checksum, same country".
+ */
+export function ibanCheckDigits(countryCode, bban) {
+    if (countryCode.length !== 2)
+        return null;
+    const numeric = toNumericString(`${bban}${countryCode}00`);
+    if (numeric === null)
+        return null;
+    const remainder = modString(numeric, 97);
+    if (remainder === null)
+        return null;
+    const check = 98 - remainder;
+    return check.toString(10).padStart(2, '0');
+}
+/**
+ * The "97 minus remainder" key used by France's NIR and Belgium's national
+ * register number: `97 − (payload mod 97)`, in the range 1..97.
+ *
+ * Returns `null` if the payload is not a decimal string.
+ */
+export function mod97Key(payload) {
+    const remainder = modString(payload, 97);
+    if (remainder === null)
+        return null;
+    return 97 - remainder;
+}
+//# sourceMappingURL=mod97.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mod97.js","sourceRoot":"","sources":["../../../src/checksums/mod97.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAE3D;;;;;;;;GAQG;AACH,MAAM,UAAU,SAAS,CAAC,OAAe,EAAE,OAAe;IACxD,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,GAAG,MAAM;QAAE,OAAO,IAAI,CAAC;IAClD,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvC,MAAM,KAAK,GAAG,EAAE,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;QAC1C,SAAS,GAAG,MAAM,CAAC,GAAG,SAAS,GAAG,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;QACrD,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;IACpB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAClC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,MAAM,OAAO,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;IAC5C,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACnC,OAAO,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;AACtC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,WAAmB,EAAE,IAAY;IAC/D,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1C,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,IAAI,GAAG,WAAW,IAAI,CAAC,CAAC;IAC3D,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAClC,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACzC,IAAI,SAAS,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,KAAK,GAAG,EAAE,GAAG,SAAS,CAAC;IAC7B,OAAO,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,OAAe;IACtC,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACzC,IAAI,SAAS,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACpC,OAAO,EAAE,GAAG,SAAS,CAAC;AACxB,CAAC"}

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

@@ -0,0 +1,28 @@
+/**
+ * The Verhoeff check digit algorithm.
+ *
+ * Required by India's Aadhaar. Unlike Luhn it is built on the dihedral group
+ * D₅ rather than modular arithmetic, which is why it catches ALL single-digit
+ * errors and ALL adjacent transpositions — including 09↔90, the one case Luhn
+ * misses. That completeness is the whole reason Aadhaar chose it, so the
+ * tests assert both properties exhaustively over generated inputs rather than
+ * spot-checking a few vectors.
+ *
+ * The three tables below are the standard published ones:
+ *   d — the D₅ Cayley (multiplication) table
+ *   p — the permutation table, applied position-dependently
+ *   inv — the multiplicative inverse used to derive a check digit
+ */
+/**
+ * Validate a complete digit string (payload plus trailing check digit).
+ *
+ * Returns `false` for non-digit input or fewer than two digits.
+ */
+export declare function verhoeffValid(value: string): boolean;
+/**
+ * The Verhoeff check digit for a payload that does NOT include one.
+ *
+ * Returns `null` if the payload is not all digits.
+ */
+export declare function verhoeffCheckDigit(payload: string): number | null;
+//# sourceMappingURL=verhoeff.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"verhoeff.d.ts","sourceRoot":"","sources":["../../../src/checksums/verhoeff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAiCH;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAIpD;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAMjE"}

package/dist/src/checksums/verhoeff.js

@@ -0,0 +1,80 @@
+/**
+ * The Verhoeff check digit algorithm.
+ *
+ * Required by India's Aadhaar. Unlike Luhn it is built on the dihedral group
+ * D₅ rather than modular arithmetic, which is why it catches ALL single-digit
+ * errors and ALL adjacent transpositions — including 09↔90, the one case Luhn
+ * misses. That completeness is the whole reason Aadhaar chose it, so the
+ * tests assert both properties exhaustively over generated inputs rather than
+ * spot-checking a few vectors.
+ *
+ * The three tables below are the standard published ones:
+ *   d — the D₅ Cayley (multiplication) table
+ *   p — the permutation table, applied position-dependently
+ *   inv — the multiplicative inverse used to derive a check digit
+ */
+import { toDigits } from './digits.js';
+/** D₅ multiplication table. */
+const D = [
+    [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],
+    [1, 2, 3, 4, 0, 6, 7, 8, 9, 5],
+    [2, 3, 4, 0, 1, 7, 8, 9, 5, 6],
+    [3, 4, 0, 1, 2, 8, 9, 5, 6, 7],
+    [4, 0, 1, 2, 3, 9, 5, 6, 7, 8],
+    [5, 9, 8, 7, 6, 0, 4, 3, 2, 1],
+    [6, 5, 9, 8, 7, 1, 0, 4, 3, 2],
+    [7, 6, 5, 9, 8, 2, 1, 0, 4, 3],
+    [8, 7, 6, 5, 9, 3, 2, 1, 0, 4],
+    [9, 8, 7, 6, 5, 4, 3, 2, 1, 0],
+];
+/** Permutation table; row index is position mod 8. */
+const P = [
+    [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],
+    [1, 5, 7, 6, 2, 8, 3, 0, 9, 4],
+    [5, 8, 0, 3, 7, 9, 6, 1, 4, 2],
+    [8, 9, 1, 6, 0, 4, 3, 5, 2, 7],
+    [9, 4, 5, 3, 1, 2, 6, 8, 7, 0],
+    [4, 2, 8, 6, 5, 7, 3, 9, 0, 1],
+    [2, 7, 9, 3, 8, 0, 6, 4, 1, 5],
+    [7, 0, 4, 6, 9, 1, 3, 2, 5, 8],
+];
+/** Multiplicative inverse in D₅. */
+const INV = [0, 4, 3, 2, 1, 5, 6, 7, 8, 9];
+/**
+ * Validate a complete digit string (payload plus trailing check digit).
+ *
+ * Returns `false` for non-digit input or fewer than two digits.
+ */
+export function verhoeffValid(value) {
+    const digits = toDigits(value);
+    if (digits === null || digits.length < 2)
+        return false;
+    return verhoeffInterim(digits) === 0;
+}
+/**
+ * The Verhoeff check digit for a payload that does NOT include one.
+ *
+ * Returns `null` if the payload is not all digits.
+ */
+export function verhoeffCheckDigit(payload) {
+    const digits = toDigits(payload);
+    if (digits === null)
+        return null;
+    // Shift by one position by appending a zero, then invert the interim value.
+    const c = verhoeffInterim([...digits, 0]);
+    return INV[c];
+}
+/**
+ * Fold the digits right-to-left through the permutation and D₅ tables.
+ * The result is 0 exactly when the number carries a correct check digit.
+ */
+function verhoeffInterim(digits) {
+    let c = 0;
+    const reversed = [...digits].reverse();
+    for (let i = 0; i < reversed.length; i++) {
+        const permuted = P[i % 8][reversed[i]];
+        c = D[c][permuted];
+    }
+    return c;
+}
+//# sourceMappingURL=verhoeff.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"verhoeff.js","sourceRoot":"","sources":["../../../src/checksums/verhoeff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,+BAA+B;AAC/B,MAAM,CAAC,GAAmC;IACxC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;CAC/B,CAAC;AAEF,sDAAsD;AACtD,MAAM,CAAC,GAAmC;IACxC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;CAC/B,CAAC;AAEF,oCAAoC;AACpC,MAAM,GAAG,GAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAE9D;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,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,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACvC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAe;IAChD,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IACjC,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACjC,4EAA4E;IAC5E,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1C,OAAO,GAAG,CAAC,CAAC,CAAE,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,MAAyB;IAChD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAE,CAAC;QAC1C,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAE,CAAC;IACvB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

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

@@ -0,0 +1,64 @@
+/**
+ * The weighted modular sum — the single algorithm behind most national
+ * identifier check digits.
+ *
+ * SPEC.md calls for implementing each algorithm once and reusing it: "Many
+ * national IDs are the same algorithm with different weights." That is
+ * precisely true of this family. Turkey's TCKN, Poland's PESEL, Brazil's CPF,
+ * China's RIC, Singapore's NRIC, Australia's TFN and dozens of others are all
+ *
+ *     Σ(digitᵢ × weightᵢ) mod m
+ *
+ * differing only in the weight vector, the modulus, and how the remainder is
+ * turned back into an expected check character.
+ *
+ * DESIGN NOTE. This module deliberately stops at the remainder rather than
+ * trying to model every "and then…" rule as configuration. The final step
+ * varies too much to generalize honestly — some schemes use the remainder
+ * directly, some its complement, some map 10→'X', some declare 10 invalid,
+ * some subtract from 11 and fold both 10 and 11 to 0. Encoding all of that in
+ * one options object produces a function nobody can read and whose branches
+ * are individually untested. Each detector applies its own documented final
+ * rule to the remainder this module returns. The shared, error-prone part —
+ * the weighted sum itself — is written and tested exactly once.
+ */
+/**
+ * Σ(digitᵢ × weightᵢ).
+ *
+ * Returns `null` when there are fewer weights than digits, which is always a
+ * programming error rather than bad user input. Extra trailing weights are
+ * ignored so a scheme can declare the full weight vector including the check
+ * position and pass only the payload digits.
+ */
+export declare function weightedSum(digits: readonly number[], weights: readonly number[]): number | null;
+/**
+ * Σ(digitᵢ × weightᵢ) mod `modulus`.
+ *
+ * Returns `null` on a weight/digit length mismatch or a non-positive modulus.
+ */
+export declare function weightedMod(digits: readonly number[], weights: readonly number[], modulus: number): number | null;
+/**
+ * Σ(digitᵢ × weightᵢ) mod `modulus`, where the weight for position i is
+ * generated by a function rather than read from a table.
+ *
+ * Several schemes define weights positionally — China's RIC uses 2^(n-i) mod
+ * 11, ISO 7064 uses a running product — where writing the vector out would be
+ * both longer and easier to get wrong than stating the rule.
+ */
+export declare function weightedModBy(digits: readonly number[], weightAt: (index: number) => number, modulus: number): number | null;
+/**
+ * A cycling weight vector: position i uses `weights[i % weights.length]`.
+ *
+ * Used by schemes whose weights repeat over a long identifier (Russia's INN
+ * and SNILS, several VAT formats) rather than being listed per position.
+ */
+export declare function cyclicWeightedMod(digits: readonly number[], weights: readonly number[], modulus: number): number | null;
+/**
+ * The common "complement" closing rule: `(modulus − (sum mod modulus)) mod
+ * modulus`.
+ *
+ * Extracted because getting the outer `mod` wrong is the classic bug — when
+ * the remainder is 0 the complement must be 0, not `modulus`.
+ */
+export declare function complement(sum: number, modulus: number): number;
+//# sourceMappingURL=weighted.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"weighted.d.ts","sourceRoot":"","sources":["../../../src/checksums/weighted.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,GAAG,IAAI,CAOhG;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,OAAO,EAAE,MAAM,GACd,MAAM,GAAG,IAAI,CAKf;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,EACnC,OAAO,EAAE,MAAM,GACd,MAAM,GAAG,IAAI,CAOf;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,OAAO,EAAE,MAAM,GACd,MAAM,GAAG,IAAI,CAOf;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAE/D"}

package/dist/src/checksums/weighted.js

@@ -0,0 +1,97 @@
+/**
+ * The weighted modular sum — the single algorithm behind most national
+ * identifier check digits.
+ *
+ * SPEC.md calls for implementing each algorithm once and reusing it: "Many
+ * national IDs are the same algorithm with different weights." That is
+ * precisely true of this family. Turkey's TCKN, Poland's PESEL, Brazil's CPF,
+ * China's RIC, Singapore's NRIC, Australia's TFN and dozens of others are all
+ *
+ *     Σ(digitᵢ × weightᵢ) mod m
+ *
+ * differing only in the weight vector, the modulus, and how the remainder is
+ * turned back into an expected check character.
+ *
+ * DESIGN NOTE. This module deliberately stops at the remainder rather than
+ * trying to model every "and then…" rule as configuration. The final step
+ * varies too much to generalize honestly — some schemes use the remainder
+ * directly, some its complement, some map 10→'X', some declare 10 invalid,
+ * some subtract from 11 and fold both 10 and 11 to 0. Encoding all of that in
+ * one options object produces a function nobody can read and whose branches
+ * are individually untested. Each detector applies its own documented final
+ * rule to the remainder this module returns. The shared, error-prone part —
+ * the weighted sum itself — is written and tested exactly once.
+ */
+/**
+ * Σ(digitᵢ × weightᵢ).
+ *
+ * Returns `null` when there are fewer weights than digits, which is always a
+ * programming error rather than bad user input. Extra trailing weights are
+ * ignored so a scheme can declare the full weight vector including the check
+ * position and pass only the payload digits.
+ */
+export function weightedSum(digits, weights) {
+    if (weights.length < digits.length)
+        return null;
+    let sum = 0;
+    for (let i = 0; i < digits.length; i++) {
+        sum += digits[i] * weights[i];
+    }
+    return sum;
+}
+/**
+ * Σ(digitᵢ × weightᵢ) mod `modulus`.
+ *
+ * Returns `null` on a weight/digit length mismatch or a non-positive modulus.
+ */
+export function weightedMod(digits, weights, modulus) {
+    if (modulus <= 0)
+        return null;
+    const sum = weightedSum(digits, weights);
+    if (sum === null)
+        return null;
+    return sum % modulus;
+}
+/**
+ * Σ(digitᵢ × weightᵢ) mod `modulus`, where the weight for position i is
+ * generated by a function rather than read from a table.
+ *
+ * Several schemes define weights positionally — China's RIC uses 2^(n-i) mod
+ * 11, ISO 7064 uses a running product — where writing the vector out would be
+ * both longer and easier to get wrong than stating the rule.
+ */
+export function weightedModBy(digits, weightAt, modulus) {
+    if (modulus <= 0)
+        return null;
+    let sum = 0;
+    for (let i = 0; i < digits.length; i++) {
+        sum += digits[i] * weightAt(i);
+    }
+    return sum % modulus;
+}
+/**
+ * A cycling weight vector: position i uses `weights[i % weights.length]`.
+ *
+ * Used by schemes whose weights repeat over a long identifier (Russia's INN
+ * and SNILS, several VAT formats) rather than being listed per position.
+ */
+export function cyclicWeightedMod(digits, weights, modulus) {
+    if (modulus <= 0 || weights.length === 0)
+        return null;
+    let sum = 0;
+    for (let i = 0; i < digits.length; i++) {
+        sum += digits[i] * weights[i % weights.length];
+    }
+    return sum % modulus;
+}
+/**
+ * The common "complement" closing rule: `(modulus − (sum mod modulus)) mod
+ * modulus`.
+ *
+ * Extracted because getting the outer `mod` wrong is the classic bug — when
+ * the remainder is 0 the complement must be 0, not `modulus`.
+ */
+export function complement(sum, modulus) {
+    return (modulus - (sum % modulus)) % modulus;
+}
+//# sourceMappingURL=weighted.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"weighted.js","sourceRoot":"","sources":["../../../src/checksums/weighted.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,MAAyB,EAAE,OAA0B;IAC/E,IAAI,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAChD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;IAClC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CACzB,MAAyB,EACzB,OAA0B,EAC1B,OAAe;IAEf,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACzC,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC9B,OAAO,GAAG,GAAG,OAAO,CAAC;AACvB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAyB,EACzB,QAAmC,EACnC,OAAe;IAEf,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,GAAG,GAAG,OAAO,CAAC;AACvB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAyB,EACzB,OAA0B,EAC1B,OAAe;IAEf,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAE,CAAC;IACnD,CAAC;IACD,OAAO,GAAG,GAAG,OAAO,CAAC;AACvB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,GAAW,EAAE,OAAe;IACrD,OAAO,CAAC,OAAO,GAAG,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC;AAC/C,CAAC"}

package/dist/src/context/documentProfile.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Stage 3, DOCUMENT TYPE.
+ *
+ * SPEC.md: "DOCUMENT TYPE — detect whether input is prose, source code (and
+ * which language), JSON, YAML, CSV, a log dump, a markdown table, or an email
+ * thread. Each mode shifts weights. Code mode raises secret sensitivity and
+ * lowers person-name sensitivity, since identifiers in code are usually not
+ * people."
+ *
+ * Format detection is evidence-scored rather than first-match: several forms
+ * genuinely overlap (a YAML file is a superset of many key/value shapes, a CV
+ * in prose is full of "Label: value" lines that look like YAML), so each
+ * candidate format accumulates evidence and the strongest wins. The evidence
+ * strings are kept and reported, which is what makes a misclassification
+ * diagnosable instead of mysterious.
+ *
+ * The DOMAIN axis is deliberately separate from format — see the note on
+ * `DocumentDomain`. A medical record can arrive as prose, CSV, or JSON.
+ */
+import { type StructureIndex } from './structure.js';
+import type { DocumentDomain, DocumentProfile } from './types.js';
+/** Domain terminology, keyed by domain then language. Supplied by the data package. */
+export type DomainLexicon = Readonly<Partial<Record<Exclude<DocumentDomain, 'general'>, readonly string[]>>>;
+/**
+ * Classify a document's format and subject domain.
+ *
+ * `structureIndex` is accepted rather than rebuilt so callers that already
+ * have one (the analyzer does) pay for it once.
+ */
+export declare function profileDocument(text: string, options?: {
+    readonly structureIndex?: StructureIndex;
+    readonly domainLexicon?: DomainLexicon;
+}): DocumentProfile;
+//# sourceMappingURL=documentProfile.d.ts.map

package/dist/src/context/documentProfile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"documentProfile.d.ts","sourceRoot":"","sources":["../../../src/context/documentProfile.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAuB,KAAK,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAE1E,OAAO,KAAK,EAAE,cAAc,EAAkB,eAAe,EAAE,MAAM,YAAY,CAAC;AAElF,uFAAuF;AACvF,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,EAAE,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;AAmO7G;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE;IAAE,QAAQ,CAAC,cAAc,CAAC,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,aAAa,CAAA;CAAO,GACjG,eAAe,CA+BjB"}