@moxon/api 6.0.0-pre

package/dist/modules/v5/matrix.d.ts

@@ -0,0 +1,77 @@
+export type Matrix = number[][];
+export interface MatrixResult {
+    operation: string;
+    result: Matrix | number;
+    dimensions: {
+        rows: number;
+        cols: number;
+    };
+}
+/**
+ * Adds two matrices element-wise.
+ *
+ * @param matrix - First matrix (2D array of finite numbers)
+ * @param matrix2 - Second matrix (must have the same dimensions as matrix)
+ * @returns MatrixResult with the resulting matrix and its dimensions
+ * @throws Error if either argument is not a valid matrix or dimensions do not match
+ */
+export declare function add(matrix: unknown, matrix2: unknown): MatrixResult;
+/**
+ * Subtracts the second matrix from the first element-wise.
+ *
+ * @param matrix - Matrix to subtract from (2D array of finite numbers)
+ * @param matrix2 - Matrix to subtract (must have the same dimensions as matrix)
+ * @returns MatrixResult with the resulting matrix and its dimensions
+ * @throws Error if either argument is not a valid matrix or dimensions do not match
+ */
+export declare function subtract(matrix: unknown, matrix2: unknown): MatrixResult;
+/**
+ * Multiplies two matrices using standard matrix multiplication.
+ *
+ * @param matrix - Left-hand matrix (2D array of finite numbers)
+ * @param matrix2 - Right-hand matrix; its row count must equal matrix's column count
+ * @returns MatrixResult with the resulting matrix and its dimensions
+ * @throws Error if either argument is not a valid matrix or inner dimensions are incompatible
+ */
+export declare function multiply(matrix: unknown, matrix2: unknown): MatrixResult;
+/**
+ * Multiplies every element of a matrix by a scalar value.
+ *
+ * @param matrix - Matrix to scale (2D array of finite numbers)
+ * @param scalarVal - Finite number to multiply each element by
+ * @returns MatrixResult with the scaled matrix and its dimensions
+ * @throws Error if matrix is invalid or scalarVal is not a finite number
+ */
+export declare function scalar(matrix: unknown, scalarVal: unknown): MatrixResult;
+/**
+ * Transposes a matrix, swapping its rows and columns.
+ *
+ * @param matrix - Matrix to transpose (2D array of finite numbers)
+ * @returns MatrixResult with the transposed matrix and its dimensions
+ * @throws Error if matrix is not a valid 2D array of finite numbers
+ */
+export declare function transpose(matrix: unknown): MatrixResult;
+/**
+ * Computes the determinant of a square matrix using Gaussian elimination with partial pivoting.
+ *
+ * @param matrix - Square matrix (2D array of finite numbers)
+ * @returns MatrixResult with the determinant as a scalar result and the input dimensions
+ * @throws Error if matrix is not a valid square matrix
+ */
+export declare function determinant(matrix: unknown): MatrixResult;
+/**
+ * Computes the inverse of a square matrix using Gauss-Jordan elimination.
+ *
+ * @param matrix - Square matrix (2D array of finite numbers)
+ * @returns MatrixResult with the inverted matrix and its dimensions
+ * @throws Error if matrix is not a valid square matrix or is singular (determinant is 0)
+ */
+export declare function inverse(matrix: unknown): MatrixResult;
+/**
+ * Generates an n×n identity matrix.
+ *
+ * @param n - Size of the identity matrix (positive integer, max MAX_MATRIX_SIZE)
+ * @returns MatrixResult with the identity matrix and its dimensions
+ * @throws Error if n is not a positive integer or exceeds the maximum allowed size
+ */
+export declare function identity(n: unknown): MatrixResult;

package/dist/modules/v5/matrix.js

@@ -0,0 +1,239 @@
+import { MAX_MATRIX_SIZE } from '../../constants.js';
+function validateMatrix(m, name = 'matrix') {
+    if (!Array.isArray(m) || m.length === 0) {
+        throw new Error(`Field '${name}' must be a non-empty 2D array`);
+    }
+    const cols = m[0].length;
+    if (cols === 0)
+        throw new Error(`Field '${name}' rows must be non-empty`);
+    for (const row of m) {
+        if (!Array.isArray(row) || row.length !== cols) {
+            throw new Error(`All rows in '${name}' must have the same length`);
+        }
+        for (const cell of row) {
+            if (typeof cell !== 'number' || !isFinite(cell)) {
+                throw new Error(`Field '${name}' must contain finite numbers only`);
+            }
+        }
+    }
+    if (m.length > MAX_MATRIX_SIZE || cols > MAX_MATRIX_SIZE) {
+        throw new Error(`Matrix dimensions cannot exceed ${MAX_MATRIX_SIZE}×${MAX_MATRIX_SIZE}`);
+    }
+    return m;
+}
+function dims(m) {
+    return { rows: m.length, cols: m[0].length };
+}
+function assertSquare(m, op) {
+    const { rows, cols } = dims(m);
+    if (rows !== cols)
+        throw new Error(`Operation '${op}' requires a square matrix`);
+}
+function assertSameDimensions(a, b) {
+    if (a.length !== b.length || a[0].length !== b[0].length) {
+        throw new Error('Both matrices must have the same dimensions');
+    }
+}
+function copy(m) {
+    return m.map((row) => [...row]);
+}
+function clean(x) {
+    return x === 0 ? 0 : Number(x.toPrecision(12));
+}
+/**
+ * Adds two matrices element-wise.
+ *
+ * @param matrix - First matrix (2D array of finite numbers)
+ * @param matrix2 - Second matrix (must have the same dimensions as matrix)
+ * @returns MatrixResult with the resulting matrix and its dimensions
+ * @throws Error if either argument is not a valid matrix or dimensions do not match
+ */
+export function add(matrix, matrix2) {
+    const a = validateMatrix(matrix);
+    const b = validateMatrix(matrix2, 'matrix2');
+    assertSameDimensions(a, b);
+    const result = a.map((row, i) => row.map((v, j) => v + b[i][j]));
+    return { operation: 'add', result, dimensions: dims(result) };
+}
+/**
+ * Subtracts the second matrix from the first element-wise.
+ *
+ * @param matrix - Matrix to subtract from (2D array of finite numbers)
+ * @param matrix2 - Matrix to subtract (must have the same dimensions as matrix)
+ * @returns MatrixResult with the resulting matrix and its dimensions
+ * @throws Error if either argument is not a valid matrix or dimensions do not match
+ */
+export function subtract(matrix, matrix2) {
+    const a = validateMatrix(matrix);
+    const b = validateMatrix(matrix2, 'matrix2');
+    assertSameDimensions(a, b);
+    const result = a.map((row, i) => row.map((v, j) => v - b[i][j]));
+    return { operation: 'subtract', result, dimensions: dims(result) };
+}
+/**
+ * Multiplies two matrices using standard matrix multiplication.
+ *
+ * @param matrix - Left-hand matrix (2D array of finite numbers)
+ * @param matrix2 - Right-hand matrix; its row count must equal matrix's column count
+ * @returns MatrixResult with the resulting matrix and its dimensions
+ * @throws Error if either argument is not a valid matrix or inner dimensions are incompatible
+ */
+export function multiply(matrix, matrix2) {
+    const a = validateMatrix(matrix);
+    const b = validateMatrix(matrix2, 'matrix2');
+    const { rows: ar, cols: ac } = dims(a);
+    const { rows: br, cols: bc } = dims(b);
+    if (ac !== br) {
+        throw new Error(`Cannot multiply: columns of first matrix (${ac}) must equal rows of second (${br})`);
+    }
+    const result = Array.from({ length: ar }, () => new Array(bc).fill(0));
+    for (let i = 0; i < ar; i++) {
+        for (let j = 0; j < bc; j++) {
+            let sum = 0;
+            for (let k = 0; k < ac; k++) {
+                sum += a[i][k] * b[k][j];
+            }
+            result[i][j] = sum;
+        }
+    }
+    return { operation: 'multiply', result, dimensions: dims(result) };
+}
+/**
+ * Multiplies every element of a matrix by a scalar value.
+ *
+ * @param matrix - Matrix to scale (2D array of finite numbers)
+ * @param scalarVal - Finite number to multiply each element by
+ * @returns MatrixResult with the scaled matrix and its dimensions
+ * @throws Error if matrix is invalid or scalarVal is not a finite number
+ */
+export function scalar(matrix, scalarVal) {
+    const a = validateMatrix(matrix);
+    if (typeof scalarVal !== 'number' || !isFinite(scalarVal)) {
+        throw new Error("Field 'scalar' must be a finite number");
+    }
+    const result = a.map((row) => row.map((v) => v * scalarVal));
+    return { operation: 'scalar', result, dimensions: dims(result) };
+}
+/**
+ * Transposes a matrix, swapping its rows and columns.
+ *
+ * @param matrix - Matrix to transpose (2D array of finite numbers)
+ * @returns MatrixResult with the transposed matrix and its dimensions
+ * @throws Error if matrix is not a valid 2D array of finite numbers
+ */
+export function transpose(matrix) {
+    const a = validateMatrix(matrix);
+    const { rows, cols } = dims(a);
+    const result = Array.from({ length: cols }, (_, j) => Array.from({ length: rows }, (__, i) => a[i][j]));
+    return { operation: 'transpose', result, dimensions: dims(result) };
+}
+function gaussElim(m) {
+    const n = m.length;
+    const lu = copy(m);
+    let sign = 1;
+    for (let col = 0; col < n; col++) {
+        // Partial pivoting
+        let maxRow = col;
+        for (let row = col + 1; row < n; row++) {
+            if (Math.abs(lu[row][col]) > Math.abs(lu[maxRow][col]))
+                maxRow = row;
+        }
+        if (maxRow !== col) {
+            [lu[col], lu[maxRow]] = [lu[maxRow], lu[col]];
+            sign *= -1;
+        }
+        const pivot = lu[col][col];
+        if (pivot === 0)
+            continue;
+        for (let row = col + 1; row < n; row++) {
+            const factor = lu[row][col] / pivot;
+            for (let k = col; k < n; k++) {
+                lu[row][k] -= factor * lu[col][k];
+            }
+        }
+    }
+    return { lu, sign };
+}
+/**
+ * Computes the determinant of a square matrix using Gaussian elimination with partial pivoting.
+ *
+ * @param matrix - Square matrix (2D array of finite numbers)
+ * @returns MatrixResult with the determinant as a scalar result and the input dimensions
+ * @throws Error if matrix is not a valid square matrix
+ */
+export function determinant(matrix) {
+    const a = validateMatrix(matrix);
+    assertSquare(a, 'determinant');
+    const n = a.length;
+    if (n === 1)
+        return { operation: 'determinant', result: a[0][0], dimensions: dims(a) };
+    if (n === 2) {
+        const det = a[0][0] * a[1][1] - a[0][1] * a[1][0];
+        return { operation: 'determinant', result: det, dimensions: dims(a) };
+    }
+    const { lu, sign } = gaussElim(a);
+    let det = sign;
+    for (let i = 0; i < n; i++)
+        det *= lu[i][i];
+    const result = clean(det);
+    return { operation: 'determinant', result, dimensions: dims(a) };
+}
+/**
+ * Computes the inverse of a square matrix using Gauss-Jordan elimination.
+ *
+ * @param matrix - Square matrix (2D array of finite numbers)
+ * @returns MatrixResult with the inverted matrix and its dimensions
+ * @throws Error if matrix is not a valid square matrix or is singular (determinant is 0)
+ */
+export function inverse(matrix) {
+    const a = validateMatrix(matrix);
+    assertSquare(a, 'inverse');
+    const n = a.length;
+    // Build augmented matrix [A | I]
+    const aug = a.map((row, i) => [...row, ...Array.from({ length: n }, (_, j) => (i === j ? 1 : 0))]);
+    // Gauss-Jordan elimination
+    for (let col = 0; col < n; col++) {
+        // Partial pivoting
+        let maxRow = col;
+        for (let row = col + 1; row < n; row++) {
+            if (Math.abs(aug[row][col]) > Math.abs(aug[maxRow][col]))
+                maxRow = row;
+        }
+        if (maxRow !== col)
+            [aug[col], aug[maxRow]] = [aug[maxRow], aug[col]];
+        const pivot = aug[col][col];
+        if (Math.abs(pivot) < 1e-12)
+            throw new Error('Matrix is singular (determinant is 0)');
+        for (let k = 0; k < 2 * n; k++)
+            aug[col][k] /= pivot;
+        for (let row = 0; row < n; row++) {
+            if (row === col)
+                continue;
+            const factor = aug[row][col];
+            for (let k = 0; k < 2 * n; k++) {
+                aug[row][k] -= factor * aug[col][k];
+            }
+        }
+    }
+    // Extract right half
+    const result = aug.map((row) => row.slice(n).map((v) => clean(v)));
+    return { operation: 'inverse', result, dimensions: dims(result) };
+}
+/**
+ * Generates an n×n identity matrix.
+ *
+ * @param n - Size of the identity matrix (positive integer, max MAX_MATRIX_SIZE)
+ * @returns MatrixResult with the identity matrix and its dimensions
+ * @throws Error if n is not a positive integer or exceeds the maximum allowed size
+ */
+export function identity(n) {
+    if (typeof n !== 'number' || !Number.isInteger(n) || n <= 0) {
+        throw new Error("Field 'scalar' must be a positive integer for the identity operation");
+    }
+    if (n > MAX_MATRIX_SIZE) {
+        throw new Error(`Identity size cannot exceed ${MAX_MATRIX_SIZE}`);
+    }
+    const result = Array.from({ length: n }, (_, i) => Array.from({ length: n }, (__, j) => (i === j ? 1 : 0)));
+    return { operation: 'identity', result, dimensions: { rows: n, cols: n } };
+}
+//# sourceMappingURL=matrix.js.map

package/dist/modules/v5/matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../../../src/modules/v5/matrix.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAUrD,SAAS,cAAc,CAAC,CAAU,EAAE,IAAI,GAAG,QAAQ;IAC/C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,UAAU,IAAI,gCAAgC,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,IAAI,GAAI,CAAC,CAAC,CAAC,CAAe,CAAC,MAAM,CAAC;IACxC,IAAI,IAAI,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,UAAU,IAAI,0BAA0B,CAAC,CAAC;IAC1E,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC7C,MAAM,IAAI,KAAK,CAAC,gBAAgB,IAAI,6BAA6B,CAAC,CAAC;QACvE,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACrB,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9C,MAAM,IAAI,KAAK,CAAC,UAAU,IAAI,oCAAoC,CAAC,CAAC;YACxE,CAAC;QACL,CAAC;IACL,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,GAAG,eAAe,IAAI,IAAI,GAAG,eAAe,EAAE,CAAC;QACvD,MAAM,IAAI,KAAK,CAAC,mCAAmC,eAAe,IAAI,eAAe,EAAE,CAAC,CAAC;IAC7F,CAAC;IACD,OAAO,CAAW,CAAC;AACvB,CAAC;AAED,SAAS,IAAI,CAAC,CAAS;IACnB,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC;AAClD,CAAC;AAED,SAAS,YAAY,CAAC,CAAS,EAAE,EAAU;IACvC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,IAAI,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,cAAc,EAAE,4BAA4B,CAAC,CAAC;AACrF,CAAC;AAED,SAAS,oBAAoB,CAAC,CAAS,EAAE,CAAS;IAC9C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC;QACzD,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACnE,CAAC;AACL,CAAC;AAED,SAAS,IAAI,CAAC,CAAS;IACnB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,KAAK,CAAC,CAAS;IACpB,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,GAAG,CAAC,MAAe,EAAE,OAAgB;IACjD,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACjC,MAAM,CAAC,GAAG,cAAc,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;IACnE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AAClE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAC,MAAe,EAAE,OAAgB;IACtD,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACjC,MAAM,CAAC,GAAG,cAAc,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;IACnE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AACvE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAC,MAAe,EAAE,OAAgB;IACtD,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACjC,MAAM,CAAC,GAAG,cAAc,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,6CAA6C,EAAE,gCAAgC,EAAE,GAAG,CAAC,CAAC;IAC1G,CAAC;IACD,MAAM,MAAM,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAa,CAAC,CAAC;IAC3F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1B,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;YACjC,CAAC;YACD,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACxB,CAAC;IACL,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AACvE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAC,MAAe,EAAE,SAAkB;IACtD,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACjC,IAAI,OAAO,SAAS,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QACxD,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;IAC7D,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AACrE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,MAAe;IACrC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACjC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,MAAM,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;IAClH,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AACxE,CAAC;AAED,SAAS,SAAS,CAAC,CAAS;IACxB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QAC/B,mBAAmB;QACnB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAE,CAAC,GAAG,CAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAE,CAAC,GAAG,CAAE,CAAC;gBAAE,MAAM,GAAG,GAAG,CAAC;QAC7E,CAAC;QACD,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAE,EAAE,EAAE,CAAC,GAAG,CAAE,CAAC,CAAC;YAChD,IAAI,IAAI,CAAC,CAAC,CAAC;QACf,CAAC;QAED,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,CAAE,CAAC,GAAG,CAAE,CAAC;QAC7B,IAAI,KAAK,KAAK,CAAC;YAAE,SAAS;QAE1B,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAE,CAAC,GAAG,CAAE,GAAG,KAAK,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,EAAE,CAAC,GAAG,CAAE,CAAC,CAAC,CAAE,IAAI,MAAM,GAAG,EAAE,CAAC,GAAG,CAAE,CAAC,CAAC,CAAE,CAAC;YAC1C,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,MAAe;IACvC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACjC,YAAY,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IACzF,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;QAC1D,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1E,CAAC;IAED,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAClC,IAAI,GAAG,GAAG,IAAI,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;IAE9C,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAC1B,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AACrE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,MAAe;IACnC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACjC,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,iCAAiC;IACjC,MAAM,GAAG,GAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3G,2BAA2B;IAC3B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QAC/B,mBAAmB;QACnB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAE,CAAC;gBAAE,MAAM,GAAG,GAAG,CAAC;QAC/E,CAAC;QACD,IAAI,MAAM,KAAK,GAAG;YAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC;QAExE,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAEtF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,CAAE,IAAI,KAAK,CAAC;QAEvD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAC/B,IAAI,GAAG,KAAK,GAAG;gBAAE,SAAS;YAC1B,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,CAAE,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,CAAE,CAAC;YAC5C,CAAC;QACL,CAAC;IACL,CAAC;IAED,qBAAqB;IACrB,MAAM,MAAM,GAAW,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3E,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AACtE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAU;IAC/B,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1D,MAAM,IAAI,KAAK,CAAC,sEAAsE,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,CAAC,GAAG,eAAe,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,+BAA+B,eAAe,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,MAAM,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpH,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;AAC/E,CAAC"}

package/dist/modules/v5/otp.d.ts

@@ -0,0 +1,30 @@
+export interface OtpSecretResult {
+    secret: string;
+    uri: string;
+}
+export interface OtpGenerateResult {
+    code: string;
+    remaining: number;
+    period: number;
+}
+export interface OtpVerifyResult {
+    valid: boolean;
+    drift: number;
+}
+/**
+ * Generates or verifies TOTP/HOTP codes (RFC 4226 / RFC 6238).
+ *
+ * @param action - "secret", "generate", or "verify"
+ * @param options - Configuration options
+ * @returns Result depending on action
+ */
+export default function otp(action: string, options?: {
+    secret?: string;
+    code?: string;
+    algorithm?: string;
+    digits?: number;
+    period?: number;
+    counter?: number;
+    label?: string;
+    issuer?: string;
+}): OtpSecretResult | OtpGenerateResult | OtpVerifyResult;

package/dist/modules/v5/otp.js

@@ -0,0 +1,117 @@
+import { createHmac, randomBytes, timingSafeEqual } from 'crypto';
+const BASE32_CHARS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567';
+function encodeBase32(buffer) {
+    let bits = 0;
+    let value = 0;
+    let result = '';
+    for (const byte of buffer) {
+        value = (value << 8) | byte;
+        bits += 8;
+        while (bits >= 5) {
+            bits -= 5;
+            result += BASE32_CHARS[(value >>> bits) & 0x1f];
+        }
+    }
+    if (bits > 0) {
+        result += BASE32_CHARS[(value << (5 - bits)) & 0x1f];
+    }
+    return result;
+}
+function decodeBase32(encoded) {
+    const cleaned = encoded.replace(/=+$/, '').toUpperCase();
+    let bits = 0;
+    let value = 0;
+    const bytes = [];
+    for (const char of cleaned) {
+        const idx = BASE32_CHARS.indexOf(char);
+        if (idx === -1)
+            throw new Error('Invalid base32 character');
+        value = (value << 5) | idx;
+        bits += 5;
+        if (bits >= 8) {
+            bits -= 8;
+            bytes.push((value >>> bits) & 0xff);
+        }
+    }
+    return Buffer.from(bytes);
+}
+function generateHotp(secret, counter, algorithm, digits) {
+    const counterBuf = Buffer.alloc(8);
+    counterBuf.writeBigUInt64BE(counter);
+    const hmac = createHmac(algorithm, secret).update(counterBuf).digest();
+    const offset = hmac[hmac.length - 1] & 0x0f;
+    const binary = ((hmac[offset] & 0x7f) << 24) |
+        ((hmac[offset + 1] & 0xff) << 16) |
+        ((hmac[offset + 2] & 0xff) << 8) |
+        (hmac[offset + 3] & 0xff);
+    const otp = binary % 10 ** digits;
+    return otp.toString().padStart(digits, '0');
+}
+function codesEqual(a, b) {
+    const ab = Buffer.from(a);
+    const bb = Buffer.from(b);
+    if (ab.length !== bb.length)
+        return false;
+    return timingSafeEqual(ab, bb);
+}
+const VALID_ALGORITHMS = new Set(['sha1', 'sha256', 'sha512']);
+const VALID_DIGITS = new Set([6, 8]);
+const VALID_PERIODS = new Set([15, 30, 60]);
+/**
+ * Generates or verifies TOTP/HOTP codes (RFC 4226 / RFC 6238).
+ *
+ * @param action - "secret", "generate", or "verify"
+ * @param options - Configuration options
+ * @returns Result depending on action
+ */
+export default function otp(action, options = {}) {
+    if (!action || !['secret', 'generate', 'verify'].includes(action))
+        throw new Error('Action must be "secret", "generate", or "verify"');
+    const algorithm = options.algorithm ?? 'sha1';
+    const digits = options.digits ?? 6;
+    const period = options.period ?? 30;
+    if (!VALID_ALGORITHMS.has(algorithm))
+        throw new Error(`Algorithm must be one of: ${[...VALID_ALGORITHMS].join(', ')}`);
+    if (!VALID_DIGITS.has(digits))
+        throw new Error('Digits must be 6 or 8');
+    if (!VALID_PERIODS.has(period))
+        throw new Error('Period must be 15, 30, or 60');
+    if (action === 'secret') {
+        const label = options.label ?? 'user';
+        const issuer = options.issuer ?? 'API';
+        const secretBuf = randomBytes(20);
+        const secret = encodeBase32(secretBuf);
+        const uri = `otpauth://totp/${encodeURIComponent(issuer)}:${encodeURIComponent(label)}?secret=${secret}&issuer=${encodeURIComponent(issuer)}&algorithm=${algorithm.toUpperCase()}&digits=${digits}&period=${period}`;
+        return { secret, uri };
+    }
+    if (!options.secret)
+        throw new Error('Secret is required for generate/verify');
+    if (options.counter !== undefined && (!Number.isInteger(options.counter) || options.counter < 0))
+        throw new Error('Counter must be a non-negative integer');
+    const secretBuf = decodeBase32(options.secret);
+    if (action === 'generate') {
+        const counter = options.counter !== undefined ? BigInt(options.counter) : BigInt(Math.floor(Date.now() / 1000 / period));
+        const code = generateHotp(secretBuf, counter, algorithm, digits);
+        const remaining = options.counter !== undefined ? period : period - (Math.floor(Date.now() / 1000) % period);
+        return { code, remaining, period };
+    }
+    // action === 'verify'
+    if (!options.code)
+        throw new Error('Code is required for verify');
+    const currentCounter = options.counter !== undefined ? BigInt(options.counter) : BigInt(Math.floor(Date.now() / 1000 / period));
+    for (let drift = 0; drift <= 1; drift++) {
+        const counter = currentCounter - BigInt(drift);
+        if (counter < 0n)
+            continue;
+        const code = generateHotp(secretBuf, counter, algorithm, digits);
+        if (codesEqual(code, options.code))
+            return { valid: true, drift: drift === 0 ? 0 : -drift };
+    }
+    for (let drift = 1; drift <= 1; drift++) {
+        const code = generateHotp(secretBuf, currentCounter + BigInt(drift), algorithm, digits);
+        if (codesEqual(code, options.code))
+            return { valid: true, drift };
+    }
+    return { valid: false, drift: 0 };
+}
+//# sourceMappingURL=otp.js.map

package/dist/modules/v5/otp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"otp.js","sourceRoot":"","sources":["../../../src/modules/v5/otp.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,QAAQ,CAAC;AAkBlE,MAAM,YAAY,GAAG,kCAAkC,CAAC;AAExD,SAAS,YAAY,CAAC,MAAc;IAChC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QACxB,KAAK,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;QAC5B,IAAI,IAAI,CAAC,CAAC;QACV,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,CAAC;YACV,MAAM,IAAI,YAAY,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QACpD,CAAC;IACL,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACX,MAAM,IAAI,YAAY,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,SAAS,YAAY,CAAC,OAAe;IACjC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IACzD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAC5D,KAAK,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;QAC3B,IAAI,IAAI,CAAC,CAAC;QACV,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QACxC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,YAAY,CAAC,MAAc,EAAE,OAAe,EAAE,SAAiB,EAAE,MAAc;IACpF,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,UAAU,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAErC,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,MAAM,EAAE,CAAC;IACvE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC;IAC7C,MAAM,MAAM,GACR,CAAC,CAAC,IAAI,CAAC,MAAM,CAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC9B,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAClC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC;IAE/B,MAAM,GAAG,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM,CAAC;IAClC,OAAO,GAAG,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACpC,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1C,OAAO,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;AAC/D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAE5C;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,GAAG,CACvB,MAAc,EACd,UASI,EAAE;IAEN,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC7D,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IAExE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,MAAM,CAAC;IAC9C,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;IAEpC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC;QAChC,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,GAAG,gBAAgB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IACxE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAEhF,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC;QACtC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC;QACvC,MAAM,SAAS,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,kBAAkB,kBAAkB,CAAC,MAAM,CAAC,IAAI,kBAAkB,CAAC,KAAK,CAAC,WAAW,MAAM,WAAW,kBAAkB,CAAC,MAAM,CAAC,cAAc,SAAS,CAAC,WAAW,EAAE,WAAW,MAAM,WAAW,MAAM,EAAE,CAAC;QACrN,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IAC3B,CAAC;IAED,IAAI,CAAC,OAAO,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC/E,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC;QAC5F,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC9D,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAE/C,IAAI,MAAM,KAAK,UAAU,EAAE,CAAC;QACxB,MAAM,OAAO,GACT,OAAO,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;QAC7G,MAAM,IAAI,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACjE,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QAC7G,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;IACvC,CAAC;IAED,sBAAsB;IACtB,IAAI,CAAC,OAAO,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAClE,MAAM,cAAc,GAChB,OAAO,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;IAE7G,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,cAAc,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,OAAO,GAAG,EAAE;YAAE,SAAS;QAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACjE,IAAI,UAAU,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IAChG,CAAC;IACD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,YAAY,CAAC,SAAS,EAAE,cAAc,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACxF,IAAI,UAAU,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACtE,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AACtC,CAAC"}

package/dist/modules/v5/pow.d.ts

@@ -0,0 +1,29 @@
+import type { ChallengeStorage } from '../../types/storage.js';
+import type { ChallengeVerification } from '../../utils/challenge.js';
+export interface PowChallenge {
+    algorithm: 'sha256';
+    salt: string;
+    difficulty: number;
+    expires: number;
+    token: string;
+    instructions: string;
+}
+/**
+ * Issues a proof-of-work challenge: the client must find a nonce whose hash
+ * starts with the requested number of hexadecimal zeros. Difficulty 4 averages
+ * about 32k hashes, unnoticeable for a person but costly to repeat at scale.
+ *
+ * @param difficulty - Leading hexadecimal zeros required (1-6, default 4)
+ * @returns Challenge with its salt, difficulty, expiry and signed token
+ * @throws Error if the difficulty is not a number or out of range
+ */
+export default function pow(difficulty?: number): PowChallenge;
+/**
+ * Verifies a solved proof-of-work challenge, then consumes the token.
+ *
+ * @param token - Token issued by the challenge
+ * @param nonce - Nonce found by the client
+ * @param storage - Store of already consumed nonces
+ * @returns Verification result, with a reason when it fails
+ */
+export declare function verifyPow(token: string, nonce: string, storage: ChallengeStorage): ChallengeVerification;

package/dist/modules/v5/pow.js

@@ -0,0 +1,49 @@
+import { createHash, randomBytes } from 'node:crypto';
+import { MAX_POW_DIFFICULTY, POW_DEFAULT_DIFFICULTY } from '../../constants.js';
+import { readToken, signToken, verifyToken } from '../../utils/challenge.js';
+const digest = (salt, nonce) => createHash('sha256').update(`${salt}${nonce}`).digest('hex');
+/**
+ * Issues a proof-of-work challenge: the client must find a nonce whose hash
+ * starts with the requested number of hexadecimal zeros. Difficulty 4 averages
+ * about 32k hashes, unnoticeable for a person but costly to repeat at scale.
+ *
+ * @param difficulty - Leading hexadecimal zeros required (1-6, default 4)
+ * @returns Challenge with its salt, difficulty, expiry and signed token
+ * @throws Error if the difficulty is not a number or out of range
+ */
+export default function pow(difficulty = POW_DEFAULT_DIFFICULTY) {
+    if (isNaN(difficulty))
+        throw new Error('Difficulty must be a number');
+    if (!Number.isInteger(difficulty) || difficulty < 1 || difficulty > MAX_POW_DIFFICULTY) {
+        throw new Error(`Difficulty must be between 1 and ${MAX_POW_DIFFICULTY}`);
+    }
+    const salt = randomBytes(8).toString('hex');
+    const token = signToken('pow', `${salt}.${difficulty}`, { salt, difficulty });
+    return {
+        algorithm: 'sha256',
+        salt,
+        difficulty,
+        expires: readToken(token).exp,
+        token,
+        instructions: `Find nonce so that sha256(salt + nonce) starts with ${difficulty} hex zeros`,
+    };
+}
+/**
+ * Verifies a solved proof-of-work challenge, then consumes the token.
+ *
+ * @param token - Token issued by the challenge
+ * @param nonce - Nonce found by the client
+ * @param storage - Store of already consumed nonces
+ * @returns Verification result, with a reason when it fails
+ */
+export function verifyPow(token, nonce, storage) {
+    const decoded = readToken(token);
+    if (!decoded || decoded.type !== 'pow' || !decoded.salt || !decoded.difficulty) {
+        return { valid: false, reason: 'invalid' };
+    }
+    if (!digest(decoded.salt, nonce).startsWith('0'.repeat(decoded.difficulty))) {
+        return { valid: false, reason: 'wrong' };
+    }
+    return verifyToken(token, `${decoded.salt}.${decoded.difficulty}`, storage);
+}
+//# sourceMappingURL=pow.js.map

package/dist/modules/v5/pow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pow.js","sourceRoot":"","sources":["../../../src/modules/v5/pow.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAEtD,OAAO,EAAE,kBAAkB,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAGhF,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAW7E,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,KAAa,EAAU,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI,GAAG,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAErH;;;;;;;;GAQG;AACH,MAAM,CAAC,OAAO,UAAU,GAAG,CAAC,aAAqB,sBAAsB;IACnE,IAAI,KAAK,CAAC,UAAU,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACtE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,IAAI,UAAU,GAAG,kBAAkB,EAAE,CAAC;QACrF,MAAM,IAAI,KAAK,CAAC,oCAAoC,kBAAkB,EAAE,CAAC,CAAC;IAC9E,CAAC;IAED,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;IAE9E,OAAO;QACH,SAAS,EAAE,QAAQ;QACnB,IAAI;QACJ,UAAU;QACV,OAAO,EAAE,SAAS,CAAC,KAAK,CAAE,CAAC,GAAG;QAC9B,KAAK;QACL,YAAY,EAAE,uDAAuD,UAAU,YAAY;KAC9F,CAAC;AACN,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa,EAAE,KAAa,EAAE,OAAyB;IAC7E,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IACjC,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;QAC7E,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAC/C,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;QAC1E,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IAC7C,CAAC;IAED,OAAO,WAAW,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,UAAU,EAAE,EAAE,OAAO,CAAC,CAAC;AAChF,CAAC"}

package/dist/modules/v5/read.d.ts

@@ -0,0 +1,20 @@
+export interface ReadResult {
+    lang: string;
+    words: number;
+    sentences: number;
+    syllables: number;
+    fleschReadingEase: number;
+    fleschKincaidGrade: number | null;
+    readingTime: string;
+}
+/**
+ * Computes Flesch readability scores on a text. English uses the original
+ * Flesch coefficients; French uses the Kandel & Moles adaptation, which has no
+ * grade-level counterpart, so fleschKincaidGrade is null for French.
+ *
+ * @param text - The text to analyze
+ * @param lang - Language of the text: en (default) or fr
+ * @returns Word, sentence and syllable counts, Flesch scores and estimated reading time
+ * @throws Error if the text is missing or too long, or if the language is unsupported
+ */
+export default function read(text: string, lang?: string): ReadResult;

package/dist/modules/v5/read.js

@@ -0,0 +1,59 @@
+import { MAX_READ_LENGTH } from '../../constants.js';
+const LANGUAGES = ['en', 'fr'];
+// English heuristic: vowel groups minus silent trailing "e", at least one syllable.
+function countSyllablesEn(word) {
+    const groups = word
+        .toLowerCase()
+        .replace(/[^a-z]/g, '')
+        .replace(/e$/, '')
+        .match(/[aeiouy]+/g);
+    return Math.max(1, groups ? groups.length : 1);
+}
+// French heuristic: accented vowels count as vowels, a trailing "e"/"es" is silent.
+function countSyllablesFr(word) {
+    const groups = word
+        .toLowerCase()
+        .replace(/[^a-zàâäéèêëîïôöùûüÿç]/g, '')
+        .replace(/es?$/, '')
+        .match(/[aeiouyàâäéèêëîïôöùûüÿ]+/g);
+    return Math.max(1, groups ? groups.length : 1);
+}
+const round2 = (n) => Math.round(n * 100) / 100;
+/**
+ * Computes Flesch readability scores on a text. English uses the original
+ * Flesch coefficients; French uses the Kandel & Moles adaptation, which has no
+ * grade-level counterpart, so fleschKincaidGrade is null for French.
+ *
+ * @param text - The text to analyze
+ * @param lang - Language of the text: en (default) or fr
+ * @returns Word, sentence and syllable counts, Flesch scores and estimated reading time
+ * @throws Error if the text is missing or too long, or if the language is unsupported
+ */
+export default function read(text, lang = 'en') {
+    if (!text || !text.trim())
+        throw new Error('Please provide a text');
+    if (text.length > MAX_READ_LENGTH)
+        throw new Error(`Text must be ${MAX_READ_LENGTH} characters or fewer`);
+    if (!LANGUAGES.includes(lang))
+        throw new Error(`Language must be one of: ${LANGUAGES.join(', ')}`);
+    const wordList = text
+        .trim()
+        .split(/\s+/)
+        .filter((w) => /[\p{L}\p{N}]/u.test(w));
+    const words = wordList.length;
+    if (words === 0)
+        throw new Error('Please provide a text');
+    const sentences = text.split(/[.!?…]+/).filter((s) => s.trim()).length || 1;
+    const countSyllables = lang === 'fr' ? countSyllablesFr : countSyllablesEn;
+    const syllables = wordList.reduce((sum, word) => sum + countSyllables(word), 0);
+    const wordsPerSentence = words / sentences;
+    const syllablesPerWord = syllables / words;
+    const fleschReadingEase = lang === 'fr'
+        ? round2(207 - 1.015 * wordsPerSentence - 73.6 * syllablesPerWord)
+        : round2(206.835 - 1.015 * wordsPerSentence - 84.6 * syllablesPerWord);
+    const fleschKincaidGrade = lang === 'fr' ? null : round2(0.39 * wordsPerSentence + 11.8 * syllablesPerWord - 15.59);
+    const minutes = words / 200;
+    const readingTime = minutes < 1 ? `${Math.ceil(minutes * 60)}s` : `${Math.round(minutes)}min`;
+    return { lang, words, sentences, syllables, fleschReadingEase, fleschKincaidGrade, readingTime };
+}
+//# sourceMappingURL=read.js.map