agentdb 3.0.0-alpha.10 → 3.0.0-alpha.12

package/dist/simulation/scenarios/strange-loops.js

@@ -1,133 +0,0 @@
-/**
- * Strange Loops Simulation
- *
- * Tests self-referential learning patterns using strange-loops concepts
- * Agents observe their own performance and adapt based on meta-cognitive feedback
- */
-import { createUnifiedDatabase } from '../../src/db-unified.js';
-import { ReflexionMemory } from '../../src/controllers/ReflexionMemory.js';
-import { CausalMemoryGraph } from '../../src/controllers/CausalMemoryGraph.js';
-import { EmbeddingService } from '../../src/controllers/EmbeddingService.js';
-import * as path from 'path';
-export default {
-    description: 'Self-referential learning with strange loops and meta-cognition',
-    async run(config) {
-        const { verbosity = 2, depth = 3 } = config;
-        if (verbosity >= 2) {
-            console.log(`   🔄 Initializing Strange Loops Simulation (depth=${depth})`);
-        }
-        // Initialize AgentDB
-        const embedder = new EmbeddingService({
-            model: 'Xenova/all-MiniLM-L6-v2',
-            dimension: 384,
-            provider: 'transformers'
-        });
-        await embedder.initialize();
-        const db = await createUnifiedDatabase(path.join(process.cwd(), 'simulation', 'data', 'strange-loops.graph'), embedder, { forceMode: 'graph' });
-        const reflexion = new ReflexionMemory(db.getGraphDatabase(), embedder, undefined, undefined, db.getGraphDatabase());
-        const causal = new CausalMemoryGraph(db.getGraphDatabase(), db.getGraphDatabase() // Pass graphBackend for GraphDatabaseAdapter support
-        );
-        const results = {
-            loops: 0,
-            metaLearnings: 0,
-            selfReferences: 0,
-            adaptations: 0,
-            totalTime: 0
-        };
-        const startTime = performance.now();
-        // Level 0: Base action
-        const baseActionId = await reflexion.storeEpisode({
-            sessionId: 'strange-loop',
-            task: 'perform base action',
-            reward: 0.70,
-            success: true,
-            input: 'Initial task',
-            output: 'Initial result',
-            critique: 'Can be improved'
-        });
-        results.loops++;
-        if (verbosity >= 3) {
-            console.log(`      🔹 Level 0: Base action (reward: 0.70)`);
-        }
-        // Strange loop: Each level observes and improves the previous level
-        let previousId = baseActionId;
-        let previousReward = 0.70;
-        for (let level = 1; level <= depth; level++) {
-            // Meta-observation: Observe previous level's performance
-            const metaObservation = await reflexion.storeEpisode({
-                sessionId: 'strange-loop',
-                task: `observe level ${level - 1} performance`,
-                reward: previousReward + 0.05, // Slight improvement from observation
-                success: true,
-                input: `Analyzing level ${level - 1}`,
-                output: `Identified improvement opportunities`,
-                critique: `Level ${level - 1} critique: reward ${previousReward.toFixed(2)}`
-            });
-            results.metaLearnings++;
-            // Self-reference: Create causal link back to previous level
-            await causal.addCausalEdge({
-                fromMemoryId: previousId,
-                fromMemoryType: 'episode',
-                toMemoryId: metaObservation,
-                toMemoryType: 'episode',
-                similarity: 0.90,
-                uplift: 0.05,
-                confidence: 0.85,
-                sampleSize: 100,
-                mechanism: `Meta-observation of level ${level - 1}`
-            });
-            results.selfReferences++;
-            // Adaptation: Apply learnings to create improved action
-            const improvedReward = Math.min(0.95, previousReward + 0.08);
-            const improvedActionId = await reflexion.storeEpisode({
-                sessionId: 'strange-loop',
-                task: `perform improved action at level ${level}`,
-                reward: improvedReward,
-                success: true,
-                input: `Enhanced task based on meta-observation`,
-                output: `Improved result`,
-                critique: `Applied learnings from level ${level - 1}`
-            });
-            results.adaptations++;
-            // Create causal link from meta-observation to improved action
-            await causal.addCausalEdge({
-                fromMemoryId: metaObservation,
-                fromMemoryType: 'episode',
-                toMemoryId: improvedActionId,
-                toMemoryType: 'episode',
-                similarity: 0.95,
-                uplift: 0.08,
-                confidence: 0.90,
-                sampleSize: 100,
-                mechanism: `Self-improvement through meta-cognition`
-            });
-            results.loops++;
-            if (verbosity >= 3) {
-                console.log(`      🔹 Level ${level}: Meta-observation + Adaptation (reward: ${improvedReward.toFixed(2)})`);
-            }
-            // The loop: Next iteration observes THIS level's performance
-            previousId = improvedActionId;
-            previousReward = improvedReward;
-        }
-        // Note: Causal chain querying requires full SQL migration
-        // For now, we track the strange loop structure through episode creation
-        if (verbosity >= 2) {
-            console.log(`      🔄 Strange Loop Structure: ${baseActionId} → ... → ${previousId}`);
-            console.log(`      📊 Loops: ${results.loops}`);
-            console.log(`      📊 Meta-learnings: ${results.metaLearnings}`);
-            console.log(`      📊 Self-references: ${results.selfReferences}`);
-            console.log(`      📊 Adaptations: ${results.adaptations}`);
-        }
-        if (verbosity >= 3) {
-            console.log(`      🔍 Reward Progression: 0.70 → ${previousReward.toFixed(2)} (+${((previousReward - 0.70) * 100).toFixed(1)}%)`);
-        }
-        const endTime = performance.now();
-        results.totalTime = endTime - startTime;
-        db.close();
-        if (verbosity >= 2) {
-            console.log(`      ⏱️  Duration: ${results.totalTime.toFixed(2)}ms`);
-        }
-        return results;
-    }
-};
-//# sourceMappingURL=strange-loops.js.map

package/dist/simulation/scenarios/strange-loops.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"strange-loops.js","sourceRoot":"","sources":["../../../simulation/scenarios/strange-loops.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,0CAA0C,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,MAAM,4CAA4C,CAAC;AAC/E,OAAO,EAAE,gBAAgB,EAAE,MAAM,2CAA2C,CAAC;AAC7E,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,eAAe;IACb,WAAW,EAAE,iEAAiE;IAE9E,KAAK,CAAC,GAAG,CAAC,MAAW;QACnB,MAAM,EAAE,SAAS,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC;QAE5C,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,sDAAsD,KAAK,GAAG,CAAC,CAAC;QAC9E,CAAC;QAED,qBAAqB;QACrB,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC;YACpC,KAAK,EAAE,yBAAyB;YAChC,SAAS,EAAE,GAAG;YACd,QAAQ,EAAE,cAAc;SACzB,CAAC,CAAC;QACH,MAAM,QAAQ,CAAC,UAAU,EAAE,CAAC;QAE5B,MAAM,EAAE,GAAG,MAAM,qBAAqB,CACpC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,qBAAqB,CAAC,EACrE,QAAQ,EACR,EAAE,SAAS,EAAE,OAAO,EAAE,CACvB,CAAC;QAEF,MAAM,SAAS,GAAG,IAAI,eAAe,CACnC,EAAE,CAAC,gBAAgB,EAAS,EAC5B,QAAQ,EACR,SAAS,EACT,SAAS,EACT,EAAE,CAAC,gBAAgB,EAAS,CAC7B,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAClC,EAAE,CAAC,gBAAgB,EAAS,EAC5B,EAAE,CAAC,gBAAgB,EAAS,CAAE,qDAAqD;SACpF,CAAC;QAEF,MAAM,OAAO,GAAG;YACd,KAAK,EAAE,CAAC;YACR,aAAa,EAAE,CAAC;YAChB,cAAc,EAAE,CAAC;YACjB,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC;SACb,CAAC;QAEF,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,uBAAuB;QACvB,MAAM,YAAY,GAAG,MAAM,SAAS,CAAC,YAAY,CAAC;YAChD,SAAS,EAAE,cAAc;YACzB,IAAI,EAAE,qBAAqB;YAC3B,MAAM,EAAE,IAAI;YACZ,OAAO,EAAE,IAAI;YACb,KAAK,EAAE,cAAc;YACrB,MAAM,EAAE,gBAAgB;YACxB,QAAQ,EAAE,iBAAiB;SAC5B,CAAC,CAAC;QAEH,OAAO,CAAC,KAAK,EAAE,CAAC;QAEhB,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,8CAA8C,CAAC,CAAC;QAC9D,CAAC;QAED,oEAAoE;QACpE,IAAI,UAAU,GAAG,YAAY,CAAC;QAC9B,IAAI,cAAc,GAAG,IAAI,CAAC;QAE1B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;YAC5C,yDAAyD;YACzD,MAAM,eAAe,GAAG,MAAM,SAAS,CAAC,YAAY,CAAC;gBACnD,SAAS,EAAE,cAAc;gBACzB,IAAI,EAAE,iBAAiB,KAAK,GAAG,CAAC,cAAc;gBAC9C,MAAM,EAAE,cAAc,GAAG,IAAI,EAAE,sCAAsC;gBACrE,OAAO,EAAE,IAAI;gBACb,KAAK,EAAE,mBAAmB,KAAK,GAAG,CAAC,EAAE;gBACrC,MAAM,EAAE,sCAAsC;gBAC9C,QAAQ,EAAE,SAAS,KAAK,GAAG,CAAC,qBAAqB,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;aAC7E,CAAC,CAAC;YAEH,OAAO,CAAC,aAAa,EAAE,CAAC;YAExB,4DAA4D;YAC5D,MAAM,MAAM,CAAC,aAAa,CAAC;gBACzB,YAAY,EAAE,UAAU;gBACxB,cAAc,EAAE,SAAS;gBACzB,UAAU,EAAE,eAAe;gBAC3B,YAAY,EAAE,SAAS;gBACvB,UAAU,EAAE,IAAI;gBAChB,MAAM,EAAE,IAAI;gBACZ,UAAU,EAAE,IAAI;gBAChB,UAAU,EAAE,GAAG;gBACf,SAAS,EAAE,6BAA6B,KAAK,GAAG,CAAC,EAAE;aACpD,CAAC,CAAC;YAEH,OAAO,CAAC,cAAc,EAAE,CAAC;YAEzB,wDAAwD;YACxD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,cAAc,GAAG,IAAI,CAAC,CAAC;YAC7D,MAAM,gBAAgB,GAAG,MAAM,SAAS,CAAC,YAAY,CAAC;gBACpD,SAAS,EAAE,cAAc;gBACzB,IAAI,EAAE,oCAAoC,KAAK,EAAE;gBACjD,MAAM,EAAE,cAAc;gBACtB,OAAO,EAAE,IAAI;gBACb,KAAK,EAAE,yCAAyC;gBAChD,MAAM,EAAE,iBAAiB;gBACzB,QAAQ,EAAE,gCAAgC,KAAK,GAAG,CAAC,EAAE;aACtD,CAAC,CAAC;YAEH,OAAO,CAAC,WAAW,EAAE,CAAC;YAEtB,8DAA8D;YAC9D,MAAM,MAAM,CAAC,aAAa,CAAC;gBACzB,YAAY,EAAE,eAAe;gBAC7B,cAAc,EAAE,SAAS;gBACzB,UAAU,EAAE,gBAAgB;gBAC5B,YAAY,EAAE,SAAS;gBACvB,UAAU,EAAE,IAAI;gBAChB,MAAM,EAAE,IAAI;gBACZ,UAAU,EAAE,IAAI;gBAChB,UAAU,EAAE,GAAG;gBACf,SAAS,EAAE,yCAAyC;aACrD,CAAC,CAAC;YAEH,OAAO,CAAC,KAAK,EAAE,CAAC;YAEhB,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;gBACnB,OAAO,CAAC,GAAG,CAAC,kBAAkB,KAAK,4CAA4C,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/G,CAAC;YAED,6DAA6D;YAC7D,UAAU,GAAG,gBAAgB,CAAC;YAC9B,cAAc,GAAG,cAAc,CAAC;QAClC,CAAC;QAED,0DAA0D;QAC1D,wEAAwE;QAExE,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,oCAAoC,YAAY,YAAY,UAAU,EAAE,CAAC,CAAC;YACtF,OAAO,CAAC,GAAG,CAAC,mBAAmB,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;YAChD,OAAO,CAAC,GAAG,CAAC,4BAA4B,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;YACjE,OAAO,CAAC,GAAG,CAAC,6BAA6B,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;YACnE,OAAO,CAAC,GAAG,CAAC,yBAAyB,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QAC9D,CAAC;QAED,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,uCAAuC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACpI,CAAC;QAED,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAClC,OAAO,CAAC,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;QAExC,EAAE,CAAC,KAAK,EAAE,CAAC;QAEX,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,uBAAuB,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACvE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF,CAAC"}

package/dist/simulation/scenarios/sublinear-solver.d.ts

@@ -1,22 +0,0 @@
-/**
- * Sublinear-Time-Solver Integration
- *
- * O(log n) query optimization with sublinear-time-solver package
- *
- * Dedicated vector DB optimized for:
- * - Logarithmic search complexity
- * - HNSW indexing
- * - Approximate nearest neighbor (ANN) queries
- */
-declare const _default: {
-    description: string;
-    run(config: any): Promise<{
-        insertions: number;
-        queries: number;
-        avgQueryTime: number;
-        complexity: string;
-        totalTime: number;
-    }>;
-};
-export default _default;
-//# sourceMappingURL=sublinear-solver.d.ts.map

package/dist/simulation/scenarios/sublinear-solver.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sublinear-solver.d.ts","sourceRoot":"","sources":["../../../simulation/scenarios/sublinear-solver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;;;gBAUiB,GAAG;;;;;;;;AAHvB,wBA2FE"}

package/dist/simulation/scenarios/sublinear-solver.js

@@ -1,82 +0,0 @@
-/**
- * Sublinear-Time-Solver Integration
- *
- * O(log n) query optimization with sublinear-time-solver package
- *
- * Dedicated vector DB optimized for:
- * - Logarithmic search complexity
- * - HNSW indexing
- * - Approximate nearest neighbor (ANN) queries
- */
-import { createUnifiedDatabase } from '../../src/db-unified.js';
-import { ReflexionMemory } from '../../src/controllers/ReflexionMemory.js';
-import { EmbeddingService } from '../../src/controllers/EmbeddingService.js';
-import * as path from 'path';
-export default {
-    description: 'Sublinear-time O(log n) solver with optimized vector search',
-    async run(config) {
-        const { verbosity = 2, dataSize = 1000 } = config;
-        if (verbosity >= 2) {
-            console.log(`   ⚡ Initializing Sublinear-Time Solver (n=${dataSize})`);
-        }
-        // Initialize optimized vector database for O(log n) queries
-        const embedder = new EmbeddingService({
-            model: 'Xenova/all-MiniLM-L6-v2',
-            dimension: 384,
-            provider: 'transformers'
-        });
-        await embedder.initialize();
-        const db = await createUnifiedDatabase(path.join(process.cwd(), 'simulation', 'data', 'advanced', 'sublinear.graph'), embedder, {
-            forceMode: 'graph'
-        });
-        const reflexion = new ReflexionMemory(db.getGraphDatabase(), embedder, undefined, undefined, db.getGraphDatabase());
-        const results = {
-            insertions: 0,
-            queries: 0,
-            avgQueryTime: 0,
-            complexity: 'O(log n)',
-            totalTime: 0
-        };
-        const startTime = performance.now();
-        // Insert data points
-        const insertStart = performance.now();
-        for (let i = 0; i < Math.min(dataSize, 100); i++) { // Limit for simulation speed
-            await reflexion.storeEpisode({
-                sessionId: 'sublinear-solver',
-                task: `data_point_${i}`,
-                reward: Math.random(),
-                success: true,
-                input: `vector_${i}`,
-                output: `result_${i}`
-            });
-            results.insertions++;
-        }
-        const insertEnd = performance.now();
-        // Perform logarithmic-time queries
-        const queries = 10;
-        const queryTimes = [];
-        for (let i = 0; i < queries; i++) {
-            const queryStart = performance.now();
-            await reflexion.retrieveRelevant({
-                task: `query_${i}`,
-                k: 5 // O(log n) nearest neighbor search
-            });
-            const queryEnd = performance.now();
-            queryTimes.push(queryEnd - queryStart);
-            results.queries++;
-        }
-        results.avgQueryTime = queryTimes.reduce((a, b) => a + b, 0) / queryTimes.length;
-        const endTime = performance.now();
-        results.totalTime = endTime - startTime;
-        db.close();
-        if (verbosity >= 2) {
-            console.log(`      📊 Data Points Inserted: ${results.insertions}`);
-            console.log(`      📊 Queries Executed: ${results.queries}`);
-            console.log(`      📊 Avg Query Time: ${results.avgQueryTime.toFixed(3)}ms (${results.complexity})`);
-            console.log(`      📊 Insert Time: ${(insertEnd - insertStart).toFixed(2)}ms`);
-            console.log(`      ⏱️  Total Duration: ${results.totalTime.toFixed(2)}ms`);
-        }
-        return results;
-    }
-};
-//# sourceMappingURL=sublinear-solver.js.map

package/dist/simulation/scenarios/sublinear-solver.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sublinear-solver.js","sourceRoot":"","sources":["../../../simulation/scenarios/sublinear-solver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,0CAA0C,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAE,MAAM,2CAA2C,CAAC;AAC7E,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,eAAe;IACb,WAAW,EAAE,6DAA6D;IAE1E,KAAK,CAAC,GAAG,CAAC,MAAW;QACnB,MAAM,EAAE,SAAS,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC;QAElD,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,8CAA8C,QAAQ,GAAG,CAAC,CAAC;QACzE,CAAC;QAED,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC;YACpC,KAAK,EAAE,yBAAyB;YAChC,SAAS,EAAE,GAAG;YACd,QAAQ,EAAE,cAAc;SACzB,CAAC,CAAC;QACH,MAAM,QAAQ,CAAC,UAAU,EAAE,CAAC;QAE5B,MAAM,EAAE,GAAG,MAAM,qBAAqB,CACpC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,iBAAiB,CAAC,EAC7E,QAAQ,EACR;YACE,SAAS,EAAE,OAAO;SACnB,CACF,CAAC;QAEF,MAAM,SAAS,GAAG,IAAI,eAAe,CACnC,EAAE,CAAC,gBAAgB,EAAS,EAC5B,QAAQ,EACR,SAAS,EACT,SAAS,EACT,EAAE,CAAC,gBAAgB,EAAS,CAC7B,CAAC;QAEF,MAAM,OAAO,GAAG;YACd,UAAU,EAAE,CAAC;YACb,OAAO,EAAE,CAAC;YACV,YAAY,EAAE,CAAC;YACf,UAAU,EAAE,UAAU;YACtB,SAAS,EAAE,CAAC;SACb,CAAC;QAEF,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,qBAAqB;QACrB,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAE,6BAA6B;YAChF,MAAM,SAAS,CAAC,YAAY,CAAC;gBAC3B,SAAS,EAAE,kBAAkB;gBAC7B,IAAI,EAAE,cAAc,CAAC,EAAE;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE;gBACrB,OAAO,EAAE,IAAI;gBACb,KAAK,EAAE,UAAU,CAAC,EAAE;gBACpB,MAAM,EAAE,UAAU,CAAC,EAAE;aACtB,CAAC,CAAC;YACH,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,CAAC;QACD,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,mCAAmC;QACnC,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YACrC,MAAM,SAAS,CAAC,gBAAgB,CAAC;gBAC/B,IAAI,EAAE,SAAS,CAAC,EAAE;gBAClB,CAAC,EAAE,CAAC,CAAE,mCAAmC;aAC1C,CAAC,CAAC;YACH,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YACnC,UAAU,CAAC,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,CAAC;YACvC,OAAO,CAAC,OAAO,EAAE,CAAC;QACpB,CAAC;QAED,OAAO,CAAC,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;QAEjF,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAClC,OAAO,CAAC,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;QAExC,EAAE,CAAC,KAAK,EAAE,CAAC;QAEX,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,kCAAkC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YACpE,OAAO,CAAC,GAAG,CAAC,8BAA8B,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;YAC7D,OAAO,CAAC,GAAG,CAAC,4BAA4B,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;YACrG,OAAO,CAAC,GAAG,CAAC,yBAAyB,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/E,OAAO,CAAC,GAAG,CAAC,6BAA6B,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7E,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF,CAAC"}

package/dist/simulation/scenarios/temporal-lead-solver.d.ts

@@ -1,23 +0,0 @@
-/**
- * Temporal-Lead-Solver Integration
- *
- * Time-series graph database with temporal indices
- * Integration with temporal-lead-solver package
- *
- * Optimized for:
- * - Temporal causality detection
- * - Time-series pattern matching
- * - Lead-lag relationships
- */
-declare const _default: {
-    description: string;
-    run(config: any): Promise<{
-        timeSeriesPoints: number;
-        leadLagPairs: number;
-        temporalCausalEdges: number;
-        avgLagTime: number;
-        totalTime: number;
-    }>;
-};
-export default _default;
-//# sourceMappingURL=temporal-lead-solver.d.ts.map

package/dist/simulation/scenarios/temporal-lead-solver.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"temporal-lead-solver.d.ts","sourceRoot":"","sources":["../../../simulation/scenarios/temporal-lead-solver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;;;gBAWiB,GAAG;;;;;;;;AAHvB,wBAsGE"}

package/dist/simulation/scenarios/temporal-lead-solver.js

@@ -1,90 +0,0 @@
-/**
- * Temporal-Lead-Solver Integration
- *
- * Time-series graph database with temporal indices
- * Integration with temporal-lead-solver package
- *
- * Optimized for:
- * - Temporal causality detection
- * - Time-series pattern matching
- * - Lead-lag relationships
- */
-import { createUnifiedDatabase } from '../../src/db-unified.js';
-import { ReflexionMemory } from '../../src/controllers/ReflexionMemory.js';
-import { CausalMemoryGraph } from '../../src/controllers/CausalMemoryGraph.js';
-import { EmbeddingService } from '../../src/controllers/EmbeddingService.js';
-import * as path from 'path';
-export default {
-    description: 'Temporal-lead solver with time-series graph database',
-    async run(config) {
-        const { verbosity = 2, timeSteps = 20 } = config;
-        if (verbosity >= 2) {
-            console.log(`   ⏰ Initializing Temporal-Lead Solver (T=${timeSteps})`);
-        }
-        // Initialize temporal graph database
-        const embedder = new EmbeddingService({
-            model: 'Xenova/all-MiniLM-L6-v2',
-            dimension: 384,
-            provider: 'transformers'
-        });
-        await embedder.initialize();
-        const db = await createUnifiedDatabase(path.join(process.cwd(), 'simulation', 'data', 'advanced', 'temporal.graph'), embedder, { forceMode: 'graph' });
-        const reflexion = new ReflexionMemory(db.getGraphDatabase(), embedder, undefined, undefined, db.getGraphDatabase());
-        const causal = new CausalMemoryGraph(db.getGraphDatabase(), db.getGraphDatabase());
-        const results = {
-            timeSeriesPoints: 0,
-            leadLagPairs: 0,
-            temporalCausalEdges: 0,
-            avgLagTime: 0,
-            totalTime: 0
-        };
-        const startTime = performance.now();
-        // Create time-series events
-        const episodeIds = [];
-        for (let t = 0; t < timeSteps; t++) {
-            const id = await reflexion.storeEpisode({
-                sessionId: 'temporal-series',
-                task: `event_at_t${t}`,
-                reward: 0.5 + 0.5 * Math.sin(t * 0.3), // Sinusoidal pattern
-                success: true,
-                input: `timestamp_${t}`,
-                output: `value_${(0.5 + 0.5 * Math.sin(t * 0.3)).toFixed(2)}`
-            });
-            episodeIds.push(id);
-            results.timeSeriesPoints++;
-        }
-        // Detect lead-lag relationships (event at t leads to event at t+k)
-        const lagDuration = 3;
-        for (let t = 0; t < timeSteps - lagDuration; t++) {
-            const leadId = episodeIds[t];
-            const lagId = episodeIds[t + lagDuration];
-            await causal.addCausalEdge({
-                fromMemoryId: leadId,
-                fromMemoryType: 'episode',
-                toMemoryId: lagId,
-                toMemoryType: 'episode',
-                similarity: 0.85,
-                uplift: 0.15,
-                confidence: 0.90,
-                sampleSize: 100,
-                mechanism: `temporal_lead_lag_${lagDuration}`
-            });
-            results.leadLagPairs++;
-            results.temporalCausalEdges++;
-            results.avgLagTime += lagDuration;
-        }
-        results.avgLagTime /= results.leadLagPairs || 1;
-        const endTime = performance.now();
-        results.totalTime = endTime - startTime;
-        db.close();
-        if (verbosity >= 2) {
-            console.log(`      📊 Time-Series Points: ${results.timeSeriesPoints}`);
-            console.log(`      📊 Lead-Lag Pairs: ${results.leadLagPairs}`);
-            console.log(`      📊 Temporal Causal Edges: ${results.temporalCausalEdges}`);
-            console.log(`      📊 Avg Lag Time: ${results.avgLagTime.toFixed(1)} steps`);
-            console.log(`      ⏱️  Duration: ${results.totalTime.toFixed(2)}ms`);
-        }
-        return results;
-    }
-};
-//# sourceMappingURL=temporal-lead-solver.js.map

package/dist/simulation/scenarios/temporal-lead-solver.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"temporal-lead-solver.js","sourceRoot":"","sources":["../../../simulation/scenarios/temporal-lead-solver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,0CAA0C,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,MAAM,4CAA4C,CAAC;AAC/E,OAAO,EAAE,gBAAgB,EAAE,MAAM,2CAA2C,CAAC;AAC7E,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,eAAe;IACb,WAAW,EAAE,sDAAsD;IAEnE,KAAK,CAAC,GAAG,CAAC,MAAW;QACnB,MAAM,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,EAAE,EAAE,GAAG,MAAM,CAAC;QAEjD,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,6CAA6C,SAAS,GAAG,CAAC,CAAC;QACzE,CAAC;QAED,qCAAqC;QACrC,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC;YACpC,KAAK,EAAE,yBAAyB;YAChC,SAAS,EAAE,GAAG;YACd,QAAQ,EAAE,cAAc;SACzB,CAAC,CAAC;QACH,MAAM,QAAQ,CAAC,UAAU,EAAE,CAAC;QAE5B,MAAM,EAAE,GAAG,MAAM,qBAAqB,CACpC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,gBAAgB,CAAC,EAC5E,QAAQ,EACR,EAAE,SAAS,EAAE,OAAO,EAAE,CACvB,CAAC;QAEF,MAAM,SAAS,GAAG,IAAI,eAAe,CACnC,EAAE,CAAC,gBAAgB,EAAS,EAC5B,QAAQ,EACR,SAAS,EACT,SAAS,EACT,EAAE,CAAC,gBAAgB,EAAS,CAC7B,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAClC,EAAE,CAAC,gBAAgB,EAAS,EAC5B,EAAE,CAAC,gBAAgB,EAAS,CAC7B,CAAC;QAEF,MAAM,OAAO,GAAG;YACd,gBAAgB,EAAE,CAAC;YACnB,YAAY,EAAE,CAAC;YACf,mBAAmB,EAAE,CAAC;YACtB,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,CAAC;SACb,CAAC;QAEF,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,4BAA4B;QAC5B,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,MAAM,SAAS,CAAC,YAAY,CAAC;gBACtC,SAAS,EAAE,iBAAiB;gBAC5B,IAAI,EAAE,aAAa,CAAC,EAAE;gBACtB,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAG,qBAAqB;gBAC7D,OAAO,EAAE,IAAI;gBACb,KAAK,EAAE,aAAa,CAAC,EAAE;gBACvB,MAAM,EAAE,SAAS,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;aAC9D,CAAC,CAAC;YACH,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpB,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC7B,CAAC;QAED,mEAAmE;QACnE,MAAM,WAAW,GAAG,CAAC,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;YAE1C,MAAM,MAAM,CAAC,aAAa,CAAC;gBACzB,YAAY,EAAE,MAAM;gBACpB,cAAc,EAAE,SAAS;gBACzB,UAAU,EAAE,KAAK;gBACjB,YAAY,EAAE,SAAS;gBACvB,UAAU,EAAE,IAAI;gBAChB,MAAM,EAAE,IAAI;gBACZ,UAAU,EAAE,IAAI;gBAChB,UAAU,EAAE,GAAG;gBACf,SAAS,EAAE,qBAAqB,WAAW,EAAE;aAC9C,CAAC,CAAC;YAEH,OAAO,CAAC,YAAY,EAAE,CAAC;YACvB,OAAO,CAAC,mBAAmB,EAAE,CAAC;YAC9B,OAAO,CAAC,UAAU,IAAI,WAAW,CAAC;QACpC,CAAC;QAED,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC;QAEhD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAClC,OAAO,CAAC,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;QAExC,EAAE,CAAC,KAAK,EAAE,CAAC;QAEX,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,gCAAgC,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;YACxE,OAAO,CAAC,GAAG,CAAC,4BAA4B,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;YAChE,OAAO,CAAC,GAAG,CAAC,mCAAmC,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAAC;YAC9E,OAAO,CAAC,GAAG,CAAC,0BAA0B,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC7E,OAAO,CAAC,GAAG,CAAC,uBAAuB,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACvE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF,CAAC"}

package/dist/simulation/scenarios/voting-system-consensus.d.ts

@@ -1,27 +0,0 @@
-/**
- * Voting System Consensus Simulation
- *
- * Models a multi-agent democratic voting system with:
- * - Ranked-choice voting (RCV) algorithms
- * - Voter preference aggregation
- * - Coalition formation dynamics
- * - Strategic voting detection
- * - Consensus emergence patterns
- *
- * Tests AgentDB's ability to handle complex multi-agent decision-making
- * and preference learning across voting cycles.
- */
-declare const _default: {
-    description: string;
-    run(config: any): Promise<{
-        rounds: number;
-        totalVotes: number;
-        coalitionsFormed: number;
-        consensusEvolution: number[];
-        strategicVotingDetected: number;
-        avgPreferenceShift: number;
-        totalTime: number;
-    }>;
-};
-export default _default;
-//# sourceMappingURL=voting-system-consensus.d.ts.map

package/dist/simulation/scenarios/voting-system-consensus.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"voting-system-consensus.d.ts","sourceRoot":"","sources":["../../../simulation/scenarios/voting-system-consensus.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;;;gBAgCiB,GAAG;;;;4BAmCS,MAAM,EAAE;;;;;;AAtCxC,wBAiNE"}

package/dist/simulation/scenarios/voting-system-consensus.js

@@ -1,175 +0,0 @@
-/**
- * Voting System Consensus Simulation
- *
- * Models a multi-agent democratic voting system with:
- * - Ranked-choice voting (RCV) algorithms
- * - Voter preference aggregation
- * - Coalition formation dynamics
- * - Strategic voting detection
- * - Consensus emergence patterns
- *
- * Tests AgentDB's ability to handle complex multi-agent decision-making
- * and preference learning across voting cycles.
- */
-import { createUnifiedDatabase } from '../../src/db-unified.js';
-import { ReflexionMemory } from '../../src/controllers/ReflexionMemory.js';
-import { EmbeddingService } from '../../src/controllers/EmbeddingService.js';
-import { PerformanceOptimizer } from '../utils/PerformanceOptimizer.js';
-import * as path from 'path';
-export default {
-    description: 'Democratic voting system with ranked-choice, coalition formation, and consensus emergence',
-    async run(config) {
-        const { verbosity = 2, rounds = 5, voterCount = 50, candidateCount = 7 } = config;
-        if (verbosity >= 2) {
-            console.log(`   🗳️  Initializing Voting System: ${voterCount} voters, ${candidateCount} candidates, ${rounds} rounds`);
-        }
-        // Initialize performance optimizer
-        const optimizer = new PerformanceOptimizer({ batchSize: 50 });
-        const embedder = new EmbeddingService({
-            model: 'Xenova/all-MiniLM-L6-v2',
-            dimension: 384,
-            provider: 'transformers'
-        });
-        await embedder.initialize();
-        const db = await createUnifiedDatabase(path.join(process.cwd(), 'simulation', 'data', 'voting-consensus.graph'), embedder, { forceMode: 'graph' });
-        const reflexion = new ReflexionMemory(db.getGraphDatabase(), embedder, undefined, undefined, db.getGraphDatabase());
-        const results = {
-            rounds: 0,
-            totalVotes: 0,
-            coalitionsFormed: 0,
-            consensusEvolution: [],
-            strategicVotingDetected: 0,
-            avgPreferenceShift: 0,
-            totalTime: 0
-        };
-        const startTime = performance.now();
-        // Initialize voters with random ideologies
-        const voters = Array.from({ length: voterCount }, (_, i) => ({
-            id: `voter-${i}`,
-            ideologyVector: Array.from({ length: 5 }, () => Math.random() * 2 - 1), // -1 to 1
-            voteHistory: []
-        }));
-        // Run voting rounds
-        for (let round = 0; round < rounds; round++) {
-            // Generate candidates with platforms
-            const candidates = Array.from({ length: candidateCount }, (_, i) => ({
-                id: `candidate-R${round}-${i}`,
-                platform: Array.from({ length: 5 }, () => Math.random() * 2 - 1),
-                endorsements: []
-            }));
-            // Each voter ranks candidates by preference (euclidean distance in ideology space)
-            const ballots = new Map();
-            for (const voter of voters) {
-                // Calculate distance to each candidate
-                const preferences = candidates.map(candidate => {
-                    const distance = Math.sqrt(voter.ideologyVector.reduce((sum, val, idx) => sum + Math.pow(val - candidate.platform[idx], 2), 0));
-                    return { candidateId: candidate.id, distance };
-                });
-                // Sort by closest (lowest distance) = highest preference
-                preferences.sort((a, b) => a.distance - b.distance);
-                ballots.set(voter.id, preferences.map(p => p.candidateId));
-            }
-            // Ranked-Choice Voting algorithm
-            const eliminated = new Set();
-            let winner = null;
-            let voteCounts = new Map();
-            while (!winner && eliminated.size < candidates.length - 1) {
-                voteCounts.clear();
-                // Count first-choice votes (excluding eliminated)
-                for (const [voterId, ranked] of ballots.entries()) {
-                    const firstChoice = ranked.find(c => !eliminated.has(c));
-                    if (firstChoice) {
-                        voteCounts.set(firstChoice, (voteCounts.get(firstChoice) || 0) + 1);
-                    }
-                }
-                // Check for majority winner (>50%)
-                const majority = voterCount / 2;
-                for (const [candidateId, count] of voteCounts.entries()) {
-                    if (count > majority) {
-                        winner = candidateId;
-                        break;
-                    }
-                }
-                if (!winner) {
-                    // Eliminate candidate with fewest votes
-                    let minVotes = Infinity;
-                    let toEliminate = '';
-                    for (const [candidateId, count] of voteCounts.entries()) {
-                        if (count < minVotes) {
-                            minVotes = count;
-                            toEliminate = candidateId;
-                        }
-                    }
-                    eliminated.add(toEliminate);
-                }
-            }
-            if (!winner) {
-                winner = candidates.find(c => !eliminated.has(c.id)).id;
-            }
-            // Calculate consensus score (how concentrated the final vote was)
-            const winnerVotes = voteCounts.get(winner) || 0;
-            const consensusScore = winnerVotes / voterCount;
-            results.consensusEvolution.push(consensusScore);
-            // Voters learn from outcomes - OPTIMIZED: Batch database operations
-            const winningCandidate = candidates.find(c => c.id === winner);
-            // Queue all episode storage operations
-            for (let i = 0; i < Math.min(10, voters.length); i++) {
-                const voter = voters[i];
-                optimizer.queueOperation(async () => {
-                    return reflexion.storeEpisode({
-                        sessionId: `round-${round}`,
-                        task: `vote in election round ${round}`,
-                        input: `Voter ideology: ${voter.ideologyVector.join(',')}`,
-                        output: `Voted for: ${ballots.get(voter.id)?.[0]}, Winner: ${winner}`,
-                        reward: consensusScore,
-                        success: ballots.get(voter.id)?.[0] === winner,
-                        critique: `Consensus: ${(consensusScore * 100).toFixed(1)}%`,
-                        metadata: {
-                            voterIdeology: voter.ideologyVector,
-                            winnerPlatform: winningCandidate.platform,
-                            roundNumber: round
-                        }
-                    });
-                });
-            }
-            // Execute batch operation
-            await optimizer.executeBatch();
-            // Detect coalitions (clusters of voters with similar preferences)
-            const coalitionThreshold = 0.3;
-            let coalitions = 0;
-            for (let i = 0; i < voters.length; i++) {
-                for (let j = i + 1; j < voters.length; j++) {
-                    const distance = Math.sqrt(voters[i].ideologyVector.reduce((sum, val, idx) => sum + Math.pow(val - voters[j].ideologyVector[idx], 2), 0));
-                    if (distance < coalitionThreshold) {
-                        coalitions++;
-                    }
-                }
-            }
-            results.coalitionsFormed += coalitions;
-            results.rounds++;
-            results.totalVotes += voterCount;
-            if (verbosity >= 3) {
-                console.log(`      🗳️  Round ${round + 1}: Winner ${winner}, Consensus ${(consensusScore * 100).toFixed(1)}%, Coalitions: ${coalitions}`);
-            }
-        }
-        const endTime = performance.now();
-        results.totalTime = endTime - startTime;
-        // Analyze consensus evolution
-        const initialConsensus = results.consensusEvolution[0];
-        const finalConsensus = results.consensusEvolution[results.consensusEvolution.length - 1];
-        results.avgPreferenceShift = finalConsensus - initialConsensus;
-        db.close();
-        // Get optimization metrics
-        const optimizerMetrics = optimizer.getMetrics();
-        if (verbosity >= 2) {
-            console.log(`      📊 Rounds: ${results.rounds}`);
-            console.log(`      📊 Total Votes: ${results.totalVotes}`);
-            console.log(`      📊 Coalitions Formed: ${results.coalitionsFormed}`);
-            console.log(`      📊 Consensus Evolution: ${initialConsensus.toFixed(2)} → ${finalConsensus.toFixed(2)} (${results.avgPreferenceShift > 0 ? '+' : ''}${(results.avgPreferenceShift * 100).toFixed(1)}%)`);
-            console.log(`      ⏱️  Duration: ${results.totalTime.toFixed(2)}ms`);
-            console.log(`      ⚡ Optimization: ${optimizerMetrics.batchOperations} batches, ${optimizerMetrics.avgLatency} avg`);
-        }
-        return results;
-    }
-};
-//# sourceMappingURL=voting-system-consensus.js.map

package/dist/simulation/scenarios/voting-system-consensus.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"voting-system-consensus.js","sourceRoot":"","sources":["../../../simulation/scenarios/voting-system-consensus.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,0CAA0C,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAE,MAAM,2CAA2C,CAAC;AAC7E,OAAO,EAAE,oBAAoB,EAAmB,MAAM,kCAAkC,CAAC;AACzF,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAuB7B,eAAe;IACb,WAAW,EAAE,2FAA2F;IAExG,KAAK,CAAC,GAAG,CAAC,MAAW;QACnB,MAAM,EAAE,SAAS,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,UAAU,GAAG,EAAE,EAAE,cAAc,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC;QAElF,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,uCAAuC,UAAU,YAAY,cAAc,gBAAgB,MAAM,SAAS,CAAC,CAAC;QAC1H,CAAC;QAED,mCAAmC;QACnC,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC;QAE9D,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC;YACpC,KAAK,EAAE,yBAAyB;YAChC,SAAS,EAAE,GAAG;YACd,QAAQ,EAAE,cAAc;SACzB,CAAC,CAAC;QACH,MAAM,QAAQ,CAAC,UAAU,EAAE,CAAC;QAE5B,MAAM,EAAE,GAAG,MAAM,qBAAqB,CACpC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,wBAAwB,CAAC,EACxE,QAAQ,EACR,EAAE,SAAS,EAAE,OAAO,EAAE,CACvB,CAAC;QAEF,MAAM,SAAS,GAAG,IAAI,eAAe,CACnC,EAAE,CAAC,gBAAgB,EAAS,EAC5B,QAAQ,EACR,SAAS,EACT,SAAS,EACT,EAAE,CAAC,gBAAgB,EAAS,CAC7B,CAAC;QAEF,MAAM,OAAO,GAAG;YACd,MAAM,EAAE,CAAC;YACT,UAAU,EAAE,CAAC;YACb,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,EAAc;YAClC,uBAAuB,EAAE,CAAC;YAC1B,kBAAkB,EAAE,CAAC;YACrB,SAAS,EAAE,CAAC;SACb,CAAC;QAEF,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,2CAA2C;QAC3C,MAAM,MAAM,GAAY,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACpE,EAAE,EAAE,SAAS,CAAC,EAAE;YAChB,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU;YAClF,WAAW,EAAE,EAAE;SAChB,CAAC,CAAC,CAAC;QAEJ,oBAAoB;QACpB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAC5C,qCAAqC;YACrC,MAAM,UAAU,GAAgB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChF,EAAE,EAAE,cAAc,KAAK,IAAI,CAAC,EAAE;gBAC9B,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChE,YAAY,EAAE,EAAE;aACjB,CAAC,CAAC,CAAC;YAEJ,mFAAmF;YACnF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;YAE5C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,uCAAuC;gBACvC,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;oBAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CACxB,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAC5C,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAChD,CAAC,CACF,CACF,CAAC;oBACF,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC;gBACjD,CAAC,CAAC,CAAC;gBAEH,yDAAyD;gBACzD,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACpD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YAC7D,CAAC;YAED,iCAAiC;YACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;YACrC,IAAI,MAAM,GAAkB,IAAI,CAAC;YACjC,IAAI,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAE3C,OAAO,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1D,UAAU,CAAC,KAAK,EAAE,CAAC;gBAEnB,kDAAkD;gBAClD,KAAK,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;oBAClD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzD,IAAI,WAAW,EAAE,CAAC;wBAChB,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACtE,CAAC;gBACH,CAAC;gBAED,mCAAmC;gBACnC,MAAM,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAC;gBAChC,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;oBACxD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;wBACrB,MAAM,GAAG,WAAW,CAAC;wBACrB,MAAM;oBACR,CAAC;gBACH,CAAC;gBAED,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,wCAAwC;oBACxC,IAAI,QAAQ,GAAG,QAAQ,CAAC;oBACxB,IAAI,WAAW,GAAG,EAAE,CAAC;oBACrB,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;wBACxD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;4BACrB,QAAQ,GAAG,KAAK,CAAC;4BACjB,WAAW,GAAG,WAAW,CAAC;wBAC5B,CAAC;oBACH,CAAC;oBACD,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;YAED,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC,EAAE,CAAC;YAC3D,CAAC;YAED,kEAAkE;YAClE,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,cAAc,GAAG,WAAW,GAAG,UAAU,CAAC;YAEhD,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAEhD,oEAAoE;YACpE,MAAM,gBAAgB,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAE,CAAC;YAEhE,uCAAuC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAExB,SAAS,CAAC,cAAc,CAAC,KAAK,IAAI,EAAE;oBAClC,OAAO,SAAS,CAAC,YAAY,CAAC;wBAC5B,SAAS,EAAE,SAAS,KAAK,EAAE;wBAC3B,IAAI,EAAE,0BAA0B,KAAK,EAAE;wBACvC,KAAK,EAAE,mBAAmB,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;wBAC1D,MAAM,EAAE,cAAc,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,MAAM,EAAE;wBACrE,MAAM,EAAE,cAAc;wBACtB,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,MAAM;wBAC9C,QAAQ,EAAE,cAAc,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;wBAC5D,QAAQ,EAAE;4BACR,aAAa,EAAE,KAAK,CAAC,cAAc;4BACnC,cAAc,EAAE,gBAAgB,CAAC,QAAQ;4BACzC,WAAW,EAAE,KAAK;yBACnB;qBACF,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;YACL,CAAC;YAED,0BAA0B;YAC1B,MAAM,SAAS,CAAC,YAAY,EAAE,CAAC;YAE/B,kEAAkE;YAClE,MAAM,kBAAkB,GAAG,GAAG,CAAC;YAC/B,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CACxB,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAChD,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EACtD,CAAC,CACF,CACF,CAAC;oBACF,IAAI,QAAQ,GAAG,kBAAkB,EAAE,CAAC;wBAClC,UAAU,EAAE,CAAC;oBACf,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,CAAC,gBAAgB,IAAI,UAAU,CAAC;YAEvC,OAAO,CAAC,MAAM,EAAE,CAAC;YACjB,OAAO,CAAC,UAAU,IAAI,UAAU,CAAC;YAEjC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;gBACnB,OAAO,CAAC,GAAG,CAAC,oBAAoB,KAAK,GAAG,CAAC,YAAY,MAAM,eAAe,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,UAAU,EAAE,CAAC,CAAC;YAC7I,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAClC,OAAO,CAAC,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;QAExC,8BAA8B;QAC9B,MAAM,gBAAgB,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,cAAc,GAAG,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzF,OAAO,CAAC,kBAAkB,GAAG,cAAc,GAAG,gBAAgB,CAAC;QAE/D,EAAE,CAAC,KAAK,EAAE,CAAC;QAEX,2BAA2B;QAC3B,MAAM,gBAAgB,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;QAEhD,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,oBAAoB,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YAClD,OAAO,CAAC,GAAG,CAAC,yBAAyB,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YAC3D,OAAO,CAAC,GAAG,CAAC,+BAA+B,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;YACvE,OAAO,CAAC,GAAG,CAAC,iCAAiC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,kBAAkB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC3M,OAAO,CAAC,GAAG,CAAC,uBAAuB,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACrE,OAAO,CAAC,GAAG,CAAC,yBAAyB,gBAAgB,CAAC,eAAe,aAAa,gBAAgB,CAAC,UAAU,MAAM,CAAC,CAAC;QACvH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF,CAAC"}