@peac/audit 0.10.9

package/dist/workflow-dag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow-dag.d.ts","sourceRoot":"","sources":["../src/workflow-dag.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAMpD,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAM3C;;GAEG;AACH,eAAO,MAAM,UAAU;IACrB,sCAAsC;;IAEtC,6CAA6C;;IAE7C,yDAAyD;;CAEjD,CAAC;AAMX;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB,OAAO,WAAW,CAAC,qBAAqB,GACxC,OAAO,WAAW,CAAC,0BAA0B,GAC7C,OAAO,WAAW,CAAC,sBAAsB,GACzC,OAAO,WAAW,CAAC,yBAAyB,GAC5C,OAAO,WAAW,CAAC,2BAA2B,GAC9C,OAAO,WAAW,CAAC,yBAAyB,CAAC;AAEjD;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,0CAA0C;IAC1C,IAAI,EAAE,iBAAiB,CAAC;IACxB,6BAA6B;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,6CAA6C;IAC7C,OAAO,EAAE;QACP,wCAAwC;QACxC,MAAM,EAAE,MAAM,CAAC;QACf,uCAAuC;QACvC,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,8CAA8C;QAC9C,cAAc,CAAC,EAAE,MAAM,CAAC;QACxB,2CAA2C;QAC3C,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,8CAA8C;QAC9C,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,oCAAoC;QACpC,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,4CAA4C;QAC5C,GAAG,CAAC,EAAE,MAAM,CAAC;QACb,iCAAiC;QACjC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;KACvB,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,+BAA+B;IAC/B,KAAK,EAAE,OAAO,CAAC;IACf,0CAA0C;IAC1C,UAAU,EAAE,YAAY,EAAE,CAAC;IAC3B,oDAAoD;IACpD,KAAK,EAAE;QACL,sBAAsB;QACtB,SAAS,EAAE,MAAM,CAAC;QAClB,wCAAwC;QACxC,SAAS,EAAE,MAAM,CAAC;QAClB,4BAA4B;QAC5B,QAAQ,EAAE,MAAM,CAAC;QACjB,uBAAuB;QACvB,UAAU,EAAE,MAAM,CAAC;QACnB,kDAAkD;QAClD,iBAAiB,EAAE,MAAM,CAAC;KAC3B,CAAC;CACH;AAMD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,eAAe,EAAE,GAAG,qBAAqB,CA2NpF;AA2KD;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,qBAAqB,EAC7B,MAAM,EAAE,MAAM,GACb,YAAY,GAAG,SAAS,CAE1B;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,qBAAqB,EAC7B,IAAI,EAAE,iBAAiB,GACtB,OAAO,CAET"}

package/dist/workflow-dag.js

@@ -0,0 +1,409 @@
+"use strict";
+/**
+ * Workflow DAG Verification (v0.10.1+)
+ *
+ * Verifies the structural integrity of workflow DAGs by checking:
+ * - ID format validity (workflow_id, step_id)
+ * - Unique step IDs
+ * - Consistent workflow IDs
+ * - Parent existence (no dangling references)
+ * - No self-parenting
+ * - Acyclicity (no cycles in the DAG)
+ * - Limits enforcement (node count, parent count, depth, edges)
+ *
+ * Each violation maps to a specific E_WORKFLOW_* error code for structured
+ * error handling and audit trails.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DAG_LIMITS = void 0;
+exports.verifyWorkflowDag = verifyWorkflowDag;
+exports.findViolationByReason = findViolationByReason;
+exports.hasViolationCode = hasViolationCode;
+const schema_1 = require("@peac/schema");
+const kernel_1 = require("@peac/kernel");
+// ============================================================================
+// Constants
+// ============================================================================
+/**
+ * DAG verification limits (DoS protection for full DAG analysis)
+ */
+exports.DAG_LIMITS = {
+    /** Maximum steps in a workflow DAG */
+    maxSteps: 10000,
+    /** Maximum depth (longest path from root) */
+    maxDepth: 100,
+    /** Maximum total edges (sum of all parent references) */
+    maxTotalEdges: 100000,
+};
+// ============================================================================
+// Implementation
+// ============================================================================
+/**
+ * Verify a workflow DAG for structural integrity
+ *
+ * @param contexts - Array of WorkflowContext objects representing the DAG
+ * @returns DagVerificationResult with violations and statistics
+ *
+ * @example
+ * ```typescript
+ * import { verifyWorkflowDag } from '@peac/audit';
+ *
+ * const result = verifyWorkflowDag(contexts);
+ * if (!result.valid) {
+ *   for (const v of result.violations) {
+ *     console.error(`${v.code}: ${v.message}`);
+ *   }
+ * }
+ * ```
+ */
+function verifyWorkflowDag(contexts) {
+    const violations = [];
+    const stepIdSet = new Set();
+    const workflowIds = new Set();
+    const stepMap = new Map();
+    let totalEdges = 0;
+    // -------------------------------------------------------------------------
+    // Phase 1: Basic validation and index building
+    // -------------------------------------------------------------------------
+    for (const ctx of contexts) {
+        // 1. Workflow ID format validation
+        if (!schema_1.WORKFLOW_ID_PATTERN.test(ctx.workflow_id)) {
+            violations.push({
+                code: kernel_1.ERROR_CODES.E_WORKFLOW_ID_INVALID,
+                message: `Invalid workflow ID format: ${ctx.workflow_id}`,
+                details: {
+                    reason: 'invalid_format',
+                    workflow_id: ctx.workflow_id,
+                },
+            });
+        }
+        workflowIds.add(ctx.workflow_id);
+        // 2. Step ID format validation
+        if (!schema_1.STEP_ID_PATTERN.test(ctx.step_id)) {
+            violations.push({
+                code: kernel_1.ERROR_CODES.E_WORKFLOW_STEP_ID_INVALID,
+                message: `Invalid step ID format: ${ctx.step_id}`,
+                details: {
+                    reason: 'invalid_format',
+                    step_id: ctx.step_id,
+                },
+            });
+        }
+        // 3. Unique step IDs
+        if (stepIdSet.has(ctx.step_id)) {
+            violations.push({
+                code: kernel_1.ERROR_CODES.E_WORKFLOW_DAG_INVALID,
+                message: `Duplicate step ID: ${ctx.step_id}`,
+                details: {
+                    reason: 'duplicate_step_id',
+                    step_id: ctx.step_id,
+                },
+            });
+        }
+        else {
+            stepIdSet.add(ctx.step_id);
+            stepMap.set(ctx.step_id, ctx);
+        }
+        // 4. Self-parenting check
+        if (ctx.parent_step_ids.includes(ctx.step_id)) {
+            violations.push({
+                code: kernel_1.ERROR_CODES.E_WORKFLOW_DAG_INVALID,
+                message: `Step cannot be its own parent: ${ctx.step_id}`,
+                details: {
+                    reason: 'self_parent',
+                    step_id: ctx.step_id,
+                },
+            });
+        }
+        // 5. Duplicate parents check
+        const uniqueParents = new Set(ctx.parent_step_ids);
+        if (uniqueParents.size !== ctx.parent_step_ids.length) {
+            violations.push({
+                code: kernel_1.ERROR_CODES.E_WORKFLOW_DAG_INVALID,
+                message: `Duplicate parent references in step: ${ctx.step_id}`,
+                details: {
+                    reason: 'duplicate_parents',
+                    step_id: ctx.step_id,
+                },
+            });
+        }
+        // 6. Per-step parent count limit
+        if (ctx.parent_step_ids.length > schema_1.WORKFLOW_LIMITS.maxParentSteps) {
+            violations.push({
+                code: kernel_1.ERROR_CODES.E_WORKFLOW_LIMIT_EXCEEDED,
+                message: `Step ${ctx.step_id} exceeds max parent count`,
+                details: {
+                    reason: 'parent_count_exceeded',
+                    step_id: ctx.step_id,
+                    limit: 'maxParentSteps',
+                    value: ctx.parent_step_ids.length,
+                    max: schema_1.WORKFLOW_LIMITS.maxParentSteps,
+                },
+            });
+        }
+        totalEdges += ctx.parent_step_ids.length;
+    }
+    // -------------------------------------------------------------------------
+    // Phase 2: Workflow-level validation
+    // -------------------------------------------------------------------------
+    // 7. Consistent workflow IDs
+    if (workflowIds.size > 1) {
+        violations.push({
+            code: kernel_1.ERROR_CODES.E_WORKFLOW_DAG_INVALID,
+            message: `Multiple workflow IDs found: ${[...workflowIds].join(', ')}`,
+            details: {
+                reason: 'inconsistent_workflow_ids',
+                workflow_id: [...workflowIds][0],
+            },
+        });
+    }
+    // 8. Node count limit
+    if (contexts.length > exports.DAG_LIMITS.maxSteps) {
+        violations.push({
+            code: kernel_1.ERROR_CODES.E_WORKFLOW_LIMIT_EXCEEDED,
+            message: `Workflow exceeds max step count (${contexts.length} > ${exports.DAG_LIMITS.maxSteps})`,
+            details: {
+                reason: 'step_count_exceeded',
+                limit: 'maxSteps',
+                value: contexts.length,
+                max: exports.DAG_LIMITS.maxSteps,
+            },
+        });
+    }
+    // 9. Total edges limit
+    if (totalEdges > exports.DAG_LIMITS.maxTotalEdges) {
+        violations.push({
+            code: kernel_1.ERROR_CODES.E_WORKFLOW_LIMIT_EXCEEDED,
+            message: `Workflow exceeds max edge count (${totalEdges} > ${exports.DAG_LIMITS.maxTotalEdges})`,
+            details: {
+                reason: 'edge_count_exceeded',
+                limit: 'maxTotalEdges',
+                value: totalEdges,
+                max: exports.DAG_LIMITS.maxTotalEdges,
+            },
+        });
+    }
+    // -------------------------------------------------------------------------
+    // Phase 3: Parent existence validation
+    // -------------------------------------------------------------------------
+    for (const ctx of contexts) {
+        for (const parentId of ctx.parent_step_ids) {
+            // 10. Parent format validation
+            if (!schema_1.STEP_ID_PATTERN.test(parentId)) {
+                violations.push({
+                    code: kernel_1.ERROR_CODES.E_WORKFLOW_STEP_ID_INVALID,
+                    message: `Invalid parent step ID format: ${parentId}`,
+                    details: {
+                        reason: 'invalid_format',
+                        step_id: ctx.step_id,
+                        parent_step_id: parentId,
+                    },
+                });
+            }
+            // 11. Parent existence
+            if (!stepMap.has(parentId)) {
+                violations.push({
+                    code: kernel_1.ERROR_CODES.E_WORKFLOW_PARENT_NOT_FOUND,
+                    message: `Parent step not found: ${parentId} (referenced by ${ctx.step_id})`,
+                    details: {
+                        reason: 'parent_not_found',
+                        step_id: ctx.step_id,
+                        parent_step_id: parentId,
+                    },
+                });
+            }
+        }
+    }
+    // -------------------------------------------------------------------------
+    // Phase 4: Cycle detection (DFS with color marking)
+    // -------------------------------------------------------------------------
+    const cycleViolation = detectCycle(stepMap);
+    if (cycleViolation) {
+        violations.push(cycleViolation);
+    }
+    // -------------------------------------------------------------------------
+    // Phase 5: Depth calculation and limit check
+    // -------------------------------------------------------------------------
+    const maxDepth = calculateMaxDepth(stepMap);
+    if (maxDepth > exports.DAG_LIMITS.maxDepth) {
+        violations.push({
+            code: kernel_1.ERROR_CODES.E_WORKFLOW_LIMIT_EXCEEDED,
+            message: `Workflow exceeds max depth (${maxDepth} > ${exports.DAG_LIMITS.maxDepth})`,
+            details: {
+                reason: 'depth_exceeded',
+                limit: 'maxDepth',
+                value: maxDepth,
+                max: exports.DAG_LIMITS.maxDepth,
+            },
+        });
+    }
+    // -------------------------------------------------------------------------
+    // Compute statistics
+    // -------------------------------------------------------------------------
+    const rootCount = [...stepMap.values()].filter((ctx) => ctx.parent_step_ids.length === 0).length;
+    return {
+        valid: violations.length === 0,
+        violations,
+        stats: {
+            stepCount: contexts.length,
+            rootCount,
+            maxDepth,
+            totalEdges,
+            uniqueWorkflowIds: workflowIds.size,
+        },
+    };
+}
+/**
+ * Detect cycles using DFS with white-gray-black coloring
+ *
+ * White = unvisited
+ * Gray = in current path (visiting)
+ * Black = fully processed
+ */
+function detectCycle(stepMap) {
+    const WHITE = 0;
+    const GRAY = 1;
+    const BLACK = 2;
+    const color = new Map();
+    const parent = new Map();
+    // Initialize all nodes as white
+    for (const stepId of stepMap.keys()) {
+        color.set(stepId, WHITE);
+    }
+    // DFS from each unvisited node
+    for (const startId of stepMap.keys()) {
+        if (color.get(startId) === WHITE) {
+            const cyclePath = dfsVisit(startId, stepMap, color, parent);
+            if (cyclePath) {
+                return {
+                    code: kernel_1.ERROR_CODES.E_WORKFLOW_CYCLE_DETECTED,
+                    message: `Cycle detected in workflow DAG: ${cyclePath.join(' -> ')}`,
+                    details: {
+                        reason: 'cycle_detected',
+                        cycle_path: cyclePath,
+                    },
+                };
+            }
+        }
+    }
+    return null;
+}
+/**
+ * DFS visit helper for cycle detection
+ *
+ * Note: We traverse from child to parent (reverse edge direction)
+ * because parent_step_ids points to predecessors.
+ */
+function dfsVisit(nodeId, stepMap, color, parent) {
+    const WHITE = 0;
+    const GRAY = 1;
+    const BLACK = 2;
+    color.set(nodeId, GRAY);
+    const ctx = stepMap.get(nodeId);
+    if (ctx) {
+        for (const parentId of ctx.parent_step_ids) {
+            // Skip if parent doesn't exist (handled separately)
+            if (!stepMap.has(parentId))
+                continue;
+            if (color.get(parentId) === GRAY) {
+                // Found back edge -> cycle
+                const cyclePath = reconstructCyclePath(nodeId, parentId, parent);
+                return cyclePath;
+            }
+            if (color.get(parentId) === WHITE) {
+                parent.set(parentId, nodeId);
+                const result = dfsVisit(parentId, stepMap, color, parent);
+                if (result)
+                    return result;
+            }
+        }
+    }
+    color.set(nodeId, BLACK);
+    return null;
+}
+/**
+ * Reconstruct cycle path for error reporting
+ */
+function reconstructCyclePath(from, to, parent) {
+    const path = [to, from];
+    let current = from;
+    // Walk back from 'from' until we reach 'to' again
+    while (parent.has(current)) {
+        const prev = parent.get(current);
+        if (prev === null || prev === undefined || prev === to)
+            break;
+        path.push(prev);
+        current = prev;
+    }
+    // Close the cycle
+    path.push(to);
+    return path.reverse();
+}
+/**
+ * Calculate maximum depth of the DAG
+ *
+ * Depth is the longest path from any root (node with no parents) to any leaf.
+ * Uses memoization to avoid redundant computation.
+ */
+function calculateMaxDepth(stepMap) {
+    const memo = new Map();
+    // Find all roots (steps with no parents)
+    const roots = [];
+    for (const [stepId, ctx] of stepMap) {
+        if (ctx.parent_step_ids.length === 0) {
+            roots.push(stepId);
+        }
+    }
+    // If no roots, the graph might be cyclic or empty
+    if (roots.length === 0) {
+        return stepMap.size > 0 ? -1 : 0; // -1 indicates no roots (likely cyclic)
+    }
+    // Build child map for forward traversal
+    const childMap = new Map();
+    for (const [stepId, ctx] of stepMap) {
+        for (const parentId of ctx.parent_step_ids) {
+            if (!childMap.has(parentId)) {
+                childMap.set(parentId, []);
+            }
+            childMap.get(parentId).push(stepId);
+        }
+    }
+    // Calculate depth from each root
+    function getDepth(stepId) {
+        if (memo.has(stepId)) {
+            return memo.get(stepId);
+        }
+        const children = childMap.get(stepId) || [];
+        if (children.length === 0) {
+            memo.set(stepId, 1);
+            return 1;
+        }
+        let maxChildDepth = 0;
+        for (const childId of children) {
+            maxChildDepth = Math.max(maxChildDepth, getDepth(childId));
+        }
+        const depth = 1 + maxChildDepth;
+        memo.set(stepId, depth);
+        return depth;
+    }
+    let maxDepth = 0;
+    for (const rootId of roots) {
+        maxDepth = Math.max(maxDepth, getDepth(rootId));
+    }
+    return maxDepth;
+}
+/**
+ * Extract a specific violation by reason
+ *
+ * Utility for tests and error handling
+ */
+function findViolationByReason(result, reason) {
+    return result.violations.find((v) => v.details.reason === reason);
+}
+/**
+ * Check if result has a specific violation code
+ */
+function hasViolationCode(result, code) {
+    return result.violations.some((v) => v.code === code);
+}
+//# sourceMappingURL=workflow-dag.js.map

package/dist/workflow-dag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow-dag.js","sourceRoot":"","sources":["../src/workflow-dag.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;AAmHH,8CA2NC;AAgLD,sDAKC;AAKD,4CAKC;AA1gBD,yCAIsB;AACtB,yCAA2C;AAE3C,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E;;GAEG;AACU,QAAA,UAAU,GAAG;IACxB,sCAAsC;IACtC,QAAQ,EAAE,KAAK;IACf,6CAA6C;IAC7C,QAAQ,EAAE,GAAG;IACb,yDAAyD;IACzD,aAAa,EAAE,MAAM;CACb,CAAC;AAqEX,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,iBAAiB,CAAC,QAA2B;IAC3D,MAAM,UAAU,GAAmB,EAAE,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2B,CAAC;IACnD,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,4EAA4E;IAC5E,+CAA+C;IAC/C,4EAA4E;IAE5E,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,mCAAmC;QACnC,IAAI,CAAC,4BAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC/C,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,oBAAW,CAAC,qBAAqB;gBACvC,OAAO,EAAE,+BAA+B,GAAG,CAAC,WAAW,EAAE;gBACzD,OAAO,EAAE;oBACP,MAAM,EAAE,gBAAgB;oBACxB,WAAW,EAAE,GAAG,CAAC,WAAW;iBAC7B;aACF,CAAC,CAAC;QACL,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAEjC,+BAA+B;QAC/B,IAAI,CAAC,wBAAe,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACvC,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,oBAAW,CAAC,0BAA0B;gBAC5C,OAAO,EAAE,2BAA2B,GAAG,CAAC,OAAO,EAAE;gBACjD,OAAO,EAAE;oBACP,MAAM,EAAE,gBAAgB;oBACxB,OAAO,EAAE,GAAG,CAAC,OAAO;iBACrB;aACF,CAAC,CAAC;QACL,CAAC;QAED,qBAAqB;QACrB,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC/B,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,oBAAW,CAAC,sBAAsB;gBACxC,OAAO,EAAE,sBAAsB,GAAG,CAAC,OAAO,EAAE;gBAC5C,OAAO,EAAE;oBACP,MAAM,EAAE,mBAAmB;oBAC3B,OAAO,EAAE,GAAG,CAAC,OAAO;iBACrB;aACF,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAChC,CAAC;QAED,0BAA0B;QAC1B,IAAI,GAAG,CAAC,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC9C,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,oBAAW,CAAC,sBAAsB;gBACxC,OAAO,EAAE,kCAAkC,GAAG,CAAC,OAAO,EAAE;gBACxD,OAAO,EAAE;oBACP,MAAM,EAAE,aAAa;oBACrB,OAAO,EAAE,GAAG,CAAC,OAAO;iBACrB;aACF,CAAC,CAAC;QACL,CAAC;QAED,6BAA6B;QAC7B,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;QACnD,IAAI,aAAa,CAAC,IAAI,KAAK,GAAG,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;YACtD,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,oBAAW,CAAC,sBAAsB;gBACxC,OAAO,EAAE,wCAAwC,GAAG,CAAC,OAAO,EAAE;gBAC9D,OAAO,EAAE;oBACP,MAAM,EAAE,mBAAmB;oBAC3B,OAAO,EAAE,GAAG,CAAC,OAAO;iBACrB;aACF,CAAC,CAAC;QACL,CAAC;QAED,iCAAiC;QACjC,IAAI,GAAG,CAAC,eAAe,CAAC,MAAM,GAAG,wBAAe,CAAC,cAAc,EAAE,CAAC;YAChE,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,oBAAW,CAAC,yBAAyB;gBAC3C,OAAO,EAAE,QAAQ,GAAG,CAAC,OAAO,2BAA2B;gBACvD,OAAO,EAAE;oBACP,MAAM,EAAE,uBAAuB;oBAC/B,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,KAAK,EAAE,gBAAgB;oBACvB,KAAK,EAAE,GAAG,CAAC,eAAe,CAAC,MAAM;oBACjC,GAAG,EAAE,wBAAe,CAAC,cAAc;iBACpC;aACF,CAAC,CAAC;QACL,CAAC;QAED,UAAU,IAAI,GAAG,CAAC,eAAe,CAAC,MAAM,CAAC;IAC3C,CAAC;IAED,4EAA4E;IAC5E,qCAAqC;IACrC,4EAA4E;IAE5E,6BAA6B;IAC7B,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACzB,UAAU,CAAC,IAAI,CAAC;YACd,IAAI,EAAE,oBAAW,CAAC,sBAAsB;YACxC,OAAO,EAAE,gCAAgC,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACtE,OAAO,EAAE;gBACP,MAAM,EAAE,2BAA2B;gBACnC,WAAW,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;aACjC;SACF,CAAC,CAAC;IACL,CAAC;IAED,sBAAsB;IACtB,IAAI,QAAQ,CAAC,MAAM,GAAG,kBAAU,CAAC,QAAQ,EAAE,CAAC;QAC1C,UAAU,CAAC,IAAI,CAAC;YACd,IAAI,EAAE,oBAAW,CAAC,yBAAyB;YAC3C,OAAO,EAAE,oCAAoC,QAAQ,CAAC,MAAM,MAAM,kBAAU,CAAC,QAAQ,GAAG;YACxF,OAAO,EAAE;gBACP,MAAM,EAAE,qBAAqB;gBAC7B,KAAK,EAAE,UAAU;gBACjB,KAAK,EAAE,QAAQ,CAAC,MAAM;gBACtB,GAAG,EAAE,kBAAU,CAAC,QAAQ;aACzB;SACF,CAAC,CAAC;IACL,CAAC;IAED,uBAAuB;IACvB,IAAI,UAAU,GAAG,kBAAU,CAAC,aAAa,EAAE,CAAC;QAC1C,UAAU,CAAC,IAAI,CAAC;YACd,IAAI,EAAE,oBAAW,CAAC,yBAAyB;YAC3C,OAAO,EAAE,oCAAoC,UAAU,MAAM,kBAAU,CAAC,aAAa,GAAG;YACxF,OAAO,EAAE;gBACP,MAAM,EAAE,qBAAqB;gBAC7B,KAAK,EAAE,eAAe;gBACtB,KAAK,EAAE,UAAU;gBACjB,GAAG,EAAE,kBAAU,CAAC,aAAa;aAC9B;SACF,CAAC,CAAC;IACL,CAAC;IAED,4EAA4E;IAC5E,uCAAuC;IACvC,4EAA4E;IAE5E,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;YAC3C,+BAA+B;YAC/B,IAAI,CAAC,wBAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACpC,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,oBAAW,CAAC,0BAA0B;oBAC5C,OAAO,EAAE,kCAAkC,QAAQ,EAAE;oBACrD,OAAO,EAAE;wBACP,MAAM,EAAE,gBAAgB;wBACxB,OAAO,EAAE,GAAG,CAAC,OAAO;wBACpB,cAAc,EAAE,QAAQ;qBACzB;iBACF,CAAC,CAAC;YACL,CAAC;YAED,uBAAuB;YACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,oBAAW,CAAC,2BAA2B;oBAC7C,OAAO,EAAE,0BAA0B,QAAQ,mBAAmB,GAAG,CAAC,OAAO,GAAG;oBAC5E,OAAO,EAAE;wBACP,MAAM,EAAE,kBAAkB;wBAC1B,OAAO,EAAE,GAAG,CAAC,OAAO;wBACpB,cAAc,EAAE,QAAQ;qBACzB;iBACF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,oDAAoD;IACpD,4EAA4E;IAE5E,MAAM,cAAc,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IAC5C,IAAI,cAAc,EAAE,CAAC;QACnB,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;IAED,4EAA4E;IAC5E,6CAA6C;IAC7C,4EAA4E;IAE5E,MAAM,QAAQ,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;IAC5C,IAAI,QAAQ,GAAG,kBAAU,CAAC,QAAQ,EAAE,CAAC;QACnC,UAAU,CAAC,IAAI,CAAC;YACd,IAAI,EAAE,oBAAW,CAAC,yBAAyB;YAC3C,OAAO,EAAE,+BAA+B,QAAQ,MAAM,kBAAU,CAAC,QAAQ,GAAG;YAC5E,OAAO,EAAE;gBACP,MAAM,EAAE,gBAAgB;gBACxB,KAAK,EAAE,UAAU;gBACjB,KAAK,EAAE,QAAQ;gBACf,GAAG,EAAE,kBAAU,CAAC,QAAQ;aACzB;SACF,CAAC,CAAC;IACL,CAAC;IAED,4EAA4E;IAC5E,qBAAqB;IACrB,4EAA4E;IAE5E,MAAM,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAC5C,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,CAC1C,CAAC,MAAM,CAAC;IAET,OAAO;QACL,KAAK,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC;QAC9B,UAAU;QACV,KAAK,EAAE;YACL,SAAS,EAAE,QAAQ,CAAC,MAAM;YAC1B,SAAS;YACT,QAAQ;YACR,UAAU;YACV,iBAAiB,EAAE,WAAW,CAAC,IAAI;SACpC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,WAAW,CAAC,OAAqC;IACxD,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,IAAI,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,CAAC;IAEhB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEhD,gCAAgC;IAChC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QACpC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QACrC,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;YAC5D,IAAI,SAAS,EAAE,CAAC;gBACd,OAAO;oBACL,IAAI,EAAE,oBAAW,CAAC,yBAAyB;oBAC3C,OAAO,EAAE,mCAAmC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;oBACpE,OAAO,EAAE;wBACP,MAAM,EAAE,gBAAgB;wBACxB,UAAU,EAAE,SAAS;qBACtB;iBACF,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CACf,MAAc,EACd,OAAqC,EACrC,KAA0B,EAC1B,MAAkC;IAElC,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,IAAI,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,CAAC;IAEhB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACxB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEhC,IAAI,GAAG,EAAE,CAAC;QACR,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;YAC3C,oDAAoD;YACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAErC,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;gBACjC,2BAA2B;gBAC3B,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;gBACjE,OAAO,SAAS,CAAC;YACnB,CAAC;YAED,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC;gBAClC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC1D,IAAI,MAAM;oBAAE,OAAO,MAAM,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzB,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,IAAY,EACZ,EAAU,EACV,MAAkC;IAElC,MAAM,IAAI,GAAa,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAClC,IAAI,OAAO,GAAG,IAAI,CAAC;IAEnB,kDAAkD;IAClD,OAAO,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,EAAE;YAAE,MAAM;QAC9D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,OAAO,GAAG,IAAI,CAAC;IACjB,CAAC;IAED,kBAAkB;IAClB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;AACxB,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,OAAqC;IAC9D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEvC,yCAAyC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wCAAwC;IAC5E,CAAC;IAED,wCAAwC;IACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;QACpC,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;YAC3C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAC7B,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,SAAS,QAAQ,CAAC,MAAc;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAC3B,CAAC;QAED,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC5C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;QAC7D,CAAC;QAED,MAAM,KAAK,GAAG,CAAC,GAAG,aAAa,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CACnC,MAA6B,EAC7B,MAAc;IAEd,OAAO,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;AACpE,CAAC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAC9B,MAA6B,EAC7B,IAAuB;IAEvB,OAAO,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AACxD,CAAC"}

package/package.json

@@ -0,0 +1,54 @@
+{
+  "name": "@peac/audit",
+  "version": "0.10.9",
+  "description": "Audit logging and case bundle generation for PEAC protocol disputes",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "require": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/peacprotocol/peac.git",
+    "directory": "packages/audit"
+  },
+  "author": "jithinraj <7850727+jithinraj@users.noreply.github.com>",
+  "license": "Apache-2.0",
+  "engines": {
+    "node": ">=18"
+  },
+  "dependencies": {
+    "yazl": "^2.5.1",
+    "yauzl": "^2.10.0",
+    "@peac/crypto": "0.10.9",
+    "@peac/kernel": "0.10.9",
+    "@peac/schema": "0.10.9"
+  },
+  "devDependencies": {
+    "@types/node": "^20.10.0",
+    "@types/yauzl": "^2.10.3",
+    "@types/yazl": "^2.4.5",
+    "typescript": "^5.3.3",
+    "vitest": "^1.6.0"
+  },
+  "publishConfig": {
+    "access": "public",
+    "provenance": true
+  },
+  "sideEffects": false,
+  "scripts": {
+    "build": "tsc",
+    "typecheck": "tsc --noEmit",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "clean": "rm -rf dist"
+  }
+}