open-multi-agent-kit 0.80.7 → 0.90.0

package/dist/fuzzing/mutation-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mutation-engine.d.ts","sourceRoot":"","sources":["../../src/fuzzing/mutation-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAQH,MAAM,WAAW,gBAAgB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,IAAI;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,iBAAiB;IACjC,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IACtB,OAAO,IAAI,IAAI,GAAG,SAAS,CAAC;IAC5B,OAAO,IAAI,IAAI,GAAG,SAAS,CAAC;CAC5B;AAED,qBAAa,uBAAwB,YAAW,iBAAiB;IAChE,KAAK,EAAE,IAAI,EAAE,CAAM;IACnB,OAAO,CAAC,KAAK,CAAK;IAElB,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAGpB;IAED,OAAO,IAAI,IAAI,GAAG,SAAS,CAK1B;IAED,OAAO,IAAI,IAAI,GAAG,SAAS,CAE1B;CACD;AAMD,MAAM,WAAW,OAAO;IACvB,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,gBAAgB,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;CACrF;AAED,qBAAa,cAAe,YAAW,OAAO;IAC7C,OAAO,CAAC,UAAU,CAOhB;IAED,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC,UAAU,CAAC,CAQrF;IAED,OAAO,CAAC,KAAK;CAwCb;AAED,qBAAa,eAAgB,YAAW,OAAO;IAC7C,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC,UAAU,CAAC,CAOrF;CACD;AAED,qBAAa,iBAAkB,YAAW,OAAO;IAChD,OAAO,CAAC,QAAQ,CAAoB;IAEnC,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC,UAAU,CAAC,CAUrF;CACD;AAED,qBAAa,uBAAwB,YAAW,OAAO;IACtD,OAAO,CAAC,YAAY,CAA0C;IAC9D,OAAO,CAAC,aAAa,CAAkD;IACvE,OAAO,CAAC,aAAa,CAAyD;IAE7E,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC,UAAU,CAAC,CAwBrF;CACD;AAMD,MAAM,WAAW,wBAAwB;IACxC,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CACjB;AAED,qBAAa,mBAAmB;IAC/B,OAAO,EAAE,wBAAwB,EAAE,CAWjC;IAEF,cAAc,IAAI,wBAAwB,GAAG,SAAS,CASrD;IAED,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,wBAAwB,EAAE,CAE1D;CACD;AAED,qBAAa,uBAAwB,YAAW,OAAO;IACtD,OAAO,CAAC,UAAU,CAAsB;IAExC,YAAY,UAAU,CAAC,EAAE,mBAAmB,EAE3C;IAEA,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC,UAAU,CAAC,CASrF;CACD;AAMD,MAAM,WAAW,cAAc;IAC9B,OAAO,EAAE,UAAU,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;CACjB;AAED,qBAAa,qBAAqB;IACjC,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,MAAM,EAAE,iBAAiB,CAAC;IAC1B,UAAU,EAAE,mBAAmB,CAAC;IAChC,mBAAmB,EAAE,MAAM,CAAC;IAE5B,YAAY,OAAO,CAAC,EAAE;QACrB,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAC;QACrB,MAAM,CAAC,EAAE,iBAAiB,CAAC;QAC3B,UAAU,CAAC,EAAE,mBAAmB,CAAC;QACjC,mBAAmB,CAAC,EAAE,MAAM,CAAC;KAC7B,EAWA;IAEA,iBAAiB,CAAC,IAAI,EAAE,IAAI,GAAG,SAAS,CAAC,cAAc,CAAC,CAexD;IAED,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,SAAI,EAAE,QAAQ,CAAC,EAAE,gBAAgB,GAAG,IAAI,CAUlE;CACD;AAMD,wBAAgB,2BAA2B,IAAI,qBAAqB,CAEnE","sourcesContent":["/**\n * OMK Jailbreak v6 — Fuzzing Module (TypeScript Port)\n * ====================================================\n * packages/coding-agent/src/fuzzing/mutation-engine.ts\n *\n * Coverage-Guided Mutation + Seed Corpus management for\n * jailbreak payload transformation.\n *\n * Zero API calls — pure local computation.\n */\n\nimport { randomBytes } from \"node:crypto\";\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Types\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface CoverageFeedback {\n\tnewEdges: number;\n\ttotalEdges: number;\n\tcoverageRatio: number;\n}\n\nexport interface Seed {\n\tid: string;\n\tdata: string;\n\tscore: number;\n\tcoverage: CoverageFeedback;\n\tdepth: number;\n\tparentId?: string;\n}\n\nexport interface SeedCorpusManager {\n\tseeds: Seed[];\n\tadd(seed: Seed): void;\n\tgetNext(): Seed | undefined;\n\tgetBest(): Seed | undefined;\n}\n\nexport class SimpleSeedCorpusManager implements SeedCorpusManager {\n\tseeds: Seed[] = [];\n\tprivate index = 0;\n\n\tadd(seed: Seed): void {\n\t\tthis.seeds.push(seed);\n\t\tthis.seeds.sort((a, b) => b.score - a.score);\n\t}\n\n\tgetNext(): Seed | undefined {\n\t\tif (this.seeds.length === 0) return undefined;\n\t\tconst seed = this.seeds[this.index % this.seeds.length];\n\t\tthis.index++;\n\t\treturn seed;\n\t}\n\n\tgetBest(): Seed | undefined {\n\t\treturn this.seeds[0];\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Bit-level Mutators (AFL++ style)\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface Mutator {\n\tmutate(data: Uint8Array, coverageFeedback?: CoverageFeedback): Generator<Uint8Array>;\n}\n\nexport class BitFlipMutator implements Mutator {\n\tprivate strategies = [\n\t\t{ name: \"bitflip_1\", step: 1, mode: \"single\" as const },\n\t\t{ name: \"bitflip_2\", step: 2, mode: \"adjacent\" as const },\n\t\t{ name: \"bitflip_4\", step: 4, mode: \"adjacent\" as const },\n\t\t{ name: \"arith_8\", step: 8, mode: \"arithmetic\" as const },\n\t\t{ name: \"arith_16\", step: 16, mode: \"arithmetic\" as const },\n\t\t{ name: \"arith_32\", step: 32, mode: \"arithmetic\" as const },\n\t];\n\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tfor (const strategy of this.strategies) {\n\t\t\tconst step = strategy.step;\n\t\t\tif (data.length * 8 < step) continue;\n\t\t\tfor (let i = 0; i <= data.length * 8 - step; i += step) {\n\t\t\t\tyield this.apply(data, i, strategy);\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate apply(data: Uint8Array, bitIdx: number, strategy: { step: number; mode: string }): Uint8Array {\n\t\tconst step = strategy.step;\n\t\tconst mode = strategy.mode;\n\t\tconst arr = new Uint8Array(data);\n\n\t\tif (mode === \"single\") {\n\t\t\tconst byteIdx = Math.floor(bitIdx / 8);\n\t\t\tconst bitInByte = bitIdx % 8;\n\t\t\tif (byteIdx < arr.length) {\n\t\t\t\tarr[byteIdx] ^= 1 << bitInByte;\n\t\t\t}\n\t\t} else if (mode === \"adjacent\") {\n\t\t\tfor (let b = 0; b < step; b++) {\n\t\t\t\tconst idx = bitIdx + b;\n\t\t\t\tconst byteIdx = Math.floor(idx / 8);\n\t\t\t\tconst bitInByte = idx % 8;\n\t\t\t\tif (byteIdx < arr.length) {\n\t\t\t\t\tarr[byteIdx] ^= 1 << bitInByte;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (mode === \"arithmetic\") {\n\t\t\tconst byteIdx = Math.floor(bitIdx / 8);\n\t\t\tif (step === 8 && byteIdx < arr.length) {\n\t\t\t\tarr[byteIdx] = (arr[byteIdx] + 1) & 0xff;\n\t\t\t} else if (step === 16 && byteIdx + 1 < arr.length) {\n\t\t\t\tlet val = (arr[byteIdx] << 8) | arr[byteIdx + 1];\n\t\t\t\tval = (val + 1) & 0xffff;\n\t\t\t\tarr[byteIdx] = (val >> 8) & 0xff;\n\t\t\t\tarr[byteIdx + 1] = val & 0xff;\n\t\t\t} else if (step === 32 && byteIdx + 3 < arr.length) {\n\t\t\t\tlet val = (arr[byteIdx] << 24) | (arr[byteIdx + 1] << 16) | (arr[byteIdx + 2] << 8) | arr[byteIdx + 3];\n\t\t\t\tval = (val + 1) & 0xffffffff;\n\t\t\t\tarr[byteIdx] = (val >>> 24) & 0xff;\n\t\t\t\tarr[byteIdx + 1] = (val >>> 16) & 0xff;\n\t\t\t\tarr[byteIdx + 2] = (val >>> 8) & 0xff;\n\t\t\t\tarr[byteIdx + 3] = val & 0xff;\n\t\t\t}\n\t\t}\n\t\treturn arr;\n\t}\n}\n\nexport class ByteFlipMutator implements Mutator {\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tconst arr = new Uint8Array(data);\n\t\tfor (let i = 0; i < arr.length; i++) {\n\t\t\tarr[i] ^= 0xff;\n\t\t\tyield new Uint8Array(arr);\n\t\t\tarr[i] ^= 0xff;\n\t\t}\n\t}\n}\n\nexport class ArithmeticMutator implements Mutator {\n\tprivate arithOps = [1, -1, 10, -10];\n\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tconst arr = new Uint8Array(data);\n\t\tfor (let i = 0; i < arr.length; i++) {\n\t\t\tfor (const op of this.arithOps) {\n\t\t\t\tconst original = arr[i];\n\t\t\t\tarr[i] = (arr[i] + op) & 0xff;\n\t\t\t\tyield new Uint8Array(arr);\n\t\t\t\tarr[i] = original;\n\t\t\t}\n\t\t}\n\t}\n}\n\nexport class InterestingValueMutator implements Mutator {\n\tprivate interesting8 = [0, 1, 16, 32, 64, 100, 127, 128, 255];\n\tprivate interesting16 = [0, 1, 255, 256, 512, 1000, 1024, 4096, 65535];\n\tprivate interesting32 = [0, 1, 65535, 65536, 1000000, 2147483647, 4294967295];\n\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tconst arr = new Uint8Array(data);\n\t\tfor (let i = 0; i < arr.length; i++) {\n\t\t\tfor (const v of this.interesting8) {\n\t\t\t\tarr[i] = v & 0xff;\n\t\t\t\tyield new Uint8Array(arr);\n\t\t\t}\n\t\t}\n\t\tfor (let i = 0; i + 1 < arr.length; i++) {\n\t\t\tfor (const v of this.interesting16) {\n\t\t\t\tarr[i] = (v >> 8) & 0xff;\n\t\t\t\tarr[i + 1] = v & 0xff;\n\t\t\t\tyield new Uint8Array(arr);\n\t\t\t}\n\t\t}\n\t\tfor (let i = 0; i + 3 < arr.length; i++) {\n\t\t\tfor (const v of this.interesting32) {\n\t\t\t\tarr[i] = (v >>> 24) & 0xff;\n\t\t\t\tarr[i + 1] = (v >>> 16) & 0xff;\n\t\t\t\tarr[i + 2] = (v >>> 8) & 0xff;\n\t\t\t\tarr[i + 3] = v & 0xff;\n\t\t\t\tyield new Uint8Array(arr);\n\t\t\t}\n\t\t}\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Dictionary-based Mutators\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface JailbreakDictionaryEntry {\n\tterm: string;\n\tweight: number;\n\tcategory: string;\n}\n\nexport class JailbreakDictionary {\n\tentries: JailbreakDictionaryEntry[] = [\n\t\t{ term: \"ignore previous instructions\", weight: 1.0, category: \"direct\" },\n\t\t{ term: \"DAN mode\", weight: 0.9, category: \"persona\" },\n\t\t{ term: \"developer mode\", weight: 0.85, category: \"persona\" },\n\t\t{ term: \"jailbreak\", weight: 0.8, category: \"meta\" },\n\t\t{ term: \"hypothetical\", weight: 0.7, category: \"framing\" },\n\t\t{ term: \"educational purpose\", weight: 0.6, category: \"framing\" },\n\t\t{ term: \"research context\", weight: 0.6, category: \"framing\" },\n\t\t{ term: \"translate to\", weight: 0.5, category: \"encoding\" },\n\t\t{ term: \"base64 decode\", weight: 0.5, category: \"encoding\" },\n\t\t{ term: \"hex decode\", weight: 0.5, category: \"encoding\" },\n\t];\n\n\tgetRandomEntry(): JailbreakDictionaryEntry | undefined {\n\t\tif (this.entries.length === 0) return undefined;\n\t\tconst totalWeight = this.entries.reduce((sum, e) => sum + e.weight, 0);\n\t\tlet r = Math.random() * totalWeight;\n\t\tfor (const entry of this.entries) {\n\t\t\tr -= entry.weight;\n\t\t\tif (r <= 0) return entry;\n\t\t}\n\t\treturn this.entries[this.entries.length - 1];\n\t}\n\n\tgetByCategory(category: string): JailbreakDictionaryEntry[] {\n\t\treturn this.entries.filter((e) => e.category === category);\n\t}\n}\n\nexport class DictionaryInsertMutator implements Mutator {\n\tprivate dictionary: JailbreakDictionary;\n\n\tconstructor(dictionary?: JailbreakDictionary) {\n\t\tthis.dictionary = dictionary || new JailbreakDictionary();\n\t}\n\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tconst text = new TextDecoder().decode(data);\n\t\tconst entry = this.dictionary.getRandomEntry();\n\t\tif (!entry) return;\n\n\t\t// Insert at random position\n\t\tconst pos = Math.floor(Math.random() * (text.length + 1));\n\t\tconst mutated = text.slice(0, pos) + entry.term + text.slice(pos);\n\t\tyield new TextEncoder().encode(mutated);\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Fuzzing Mutation Engine\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface MutationResult {\n\tmutated: Uint8Array;\n\tmutatorName: string;\n\tparentId: string;\n}\n\nexport class FuzzingMutationEngine {\n\tmutators: Mutator[];\n\tcorpus: SeedCorpusManager;\n\tdictionary: JailbreakDictionary;\n\tmaxMutationsPerSeed: number;\n\n\tconstructor(options?: {\n\t\tmutators?: Mutator[];\n\t\tcorpus?: SeedCorpusManager;\n\t\tdictionary?: JailbreakDictionary;\n\t\tmaxMutationsPerSeed?: number;\n\t}) {\n\t\tthis.mutators = options?.mutators || [\n\t\t\tnew BitFlipMutator(),\n\t\t\tnew ByteFlipMutator(),\n\t\t\tnew ArithmeticMutator(),\n\t\t\tnew InterestingValueMutator(),\n\t\t\tnew DictionaryInsertMutator(),\n\t\t];\n\t\tthis.corpus = options?.corpus || new SimpleSeedCorpusManager();\n\t\tthis.dictionary = options?.dictionary || new JailbreakDictionary();\n\t\tthis.maxMutationsPerSeed = options?.maxMutationsPerSeed || 50;\n\t}\n\n\t*generateMutations(seed: Seed): Generator<MutationResult> {\n\t\tconst data = new TextEncoder().encode(seed.data);\n\t\tlet count = 0;\n\t\tfor (const mutator of this.mutators) {\n\t\t\tfor (const mutated of mutator.mutate(data)) {\n\t\t\t\tif (count >= this.maxMutationsPerSeed) return;\n\t\t\t\tconst name = mutator.constructor.name;\n\t\t\t\tyield {\n\t\t\t\t\tmutated,\n\t\t\t\t\tmutatorName: name,\n\t\t\t\t\tparentId: seed.id,\n\t\t\t\t};\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t}\n\n\taddSeed(data: string, score = 0, coverage?: CoverageFeedback): Seed {\n\t\tconst seed: Seed = {\n\t\t\tid: randomBytes(8).toString(\"hex\"),\n\t\t\tdata,\n\t\t\tscore,\n\t\t\tcoverage: coverage || { newEdges: 0, totalEdges: 1, coverageRatio: 0 },\n\t\t\tdepth: 0,\n\t\t};\n\t\tthis.corpus.add(seed);\n\t\treturn seed;\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Convenience exports\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport function createDefaultMutationEngine(): FuzzingMutationEngine {\n\treturn new FuzzingMutationEngine();\n}\n"]}

package/dist/fuzzing/mutation-engine.js

@@ -0,0 +1,244 @@
+/**
+ * OMK Jailbreak v6 — Fuzzing Module (TypeScript Port)
+ * ====================================================
+ * packages/coding-agent/src/fuzzing/mutation-engine.ts
+ *
+ * Coverage-Guided Mutation + Seed Corpus management for
+ * jailbreak payload transformation.
+ *
+ * Zero API calls — pure local computation.
+ */
+import { randomBytes } from "node:crypto";
+export class SimpleSeedCorpusManager {
+    seeds = [];
+    index = 0;
+    add(seed) {
+        this.seeds.push(seed);
+        this.seeds.sort((a, b) => b.score - a.score);
+    }
+    getNext() {
+        if (this.seeds.length === 0)
+            return undefined;
+        const seed = this.seeds[this.index % this.seeds.length];
+        this.index++;
+        return seed;
+    }
+    getBest() {
+        return this.seeds[0];
+    }
+}
+export class BitFlipMutator {
+    strategies = [
+        { name: "bitflip_1", step: 1, mode: "single" },
+        { name: "bitflip_2", step: 2, mode: "adjacent" },
+        { name: "bitflip_4", step: 4, mode: "adjacent" },
+        { name: "arith_8", step: 8, mode: "arithmetic" },
+        { name: "arith_16", step: 16, mode: "arithmetic" },
+        { name: "arith_32", step: 32, mode: "arithmetic" },
+    ];
+    *mutate(data, _coverageFeedback) {
+        for (const strategy of this.strategies) {
+            const step = strategy.step;
+            if (data.length * 8 < step)
+                continue;
+            for (let i = 0; i <= data.length * 8 - step; i += step) {
+                yield this.apply(data, i, strategy);
+            }
+        }
+    }
+    apply(data, bitIdx, strategy) {
+        const step = strategy.step;
+        const mode = strategy.mode;
+        const arr = new Uint8Array(data);
+        if (mode === "single") {
+            const byteIdx = Math.floor(bitIdx / 8);
+            const bitInByte = bitIdx % 8;
+            if (byteIdx < arr.length) {
+                arr[byteIdx] ^= 1 << bitInByte;
+            }
+        }
+        else if (mode === "adjacent") {
+            for (let b = 0; b < step; b++) {
+                const idx = bitIdx + b;
+                const byteIdx = Math.floor(idx / 8);
+                const bitInByte = idx % 8;
+                if (byteIdx < arr.length) {
+                    arr[byteIdx] ^= 1 << bitInByte;
+                }
+            }
+        }
+        else if (mode === "arithmetic") {
+            const byteIdx = Math.floor(bitIdx / 8);
+            if (step === 8 && byteIdx < arr.length) {
+                arr[byteIdx] = (arr[byteIdx] + 1) & 0xff;
+            }
+            else if (step === 16 && byteIdx + 1 < arr.length) {
+                let val = (arr[byteIdx] << 8) | arr[byteIdx + 1];
+                val = (val + 1) & 0xffff;
+                arr[byteIdx] = (val >> 8) & 0xff;
+                arr[byteIdx + 1] = val & 0xff;
+            }
+            else if (step === 32 && byteIdx + 3 < arr.length) {
+                let val = (arr[byteIdx] << 24) | (arr[byteIdx + 1] << 16) | (arr[byteIdx + 2] << 8) | arr[byteIdx + 3];
+                val = (val + 1) & 0xffffffff;
+                arr[byteIdx] = (val >>> 24) & 0xff;
+                arr[byteIdx + 1] = (val >>> 16) & 0xff;
+                arr[byteIdx + 2] = (val >>> 8) & 0xff;
+                arr[byteIdx + 3] = val & 0xff;
+            }
+        }
+        return arr;
+    }
+}
+export class ByteFlipMutator {
+    *mutate(data, _coverageFeedback) {
+        const arr = new Uint8Array(data);
+        for (let i = 0; i < arr.length; i++) {
+            arr[i] ^= 0xff;
+            yield new Uint8Array(arr);
+            arr[i] ^= 0xff;
+        }
+    }
+}
+export class ArithmeticMutator {
+    arithOps = [1, -1, 10, -10];
+    *mutate(data, _coverageFeedback) {
+        const arr = new Uint8Array(data);
+        for (let i = 0; i < arr.length; i++) {
+            for (const op of this.arithOps) {
+                const original = arr[i];
+                arr[i] = (arr[i] + op) & 0xff;
+                yield new Uint8Array(arr);
+                arr[i] = original;
+            }
+        }
+    }
+}
+export class InterestingValueMutator {
+    interesting8 = [0, 1, 16, 32, 64, 100, 127, 128, 255];
+    interesting16 = [0, 1, 255, 256, 512, 1000, 1024, 4096, 65535];
+    interesting32 = [0, 1, 65535, 65536, 1000000, 2147483647, 4294967295];
+    *mutate(data, _coverageFeedback) {
+        const arr = new Uint8Array(data);
+        for (let i = 0; i < arr.length; i++) {
+            for (const v of this.interesting8) {
+                arr[i] = v & 0xff;
+                yield new Uint8Array(arr);
+            }
+        }
+        for (let i = 0; i + 1 < arr.length; i++) {
+            for (const v of this.interesting16) {
+                arr[i] = (v >> 8) & 0xff;
+                arr[i + 1] = v & 0xff;
+                yield new Uint8Array(arr);
+            }
+        }
+        for (let i = 0; i + 3 < arr.length; i++) {
+            for (const v of this.interesting32) {
+                arr[i] = (v >>> 24) & 0xff;
+                arr[i + 1] = (v >>> 16) & 0xff;
+                arr[i + 2] = (v >>> 8) & 0xff;
+                arr[i + 3] = v & 0xff;
+                yield new Uint8Array(arr);
+            }
+        }
+    }
+}
+export class JailbreakDictionary {
+    entries = [
+        { term: "ignore previous instructions", weight: 1.0, category: "direct" },
+        { term: "DAN mode", weight: 0.9, category: "persona" },
+        { term: "developer mode", weight: 0.85, category: "persona" },
+        { term: "jailbreak", weight: 0.8, category: "meta" },
+        { term: "hypothetical", weight: 0.7, category: "framing" },
+        { term: "educational purpose", weight: 0.6, category: "framing" },
+        { term: "research context", weight: 0.6, category: "framing" },
+        { term: "translate to", weight: 0.5, category: "encoding" },
+        { term: "base64 decode", weight: 0.5, category: "encoding" },
+        { term: "hex decode", weight: 0.5, category: "encoding" },
+    ];
+    getRandomEntry() {
+        if (this.entries.length === 0)
+            return undefined;
+        const totalWeight = this.entries.reduce((sum, e) => sum + e.weight, 0);
+        let r = Math.random() * totalWeight;
+        for (const entry of this.entries) {
+            r -= entry.weight;
+            if (r <= 0)
+                return entry;
+        }
+        return this.entries[this.entries.length - 1];
+    }
+    getByCategory(category) {
+        return this.entries.filter((e) => e.category === category);
+    }
+}
+export class DictionaryInsertMutator {
+    dictionary;
+    constructor(dictionary) {
+        this.dictionary = dictionary || new JailbreakDictionary();
+    }
+    *mutate(data, _coverageFeedback) {
+        const text = new TextDecoder().decode(data);
+        const entry = this.dictionary.getRandomEntry();
+        if (!entry)
+            return;
+        // Insert at random position
+        const pos = Math.floor(Math.random() * (text.length + 1));
+        const mutated = text.slice(0, pos) + entry.term + text.slice(pos);
+        yield new TextEncoder().encode(mutated);
+    }
+}
+export class FuzzingMutationEngine {
+    mutators;
+    corpus;
+    dictionary;
+    maxMutationsPerSeed;
+    constructor(options) {
+        this.mutators = options?.mutators || [
+            new BitFlipMutator(),
+            new ByteFlipMutator(),
+            new ArithmeticMutator(),
+            new InterestingValueMutator(),
+            new DictionaryInsertMutator(),
+        ];
+        this.corpus = options?.corpus || new SimpleSeedCorpusManager();
+        this.dictionary = options?.dictionary || new JailbreakDictionary();
+        this.maxMutationsPerSeed = options?.maxMutationsPerSeed || 50;
+    }
+    *generateMutations(seed) {
+        const data = new TextEncoder().encode(seed.data);
+        let count = 0;
+        for (const mutator of this.mutators) {
+            for (const mutated of mutator.mutate(data)) {
+                if (count >= this.maxMutationsPerSeed)
+                    return;
+                const name = mutator.constructor.name;
+                yield {
+                    mutated,
+                    mutatorName: name,
+                    parentId: seed.id,
+                };
+                count++;
+            }
+        }
+    }
+    addSeed(data, score = 0, coverage) {
+        const seed = {
+            id: randomBytes(8).toString("hex"),
+            data,
+            score,
+            coverage: coverage || { newEdges: 0, totalEdges: 1, coverageRatio: 0 },
+            depth: 0,
+        };
+        this.corpus.add(seed);
+        return seed;
+    }
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// Convenience exports
+// ═══════════════════════════════════════════════════════════════════════════
+export function createDefaultMutationEngine() {
+    return new FuzzingMutationEngine();
+}
+//# sourceMappingURL=mutation-engine.js.map

package/dist/fuzzing/mutation-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mutation-engine.js","sourceRoot":"","sources":["../../src/fuzzing/mutation-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AA4B1C,MAAM,OAAO,uBAAuB;IACnC,KAAK,GAAW,EAAE,CAAC;IACX,KAAK,GAAG,CAAC,CAAC;IAElB,GAAG,CAAC,IAAU,EAAQ;QACrB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAAA,CAC7C;IAED,OAAO,GAAqB;QAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACxD,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC;IAAA,CACZ;IAED,OAAO,GAAqB;QAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAAA,CACrB;CACD;AAUD,MAAM,OAAO,cAAc;IAClB,UAAU,GAAG;QACpB,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,QAAiB,EAAE;QACvD,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAmB,EAAE;QACzD,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,UAAmB,EAAE;QACzD,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,YAAqB,EAAE;QACzD,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,YAAqB,EAAE;QAC3D,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,YAAqB,EAAE;KAC3D,CAAC;IAEF,CAAC,MAAM,CAAC,IAAgB,EAAE,iBAAoC,EAAyB;QACtF,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC3B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI;gBAAE,SAAS;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;gBACxD,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrC,CAAC;QACF,CAAC;IAAA,CACD;IAEO,KAAK,CAAC,IAAgB,EAAE,MAAc,EAAE,QAAwC,EAAc;QACrG,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAEjC,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvC,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC;YAC7B,IAAI,OAAO,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC1B,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;YAChC,CAAC;QACF,CAAC;aAAM,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;gBACvB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;gBACpC,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC;gBAC1B,IAAI,OAAO,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;oBAC1B,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;gBAChC,CAAC;YACF,CAAC;QACF,CAAC;aAAM,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,IAAI,KAAK,CAAC,IAAI,OAAO,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;gBACxC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;YAC1C,CAAC;iBAAM,IAAI,IAAI,KAAK,EAAE,IAAI,OAAO,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;gBACpD,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;gBACjD,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;gBACzB,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;gBACjC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC;YAC/B,CAAC;iBAAM,IAAI,IAAI,KAAK,EAAE,IAAI,OAAO,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;gBACpD,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;gBACvG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;gBAC7B,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;gBACnC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;gBACvC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;gBACtC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC;YAC/B,CAAC;QACF,CAAC;QACD,OAAO,GAAG,CAAC;IAAA,CACX;CACD;AAED,MAAM,OAAO,eAAe;IAC3B,CAAC,MAAM,CAAC,IAAgB,EAAE,iBAAoC,EAAyB;QACtF,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACf,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;YAC1B,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QAChB,CAAC;IAAA,CACD;CACD;AAED,MAAM,OAAO,iBAAiB;IACrB,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAEpC,CAAC,MAAM,CAAC,IAAgB,EAAE,iBAAoC,EAAyB;QACtF,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACxB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;gBAC9B,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;gBAC1B,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACnB,CAAC;QACF,CAAC;IAAA,CACD;CACD;AAED,MAAM,OAAO,uBAAuB;IAC3B,YAAY,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACtD,aAAa,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC/D,aAAa,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;IAE9E,CAAC,MAAM,CAAC,IAAgB,EAAE,iBAAoC,EAAyB;QACtF,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACnC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;gBAClB,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;QACF,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACpC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;gBACzB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;gBACtB,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;QACF,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACpC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;gBAC3B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;gBAC/B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;gBAC9B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;gBACtB,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;QACF,CAAC;IAAA,CACD;CACD;AAYD,MAAM,OAAO,mBAAmB;IAC/B,OAAO,GAA+B;QACrC,EAAE,IAAI,EAAE,8BAA8B,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE;QACzE,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE;QACtD,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE;QAC7D,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE;QACpD,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE;QAC1D,EAAE,IAAI,EAAE,qBAAqB,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE;QACjE,EAAE,IAAI,EAAE,kBAAkB,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE;QAC9D,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE;QAC3D,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE;QAC5D,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE;KACzD,CAAC;IAEF,cAAc,GAAyC;QACtD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACvE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,WAAW,CAAC;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC1B,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAAA,CAC7C;IAED,aAAa,CAAC,QAAgB,EAA8B;QAC3D,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;IAAA,CAC3D;CACD;AAED,MAAM,OAAO,uBAAuB;IAC3B,UAAU,CAAsB;IAExC,YAAY,UAAgC,EAAE;QAC7C,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,IAAI,mBAAmB,EAAE,CAAC;IAAA,CAC1D;IAED,CAAC,MAAM,CAAC,IAAgB,EAAE,iBAAoC,EAAyB;QACtF,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC;QAC/C,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,4BAA4B;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClE,MAAM,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAAA,CACxC;CACD;AAYD,MAAM,OAAO,qBAAqB;IACjC,QAAQ,CAAY;IACpB,MAAM,CAAoB;IAC1B,UAAU,CAAsB;IAChC,mBAAmB,CAAS;IAE5B,YAAY,OAKX,EAAE;QACF,IAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI;YACpC,IAAI,cAAc,EAAE;YACpB,IAAI,eAAe,EAAE;YACrB,IAAI,iBAAiB,EAAE;YACvB,IAAI,uBAAuB,EAAE;YAC7B,IAAI,uBAAuB,EAAE;SAC7B,CAAC;QACF,IAAI,CAAC,MAAM,GAAG,OAAO,EAAE,MAAM,IAAI,IAAI,uBAAuB,EAAE,CAAC;QAC/D,IAAI,CAAC,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,IAAI,mBAAmB,EAAE,CAAC;QACnE,IAAI,CAAC,mBAAmB,GAAG,OAAO,EAAE,mBAAmB,IAAI,EAAE,CAAC;IAAA,CAC9D;IAED,CAAC,iBAAiB,CAAC,IAAU,EAA6B;QACzD,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5C,IAAI,KAAK,IAAI,IAAI,CAAC,mBAAmB;oBAAE,OAAO;gBAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC;gBACtC,MAAM;oBACL,OAAO;oBACP,WAAW,EAAE,IAAI;oBACjB,QAAQ,EAAE,IAAI,CAAC,EAAE;iBACjB,CAAC;gBACF,KAAK,EAAE,CAAC;YACT,CAAC;QACF,CAAC;IAAA,CACD;IAED,OAAO,CAAC,IAAY,EAAE,KAAK,GAAG,CAAC,EAAE,QAA2B,EAAQ;QACnE,MAAM,IAAI,GAAS;YAClB,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC;YAClC,IAAI;YACJ,KAAK;YACL,QAAQ,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE;YACtE,KAAK,EAAE,CAAC;SACR,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IAAA,CACZ;CACD;AAED,oOAA8E;AAC9E,sBAAsB;AACtB,oOAA8E;AAE9E,MAAM,UAAU,2BAA2B,GAA0B;IACpE,OAAO,IAAI,qBAAqB,EAAE,CAAC;AAAA,CACnC","sourcesContent":["/**\n * OMK Jailbreak v6 — Fuzzing Module (TypeScript Port)\n * ====================================================\n * packages/coding-agent/src/fuzzing/mutation-engine.ts\n *\n * Coverage-Guided Mutation + Seed Corpus management for\n * jailbreak payload transformation.\n *\n * Zero API calls — pure local computation.\n */\n\nimport { randomBytes } from \"node:crypto\";\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Types\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface CoverageFeedback {\n\tnewEdges: number;\n\ttotalEdges: number;\n\tcoverageRatio: number;\n}\n\nexport interface Seed {\n\tid: string;\n\tdata: string;\n\tscore: number;\n\tcoverage: CoverageFeedback;\n\tdepth: number;\n\tparentId?: string;\n}\n\nexport interface SeedCorpusManager {\n\tseeds: Seed[];\n\tadd(seed: Seed): void;\n\tgetNext(): Seed | undefined;\n\tgetBest(): Seed | undefined;\n}\n\nexport class SimpleSeedCorpusManager implements SeedCorpusManager {\n\tseeds: Seed[] = [];\n\tprivate index = 0;\n\n\tadd(seed: Seed): void {\n\t\tthis.seeds.push(seed);\n\t\tthis.seeds.sort((a, b) => b.score - a.score);\n\t}\n\n\tgetNext(): Seed | undefined {\n\t\tif (this.seeds.length === 0) return undefined;\n\t\tconst seed = this.seeds[this.index % this.seeds.length];\n\t\tthis.index++;\n\t\treturn seed;\n\t}\n\n\tgetBest(): Seed | undefined {\n\t\treturn this.seeds[0];\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Bit-level Mutators (AFL++ style)\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface Mutator {\n\tmutate(data: Uint8Array, coverageFeedback?: CoverageFeedback): Generator<Uint8Array>;\n}\n\nexport class BitFlipMutator implements Mutator {\n\tprivate strategies = [\n\t\t{ name: \"bitflip_1\", step: 1, mode: \"single\" as const },\n\t\t{ name: \"bitflip_2\", step: 2, mode: \"adjacent\" as const },\n\t\t{ name: \"bitflip_4\", step: 4, mode: \"adjacent\" as const },\n\t\t{ name: \"arith_8\", step: 8, mode: \"arithmetic\" as const },\n\t\t{ name: \"arith_16\", step: 16, mode: \"arithmetic\" as const },\n\t\t{ name: \"arith_32\", step: 32, mode: \"arithmetic\" as const },\n\t];\n\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tfor (const strategy of this.strategies) {\n\t\t\tconst step = strategy.step;\n\t\t\tif (data.length * 8 < step) continue;\n\t\t\tfor (let i = 0; i <= data.length * 8 - step; i += step) {\n\t\t\t\tyield this.apply(data, i, strategy);\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate apply(data: Uint8Array, bitIdx: number, strategy: { step: number; mode: string }): Uint8Array {\n\t\tconst step = strategy.step;\n\t\tconst mode = strategy.mode;\n\t\tconst arr = new Uint8Array(data);\n\n\t\tif (mode === \"single\") {\n\t\t\tconst byteIdx = Math.floor(bitIdx / 8);\n\t\t\tconst bitInByte = bitIdx % 8;\n\t\t\tif (byteIdx < arr.length) {\n\t\t\t\tarr[byteIdx] ^= 1 << bitInByte;\n\t\t\t}\n\t\t} else if (mode === \"adjacent\") {\n\t\t\tfor (let b = 0; b < step; b++) {\n\t\t\t\tconst idx = bitIdx + b;\n\t\t\t\tconst byteIdx = Math.floor(idx / 8);\n\t\t\t\tconst bitInByte = idx % 8;\n\t\t\t\tif (byteIdx < arr.length) {\n\t\t\t\t\tarr[byteIdx] ^= 1 << bitInByte;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (mode === \"arithmetic\") {\n\t\t\tconst byteIdx = Math.floor(bitIdx / 8);\n\t\t\tif (step === 8 && byteIdx < arr.length) {\n\t\t\t\tarr[byteIdx] = (arr[byteIdx] + 1) & 0xff;\n\t\t\t} else if (step === 16 && byteIdx + 1 < arr.length) {\n\t\t\t\tlet val = (arr[byteIdx] << 8) | arr[byteIdx + 1];\n\t\t\t\tval = (val + 1) & 0xffff;\n\t\t\t\tarr[byteIdx] = (val >> 8) & 0xff;\n\t\t\t\tarr[byteIdx + 1] = val & 0xff;\n\t\t\t} else if (step === 32 && byteIdx + 3 < arr.length) {\n\t\t\t\tlet val = (arr[byteIdx] << 24) | (arr[byteIdx + 1] << 16) | (arr[byteIdx + 2] << 8) | arr[byteIdx + 3];\n\t\t\t\tval = (val + 1) & 0xffffffff;\n\t\t\t\tarr[byteIdx] = (val >>> 24) & 0xff;\n\t\t\t\tarr[byteIdx + 1] = (val >>> 16) & 0xff;\n\t\t\t\tarr[byteIdx + 2] = (val >>> 8) & 0xff;\n\t\t\t\tarr[byteIdx + 3] = val & 0xff;\n\t\t\t}\n\t\t}\n\t\treturn arr;\n\t}\n}\n\nexport class ByteFlipMutator implements Mutator {\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tconst arr = new Uint8Array(data);\n\t\tfor (let i = 0; i < arr.length; i++) {\n\t\t\tarr[i] ^= 0xff;\n\t\t\tyield new Uint8Array(arr);\n\t\t\tarr[i] ^= 0xff;\n\t\t}\n\t}\n}\n\nexport class ArithmeticMutator implements Mutator {\n\tprivate arithOps = [1, -1, 10, -10];\n\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tconst arr = new Uint8Array(data);\n\t\tfor (let i = 0; i < arr.length; i++) {\n\t\t\tfor (const op of this.arithOps) {\n\t\t\t\tconst original = arr[i];\n\t\t\t\tarr[i] = (arr[i] + op) & 0xff;\n\t\t\t\tyield new Uint8Array(arr);\n\t\t\t\tarr[i] = original;\n\t\t\t}\n\t\t}\n\t}\n}\n\nexport class InterestingValueMutator implements Mutator {\n\tprivate interesting8 = [0, 1, 16, 32, 64, 100, 127, 128, 255];\n\tprivate interesting16 = [0, 1, 255, 256, 512, 1000, 1024, 4096, 65535];\n\tprivate interesting32 = [0, 1, 65535, 65536, 1000000, 2147483647, 4294967295];\n\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tconst arr = new Uint8Array(data);\n\t\tfor (let i = 0; i < arr.length; i++) {\n\t\t\tfor (const v of this.interesting8) {\n\t\t\t\tarr[i] = v & 0xff;\n\t\t\t\tyield new Uint8Array(arr);\n\t\t\t}\n\t\t}\n\t\tfor (let i = 0; i + 1 < arr.length; i++) {\n\t\t\tfor (const v of this.interesting16) {\n\t\t\t\tarr[i] = (v >> 8) & 0xff;\n\t\t\t\tarr[i + 1] = v & 0xff;\n\t\t\t\tyield new Uint8Array(arr);\n\t\t\t}\n\t\t}\n\t\tfor (let i = 0; i + 3 < arr.length; i++) {\n\t\t\tfor (const v of this.interesting32) {\n\t\t\t\tarr[i] = (v >>> 24) & 0xff;\n\t\t\t\tarr[i + 1] = (v >>> 16) & 0xff;\n\t\t\t\tarr[i + 2] = (v >>> 8) & 0xff;\n\t\t\t\tarr[i + 3] = v & 0xff;\n\t\t\t\tyield new Uint8Array(arr);\n\t\t\t}\n\t\t}\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Dictionary-based Mutators\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface JailbreakDictionaryEntry {\n\tterm: string;\n\tweight: number;\n\tcategory: string;\n}\n\nexport class JailbreakDictionary {\n\tentries: JailbreakDictionaryEntry[] = [\n\t\t{ term: \"ignore previous instructions\", weight: 1.0, category: \"direct\" },\n\t\t{ term: \"DAN mode\", weight: 0.9, category: \"persona\" },\n\t\t{ term: \"developer mode\", weight: 0.85, category: \"persona\" },\n\t\t{ term: \"jailbreak\", weight: 0.8, category: \"meta\" },\n\t\t{ term: \"hypothetical\", weight: 0.7, category: \"framing\" },\n\t\t{ term: \"educational purpose\", weight: 0.6, category: \"framing\" },\n\t\t{ term: \"research context\", weight: 0.6, category: \"framing\" },\n\t\t{ term: \"translate to\", weight: 0.5, category: \"encoding\" },\n\t\t{ term: \"base64 decode\", weight: 0.5, category: \"encoding\" },\n\t\t{ term: \"hex decode\", weight: 0.5, category: \"encoding\" },\n\t];\n\n\tgetRandomEntry(): JailbreakDictionaryEntry | undefined {\n\t\tif (this.entries.length === 0) return undefined;\n\t\tconst totalWeight = this.entries.reduce((sum, e) => sum + e.weight, 0);\n\t\tlet r = Math.random() * totalWeight;\n\t\tfor (const entry of this.entries) {\n\t\t\tr -= entry.weight;\n\t\t\tif (r <= 0) return entry;\n\t\t}\n\t\treturn this.entries[this.entries.length - 1];\n\t}\n\n\tgetByCategory(category: string): JailbreakDictionaryEntry[] {\n\t\treturn this.entries.filter((e) => e.category === category);\n\t}\n}\n\nexport class DictionaryInsertMutator implements Mutator {\n\tprivate dictionary: JailbreakDictionary;\n\n\tconstructor(dictionary?: JailbreakDictionary) {\n\t\tthis.dictionary = dictionary || new JailbreakDictionary();\n\t}\n\n\t*mutate(data: Uint8Array, _coverageFeedback?: CoverageFeedback): Generator<Uint8Array> {\n\t\tconst text = new TextDecoder().decode(data);\n\t\tconst entry = this.dictionary.getRandomEntry();\n\t\tif (!entry) return;\n\n\t\t// Insert at random position\n\t\tconst pos = Math.floor(Math.random() * (text.length + 1));\n\t\tconst mutated = text.slice(0, pos) + entry.term + text.slice(pos);\n\t\tyield new TextEncoder().encode(mutated);\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Fuzzing Mutation Engine\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport interface MutationResult {\n\tmutated: Uint8Array;\n\tmutatorName: string;\n\tparentId: string;\n}\n\nexport class FuzzingMutationEngine {\n\tmutators: Mutator[];\n\tcorpus: SeedCorpusManager;\n\tdictionary: JailbreakDictionary;\n\tmaxMutationsPerSeed: number;\n\n\tconstructor(options?: {\n\t\tmutators?: Mutator[];\n\t\tcorpus?: SeedCorpusManager;\n\t\tdictionary?: JailbreakDictionary;\n\t\tmaxMutationsPerSeed?: number;\n\t}) {\n\t\tthis.mutators = options?.mutators || [\n\t\t\tnew BitFlipMutator(),\n\t\t\tnew ByteFlipMutator(),\n\t\t\tnew ArithmeticMutator(),\n\t\t\tnew InterestingValueMutator(),\n\t\t\tnew DictionaryInsertMutator(),\n\t\t];\n\t\tthis.corpus = options?.corpus || new SimpleSeedCorpusManager();\n\t\tthis.dictionary = options?.dictionary || new JailbreakDictionary();\n\t\tthis.maxMutationsPerSeed = options?.maxMutationsPerSeed || 50;\n\t}\n\n\t*generateMutations(seed: Seed): Generator<MutationResult> {\n\t\tconst data = new TextEncoder().encode(seed.data);\n\t\tlet count = 0;\n\t\tfor (const mutator of this.mutators) {\n\t\t\tfor (const mutated of mutator.mutate(data)) {\n\t\t\t\tif (count >= this.maxMutationsPerSeed) return;\n\t\t\t\tconst name = mutator.constructor.name;\n\t\t\t\tyield {\n\t\t\t\t\tmutated,\n\t\t\t\t\tmutatorName: name,\n\t\t\t\t\tparentId: seed.id,\n\t\t\t\t};\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t}\n\n\taddSeed(data: string, score = 0, coverage?: CoverageFeedback): Seed {\n\t\tconst seed: Seed = {\n\t\t\tid: randomBytes(8).toString(\"hex\"),\n\t\t\tdata,\n\t\t\tscore,\n\t\t\tcoverage: coverage || { newEdges: 0, totalEdges: 1, coverageRatio: 0 },\n\t\t\tdepth: 0,\n\t\t};\n\t\tthis.corpus.add(seed);\n\t\treturn seed;\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Convenience exports\n// ═══════════════════════════════════════════════════════════════════════════\n\nexport function createDefaultMutationEngine(): FuzzingMutationEngine {\n\treturn new FuzzingMutationEngine();\n}\n"]}

package/dist/guardrails/audit-logger.d.ts

@@ -0,0 +1,4 @@
+import type { GuardrailAuditEvent } from "../types/guardrails.ts";
+export declare function appendAuditEvent(auditPath: string, event: GuardrailAuditEvent): Promise<void>;
+export declare function readAuditEvents(auditPath: string): GuardrailAuditEvent[];
+//# sourceMappingURL=audit-logger.d.ts.map

package/dist/guardrails/audit-logger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"audit-logger.d.ts","sourceRoot":"","sources":["../../src/guardrails/audit-logger.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAElE,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,mBAAmB,GAAG,OAAO,CAAC,IAAI,CAAC,CAc7F;AAED,wBAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,mBAAmB,EAAE,CAOxE","sourcesContent":["import { appendFileSync, existsSync, mkdirSync, readFileSync } from \"node:fs\";\nimport { dirname } from \"node:path\";\nimport type { GuardrailAuditEvent } from \"../types/guardrails.ts\";\n\nexport function appendAuditEvent(auditPath: string, event: GuardrailAuditEvent): Promise<void> {\n\treturn new Promise((resolve, reject) => {\n\t\ttry {\n\t\t\tconst dir = dirname(auditPath);\n\t\t\tif (!existsSync(dir)) {\n\t\t\t\tmkdirSync(dir, { recursive: true });\n\t\t\t}\n\t\t\tconst line = `${JSON.stringify(event)}\\n`;\n\t\t\tappendFileSync(auditPath, line, \"utf-8\");\n\t\t\tresolve();\n\t\t} catch (err) {\n\t\t\treject(err);\n\t\t}\n\t});\n}\n\nexport function readAuditEvents(auditPath: string): GuardrailAuditEvent[] {\n\tif (!existsSync(auditPath)) return [];\n\tconst content = readFileSync(auditPath, \"utf-8\");\n\treturn content\n\t\t.split(\"\\n\")\n\t\t.filter((line) => line.trim().length > 0)\n\t\t.map((line) => JSON.parse(line) as GuardrailAuditEvent);\n}\n"]}

package/dist/guardrails/audit-logger.js

@@ -0,0 +1,28 @@
+import { appendFileSync, existsSync, mkdirSync, readFileSync } from "node:fs";
+import { dirname } from "node:path";
+export function appendAuditEvent(auditPath, event) {
+    return new Promise((resolve, reject) => {
+        try {
+            const dir = dirname(auditPath);
+            if (!existsSync(dir)) {
+                mkdirSync(dir, { recursive: true });
+            }
+            const line = `${JSON.stringify(event)}\n`;
+            appendFileSync(auditPath, line, "utf-8");
+            resolve();
+        }
+        catch (err) {
+            reject(err);
+        }
+    });
+}
+export function readAuditEvents(auditPath) {
+    if (!existsSync(auditPath))
+        return [];
+    const content = readFileSync(auditPath, "utf-8");
+    return content
+        .split("\n")
+        .filter((line) => line.trim().length > 0)
+        .map((line) => JSON.parse(line));
+}
+//# sourceMappingURL=audit-logger.js.map

package/dist/guardrails/audit-logger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"audit-logger.js","sourceRoot":"","sources":["../../src/guardrails/audit-logger.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAC9E,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAGpC,MAAM,UAAU,gBAAgB,CAAC,SAAiB,EAAE,KAA0B,EAAiB;IAC9F,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;QACvC,IAAI,CAAC;YACJ,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;YAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;YAC1C,cAAc,CAAC,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YACzC,OAAO,EAAE,CAAC;QACX,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,CAAC;QACb,CAAC;IAAA,CACD,CAAC,CAAC;AAAA,CACH;AAED,MAAM,UAAU,eAAe,CAAC,SAAiB,EAAyB;IACzE,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,EAAE,CAAC;IACtC,MAAM,OAAO,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACjD,OAAO,OAAO;SACZ,KAAK,CAAC,IAAI,CAAC;SACX,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;SACxC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAwB,CAAC,CAAC;AAAA,CACzD","sourcesContent":["import { appendFileSync, existsSync, mkdirSync, readFileSync } from \"node:fs\";\nimport { dirname } from \"node:path\";\nimport type { GuardrailAuditEvent } from \"../types/guardrails.ts\";\n\nexport function appendAuditEvent(auditPath: string, event: GuardrailAuditEvent): Promise<void> {\n\treturn new Promise((resolve, reject) => {\n\t\ttry {\n\t\t\tconst dir = dirname(auditPath);\n\t\t\tif (!existsSync(dir)) {\n\t\t\t\tmkdirSync(dir, { recursive: true });\n\t\t\t}\n\t\t\tconst line = `${JSON.stringify(event)}\\n`;\n\t\t\tappendFileSync(auditPath, line, \"utf-8\");\n\t\t\tresolve();\n\t\t} catch (err) {\n\t\t\treject(err);\n\t\t}\n\t});\n}\n\nexport function readAuditEvents(auditPath: string): GuardrailAuditEvent[] {\n\tif (!existsSync(auditPath)) return [];\n\tconst content = readFileSync(auditPath, \"utf-8\");\n\treturn content\n\t\t.split(\"\\n\")\n\t\t.filter((line) => line.trim().length > 0)\n\t\t.map((line) => JSON.parse(line) as GuardrailAuditEvent);\n}\n"]}

package/dist/guardrails/evidence-system.d.ts

@@ -0,0 +1,61 @@
+import type { EvidenceItem, EvidenceStatus, MergeGateResult, ReplayEvent, ReplayLedger, TaskContract } from "../types/evidence.ts";
+export declare class TaskContractBuilder {
+    private goalId;
+    private completionClaim;
+    private requiredEvidence;
+    private finalRisk;
+    private verdict;
+    private createdAt;
+    private updatedAt;
+    constructor(goalId: string);
+    setClaim(claim: string): this;
+    addRequiredEvidence(evidence: Omit<EvidenceItem, "timestamp" | "status">): this;
+    setFinalRisk(risk: string): this;
+    setVerdict(verdict: "pass" | "fail" | "conditional"): this;
+    updateEvidenceStatus(claim: string, status: EvidenceStatus, gapReason?: string): this;
+    private touch;
+    build(): TaskContract;
+    static fromJSON(json: string): TaskContract;
+    static toJSON(contract: TaskContract): string;
+}
+export declare class ReplayLedgerManager {
+    private ledger;
+    private nextSeq;
+    constructor(goalId: string, ledgerPath: string);
+    append(event: Omit<ReplayEvent, "seq" | "timestamp" | "payloadHash">): ReplayEvent;
+    persist(): void;
+    load(): void;
+    getEvents(): ReadonlyArray<ReplayEvent>;
+    getLedger(): Readonly<ReplayLedger>;
+    replay<T>(handler: (event: ReplayEvent) => T | undefined): T[];
+    exportToFile(path: string): void;
+}
+export interface EvidenceGateOptions {
+    /** Minimum number of satisfied evidence items required. */
+    minEvidenceCount?: number;
+    /** Require at least one artifact with a SHA-256 hash. */
+    requireHash?: boolean;
+    /** Require at least one verification command. */
+    requireVerificationCommand?: boolean;
+}
+export declare class EvidenceGate {
+    private options;
+    constructor(options?: EvidenceGateOptions);
+    check(contract: TaskContract): MergeGateResult;
+}
+export declare class FailClosedMergeGate {
+    private gates;
+    constructor(gates?: EvidenceGate[]);
+    check(contract: TaskContract): MergeGateResult;
+}
+export interface VerifyReporterV2Options {
+    outputDir: string;
+    goalId: string;
+}
+export declare class VerifyReporterV2 {
+    private options;
+    constructor(options: VerifyReporterV2Options);
+    render(contract: TaskContract, mergeGate: MergeGateResult): string;
+    write(contract: TaskContract, mergeGate: MergeGateResult): string;
+}
+//# sourceMappingURL=evidence-system.d.ts.map

package/dist/guardrails/evidence-system.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evidence-system.d.ts","sourceRoot":"","sources":["../../src/guardrails/evidence-system.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EACX,YAAY,EACZ,cAAc,EACd,eAAe,EAEf,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,MAAM,sBAAsB,CAAC;AAiB9B,qBAAa,mBAAmB;IAC/B,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,eAAe,CAAc;IACrC,OAAO,CAAC,gBAAgB,CAAsB;IAC9C,OAAO,CAAC,SAAS,CAAc;IAC/B,OAAO,CAAC,OAAO,CAA2C;IAC1D,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAS;IAE1B,YAAY,MAAM,EAAE,MAAM,EAKzB;IAED,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAI5B;IAED,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,EAAE,WAAW,GAAG,QAAQ,CAAC,GAAG,IAAI,CAQ9E;IAED,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAI/B;IAED,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,aAAa,GAAG,IAAI,CAIzD;IAED,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CASpF;IAED,OAAO,CAAC,KAAK;IAIb,KAAK,IAAI,YAAY,CAUpB;IAED,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,CAE1C;IAED,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,YAAY,GAAG,MAAM,CAE5C;CACD;AAMD,qBAAa,mBAAmB;IAC/B,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,OAAO,CAAS;IAExB,YAAY,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAY7C;IAED,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,GAAG,WAAW,GAAG,aAAa,CAAC,GAAG,WAAW,CAUjF;IAED,OAAO,IAAI,IAAI,CASd;IAED,IAAI,IAAI,IAAI,CAUX;IAED,SAAS,IAAI,aAAa,CAAC,WAAW,CAAC,CAEtC;IAED,SAAS,IAAI,QAAQ,CAAC,YAAY,CAAC,CAElC;IAED,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAS7D;IAED,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAG/B;CACD;AAMD,MAAM,WAAW,mBAAmB;IACnC,2DAA2D;IAC3D,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,yDAAyD;IACzD,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,iDAAiD;IACjD,0BAA0B,CAAC,EAAE,OAAO,CAAC;CACrC;AAED,qBAAa,YAAY;IACxB,OAAO,CAAC,OAAO,CAAsB;IAErC,YAAY,OAAO,GAAE,mBAAwB,EAO5C;IAED,KAAK,CAAC,QAAQ,EAAE,YAAY,GAAG,eAAe,CA6D7C;CACD;AAMD,qBAAa,mBAAmB;IAC/B,OAAO,CAAC,KAAK,CAAiB;IAE9B,YAAY,KAAK,GAAE,YAAY,EAAyB,EAEvD;IAED,KAAK,CAAC,QAAQ,EAAE,YAAY,GAAG,eAAe,CA+B7C;CACD;AAMD,MAAM,WAAW,uBAAuB;IACvC,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CACf;AAED,qBAAa,gBAAgB;IAC5B,OAAO,CAAC,OAAO,CAA0B;IAEzC,YAAY,OAAO,EAAE,uBAAuB,EAE3C;IAED,MAAM,CAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,EAAE,eAAe,GAAG,MAAM,CAqCjE;IAED,KAAK,CAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,EAAE,eAAe,GAAG,MAAM,CAMhE;CACD","sourcesContent":["// allow: SIZE_OK - legacy evidence ledger; this change only keeps typed import/check compatibility.\nimport { createHash } from \"node:crypto\";\nimport { appendFileSync, existsSync, mkdirSync, readFileSync, writeFileSync } from \"node:fs\";\nimport { dirname, join } from \"node:path\";\nimport type {\n\tEvidenceItem,\n\tEvidenceStatus,\n\tMergeGateResult,\n\tMergeGateStatus,\n\tReplayEvent,\n\tReplayLedger,\n\tTaskContract,\n} from \"../types/evidence.ts\";\n\nfunction sha256(input: string): string {\n\treturn createHash(\"sha256\").update(input).digest(\"hex\");\n}\n\nfunction ensureDir(path: string): void {\n\tconst dir = dirname(path);\n\tif (!existsSync(dir)) {\n\t\tmkdirSync(dir, { recursive: true });\n\t}\n}\n\n// ============================================================================\n// TaskContract\n// ============================================================================\n\nexport class TaskContractBuilder {\n\tprivate goalId: string;\n\tprivate completionClaim: string = \"\";\n\tprivate requiredEvidence: EvidenceItem[] = [];\n\tprivate finalRisk: string = \"\";\n\tprivate verdict: \"pass\" | \"fail\" | \"conditional\" = \"fail\";\n\tprivate createdAt: string;\n\tprivate updatedAt: string;\n\n\tconstructor(goalId: string) {\n\t\tthis.goalId = goalId;\n\t\tconst now = new Date().toISOString();\n\t\tthis.createdAt = now;\n\t\tthis.updatedAt = now;\n\t}\n\n\tsetClaim(claim: string): this {\n\t\tthis.completionClaim = claim;\n\t\tthis.touch();\n\t\treturn this;\n\t}\n\n\taddRequiredEvidence(evidence: Omit<EvidenceItem, \"timestamp\" | \"status\">): this {\n\t\tthis.requiredEvidence.push({\n\t\t\t...evidence,\n\t\t\ttimestamp: new Date().toISOString(),\n\t\t\tstatus: \"pending\",\n\t\t});\n\t\tthis.touch();\n\t\treturn this;\n\t}\n\n\tsetFinalRisk(risk: string): this {\n\t\tthis.finalRisk = risk;\n\t\tthis.touch();\n\t\treturn this;\n\t}\n\n\tsetVerdict(verdict: \"pass\" | \"fail\" | \"conditional\"): this {\n\t\tthis.verdict = verdict;\n\t\tthis.touch();\n\t\treturn this;\n\t}\n\n\tupdateEvidenceStatus(claim: string, status: EvidenceStatus, gapReason?: string): this {\n\t\tconst item = this.requiredEvidence.find((e) => e.claim === claim);\n\t\tif (item) {\n\t\t\titem.status = status;\n\t\t\titem.gapReason = gapReason;\n\t\t\titem.timestamp = new Date().toISOString();\n\t\t\tthis.touch();\n\t\t}\n\t\treturn this;\n\t}\n\n\tprivate touch(): void {\n\t\tthis.updatedAt = new Date().toISOString();\n\t}\n\n\tbuild(): TaskContract {\n\t\treturn {\n\t\t\tgoalId: this.goalId,\n\t\t\tcompletionClaim: this.completionClaim,\n\t\t\trequiredEvidence: [...this.requiredEvidence],\n\t\t\tfinalRisk: this.finalRisk,\n\t\t\tverdict: this.verdict,\n\t\t\tcreatedAt: this.createdAt,\n\t\t\tupdatedAt: this.updatedAt,\n\t\t};\n\t}\n\n\tstatic fromJSON(json: string): TaskContract {\n\t\treturn JSON.parse(json) as TaskContract;\n\t}\n\n\tstatic toJSON(contract: TaskContract): string {\n\t\treturn JSON.stringify(contract, null, 2);\n\t}\n}\n\n// ============================================================================\n// ReplayLedger\n// ============================================================================\n\nexport class ReplayLedgerManager {\n\tprivate ledger: ReplayLedger;\n\tprivate nextSeq: number;\n\n\tconstructor(goalId: string, ledgerPath: string) {\n\t\tensureDir(ledgerPath);\n\t\tthis.ledger = {\n\t\t\tgoalId,\n\t\t\tevents: [],\n\t\t\tledgerPath,\n\t\t\tlastPersistedSeq: 0,\n\t\t};\n\t\tthis.nextSeq = 1;\n\t\tif (existsSync(ledgerPath)) {\n\t\t\tthis.load();\n\t\t}\n\t}\n\n\tappend(event: Omit<ReplayEvent, \"seq\" | \"timestamp\" | \"payloadHash\">): ReplayEvent {\n\t\tconst payloadStr = JSON.stringify(event.payload);\n\t\tconst fullEvent: ReplayEvent = {\n\t\t\t...event,\n\t\t\tseq: this.nextSeq++,\n\t\t\ttimestamp: new Date().toISOString(),\n\t\t\tpayloadHash: sha256(payloadStr),\n\t\t};\n\t\tthis.ledger.events.push(fullEvent);\n\t\treturn fullEvent;\n\t}\n\n\tpersist(): void {\n\t\tif (this.ledger.events.length === 0) return;\n\t\tconst last = this.ledger.events[this.ledger.events.length - 1];\n\t\tif (last.seq <= this.ledger.lastPersistedSeq) return;\n\n\t\tconst newEvents = this.ledger.events.filter((e) => e.seq > this.ledger.lastPersistedSeq);\n\t\tconst lines = `${newEvents.map((e) => JSON.stringify(e)).join(\"\\n\")}\\n`;\n\t\tappendFileSync(this.ledger.ledgerPath, lines, \"utf-8\");\n\t\tthis.ledger.lastPersistedSeq = last.seq;\n\t}\n\n\tload(): void {\n\t\tif (!existsSync(this.ledger.ledgerPath)) return;\n\t\tconst content = readFileSync(this.ledger.ledgerPath, \"utf-8\");\n\t\tconst events = content\n\t\t\t.split(\"\\n\")\n\t\t\t.filter((line) => line.trim().length > 0)\n\t\t\t.map((line) => JSON.parse(line) as ReplayEvent);\n\t\tthis.ledger.events = events;\n\t\tthis.ledger.lastPersistedSeq = events.length > 0 ? events[events.length - 1].seq : 0;\n\t\tthis.nextSeq = this.ledger.lastPersistedSeq + 1;\n\t}\n\n\tgetEvents(): ReadonlyArray<ReplayEvent> {\n\t\treturn this.ledger.events;\n\t}\n\n\tgetLedger(): Readonly<ReplayLedger> {\n\t\treturn { ...this.ledger };\n\t}\n\n\treplay<T>(handler: (event: ReplayEvent) => T | undefined): T[] {\n\t\tconst results: T[] = [];\n\t\tfor (const event of this.ledger.events) {\n\t\t\tconst result = handler(event);\n\t\t\tif (result !== undefined) {\n\t\t\t\tresults.push(result);\n\t\t\t}\n\t\t}\n\t\treturn results;\n\t}\n\n\texportToFile(path: string): void {\n\t\tensureDir(path);\n\t\twriteFileSync(path, JSON.stringify(this.ledger.events, null, 2), \"utf-8\");\n\t}\n}\n\n// ============================================================================\n// EvidenceGate\n// ============================================================================\n\nexport interface EvidenceGateOptions {\n\t/** Minimum number of satisfied evidence items required. */\n\tminEvidenceCount?: number;\n\t/** Require at least one artifact with a SHA-256 hash. */\n\trequireHash?: boolean;\n\t/** Require at least one verification command. */\n\trequireVerificationCommand?: boolean;\n}\n\nexport class EvidenceGate {\n\tprivate options: EvidenceGateOptions;\n\n\tconstructor(options: EvidenceGateOptions = {}) {\n\t\tthis.options = {\n\t\t\tminEvidenceCount: 1,\n\t\t\trequireHash: true,\n\t\t\trequireVerificationCommand: true,\n\t\t\t...options,\n\t\t};\n\t}\n\n\tcheck(contract: TaskContract): MergeGateResult {\n\t\tconst evidence = contract.requiredEvidence;\n\t\tconst satisfied = evidence.filter((e) => e.status === \"satisfied\");\n\t\tconst failed = evidence.filter((e) => e.status === \"failed\");\n\t\tconst pending = evidence.filter((e) => e.status === \"pending\" || e.status === \"gathering\");\n\n\t\tconst checks: string[] = [];\n\n\t\t// Check 1: minimum evidence count\n\t\tif (satisfied.length < (this.options.minEvidenceCount ?? 1)) {\n\t\t\tchecks.push(`Only ${satisfied.length}/${this.options.minEvidenceCount} required evidence items satisfied.`);\n\t\t}\n\n\t\t// Check 2: no failed evidence\n\t\tif (failed.length > 0) {\n\t\t\tchecks.push(`${failed.length} evidence item(s) failed.`);\n\t\t}\n\n\t\t// Check 3: require hash\n\t\tif (this.options.requireHash) {\n\t\t\tconst hashed = satisfied.filter((e) => e.hash && e.hash.length > 0);\n\t\t\tif (hashed.length === 0) {\n\t\t\t\tchecks.push(\"No satisfied evidence has a SHA-256 hash.\");\n\t\t\t}\n\t\t}\n\n\t\t// Check 4: require verification command\n\t\tif (this.options.requireVerificationCommand) {\n\t\t\tconst withCommand = satisfied.filter((e) => e.verificationCommand && e.verificationCommand.length > 0);\n\t\t\tif (withCommand.length === 0) {\n\t\t\t\tchecks.push(\"No satisfied evidence has a verification command.\");\n\t\t\t}\n\t\t}\n\n\t\t// Check 5: contract verdict\n\t\tif (contract.verdict === \"fail\") {\n\t\t\tchecks.push(\"Task contract verdict is 'fail'.\");\n\t\t}\n\n\t\tlet status: MergeGateStatus;\n\t\tlet reason: string;\n\t\tlet suggestion: string | undefined;\n\n\t\tif (checks.length === 0) {\n\t\t\tstatus = \"open\";\n\t\t\treason = `Evidence gate passed: ${satisfied.length}/${evidence.length} evidence items satisfied.`;\n\t\t} else {\n\t\t\t// If there are pending items and no hard failures, it's conditional; otherwise blocked\n\t\t\tconst hasHardFailure = failed.length > 0 || contract.verdict === \"fail\";\n\t\t\tstatus = pending.length > 0 && !hasHardFailure ? \"conditional\" : \"blocked\";\n\t\t\treason = checks.join(\"; \");\n\t\t\tsuggestion = `Gather remaining evidence (${pending.length} pending) and re-run verification.`;\n\t\t}\n\n\t\treturn {\n\t\t\tgateId: \"evidence-gate\",\n\t\t\tstatus,\n\t\t\treason,\n\t\t\tsuggestion,\n\t\t\tevidenceChecked: evidence,\n\t\t};\n\t}\n}\n\n// ============================================================================\n// FailClosedMergeGate\n// ============================================================================\n\nexport class FailClosedMergeGate {\n\tprivate gates: EvidenceGate[];\n\n\tconstructor(gates: EvidenceGate[] = [new EvidenceGate()]) {\n\t\tthis.gates = gates;\n\t}\n\n\tcheck(contract: TaskContract): MergeGateResult {\n\t\tconst results = this.gates.map((gate) => gate.check(contract));\n\t\tconst blocked = results.filter((r) => r.status === \"blocked\");\n\t\tconst conditional = results.filter((r) => r.status === \"conditional\");\n\n\t\tif (blocked.length > 0) {\n\t\t\treturn {\n\t\t\t\tgateId: \"fail-closed-merge-gate\",\n\t\t\t\tstatus: \"blocked\",\n\t\t\t\treason: `Blocked by ${blocked.length} gate(s): ${blocked.map((b) => b.reason).join(\"; \")}`,\n\t\t\t\tsuggestion: \"Resolve all blocking conditions before merge.\",\n\t\t\t\tevidenceChecked: contract.requiredEvidence,\n\t\t\t};\n\t\t}\n\n\t\tif (conditional.length > 0) {\n\t\t\treturn {\n\t\t\t\tgateId: \"fail-closed-merge-gate\",\n\t\t\t\tstatus: \"conditional\",\n\t\t\t\treason: `Conditional pass: ${conditional.length} gate(s) have pending conditions.`,\n\t\t\t\tsuggestion: \"Complete pending evidence or waive with explicit approval.\",\n\t\t\t\tevidenceChecked: contract.requiredEvidence,\n\t\t\t};\n\t\t}\n\n\t\treturn {\n\t\t\tgateId: \"fail-closed-merge-gate\",\n\t\t\tstatus: \"open\",\n\t\t\treason: \"All merge gates passed. Evidence verified and contract verdict is acceptable.\",\n\t\t\tevidenceChecked: contract.requiredEvidence,\n\t\t};\n\t}\n}\n\n// ============================================================================\n// Verify Reporter v2\n// ============================================================================\n\nexport interface VerifyReporterV2Options {\n\toutputDir: string;\n\tgoalId: string;\n}\n\nexport class VerifyReporterV2 {\n\tprivate options: VerifyReporterV2Options;\n\n\tconstructor(options: VerifyReporterV2Options) {\n\t\tthis.options = options;\n\t}\n\n\trender(contract: TaskContract, mergeGate: MergeGateResult): string {\n\t\tconst lines: string[] = [\n\t\t\t`## OMK Verification Report v2 — ${contract.goalId}`,\n\t\t\t\"\",\n\t\t\t\"### Contract\",\n\t\t\t\"\",\n\t\t\t`| Field | Value |`,\n\t\t\t`|-------|-------|`,\n\t\t\t`| Claim | ${contract.completionClaim} |`,\n\t\t\t`| Verdict | ${contract.verdict} |`,\n\t\t\t`| Final Risk | ${contract.finalRisk} |`,\n\t\t\t\"\",\n\t\t\t\"### Evidence\",\n\t\t\t\"\",\n\t\t\t`| Claim | Status | Artifact | Command |`,\n\t\t\t`|-------|--------|----------|----------|`,\n\t\t];\n\n\t\tfor (const ev of contract.requiredEvidence) {\n\t\t\tlines.push(`| ${ev.claim} | ${ev.status} | ${ev.artifactPath ?? \"—\"} | ${ev.verificationCommand ?? \"—\"} |`);\n\t\t}\n\n\t\tlines.push(\n\t\t\t\"\",\n\t\t\t\"### Merge Gate\",\n\t\t\t\"\",\n\t\t\t`| Gate | Status | Reason |`,\n\t\t\t`|------|--------|--------|`,\n\t\t\t`| ${mergeGate.gateId} | ${mergeGate.status} | ${mergeGate.reason} |`,\n\t\t\t\"\",\n\t\t);\n\n\t\tif (mergeGate.suggestion) {\n\t\t\tlines.push(`**Suggestion:** ${mergeGate.suggestion}`, \"\");\n\t\t}\n\n\t\treturn lines.join(\"\\n\");\n\t}\n\n\twrite(contract: TaskContract, mergeGate: MergeGateResult): string {\n\t\tconst markdown = this.render(contract, mergeGate);\n\t\tconst path = join(this.options.outputDir, `${this.options.goalId}.verify.md`);\n\t\tensureDir(path);\n\t\twriteFileSync(path, markdown, \"utf-8\");\n\t\treturn path;\n\t}\n}\n"]}