@pellux/goodvibes-sdk 0.18.28 → 0.18.30

package/dist/_internal/platform/pairing/qr-generator.js

@@ -0,0 +1,452 @@
+import { execSync } from 'node:child_process';
+/**
+ * Attempt to generate a QR matrix by shelling out to `qrencode`.
+ * Returns null if qrencode is not available or fails.
+ */
+function tryQrencode(data) {
+    try {
+        // -t ASC outputs a 2-character-per-module ASCII representation:
+        // '##' = dark module, '  ' = light module, with a surrounding quiet zone
+        // We use -t UTF8i (inverted) if available, or fall back to -t ASC.
+        // qrencode -t ASC outputs lines like: '######  ##  ######'
+        // where each character is one module.
+        // We request -m 0 (no margin) and -s 1 for raw matrix output.
+        const output = execSync(`qrencode -m 0 -t ASC ${JSON.stringify(data)}`, { encoding: 'utf8', stdio: ['ignore', 'pipe', 'ignore'], timeout: 5000 });
+        const rawLines = output.split('\n').filter((l) => l.length > 0);
+        if (rawLines.length === 0)
+            return null;
+        // qrencode ASC mode: each module is 2 characters wide ('##' dark, '  ' light)
+        const modules = rawLines.map((line) => {
+            const row = [];
+            for (let i = 0; i < line.length; i += 2) {
+                const pair = line.slice(i, i + 2);
+                row.push(pair === '##');
+            }
+            return row;
+        });
+        const size = modules[0]?.length ?? 0;
+        // Normalize all rows to the same size
+        const normalized = modules.map((row) => {
+            while (row.length < size)
+                row.push(false);
+            return row.slice(0, size);
+        });
+        return { size, modules: normalized };
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Minimal fallback QR matrix generator using a tiny Reed-Solomon QR implementation.
+ * Supports QR versions 1-9 (up to ~134 bytes, ECC level M).
+ *
+ * This is a self-contained implementation suitable for short connection strings.
+ */
+function generateQrMatrixMinimal(data) {
+    const bytes = new TextEncoder().encode(data);
+    const len = bytes.length;
+    // Version selection table: [version, dataCapacityBytes at ECC-M]
+    // Source: QR code spec Table 9
+    const versionTable = [
+        [1, 16], [2, 28], [3, 44], [4, 64], [5, 86],
+        [6, 108], [7, 124], [8, 154], [9, 182], [10, 216],
+    ];
+    let version = 0;
+    for (const [v, cap] of versionTable) {
+        if (len <= cap) {
+            version = v;
+            break;
+        }
+    }
+    if (version === 0) {
+        throw new Error(`Data too long for minimal QR generator (${len} bytes, max 216)`);
+    }
+    // Total codewords and ECC codewords per block (ECC level M)
+    // [version]: [totalCodewords, eccCodewords, blocks]
+    const eccTable = {
+        1: [26, 10, 1], 2: [44, 16, 1], 3: [70, 26, 2],
+        4: [100, 36, 2], 5: [134, 48, 2], 6: [172, 64, 4],
+        7: [196, 72, 4], 8: [242, 88, 4], 9: [292, 110, 5],
+        10: [346, 130, 5],
+    };
+    const [totalCodewords, eccPerBlock, numBlocks] = eccTable[version];
+    const dataCodewords = totalCodewords - (eccPerBlock * numBlocks);
+    // Build data bit stream: mode (byte=0100), char count, data, terminator, padding
+    const bits = [];
+    function pushBits(value, count) {
+        for (let i = count - 1; i >= 0; i--) {
+            bits.push((value >> i) & 1);
+        }
+    }
+    // Mode indicator: byte mode = 0100
+    pushBits(0b0100, 4);
+    // Character count indicator (version 1-9: 8 bits for byte mode)
+    pushBits(len, 8);
+    // Data bytes
+    for (const b of bytes)
+        pushBits(b, 8);
+    // Terminator (up to 4 zero bits)
+    const maxBits = dataCodewords * 8;
+    for (let i = 0; i < 4 && bits.length < maxBits; i++)
+        bits.push(0);
+    // Pad to byte boundary
+    while (bits.length % 8 !== 0)
+        bits.push(0);
+    // Pad codewords
+    const padBytes = [0xEC, 0x11];
+    let padIdx = 0;
+    while (bits.length < maxBits) {
+        pushBits(padBytes[padIdx % 2], 8);
+        padIdx++;
+    }
+    // Convert bits to bytes
+    const dataBytes = [];
+    for (let i = 0; i < bits.length; i += 8) {
+        let b = 0;
+        for (let j = 0; j < 8; j++)
+            b = (b << 1) | (bits[i + j] ?? 0);
+        dataBytes.push(b);
+    }
+    // Split into blocks and compute ECC
+    const dataPerBlock = Math.floor(dataCodewords / numBlocks);
+    const extraBlocks = dataCodewords - dataPerBlock * numBlocks;
+    const blocks = [];
+    let offset = 0;
+    for (let b = 0; b < numBlocks; b++) {
+        const blockLen = dataPerBlock + (b < extraBlocks ? 1 : 0);
+        blocks.push(dataBytes.slice(offset, offset + blockLen));
+        offset += blockLen;
+    }
+    // Reed-Solomon ECC generation
+    function gfMul(a, b) {
+        if (a === 0 || b === 0)
+            return 0;
+        const logTable = buildLogTable();
+        const expTable = buildExpTable();
+        return expTable[(logTable[a] + logTable[b]) % 255];
+    }
+    // Lazily built lookup tables (closured)
+    let _expTable = null;
+    let _logTable = null;
+    function buildExpTable() {
+        if (_expTable)
+            return _expTable;
+        _expTable = new Array(256);
+        let x = 1;
+        for (let i = 0; i < 255; i++) {
+            _expTable[i] = x;
+            x = (x << 1) ^ (x >= 128 ? 0x11d : 0);
+        }
+        _expTable[255] = _expTable[0];
+        return _expTable;
+    }
+    function buildLogTable() {
+        if (_logTable)
+            return _logTable;
+        const exp = buildExpTable();
+        _logTable = new Array(256).fill(0);
+        for (let i = 0; i < 255; i++)
+            _logTable[exp[i]] = i;
+        return _logTable;
+    }
+    function rsEcc(data, eccCount) {
+        // Generator polynomial for eccCount error correction codewords
+        const expTable = buildExpTable();
+        const logTable = buildLogTable();
+        // Build generator polynomial
+        let gen = [1];
+        for (let i = 0; i < eccCount; i++) {
+            const factor = [1, expTable[i]];
+            const newGen = new Array(gen.length + factor.length - 1).fill(0);
+            for (let j = 0; j < gen.length; j++) {
+                for (let k = 0; k < factor.length; k++) {
+                    newGen[j + k] ^= gfMul(gen[j], factor[k]);
+                }
+            }
+            gen = newGen;
+        }
+        // Polynomial long division
+        const msg = [...data, ...new Array(eccCount).fill(0)];
+        for (let i = 0; i < data.length; i++) {
+            const coef = msg[i];
+            if (coef !== 0) {
+                const log = logTable[coef];
+                for (let j = 0; j < gen.length; j++) {
+                    msg[i + j] ^= gfMul(gen[j], expTable[(log + logTable[gen[j]]) % 255] / gen[j] | 0);
+                    // Correct formula using logs:
+                    if (gen[j] !== 0) {
+                        msg[i + j] ^= expTable[(log + logTable[gen[j]]) % 255];
+                        // undo the wrong xor above
+                        msg[i + j] ^= gfMul(gen[j], expTable[(log + logTable[gen[j]]) % 255] / gen[j] | 0);
+                    }
+                }
+            }
+        }
+        return msg.slice(data.length);
+    }
+    // Simpler, correct RS ECC implementation:
+    function rsEccCorrect(data, eccCount) {
+        const expTable = buildExpTable();
+        const logTable = buildLogTable();
+        let gen = [1];
+        for (let i = 0; i < eccCount; i++) {
+            const factor = [1, expTable[i]];
+            const newGen = new Array(gen.length + factor.length - 1).fill(0);
+            for (let j = 0; j < gen.length; j++) {
+                for (let k = 0; k < factor.length; k++) {
+                    newGen[j + k] ^= gfMul(gen[j], factor[k]);
+                }
+            }
+            gen = newGen;
+        }
+        const msg = [...data, ...new Array(eccCount).fill(0)];
+        for (let i = 0; i < data.length; i++) {
+            const coef = msg[i];
+            if (coef !== 0) {
+                const logCoef = logTable[coef];
+                for (let j = 1; j < gen.length; j++) {
+                    if (gen[j] !== 0) {
+                        msg[i + j] ^= expTable[(logCoef + logTable[gen[j]]) % 255];
+                    }
+                }
+            }
+        }
+        return msg.slice(data.length);
+    }
+    // Interleave blocks and compute ECC
+    const eccBlocks = blocks.map((b) => rsEccCorrect(b, eccPerBlock));
+    const finalBytes = [];
+    // Interleave data blocks
+    const maxDataLen = Math.max(...blocks.map((b) => b.length));
+    for (let i = 0; i < maxDataLen; i++) {
+        for (const block of blocks) {
+            if (i < block.length)
+                finalBytes.push(block[i]);
+        }
+    }
+    // Interleave ECC blocks
+    for (let i = 0; i < eccPerBlock; i++) {
+        for (const ecc of eccBlocks) {
+            finalBytes.push(ecc[i]);
+        }
+    }
+    // Build the QR matrix
+    const size = 21 + (version - 1) * 4;
+    const matrix = Array.from({ length: size }, () => new Array(size).fill(null));
+    function setModule(row, col, dark) {
+        if (row >= 0 && row < size && col >= 0 && col < size) {
+            matrix[row][col] = dark;
+        }
+    }
+    // Place finder pattern
+    function placeFinderPattern(r, c) {
+        for (let dy = -1; dy <= 7; dy++) {
+            for (let dx = -1; dx <= 7; dx++) {
+                const inOuter = dy >= 0 && dy <= 6 && dx >= 0 && dx <= 6;
+                const inWhite = dy >= 1 && dy <= 5 && dx >= 1 && dx <= 5;
+                const inInner = dy >= 2 && dy <= 4 && dx >= 2 && dx <= 4;
+                if (!inOuter) {
+                    setModule(r + dy, c + dx, false); // separator
+                }
+                else if (inWhite && !inInner) {
+                    setModule(r + dy, c + dx, false);
+                }
+                else {
+                    setModule(r + dy, c + dx, inInner || (dy === 0 || dy === 6 || dx === 0 || dx === 6));
+                }
+            }
+        }
+    }
+    placeFinderPattern(0, 0);
+    placeFinderPattern(0, size - 7);
+    placeFinderPattern(size - 7, 0);
+    // Timing patterns
+    for (let i = 8; i < size - 8; i++) {
+        const dark = i % 2 === 0;
+        setModule(6, i, dark);
+        setModule(i, 6, dark);
+    }
+    // Alignment patterns (version >= 2)
+    const alignmentPositions = {
+        2: [6, 18], 3: [6, 22], 4: [6, 26], 5: [6, 30],
+        6: [6, 34], 7: [6, 22, 38], 8: [6, 24, 42],
+        9: [6, 28, 46], 10: [6, 28, 50],
+    };
+    const alignPos = version >= 2 ? alignmentPositions[version] ?? [] : [];
+    for (const r of alignPos) {
+        for (const c of alignPos) {
+            // Skip positions occupied by finder patterns
+            if ((r <= 8 && c <= 8) || (r <= 8 && c >= size - 8) || (r >= size - 8 && c <= 8))
+                continue;
+            for (let dy = -2; dy <= 2; dy++) {
+                for (let dx = -2; dx <= 2; dx++) {
+                    const isEdge = Math.abs(dy) === 2 || Math.abs(dx) === 2;
+                    const isCenter = dy === 0 && dx === 0;
+                    setModule(r + dy, c + dx, isEdge || isCenter);
+                }
+            }
+        }
+    }
+    // Dark module (always dark)
+    setModule(4 * version + 9, 8, true);
+    // Format information area — reserve (mark as false for now)
+    for (let i = 0; i < 9; i++) {
+        setModule(8, i, matrix[8]?.[i] ?? false);
+        setModule(i, 8, matrix[i]?.[8] ?? false);
+    }
+    for (let i = size - 8; i < size; i++) {
+        setModule(8, i, false);
+        setModule(i, 8, false);
+    }
+    // Place data bits (zigzag pattern)
+    const allBits = [];
+    for (const b of finalBytes) {
+        for (let i = 7; i >= 0; i--)
+            allBits.push((b >> i) & 1);
+    }
+    let bitIdx = 0;
+    let goUp = true;
+    // Right-to-left column pairs, skipping column 6 (timing)
+    for (let col = size - 1; col >= 1; col -= 2) {
+        if (col === 6)
+            col--; // skip timing column
+        const colRange = goUp
+            ? Array.from({ length: size }, (_, i) => size - 1 - i)
+            : Array.from({ length: size }, (_, i) => i);
+        for (const row of colRange) {
+            for (const dc of [0, -1]) {
+                const c = col + dc;
+                if (matrix[row]?.[c] === null) {
+                    const bit = allBits[bitIdx++] ?? 0;
+                    matrix[row][c] = bit === 1;
+                }
+            }
+        }
+        goUp = !goUp;
+    }
+    // Apply mask pattern 0 (checkerboard: (row + col) % 2 === 0)
+    // and place format information
+    const maskFn = (r, c) => (r + c) % 2 === 0;
+    for (let r = 0; r < size; r++) {
+        for (let c = 0; c < size; c++) {
+            const module = matrix[r]?.[c];
+            if (module === null) {
+                matrix[r][c] = false; // unfilled = light
+            }
+            else {
+                // Only apply mask to data modules (not function patterns)
+                // We re-apply masking carefully: function patterns are already fixed
+                // Data modules that were null are now set above
+            }
+        }
+    }
+    // Apply mask to data modules (those placed via zigzag)
+    bitIdx = 0;
+    goUp = true;
+    const maskedMatrix = matrix.map((row) => row.map((m) => m ?? false));
+    // Reset data area and re-place with masking
+    {
+        const tempMatrix = matrix.map((row) => [...row]);
+        // Re-mark data positions as null
+        let bi = 0;
+        let gu = true;
+        for (let col = size - 1; col >= 1; col -= 2) {
+            if (col === 6)
+                col--;
+            const colRange = gu
+                ? Array.from({ length: size }, (_, i) => size - 1 - i)
+                : Array.from({ length: size }, (_, i) => i);
+            for (const row of colRange) {
+                for (const dc of [0, -1]) {
+                    const c = col + dc;
+                    if (tempMatrix[row]?.[c] !== null) {
+                        // was set as data, apply mask
+                        const dark = (allBits[bi++] ?? 0) === 1;
+                        maskedMatrix[row][c] = maskFn(row, c) ? !dark : dark;
+                    }
+                }
+            }
+            gu = !gu;
+        }
+    }
+    // Format string for ECC level M (01), mask pattern 0 (000)
+    // Format info = 01000 XOR 101010000010010 = 110010111100101
+    // Precomputed: ECC-M + mask-0 = format bits 101000000100101 (with BCH)
+    // Using known correct value for M+mask0: 0x5647 -> bits[14..0]
+    // Actually standard value: ECC-M=1, mask=0 -> data=01_000 -> format=01000 00000000
+    // BCH(01000)=0100000000+BCH = let's use precomputed: 0x72F3 for M+mask2, etc.
+    // Correct precomputed format words (ECC-M=0b01, masks 0-7):
+    const formatWords = [
+        0x5412, 0x5125, 0x5E7C, 0x5B4B, 0x45F9, 0x40CE, 0x4F97, 0x4AA0,
+    ];
+    const formatWord = formatWords[0]; // mask 0
+    const formatXor = 0b101010000010010;
+    const fmt = (formatWord ^ formatXor) & 0x7FFF;
+    const fmtBits = Array.from({ length: 15 }, (_, i) => (fmt >> (14 - i)) & 1);
+    // Place format bits around finder patterns
+    // Around top-left finder:
+    const fmtPositions1 = [
+        [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 7], [8, 8],
+        [7, 8], [5, 8], [4, 8], [3, 8], [2, 8], [1, 8], [0, 8],
+    ];
+    fmtPositions1.forEach(([r, c], i) => {
+        maskedMatrix[r][c] = fmtBits[i] === 1;
+    });
+    // Around top-right and bottom-left finders:
+    const fmtPositions2 = [
+        [8, size - 8], [8, size - 7], [8, size - 6], [8, size - 5],
+        [8, size - 4], [8, size - 3], [8, size - 2], [8, size - 1],
+    ];
+    fmtPositions2.forEach(([r, c], i) => {
+        maskedMatrix[r][c] = fmtBits[i] === 1;
+    });
+    const fmtPositions3 = [
+        [size - 7, 8], [size - 6, 8], [size - 5, 8],
+        [size - 4, 8], [size - 3, 8], [size - 2, 8], [size - 1, 8],
+    ];
+    fmtPositions3.forEach(([r, c], i) => {
+        maskedMatrix[r][c] = fmtBits[i + 8] === 1;
+    });
+    return { size, modules: maskedMatrix };
+}
+/**
+ * Generate a QR code matrix for the given data string.
+ * Tries qrencode CLI first; falls back to minimal built-in implementation.
+ */
+export function generateQrMatrix(data) {
+    const fromCli = tryQrencode(data);
+    if (fromCli !== null)
+        return fromCli;
+    return generateQrMatrixMinimal(data);
+}
+/**
+ * Render a QR matrix to a Unicode block string suitable for terminal output.
+ * Uses half-block characters to pack 2 rows into 1 terminal row.
+ *
+ * - Full block `█` = dark top + dark bottom
+ * - Upper half `▀` = dark top + light bottom
+ * - Lower half `▄` = light top + dark bottom
+ * - Space ` ` = light top + light bottom
+ */
+export function renderQrToString(matrix) {
+    const { size, modules } = matrix;
+    const lines = [];
+    for (let row = 0; row < size; row += 2) {
+        let line = '';
+        for (let col = 0; col < size; col++) {
+            const top = modules[row]?.[col] ?? false;
+            const bottom = modules[row + 1]?.[col] ?? false;
+            if (top && bottom)
+                line += '\u2588'; // full block
+            else if (top && !bottom)
+                line += '\u2580'; // upper half
+            else if (!top && bottom)
+                line += '\u2584'; // lower half
+            else
+                line += ' '; // space
+        }
+        lines.push(line);
+    }
+    return lines.join('\n');
+}

package/dist/_internal/platform/plugins/loader.d.ts

@@ -12,6 +12,10 @@ import type { WebSearchProviderRegistry } from '../web-search/index.js';
 export interface PluginPathOptions {
     readonly cwd: string;
     readonly homeDir: string;
+    /** Additional plugin directories to search, appended after the standard directories. */
+    readonly additionalDirectories?: readonly string[];
+    /** Default entry point filename when a plugin manifest does not specify `main`. Defaults to 'index.js'. */
+    readonly entryDefault?: string;
 }
 /**
  * Plugin search directories in precedence order.
@@ -93,7 +97,7 @@ export interface PluginLoaderDeps {
  * @param cacheBust - Optional timestamp suffix appended to the import URL to bypass
  *   Bun's module cache. Pass `Date.now()` on reload to force fresh execution.
  */
-export declare function loadPlugin(discovered: DiscoveredPlugin, deps: PluginLoaderDeps, cacheBust?: number): Promise<LoadedPlugin | null>;
+export declare function loadPlugin(discovered: DiscoveredPlugin, deps: PluginLoaderDeps, cacheBust?: number, entryDefault?: string): Promise<LoadedPlugin | null>;
 /**
  * unloadPlugin — Deactivate a plugin and run all cleanup callbacks.
  */

package/dist/_internal/platform/plugins/loader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"loader.d.ts","sourceRoot":"","sources":["../../../../src/_internal/platform/plugins/loader.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,eAAe,EAAyB,MAAM,UAAU,CAAC;AAClE,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AACjE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+CAA+C,CAAC;AAClF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAClE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AACtE,OAAO,KAAK,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AACzF,OAAO,KAAK,EAAE,+BAA+B,EAAE,MAAM,mBAAmB,CAAC;AACzE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,4CAA4C,CAAC;AACxF,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,wBAAwB,CAAC;AAGxE,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAID;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,iBAAiB,GAAG,MAAM,CAEzE;AAED,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,iBAAiB,GAAG,MAAM,EAAE,CAKzE;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,6DAA6D;IAC7D,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,wEAAwE;IACxE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,qEAAqE;IACrE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,gFAAgF;IAChF,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACpE,kEAAkE;IAClE,QAAQ,CAAC,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAClC,wEAAwE;IACxE,UAAU,CAAC,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACrC;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,cAAc,CAAC;IACzB,6CAA6C;IAC7C,SAAS,EAAE,MAAM,CAAC;IAClB,0EAA0E;IAC1E,MAAM,EAAE,OAAO,CAAC;IAChB,2DAA2D;IAC3D,OAAO,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;IAC3B,8DAA8D;IAC9D,KAAK,CAAC,EAAE,gBAAgB,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,cAAc,CAAC;CAC1B;AA0DD,wBAAgB,eAAe,CAAC,OAAO,EAAE,iBAAiB,GAAG,gBAAgB,EAAE,CAU9E;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,eAAe,CAAC;IAC5B,eAAe,EAAE,mBAAmB,CAAC;IACrC,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,YAAY,EAAE,YAAY,CAAC;IAC3B,cAAc,EAAE,oBAAoB,CAAC;IACrC,eAAe,EAAE,qBAAqB,CAAC;IACvC,qBAAqB,EAAE,qBAAqB,CAAC;IAC7C,uBAAuB,EAAE,+BAA+B,CAAC;IACzD,qBAAqB,EAAE,qBAAqB,CAAC;IAC7C,qBAAqB,EAAE,qBAAqB,CAAC;IAC7C,yBAAyB,EAAE,yBAAyB,CAAC;IACrD,0DAA0D;IAC1D,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvD,+DAA+D;IAC/D,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;CAClC;AAED;;;;;;GAMG;AACH,wBAAsB,UAAU,CAC9B,UAAU,EAAE,gBAAgB,EAC5B,IAAI,EAAE,gBAAgB,EACtB,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CA8F9B;AAED;;GAEG;AACH,wBAAsB,YAAY,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAiBtE"}
+{"version":3,"file":"loader.d.ts","sourceRoot":"","sources":["../../../../src/_internal/platform/plugins/loader.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,eAAe,EAAyB,MAAM,UAAU,CAAC;AAClE,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AACjE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+CAA+C,CAAC;AAClF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAClE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AACtE,OAAO,KAAK,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AACzF,OAAO,KAAK,EAAE,+BAA+B,EAAE,MAAM,mBAAmB,CAAC;AACzE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,4CAA4C,CAAC;AACxF,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,wBAAwB,CAAC;AAGxE,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,wFAAwF;IACxF,QAAQ,CAAC,qBAAqB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnD,2GAA2G;IAC3G,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;CAChC;AAID;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,iBAAiB,GAAG,MAAM,CAEzE;AAED,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,iBAAiB,GAAG,MAAM,EAAE,CASzE;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,6DAA6D;IAC7D,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,wEAAwE;IACxE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,qEAAqE;IACrE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,gFAAgF;IAChF,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,OAAO,eAAe,CAAC,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACpE,kEAAkE;IAClE,QAAQ,CAAC,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAClC,wEAAwE;IACxE,UAAU,CAAC,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACrC;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,cAAc,CAAC;IACzB,6CAA6C;IAC7C,SAAS,EAAE,MAAM,CAAC;IAClB,0EAA0E;IAC1E,MAAM,EAAE,OAAO,CAAC;IAChB,2DAA2D;IAC3D,OAAO,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;IAC3B,8DAA8D;IAC9D,KAAK,CAAC,EAAE,gBAAgB,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,cAAc,CAAC;CAC1B;AA0DD,wBAAgB,eAAe,CAAC,OAAO,EAAE,iBAAiB,GAAG,gBAAgB,EAAE,CAU9E;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,eAAe,CAAC;IAC5B,eAAe,EAAE,mBAAmB,CAAC;IACrC,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,YAAY,EAAE,YAAY,CAAC;IAC3B,cAAc,EAAE,oBAAoB,CAAC;IACrC,eAAe,EAAE,qBAAqB,CAAC;IACvC,qBAAqB,EAAE,qBAAqB,CAAC;IAC7C,uBAAuB,EAAE,+BAA+B,CAAC;IACzD,qBAAqB,EAAE,qBAAqB,CAAC;IAC7C,qBAAqB,EAAE,qBAAqB,CAAC;IAC7C,yBAAyB,EAAE,yBAAyB,CAAC;IACrD,0DAA0D;IAC1D,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvD,+DAA+D;IAC/D,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;CAClC;AAED;;;;;;GAMG;AACH,wBAAsB,UAAU,CAC9B,UAAU,EAAE,gBAAgB,EAC5B,IAAI,EAAE,gBAAgB,EACtB,SAAS,CAAC,EAAE,MAAM,EAClB,YAAY,CAAC,EAAE,MAAM,GACpB,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CA8F9B;AAED;;GAEG;AACH,wBAAsB,YAAY,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAiBtE"}

package/dist/_internal/platform/plugins/loader.js

@@ -12,10 +12,14 @@ export function getUserPluginDirectory(options) {
     return join(options.homeDir, '.goodvibes', PLUGIN_ROOT);
 }
 export function getPluginDirectories(options) {
-    return [
+    const dirs = [
         join(options.cwd, '.goodvibes', PLUGIN_ROOT),
         getUserPluginDirectory(options),
     ];
+    if (options.additionalDirectories) {
+        dirs.push(...options.additionalDirectories);
+    }
+    return dirs;
 }
 /**
  * discoverPlugins — Scan the configured plugin directories for valid plugin folders.
@@ -88,9 +92,9 @@ export function discoverPlugins(options) {
  * @param cacheBust - Optional timestamp suffix appended to the import URL to bypass
  *   Bun's module cache. Pass `Date.now()` on reload to force fresh execution.
  */
-export async function loadPlugin(discovered, deps, cacheBust) {
+export async function loadPlugin(discovered, deps, cacheBust, entryDefault) {
     const { manifest, pluginDir } = discovered;
-    const entryFile = manifest.main ?? 'index.js';
+    const entryFile = manifest.main ?? entryDefault ?? 'index.js';
     const entryPath = join(pluginDir, entryFile);
     // Path traversal guard: resolved entry must remain within pluginDir
     const resolvedEntry = resolve(entryPath);

package/dist/_internal/platform/runtime/bootstrap-hook-bridge.d.ts

@@ -0,0 +1,10 @@
+import type { HookDispatcher } from '../hooks/index.js';
+import type { MutableRuntimeState } from './mutable-runtime-state.js';
+import type { RuntimeEventBus } from './events/index.js';
+export interface HookBridgeRegistrationOptions {
+    readonly runtimeBus: RuntimeEventBus;
+    readonly hookDispatcher: HookDispatcher;
+    readonly runtime: MutableRuntimeState;
+}
+export declare function registerBootstrapHookBridge(options: HookBridgeRegistrationOptions): Array<() => void>;
+//# sourceMappingURL=bootstrap-hook-bridge.d.ts.map

package/dist/_internal/platform/runtime/bootstrap-hook-bridge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bootstrap-hook-bridge.d.ts","sourceRoot":"","sources":["../../../../src/_internal/platform/runtime/bootstrap-hook-bridge.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAExD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AACtE,OAAO,KAAK,EAAwB,eAAe,EAAiB,MAAM,mBAAmB,CAAC;AA4B9F,MAAM,WAAW,6BAA6B;IAC5C,QAAQ,CAAC,UAAU,EAAE,eAAe,CAAC;IACrC,QAAQ,CAAC,cAAc,EAAE,cAAc,CAAC;IACxC,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;CACvC;AAED,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,6BAA6B,GACrC,KAAK,CAAC,MAAM,IAAI,CAAC,CAoInB"}

package/dist/_internal/platform/runtime/bootstrap-hook-bridge.js

@@ -0,0 +1,143 @@
+import { logger } from '../utils/logger.js';
+import { summarizeError } from '../utils/error-display.js';
+function fireHook(options, path, phase, category, specific, payload) {
+    options.hookDispatcher.fire({
+        path,
+        phase,
+        category,
+        specific,
+        sessionId: options.runtime.sessionId,
+        timestamp: Date.now(),
+        payload,
+    }).catch((err) => logger.debug('Hook bridge fire error', { path, error: summarizeError(err) }));
+}
+export function registerBootstrapHookBridge(options) {
+    const fireOptions = {
+        hookDispatcher: options.hookDispatcher,
+        runtime: options.runtime,
+    };
+    const unsubs = [];
+    const { runtimeBus } = options;
+    unsubs.push(runtimeBus.on('AGENT_SPAWNING', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:agent:spawned', 'Lifecycle', 'agent', 'spawned', { agentId: payload.agentId, task: payload.task });
+    }));
+    unsubs.push(runtimeBus.on('AGENT_COMPLETED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:agent:completed', 'Lifecycle', 'agent', 'completed', {
+            agentId: payload.agentId,
+            result: {
+                durationMs: payload.durationMs,
+                ...(payload.output !== undefined ? { output: payload.output } : {}),
+                ...(payload.toolCallsMade !== undefined ? { toolCallsMade: payload.toolCallsMade } : {}),
+            },
+        });
+    }));
+    unsubs.push(runtimeBus.on('AGENT_FAILED', ({ payload }) => {
+        const specific = payload.error === 'Agent cancelled' || payload.error.includes('cancelled') ? 'cancelled' : 'failed';
+        fireHook(fireOptions, `Lifecycle:agent:${specific}`, 'Lifecycle', 'agent', specific, { agentId: payload.agentId, error: payload.error });
+    }));
+    unsubs.push(runtimeBus.on('WORKFLOW_CHAIN_CREATED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:workflow:started', 'Lifecycle', 'workflow', 'started', { chainId: payload.chainId, task: payload.task });
+    }));
+    unsubs.push(runtimeBus.on('WORKFLOW_CHAIN_PASSED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:workflow:completed', 'Lifecycle', 'workflow', 'completed', { chainId: payload.chainId });
+    }));
+    unsubs.push(runtimeBus.on('WORKFLOW_CHAIN_FAILED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:workflow:failed', 'Lifecycle', 'workflow', 'failed', { chainId: payload.chainId, reason: payload.reason });
+    }));
+    unsubs.push(runtimeBus.on('WORKFLOW_REVIEW_COMPLETED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:workflow:reviewed', 'Lifecycle', 'workflow', 'reviewed', {
+            chainId: payload.chainId,
+            score: payload.score,
+            passed: payload.passed,
+        });
+    }));
+    unsubs.push(runtimeBus.on('WORKFLOW_FIX_ATTEMPTED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:workflow:fix-attempted', 'Lifecycle', 'workflow', 'fix-attempted', {
+            chainId: payload.chainId,
+            attempt: payload.attempt,
+            maxAttempts: payload.maxAttempts,
+        });
+    }));
+    unsubs.push(runtimeBus.on('WORKFLOW_GATE_RESULT', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:workflow:gate-result', 'Lifecycle', 'workflow', 'gate-result', {
+            chainId: payload.chainId,
+            gate: payload.gate,
+            passed: payload.passed,
+        });
+    }));
+    unsubs.push(runtimeBus.on('ORCHESTRATION_GRAPH_CREATED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:orchestration:graph-created', 'Lifecycle', 'orchestration', 'graph-created', {
+            graphId: payload.graphId,
+            title: payload.title,
+            mode: payload.mode,
+        });
+    }));
+    unsubs.push(runtimeBus.on('ORCHESTRATION_NODE_STARTED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:orchestration:node-started', 'Lifecycle', 'orchestration', 'node-started', {
+            graphId: payload.graphId,
+            nodeId: payload.nodeId,
+            ...(payload.taskId !== undefined ? { taskId: payload.taskId } : {}),
+            ...(payload.agentId !== undefined ? { agentId: payload.agentId } : {}),
+        });
+    }));
+    unsubs.push(runtimeBus.on('ORCHESTRATION_NODE_COMPLETED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:orchestration:node-completed', 'Lifecycle', 'orchestration', 'node-completed', {
+            graphId: payload.graphId,
+            nodeId: payload.nodeId,
+            ...(payload.summary !== undefined ? { summary: payload.summary } : {}),
+        });
+    }));
+    unsubs.push(runtimeBus.on('ORCHESTRATION_NODE_FAILED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:orchestration:node-failed', 'Lifecycle', 'orchestration', 'node-failed', {
+            graphId: payload.graphId,
+            nodeId: payload.nodeId,
+            error: payload.error,
+        });
+    }));
+    unsubs.push(runtimeBus.on('ORCHESTRATION_RECURSION_GUARD_TRIGGERED', ({ payload }) => {
+        fireHook(fireOptions, 'Change:orchestration:recursion-guard', 'Change', 'orchestration', 'recursion-guard', {
+            graphId: payload.graphId,
+            ...(payload.nodeId !== undefined ? { nodeId: payload.nodeId } : {}),
+            depth: payload.depth,
+            activeAgents: payload.activeAgents,
+            reason: payload.reason,
+        });
+    }));
+    unsubs.push(runtimeBus.on('COMMUNICATION_SENT', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:communication:sent', 'Lifecycle', 'communication', 'sent', {
+            messageId: payload.messageId,
+            fromId: payload.fromId,
+            toId: payload.toId,
+            scope: payload.scope,
+            kind: payload.kind,
+            ...(payload.fromRole !== undefined ? { fromRole: payload.fromRole } : {}),
+            ...(payload.toRole !== undefined ? { toRole: payload.toRole } : {}),
+        });
+    }));
+    unsubs.push(runtimeBus.on('COMMUNICATION_DELIVERED', ({ payload }) => {
+        fireHook(fireOptions, 'Lifecycle:communication:delivered', 'Lifecycle', 'communication', 'delivered', {
+            messageId: payload.messageId,
+            fromId: payload.fromId,
+            toId: payload.toId,
+            scope: payload.scope,
+            kind: payload.kind,
+        });
+    }));
+    unsubs.push(runtimeBus.on('COMMUNICATION_BLOCKED', ({ payload }) => {
+        fireHook(fireOptions, 'Change:communication:blocked', 'Change', 'communication', 'blocked', {
+            messageId: payload.messageId,
+            fromId: payload.fromId,
+            toId: payload.toId,
+            scope: payload.scope,
+            kind: payload.kind,
+            reason: payload.reason,
+            ...(payload.fromRole !== undefined ? { fromRole: payload.fromRole } : {}),
+            ...(payload.toRole !== undefined ? { toRole: payload.toRole } : {}),
+        });
+    }));
+    unsubs.push(runtimeBus.on('OPS_CONTEXT_WARNING', ({ payload: { usage, threshold } }) => {
+        const specific = usage >= threshold ? 'exceeded' : 'warning';
+        fireHook(fireOptions, `Change:budget:${specific}`, 'Change', 'budget', specific, { usage, threshold });
+    }));
+    return unsubs;
+}