agentic-flow 3.0.0-alpha.1 → 3.0.0

package/dist/packages/agentdb/src/controllers/ExplainableRecall.js

@@ -1,518 +0,0 @@
-/**
- * ExplainableRecall - Provenance and Justification for Memory Retrieval
- *
- * Every retrieval returns:
- * - Minimal hitting set of facts that justify the answer
- * - Merkle proof chain for provenance
- * - Policy compliance certificates
- *
- * Based on:
- * - Minimal hitting set algorithms
- * - Merkle tree provenance
- * - Explainable AI techniques
- *
- * v2.0.0-alpha.3 Features:
- * - GraphRoPE for hop-distance-aware graph queries (WASM)
- * - Rotary positional encoding based on graph structure
- * - Feature flag: ENABLE_GRAPH_ROPE (default: false)
- * - 100% backward compatible with fallback to standard retrieval
- */
-import * as crypto from 'crypto';
-import { AttentionService } from '../utils/LegacyAttentionAdapter.js';
-export class ExplainableRecall {
-    db;
-    attentionService;
-    embedder;
-    config;
-    /**
-     * Constructor supports both v1 (legacy) and v2 (with GraphRoPE) modes
-     *
-     * v1 mode: new ExplainableRecall(db)
-     * v2 mode: new ExplainableRecall(db, embedder, config)
-     */
-    constructor(db, embedder, config) {
-        this.db = db;
-        this.embedder = embedder;
-        this.config = {
-            ENABLE_GRAPH_ROPE: false,
-            ...config,
-        };
-        // Initialize AttentionService if GraphRoPE enabled
-        if (embedder && this.config.ENABLE_GRAPH_ROPE) {
-            this.attentionService = new AttentionService(db, {
-                graphRoPE: {
-                    enabled: true,
-                    ...this.config.graphRoPEConfig,
-                },
-            });
-        }
-    }
-    /**
-     * Create a recall certificate for a retrieval operation
-     *
-     * v2: Uses GraphRoPE if enabled for hop-distance-aware justification scoring
-     * v1: Falls back to standard relevance-based justification
-     */
-    async createCertificate(params) {
-        const { queryId, queryText, chunks, requirements, accessLevel = 'internal' } = params;
-        const startTime = Date.now();
-        // 1. Compute minimal hitting set
-        const minimalWhy = this.computeMinimalHittingSet(chunks, requirements);
-        // 2. Calculate metrics
-        const redundancyRatio = chunks.length / minimalWhy.length;
-        const completenessScore = this.calculateCompleteness(minimalWhy, requirements);
-        // 3. Build provenance chain
-        const sourceHashes = chunks.map(chunk => this.getOrCreateProvenance(chunk.type, parseInt(chunk.id)));
-        const merkleTree = this.buildMerkleTree(sourceHashes);
-        const merkleRoot = merkleTree.root;
-        // 4. Generate chunk metadata first (needed for certificate ID)
-        const chunkIds = chunks.map(c => c.id);
-        const chunkTypes = chunks.map(c => c.type);
-        // 5. Create certificate ID
-        const certificateId = this.generateCertificateId(queryId, chunkIds);
-        // 6. Generate proof chain for each chunk
-        const proofChain = chunks.map((chunk, idx) => this.getMerkleProof(merkleTree, idx)).flat();
-        // 7. Store certificate
-        this.db.prepare(`
-      INSERT INTO recall_certificates (
-        id, query_id, query_text, chunk_ids, chunk_types,
-        minimal_why, redundancy_ratio, completeness_score,
-        merkle_root, source_hashes, proof_chain,
-        access_level, latency_ms
-      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
-    `).run(certificateId, queryId, queryText, JSON.stringify(chunkIds), JSON.stringify(chunkTypes), JSON.stringify(minimalWhy), redundancyRatio, completenessScore, merkleRoot, JSON.stringify(sourceHashes), JSON.stringify(proofChain), accessLevel, Date.now() - startTime);
-        // 7. Store justification paths
-        this.storeJustificationPaths(certificateId, chunks, minimalWhy, requirements);
-        const certificate = {
-            id: certificateId,
-            queryId,
-            queryText,
-            chunkIds,
-            chunkTypes,
-            minimalWhy,
-            redundancyRatio,
-            completenessScore,
-            merkleRoot,
-            sourceHashes,
-            proofChain,
-            accessLevel: accessLevel,
-            latencyMs: Date.now() - startTime
-        };
-        return certificate;
-    }
-    /**
-     * Verify a recall certificate
-     */
-    verifyCertificate(certificateId) {
-        const cert = this.db.prepare('SELECT * FROM recall_certificates WHERE id = ?').get(certificateId);
-        if (!cert) {
-            return { valid: false, issues: ['Certificate not found'] };
-        }
-        const issues = [];
-        // 1. Verify Merkle root
-        const sourceHashes = JSON.parse(cert.source_hashes);
-        const merkleTree = this.buildMerkleTree(sourceHashes);
-        if (merkleTree.root !== cert.merkle_root) {
-            issues.push('Merkle root mismatch');
-        }
-        // 2. Verify chunk hashes still match
-        const chunkIds = JSON.parse(cert.chunk_ids);
-        const chunkTypes = JSON.parse(cert.chunk_types);
-        for (let i = 0; i < chunkIds.length; i++) {
-            const currentHash = this.getContentHash(chunkTypes[i], parseInt(chunkIds[i]));
-            if (currentHash !== sourceHashes[i]) {
-                issues.push(`Chunk ${chunkIds[i]} hash changed`);
-            }
-        }
-        // 3. Verify completeness
-        const minimalWhy = JSON.parse(cert.minimal_why);
-        if (minimalWhy.length === 0) {
-            issues.push('Empty justification set');
-        }
-        // 4. Verify redundancy ratio
-        if (cert.redundancy_ratio < 1.0) {
-            issues.push('Invalid redundancy ratio');
-        }
-        return {
-            valid: issues.length === 0,
-            issues
-        };
-    }
-    /**
-     * Get justification for why a chunk was included
-     */
-    getJustification(certificateId, chunkId) {
-        const row = this.db.prepare(`
-      SELECT * FROM justification_paths
-      WHERE certificate_id = ? AND chunk_id = ?
-    `).get(certificateId, chunkId);
-        if (!row)
-            return null;
-        return {
-            chunkId: row.chunk_id,
-            chunkType: row.chunk_type,
-            reason: row.reason,
-            necessityScore: row.necessity_score,
-            pathElements: JSON.parse(row.path_elements)
-        };
-    }
-    /**
-     * Get provenance lineage for a source
-     */
-    getProvenanceLineage(contentHash) {
-        const lineage = [];
-        let currentHash = contentHash;
-        while (currentHash) {
-            const source = this.db.prepare(`
-        SELECT * FROM provenance_sources WHERE content_hash = ?
-      `).get(currentHash);
-            if (!source)
-                break;
-            lineage.push({
-                id: source.id,
-                sourceType: source.source_type,
-                sourceId: source.source_id,
-                contentHash: source.content_hash,
-                parentHash: source.parent_hash,
-                derivedFrom: source.derived_from ? JSON.parse(source.derived_from) : undefined,
-                creator: source.creator,
-                metadata: source.metadata ? JSON.parse(source.metadata) : undefined
-            });
-            currentHash = source.parent_hash;
-        }
-        return lineage;
-    }
-    /**
-     * Trace provenance lineage for a certificate
-     * Returns full provenance chain from certificate to original sources
-     */
-    traceProvenance(certificateId) {
-        const certRow = this.db.prepare('SELECT * FROM recall_certificates WHERE id = ?').get(certificateId);
-        if (!certRow) {
-            throw new Error(`Certificate ${certificateId} not found`);
-        }
-        const certificate = {
-            id: certRow.id,
-            queryId: certRow.query_id,
-            queryText: certRow.query_text,
-            chunkIds: JSON.parse(certRow.chunk_ids),
-            chunkTypes: JSON.parse(certRow.chunk_types),
-            minimalWhy: JSON.parse(certRow.minimal_why),
-            redundancyRatio: certRow.redundancy_ratio,
-            completenessScore: certRow.completeness_score,
-            merkleRoot: certRow.merkle_root,
-            sourceHashes: JSON.parse(certRow.source_hashes),
-            proofChain: JSON.parse(certRow.proof_chain),
-            policyProof: certRow.policy_proof,
-            policyVersion: certRow.policy_version,
-            accessLevel: certRow.access_level,
-            latencyMs: certRow.latency_ms
-        };
-        // Build provenance map for all sources
-        const sources = new Map();
-        for (const hash of certificate.sourceHashes) {
-            sources.set(hash, this.getProvenanceLineage(hash));
-        }
-        // Build provenance graph
-        const nodes = [];
-        const edges = [];
-        // Add certificate node
-        nodes.push({
-            id: certificateId,
-            type: 'certificate',
-            label: `Certificate: ${certificate.queryText.substring(0, 30)}...`
-        });
-        // Add source nodes and edges
-        for (const [hash, lineage] of sources.entries()) {
-            for (let i = 0; i < lineage.length; i++) {
-                const source = lineage[i];
-                const nodeId = `${source.sourceType}-${source.sourceId}`;
-                // Add node if not exists
-                if (!nodes.find(n => n.id === nodeId)) {
-                    nodes.push({
-                        id: nodeId,
-                        type: source.sourceType,
-                        label: `${source.sourceType} #${source.sourceId}`
-                    });
-                }
-                // Add edge from certificate to first source
-                if (i === 0) {
-                    edges.push({
-                        from: certificateId,
-                        to: nodeId,
-                        type: 'includes'
-                    });
-                }
-                // Add edge to parent if exists
-                if (i < lineage.length - 1) {
-                    const parentNodeId = `${lineage[i + 1].sourceType}-${lineage[i + 1].sourceId}`;
-                    edges.push({
-                        from: nodeId,
-                        to: parentNodeId,
-                        type: 'derived_from'
-                    });
-                }
-            }
-        }
-        return {
-            certificate,
-            sources,
-            graph: { nodes, edges }
-        };
-    }
-    /**
-     * Audit certificate access
-     */
-    auditCertificate(certificateId) {
-        const certRow = this.db.prepare('SELECT * FROM recall_certificates WHERE id = ?').get(certificateId);
-        if (!certRow) {
-            throw new Error(`Certificate ${certificateId} not found`);
-        }
-        const certificate = {
-            id: certRow.id,
-            queryId: certRow.query_id,
-            queryText: certRow.query_text,
-            chunkIds: JSON.parse(certRow.chunk_ids),
-            chunkTypes: JSON.parse(certRow.chunk_types),
-            minimalWhy: JSON.parse(certRow.minimal_why),
-            redundancyRatio: certRow.redundancy_ratio,
-            completenessScore: certRow.completeness_score,
-            merkleRoot: certRow.merkle_root,
-            sourceHashes: JSON.parse(certRow.source_hashes),
-            proofChain: JSON.parse(certRow.proof_chain),
-            policyProof: certRow.policy_proof,
-            policyVersion: certRow.policy_version,
-            accessLevel: certRow.access_level,
-            latencyMs: certRow.latency_ms
-        };
-        // Get justifications
-        const justRows = this.db.prepare(`
-      SELECT * FROM justification_paths WHERE certificate_id = ?
-    `).all(certificateId);
-        const justifications = justRows.map(row => ({
-            chunkId: row.chunk_id,
-            chunkType: row.chunk_type,
-            reason: row.reason,
-            necessityScore: row.necessity_score,
-            pathElements: JSON.parse(row.path_elements)
-        }));
-        // Get provenance for each source
-        const provenance = new Map();
-        for (const hash of certificate.sourceHashes) {
-            provenance.set(hash, this.getProvenanceLineage(hash));
-        }
-        // Calculate quality metrics
-        const avgNecessity = justifications.reduce((sum, j) => sum + j.necessityScore, 0) / justifications.length;
-        return {
-            certificate,
-            justifications,
-            provenance,
-            quality: {
-                completeness: certificate.completenessScore,
-                redundancy: certificate.redundancyRatio,
-                avgNecessity
-            }
-        };
-    }
-    // ========================================================================
-    // Private Helper Methods
-    // ========================================================================
-    /**
-     * Compute minimal hitting set using greedy algorithm
-     * A hitting set contains at least one element from each requirement
-     */
-    computeMinimalHittingSet(chunks, requirements) {
-        if (requirements.length === 0) {
-            return chunks.slice(0, Math.min(3, chunks.length)).map(c => c.id);
-        }
-        const uncovered = new Set(requirements);
-        const selected = [];
-        // Greedy: select chunk that covers most uncovered requirements
-        while (uncovered.size > 0 && chunks.length > 0) {
-            let bestChunk = null;
-            let bestCoverage = 0;
-            for (const chunk of chunks) {
-                const coverage = Array.from(uncovered).filter(req => chunk.content.toLowerCase().includes(req.toLowerCase())).length;
-                if (coverage > bestCoverage) {
-                    bestCoverage = coverage;
-                    bestChunk = chunk;
-                }
-            }
-            if (!bestChunk)
-                break;
-            selected.push(bestChunk.id);
-            // Remove covered requirements
-            for (const req of Array.from(uncovered)) {
-                if (bestChunk.content.toLowerCase().includes(req.toLowerCase())) {
-                    uncovered.delete(req);
-                }
-            }
-            // Remove selected chunk
-            chunks = chunks.filter(c => c.id !== bestChunk.id);
-        }
-        return selected;
-    }
-    /**
-     * Calculate completeness score
-     */
-    calculateCompleteness(minimalWhy, requirements) {
-        if (requirements.length === 0)
-            return 1.0;
-        // Prepare statement ONCE outside loop (better-sqlite3 best practice)
-        const stmt = this.db.prepare('SELECT output FROM episodes WHERE id = ?');
-        const chunks = minimalWhy.map(id => {
-            // Get chunk content
-            const episode = stmt.get(parseInt(id));
-            return episode ? episode.output : '';
-        });
-        const satisfied = requirements.filter(req => chunks.some(content => content && content.toLowerCase().includes(req.toLowerCase())));
-        return satisfied.length / requirements.length;
-    }
-    /**
-     * Get or create provenance record
-     */
-    getOrCreateProvenance(sourceType, sourceId) {
-        // Check if provenance exists
-        const existing = this.db.prepare(`
-      SELECT content_hash FROM provenance_sources
-      WHERE source_type = ? AND source_id = ?
-    `).get(sourceType, sourceId);
-        if (existing) {
-            return existing.content_hash;
-        }
-        // Create new provenance
-        const contentHash = this.getContentHash(sourceType, sourceId);
-        this.db.prepare(`
-      INSERT OR IGNORE INTO provenance_sources (source_type, source_id, content_hash, creator)
-      VALUES (?, ?, ?, ?)
-    `).run(sourceType, sourceId, contentHash, 'system');
-        return contentHash;
-    }
-    // Prepare statement ONCE outside loop (better-sqlite3 best practice)
-    _episodeStmt;
-    _skillStmt;
-    _noteStmt;
-    _factStmt;
-    /**
-     * Get content hash for a memory
-     */
-    getContentHash(sourceType, sourceId) {
-        let content = '';
-        switch (sourceType) {
-            case 'episode':
-                if (!this._episodeStmt) {
-                    this._episodeStmt = this.db.prepare('SELECT task, output FROM episodes WHERE id = ?');
-                }
-                const episode = this._episodeStmt.get(sourceId);
-                content = episode ? `${episode.task}:${episode.output}` : '';
-                break;
-            case 'skill':
-                if (!this._skillStmt) {
-                    this._skillStmt = this.db.prepare('SELECT name, code FROM skills WHERE id = ?');
-                }
-                const skill = this._skillStmt.get(sourceId);
-                content = skill ? `${skill.name}:${skill.code}` : '';
-                break;
-            case 'note':
-                if (!this._noteStmt) {
-                    this._noteStmt = this.db.prepare('SELECT text FROM notes WHERE id = ?');
-                }
-                const note = this._noteStmt.get(sourceId);
-                content = note ? note.text : '';
-                break;
-            case 'fact':
-                if (!this._factStmt) {
-                    this._factStmt = this.db.prepare('SELECT subject, predicate, object FROM facts WHERE id = ?');
-                }
-                const fact = this._factStmt.get(sourceId);
-                content = fact ? `${fact.subject}:${fact.predicate}:${fact.object}` : '';
-                break;
-        }
-        return crypto.createHash('sha256').update(content).digest('hex');
-    }
-    /**
-     * Build Merkle tree from hashes
-     */
-    buildMerkleTree(hashes) {
-        if (hashes.length === 0) {
-            return { root: '', tree: [[]] };
-        }
-        const tree = [hashes];
-        while (tree[tree.length - 1].length > 1) {
-            const level = tree[tree.length - 1];
-            const nextLevel = [];
-            for (let i = 0; i < level.length; i += 2) {
-                if (i + 1 < level.length) {
-                    const combined = level[i] + level[i + 1];
-                    nextLevel.push(crypto.createHash('sha256').update(combined).digest('hex'));
-                }
-                else {
-                    nextLevel.push(level[i]);
-                }
-            }
-            tree.push(nextLevel);
-        }
-        return { root: tree[tree.length - 1][0], tree };
-    }
-    /**
-     * Get Merkle proof for a leaf
-     */
-    getMerkleProof(merkleTree, leafIndex) {
-        const proof = [];
-        let index = leafIndex;
-        for (let level = 0; level < merkleTree.tree.length - 1; level++) {
-            const currentLevel = merkleTree.tree[level];
-            const isLeftNode = index % 2 === 0;
-            const siblingIndex = isLeftNode ? index + 1 : index - 1;
-            if (siblingIndex < currentLevel.length) {
-                proof.push({
-                    hash: currentLevel[siblingIndex],
-                    position: isLeftNode ? 'right' : 'left'
-                });
-            }
-            index = Math.floor(index / 2);
-        }
-        return proof;
-    }
-    /**
-     * Generate certificate ID
-     */
-    generateCertificateId(queryId, chunkIds) {
-        const data = `${queryId}:${chunkIds.join(',')}:${Date.now()}`;
-        return crypto.createHash('sha256').update(data).digest('hex');
-    }
-    /**
-     * Store justification paths
-     */
-    storeJustificationPaths(certificateId, chunks, minimalWhy, requirements) {
-        const stmt = this.db.prepare(`
-      INSERT INTO justification_paths (
-        certificate_id, chunk_id, chunk_type, reason, necessity_score, path_elements
-      ) VALUES (?, ?, ?, ?, ?, ?)
-    `);
-        for (const chunk of chunks) {
-            const isNecessary = minimalWhy.includes(chunk.id);
-            const reason = this.determineReason(chunk, requirements);
-            const necessityScore = isNecessary ? chunk.relevance : chunk.relevance * 0.5;
-            const pathElements = [
-                `Retrieved for query`,
-                isNecessary ? `Essential for justification` : `Supporting evidence`,
-                `Relevance: ${(chunk.relevance * 100).toFixed(1)}%`
-            ];
-            stmt.run(certificateId, chunk.id, chunk.type, reason, necessityScore, JSON.stringify(pathElements));
-        }
-    }
-    /**
-     * Determine reason for inclusion
-     */
-    determineReason(chunk, requirements) {
-        if (chunk.relevance > 0.9)
-            return 'semantic_match';
-        if (chunk.relevance > 0.7)
-            return 'causal_link';
-        if (chunk.relevance > 0.5)
-            return 'prerequisite';
-        return 'constraint';
-    }
-}
-//# sourceMappingURL=ExplainableRecall.js.map

package/dist/packages/agentdb/src/controllers/ExplainableRecall.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ExplainableRecall.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/ExplainableRecall.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,KAAK,MAAM,MAAM,QAAQ,CAAC;AACjC,OAAO,EAAE,gBAAgB,EAAwB,MAAM,oCAAoC,CAAC;AAiE5F,MAAM,OAAO,iBAAiB;IACpB,EAAE,CAAW;IACb,gBAAgB,CAAoB;IACpC,QAAQ,CAAoB;IAC5B,MAAM,CAA0B;IAExC;;;;;OAKG;IACH,YACE,EAAY,EACZ,QAA2B,EAC3B,MAAgC;QAEhC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG;YACZ,iBAAiB,EAAE,KAAK;YACxB,GAAG,MAAM;SACV,CAAC;QAEF,mDAAmD;QACnD,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC9C,IAAI,CAAC,gBAAgB,GAAG,IAAI,gBAAgB,CAAC,EAAE,EAAE;gBAC/C,SAAS,EAAE;oBACT,OAAO,EAAE,IAAI;oBACb,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe;iBAC/B;aACF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,iBAAiB,CAAC,MAOvB;QACC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,EAAE,WAAW,GAAG,UAAU,EAAE,GAAG,MAAM,CAAC;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,iCAAiC;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAEvE,uBAAuB;QACvB,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;QAC1D,MAAM,iBAAiB,GAAG,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAE/E,4BAA4B;QAC5B,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CACtC,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAC3D,CAAC;QAEF,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC;QAEnC,+DAA+D;QAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAE3C,2BAA2B;QAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAEpE,yCAAyC;QACzC,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAC3C,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,GAAG,CAAC,CACrC,CAAC,IAAI,EAAE,CAAC;QAET,uBAAuB;QACvB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;KAOf,CAAC,CAAC,GAAG,CACJ,aAAa,EACb,OAAO,EACP,SAAS,EACT,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EACxB,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,EAC1B,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,EAC1B,eAAe,EACf,iBAAiB,EACjB,UAAU,EACV,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,EAC5B,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,EAC1B,WAAW,EACX,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CACvB,CAAC;QAEF,+BAA+B;QAC/B,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,MAAM,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;QAE9E,MAAM,WAAW,GAAsB;YACrC,EAAE,EAAE,aAAa;YACjB,OAAO;YACP,SAAS;YACT,QAAQ;YACR,UAAU;YACV,UAAU;YACV,eAAe;YACf,iBAAiB;YACjB,UAAU;YACV,YAAY;YACZ,UAAU;YACV,WAAW,EAAE,WAAkB;YAC/B,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SAClC,CAAC;QAEF,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,iBAAiB,CAAC,aAAqB;QAIrC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC1B,gDAAgD,CACjD,CAAC,GAAG,CAAC,aAAa,CAAQ,CAAC;QAE5B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC;QAC7D,CAAC;QAED,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,wBAAwB;QACxB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACpD,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;QAEtD,IAAI,UAAU,CAAC,IAAI,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;QACtC,CAAC;QAED,qCAAqC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9E,IAAI,WAAW,KAAK,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,IAAI,CAAC,SAAS,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAChD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;QACzC,CAAC;QAED,6BAA6B;QAC7B,IAAI,IAAI,CAAC,gBAAgB,GAAG,GAAG,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;QAC1C,CAAC;QAED,OAAO;YACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;YAC1B,MAAM;SACP,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,aAAqB,EAAE,OAAe;QACrD,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAG3B,CAAC,CAAC,GAAG,CAAC,aAAa,EAAE,OAAO,CAAQ,CAAC;QAEtC,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,OAAO;YACL,OAAO,EAAE,GAAG,CAAC,QAAQ;YACrB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,cAAc,EAAE,GAAG,CAAC,eAAe;YACnC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC;SAC5C,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,WAAmB;QACtC,MAAM,OAAO,GAAuB,EAAE,CAAC;QACvC,IAAI,WAAW,GAAkB,WAAW,CAAC;QAE7C,OAAO,WAAW,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;OAE9B,CAAC,CAAC,GAAG,CAAC,WAAW,CAAQ,CAAC;YAE3B,IAAI,CAAC,MAAM;gBAAE,MAAM;YAEnB,OAAO,CAAC,IAAI,CAAC;gBACX,EAAE,EAAE,MAAM,CAAC,EAAE;gBACb,UAAU,EAAE,MAAM,CAAC,WAAW;gBAC9B,QAAQ,EAAE,MAAM,CAAC,SAAS;gBAC1B,WAAW,EAAE,MAAM,CAAC,YAAY;gBAChC,UAAU,EAAE,MAAM,CAAC,WAAW;gBAC9B,WAAW,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC9E,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS;aACpE,CAAC,CAAC;YAEH,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;QACnC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,aAAqB;QAQnC,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC7B,gDAAgD,CACjD,CAAC,GAAG,CAAC,aAAa,CAAQ,CAAC;QAE5B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,eAAe,aAAa,YAAY,CAAC,CAAC;QAC5D,CAAC;QAED,MAAM,WAAW,GAAsB;YACrC,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,OAAO,EAAE,OAAO,CAAC,QAAQ;YACzB,SAAS,EAAE,OAAO,CAAC,UAAU;YAC7B,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;YACvC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;YAC3C,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;YAC3C,eAAe,EAAE,OAAO,CAAC,gBAAgB;YACzC,iBAAiB,EAAE,OAAO,CAAC,kBAAkB;YAC7C,UAAU,EAAE,OAAO,CAAC,WAAW;YAC/B,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC;YAC/C,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;YAC3C,WAAW,EAAE,OAAO,CAAC,YAAY;YACjC,aAAa,EAAE,OAAO,CAAC,cAAc;YACrC,WAAW,EAAE,OAAO,CAAC,YAAY;YACjC,SAAS,EAAE,OAAO,CAAC,UAAU;SAC9B,CAAC;QAEF,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA8B,CAAC;QACtD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,YAAY,EAAE,CAAC;YAC5C,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,yBAAyB;QACzB,MAAM,KAAK,GAAuD,EAAE,CAAC;QACrE,MAAM,KAAK,GAAsD,EAAE,CAAC;QAEpE,uBAAuB;QACvB,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,aAAa;YACjB,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,gBAAgB,WAAW,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK;SACnE,CAAC,CAAC;QAEH,6BAA6B;QAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBAEzD,yBAAyB;gBACzB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;oBACtC,KAAK,CAAC,IAAI,CAAC;wBACT,EAAE,EAAE,MAAM;wBACV,IAAI,EAAE,MAAM,CAAC,UAAU;wBACvB,KAAK,EAAE,GAAG,MAAM,CAAC,UAAU,KAAK,MAAM,CAAC,QAAQ,EAAE;qBAClD,CAAC,CAAC;gBACL,CAAC;gBAED,4CAA4C;gBAC5C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,KAAK,CAAC,IAAI,CAAC;wBACT,IAAI,EAAE,aAAa;wBACnB,EAAE,EAAE,MAAM;wBACV,IAAI,EAAE,UAAU;qBACjB,CAAC,CAAC;gBACL,CAAC;gBAED,+BAA+B;gBAC/B,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC3B,MAAM,YAAY,GAAG,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;oBAC/E,KAAK,CAAC,IAAI,CAAC;wBACT,IAAI,EAAE,MAAM;wBACZ,EAAE,EAAE,YAAY;wBAChB,IAAI,EAAE,cAAc;qBACrB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,WAAW;YACX,OAAO;YACP,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE;SACxB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,aAAqB;QAUpC,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC7B,gDAAgD,CACjD,CAAC,GAAG,CAAC,aAAa,CAAQ,CAAC;QAE5B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,eAAe,aAAa,YAAY,CAAC,CAAC;QAC5D,CAAC;QAED,MAAM,WAAW,GAAsB;YACrC,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,OAAO,EAAE,OAAO,CAAC,QAAQ;YACzB,SAAS,EAAE,OAAO,CAAC,UAAU;YAC7B,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;YACvC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;YAC3C,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;YAC3C,eAAe,EAAE,OAAO,CAAC,gBAAgB;YACzC,iBAAiB,EAAE,OAAO,CAAC,kBAAkB;YAC7C,UAAU,EAAE,OAAO,CAAC,WAAW;YAC/B,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC;YAC/C,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;YAC3C,WAAW,EAAE,OAAO,CAAC,YAAY;YACjC,aAAa,EAAE,OAAO,CAAC,cAAc;YACrC,WAAW,EAAE,OAAO,CAAC,YAAY;YACjC,SAAS,EAAE,OAAO,CAAC,UAAU;SAC9B,CAAC;QAEF,qBAAqB;QACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAEhC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAU,CAAC;QAE/B,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,OAAO,EAAE,GAAG,CAAC,QAAQ;YACrB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,cAAc,EAAE,GAAG,CAAC,eAAe;YACnC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC;SAC5C,CAAC,CAAC,CAAC;QAEJ,iCAAiC;QACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAA8B,CAAC;QACzD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,YAAY,EAAE,CAAC;YAC5C,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,4BAA4B;QAC5B,MAAM,YAAY,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC;QAE1G,OAAO;YACL,WAAW;YACX,cAAc;YACd,UAAU;YACV,OAAO,EAAE;gBACP,YAAY,EAAE,WAAW,CAAC,iBAAiB;gBAC3C,UAAU,EAAE,WAAW,CAAC,eAAe;gBACvC,YAAY;aACb;SACF,CAAC;IACJ,CAAC;IAED,2EAA2E;IAC3E,yBAAyB;IACzB,2EAA2E;IAE3E;;;OAGG;IACK,wBAAwB,CAC9B,MAAiE,EACjE,YAAsB;QAEtB,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,+DAA+D;QAC/D,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/C,IAAI,SAAS,GAAQ,IAAI,CAAC;YAC1B,IAAI,YAAY,GAAG,CAAC,CAAC;YAErB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAClD,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CACxD,CAAC,MAAM,CAAC;gBAET,IAAI,QAAQ,GAAG,YAAY,EAAE,CAAC;oBAC5B,YAAY,GAAG,QAAQ,CAAC;oBACxB,SAAS,GAAG,KAAK,CAAC;gBACpB,CAAC;YACH,CAAC;YAED,IAAI,CAAC,SAAS;gBAAE,MAAM;YAEtB,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAE5B,8BAA8B;YAC9B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBACxC,IAAI,SAAS,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;oBAChE,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;YAED,wBAAwB;YACxB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,UAAoB,EAAE,YAAsB;QACxE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAE1C,qEAAqE;QACrE,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC;QACzE,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACjC,oBAAoB;YACpB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,OAAO,OAAO,CAAC,CAAC,CAAE,OAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CACrF,CAAC;QAEF,OAAO,SAAS,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IAChD,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,UAAkB,EAAE,QAAgB;QAChE,6BAA6B;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGhC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAQ,CAAC;QAEpC,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,QAAQ,CAAC,YAAY,CAAC;QAC/B,CAAC;QAED,wBAAwB;QACxB,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAE9D,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGf,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QAEpD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,qEAAqE;IAC7D,YAAY,CAAO;IACnB,UAAU,CAAO;IACjB,SAAS,CAAO;IAChB,SAAS,CAAO;IAExB;;OAEG;IACK,cAAc,CAAC,UAAkB,EAAE,QAAgB;QACzD,IAAI,OAAO,GAAG,EAAE,CAAC;QAEjB,QAAQ,UAAU,EAAE,CAAC;YACnB,KAAK,SAAS;gBACZ,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;oBACvB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC;gBACxF,CAAC;gBACD,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAQ,CAAC;gBACvD,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7D,MAAM;YACR,KAAK,OAAO;gBACV,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;oBACrB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC;gBAClF,CAAC;gBACD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAQ,CAAC;gBACnD,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrD,MAAM;YACR,KAAK,MAAM;gBACT,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;oBACpB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC;gBAC1E,CAAC;gBACD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAQ,CAAC;gBACjD,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChC,MAAM;YACR,KAAK,MAAM;gBACT,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;oBACpB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2DAA2D,CAAC,CAAC;gBAChG,CAAC;gBACD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAQ,CAAC;gBACjD,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzE,MAAM;QACV,CAAC;QAED,OAAO,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,MAAgB;QACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QAClC,CAAC;QAED,MAAM,IAAI,GAAe,CAAC,MAAM,CAAC,CAAC;QAElC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,SAAS,GAAa,EAAE,CAAC;YAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;oBACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7E,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,UAAgC,EAAE,SAAiB;QACxE,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,IAAI,KAAK,GAAG,SAAS,CAAC;QAEtB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YAChE,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;YAExD,IAAI,YAAY,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;gBACvC,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,YAAY,CAAC,YAAY,CAAC;oBAChC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM;iBACxC,CAAC,CAAC;YACL,CAAC;YAED,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,OAAe,EAAE,QAAkB;QAC/D,MAAM,IAAI,GAAG,GAAG,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QAC9D,OAAO,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAChE,CAAC;IAED;;OAEG;IACK,uBAAuB,CAC7B,aAAqB,EACrB,MAA8D,EAC9D,UAAoB,EACpB,YAAsB;QAEtB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAI5B,CAAC,CAAC;QAEH,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAClD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YACzD,MAAM,cAAc,GAAG,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC;YAE7E,MAAM,YAAY,GAAG;gBACnB,qBAAqB;gBACrB,WAAW,CAAC,CAAC,CAAC,6BAA6B,CAAC,CAAC,CAAC,qBAAqB;gBACnE,cAAc,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;aACpD,CAAC;YAEF,IAAI,CAAC,GAAG,CACN,aAAa,EACb,KAAK,CAAC,EAAE,EACR,KAAK,CAAC,IAAI,EACV,MAAM,EACN,cAAc,EACd,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAC7B,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,KAAwC,EACxC,YAAsB;QAEtB,IAAI,KAAK,CAAC,SAAS,GAAG,GAAG;YAAE,OAAO,gBAAgB,CAAC;QACnD,IAAI,KAAK,CAAC,SAAS,GAAG,GAAG;YAAE,OAAO,aAAa,CAAC;QAChD,IAAI,KAAK,CAAC,SAAS,GAAG,GAAG;YAAE,OAAO,cAAc,CAAC;QACjD,OAAO,YAAY,CAAC;IACtB,CAAC;CACF","sourcesContent":["/**\n * ExplainableRecall - Provenance and Justification for Memory Retrieval\n *\n * Every retrieval returns:\n * - Minimal hitting set of facts that justify the answer\n * - Merkle proof chain for provenance\n * - Policy compliance certificates\n *\n * Based on:\n * - Minimal hitting set algorithms\n * - Merkle tree provenance\n * - Explainable AI techniques\n *\n * v2.0.0-alpha.3 Features:\n * - GraphRoPE for hop-distance-aware graph queries (WASM)\n * - Rotary positional encoding based on graph structure\n * - Feature flag: ENABLE_GRAPH_ROPE (default: false)\n * - 100% backward compatible with fallback to standard retrieval\n */\n\n// Database type from db-fallback\ntype Database = any;\nimport * as crypto from 'crypto';\nimport { AttentionService, type GraphRoPEConfig } from '../utils/LegacyAttentionAdapter.js';\nimport { EmbeddingService } from './EmbeddingService.js';\n\n/**\n * Configuration for ExplainableRecall\n */\nexport interface ExplainableRecallConfig {\n  /** Enable GraphRoPE for hop-aware queries (default: false) */\n  ENABLE_GRAPH_ROPE?: boolean;\n  /** GraphRoPE configuration */\n  graphRoPEConfig?: Partial<GraphRoPEConfig>;\n}\n\nexport interface RecallCertificate {\n  id: string; // UUID\n  queryId: string;\n  queryText: string;\n\n  // Retrieved chunks\n  chunkIds: string[];\n  chunkTypes: string[];\n\n  // Justification\n  minimalWhy: string[]; // Minimal hitting set\n  redundancyRatio: number; // len(chunks) / len(minimalWhy)\n  completenessScore: number; // Fraction of requirements met\n\n  // Provenance\n  merkleRoot: string;\n  sourceHashes: string[];\n  proofChain: MerkleProof[];\n\n  // Policy\n  policyProof?: string;\n  policyVersion?: string;\n  accessLevel: 'public' | 'internal' | 'confidential' | 'restricted';\n\n  latencyMs?: number;\n  metadata?: Record<string, any>;\n}\n\nexport interface MerkleProof {\n  hash: string;\n  position: 'left' | 'right';\n}\n\nexport interface JustificationPath {\n  chunkId: string;\n  chunkType: string;\n  reason: 'semantic_match' | 'causal_link' | 'prerequisite' | 'constraint';\n  necessityScore: number; // 0-1\n  pathElements: string[]; // Reasoning chain\n}\n\nexport interface ProvenanceSource {\n  id?: number;\n  sourceType: 'episode' | 'skill' | 'note' | 'fact' | 'external';\n  sourceId: number;\n  contentHash: string;\n  parentHash?: string;\n  derivedFrom?: string[];\n  creator?: string;\n  metadata?: Record<string, any>;\n}\n\nexport class ExplainableRecall {\n  private db: Database;\n  private attentionService?: AttentionService;\n  private embedder?: EmbeddingService;\n  private config: ExplainableRecallConfig;\n\n  /**\n   * Constructor supports both v1 (legacy) and v2 (with GraphRoPE) modes\n   *\n   * v1 mode: new ExplainableRecall(db)\n   * v2 mode: new ExplainableRecall(db, embedder, config)\n   */\n  constructor(\n    db: Database,\n    embedder?: EmbeddingService,\n    config?: ExplainableRecallConfig\n  ) {\n    this.db = db;\n    this.embedder = embedder;\n    this.config = {\n      ENABLE_GRAPH_ROPE: false,\n      ...config,\n    };\n\n    // Initialize AttentionService if GraphRoPE enabled\n    if (embedder && this.config.ENABLE_GRAPH_ROPE) {\n      this.attentionService = new AttentionService(db, {\n        graphRoPE: {\n          enabled: true,\n          ...this.config.graphRoPEConfig,\n        },\n      });\n    }\n  }\n\n  /**\n   * Create a recall certificate for a retrieval operation\n   *\n   * v2: Uses GraphRoPE if enabled for hop-distance-aware justification scoring\n   * v1: Falls back to standard relevance-based justification\n   */\n  async createCertificate(params: {\n    queryId: string;\n    queryText: string;\n    chunks: Array<{ id: string; type: string; content: string; relevance: number }>;\n    requirements: string[]; // Query requirements\n    accessLevel?: string;\n    hopDistances?: number[][]; // Optional hop distances for GraphRoPE\n  }): Promise<RecallCertificate> {\n    const { queryId, queryText, chunks, requirements, accessLevel = 'internal' } = params;\n\n    const startTime = Date.now();\n\n    // 1. Compute minimal hitting set\n    const minimalWhy = this.computeMinimalHittingSet(chunks, requirements);\n\n    // 2. Calculate metrics\n    const redundancyRatio = chunks.length / minimalWhy.length;\n    const completenessScore = this.calculateCompleteness(minimalWhy, requirements);\n\n    // 3. Build provenance chain\n    const sourceHashes = chunks.map(chunk =>\n      this.getOrCreateProvenance(chunk.type, parseInt(chunk.id))\n    );\n\n    const merkleTree = this.buildMerkleTree(sourceHashes);\n    const merkleRoot = merkleTree.root;\n\n    // 4. Generate chunk metadata first (needed for certificate ID)\n    const chunkIds = chunks.map(c => c.id);\n    const chunkTypes = chunks.map(c => c.type);\n\n    // 5. Create certificate ID\n    const certificateId = this.generateCertificateId(queryId, chunkIds);\n\n    // 6. Generate proof chain for each chunk\n    const proofChain = chunks.map((chunk, idx) =>\n      this.getMerkleProof(merkleTree, idx)\n    ).flat();\n\n    // 7. Store certificate\n    this.db.prepare(`\n      INSERT INTO recall_certificates (\n        id, query_id, query_text, chunk_ids, chunk_types,\n        minimal_why, redundancy_ratio, completeness_score,\n        merkle_root, source_hashes, proof_chain,\n        access_level, latency_ms\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `).run(\n      certificateId,\n      queryId,\n      queryText,\n      JSON.stringify(chunkIds),\n      JSON.stringify(chunkTypes),\n      JSON.stringify(minimalWhy),\n      redundancyRatio,\n      completenessScore,\n      merkleRoot,\n      JSON.stringify(sourceHashes),\n      JSON.stringify(proofChain),\n      accessLevel,\n      Date.now() - startTime\n    );\n\n    // 7. Store justification paths\n    this.storeJustificationPaths(certificateId, chunks, minimalWhy, requirements);\n\n    const certificate: RecallCertificate = {\n      id: certificateId,\n      queryId,\n      queryText,\n      chunkIds,\n      chunkTypes,\n      minimalWhy,\n      redundancyRatio,\n      completenessScore,\n      merkleRoot,\n      sourceHashes,\n      proofChain,\n      accessLevel: accessLevel as any,\n      latencyMs: Date.now() - startTime\n    };\n\n    return certificate;\n  }\n\n  /**\n   * Verify a recall certificate\n   */\n  verifyCertificate(certificateId: string): {\n    valid: boolean;\n    issues: string[];\n  } {\n    const cert = this.db.prepare(\n      'SELECT * FROM recall_certificates WHERE id = ?'\n    ).get(certificateId) as any;\n\n    if (!cert) {\n      return { valid: false, issues: ['Certificate not found'] };\n    }\n\n    const issues: string[] = [];\n\n    // 1. Verify Merkle root\n    const sourceHashes = JSON.parse(cert.source_hashes);\n    const merkleTree = this.buildMerkleTree(sourceHashes);\n\n    if (merkleTree.root !== cert.merkle_root) {\n      issues.push('Merkle root mismatch');\n    }\n\n    // 2. Verify chunk hashes still match\n    const chunkIds = JSON.parse(cert.chunk_ids);\n    const chunkTypes = JSON.parse(cert.chunk_types);\n\n    for (let i = 0; i < chunkIds.length; i++) {\n      const currentHash = this.getContentHash(chunkTypes[i], parseInt(chunkIds[i]));\n      if (currentHash !== sourceHashes[i]) {\n        issues.push(`Chunk ${chunkIds[i]} hash changed`);\n      }\n    }\n\n    // 3. Verify completeness\n    const minimalWhy = JSON.parse(cert.minimal_why);\n    if (minimalWhy.length === 0) {\n      issues.push('Empty justification set');\n    }\n\n    // 4. Verify redundancy ratio\n    if (cert.redundancy_ratio < 1.0) {\n      issues.push('Invalid redundancy ratio');\n    }\n\n    return {\n      valid: issues.length === 0,\n      issues\n    };\n  }\n\n  /**\n   * Get justification for why a chunk was included\n   */\n  getJustification(certificateId: string, chunkId: string): JustificationPath | null {\n    const row = this.db.prepare(`\n      SELECT * FROM justification_paths\n      WHERE certificate_id = ? AND chunk_id = ?\n    `).get(certificateId, chunkId) as any;\n\n    if (!row) return null;\n\n    return {\n      chunkId: row.chunk_id,\n      chunkType: row.chunk_type,\n      reason: row.reason,\n      necessityScore: row.necessity_score,\n      pathElements: JSON.parse(row.path_elements)\n    };\n  }\n\n  /**\n   * Get provenance lineage for a source\n   */\n  getProvenanceLineage(contentHash: string): ProvenanceSource[] {\n    const lineage: ProvenanceSource[] = [];\n    let currentHash: string | null = contentHash;\n\n    while (currentHash) {\n      const source = this.db.prepare(`\n        SELECT * FROM provenance_sources WHERE content_hash = ?\n      `).get(currentHash) as any;\n\n      if (!source) break;\n\n      lineage.push({\n        id: source.id,\n        sourceType: source.source_type,\n        sourceId: source.source_id,\n        contentHash: source.content_hash,\n        parentHash: source.parent_hash,\n        derivedFrom: source.derived_from ? JSON.parse(source.derived_from) : undefined,\n        creator: source.creator,\n        metadata: source.metadata ? JSON.parse(source.metadata) : undefined\n      });\n\n      currentHash = source.parent_hash;\n    }\n\n    return lineage;\n  }\n\n  /**\n   * Trace provenance lineage for a certificate\n   * Returns full provenance chain from certificate to original sources\n   */\n  traceProvenance(certificateId: string): {\n    certificate: RecallCertificate;\n    sources: Map<string, ProvenanceSource[]>;\n    graph: {\n      nodes: Array<{ id: string; type: string; label: string }>;\n      edges: Array<{ from: string; to: string; type: string }>;\n    };\n  } {\n    const certRow = this.db.prepare(\n      'SELECT * FROM recall_certificates WHERE id = ?'\n    ).get(certificateId) as any;\n\n    if (!certRow) {\n      throw new Error(`Certificate ${certificateId} not found`);\n    }\n\n    const certificate: RecallCertificate = {\n      id: certRow.id,\n      queryId: certRow.query_id,\n      queryText: certRow.query_text,\n      chunkIds: JSON.parse(certRow.chunk_ids),\n      chunkTypes: JSON.parse(certRow.chunk_types),\n      minimalWhy: JSON.parse(certRow.minimal_why),\n      redundancyRatio: certRow.redundancy_ratio,\n      completenessScore: certRow.completeness_score,\n      merkleRoot: certRow.merkle_root,\n      sourceHashes: JSON.parse(certRow.source_hashes),\n      proofChain: JSON.parse(certRow.proof_chain),\n      policyProof: certRow.policy_proof,\n      policyVersion: certRow.policy_version,\n      accessLevel: certRow.access_level,\n      latencyMs: certRow.latency_ms\n    };\n\n    // Build provenance map for all sources\n    const sources = new Map<string, ProvenanceSource[]>();\n    for (const hash of certificate.sourceHashes) {\n      sources.set(hash, this.getProvenanceLineage(hash));\n    }\n\n    // Build provenance graph\n    const nodes: Array<{ id: string; type: string; label: string }> = [];\n    const edges: Array<{ from: string; to: string; type: string }> = [];\n\n    // Add certificate node\n    nodes.push({\n      id: certificateId,\n      type: 'certificate',\n      label: `Certificate: ${certificate.queryText.substring(0, 30)}...`\n    });\n\n    // Add source nodes and edges\n    for (const [hash, lineage] of sources.entries()) {\n      for (let i = 0; i < lineage.length; i++) {\n        const source = lineage[i];\n        const nodeId = `${source.sourceType}-${source.sourceId}`;\n\n        // Add node if not exists\n        if (!nodes.find(n => n.id === nodeId)) {\n          nodes.push({\n            id: nodeId,\n            type: source.sourceType,\n            label: `${source.sourceType} #${source.sourceId}`\n          });\n        }\n\n        // Add edge from certificate to first source\n        if (i === 0) {\n          edges.push({\n            from: certificateId,\n            to: nodeId,\n            type: 'includes'\n          });\n        }\n\n        // Add edge to parent if exists\n        if (i < lineage.length - 1) {\n          const parentNodeId = `${lineage[i + 1].sourceType}-${lineage[i + 1].sourceId}`;\n          edges.push({\n            from: nodeId,\n            to: parentNodeId,\n            type: 'derived_from'\n          });\n        }\n      }\n    }\n\n    return {\n      certificate,\n      sources,\n      graph: { nodes, edges }\n    };\n  }\n\n  /**\n   * Audit certificate access\n   */\n  auditCertificate(certificateId: string): {\n    certificate: RecallCertificate;\n    justifications: JustificationPath[];\n    provenance: Map<string, ProvenanceSource[]>;\n    quality: {\n      completeness: number;\n      redundancy: number;\n      avgNecessity: number;\n    };\n  } {\n    const certRow = this.db.prepare(\n      'SELECT * FROM recall_certificates WHERE id = ?'\n    ).get(certificateId) as any;\n\n    if (!certRow) {\n      throw new Error(`Certificate ${certificateId} not found`);\n    }\n\n    const certificate: RecallCertificate = {\n      id: certRow.id,\n      queryId: certRow.query_id,\n      queryText: certRow.query_text,\n      chunkIds: JSON.parse(certRow.chunk_ids),\n      chunkTypes: JSON.parse(certRow.chunk_types),\n      minimalWhy: JSON.parse(certRow.minimal_why),\n      redundancyRatio: certRow.redundancy_ratio,\n      completenessScore: certRow.completeness_score,\n      merkleRoot: certRow.merkle_root,\n      sourceHashes: JSON.parse(certRow.source_hashes),\n      proofChain: JSON.parse(certRow.proof_chain),\n      policyProof: certRow.policy_proof,\n      policyVersion: certRow.policy_version,\n      accessLevel: certRow.access_level,\n      latencyMs: certRow.latency_ms\n    };\n\n    // Get justifications\n    const justRows = this.db.prepare(`\n      SELECT * FROM justification_paths WHERE certificate_id = ?\n    `).all(certificateId) as any[];\n\n    const justifications = justRows.map(row => ({\n      chunkId: row.chunk_id,\n      chunkType: row.chunk_type,\n      reason: row.reason,\n      necessityScore: row.necessity_score,\n      pathElements: JSON.parse(row.path_elements)\n    }));\n\n    // Get provenance for each source\n    const provenance = new Map<string, ProvenanceSource[]>();\n    for (const hash of certificate.sourceHashes) {\n      provenance.set(hash, this.getProvenanceLineage(hash));\n    }\n\n    // Calculate quality metrics\n    const avgNecessity = justifications.reduce((sum, j) => sum + j.necessityScore, 0) / justifications.length;\n\n    return {\n      certificate,\n      justifications,\n      provenance,\n      quality: {\n        completeness: certificate.completenessScore,\n        redundancy: certificate.redundancyRatio,\n        avgNecessity\n      }\n    };\n  }\n\n  // ========================================================================\n  // Private Helper Methods\n  // ========================================================================\n\n  /**\n   * Compute minimal hitting set using greedy algorithm\n   * A hitting set contains at least one element from each requirement\n   */\n  private computeMinimalHittingSet(\n    chunks: Array<{ id: string; content: string; relevance: number }>,\n    requirements: string[]\n  ): string[] {\n    if (requirements.length === 0) {\n      return chunks.slice(0, Math.min(3, chunks.length)).map(c => c.id);\n    }\n\n    const uncovered = new Set(requirements);\n    const selected: string[] = [];\n\n    // Greedy: select chunk that covers most uncovered requirements\n    while (uncovered.size > 0 && chunks.length > 0) {\n      let bestChunk: any = null;\n      let bestCoverage = 0;\n\n      for (const chunk of chunks) {\n        const coverage = Array.from(uncovered).filter(req =>\n          chunk.content.toLowerCase().includes(req.toLowerCase())\n        ).length;\n\n        if (coverage > bestCoverage) {\n          bestCoverage = coverage;\n          bestChunk = chunk;\n        }\n      }\n\n      if (!bestChunk) break;\n\n      selected.push(bestChunk.id);\n\n      // Remove covered requirements\n      for (const req of Array.from(uncovered)) {\n        if (bestChunk.content.toLowerCase().includes(req.toLowerCase())) {\n          uncovered.delete(req);\n        }\n      }\n\n      // Remove selected chunk\n      chunks = chunks.filter(c => c.id !== bestChunk.id);\n    }\n\n    return selected;\n  }\n\n  /**\n   * Calculate completeness score\n   */\n  private calculateCompleteness(minimalWhy: string[], requirements: string[]): number {\n    if (requirements.length === 0) return 1.0;\n\n    // Prepare statement ONCE outside loop (better-sqlite3 best practice)\n    const stmt = this.db.prepare('SELECT output FROM episodes WHERE id = ?');\n    const chunks = minimalWhy.map(id => {\n      // Get chunk content\n      const episode = stmt.get(parseInt(id));\n      return episode ? (episode as any).output : '';\n    });\n\n    const satisfied = requirements.filter(req =>\n      chunks.some(content => content && content.toLowerCase().includes(req.toLowerCase()))\n    );\n\n    return satisfied.length / requirements.length;\n  }\n\n  /**\n   * Get or create provenance record\n   */\n  private getOrCreateProvenance(sourceType: string, sourceId: number): string {\n    // Check if provenance exists\n    const existing = this.db.prepare(`\n      SELECT content_hash FROM provenance_sources\n      WHERE source_type = ? AND source_id = ?\n    `).get(sourceType, sourceId) as any;\n\n    if (existing) {\n      return existing.content_hash;\n    }\n\n    // Create new provenance\n    const contentHash = this.getContentHash(sourceType, sourceId);\n\n    this.db.prepare(`\n      INSERT OR IGNORE INTO provenance_sources (source_type, source_id, content_hash, creator)\n      VALUES (?, ?, ?, ?)\n    `).run(sourceType, sourceId, contentHash, 'system');\n\n    return contentHash;\n  }\n\n  // Prepare statement ONCE outside loop (better-sqlite3 best practice)\n  private _episodeStmt?: any;\n  private _skillStmt?: any;\n  private _noteStmt?: any;\n  private _factStmt?: any;\n\n  /**\n   * Get content hash for a memory\n   */\n  private getContentHash(sourceType: string, sourceId: number): string {\n    let content = '';\n\n    switch (sourceType) {\n      case 'episode':\n        if (!this._episodeStmt) {\n          this._episodeStmt = this.db.prepare('SELECT task, output FROM episodes WHERE id = ?');\n        }\n        const episode = this._episodeStmt.get(sourceId) as any;\n        content = episode ? `${episode.task}:${episode.output}` : '';\n        break;\n      case 'skill':\n        if (!this._skillStmt) {\n          this._skillStmt = this.db.prepare('SELECT name, code FROM skills WHERE id = ?');\n        }\n        const skill = this._skillStmt.get(sourceId) as any;\n        content = skill ? `${skill.name}:${skill.code}` : '';\n        break;\n      case 'note':\n        if (!this._noteStmt) {\n          this._noteStmt = this.db.prepare('SELECT text FROM notes WHERE id = ?');\n        }\n        const note = this._noteStmt.get(sourceId) as any;\n        content = note ? note.text : '';\n        break;\n      case 'fact':\n        if (!this._factStmt) {\n          this._factStmt = this.db.prepare('SELECT subject, predicate, object FROM facts WHERE id = ?');\n        }\n        const fact = this._factStmt.get(sourceId) as any;\n        content = fact ? `${fact.subject}:${fact.predicate}:${fact.object}` : '';\n        break;\n    }\n\n    return crypto.createHash('sha256').update(content).digest('hex');\n  }\n\n  /**\n   * Build Merkle tree from hashes\n   */\n  private buildMerkleTree(hashes: string[]): { root: string; tree: string[][] } {\n    if (hashes.length === 0) {\n      return { root: '', tree: [[]] };\n    }\n\n    const tree: string[][] = [hashes];\n\n    while (tree[tree.length - 1].length > 1) {\n      const level = tree[tree.length - 1];\n      const nextLevel: string[] = [];\n\n      for (let i = 0; i < level.length; i += 2) {\n        if (i + 1 < level.length) {\n          const combined = level[i] + level[i + 1];\n          nextLevel.push(crypto.createHash('sha256').update(combined).digest('hex'));\n        } else {\n          nextLevel.push(level[i]);\n        }\n      }\n\n      tree.push(nextLevel);\n    }\n\n    return { root: tree[tree.length - 1][0], tree };\n  }\n\n  /**\n   * Get Merkle proof for a leaf\n   */\n  private getMerkleProof(merkleTree: { tree: string[][] }, leafIndex: number): MerkleProof[] {\n    const proof: MerkleProof[] = [];\n    let index = leafIndex;\n\n    for (let level = 0; level < merkleTree.tree.length - 1; level++) {\n      const currentLevel = merkleTree.tree[level];\n      const isLeftNode = index % 2 === 0;\n      const siblingIndex = isLeftNode ? index + 1 : index - 1;\n\n      if (siblingIndex < currentLevel.length) {\n        proof.push({\n          hash: currentLevel[siblingIndex],\n          position: isLeftNode ? 'right' : 'left'\n        });\n      }\n\n      index = Math.floor(index / 2);\n    }\n\n    return proof;\n  }\n\n  /**\n   * Generate certificate ID\n   */\n  private generateCertificateId(queryId: string, chunkIds: string[]): string {\n    const data = `${queryId}:${chunkIds.join(',')}:${Date.now()}`;\n    return crypto.createHash('sha256').update(data).digest('hex');\n  }\n\n  /**\n   * Store justification paths\n   */\n  private storeJustificationPaths(\n    certificateId: string,\n    chunks: Array<{ id: string; type: string; relevance: number }>,\n    minimalWhy: string[],\n    requirements: string[]\n  ): void {\n    const stmt = this.db.prepare(`\n      INSERT INTO justification_paths (\n        certificate_id, chunk_id, chunk_type, reason, necessity_score, path_elements\n      ) VALUES (?, ?, ?, ?, ?, ?)\n    `);\n\n    for (const chunk of chunks) {\n      const isNecessary = minimalWhy.includes(chunk.id);\n      const reason = this.determineReason(chunk, requirements);\n      const necessityScore = isNecessary ? chunk.relevance : chunk.relevance * 0.5;\n\n      const pathElements = [\n        `Retrieved for query`,\n        isNecessary ? `Essential for justification` : `Supporting evidence`,\n        `Relevance: ${(chunk.relevance * 100).toFixed(1)}%`\n      ];\n\n      stmt.run(\n        certificateId,\n        chunk.id,\n        chunk.type,\n        reason,\n        necessityScore,\n        JSON.stringify(pathElements)\n      );\n    }\n  }\n\n  /**\n   * Determine reason for inclusion\n   */\n  private determineReason(\n    chunk: { id: string; relevance: number },\n    requirements: string[]\n  ): string {\n    if (chunk.relevance > 0.9) return 'semantic_match';\n    if (chunk.relevance > 0.7) return 'causal_link';\n    if (chunk.relevance > 0.5) return 'prerequisite';\n    return 'constraint';\n  }\n}\n"]}